| qdivrem.c (1574) | qdivrem.c (8870) |
|---|---|
| 1/*- 2 * Copyright (c) 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This software was developed by the Computer Systems Engineering group 6 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 7 * contributed to Berkeley. 8 * --- 184 unchanged lines hidden (view full) --- 193 /* 194 * D2: j = 0. 195 */ 196 j = 0; 197 v1 = v[1]; /* for D3 -- note that v[1..n] are constant */ 198 v2 = v[2]; /* for D3 */ 199 do { 200 register digit uj0, uj1, uj2; | 1/*- 2 * Copyright (c) 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This software was developed by the Computer Systems Engineering group 6 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 7 * contributed to Berkeley. 8 * --- 184 unchanged lines hidden (view full) --- 193 /* 194 * D2: j = 0. 195 */ 196 j = 0; 197 v1 = v[1]; /* for D3 -- note that v[1..n] are constant */ 198 v2 = v[2]; /* for D3 */ 199 do { 200 register digit uj0, uj1, uj2; |
| 201 | 201 |
| 202 /* 203 * D3: Calculate qhat (\^q, in TeX notation). 204 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and 205 * let rhat = (u[j]*B + u[j+1]) mod v[1]. 206 * While rhat < B and v[2]*qhat > rhat*B+u[j+2], 207 * decrement qhat and increase rhat correspondingly. 208 * Note that if rhat >= B, v[2]*qhat < rhat*B. 209 */ --- 70 unchanged lines hidden --- | 202 /* 203 * D3: Calculate qhat (\^q, in TeX notation). 204 * Let qhat = min((u[j]*B + u[j+1])/v[1], B-1), and 205 * let rhat = (u[j]*B + u[j+1]) mod v[1]. 206 * While rhat < B and v[2]*qhat > rhat*B+u[j+2], 207 * decrement qhat and increase rhat correspondingly. 208 * Note that if rhat >= B, v[2]*qhat < rhat*B. 209 */ --- 70 unchanged lines hidden --- |