Home | History | Annotate | Download | only in quad

Lines Matching defs:u1

55  *	u = 2^n u1  *  u0	(n = number of bits in `u_int', usu. 32)
63  *	uv = 2^2n u1 v1  +  2^n u1 v0  +  2^n v1 u0  +  u0 v0
64  *	   = 2^2n u1 v1  +     2^n (u1 v0 + v1 u0)   +  u0 v0
66  * Now add 2^n u1 v1 to the first term and subtract it from the middle,
70  *	uv = (2^2n + 2^n) (u1 v1)  +
71  *	         (2^n)    (u1 v0 - u1 v1 + u0 v1 - u0 v0)  +
76  *	uv = (2^2n + 2^n) (u1 v1)  +			[u1v1 = high]
77  *		 (2^n)    (u1 - u0) (v0 - v1)  +	[(u1-u0)... = mid]
80  * The terms (u1 v1), (u1 - u0) (v0 - v1), and (u0 v0) can all be done
82  * of (u1 - u0) or (v0 - v1) may be negative.)
114 #define	u1	u.ul[H]
121 	 * u1, u0, v1, and v0 will be directly accessible through the
133 	if (u1 == 0 && v1 == 0) {
135 		 * An (I hope) important optimization occurs when u1 and v1
149 		if (u1 >= u0)
150 			negmid = 0, udiff = u1 - u0;
152 			negmid = 1, udiff = u0 - u1;
159 		high = u1 * v1;
169 #undef u1
195 	u_int u1, u0, v1, v0, udiff, vdiff, high, mid, low;
200 	u1 = HHALF(u);
208 	if (u1 == 0 && v1 == 0)
211 	if (u1 >= u0)
212 		udiff = u1 - u0, neg = 0;
214 		udiff = u0 - u1, neg = 1;
221 	high = u1 * v1;