Fri, 22 Oct 2010 15:59:34 -0400
6988353: refactor contended sync subsystem
Summary: reduce complexity by factoring synchronizer.cpp
Reviewed-by: dholmes, never, coleenp
iveresov@2138 | 1 | /* |
iveresov@2138 | 2 | * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. |
iveresov@2138 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
iveresov@2138 | 4 | * |
iveresov@2138 | 5 | * This code is free software; you can redistribute it and/or modify it |
iveresov@2138 | 6 | * under the terms of the GNU General Public License version 2 only, as |
iveresov@2138 | 7 | * published by the Free Software Foundation. |
iveresov@2138 | 8 | * |
iveresov@2138 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
iveresov@2138 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
iveresov@2138 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
iveresov@2138 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
iveresov@2138 | 13 | * accompanied this code). |
iveresov@2138 | 14 | * |
iveresov@2138 | 15 | * You should have received a copy of the GNU General Public License version |
iveresov@2138 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
iveresov@2138 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
iveresov@2138 | 18 | * |
iveresov@2138 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
iveresov@2138 | 20 | * or visit www.oracle.com if you need additional information or have any |
iveresov@2138 | 21 | * questions. |
iveresov@2138 | 22 | * |
iveresov@2138 | 23 | */ |
iveresov@2138 | 24 | |
iveresov@2138 | 25 | # include "incls/_precompiled.incl" |
iveresov@2138 | 26 | # include "incls/_simpleThresholdPolicy.cpp.incl" |
iveresov@2138 | 27 | |
iveresov@2138 | 28 | // Print an event. |
iveresov@2138 | 29 | void SimpleThresholdPolicy::print_event(EventType type, methodHandle mh, methodHandle imh, |
iveresov@2138 | 30 | int bci, CompLevel level) { |
iveresov@2138 | 31 | bool inlinee_event = mh() != imh(); |
iveresov@2138 | 32 | |
iveresov@2138 | 33 | ttyLocker tty_lock; |
iveresov@2138 | 34 | tty->print("%lf: [", os::elapsedTime()); |
iveresov@2138 | 35 | |
iveresov@2138 | 36 | int invocation_count = mh->invocation_count(); |
iveresov@2138 | 37 | int backedge_count = mh->backedge_count(); |
iveresov@2138 | 38 | switch(type) { |
iveresov@2138 | 39 | case CALL: |
iveresov@2138 | 40 | tty->print("call"); |
iveresov@2138 | 41 | break; |
iveresov@2138 | 42 | case LOOP: |
iveresov@2138 | 43 | tty->print("loop"); |
iveresov@2138 | 44 | break; |
iveresov@2138 | 45 | case COMPILE: |
iveresov@2138 | 46 | tty->print("compile"); |
iveresov@2138 | 47 | } |
iveresov@2138 | 48 | |
iveresov@2138 | 49 | tty->print(" level: %d ", level); |
iveresov@2138 | 50 | |
iveresov@2138 | 51 | ResourceMark rm; |
iveresov@2138 | 52 | char *method_name = mh->name_and_sig_as_C_string(); |
iveresov@2138 | 53 | tty->print("[%s", method_name); |
iveresov@2138 | 54 | // We can have an inlinee, although currently we don't generate any notifications for the inlined methods. |
iveresov@2138 | 55 | if (inlinee_event) { |
iveresov@2138 | 56 | char *inlinee_name = imh->name_and_sig_as_C_string(); |
iveresov@2138 | 57 | tty->print(" [%s]] ", inlinee_name); |
iveresov@2138 | 58 | } |
iveresov@2138 | 59 | else tty->print("] "); |
iveresov@2138 | 60 | tty->print("@%d queues: %d,%d", bci, CompileBroker::queue_size(CompLevel_full_profile), |
iveresov@2138 | 61 | CompileBroker::queue_size(CompLevel_full_optimization)); |
iveresov@2138 | 62 | |
iveresov@2138 | 63 | print_specific(type, mh, imh, bci, level); |
iveresov@2138 | 64 | |
iveresov@2138 | 65 | if (type != COMPILE) { |
iveresov@2138 | 66 | methodDataHandle mdh = mh->method_data(); |
iveresov@2138 | 67 | int mdo_invocations = 0, mdo_backedges = 0; |
iveresov@2138 | 68 | if (mdh() != NULL) { |
iveresov@2138 | 69 | mdo_invocations = mdh->invocation_count(); |
iveresov@2138 | 70 | mdo_backedges = mdh->backedge_count(); |
iveresov@2138 | 71 | } |
iveresov@2138 | 72 | tty->print(" total: %d,%d mdo: %d,%d", |
iveresov@2138 | 73 | invocation_count, backedge_count, |
iveresov@2138 | 74 | mdo_invocations, mdo_backedges); |
iveresov@2138 | 75 | tty->print(" max levels: %d,%d", |
iveresov@2138 | 76 | mh->highest_comp_level(), mh->highest_osr_comp_level()); |
iveresov@2138 | 77 | if (inlinee_event) { |
iveresov@2138 | 78 | tty->print(" inlinee max levels: %d,%d", imh->highest_comp_level(), imh->highest_osr_comp_level()); |
iveresov@2138 | 79 | } |
iveresov@2138 | 80 | tty->print(" compilable: "); |
iveresov@2138 | 81 | bool need_comma = false; |
iveresov@2138 | 82 | if (!mh->is_not_compilable(CompLevel_full_profile)) { |
iveresov@2138 | 83 | tty->print("c1"); |
iveresov@2138 | 84 | need_comma = true; |
iveresov@2138 | 85 | } |
iveresov@2138 | 86 | if (!mh->is_not_compilable(CompLevel_full_optimization)) { |
iveresov@2138 | 87 | if (need_comma) tty->print(", "); |
iveresov@2138 | 88 | tty->print("c2"); |
iveresov@2138 | 89 | need_comma = true; |
iveresov@2138 | 90 | } |
iveresov@2138 | 91 | if (!mh->is_not_osr_compilable()) { |
iveresov@2138 | 92 | if (need_comma) tty->print(", "); |
iveresov@2138 | 93 | tty->print("osr"); |
iveresov@2138 | 94 | } |
iveresov@2138 | 95 | tty->print(" status:"); |
iveresov@2138 | 96 | if (mh->queued_for_compilation()) { |
iveresov@2138 | 97 | tty->print(" in queue"); |
iveresov@2138 | 98 | } else tty->print(" idle"); |
iveresov@2138 | 99 | } |
iveresov@2138 | 100 | tty->print_cr("]"); |
iveresov@2138 | 101 | } |
iveresov@2138 | 102 | |
iveresov@2138 | 103 | void SimpleThresholdPolicy::initialize() { |
iveresov@2138 | 104 | if (FLAG_IS_DEFAULT(CICompilerCount)) { |
iveresov@2138 | 105 | FLAG_SET_DEFAULT(CICompilerCount, 3); |
iveresov@2138 | 106 | } |
iveresov@2138 | 107 | int count = CICompilerCount; |
iveresov@2138 | 108 | if (CICompilerCountPerCPU) { |
iveresov@2138 | 109 | count = MAX2(log2_intptr(os::active_processor_count()), 1) * 3 / 2; |
iveresov@2138 | 110 | } |
iveresov@2138 | 111 | set_c1_count(MAX2(count / 3, 1)); |
iveresov@2138 | 112 | set_c2_count(MAX2(count - count / 3, 1)); |
iveresov@2138 | 113 | } |
iveresov@2138 | 114 | |
iveresov@2138 | 115 | void SimpleThresholdPolicy::set_carry_if_necessary(InvocationCounter *counter) { |
iveresov@2138 | 116 | if (!counter->carry() && counter->count() > InvocationCounter::count_limit / 2) { |
iveresov@2138 | 117 | counter->set_carry_flag(); |
iveresov@2138 | 118 | } |
iveresov@2138 | 119 | } |
iveresov@2138 | 120 | |
iveresov@2138 | 121 | // Set carry flags on the counters if necessary |
iveresov@2138 | 122 | void SimpleThresholdPolicy::handle_counter_overflow(methodOop method) { |
iveresov@2138 | 123 | set_carry_if_necessary(method->invocation_counter()); |
iveresov@2138 | 124 | set_carry_if_necessary(method->backedge_counter()); |
iveresov@2138 | 125 | methodDataOop mdo = method->method_data(); |
iveresov@2138 | 126 | if (mdo != NULL) { |
iveresov@2138 | 127 | set_carry_if_necessary(mdo->invocation_counter()); |
iveresov@2138 | 128 | set_carry_if_necessary(mdo->backedge_counter()); |
iveresov@2138 | 129 | } |
iveresov@2138 | 130 | } |
iveresov@2138 | 131 | |
iveresov@2138 | 132 | // Called with the queue locked and with at least one element |
iveresov@2138 | 133 | CompileTask* SimpleThresholdPolicy::select_task(CompileQueue* compile_queue) { |
iveresov@2138 | 134 | return compile_queue->first(); |
iveresov@2138 | 135 | } |
iveresov@2138 | 136 | |
iveresov@2138 | 137 | nmethod* SimpleThresholdPolicy::event(methodHandle method, methodHandle inlinee, |
iveresov@2138 | 138 | int branch_bci, int bci, CompLevel comp_level, TRAPS) { |
iveresov@2138 | 139 | if (comp_level == CompLevel_none && |
iveresov@2138 | 140 | JvmtiExport::can_post_interpreter_events()) { |
iveresov@2138 | 141 | assert(THREAD->is_Java_thread(), "Should be java thread"); |
iveresov@2138 | 142 | if (((JavaThread*)THREAD)->is_interp_only_mode()) { |
iveresov@2138 | 143 | return NULL; |
iveresov@2138 | 144 | } |
iveresov@2138 | 145 | } |
iveresov@2138 | 146 | nmethod *osr_nm = NULL; |
iveresov@2138 | 147 | |
iveresov@2138 | 148 | handle_counter_overflow(method()); |
iveresov@2138 | 149 | if (method() != inlinee()) { |
iveresov@2138 | 150 | handle_counter_overflow(inlinee()); |
iveresov@2138 | 151 | } |
iveresov@2138 | 152 | |
iveresov@2138 | 153 | if (PrintTieredEvents) { |
iveresov@2138 | 154 | print_event(bci == InvocationEntryBci ? CALL : LOOP, method, inlinee, bci, comp_level); |
iveresov@2138 | 155 | } |
iveresov@2138 | 156 | |
iveresov@2138 | 157 | if (bci == InvocationEntryBci) { |
iveresov@2138 | 158 | method_invocation_event(method, inlinee, comp_level, THREAD); |
iveresov@2138 | 159 | } else { |
iveresov@2138 | 160 | method_back_branch_event(method, inlinee, bci, comp_level, THREAD); |
iveresov@2138 | 161 | int highest_level = method->highest_osr_comp_level(); |
iveresov@2138 | 162 | if (highest_level > comp_level) { |
iveresov@2138 | 163 | osr_nm = method->lookup_osr_nmethod_for(bci, highest_level, false); |
iveresov@2138 | 164 | } |
iveresov@2138 | 165 | } |
iveresov@2138 | 166 | return osr_nm; |
iveresov@2138 | 167 | } |
iveresov@2138 | 168 | |
iveresov@2138 | 169 | // Check if the method can be compiled, change level if necessary |
iveresov@2138 | 170 | void SimpleThresholdPolicy::compile(methodHandle mh, int bci, CompLevel level, TRAPS) { |
iveresov@2138 | 171 | // Take the given ceiling into the account. |
iveresov@2138 | 172 | // NOTE: You can set it to 1 to get a pure C1 version. |
iveresov@2138 | 173 | if ((CompLevel)TieredStopAtLevel < level) { |
iveresov@2138 | 174 | level = (CompLevel)TieredStopAtLevel; |
iveresov@2138 | 175 | } |
iveresov@2138 | 176 | if (level == CompLevel_none) { |
iveresov@2138 | 177 | return; |
iveresov@2138 | 178 | } |
iveresov@2138 | 179 | // Check if the method can be compiled, if not - try different levels. |
iveresov@2138 | 180 | if (!can_be_compiled(mh, level)) { |
iveresov@2138 | 181 | if (level < CompLevel_full_optimization && can_be_compiled(mh, CompLevel_full_optimization)) { |
iveresov@2138 | 182 | compile(mh, bci, CompLevel_full_optimization, THREAD); |
iveresov@2138 | 183 | } |
iveresov@2138 | 184 | if (level == CompLevel_full_optimization && can_be_compiled(mh, CompLevel_simple)) { |
iveresov@2138 | 185 | compile(mh, bci, CompLevel_simple, THREAD); |
iveresov@2138 | 186 | } |
iveresov@2138 | 187 | return; |
iveresov@2138 | 188 | } |
iveresov@2138 | 189 | if (bci != InvocationEntryBci && mh->is_not_osr_compilable()) { |
iveresov@2138 | 190 | return; |
iveresov@2138 | 191 | } |
iveresov@2138 | 192 | if (PrintTieredEvents) { |
iveresov@2138 | 193 | print_event(COMPILE, mh, mh, bci, level); |
iveresov@2138 | 194 | } |
iveresov@2138 | 195 | if (!CompileBroker::compilation_is_in_queue(mh, bci)) { |
iveresov@2138 | 196 | submit_compile(mh, bci, level, THREAD); |
iveresov@2138 | 197 | } |
iveresov@2138 | 198 | } |
iveresov@2138 | 199 | |
iveresov@2138 | 200 | // Tell the broker to compile the method |
iveresov@2138 | 201 | void SimpleThresholdPolicy::submit_compile(methodHandle mh, int bci, CompLevel level, TRAPS) { |
iveresov@2138 | 202 | int hot_count = (bci == InvocationEntryBci) ? mh->invocation_count() : mh->backedge_count(); |
iveresov@2138 | 203 | CompileBroker::compile_method(mh, bci, level, mh, hot_count, "tiered", THREAD); |
iveresov@2138 | 204 | } |
iveresov@2138 | 205 | |
iveresov@2138 | 206 | // Call and loop predicates determine whether a transition to a higher |
iveresov@2138 | 207 | // compilation level should be performed (pointers to predicate functions |
iveresov@2138 | 208 | // are passed to common() transition function). |
iveresov@2138 | 209 | bool SimpleThresholdPolicy::loop_predicate(int i, int b, CompLevel cur_level) { |
iveresov@2138 | 210 | switch(cur_level) { |
iveresov@2138 | 211 | case CompLevel_none: |
iveresov@2138 | 212 | case CompLevel_limited_profile: { |
iveresov@2138 | 213 | return loop_predicate_helper<CompLevel_none>(i, b, 1.0); |
iveresov@2138 | 214 | } |
iveresov@2138 | 215 | case CompLevel_full_profile: { |
iveresov@2138 | 216 | return loop_predicate_helper<CompLevel_full_profile>(i, b, 1.0); |
iveresov@2138 | 217 | } |
iveresov@2138 | 218 | default: |
iveresov@2138 | 219 | return true; |
iveresov@2138 | 220 | } |
iveresov@2138 | 221 | } |
iveresov@2138 | 222 | |
iveresov@2138 | 223 | bool SimpleThresholdPolicy::call_predicate(int i, int b, CompLevel cur_level) { |
iveresov@2138 | 224 | switch(cur_level) { |
iveresov@2138 | 225 | case CompLevel_none: |
iveresov@2138 | 226 | case CompLevel_limited_profile: { |
iveresov@2138 | 227 | return call_predicate_helper<CompLevel_none>(i, b, 1.0); |
iveresov@2138 | 228 | } |
iveresov@2138 | 229 | case CompLevel_full_profile: { |
iveresov@2138 | 230 | return call_predicate_helper<CompLevel_full_profile>(i, b, 1.0); |
iveresov@2138 | 231 | } |
iveresov@2138 | 232 | default: |
iveresov@2138 | 233 | return true; |
iveresov@2138 | 234 | } |
iveresov@2138 | 235 | } |
iveresov@2138 | 236 | |
iveresov@2138 | 237 | // Determine is a method is mature. |
iveresov@2138 | 238 | bool SimpleThresholdPolicy::is_mature(methodOop method) { |
iveresov@2138 | 239 | if (is_trivial(method)) return true; |
iveresov@2138 | 240 | methodDataOop mdo = method->method_data(); |
iveresov@2138 | 241 | if (mdo != NULL) { |
iveresov@2138 | 242 | int i = mdo->invocation_count(); |
iveresov@2138 | 243 | int b = mdo->backedge_count(); |
iveresov@2138 | 244 | double k = ProfileMaturityPercentage / 100.0; |
iveresov@2138 | 245 | return call_predicate_helper<CompLevel_full_profile>(i, b, k) || |
iveresov@2138 | 246 | loop_predicate_helper<CompLevel_full_profile>(i, b, k); |
iveresov@2138 | 247 | } |
iveresov@2138 | 248 | return false; |
iveresov@2138 | 249 | } |
iveresov@2138 | 250 | |
iveresov@2138 | 251 | // Common transition function. Given a predicate determines if a method should transition to another level. |
iveresov@2138 | 252 | CompLevel SimpleThresholdPolicy::common(Predicate p, methodOop method, CompLevel cur_level) { |
iveresov@2138 | 253 | CompLevel next_level = cur_level; |
iveresov@2138 | 254 | int i = method->invocation_count(); |
iveresov@2138 | 255 | int b = method->backedge_count(); |
iveresov@2138 | 256 | |
iveresov@2138 | 257 | switch(cur_level) { |
iveresov@2138 | 258 | case CompLevel_none: |
iveresov@2138 | 259 | { |
iveresov@2138 | 260 | methodDataOop mdo = method->method_data(); |
iveresov@2138 | 261 | if (mdo != NULL) { |
iveresov@2138 | 262 | int mdo_i = mdo->invocation_count(); |
iveresov@2138 | 263 | int mdo_b = mdo->backedge_count(); |
iveresov@2138 | 264 | // If we were at full profile level, would we switch to full opt? |
iveresov@2138 | 265 | if ((this->*p)(mdo_i, mdo_b, CompLevel_full_profile)) { |
iveresov@2138 | 266 | next_level = CompLevel_full_optimization; |
iveresov@2138 | 267 | } |
iveresov@2138 | 268 | } |
iveresov@2138 | 269 | } |
iveresov@2138 | 270 | if (next_level == cur_level && (this->*p)(i, b, cur_level)) { |
iveresov@2138 | 271 | if (is_trivial(method)) { |
iveresov@2138 | 272 | next_level = CompLevel_simple; |
iveresov@2138 | 273 | } else { |
iveresov@2138 | 274 | next_level = CompLevel_full_profile; |
iveresov@2138 | 275 | } |
iveresov@2138 | 276 | } |
iveresov@2138 | 277 | break; |
iveresov@2138 | 278 | case CompLevel_limited_profile: |
iveresov@2138 | 279 | case CompLevel_full_profile: |
iveresov@2138 | 280 | if (is_trivial(method)) { |
iveresov@2138 | 281 | next_level = CompLevel_simple; |
iveresov@2138 | 282 | } else { |
iveresov@2138 | 283 | methodDataOop mdo = method->method_data(); |
iveresov@2138 | 284 | guarantee(mdo != NULL, "MDO should always exist"); |
iveresov@2138 | 285 | if (mdo->would_profile()) { |
iveresov@2138 | 286 | int mdo_i = mdo->invocation_count(); |
iveresov@2138 | 287 | int mdo_b = mdo->backedge_count(); |
iveresov@2138 | 288 | if ((this->*p)(mdo_i, mdo_b, cur_level)) { |
iveresov@2138 | 289 | next_level = CompLevel_full_optimization; |
iveresov@2138 | 290 | } |
iveresov@2138 | 291 | } else { |
iveresov@2138 | 292 | next_level = CompLevel_full_optimization; |
iveresov@2138 | 293 | } |
iveresov@2138 | 294 | } |
iveresov@2138 | 295 | break; |
iveresov@2138 | 296 | } |
iveresov@2138 | 297 | return next_level; |
iveresov@2138 | 298 | } |
iveresov@2138 | 299 | |
iveresov@2138 | 300 | // Determine if a method should be compiled with a normal entry point at a different level. |
iveresov@2138 | 301 | CompLevel SimpleThresholdPolicy::call_event(methodOop method, CompLevel cur_level) { |
iveresov@2138 | 302 | CompLevel highest_level = (CompLevel)method->highest_comp_level(); |
iveresov@2138 | 303 | if (cur_level == CompLevel_none && highest_level > cur_level) { |
iveresov@2138 | 304 | // TODO: We may want to try to do more extensive reprofiling in this case. |
iveresov@2138 | 305 | return highest_level; |
iveresov@2138 | 306 | } |
iveresov@2138 | 307 | |
iveresov@2138 | 308 | CompLevel osr_level = (CompLevel) method->highest_osr_comp_level(); |
iveresov@2138 | 309 | CompLevel next_level = common(&SimpleThresholdPolicy::call_predicate, method, cur_level); |
iveresov@2138 | 310 | |
iveresov@2138 | 311 | // If OSR method level is greater than the regular method level, the levels should be |
iveresov@2138 | 312 | // equalized by raising the regular method level in order to avoid OSRs during each |
iveresov@2138 | 313 | // invocation of the method. |
iveresov@2138 | 314 | if (osr_level == CompLevel_full_optimization && cur_level == CompLevel_full_profile) { |
iveresov@2138 | 315 | methodDataOop mdo = method->method_data(); |
iveresov@2138 | 316 | guarantee(mdo != NULL, "MDO should not be NULL"); |
iveresov@2138 | 317 | if (mdo->invocation_count() >= 1) { |
iveresov@2138 | 318 | next_level = CompLevel_full_optimization; |
iveresov@2138 | 319 | } |
iveresov@2138 | 320 | } else { |
iveresov@2138 | 321 | next_level = MAX2(osr_level, next_level); |
iveresov@2138 | 322 | } |
iveresov@2138 | 323 | |
iveresov@2138 | 324 | return next_level; |
iveresov@2138 | 325 | } |
iveresov@2138 | 326 | |
iveresov@2138 | 327 | // Determine if we should do an OSR compilation of a given method. |
iveresov@2138 | 328 | CompLevel SimpleThresholdPolicy::loop_event(methodOop method, CompLevel cur_level) { |
iveresov@2138 | 329 | if (cur_level == CompLevel_none) { |
iveresov@2138 | 330 | // If there is a live OSR method that means that we deopted to the interpreter |
iveresov@2138 | 331 | // for the transition. |
iveresov@2138 | 332 | CompLevel osr_level = (CompLevel)method->highest_osr_comp_level(); |
iveresov@2138 | 333 | if (osr_level > CompLevel_none) { |
iveresov@2138 | 334 | return osr_level; |
iveresov@2138 | 335 | } |
iveresov@2138 | 336 | } |
iveresov@2138 | 337 | return common(&SimpleThresholdPolicy::loop_predicate, method, cur_level); |
iveresov@2138 | 338 | } |
iveresov@2138 | 339 | |
iveresov@2138 | 340 | |
iveresov@2138 | 341 | // Handle the invocation event. |
iveresov@2138 | 342 | void SimpleThresholdPolicy::method_invocation_event(methodHandle mh, methodHandle imh, |
iveresov@2138 | 343 | CompLevel level, TRAPS) { |
iveresov@2138 | 344 | if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh, InvocationEntryBci)) { |
iveresov@2138 | 345 | CompLevel next_level = call_event(mh(), level); |
iveresov@2138 | 346 | if (next_level != level) { |
iveresov@2138 | 347 | compile(mh, InvocationEntryBci, next_level, THREAD); |
iveresov@2138 | 348 | } |
iveresov@2138 | 349 | } |
iveresov@2138 | 350 | } |
iveresov@2138 | 351 | |
iveresov@2138 | 352 | // Handle the back branch event. Notice that we can compile the method |
iveresov@2138 | 353 | // with a regular entry from here. |
iveresov@2138 | 354 | void SimpleThresholdPolicy::method_back_branch_event(methodHandle mh, methodHandle imh, |
iveresov@2138 | 355 | int bci, CompLevel level, TRAPS) { |
iveresov@2138 | 356 | // If the method is already compiling, quickly bail out. |
iveresov@2138 | 357 | if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh, bci)) { |
iveresov@2138 | 358 | // Use loop event as an opportinity to also check there's been |
iveresov@2138 | 359 | // enough calls. |
iveresov@2138 | 360 | CompLevel cur_level = comp_level(mh()); |
iveresov@2138 | 361 | CompLevel next_level = call_event(mh(), cur_level); |
iveresov@2138 | 362 | CompLevel next_osr_level = loop_event(mh(), level); |
iveresov@2138 | 363 | |
iveresov@2138 | 364 | next_level = MAX2(next_level, |
iveresov@2138 | 365 | next_osr_level < CompLevel_full_optimization ? next_osr_level : cur_level); |
iveresov@2138 | 366 | bool is_compiling = false; |
iveresov@2138 | 367 | if (next_level != cur_level) { |
iveresov@2138 | 368 | compile(mh, InvocationEntryBci, next_level, THREAD); |
iveresov@2138 | 369 | is_compiling = true; |
iveresov@2138 | 370 | } |
iveresov@2138 | 371 | |
iveresov@2138 | 372 | // Do the OSR version |
iveresov@2138 | 373 | if (!is_compiling && next_osr_level != level) { |
iveresov@2138 | 374 | compile(mh, bci, next_osr_level, THREAD); |
iveresov@2138 | 375 | } |
iveresov@2138 | 376 | } |
iveresov@2138 | 377 | } |