| /src/common/lib/libc/quad/ |
| qdivrem.c | 80 u_int qhat, rhat, t; local in function:__qdivrem
192 * D3: Calculate qhat (\^q, in TeX notation).
193 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and
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.
203 qhat = B;
208 qhat = nn / v1;
211 while (v2 * qhat > COMBINE(rhat, uj2)) {
213 qhat--
[all...] |
| qdivrem.c | 80 u_int qhat, rhat, t; local in function:__qdivrem
192 * D3: Calculate qhat (\^q, in TeX notation).
193 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and
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.
203 qhat = B;
208 qhat = nn / v1;
211 while (v2 * qhat > COMBINE(rhat, uj2)) {
213 qhat--
[all...] |
