Lines Matching refs:rhat
86 u_long qhat, rhat, t;
200 * let rhat = (u[j]*B + u[j+1]) mod v[1].
201 * While rhat < B and v[2]*qhat > rhat*B+u[j+2],
202 * decrement qhat and increase rhat correspondingly.
203 * Note that if rhat >= B, v[2]*qhat < rhat*B.
210 rhat = uj1;
215 rhat = nn % v1;
217 while (v2 * qhat > COMBINE(rhat, uj2)) {
220 if ((rhat += v1) >= B)