Searched defs:be (Results 1 - 5 of 5) sorted by relevance
/bionic/libc/upstream-openbsd/lib/libc/gdtoa/ |
H A D | ldtoa.c | 63 int be, kind; local 77 be = p->ext_exp - (LDBL_MAX_EXP - 1) - (LDBL_MANT_DIG - 1); 92 be++; 104 ret = gdtoa(&fpi, be, vbits, &kind, mode, ndigits, decpt, rve);
|
H A D | dtoa.c | 14 not be used in advertising or publicity pertaining to 47 * 3. Under the assumption that input will be rounded nearest, 102 ndigits can be negative. 118 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1, local 200 b = d2b(dval(&d), &be, &bbits); 226 * We want k to be too large rather than too small. 249 i = bbits + be + (Bias + (P-1) - 1); 442 if (be >= 0 && k <= Int_max) { 455 /* If FLT_ROUNDS == 2, L will usually be high by 1 */ 504 denorm ? be [all...] |
H A D | gdtoa.c | 14 not be used in advertising or publicity pertaining to 43 ULong *be, *x, *x0; local 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) [all...] |
H A D | strtodg.c | 14 not be used in advertising or publicity pertaining to 354 ULong *b, *be, y, z; local 1110 be = b + ((fpi->nbits + 31) >> 5); 1111 while(b < be) 1114 *--be >>= (32 - j);
|
/bionic/libc/dns/nameser/ |
H A D | ns_name.c | 408 * Unpack a domain name from a message, source may be compressed. 422 * Unpack a domain name from a message, source may be compressed. 488 * there must be a loop. 762 ns_nname_ct ae = a + as, be = b + bs; local 770 if (a + ac >= ae || b + bc >= be) { 787 /* If A is shorter, it cannot be owned by B. */ 801 /* A might be longer or not, but either way, B owns it. */ 1126 * MUST be just sufficient to contain the number of bits specified 1128 * hexadecimal or octal digit, they MUST be zero. 1162 /* should be avoide [all...] |
Completed in 849 milliseconds