30 register const char *s = start;
31 register unsigned long retval = 0;
33 while (len-- && *s >=
'0' && *s <=
'7') {
37 *retlen = (int)(s - start);
44 static const char hexdigit[] =
"0123456789abcdef0123456789ABCDEF";
45 register const char *s = start;
46 register unsigned long retval = 0;
49 while (len-- && *s && (tmp =
strchr(hexdigit, *s))) {
51 retval |= (tmp - hexdigit) & 15;
54 *retlen = (int)(s - start);
59 scan_digits(
const char *str,
int base,
size_t *retlen,
int *overflow)
61 static signed char table[] = {
63 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
64 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
65 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
66 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,-1,-1,-1,-1,-1,-1,
67 -1,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,
68 25,26,27,28,29,30,31,32,33,34,35,-1,-1,-1,-1,-1,
69 -1,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,
70 25,26,27,28,29,30,31,32,33,34,35,-1,-1,-1,-1,-1,
71 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
72 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
73 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
74 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
75 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
76 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
77 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
78 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
81 const char *start = str;
82 unsigned long ret = 0, x;
83 unsigned long mul_overflow = (~(
unsigned long)0) / base;
87 while ((c = (
unsigned char)*str++) !=
'\0') {
89 if (d == -1 || base <= d) {
90 *retlen = (str-1) - start;
93 if (mul_overflow < ret)
101 *retlen = (str-1) - start;
112 const char *subject_found = str;
114 if (base == 1 || 36 < base) {
119 while ((c = *str) &&
ISSPACE(c))
132 subject_found = str+1;
133 if (base == 0 || base == 16) {
134 if (str[1] ==
'x' || str[1] ==
'X') {
139 b = base == 0 ? 8 : 16;
149 b = base == 0 ? 10 : base;
155 subject_found = str+
len;
158 *endptr = (
char*)subject_found;
166 ret = (
unsigned long)(-(
long)ret);
174 #include <sys/types.h>
175 #include <sys/stat.h>
179 #if defined(HAVE_FCNTL_H)
184 # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR)
195 #define mmprepare(base, size) do {\
196 if (((VALUE)(base) & (0x3)) == 0)\
197 if ((size) >= 16) mmkind = 1;\
200 high = ((size) & (~0xf));\
201 low = ((size) & 0x0c);\
204 #define mmarg mmkind, size, high, low
206 static void mmswap_(
register char *a,
register char *b,
int mmkind,
size_t size,
size_t high,
size_t low)
212 register char *t = a + high;
214 s =
A[0];
A[0] =
B[0];
B[0] = s;
215 s =
A[1];
A[1] =
B[1];
B[1] = s;
216 s =
A[2];
A[2] =
B[2];
B[2] = s;
217 s =
A[3];
A[3] =
B[3];
B[3] = s; a += 16; b += 16;
220 if (low != 0) { s =
A[0];
A[0] =
B[0];
B[0] = s;
221 if (low >= 8) { s =
A[1];
A[1] =
B[1];
B[1] = s;
222 if (low == 12) {s =
A[2];
A[2] =
B[2];
B[2] = s;}}}
225 register char *t = a +
size;
226 do {s = *a; *a++ = *b; *b++ = s;}
while (a < t);
229 #define mmswap(a,b) mmswap_((a),(b),mmarg)
231 static void mmrot3_(
register char *a,
register char *b,
register char *c,
int mmkind,
size_t size,
size_t high,
size_t low)
236 register char *t = a + high;
238 s =
A[0];
A[0] =
B[0];
B[0] =
C[0];
C[0] = s;
239 s =
A[1];
A[1] =
B[1];
B[1] =
C[1];
C[1] = s;
240 s =
A[2];
A[2] =
B[2];
B[2] =
C[2];
C[2] = s;
241 s =
A[3];
A[3] =
B[3];
B[3] =
C[3];
C[3] = s; a += 16; b += 16; c += 16;
244 if (low != 0) { s =
A[0];
A[0] =
B[0];
B[0] =
C[0];
C[0] = s;
245 if (low >= 8) { s =
A[1];
A[1] =
B[1];
B[1] =
C[1];
C[1] = s;
246 if (low == 12) {s =
A[2];
A[2] =
B[2];
B[2] =
C[2];
C[2] = s;}}}
249 register char *t = a +
size;
250 do {s = *a; *a++ = *b; *b++ = *c; *c++ = s;}
while (a < t);
253 #define mmrot3(a,b,c) mmrot3_((a),(b),(c),mmarg)
265 #define PUSH(ll,rr) do { top->LL = (ll); top->RR = (rr); ++top; } while (0)
266 #define POP(ll,rr) do { --top; (ll) = top->LL; (rr) = top->RR; } while (0)
268 #define med3(a,b,c) ((*cmp)((a),(b),d)<0 ? \
269 ((*cmp)((b),(c),d)<0 ? (b) : ((*cmp)((a),(c),d)<0 ? (c) : (a))) : \
270 ((*cmp)((b),(c),d)>0 ? (b) : ((*cmp)((a),(c),d)<0 ? (a) : (c))))
274 int (*
cmp)(
const void*,
const void*,
void*),
void *d)
276 register char *l, *r, *m;
277 register int t, eq_l, eq_r;
279 char *
R = (
char*)base + size*(nel-1);
287 if (nel <= 1)
return;
292 if (stack == top)
return;
298 if ((*
cmp)(L,R,d) > 0)
mmswap(L,R);
goto nxt;
302 n = (r - l +
size) / size;
303 m = l + size * (n >> 1);
311 register char *p1 = l + n;
312 register char *p2 = p1 + n;
313 register char *p3 = p2 + n;
314 m1 =
med3(p1, p2, p3);
318 m3 =
med3(p1, p2, p3);
329 if ((t = (*
cmp)(l,m,d)) < 0) {
330 if ((t = (*
cmp)(m,r,d)) < 0) {
331 if (chklim && nel >= chklim) {
334 for (p=l; p<r; p+=size) if ((*cmp)(p,p+size,d) > 0)
goto fail;
340 if ((*
cmp)(l,r,d) <= 0) {
mmswap(m,r);
goto loopA;}
341 mmrot3(r,m,l);
goto loopA;
347 if ((t = (*
cmp)(m,r,d)) > 0) {
348 if (chklim && nel >= chklim) {
351 for (p=l; p<r; p+=
size)
if ((*
cmp)(p,p+size,d) < 0)
goto fail2;
355 fail2:
mmswap(l,r);
goto loopA;
358 if ((*
cmp)(l,r,d) <= 0) {
mmswap(l,m);
goto loopB;}
359 mmrot3(l,m,r);
goto loopA;
364 if ((t = (*
cmp)(m,r,d)) < 0) {
goto loopA;}
365 if (t > 0) {
mmswap(l,r);
goto loopB;}
369 if ((l += size) == r)
goto nxt;
370 if (l == m)
continue;
371 if ((t = (*
cmp)(l,m,d)) > 0) {
mmswap(l,r); l = L;
goto loopA;}
372 if (t < 0) {
mmswap(L,l); l = L;
goto loopB;}
375 loopA: eq_l = 1; eq_r = 1;
378 if ((l += size) == r)
380 if (l == m)
continue;
381 if ((t = (*
cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
385 if (l == (r -= size))
387 if (r == m) {m = l;
break;}
388 if ((t = (*
cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
394 loopB: eq_l = 1; eq_r = 1;
397 if (l == (r -= size))
399 if (r == m)
continue;
400 if ((t = (*
cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
404 if ((l += size) == r)
406 if (l == m) {m = r;
break;}
407 if ((t = (*
cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
416 if (l-L < R-r) {
PUSH(r,R); R = l;}
417 else {
PUSH(L,l); L = r;}
419 else if (eq_r == 0) L = r;
431 memcpy(tmp, str, len);
443 while (!getcwd(buf, size)) {
444 if (
errno != ERANGE) {
453 # define PATH_MAX 8192
630 #ifdef WORDS_BIGENDIAN
631 #define IEEE_BIG_ENDIAN
633 #define IEEE_LITTLE_ENDIAN
638 #undef IEEE_BIG_ENDIAN
639 #undef IEEE_LITTLE_ENDIAN
642 #if defined(__arm__) && !defined(__VFP_FP__)
643 #define IEEE_BIG_ENDIAN
644 #undef IEEE_LITTLE_ENDIAN
652 #define ULong unsigned int
653 #elif SIZEOF_LONG == 4
654 #define Long long int
655 #define ULong unsigned long int
659 #define Llong LONG_LONG
664 #define Bug(x) {fprintf(stderr, "%s\n", (x)); exit(EXIT_FAILURE);}
675 extern void *
MALLOC(
size_t);
677 #define MALLOC malloc
680 extern void FREE(
void*);
685 #ifndef Omit_Private_Memory
687 #define PRIVATE_MEM 2304
689 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))
694 #undef Avoid_Underflow
695 #ifdef IEEE_BIG_ENDIAN
698 #ifdef IEEE_LITTLE_ENDIAN
706 #define DBL_MAX_10_EXP 308
707 #define DBL_MAX_EXP 1024
713 #define DBL_MAX_10_EXP 75
714 #define DBL_MAX_EXP 63
716 #define DBL_MAX 7.2370055773322621e+75
721 #define DBL_MAX_10_EXP 38
722 #define DBL_MAX_EXP 127
724 #define DBL_MAX 1.7014118346046923e+38
728 #define LONG_MAX 2147483647
746 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + defined(IBM) != 1
750 typedef union {
double d; ULong L[2]; }
U;
755 # ifdef IEEE_LITTLE_ENDIAN
756 # define word0(x) (((ULong *)&(x))[1])
757 # define word1(x) (((ULong *)&(x))[0])
759 # define word0(x) (((ULong *)&(x))[0])
760 # define word1(x) (((ULong *)&(x))[1])
764 # ifdef IEEE_LITTLE_ENDIAN
765 # define word0(x) ((x).L[1])
766 # define word1(x) ((x).L[0])
768 # define word0(x) ((x).L[0])
769 # define word1(x) ((x).L[1])
771 # define dval(x) ((x).d)
778 #if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm__)
779 #define Storeinc(a,b,c) (((unsigned short *)(a))[1] = (unsigned short)(b), \
780 ((unsigned short *)(a))[0] = (unsigned short)(c), (a)++)
782 #define Storeinc(a,b,c) (((unsigned short *)(a))[0] = (unsigned short)(b), \
783 ((unsigned short *)(a))[1] = (unsigned short)(c), (a)++)
794 #define Exp_shift1 20
795 #define Exp_msk1 0x100000
796 #define Exp_msk11 0x100000
797 #define Exp_mask 0x7ff00000
801 #define Exp_1 0x3ff00000
802 #define Exp_11 0x3ff00000
804 #define Frac_mask 0xfffff
805 #define Frac_mask1 0xfffff
808 #define Bndry_mask 0xfffff
809 #define Bndry_mask1 0xfffff
811 #define Sign_bit 0x80000000
817 #ifndef NO_IEEE_Scale
818 #define Avoid_Underflow
820 #undef Sudden_Underflow
826 #define Flt_Rounds FLT_ROUNDS
832 #ifdef Honor_FLT_ROUNDS
833 #define Rounding rounding
834 #undef Check_FLT_ROUNDS
835 #define Check_FLT_ROUNDS
837 #define Rounding Flt_Rounds
841 #undef Check_FLT_ROUNDS
842 #undef Honor_FLT_ROUNDS
844 #undef Sudden_Underflow
845 #define Sudden_Underflow
850 #define Exp_shift1 24
851 #define Exp_msk1 0x1000000
852 #define Exp_msk11 0x1000000
853 #define Exp_mask 0x7f000000
856 #define Exp_1 0x41000000
857 #define Exp_11 0x41000000
859 #define Frac_mask 0xffffff
860 #define Frac_mask1 0xffffff
863 #define Bndry_mask 0xefffff
864 #define Bndry_mask1 0xffffff
866 #define Sign_bit 0x80000000
868 #define Tiny0 0x100000
877 #define Exp_msk1 0x80
878 #define Exp_msk11 0x800000
879 #define Exp_mask 0x7f80
882 #define Exp_1 0x40800000
883 #define Exp_11 0x4080
885 #define Frac_mask 0x7fffff
886 #define Frac_mask1 0xffff007f
889 #define Bndry_mask 0xffff007f
890 #define Bndry_mask1 0xffff007f
892 #define Sign_bit 0x8000
906 #define rounded_product(a,b) ((a) = rnd_prod((a), (b)))
907 #define rounded_quotient(a,b) ((a) = rnd_quot((a), (b)))
908 extern double rnd_prod(
double,
double), rnd_quot(
double,
double);
910 #define rounded_product(a,b) ((a) *= (b))
911 #define rounded_quotient(a,b) ((a) /= (b))
914 #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))
915 #define Big1 0xffffffff
921 #define FFFFFFFF 0xffffffffUL
935 #define Llong long long
938 #define ULLong unsigned Llong
942 #define MULTIPLE_THREADS 1
944 #ifndef MULTIPLE_THREADS
945 #define ACQUIRE_DTOA_LOCK(n)
946 #define FREE_DTOA_LOCK(n)
948 #define ACQUIRE_DTOA_LOCK(n)
949 #define FREE_DTOA_LOCK(n)
969 #ifndef Omit_Private_Memory
974 if (k <=
Kmax && (rv = freelist[k]) != 0) {
975 freelist[
k] = rv->
next;
979 #ifdef Omit_Private_Memory
982 len = (
sizeof(
Bigint) + (x-1)*
sizeof(ULong) +
sizeof(
double) - 1)
1008 v->
next = freelist[v->
k];
1014 #define Bcopy(x,y) memcpy((char *)&(x)->sign, (char *)&(y)->sign, \
1015 (y)->wds*sizeof(Long) + 2*sizeof(int))
1038 y = *x * (
ULLong)m + carry;
1044 y = (xi & 0xffff) * m + carry;
1045 z = (xi >> 16) * m + (y >> 16);
1047 *x++ = (z << 16) + (y & 0xffff);
1054 }
while (++i < wds);
1062 b->
x[wds++] = (ULong)carry;
1069 s2b(
const char *s,
int nd0,
int nd, ULong y9)
1076 for (k = 0, y = 1; x > y; y <<= 1, k++) ;
1083 b->
x[0] = y9 & 0xffff;
1084 b->
wds = (b->
x[1] = y9 >> 16) ? 2 : 1;
1091 b =
multadd(b, 10, *s++ -
'0');
1092 }
while (++i < nd0);
1098 b =
multadd(b, 10, *s++ -
'0');
1107 if (!(x & 0xffff0000)) {
1111 if (!(x & 0xff000000)) {
1115 if (!(x & 0xf0000000)) {
1119 if (!(x & 0xc0000000)) {
1123 if (!(x & 0x80000000)) {
1125 if (!(x & 0x40000000))
1135 register ULong
x = *y;
1148 if (!(x & 0xffff)) {
1190 ULong *
x, *xa, *xae, *xb, *xbe, *xc, *xc0;
1213 for (x = c->
x, xa = x + wc; x < xa; x++)
1221 for (; xb < xbe; xc0++) {
1222 if ((y = *xb++) != 0) {
1227 z = *x++ * (
ULLong)y + *xc + carry;
1236 for (; xb < xbe; xb++, xc0++) {
1237 if (y = *xb & 0xffff) {
1242 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
1244 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
1250 if (y = *xb >> 16) {
1256 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
1259 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
1266 for (; xb < xbe; xc0++) {
1272 z = *x++ * y + *xc + carry;
1281 for (xc0 = c->
x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
1293 static int p05[3] = { 5, 25, 125 };
1295 if ((i = k & 3) != 0)
1302 #ifdef MULTIPLE_THREADS
1305 p5 = p5s =
i2b(625);
1310 p5 = p5s =
i2b(625);
1322 if (!(p51 = p5->
next)) {
1323 #ifdef MULTIPLE_THREADS
1325 if (!(p51 = p5->
next)) {
1345 ULong *
x, *x1, *xe, z;
1353 n1 = n + b->
wds + 1;
1354 for (i = b->
maxwds; n1 > i; i <<= 1)
1358 for (i = 0; i < n; i++)
1367 *x1++ = *x << k | z;
1378 *x1++ = *x << k & 0xffff | z;
1397 ULong *xa, *xa0, *xb, *xb0;
1403 if (i > 1 && !a->
x[i-1])
1404 Bug(
"cmp called with a->x[a->wds-1] == 0");
1405 if (j > 1 && !b->
x[j-1])
1406 Bug(
"cmp called with b->x[b->wds-1] == 0");
1416 return *xa < *xb ? -1 : 1;
1428 ULong *xa, *xae, *xb, *xbe, *xc;
1465 y = (
ULLong)*xa++ - *xb++ - borrow;
1466 borrow = y >> 32 & (ULong)1;
1471 borrow = y >> 32 & (ULong)1;
1477 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
1478 borrow = (y & 0x10000) >> 16;
1479 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
1480 borrow = (z & 0x10000) >> 16;
1484 y = (*xa & 0xffff) - borrow;
1485 borrow = (y & 0x10000) >> 16;
1486 z = (*xa++ >> 16) - borrow;
1487 borrow = (z & 0x10000) >> 16;
1492 y = *xa++ - *xb++ - borrow;
1493 borrow = (y & 0x10000) >> 16;
1498 borrow = (y & 0x10000) >> 16;
1517 #ifndef Avoid_Underflow
1518 #ifndef Sudden_Underflow
1527 #ifndef Avoid_Underflow
1528 #ifndef Sudden_Underflow
1532 if (L < Exp_shift) {
1533 word0(a) = 0x80000 >> L;
1539 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
1550 ULong *xa, *xa0, w, y, z;
1564 if (!y) Bug(
"zero y in b2d");
1571 w = xa > xa0 ? *--xa : 0;
1575 z = xa > xa0 ? *--xa : 0;
1577 d0 =
Exp_1 | y << k | z >> (32 -
k);
1578 y = xa > xa0 ? *--xa : 0;
1579 d1 = z << k | y >> (32 -
k);
1586 if (k <
Ebits + 16) {
1587 z = xa > xa0 ? *--xa : 0;
1589 w = xa > xa0 ? *--xa : 0;
1590 y = xa > xa0 ? *--xa : 0;
1594 z = xa > xa0 ? *--xa : 0;
1595 w = xa > xa0 ? *--xa : 0;
1597 d0 =
Exp_1 | y << k + 16 | z << k | w >> 16 -
k;
1598 y = xa > xa0 ? *--xa : 0;
1599 d1 = w << k + 16 | y <<
k;
1603 word0(d) = d0 >> 16 | d0 << 16;
1604 word1(d) = d1 >> 16 | d1 << 16;
1613 d2b(
double d_,
int *e,
int *bits)
1619 #ifndef Sudden_Underflow
1643 #ifdef Sudden_Underflow
1653 if ((y = d1) != 0) {
1655 x[0] = y | z << (32 -
k);
1660 #ifndef Sudden_Underflow
1663 b->
wds = (x[1] = z) ? 2 : 1;
1668 Bug(
"Zero passed to d2b");
1672 #ifndef Sudden_Underflow
1682 x[0] = y | z << 32 - k & 0xffff;
1683 x[1] = z >> k - 16 & 0xffff;
1689 x[1] = y >> 16 | z << 16 - k & 0xffff;
1690 x[2] = z >> k & 0xffff;
1705 Bug(
"Zero passed to d2b");
1723 #ifndef Sudden_Underflow
1727 *e = (de -
Bias - (
P-1) << 2) +
k;
1730 *e = de -
Bias - (
P-1) + k;
1733 #ifndef Sudden_Underflow
1736 *e = de -
Bias - (
P-1) + 1 + k;
1738 *bits = 32*i -
hi0bits(x[i-1]);
1740 *bits = (i+2)*16 -
hi0bits(x[i]);
1758 k = ka - kb + 32*(a->
wds - b->
wds);
1760 k = ka - kb + 16*(a->
wds - b->
wds);
1787 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
1788 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
1798 static const double tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
1799 #ifdef Avoid_Underflow
1800 9007199254740992.*9007199254740992.e-256
1808 #define Scale_Bit 0x10
1812 bigtens[] = { 1e16, 1e32, 1e64 };
1813 static const double tinytens[] = { 1e-16, 1e-32, 1e-64 };
1817 static const double tinytens[] = { 1e-16, 1e-32 };
1829 #define NAN_WORD0 0x7ff80000
1837 match(
const char **sp,
char *t)
1840 const char *s = *sp;
1843 if ((c = *++s) >=
'A' && c <=
'Z')
1854 hexnan(
double *rvp,
const char **sp)
1858 int havedig, udx0, xshift;
1861 havedig = xshift = 0;
1864 while (c = *(
const unsigned char*)++s) {
1865 if (c >=
'0' && c <=
'9')
1867 else if (c >=
'a' && c <=
'f')
1869 else if (c >=
'A' && c <=
'F')
1871 else if (c <=
' ') {
1872 if (udx0 && havedig) {
1878 else if ( c ==
')' && havedig) {
1891 x[0] = (x[0] << 4) | (x[1] >> 28);
1892 x[1] = (x[1] << 4) | c;
1894 if ((x[0] &= 0xfffff) || x[1]) {
1905 #ifdef Avoid_Underflow
1908 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
1909 e, e1, esign,
i, j,
k, nd, nd0, nf, nz, nz0,
sign;
1910 const char *s, *s0, *s1;
1912 double_u aadj1, rv, rv0;
1915 Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
1917 int inexact, oldinexact;
1919 #ifdef Honor_FLT_ROUNDS
1927 sign = nz0 = nz = 0;
1952 if (s[1] ==
'x' || s[1] ==
'X') {
1953 static const char hexdigit[] =
"0123456789abcdef0123456789ABCDEF";
1959 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
1960 while (*s ==
'0') s++;
1963 adj += aadj * ((s1 - hexdigit) & 15);
1966 }
while (*++s && (s1 =
strchr(hexdigit, *s)));
1971 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
1978 for (; *s && (s1 =
strchr(hexdigit, *s)); ++s) {
1979 adj += aadj * ((s1 - hexdigit) & 15);
1980 if ((aadj /= 16) == 0.0) {
1981 while (
strchr(hexdigit, *++s));
1990 if (*s ==
'P' || *s ==
'p') {
1991 dsign = 0x2C - *++s;
1992 if (abs(dsign) == 1) s++;
1997 if (c <
'0' ||
'9' < c)
goto ret0;
2004 if (nd + dsign * nd0 > 2095) {
2005 while (
'0' <= c && c <=
'9') c = *++s;
2008 }
while (
'0' <= c && c <=
'9');
2012 if (dsign)
goto ret0;
2014 dval(rv) = ldexp(adj, nd0);
2018 while (*++s ==
'0') ;
2024 for (nd = nf = 0; (c = *s) >=
'0' && c <=
'9'; nd++, s++)
2031 s1 = localeconv()->decimal_point;
2054 for (; c ==
'0'; c = *++s)
2056 if (c >
'0' && c <=
'9') {
2064 for (; c >=
'0' && c <=
'9'; c = *++s) {
2067 if (nf >
DBL_DIG * 4)
continue;
2070 for (i = 1; i < nz; i++)
2085 if (c ==
'e' || c ==
'E') {
2086 if (!nd && !nz && !nz0) {
2097 if (c >=
'0' && c <=
'9') {
2100 if (c >
'0' && c <=
'9') {
2103 while ((c = *++s) >=
'0' && c <=
'9')
2105 if (s - s1 > 8 || L > 19999)
2128 if (
match(&s,
"nf")) {
2130 if (!
match(&s,
"inity"))
2132 word0(rv) = 0x7ff00000;
2139 if (
match(&s,
"an")) {
2140 word0(rv) = NAN_WORD0;
2141 word1(rv) = NAN_WORD1;
2170 oldinexact = get_inexact();
2174 bd0 = bb = bd = bs = delta = 0;
2176 #ifndef RND_PRODQUOT
2177 #ifndef Honor_FLT_ROUNDS
2187 goto vax_ovfl_check;
2189 #ifdef Honor_FLT_ROUNDS
2205 #ifdef Honor_FLT_ROUNDS
2231 #ifndef Inaccurate_Divide
2233 #ifdef Honor_FLT_ROUNDS
2251 oldinexact = get_inexact();
2253 #ifdef Avoid_Underflow
2256 #ifdef Honor_FLT_ROUNDS
2259 rounding = rounding == 2 ? 0 : 2;
2270 if ((i = e1 & 15) != 0)
2280 #ifdef Honor_FLT_ROUNDS
2309 for (j = 0; e1 > 1; j++, e1 >>= 1)
2330 if ((i = e1 & 15) != 0)
2335 #ifdef Avoid_Underflow
2338 for (j = 0; e1 > 0; j++, e1 >>= 1)
2340 dval(rv) *= tinytens[j];
2349 word0(rv) &= 0xffffffff << (j-32);
2352 word1(rv) &= 0xffffffff << j;
2355 for (j = 0; e1 > 1; j++, e1 >>= 1)
2357 dval(rv) *= tinytens[j];
2360 dval(rv) *= tinytens[j];
2363 dval(rv) *= tinytens[j];
2375 #ifndef Avoid_Underflow
2390 bd0 =
s2b(s0, nd0, nd, y);
2395 bb =
d2b(
dval(rv), &bbe, &bbbits);
2411 #ifdef Honor_FLT_ROUNDS
2415 #ifdef Avoid_Underflow
2423 #ifdef Sudden_Underflow
2425 j = 1 + 4*
P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
2440 #ifdef Avoid_Underflow
2443 i = bb2 < bd2 ? bb2 : bd2;
2465 delta =
diff(bb, bd);
2466 dsign = delta->
sign;
2469 #ifdef Honor_FLT_ROUNDS
2470 if (rounding != 1) {
2473 if (!delta->
x[0] && delta->
wds <= 1) {
2491 #ifdef Avoid_Underflow
2498 if (
cmp(delta, bs) <= 0)
2503 #ifdef Avoid_Underflow
2506 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2508 #ifdef Sudden_Underflow
2509 if ((
word0(rv) & Exp_mask) <=
2522 adj =
ratio(delta, bs);
2525 if (adj <= 0x7ffffffe) {
2529 if (!((rounding>>1) ^ dsign))
2534 #ifdef Avoid_Underflow
2536 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2538 #ifdef Sudden_Underflow
2574 if (!delta->
x[0] && delta->
wds <= 1)
2579 if (!delta->
x[0] && delta->
wds <= 1) {
2587 if (
cmp(delta, bs) > 0)
2598 ? (0xffffffff & (0xffffffff << (2*
P+1-(y>>
Exp_shift)))) :
2609 #ifdef Avoid_Underflow
2618 #ifdef Sudden_Underflow
2623 #ifdef Avoid_Underflow
2632 #ifdef Avoid_Underflow
2635 if (L <= (2*
P+1)*Exp_msk1) {
2636 if (L > (
P+2)*Exp_msk1)
2648 word1(rv) = 0xffffffff;
2655 #ifndef ROUND_BIASED
2661 #ifndef ROUND_BIASED
2664 #ifndef Sudden_Underflow
2669 #ifdef Avoid_Underflow
2675 if ((aadj =
ratio(delta, bs)) <= 2.) {
2677 aadj =
dval(aadj1) = 1.;
2679 #ifndef Sudden_Underflow
2694 dval(aadj1) = -aadj;
2699 dval(aadj1) = dsign ? aadj : -aadj;
2700 #ifdef Check_FLT_ROUNDS
2735 #ifdef Avoid_Underflow
2737 if (aadj <= 0x7fffffff) {
2738 if ((z = (
int)aadj) <= 0)
2741 dval(aadj1) = dsign ? aadj : -aadj;
2743 word0(aadj1) += (2*
P+1)*Exp_msk1 - y;
2748 #ifdef Sudden_Underflow
2755 if ((
word0(rv) & Exp_mask) <
P*Exp_msk1)
2757 if ((
word0(rv) & Exp_mask) <=
P*Exp_msk1)
2781 if (y <= (
P-1)*Exp_msk1 && aadj > 1.) {
2782 dval(aadj1) = (double)(
int)(aadj + 0.5);
2793 #ifdef Avoid_Underflow
2802 if (aadj < .4999999 || aadj > .5000001)
2823 else if (!oldinexact)
2826 #ifdef Avoid_Underflow
2854 return sign ? -
dval(rv) :
dval(rv);
2861 ULong *bx, *bxe, q, *sx, *sxe;
2863 ULLong borrow, carry, y, ys;
2865 ULong borrow, carry, y, ys;
2874 Bug(
"oversize b in quorem");
2882 q = *bxe / (*sxe + 1);
2885 Bug(
"oversized quotient in quorem");
2892 ys = *sx++ * (
ULLong)q + carry;
2894 y = *bx - (ys &
FFFFFFFF) - borrow;
2895 borrow = y >> 32 & (ULong)1;
2900 ys = (si & 0xffff) * q + carry;
2901 zs = (si >> 16) * q + (ys >> 16);
2903 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2904 borrow = (y & 0x10000) >> 16;
2905 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2906 borrow = (z & 0x10000) >> 16;
2909 ys = *sx++ * q + carry;
2911 y = *bx - (ys & 0xffff) - borrow;
2912 borrow = (y & 0x10000) >> 16;
2916 }
while (sx <= sxe);
2919 while (--bxe > bx && !*bxe)
2924 if (
cmp(b, S) >= 0) {
2934 y = *bx - (ys &
FFFFFFFF) - borrow;
2935 borrow = y >> 32 & (ULong)1;
2940 ys = (si & 0xffff) + carry;
2941 zs = (si >> 16) + (ys >> 16);
2943 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2944 borrow = (y & 0x10000) >> 16;
2945 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2946 borrow = (z & 0x10000) >> 16;
2951 y = *bx - (ys & 0xffff) - borrow;
2952 borrow = (y & 0x10000) >> 16;
2956 }
while (sx <= sxe);
2960 while (--bxe > bx && !*bxe)
2968 #ifndef MULTIPLE_THREADS
2969 static char *dtoa_result;
2972 #ifndef MULTIPLE_THREADS
2976 return dtoa_result =
xmalloc(i);
2979 #define rv_alloc(i) xmalloc(i)
2988 while ((*t = *s++) != 0) t++;
2994 #define rv_strdup(s, rve) nrv_alloc((s), (rve), strlen(s)+1)
2996 #ifndef MULTIPLE_THREADS
3085 int bbits, b2, b5, be, dig,
i, ieps, ilim, ilim0, ilim1,
3086 j, j1,
k, k0, k_check, leftright, m2, m5, s2, s5,
3087 spec_case, try_quick;
3089 #ifndef Sudden_Underflow
3093 Bigint *b, *b1, *delta, *mlo = 0, *mhi = 0, *
S;
3095 double_u d, d2, eps;
3097 #ifdef Honor_FLT_ROUNDS
3101 int inexact, oldinexact;
3106 #ifndef MULTIPLE_THREADS
3108 freedtoa(dtoa_result);
3116 word0(d) &= ~Sign_bit;
3121 #if defined(IEEE_Arith) + defined(VAX)
3125 if (
word0(d) == 0x8000)
3146 try_quick = oldinexact = get_inexact();
3149 #ifdef Honor_FLT_ROUNDS
3152 rounding = rounding == 2 ? 0 : 2;
3159 b =
d2b(
dval(d), &be, &bbits);
3160 #ifdef Sudden_Underflow
3200 #ifndef Sudden_Underflow
3206 i = bbits + be + (
Bias + (
P-1) - 1);
3207 x = i > 32 ?
word0(d) << (64 -
i) |
word1(d) >> (i - 32)
3211 i -= (
Bias + (
P-1) - 1) + 1;
3215 ds = (
dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
3217 if (ds < 0. && ds != k)
3244 if (mode < 0 || mode > 9)
3248 #ifdef Check_FLT_ROUNDS
3273 ilim = ilim1 = i = ndigits;
3279 i = ndigits + k + 1;
3287 #ifdef Honor_FLT_ROUNDS
3288 if (mode > 1 && rounding != 1)
3292 if (ilim >= 0 && ilim <=
Quick_max && try_quick) {
3310 for (; j; j >>= 1, i++)
3317 else if ((j1 = -k) != 0) {
3319 for (j = j1 >> 4; j; j >>= 1, i++)
3325 if (k_check &&
dval(d) < 1. && ilim > 0) {
3344 #ifndef No_leftright
3353 *s++ =
'0' + (int)L;
3368 for (i = 1;; i++,
dval(d) *= 10.) {
3369 L = (Long)(
dval(d));
3370 if (!(
dval(d) -= L))
3372 *s++ =
'0' + (int)L;
3376 else if (
dval(d) < 0.5 -
dval(eps)) {
3377 while (*--s ==
'0') ;
3384 #ifndef No_leftright
3396 if (be >= 0 && k <=
Int_max) {
3399 if (ndigits < 0 && ilim <= 0) {
3401 if (ilim < 0 ||
dval(d) <= 5*ds)
3405 for (i = 1;; i++,
dval(d) *= 10.) {
3406 L = (Long)(
dval(d) / ds);
3408 #ifdef Check_FLT_ROUNDS
3415 *s++ =
'0' + (int)L;
3423 #ifdef Honor_FLT_ROUNDS
3427 case 2:
goto bump_up;
3431 if (
dval(d) > ds || (
dval(d) == ds && (L & 1))) {
3451 #ifndef Sudden_Underflow
3452 denorm ? be + (
Bias + (
P-1) - 1 + 1) :
3455 1 + 4*
P - 3 - bbits + ((bbits + be - 1) & 3);
3463 if (m2 > 0 && s2 > 0) {
3464 i = m2 < s2 ? m2 : s2;
3477 if ((j = b5 - m5) != 0)
3490 if ((mode < 2 || leftright)
3491 #ifdef Honor_FLT_ROUNDS
3496 #ifndef Sudden_Underflow
3515 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0x1f) != 0)
3518 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0xf) != 0)
3546 if (ilim <= 0 && (mode == 3 || mode == 5)) {
3579 delta =
diff(
S, mhi);
3580 j1 = delta->
sign ? 1 :
cmp(b, delta);
3582 #ifndef ROUND_BIASED
3583 if (j1 == 0 && mode != 1 && !(
word1(d) & 1)
3584 #ifdef Honor_FLT_ROUNDS
3593 else if (!b->
x[0] && b->
wds <= 1)
3600 if (j < 0 || (j == 0 && mode != 1
3601 #ifndef ROUND_BIASED
3605 if (!b->
x[0] && b->
wds <= 1) {
3611 #ifdef Honor_FLT_ROUNDS
3614 case 0:
goto accept_dig;
3615 case 2:
goto keep_dig;
3621 if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ ==
'9')
3629 #ifdef Honor_FLT_ROUNDS
3641 #ifdef Honor_FLT_ROUNDS
3649 mlo = mhi =
multadd(mhi, 10, 0);
3658 *s++ = dig =
quorem(b,
S) +
'0';
3659 if (!b->
x[0] && b->
wds <= 1) {
3672 #ifdef Honor_FLT_ROUNDS
3674 case 0:
goto trimzeros;
3675 case 2:
goto roundoff;
3680 if (j > 0 || (j == 0 && (dig & 1))) {
3691 while (*--s ==
'0') ;
3697 if (mlo && mlo != mhi)
3710 else if (!oldinexact)
3728 for (; *str; str = end) {
3729 while (
ISSPACE(*str) || *str ==
',') str++;
3732 while (*end && !
ISSPACE(*end) && *end !=
',') end++;
3733 len = (int)(end - str);
3764 #define DBL_MANH_SIZE 20
3765 #define DBL_MANL_SIZE 32
3766 #define DBL_ADJ (DBL_MAX_EXP - 2)
3767 #define SIGFIGS ((DBL_MANT_DIG + 3) / 4 + 1)
3768 #define dexp_get(u) ((int)(word0(u) >> Exp_shift) & ~Exp_msk1)
3769 #define dexp_set(u,v) (word0(u) = (((int)(word0(u)) & ~Exp_mask) | ((v) << Exp_shift)))
3770 #define dmanh_get(u) ((uint32_t)(word0(u) & Frac_mask))
3771 #define dmanl_get(u) ((uint32_t)word1(u))
3811 word0(u) &= ~Sign_bit;
3820 else if (
isnan(d)) {
3824 else if (d == 0.0) {
3832 u.
d *= 5.363123171977039e+154 ;
3843 bufsize = (ndigits > 0) ? ndigits :
SIGFIGS;
3847 if (
SIGFIGS > ndigits && ndigits > 0) {
3862 for (s = s0 + 1; s < s0 + bufsize; s++) {
3870 for (ndigits =
SIGFIGS; s0[ndigits - 1] ==
'0'; ndigits--)
static int lo0bits(ULong *y)
size_t strlen(const char *)
static unsigned char S[8][64]
#define ACQUIRE_DTOA_LOCK(n)
static Bigint * Balloc(int k)
#define rv_strdup(s, rve)
static Bigint * pow5mult(Bigint *b, int k)
unsigned long ruby_scan_hex(const char *start, size_t len, size_t *retlen)
static const char ZEROSTR[]
static void mmswap_(register char *a, register char *b, int mmkind, size_t size, size_t high, size_t low)
static double ulp(double x_)
#define Storeinc(a, b, c)
static int hi0bits(register ULong x)
static Bigint * lshift(Bigint *b, int k)
static const char NANSTR[]
static double private_mem[PRIVATE_mem]
static char * nrv_alloc(const char *s, char **rve, size_t n)
static unsigned long scan_digits(const char *str, int base, size_t *retlen, int *overflow)
static int quorem(Bigint *b, Bigint *S)
void ruby_qsort(void *base, const size_t nel, const size_t size, int(*cmp)(const void *, const void *, void *), void *d)
RUBY_EXTERN int isinf(double)
static Bigint * s2b(const char *s, int nd0, int nd, ULong y9)
static double * pmem_next
double ruby_strtod(const char *s00, char **se)
SSL_METHOD *(* func)(void)
static const double tens[]
#define rounded_product(a, b)
static const char INFSTR[]
unsigned char buf[MIME_BUF_SIZE]
static const double bigtens[]
static int cmp(Bigint *a, Bigint *b)
#define rounded_quotient(a, b)
static Bigint * multadd(Bigint *b, int m, int a)
char * strchr(char *, char)
static double b2d(Bigint *a, int *e)
register unsigned int len
void rb_sys_fail(const char *mesg)
unsigned long ruby_scan_oct(const char *start, size_t len, size_t *retlen)
#define IEEE_LITTLE_ENDIAN
static Bigint * d2b(double d_, int *e, int *bits)
char * ruby_hdtoa(double d, const char *xdigs, int ndigits, int *decpt, int *sign, char **rve)
#define FREE_DTOA_LOCK(n)
#define mmprepare(base, size)
static Bigint * diff(Bigint *a, Bigint *b)
static double ratio(Bigint *a, Bigint *b)
static void Bfree(Bigint *v)
unsigned long ruby_strtoul(const char *str, char **endptr, int base)
void ruby_each_words(const char *str, void(*func)(const char *, int, void *), void *arg)
static void mmrot3_(register char *a, register char *b, register char *c, int mmkind, size_t size, size_t high, size_t low)
static const double tinytens[]
static Bigint * freelist[Kmax+1]
static int match(VALUE str, VALUE pat, VALUE hash, int(*cb)(VALUE, VALUE))
char * ruby_strdup(const char *str)
static Bigint * i2b(int i)
static Bigint * mult(Bigint *a, Bigint *b)
char * ruby_dtoa(double d_, int mode, int ndigits, int *decpt, int *sign, char **rve)