Lines Matching refs:bits
42 long bits = Double.doubleToRawLongBits(x);
44 bits--;
46 bits++;
48 return Double.longBitsToDouble(bits);
79 long bits = Double.doubleToRawLongBits(d);
80 int exponent = (int) ((bits & EXPONENT_MASK) >> SIGNIFICAND_BITS);
100 long bits = Double.doubleToRawLongBits(d);
101 bits &= ~EXPONENT_MASK;
102 bits |= ((long) (newExponent + EXPONENT_BIAS)) << SIGNIFICAND_BITS;
103 return Double.longBitsToDouble(bits);
112 long bits = Double.doubleToRawLongBits(d);
113 bits &= SIGNIFICAND_MASK;
115 ? bits << 1
116 : bits | IMPLICIT_BIT;
148 * We need the top SIGNIFICAND_BITS + 1 bits, including the "implicit" one bit. To make
149 * rounding easier, we pick out the top SIGNIFICAND_BITS + 2 bits, so we have one to help us
150 * round up or down. twiceSignifFloor will contain the top SIGNIFICAND_BITS + 2 bits, and
168 long bits = (long) ((exponent + EXPONENT_BIAS)) << SIGNIFICAND_BITS;
169 bits += signifRounded;
171 * If signifRounded == 2^53, we'd need to set all of the significand bits to zero and add 1 to
172 * the exponent. This is exactly the behavior we get from just adding signifRounded to bits
176 bits |= x.signum() & SIGN_MASK;
177 return Double.longBitsToDouble(bits);