Lines Matching refs:bit
66 * if X < Y. In that case, it will have to be shifted left one bit to
73 * The quotient mantissa X/Y can then be computed one bit at a time
80 * for (bit = FP_NMANT; --bit >= 0; R *= 2) {
82 * Q |= 1 << bit;
87 * The subtraction R -= Y always removes the uppermost bit from R (and
92 * included in the expanded internal representation. The sticky bit
98 * one bit at a time ``from the top down''. This means that we can
104 * is therefore at in [2.0,4.0).) Thus Q is sure to have bit FP_NMANT-1
111 * bit = FP_1;
116 * q = bit;
117 * bit >>= 1;
126 * q |= bit;
130 * } while ((bit >>= 1) != 0);
133 * q = 0, bit = 1 << 31;
137 * q |= bit;
141 * } while ((bit >>= 1) != 0);
145 * This can be refined just a bit further by moving the `R <<= 1'
156 u_int q, bit;
222 #define LOOP /* do ... while (bit >>= 1) */ \
227 q |= bit; \
230 } while ((bit >>= 1) != 0)
234 bit = 1 << 31; \
248 bit = FP_1;
253 q = bit;
254 bit >>= 1;