Lines Matching defs:be
16 not be used in advertising or publicity pertaining to
49 ULong *be, *x, *x0;
64 be = bits + (((unsigned int)nbits - 1) >> kshift);
71 } while(++bits <= be);
98 * 3. Under the assumption that input will be rounded nearest,
121 (FPI *fpi, int be, ULong *bits, int *kindp, int mode, int ndigits, int *decpt, char **rve)
141 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;
449 if (be >= 0 && k <= Int_max) {
462 /* If FLT_ROUNDS == 2, L will usually be high by 1 */
504 if (be - i++ < fpi->emin)
506 i = be - fpi->emin + 1;