OLD | NEW |
1 // Copyright 2010 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 |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Flags: --allow-natives-syntax | 28 // Flags: --allow-natives-syntax |
29 | 29 |
| 30 var test_id = 0; |
30 function testRound(expect, input) { | 31 function testRound(expect, input) { |
31 function doRound(input) { | 32 // Make source code different on each invocation to make |
32 return Math.round(input); | 33 // sure it gets optimized each time. |
33 } | 34 var doRound = new Function('input', |
| 35 '"' + (test_id++) + '";return Math.round(input)'); |
34 assertEquals(expect, doRound(input)); | 36 assertEquals(expect, doRound(input)); |
35 assertEquals(expect, doRound(input)); | 37 assertEquals(expect, doRound(input)); |
36 assertEquals(expect, doRound(input)); | 38 assertEquals(expect, doRound(input)); |
37 %OptimizeFunctionOnNextCall(doRound); | 39 %OptimizeFunctionOnNextCall(doRound); |
38 assertEquals(expect, doRound(input)); | 40 assertEquals(expect, doRound(input)); |
39 } | 41 } |
40 | 42 |
41 testRound(0, 0); | 43 testRound(0, 0); |
42 testRound(-0, -0); | 44 testRound(-0, -0); |
43 testRound(Infinity, Infinity); | 45 testRound(Infinity, Infinity); |
44 testRound(-Infinity, -Infinity); | 46 testRound(-Infinity, -Infinity); |
45 testRound(NaN, NaN); | 47 testRound(NaN, NaN); |
46 | 48 |
| 49 // Regression test for a bug where a negative zero coming from Math.round |
| 50 // was not properly handled by other operations. |
| 51 function roundsum(i, n) { |
| 52 var ret = Math.round(n); |
| 53 while (--i > 0) { |
| 54 ret += Math.round(n); |
| 55 } |
| 56 return ret; |
| 57 } |
| 58 assertEquals(-0, roundsum(1, -0)); |
| 59 %OptimizeFunctionOnNextCall(roundsum); |
| 60 // The optimized function will deopt. Run it with enough iterations to try |
| 61 // to optimize via OSR (triggering the bug). |
| 62 assertEquals(-0, roundsum(100000, -0)); |
| 63 |
47 testRound(1, 0.5); | 64 testRound(1, 0.5); |
48 testRound(1, 0.7); | 65 testRound(1, 0.7); |
49 testRound(1, 1); | 66 testRound(1, 1); |
50 testRound(1, 1.1); | 67 testRound(1, 1.1); |
51 testRound(1, 1.49999); | 68 testRound(1, 1.49999); |
52 testRound(-0, -0.5); | 69 testRound(-0, -0.5); |
53 testRound(-1, -0.5000000000000001); | 70 testRound(-1, -0.5000000000000001); |
54 testRound(-1, -0.7); | 71 testRound(-1, -0.7); |
55 testRound(-1, -1); | 72 testRound(-1, -1); |
56 testRound(-1, -1.1); | 73 testRound(-1, -1.1); |
(...skipping 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
148 testRound(-Math.pow(2,52)+1, -max_fraction); | 165 testRound(-Math.pow(2,52)+1, -max_fraction); |
149 testRound(-min_nonfraction, -min_nonfraction); | 166 testRound(-min_nonfraction, -min_nonfraction); |
150 testRound(-max_non_infinite, -max_non_infinite); | 167 testRound(-max_non_infinite, -max_non_infinite); |
151 | 168 |
152 testRound(min_smi31, min_smi31 - 0.5); | 169 testRound(min_smi31, min_smi31 - 0.5); |
153 testRound(min_smi31 + 1, min_smi31 + 0.5); | 170 testRound(min_smi31 + 1, min_smi31 + 0.5); |
154 testRound(min_smi32, min_smi32 - 0.5); | 171 testRound(min_smi32, min_smi32 - 0.5); |
155 testRound(min_smi32 + 1, min_smi32 + 0.5); | 172 testRound(min_smi32 + 1, min_smi32 + 0.5); |
156 | 173 |
157 | 174 |
OLD | NEW |