Searched refs:qhat (Results 1 - 3 of 3) sorted by relevance
/freebsd-10.2-release/lib/libstand/ |
H A D | qdivrem.c | 87 u_int qhat, rhat, t; local 199 * D3: Calculate qhat (\^q, in TeX notation). 200 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and 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. 210 qhat = B; 215 qhat = nn / v1; 218 while (v2 * qhat > COMBINE(rhat, uj2)) { 220 qhat [all...] |
/freebsd-10.2-release/lib/libc/quad/ |
H A D | qdivrem.c | 89 u_long qhat, rhat, t; local 201 * D3: Calculate qhat (\^q, in TeX notation). 202 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and 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. 212 qhat = B; 217 qhat = n / v1; 220 while (v2 * qhat > COMBINE(rhat, uj2)) { 222 qhat [all...] |
/freebsd-10.2-release/sys/libkern/ |
H A D | qdivrem.c | 86 u_long qhat, rhat, t; local 198 * D3: Calculate qhat (\^q, in TeX notation). 199 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and 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. 209 qhat = B; 214 qhat = nn / v1; 217 while (v2 * qhat > COMBINE(rhat, uj2)) { 219 qhat [all...] |
Completed in 119 milliseconds