Searched refs:limbsh (Results 1 – 1 of 1) sorted by relevance
27 uint32_t bitsh = *state1, limbsh = *state2; in biModIterative() local38 limbsh = RSA_LIMBS - 1; in biModIterative()60 if (num[limbsh + i] < tmp[i]) in biModIterative()62 if (num[limbsh + i] > tmp[i]) in biModIterative()69 t += (uint64_t)num[limbsh + i]; in biModIterative()71 num[limbsh + i] = t; in biModIterative()76 for (i = RSA_LIMBS + limbsh + 1; i < RSA_LIMBS * 2; i++) { in biModIterative()85 if (!limbsh) { in biModIterative()93 limbsh--; in biModIterative()108 *state2 = limbsh; in biModIterative()