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 deopt after generic store with effect context. |
| 31 | var pro = { x : 1 } |
| 32 | var a = {} |
| 33 | a.__proto__ = pro |
| 34 | delete pro.x |
| 35 | |
| 36 | function g(o) { |
| 37 | return 7 + (o.z = 1, 20); |
| 38 | } |
| 39 | |
| 40 | g(a); |
| 41 | g(a); |
| 42 | %OptimizeFunctionOnNextCall(g); |
| 43 | Object.defineProperty(pro, "z", { |
| 44 | set: function(v) { %DeoptimizeFunction(g); }, |
| 45 | get: function() { return 20; } |
| 46 | }); |
| 47 | |
| 48 | assertEquals(27, g(a)); |
| 49 | |
| 50 | // Test deopt after polymorphic as monomorphic store with effect context. |
| 51 | |
| 52 | var i = { z : 2, r : 1 } |
| 53 | var j = { z : 2 } |
| 54 | var p = { a : 10 } |
| 55 | var pp = { a : 20, b : 1 } |
| 56 | |
| 57 | function bar(o, p) { |
| 58 | return 7 + (o.z = 1, p.a); |
| 59 | } |
| 60 | |
| 61 | bar(i, p); |
| 62 | bar(i, p); |
| 63 | bar(j, p); |
| 64 | %OptimizeFunctionOnNextCall(bar); |
| 65 | assertEquals(27, bar(i, pp)); |
| 66 | |
| 67 | // Test deopt after polymorphic store with effect context. |
| 68 | |
| 69 | var i = { r : 1, z : 2 } |
| 70 | var j = { z : 2 } |
| 71 | var p = { a : 10 } |
| 72 | var pp = { a : 20, b : 1 } |
| 73 | |
| 74 | function bar1(o, p) { |
| 75 | return 7 + (o.z = 1, p.a); |
| 76 | } |
| 77 | |
| 78 | bar1(i, p); |
| 79 | bar1(i, p); |
| 80 | bar1(j, p); |
| 81 | %OptimizeFunctionOnNextCall(bar1); |
| 82 | assertEquals(27, bar1(i, pp)); |