Lines Matching defs:n0
50 mpi_limb_t n1, n0, r;
97 n0 = dividend_ptr[i];
100 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
102 n1 = n0;
133 n0 = dividend_ptr[i];
135 n0, divisor_limb, divisor_limb_inverted);
158 n0 = dividend_ptr[i];
161 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
163 n1 = n0;
182 n0 = dividend_ptr[i];
183 udiv_qrnnd (dummy, r, r, n0, divisor_limb);
248 mpi_limb_t n1, n0, n2;
255 n0 = np[0];
257 if( n1 >= d1 && (n1 > d1 || n0 >= d0) ) {
258 sub_ddmmss (n1, n0, n1, n0, d1, d0);
277 r = n0 + d1;
279 add_ssaaaa( n1, n0, r - d0, np[0], 0, d0 );
284 n0 = -d0;
287 udiv_qrnnd (q, r, n1, n0, d1);
288 umul_ppmm (n1, n0, d0, q);
293 if( n1 > r || (n1 == r && n0 > n2) ) {
296 sub_ddmmss (n1, n0, n1, n0, 0, d0);
303 sub_ddmmss (n1, n0, r, n2, n1, n0);
306 np[0] = n0;
313 mpi_limb_t dX, d1, n0;
318 n0 = np[dsize - 1];
320 if( n0 >= dX ) {
321 if(n0 > dX || _gcry_mpih_cmp(np, dp, dsize - 1) >= 0 ) {
323 n0 = np[dsize - 1];
343 if( n0 == dX ) {
351 udiv_qrnnd(q, r, n0, np[dsize - 1], dX);
352 umul_ppmm(n1, n0, d1, q);
354 while( n1 > r || (n1 == r && n0 > np[dsize - 2])) {
359 n1 -= n0 < d1;
360 n0 -= d1;
364 /* Possible optimization: We already have (q * n0) and (1 * n1)
375 n0 = np[dsize - 1];
399 mpi_limb_t n1, n0, r;
444 n0 = dividend_ptr[i];
447 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
449 n1 = n0;
479 n0 = dividend_ptr[i];
481 n0, divisor_limb, divisor_limb_inverted);
504 n0 = dividend_ptr[i];
507 | (n0 >> (BITS_PER_MPI_LIMB - normalization_steps))),
509 n1 = n0;
528 n0 = dividend_ptr[i];
529 udiv_qrnnd( quot_ptr[i], r, r, n0, divisor_limb );