OLD | NEW |
| (Empty) |
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: --use-osr --allow-natives-syntax --crankshaft | |
29 | |
30 var o1 = {a : 10}; | |
31 var o2 = { }; | |
32 o2.__proto__ = o1; | |
33 var o3 = { }; | |
34 o3.__proto__ = o2; | |
35 | |
36 function f(n, x, b) { | |
37 var sum = x.a; | |
38 for (var i = 0; i < n; i++) { | |
39 sum = 1.0 / i; | |
40 } | |
41 return sum; | |
42 } | |
43 | |
44 f(10, o3); | |
45 f(20, o3); | |
46 f(30, o3); | |
47 %OptimizeFunctionOnNextCall(f, "concurrent"); | |
48 f(100000, o3); | |
49 // At this point OSR replaces already optimized code. | |
50 // Check that it evicts old code from cache. | |
51 | |
52 // This causes all code for f to be lazily deopted. | |
53 o2.a = 5; | |
54 | |
55 // If OSR did not evict the old code, it will be installed in f here. | |
56 %OptimizeFunctionOnNextCall(f); | |
57 f(10, o3); | |
58 | |
59 // The old code is already deoptimized, but f still points to it. | |
60 // Disassembling it will crash. | |
61 %DebugDisassembleFunction(f); | |
OLD | NEW |