Lines Matching defs:be
14 not be used in advertising or publicity pertaining to
43 ULong *be, *x, *x0;
58 be = bits + ((nbits - 1) >> kshift);
65 } while(++bits <= be);
92 * 3. Under the assumption that input will be rounded nearest,
116 (fpi, be, bits, kindp, mode, ndigits, decpt, rve)
117 FPI *fpi; int be; ULong *bits;
120 (FPI *fpi, int be, ULong *bits, int *kindp, int mode, int ndigits, int *decpt, char **rve)
128 be = exponent: value = (integer represented by bits) * (2 to the power of be).
142 ndigits can be negative.
193 be0 = be;
196 be += i;
207 i = be + bbits - 1;
225 * We want k to be too large rather than too small.
253 j = be + bbits - 1;
258 word0(&d) += (be + bbits - 1) << Exp_shift;
450 if (be >= 0 && k <= Int_max) {
463 /* If FLT_ROUNDS == 2, L will usually be high by 1 */
513 if (be - i++ < fpi->emin && mode != 3 && mode != 5) {
515 i = be - fpi->emin + 1;