OLD | NEW |
| (Empty) |
1 // Copyright 2016 the V8 project authors. All rights reserved. | |
2 // Use of this source code is governed by a BSD-style license that can be | |
3 // found in the LICENSE file. | |
4 // | |
5 // Flags: --mark-shared-functions-for-tier-up --allow-natives-syntax --ignition-
staging --no-turbo | |
6 | |
7 (function() { | |
8 var sum = 0; | |
9 var i = 0; | |
10 for (var i = 0; i < 5; ++i) { | |
11 var f = function(x) { | |
12 return 2 * x; | |
13 } | |
14 sum += f(i); | |
15 | |
16 if (%GetOptimizationStatus(f) == 3 || %GetOptimizationStatus(f) == 4) { | |
17 // If we are always or never optimizing f, just exit, this test is useless
. | |
18 return; | |
19 } | |
20 | |
21 if (i == 1) { | |
22 // f must be interpreted code. | |
23 assertEquals(8, %GetOptimizationStatus(f)); | |
24 | |
25 // Allow it to run twice (i = 0, 1), then tier-up to baseline. | |
26 %BaselineFunctionOnNextCall(f); | |
27 } else if (i == 2) { | |
28 // Tier-up at i = 2 should only go up to baseline. | |
29 assertEquals(2, %GetOptimizationStatus(f)); | |
30 } else if (i == 3) { | |
31 // Now f must be baseline code. | |
32 assertEquals(2, %GetOptimizationStatus(f)); | |
33 | |
34 // Run two more times (i = 2, 3), then tier-up to optimized. | |
35 %OptimizeFunctionOnNextCall(f); | |
36 } else if (i == 4) { | |
37 // Tier-up at i = 4 should now go up to crankshaft. | |
38 assertEquals(1, %GetOptimizationStatus(f)); | |
39 } | |
40 } | |
41 })() | |
OLD | NEW |