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 test checks corner cases of the number cell reuse code. In particular, it
checks for known cases where code generation for number cell reuse caused assert
ions to fail." |
26 ); | 26 ); |
27 | 27 |
28 Object.defineProperty(Array.prototype, 0, { writable: false }); | 28 function leftConstantRightSimple(a) |
29 shouldBe("[42].concat()", "[42]"); | 29 { |
| 30 return 0.1 * (a * a); |
| 31 } |
30 | 32 |
| 33 shouldBe("leftConstantRightSimple(2)", "0.4"); |
31 | 34 |
| 35 function leftConstantRightComplex(a) |
| 36 { |
| 37 return 0.1 * (a * a + a); |
| 38 } |
| 39 |
| 40 shouldBe("leftConstantRightComplex(1)", "0.2"); |
| 41 |
| 42 function leftSimpleRightConstant(a) |
| 43 { |
| 44 return (a * a) * 0.1; |
| 45 } |
| 46 |
| 47 shouldBe("leftSimpleRightConstant(2)", "0.4"); |
| 48 |
| 49 function leftComplexRightConstant(a) |
| 50 { |
| 51 return (a * a + a) * 0.1; |
| 52 } |
| 53 |
| 54 shouldBe("leftComplexRightConstant(1)", "0.2"); |
| 55 |
| 56 function leftThisRightSimple(a) |
| 57 { |
| 58 return this * (a * a); |
| 59 } |
| 60 |
| 61 shouldBeNaN("leftThisRightSimple(2)"); |
| 62 shouldBe("leftThisRightSimple.call(2, 2)", "8"); |
| 63 |
| 64 function leftThisRightComplex(a) |
| 65 { |
| 66 return this * (a * a + a); |
| 67 } |
| 68 |
| 69 shouldBeNaN("leftThisRightComplex(2)"); |
| 70 shouldBe("leftThisRightComplex.call(2, 2)", "12"); |
| 71 |
| 72 function leftSimpleRightThis(a) |
| 73 { |
| 74 return (a * a) * this; |
| 75 } |
| 76 |
| 77 shouldBeNaN("leftSimpleRightThis(2)"); |
| 78 shouldBe("leftSimpleRightThis.call(2, 2)", "8"); |
| 79 |
| 80 function leftComplexRightThis(a) |
| 81 { |
| 82 return (a * a + a) * this; |
| 83 } |
| 84 |
| 85 shouldBeNaN("leftComplexRightThis(2)"); |
| 86 shouldBe("leftComplexRightThis.call(2, 2)", "12"); |
OLD | NEW |