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