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 "This tests that if a variable is dead on OSR exit, it will at least contain a v
alid JS value." |
26 ); | 26 ); |
27 | 27 |
28 Object.defineProperty(Array.prototype, 0, { writable: false }); | 28 var array = []; |
29 shouldBe("[42].concat()", "[42]"); | |
30 | 29 |
| 30 for (var i = 0; i < 9; ++i) { |
| 31 var code = ""; |
| 32 code += "(function("; |
| 33 for (var j = 0; j < i; ++j) { |
| 34 if (j) |
| 35 code += ", "; |
| 36 code += "arg" + j; |
| 37 } |
| 38 code += ") {\n"; |
| 39 code += " return "; |
| 40 if (i) { |
| 41 for (var j = 0; j < i; ++j) { |
| 42 if (j) |
| 43 code += " + "; |
| 44 code += "arg" + j; |
| 45 } |
| 46 } else |
| 47 code += "void 0"; |
| 48 code += ";\n"; |
| 49 code += "})"; |
| 50 array[i] = eval(code); |
| 51 } |
31 | 52 |
| 53 function foo(a, b) { |
| 54 var x = 0; |
| 55 if (a.f < b.f) { |
| 56 var result = b.g - a.g; |
| 57 x = !x; |
| 58 return result; |
| 59 } else { |
| 60 var result = a.g - b.g; |
| 61 x = [x]; |
| 62 return result; |
| 63 } |
| 64 } |
| 65 |
| 66 var firstArg = {f:2, g:3}; |
| 67 var secondArg = {f:3, g:4}; |
| 68 |
| 69 for (var i = 0; i < 300; ++i) { |
| 70 var code = ""; |
| 71 code += "array[" + (((i / 2) | 0) % array.length) + "]("; |
| 72 for (var j = 0; j < (((i / 2) | 0) % array.length); ++j) { |
| 73 if (j) |
| 74 code += ", "; |
| 75 code += i + j; |
| 76 } |
| 77 if (i == 150) { |
| 78 firstArg = {f:2, g:2.5}; |
| 79 secondArg = {f:3, g:3.5}; |
| 80 } |
| 81 var tmp = firstArg; |
| 82 firstArg = secondArg; |
| 83 secondArg = tmp; |
| 84 code += "); foo(firstArg, secondArg)"; |
| 85 shouldBe(code, "1"); |
| 86 } |
| 87 |
OLD | NEW |