Lines Matching refs:nodeh
201 unsigned int nodeh; in treehash_setup() local
223 nodeh = stacklevels[stackoffset-1]; in treehash_setup()
224 if (i >> nodeh == 1) { in treehash_setup()
225 memcpy(state->auth + nodeh*n, stack+(stackoffset-1)*n, n); in treehash_setup()
228 if (nodeh < h - k && i >> nodeh == 3) { in treehash_setup()
229 memcpy(state->treehash[nodeh].node, stack+(stackoffset-1)*n, n); in treehash_setup()
231 else if (nodeh >= h - k) { in treehash_setup()
232 …memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((i >> nodeh) - 3) >> 1)) * n, stack… in treehash_setup()
392 int nodeh; in bds_state_update() local
418 nodeh = state->stacklevels[state->stackoffset-1]; in bds_state_update()
419 if (idx >> nodeh == 1) { in bds_state_update()
420 memcpy(state->auth + nodeh*n, state->stack+(state->stackoffset-1)*n, n); in bds_state_update()
423 if (nodeh < h - k && idx >> nodeh == 3) { in bds_state_update()
424 memcpy(state->treehash[nodeh].node, state->stack+(state->stackoffset-1)*n, n); in bds_state_update()
426 else if (nodeh >= h - k) { in bds_state_update()
427 …memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((idx >> nodeh) - 3) >> 1)) * n, sta… in bds_state_update()