40 	union IEEEl2bits u;  in inc()  local
42 	u.e = x;  in inc()
43 	if (++u.bits.manl == 0) {  in inc()
44 		if (++u.bits.manh == 0) {  in inc()
45 			u.bits.exp++;  in inc()
46 			u.bits.manh |= LDBL_NBIT;  in inc()
49 	return (u.e);  in inc()
56 	union IEEEl2bits u;  in dec()  local
58 	u.e = x;  in dec()
59 	if (u.bits.manl-- == 0) {  in dec()
60 		if (u.bits.manh-- == LDBL_NBIT) {  in dec()
61 			u.bits.exp--;  in dec()
62 			u.bits.manh |= LDBL_NBIT;  in dec()
65 	return (u.e);  in dec()
78 	union IEEEl2bits u;  in sqrtl()  local
83 	u.e = x;  in sqrtl()
88 	if (u.bits.exp == LDBL_MAX_EXP * 2 - 1)  in sqrtl()
92 	if ((u.bits.manh | u.bits.manl | u.bits.exp) == 0)  in sqrtl()
96 	if (u.bits.sign)  in sqrtl()
101 	if (u.bits.exp == 0) {  in sqrtl()
103 		u.e *= 0x1.0p514;  in sqrtl()
112 	if ((u.bits.exp - 0x3ffe) & 1) {	/* n is odd.     */  in sqrtl()
113 		k += u.bits.exp - 0x3fff;	/* 2k = n - 1.   */  in sqrtl()
114 		u.bits.exp = 0x3fff;		/* u.e in [1,2). */  in sqrtl()
116 		k += u.bits.exp - 0x4000;	/* 2k = n - 2.   */  in sqrtl()
117 		u.bits.exp = 0x4000;		/* u.e in [2,4). */  in sqrtl()
124 	xn = sqrt(u.e);			/* 53-bit estimate of sqrtl(x). */  in sqrtl()
126 	xn = (xn + (u.e / xn)) * 0.5;	/* 106-bit estimate. */  in sqrtl()
128 	lo = u.e;  in sqrtl()
129 	u.bits.manl = 0;		/* Zero out lower bits. */  in sqrtl()
130 	lo = (lo - u.e) / xn;		/* Low bits divided by xn. */  in sqrtl()
131 	xn = xn + (u.e / xn);		/* High portion of estimate. */  in sqrtl()
132 	u.e = xn + lo;			/* Combine everything. */  in sqrtl()
133 	u.bits.exp += (k >> 1) - 1;  in sqrtl()
138 	xn = x / u.e;			/* Chopped quotient (inexact?). */  in sqrtl()
141 		if (xn == u.e) {  in sqrtl()
143 			return (u.e);  in sqrtl()
152 		u.e = inc(u.e);		/* u.e = u.e + ulp. */  in sqrtl()
155 	u.e = u.e + xn;				/* Chopped sum. */  in sqrtl()
157 	u.bits.exp--;  in sqrtl()
158 	return (u.e);  in sqrtl()