115   uint32_t i = 0;  in l_tree()  local
124      for (i = 0; i < bound; i++) {  in l_tree()
126        setTreeIndex(addr, i);  in l_tree()
128        hash_h(wots_pk+i*n, wots_pk+i*2*n, pub_seed, addr, n);  in l_tree()
164   unsigned int r = params->h, i;  in treehash_minheight_on_stack()  local
165   for (i = 0; i < treehash->stackusage; i++) {  in treehash_minheight_on_stack()
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()
197   uint32_t lastnode, i;  in treehash_setup()  local
205   for (i = 0; i < h-k; i++) {  in treehash_setup()
206     state->treehash[i].h = i;  in treehash_setup()
207     state->treehash[i].completed = 1;  in treehash_setup()
208     state->treehash[i].stackusage = 0;  in treehash_setup()
211   i = 0;  in treehash_setup()
218     if (h - k > 0 && i == 3) {  in treehash_setup()
224       if (i >> nodeh == 1) {  in treehash_setup()
228         if (nodeh < h - k && i >> nodeh == 3) {  in treehash_setup()
232 …memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((i >> nodeh) - 3) >> 1)) * n, stack…  in treehash_setup()
242     i++;  in treehash_setup()
245   for (i = 0; i < n; i++)  in treehash_setup()
246     node[i] = stack[i];  in treehash_setup()
300   uint32_t i, j;  in validate_authpath()  local
319   for (i=0; i < params->h-1; i++) {  in validate_authpath()
320     setTreeHeight(addr, i);  in validate_authpath()
346   uint32_t i, j;  in bds_treehash_update()  local
355     for (i = 0; i < h - k; i++) {  in bds_treehash_update()
356       if (state->treehash[i].completed) {  in bds_treehash_update()
359       else if (state->treehash[i].stackusage == 0) {  in bds_treehash_update()
360         low = i;  in bds_treehash_update()
363         low = treehash_minheight_on_stack(state, params, &(state->treehash[i]));  in bds_treehash_update()
366         level = i;  in bds_treehash_update()
448   unsigned int i;  in bds_round()  local
470   for (i = 0; i < h; i++) {  in bds_round()
471     if (! ((leaf_idx >> i) & 1)) {  in bds_round()
472       tau = i;  in bds_round()
494     for (i = 0; i < tau; i++) {  in bds_round()
495       if (i < h - k) {  in bds_round()
496         memcpy(state->auth + i * n, state->treehash[i].node, n);  in bds_round()
499         offset = (1 << (h - 1 - i)) + i - h;  in bds_round()
500         rowidx = ((leaf_idx >> i) - 1) >> 1;  in bds_round()
501         memcpy(state->auth + i * n, state->retain + (offset + rowidx) * n, n);  in bds_round()
505     for (i = 0; i < ((tau < h - k) ? tau : (h - k)); i++) {  in bds_round()
506       startidx = leaf_idx + 1 + 3 * (1 << i);  in bds_round()
508         state->treehash[i].h = i;  in bds_round()
509         state->treehash[i].next_idx = startidx;  in bds_round()
510         state->treehash[i].completed = 0;  in bds_round()
511         state->treehash[i].stackusage = 0;  in bds_round()
556   uint16_t i = 0;  in xmss_sign()  local
614   for (i = 0; i < n; i++)  in xmss_sign()
615     sig_msg[i] = R[i];  in xmss_sign()
667   unsigned long long i, m_len;  in xmss_sign_open()  local
726   for (i = 0; i < n; i++)  in xmss_sign_open()
727     if (root[i] != pk[i])  in xmss_sign_open()
731   for (i = 0; i < *msglen; i++)  in xmss_sign_open()
732     msg[i] = sig_msg[i];  in xmss_sign_open()
739   for (i = 0; i < *msglen; i++)  in xmss_sign_open()
740     msg[i] = 0;  in xmss_sign_open()
753   unsigned int i;  in xmssmt_keypair()  local
756   for (i = 0; i < params->index_len; i++) {  in xmssmt_keypair()
757     sk[i] = 0;  in xmssmt_keypair()
768   for (i = 0; i < params->d - 1; i++) {  in xmssmt_keypair()
770 …treehash_setup(pk, params->xmss_par.h, 0, states + i, sk+params->index_len, &(params->xmss_par), p…  in xmssmt_keypair()
771     setLayerADRS(addr, (i+1));  in xmssmt_keypair()
773 …wots_sign(wots_sigs + i*params->xmss_par.wots_par.keysize, pk, ots_seed, &(params->xmss_par.wots_p…  in xmssmt_keypair()
775 …treehash_setup(pk, params->xmss_par.h, 0, states + i, sk+params->index_len, &(params->xmss_par), p…  in xmssmt_keypair()
797   uint64_t i, j;  in xmssmt_sign()  local
816   for (i = 0; i < idx_len; i++) {  in xmssmt_sign()
817     idx |= ((unsigned long long)sk[i]) << 8*(idx_len - 1 - i);  in xmssmt_sign()
825   for (i = 0; i < idx_len; i++) {  in xmssmt_sign()
826     sk[i] = ((idx + 1) >> 8*(idx_len - 1 - i)) & 255;  in xmssmt_sign()
852   for (i = 0; i < idx_len; i++) {  in xmssmt_sign()
853     sig_msg[i] = (idx >> 8*(idx_len - 1 - i)) & 255;  in xmssmt_sign()
860   for (i = 0; i < n; i++)  in xmssmt_sign()
861     sig_msg[i] = R[i];  in xmssmt_sign()
894   for (i = 1; i < params->d; i++) {  in xmssmt_sign()
896 …memcpy(sig_msg, wots_sigs + (i-1)*params->xmss_par.wots_par.keysize, params->xmss_par.wots_par.key…  in xmssmt_sign()
902     memcpy(sig_msg, states[i].auth, tree_h*n);  in xmssmt_sign()
915   for (i = 0; i < params->d; i++) {  in xmssmt_sign()
917     if (! (((idx + 1) & ((1ULL << ((i+1)*tree_h)) - 1)) == 0)) {  in xmssmt_sign()
918       idx_leaf = (idx >> (tree_h * i)) & ((1 << tree_h)-1);  in xmssmt_sign()
919       idx_tree = (idx >> (tree_h * (i+1)));  in xmssmt_sign()
920       setLayerADRS(addr, i);  in xmssmt_sign()
922       if (i == (unsigned int) (needswap_upto + 1)) {  in xmssmt_sign()
923         bds_round(&states[i], idx_leaf, sk_seed, &(params->xmss_par), pub_seed, addr);  in xmssmt_sign()
925 …  updates = bds_treehash_update(&states[i], updates, sk_seed, &(params->xmss_par), pub_seed, addr);  in xmssmt_sign()
928       if ((1 + idx_tree) * (1 << tree_h) + idx_leaf < (1ULL << (h - tree_h * i))) {  in xmssmt_sign()
929         if (i > 0 && updates > 0 && states[params->d + i].next_leaf < (1ULL << h)) {  in xmssmt_sign()
930           bds_state_update(&states[params->d + i], sk_seed, &(params->xmss_par), pub_seed, addr);  in xmssmt_sign()
936       memcpy(&tmp, states+params->d + i, sizeof(bds_state));  in xmssmt_sign()
937       memcpy(states+params->d + i, states + i, sizeof(bds_state));  in xmssmt_sign()
938       memcpy(states + i, &tmp, sizeof(bds_state));  in xmssmt_sign()
940       setLayerADRS(ots_addr, (i+1));  in xmssmt_sign()
941       setTreeADRS(ots_addr, ((idx + 1) >> ((i+2) * tree_h)));  in xmssmt_sign()
942       setOTSADRS(ots_addr, (((idx >> ((i+1) * tree_h)) + 1) & ((1 << tree_h)-1)));  in xmssmt_sign()
945 …wots_sign(wots_sigs + i*params->xmss_par.wots_par.keysize, states[i].stack, ots_seed, &(params->xm…  in xmssmt_sign()
947       states[params->d + i].stackoffset = 0;  in xmssmt_sign()
948       states[params->d + i].next_leaf = 0;  in xmssmt_sign()
951       needswap_upto = i;  in xmssmt_sign()
953         states[i].treehash[j].completed = 1;  in xmssmt_sign()
979   unsigned long long i, m_len;  in xmssmt_sign_open()  local
996   for (i = 0; i < idx_len; i++) {  in xmssmt_sign_open()
997     idx |= ((unsigned long long)sig_msg[i]) << (8*(idx_len - 1 - i));  in xmssmt_sign_open()
1053   for (i = 1; i < params->d; i++) {  in xmssmt_sign_open()
1058     setLayerADRS(ots_addr, i);  in xmssmt_sign_open()
1088   for (i = 0; i < n; i++)  in xmssmt_sign_open()
1089     if (root[i] != pk[i])  in xmssmt_sign_open()
1093   for (i = 0; i < *msglen; i++)  in xmssmt_sign_open()
1094     msg[i] = sig_msg[i];  in xmssmt_sign_open()
1101   for (i = 0; i < *msglen; i++)  in xmssmt_sign_open()
1102     msg[i] = 0;  in xmssmt_sign_open()