33 	mpi_limb_t n1, n0, r;  in mpihelp_mod_1()  local
70 			n1 = dividend_ptr[dividend_size - 1];  in mpihelp_mod_1()
71 			r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);  in mpihelp_mod_1()
75 			 * && divisor_limb > ((n1 << normalization_steps)  in mpihelp_mod_1()
82 						((n1 << normalization_steps)  in mpihelp_mod_1()
85 				n1 = n0;  in mpihelp_mod_1()
88 					n1 << normalization_steps,  in mpihelp_mod_1()
129 				n1 = dividend_ptr[dividend_size - 1];  in mpihelp_mod_1()
130 				r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);  in mpihelp_mod_1()
134 				 * && divisor_limb > ((n1 << normalization_steps)  in mpihelp_mod_1()
141 						((n1 << normalization_steps)  in mpihelp_mod_1()
144 					n1 = n0;  in mpihelp_mod_1()
147 						n1 << normalization_steps,  in mpihelp_mod_1()
207 			mpi_limb_t n1;  in mpihelp_divrem()  local
211 			n1 = np[nsize - 1];  in mpihelp_divrem()
213 			if (n1 >= d) {  in mpihelp_divrem()
214 				n1 -= d;  in mpihelp_divrem()
220 				udiv_qrnnd(qp[i], n1, n1, np[i], d);  in mpihelp_divrem()
224 				udiv_qrnnd(qp[i], n1, n1, 0, d);  in mpihelp_divrem()
226 			np[0] = n1;  in mpihelp_divrem()
233 			mpi_limb_t n1, n0, n2;  in mpihelp_divrem()  local
239 			n1 = np[1];  in mpihelp_divrem()
242 			if (n1 >= d1 && (n1 > d1 || n0 >= d0)) {  in mpihelp_divrem()
243 				sub_ddmmss(n1, n0, n1, n0, d1, d0);  in mpihelp_divrem()
256 				if (n1 == d1) {  in mpihelp_divrem()
264 						add_ssaaaa(n1, n0, r - d0,  in mpihelp_divrem()
269 					n1 = d0 - (d0 != 0 ? 1 : 0);  in mpihelp_divrem()
272 					udiv_qrnnd(q, r, n1, n0, d1);  in mpihelp_divrem()
273 					umul_ppmm(n1, n0, d0, q);  in mpihelp_divrem()
278 				if (n1 > r || (n1 == r && n0 > n2)) {  in mpihelp_divrem()
281 					sub_ddmmss(n1, n0, n1, n0, 0, d0);  in mpihelp_divrem()
288 				sub_ddmmss(n1, n0, r, n2, n1, n0);  in mpihelp_divrem()
290 			np[1] = n1;  in mpihelp_divrem()
316 				mpi_limb_t n1, n2;  in mpihelp_divrem()  local
336 					umul_ppmm(n1, n0, d1, q);  in mpihelp_divrem()
338 					while (n1 > r  in mpihelp_divrem()
339 					       || (n1 == r  in mpihelp_divrem()
345 						n1 -= n0 < d1;  in mpihelp_divrem()
350 				/* Possible optimization: We already have (q * n0) and (1 * n1)  in mpihelp_divrem()
384 	mpi_limb_t n1, n0, r;  in mpihelp_divmod_1()  local
419 			n1 = dividend_ptr[dividend_size - 1];  in mpihelp_divmod_1()
420 			r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);  in mpihelp_divmod_1()
424 			 * && divisor_limb > ((n1 << normalization_steps)  in mpihelp_divmod_1()
431 						((n1 << normalization_steps)  in mpihelp_divmod_1()
434 				n1 = n0;  in mpihelp_divmod_1()
437 					n1 << normalization_steps,  in mpihelp_divmod_1()
477 				n1 = dividend_ptr[dividend_size - 1];  in mpihelp_divmod_1()
478 				r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps);  in mpihelp_divmod_1()
482 				 * && divisor_limb > ((n1 << normalization_steps)  in mpihelp_divmod_1()
489 						((n1 << normalization_steps)  in mpihelp_divmod_1()
492 					n1 = n0;  in mpihelp_divmod_1()
495 						n1 << normalization_steps,  in mpihelp_divmod_1()