iveresov@2138: /* iveresov@2138: * Copyright (c) 2001, 2010, Oracle and/or its affiliates. All rights reserved. iveresov@2138: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. iveresov@2138: * iveresov@2138: * This code is free software; you can redistribute it and/or modify it iveresov@2138: * under the terms of the GNU General Public License version 2 only, as iveresov@2138: * published by the Free Software Foundation. iveresov@2138: * iveresov@2138: * This code is distributed in the hope that it will be useful, but WITHOUT iveresov@2138: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or iveresov@2138: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License iveresov@2138: * version 2 for more details (a copy is included in the LICENSE file that iveresov@2138: * accompanied this code). iveresov@2138: * iveresov@2138: * You should have received a copy of the GNU General Public License version iveresov@2138: * 2 along with this work; if not, write to the Free Software Foundation, iveresov@2138: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. iveresov@2138: * iveresov@2138: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA iveresov@2138: * or visit www.oracle.com if you need additional information or have any iveresov@2138: * questions. iveresov@2138: * iveresov@2138: */ iveresov@2138: iveresov@2138: # include "incls/_precompiled.incl" iveresov@2138: # include "incls/_simpleThresholdPolicy.cpp.incl" iveresov@2138: iveresov@2138: // Print an event. iveresov@2138: void SimpleThresholdPolicy::print_event(EventType type, methodHandle mh, methodHandle imh, iveresov@2138: int bci, CompLevel level) { iveresov@2138: bool inlinee_event = mh() != imh(); iveresov@2138: iveresov@2138: ttyLocker tty_lock; iveresov@2138: tty->print("%lf: [", os::elapsedTime()); iveresov@2138: iveresov@2138: int invocation_count = mh->invocation_count(); iveresov@2138: int backedge_count = mh->backedge_count(); iveresov@2138: switch(type) { iveresov@2138: case CALL: iveresov@2138: tty->print("call"); iveresov@2138: break; iveresov@2138: case LOOP: iveresov@2138: tty->print("loop"); iveresov@2138: break; iveresov@2138: case COMPILE: iveresov@2138: tty->print("compile"); iveresov@2138: } iveresov@2138: iveresov@2138: tty->print(" level: %d ", level); iveresov@2138: iveresov@2138: ResourceMark rm; iveresov@2138: char *method_name = mh->name_and_sig_as_C_string(); iveresov@2138: tty->print("[%s", method_name); iveresov@2138: // We can have an inlinee, although currently we don't generate any notifications for the inlined methods. iveresov@2138: if (inlinee_event) { iveresov@2138: char *inlinee_name = imh->name_and_sig_as_C_string(); iveresov@2138: tty->print(" [%s]] ", inlinee_name); iveresov@2138: } iveresov@2138: else tty->print("] "); iveresov@2138: tty->print("@%d queues: %d,%d", bci, CompileBroker::queue_size(CompLevel_full_profile), iveresov@2138: CompileBroker::queue_size(CompLevel_full_optimization)); iveresov@2138: iveresov@2138: print_specific(type, mh, imh, bci, level); iveresov@2138: iveresov@2138: if (type != COMPILE) { iveresov@2138: methodDataHandle mdh = mh->method_data(); iveresov@2138: int mdo_invocations = 0, mdo_backedges = 0; iveresov@2138: if (mdh() != NULL) { iveresov@2138: mdo_invocations = mdh->invocation_count(); iveresov@2138: mdo_backedges = mdh->backedge_count(); iveresov@2138: } iveresov@2138: tty->print(" total: %d,%d mdo: %d,%d", iveresov@2138: invocation_count, backedge_count, iveresov@2138: mdo_invocations, mdo_backedges); iveresov@2138: tty->print(" max levels: %d,%d", iveresov@2138: mh->highest_comp_level(), mh->highest_osr_comp_level()); iveresov@2138: if (inlinee_event) { iveresov@2138: tty->print(" inlinee max levels: %d,%d", imh->highest_comp_level(), imh->highest_osr_comp_level()); iveresov@2138: } iveresov@2138: tty->print(" compilable: "); iveresov@2138: bool need_comma = false; iveresov@2138: if (!mh->is_not_compilable(CompLevel_full_profile)) { iveresov@2138: tty->print("c1"); iveresov@2138: need_comma = true; iveresov@2138: } iveresov@2138: if (!mh->is_not_compilable(CompLevel_full_optimization)) { iveresov@2138: if (need_comma) tty->print(", "); iveresov@2138: tty->print("c2"); iveresov@2138: need_comma = true; iveresov@2138: } iveresov@2138: if (!mh->is_not_osr_compilable()) { iveresov@2138: if (need_comma) tty->print(", "); iveresov@2138: tty->print("osr"); iveresov@2138: } iveresov@2138: tty->print(" status:"); iveresov@2138: if (mh->queued_for_compilation()) { iveresov@2138: tty->print(" in queue"); iveresov@2138: } else tty->print(" idle"); iveresov@2138: } iveresov@2138: tty->print_cr("]"); iveresov@2138: } iveresov@2138: iveresov@2138: void SimpleThresholdPolicy::initialize() { iveresov@2138: if (FLAG_IS_DEFAULT(CICompilerCount)) { iveresov@2138: FLAG_SET_DEFAULT(CICompilerCount, 3); iveresov@2138: } iveresov@2138: int count = CICompilerCount; iveresov@2138: if (CICompilerCountPerCPU) { iveresov@2138: count = MAX2(log2_intptr(os::active_processor_count()), 1) * 3 / 2; iveresov@2138: } iveresov@2138: set_c1_count(MAX2(count / 3, 1)); iveresov@2138: set_c2_count(MAX2(count - count / 3, 1)); iveresov@2138: } iveresov@2138: iveresov@2138: void SimpleThresholdPolicy::set_carry_if_necessary(InvocationCounter *counter) { iveresov@2138: if (!counter->carry() && counter->count() > InvocationCounter::count_limit / 2) { iveresov@2138: counter->set_carry_flag(); iveresov@2138: } iveresov@2138: } iveresov@2138: iveresov@2138: // Set carry flags on the counters if necessary iveresov@2138: void SimpleThresholdPolicy::handle_counter_overflow(methodOop method) { iveresov@2138: set_carry_if_necessary(method->invocation_counter()); iveresov@2138: set_carry_if_necessary(method->backedge_counter()); iveresov@2138: methodDataOop mdo = method->method_data(); iveresov@2138: if (mdo != NULL) { iveresov@2138: set_carry_if_necessary(mdo->invocation_counter()); iveresov@2138: set_carry_if_necessary(mdo->backedge_counter()); iveresov@2138: } iveresov@2138: } iveresov@2138: iveresov@2138: // Called with the queue locked and with at least one element iveresov@2138: CompileTask* SimpleThresholdPolicy::select_task(CompileQueue* compile_queue) { iveresov@2138: return compile_queue->first(); iveresov@2138: } iveresov@2138: iveresov@2138: nmethod* SimpleThresholdPolicy::event(methodHandle method, methodHandle inlinee, iveresov@2138: int branch_bci, int bci, CompLevel comp_level, TRAPS) { iveresov@2138: if (comp_level == CompLevel_none && iveresov@2138: JvmtiExport::can_post_interpreter_events()) { iveresov@2138: assert(THREAD->is_Java_thread(), "Should be java thread"); iveresov@2138: if (((JavaThread*)THREAD)->is_interp_only_mode()) { iveresov@2138: return NULL; iveresov@2138: } iveresov@2138: } iveresov@2138: nmethod *osr_nm = NULL; iveresov@2138: iveresov@2138: handle_counter_overflow(method()); iveresov@2138: if (method() != inlinee()) { iveresov@2138: handle_counter_overflow(inlinee()); iveresov@2138: } iveresov@2138: iveresov@2138: if (PrintTieredEvents) { iveresov@2138: print_event(bci == InvocationEntryBci ? CALL : LOOP, method, inlinee, bci, comp_level); iveresov@2138: } iveresov@2138: iveresov@2138: if (bci == InvocationEntryBci) { iveresov@2138: method_invocation_event(method, inlinee, comp_level, THREAD); iveresov@2138: } else { iveresov@2138: method_back_branch_event(method, inlinee, bci, comp_level, THREAD); iveresov@2138: int highest_level = method->highest_osr_comp_level(); iveresov@2138: if (highest_level > comp_level) { iveresov@2138: osr_nm = method->lookup_osr_nmethod_for(bci, highest_level, false); iveresov@2138: } iveresov@2138: } iveresov@2138: return osr_nm; iveresov@2138: } iveresov@2138: iveresov@2138: // Check if the method can be compiled, change level if necessary iveresov@2138: void SimpleThresholdPolicy::compile(methodHandle mh, int bci, CompLevel level, TRAPS) { iveresov@2138: // Take the given ceiling into the account. iveresov@2138: // NOTE: You can set it to 1 to get a pure C1 version. iveresov@2138: if ((CompLevel)TieredStopAtLevel < level) { iveresov@2138: level = (CompLevel)TieredStopAtLevel; iveresov@2138: } iveresov@2138: if (level == CompLevel_none) { iveresov@2138: return; iveresov@2138: } iveresov@2138: // Check if the method can be compiled, if not - try different levels. iveresov@2138: if (!can_be_compiled(mh, level)) { iveresov@2138: if (level < CompLevel_full_optimization && can_be_compiled(mh, CompLevel_full_optimization)) { iveresov@2138: compile(mh, bci, CompLevel_full_optimization, THREAD); iveresov@2138: } iveresov@2138: if (level == CompLevel_full_optimization && can_be_compiled(mh, CompLevel_simple)) { iveresov@2138: compile(mh, bci, CompLevel_simple, THREAD); iveresov@2138: } iveresov@2138: return; iveresov@2138: } iveresov@2138: if (bci != InvocationEntryBci && mh->is_not_osr_compilable()) { iveresov@2138: return; iveresov@2138: } iveresov@2138: if (PrintTieredEvents) { iveresov@2138: print_event(COMPILE, mh, mh, bci, level); iveresov@2138: } iveresov@2138: if (!CompileBroker::compilation_is_in_queue(mh, bci)) { iveresov@2138: submit_compile(mh, bci, level, THREAD); iveresov@2138: } iveresov@2138: } iveresov@2138: iveresov@2138: // Tell the broker to compile the method iveresov@2138: void SimpleThresholdPolicy::submit_compile(methodHandle mh, int bci, CompLevel level, TRAPS) { iveresov@2138: int hot_count = (bci == InvocationEntryBci) ? mh->invocation_count() : mh->backedge_count(); iveresov@2138: CompileBroker::compile_method(mh, bci, level, mh, hot_count, "tiered", THREAD); iveresov@2138: } iveresov@2138: iveresov@2138: // Call and loop predicates determine whether a transition to a higher iveresov@2138: // compilation level should be performed (pointers to predicate functions iveresov@2138: // are passed to common() transition function). iveresov@2138: bool SimpleThresholdPolicy::loop_predicate(int i, int b, CompLevel cur_level) { iveresov@2138: switch(cur_level) { iveresov@2138: case CompLevel_none: iveresov@2138: case CompLevel_limited_profile: { iveresov@2138: return loop_predicate_helper(i, b, 1.0); iveresov@2138: } iveresov@2138: case CompLevel_full_profile: { iveresov@2138: return loop_predicate_helper(i, b, 1.0); iveresov@2138: } iveresov@2138: default: iveresov@2138: return true; iveresov@2138: } iveresov@2138: } iveresov@2138: iveresov@2138: bool SimpleThresholdPolicy::call_predicate(int i, int b, CompLevel cur_level) { iveresov@2138: switch(cur_level) { iveresov@2138: case CompLevel_none: iveresov@2138: case CompLevel_limited_profile: { iveresov@2138: return call_predicate_helper(i, b, 1.0); iveresov@2138: } iveresov@2138: case CompLevel_full_profile: { iveresov@2138: return call_predicate_helper(i, b, 1.0); iveresov@2138: } iveresov@2138: default: iveresov@2138: return true; iveresov@2138: } iveresov@2138: } iveresov@2138: iveresov@2138: // Determine is a method is mature. iveresov@2138: bool SimpleThresholdPolicy::is_mature(methodOop method) { iveresov@2138: if (is_trivial(method)) return true; iveresov@2138: methodDataOop mdo = method->method_data(); iveresov@2138: if (mdo != NULL) { iveresov@2138: int i = mdo->invocation_count(); iveresov@2138: int b = mdo->backedge_count(); iveresov@2138: double k = ProfileMaturityPercentage / 100.0; iveresov@2138: return call_predicate_helper(i, b, k) || iveresov@2138: loop_predicate_helper(i, b, k); iveresov@2138: } iveresov@2138: return false; iveresov@2138: } iveresov@2138: iveresov@2138: // Common transition function. Given a predicate determines if a method should transition to another level. iveresov@2138: CompLevel SimpleThresholdPolicy::common(Predicate p, methodOop method, CompLevel cur_level) { iveresov@2138: CompLevel next_level = cur_level; iveresov@2138: int i = method->invocation_count(); iveresov@2138: int b = method->backedge_count(); iveresov@2138: iveresov@2138: switch(cur_level) { iveresov@2138: case CompLevel_none: iveresov@2138: { iveresov@2138: methodDataOop mdo = method->method_data(); iveresov@2138: if (mdo != NULL) { iveresov@2138: int mdo_i = mdo->invocation_count(); iveresov@2138: int mdo_b = mdo->backedge_count(); iveresov@2138: // If we were at full profile level, would we switch to full opt? iveresov@2138: if ((this->*p)(mdo_i, mdo_b, CompLevel_full_profile)) { iveresov@2138: next_level = CompLevel_full_optimization; iveresov@2138: } iveresov@2138: } iveresov@2138: } iveresov@2138: if (next_level == cur_level && (this->*p)(i, b, cur_level)) { iveresov@2138: if (is_trivial(method)) { iveresov@2138: next_level = CompLevel_simple; iveresov@2138: } else { iveresov@2138: next_level = CompLevel_full_profile; iveresov@2138: } iveresov@2138: } iveresov@2138: break; iveresov@2138: case CompLevel_limited_profile: iveresov@2138: case CompLevel_full_profile: iveresov@2138: if (is_trivial(method)) { iveresov@2138: next_level = CompLevel_simple; iveresov@2138: } else { iveresov@2138: methodDataOop mdo = method->method_data(); iveresov@2138: guarantee(mdo != NULL, "MDO should always exist"); iveresov@2138: if (mdo->would_profile()) { iveresov@2138: int mdo_i = mdo->invocation_count(); iveresov@2138: int mdo_b = mdo->backedge_count(); iveresov@2138: if ((this->*p)(mdo_i, mdo_b, cur_level)) { iveresov@2138: next_level = CompLevel_full_optimization; iveresov@2138: } iveresov@2138: } else { iveresov@2138: next_level = CompLevel_full_optimization; iveresov@2138: } iveresov@2138: } iveresov@2138: break; iveresov@2138: } iveresov@2138: return next_level; iveresov@2138: } iveresov@2138: iveresov@2138: // Determine if a method should be compiled with a normal entry point at a different level. iveresov@2138: CompLevel SimpleThresholdPolicy::call_event(methodOop method, CompLevel cur_level) { iveresov@2138: CompLevel highest_level = (CompLevel)method->highest_comp_level(); iveresov@2138: if (cur_level == CompLevel_none && highest_level > cur_level) { iveresov@2138: // TODO: We may want to try to do more extensive reprofiling in this case. iveresov@2138: return highest_level; iveresov@2138: } iveresov@2138: iveresov@2138: CompLevel osr_level = (CompLevel) method->highest_osr_comp_level(); iveresov@2138: CompLevel next_level = common(&SimpleThresholdPolicy::call_predicate, method, cur_level); iveresov@2138: iveresov@2138: // If OSR method level is greater than the regular method level, the levels should be iveresov@2138: // equalized by raising the regular method level in order to avoid OSRs during each iveresov@2138: // invocation of the method. iveresov@2138: if (osr_level == CompLevel_full_optimization && cur_level == CompLevel_full_profile) { iveresov@2138: methodDataOop mdo = method->method_data(); iveresov@2138: guarantee(mdo != NULL, "MDO should not be NULL"); iveresov@2138: if (mdo->invocation_count() >= 1) { iveresov@2138: next_level = CompLevel_full_optimization; iveresov@2138: } iveresov@2138: } else { iveresov@2138: next_level = MAX2(osr_level, next_level); iveresov@2138: } iveresov@2138: iveresov@2138: return next_level; iveresov@2138: } iveresov@2138: iveresov@2138: // Determine if we should do an OSR compilation of a given method. iveresov@2138: CompLevel SimpleThresholdPolicy::loop_event(methodOop method, CompLevel cur_level) { iveresov@2138: if (cur_level == CompLevel_none) { iveresov@2138: // If there is a live OSR method that means that we deopted to the interpreter iveresov@2138: // for the transition. iveresov@2138: CompLevel osr_level = (CompLevel)method->highest_osr_comp_level(); iveresov@2138: if (osr_level > CompLevel_none) { iveresov@2138: return osr_level; iveresov@2138: } iveresov@2138: } iveresov@2138: return common(&SimpleThresholdPolicy::loop_predicate, method, cur_level); iveresov@2138: } iveresov@2138: iveresov@2138: iveresov@2138: // Handle the invocation event. iveresov@2138: void SimpleThresholdPolicy::method_invocation_event(methodHandle mh, methodHandle imh, iveresov@2138: CompLevel level, TRAPS) { iveresov@2138: if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh, InvocationEntryBci)) { iveresov@2138: CompLevel next_level = call_event(mh(), level); iveresov@2138: if (next_level != level) { iveresov@2138: compile(mh, InvocationEntryBci, next_level, THREAD); iveresov@2138: } iveresov@2138: } iveresov@2138: } iveresov@2138: iveresov@2138: // Handle the back branch event. Notice that we can compile the method iveresov@2138: // with a regular entry from here. iveresov@2138: void SimpleThresholdPolicy::method_back_branch_event(methodHandle mh, methodHandle imh, iveresov@2138: int bci, CompLevel level, TRAPS) { iveresov@2138: // If the method is already compiling, quickly bail out. iveresov@2138: if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh, bci)) { iveresov@2138: // Use loop event as an opportinity to also check there's been iveresov@2138: // enough calls. iveresov@2138: CompLevel cur_level = comp_level(mh()); iveresov@2138: CompLevel next_level = call_event(mh(), cur_level); iveresov@2138: CompLevel next_osr_level = loop_event(mh(), level); iveresov@2138: iveresov@2138: next_level = MAX2(next_level, iveresov@2138: next_osr_level < CompLevel_full_optimization ? next_osr_level : cur_level); iveresov@2138: bool is_compiling = false; iveresov@2138: if (next_level != cur_level) { iveresov@2138: compile(mh, InvocationEntryBci, next_level, THREAD); iveresov@2138: is_compiling = true; iveresov@2138: } iveresov@2138: iveresov@2138: // Do the OSR version iveresov@2138: if (!is_compiling && next_osr_level != level) { iveresov@2138: compile(mh, bci, next_osr_level, THREAD); iveresov@2138: } iveresov@2138: } iveresov@2138: }