Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 1 | // Copyright 2010 the V8 project authors. All rights reserved. |
| 2 | // Redistribution and use in source and binary forms, with or without |
| 3 | // modification, are permitted provided that the following conditions are |
| 4 | // met: |
| 5 | // |
| 6 | // * Redistributions of source code must retain the above copyright |
| 7 | // notice, this list of conditions and the following disclaimer. |
| 8 | // * Redistributions in binary form must reproduce the above |
| 9 | // copyright notice, this list of conditions and the following |
| 10 | // disclaimer in the documentation and/or other materials provided |
| 11 | // with the distribution. |
| 12 | // * Neither the name of Google Inc. nor the names of its |
| 13 | // contributors may be used to endorse or promote products derived |
| 14 | // from this software without specific prior written permission. |
| 15 | // |
| 16 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 | // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 | // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 | // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 | // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 | // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 | // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 | // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 | // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 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. |
| 27 | |
Ben Murdoch | 8b112d2 | 2011-06-08 16:22:53 +0100 | [diff] [blame] | 28 | // Flags: --allow-natives-syntax |
| 29 | |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 30 | function GetX(o) { return o.x; } |
| 31 | function CallF(o) { return o.f(); } |
| 32 | function SetX(o) { o.x = 42; } |
| 33 | function SetXY(o,y) { return o.x = y; } |
| 34 | |
| 35 | |
| 36 | function Test(o) { |
| 37 | SetX(o); |
| 38 | assertEquals(42, GetX(o)); |
| 39 | assertEquals(87, SetXY(o, 87)); |
| 40 | assertEquals(87, GetX(o)); |
| 41 | assertTrue(SetXY(o, o) === o); |
| 42 | assertTrue(o === GetX(o), "o === GetX(o)"); |
| 43 | assertEquals("hest", SetXY(o, "hest")); |
| 44 | assertEquals("hest", GetX(o)); |
| 45 | assertTrue(SetXY(o, Test) === Test); |
| 46 | assertTrue(Test === GetX(o), "Test === GetX(o)"); |
| 47 | assertEquals(99, CallF(o)); |
| 48 | } |
| 49 | |
| 50 | // Create a bunch of objects with different layouts. |
| 51 | var o1 = { x: 0, y: 1 }; |
| 52 | var o2 = { y: 1, x: 0 }; |
| 53 | var o3 = { y: 1, z: 2, x: 0 }; |
| 54 | o1.f = o2.f = o3.f = function() { return 99; } |
| 55 | |
| 56 | // Run the test until we're fairly sure we've optimized the |
| 57 | // polymorphic property access. |
Ben Murdoch | 8b112d2 | 2011-06-08 16:22:53 +0100 | [diff] [blame] | 58 | for (var i = 0; i < 5; i++) { |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 59 | Test(o1); |
| 60 | Test(o2); |
| 61 | Test(o3); |
| 62 | } |
Ben Murdoch | 8b112d2 | 2011-06-08 16:22:53 +0100 | [diff] [blame] | 63 | %OptimizeFunctionOnNextCall(Test); |
| 64 | Test(o1); |
| 65 | Test(o2); |
| 66 | Test(o3); |
Ben Murdoch | b0fe162 | 2011-05-05 13:52:32 +0100 | [diff] [blame] | 67 | |
| 68 | // Make sure that the following doesn't crash. |
| 69 | GetX(0); |
| 70 | SetX(0); |
| 71 | SetXY(0, 0); |
| 72 | assertThrows("CallF(0)", TypeError); |