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
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.
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.
28 // Flags: --max-semi-space-size=1 --allow-natives-syntax
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));
41 var test_double_output = new Function(
43 '"' + (test_id++) + '";return Math.floor(n) + -0.0');
44 assertEquals(expect, test_double_output(input));
45 assertEquals(expect, test_double_output(input));
46 assertEquals(expect, test_double_output(input));
47 %OptimizeFunctionOnNextCall(test_double_output);
48 assertEquals(expect, test_double_output(input));
53 return (function() { return x - 0.5; })();
57 // 2^30 is a smi boundary.
60 testFloor(two_30, two_30);
61 testFloor(two_30, two_30 + 0.1);
62 testFloor(two_30, two_30 + 0.5);
63 testFloor(two_30, two_30 + 0.7);
65 testFloor(two_30 - 1, two_30 - 1);
66 testFloor(two_30 - 1, two_30 - 1 + 0.1);
67 testFloor(two_30 - 1, two_30 - 1 + 0.5);
68 testFloor(two_30 - 1, two_30 - 1 + 0.7);
70 testFloor(-two_30, -two_30);
71 testFloor(-two_30, -two_30 + 0.1);
72 testFloor(-two_30, -two_30 + 0.5);
73 testFloor(-two_30, -two_30 + 0.7);
75 testFloor(-two_30 + 1, -two_30 + 1);
76 testFloor(-two_30 + 1, -two_30 + 1 + 0.1);
77 testFloor(-two_30 + 1, -two_30 + 1 + 0.5);
78 testFloor(-two_30 + 1, -two_30 + 1 + 0.7);
82 // Test in a loop to cover the custom IC and GC-related issues.
83 for (var i = 0; i < 100; i++) {