Lines Matching defs:rhat
80 u_int qhat, rhat, t;
194 * let rhat = (u[j]*B + u[j+1]) mod v[1].
195 * While rhat < B and v[2]*qhat > rhat*B+u[j+2],
196 * decrement qhat and increase rhat correspondingly.
197 * Note that if rhat >= B, v[2]*qhat < rhat*B.
204 rhat = uj1;
209 rhat = nn % v1;
211 while (v2 * qhat > COMBINE(rhat, uj2)) {
214 if ((rhat += v1) >= B)
Indexes created Tue Sep 30 07:10:03 GMT 2025