Lines Matching defs:n0
33 mpi_limb_t n1, n0, r;
80 n0 = dividend_ptr[i];
83 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
85 n1 = n0;
115 n0 = dividend_ptr[i];
117 n0, divisor_limb, divisor_limb_inverted);
139 n0 = dividend_ptr[i];
142 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
144 n1 = n0;
164 n0 = dividend_ptr[i];
165 udiv_qrnnd(dummy, r, r, n0, divisor_limb);
233 mpi_limb_t n1, n0, n2;
240 n0 = np[0];
242 if (n1 >= d1 && (n1 > d1 || n0 >= d0)) {
243 sub_ddmmss(n1, n0, n1, n0, d1, d0);
262 r = n0 + d1;
264 add_ssaaaa(n1, n0, r - d0,
270 n0 = -d0;
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);
291 np[0] = n0;
298 mpi_limb_t dX, d1, n0;
303 n0 = np[dsize - 1];
305 if (n0 >= dX) {
306 if (n0 > dX
309 n0 = np[dsize - 1];
328 if (n0 == dX) {
335 udiv_qrnnd(q, r, n0, np[dsize - 1], dX);
336 umul_ppmm(n1, n0, d1, q);
340 && n0 > np[dsize - 2])) {
345 n1 -= n0 < d1;
346 n0 -= d1;
350 /* Possible optimization: We already have (q * n0) and (1 * n1)
361 n0 = np[dsize - 1];
384 mpi_limb_t n1, n0, r;
429 n0 = dividend_ptr[i];
432 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
434 n1 = n0;
463 n0 = dividend_ptr[i];
465 n0, divisor_limb, divisor_limb_inverted);
487 n0 = dividend_ptr[i];
490 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
492 n1 = n0;
512 n0 = dividend_ptr[i];
513 udiv_qrnnd(quot_ptr[i], r, r, n0, divisor_limb);