Mercurial > hg > truffle
annotate src/share/vm/interpreter/invocationCounter.cpp @ 7421:ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
Summary: collection of small changes to prepare for incremental inlining.
Reviewed-by: twisti, kvn
author | roland |
---|---|
date | Tue, 18 Dec 2012 14:55:25 +0100 |
parents | f95d63e2154a |
children | 8d18583cf5f7 aeaca88565e6 |
rev | line source |
---|---|
0 | 1 /* |
1783 | 2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. All rights reserved. |
0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * | |
5 * This code is free software; you can redistribute it and/or modify it | |
6 * under the terms of the GNU General Public License version 2 only, as | |
7 * published by the Free Software Foundation. | |
8 * | |
9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
12 * version 2 for more details (a copy is included in the LICENSE file that | |
13 * accompanied this code). | |
14 * | |
15 * You should have received a copy of the GNU General Public License version | |
16 * 2 along with this work; if not, write to the Free Software Foundation, | |
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
18 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
844
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
844
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
844
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "interpreter/invocationCounter.hpp" | |
27 #include "runtime/frame.hpp" | |
28 #include "runtime/handles.inline.hpp" | |
0 | 29 |
30 | |
31 // Implementation of InvocationCounter | |
32 | |
33 void InvocationCounter::init() { | |
34 _counter = 0; // reset all the bits, including the sticky carry | |
35 reset(); | |
36 } | |
37 | |
38 void InvocationCounter::reset() { | |
39 // Only reset the state and don't make the method look like it's never | |
40 // been executed | |
41 set_state(wait_for_compile); | |
42 } | |
43 | |
44 void InvocationCounter::set_carry() { | |
1783 | 45 set_carry_flag(); |
0 | 46 // The carry bit now indicates that this counter had achieved a very |
47 // large value. Now reduce the value, so that the method can be | |
48 // executed many more times before re-entering the VM. | |
49 int old_count = count(); | |
50 int new_count = MIN2(old_count, (int) (CompileThreshold / 2)); | |
654
c664a0794f85
6805748: Assertion "don't reset to 0 -- could be mistaken for never-executed" in CompilationPolicy
coleenp
parents:
0
diff
changeset
|
51 // prevent from going to zero, to distinguish from never-executed methods |
c664a0794f85
6805748: Assertion "don't reset to 0 -- could be mistaken for never-executed" in CompilationPolicy
coleenp
parents:
0
diff
changeset
|
52 if (new_count == 0) new_count = 1; |
0 | 53 if (old_count != new_count) set(state(), new_count); |
54 } | |
55 | |
56 void InvocationCounter::set_state(State state) { | |
57 assert(0 <= state && state < number_of_states, "illegal state"); | |
58 int init = _init[state]; | |
59 // prevent from going to zero, to distinguish from never-executed methods | |
60 if (init == 0 && count() > 0) init = 1; | |
61 int carry = (_counter & carry_mask); // the carry bit is sticky | |
62 _counter = (init << number_of_noncount_bits) | carry | state; | |
63 } | |
64 | |
65 | |
66 void InvocationCounter::print() { | |
67 tty->print_cr("invocation count: up = %d, limit = %d, carry = %s, state = %s", | |
68 count(), limit(), | |
69 carry() ? "true" : "false", | |
70 state_as_string(state())); | |
71 } | |
72 | |
73 void InvocationCounter::print_short() { | |
74 tty->print(" [%d%s;%s]", count(), carry()?"+carry":"", state_as_short_string(state())); | |
75 } | |
76 | |
77 // Initialization | |
78 | |
79 int InvocationCounter::_init [InvocationCounter::number_of_states]; | |
80 InvocationCounter::Action InvocationCounter::_action[InvocationCounter::number_of_states]; | |
81 int InvocationCounter::InterpreterInvocationLimit; | |
82 int InvocationCounter::InterpreterBackwardBranchLimit; | |
83 int InvocationCounter::InterpreterProfileLimit; | |
84 | |
85 | |
86 const char* InvocationCounter::state_as_string(State state) { | |
87 switch (state) { | |
88 case wait_for_nothing : return "wait_for_nothing"; | |
89 case wait_for_compile : return "wait_for_compile"; | |
90 } | |
91 ShouldNotReachHere(); | |
92 return NULL; | |
93 } | |
94 | |
95 const char* InvocationCounter::state_as_short_string(State state) { | |
96 switch (state) { | |
97 case wait_for_nothing : return "not comp."; | |
98 case wait_for_compile : return "compileable"; | |
99 } | |
100 ShouldNotReachHere(); | |
101 return NULL; | |
102 } | |
103 | |
104 | |
105 static address do_nothing(methodHandle method, TRAPS) { | |
106 // dummy action for inactive invocation counters | |
107 method->invocation_counter()->set_carry(); | |
108 method->invocation_counter()->set_state(InvocationCounter::wait_for_nothing); | |
109 return NULL; | |
110 } | |
111 | |
112 | |
113 static address do_decay(methodHandle method, TRAPS) { | |
114 // decay invocation counters so compilation gets delayed | |
115 method->invocation_counter()->decay(); | |
116 return NULL; | |
117 } | |
118 | |
119 | |
120 void InvocationCounter::def(State state, int init, Action action) { | |
121 assert(0 <= state && state < number_of_states, "illegal state"); | |
122 assert(0 <= init && init < count_limit, "initial value out of range"); | |
123 _init [state] = init; | |
124 _action[state] = action; | |
125 } | |
126 | |
127 address dummy_invocation_counter_overflow(methodHandle m, TRAPS) { | |
128 ShouldNotReachHere(); | |
129 return NULL; | |
130 } | |
131 | |
132 void InvocationCounter::reinitialize(bool delay_overflow) { | |
133 // define states | |
134 guarantee((int)number_of_states <= (int)state_limit, "adjust number_of_state_bits"); | |
135 def(wait_for_nothing, 0, do_nothing); | |
136 if (delay_overflow) { | |
137 def(wait_for_compile, 0, do_decay); | |
138 } else { | |
139 def(wait_for_compile, 0, dummy_invocation_counter_overflow); | |
140 } | |
141 | |
142 InterpreterInvocationLimit = CompileThreshold << number_of_noncount_bits; | |
143 InterpreterProfileLimit = ((CompileThreshold * InterpreterProfilePercentage) / 100)<< number_of_noncount_bits; | |
144 | |
145 // When methodData is collected, the backward branch limit is compared against a | |
146 // methodData counter, rather than an InvocationCounter. In the former case, we | |
147 // don't need the shift by number_of_noncount_bits, but we do need to adjust | |
148 // the factor by which we scale the threshold. | |
149 if (ProfileInterpreter) { | |
150 InterpreterBackwardBranchLimit = (CompileThreshold * (OnStackReplacePercentage - InterpreterProfilePercentage)) / 100; | |
151 } else { | |
152 InterpreterBackwardBranchLimit = ((CompileThreshold * OnStackReplacePercentage) / 100) << number_of_noncount_bits; | |
153 } | |
154 | |
155 assert(0 <= InterpreterBackwardBranchLimit, | |
156 "OSR threshold should be non-negative"); | |
157 assert(0 <= InterpreterProfileLimit && | |
158 InterpreterProfileLimit <= InterpreterInvocationLimit, | |
159 "profile threshold should be less than the compilation threshold " | |
160 "and non-negative"); | |
161 } | |
162 | |
163 void invocationCounter_init() { | |
164 InvocationCounter::reinitialize(DelayCompilationDuringStartup); | |
165 } |