Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2012 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 | |
| 28 | // Flags: --allow-natives-syntax |
| 29 | |
| 30 | // Test that boilerplate objects for array literals with non-constant |
| 31 | // elements (which will contain the hole at non-constant positions) will |
| 32 | // not cause prototype chain lookups when generating optimized code. |
| 33 | |
| 34 | function f(x) { |
| 35 | return [x][0]; |
| 36 | } |
| 37 | |
| 38 | // Test data element on prototype. |
| 39 | Object.prototype[0] = 23; |
| 40 | assertSame(1, f(1)); |
| 41 | assertSame(2, f(2)); |
| 42 | %OptimizeFunctionOnNextCall(f); |
| 43 | assertSame(3, f(3)); |
| 44 | %DeoptimizeFunction(f); |
| 45 | |
| 46 | // Test accessor element on prototype. |
| 47 | Object.prototype.__defineGetter__(0, function() { throw Error(); }); |
| 48 | assertSame(4, f(4)); |
| 49 | assertSame(5, f(5)); |
| 50 | %OptimizeFunctionOnNextCall(f); |
| 51 | assertSame(6, f(6)); |
| 52 | %DeoptimizeFunction(f); |
| 53 | |
| 54 | // Test the same on boilerplate objects for object literals that contain |
| 55 | // both non-constant properties and non-constant elements. |
| 56 | |
| 57 | function g(x, y) { |
| 58 | var o = { foo:x, 0:y }; |
| 59 | return o.foo + o[0]; |
| 60 | } |
| 61 | |
| 62 | // Test data property and element on prototype. |
| 63 | Object.prototype[0] = 23; |
| 64 | Object.prototype.foo = 42; |
| 65 | assertSame(3, g(1, 2)); |
| 66 | assertSame(5, g(2, 3)); |
| 67 | %OptimizeFunctionOnNextCall(g); |
| 68 | assertSame(7, g(3, 4)); |
| 69 | %DeoptimizeFunction(g); |
| 70 | |
| 71 | // Test accessor property and element on prototype. |
| 72 | Object.prototype.__defineGetter__(0, function() { throw Error(); }); |
| 73 | Object.prototype.__defineGetter__('foo', function() { throw Error(); }); |
| 74 | assertSame(3, g(1, 2)); |
| 75 | assertSame(5, g(2, 3)); |
| 76 | %OptimizeFunctionOnNextCall(g); |
| 77 | assertSame(7, g(3, 4)); |
| 78 | %DeoptimizeFunction(g); |