verwaest@chromium.org | 33e09c8 | 2012-10-10 17:07:22 +0000 | [diff] [blame] | 1 | // Copyright 2011 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 | |
| 28 | // Flags: --max-new-space-size=256 --allow-natives-syntax |
| 29 | |
| 30 | var test_id = 0; |
| 31 | |
| 32 | function testFloor(expect, input) { |
| 33 | var test = new Function('n', |
| 34 | '"' + (test_id++) + '";return Math.floor(n)'); |
| 35 | assertEquals(expect, test(input)); |
| 36 | assertEquals(expect, test(input)); |
| 37 | assertEquals(expect, test(input)); |
| 38 | %OptimizeFunctionOnNextCall(test); |
| 39 | assertEquals(expect, test(input)); |
| 40 | } |
| 41 | |
| 42 | function zero() { |
| 43 | var x = 0.5; |
| 44 | return (function() { return x - 0.5; })(); |
| 45 | } |
| 46 | |
| 47 | function test() { |
| 48 | // 2^52 is a precision boundary. |
| 49 | var two_52 = (1 << 30) * (1 << 22); |
| 50 | |
| 51 | testFloor(two_52, two_52); |
| 52 | testFloor(two_52, two_52 + 0.1); |
| 53 | assertEquals(two_52, two_52 + 0.5); |
| 54 | testFloor(two_52, two_52 + 0.5); |
| 55 | assertEquals(two_52 + 1, two_52 + 0.7); |
| 56 | testFloor(two_52 + 1, two_52 + 0.7); |
| 57 | |
| 58 | testFloor(two_52 - 1, two_52 - 1); |
| 59 | testFloor(two_52 - 1, two_52 - 1 + 0.1); |
| 60 | testFloor(two_52 - 1, two_52 - 1 + 0.5); |
| 61 | testFloor(two_52 - 1, two_52 - 1 + 0.7); |
| 62 | |
| 63 | testFloor(-two_52, -two_52); |
| 64 | testFloor(-two_52, -two_52 + 0.1); |
| 65 | testFloor(-two_52, -two_52 + 0.5); |
| 66 | testFloor(-two_52, -two_52 + 0.7); |
| 67 | |
| 68 | testFloor(-two_52 + 1, -two_52 + 1); |
| 69 | testFloor(-two_52 + 1, -two_52 + 1 + 0.1); |
| 70 | testFloor(-two_52 + 1, -two_52 + 1 + 0.5); |
| 71 | testFloor(-two_52 + 1, -two_52 + 1 + 0.7); |
| 72 | } |
| 73 | |
| 74 | |
| 75 | // Test in a loop to cover the custom IC and GC-related issues. |
| 76 | for (var i = 0; i < 100; i++) { |
| 77 | test(); |
| 78 | } |