Lines Matching refs:bit
58 * Each step consists of shifting the accumulator right one bit
59 * (maintaining any guard bits) and, if the next bit in y is set,
61 * we advance one bit leftward in y. Algorithmically:
64 * for (bit = 0; bit < FP_NMANT; bit++) {
66 * if (Y & (1 << bit))
73 * shifted right, but at most one bit.
89 * - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
93 * run 32 times without adding X to A. We can do a 32-bit shift faster
103 u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m;
139 * mantissa byte from y. The variable `bit' denotes the bit
161 #define STEP /* each 1-bit step of the multiplication */ \
162 SHR1; if (bit & m) { ADD; }; bit <<= 1
166 * of the four 32-bit words. Some words, however, are special.
169 * The last word of y has its highest 1-bit in position FP_NMANT-1,
170 * so we stop the loop when we move past that bit.
175 bit = 1 << FP_NG;
178 } while (bit != 0);
183 bit = 1;
186 } while (bit != 0);
191 bit = 1;
194 } while (bit != 0);
197 bit = 1;
200 } while (bit <= m);