2011-04-14 09:05:43 +00:00
|
|
|
// Copyright 2011 the V8 project authors. All rights reserved.
|
2010-09-21 12:54:12 +00:00
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following
|
|
|
|
// disclaimer in the documentation and/or other materials provided
|
|
|
|
// with the distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived
|
|
|
|
// from this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
2014-05-09 08:38:27 +00:00
|
|
|
// Flags: --max-semi-space-size=1 --allow-natives-syntax
|
2011-04-14 09:05:43 +00:00
|
|
|
|
2011-08-12 10:13:40 +00:00
|
|
|
var test_id = 0;
|
|
|
|
|
2011-04-14 09:05:43 +00:00
|
|
|
function testFloor(expect, input) {
|
2011-08-12 10:13:40 +00:00
|
|
|
var test = new Function('n',
|
|
|
|
'"' + (test_id++) + '";return Math.floor(n)');
|
2011-04-14 09:05:43 +00:00
|
|
|
assertEquals(expect, test(input));
|
|
|
|
assertEquals(expect, test(input));
|
|
|
|
assertEquals(expect, test(input));
|
|
|
|
%OptimizeFunctionOnNextCall(test);
|
|
|
|
assertEquals(expect, test(input));
|
2014-04-30 13:38:00 +00:00
|
|
|
|
2016-03-30 11:56:31 +00:00
|
|
|
var test_double_input = new Function(
|
|
|
|
'n',
|
|
|
|
'"' + (test_id++) + '";return Math.floor(+n)');
|
|
|
|
assertEquals(expect, test_double_input(input));
|
|
|
|
assertEquals(expect, test_double_input(input));
|
|
|
|
assertEquals(expect, test_double_input(input));
|
|
|
|
%OptimizeFunctionOnNextCall(test_double_input);
|
|
|
|
assertEquals(expect, test_double_input(input));
|
|
|
|
|
2014-04-30 13:38:00 +00:00
|
|
|
var test_double_output = new Function(
|
|
|
|
'n',
|
|
|
|
'"' + (test_id++) + '";return Math.floor(n) + -0.0');
|
|
|
|
assertEquals(expect, test_double_output(input));
|
|
|
|
assertEquals(expect, test_double_output(input));
|
|
|
|
assertEquals(expect, test_double_output(input));
|
|
|
|
%OptimizeFunctionOnNextCall(test_double_output);
|
|
|
|
assertEquals(expect, test_double_output(input));
|
2016-03-30 11:56:31 +00:00
|
|
|
|
|
|
|
var test_via_ceil = new Function(
|
|
|
|
'n',
|
|
|
|
'"' + (test_id++) + '";return -Math.ceil(-n)');
|
|
|
|
assertEquals(expect, test_via_ceil(input));
|
|
|
|
assertEquals(expect, test_via_ceil(input));
|
|
|
|
assertEquals(expect, test_via_ceil(input));
|
|
|
|
%OptimizeFunctionOnNextCall(test_via_ceil);
|
|
|
|
assertEquals(expect, test_via_ceil(input));
|
|
|
|
|
|
|
|
if (input >= 0) {
|
|
|
|
var test_via_trunc = new Function(
|
|
|
|
'n',
|
|
|
|
'"' + (test_id++) + '";return Math.trunc(n)');
|
|
|
|
assertEquals(expect, test_via_trunc(input));
|
|
|
|
assertEquals(expect, test_via_trunc(input));
|
|
|
|
assertEquals(expect, test_via_trunc(input));
|
|
|
|
%OptimizeFunctionOnNextCall(test_via_trunc);
|
|
|
|
assertEquals(expect, test_via_trunc(input));
|
|
|
|
}
|
2011-04-14 09:05:43 +00:00
|
|
|
}
|
2010-09-21 12:54:12 +00:00
|
|
|
|
|
|
|
function zero() {
|
|
|
|
var x = 0.5;
|
|
|
|
return (function() { return x - 0.5; })();
|
|
|
|
}
|
|
|
|
|
|
|
|
function test() {
|
2011-04-14 09:05:43 +00:00
|
|
|
testFloor(0, 0);
|
|
|
|
testFloor(0, zero());
|
|
|
|
testFloor(-0, -0);
|
|
|
|
testFloor(Infinity, Infinity);
|
|
|
|
testFloor(-Infinity, -Infinity);
|
|
|
|
testFloor(NaN, NaN);
|
2010-09-21 12:54:12 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Test in a loop to cover the custom IC and GC-related issues.
|
2012-09-24 10:02:44 +00:00
|
|
|
for (var i = 0; i < 100; i++) {
|
2010-09-21 12:54:12 +00:00
|
|
|
test();
|
|
|
|
}
|
2011-08-10 12:32:43 +00:00
|
|
|
|
|
|
|
|
|
|
|
// Regression test for a bug where a negative zero coming from Math.floor
|
|
|
|
// was not properly handled by other operations.
|
|
|
|
function floorsum(i, n) {
|
|
|
|
var ret = Math.floor(n);
|
|
|
|
while (--i > 0) {
|
|
|
|
ret += Math.floor(n);
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
assertEquals(-0, floorsum(1, -0));
|
|
|
|
%OptimizeFunctionOnNextCall(floorsum);
|
|
|
|
// The optimized function will deopt. Run it with enough iterations to try
|
|
|
|
// to optimize via OSR (triggering the bug).
|
|
|
|
assertEquals(-0, floorsum(100000, -0));
|