Lines Matching defs:bits
81 * #define Just_16 to store 16 bits per 32-bit Long when doing high-precision
289 #define Ebits 8 /* exponent has 7 bits, but 8 is the right value in b2d */
351 /* When Pack_32 is not defined, we store 16 bits per 32-bit Long.
354 * slower. Hence the default is now to store 32 bits per Long.
566 ULtod(ULong *L, ULong *bits, Long exp, int k)
578 L[_1] = bits[0];
579 L[_0] = bits[1];
584 L[_1] = bits[0];
585 L[_0] = (bits[1] & ~0x100000) | ((exp + 0x3ff + 52) << 20);
1381 (_d, e, bits) double d; int *e, *bits;
1383 (double _d, int *e, int *bits)
1493 *bits = 4*P + 8 - k - hi0bits(word0(d) & Frac_mask);
1496 *bits = P - k;
1503 *bits = 32*i - hi0bits(x[i-1]);
1505 *bits = (i+2)*16 - hi0bits(x[i]);
1671 ULong bits[2];
1690 copybits(bits, fpi.nbits, bb);
1693 ULtod(((U*)&rv)->L, bits, exp, i);
2150 * trouble from bits lost to denormalization;
2332 * compute with fewer bits and propagate the carry if necessary
2821 * shift left if necessary so divisor has 4 leading 0 bits.
2823 * Perhaps we should just compute leading 28 bits of S once
3119 *sign = u.bits.sign;
3123 *decpt = u.bits.exp - DBL_ADJ;
3136 *decpt = u.bits.exp - (514 + DBL_ADJ);
3174 *s = u.bits.manl & 0xf;
3175 u.bits.manl >>= 4;
3178 *s = u.bits.manh & 0xf;
3179 u.bits.manh >>= 4;
3183 * At this point, we have snarfed all the bits in the
3188 *s = u.bits.manh | (1U << ((DBL_MANT_DIG - 1) % 4));
3197 dorounding(s0, ndigits, u.bits.sign, decpt);
