Home | History | Annotate | Download | only in gdtoa

Lines Matching defs:be

16 not be used in advertising or publicity pertaining to
22 IN NO EVENT SHALL LUCENT OR ANY OF ITS ENTITIES BE LIABLE FOR ANY
45 	ULong *be, *x, *x0;
60 	be = bits + (((unsigned int)nbits - 1) >> kshift);
67 		} while(++bits <= be);
96  *	3. Under the assumption that input will be rounded nearest,
120 	(fpi, be, bits, kindp, mode, ndigits, decpt, rve)
121 	CONST FPI *fpi; int be; ULong *bits;
124 	(CONST FPI *fpi, int be, ULong *bits, int *kindp, int mode, int ndigits, int *decpt, char **rve)
132 	be = exponent: value = (integer represented by bits) * (2 to the power of be).
146 			ndigits can be negative.
199 	be0 = be;
202 		be += i;
213 	i = be + bbits - 1;
231 	 * We want k to be too large rather than too small.
259 	j = be + bbits - 1;
264 	word0(&d) += (be + bbits - 1) << Exp_shift;
456 	if (be >= 0 && k <= Int_max) {
469 			/* If FLT_ROUNDS == 2, L will usually be high by 1 */
519 		if (be - i++ < fpi->emin && mode != 3 && mode != 5) {
521 			i = be - fpi->emin + 1;