crypto/mpi/mpih-div.c

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