Searched refs:rhat (Results 1 - 3 of 3) sorted by relevance
/freebsd-11.0-release/sys/libkern/ |
H A D | qdivrem.c | 86 u_long qhat, rhat, t; local 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, uj [all...] |
/freebsd-11.0-release/lib/libc/quad/ |
H A D | qdivrem.c | 89 u_long qhat, rhat, t; local 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, uj [all...] |
/freebsd-11.0-release/lib/libstand/ |
H A D | qdivrem.c | 87 u_int qhat, rhat, t; local 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, uj [all...] |
Completed in 62 milliseconds