Lines Matching defs:be
14 not be used in advertising or publicity pertaining to
43 ULong *be, *x, *x0;
56 be = bits + ((nbits - 1) >> kshift);
63 } while(++bits <= be);
90 * 3. Under the assumption that input will be rounded nearest,
114 (fpi, be, bits, kindp, mode, ndigits, decpt, rve)
115 FPI *fpi; int be; ULong *bits;
118 (FPI *fpi, int be, ULong *bits, int *kindp, int mode, int ndigits, int *decpt, char **rve)
126 be = exponent: value = (integer represented by bits) * (2 to the power of be).
140 ndigits can be negative.
189 be0 = be;
192 be += i;
203 i = be + bbits - 1;
221 * We want k to be too large rather than too small.
249 j = be + bbits - 1;
254 word0(&d) += (be + bbits - 1) << Exp_shift;
444 if (be >= 0 && k <= Int_max) {
457 /* If FLT_ROUNDS == 2, L will usually be high by 1 */
507 if (be - i++ < fpi->emin && mode != 3 && mode != 5) {
509 i = be - fpi->emin + 1;