Lines Matching defs:v1
57 * v = 2^n v1 * v0
61 * uv = 2^2n u1 v1 + 2^n u1 v0 + 2^n v1 u0 + u0 v0
62 * = 2^2n u1 v1 + 2^n (u1 v0 + v1 u0) + u0 v0
64 * Now add 2^n u1 v1 to the first term and subtract it from the middle,
68 * uv = (2^2n + 2^n) (u1 v1) +
69 * (2^n) (u1 v0 - u1 v1 + u0 v1 - u0 v0) +
74 * uv = (2^2n + 2^n) (u1 v1) + [u1v1 = high]
75 * (2^n) (u1 - u0) (v0 - v1) + [(u1-u0)... = mid]
78 * The terms (u1 v1), (u1 - u0) (v0 - v1), and (u0 v0) can all be done
80 * of (u1 - u0) or (v0 - v1) may be negative.)
115 #define v1 v.ul[H]
120 * u1, u0, v1, and v0 will be directly accessible through the
132 if (u1 == 0 && v1 == 0) {
134 * An (I hope) important optimization occurs when u1 and v1
152 if (v0 >= v1)
153 vdiff = v0 - v1;
155 vdiff = v1 - v0, negmid ^= 1;
158 high = u1 * v1;
170 #undef v1
194 u_int u1, u0, v1, v0, udiff, vdiff, high, mid, low;
201 v1 = HHALF(v);
207 if (u1 == 0 && v1 == 0)
214 if (v0 >= v1)
215 vdiff = v0 - v1;
217 vdiff = v1 - v0, neg ^= 1;
220 high = u1 * v1;