Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(617)

Side by Side Diff: third_party/fdlibm/fdlibm.cc

Issue 448643002: Reland "Implement trigonometric functions using a fdlibm port." (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: fix windows build and gc mole Created 6 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
« no previous file with comments | « third_party/fdlibm/fdlibm.h ('k') | third_party/fdlibm/fdlibm.js » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
(Empty)
1 // The following is adapted from fdlibm (http://www.netlib.org/fdlibm).
2 //
3 // ====================================================
4 // Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
5 //
6 // Developed at SunSoft, a Sun Microsystems, Inc. business.
7 // Permission to use, copy, modify, and distribute this
8 // software is freely granted, provided that this notice
9 // is preserved.
10 // ====================================================
11 //
12 // The original source code covered by the above license above has been
13 // modified significantly by Google Inc.
14 // Copyright 2014 the V8 project authors. All rights reserved.
15
16 #include "src/v8.h"
17
18 #include "src/double.h"
19 #include "third_party/fdlibm/fdlibm.h"
20
21
22 namespace v8 {
23 namespace internal {
24
25 #ifdef _MSC_VER
26 inline double scalbn(double x, int y) { return _scalb(x, y); }
27 #endif // _MSC_VER
28
29 const double TrigonometricConstants::constants[] = {
30 6.36619772367581382433e-01, // invpio2 0
31 1.57079632673412561417e+00, // pio2_1 1
32 6.07710050650619224932e-11, // pio2_1t 2
33 6.07710050630396597660e-11, // pio2_2 3
34 2.02226624879595063154e-21, // pio2_2t 4
35 2.02226624871116645580e-21, // pio2_3 5
36 8.47842766036889956997e-32, // pio2_3t 6
37 -1.66666666666666324348e-01, // S1 7
38 8.33333333332248946124e-03, // 8
39 -1.98412698298579493134e-04, // 9
40 2.75573137070700676789e-06, // 10
41 -2.50507602534068634195e-08, // 11
42 1.58969099521155010221e-10, // S6 12
43 4.16666666666666019037e-02, // C1 13
44 -1.38888888888741095749e-03, // 14
45 2.48015872894767294178e-05, // 15
46 -2.75573143513906633035e-07, // 16
47 2.08757232129817482790e-09, // 17
48 -1.13596475577881948265e-11, // C6 18
49 3.33333333333334091986e-01, // T0 19
50 1.33333333333201242699e-01, // 20
51 5.39682539762260521377e-02, // 21
52 2.18694882948595424599e-02, // 22
53 8.86323982359930005737e-03, // 23
54 3.59207910759131235356e-03, // 24
55 1.45620945432529025516e-03, // 25
56 5.88041240820264096874e-04, // 26
57 2.46463134818469906812e-04, // 27
58 7.81794442939557092300e-05, // 28
59 7.14072491382608190305e-05, // 29
60 -1.85586374855275456654e-05, // 30
61 2.59073051863633712884e-05, // T12 31
62 7.85398163397448278999e-01, // pio4 32
63 3.06161699786838301793e-17, // pio4lo 33
64 };
65
66
67 // Table of constants for 2/pi, 396 Hex digits (476 decimal) of 2/pi
68 static const int two_over_pi[] = {
69 0xA2F983, 0x6E4E44, 0x1529FC, 0x2757D1, 0xF534DD, 0xC0DB62, 0x95993C,
70 0x439041, 0xFE5163, 0xABDEBB, 0xC561B7, 0x246E3A, 0x424DD2, 0xE00649,
71 0x2EEA09, 0xD1921C, 0xFE1DEB, 0x1CB129, 0xA73EE8, 0x8235F5, 0x2EBB44,
72 0x84E99C, 0x7026B4, 0x5F7E41, 0x3991D6, 0x398353, 0x39F49C, 0x845F8B,
73 0xBDF928, 0x3B1FF8, 0x97FFDE, 0x05980F, 0xEF2F11, 0x8B5A0A, 0x6D1F6D,
74 0x367ECF, 0x27CB09, 0xB74F46, 0x3F669E, 0x5FEA2D, 0x7527BA, 0xC7EBE5,
75 0xF17B3D, 0x0739F7, 0x8A5292, 0xEA6BFB, 0x5FB11F, 0x8D5D08, 0x560330,
76 0x46FC7B, 0x6BABF0, 0xCFBC20, 0x9AF436, 0x1DA9E3, 0x91615E, 0xE61B08,
77 0x659985, 0x5F14A0, 0x68408D, 0xFFD880, 0x4D7327, 0x310606, 0x1556CA,
78 0x73A8C9, 0x60E27B, 0xC08C6B};
79
80 static const double zero = 0.0;
81 static const double two24 = 1.6777216e+07;
82 static const double one = 1.0;
83 static const double twon24 = 5.9604644775390625e-08;
84
85 static const double PIo2[] = {
86 1.57079625129699707031e+00, // 0x3FF921FB, 0x40000000
87 7.54978941586159635335e-08, // 0x3E74442D, 0x00000000
88 5.39030252995776476554e-15, // 0x3CF84698, 0x80000000
89 3.28200341580791294123e-22, // 0x3B78CC51, 0x60000000
90 1.27065575308067607349e-29, // 0x39F01B83, 0x80000000
91 1.22933308981111328932e-36, // 0x387A2520, 0x40000000
92 2.73370053816464559624e-44, // 0x36E38222, 0x80000000
93 2.16741683877804819444e-51 // 0x3569F31D, 0x00000000
94 };
95
96
97 int __kernel_rem_pio2(double* x, double* y, int e0, int nx) {
98 static const int32_t jk = 3;
99 double fw;
100 int32_t jx = nx - 1;
101 int32_t jv = (e0 - 3) / 24;
102 if (jv < 0) jv = 0;
103 int32_t q0 = e0 - 24 * (jv + 1);
104 int32_t m = jx + jk;
105
106 double f[10];
107 for (int i = 0, j = jv - jx; i <= m; i++, j++) {
108 f[i] = (j < 0) ? zero : static_cast<double>(two_over_pi[j]);
109 }
110
111 double q[10];
112 for (int i = 0; i <= jk; i++) {
113 fw = 0.0;
114 for (int j = 0; j <= jx; j++) fw += x[j] * f[jx + i - j];
115 q[i] = fw;
116 }
117
118 int32_t jz = jk;
119
120 recompute:
121
122 int32_t iq[10];
123 double z = q[jz];
124 for (int i = 0, j = jz; j > 0; i++, j--) {
125 fw = static_cast<double>(static_cast<int32_t>(twon24 * z));
126 iq[i] = static_cast<int32_t>(z - two24 * fw);
127 z = q[j - 1] + fw;
128 }
129
130 z = scalbn(z, q0);
131 z -= 8.0 * std::floor(z * 0.125);
132 int32_t n = static_cast<int32_t>(z);
133 z -= static_cast<double>(n);
134 int32_t ih = 0;
135 if (q0 > 0) {
136 int32_t i = (iq[jz - 1] >> (24 - q0));
137 n += i;
138 iq[jz - 1] -= i << (24 - q0);
139 ih = iq[jz - 1] >> (23 - q0);
140 } else if (q0 == 0) {
141 ih = iq[jz - 1] >> 23;
142 } else if (z >= 0.5) {
143 ih = 2;
144 }
145
146 if (ih > 0) {
147 n += 1;
148 int32_t carry = 0;
149 for (int i = 0; i < jz; i++) {
150 int32_t j = iq[i];
151 if (carry == 0) {
152 if (j != 0) {
153 carry = 1;
154 iq[i] = 0x1000000 - j;
155 }
156 } else {
157 iq[i] = 0xffffff - j;
158 }
159 }
160 if (q0 == 1) {
161 iq[jz - 1] &= 0x7fffff;
162 } else if (q0 == 2) {
163 iq[jz - 1] &= 0x3fffff;
164 }
165 if (ih == 2) {
166 z = one - z;
167 if (carry != 0) z -= scalbn(one, q0);
168 }
169 }
170
171 if (z == zero) {
172 int32_t j = 0;
173 for (int i = jz - 1; i >= jk; i--) j |= iq[i];
174 if (j == 0) {
175 int32_t k = 1;
176 while (iq[jk - k] == 0) k++;
177 for (int i = jz + 1; i <= jz + k; i++) {
178 f[jx + i] = static_cast<double>(two_over_pi[jv + i]);
179 for (j = 0, fw = 0.0; j <= jx; j++) fw += x[j] * f[jx + i - j];
180 q[i] = fw;
181 }
182 jz += k;
183 goto recompute;
184 }
185 }
186
187 if (z == 0.0) {
188 jz -= 1;
189 q0 -= 24;
190 while (iq[jz] == 0) {
191 jz--;
192 q0 -= 24;
193 }
194 } else {
195 z = scalbn(z, -q0);
196 if (z >= two24) {
197 fw = static_cast<double>(static_cast<int32_t>(twon24 * z));
198 iq[jz] = static_cast<int32_t>(z - two24 * fw);
199 jz += 1;
200 q0 += 24;
201 iq[jz] = static_cast<int32_t>(fw);
202 } else {
203 iq[jz] = static_cast<int32_t>(z);
204 }
205 }
206
207 fw = scalbn(one, q0);
208 for (int i = jz; i >= 0; i--) {
209 q[i] = fw * static_cast<double>(iq[i]);
210 fw *= twon24;
211 }
212
213 double fq[10];
214 for (int i = jz; i >= 0; i--) {
215 fw = 0.0;
216 for (int k = 0; k <= jk && k <= jz - i; k++) fw += PIo2[k] * q[i + k];
217 fq[jz - i] = fw;
218 }
219
220 fw = 0.0;
221 for (int i = jz; i >= 0; i--) fw += fq[i];
222 y[0] = (ih == 0) ? fw : -fw;
223 fw = fq[0] - fw;
224 for (int i = 1; i <= jz; i++) fw += fq[i];
225 y[1] = (ih == 0) ? fw : -fw;
226 return n & 7;
227 }
228
229
230 int rempio2(double x, double* y) {
231 int32_t hx = static_cast<int32_t>(double_to_uint64(x) >> 32);
232 int32_t ix = hx & 0x7fffffff;
233
234 if (ix >= 0x7ff00000) {
235 *y = base::OS::nan_value();
236 return 0;
237 }
238
239 int32_t e0 = (ix >> 20) - 1046;
240 uint64_t zi = double_to_uint64(x) & 0xFFFFFFFFu;
241 zi |= static_cast<uint64_t>(ix - (e0 << 20)) << 32;
242 double z = uint64_to_double(zi);
243
244 double tx[3];
245 for (int i = 0; i < 2; i++) {
246 tx[i] = static_cast<double>(static_cast<int32_t>(z));
247 z = (z - tx[i]) * two24;
248 }
249 tx[2] = z;
250
251 int nx = 3;
252 while (tx[nx - 1] == zero) nx--;
253 int n = __kernel_rem_pio2(tx, y, e0, nx);
254 if (hx < 0) {
255 y[0] = -y[0];
256 y[1] = -y[1];
257 return -n;
258 }
259 return n;
260 }
261 }
262 } // namespace v8::internal
OLDNEW
« no previous file with comments | « third_party/fdlibm/fdlibm.h ('k') | third_party/fdlibm/fdlibm.js » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698