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