Fri, 12 Feb 2010 15:27:36 -0800
Merge
duke@435 | 1 | /* |
xdono@1279 | 2 | * Copyright 1998-2009 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_bytecodeInfo.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | //============================================================================= |
duke@435 | 29 | //------------------------------InlineTree------------------------------------- |
jrose@1592 | 30 | InlineTree::InlineTree( Compile* c, |
jrose@1592 | 31 | const InlineTree *caller_tree, ciMethod* callee, |
jrose@1592 | 32 | JVMState* caller_jvms, int caller_bci, |
jrose@1592 | 33 | float site_invoke_ratio, int site_depth_adjust) |
duke@435 | 34 | : C(c), _caller_jvms(caller_jvms), |
duke@435 | 35 | _caller_tree((InlineTree*)caller_tree), |
duke@435 | 36 | _method(callee), _site_invoke_ratio(site_invoke_ratio), |
jrose@1592 | 37 | _site_depth_adjust(site_depth_adjust), |
jrose@1592 | 38 | _count_inline_bcs(method()->code_size()) |
jrose@1592 | 39 | { |
duke@435 | 40 | NOT_PRODUCT(_count_inlines = 0;) |
duke@435 | 41 | if (_caller_jvms != NULL) { |
duke@435 | 42 | // Keep a private copy of the caller_jvms: |
duke@435 | 43 | _caller_jvms = new (C) JVMState(caller_jvms->method(), caller_tree->caller_jvms()); |
duke@435 | 44 | _caller_jvms->set_bci(caller_jvms->bci()); |
cfang@1335 | 45 | assert(!caller_jvms->should_reexecute(), "there should be no reexecute bytecode with inlining"); |
duke@435 | 46 | } |
duke@435 | 47 | assert(_caller_jvms->same_calls_as(caller_jvms), "consistent JVMS"); |
jrose@1592 | 48 | assert((caller_tree == NULL ? 0 : caller_tree->stack_depth() + 1) == stack_depth(), "correct (redundant) depth parameter"); |
duke@435 | 49 | assert(caller_bci == this->caller_bci(), "correct (redundant) bci parameter"); |
duke@435 | 50 | if (UseOldInlining) { |
duke@435 | 51 | // Update hierarchical counts, count_inline_bcs() and count_inlines() |
duke@435 | 52 | InlineTree *caller = (InlineTree *)caller_tree; |
duke@435 | 53 | for( ; caller != NULL; caller = ((InlineTree *)(caller->caller_tree())) ) { |
duke@435 | 54 | caller->_count_inline_bcs += count_inline_bcs(); |
duke@435 | 55 | NOT_PRODUCT(caller->_count_inlines++;) |
duke@435 | 56 | } |
duke@435 | 57 | } |
duke@435 | 58 | } |
duke@435 | 59 | |
jrose@1592 | 60 | InlineTree::InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, |
jrose@1592 | 61 | float site_invoke_ratio, int site_depth_adjust) |
duke@435 | 62 | : C(c), _caller_jvms(caller_jvms), _caller_tree(NULL), |
duke@435 | 63 | _method(callee_method), _site_invoke_ratio(site_invoke_ratio), |
jrose@1592 | 64 | _site_depth_adjust(site_depth_adjust), |
jrose@1592 | 65 | _count_inline_bcs(method()->code_size()) |
jrose@1592 | 66 | { |
duke@435 | 67 | NOT_PRODUCT(_count_inlines = 0;) |
duke@435 | 68 | assert(!UseOldInlining, "do not use for old stuff"); |
duke@435 | 69 | } |
duke@435 | 70 | |
duke@435 | 71 | |
duke@435 | 72 | |
duke@435 | 73 | static void print_indent(int depth) { |
duke@435 | 74 | tty->print(" "); |
duke@435 | 75 | for (int i = depth; i != 0; --i) tty->print(" "); |
duke@435 | 76 | } |
duke@435 | 77 | |
kvn@476 | 78 | static bool is_init_with_ea(ciMethod* callee_method, |
kvn@476 | 79 | ciMethod* caller_method, Compile* C) { |
kvn@476 | 80 | // True when EA is ON and a java constructor is called or |
kvn@476 | 81 | // a super constructor is called from an inlined java constructor. |
kvn@679 | 82 | return C->do_escape_analysis() && EliminateAllocations && |
kvn@476 | 83 | ( callee_method->is_initializer() || |
kvn@476 | 84 | (caller_method->is_initializer() && |
kvn@476 | 85 | caller_method != C->method() && |
kvn@476 | 86 | caller_method->holder()->is_subclass_of(callee_method->holder())) |
kvn@476 | 87 | ); |
kvn@476 | 88 | } |
kvn@476 | 89 | |
duke@435 | 90 | // positive filter: should send be inlined? returns NULL, if yes, or rejection msg |
kvn@476 | 91 | const char* InlineTree::shouldInline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) const { |
duke@435 | 92 | // Allows targeted inlining |
duke@435 | 93 | if(callee_method->should_inline()) { |
duke@435 | 94 | *wci_result = *(WarmCallInfo::always_hot()); |
duke@435 | 95 | if (PrintInlining && Verbose) { |
duke@435 | 96 | print_indent(inline_depth()); |
duke@435 | 97 | tty->print_cr("Inlined method is hot: "); |
duke@435 | 98 | } |
duke@435 | 99 | return NULL; |
duke@435 | 100 | } |
duke@435 | 101 | |
duke@435 | 102 | // positive filter: should send be inlined? returns NULL (--> yes) |
duke@435 | 103 | // or rejection msg |
duke@435 | 104 | int max_size = C->max_inline_size(); |
duke@435 | 105 | int size = callee_method->code_size(); |
duke@435 | 106 | |
duke@435 | 107 | // Check for too many throws (and not too huge) |
kvn@476 | 108 | if(callee_method->interpreter_throwout_count() > InlineThrowCount && |
kvn@476 | 109 | size < InlineThrowMaxSize ) { |
duke@435 | 110 | wci_result->set_profit(wci_result->profit() * 100); |
duke@435 | 111 | if (PrintInlining && Verbose) { |
duke@435 | 112 | print_indent(inline_depth()); |
duke@435 | 113 | tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count()); |
duke@435 | 114 | } |
duke@435 | 115 | return NULL; |
duke@435 | 116 | } |
duke@435 | 117 | |
duke@435 | 118 | if (!UseOldInlining) { |
duke@435 | 119 | return NULL; // size and frequency are represented in a new way |
duke@435 | 120 | } |
duke@435 | 121 | |
duke@435 | 122 | int call_site_count = method()->scale_count(profile.count()); |
duke@435 | 123 | int invoke_count = method()->interpreter_invocation_count(); |
duke@435 | 124 | assert( invoke_count != 0, "Require invokation count greater than zero"); |
duke@435 | 125 | int freq = call_site_count/invoke_count; |
kvn@476 | 126 | |
duke@435 | 127 | // bump the max size if the call is frequent |
kvn@476 | 128 | if ((freq >= InlineFrequencyRatio) || |
kvn@476 | 129 | (call_site_count >= InlineFrequencyCount) || |
kvn@476 | 130 | is_init_with_ea(callee_method, caller_method, C)) { |
kvn@476 | 131 | |
duke@435 | 132 | max_size = C->freq_inline_size(); |
duke@435 | 133 | if (size <= max_size && TraceFrequencyInlining) { |
duke@435 | 134 | print_indent(inline_depth()); |
duke@435 | 135 | tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count); |
duke@435 | 136 | print_indent(inline_depth()); |
duke@435 | 137 | callee_method->print(); |
duke@435 | 138 | tty->cr(); |
duke@435 | 139 | } |
duke@435 | 140 | } else { |
duke@435 | 141 | // Not hot. Check for medium-sized pre-existing nmethod at cold sites. |
kvn@476 | 142 | if (callee_method->has_compiled_code() && |
kvn@476 | 143 | callee_method->instructions_size() > InlineSmallCode/4) |
duke@435 | 144 | return "already compiled into a medium method"; |
duke@435 | 145 | } |
duke@435 | 146 | if (size > max_size) { |
duke@435 | 147 | if (max_size > C->max_inline_size()) |
duke@435 | 148 | return "hot method too big"; |
duke@435 | 149 | return "too big"; |
duke@435 | 150 | } |
duke@435 | 151 | return NULL; |
duke@435 | 152 | } |
duke@435 | 153 | |
duke@435 | 154 | |
duke@435 | 155 | // negative filter: should send NOT be inlined? returns NULL, ok to inline, or rejection msg |
kvn@476 | 156 | const char* InlineTree::shouldNotInline(ciMethod *callee_method, ciMethod* caller_method, WarmCallInfo* wci_result) const { |
duke@435 | 157 | // negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg |
duke@435 | 158 | if (!UseOldInlining) { |
duke@435 | 159 | const char* fail = NULL; |
duke@435 | 160 | if (callee_method->is_abstract()) fail = "abstract method"; |
duke@435 | 161 | // note: we allow ik->is_abstract() |
duke@435 | 162 | if (!callee_method->holder()->is_initialized()) fail = "method holder not initialized"; |
duke@435 | 163 | if (callee_method->is_native()) fail = "native method"; |
duke@435 | 164 | |
duke@435 | 165 | if (fail) { |
duke@435 | 166 | *wci_result = *(WarmCallInfo::always_cold()); |
duke@435 | 167 | return fail; |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | if (callee_method->has_unloaded_classes_in_signature()) { |
duke@435 | 171 | wci_result->set_profit(wci_result->profit() * 0.1); |
duke@435 | 172 | } |
duke@435 | 173 | |
duke@435 | 174 | // don't inline exception code unless the top method belongs to an |
duke@435 | 175 | // exception class |
duke@435 | 176 | if (callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { |
duke@435 | 177 | ciMethod* top_method = caller_jvms() ? caller_jvms()->of_depth(1)->method() : method(); |
duke@435 | 178 | if (!top_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { |
duke@435 | 179 | wci_result->set_profit(wci_result->profit() * 0.1); |
duke@435 | 180 | } |
duke@435 | 181 | } |
duke@435 | 182 | |
duke@435 | 183 | if (callee_method->has_compiled_code() && callee_method->instructions_size() > InlineSmallCode) { |
duke@435 | 184 | wci_result->set_profit(wci_result->profit() * 0.1); |
duke@435 | 185 | // %%% adjust wci_result->size()? |
duke@435 | 186 | } |
duke@435 | 187 | |
duke@435 | 188 | return NULL; |
duke@435 | 189 | } |
duke@435 | 190 | |
twisti@1573 | 191 | // Always inline MethodHandle methods. |
twisti@1573 | 192 | if (callee_method->is_method_handle_invoke()) |
twisti@1573 | 193 | return NULL; |
twisti@1573 | 194 | |
duke@435 | 195 | // First check all inlining restrictions which are required for correctness |
duke@435 | 196 | if (callee_method->is_abstract()) return "abstract method"; |
duke@435 | 197 | // note: we allow ik->is_abstract() |
duke@435 | 198 | if (!callee_method->holder()->is_initialized()) return "method holder not initialized"; |
duke@435 | 199 | if (callee_method->is_native()) return "native method"; |
duke@435 | 200 | if (callee_method->has_unloaded_classes_in_signature()) return "unloaded signature classes"; |
duke@435 | 201 | |
duke@435 | 202 | if (callee_method->should_inline()) { |
duke@435 | 203 | // ignore heuristic controls on inlining |
duke@435 | 204 | return NULL; |
duke@435 | 205 | } |
duke@435 | 206 | |
duke@435 | 207 | // Now perform checks which are heuristic |
duke@435 | 208 | |
duke@435 | 209 | if( callee_method->has_compiled_code() && callee_method->instructions_size() > InlineSmallCode ) |
duke@435 | 210 | return "already compiled into a big method"; |
duke@435 | 211 | |
duke@435 | 212 | // don't inline exception code unless the top method belongs to an |
duke@435 | 213 | // exception class |
duke@435 | 214 | if (caller_tree() != NULL && |
duke@435 | 215 | callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { |
duke@435 | 216 | const InlineTree *top = this; |
duke@435 | 217 | while (top->caller_tree() != NULL) top = top->caller_tree(); |
duke@435 | 218 | ciInstanceKlass* k = top->method()->holder(); |
duke@435 | 219 | if (!k->is_subclass_of(C->env()->Throwable_klass())) |
duke@435 | 220 | return "exception method"; |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | // use frequency-based objections only for non-trivial methods |
duke@435 | 224 | if (callee_method->code_size() <= MaxTrivialSize) return NULL; |
kvn@476 | 225 | |
kvn@476 | 226 | // don't use counts with -Xcomp or CTW |
kvn@476 | 227 | if (UseInterpreter && !CompileTheWorld) { |
kvn@476 | 228 | |
kvn@476 | 229 | if (!callee_method->has_compiled_code() && |
kvn@476 | 230 | !callee_method->was_executed_more_than(0)) { |
kvn@476 | 231 | return "never executed"; |
kvn@476 | 232 | } |
kvn@476 | 233 | |
kvn@476 | 234 | if (is_init_with_ea(callee_method, caller_method, C)) { |
kvn@476 | 235 | |
kvn@476 | 236 | // Escape Analysis: inline all executed constructors |
kvn@476 | 237 | |
kvn@476 | 238 | } else if (!callee_method->was_executed_more_than(MIN2(MinInliningThreshold, |
kvn@476 | 239 | CompileThreshold >> 1))) { |
kvn@476 | 240 | return "executed < MinInliningThreshold times"; |
kvn@476 | 241 | } |
duke@435 | 242 | } |
duke@435 | 243 | |
duke@435 | 244 | if (callee_method->should_not_inline()) { |
duke@435 | 245 | return "disallowed by CompilerOracle"; |
duke@435 | 246 | } |
duke@435 | 247 | |
kvn@1110 | 248 | if (UseStringCache) { |
kvn@1110 | 249 | // Do not inline StringCache::profile() method used only at the beginning. |
kvn@1110 | 250 | if (callee_method->name() == ciSymbol::profile_name() && |
kvn@1110 | 251 | callee_method->holder()->name() == ciSymbol::java_lang_StringCache()) { |
kvn@1110 | 252 | return "profiling method"; |
kvn@1110 | 253 | } |
kvn@1110 | 254 | } |
kvn@1110 | 255 | |
duke@435 | 256 | return NULL; |
duke@435 | 257 | } |
duke@435 | 258 | |
duke@435 | 259 | //-----------------------------try_to_inline----------------------------------- |
duke@435 | 260 | // return NULL if ok, reason for not inlining otherwise |
duke@435 | 261 | // Relocated from "InliningClosure::try_to_inline" |
kvn@476 | 262 | const char* InlineTree::try_to_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) { |
duke@435 | 263 | |
duke@435 | 264 | // Old algorithm had funny accumulating BC-size counters |
duke@435 | 265 | if (UseOldInlining && ClipInlining |
duke@435 | 266 | && (int)count_inline_bcs() >= DesiredMethodLimit) { |
duke@435 | 267 | return "size > DesiredMethodLimit"; |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | const char *msg = NULL; |
kvn@476 | 271 | if ((msg = shouldInline(callee_method, caller_method, caller_bci, |
kvn@476 | 272 | profile, wci_result)) != NULL) { |
kvn@476 | 273 | return msg; |
kvn@476 | 274 | } |
kvn@476 | 275 | if ((msg = shouldNotInline(callee_method, caller_method, |
kvn@476 | 276 | wci_result)) != NULL) { |
kvn@476 | 277 | return msg; |
kvn@476 | 278 | } |
duke@435 | 279 | |
jrose@1592 | 280 | if (InlineAccessors && callee_method->is_accessor()) { |
jrose@1592 | 281 | // accessor methods are not subject to any of the following limits. |
jrose@1592 | 282 | return NULL; |
jrose@1592 | 283 | } |
duke@435 | 284 | |
duke@435 | 285 | // suppress a few checks for accessors and trivial methods |
jrose@1592 | 286 | if (callee_method->code_size() > MaxTrivialSize) { |
kvn@476 | 287 | |
duke@435 | 288 | // don't inline into giant methods |
kvn@476 | 289 | if (C->unique() > (uint)NodeCountInliningCutoff) { |
kvn@476 | 290 | return "NodeCountInliningCutoff"; |
kvn@476 | 291 | } |
duke@435 | 292 | |
kvn@476 | 293 | if ((!UseInterpreter || CompileTheWorld) && |
kvn@476 | 294 | is_init_with_ea(callee_method, caller_method, C)) { |
kvn@476 | 295 | |
kvn@476 | 296 | // Escape Analysis stress testing when running Xcomp or CTW: |
kvn@476 | 297 | // inline constructors even if they are not reached. |
kvn@476 | 298 | |
kvn@476 | 299 | } else if (profile.count() == 0) { |
kvn@476 | 300 | // don't inline unreached call sites |
kvn@476 | 301 | return "call site not reached"; |
kvn@476 | 302 | } |
duke@435 | 303 | } |
duke@435 | 304 | |
jrose@1592 | 305 | if (!C->do_inlining() && InlineAccessors) { |
kvn@476 | 306 | return "not an accessor"; |
kvn@476 | 307 | } |
kvn@476 | 308 | if( inline_depth() > MaxInlineLevel ) { |
kvn@476 | 309 | return "inlining too deep"; |
kvn@476 | 310 | } |
duke@435 | 311 | if( method() == callee_method && |
kvn@476 | 312 | inline_depth() > MaxRecursiveInlineLevel ) { |
kvn@476 | 313 | return "recursively inlining too deep"; |
kvn@476 | 314 | } |
duke@435 | 315 | |
duke@435 | 316 | int size = callee_method->code_size(); |
duke@435 | 317 | |
duke@435 | 318 | if (UseOldInlining && ClipInlining |
duke@435 | 319 | && (int)count_inline_bcs() + size >= DesiredMethodLimit) { |
duke@435 | 320 | return "size > DesiredMethodLimit"; |
duke@435 | 321 | } |
duke@435 | 322 | |
duke@435 | 323 | // ok, inline this method |
duke@435 | 324 | return NULL; |
duke@435 | 325 | } |
duke@435 | 326 | |
duke@435 | 327 | //------------------------------pass_initial_checks---------------------------- |
duke@435 | 328 | bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method) { |
duke@435 | 329 | ciInstanceKlass *callee_holder = callee_method ? callee_method->holder() : NULL; |
duke@435 | 330 | // Check if a callee_method was suggested |
duke@435 | 331 | if( callee_method == NULL ) return false; |
duke@435 | 332 | // Check if klass of callee_method is loaded |
duke@435 | 333 | if( !callee_holder->is_loaded() ) return false; |
duke@435 | 334 | if( !callee_holder->is_initialized() ) return false; |
duke@435 | 335 | if( !UseInterpreter || CompileTheWorld /* running Xcomp or CTW */ ) { |
duke@435 | 336 | // Checks that constant pool's call site has been visited |
duke@435 | 337 | // stricter than callee_holder->is_initialized() |
duke@435 | 338 | ciBytecodeStream iter(caller_method); |
duke@435 | 339 | iter.force_bci(caller_bci); |
duke@435 | 340 | Bytecodes::Code call_bc = iter.cur_bc(); |
twisti@1572 | 341 | // An invokedynamic instruction does not have a klass. |
twisti@1572 | 342 | if (call_bc != Bytecodes::_invokedynamic) { |
twisti@1572 | 343 | int index = iter.get_index_int(); |
twisti@1572 | 344 | if (!caller_method->is_klass_loaded(index, true)) { |
twisti@1572 | 345 | return false; |
twisti@1572 | 346 | } |
twisti@1572 | 347 | // Try to do constant pool resolution if running Xcomp |
twisti@1572 | 348 | if( !caller_method->check_call(index, call_bc == Bytecodes::_invokestatic) ) { |
twisti@1572 | 349 | return false; |
twisti@1572 | 350 | } |
duke@435 | 351 | } |
duke@435 | 352 | } |
duke@435 | 353 | // We will attempt to see if a class/field/etc got properly loaded. If it |
duke@435 | 354 | // did not, it may attempt to throw an exception during our probing. Catch |
duke@435 | 355 | // and ignore such exceptions and do not attempt to compile the method. |
duke@435 | 356 | if( callee_method->should_exclude() ) return false; |
duke@435 | 357 | |
duke@435 | 358 | return true; |
duke@435 | 359 | } |
duke@435 | 360 | |
duke@435 | 361 | #ifndef PRODUCT |
duke@435 | 362 | //------------------------------print_inlining--------------------------------- |
duke@435 | 363 | // Really, the failure_msg can be a success message also. |
duke@435 | 364 | void InlineTree::print_inlining(ciMethod *callee_method, int caller_bci, const char *failure_msg) const { |
duke@435 | 365 | print_indent(inline_depth()); |
duke@435 | 366 | tty->print("@ %d ", caller_bci); |
duke@435 | 367 | if( callee_method ) callee_method->print_short_name(); |
duke@435 | 368 | else tty->print(" callee not monotonic or profiled"); |
duke@435 | 369 | tty->print(" %s", (failure_msg ? failure_msg : "inline")); |
duke@435 | 370 | if( Verbose && callee_method ) { |
duke@435 | 371 | const InlineTree *top = this; |
duke@435 | 372 | while( top->caller_tree() != NULL ) { top = top->caller_tree(); } |
duke@435 | 373 | tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count()); |
duke@435 | 374 | } |
duke@435 | 375 | tty->cr(); |
duke@435 | 376 | } |
duke@435 | 377 | #endif |
duke@435 | 378 | |
duke@435 | 379 | //------------------------------ok_to_inline----------------------------------- |
duke@435 | 380 | WarmCallInfo* InlineTree::ok_to_inline(ciMethod* callee_method, JVMState* jvms, ciCallProfile& profile, WarmCallInfo* initial_wci) { |
duke@435 | 381 | assert(callee_method != NULL, "caller checks for optimized virtual!"); |
duke@435 | 382 | #ifdef ASSERT |
duke@435 | 383 | // Make sure the incoming jvms has the same information content as me. |
duke@435 | 384 | // This means that we can eventually make this whole class AllStatic. |
duke@435 | 385 | if (jvms->caller() == NULL) { |
duke@435 | 386 | assert(_caller_jvms == NULL, "redundant instance state"); |
duke@435 | 387 | } else { |
duke@435 | 388 | assert(_caller_jvms->same_calls_as(jvms->caller()), "redundant instance state"); |
duke@435 | 389 | } |
duke@435 | 390 | assert(_method == jvms->method(), "redundant instance state"); |
duke@435 | 391 | #endif |
duke@435 | 392 | const char *failure_msg = NULL; |
duke@435 | 393 | int caller_bci = jvms->bci(); |
duke@435 | 394 | ciMethod *caller_method = jvms->method(); |
duke@435 | 395 | |
duke@435 | 396 | if( !pass_initial_checks(caller_method, caller_bci, callee_method)) { |
duke@435 | 397 | if( PrintInlining ) { |
duke@435 | 398 | failure_msg = "failed_initial_checks"; |
duke@435 | 399 | print_inlining( callee_method, caller_bci, failure_msg); |
duke@435 | 400 | } |
duke@435 | 401 | return NULL; |
duke@435 | 402 | } |
duke@435 | 403 | |
duke@435 | 404 | // Check if inlining policy says no. |
duke@435 | 405 | WarmCallInfo wci = *(initial_wci); |
kvn@476 | 406 | failure_msg = try_to_inline(callee_method, caller_method, caller_bci, profile, &wci); |
duke@435 | 407 | if (failure_msg != NULL && C->log() != NULL) { |
duke@435 | 408 | C->log()->begin_elem("inline_fail reason='"); |
duke@435 | 409 | C->log()->text("%s", failure_msg); |
duke@435 | 410 | C->log()->end_elem("'"); |
duke@435 | 411 | } |
duke@435 | 412 | |
duke@435 | 413 | #ifndef PRODUCT |
duke@435 | 414 | if (UseOldInlining && InlineWarmCalls |
duke@435 | 415 | && (PrintOpto || PrintOptoInlining || PrintInlining)) { |
duke@435 | 416 | bool cold = wci.is_cold(); |
duke@435 | 417 | bool hot = !cold && wci.is_hot(); |
duke@435 | 418 | bool old_cold = (failure_msg != NULL); |
duke@435 | 419 | if (old_cold != cold || (Verbose || WizardMode)) { |
duke@435 | 420 | tty->print(" OldInlining= %4s : %s\n WCI=", |
duke@435 | 421 | old_cold ? "cold" : "hot", failure_msg ? failure_msg : "OK"); |
duke@435 | 422 | wci.print(); |
duke@435 | 423 | } |
duke@435 | 424 | } |
duke@435 | 425 | #endif |
duke@435 | 426 | if (UseOldInlining) { |
duke@435 | 427 | if (failure_msg == NULL) |
duke@435 | 428 | wci = *(WarmCallInfo::always_hot()); |
duke@435 | 429 | else |
duke@435 | 430 | wci = *(WarmCallInfo::always_cold()); |
duke@435 | 431 | } |
duke@435 | 432 | if (!InlineWarmCalls) { |
duke@435 | 433 | if (!wci.is_cold() && !wci.is_hot()) { |
duke@435 | 434 | // Do not inline the warm calls. |
duke@435 | 435 | wci = *(WarmCallInfo::always_cold()); |
duke@435 | 436 | } |
duke@435 | 437 | } |
duke@435 | 438 | |
duke@435 | 439 | if (!wci.is_cold()) { |
duke@435 | 440 | // In -UseOldInlining, the failure_msg may also be a success message. |
duke@435 | 441 | if (failure_msg == NULL) failure_msg = "inline (hot)"; |
duke@435 | 442 | |
duke@435 | 443 | // Inline! |
duke@435 | 444 | if( PrintInlining ) print_inlining( callee_method, caller_bci, failure_msg); |
duke@435 | 445 | if (UseOldInlining) |
duke@435 | 446 | build_inline_tree_for_callee(callee_method, jvms, caller_bci); |
duke@435 | 447 | if (InlineWarmCalls && !wci.is_hot()) |
duke@435 | 448 | return new (C) WarmCallInfo(wci); // copy to heap |
duke@435 | 449 | return WarmCallInfo::always_hot(); |
duke@435 | 450 | } |
duke@435 | 451 | |
duke@435 | 452 | // Do not inline |
duke@435 | 453 | if (failure_msg == NULL) failure_msg = "too cold to inline"; |
duke@435 | 454 | if( PrintInlining ) print_inlining( callee_method, caller_bci, failure_msg); |
duke@435 | 455 | return NULL; |
duke@435 | 456 | } |
duke@435 | 457 | |
duke@435 | 458 | //------------------------------compute_callee_frequency----------------------- |
duke@435 | 459 | float InlineTree::compute_callee_frequency( int caller_bci ) const { |
duke@435 | 460 | int count = method()->interpreter_call_site_count(caller_bci); |
duke@435 | 461 | int invcnt = method()->interpreter_invocation_count(); |
duke@435 | 462 | float freq = (float)count/(float)invcnt; |
duke@435 | 463 | // Call-site count / interpreter invocation count, scaled recursively. |
duke@435 | 464 | // Always between 0.0 and 1.0. Represents the percentage of the method's |
duke@435 | 465 | // total execution time used at this call site. |
duke@435 | 466 | |
duke@435 | 467 | return freq; |
duke@435 | 468 | } |
duke@435 | 469 | |
duke@435 | 470 | //------------------------------build_inline_tree_for_callee------------------- |
duke@435 | 471 | InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) { |
duke@435 | 472 | float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci); |
duke@435 | 473 | // Attempt inlining. |
duke@435 | 474 | InlineTree* old_ilt = callee_at(caller_bci, callee_method); |
duke@435 | 475 | if (old_ilt != NULL) { |
duke@435 | 476 | return old_ilt; |
duke@435 | 477 | } |
jrose@1592 | 478 | int new_depth_adjust = 0; |
jrose@1592 | 479 | if (caller_jvms->method() != NULL) { |
jrose@1592 | 480 | if ((caller_jvms->method()->name() == ciSymbol::invoke_name() && |
jrose@1592 | 481 | caller_jvms->method()->holder()->name() == ciSymbol::java_dyn_MethodHandle()) |
jrose@1592 | 482 | || caller_jvms->method()->holder()->name() == ciSymbol::java_dyn_InvokeDynamic()) |
jrose@1592 | 483 | /* @@@ FIXME: |
jrose@1592 | 484 | if (caller_jvms->method()->is_method_handle_adapter()) |
jrose@1592 | 485 | */ |
jrose@1592 | 486 | new_depth_adjust -= 1; // don't count actions in MH or indy adapter frames |
jrose@1592 | 487 | else if (callee_method->is_method_handle_invoke()) { |
jrose@1592 | 488 | new_depth_adjust -= 1; // don't count method handle calls from java.dyn implem |
jrose@1592 | 489 | } |
jrose@1592 | 490 | if (new_depth_adjust != 0 && PrintInlining) { |
jrose@1592 | 491 | stringStream nm1; caller_jvms->method()->print_name(&nm1); |
jrose@1592 | 492 | stringStream nm2; callee_method->print_name(&nm2); |
jrose@1592 | 493 | tty->print_cr("discounting inlining depth from %s to %s", nm1.base(), nm2.base()); |
jrose@1592 | 494 | } |
jrose@1592 | 495 | if (new_depth_adjust != 0 && C->log()) { |
jrose@1592 | 496 | int id1 = C->log()->identify(caller_jvms->method()); |
jrose@1592 | 497 | int id2 = C->log()->identify(callee_method); |
jrose@1592 | 498 | C->log()->elem("inline_depth_discount caller='%d' callee='%d'", id1, id2); |
jrose@1592 | 499 | } |
jrose@1592 | 500 | } |
jrose@1592 | 501 | InlineTree *ilt = new InlineTree(C, this, callee_method, caller_jvms, caller_bci, recur_frequency, _site_depth_adjust + new_depth_adjust); |
duke@435 | 502 | _subtrees.append( ilt ); |
duke@435 | 503 | |
duke@435 | 504 | NOT_PRODUCT( _count_inlines += 1; ) |
duke@435 | 505 | |
duke@435 | 506 | return ilt; |
duke@435 | 507 | } |
duke@435 | 508 | |
duke@435 | 509 | |
duke@435 | 510 | //---------------------------------------callee_at----------------------------- |
duke@435 | 511 | InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const { |
duke@435 | 512 | for (int i = 0; i < _subtrees.length(); i++) { |
duke@435 | 513 | InlineTree* sub = _subtrees.at(i); |
duke@435 | 514 | if (sub->caller_bci() == bci && callee == sub->method()) { |
duke@435 | 515 | return sub; |
duke@435 | 516 | } |
duke@435 | 517 | } |
duke@435 | 518 | return NULL; |
duke@435 | 519 | } |
duke@435 | 520 | |
duke@435 | 521 | |
duke@435 | 522 | //------------------------------build_inline_tree_root------------------------- |
duke@435 | 523 | InlineTree *InlineTree::build_inline_tree_root() { |
duke@435 | 524 | Compile* C = Compile::current(); |
duke@435 | 525 | |
duke@435 | 526 | // Root of inline tree |
jrose@1592 | 527 | InlineTree *ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F, 0); |
duke@435 | 528 | |
duke@435 | 529 | return ilt; |
duke@435 | 530 | } |
duke@435 | 531 | |
duke@435 | 532 | |
duke@435 | 533 | //-------------------------find_subtree_from_root----------------------------- |
duke@435 | 534 | // Given a jvms, which determines a call chain from the root method, |
duke@435 | 535 | // find the corresponding inline tree. |
duke@435 | 536 | // Note: This method will be removed or replaced as InlineTree goes away. |
duke@435 | 537 | InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee, bool create_if_not_found) { |
duke@435 | 538 | InlineTree* iltp = root; |
duke@435 | 539 | uint depth = jvms && jvms->has_method() ? jvms->depth() : 0; |
duke@435 | 540 | for (uint d = 1; d <= depth; d++) { |
duke@435 | 541 | JVMState* jvmsp = jvms->of_depth(d); |
duke@435 | 542 | // Select the corresponding subtree for this bci. |
duke@435 | 543 | assert(jvmsp->method() == iltp->method(), "tree still in sync"); |
duke@435 | 544 | ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method(); |
duke@435 | 545 | InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee); |
duke@435 | 546 | if (!sub) { |
duke@435 | 547 | if (create_if_not_found && d == depth) { |
duke@435 | 548 | return iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci()); |
duke@435 | 549 | } |
duke@435 | 550 | assert(sub != NULL, "should be a sub-ilt here"); |
duke@435 | 551 | return NULL; |
duke@435 | 552 | } |
duke@435 | 553 | iltp = sub; |
duke@435 | 554 | } |
duke@435 | 555 | return iltp; |
duke@435 | 556 | } |