Lines Matching defs:be
49 * we can represent 10^k exactly), we may be able to
90 * appropriate. If MALLOC is undefined, malloc will be invoked
97 /* Needs to be above math.h include below */
204 IBM should be defined.
221 * An alternative that might be better on some machines is
378 /* The following may be or-ed into one of the above values. */
462 * computation is performed. Also the NULL value can also be
2062 /* special case -- power of FLT_RADIX to be */
2294 /* freedtoa(s) must be used to free values s returned by dtoa
2295 * when MULTIPLE_THREADS is #defined. It should be used in all cases,
2325 * 3. Under the assumption that input will be rounded nearest,
2373 ndigits can be negative.
2389 int bbits, b2, b5, be, dig, i, ieps, ilim0,
2459 b = d2b(value(d), &be, &bbits);
2483 * We want k to be too large rather than too small.
2506 i = bbits + be + (Bias + (P-1) - 1);
2584 // complicated way the block size need to be computed
2697 if (be >= 0 && k <= Int_max) {
2710 /* If FLT_ROUNDS == 2, L will usually be high by 1 */
2744 denorm ? be + (Bias + (P-1) - 1 + 1) :
2747 1 + 4*P - 3 - bbits + ((bbits + be - 1) & 3);
3024 * the exponent needs to be bumped. Otherwise, 0 is returned.
3092 * should be for non-zero numbers. For instance, 0x1.3p3 is the same
3123 * with zero will be equal, so we jump to the FP_ZERO case.
3368 * additional digits to insure precision. Scan to-be-truncated digits
