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) 191 #define mmcount (16 / SIZEOF_LONG) 192 #define A ((mmtype*)a) 193 #define B ((mmtype*)b) 194 #define C ((mmtype*)c) 195 #define D ((mmtype*)d) 197 #define mmstep (sizeof(mmtype) * mmcount) 198 #define mmprepare(base, size) do {\ 199 if (((VALUE)(base) % sizeof(mmtype)) == 0 && ((size) % sizeof(mmtype)) == 0) \ 200 if ((size) >= mmstep) mmkind = 1;\ 203 high = ((size) / mmstep) * mmstep;\ 204 low = ((size) % mmstep);\ 207 #define mmarg mmkind, size, high, low 208 #define mmargdecl int mmkind, size_t size, size_t high, size_t low 217 register char *t = a + high;
219 s =
A[0];
A[0] =
B[0];
B[0] = s;
220 s =
A[1];
A[1] =
B[1];
B[1] = s;
222 s =
A[2];
A[2] =
B[2];
B[2] = s;
224 s =
A[3];
A[3] =
B[3];
B[3] = s;
231 if (low != 0) { s =
A[0];
A[0] =
B[0];
B[0] = s;
233 if (low >= 2 *
sizeof(
mmtype)) { s =
A[1];
A[1] =
B[1];
B[1] = s;
235 if (low >= 3 *
sizeof(
mmtype)) {s =
A[2];
A[2] =
B[2];
B[2] = s;}
242 register char *t = a +
size, s;
243 do {s = *a; *a++ = *b; *b++ = s;}
while (a < t);
246 #define mmswap(a,b) mmswap_((a),(b),mmarg) 255 register char *t = a + high;
257 s =
A[0];
A[0] =
B[0];
B[0] =
C[0];
C[0] = s;
258 s =
A[1];
A[1] =
B[1];
B[1] =
C[1];
C[1] = s;
260 s =
A[2];
A[2] =
B[2];
B[2] =
C[2];
C[2] = s;
262 s =
A[3];
A[3] =
B[3];
B[3] =
C[3];
C[3] = s;
269 if (low != 0) { s =
A[0];
A[0] =
B[0];
B[0] =
C[0];
C[0] = s;
271 if (low >= 2 *
sizeof(
mmtype)) { s =
A[1];
A[1] =
B[1];
B[1] =
C[1];
C[1] = s;
273 if (low == 3 *
sizeof(
mmtype)) {s =
A[2];
A[2] =
B[2];
B[2] =
C[2];
C[2] = s;}
280 register char *t = a +
size, s;
281 do {s = *a; *a++ = *b; *b++ = *c; *c++ = s;}
while (a < t);
284 #define mmrot3(a,b,c) mmrot3_((a),(b),(c),mmarg) 296 #define PUSH(ll,rr) do { top->LL = (ll); top->RR = (rr); ++top; } while (0) 297 #define POP(ll,rr) do { --top; (ll) = top->LL; (rr) = top->RR; } while (0) 299 #define med3(a,b,c) ((*cmp)((a),(b),d)<0 ? \ 300 ((*cmp)((b),(c),d)<0 ? (b) : ((*cmp)((a),(c),d)<0 ? (c) : (a))) : \ 301 ((*cmp)((b),(c),d)>0 ? (b) : ((*cmp)((a),(c),d)<0 ? (a) : (c)))) 303 typedef int (
cmpfunc_t)(
const void*,
const void*,
void*);
307 register char *l, *r, *m;
308 register int t, eq_l, eq_r;
310 char *
R = (
char*)base +
size*(nel-1);
318 if (nel <= 1)
return;
323 if (stack ==
top)
return;
334 m = l +
size * (n >> 1);
342 register char *p1 = l + n;
343 register char *p2 = p1 + n;
344 register char *p3 = p2 + n;
345 m1 =
med3(p1, p2, p3);
349 m3 =
med3(p1, p2, p3);
360 if ((t = (*
cmp)(l,m,d)) < 0) {
361 if ((t = (*
cmp)(m,r,d)) < 0) {
362 if (chklim && nel >= chklim) {
365 for (
p=l; p<r; p+=size) if ((*cmp)(p,p+size,d) > 0)
goto fail;
371 if ((*
cmp)(l,r,d) <= 0) {
mmswap(m,r);
goto loopA;}
372 mmrot3(r,m,l);
goto loopA;
378 if ((t = (*
cmp)(m,r,d)) > 0) {
379 if (chklim && nel >= chklim) {
386 fail2:
mmswap(l,r);
goto loopA;
389 if ((*
cmp)(l,r,d) <= 0) {
mmswap(l,m);
goto loopB;}
390 mmrot3(l,m,r);
goto loopA;
395 if ((t = (*
cmp)(m,r,d)) < 0) {
goto loopA;}
396 if (t > 0) {
mmswap(l,r);
goto loopB;}
400 if ((l +=
size) == r)
goto nxt;
401 if (l == m)
continue;
402 if ((t = (*
cmp)(l,m,d)) > 0) {
mmswap(l,r); l = L;
goto loopA;}
403 if (t < 0) {
mmswap(L,l); l = L;
goto loopB;}
406 loopA: eq_l = 1; eq_r = 1;
409 if ((l +=
size) == r)
411 if (l == m)
continue;
412 if ((t = (*
cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
416 if (l == (r -=
size))
418 if (r == m) {m = l;
break;}
419 if ((t = (*
cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
425 loopB: eq_l = 1; eq_r = 1;
428 if (l == (r -=
size))
430 if (r == m)
continue;
431 if ((t = (*
cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
435 if ((l +=
size) == r)
437 if (l == m) {m = r;
break;}
438 if ((t = (*
cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
447 if (l-L <
R-r) {
PUSH(r,
R);
R = l;}
448 else {
PUSH(L,l); L = r;}
450 else if (eq_r == 0) L = r;
459 size_t len =
strlen(str) + 1;
462 memcpy(tmp, str, len);
467 #ifdef __native_client__ 484 if (
errno != ERANGE) {
493 # define PATH_MAX 8192 671 #ifdef WORDS_BIGENDIAN 672 #define IEEE_BIG_ENDIAN 674 #define IEEE_LITTLE_ENDIAN 679 #undef IEEE_BIG_ENDIAN 680 #undef IEEE_LITTLE_ENDIAN 683 #if defined(__arm__) && !defined(__VFP_FP__) 684 #define IEEE_BIG_ENDIAN 685 #undef IEEE_LITTLE_ENDIAN 693 #define ULong unsigned int 694 #elif SIZEOF_LONG == 4 695 #define Long long int 696 #define ULong unsigned long int 700 #define Llong LONG_LONG 705 #define Bug(x) {fprintf(stderr, "%s\n", (x)); exit(EXIT_FAILURE);} 716 extern void *
MALLOC(
size_t);
718 #define MALLOC malloc 721 extern void FREE(
void*);
726 #ifndef Omit_Private_Memory 728 #define PRIVATE_MEM 2304 730 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double)) 735 #undef Avoid_Underflow 736 #ifdef IEEE_BIG_ENDIAN 739 #ifdef IEEE_LITTLE_ENDIAN 747 #define DBL_MAX_10_EXP 308 748 #define DBL_MAX_EXP 1024 754 #define DBL_MAX_10_EXP 75 755 #define DBL_MAX_EXP 63 757 #define DBL_MAX 7.2370055773322621e+75 762 #define DBL_MAX_10_EXP 38 763 #define DBL_MAX_EXP 127 765 #define DBL_MAX 1.7014118346046923e+38 769 #define LONG_MAX 2147483647 787 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + defined(IBM) != 1 791 typedef union {
double d; ULong L[2]; }
U;
796 # ifdef IEEE_LITTLE_ENDIAN 797 # define word0(x) (((ULong *)&(x))[1]) 798 # define word1(x) (((ULong *)&(x))[0]) 800 # define word0(x) (((ULong *)&(x))[0]) 801 # define word1(x) (((ULong *)&(x))[1]) 805 # ifdef IEEE_LITTLE_ENDIAN 806 # define word0(x) ((x).L[1]) 807 # define word1(x) ((x).L[0]) 809 # define word0(x) ((x).L[0]) 810 # define word1(x) ((x).L[1]) 812 # define dval(x) ((x).d) 819 #if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm__) 820 #define Storeinc(a,b,c) (((unsigned short *)(a))[1] = (unsigned short)(b), \ 821 ((unsigned short *)(a))[0] = (unsigned short)(c), (a)++) 823 #define Storeinc(a,b,c) (((unsigned short *)(a))[0] = (unsigned short)(b), \ 824 ((unsigned short *)(a))[1] = (unsigned short)(c), (a)++) 835 #define Exp_shift1 20 836 #define Exp_msk1 0x100000 837 #define Exp_msk11 0x100000 838 #define Exp_mask 0x7ff00000 842 #define Exp_1 0x3ff00000 843 #define Exp_11 0x3ff00000 845 #define Frac_mask 0xfffff 846 #define Frac_mask1 0xfffff 849 #define Bndry_mask 0xfffff 850 #define Bndry_mask1 0xfffff 852 #define Sign_bit 0x80000000 858 #ifndef NO_IEEE_Scale 859 #define Avoid_Underflow 861 #undef Sudden_Underflow 867 #define Flt_Rounds FLT_ROUNDS 873 #ifdef Honor_FLT_ROUNDS 874 #define Rounding rounding 875 #undef Check_FLT_ROUNDS 876 #define Check_FLT_ROUNDS 878 #define Rounding Flt_Rounds 882 #undef Check_FLT_ROUNDS 883 #undef Honor_FLT_ROUNDS 885 #undef Sudden_Underflow 886 #define Sudden_Underflow 891 #define Exp_shift1 24 892 #define Exp_msk1 0x1000000 893 #define Exp_msk11 0x1000000 894 #define Exp_mask 0x7f000000 897 #define Exp_1 0x41000000 898 #define Exp_11 0x41000000 900 #define Frac_mask 0xffffff 901 #define Frac_mask1 0xffffff 904 #define Bndry_mask 0xefffff 905 #define Bndry_mask1 0xffffff 907 #define Sign_bit 0x80000000 909 #define Tiny0 0x100000 918 #define Exp_msk1 0x80 919 #define Exp_msk11 0x800000 920 #define Exp_mask 0x7f80 923 #define Exp_1 0x40800000 924 #define Exp_11 0x4080 926 #define Frac_mask 0x7fffff 927 #define Frac_mask1 0xffff007f 930 #define Bndry_mask 0xffff007f 931 #define Bndry_mask1 0xffff007f 933 #define Sign_bit 0x8000 947 #define rounded_product(a,b) ((a) = rnd_prod((a), (b))) 948 #define rounded_quotient(a,b) ((a) = rnd_quot((a), (b))) 949 extern double rnd_prod(
double,
double), rnd_quot(
double,
double);
951 #define rounded_product(a,b) ((a) *= (b)) 952 #define rounded_quotient(a,b) ((a) /= (b)) 955 #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1)) 956 #define Big1 0xffffffff 962 #define FFFFFFFF 0xffffffffUL 976 #define Llong long long 979 #define ULLong unsigned Llong 983 #define MULTIPLE_THREADS 1 985 #ifndef MULTIPLE_THREADS 986 #define ACQUIRE_DTOA_LOCK(n) 987 #define FREE_DTOA_LOCK(n) 989 #define ACQUIRE_DTOA_LOCK(n) 990 #define FREE_DTOA_LOCK(n) 1010 #ifndef Omit_Private_Memory 1020 #ifdef Omit_Private_Memory 1023 len = (
sizeof(
Bigint) + (
x-1)*
sizeof(ULong) +
sizeof(
double) - 1)
1055 #define Bcopy(x,y) memcpy((char *)&(x)->sign, (char *)&(y)->sign, \ 1056 (y)->wds*sizeof(Long) + 2*sizeof(int)) 1085 y = (xi & 0xffff) * m + carry;
1086 z = (xi >> 16) * m + (y >> 16);
1088 *
x++ = (z << 16) + (y & 0xffff);
1095 }
while (++
i <
wds);
1103 b->
x[
wds++] = (ULong)carry;
1110 s2b(
const char *s,
int nd0,
int nd, ULong y9)
1117 for (
k = 0, y = 1;
x > y; y <<= 1,
k++) ;
1124 b->
x[0] = y9 & 0xffff;
1125 b->
wds = (b->
x[1] = y9 >> 16) ? 2 : 1;
1132 b =
multadd(b, 10, *s++ -
'0');
1133 }
while (++
i < nd0);
1139 b =
multadd(b, 10, *s++ -
'0');
1148 if (!(
x & 0xffff0000)) {
1152 if (!(
x & 0xff000000)) {
1156 if (!(
x & 0xf0000000)) {
1160 if (!(
x & 0xc0000000)) {
1164 if (!(
x & 0x80000000)) {
1166 if (!(
x & 0x40000000))
1176 register ULong
x = *y;
1189 if (!(
x & 0xffff)) {
1231 ULong *
x, *xa, *xae, *xb, *xbe, *xc, *xc0;
1254 for (
x = c->
x, xa =
x + wc;
x < xa;
x++)
1262 for (; xb < xbe; xc0++) {
1263 if ((y = *xb++) != 0) {
1268 z = *
x++ * (
ULLong)y + *xc + carry;
1277 for (; xb < xbe; xb++, xc0++) {
1278 if (y = *xb & 0xffff) {
1283 z = (*
x & 0xffff) * y + (*xc & 0xffff) + carry;
1285 z2 = (*
x++ >> 16) * y + (*xc >> 16) + carry;
1291 if (y = *xb >> 16) {
1297 z = (*
x & 0xffff) * y + (*xc >> 16) + carry;
1300 z2 = (*
x++ >> 16) * y + (*xc & 0xffff) + carry;
1307 for (; xb < xbe; xc0++) {
1313 z = *
x++ * y + *xc + carry;
1322 for (xc0 = c->
x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
1334 static int p05[3] = { 5, 25, 125 };
1336 if ((
i =
k & 3) != 0)
1343 #ifdef MULTIPLE_THREADS 1363 if (!(p51 = p5->
next)) {
1364 #ifdef MULTIPLE_THREADS 1366 if (!(p51 = p5->
next)) {
1386 ULong *
x, *x1, *xe, z;
1394 n1 = n + b->
wds + 1;
1399 for (
i = 0;
i < n;
i++)
1408 *x1++ = *
x <<
k | z;
1419 *x1++ = *
x <<
k & 0xffff | z;
1438 ULong *xa, *xa0, *xb, *xb0;
1444 if (
i > 1 && !a->
x[
i-1])
1445 Bug(
"cmp called with a->x[a->wds-1] == 0");
1446 if (j > 1 && !b->
x[j-1])
1447 Bug(
"cmp called with b->x[b->wds-1] == 0");
1457 return *xa < *xb ? -1 : 1;
1469 ULong *xa, *xae, *xb, *xbe, *xc;
1506 y = (
ULLong)*xa++ - *xb++ - borrow;
1507 borrow = y >> 32 & (ULong)1;
1512 borrow = y >> 32 & (ULong)1;
1518 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
1519 borrow = (y & 0x10000) >> 16;
1520 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
1521 borrow = (z & 0x10000) >> 16;
1525 y = (*xa & 0xffff) - borrow;
1526 borrow = (y & 0x10000) >> 16;
1527 z = (*xa++ >> 16) - borrow;
1528 borrow = (z & 0x10000) >> 16;
1533 y = *xa++ - *xb++ - borrow;
1534 borrow = (y & 0x10000) >> 16;
1539 borrow = (y & 0x10000) >> 16;
1558 #ifndef Avoid_Underflow 1559 #ifndef Sudden_Underflow 1568 #ifndef Avoid_Underflow 1569 #ifndef Sudden_Underflow 1574 word0(a) = 0x80000 >> L;
1580 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
1591 ULong *xa, *xa0, w, y, z;
1605 if (!y) Bug(
"zero y in b2d");
1612 w = xa > xa0 ? *--xa : 0;
1616 z = xa > xa0 ? *--xa : 0;
1618 d0 =
Exp_1 | y << k | z >> (32 -
k);
1619 y = xa > xa0 ? *--xa : 0;
1620 d1 = z << k | y >> (32 -
k);
1628 z = xa > xa0 ? *--xa : 0;
1630 w = xa > xa0 ? *--xa : 0;
1631 y = xa > xa0 ? *--xa : 0;
1635 z = xa > xa0 ? *--xa : 0;
1636 w = xa > xa0 ? *--xa : 0;
1638 d0 =
Exp_1 | y << k + 16 | z << k | w >> 16 -
k;
1639 y = xa > xa0 ? *--xa : 0;
1640 d1 = w <<
k + 16 | y <<
k;
1654 d2b(
double d_,
int *e,
int *bits)
1660 #ifndef Sudden_Underflow 1684 #ifdef Sudden_Underflow 1694 if ((y =
d1) != 0) {
1696 x[0] = y | z << (32 -
k);
1701 #ifndef Sudden_Underflow 1704 b->
wds = (
x[1] = z) ? 2 : 1;
1709 Bug(
"Zero passed to d2b");
1713 #ifndef Sudden_Underflow 1723 x[0] = y | z << 32 -
k & 0xffff;
1724 x[1] = z >>
k - 16 & 0xffff;
1730 x[1] = y >> 16 | z << 16 -
k & 0xffff;
1731 x[2] = z >>
k & 0xffff;
1746 Bug(
"Zero passed to d2b");
1764 #ifndef Sudden_Underflow 1768 *e = (de -
Bias - (
P-1) << 2) +
k;
1771 *e = de -
Bias - (
P-1) +
k;
1774 #ifndef Sudden_Underflow 1777 *e = de -
Bias - (
P-1) + 1 +
k;
1799 k = ka - kb + 32*(a->
wds - b->
wds);
1801 k = ka - kb + 16*(a->
wds - b->
wds);
1828 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
1829 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
1839 static const double tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
1840 #ifdef Avoid_Underflow 1841 9007199254740992.*9007199254740992.e-256
1849 #define Scale_Bit 0x10 1853 bigtens[] = { 1e16, 1e32, 1e64 };
1854 static const double tinytens[] = { 1e-16, 1e-32, 1e-64 };
1858 static const double tinytens[] = { 1e-16, 1e-32 };
1870 #define NAN_WORD0 0x7ff80000 1878 match(
const char **sp,
char *t)
1881 const char *s = *sp;
1884 if ((c = *++s) >=
'A' && c <=
'Z')
1895 hexnan(
double *rvp,
const char **sp)
1899 int havedig, udx0, xshift;
1902 havedig = xshift = 0;
1905 while (c = *(
const unsigned char*)++s) {
1906 if (c >=
'0' && c <=
'9')
1908 else if (c >=
'a' && c <=
'f')
1910 else if (c >=
'A' && c <=
'F')
1912 else if (c <=
' ') {
1913 if (udx0 && havedig) {
1919 else if ( c ==
')' && havedig) {
1932 x[0] = (
x[0] << 4) | (
x[1] >> 28);
1933 x[1] = (
x[1] << 4) | c;
1935 if ((
x[0] &= 0xfffff) ||
x[1]) {
1946 #ifdef Avoid_Underflow 1949 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
1950 e, e1, esign,
i, j,
k, nd, nd0, nf, nz, nz0,
sign;
1951 const char *s, *s0, *s1;
1956 Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
1958 int inexact, oldinexact;
1960 #ifdef Honor_FLT_ROUNDS 1968 sign = nz0 = nz = 0;
1993 if (s[1] ==
'x' || s[1] ==
'X') {
1994 static const char hexdigit[] =
"0123456789abcdef0123456789ABCDEF";
2000 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
2002 while (*++s ==
'0');
2003 s1 =
strchr(hexdigit, *s);
2007 adj += aadj * ((s1 - hexdigit) & 15);
2010 }
while (*++s && (s1 =
strchr(hexdigit, *s)));
2015 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
2022 for (; *s && (s1 =
strchr(hexdigit, *s)); ++s) {
2023 adj += aadj * ((s1 - hexdigit) & 15);
2024 if ((aadj /= 16) == 0.0) {
2025 while (
strchr(hexdigit, *++s));
2034 if (*s ==
'P' || *s ==
'p') {
2035 dsign = 0x2C - *++s;
2036 if (abs(dsign) == 1) s++;
2041 if (c <
'0' ||
'9' < c)
goto ret0;
2048 if (nd + dsign * nd0 > 2095) {
2049 while (
'0' <= c && c <=
'9') c = *++s;
2052 }
while (
'0' <= c && c <=
'9');
2056 if (dsign)
goto ret0;
2058 dval(rv) = ldexp(adj, nd0);
2062 while (*++s ==
'0') ;
2068 for (nd = nf = 0; (c = *s) >=
'0' && c <=
'9'; nd++, s++)
2075 s1 = localeconv()->decimal_point;
2098 for (; c ==
'0'; c = *++s)
2100 if (c >
'0' && c <=
'9') {
2108 for (; c >=
'0' && c <=
'9'; c = *++s) {
2111 if (nf >
DBL_DIG * 4)
continue;
2114 for (
i = 1;
i < nz;
i++)
2129 if (c ==
'e' || c ==
'E') {
2130 if (!nd && !nz && !nz0) {
2141 if (c >=
'0' && c <=
'9') {
2144 if (c >
'0' && c <=
'9') {
2147 while ((c = *++s) >=
'0' && c <=
'9')
2149 if (s - s1 > 8 || L > 19999)
2172 if (
match(&s,
"nf")) {
2174 if (!
match(&s,
"inity"))
2176 word0(rv) = 0x7ff00000;
2183 if (
match(&s,
"an")) {
2184 word0(rv) = NAN_WORD0;
2185 word1(rv) = NAN_WORD1;
2214 oldinexact = get_inexact();
2218 bd0 = bb = bd = bs = delta = 0;
2220 #ifndef RND_PRODQUOT
2221 #ifndef Honor_FLT_ROUNDS
2231 goto vax_ovfl_check;
2233 #ifdef Honor_FLT_ROUNDS 2249 #ifdef Honor_FLT_ROUNDS 2275 #ifndef Inaccurate_Divide 2277 #ifdef Honor_FLT_ROUNDS 2295 oldinexact = get_inexact();
2297 #ifdef Avoid_Underflow 2300 #ifdef Honor_FLT_ROUNDS 2303 rounding = rounding == 2 ? 0 : 2;
2314 if ((
i = e1 & 15) != 0)
2324 #ifdef Honor_FLT_ROUNDS 2353 for (j = 0; e1 > 1; j++, e1 >>= 1)
2374 if ((
i = e1 & 15) != 0)
2379 #ifdef Avoid_Underflow 2382 for (j = 0; e1 > 0; j++, e1 >>= 1)
2393 word0(rv) &= 0xffffffff << (j-32);
2396 word1(rv) &= 0xffffffff << j;
2399 for (j = 0; e1 > 1; j++, e1 >>= 1)
2419 #ifndef Avoid_Underflow 2434 bd0 =
s2b(s0, nd0, nd, y);
2439 bb =
d2b(
dval(rv), &bbe, &bbbits);
2455 #ifdef Honor_FLT_ROUNDS 2459 #ifdef Avoid_Underflow 2467 #ifdef Sudden_Underflow 2469 j = 1 + 4*
P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
2484 #ifdef Avoid_Underflow 2487 i = bb2 < bd2 ? bb2 : bd2;
2509 delta =
diff(bb, bd);
2510 dsign = delta->
sign;
2513 #ifdef Honor_FLT_ROUNDS 2514 if (rounding != 1) {
2517 if (!delta->
x[0] && delta->
wds <= 1) {
2535 #ifdef Avoid_Underflow 2542 if (
cmp(delta, bs) <= 0)
2547 #ifdef Avoid_Underflow 2552 #ifdef Sudden_Underflow 2566 adj =
ratio(delta, bs);
2569 if (adj <= 0x7ffffffe) {
2573 if (!((rounding>>1) ^ dsign))
2578 #ifdef Avoid_Underflow 2582 #ifdef Sudden_Underflow 2618 if (!delta->
x[0] && delta->
wds <= 1)
2623 if (!delta->
x[0] && delta->
wds <= 1) {
2631 if (
cmp(delta, bs) > 0)
2642 ? (0xffffffff & (0xffffffff << (2*
P+1-(y>>
Exp_shift)))) :
2653 #ifdef Avoid_Underflow 2662 #ifdef Sudden_Underflow 2667 #ifdef Avoid_Underflow 2676 #ifdef Avoid_Underflow 2692 word1(rv) = 0xffffffff;
2699 #ifndef ROUND_BIASED 2705 #ifndef ROUND_BIASED 2708 #ifndef Sudden_Underflow 2713 #ifdef Avoid_Underflow 2719 if ((aadj =
ratio(delta, bs)) <= 2.) {
2721 aadj =
dval(aadj1) = 1.;
2723 #ifndef Sudden_Underflow 2738 dval(aadj1) = -aadj;
2743 dval(aadj1) = dsign ? aadj : -aadj;
2744 #ifdef Check_FLT_ROUNDS 2779 #ifdef Avoid_Underflow 2781 if (aadj <= 0x7fffffff) {
2782 if ((z = (
int)aadj) <= 0)
2785 dval(aadj1) = dsign ? aadj : -aadj;
2792 #ifdef Sudden_Underflow 2826 dval(aadj1) = (double)(
int)(aadj + 0.5);
2837 #ifdef Avoid_Underflow 2846 if (aadj < .4999999 || aadj > .5000001)
2867 else if (!oldinexact)
2870 #ifdef Avoid_Underflow 2905 ULong *bx, *bxe, q, *sx, *sxe;
2907 ULLong borrow, carry, y, ys;
2909 ULong borrow, carry, y, ys;
2918 Bug(
"oversize b in quorem");
2926 q = *bxe / (*sxe + 1);
2929 Bug(
"oversized quotient in quorem");
2936 ys = *sx++ * (
ULLong)q + carry;
2938 y = *bx - (ys &
FFFFFFFF) - borrow;
2939 borrow = y >> 32 & (ULong)1;
2944 ys = (si & 0xffff) * q + carry;
2945 zs = (si >> 16) * q + (ys >> 16);
2947 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2948 borrow = (y & 0x10000) >> 16;
2949 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2950 borrow = (z & 0x10000) >> 16;
2953 ys = *sx++ * q + carry;
2955 y = *bx - (ys & 0xffff) - borrow;
2956 borrow = (y & 0x10000) >> 16;
2960 }
while (sx <= sxe);
2963 while (--bxe > bx && !*bxe)
2968 if (
cmp(b,
S) >= 0) {
2978 y = *bx - (ys &
FFFFFFFF) - borrow;
2979 borrow = y >> 32 & (ULong)1;
2984 ys = (si & 0xffff) + carry;
2985 zs = (si >> 16) + (ys >> 16);
2987 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2988 borrow = (y & 0x10000) >> 16;
2989 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2990 borrow = (z & 0x10000) >> 16;
2995 y = *bx - (ys & 0xffff) - borrow;
2996 borrow = (y & 0x10000) >> 16;
3000 }
while (sx <= sxe);
3004 while (--bxe > bx && !*bxe)
3012 #ifndef MULTIPLE_THREADS 3013 static char *dtoa_result;
3016 #ifndef MULTIPLE_THREADS 3023 #define rv_alloc(i) xmalloc(i) 3032 while ((*t = *s++) != 0) t++;
3038 #define rv_strdup(s, rve) nrv_alloc((s), (rve), strlen(s)+1) 3040 #ifndef MULTIPLE_THREADS 3129 int bbits, b2, b5, be, dig,
i, ieps, ilim, ilim0, ilim1,
3130 j, j1,
k, k0, k_check, leftright, m2, m5, s2, s5,
3131 spec_case, try_quick;
3133 #ifndef Sudden_Underflow 3137 Bigint *b, *b1, *delta, *mlo = 0, *mhi = 0, *
S;
3141 #ifdef Honor_FLT_ROUNDS 3145 int inexact, oldinexact;
3150 #ifndef MULTIPLE_THREADS 3152 freedtoa(dtoa_result);
3165 #if defined(IEEE_Arith) + defined(VAX) 3169 if (
word0(d) == 0x8000)
3190 try_quick = oldinexact = get_inexact();
3193 #ifdef Honor_FLT_ROUNDS 3196 rounding = rounding == 2 ? 0 : 2;
3203 b =
d2b(
dval(d), &be, &bbits);
3204 #ifdef Sudden_Underflow 3244 #ifndef Sudden_Underflow 3250 i = bbits + be + (
Bias + (
P-1) - 1);
3255 i -= (
Bias + (
P-1) - 1) + 1;
3259 ds = (
dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 +
i*0.301029995663981;
3261 if (ds < 0. && ds !=
k)
3288 if (mode < 0 || mode > 9)
3292 #ifdef Check_FLT_ROUNDS 3317 ilim = ilim1 =
i = ndigits;
3323 i = ndigits +
k + 1;
3331 #ifdef Honor_FLT_ROUNDS 3332 if (mode > 1 && rounding != 1)
3336 if (ilim >= 0 && ilim <=
Quick_max && try_quick) {
3354 for (; j; j >>= 1,
i++)
3361 else if ((j1 = -
k) != 0) {
3363 for (j = j1 >> 4; j; j >>= 1,
i++)
3369 if (k_check &&
dval(d) < 1. && ilim > 0) {
3388 #ifndef No_leftright 3397 *s++ =
'0' + (int)L;
3412 for (
i = 1;;
i++,
dval(d) *= 10.) {
3413 L = (Long)(
dval(d));
3414 if (!(
dval(d) -= L))
3416 *s++ =
'0' + (int)L;
3420 else if (
dval(d) < 0.5 -
dval(eps)) {
3421 while (*--s ==
'0') ;
3428 #ifndef No_leftright 3443 if (ndigits < 0 && ilim <= 0) {
3445 if (ilim < 0 ||
dval(d) <= 5*ds)
3449 for (
i = 1;;
i++,
dval(d) *= 10.) {
3450 L = (Long)(
dval(d) / ds);
3452 #ifdef Check_FLT_ROUNDS 3459 *s++ =
'0' + (int)L;
3467 #ifdef Honor_FLT_ROUNDS 3471 case 2:
goto bump_up;
3475 if (
dval(d) > ds || (
dval(d) == ds && (L & 1))) {
3495 #ifndef Sudden_Underflow 3496 denorm ? be + (
Bias + (
P-1) - 1 + 1) :
3499 1 + 4*
P - 3 - bbits + ((bbits + be - 1) & 3);
3507 if (m2 > 0 && s2 > 0) {
3508 i = m2 < s2 ? m2 : s2;
3521 if ((j = b5 - m5) != 0)
3534 if ((mode < 2 || leftright)
3535 #ifdef Honor_FLT_ROUNDS
3540 #ifndef Sudden_Underflow
3559 if ((
i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0x1f) != 0)
3562 if ((
i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0xf) != 0)
3590 if (ilim <= 0 && (mode == 3 || mode == 5)) {
3623 delta =
diff(
S, mhi);
3624 j1 = delta->
sign ? 1 :
cmp(b, delta);
3626 #ifndef ROUND_BIASED 3627 if (j1 == 0 && mode != 1 && !(
word1(d) & 1)
3628 #ifdef Honor_FLT_ROUNDS
3637 else if (!b->
x[0] && b->
wds <= 1)
3644 if (j < 0 || (j == 0 && mode != 1
3645 #ifndef ROUND_BIASED
3649 if (!b->
x[0] && b->
wds <= 1) {
3655 #ifdef Honor_FLT_ROUNDS 3658 case 0:
goto accept_dig;
3659 case 2:
goto keep_dig;
3665 if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ ==
'9')
3673 #ifdef Honor_FLT_ROUNDS 3685 #ifdef Honor_FLT_ROUNDS 3693 mlo = mhi =
multadd(mhi, 10, 0);
3702 *s++ = dig =
quorem(b,
S) +
'0';
3703 if (!b->
x[0] && b->
wds <= 1) {
3716 #ifdef Honor_FLT_ROUNDS 3718 case 0:
goto trimzeros;
3719 case 2:
goto roundoff;
3724 if (j > 0 || (j == 0 && (dig & 1))) {
3735 while (*--s ==
'0') ;
3741 if (mlo && mlo != mhi)
3754 else if (!oldinexact)
3772 for (; *str; str = end) {
3773 while (
ISSPACE(*str) || *str ==
',') str++;
3776 while (*end && !
ISSPACE(*end) && *end !=
',') end++;
3777 len = (int)(end - str);
3778 (*func)(str, len, arg);
3808 #define DBL_MANH_SIZE 20 3809 #define DBL_MANL_SIZE 32 3810 #define DBL_ADJ (DBL_MAX_EXP - 2) 3811 #define SIGFIGS ((DBL_MANT_DIG + 3) / 4 + 1) 3812 #define dexp_get(u) ((int)(word0(u) >> Exp_shift) & ~Exp_msk1) 3813 #define dexp_set(u,v) (word0(u) = (((int)(word0(u)) & ~Exp_mask) | ((v) << Exp_shift))) 3814 #define dmanh_get(u) ((uint32_t)(word0(u) & Frac_mask)) 3815 #define dmanl_get(u) ((uint32_t)word1(u)) 3864 else if (
isnan(d)) {
3868 else if (d == 0.0) {
3876 u.
d *= 5.363123171977039e+154 ;
3887 bufsize = (ndigits > 0) ? ndigits :
SIGFIGS;
3891 if (
SIGFIGS > ndigits && ndigits > 0) {
3906 for (s = s0 + 1; s < s0 + bufsize; s++) {
3914 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)
int() cmpfunc_t(const void *, const void *, void *)
#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[]
SSL_METHOD *(* func)(void)
static void mmrot3_(register char *a, register char *b, register char *c, mmargdecl)
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)
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)
static const double tens[]
#define rounded_product(a, b)
static const char INFSTR[]
void ruby_qsort(void *base, const size_t nel, const size_t size, cmpfunc_t *cmp, void *d)
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)
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 void mmswap_(register char *a, register char *b, mmargdecl)
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 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)