Lines Matching full:d1
44 * n2/d2, n1/d1, and n0/d0 are our successively more accurate in rational_best_approximation()
50 unsigned long n, d, n0, d0, n1, d1, n2, d2; in rational_best_approximation() local
53 n0 = d1 = 0; in rational_best_approximation()
74 d2 = d0 + a * d1; in rational_best_approximation()
84 if (d1) in rational_best_approximation()
85 t = (max_denominator - d0) / d1; in rational_best_approximation()
90 * convergent. If d1 is zero there is no previous convergent as this in rational_best_approximation()
93 if (!d1 || 2u * t > a || (2u * t == a && d0 * dp > d1 * d)) { in rational_best_approximation()
95 d1 = d0 + t * d1; in rational_best_approximation()
101 d0 = d1; in rational_best_approximation()
102 d1 = d2; in rational_best_approximation()
105 *best_denominator = d1; in rational_best_approximation()