OLD | NEW |
(Empty) | |
| 1 // Copyright 2014 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 --noalways-opt |
| 29 |
| 30 var calls = 0; |
| 31 |
| 32 function callsFReceiver(o) { |
| 33 return [].f.call(new Number(o.m), 1, 2, 3); |
| 34 } |
| 35 |
| 36 // For the HConstant |
| 37 Array.prototype.f = function() { |
| 38 calls++; |
| 39 return +this; |
| 40 }; |
| 41 |
| 42 |
| 43 var o1 = {m: 1}; |
| 44 var o2 = {a: 0, m:1}; |
| 45 |
| 46 var r1 = callsFReceiver(o1); |
| 47 callsFReceiver(o1); |
| 48 %OptimizeFunctionOnNextCall(callsFReceiver); |
| 49 var r2 = callsFReceiver(o1); |
| 50 assertOptimized(callsFReceiver); |
| 51 callsFReceiver(o2); |
| 52 assertUnoptimized(callsFReceiver); |
| 53 var r3 = callsFReceiver(o1); |
| 54 |
| 55 assertEquals(1, r1); |
| 56 assertTrue(r1 === r2); |
| 57 assertTrue(r2 === r3); |
| 58 |
| 59 r1 = callsFReceiver(o1); |
| 60 callsFReceiver(o1); |
| 61 %OptimizeFunctionOnNextCall(callsFReceiver); |
| 62 r2 = callsFReceiver(o1); |
| 63 callsFReceiver(o2); |
| 64 r3 = callsFReceiver(o1); |
| 65 |
| 66 assertEquals(1, r1); |
| 67 assertTrue(r1 === r2); |
| 68 assertTrue(r2 === r3); |
| 69 |
| 70 assertEquals(10, calls); |
OLD | NEW |