34     int i;  in subM()  local
35     for (i = 0; i < key->len; ++i) {  in subM()
36         A += (uint64_t)a[i] - key->n[i];  in subM()
37         a[i] = (uint32_t)A;  in subM()
44     int i;  in geM()  local
45     for (i = key->len; i;) {  in geM()
46         --i;  in geM()
47         if (a[i] < key->n[i]) return 0;  in geM()
48         if (a[i] > key->n[i]) return 1;  in geM()
61     int i;  in montMulAdd()  local
63     for (i = 1; i < key->len; ++i) {  in montMulAdd()
64         A = (A >> 32) + (uint64_t)a * b[i] + c[i];  in montMulAdd()
65         B = (B >> 32) + (uint64_t)d0 * key->n[i] + (uint32_t)A;  in montMulAdd()
66         c[i - 1] = (uint32_t)B;  in montMulAdd()
71     c[i - 1] = (uint32_t)A;  in montMulAdd()
83     int i;  in montMul()  local
84     for (i = 0; i < key->len; ++i) {  in montMul()
85         c[i] = 0;  in montMul()
87     for (i = 0; i < key->len; ++i) {  in montMul()
88         montMulAdd(key, c, a[i], b);  in montMul()
101     int i;  in modpow3()  local
104     for (i = 0; i < key->len; ++i) {  in modpow3()
106             (inout[((key->len - 1 - i) * 4) + 0] << 24) |  in modpow3()
107             (inout[((key->len - 1 - i) * 4) + 1] << 16) |  in modpow3()
108             (inout[((key->len - 1 - i) * 4) + 2] << 8) |  in modpow3()
109             (inout[((key->len - 1 - i) * 4) + 3] << 0);  in modpow3()
110         a[i] = tmp;  in modpow3()
123     for (i = key->len - 1; i >= 0; --i) {  in modpow3()
124         uint32_t tmp = aaa[i];  in modpow3()
167     int i;  in RSA_verify()  local
177     for (i = 0; i < len; ++i) {  in RSA_verify()
178         buf[i] = signature[i];  in RSA_verify()
184     for (i = 0; i < (int) sizeof(padding); ++i) {  in RSA_verify()
185         if (buf[i] != padding[i]) {  in RSA_verify()
191     for (; i < len; ++i) {  in RSA_verify()
192         if (buf[i] != *sha++) {  in RSA_verify()