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

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

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