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);
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))))
307 register char *l, *
r, *
m;
308 register int t, eq_l, eq_r;
310 char *
R = (
char*)base + size*(nel-1);
316 if (nel <= 1)
return;
321 if (stack == top)
return;
327 if ((*cmp)(L,R,d) > 0)
mmswap(L,R);
goto nxt;
331 n = (r - l +
size) / size;
332 m = l + size * (n >> 1);
340 register char *p1 = l +
n;
341 register char *p2 = p1 +
n;
342 register char *p3 = p2 +
n;
343 m1 =
med3(p1, p2, p3);
347 m3 =
med3(p1, p2, p3);
358 if ((t = (*cmp)(l,m,d)) < 0) {
359 if ((t = (*cmp)(m,r,d)) < 0) {
360 if (chklim && nel >= chklim) {
363 for (p=l; p<r; p+=size) if ((*cmp)(p,p+size,d) > 0)
goto fail;
369 if ((*cmp)(l,r,d) <= 0) {
mmswap(m,r);
goto loopA;}
370 mmrot3(r,m,l);
goto loopA;
376 if ((t = (*cmp)(m,r,d)) > 0) {
377 if (chklim && nel >= chklim) {
380 for (p=l; p<
r; p+=
size)
if ((*cmp)(p,p+size,d) < 0)
goto fail2;
384 fail2:
mmswap(l,r);
goto loopA;
387 if ((*cmp)(l,r,d) <= 0) {
mmswap(l,m);
goto loopB;}
388 mmrot3(l,m,r);
goto loopA;
393 if ((t = (*cmp)(m,r,d)) < 0) {
goto loopA;}
394 if (t > 0) {
mmswap(l,r);
goto loopB;}
398 if ((l += size) == r)
goto nxt;
399 if (l == m)
continue;
400 if ((t = (*cmp)(l,m,d)) > 0) {
mmswap(l,r); l = L;
goto loopA;}
401 if (t < 0) {
mmswap(L,l); l = L;
goto loopB;}
404 loopA: eq_l = 1; eq_r = 1;
407 if ((l += size) == r)
409 if (l == m)
continue;
410 if ((t = (*cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
414 if (l == (r -= size))
416 if (r == m) {m = l;
break;}
417 if ((t = (*cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
423 loopB: eq_l = 1; eq_r = 1;
426 if (l == (r -= size))
428 if (r == m)
continue;
429 if ((t = (*cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
433 if ((l += size) == r)
435 if (l == m) {m =
r;
break;}
436 if ((t = (*cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
445 if (l-L < R-r) {
PUSH(r,R); R = l;}
446 else {
PUSH(L,l); L =
r;}
448 else if (eq_r == 0) L =
r;
465 #ifdef __native_client__
481 while (!getcwd(buf, size)) {
482 if (
errno != ERANGE) {
491 # define PATH_MAX 8192
669 #ifdef WORDS_BIGENDIAN
670 #define IEEE_BIG_ENDIAN
672 #define IEEE_LITTLE_ENDIAN
677 #undef IEEE_BIG_ENDIAN
678 #undef IEEE_LITTLE_ENDIAN
681 #if defined(__arm__) && !defined(__VFP_FP__)
682 #define IEEE_BIG_ENDIAN
683 #undef IEEE_LITTLE_ENDIAN
691 #define ULong unsigned int
692 #elif SIZEOF_LONG == 4
693 #define Long long int
694 #define ULong unsigned long int
698 #define Llong LONG_LONG
703 #define Bug(x) {fprintf(stderr, "%s\n", (x)); exit(EXIT_FAILURE);}
714 extern void *
MALLOC(
size_t);
716 #define MALLOC malloc
719 extern void FREE(
void*);
724 #ifndef Omit_Private_Memory
726 #define PRIVATE_MEM 2304
728 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))
733 #undef Avoid_Underflow
734 #ifdef IEEE_BIG_ENDIAN
737 #ifdef IEEE_LITTLE_ENDIAN
745 #define DBL_MAX_10_EXP 308
746 #define DBL_MAX_EXP 1024
752 #define DBL_MAX_10_EXP 75
753 #define DBL_MAX_EXP 63
755 #define DBL_MAX 7.2370055773322621e+75
760 #define DBL_MAX_10_EXP 38
761 #define DBL_MAX_EXP 127
763 #define DBL_MAX 1.7014118346046923e+38
767 #define LONG_MAX 2147483647
785 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + defined(IBM) != 1
789 typedef union {
double d; ULong L[2]; }
U;
794 # ifdef IEEE_LITTLE_ENDIAN
795 # define word0(x) (((ULong *)&(x))[1])
796 # define word1(x) (((ULong *)&(x))[0])
798 # define word0(x) (((ULong *)&(x))[0])
799 # define word1(x) (((ULong *)&(x))[1])
803 # ifdef IEEE_LITTLE_ENDIAN
804 # define word0(x) ((x).L[1])
805 # define word1(x) ((x).L[0])
807 # define word0(x) ((x).L[0])
808 # define word1(x) ((x).L[1])
810 # define dval(x) ((x).d)
817 #if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm__)
818 #define Storeinc(a,b,c) (((unsigned short *)(a))[1] = (unsigned short)(b), \
819 ((unsigned short *)(a))[0] = (unsigned short)(c), (a)++)
821 #define Storeinc(a,b,c) (((unsigned short *)(a))[0] = (unsigned short)(b), \
822 ((unsigned short *)(a))[1] = (unsigned short)(c), (a)++)
833 #define Exp_shift1 20
834 #define Exp_msk1 0x100000
835 #define Exp_msk11 0x100000
836 #define Exp_mask 0x7ff00000
840 #define Exp_1 0x3ff00000
841 #define Exp_11 0x3ff00000
843 #define Frac_mask 0xfffff
844 #define Frac_mask1 0xfffff
847 #define Bndry_mask 0xfffff
848 #define Bndry_mask1 0xfffff
850 #define Sign_bit 0x80000000
856 #ifndef NO_IEEE_Scale
857 #define Avoid_Underflow
859 #undef Sudden_Underflow
865 #define Flt_Rounds FLT_ROUNDS
871 #ifdef Honor_FLT_ROUNDS
872 #define Rounding rounding
873 #undef Check_FLT_ROUNDS
874 #define Check_FLT_ROUNDS
876 #define Rounding Flt_Rounds
880 #undef Check_FLT_ROUNDS
881 #undef Honor_FLT_ROUNDS
883 #undef Sudden_Underflow
884 #define Sudden_Underflow
889 #define Exp_shift1 24
890 #define Exp_msk1 0x1000000
891 #define Exp_msk11 0x1000000
892 #define Exp_mask 0x7f000000
895 #define Exp_1 0x41000000
896 #define Exp_11 0x41000000
898 #define Frac_mask 0xffffff
899 #define Frac_mask1 0xffffff
902 #define Bndry_mask 0xefffff
903 #define Bndry_mask1 0xffffff
905 #define Sign_bit 0x80000000
907 #define Tiny0 0x100000
916 #define Exp_msk1 0x80
917 #define Exp_msk11 0x800000
918 #define Exp_mask 0x7f80
921 #define Exp_1 0x40800000
922 #define Exp_11 0x4080
924 #define Frac_mask 0x7fffff
925 #define Frac_mask1 0xffff007f
928 #define Bndry_mask 0xffff007f
929 #define Bndry_mask1 0xffff007f
931 #define Sign_bit 0x8000
945 #define rounded_product(a,b) ((a) = rnd_prod((a), (b)))
946 #define rounded_quotient(a,b) ((a) = rnd_quot((a), (b)))
947 extern double rnd_prod(
double,
double), rnd_quot(
double,
double);
949 #define rounded_product(a,b) ((a) *= (b))
950 #define rounded_quotient(a,b) ((a) /= (b))
953 #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))
954 #define Big1 0xffffffff
960 #define FFFFFFFF 0xffffffffUL
974 #define Llong long long
977 #define ULLong unsigned Llong
981 #define MULTIPLE_THREADS 1
983 #ifndef MULTIPLE_THREADS
984 #define ACQUIRE_DTOA_LOCK(n)
985 #define FREE_DTOA_LOCK(n)
987 #define ACQUIRE_DTOA_LOCK(n)
988 #define FREE_DTOA_LOCK(n)
1008 #ifndef Omit_Private_Memory
1013 if (k <=
Kmax && (rv = freelist[k]) != 0) {
1014 freelist[
k] = rv->
next;
1018 #ifdef Omit_Private_Memory
1021 len = (
sizeof(
Bigint) + (x-1)*
sizeof(ULong) +
sizeof(
double) - 1)
1047 v->
next = freelist[v->
k];
1053 #define Bcopy(x,y) memcpy((char *)&(x)->sign, (char *)&(y)->sign, \
1054 (y)->wds*sizeof(Long) + 2*sizeof(int))
1077 y = *x * (
ULLong)m + carry;
1083 y = (xi & 0xffff) * m + carry;
1084 z = (xi >> 16) * m + (y >> 16);
1086 *x++ = (z << 16) + (y & 0xffff);
1093 }
while (++i < wds);
1101 b->
x[wds++] = (ULong)carry;
1108 s2b(
const char *
s,
int nd0,
int nd, ULong y9)
1115 for (k = 0, y = 1; x > y; y <<= 1, k++) ;
1122 b->
x[0] = y9 & 0xffff;
1123 b->
wds = (b->
x[1] = y9 >> 16) ? 2 : 1;
1130 b =
multadd(b, 10, *s++ -
'0');
1131 }
while (++i < nd0);
1137 b =
multadd(b, 10, *s++ -
'0');
1146 if (!(x & 0xffff0000)) {
1150 if (!(x & 0xff000000)) {
1154 if (!(x & 0xf0000000)) {
1158 if (!(x & 0xc0000000)) {
1162 if (!(x & 0x80000000)) {
1164 if (!(x & 0x40000000))
1174 register ULong
x = *y;
1187 if (!(x & 0xffff)) {
1229 ULong *
x, *xa, *xae, *xb, *xbe, *xc, *xc0;
1252 for (x = c->
x, xa = x + wc; x < xa; x++)
1260 for (; xb < xbe; xc0++) {
1261 if ((y = *xb++) != 0) {
1266 z = *x++ * (
ULLong)y + *xc + carry;
1275 for (; xb < xbe; xb++, xc0++) {
1276 if (y = *xb & 0xffff) {
1281 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
1283 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
1289 if (y = *xb >> 16) {
1295 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
1298 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
1305 for (; xb < xbe; xc0++) {
1311 z = *x++ * y + *xc + carry;
1320 for (xc0 = c->
x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
1332 static int p05[3] = { 5, 25, 125 };
1334 if ((i = k & 3) != 0)
1341 #ifdef MULTIPLE_THREADS
1344 p5 = p5s =
i2b(625);
1349 p5 = p5s =
i2b(625);
1361 if (!(p51 = p5->
next)) {
1362 #ifdef MULTIPLE_THREADS
1364 if (!(p51 = p5->
next)) {
1384 ULong *
x, *x1, *xe, z;
1392 n1 = n + b->
wds + 1;
1393 for (i = b->
maxwds; n1 > i; i <<= 1)
1397 for (i = 0; i <
n; i++)
1406 *x1++ = *x << k | z;
1417 *x1++ = *x << k & 0xffff | z;
1436 ULong *xa, *xa0, *xb, *xb0;
1442 if (i > 1 && !a->
x[i-1])
1443 Bug(
"cmp called with a->x[a->wds-1] == 0");
1444 if (j > 1 && !b->
x[j-1])
1445 Bug(
"cmp called with b->x[b->wds-1] == 0");
1455 return *xa < *xb ? -1 : 1;
1467 ULong *xa, *xae, *xb, *xbe, *xc;
1504 y = (
ULLong)*xa++ - *xb++ - borrow;
1505 borrow = y >> 32 & (ULong)1;
1510 borrow = y >> 32 & (ULong)1;
1516 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
1517 borrow = (y & 0x10000) >> 16;
1518 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
1519 borrow = (z & 0x10000) >> 16;
1523 y = (*xa & 0xffff) - borrow;
1524 borrow = (y & 0x10000) >> 16;
1525 z = (*xa++ >> 16) - borrow;
1526 borrow = (z & 0x10000) >> 16;
1531 y = *xa++ - *xb++ - borrow;
1532 borrow = (y & 0x10000) >> 16;
1537 borrow = (y & 0x10000) >> 16;
1556 #ifndef Avoid_Underflow
1557 #ifndef Sudden_Underflow
1566 #ifndef Avoid_Underflow
1567 #ifndef Sudden_Underflow
1571 if (L < Exp_shift) {
1572 word0(a) = 0x80000 >> L;
1578 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
1589 ULong *xa, *xa0, w, y, z;
1603 if (!y) Bug(
"zero y in b2d");
1610 w = xa > xa0 ? *--xa : 0;
1614 z = xa > xa0 ? *--xa : 0;
1616 d0 =
Exp_1 | y << k | z >> (32 -
k);
1617 y = xa > xa0 ? *--xa : 0;
1618 d1 = z << k | y >> (32 -
k);
1625 if (k <
Ebits + 16) {
1626 z = xa > xa0 ? *--xa : 0;
1628 w = xa > xa0 ? *--xa : 0;
1629 y = xa > xa0 ? *--xa : 0;
1633 z = xa > xa0 ? *--xa : 0;
1634 w = xa > xa0 ? *--xa : 0;
1636 d0 =
Exp_1 | y << k + 16 | z << k | w >> 16 -
k;
1637 y = xa > xa0 ? *--xa : 0;
1638 d1 = w << k + 16 | y <<
k;
1642 word0(d) = d0 >> 16 | d0 << 16;
1643 word1(d) = d1 >> 16 | d1 << 16;
1658 #ifndef Sudden_Underflow
1682 #ifdef Sudden_Underflow
1692 if ((y = d1) != 0) {
1694 x[0] = y | z << (32 -
k);
1699 #ifndef Sudden_Underflow
1702 b->
wds = (x[1] = z) ? 2 : 1;
1707 Bug(
"Zero passed to d2b");
1711 #ifndef Sudden_Underflow
1721 x[0] = y | z << 32 - k & 0xffff;
1722 x[1] = z >> k - 16 & 0xffff;
1728 x[1] = y >> 16 | z << 16 - k & 0xffff;
1729 x[2] = z >> k & 0xffff;
1744 Bug(
"Zero passed to d2b");
1762 #ifndef Sudden_Underflow
1766 *e = (de -
Bias - (
P-1) << 2) +
k;
1769 *e = de -
Bias - (
P-1) + k;
1772 #ifndef Sudden_Underflow
1775 *e = de -
Bias - (
P-1) + 1 + k;
1777 *bits = 32*i -
hi0bits(x[i-1]);
1779 *bits = (i+2)*16 -
hi0bits(x[i]);
1797 k = ka - kb + 32*(a->
wds - b->
wds);
1799 k = ka - kb + 16*(a->
wds - b->
wds);
1826 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
1827 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
1838 #ifdef Avoid_Underflow
1839 9007199254740992.*9007199254740992.e-256
1847 #define Scale_Bit 0x10
1851 bigtens[] = { 1e16, 1e32, 1e64 };
1852 static const double tinytens[] = { 1
e-16, 1
e-32, 1e-64 };
1856 static const double tinytens[] = { 1
e-16, 1
e-32 };
1868 #define NAN_WORD0 0x7ff80000
1876 match(
const char **sp,
char *
t)
1879 const char *
s = *sp;
1882 if ((c = *++s) >=
'A' && c <=
'Z')
1893 hexnan(
double *rvp,
const char **sp)
1897 int havedig, udx0, xshift;
1900 havedig = xshift = 0;
1903 while (c = *(
const unsigned char*)++s) {
1904 if (c >=
'0' && c <=
'9')
1906 else if (c >=
'a' && c <=
'f')
1908 else if (c >=
'A' && c <=
'F')
1910 else if (c <=
' ') {
1911 if (udx0 && havedig) {
1917 else if ( c ==
')' && havedig) {
1930 x[0] = (x[0] << 4) | (x[1] >> 28);
1931 x[1] = (x[1] << 4) | c;
1933 if ((x[0] &= 0xfffff) || x[1]) {
1944 #ifdef Avoid_Underflow
1947 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2,
c, dsign,
1948 e, e1, esign,
i, j,
k, nd, nd0,
nf, nz, nz0,
sign;
1949 const char *
s, *s0, *s1;
1954 Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
1956 int inexact, oldinexact;
1958 #ifdef Honor_FLT_ROUNDS
1966 sign = nz0 = nz = 0;
1991 if (s[1] ==
'x' || s[1] ==
'X') {
1992 static const char hexdigit[] =
"0123456789abcdef0123456789ABCDEF";
1998 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
2000 while (*++s ==
'0');
2001 s1 =
strchr(hexdigit, *s);
2005 adj += aadj * ((s1 - hexdigit) & 15);
2008 }
while (*++s && (s1 =
strchr(hexdigit, *s)));
2013 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
2020 for (; *s && (s1 =
strchr(hexdigit, *s)); ++
s) {
2021 adj += aadj * ((s1 - hexdigit) & 15);
2022 if ((aadj /= 16) == 0.0) {
2023 while (
strchr(hexdigit, *++s));
2032 if (*s ==
'P' || *s ==
'p') {
2033 dsign = 0x2C - *++
s;
2034 if (abs(dsign) == 1) s++;
2039 if (c <
'0' ||
'9' < c)
goto ret0;
2046 if (nd + dsign * nd0 > 2095) {
2047 while (
'0' <= c && c <=
'9') c = *++
s;
2050 }
while (
'0' <= c && c <=
'9');
2054 if (dsign)
goto ret0;
2056 dval(rv) = ldexp(adj, nd0);
2060 while (*++s ==
'0') ;
2066 for (nd = nf = 0; (c = *
s) >=
'0' && c <=
'9'; nd++, s++)
2073 s1 = localeconv()->decimal_point;
2096 for (; c ==
'0'; c = *++
s)
2098 if (c >
'0' && c <=
'9') {
2106 for (; c >=
'0' && c <=
'9'; c = *++
s) {
2109 if (nf >
DBL_DIG * 4)
continue;
2112 for (i = 1; i < nz; i++)
2127 if (c ==
'e' || c ==
'E') {
2128 if (!nd && !nz && !nz0) {
2139 if (c >=
'0' && c <=
'9') {
2142 if (c >
'0' && c <=
'9') {
2145 while ((c = *++s) >=
'0' && c <=
'9')
2147 if (s - s1 > 8 || L > 19999)
2170 if (
match(&s,
"nf")) {
2172 if (!
match(&s,
"inity"))
2174 word0(rv) = 0x7ff00000;
2181 if (
match(&s,
"an")) {
2182 word0(rv) = NAN_WORD0;
2183 word1(rv) = NAN_WORD1;
2212 oldinexact = get_inexact();
2216 bd0 = bb = bd = bs = delta = 0;
2218 #ifndef RND_PRODQUOT
2219 #ifndef Honor_FLT_ROUNDS
2229 goto vax_ovfl_check;
2231 #ifdef Honor_FLT_ROUNDS
2247 #ifdef Honor_FLT_ROUNDS
2273 #ifndef Inaccurate_Divide
2275 #ifdef Honor_FLT_ROUNDS
2293 oldinexact = get_inexact();
2295 #ifdef Avoid_Underflow
2298 #ifdef Honor_FLT_ROUNDS
2301 rounding = rounding == 2 ? 0 : 2;
2312 if ((i = e1 & 15) != 0)
2322 #ifdef Honor_FLT_ROUNDS
2351 for (j = 0; e1 > 1; j++, e1 >>= 1)
2372 if ((i = e1 & 15) != 0)
2377 #ifdef Avoid_Underflow
2380 for (j = 0; e1 > 0; j++, e1 >>= 1)
2391 word0(rv) &= 0xffffffff << (j-32);
2394 word1(rv) &= 0xffffffff << j;
2397 for (j = 0; e1 > 1; j++, e1 >>= 1)
2417 #ifndef Avoid_Underflow
2432 bd0 =
s2b(s0, nd0, nd, y);
2437 bb =
d2b(
dval(rv), &bbe, &bbbits);
2453 #ifdef Honor_FLT_ROUNDS
2457 #ifdef Avoid_Underflow
2465 #ifdef Sudden_Underflow
2467 j = 1 + 4*
P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
2482 #ifdef Avoid_Underflow
2485 i = bb2 < bd2 ? bb2 : bd2;
2507 delta =
diff(bb, bd);
2508 dsign = delta->
sign;
2511 #ifdef Honor_FLT_ROUNDS
2512 if (rounding != 1) {
2515 if (!delta->
x[0] && delta->
wds <= 1) {
2533 #ifdef Avoid_Underflow
2540 if (
cmp(delta, bs) <= 0)
2545 #ifdef Avoid_Underflow
2548 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2550 #ifdef Sudden_Underflow
2551 if ((
word0(rv) & Exp_mask) <=
2564 adj =
ratio(delta, bs);
2567 if (adj <= 0x7ffffffe) {
2571 if (!((rounding>>1) ^ dsign))
2576 #ifdef Avoid_Underflow
2578 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2580 #ifdef Sudden_Underflow
2616 if (!delta->
x[0] && delta->
wds <= 1)
2621 if (!delta->
x[0] && delta->
wds <= 1) {
2629 if (
cmp(delta, bs) > 0)
2640 ? (0xffffffff & (0xffffffff << (2*
P+1-(y>>
Exp_shift)))) :
2651 #ifdef Avoid_Underflow
2660 #ifdef Sudden_Underflow
2665 #ifdef Avoid_Underflow
2674 #ifdef Avoid_Underflow
2677 if (L <= (2*
P+1)*Exp_msk1) {
2678 if (L > (
P+2)*Exp_msk1)
2690 word1(rv) = 0xffffffff;
2697 #ifndef ROUND_BIASED
2703 #ifndef ROUND_BIASED
2706 #ifndef Sudden_Underflow
2711 #ifdef Avoid_Underflow
2717 if ((aadj =
ratio(delta, bs)) <= 2.) {
2719 aadj =
dval(aadj1) = 1.;
2721 #ifndef Sudden_Underflow
2736 dval(aadj1) = -aadj;
2741 dval(aadj1) = dsign ? aadj : -aadj;
2742 #ifdef Check_FLT_ROUNDS
2777 #ifdef Avoid_Underflow
2779 if (aadj <= 0x7fffffff) {
2780 if ((z = (
int)aadj) <= 0)
2783 dval(aadj1) = dsign ? aadj : -aadj;
2785 word0(aadj1) += (2*
P+1)*Exp_msk1 - y;
2790 #ifdef Sudden_Underflow
2797 if ((
word0(rv) & Exp_mask) <
P*Exp_msk1)
2799 if ((
word0(rv) & Exp_mask) <=
P*Exp_msk1)
2823 if (y <= (
P-1)*Exp_msk1 && aadj > 1.) {
2824 dval(aadj1) = (double)(
int)(aadj + 0.5);
2835 #ifdef Avoid_Underflow
2844 if (aadj < .4999999 || aadj > .5000001)
2865 else if (!oldinexact)
2868 #ifdef Avoid_Underflow
2896 return sign ? -
dval(rv) :
dval(rv);
2903 ULong *bx, *bxe,
q, *sx, *sxe;
2905 ULLong borrow, carry, y, ys;
2907 ULong borrow, carry, y, ys;
2916 Bug(
"oversize b in quorem");
2924 q = *bxe / (*sxe + 1);
2927 Bug(
"oversized quotient in quorem");
2934 ys = *sx++ * (
ULLong)q + carry;
2936 y = *bx - (ys &
FFFFFFFF) - borrow;
2937 borrow = y >> 32 & (ULong)1;
2942 ys = (si & 0xffff) * q + carry;
2943 zs = (si >> 16) * q + (ys >> 16);
2945 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2946 borrow = (y & 0x10000) >> 16;
2947 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2948 borrow = (z & 0x10000) >> 16;
2951 ys = *sx++ * q + carry;
2953 y = *bx - (ys & 0xffff) - borrow;
2954 borrow = (y & 0x10000) >> 16;
2958 }
while (sx <= sxe);
2961 while (--bxe > bx && !*bxe)
2966 if (
cmp(b, S) >= 0) {
2976 y = *bx - (ys &
FFFFFFFF) - borrow;
2977 borrow = y >> 32 & (ULong)1;
2982 ys = (si & 0xffff) + carry;
2983 zs = (si >> 16) + (ys >> 16);
2985 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2986 borrow = (y & 0x10000) >> 16;
2987 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2988 borrow = (z & 0x10000) >> 16;
2993 y = *bx - (ys & 0xffff) - borrow;
2994 borrow = (y & 0x10000) >> 16;
2998 }
while (sx <= sxe);
3002 while (--bxe > bx && !*bxe)
3010 #ifndef MULTIPLE_THREADS
3011 static char *dtoa_result;
3014 #ifndef MULTIPLE_THREADS
3018 return dtoa_result =
xmalloc(i);
3021 #define rv_alloc(i) xmalloc(i)
3030 while ((*t = *s++) != 0) t++;
3036 #define rv_strdup(s, rve) nrv_alloc((s), (rve), strlen(s)+1)
3038 #ifndef MULTIPLE_THREADS
3127 int bbits, b2, b5, be, dig,
i, ieps, ilim, ilim0, ilim1,
3128 j, j1,
k, k0, k_check, leftright, m2, m5, s2, s5,
3129 spec_case, try_quick;
3131 #ifndef Sudden_Underflow
3135 Bigint *
b, *b1, *delta, *mlo = 0, *mhi = 0, *
S;
3139 #ifdef Honor_FLT_ROUNDS
3143 int inexact, oldinexact;
3148 #ifndef MULTIPLE_THREADS
3150 freedtoa(dtoa_result);
3158 word0(d) &= ~Sign_bit;
3163 #if defined(IEEE_Arith) + defined(VAX)
3167 if (
word0(d) == 0x8000)
3188 try_quick = oldinexact = get_inexact();
3191 #ifdef Honor_FLT_ROUNDS
3194 rounding = rounding == 2 ? 0 : 2;
3201 b =
d2b(
dval(d), &be, &bbits);
3202 #ifdef Sudden_Underflow
3242 #ifndef Sudden_Underflow
3248 i = bbits + be + (
Bias + (
P-1) - 1);
3249 x = i > 32 ?
word0(d) << (64 -
i) |
word1(d) >> (i - 32)
3253 i -= (
Bias + (
P-1) - 1) + 1;
3257 ds = (
dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
3259 if (ds < 0. && ds != k)
3286 if (mode < 0 || mode > 9)
3290 #ifdef Check_FLT_ROUNDS
3315 ilim = ilim1 = i = ndigits;
3321 i = ndigits + k + 1;
3329 #ifdef Honor_FLT_ROUNDS
3330 if (mode > 1 && rounding != 1)
3334 if (ilim >= 0 && ilim <=
Quick_max && try_quick) {
3352 for (; j; j >>= 1, i++)
3359 else if ((j1 = -k) != 0) {
3361 for (j = j1 >> 4; j; j >>= 1, i++)
3367 if (k_check &&
dval(d) < 1. && ilim > 0) {
3386 #ifndef No_leftright
3395 *s++ =
'0' + (
int)L;
3410 for (i = 1;; i++,
dval(d) *= 10.) {
3411 L = (Long)(
dval(d));
3412 if (!(
dval(d) -= L))
3414 *s++ =
'0' + (
int)L;
3418 else if (
dval(d) < 0.5 -
dval(eps)) {
3419 while (*--s ==
'0') ;
3426 #ifndef No_leftright
3438 if (be >= 0 && k <=
Int_max) {
3441 if (ndigits < 0 && ilim <= 0) {
3443 if (ilim < 0 ||
dval(d) <= 5*ds)
3447 for (i = 1;; i++,
dval(d) *= 10.) {
3448 L = (Long)(
dval(d) / ds);
3450 #ifdef Check_FLT_ROUNDS
3457 *s++ =
'0' + (
int)L;
3465 #ifdef Honor_FLT_ROUNDS
3469 case 2:
goto bump_up;
3473 if (
dval(d) > ds || (
dval(d) == ds && (L & 1))) {
3493 #ifndef Sudden_Underflow
3494 denorm ? be + (
Bias + (
P-1) - 1 + 1) :
3497 1 + 4*
P - 3 - bbits + ((bbits + be - 1) & 3);
3505 if (m2 > 0 && s2 > 0) {
3506 i = m2 < s2 ? m2 : s2;
3519 if ((j = b5 - m5) != 0)
3532 if ((mode < 2 || leftright)
3533 #ifdef Honor_FLT_ROUNDS
3538 #ifndef Sudden_Underflow
3557 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0x1f) != 0)
3560 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0xf) != 0)
3588 if (ilim <= 0 && (mode == 3 || mode == 5)) {
3621 delta =
diff(
S, mhi);
3622 j1 = delta->
sign ? 1 :
cmp(b, delta);
3624 #ifndef ROUND_BIASED
3625 if (j1 == 0 && mode != 1 && !(
word1(d) & 1)
3626 #ifdef Honor_FLT_ROUNDS
3635 else if (!b->
x[0] && b->
wds <= 1)
3642 if (j < 0 || (j == 0 && mode != 1
3643 #ifndef ROUND_BIASED
3647 if (!b->
x[0] && b->
wds <= 1) {
3653 #ifdef Honor_FLT_ROUNDS
3656 case 0:
goto accept_dig;
3657 case 2:
goto keep_dig;
3663 if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ ==
'9')
3671 #ifdef Honor_FLT_ROUNDS
3683 #ifdef Honor_FLT_ROUNDS
3691 mlo = mhi =
multadd(mhi, 10, 0);
3700 *s++ = dig =
quorem(b,
S) +
'0';
3701 if (!b->
x[0] && b->
wds <= 1) {
3714 #ifdef Honor_FLT_ROUNDS
3716 case 0:
goto trimzeros;
3717 case 2:
goto roundoff;
3722 if (j > 0 || (j == 0 && (dig & 1))) {
3733 while (*--s ==
'0') ;
3739 if (mlo && mlo != mhi)
3752 else if (!oldinexact)
3770 for (; *
str; str =
end) {
3771 while (
ISSPACE(*str) || *str ==
',') str++;
3774 while (*end && !
ISSPACE(*end) && *end !=
',') end++;
3775 len = (
int)(end - str);
3806 #define DBL_MANH_SIZE 20
3807 #define DBL_MANL_SIZE 32
3808 #define DBL_ADJ (DBL_MAX_EXP - 2)
3809 #define SIGFIGS ((DBL_MANT_DIG + 3) / 4 + 1)
3810 #define dexp_get(u) ((int)(word0(u) >> Exp_shift) & ~Exp_msk1)
3811 #define dexp_set(u,v) (word0(u) = (((int)(word0(u)) & ~Exp_mask) | ((v) << Exp_shift)))
3812 #define dmanh_get(u) ((uint32_t)(word0(u) & Frac_mask))
3813 #define dmanl_get(u) ((uint32_t)word1(u))
3853 word0(u) &= ~Sign_bit;
3862 else if (
isnan(d)) {
3866 else if (d == 0.0) {
3874 u.
d *= 5.363123171977039e+154 ;
3885 bufsize = (ndigits > 0) ? ndigits :
SIGFIGS;
3889 if (
SIGFIGS > ndigits && ndigits > 0) {
3904 for (s = s0 + 1; s < s0 +
bufsize; s++) {
3912 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)
SSL_METHOD *(* func)(void)
void ruby_each_words(const char *, void(*)(const char *, int, void *), void *)
static const char ZEROSTR[]
unsigned long ruby_strtoul(const char *str, char **endptr, int base)
double ruby_strtod(const char *, char **)
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]
int( cmpfunc_t)(const void *, const void *, void *)
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)
char * ruby_strdup(const char *)
static int quorem(Bigint *b, Bigint *S)
unsigned char buf[MIME_BUF_SIZE]
static Bigint * s2b(const char *s, int nd0, int nd, ULong y9)
static double * pmem_next
static const double tens[]
#define rounded_product(a, b)
static const char INFSTR[]
static const double bigtens[]
static int cmp(Bigint *a, Bigint *b)
void ruby_qsort(void *, const size_t, const size_t, int(*)(const void *, const void *, void *), void *)
#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)
RUBY_EXTERN int isinf(double)
void rb_sys_fail(const char *mesg)
#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)
unsigned long ruby_scan_hex(const char *, size_t, size_t *)
static void Bfree(Bigint *v)
static const double tinytens[]
static Bigint * freelist[Kmax+1]
static int match(VALUE str, VALUE pat, VALUE hash, int(*cb)(VALUE, VALUE))
static Bigint * i2b(int i)
unsigned long ruby_scan_oct(const char *, size_t, size_t *)
static Bigint * mult(Bigint *a, Bigint *b)
char * ruby_dtoa(double d_, int mode, int ndigits, int *decpt, int *sign, char **rve)