Lines Matching defs:bit
67 * if X < Y. In that case, it will have to be shifted left one bit to
74 * The quotient mantissa X/Y can then be computed one bit at a time
81 * for (bit = FP_NMANT; --bit >= 0; R *= 2) {
83 * Q |= 1 << bit;
88 * The subtraction R -= Y always removes the uppermost bit from R (and
93 * included in the expanded internal representation. The sticky bit
99 * one bit at a time ``from the top down''. This means that we can
105 * is therefore at in [2.0,4.0).) Thus Q is sure to have bit FP_NMANT-1
112 * bit = FP_1;
117 * q = bit;
118 * bit >>= 1;
127 * q |= bit;
131 * } while ((bit >>= 1) != 0);
134 * q = 0, bit = 1 << 31;
138 * q |= bit;
142 * } while ((bit >>= 1) != 0);
146 * This can be refined just a bit further by moving the `R <<= 1'
156 uint32_t q, bit;
224 #define LOOP /* do ... while (bit >>= 1) */ \
229 q |= bit; \
232 } while ((bit >>= 1) != 0)
236 bit = 1 << 31; \
248 bit = FP_1;
253 q = bit;
254 bit >>= 1;
Indexes created Sat Oct 11 19:10:01 GMT 2025