12 #if defined __MINGW32__ || defined __MINGW64__ 13 #define MINGW_HAS_SECURE_API 1 31 #define hexdigit ruby_hexdigits 36 register const char *s = start;
37 register unsigned long retval = 0;
39 while (len-- && *s >=
'0' && *s <=
'7') {
43 *retlen = (int)(s - start);
50 register const char *s = start;
51 register unsigned long retval = 0;
59 *retlen = (int)(s - start);
65 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
66 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
67 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
68 0, 1, 2, 3, 4, 5, 6, 7, 8, 9,-1,-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,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,
72 25,26,27,28,29,30,31,32,33,34,35,-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,
79 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
80 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,
87 const char *start = str;
88 unsigned long ret = 0, x;
89 unsigned long mul_overflow = (~(
unsigned long)0) / base;
100 if (d == -1 || base <= d) {
104 if (mul_overflow < ret)
111 }
while (len < 0 || --len);
112 *retlen = str - start;
123 const char *subject_found = str;
125 if (base == 1 || 36 < base) {
130 while ((c = *str) &&
ISSPACE(c))
143 subject_found = str+1;
144 if (base == 0 || base == 16) {
145 if (str[1] ==
'x' || str[1] ==
'X') {
150 b = base == 0 ? 8 : 16;
160 b = base == 0 ? 10 : base;
166 subject_found = str+
len;
169 *endptr = (
char*)subject_found;
177 ret = (
unsigned long)(-(
long)ret);
185 #include <sys/types.h> 186 #include <sys/stat.h> 190 #if defined(HAVE_FCNTL_H) 195 # define S_ISDIR(m) (((m) & S_IFMT) == S_IFDIR) 198 #if !defined HAVE_BSD_QSORT_R && defined HAVE_QSORT_S 199 # define qsort_r(base, nel, size, arg, cmp) qsort_s(base, nel, size, cmp, arg) 200 # define cmp_bsd_qsort cmp_ms_qsort 201 # define HAVE_BSD_QSORT_R 1 203 #if defined HAVE_BSD_QSORT_R 204 typedef int (
cmpfunc_t)(
const void*,
const void*,
void*);
206 struct bsd_qsort_r_args {
212 cmp_bsd_qsort(
void *d,
const void *a,
const void *b)
214 const struct bsd_qsort_r_args *args = d;
215 return (*args->cmp)(a, b, args->arg);
221 struct bsd_qsort_r_args args;
224 qsort_r(base, nel,
size, &args, cmp_bsd_qsort);
226 #elif !defined HAVE_GNU_QSORT_R 230 #define mmcount (16 / SIZEOF_LONG) 231 #define A ((mmtype*)a) 232 #define B ((mmtype*)b) 233 #define C ((mmtype*)c) 234 #define D ((mmtype*)d) 236 #define mmstep (sizeof(mmtype) * mmcount) 237 #define mmprepare(base, size) do {\ 238 if (((VALUE)(base) % sizeof(mmtype)) == 0 && ((size) % sizeof(mmtype)) == 0) \ 239 if ((size) >= mmstep) mmkind = 1;\ 242 high = ((size) / mmstep) * mmstep;\ 243 low = ((size) % mmstep);\ 246 #define mmarg mmkind, size, high, low 247 #define mmargdecl int mmkind, size_t size, size_t high, size_t low 256 register char *t = a + high;
258 s =
A[0];
A[0] =
B[0];
B[0] = s;
259 s =
A[1];
A[1] =
B[1];
B[1] = s;
261 s =
A[2];
A[2] =
B[2];
B[2] = s;
263 s =
A[3];
A[3] =
B[3];
B[3] = s;
270 if (low != 0) { s =
A[0];
A[0] =
B[0];
B[0] = s;
272 if (low >= 2 *
sizeof(
mmtype)) { s =
A[1];
A[1] =
B[1];
B[1] = s;
274 if (low >= 3 *
sizeof(
mmtype)) {s =
A[2];
A[2] =
B[2];
B[2] = s;}
281 register char *t = a +
size, s;
282 do {s = *a; *a++ = *b; *b++ = s;}
while (a < t);
285 #define mmswap(a,b) mmswap_((a),(b),mmarg) 294 register char *t = a + high;
296 s =
A[0];
A[0] =
B[0];
B[0] =
C[0];
C[0] = s;
297 s =
A[1];
A[1] =
B[1];
B[1] =
C[1];
C[1] = s;
299 s =
A[2];
A[2] =
B[2];
B[2] =
C[2];
C[2] = s;
301 s =
A[3];
A[3] =
B[3];
B[3] =
C[3];
C[3] = s;
308 if (low != 0) { s =
A[0];
A[0] =
B[0];
B[0] =
C[0];
C[0] = s;
310 if (low >= 2 *
sizeof(
mmtype)) { s =
A[1];
A[1] =
B[1];
B[1] =
C[1];
C[1] = s;
312 if (low == 3 *
sizeof(
mmtype)) {s =
A[2];
A[2] =
B[2];
B[2] =
C[2];
C[2] = s;}
319 register char *t = a +
size, s;
320 do {s = *a; *a++ = *b; *b++ = *c; *c++ = s;}
while (a < t);
323 #define mmrot3(a,b,c) mmrot3_((a),(b),(c),mmarg) 335 #define PUSH(ll,rr) do { top->LL = (ll); top->RR = (rr); ++top; } while (0) 336 #define POP(ll,rr) do { --top; (ll) = top->LL; (rr) = top->RR; } while (0) 338 #define med3(a,b,c) ((*cmp)((a),(b),d)<0 ? \ 339 ((*cmp)((b),(c),d)<0 ? (b) : ((*cmp)((a),(c),d)<0 ? (c) : (a))) : \ 340 ((*cmp)((b),(c),d)>0 ? (b) : ((*cmp)((a),(c),d)<0 ? (a) : (c)))) 342 typedef int (
cmpfunc_t)(
const void*,
const void*,
void*);
346 register char *l, *r, *m;
347 register int t, eq_l, eq_r;
349 char *
R = (
char*)base + size*(nel-1);
357 if (nel <= 1)
return;
362 if (stack == top)
return;
368 if ((*cmp)(L,R,d) > 0)
mmswap(L,R);
goto nxt;
372 n = (r - l +
size) / size;
373 m = l + size * (n >> 1);
381 register char *p1 = l + n;
382 register char *p2 = p1 + n;
383 register char *p3 = p2 + n;
384 m1 =
med3(p1, p2, p3);
388 m3 =
med3(p1, p2, p3);
399 if ((t = (*cmp)(l,m,d)) < 0) {
400 if ((t = (*cmp)(m,r,d)) < 0) {
401 if (chklim && nel >= chklim) {
404 for (p=l; p<r; p+=size) if ((*cmp)(p,p+size,d) > 0)
goto fail;
410 if ((*cmp)(l,r,d) <= 0) {
mmswap(m,r);
goto loopA;}
411 mmrot3(r,m,l);
goto loopA;
417 if ((t = (*cmp)(m,r,d)) > 0) {
418 if (chklim && nel >= chklim) {
421 for (p=l; p<r; p+=
size)
if ((*cmp)(p,p+size,d) < 0)
goto fail2;
425 fail2:
mmswap(l,r);
goto loopA;
428 if ((*cmp)(l,r,d) <= 0) {
mmswap(l,m);
goto loopB;}
429 mmrot3(l,m,r);
goto loopA;
434 if ((t = (*cmp)(m,r,d)) < 0) {
goto loopA;}
435 if (t > 0) {
mmswap(l,r);
goto loopB;}
439 if ((l += size) == r)
goto nxt;
440 if (l == m)
continue;
441 if ((t = (*cmp)(l,m,d)) > 0) {
mmswap(l,r); l =
L;
goto loopA;}
442 if (t < 0) {
mmswap(L,l); l =
L;
goto loopB;}
445 loopA: eq_l = 1; eq_r = 1;
448 if ((l += size) == r)
450 if (l == m)
continue;
451 if ((t = (*cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
455 if (l == (r -= size))
457 if (r == m) {m = l;
break;}
458 if ((t = (*cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
464 loopB: eq_l = 1; eq_r = 1;
467 if (l == (r -= size))
469 if (r == m)
continue;
470 if ((t = (*cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
474 if ((l += size) == r)
476 if (l == m) {m = r;
break;}
477 if ((t = (*cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
486 if (l-L < R-r) {
PUSH(r,R); R = l;}
487 else {
PUSH(L,l); L = r;}
489 else if (eq_r == 0) L = r;
510 #if defined __native_client__ 513 #elif defined HAVE_GETCWD 514 # if defined NO_GETCWD_MALLOC 518 while (!getcwd(buf, size)) {
528 char *
buf, *cwd = getcwd(
NULL, 0);
535 # define PATH_MAX 8192 713 #ifdef WORDS_BIGENDIAN 714 #define IEEE_BIG_ENDIAN 716 #define IEEE_LITTLE_ENDIAN 721 #undef IEEE_BIG_ENDIAN 722 #undef IEEE_LITTLE_ENDIAN 725 #if defined(__arm__) && !defined(__VFP_FP__) 726 #define IEEE_BIG_ENDIAN 727 #undef IEEE_LITTLE_ENDIAN 735 #define ULong unsigned int 736 #elif SIZEOF_LONG == 4 737 #define Long long int 738 #define ULong unsigned long int 742 #define Llong LONG_LONG 747 #define Bug(x) {fprintf(stderr, "%s\n", (x)); exit(EXIT_FAILURE);} 758 extern void *
MALLOC(
size_t);
760 #define MALLOC xmalloc 763 extern void FREE(
void*);
768 #ifndef Omit_Private_Memory 770 #define PRIVATE_MEM 2304 772 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double)) 777 #undef Avoid_Underflow 778 #ifdef IEEE_BIG_ENDIAN 781 #ifdef IEEE_LITTLE_ENDIAN 789 #define DBL_MAX_10_EXP 308 790 #define DBL_MAX_EXP 1024 796 #define DBL_MAX_10_EXP 75 797 #define DBL_MAX_EXP 63 799 #define DBL_MAX 7.2370055773322621e+75 804 #define DBL_MAX_10_EXP 38 805 #define DBL_MAX_EXP 127 807 #define DBL_MAX 1.7014118346046923e+38 811 #define LONG_MAX 2147483647 829 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + defined(IBM) != 1 833 typedef union {
double d; ULong
L[2]; }
U;
838 # ifdef IEEE_LITTLE_ENDIAN 839 # define word0(x) (((ULong *)&(x))[1]) 840 # define word1(x) (((ULong *)&(x))[0]) 842 # define word0(x) (((ULong *)&(x))[0]) 843 # define word1(x) (((ULong *)&(x))[1]) 847 # ifdef IEEE_LITTLE_ENDIAN 848 # define word0(x) ((x).L[1]) 849 # define word1(x) ((x).L[0]) 851 # define word0(x) ((x).L[0]) 852 # define word1(x) ((x).L[1]) 854 # define dval(x) ((x).d) 861 #if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm__) 862 #define Storeinc(a,b,c) (((unsigned short *)(a))[1] = (unsigned short)(b), \ 863 ((unsigned short *)(a))[0] = (unsigned short)(c), (a)++) 865 #define Storeinc(a,b,c) (((unsigned short *)(a))[0] = (unsigned short)(b), \ 866 ((unsigned short *)(a))[1] = (unsigned short)(c), (a)++) 877 #define Exp_shift1 20 878 #define Exp_msk1 0x100000 879 #define Exp_msk11 0x100000 880 #define Exp_mask 0x7ff00000 884 #define Exp_1 0x3ff00000 885 #define Exp_11 0x3ff00000 887 #define Frac_mask 0xfffff 888 #define Frac_mask1 0xfffff 891 #define Bndry_mask 0xfffff 892 #define Bndry_mask1 0xfffff 894 #define Sign_bit 0x80000000 900 #ifndef NO_IEEE_Scale 901 #define Avoid_Underflow 903 #undef Sudden_Underflow 909 #define Flt_Rounds FLT_ROUNDS 915 #ifdef Honor_FLT_ROUNDS 916 #define Rounding rounding 917 #undef Check_FLT_ROUNDS 918 #define Check_FLT_ROUNDS 920 #define Rounding Flt_Rounds 924 #undef Check_FLT_ROUNDS 925 #undef Honor_FLT_ROUNDS 927 #undef Sudden_Underflow 928 #define Sudden_Underflow 933 #define Exp_shift1 24 934 #define Exp_msk1 0x1000000 935 #define Exp_msk11 0x1000000 936 #define Exp_mask 0x7f000000 939 #define Exp_1 0x41000000 940 #define Exp_11 0x41000000 942 #define Frac_mask 0xffffff 943 #define Frac_mask1 0xffffff 946 #define Bndry_mask 0xefffff 947 #define Bndry_mask1 0xffffff 949 #define Sign_bit 0x80000000 951 #define Tiny0 0x100000 960 #define Exp_msk1 0x80 961 #define Exp_msk11 0x800000 962 #define Exp_mask 0x7f80 965 #define Exp_1 0x40800000 966 #define Exp_11 0x4080 968 #define Frac_mask 0x7fffff 969 #define Frac_mask1 0xffff007f 972 #define Bndry_mask 0xffff007f 973 #define Bndry_mask1 0xffff007f 975 #define Sign_bit 0x8000 989 #define rounded_product(a,b) ((a) = rnd_prod((a), (b))) 990 #define rounded_quotient(a,b) ((a) = rnd_quot((a), (b))) 991 extern double rnd_prod(
double,
double), rnd_quot(
double,
double);
993 #define rounded_product(a,b) ((a) *= (b)) 994 #define rounded_quotient(a,b) ((a) /= (b)) 997 #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1)) 998 #define Big1 0xffffffff 1004 #define FFFFFFFF 0xffffffffUL 1018 #define Llong long long 1021 #define ULLong unsigned Llong 1025 #define MULTIPLE_THREADS 1 1027 #ifndef MULTIPLE_THREADS 1028 #define ACQUIRE_DTOA_LOCK(n) 1029 #define FREE_DTOA_LOCK(n) 1031 #define ACQUIRE_DTOA_LOCK(n) 1032 #define FREE_DTOA_LOCK(n) 1052 #ifndef Omit_Private_Memory 1057 if (k <=
Kmax && (rv = freelist[k]) != 0) {
1058 freelist[
k] = rv->
next;
1062 #ifdef Omit_Private_Memory 1065 len = (
sizeof(
Bigint) + (x-1)*
sizeof(ULong) +
sizeof(
double) - 1)
1091 v->
next = freelist[v->
k];
1097 #define Bcopy(x,y) memcpy((char *)&(x)->sign, (char *)&(y)->sign, \ 1098 (y)->wds*sizeof(Long) + 2*sizeof(int)) 1121 y = *x * (
ULLong)m + carry;
1127 y = (xi & 0xffff) * m + carry;
1128 z = (xi >> 16) * m + (y >> 16);
1130 *x++ = (z << 16) + (y & 0xffff);
1137 }
while (++i < wds);
1145 b->
x[wds++] = (ULong)carry;
1152 s2b(
const char *s,
int nd0,
int nd, ULong y9)
1159 for (k = 0, y = 1; x > y; y <<= 1, k++) ;
1166 b->
x[0] = y9 & 0xffff;
1167 b->
wds = (b->
x[1] = y9 >> 16) ? 2 : 1;
1174 b =
multadd(b, 10, *s++ -
'0');
1175 }
while (++i < nd0);
1181 b =
multadd(b, 10, *s++ -
'0');
1190 if (!(x & 0xffff0000)) {
1194 if (!(x & 0xff000000)) {
1198 if (!(x & 0xf0000000)) {
1202 if (!(x & 0xc0000000)) {
1206 if (!(x & 0x80000000)) {
1208 if (!(x & 0x40000000))
1218 register ULong
x = *y;
1231 if (!(x & 0xffff)) {
1273 ULong *
x, *xa, *xae, *xb, *xbe, *xc, *xc0;
1296 for (x = c->
x, xa = x + wc; x < xa; x++)
1304 for (; xb < xbe; xc0++) {
1305 if ((y = *xb++) != 0) {
1310 z = *x++ * (
ULLong)y + *xc + carry;
1319 for (; xb < xbe; xb++, xc0++) {
1320 if (y = *xb & 0xffff) {
1325 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
1327 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
1333 if (y = *xb >> 16) {
1339 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
1342 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
1349 for (; xb < xbe; xc0++) {
1355 z = *x++ * y + *xc + carry;
1364 for (xc0 = c->
x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
1376 static int p05[3] = { 5, 25, 125 };
1378 if ((i = k & 3) != 0)
1385 #ifdef MULTIPLE_THREADS 1388 p5 = p5s =
i2b(625);
1393 p5 = p5s =
i2b(625);
1405 if (!(p51 = p5->
next)) {
1406 #ifdef MULTIPLE_THREADS 1408 if (!(p51 = p5->
next)) {
1428 ULong *
x, *x1, *xe, z;
1436 n1 = n + b->
wds + 1;
1437 for (i = b->
maxwds; n1 > i; i <<= 1)
1441 for (i = 0; i < n; i++)
1450 *x1++ = *x << k | z;
1461 *x1++ = *x << k & 0xffff | z;
1480 ULong *xa, *xa0, *xb, *xb0;
1486 if (i > 1 && !a->
x[i-1])
1487 Bug(
"cmp called with a->x[a->wds-1] == 0");
1488 if (j > 1 && !b->
x[j-1])
1489 Bug(
"cmp called with b->x[b->wds-1] == 0");
1499 return *xa < *xb ? -1 : 1;
1511 ULong *xa, *xae, *xb, *xbe, *xc;
1548 y = (
ULLong)*xa++ - *xb++ - borrow;
1549 borrow = y >> 32 & (ULong)1;
1554 borrow = y >> 32 & (ULong)1;
1560 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
1561 borrow = (y & 0x10000) >> 16;
1562 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
1563 borrow = (z & 0x10000) >> 16;
1567 y = (*xa & 0xffff) - borrow;
1568 borrow = (y & 0x10000) >> 16;
1569 z = (*xa++ >> 16) - borrow;
1570 borrow = (z & 0x10000) >> 16;
1575 y = *xa++ - *xb++ - borrow;
1576 borrow = (y & 0x10000) >> 16;
1581 borrow = (y & 0x10000) >> 16;
1600 #ifndef Avoid_Underflow 1601 #ifndef Sudden_Underflow 1610 #ifndef Avoid_Underflow 1611 #ifndef Sudden_Underflow 1615 if (L < Exp_shift) {
1622 word1(a) = L >= 31 ? 1 : 1 << 31 -
L;
1633 ULong *xa, *xa0, w, y, z;
1647 if (!y) Bug(
"zero y in b2d");
1654 w = xa > xa0 ? *--xa : 0;
1658 z = xa > xa0 ? *--xa : 0;
1660 d0 =
Exp_1 | y << k | z >> (32 -
k);
1661 y = xa > xa0 ? *--xa : 0;
1662 d1 = z << k | y >> (32 -
k);
1669 if (k <
Ebits + 16) {
1670 z = xa > xa0 ? *--xa : 0;
1672 w = xa > xa0 ? *--xa : 0;
1673 y = xa > xa0 ? *--xa : 0;
1677 z = xa > xa0 ? *--xa : 0;
1678 w = xa > xa0 ? *--xa : 0;
1680 d0 =
Exp_1 | y << k + 16 | z << k | w >> 16 -
k;
1681 y = xa > xa0 ? *--xa : 0;
1682 d1 = w << k + 16 | y <<
k;
1686 word0(d) = d0 >> 16 | d0 << 16;
1687 word1(d) = d1 >> 16 | d1 << 16;
1696 d2b(
double d_,
int *e,
int *bits)
1702 #ifndef Sudden_Underflow 1726 #ifdef Sudden_Underflow 1736 if ((y = d1) != 0) {
1738 x[0] = y | z << (32 -
k);
1743 #ifndef Sudden_Underflow 1746 b->
wds = (x[1] = z) ? 2 : 1;
1751 Bug(
"Zero passed to d2b");
1755 #ifndef Sudden_Underflow 1765 x[0] = y | z << 32 - k & 0xffff;
1766 x[1] = z >> k - 16 & 0xffff;
1772 x[1] = y >> 16 | z << 16 - k & 0xffff;
1773 x[2] = z >> k & 0xffff;
1788 Bug(
"Zero passed to d2b");
1806 #ifndef Sudden_Underflow 1810 *e = (de -
Bias - (
P-1) << 2) +
k;
1813 *e = de -
Bias - (
P-1) + k;
1816 #ifndef Sudden_Underflow 1819 *e = de -
Bias - (
P-1) + 1 + k;
1821 *bits = 32*i -
hi0bits(x[i-1]);
1823 *bits = (i+2)*16 -
hi0bits(x[i]);
1841 k = ka - kb + 32*(a->
wds - b->
wds);
1843 k = ka - kb + 16*(a->
wds - b->
wds);
1870 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
1871 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
1881 static const double tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
1882 #ifdef Avoid_Underflow 1883 9007199254740992.*9007199254740992.e-256
1891 #define Scale_Bit 0x10 1895 bigtens[] = { 1e16, 1e32, 1e64 };
1896 static const double tinytens[] = { 1e-16, 1e-32, 1e-64 };
1900 static const double tinytens[] = { 1e-16, 1e-32 };
1912 #define NAN_WORD0 0x7ff80000 1920 match(
const char **sp,
char *t)
1923 const char *s = *sp;
1926 if ((c = *++s) >=
'A' && c <=
'Z')
1937 hexnan(
double *rvp,
const char **sp)
1941 int havedig, udx0, xshift;
1944 havedig = xshift = 0;
1947 while (c = *(
const unsigned char*)++s) {
1948 if (c >=
'0' && c <=
'9')
1950 else if (c >=
'a' && c <=
'f')
1952 else if (c >=
'A' && c <=
'F')
1954 else if (c <=
' ') {
1955 if (udx0 && havedig) {
1961 else if ( c ==
')' && havedig) {
1974 x[0] = (x[0] << 4) | (x[1] >> 28);
1975 x[1] = (x[1] << 4) | c;
1977 if ((x[0] &= 0xfffff) || x[1]) {
1988 #ifdef Avoid_Underflow 1991 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
1992 e, e1, esign, i, j,
k, nd, nd0, nf, nz, nz0,
sign;
1993 const char *s, *s0, *s1;
1998 Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
2000 int inexact, oldinexact;
2002 #ifdef Honor_FLT_ROUNDS 2010 sign = nz0 = nz = 0;
2035 if (s[1] ==
'x' || s[1] ==
'X') {
2043 while (*++s ==
'0');
2048 adj += aadj * ((s1 -
hexdigit) & 15);
2064 adj += aadj * ((s1 -
hexdigit) & 15);
2065 if ((aadj /= 16) == 0.0) {
2075 if (*s ==
'P' || *s ==
'p') {
2076 dsign = 0x2C - *++s;
2077 if (abs(dsign) == 1) s++;
2082 if (c <
'0' ||
'9' < c)
goto ret0;
2089 if (nd + dsign * nd0 > 2095) {
2090 while (
'0' <= c && c <=
'9') c = *++s;
2093 }
while (
'0' <= c && c <=
'9');
2097 if (dsign)
goto ret0;
2099 dval(rv) = ldexp(adj, nd0);
2103 while (*++s ==
'0') ;
2109 for (nd = nf = 0; (c = *s) >=
'0' && c <=
'9'; nd++, s++)
2116 s1 = localeconv()->decimal_point;
2139 for (; c ==
'0'; c = *++s)
2141 if (c >
'0' && c <=
'9') {
2149 for (; c >=
'0' && c <=
'9'; c = *++s) {
2157 for (i = 1; i < nz; i++)
2172 if (c ==
'e' || c ==
'E') {
2173 if (!nd && !nz && !nz0) {
2184 if (c >=
'0' && c <=
'9') {
2187 if (c >
'0' && c <=
'9') {
2190 while ((c = *++s) >=
'0' && c <=
'9')
2192 if (s - s1 > 8 || L > 19999)
2215 if (
match(&s,
"nf")) {
2217 if (!
match(&s,
"inity"))
2219 word0(rv) = 0x7ff00000;
2226 if (
match(&s,
"an")) {
2227 word0(rv) = NAN_WORD0;
2228 word1(rv) = NAN_WORD1;
2257 oldinexact = get_inexact();
2261 bd0 = bb = bd = bs = delta = 0;
2263 #ifndef RND_PRODQUOT
2264 #ifndef Honor_FLT_ROUNDS
2274 goto vax_ovfl_check;
2276 #ifdef Honor_FLT_ROUNDS 2292 #ifdef Honor_FLT_ROUNDS 2318 #ifndef Inaccurate_Divide 2320 #ifdef Honor_FLT_ROUNDS 2338 oldinexact = get_inexact();
2340 #ifdef Avoid_Underflow 2343 #ifdef Honor_FLT_ROUNDS 2346 rounding = rounding == 2 ? 0 : 2;
2357 if ((i = e1 & 15) != 0)
2367 #ifdef Honor_FLT_ROUNDS 2396 for (j = 0; e1 > 1; j++, e1 >>= 1)
2417 if ((i = e1 & 15) != 0)
2422 #ifdef Avoid_Underflow 2425 for (j = 0; e1 > 0; j++, e1 >>= 1)
2436 word0(rv) &= 0xffffffff << (j-32);
2439 word1(rv) &= 0xffffffff << j;
2442 for (j = 0; e1 > 1; j++, e1 >>= 1)
2462 #ifndef Avoid_Underflow 2477 bd0 =
s2b(s0, nd0, nd, y);
2482 bb =
d2b(
dval(rv), &bbe, &bbbits);
2498 #ifdef Honor_FLT_ROUNDS 2502 #ifdef Avoid_Underflow 2510 #ifdef Sudden_Underflow 2512 j = 1 + 4*
P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
2527 #ifdef Avoid_Underflow 2530 i = bb2 < bd2 ? bb2 : bd2;
2552 delta =
diff(bb, bd);
2553 dsign = delta->
sign;
2556 #ifdef Honor_FLT_ROUNDS 2557 if (rounding != 1) {
2560 if (!delta->
x[0] && delta->
wds <= 1) {
2578 #ifdef Avoid_Underflow 2585 if (
cmp(delta, bs) <= 0)
2590 #ifdef Avoid_Underflow 2593 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2595 #ifdef Sudden_Underflow 2596 if ((
word0(rv) & Exp_mask) <=
2609 adj =
ratio(delta, bs);
2612 if (adj <= 0x7ffffffe) {
2616 if (!((rounding>>1) ^ dsign))
2621 #ifdef Avoid_Underflow 2623 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2625 #ifdef Sudden_Underflow 2661 if (!delta->
x[0] && delta->
wds <= 1)
2666 if (!delta->
x[0] && delta->
wds <= 1) {
2674 if (
cmp(delta, bs) > 0)
2685 ? (0xffffffff & (0xffffffff << (2*
P+1-(y>>
Exp_shift)))) :
2696 #ifdef Avoid_Underflow 2705 #ifdef Sudden_Underflow 2710 #ifdef Avoid_Underflow 2719 #ifdef Avoid_Underflow 2722 if (L <= (2*
P+1)*Exp_msk1) {
2723 if (L > (
P+2)*Exp_msk1)
2735 word1(rv) = 0xffffffff;
2742 #ifndef ROUND_BIASED 2748 #ifndef ROUND_BIASED 2751 #ifndef Sudden_Underflow 2756 #ifdef Avoid_Underflow 2762 if ((aadj =
ratio(delta, bs)) <= 2.) {
2764 aadj =
dval(aadj1) = 1.;
2766 #ifndef Sudden_Underflow 2781 dval(aadj1) = -aadj;
2786 dval(aadj1) = dsign ? aadj : -aadj;
2787 #ifdef Check_FLT_ROUNDS 2822 #ifdef Avoid_Underflow 2824 if (aadj <= 0x7fffffff) {
2825 if ((z = (
int)aadj) <= 0)
2828 dval(aadj1) = dsign ? aadj : -aadj;
2830 word0(aadj1) += (2*
P+1)*Exp_msk1 - y;
2835 #ifdef Sudden_Underflow 2842 if ((
word0(rv) & Exp_mask) <
P*Exp_msk1)
2844 if ((
word0(rv) & Exp_mask) <=
P*Exp_msk1)
2868 if (y <= (
P-1)*Exp_msk1 && aadj > 1.) {
2869 dval(aadj1) = (double)(
int)(aadj + 0.5);
2880 #ifdef Avoid_Underflow 2889 if (aadj < .4999999 || aadj > .5000001)
2910 else if (!oldinexact)
2913 #ifdef Avoid_Underflow 2941 return sign ? -
dval(rv) :
dval(rv);
2948 ULong *bx, *bxe, q, *sx, *sxe;
2950 ULLong borrow, carry, y, ys;
2952 ULong borrow, carry, y, ys;
2961 Bug(
"oversize b in quorem");
2969 q = *bxe / (*sxe + 1);
2972 Bug(
"oversized quotient in quorem");
2979 ys = *sx++ * (
ULLong)q + carry;
2981 y = *bx - (ys &
FFFFFFFF) - borrow;
2982 borrow = y >> 32 & (ULong)1;
2987 ys = (si & 0xffff) * q + carry;
2988 zs = (si >> 16) * q + (ys >> 16);
2990 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2991 borrow = (y & 0x10000) >> 16;
2992 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2993 borrow = (z & 0x10000) >> 16;
2996 ys = *sx++ * q + carry;
2998 y = *bx - (ys & 0xffff) - borrow;
2999 borrow = (y & 0x10000) >> 16;
3003 }
while (sx <= sxe);
3006 while (--bxe > bx && !*bxe)
3011 if (
cmp(b, S) >= 0) {
3021 y = *bx - (ys &
FFFFFFFF) - borrow;
3022 borrow = y >> 32 & (ULong)1;
3027 ys = (si & 0xffff) + carry;
3028 zs = (si >> 16) + (ys >> 16);
3030 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
3031 borrow = (y & 0x10000) >> 16;
3032 z = (*bx >> 16) - (zs & 0xffff) - borrow;
3033 borrow = (z & 0x10000) >> 16;
3038 y = *bx - (ys & 0xffff) - borrow;
3039 borrow = (y & 0x10000) >> 16;
3043 }
while (sx <= sxe);
3047 while (--bxe > bx && !*bxe)
3055 #ifndef MULTIPLE_THREADS 3056 static char *dtoa_result;
3059 #ifndef MULTIPLE_THREADS 3063 return dtoa_result =
xmalloc(i);
3066 #define rv_alloc(i) xmalloc(i) 3075 while ((*t = *s++) != 0) t++;
3081 #define rv_strdup(s, rve) nrv_alloc((s), (rve), strlen(s)+1) 3083 #ifndef MULTIPLE_THREADS 3172 int bbits, b2, b5, be, dig, i, ieps, ilim, ilim0, ilim1,
3173 j, j1,
k, k0, k_check, leftright, m2, m5, s2, s5,
3174 spec_case, try_quick, half = 0;
3176 #ifndef Sudden_Underflow 3180 Bigint *b, *b1, *delta, *mlo = 0, *mhi = 0, *
S;
3184 #ifdef Honor_FLT_ROUNDS 3188 int inexact, oldinexact;
3193 #ifndef MULTIPLE_THREADS 3195 freedtoa(dtoa_result);
3203 word0(d) &= ~Sign_bit;
3208 #if defined(IEEE_Arith) + defined(VAX) 3212 if (
word0(d) == 0x8000)
3233 try_quick = oldinexact = get_inexact();
3236 #ifdef Honor_FLT_ROUNDS 3239 rounding = rounding == 2 ? 0 : 2;
3246 b =
d2b(
dval(d), &be, &bbits);
3247 #ifdef Sudden_Underflow 3287 #ifndef Sudden_Underflow 3293 i = bbits + be + (
Bias + (
P-1) - 1);
3294 x = i > 32 ?
word0(d) << (64 - i) |
word1(d) >> (i - 32)
3295 :
word1(d) << (32 - i);
3298 i -= (
Bias + (
P-1) - 1) + 1;
3302 ds = (
dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
3304 if (ds < 0. && ds != k)
3331 if (mode < 0 || mode > 9)
3335 #ifdef Check_FLT_ROUNDS 3360 ilim = ilim1 = i = ndigits;
3366 i = ndigits + k + 1;
3374 #ifdef Honor_FLT_ROUNDS 3375 if (mode > 1 && rounding != 1)
3379 if (ilim >= 0 && ilim <=
Quick_max && try_quick) {
3397 for (; j; j >>= 1, i++)
3404 else if ((j1 = -k) != 0) {
3406 for (j = j1 >> 4; j; j >>= 1, i++)
3412 if (k_check &&
dval(d) < 1. && ilim > 0) {
3431 #ifndef No_leftright 3440 *s++ =
'0' + (int)L;
3455 for (i = 1;; i++,
dval(d) *= 10.) {
3456 L = (Long)(
dval(d));
3457 if (!(
dval(d) -=
L))
3459 *s++ =
'0' + (int)L;
3463 else if (
dval(d) < 0.5 -
dval(eps)) {
3464 while (*--s ==
'0') ;
3469 if ((*(s-1) -
'0') & 1) {
3475 #ifndef No_leftright 3487 if (be >= 0 && k <=
Int_max) {
3490 if (ndigits < 0 && ilim <= 0) {
3492 if (ilim < 0 ||
dval(d) <= 5*ds)
3496 for (i = 1;; i++,
dval(d) *= 10.) {
3497 L = (Long)(
dval(d) / ds);
3499 #ifdef Check_FLT_ROUNDS 3506 *s++ =
'0' + (int)L;
3514 #ifdef Honor_FLT_ROUNDS 3518 case 2:
goto bump_up;
3522 if (
dval(d) > ds || (
dval(d) == ds && (L & 1))) {
3542 #ifndef Sudden_Underflow 3543 denorm ? be + (
Bias + (
P-1) - 1 + 1) :
3546 1 + 4*
P - 3 - bbits + ((bbits + be - 1) & 3);
3554 if (m2 > 0 && s2 > 0) {
3555 i = m2 < s2 ? m2 : s2;
3568 if ((j = b5 - m5) != 0)
3581 if ((mode < 2 || leftright)
3582 #ifdef Honor_FLT_ROUNDS
3587 #ifndef Sudden_Underflow
3606 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0x1f) != 0)
3609 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0xf) != 0)
3637 if (ilim <= 0 && (mode == 3 || mode == 5)) {
3670 delta =
diff(
S, mhi);
3671 j1 = delta->
sign ? 1 :
cmp(b, delta);
3673 #ifndef ROUND_BIASED 3674 if (j1 == 0 && mode != 1 && !(
word1(d) & 1)
3675 #ifdef Honor_FLT_ROUNDS
3684 else if (!b->
x[0] && b->
wds <= 1)
3691 if (j < 0 || (j == 0 && mode != 1
3692 #ifndef ROUND_BIASED
3696 if (!b->
x[0] && b->
wds <= 1) {
3702 #ifdef Honor_FLT_ROUNDS 3705 case 0:
goto accept_dig;
3706 case 2:
goto keep_dig;
3712 if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ ==
'9')
3720 #ifdef Honor_FLT_ROUNDS 3732 #ifdef Honor_FLT_ROUNDS 3740 mlo = mhi =
multadd(mhi, 10, 0);
3749 *s++ = dig =
quorem(b,
S) +
'0';
3750 if (!b->
x[0] && b->
wds <= 1) {
3763 #ifdef Honor_FLT_ROUNDS 3765 case 0:
goto trimzeros;
3766 case 2:
goto roundoff;
3771 if (j > 0 || (j == 0 && (dig & 1))) {
3779 if (!half || (*s -
'0') & 1)
3783 while (*--s ==
'0') ;
3789 if (mlo && mlo != mhi)
3802 else if (!oldinexact)
3820 for (; *str; str = end) {
3821 while (
ISSPACE(*str) || *str ==
',') str++;
3824 while (*end && !
ISSPACE(*end) && *end !=
',') end++;
3825 len = (int)(end - str);
3826 (*func)(str,
len, arg);
3856 #define DBL_MANH_SIZE 20 3857 #define DBL_MANL_SIZE 32 3858 #define DBL_ADJ (DBL_MAX_EXP - 2) 3859 #define SIGFIGS ((DBL_MANT_DIG + 3) / 4 + 1) 3860 #define dexp_get(u) ((int)(word0(u) >> Exp_shift) & ~Exp_msk1) 3861 #define dexp_set(u,v) (word0(u) = (((int)(word0(u)) & ~Exp_mask) | ((v) << Exp_shift))) 3862 #define dmanh_get(u) ((uint32_t)(word0(u) & Frac_mask)) 3863 #define dmanl_get(u) ((uint32_t)word1(u)) 3903 word0(u) &= ~Sign_bit;
3912 else if (
isnan(d)) {
3916 else if (d == 0.0) {
3924 u.
d *= 5.363123171977039e+154 ;
3935 bufsize = (ndigits > 0) ? ndigits :
SIGFIGS;
3939 if (
SIGFIGS > ndigits && ndigits > 0) {
3951 for (s = s0 + 1; s < s0 + bufsize; s++) {
3959 for (ndigits =
SIGFIGS; s0[ndigits - 1] ==
'0'; ndigits--)
static int lo0bits(ULong *y)
size_t strlen(const char *)
void rb_syserr_fail(int e, const char *mesg)
#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 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)
const signed char ruby_digit36_to_number_table[]
#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)
register unsigned int len
#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)
const char ruby_hexdigits[]
unsigned long ruby_scan_digits(const char *str, ssize_t len, int base, size_t *retlen, int *overflow)
#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)