| 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 // Flags: --max-new-space-size=256 --allow-natives-syntax | 28 // Flags: --max-new-space-size=256 --allow-natives-syntax |
| 29 | 29 |
| 30 var test_id = 0; |
| 31 |
| 30 function testFloor(expect, input) { | 32 function testFloor(expect, input) { |
| 31 function test(n) { | 33 var test = new Function('n', |
| 32 return Math.floor(n); | 34 '"' + (test_id++) + '";return Math.floor(n)'); |
| 33 } | |
| 34 assertEquals(expect, test(input)); | 35 assertEquals(expect, test(input)); |
| 35 assertEquals(expect, test(input)); | 36 assertEquals(expect, test(input)); |
| 36 assertEquals(expect, test(input)); | 37 assertEquals(expect, test(input)); |
| 37 %OptimizeFunctionOnNextCall(test); | 38 %OptimizeFunctionOnNextCall(test); |
| 38 assertEquals(expect, test(input)); | 39 assertEquals(expect, test(input)); |
| 39 } | 40 } |
| 40 | 41 |
| 41 function zero() { | 42 function zero() { |
| 42 var x = 0.5; | 43 var x = 0.5; |
| 43 return (function() { return x - 0.5; })(); | 44 return (function() { return x - 0.5; })(); |
| 44 } | 45 } |
| 45 | 46 |
| 46 function test() { | 47 function test() { |
| 47 testFloor(0, 0); | 48 testFloor(0, 0); |
| 48 testFloor(0, zero()); | 49 testFloor(0, zero()); |
| 49 testFloor(-0, -0); | 50 testFloor(-0, -0); |
| 50 testFloor(Infinity, Infinity); | 51 testFloor(Infinity, Infinity); |
| 51 testFloor(-Infinity, -Infinity); | 52 testFloor(-Infinity, -Infinity); |
| 52 testFloor(NaN, NaN); | 53 testFloor(NaN, NaN); |
| 53 | 54 |
| 55 // Ensure that a negative zero coming from Math.floor is properly handled |
| 56 // by other operations. |
| 57 function ifloor(x) { |
| 58 return 1 / Math.floor(x); |
| 59 } |
| 60 assertEquals(-Infinity, ifloor(-0)); |
| 61 assertEquals(-Infinity, ifloor(-0)); |
| 62 assertEquals(-Infinity, ifloor(-0)); |
| 63 %OptimizeFunctionOnNextCall(ifloor); |
| 64 assertEquals(-Infinity, ifloor(-0)); |
| 65 |
| 54 testFloor(0, 0.1); | 66 testFloor(0, 0.1); |
| 55 testFloor(0, 0.49999999999999994); | 67 testFloor(0, 0.49999999999999994); |
| 56 testFloor(0, 0.5); | 68 testFloor(0, 0.5); |
| 57 testFloor(0, 0.7); | 69 testFloor(0, 0.7); |
| 58 testFloor(-1, -0.1); | 70 testFloor(-1, -0.1); |
| 59 testFloor(-1, -0.49999999999999994); | 71 testFloor(-1, -0.49999999999999994); |
| 60 testFloor(-1, -0.5); | 72 testFloor(-1, -0.5); |
| 61 testFloor(-1, -0.7); | 73 testFloor(-1, -0.7); |
| 62 testFloor(1, 1); | 74 testFloor(1, 1); |
| 63 testFloor(1, 1.1); | 75 testFloor(1, 1.1); |
| (...skipping 58 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 122 testFloor(-two_52 + 1, -two_52 + 1 + 0.1); | 134 testFloor(-two_52 + 1, -two_52 + 1 + 0.1); |
| 123 testFloor(-two_52 + 1, -two_52 + 1 + 0.5); | 135 testFloor(-two_52 + 1, -two_52 + 1 + 0.5); |
| 124 testFloor(-two_52 + 1, -two_52 + 1 + 0.7); | 136 testFloor(-two_52 + 1, -two_52 + 1 + 0.7); |
| 125 } | 137 } |
| 126 | 138 |
| 127 | 139 |
| 128 // Test in a loop to cover the custom IC and GC-related issues. | 140 // Test in a loop to cover the custom IC and GC-related issues. |
| 129 for (var i = 0; i < 500; i++) { | 141 for (var i = 0; i < 500; i++) { |
| 130 test(); | 142 test(); |
| 131 } | 143 } |
| 144 |
| 145 |
| 146 // Regression test for a bug where a negative zero coming from Math.floor |
| 147 // was not properly handled by other operations. |
| 148 function floorsum(i, n) { |
| 149 var ret = Math.floor(n); |
| 150 while (--i > 0) { |
| 151 ret += Math.floor(n); |
| 152 } |
| 153 return ret; |
| 154 } |
| 155 assertEquals(-0, floorsum(1, -0)); |
| 156 %OptimizeFunctionOnNextCall(floorsum); |
| 157 // The optimized function will deopt. Run it with enough iterations to try |
| 158 // to optimize via OSR (triggering the bug). |
| 159 assertEquals(-0, floorsum(100000, -0)); |
| OLD | NEW |