Home | History | Annotate | Download | only in fpu

Lines Matching defs:bit

61  * Each step consists of shifting the accumulator right one bit
62  * (maintaining any guard bits) and, if the next bit in y is set,
64  * we advance one bit leftward in y.  Algorithmically:
67  *	for (bit = 0; bit < FP_NMANT; bit++) {
69  *		if (Y & (1 << bit))
76  * shifted right, but at most one bit.
92  *    - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
96  * run 32 times without adding X to A.  We can do a 32-bit shift faster
105 	u_int a3, a2, a1, a0, x3, x2, x1, x0, bit, m;
143 	 * mantissa byte from y.  The variable `bit' denotes the bit
165 #define	STEP	/* each 1-bit step of the multiplication */ \
166 	SHR1; if (bit & m) { ADD; }; bit <<= 1
170 	 * of the four 32-bit words.  Some words, however, are special.
173 	 * The last word of y has its highest 1-bit in position FP_NMANT-1,
174 	 * so we stop the loop when we move past that bit.
179 		bit = 1 << FP_NG;
182 		} while (bit != 0);
187 		bit = 1;
190 		} while (bit != 0);
195 		bit = 1;
198 		} while (bit != 0);
201 	bit = 1;
204 	} while (bit <= m);