42 	for (i = 0; i < key->len; i++) {  in subtract_modulus()
61 	for (i = (int)key->len - 1; i >= 0; i--) {  in greater_equal_modulus()
91 	for (i = 1; i < key->len; i++) {  in montgomery_mul_add_step()
121 	for (i = 0; i < key->len; ++i)  in montgomery_mul()
123 	for (i = 0; i < key->len; ++i)  in montgomery_mul()
182 	if (key->len > RSA_MAX_KEY_BITS / 32) {  in pow_mod()
183 		debug("RSA key words %u exceeds maximum %d\n", key->len,  in pow_mod()
188 	uint32_t val[key->len], acc[key->len], tmp[key->len];  in pow_mod()
189 	uint32_t a_scaled[key->len];  in pow_mod()
193 	for (i = 0, ptr = inout + key->len - 1; i < key->len; i++, ptr--)  in pow_mod()
213 	memcpy(a_scaled, acc, key->len * sizeof(a_scaled[0]));  in pow_mod()
223 			memcpy(acc, tmp, key->len * sizeof(acc[0]));  in pow_mod()
230 	memcpy(result, acc, key->len * sizeof(result[0]));  in pow_mod()
237 	for (i = key->len - 1, ptr = inout; (int)i >= 0; i--, ptr++)  in pow_mod()
242 static void rsa_convert_big_endian(uint32_t *dst, const uint32_t *src, int len)  in rsa_convert_big_endian()  argument
246 	for (i = 0; i < len; i++)  in rsa_convert_big_endian()
247 		dst[i] = fdt32_to_cpu(src[len - 1 - i]);  in rsa_convert_big_endian()
266 	key.len = prop->num_bits;  in rsa_mod_exp_sw()
282 	if (!key.len || !prop->modulus || !prop->rr) {  in rsa_mod_exp_sw()
288 	if (key.len > RSA_MAX_KEY_BITS || key.len < RSA_MIN_KEY_BITS) {  in rsa_mod_exp_sw()
290 		      key.len, RSA_MIN_KEY_BITS, RSA_MAX_KEY_BITS);  in rsa_mod_exp_sw()
293 	key.len /= sizeof(uint32_t) * 8;  in rsa_mod_exp_sw()
294 	uint32_t key1[key.len], key2[key.len];  in rsa_mod_exp_sw()
298 	rsa_convert_big_endian(key.modulus, (uint32_t *)prop->modulus, key.len);  in rsa_mod_exp_sw()
299 	rsa_convert_big_endian(key.rr, (uint32_t *)prop->rr, key.len);  in rsa_mod_exp_sw()