Lines Matching defs:bit
65 * Each step consists of shifting the accumulator right one bit
66 * (maintaining any guard bits) and, if the next bit in y is set,
68 * we advance one bit leftward in y. Algorithmically:
71 * for (bit = 0; bit < FP_NMANT; bit++) {
73 * if (Y & (1 << bit))
80 * shifted right, but at most one bit.
96 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
100 * run 32 times without adding X to A. We can do a 32-bit shift faster
109 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m;
160 * mantissa byte from y. The variable `bit' denotes the bit
182 #define STEP /* each 1-bit step of the multiplication */ \
183 SHR1; if (bit & m) { ADD; }; bit <<= 1
187 * of the four 32-bit words. Some words, however, are special.
190 * The last word of y has its highest 1-bit in position FP_NMANT-1,
191 * so we stop the loop when we move past that bit.
196 bit = 1 << FP_NG;
199 } while (bit != 0);
204 bit = 1;
207 } while (bit != 0);
212 bit = 1;
215 } while (bit != 0);
218 bit = 1;
221 } while (bit <= m);
Indexes created Sat Sep 20 22:09:52 GMT 2025