OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Test Math.sin and Math.cos. | 28 // Test Math.sin and Math.cos. |
29 | 29 |
| 30 // Flags: --allow-natives-syntax |
| 31 |
30 function sinTest() { | 32 function sinTest() { |
31 assertEquals(0, Math.sin(0)); | 33 assertEquals(0, Math.sin(0)); |
32 assertEquals(1, Math.sin(Math.PI / 2)); | 34 assertEquals(1, Math.sin(Math.PI / 2)); |
33 } | 35 } |
34 | 36 |
35 function cosTest() { | 37 function cosTest() { |
36 assertEquals(1, Math.cos(0)); | 38 assertEquals(1, Math.cos(0)); |
37 assertEquals(-1, Math.cos(Math.PI)); | 39 assertEquals(-1, Math.cos(Math.PI)); |
38 } | 40 } |
39 | 41 |
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
90 } | 92 } |
91 return precision_sum(terms); | 93 return precision_sum(terms); |
92 } | 94 } |
93 | 95 |
94 function abs_error(fun, ref, x) { | 96 function abs_error(fun, ref, x) { |
95 return Math.abs(ref(x) - fun(x)); | 97 return Math.abs(ref(x) - fun(x)); |
96 } | 98 } |
97 | 99 |
98 var test_inputs = []; | 100 var test_inputs = []; |
99 for (var i = -10000; i < 10000; i += 177) test_inputs.push(i/1257); | 101 for (var i = -10000; i < 10000; i += 177) test_inputs.push(i/1257); |
100 var epsilon = 0.000001; | 102 var epsilon = 0.0000001; |
101 | 103 |
102 test_inputs.push(0); | 104 test_inputs.push(0); |
103 test_inputs.push(0 + epsilon); | 105 test_inputs.push(0 + epsilon); |
104 test_inputs.push(0 - epsilon); | 106 test_inputs.push(0 - epsilon); |
105 test_inputs.push(Math.PI/2); | 107 test_inputs.push(Math.PI/2); |
106 test_inputs.push(Math.PI/2 + epsilon); | 108 test_inputs.push(Math.PI/2 + epsilon); |
107 test_inputs.push(Math.PI/2 - epsilon); | 109 test_inputs.push(Math.PI/2 - epsilon); |
108 test_inputs.push(Math.PI); | 110 test_inputs.push(Math.PI); |
109 test_inputs.push(Math.PI + epsilon); | 111 test_inputs.push(Math.PI + epsilon); |
110 test_inputs.push(Math.PI - epsilon); | 112 test_inputs.push(Math.PI - epsilon); |
111 test_inputs.push(- 2*Math.PI); | 113 test_inputs.push(- 2*Math.PI); |
112 test_inputs.push(- 2*Math.PI + epsilon); | 114 test_inputs.push(- 2*Math.PI + epsilon); |
113 test_inputs.push(- 2*Math.PI - epsilon); | 115 test_inputs.push(- 2*Math.PI - epsilon); |
114 | 116 |
115 var squares = []; | 117 var squares = []; |
116 for (var i = 0; i < test_inputs.length; i++) { | 118 for (var i = 0; i < test_inputs.length; i++) { |
117 var x = test_inputs[i]; | 119 var x = test_inputs[i]; |
118 var err_sin = abs_error(Math.sin, sin, x); | 120 var err_sin = abs_error(Math.sin, sin, x); |
119 var err_cos = abs_error(Math.cos, cos, x) | 121 var err_cos = abs_error(Math.cos, cos, x) |
120 assertTrue(err_sin < 1E-13); | 122 assertEqualsDelta(0, err_sin, 1E-13); |
121 assertTrue(err_cos < 1E-13); | 123 assertEqualsDelta(0, err_cos, 1E-13); |
122 squares.push(err_sin*err_sin + err_cos*err_cos); | 124 squares.push(err_sin*err_sin + err_cos*err_cos); |
123 } | 125 } |
124 | 126 |
125 // Sum squares up by adding them pairwise, to avoid losing precision. | 127 // Sum squares up by adding them pairwise, to avoid losing precision. |
126 while (squares.length > 1) { | 128 while (squares.length > 1) { |
127 var reduced = []; | 129 var reduced = []; |
128 if (squares.length % 2 == 1) reduced.push(squares.pop()); | 130 if (squares.length % 2 == 1) reduced.push(squares.pop()); |
129 // Remaining number of elements is even. | 131 // Remaining number of elements is even. |
130 while(squares.length > 1) reduced.push(squares.pop() + squares.pop()); | 132 while(squares.length > 1) reduced.push(squares.pop() + squares.pop()); |
131 squares = reduced; | 133 squares = reduced; |
132 } | 134 } |
133 | 135 |
134 var err_rms = Math.sqrt(squares[0] / test_inputs.length / 2); | 136 var err_rms = Math.sqrt(squares[0] / test_inputs.length / 2); |
135 assertTrue(err_rms < 1E-14); | 137 assertEqualsDelta(0, err_rms, 1E-14); |
136 | 138 |
137 assertEquals(-1, Math.cos({ valueOf: function() { return Math.PI; } })); | 139 assertEquals(-1, Math.cos({ valueOf: function() { return Math.PI; } })); |
138 assertEquals(0, Math.sin("0x00000")); | 140 assertEquals(0, Math.sin("0x00000")); |
139 assertEquals(1, Math.cos("0x00000")); | 141 assertEquals(1, Math.cos("0x00000")); |
140 assertTrue(isNaN(Math.sin(Infinity))); | 142 assertTrue(isNaN(Math.sin(Infinity))); |
141 assertTrue(isNaN(Math.cos("-Infinity"))); | 143 assertTrue(isNaN(Math.cos("-Infinity"))); |
142 assertEquals("Infinity", String(Math.tan(Math.PI/2))); | 144 assertEquals("Infinity", String(Math.tan(Math.PI/2))); |
143 assertEquals("-Infinity", String(Math.tan(-Math.PI/2))); | 145 assertEquals("-Infinity", String(Math.tan(-Math.PI/2))); |
| 146 assertEquals("-Infinity", String(1/Math.sin("-0"))); |
| 147 |
| 148 // Assert that the remainder after division by pi is reasonably precise. |
| 149 function assertError(expected, x, epsilon) { |
| 150 assertTrue(Math.abs(x - expected) < epsilon); |
| 151 } |
| 152 |
| 153 assertEqualsDelta(0.9367521275331447, Math.cos(1e06), 1e-15); |
| 154 assertEqualsDelta(0.8731196226768560, Math.cos(1e10), 1e-08); |
| 155 assertEqualsDelta(0.9367521275331447, Math.cos(-1e06), 1e-15); |
| 156 assertEqualsDelta(0.8731196226768560, Math.cos(-1e10), 1e-08); |
| 157 assertEqualsDelta(-0.3499935021712929, Math.sin(1e06), 1e-15); |
| 158 assertEqualsDelta(-0.4875060250875106, Math.sin(1e10), 1e-08); |
| 159 assertEqualsDelta(0.3499935021712929, Math.sin(-1e06), 1e-15); |
| 160 assertEqualsDelta(0.4875060250875106, Math.sin(-1e10), 1e-08); |
| 161 assertEqualsDelta(0.7796880066069787, Math.sin(1e16), 1e-05); |
| 162 assertEqualsDelta(-0.6261681981330861, Math.cos(1e16), 1e-05); |
| 163 |
| 164 // Assert that remainder calculation terminates. |
| 165 for (var i = -1024; i < 1024; i++) { |
| 166 assertFalse(isNaN(Math.sin(Math.pow(2, i)))); |
| 167 } |
| 168 |
| 169 assertFalse(isNaN(Math.cos(1.57079632679489700))); |
| 170 assertFalse(isNaN(Math.cos(-1e-100))); |
| 171 assertFalse(isNaN(Math.cos(-1e-323))); |
| 172 |
| 173 |
| 174 function no_deopt_on_minus_zero(x) { |
| 175 return Math.sin(x) + Math.cos(x) + Math.tan(x); |
| 176 } |
| 177 |
| 178 no_deopt_on_minus_zero(1); |
| 179 no_deopt_on_minus_zero(1); |
| 180 %OptimizeFunctionOnNextCall(no_deopt_on_minus_zero); |
| 181 no_deopt_on_minus_zero(-0); |
| 182 assertOptimized(no_deopt_on_minus_zero); |
OLD | NEW |