Lines Matching defs:u1
48 * u = 2^n u1 * u0 (n = number of bits in `u_long', usu. 32)
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.)
108 #define u1 u.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
143 if (u1 >= u0)
144 negmid = 0, udiff = u1 - u0;
146 negmid = 1, udiff = u0 - u1;
153 high = u1 * v1;
163 #undef u1
189 u_long u1, u0, v1, v0, udiff, vdiff, high, mid, low;
194 u1 = HHALF(u);
202 if (u1 == 0 && v1 == 0)
205 if (u1 >= u0)
206 udiff = u1 - u0, neg = 0;
208 udiff = u0 - u1, neg = 1;
215 high = u1 * v1;