23 …32_t *num, const uint32_t *denum, uint32_t *tmp, uint32_t *state1, uint32_t *state2, uint32_t step)  in biModIterative()  argument
33     if (!step) {  in biModIterative()
43     if (step == 1) {  in biModIterative()
112 static void biMulIterative(uint32_t *ret, const uint32_t *a, const uint32_t *b, uint32_t step) //re…  in biMulIterative()  argument
118     if (!step)  in biMulIterative()
124         r = (uint64_t)a[step] * b[j] + c + ret[step + j];  in biMulIterative()
125         ret[step + j] = r;  in biMulIterative()
130     for (j = step + RSA_LIMBS; j < RSA_LIMBS * 2; j++) {  in biMulIterative()
170     uint32_t step = *stepP, gigastep, gigastepBase, gigastepSubstep, megaSubstep;  in rsaPubOpIterative()  local
173     if (!step) {  in rsaPubOpIterative()
175         step = 1;  in rsaPubOpIterative()
180         gigastep = (step - 1) / (RSA_LEN * 4);  in rsaPubOpIterative()
181         gigastepSubstep = (step - 1) % (RSA_LEN * 4);  in rsaPubOpIterative()
188                 step = gigastepBase + RSA_LEN + 1;  in rsaPubOpIterative()
190                 step++;  in rsaPubOpIterative()
195                     step = 0;  in rsaPubOpIterative()
197                     step = gigastepBase + RSA_LEN * 4 - 1 + 1;  in rsaPubOpIterative()
200                 step++;  in rsaPubOpIterative()
204             step++;  in rsaPubOpIterative()
208     *stepP = step;  in rsaPubOpIterative()
217     uint32_t state1 = 0, state2 = 0, step = 0, ns = 0;  in rsaPubOp()  local
220         ret = rsaPubOpIterative(state, a, c, &state1, &state2, &step);  in rsaPubOp()
222     } while(step);  in rsaPubOp()
231     uint32_t state1 = 0, state2 = 0, step;  in biMod()  local
233     for (step = 0; !biModIterative(num, denum, tmp, &state1, &state2, step); step++);  in biMod()
238     uint32_t step;  in biMul()  local
240     for (step = 0; step < RSA_LIMBS; step++)  in biMul()
241         biMulIterative(ret, a, b, step);  in biMul()