Lines Matching refs:i
30 int32_t i; in biModIterative() local
45 for (i = RSA_LIMBS; i > 0; i--) { in biModIterative()
46 tmp[i] <<= 1; in biModIterative()
47 if (tmp[i - 1] & 0x80000000) in biModIterative()
48 tmp[i]++; in biModIterative()
59 for (i = RSA_LIMBS; i >= 0; i--) { in biModIterative()
60 if (num[limbsh + i] < tmp[i]) in biModIterative()
62 if (num[limbsh + i] > tmp[i]) in biModIterative()
68 for (i = 0; i <= RSA_LIMBS; i++) { in biModIterative()
69 t += (uint64_t)num[limbsh + i]; in biModIterative()
70 t -= (uint64_t)tmp[i]; in biModIterative()
71 num[limbsh + i] = t; in biModIterative()
76 for (i = RSA_LIMBS + limbsh + 1; i < RSA_LIMBS * 2; i++) { in biModIterative()
77 t += (uint64_t)num[i]; in biModIterative()
78 num[i] = t; in biModIterative()
96 for (i = 0; i < RSA_LIMBS; i++) { in biModIterative()
97 tmp[i] >>= 1; in biModIterative()
98 if (tmp[i + 1] & 1) in biModIterative()
99 tmp[i] += 0x80000000; in biModIterative()
101 tmp[i] >>= 1; in biModIterative()
246 uint32_t i; in rsaPrivOp() local
253 for (i = 0; i < RSA_LEN; i++) { in rsaPrivOp()
255 if (b[i / 32] & (1 << (i % 32))) { in rsaPrivOp()