Lines Matching refs:r
287 # define udiv_qrnnd(q, r, n1, n0, d) \ argument
305 (r) = __r0; \
376 #define submod(r,a,b,n) \ argument
379 (r) = ((n) & _t) + (a) - (b); \
382 #define addmod(r,a,b,n) \ argument
383 submod ((r), (a), ((n) - (b)), (n))
940 #define redcify(r_prim, r, n) \ argument
943 udiv_qrnnd (_redcify_q, r_prim, r, 0, n); \
1235 for (idx_t r = 0; r < PRIMES_PTAB_ENTRIES; r++) in prime_p() local
1249 is_prime = (r == MR_REPS - 1); in prime_p()
1255 a += primes_diff[r]; /* Establish new base. */ in prime_p()
1329 for (idx_t r = 0; r < PRIMES_PTAB_ENTRIES; r++) in prime2_p() local
1362 is_prime = (r == MR_REPS - 1); in prime2_p()
1368 a += primes_diff[r]; /* Establish new base. */ in prime2_p()
1419 for (idx_t r = 0; r < PRIMES_PTAB_ENTRIES; r++) in mp_prime_p() local
1434 is_prime = (r == MR_REPS - 1); in mp_prime_p()
1440 mpz_add_ui (a, a, primes_diff[r]); /* Establish new base. */ in mp_prime_p()
1812 MAYBE_UNUSED uintmax_t r; in isqrt2() local
1814 udiv_qrnnd (q, r, nh, nl, x); in isqrt2()
1854 uintmax_t r = isqrt (x); in is_square() local
1855 if (r * r == x) in is_square()
1856 return r; in is_square()
1885 # define div_smallq(q, r, u, d) \ argument
1906 (r) = _r - (_mask & (d)); \
1908 affirm ((q) * (d) + (r) == u); \
1913 (r) = (u) - _q * (d); \
2115 uintmax_t r = is_square (Q); in factor_using_squfof() local
2116 if (r) in factor_using_squfof()
2120 if (queue[j].Q == r) in factor_using_squfof()
2122 if (r == 1) in factor_using_squfof()
2131 if (t % r == 0) in factor_using_squfof()
2145 Q1 = r; in factor_using_squfof()
2147 P += r * ((S - P) / r); in factor_using_squfof()
2429 uintmax_t q, r; in print_uintmaxes() local
2438 r = t1 % 1000000000; in print_uintmaxes()
2439 udiv_qrnnd (t0, r, r, t0, 1000000000); in print_uintmaxes()
2441 lbuf_putint (r, 9); in print_uintmaxes()