Lines Matching refs:rhat
88 ulong_t qhat, rhat, t;
202 * let rhat = (u[j]*B + u[j+1]) mod v[1].
203 * While rhat < B and v[2]*qhat > rhat*B+u[j+2],
204 * decrement qhat and increase rhat correspondingly.
205 * Note that if rhat >= B, v[2]*qhat < rhat*B.
212 rhat = uj1;
217 rhat = n % v1;
219 while (v2 * qhat > COMBINE(rhat, uj2)) {
222 if ((rhat += v1) >= B)