36     int i;  in subM()  local
37     for (i = 0; i < key->len; ++i) {  in subM()
38         A += (uint64_t)a[i] - key->n[i];  in subM()
39         a[i] = (uint32_t)A;  in subM()
47     int i;  in geM()  local
48     for (i = key->len; i;) {  in geM()
49         --i;  in geM()
50         if (a[i] < key->n[i]) return 0;  in geM()
51         if (a[i] > key->n[i]) return 1;  in geM()
64     int i;  in montMulAdd()  local
66     for (i = 1; i < key->len; ++i) {  in montMulAdd()
67         A = (A >> 32) + (uint64_t)a * b[i] + c[i];  in montMulAdd()
68         B = (B >> 32) + (uint64_t)d0 * key->n[i] + (uint32_t)A;  in montMulAdd()
69         c[i - 1] = (uint32_t)B;  in montMulAdd()
74     c[i - 1] = (uint32_t)A;  in montMulAdd()
86     int i;  in montMul()  local
87     for (i = 0; i < key->len; ++i) {  in montMul()
88         c[i] = 0;  in montMul()
90     for (i = 0; i < key->len; ++i) {  in montMul()
91         montMulAdd(key, c, a[i], b);  in montMul()
103     int i;  in modpow()  local
106     for (i = 0; i < key->len; ++i) {  in modpow()
108             (inout[((key->len - 1 - i) * 4) + 0] << 24) |  in modpow()
109             (inout[((key->len - 1 - i) * 4) + 1] << 16) |  in modpow()
110             (inout[((key->len - 1 - i) * 4) + 2] << 8) |  in modpow()
111             (inout[((key->len - 1 - i) * 4) + 3] << 0);  in modpow()
112         a[i] = tmp;  in modpow()
118         for (i = 0; i < 16; i += 2) {  in modpow()
136     for (i = key->len - 1; i >= 0; --i) {  in modpow()
137         uint32_t tmp = aaa[i];  in modpow()
255     int i;  in RSA_verify()  local
275     for (i = 0; i < len; ++i) {  // Copy input to local workspace.  in RSA_verify()
276         buf[i] = signature[i];  in RSA_verify()
282     for (i = len - hash_len; i < len; ++i) {  in RSA_verify()
283         buf[i] ^= *hash++;  in RSA_verify()
301     for (i = 0; i < hash_len; ++i) {  in RSA_verify()
302         if (buf[i] != padding_hash[i]) {  in RSA_verify()