Lines Matching refs:rhat
89 u_long qhat, rhat, t;
203 * let rhat = (u[j]*B + u[j+1]) mod v[1].
204 * While rhat < B and v[2]*qhat > rhat*B+u[j+2],
205 * decrement qhat and increase rhat correspondingly.
206 * Note that if rhat >= B, v[2]*qhat < rhat*B.
213 rhat = uj1;
218 rhat = n % v1;
220 while (v2 * qhat > COMBINE(rhat, uj2)) {
223 if ((rhat += v1) >= B)