Home | History | Annotate | Download | only in fpe

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.
90  *    - bit FP_NMANT-1 is set, and FP_1*2 fits in a word.
94  * run 32 times without adding X to A.  We can do a 32-bit shift faster
103 	uint32_t a2, a1, a0, x2, x1, x0, bit, m;
140 	 * mantissa byte from y.  The variable `bit' denotes the bit
160 #define	STEP	/* each 1-bit step of the multiplication */ \
161 	SHR1; if (bit & m) { ADD; }; bit <<= 1
165 	 * of the four 32-bit words.  Some words, however, are special.
168 	 * The last word of y has its highest 1-bit in position FP_NMANT-1,
169 	 * so we stop the loop when we move past that bit.
174 		bit = 1 << FP_NG;
177 		} while (bit != 0);
182 		bit = 1;
185 		} while (bit != 0);
188 	bit = 1;
191 	} while (bit <= m);