Lines Matching refs:nodeh
199 unsigned int nodeh; in treehash_setup() local
221 nodeh = stacklevels[stackoffset-1]; in treehash_setup()
222 if (i >> nodeh == 1) { in treehash_setup()
223 memcpy(state->auth + nodeh*n, stack+(stackoffset-1)*n, n); in treehash_setup()
226 if (nodeh < h - k && i >> nodeh == 3) { in treehash_setup()
227 memcpy(state->treehash[nodeh].node, stack+(stackoffset-1)*n, n); in treehash_setup()
229 else if (nodeh >= h - k) { in treehash_setup()
230 …memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((i >> nodeh) - 3) >> 1)) * n, stack… in treehash_setup()
390 int nodeh; in bds_state_update() local
416 nodeh = state->stacklevels[state->stackoffset-1]; in bds_state_update()
417 if (idx >> nodeh == 1) { in bds_state_update()
418 memcpy(state->auth + nodeh*n, state->stack+(state->stackoffset-1)*n, n); in bds_state_update()
421 if (nodeh < h - k && idx >> nodeh == 3) { in bds_state_update()
422 memcpy(state->treehash[nodeh].node, state->stack+(state->stackoffset-1)*n, n); in bds_state_update()
424 else if (nodeh >= h - k) { in bds_state_update()
425 …memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((idx >> nodeh) - 3) >> 1)) * n, sta… in bds_state_update()