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);
285 if (nel <= 1)
return;
290 if (stack == top)
return;
296 if ((*
cmp)(L,R,d) > 0)
mmswap(L,R);
goto nxt;
300 n = (r - l +
size) / size;
301 m = l + size * (n >> 1);
309 register char *p1 = l + n;
310 register char *p2 = p1 + n;
311 register char *p3 = p2 + n;
312 m1 =
med3(p1, p2, p3);
316 m3 =
med3(p1, p2, p3);
327 if ((t = (*
cmp)(l,m,d)) < 0) {
328 if ((t = (*
cmp)(m,r,d)) < 0) {
329 if (chklim && nel >= chklim) {
332 for (p=l; p<r; p+=size) if ((*cmp)(p,p+size,d) > 0)
goto fail;
338 if ((*
cmp)(l,r,d) <= 0) {
mmswap(m,r);
goto loopA;}
339 mmrot3(r,m,l);
goto loopA;
345 if ((t = (*
cmp)(m,r,d)) > 0) {
346 if (chklim && nel >= chklim) {
349 for (p=l; p<r; p+=
size)
if ((*
cmp)(p,p+size,d) < 0)
goto fail2;
353 fail2:
mmswap(l,r);
goto loopA;
356 if ((*
cmp)(l,r,d) <= 0) {
mmswap(l,m);
goto loopB;}
357 mmrot3(l,m,r);
goto loopA;
362 if ((t = (*
cmp)(m,r,d)) < 0) {
goto loopA;}
363 if (t > 0) {
mmswap(l,r);
goto loopB;}
367 if ((l += size) == r)
goto nxt;
368 if (l == m)
continue;
369 if ((t = (*
cmp)(l,m,d)) > 0) {
mmswap(l,r); l = L;
goto loopA;}
370 if (t < 0) {
mmswap(L,l); l = L;
goto loopB;}
373 loopA: eq_l = 1; eq_r = 1;
376 if ((l += size) == r)
378 if (l == m)
continue;
379 if ((t = (*
cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
383 if (l == (r -= size))
385 if (r == m) {m = l;
break;}
386 if ((t = (*
cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
392 loopB: eq_l = 1; eq_r = 1;
395 if (l == (r -= size))
397 if (r == m)
continue;
398 if ((t = (*
cmp)(r,m,d)) < 0) {eq_l = 0;
break;}
402 if ((l += size) == r)
404 if (l == m) {m = r;
break;}
405 if ((t = (*
cmp)(l,m,d)) > 0) {eq_r = 0;
break;}
414 if (l-L < R-r) {
PUSH(r,R); R = l;}
415 else {
PUSH(L,l); L = r;}
417 else if (eq_r == 0) L = r;
429 memcpy(tmp, str, len);
441 while (!getcwd(buf, size)) {
442 if (
errno != ERANGE) {
451 # define PATH_MAX 8192
628 #ifdef WORDS_BIGENDIAN
629 #define IEEE_BIG_ENDIAN
631 #define IEEE_LITTLE_ENDIAN
636 #undef IEEE_BIG_ENDIAN
637 #undef IEEE_LITTLE_ENDIAN
640 #if defined(__arm__) && !defined(__VFP_FP__)
641 #define IEEE_BIG_ENDIAN
642 #undef IEEE_LITTLE_ENDIAN
650 #define ULong unsigned int
651 #elif SIZEOF_LONG == 4
652 #define Long long int
653 #define ULong unsigned long int
657 #define Llong LONG_LONG
662 #define Bug(x) {fprintf(stderr, "%s\n", (x)); exit(EXIT_FAILURE);}
673 extern void *
MALLOC(
size_t);
675 #define MALLOC malloc
678 #ifndef Omit_Private_Memory
680 #define PRIVATE_MEM 2304
682 #define PRIVATE_mem ((PRIVATE_MEM+sizeof(double)-1)/sizeof(double))
687 #undef Avoid_Underflow
688 #ifdef IEEE_BIG_ENDIAN
691 #ifdef IEEE_LITTLE_ENDIAN
699 #define DBL_MAX_10_EXP 308
700 #define DBL_MAX_EXP 1024
706 #define DBL_MAX_10_EXP 75
707 #define DBL_MAX_EXP 63
709 #define DBL_MAX 7.2370055773322621e+75
714 #define DBL_MAX_10_EXP 38
715 #define DBL_MAX_EXP 127
717 #define DBL_MAX 1.7014118346046923e+38
721 #define LONG_MAX 2147483647
739 #if defined(IEEE_LITTLE_ENDIAN) + defined(IEEE_BIG_ENDIAN) + defined(VAX) + defined(IBM) != 1
743 typedef union {
double d; ULong L[2]; }
U;
748 # ifdef IEEE_LITTLE_ENDIAN
749 # define word0(x) (((ULong *)&(x))[1])
750 # define word1(x) (((ULong *)&(x))[0])
752 # define word0(x) (((ULong *)&(x))[0])
753 # define word1(x) (((ULong *)&(x))[1])
757 # ifdef IEEE_LITTLE_ENDIAN
758 # define word0(x) ((x).L[1])
759 # define word1(x) ((x).L[0])
761 # define word0(x) ((x).L[0])
762 # define word1(x) ((x).L[1])
764 # define dval(x) ((x).d)
771 #if defined(IEEE_LITTLE_ENDIAN) + defined(VAX) + defined(__arm__)
772 #define Storeinc(a,b,c) (((unsigned short *)(a))[1] = (unsigned short)(b), \
773 ((unsigned short *)(a))[0] = (unsigned short)(c), (a)++)
775 #define Storeinc(a,b,c) (((unsigned short *)(a))[0] = (unsigned short)(b), \
776 ((unsigned short *)(a))[1] = (unsigned short)(c), (a)++)
787 #define Exp_shift1 20
788 #define Exp_msk1 0x100000
789 #define Exp_msk11 0x100000
790 #define Exp_mask 0x7ff00000
794 #define Exp_1 0x3ff00000
795 #define Exp_11 0x3ff00000
797 #define Frac_mask 0xfffff
798 #define Frac_mask1 0xfffff
801 #define Bndry_mask 0xfffff
802 #define Bndry_mask1 0xfffff
804 #define Sign_bit 0x80000000
810 #ifndef NO_IEEE_Scale
811 #define Avoid_Underflow
813 #undef Sudden_Underflow
819 #define Flt_Rounds FLT_ROUNDS
825 #ifdef Honor_FLT_ROUNDS
826 #define Rounding rounding
827 #undef Check_FLT_ROUNDS
828 #define Check_FLT_ROUNDS
830 #define Rounding Flt_Rounds
834 #undef Check_FLT_ROUNDS
835 #undef Honor_FLT_ROUNDS
837 #undef Sudden_Underflow
838 #define Sudden_Underflow
843 #define Exp_shift1 24
844 #define Exp_msk1 0x1000000
845 #define Exp_msk11 0x1000000
846 #define Exp_mask 0x7f000000
849 #define Exp_1 0x41000000
850 #define Exp_11 0x41000000
852 #define Frac_mask 0xffffff
853 #define Frac_mask1 0xffffff
856 #define Bndry_mask 0xefffff
857 #define Bndry_mask1 0xffffff
859 #define Sign_bit 0x80000000
861 #define Tiny0 0x100000
870 #define Exp_msk1 0x80
871 #define Exp_msk11 0x800000
872 #define Exp_mask 0x7f80
875 #define Exp_1 0x40800000
876 #define Exp_11 0x4080
878 #define Frac_mask 0x7fffff
879 #define Frac_mask1 0xffff007f
882 #define Bndry_mask 0xffff007f
883 #define Bndry_mask1 0xffff007f
885 #define Sign_bit 0x8000
899 #define rounded_product(a,b) ((a) = rnd_prod((a), (b)))
900 #define rounded_quotient(a,b) ((a) = rnd_quot((a), (b)))
901 extern double rnd_prod(
double,
double), rnd_quot(
double,
double);
903 #define rounded_product(a,b) ((a) *= (b))
904 #define rounded_quotient(a,b) ((a) /= (b))
907 #define Big0 (Frac_mask1 | Exp_msk1*(DBL_MAX_EXP+Bias-1))
908 #define Big1 0xffffffff
914 #define FFFFFFFF 0xffffffffUL
928 #define Llong long long
931 #define ULLong unsigned Llong
935 #define MULTIPLE_THREADS 1
937 #ifndef MULTIPLE_THREADS
938 #define ACQUIRE_DTOA_LOCK(n)
939 #define FREE_DTOA_LOCK(n)
941 #define ACQUIRE_DTOA_LOCK(n)
942 #define FREE_DTOA_LOCK(n)
962 #ifndef Omit_Private_Memory
967 if ((rv = freelist[k]) != 0) {
968 freelist[
k] = rv->
next;
972 #ifdef Omit_Private_Memory
975 len = (
sizeof(
Bigint) + (x-1)*
sizeof(ULong) +
sizeof(
double) - 1)
977 if (pmem_next - private_mem + len <=
PRIVATE_mem) {
997 v->
next = freelist[v->
k];
1003 #define Bcopy(x,y) memcpy((char *)&(x)->sign, (char *)&(y)->sign, \
1004 (y)->wds*sizeof(Long) + 2*sizeof(int))
1027 y = *x * (
ULLong)m + carry;
1033 y = (xi & 0xffff) * m + carry;
1034 z = (xi >> 16) * m + (y >> 16);
1036 *x++ = (z << 16) + (y & 0xffff);
1043 }
while (++i < wds);
1051 b->
x[wds++] = (ULong)carry;
1058 s2b(
const char *s,
int nd0,
int nd, ULong y9)
1065 for (k = 0, y = 1; x > y; y <<= 1, k++) ;
1072 b->
x[0] = y9 & 0xffff;
1073 b->
wds = (b->
x[1] = y9 >> 16) ? 2 : 1;
1080 b =
multadd(b, 10, *s++ -
'0');
1081 }
while (++i < nd0);
1087 b =
multadd(b, 10, *s++ -
'0');
1096 if (!(x & 0xffff0000)) {
1100 if (!(x & 0xff000000)) {
1104 if (!(x & 0xf0000000)) {
1108 if (!(x & 0xc0000000)) {
1112 if (!(x & 0x80000000)) {
1114 if (!(x & 0x40000000))
1124 register ULong
x = *y;
1137 if (!(x & 0xffff)) {
1179 ULong *
x, *xa, *xae, *xb, *xbe, *xc, *xc0;
1202 for (x = c->
x, xa = x + wc; x < xa; x++)
1210 for (; xb < xbe; xc0++) {
1211 if ((y = *xb++) != 0) {
1216 z = *x++ * (
ULLong)y + *xc + carry;
1225 for (; xb < xbe; xb++, xc0++) {
1226 if (y = *xb & 0xffff) {
1231 z = (*x & 0xffff) * y + (*xc & 0xffff) + carry;
1233 z2 = (*x++ >> 16) * y + (*xc >> 16) + carry;
1239 if (y = *xb >> 16) {
1245 z = (*x & 0xffff) * y + (*xc >> 16) + carry;
1248 z2 = (*x++ >> 16) * y + (*xc & 0xffff) + carry;
1255 for (; xb < xbe; xc0++) {
1261 z = *x++ * y + *xc + carry;
1270 for (xc0 = c->
x, xc = xc0 + wc; wc > 0 && !*--xc; --wc) ;
1282 static int p05[3] = { 5, 25, 125 };
1284 if ((i = k & 3) != 0)
1291 #ifdef MULTIPLE_THREADS
1294 p5 = p5s =
i2b(625);
1299 p5 = p5s =
i2b(625);
1311 if (!(p51 = p5->
next)) {
1312 #ifdef MULTIPLE_THREADS
1314 if (!(p51 = p5->
next)) {
1334 ULong *
x, *x1, *xe, z;
1342 n1 = n + b->
wds + 1;
1343 for (i = b->
maxwds; n1 > i; i <<= 1)
1347 for (i = 0; i < n; i++)
1356 *x1++ = *x << k | z;
1367 *x1++ = *x << k & 0xffff | z;
1386 ULong *xa, *xa0, *xb, *xb0;
1392 if (i > 1 && !a->
x[i-1])
1393 Bug(
"cmp called with a->x[a->wds-1] == 0");
1394 if (j > 1 && !b->
x[j-1])
1395 Bug(
"cmp called with b->x[b->wds-1] == 0");
1405 return *xa < *xb ? -1 : 1;
1417 ULong *xa, *xae, *xb, *xbe, *xc;
1454 y = (
ULLong)*xa++ - *xb++ - borrow;
1455 borrow = y >> 32 & (ULong)1;
1460 borrow = y >> 32 & (ULong)1;
1466 y = (*xa & 0xffff) - (*xb & 0xffff) - borrow;
1467 borrow = (y & 0x10000) >> 16;
1468 z = (*xa++ >> 16) - (*xb++ >> 16) - borrow;
1469 borrow = (z & 0x10000) >> 16;
1473 y = (*xa & 0xffff) - borrow;
1474 borrow = (y & 0x10000) >> 16;
1475 z = (*xa++ >> 16) - borrow;
1476 borrow = (z & 0x10000) >> 16;
1481 y = *xa++ - *xb++ - borrow;
1482 borrow = (y & 0x10000) >> 16;
1487 borrow = (y & 0x10000) >> 16;
1506 #ifndef Avoid_Underflow
1507 #ifndef Sudden_Underflow
1516 #ifndef Avoid_Underflow
1517 #ifndef Sudden_Underflow
1521 if (L < Exp_shift) {
1522 word0(a) = 0x80000 >> L;
1528 word1(a) = L >= 31 ? 1 : 1 << 31 - L;
1539 ULong *xa, *xa0, w, y, z;
1553 if (!y) Bug(
"zero y in b2d");
1560 w = xa > xa0 ? *--xa : 0;
1564 z = xa > xa0 ? *--xa : 0;
1566 d0 =
Exp_1 | y << k | z >> (32 -
k);
1567 y = xa > xa0 ? *--xa : 0;
1568 d1 = z << k | y >> (32 -
k);
1575 if (k <
Ebits + 16) {
1576 z = xa > xa0 ? *--xa : 0;
1578 w = xa > xa0 ? *--xa : 0;
1579 y = xa > xa0 ? *--xa : 0;
1583 z = xa > xa0 ? *--xa : 0;
1584 w = xa > xa0 ? *--xa : 0;
1586 d0 =
Exp_1 | y << k + 16 | z << k | w >> 16 -
k;
1587 y = xa > xa0 ? *--xa : 0;
1588 d1 = w << k + 16 | y <<
k;
1592 word0(d) = d0 >> 16 | d0 << 16;
1593 word1(d) = d1 >> 16 | d1 << 16;
1602 d2b(
double d_,
int *e,
int *bits)
1608 #ifndef Sudden_Underflow
1632 #ifdef Sudden_Underflow
1642 if ((y = d1) != 0) {
1644 x[0] = y | z << (32 -
k);
1649 #ifndef Sudden_Underflow
1652 b->
wds = (x[1] = z) ? 2 : 1;
1657 Bug(
"Zero passed to d2b");
1661 #ifndef Sudden_Underflow
1671 x[0] = y | z << 32 - k & 0xffff;
1672 x[1] = z >> k - 16 & 0xffff;
1678 x[1] = y >> 16 | z << 16 - k & 0xffff;
1679 x[2] = z >> k & 0xffff;
1694 Bug(
"Zero passed to d2b");
1712 #ifndef Sudden_Underflow
1716 *e = (de -
Bias - (
P-1) << 2) +
k;
1719 *e = de -
Bias - (
P-1) + k;
1722 #ifndef Sudden_Underflow
1725 *e = de -
Bias - (
P-1) + 1 + k;
1727 *bits = 32*i -
hi0bits(x[i-1]);
1729 *bits = (i+2)*16 -
hi0bits(x[i]);
1747 k = ka - kb + 32*(a->
wds - b->
wds);
1749 k = ka - kb + 16*(a->
wds - b->
wds);
1776 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9,
1777 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19,
1787 static const double tinytens[] = { 1e-16, 1e-32, 1e-64, 1e-128,
1788 #ifdef Avoid_Underflow
1789 9007199254740992.*9007199254740992.e-256
1797 #define Scale_Bit 0x10
1801 bigtens[] = { 1e16, 1e32, 1e64 };
1802 static const double tinytens[] = { 1e-16, 1e-32, 1e-64 };
1806 static const double tinytens[] = { 1e-16, 1e-32 };
1818 #define NAN_WORD0 0x7ff80000
1826 match(
const char **sp,
char *t)
1829 const char *s = *sp;
1832 if ((c = *++s) >=
'A' && c <=
'Z')
1843 hexnan(
double *rvp,
const char **sp)
1847 int havedig, udx0, xshift;
1850 havedig = xshift = 0;
1853 while (c = *(
const unsigned char*)++s) {
1854 if (c >=
'0' && c <=
'9')
1856 else if (c >=
'a' && c <=
'f')
1858 else if (c >=
'A' && c <=
'F')
1860 else if (c <=
' ') {
1861 if (udx0 && havedig) {
1867 else if ( c ==
')' && havedig) {
1880 x[0] = (x[0] << 4) | (x[1] >> 28);
1881 x[1] = (x[1] << 4) | c;
1883 if ((x[0] &= 0xfffff) || x[1]) {
1894 #ifdef Avoid_Underflow
1897 int bb2, bb5, bbe, bd2, bd5, bbbits, bs2, c, dsign,
1898 e, e1, esign,
i, j,
k, nd, nd0, nf, nz, nz0,
sign;
1899 const char *s, *s0, *s1;
1901 double_u aadj1, rv, rv0;
1904 Bigint *bb, *bb1, *bd, *bd0, *bs, *delta;
1906 int inexact, oldinexact;
1908 #ifdef Honor_FLT_ROUNDS
1916 sign = nz0 = nz = 0;
1941 if (s[1] ==
'x' || s[1] ==
'X') {
1942 static const char hexdigit[] =
"0123456789abcdef0123456789ABCDEF";
1948 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
1949 while (*s ==
'0') s++;
1952 adj += aadj * ((s1 - hexdigit) & 15);
1955 }
while (*++s && (s1 =
strchr(hexdigit, *s)));
1960 if (!*++s || !(s1 =
strchr(hexdigit, *s)))
goto ret0;
1967 for (; *s && (s1 =
strchr(hexdigit, *s)); ++s) {
1968 adj += aadj * ((s1 - hexdigit) & 15);
1969 if ((aadj /= 16) == 0.0) {
1970 while (
strchr(hexdigit, *++s));
1979 if (*s ==
'P' || *s ==
'p') {
1980 dsign = 0x2C - *++s;
1981 if (abs(dsign) == 1) s++;
1986 if (c <
'0' ||
'9' < c)
goto ret0;
1993 if (nd + dsign * nd0 > 2095) {
1994 while (
'0' <= c && c <=
'9') c = *++s;
1997 }
while (
'0' <= c && c <=
'9');
2001 if (dsign)
goto ret0;
2003 dval(rv) = ldexp(adj, nd0);
2007 while (*++s ==
'0') ;
2013 for (nd = nf = 0; (c = *s) >=
'0' && c <=
'9'; nd++, s++)
2020 s1 = localeconv()->decimal_point;
2043 for (; c ==
'0'; c = *++s)
2045 if (c >
'0' && c <=
'9') {
2053 for (; c >=
'0' && c <=
'9'; c = *++s) {
2058 for (i = 1; i < nz; i++)
2073 if (c ==
'e' || c ==
'E') {
2074 if (!nd && !nz && !nz0) {
2085 if (c >=
'0' && c <=
'9') {
2088 if (c >
'0' && c <=
'9') {
2091 while ((c = *++s) >=
'0' && c <=
'9')
2093 if (s - s1 > 8 || L > 19999)
2116 if (
match(&s,
"nf")) {
2118 if (!
match(&s,
"inity"))
2120 word0(rv) = 0x7ff00000;
2127 if (
match(&s,
"an")) {
2128 word0(rv) = NAN_WORD0;
2129 word1(rv) = NAN_WORD1;
2158 oldinexact = get_inexact();
2162 bd0 = bb = bd = bs = delta = 0;
2164 #ifndef RND_PRODQUOT
2165 #ifndef Honor_FLT_ROUNDS
2175 goto vax_ovfl_check;
2177 #ifdef Honor_FLT_ROUNDS
2193 #ifdef Honor_FLT_ROUNDS
2219 #ifndef Inaccurate_Divide
2221 #ifdef Honor_FLT_ROUNDS
2239 oldinexact = get_inexact();
2241 #ifdef Avoid_Underflow
2244 #ifdef Honor_FLT_ROUNDS
2247 rounding = rounding == 2 ? 0 : 2;
2258 if ((i = e1 & 15) != 0)
2268 #ifdef Honor_FLT_ROUNDS
2297 for (j = 0; e1 > 1; j++, e1 >>= 1)
2318 if ((i = e1 & 15) != 0)
2323 #ifdef Avoid_Underflow
2326 for (j = 0; e1 > 0; j++, e1 >>= 1)
2328 dval(rv) *= tinytens[j];
2337 word0(rv) &= 0xffffffff << (j-32);
2340 word1(rv) &= 0xffffffff << j;
2343 for (j = 0; e1 > 1; j++, e1 >>= 1)
2345 dval(rv) *= tinytens[j];
2348 dval(rv) *= tinytens[j];
2351 dval(rv) *= tinytens[j];
2363 #ifndef Avoid_Underflow
2378 bd0 =
s2b(s0, nd0, nd, y);
2383 bb =
d2b(
dval(rv), &bbe, &bbbits);
2399 #ifdef Honor_FLT_ROUNDS
2403 #ifdef Avoid_Underflow
2411 #ifdef Sudden_Underflow
2413 j = 1 + 4*
P - 3 - bbbits + ((bbe + bbbits - 1) & 3);
2428 #ifdef Avoid_Underflow
2431 i = bb2 < bd2 ? bb2 : bd2;
2453 delta =
diff(bb, bd);
2454 dsign = delta->
sign;
2457 #ifdef Honor_FLT_ROUNDS
2458 if (rounding != 1) {
2461 if (!delta->
x[0] && delta->
wds <= 1) {
2479 #ifdef Avoid_Underflow
2486 if (
cmp(delta, bs) <= 0)
2491 #ifdef Avoid_Underflow
2494 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2496 #ifdef Sudden_Underflow
2497 if ((
word0(rv) & Exp_mask) <=
2510 adj =
ratio(delta, bs);
2513 if (adj <= 0x7ffffffe) {
2517 if (!((rounding>>1) ^ dsign))
2522 #ifdef Avoid_Underflow
2524 word0(adj) += (2*
P+1)*Exp_msk1 - y;
2526 #ifdef Sudden_Underflow
2562 if (!delta->
x[0] && delta->
wds <= 1)
2567 if (!delta->
x[0] && delta->
wds <= 1) {
2575 if (
cmp(delta, bs) > 0)
2586 ? (0xffffffff & (0xffffffff << (2*
P+1-(y>>
Exp_shift)))) :
2597 #ifdef Avoid_Underflow
2606 #ifdef Sudden_Underflow
2611 #ifdef Avoid_Underflow
2620 #ifdef Avoid_Underflow
2623 if (L <= (2*
P+1)*Exp_msk1) {
2624 if (L > (
P+2)*Exp_msk1)
2636 word1(rv) = 0xffffffff;
2643 #ifndef ROUND_BIASED
2649 #ifndef ROUND_BIASED
2652 #ifndef Sudden_Underflow
2657 #ifdef Avoid_Underflow
2663 if ((aadj =
ratio(delta, bs)) <= 2.) {
2665 aadj =
dval(aadj1) = 1.;
2667 #ifndef Sudden_Underflow
2682 dval(aadj1) = -aadj;
2687 dval(aadj1) = dsign ? aadj : -aadj;
2688 #ifdef Check_FLT_ROUNDS
2723 #ifdef Avoid_Underflow
2725 if (aadj <= 0x7fffffff) {
2726 if ((z = (
int)aadj) <= 0)
2729 dval(aadj1) = dsign ? aadj : -aadj;
2731 word0(aadj1) += (2*
P+1)*Exp_msk1 - y;
2736 #ifdef Sudden_Underflow
2743 if ((
word0(rv) & Exp_mask) <
P*Exp_msk1)
2745 if ((
word0(rv) & Exp_mask) <=
P*Exp_msk1)
2769 if (y <= (
P-1)*Exp_msk1 && aadj > 1.) {
2770 dval(aadj1) = (double)(
int)(aadj + 0.5);
2781 #ifdef Avoid_Underflow
2790 if (aadj < .4999999 || aadj > .5000001)
2811 else if (!oldinexact)
2814 #ifdef Avoid_Underflow
2842 return sign ? -
dval(rv) :
dval(rv);
2849 ULong *bx, *bxe, q, *sx, *sxe;
2851 ULLong borrow, carry, y, ys;
2853 ULong borrow, carry, y, ys;
2862 Bug(
"oversize b in quorem");
2870 q = *bxe / (*sxe + 1);
2873 Bug(
"oversized quotient in quorem");
2880 ys = *sx++ * (
ULLong)q + carry;
2882 y = *bx - (ys &
FFFFFFFF) - borrow;
2883 borrow = y >> 32 & (ULong)1;
2888 ys = (si & 0xffff) * q + carry;
2889 zs = (si >> 16) * q + (ys >> 16);
2891 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2892 borrow = (y & 0x10000) >> 16;
2893 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2894 borrow = (z & 0x10000) >> 16;
2897 ys = *sx++ * q + carry;
2899 y = *bx - (ys & 0xffff) - borrow;
2900 borrow = (y & 0x10000) >> 16;
2904 }
while (sx <= sxe);
2907 while (--bxe > bx && !*bxe)
2912 if (
cmp(b, S) >= 0) {
2922 y = *bx - (ys &
FFFFFFFF) - borrow;
2923 borrow = y >> 32 & (ULong)1;
2928 ys = (si & 0xffff) + carry;
2929 zs = (si >> 16) + (ys >> 16);
2931 y = (*bx & 0xffff) - (ys & 0xffff) - borrow;
2932 borrow = (y & 0x10000) >> 16;
2933 z = (*bx >> 16) - (zs & 0xffff) - borrow;
2934 borrow = (z & 0x10000) >> 16;
2939 y = *bx - (ys & 0xffff) - borrow;
2940 borrow = (y & 0x10000) >> 16;
2944 }
while (sx <= sxe);
2948 while (--bxe > bx && !*bxe)
2956 #ifndef MULTIPLE_THREADS
2957 static char *dtoa_result;
2960 #ifndef MULTIPLE_THREADS
2964 return dtoa_result =
xmalloc(i);
2967 #define rv_alloc(i) xmalloc(i)
2976 while ((*t = *s++) != 0) t++;
2982 #define rv_strdup(s, rve) nrv_alloc((s), (rve), strlen(s)+1)
2984 #ifndef MULTIPLE_THREADS
3073 int bbits, b2, b5, be, dig,
i, ieps, ilim, ilim0, ilim1,
3074 j, j1,
k, k0, k_check, leftright, m2, m5, s2, s5,
3075 spec_case, try_quick;
3077 #ifndef Sudden_Underflow
3081 Bigint *b, *b1, *delta, *mlo = 0, *mhi = 0, *
S;
3083 double_u d, d2, eps;
3085 #ifdef Honor_FLT_ROUNDS
3089 int inexact, oldinexact;
3094 #ifndef MULTIPLE_THREADS
3096 freedtoa(dtoa_result);
3104 word0(d) &= ~Sign_bit;
3109 #if defined(IEEE_Arith) + defined(VAX)
3113 if (
word0(d) == 0x8000)
3134 try_quick = oldinexact = get_inexact();
3137 #ifdef Honor_FLT_ROUNDS
3140 rounding = rounding == 2 ? 0 : 2;
3147 b =
d2b(
dval(d), &be, &bbits);
3148 #ifdef Sudden_Underflow
3188 #ifndef Sudden_Underflow
3194 i = bbits + be + (
Bias + (
P-1) - 1);
3195 x = i > 32 ?
word0(d) << (64 -
i) |
word1(d) >> (i - 32)
3199 i -= (
Bias + (
P-1) - 1) + 1;
3203 ds = (
dval(d2)-1.5)*0.289529654602168 + 0.1760912590558 + i*0.301029995663981;
3205 if (ds < 0. && ds != k)
3232 if (mode < 0 || mode > 9)
3236 #ifdef Check_FLT_ROUNDS
3261 ilim = ilim1 = i = ndigits;
3267 i = ndigits + k + 1;
3275 #ifdef Honor_FLT_ROUNDS
3276 if (mode > 1 && rounding != 1)
3280 if (ilim >= 0 && ilim <=
Quick_max && try_quick) {
3298 for (; j; j >>= 1, i++)
3305 else if ((j1 = -k) != 0) {
3307 for (j = j1 >> 4; j; j >>= 1, i++)
3313 if (k_check &&
dval(d) < 1. && ilim > 0) {
3332 #ifndef No_leftright
3341 *s++ =
'0' + (int)L;
3356 for (i = 1;; i++,
dval(d) *= 10.) {
3357 L = (Long)(
dval(d));
3358 if (!(
dval(d) -= L))
3360 *s++ =
'0' + (int)L;
3364 else if (
dval(d) < 0.5 -
dval(eps)) {
3365 while (*--s ==
'0') ;
3372 #ifndef No_leftright
3384 if (be >= 0 && k <=
Int_max) {
3387 if (ndigits < 0 && ilim <= 0) {
3389 if (ilim < 0 ||
dval(d) <= 5*ds)
3393 for (i = 1;; i++,
dval(d) *= 10.) {
3394 L = (Long)(
dval(d) / ds);
3396 #ifdef Check_FLT_ROUNDS
3403 *s++ =
'0' + (int)L;
3411 #ifdef Honor_FLT_ROUNDS
3415 case 2:
goto bump_up;
3419 if (
dval(d) > ds || (
dval(d) == ds && (L & 1))) {
3439 #ifndef Sudden_Underflow
3440 denorm ? be + (
Bias + (
P-1) - 1 + 1) :
3443 1 + 4*
P - 3 - bbits + ((bbits + be - 1) & 3);
3451 if (m2 > 0 && s2 > 0) {
3452 i = m2 < s2 ? m2 : s2;
3465 if ((j = b5 - m5) != 0)
3478 if ((mode < 2 || leftright)
3479 #ifdef Honor_FLT_ROUNDS
3484 #ifndef Sudden_Underflow
3503 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0x1f) != 0)
3506 if ((i = ((s5 ? 32 -
hi0bits(
S->x[
S->wds-1]) : 1) + s2) & 0xf) != 0)
3534 if (ilim <= 0 && (mode == 3 || mode == 5)) {
3567 delta =
diff(
S, mhi);
3568 j1 = delta->
sign ? 1 :
cmp(b, delta);
3570 #ifndef ROUND_BIASED
3571 if (j1 == 0 && mode != 1 && !(
word1(d) & 1)
3572 #ifdef Honor_FLT_ROUNDS
3581 else if (!b->
x[0] && b->
wds <= 1)
3588 if (j < 0 || (j == 0 && mode != 1
3589 #ifndef ROUND_BIASED
3593 if (!b->
x[0] && b->
wds <= 1) {
3599 #ifdef Honor_FLT_ROUNDS
3602 case 0:
goto accept_dig;
3603 case 2:
goto keep_dig;
3609 if ((j1 > 0 || (j1 == 0 && (dig & 1))) && dig++ ==
'9')
3617 #ifdef Honor_FLT_ROUNDS
3629 #ifdef Honor_FLT_ROUNDS
3637 mlo = mhi =
multadd(mhi, 10, 0);
3646 *s++ = dig =
quorem(b,
S) +
'0';
3647 if (!b->
x[0] && b->
wds <= 1) {
3660 #ifdef Honor_FLT_ROUNDS
3662 case 0:
goto trimzeros;
3663 case 2:
goto roundoff;
3668 if (j > 0 || (j == 0 && (dig & 1))) {
3679 while (*--s ==
'0') ;
3685 if (mlo && mlo != mhi)
3698 else if (!oldinexact)
3716 for (; *str; str = end) {
3717 while (
ISSPACE(*str) || *str ==
',') str++;
3720 while (*end && !
ISSPACE(*end) && *end !=
',') end++;
3721 len = (int)(end - str);
3752 #define DBL_MANH_SIZE 20
3753 #define DBL_MANL_SIZE 32
3754 #define DBL_ADJ (DBL_MAX_EXP - 2)
3755 #define SIGFIGS ((DBL_MANT_DIG + 3) / 4 + 1)
3756 #define dexp_get(u) ((int)(word0(u) >> Exp_shift) & ~Exp_msk1)
3757 #define dexp_set(u,v) (word0(u) = (((int)(word0(u)) & ~Exp_mask) | ((v) << Exp_shift)))
3758 #define dmanh_get(u) ((uint32_t)(word0(u) & Frac_mask))
3759 #define dmanl_get(u) ((uint32_t)word1(u))
3799 word0(u) &= ~Sign_bit;
3808 else if (
isnan(d)) {
3812 else if (d == 0.0) {
3820 u.
d *= 5.363123171977039e+154 ;
3831 bufsize = (ndigits > 0) ? ndigits :
SIGFIGS;
3835 if (
SIGFIGS > ndigits && ndigits > 0) {
3850 for (s = s0 + 1; s < s0 + bufsize; s++) {
3858 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)