21 #define MPN_MUL_N_RECURSE(prodp, up, vp, size, tspace)		\  argument
24 			mul_n_basecase(prodp, up, vp, size);	\
26 			mul_n(prodp, up, vp, size, tspace);	\
37 /* Multiply the natural numbers u (pointed to by UP) and v (pointed to by VP),
42  * 1. PRODP != UP and PRODP != VP, i.e. the destination
55 mul_n_basecase(mpi_ptr_t prodp, mpi_ptr_t up, mpi_ptr_t vp, mpi_size_t size)  in mul_n_basecase()  argument
63 	v_limb = vp[0];  in mul_n_basecase()
79 		v_limb = vp[i];  in mul_n_basecase()
95 mul_n(mpi_ptr_t prodp, mpi_ptr_t up, mpi_ptr_t vp,  in mul_n()  argument
112 		MPN_MUL_N_RECURSE(prodp, up, vp, esize, tspace);  in mul_n()
113 		cy_limb = mpihelp_addmul_1(prodp + esize, up, esize, vp[esize]);  in mul_n()
115 		cy_limb = mpihelp_addmul_1(prodp + esize, vp, size, up[esize]);  in mul_n()
142 		MPN_MUL_N_RECURSE(prodp + size, up + hsize, vp + hsize, hsize,  in mul_n()
155 		if (mpihelp_cmp(vp + hsize, vp, hsize) >= 0) {  in mul_n()
156 			mpihelp_sub_n(prodp + hsize, vp + hsize, vp, hsize);  in mul_n()
159 			mpihelp_sub_n(prodp + hsize, vp, vp + hsize, hsize);  in mul_n()
190 		MPN_MUL_N_RECURSE(tspace, up, vp, hsize, tspace + size);  in mul_n()
323 			   mpi_ptr_t vp, mpi_size_t vsize,  in mpihelp_mul_karatsuba_case()  argument
337 	MPN_MUL_N_RECURSE(prodp, up, vp, vsize, ctx->tspace);  in mpihelp_mul_karatsuba_case()
357 			MPN_MUL_N_RECURSE(ctx->tp, up, vp, vsize, ctx->tspace);  in mpihelp_mul_karatsuba_case()
370 			if (mpihelp_mul(ctx->tspace, vp, vsize, up, usize, &tmp)  in mpihelp_mul_karatsuba_case()
380 						       vp, vsize,  in mpihelp_mul_karatsuba_case()
412  * and v (pointed to by VP, with VSIZE limbs), and store the result at
422  * 2. PRODP != UP and PRODP != VP, i.e. the destination
428 	    mpi_ptr_t vp, mpi_size_t vsize, mpi_limb_t *_result)  in mpihelp_mul()  argument
445 		v_limb = vp[0];  in mpihelp_mul()
461 			v_limb = vp[i];  in mpihelp_mul()
479 	if (mpihelp_mul_karatsuba_case(prodp, up, usize, vp, vsize, &ctx) < 0)  in mpihelp_mul()