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 whether peephole optimizations on bytecode properly deal with local regis
ters." |
26 ); | 26 ); |
27 | 27 |
28 Object.defineProperty(Array.prototype, 0, { writable: false }); | 28 function if_less_test() |
29 shouldBe("[42].concat()", "[42]"); | 29 { |
| 30 var a = 0; |
| 31 var b = 2; |
| 32 if (a = 1 < 2) |
| 33 return a == 1; |
| 34 } |
30 | 35 |
| 36 shouldBeTrue("if_less_test()"); |
31 | 37 |
| 38 function if_else_less_test() |
| 39 { |
| 40 var a = 0; |
| 41 var b = 2; |
| 42 if (a = 1 < 2) |
| 43 return a == 1; |
| 44 else |
| 45 return false; |
| 46 } |
| 47 |
| 48 shouldBeTrue("if_else_less_test()"); |
| 49 |
| 50 function conditional_less_test() |
| 51 { |
| 52 var a = 0; |
| 53 var b = 2; |
| 54 return (a = 1 < 2) ? a == 1 : false; |
| 55 } |
| 56 |
| 57 shouldBeTrue("conditional_less_test()"); |
| 58 |
| 59 function logical_and_less_test() |
| 60 { |
| 61 var a = 0; |
| 62 var b = 2; |
| 63 return (a = 1 < 2) && a == 1; |
| 64 } |
| 65 |
| 66 shouldBeTrue("logical_and_less_test()"); |
| 67 |
| 68 function logical_or_less_test() |
| 69 { |
| 70 var a = 0; |
| 71 var b = 2; |
| 72 var result = (a = 1 < 2) || a == 1; |
| 73 return a == 1; |
| 74 } |
| 75 |
| 76 shouldBeTrue("logical_or_less_test()"); |
| 77 |
| 78 function do_while_less_test() |
| 79 { |
| 80 var a = 0; |
| 81 var count = 0; |
| 82 do { |
| 83 if (count == 1) |
| 84 return a == 1; |
| 85 count++; |
| 86 } while (a = 1 < 2) |
| 87 } |
| 88 |
| 89 shouldBeTrue("do_while_less_test()"); |
| 90 |
| 91 function while_less_test() |
| 92 { |
| 93 var a = 0; |
| 94 while (a = 1 < 2) |
| 95 return a == 1; |
| 96 } |
| 97 |
| 98 shouldBeTrue("while_less_test()"); |
| 99 |
| 100 function for_less_test() |
| 101 { |
| 102 for (var a = 0; a = 1 < 2; ) |
| 103 return a == 1; |
| 104 } |
| 105 |
| 106 shouldBeTrue("for_less_test()"); |
OLD | NEW |