Lines Matching defs:rhat
87 u_int qhat, rhat, t;
201 * let rhat = (u[j]*B + u[j+1]) mod v[1].
202 * While rhat < B and v[2]*qhat > rhat*B+u[j+2],
203 * decrement qhat and increase rhat correspondingly.
204 * Note that if rhat >= B, v[2]*qhat < rhat*B.
211 rhat = uj1;
216 rhat = nn % v1;
218 while (v2 * qhat > COMBINE(rhat, uj2)) {
221 if ((rhat += v1) >= B)