Mercurial > hg > truffle

comparison src/share/vm/interpreter/invocationCounter.cpp @ 0:a61af66fc99e jdk7-b24

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Initial load
author duke
date Sat, 01 Dec 2007 00:00:00 +0000
parents
children c664a0794f85
comparison
equal deleted inserted replaced
-1:000000000000 0:a61af66fc99e
1 /*
2 * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved.
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 *
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
20 * CA 95054 USA or visit www.sun.com if you need additional information or
21 * have any questions.
22 *
23 */
24
25 # include "incls/_precompiled.incl"
26 # include "incls/_invocationCounter.cpp.incl"
27
28
29 // Implementation of InvocationCounter
30
31 void InvocationCounter::init() {
32 _counter = 0; // reset all the bits, including the sticky carry
33 reset();
34 }
35
36 void InvocationCounter::reset() {
37 // Only reset the state and don't make the method look like it's never
38 // been executed
39 set_state(wait_for_compile);
40 }
41
42 void InvocationCounter::set_carry() {
43 _counter |= carry_mask;
44
45 // The carry bit now indicates that this counter had achieved a very
46 // large value. Now reduce the value, so that the method can be
47 // executed many more times before re-entering the VM.
48 int old_count = count();
49 int new_count = MIN2(old_count, (int) (CompileThreshold / 2));
50 if (old_count != new_count) set(state(), new_count);
51 }
52
53
54 void InvocationCounter::set_state(State state) {
55 assert(0 <= state && state < number_of_states, "illegal state");
56 int init = _init[state];
57 // prevent from going to zero, to distinguish from never-executed methods
58 if (init == 0 && count() > 0) init = 1;
59 int carry = (_counter & carry_mask); // the carry bit is sticky
60 _counter = (init << number_of_noncount_bits) | carry | state;
61 }
62
63
64 void InvocationCounter::print() {
65 tty->print_cr("invocation count: up = %d, limit = %d, carry = %s, state = %s",
66 count(), limit(),
67 carry() ? "true" : "false",
68 state_as_string(state()));
69 }
70
71 void InvocationCounter::print_short() {
72 tty->print(" [%d%s;%s]", count(), carry()?"+carry":"", state_as_short_string(state()));
73 }
74
75 // Initialization
76
77 int InvocationCounter::_init [InvocationCounter::number_of_states];
78 InvocationCounter::Action InvocationCounter::_action[InvocationCounter::number_of_states];
79 int InvocationCounter::InterpreterInvocationLimit;
80 int InvocationCounter::InterpreterBackwardBranchLimit;
81 int InvocationCounter::InterpreterProfileLimit;
82
83 // Tier1 limits
84 int InvocationCounter::Tier1InvocationLimit;
85 int InvocationCounter::Tier1BackEdgeLimit;
86
87
88
89 const char* InvocationCounter::state_as_string(State state) {
90 switch (state) {
91 case wait_for_nothing : return "wait_for_nothing";
92 case wait_for_compile : return "wait_for_compile";
93 }
94 ShouldNotReachHere();
95 return NULL;
96 }
97
98 const char* InvocationCounter::state_as_short_string(State state) {
99 switch (state) {
100 case wait_for_nothing : return "not comp.";
101 case wait_for_compile : return "compileable";
102 }
103 ShouldNotReachHere();
104 return NULL;
105 }
106
107
108 static address do_nothing(methodHandle method, TRAPS) {
109 // dummy action for inactive invocation counters
110 method->invocation_counter()->set_carry();
111 method->invocation_counter()->set_state(InvocationCounter::wait_for_nothing);
112 return NULL;
113 }
114
115
116 static address do_decay(methodHandle method, TRAPS) {
117 // decay invocation counters so compilation gets delayed
118 method->invocation_counter()->decay();
119 return NULL;
120 }
121
122
123 void InvocationCounter::def(State state, int init, Action action) {
124 assert(0 <= state && state < number_of_states, "illegal state");
125 assert(0 <= init && init < count_limit, "initial value out of range");
126 _init [state] = init;
127 _action[state] = action;
128 }
129
130 address dummy_invocation_counter_overflow(methodHandle m, TRAPS) {
131 ShouldNotReachHere();
132 return NULL;
133 }
134
135 void InvocationCounter::reinitialize(bool delay_overflow) {
136 // define states
137 guarantee((int)number_of_states <= (int)state_limit, "adjust number_of_state_bits");
138 def(wait_for_nothing, 0, do_nothing);
139 if (delay_overflow) {
140 def(wait_for_compile, 0, do_decay);
141 } else {
142 def(wait_for_compile, 0, dummy_invocation_counter_overflow);
143 }
144
145 InterpreterInvocationLimit = CompileThreshold << number_of_noncount_bits;
146 InterpreterProfileLimit = ((CompileThreshold * InterpreterProfilePercentage) / 100)<< number_of_noncount_bits;
147 Tier1InvocationLimit = Tier2CompileThreshold << number_of_noncount_bits;
148 Tier1BackEdgeLimit = Tier2BackEdgeThreshold << number_of_noncount_bits;
149
150 // When methodData is collected, the backward branch limit is compared against a
151 // methodData counter, rather than an InvocationCounter. In the former case, we
152 // don't need the shift by number_of_noncount_bits, but we do need to adjust
153 // the factor by which we scale the threshold.
154 if (ProfileInterpreter) {
155 InterpreterBackwardBranchLimit = (CompileThreshold * (OnStackReplacePercentage - InterpreterProfilePercentage)) / 100;
156 } else {
157 InterpreterBackwardBranchLimit = ((CompileThreshold * OnStackReplacePercentage) / 100) << number_of_noncount_bits;
158 }
159
160 assert(0 <= InterpreterBackwardBranchLimit,
161 "OSR threshold should be non-negative");
162 assert(0 <= InterpreterProfileLimit &&
163 InterpreterProfileLimit <= InterpreterInvocationLimit,
164 "profile threshold should be less than the compilation threshold "
165 "and non-negative");
166 }
167
168 void invocationCounter_init() {
169 InvocationCounter::reinitialize(DelayCompilationDuringStartup);
170 }