Lines Matching defs:v1
52 * v = 2^n v1 * v0
56 * uv = 2^2n u1 v1 + 2^n u1 v0 + 2^n v1 u0 + u0 v0
57 * = 2^2n u1 v1 + 2^n (u1 v0 + v1 u0) + u0 v0
59 * Now add 2^n u1 v1 to the first term and subtract it from the middle,
63 * uv = (2^2n + 2^n) (u1 v1) +
64 * (2^n) (u1 v0 - u1 v1 + u0 v1 - u0 v0) +
69 * uv = (2^2n + 2^n) (u1 v1) + [u1v1 = high]
70 * (2^n) (u1 - u0) (v0 - v1) + [(u1-u0)... = mid]
73 * The terms (u1 v1), (u1 - u0) (v0 - v1), and (u0 v0) can all be done
75 * of (u1 - u0) or (v0 - v1) may be negative.)
110 #define v1 v.ul[H]
115 * u1, u0, v1, and v0 will be directly accessible through the
127 if (u1 == 0 && v1 == 0) {
129 * An (I hope) important optimization occurs when u1 and v1
147 if (v0 >= v1)
148 vdiff = v0 - v1;
150 vdiff = v1 - v0, negmid ^= 1;
153 high = u1 * v1;
165 #undef v1
189 u_long u1, u0, v1, v0, udiff, vdiff, high, mid, low;
196 v1 = HHALF(v);
202 if (u1 == 0 && v1 == 0)
209 if (v0 >= v1)
210 vdiff = v0 - v1;
212 vdiff = v1 - v0, neg ^= 1;
215 high = u1 * v1;