2007-12-01 00:00:00 +00:00
|
|
|
/*
|
2011-03-11 22:34:57 -08:00
|
|
|
* Copyright (c) 1998, 2011, Oracle and/or its affiliates. All rights reserved.
|
2007-12-01 00:00:00 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
|
*
|
|
|
|
* This code is free software; you can redistribute it and/or modify it
|
|
|
|
* under the terms of the GNU General Public License version 2 only, as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
|
* accompanied this code).
|
|
|
|
*
|
|
|
|
* You should have received a copy of the GNU General Public License version
|
|
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
*
|
2010-05-27 19:08:38 -07:00
|
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
|
* or visit www.oracle.com if you need additional information or have any
|
|
|
|
* questions.
|
2007-12-01 00:00:00 +00:00
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2010-11-23 13:22:55 -08:00
|
|
|
#include "precompiled.hpp"
|
|
|
|
#include "classfile/systemDictionary.hpp"
|
|
|
|
#include "classfile/vmSymbols.hpp"
|
2011-03-28 03:58:07 -07:00
|
|
|
#include "compiler/compileBroker.hpp"
|
2010-11-23 13:22:55 -08:00
|
|
|
#include "compiler/compileLog.hpp"
|
|
|
|
#include "interpreter/linkResolver.hpp"
|
|
|
|
#include "oops/objArrayKlass.hpp"
|
|
|
|
#include "opto/callGenerator.hpp"
|
|
|
|
#include "opto/parse.hpp"
|
|
|
|
#include "runtime/handles.inline.hpp"
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
//=============================================================================
|
|
|
|
//------------------------------InlineTree-------------------------------------
|
2011-06-22 14:45:37 -07:00
|
|
|
InlineTree::InlineTree(Compile* c,
|
|
|
|
const InlineTree *caller_tree, ciMethod* callee,
|
|
|
|
JVMState* caller_jvms, int caller_bci,
|
|
|
|
float site_invoke_ratio, int max_inline_level) :
|
|
|
|
C(c),
|
|
|
|
_caller_jvms(caller_jvms),
|
|
|
|
_caller_tree((InlineTree*) caller_tree),
|
|
|
|
_method(callee),
|
|
|
|
_site_invoke_ratio(site_invoke_ratio),
|
|
|
|
_max_inline_level(max_inline_level),
|
2011-08-31 01:40:45 -07:00
|
|
|
_count_inline_bcs(method()->code_size_for_inlining())
|
2010-01-08 13:58:49 -08:00
|
|
|
{
|
2007-12-01 00:00:00 +00:00
|
|
|
NOT_PRODUCT(_count_inlines = 0;)
|
|
|
|
if (_caller_jvms != NULL) {
|
|
|
|
// Keep a private copy of the caller_jvms:
|
|
|
|
_caller_jvms = new (C) JVMState(caller_jvms->method(), caller_tree->caller_jvms());
|
|
|
|
_caller_jvms->set_bci(caller_jvms->bci());
|
2009-07-31 17:12:33 -07:00
|
|
|
assert(!caller_jvms->should_reexecute(), "there should be no reexecute bytecode with inlining");
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
assert(_caller_jvms->same_calls_as(caller_jvms), "consistent JVMS");
|
2010-01-08 13:58:49 -08:00
|
|
|
assert((caller_tree == NULL ? 0 : caller_tree->stack_depth() + 1) == stack_depth(), "correct (redundant) depth parameter");
|
2007-12-01 00:00:00 +00:00
|
|
|
assert(caller_bci == this->caller_bci(), "correct (redundant) bci parameter");
|
|
|
|
if (UseOldInlining) {
|
|
|
|
// Update hierarchical counts, count_inline_bcs() and count_inlines()
|
|
|
|
InlineTree *caller = (InlineTree *)caller_tree;
|
|
|
|
for( ; caller != NULL; caller = ((InlineTree *)(caller->caller_tree())) ) {
|
|
|
|
caller->_count_inline_bcs += count_inline_bcs();
|
|
|
|
NOT_PRODUCT(caller->_count_inlines++;)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-01-08 13:58:49 -08:00
|
|
|
InlineTree::InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms,
|
2011-06-22 14:45:37 -07:00
|
|
|
float site_invoke_ratio, int max_inline_level) :
|
|
|
|
C(c),
|
|
|
|
_caller_jvms(caller_jvms),
|
|
|
|
_caller_tree(NULL),
|
|
|
|
_method(callee_method),
|
|
|
|
_site_invoke_ratio(site_invoke_ratio),
|
|
|
|
_max_inline_level(max_inline_level),
|
2010-01-08 13:58:49 -08:00
|
|
|
_count_inline_bcs(method()->code_size())
|
|
|
|
{
|
2007-12-01 00:00:00 +00:00
|
|
|
NOT_PRODUCT(_count_inlines = 0;)
|
|
|
|
assert(!UseOldInlining, "do not use for old stuff");
|
|
|
|
}
|
|
|
|
|
2008-03-07 11:09:13 -08:00
|
|
|
static bool is_init_with_ea(ciMethod* callee_method,
|
|
|
|
ciMethod* caller_method, Compile* C) {
|
|
|
|
// True when EA is ON and a java constructor is called or
|
|
|
|
// a super constructor is called from an inlined java constructor.
|
2008-07-03 18:02:47 -07:00
|
|
|
return C->do_escape_analysis() && EliminateAllocations &&
|
2008-03-07 11:09:13 -08:00
|
|
|
( callee_method->is_initializer() ||
|
|
|
|
(caller_method->is_initializer() &&
|
|
|
|
caller_method != C->method() &&
|
|
|
|
caller_method->holder()->is_subclass_of(callee_method->holder()))
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
// positive filter: should send be inlined? returns NULL, if yes, or rejection msg
|
2011-05-10 00:45:03 -07:00
|
|
|
const char* InlineTree::should_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) const {
|
2007-12-01 00:00:00 +00:00
|
|
|
// Allows targeted inlining
|
|
|
|
if(callee_method->should_inline()) {
|
|
|
|
*wci_result = *(WarmCallInfo::always_hot());
|
|
|
|
if (PrintInlining && Verbose) {
|
2011-06-22 14:45:37 -07:00
|
|
|
CompileTask::print_inline_indent(inline_level());
|
2007-12-01 00:00:00 +00:00
|
|
|
tty->print_cr("Inlined method is hot: ");
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// positive filter: should send be inlined? returns NULL (--> yes)
|
|
|
|
// or rejection msg
|
2011-08-31 01:40:45 -07:00
|
|
|
int size = callee_method->code_size_for_inlining();
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
// Check for too many throws (and not too huge)
|
2008-03-07 11:09:13 -08:00
|
|
|
if(callee_method->interpreter_throwout_count() > InlineThrowCount &&
|
|
|
|
size < InlineThrowMaxSize ) {
|
2007-12-01 00:00:00 +00:00
|
|
|
wci_result->set_profit(wci_result->profit() * 100);
|
|
|
|
if (PrintInlining && Verbose) {
|
2011-06-22 14:45:37 -07:00
|
|
|
CompileTask::print_inline_indent(inline_level());
|
2007-12-01 00:00:00 +00:00
|
|
|
tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count());
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!UseOldInlining) {
|
|
|
|
return NULL; // size and frequency are represented in a new way
|
|
|
|
}
|
|
|
|
|
2011-05-10 00:45:03 -07:00
|
|
|
int default_max_inline_size = C->max_inline_size();
|
|
|
|
int inline_small_code_size = InlineSmallCode / 4;
|
|
|
|
int max_inline_size = default_max_inline_size;
|
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
int call_site_count = method()->scale_count(profile.count());
|
|
|
|
int invoke_count = method()->interpreter_invocation_count();
|
2011-05-10 00:45:03 -07:00
|
|
|
|
|
|
|
// Bytecoded method handle adapters do not have interpreter
|
|
|
|
// profiling data but only made up MDO data. Get the counter from
|
|
|
|
// there.
|
|
|
|
if (caller_method->is_method_handle_adapter()) {
|
|
|
|
assert(method()->method_data_or_null(), "must have an MDO");
|
|
|
|
ciMethodData* mdo = method()->method_data();
|
|
|
|
ciProfileData* mha_profile = mdo->bci_to_data(caller_bci);
|
|
|
|
assert(mha_profile, "must exist");
|
|
|
|
CounterData* cd = mha_profile->as_CounterData();
|
|
|
|
invoke_count = cd->count();
|
|
|
|
call_site_count = invoke_count; // use the same value
|
|
|
|
}
|
|
|
|
|
|
|
|
assert(invoke_count != 0, "require invocation count greater than zero");
|
|
|
|
int freq = call_site_count / invoke_count;
|
2008-03-07 11:09:13 -08:00
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
// bump the max size if the call is frequent
|
2008-03-07 11:09:13 -08:00
|
|
|
if ((freq >= InlineFrequencyRatio) ||
|
|
|
|
(call_site_count >= InlineFrequencyCount) ||
|
|
|
|
is_init_with_ea(callee_method, caller_method, C)) {
|
|
|
|
|
2011-05-10 00:45:03 -07:00
|
|
|
max_inline_size = C->freq_inline_size();
|
|
|
|
if (size <= max_inline_size && TraceFrequencyInlining) {
|
2011-06-22 14:45:37 -07:00
|
|
|
CompileTask::print_inline_indent(inline_level());
|
2007-12-01 00:00:00 +00:00
|
|
|
tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count);
|
2011-06-22 14:45:37 -07:00
|
|
|
CompileTask::print_inline_indent(inline_level());
|
2007-12-01 00:00:00 +00:00
|
|
|
callee_method->print();
|
|
|
|
tty->cr();
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// Not hot. Check for medium-sized pre-existing nmethod at cold sites.
|
2008-03-07 11:09:13 -08:00
|
|
|
if (callee_method->has_compiled_code() &&
|
2011-05-10 00:45:03 -07:00
|
|
|
callee_method->instructions_size(CompLevel_full_optimization) > inline_small_code_size)
|
2007-12-01 00:00:00 +00:00
|
|
|
return "already compiled into a medium method";
|
|
|
|
}
|
2011-05-10 00:45:03 -07:00
|
|
|
if (size > max_inline_size) {
|
|
|
|
if (max_inline_size > default_max_inline_size)
|
2007-12-01 00:00:00 +00:00
|
|
|
return "hot method too big";
|
|
|
|
return "too big";
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// negative filter: should send NOT be inlined? returns NULL, ok to inline, or rejection msg
|
2011-05-10 00:45:03 -07:00
|
|
|
const char* InlineTree::should_not_inline(ciMethod *callee_method, ciMethod* caller_method, WarmCallInfo* wci_result) const {
|
2007-12-01 00:00:00 +00:00
|
|
|
// negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg
|
|
|
|
if (!UseOldInlining) {
|
|
|
|
const char* fail = NULL;
|
|
|
|
if (callee_method->is_abstract()) fail = "abstract method";
|
|
|
|
// note: we allow ik->is_abstract()
|
|
|
|
if (!callee_method->holder()->is_initialized()) fail = "method holder not initialized";
|
|
|
|
if (callee_method->is_native()) fail = "native method";
|
|
|
|
|
|
|
|
if (fail) {
|
|
|
|
*wci_result = *(WarmCallInfo::always_cold());
|
|
|
|
return fail;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (callee_method->has_unloaded_classes_in_signature()) {
|
|
|
|
wci_result->set_profit(wci_result->profit() * 0.1);
|
|
|
|
}
|
|
|
|
|
|
|
|
// don't inline exception code unless the top method belongs to an
|
|
|
|
// exception class
|
|
|
|
if (callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
|
|
|
|
ciMethod* top_method = caller_jvms() ? caller_jvms()->of_depth(1)->method() : method();
|
|
|
|
if (!top_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
|
|
|
|
wci_result->set_profit(wci_result->profit() * 0.1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-09-03 17:51:07 -07:00
|
|
|
if (callee_method->has_compiled_code() && callee_method->instructions_size(CompLevel_full_optimization) > InlineSmallCode) {
|
2007-12-01 00:00:00 +00:00
|
|
|
wci_result->set_profit(wci_result->profit() * 0.1);
|
|
|
|
// %%% adjust wci_result->size()?
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2010-05-21 02:59:24 -07:00
|
|
|
// Always inline MethodHandle methods and generated MethodHandle adapters.
|
|
|
|
if (callee_method->is_method_handle_invoke() || callee_method->is_method_handle_adapter())
|
2010-01-05 15:21:25 +01:00
|
|
|
return NULL;
|
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
// First check all inlining restrictions which are required for correctness
|
|
|
|
if (callee_method->is_abstract()) return "abstract method";
|
|
|
|
// note: we allow ik->is_abstract()
|
|
|
|
if (!callee_method->holder()->is_initialized()) return "method holder not initialized";
|
|
|
|
if (callee_method->is_native()) return "native method";
|
|
|
|
if (callee_method->has_unloaded_classes_in_signature()) return "unloaded signature classes";
|
|
|
|
|
|
|
|
if (callee_method->should_inline()) {
|
|
|
|
// ignore heuristic controls on inlining
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now perform checks which are heuristic
|
|
|
|
|
2010-09-03 17:51:07 -07:00
|
|
|
if( callee_method->has_compiled_code() && callee_method->instructions_size(CompLevel_full_optimization) > InlineSmallCode )
|
2007-12-01 00:00:00 +00:00
|
|
|
return "already compiled into a big method";
|
|
|
|
|
|
|
|
// don't inline exception code unless the top method belongs to an
|
|
|
|
// exception class
|
|
|
|
if (caller_tree() != NULL &&
|
|
|
|
callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
|
|
|
|
const InlineTree *top = this;
|
|
|
|
while (top->caller_tree() != NULL) top = top->caller_tree();
|
|
|
|
ciInstanceKlass* k = top->method()->holder();
|
|
|
|
if (!k->is_subclass_of(C->env()->Throwable_klass()))
|
|
|
|
return "exception method";
|
|
|
|
}
|
|
|
|
|
|
|
|
// use frequency-based objections only for non-trivial methods
|
2011-08-31 01:40:45 -07:00
|
|
|
if (callee_method->code_size_for_inlining() <= MaxTrivialSize) return NULL;
|
2008-03-07 11:09:13 -08:00
|
|
|
|
|
|
|
// don't use counts with -Xcomp or CTW
|
|
|
|
if (UseInterpreter && !CompileTheWorld) {
|
|
|
|
|
|
|
|
if (!callee_method->has_compiled_code() &&
|
|
|
|
!callee_method->was_executed_more_than(0)) {
|
|
|
|
return "never executed";
|
|
|
|
}
|
|
|
|
|
|
|
|
if (is_init_with_ea(callee_method, caller_method, C)) {
|
|
|
|
|
|
|
|
// Escape Analysis: inline all executed constructors
|
|
|
|
|
|
|
|
} else if (!callee_method->was_executed_more_than(MIN2(MinInliningThreshold,
|
|
|
|
CompileThreshold >> 1))) {
|
|
|
|
return "executed < MinInliningThreshold times";
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (callee_method->should_not_inline()) {
|
|
|
|
return "disallowed by CompilerOracle";
|
|
|
|
}
|
|
|
|
|
2009-03-30 18:19:31 -07:00
|
|
|
if (UseStringCache) {
|
|
|
|
// Do not inline StringCache::profile() method used only at the beginning.
|
|
|
|
if (callee_method->name() == ciSymbol::profile_name() &&
|
|
|
|
callee_method->holder()->name() == ciSymbol::java_lang_StringCache()) {
|
|
|
|
return "profiling method";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
//-----------------------------try_to_inline-----------------------------------
|
|
|
|
// return NULL if ok, reason for not inlining otherwise
|
|
|
|
// Relocated from "InliningClosure::try_to_inline"
|
2008-03-07 11:09:13 -08:00
|
|
|
const char* InlineTree::try_to_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) {
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
// Old algorithm had funny accumulating BC-size counters
|
|
|
|
if (UseOldInlining && ClipInlining
|
|
|
|
&& (int)count_inline_bcs() >= DesiredMethodLimit) {
|
|
|
|
return "size > DesiredMethodLimit";
|
|
|
|
}
|
|
|
|
|
|
|
|
const char *msg = NULL;
|
2011-05-10 00:45:03 -07:00
|
|
|
msg = should_inline(callee_method, caller_method, caller_bci, profile, wci_result);
|
|
|
|
if (msg != NULL)
|
2008-03-07 11:09:13 -08:00
|
|
|
return msg;
|
2011-05-10 00:45:03 -07:00
|
|
|
|
|
|
|
msg = should_not_inline(callee_method, caller_method, wci_result);
|
|
|
|
if (msg != NULL)
|
2008-03-07 11:09:13 -08:00
|
|
|
return msg;
|
2007-12-01 00:00:00 +00:00
|
|
|
|
2010-01-08 13:58:49 -08:00
|
|
|
if (InlineAccessors && callee_method->is_accessor()) {
|
|
|
|
// accessor methods are not subject to any of the following limits.
|
|
|
|
return NULL;
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
// suppress a few checks for accessors and trivial methods
|
2011-08-31 01:40:45 -07:00
|
|
|
if (callee_method->code_size_for_inlining() > MaxTrivialSize) {
|
2008-03-07 11:09:13 -08:00
|
|
|
|
2007-12-01 00:00:00 +00:00
|
|
|
// don't inline into giant methods
|
2008-03-07 11:09:13 -08:00
|
|
|
if (C->unique() > (uint)NodeCountInliningCutoff) {
|
|
|
|
return "NodeCountInliningCutoff";
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
|
2008-03-07 11:09:13 -08:00
|
|
|
if ((!UseInterpreter || CompileTheWorld) &&
|
|
|
|
is_init_with_ea(callee_method, caller_method, C)) {
|
2007-12-01 00:00:00 +00:00
|
|
|
|
2008-03-07 11:09:13 -08:00
|
|
|
// Escape Analysis stress testing when running Xcomp or CTW:
|
|
|
|
// inline constructors even if they are not reached.
|
2007-12-01 00:00:00 +00:00
|
|
|
|
2008-03-07 11:09:13 -08:00
|
|
|
} else if (profile.count() == 0) {
|
|
|
|
// don't inline unreached call sites
|
|
|
|
return "call site not reached";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-01-08 13:58:49 -08:00
|
|
|
if (!C->do_inlining() && InlineAccessors) {
|
2008-03-07 11:09:13 -08:00
|
|
|
return "not an accessor";
|
|
|
|
}
|
2011-06-22 14:45:37 -07:00
|
|
|
if (inline_level() > _max_inline_level) {
|
2008-03-07 11:09:13 -08:00
|
|
|
return "inlining too deep";
|
|
|
|
}
|
2011-03-28 03:58:07 -07:00
|
|
|
|
2011-05-02 00:55:09 -07:00
|
|
|
// detect direct and indirect recursive inlining
|
|
|
|
{
|
|
|
|
// count the current method and the callee
|
|
|
|
int inline_level = (method() == callee_method) ? 1 : 0;
|
|
|
|
if (inline_level > MaxRecursiveInlineLevel)
|
|
|
|
return "recursively inlining too deep";
|
|
|
|
// count callers of current method and callee
|
2011-03-28 03:58:07 -07:00
|
|
|
JVMState* jvms = caller_jvms();
|
|
|
|
while (jvms != NULL && jvms->has_method()) {
|
|
|
|
if (jvms->method() == callee_method) {
|
|
|
|
inline_level++;
|
|
|
|
if (inline_level > MaxRecursiveInlineLevel)
|
|
|
|
return "recursively inlining too deep";
|
|
|
|
}
|
|
|
|
jvms = jvms->caller();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-08-31 01:40:45 -07:00
|
|
|
int size = callee_method->code_size_for_inlining();
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
if (UseOldInlining && ClipInlining
|
|
|
|
&& (int)count_inline_bcs() + size >= DesiredMethodLimit) {
|
|
|
|
return "size > DesiredMethodLimit";
|
|
|
|
}
|
|
|
|
|
|
|
|
// ok, inline this method
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------pass_initial_checks----------------------------
|
|
|
|
bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method) {
|
|
|
|
ciInstanceKlass *callee_holder = callee_method ? callee_method->holder() : NULL;
|
|
|
|
// Check if a callee_method was suggested
|
|
|
|
if( callee_method == NULL ) return false;
|
|
|
|
// Check if klass of callee_method is loaded
|
|
|
|
if( !callee_holder->is_loaded() ) return false;
|
|
|
|
if( !callee_holder->is_initialized() ) return false;
|
|
|
|
if( !UseInterpreter || CompileTheWorld /* running Xcomp or CTW */ ) {
|
|
|
|
// Checks that constant pool's call site has been visited
|
|
|
|
// stricter than callee_holder->is_initialized()
|
|
|
|
ciBytecodeStream iter(caller_method);
|
|
|
|
iter.force_bci(caller_bci);
|
|
|
|
Bytecodes::Code call_bc = iter.cur_bc();
|
2010-01-05 13:05:58 +01:00
|
|
|
// An invokedynamic instruction does not have a klass.
|
|
|
|
if (call_bc != Bytecodes::_invokedynamic) {
|
2010-05-23 01:38:26 -07:00
|
|
|
int index = iter.get_index_u2_cpcache();
|
2010-01-05 13:05:58 +01:00
|
|
|
if (!caller_method->is_klass_loaded(index, true)) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// Try to do constant pool resolution if running Xcomp
|
|
|
|
if( !caller_method->check_call(index, call_bc == Bytecodes::_invokestatic) ) {
|
|
|
|
return false;
|
|
|
|
}
|
2007-12-01 00:00:00 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
// We will attempt to see if a class/field/etc got properly loaded. If it
|
|
|
|
// did not, it may attempt to throw an exception during our probing. Catch
|
|
|
|
// and ignore such exceptions and do not attempt to compile the method.
|
|
|
|
if( callee_method->should_exclude() ) return false;
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------print_inlining---------------------------------
|
|
|
|
// Really, the failure_msg can be a success message also.
|
2011-03-28 03:58:07 -07:00
|
|
|
void InlineTree::print_inlining(ciMethod* callee_method, int caller_bci, const char* failure_msg) const {
|
2011-06-22 14:45:37 -07:00
|
|
|
CompileTask::print_inlining(callee_method, inline_level(), caller_bci, failure_msg ? failure_msg : "inline");
|
2011-03-28 03:58:07 -07:00
|
|
|
if (callee_method == NULL) tty->print(" callee not monotonic or profiled");
|
|
|
|
if (Verbose && callee_method) {
|
2007-12-01 00:00:00 +00:00
|
|
|
const InlineTree *top = this;
|
|
|
|
while( top->caller_tree() != NULL ) { top = top->caller_tree(); }
|
|
|
|
tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------ok_to_inline-----------------------------------
|
|
|
|
WarmCallInfo* InlineTree::ok_to_inline(ciMethod* callee_method, JVMState* jvms, ciCallProfile& profile, WarmCallInfo* initial_wci) {
|
|
|
|
assert(callee_method != NULL, "caller checks for optimized virtual!");
|
|
|
|
#ifdef ASSERT
|
|
|
|
// Make sure the incoming jvms has the same information content as me.
|
|
|
|
// This means that we can eventually make this whole class AllStatic.
|
|
|
|
if (jvms->caller() == NULL) {
|
|
|
|
assert(_caller_jvms == NULL, "redundant instance state");
|
|
|
|
} else {
|
|
|
|
assert(_caller_jvms->same_calls_as(jvms->caller()), "redundant instance state");
|
|
|
|
}
|
|
|
|
assert(_method == jvms->method(), "redundant instance state");
|
|
|
|
#endif
|
|
|
|
const char *failure_msg = NULL;
|
|
|
|
int caller_bci = jvms->bci();
|
|
|
|
ciMethod *caller_method = jvms->method();
|
|
|
|
|
|
|
|
if( !pass_initial_checks(caller_method, caller_bci, callee_method)) {
|
|
|
|
if( PrintInlining ) {
|
|
|
|
failure_msg = "failed_initial_checks";
|
|
|
|
print_inlining( callee_method, caller_bci, failure_msg);
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check if inlining policy says no.
|
|
|
|
WarmCallInfo wci = *(initial_wci);
|
2008-03-07 11:09:13 -08:00
|
|
|
failure_msg = try_to_inline(callee_method, caller_method, caller_bci, profile, &wci);
|
2007-12-01 00:00:00 +00:00
|
|
|
if (failure_msg != NULL && C->log() != NULL) {
|
|
|
|
C->log()->begin_elem("inline_fail reason='");
|
|
|
|
C->log()->text("%s", failure_msg);
|
|
|
|
C->log()->end_elem("'");
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef PRODUCT
|
|
|
|
if (UseOldInlining && InlineWarmCalls
|
|
|
|
&& (PrintOpto || PrintOptoInlining || PrintInlining)) {
|
|
|
|
bool cold = wci.is_cold();
|
|
|
|
bool hot = !cold && wci.is_hot();
|
|
|
|
bool old_cold = (failure_msg != NULL);
|
|
|
|
if (old_cold != cold || (Verbose || WizardMode)) {
|
|
|
|
tty->print(" OldInlining= %4s : %s\n WCI=",
|
|
|
|
old_cold ? "cold" : "hot", failure_msg ? failure_msg : "OK");
|
|
|
|
wci.print();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
if (UseOldInlining) {
|
|
|
|
if (failure_msg == NULL)
|
|
|
|
wci = *(WarmCallInfo::always_hot());
|
|
|
|
else
|
|
|
|
wci = *(WarmCallInfo::always_cold());
|
|
|
|
}
|
|
|
|
if (!InlineWarmCalls) {
|
|
|
|
if (!wci.is_cold() && !wci.is_hot()) {
|
|
|
|
// Do not inline the warm calls.
|
|
|
|
wci = *(WarmCallInfo::always_cold());
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!wci.is_cold()) {
|
|
|
|
// In -UseOldInlining, the failure_msg may also be a success message.
|
|
|
|
if (failure_msg == NULL) failure_msg = "inline (hot)";
|
|
|
|
|
|
|
|
// Inline!
|
|
|
|
if( PrintInlining ) print_inlining( callee_method, caller_bci, failure_msg);
|
|
|
|
if (UseOldInlining)
|
|
|
|
build_inline_tree_for_callee(callee_method, jvms, caller_bci);
|
|
|
|
if (InlineWarmCalls && !wci.is_hot())
|
|
|
|
return new (C) WarmCallInfo(wci); // copy to heap
|
|
|
|
return WarmCallInfo::always_hot();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do not inline
|
|
|
|
if (failure_msg == NULL) failure_msg = "too cold to inline";
|
|
|
|
if( PrintInlining ) print_inlining( callee_method, caller_bci, failure_msg);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------compute_callee_frequency-----------------------
|
|
|
|
float InlineTree::compute_callee_frequency( int caller_bci ) const {
|
|
|
|
int count = method()->interpreter_call_site_count(caller_bci);
|
|
|
|
int invcnt = method()->interpreter_invocation_count();
|
|
|
|
float freq = (float)count/(float)invcnt;
|
|
|
|
// Call-site count / interpreter invocation count, scaled recursively.
|
|
|
|
// Always between 0.0 and 1.0. Represents the percentage of the method's
|
|
|
|
// total execution time used at this call site.
|
|
|
|
|
|
|
|
return freq;
|
|
|
|
}
|
|
|
|
|
|
|
|
//------------------------------build_inline_tree_for_callee-------------------
|
|
|
|
InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) {
|
|
|
|
float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci);
|
|
|
|
// Attempt inlining.
|
|
|
|
InlineTree* old_ilt = callee_at(caller_bci, callee_method);
|
|
|
|
if (old_ilt != NULL) {
|
|
|
|
return old_ilt;
|
|
|
|
}
|
2011-06-22 14:45:37 -07:00
|
|
|
int max_inline_level_adjust = 0;
|
2010-01-08 13:58:49 -08:00
|
|
|
if (caller_jvms->method() != NULL) {
|
|
|
|
if (caller_jvms->method()->is_method_handle_adapter())
|
2011-06-22 14:45:37 -07:00
|
|
|
max_inline_level_adjust += 1; // don't count actions in MH or indy adapter frames
|
2010-01-08 13:58:49 -08:00
|
|
|
else if (callee_method->is_method_handle_invoke()) {
|
2011-06-22 14:45:37 -07:00
|
|
|
max_inline_level_adjust += 1; // don't count method handle calls from java.lang.invoke implem
|
2010-01-08 13:58:49 -08:00
|
|
|
}
|
2011-06-22 14:45:37 -07:00
|
|
|
if (max_inline_level_adjust != 0 && PrintInlining && (Verbose || WizardMode)) {
|
|
|
|
CompileTask::print_inline_indent(inline_level());
|
2011-05-10 00:45:03 -07:00
|
|
|
tty->print_cr(" \\-> discounting inline depth");
|
2010-01-08 13:58:49 -08:00
|
|
|
}
|
2011-06-22 14:45:37 -07:00
|
|
|
if (max_inline_level_adjust != 0 && C->log()) {
|
2010-01-08 13:58:49 -08:00
|
|
|
int id1 = C->log()->identify(caller_jvms->method());
|
|
|
|
int id2 = C->log()->identify(callee_method);
|
2011-06-22 14:45:37 -07:00
|
|
|
C->log()->elem("inline_level_discount caller='%d' callee='%d'", id1, id2);
|
2010-01-08 13:58:49 -08:00
|
|
|
}
|
|
|
|
}
|
2011-06-22 14:45:37 -07:00
|
|
|
InlineTree* ilt = new InlineTree(C, this, callee_method, caller_jvms, caller_bci, recur_frequency, _max_inline_level + max_inline_level_adjust);
|
|
|
|
_subtrees.append(ilt);
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
NOT_PRODUCT( _count_inlines += 1; )
|
|
|
|
|
|
|
|
return ilt;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//---------------------------------------callee_at-----------------------------
|
|
|
|
InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const {
|
|
|
|
for (int i = 0; i < _subtrees.length(); i++) {
|
|
|
|
InlineTree* sub = _subtrees.at(i);
|
|
|
|
if (sub->caller_bci() == bci && callee == sub->method()) {
|
|
|
|
return sub;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//------------------------------build_inline_tree_root-------------------------
|
|
|
|
InlineTree *InlineTree::build_inline_tree_root() {
|
|
|
|
Compile* C = Compile::current();
|
|
|
|
|
|
|
|
// Root of inline tree
|
2011-06-22 14:45:37 -07:00
|
|
|
InlineTree* ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F, MaxInlineLevel);
|
2007-12-01 00:00:00 +00:00
|
|
|
|
|
|
|
return ilt;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
//-------------------------find_subtree_from_root-----------------------------
|
|
|
|
// Given a jvms, which determines a call chain from the root method,
|
|
|
|
// find the corresponding inline tree.
|
|
|
|
// Note: This method will be removed or replaced as InlineTree goes away.
|
|
|
|
InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee, bool create_if_not_found) {
|
|
|
|
InlineTree* iltp = root;
|
|
|
|
uint depth = jvms && jvms->has_method() ? jvms->depth() : 0;
|
|
|
|
for (uint d = 1; d <= depth; d++) {
|
|
|
|
JVMState* jvmsp = jvms->of_depth(d);
|
|
|
|
// Select the corresponding subtree for this bci.
|
|
|
|
assert(jvmsp->method() == iltp->method(), "tree still in sync");
|
|
|
|
ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method();
|
|
|
|
InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee);
|
|
|
|
if (!sub) {
|
|
|
|
if (create_if_not_found && d == depth) {
|
|
|
|
return iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci());
|
|
|
|
}
|
|
|
|
assert(sub != NULL, "should be a sub-ilt here");
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
iltp = sub;
|
|
|
|
}
|
|
|
|
return iltp;
|
|
|
|
}
|