72 void xmss_set_bds_state(bds_state *state, unsigned char *stack, int stackoffset, unsigned char *sta…  in xmss_set_bds_state()  argument
75   state->stackoffset = stackoffset;  in xmss_set_bds_state()
166     if (state->stacklevels[state->stackoffset - i - 1] < r) {  in treehash_minheight_on_stack()
167       r = state->stacklevels[state->stackoffset - i - 1];  in treehash_minheight_on_stack()
200   unsigned int stackoffset=0;  in treehash_setup()  local
215     gen_leaf_wots(stack+stackoffset*n, sk_seed, params, pub_seed, ltree_addr, ots_addr);  in treehash_setup()
216     stacklevels[stackoffset] = 0;  in treehash_setup()
217     stackoffset++;  in treehash_setup()
219       memcpy(state->treehash[0].node, stack+stackoffset*n, n);  in treehash_setup()
221     while (stackoffset>1 && stacklevels[stackoffset-1] == stacklevels[stackoffset-2])  in treehash_setup()
223       nodeh = stacklevels[stackoffset-1];  in treehash_setup()
225         memcpy(state->auth + nodeh*n, stack+(stackoffset-1)*n, n);  in treehash_setup()
229           memcpy(state->treehash[nodeh].node, stack+(stackoffset-1)*n, n);  in treehash_setup()
232 … ((1 << (h - 1 - nodeh)) + nodeh - h + (((i >> nodeh) - 3) >> 1)) * n, stack+(stackoffset-1)*n, n);  in treehash_setup()
235       setTreeHeight(node_addr, stacklevels[stackoffset-1]);  in treehash_setup()
236       setTreeIndex(node_addr, (idx >> (stacklevels[stackoffset-1]+1)));  in treehash_setup()
237       hash_h(stack+(stackoffset-2)*n, stack+(stackoffset-2)*n, pub_seed,  in treehash_setup()
239       stacklevels[stackoffset-2]++;  in treehash_setup()
240       stackoffset--;  in treehash_setup()
270   while (treehash->stackusage > 0 && state->stacklevels[state->stackoffset-1] == nodeheight) {  in treehash_update()
272     memcpy(nodebuffer, state->stack + (state->stackoffset-1)*n, n);  in treehash_update()
278     state->stackoffset--;  in treehash_update()
285     memcpy(state->stack + state->stackoffset*n, nodebuffer, n);  in treehash_update()
287     state->stacklevels[state->stackoffset] = nodeheight;  in treehash_update()
288     state->stackoffset++;  in treehash_update()
410   gen_leaf_wots(state->stack+state->stackoffset*n, sk_seed, params, pub_seed, ltree_addr, ots_addr);  in bds_state_update()
412   state->stacklevels[state->stackoffset] = 0;  in bds_state_update()
413   state->stackoffset++;  in bds_state_update()
415     memcpy(state->treehash[0].node, state->stack+state->stackoffset*n, n);  in bds_state_update()
417 …while (state->stackoffset>1 && state->stacklevels[state->stackoffset-1] == state->stacklevels[stat…  in bds_state_update()
418     nodeh = state->stacklevels[state->stackoffset-1];  in bds_state_update()
420       memcpy(state->auth + nodeh*n, state->stack+(state->stackoffset-1)*n, n);  in bds_state_update()
424         memcpy(state->treehash[nodeh].node, state->stack+(state->stackoffset-1)*n, n);  in bds_state_update()
427 … nodeh)) + nodeh - h + (((idx >> nodeh) - 3) >> 1)) * n, state->stack+(state->stackoffset-1)*n, n);  in bds_state_update()
430     setTreeHeight(node_addr, state->stacklevels[state->stackoffset-1]);  in bds_state_update()
431     setTreeIndex(node_addr, (idx >> (state->stacklevels[state->stackoffset-1]+1)));  in bds_state_update()
432 …hash_h(state->stack+(state->stackoffset-2)*n, state->stack+(state->stackoffset-2)*n, pub_seed, nod…  in bds_state_update()
434     state->stacklevels[state->stackoffset-2]++;  in bds_state_update()
435     state->stackoffset--;  in bds_state_update()
947       states[params->d + i].stackoffset = 0;  in xmssmt_sign()