Ben Murdoch | b8a8cc1 | 2014-11-26 15:28:44 +0000 | [diff] [blame] | 1 | // Copyright 2013 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 materialization of an arguments object with unknown argument |
| 31 | // values in non-strict mode (length has to be zero). |
| 32 | (function() { |
| 33 | var deoptimize = { deopt:true }; |
| 34 | var object = {}; |
| 35 | |
| 36 | object.a = function A(x, y, z) { |
| 37 | assertSame(0, arguments.length); |
| 38 | return this.b(); |
| 39 | }; |
| 40 | |
| 41 | object.b = function B() { |
| 42 | assertSame(0, arguments.length); |
| 43 | deoptimize.deopt; |
| 44 | return arguments.length; |
| 45 | }; |
| 46 | |
| 47 | assertSame(0, object.a()); |
| 48 | assertSame(0, object.a()); |
| 49 | %OptimizeFunctionOnNextCall(object.a); |
| 50 | assertSame(0, object.a()); |
| 51 | delete deoptimize.deopt; |
| 52 | assertSame(0, object.a()); |
| 53 | })(); |
| 54 | |
| 55 | |
| 56 | // Test materialization of an arguments object with unknown argument |
| 57 | // values in strict mode (length is allowed to exceed stack size). |
| 58 | (function() { |
| 59 | 'use strict'; |
| 60 | var deoptimize = { deopt:true }; |
| 61 | var object = {}; |
| 62 | |
| 63 | object.a = function A(x, y, z) { |
| 64 | assertSame(0, arguments.length); |
| 65 | return this.b(1, 2, 3, 4, 5, 6, 7, 8); |
| 66 | }; |
| 67 | |
| 68 | object.b = function B(a, b, c, d, e, f, g, h) { |
| 69 | assertSame(8, arguments.length); |
| 70 | deoptimize.deopt; |
| 71 | return arguments.length; |
| 72 | }; |
| 73 | |
| 74 | assertSame(8, object.a()); |
| 75 | assertSame(8, object.a()); |
| 76 | %OptimizeFunctionOnNextCall(object.a); |
| 77 | assertSame(8, object.a()); |
| 78 | delete deoptimize.deopt; |
| 79 | assertSame(8, object.a()); |
| 80 | })(); |