124 ATTRIBUTE_WARN_UNUSED_RET static int _nn_mul_redc1(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p,  in _nn_mul_redc1()  argument
141 	SHOULD_HAVE((!nn_cmp(in2, p, &cmp)) && (cmp < 0), ret, err);  in _nn_mul_redc1()
145 	/* Check which one of in1 or in2 is the biggest */  in _nn_mul_redc1()
146 	a = (in1->wlen <= in2->wlen) ? in2 : in1;  in _nn_mul_redc1()
147 	b = (in1->wlen <= in2->wlen) ? in1 : in2;  in _nn_mul_redc1()
225 ATTRIBUTE_WARN_UNUSED_RET static int _nn_mul_redc1_aliased(nn_t out, nn_src_t in1, nn_src_t in2,  in _nn_mul_redc1_aliased()  argument
232 	ret = _nn_mul_redc1(&out_cpy, in1, in2, p, mpinv); EG(ret, err);  in _nn_mul_redc1_aliased()
246 int nn_mul_redc1(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p,  in nn_mul_redc1()  argument
252 	ret = nn_check_initialized(in2); EG(ret, err);  in nn_mul_redc1()
256 	if ((out == in1) || (out == in2) || (out == p)) {  in nn_mul_redc1()
257 		ret = _nn_mul_redc1_aliased(out, in1, in2, p, mpinv);  in nn_mul_redc1()
259 		ret = _nn_mul_redc1(out, in1, in2, p, mpinv);  in nn_mul_redc1()
267  * Compute in1 * in2 mod p where in1 and in2 are numbers < p.
268  * When p is an odd number, the function redcifies in1 and in2
276  *   nn_mul(&tmp2, in1, in2);
286 int nn_mod_mul(nn_t out, nn_src_t in1, nn_src_t in2, nn_src_t p_in)  in nn_mod_mul()  argument
298 		ret = nn_mul(out, in1, in2); EG(ret, err);  in nn_mod_mul()
320 		/* redcify in1 and in2 */  in nn_mod_mul()
322 		ret = nn_mul_redc1(&in2_tmp, in2, &r_square, &p, mpinv); EG(ret, err);  in nn_mod_mul()
324 		/* Compute in1 * in2 mod p in montgomery world.  in nn_mod_mul()