69  *	       (2^n + 1)  (u0 v0)			[u0v0 = low]
87  *	(2^n)(high) + (2^n)(mid) + (2^n + 1)(low)
91  *	(2^n)(high + mid + low) + low
94  * of 2^n in either one will also vanish.  Only `low' need be computed
103 	union uu u, v, low, prod;  in __muldi3()  local
139 		low.q = __lmulq(u0, v0);  in __muldi3()
156 		prod.ul[H] = high + (negmid ? -mid : mid) + low.ul[L] +  in __muldi3()
157 		    low.ul[H];  in __muldi3()
158 		prod.ul[L] = low.ul[L];  in __muldi3()
182  * splits into high and low ints as HHALF(l) and LHUP(l) respectively.
187 	u_int u1, u0, v1, v0, udiff, vdiff, high, mid, low;  in __lmulq()  local
197 	low = u0 * v0;  in __lmulq()
201 		return (low);  in __lmulq()
230 	/* prod += low << N */  in __lmulq()
232 	prodl += LHUP(low);  in __lmulq()
233 	prodh += HHALF(low) + (prodl < was);  in __lmulq()
234 	/* ... + low; */  in __lmulq()
235 	if ((prodl += low) < low)  in __lmulq()