1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
#include "libm.h" // for ldshape, ldshape::(anonymous)
#include <float.h> // for LDBL_MANT_DIG, LDBL_MAX_EXP
#include <math.h> // for remquol, isnan
#include <stdint.h> // for uint64_t, uint32_t
#if LDBL_MANT_DIG == 53 && LDBL_MAX_EXP == 1024
long double remquol(long double x, long double y, int *quo)
{
return remquo(x, y, quo);
}
#elif (LDBL_MANT_DIG == 64 || LDBL_MANT_DIG == 113) && LDBL_MAX_EXP == 16384
long double remquol(long double x, long double y, int *quo)
{
union ldshape ux = { x }, uy = { y };
int ex = ux.i.se & 0x7fff;
int ey = uy.i.se & 0x7fff;
int sx = ux.i.se >> 15;
int sy = uy.i.se >> 15;
uint32_t q;
*quo = 0;
if (y == 0 || isnan(y) || ex == 0x7fff)
return (x * y) / (x * y);
if (x == 0)
return x;
/* normalize x and y */
if (!ex) {
ux.i.se = ex;
ux.f *= 0x1p120f;
ex = ux.i.se - 120;
}
if (!ey) {
uy.i.se = ey;
uy.f *= 0x1p120f;
ey = uy.i.se - 120;
}
q = 0;
if (ex >= ey) {
/* x mod y */
#if LDBL_MANT_DIG == 64
uint64_t i, mx, my;
mx = ux.i.m;
my = uy.i.m;
for (; ex > ey; ex--) {
i = mx - my;
if (mx >= my) {
mx = 2 * i;
q++;
q <<= 1;
} else if (2 * mx < mx) {
mx = 2 * mx - my;
q <<= 1;
q++;
} else {
mx = 2 * mx;
q <<= 1;
}
}
i = mx - my;
if (mx >= my) {
mx = i;
q++;
}
if (mx == 0)
ex = -120;
else
for (; mx >> 63 == 0; mx *= 2, ex--)
;
ux.i.m = mx;
#elif LDBL_MANT_DIG == 113
uint64_t hi, lo, xhi, xlo, yhi, ylo;
xhi = (ux.i2.hi & -1ULL >> 16) | 1ULL << 48;
yhi = (uy.i2.hi & -1ULL >> 16) | 1ULL << 48;
xlo = ux.i2.lo;
ylo = ux.i2.lo;
for (; ex > ey; ex--) {
hi = xhi - yhi;
lo = xlo - ylo;
if (xlo < ylo)
hi -= 1;
if (hi >> 63 == 0) {
xhi = 2 * hi + (lo >> 63);
xlo = 2 * lo;
q++;
} else {
xhi = 2 * xhi + (xlo >> 63);
xlo = 2 * xlo;
}
q <<= 1;
}
hi = xhi - yhi;
lo = xlo - ylo;
if (xlo < ylo)
hi -= 1;
if (hi >> 63 == 0) {
xhi = hi;
xlo = lo;
q++;
}
if ((xhi | xlo) == 0)
ex = -120;
else
for (; xhi >> 48 == 0; xhi = 2 * xhi + (xlo >> 63), xlo = 2 * xlo, ex--)
;
ux.i2.hi = xhi;
ux.i2.lo = xlo;
#endif
}
/* scale result and decide between |x| and |x|-|y| */
if (ex <= 0) {
ux.i.se = ex + 120;
ux.f *= 0x1p-120f;
} else
ux.i.se = ex;
x = ux.f;
if (sy)
y = -y;
if (ex == ey || (ex + 1 == ey && (2 * x > y || (2 * x == y && q % 2)))) {
x -= y;
q++;
}
q &= 0x7fffffff;
*quo = sx ^ sy ? -(int)q : (int)q;
return sx ? -x : x;
}
#endif
|
