OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. | 2 // Copyright (C) 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserved. |
3 // | 3 // |
4 // Redistribution and use in source and binary forms, with or without | 4 // Redistribution and use in source and binary forms, with or without |
5 // modification, are permitted provided that the following conditions | 5 // modification, are permitted provided that the following conditions |
6 // are met: | 6 // are met: |
7 // 1. Redistributions of source code must retain the above copyright | 7 // 1. Redistributions of source code must retain the above copyright |
8 // notice, this list of conditions and the following disclaimer. | 8 // notice, this list of conditions and the following disclaimer. |
9 // 2. Redistributions in binary form must reproduce the above copyright | 9 // 2. Redistributions in binary form must reproduce the above copyright |
10 // notice, this list of conditions and the following disclaimer in the | 10 // notice, this list of conditions and the following disclaimer in the |
11 // documentation and/or other materials provided with the distribution. | 11 // documentation and/or other materials provided with the distribution. |
12 // | 12 // |
13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y | 13 // THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS'' AND AN
Y |
14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | 14 // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED |
15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | 15 // WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE |
16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y | 16 // DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS BE LIABLE FOR AN
Y |
17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | 17 // DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES |
18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | 18 // (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N | 19 // LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND O
N |
20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 20 // ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | 21 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS |
22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 22 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
23 | 23 |
24 description( | 24 description( |
25 "Tests the behavior of Array.prototype.concat while the array is having a bad ti
me due to one of the elements we are concatenating." | 25 "Tests that when values predicted but not proven int are used in a tower of addi
tions, we don't eliminate the overflow check unsoundly." |
26 ); | 26 ); |
27 | 27 |
28 Object.defineProperty(Array.prototype, 0, { writable: false }); | 28 function foo(a, b, o) { |
29 shouldBe("[42].concat()", "[42]"); | 29 return (a + b + o.f) | 0; |
| 30 } |
30 | 31 |
| 32 function bar(a, b, o) { |
| 33 eval(""); // Prevent this function from being opt compiled. |
| 34 return foo(a, b, o); |
| 35 } |
31 | 36 |
| 37 var badCases = [ |
| 38 {a:2147483645, b:2147483644, c:9007199254740990, expected:-8}, |
| 39 {a:2147483643, b:2147483643, c:18014398509481980, expected:-16}, |
| 40 {a:2147483643, b:2147483642, c:36028797018963960, expected:-16}, |
| 41 {a:2147483642, b:2147483642, c:36028797018963960, expected:-16}, |
| 42 {a:2147483641, b:2147483640, c:144115188075855840, expected:-32}, |
| 43 {a:2147483640, b:2147483640, c:144115188075855840, expected:-64}, |
| 44 {a:2147483640, b:2147483639, c:288230376151711680, expected:-64}, |
| 45 {a:2147483639, b:2147483639, c:288230376151711680, expected:-64} |
| 46 ]; |
| 47 |
| 48 var warmup = 100; |
| 49 |
| 50 for (var i = 0; i < warmup + badCases.length; ++i) { |
| 51 var a, b, c; |
| 52 var expected; |
| 53 if (i < warmup) { |
| 54 a = 1; |
| 55 b = 2; |
| 56 c = 3; |
| 57 expected = 6; |
| 58 } else { |
| 59 var current = badCases[i - warmup]; |
| 60 a = current.a; |
| 61 b = current.b; |
| 62 c = current.c; |
| 63 expected = current.expected; |
| 64 } |
| 65 shouldBe("bar(" + a + ", " + b + ", {f:" + c + "})", "" + expected); |
| 66 } |
| 67 |
OLD | NEW |