Home
last modified time | relevance | path

Searched refs:d1 (Results 1 – 3 of 3) sorted by relevance

/lib/
Drational.c35 unsigned long n, d, n0, d0, n1, d1; in rational_best_approximation() local
38 n0 = d1 = 0; in rational_best_approximation()
42 if ((n1 > max_numerator) || (d1 > max_denominator)) { in rational_best_approximation()
44 d1 = d0; in rational_best_approximation()
56 t = d0 + a * d1; in rational_best_approximation()
57 d0 = d1; in rational_best_approximation()
58 d1 = t; in rational_best_approximation()
61 *best_denominator = d1; in rational_best_approximation()
Dvsprintf.c285 uint32_t d3, d2, d1, q, h; in put_dec() local
290 d1 = ((uint32_t)n >> 16); /* implicit "& 0xffff" */ in put_dec()
295 q = 656 * d3 + 7296 * d2 + 5536 * d1 + ((uint32_t)n & 0xffff); in put_dec()
298 q += 7671 * d3 + 9496 * d2 + 6 * d1; in put_dec()
/lib/mpi/
Dmpih-div.c103 mpi_limb_t d1, d0; in mpihelp_divrem() local
106 d1 = dp[1]; in mpihelp_divrem()
111 if (n1 >= d1 && (n1 > d1 || n0 >= d0)) { in mpihelp_divrem()
112 sub_ddmmss(n1, n0, n1, n0, d1, d0); in mpihelp_divrem()
125 if (n1 == d1) { in mpihelp_divrem()
131 r = n0 + d1; in mpihelp_divrem()
132 if (r < d1) { /* Carry in the addition? */ in mpihelp_divrem()
141 udiv_qrnnd(q, r, n1, n0, d1); in mpihelp_divrem()
151 r += d1; in mpihelp_divrem()
152 if (r >= d1) /* If not carry, test Q again. */ in mpihelp_divrem()
[all …]