Home
last modified time | relevance | path

Searched refs:nbits (Results 1 – 6 of 6) sorted by relevance

/bionic/libc/upstream-openbsd/lib/libc/gdtoa/
Dgethex.c48 int big, esign, havedig, irv, j, k, n, n0, nbits, up, zret; local
189 nbits = fpi->nbits;
190 n0 = n = nbits >> kshift;
191 if (nbits & kmask)
201 b->x[j] = ULbits >> (ULbits - (nbits & kmask));
238 nbits = fpi->nbits;
241 if (n > nbits) {
242 n -= nbits;
255 else if (n < nbits) {
256 n = nbits - n;
[all …]
Dhexnan.c62 int havedig, hd0, i, nbits; local
66 nbits = fpi->nbits;
67 x = x0 + (nbits >> kshift);
68 if (nbits & kmask)
138 if ( (i = nbits & (ULbits-1)) !=0)
Dstrtodg.c194 bdif -= nb = fpi->nbits;
348 int j, k, nbits, nd, nd0, nf, nz, nz0, rd, rvbits, rve, rve1, sign; local
382 nbits = fpi->nbits;
578 if (nbits <= P && nd <= DBL_DIG) {
707 if ((j = rvbits - nbits) > 0) {
709 rvbits = nbits;
713 e2 = rve + rvbits - nbits;
716 rve1 = rve + rvbits - nbits;
783 j = nbits + 1 - bbbits;
784 i = bbe + bbbits - nbits;
[all …]
Dgdtoa.c36 bitstob(bits, nbits, bbits) ULong *bits; int nbits; int *bbits; in bitstob() argument
38 bitstob(ULong *bits, int nbits, int *bbits)
47 while(i < nbits) {
58 be = bits + ((nbits - 1) >> kshift);
159 int j, j1, k, k0, k_check, kind, leftright, m2, m5, nbits; local
190 b = bitstob(bits, nbits = fpi->nbits, &bbits);
299 i = (int)(nbits * .30103) + 3;
512 i = nbits - bbits;
Dgdtoa.h89 int nbits; member
Dstrtod.c192 copybits(bits, fpi.nbits, bb);