Lines Matching full:bits
55 * Return the IEEE remainder and set *quo to the last n bits of the
57 * we wind up computing all the integer bits of the quotient anyway as
59 * method. In practice, this is far more bits than are needed to use
65 * for an explicit integer bit in front of the fractional bits.
78 sx = ux.bits.sign;
79 sxy = sx ^ uy.bits.sign;
80 ux.bits.sign = 0; /* |x| */
81 uy.bits.sign = 0; /* |y| */
85 if((uy.bits.exp|uy.bits.manh|uy.bits.manl)==0 || /* y=0 */
86 (ux.bits.exp == BIAS + LDBL_MAX_EXP) || /* or x not finite */
87 (uy.bits.exp == BIAS + LDBL_MAX_EXP &&
88 ((uy.bits.manh&~LDBL_NBIT)|uy.bits.manl)!=0)) /* or y is NaN */
90 if(ux.bits.exp<=uy.bits.exp) {
91 if((ux.bits.exp<uy.bits.exp) ||
92 (ux.bits.manh<=uy.bits.manh &&
93 (ux.bits.manh<uy.bits.manh ||
94 ux.bits.manl<uy.bits.manl))) {
98 if(ux.bits.manh==uy.bits.manh && ux.bits.manl==uy.bits.manl) {
105 if(ux.bits.exp == 0) { /* subnormal x */
107 ix = ux.bits.exp - (BIAS + 512);
109 ix = ux.bits.exp - BIAS;
113 if(uy.bits.exp == 0) { /* subnormal y */
115 iy = uy.bits.exp - (BIAS + 512);
117 iy = uy.bits.exp - BIAS;
121 hx = SET_NBIT(ux.bits.manh);
122 hy = SET_NBIT(uy.bits.manh);
123 lx = ux.bits.manl;
124 ly = uy.bits.manl;
149 ux.bits.manh = hx; /* The integer bit is truncated here if needed. */
150 ux.bits.manl = lx;
152 ux.bits.exp = iy + (BIAS + 512);
155 ux.bits.exp = iy + BIAS;
157 ux.bits.sign = 0;
172 ux.bits.sign ^= sx;
