OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 // Flags: --max-new-space-size=256 --allow-natives-syntax | 28 // Flags: --max-new-space-size=128 --allow-natives-syntax |
29 | 29 |
30 // Test inlining of Math.floor when assigned to a local. | 30 // Test inlining of Math.floor when assigned to a local. |
31 var test_id = 0; | 31 var test_id = 0; |
32 | 32 |
33 function testFloor(expect, input) { | 33 function testFloor(expect, input) { |
34 var test = new Function('n', | 34 var test = new Function('n', |
35 '"' + (test_id++) + | 35 '"' + (test_id++) + |
36 '";var f = Math.floor; return f(n)'); | 36 '";var f = Math.floor; return f(n)'); |
37 assertEquals(expect, test(input)); | 37 assertEquals(expect, test(input)); |
38 assertEquals(expect, test(input)); | 38 assertEquals(expect, test(input)); |
(...skipping 94 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
133 testFloor(-two_52, -two_52 + 0.7); | 133 testFloor(-two_52, -two_52 + 0.7); |
134 | 134 |
135 testFloor(-two_52 + 1, -two_52 + 1); | 135 testFloor(-two_52 + 1, -two_52 + 1); |
136 testFloor(-two_52 + 1, -two_52 + 1 + 0.1); | 136 testFloor(-two_52 + 1, -two_52 + 1 + 0.1); |
137 testFloor(-two_52 + 1, -two_52 + 1 + 0.5); | 137 testFloor(-two_52 + 1, -two_52 + 1 + 0.5); |
138 testFloor(-two_52 + 1, -two_52 + 1 + 0.7); | 138 testFloor(-two_52 + 1, -two_52 + 1 + 0.7); |
139 } | 139 } |
140 | 140 |
141 | 141 |
142 // Test in a loop to cover the custom IC and GC-related issues. | 142 // Test in a loop to cover the custom IC and GC-related issues. |
143 for (var i = 0; i < 50; i++) { | 143 for (var i = 0; i < 10; i++) { |
144 test(); | 144 test(); |
| 145 new Array(i * 10000); |
145 } | 146 } |
146 | 147 |
147 | 148 |
148 // Regression test for a bug where a negative zero coming from Math.floor | 149 // Regression test for a bug where a negative zero coming from Math.floor |
149 // was not properly handled by other operations. | 150 // was not properly handled by other operations. |
150 function floorsum(i, n) { | 151 function floorsum(i, n) { |
151 var ret = Math.floor(n); | 152 var ret = Math.floor(n); |
152 while (--i > 0) { | 153 while (--i > 0) { |
153 ret += Math.floor(n); | 154 ret += Math.floor(n); |
154 } | 155 } |
155 return ret; | 156 return ret; |
156 } | 157 } |
157 assertEquals(-0, floorsum(1, -0)); | 158 assertEquals(-0, floorsum(1, -0)); |
158 %OptimizeFunctionOnNextCall(floorsum); | 159 %OptimizeFunctionOnNextCall(floorsum); |
159 // The optimized function will deopt. Run it with enough iterations to try | 160 // The optimized function will deopt. Run it with enough iterations to try |
160 // to optimize via OSR (triggering the bug). | 161 // to optimize via OSR (triggering the bug). |
161 assertEquals(-0, floorsum(100000, -0)); | 162 assertEquals(-0, floorsum(100000, -0)); |
OLD | NEW |