Lines Matching refs:r
33 mpi_limb_t n1, n0, r; in mpihelp_mod_1() local
71 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1()
81 UDIV_QRNND_PREINV(dummy, r, r, in mpihelp_mod_1()
87 UDIV_QRNND_PREINV(dummy, r, r, in mpihelp_mod_1()
90 return r >> normalization_steps; in mpihelp_mod_1()
107 r = dividend_ptr[i]; in mpihelp_mod_1()
109 if (r >= divisor_limb) in mpihelp_mod_1()
110 r = 0; in mpihelp_mod_1()
116 UDIV_QRNND_PREINV(dummy, r, r, in mpihelp_mod_1()
119 return r; in mpihelp_mod_1()
130 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1()
140 udiv_qrnnd(dummy, r, r, in mpihelp_mod_1()
146 udiv_qrnnd(dummy, r, r, in mpihelp_mod_1()
149 return r >> normalization_steps; in mpihelp_mod_1()
156 r = dividend_ptr[i]; in mpihelp_mod_1()
158 if (r >= divisor_limb) in mpihelp_mod_1()
159 r = 0; in mpihelp_mod_1()
165 udiv_qrnnd(dummy, r, r, n0, divisor_limb); in mpihelp_mod_1()
167 return r; in mpihelp_mod_1()
249 mpi_limb_t r; in mpihelp_divrem() local
262 r = n0 + d1; in mpihelp_divrem()
263 if (r < d1) { /* Carry in the addition? */ in mpihelp_divrem()
264 add_ssaaaa(n1, n0, r - d0, in mpihelp_divrem()
272 udiv_qrnnd(q, r, n1, n0, d1); in mpihelp_divrem()
278 if (n1 > r || (n1 == r && n0 > n2)) { in mpihelp_divrem()
282 r += d1; in mpihelp_divrem()
283 if (r >= d1) /* If not carry, test Q again. */ in mpihelp_divrem()
288 sub_ddmmss(n1, n0, r, n2, n1, n0); in mpihelp_divrem()
333 mpi_limb_t r; in mpihelp_divrem() local
335 udiv_qrnnd(q, r, n0, np[dsize - 1], dX); in mpihelp_divrem()
338 while (n1 > r in mpihelp_divrem()
339 || (n1 == r in mpihelp_divrem()
342 r += dX; in mpihelp_divrem()
343 if (r < dX) /* I.e. "carry in previous addition?" */ in mpihelp_divrem()
384 mpi_limb_t n1, n0, r; in mpihelp_divmod_1() local
420 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_divmod_1()
430 UDIV_QRNND_PREINV(quot_ptr[i + 1], r, r, in mpihelp_divmod_1()
436 UDIV_QRNND_PREINV(quot_ptr[0], r, r, in mpihelp_divmod_1()
439 return r >> normalization_steps; in mpihelp_divmod_1()
455 r = dividend_ptr[i]; in mpihelp_divmod_1()
457 if (r >= divisor_limb) in mpihelp_divmod_1()
458 r = 0; in mpihelp_divmod_1()
464 UDIV_QRNND_PREINV(quot_ptr[i], r, r, in mpihelp_divmod_1()
467 return r; in mpihelp_divmod_1()
478 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_divmod_1()
488 udiv_qrnnd(quot_ptr[i + 1], r, r, in mpihelp_divmod_1()
494 udiv_qrnnd(quot_ptr[0], r, r, in mpihelp_divmod_1()
497 return r >> normalization_steps; in mpihelp_divmod_1()
504 r = dividend_ptr[i]; in mpihelp_divmod_1()
506 if (r >= divisor_limb) in mpihelp_divmod_1()
507 r = 0; in mpihelp_divmod_1()
513 udiv_qrnnd(quot_ptr[i], r, r, n0, divisor_limb); in mpihelp_divmod_1()
515 return r; in mpihelp_divmod_1()