Lines Matching defs:bit
71 * if X < Y. In that case, it will have to be shifted left one bit to
78 * The quotient mantissa X/Y can then be computed one bit at a time
85 * for (bit = FP_NMANT; --bit >= 0; R *= 2) {
87 * Q |= 1 << bit;
92 * The subtraction R -= Y always removes the uppermost bit from R (and
97 * included in the expanded internal representation. The sticky bit
103 * one bit at a time ``from the top down''. This means that we can
109 * is therefore at in [2.0,4.0).) Thus Q is sure to have bit FP_NMANT-1
116 * bit = FP_1;
121 * q = bit;
122 * bit >>= 1;
131 * q |= bit;
135 * } while ((bit >>= 1) != 0);
138 * q = 0, bit = 1 << 31;
142 * q |= bit;
146 * } while ((bit >>= 1) != 0);
150 * This can be refined just a bit further by moving the `R <<= 1'
160 u_int q, bit;
249 #define LOOP /* do ... while (bit >>= 1) */ \
254 q |= bit; \
257 } while ((bit >>= 1) != 0)
261 bit = 1 << 31; \
275 bit = FP_1;
280 q = bit;
281 bit >>= 1;