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-semi-space-size=1 --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 var test_double_input = new Function( 42 'n', 43 '"' + (test_id++) + '";return Math.floor(+n)'); 44 assertEquals(expect, test_double_input(input)); 45 assertEquals(expect, test_double_input(input)); 46 assertEquals(expect, test_double_input(input)); 47 %OptimizeFunctionOnNextCall(test_double_input); 48 assertEquals(expect, test_double_input(input)); 49 50 var test_double_output = new Function( 51 'n', 52 '"' + (test_id++) + '";return Math.floor(n) + -0.0'); 53 assertEquals(expect, test_double_output(input)); 54 assertEquals(expect, test_double_output(input)); 55 assertEquals(expect, test_double_output(input)); 56 %OptimizeFunctionOnNextCall(test_double_output); 57 assertEquals(expect, test_double_output(input)); 58 59 var test_via_ceil = new Function( 60 'n', 61 '"' + (test_id++) + '";return -Math.ceil(-n)'); 62 assertEquals(expect, test_via_ceil(input)); 63 assertEquals(expect, test_via_ceil(input)); 64 assertEquals(expect, test_via_ceil(input)); 65 %OptimizeFunctionOnNextCall(test_via_ceil); 66 assertEquals(expect, test_via_ceil(input)); 67 68 if (input >= 0) { 69 var test_via_trunc = new Function( 70 'n', 71 '"' + (test_id++) + '";return Math.trunc(n)'); 72 assertEquals(expect, test_via_trunc(input)); 73 assertEquals(expect, test_via_trunc(input)); 74 assertEquals(expect, test_via_trunc(input)); 75 %OptimizeFunctionOnNextCall(test_via_trunc); 76 assertEquals(expect, test_via_trunc(input)); 77 } 78 } 79 80 function zero() { 81 var x = 0.5; 82 return (function() { return x - 0.5; })(); 83 } 84 85 function test() { 86 // Ensure that a negative zero coming from Math.floor is properly handled 87 // by other operations. 88 function ifloor(x) { 89 return 1 / Math.floor(x); 90 } 91 assertEquals(-Infinity, ifloor(-0)); 92 assertEquals(-Infinity, ifloor(-0)); 93 assertEquals(-Infinity, ifloor(-0)); 94 %OptimizeFunctionOnNextCall(ifloor); 95 assertEquals(-Infinity, ifloor(-0)); 96 97 testFloor(0, 0.1); 98 testFloor(0, 0.49999999999999994); 99 testFloor(0, 0.5); 100 testFloor(0, 0.7); 101 testFloor(0, 1.0 - Number.EPSILON); 102 testFloor(-1, -0.1); 103 testFloor(-1, -0.49999999999999994); 104 testFloor(-1, -0.5); 105 testFloor(-1, -0.7); 106 testFloor(1, 1); 107 testFloor(1, 1.1); 108 testFloor(1, 1.0 + Number.EPSILON); 109 testFloor(1, 1.5); 110 testFloor(1, 1.7); 111 testFloor(-1, -1); 112 testFloor(-1, -1 + Number.EPSILON); 113 testFloor(-2, -1 - Number.EPSILON); 114 testFloor(-2, -1.1); 115 testFloor(-2, -1.5); 116 testFloor(-2, -1.7); 117 118 testFloor(0, Number.MIN_VALUE); 119 testFloor(-1, -Number.MIN_VALUE); 120 testFloor(Number.MAX_VALUE, Number.MAX_VALUE); 121 testFloor(-Number.MAX_VALUE, -Number.MAX_VALUE); 122 testFloor(Infinity, Infinity); 123 testFloor(-Infinity, -Infinity); 124 } 125 126 127 // Test in a loop to cover the custom IC and GC-related issues. 128 for (var i = 0; i < 10; i++) { 129 test(); 130 new Array(i * 10000); 131 } 132