1 /* 2 * Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "ci/ciReplay.hpp" 27 #include "classfile/systemDictionary.hpp" 28 #include "classfile/vmSymbols.hpp" 29 #include "compiler/compileBroker.hpp" 30 #include "compiler/compileLog.hpp" 31 #include "interpreter/linkResolver.hpp" 32 #include "oops/objArrayKlass.hpp" 33 #include "opto/callGenerator.hpp" 34 #include "opto/parse.hpp" 35 #include "runtime/handles.inline.hpp" 36 37 //============================================================================= 38 //------------------------------InlineTree------------------------------------- 39 InlineTree::InlineTree(Compile* c, 40 const InlineTree *caller_tree, ciMethod* callee, 41 JVMState* caller_jvms, int caller_bci, 42 float site_invoke_ratio, int max_inline_level) : 43 C(c), 44 _caller_jvms(caller_jvms), 45 _caller_tree((InlineTree*) caller_tree), 46 _method(callee), 47 _site_invoke_ratio(site_invoke_ratio), 48 _max_inline_level(max_inline_level), 49 _count_inline_bcs(method()->code_size_for_inlining()), 50 _subtrees(c->comp_arena(), 2, 0, NULL), 51 _msg(NULL) 52 { 53 NOT_PRODUCT(_count_inlines = 0;) 54 if (_caller_jvms != NULL) { 55 // Keep a private copy of the caller_jvms: 56 _caller_jvms = new (C) JVMState(caller_jvms->method(), caller_tree->caller_jvms()); 57 _caller_jvms->set_bci(caller_jvms->bci()); 58 assert(!caller_jvms->should_reexecute(), "there should be no reexecute bytecode with inlining"); 59 } 60 assert(_caller_jvms->same_calls_as(caller_jvms), "consistent JVMS"); 61 assert((caller_tree == NULL ? 0 : caller_tree->stack_depth() + 1) == stack_depth(), "correct (redundant) depth parameter"); 62 assert(caller_bci == this->caller_bci(), "correct (redundant) bci parameter"); 63 if (UseOldInlining) { 64 // Update hierarchical counts, count_inline_bcs() and count_inlines() 65 InlineTree *caller = (InlineTree *)caller_tree; 66 for( ; caller != NULL; caller = ((InlineTree *)(caller->caller_tree())) ) { 67 caller->_count_inline_bcs += count_inline_bcs(); 68 NOT_PRODUCT(caller->_count_inlines++;) 69 } 70 } 71 } 72 73 InlineTree::InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, 74 float site_invoke_ratio, int max_inline_level) : 75 C(c), 76 _caller_jvms(caller_jvms), 77 _caller_tree(NULL), 78 _method(callee_method), 79 _site_invoke_ratio(site_invoke_ratio), 80 _max_inline_level(max_inline_level), 81 _count_inline_bcs(method()->code_size()), 82 _msg(NULL) 83 { 84 NOT_PRODUCT(_count_inlines = 0;) 85 assert(!UseOldInlining, "do not use for old stuff"); 86 } 87 88 /** 89 * Return true when EA is ON and a java constructor is called or 90 * a super constructor is called from an inlined java constructor. 91 * Also return true for boxing methods. 92 */ 93 static bool is_init_with_ea(ciMethod* callee_method, 94 ciMethod* caller_method, Compile* C) { 95 if (!C->do_escape_analysis() || !EliminateAllocations) { 96 return false; // EA is off 97 } 98 if (callee_method->is_initializer()) { 99 return true; // constuctor 100 } 101 if (caller_method->is_initializer() && 102 caller_method != C->method() && 103 caller_method->holder()->is_subclass_of(callee_method->holder())) { 104 return true; // super constructor is called from inlined constructor 105 } 106 if (C->eliminate_boxing() && callee_method->is_boxing_method()) { 107 return true; 108 } 109 return false; 110 } 111 112 /** 113 * Force inlining unboxing accessor. 114 */ 115 static bool is_unboxing_method(ciMethod* callee_method, Compile* C) { 116 return C->eliminate_boxing() && callee_method->is_unboxing_method(); 117 } 118 119 // positive filter: should callee be inlined? 120 bool InlineTree::should_inline(ciMethod* callee_method, ciMethod* caller_method, 121 int caller_bci, ciCallProfile& profile, 122 WarmCallInfo* wci_result) { 123 // Allows targeted inlining 124 if(callee_method->should_inline()) { 125 *wci_result = *(WarmCallInfo::always_hot()); 126 if (PrintInlining && Verbose) { 127 CompileTask::print_inline_indent(inline_level()); 128 tty->print_cr("Inlined method is hot: "); 129 } 130 set_msg("force inline by CompilerOracle"); 131 return true; 132 } 133 134 int size = callee_method->code_size_for_inlining(); 135 136 // Check for too many throws (and not too huge) 137 if(callee_method->interpreter_throwout_count() > InlineThrowCount && 138 size < InlineThrowMaxSize ) { 139 wci_result->set_profit(wci_result->profit() * 100); 140 if (PrintInlining && Verbose) { 141 CompileTask::print_inline_indent(inline_level()); 142 tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count()); 143 } 144 set_msg("many throws"); 145 return true; 146 } 147 148 if (!UseOldInlining) { 149 set_msg("!UseOldInlining"); 150 return true; // size and frequency are represented in a new way 151 } 152 153 int default_max_inline_size = C->max_inline_size(); 154 int inline_small_code_size = InlineSmallCode / 4; 155 int max_inline_size = default_max_inline_size; 156 157 int call_site_count = method()->scale_count(profile.count()); 158 int invoke_count = method()->interpreter_invocation_count(); 159 160 assert(invoke_count != 0, "require invocation count greater than zero"); 161 int freq = call_site_count / invoke_count; 162 163 // bump the max size if the call is frequent 164 if ((freq >= InlineFrequencyRatio) || 165 (call_site_count >= InlineFrequencyCount) || 166 is_unboxing_method(callee_method, C) || 167 is_init_with_ea(callee_method, caller_method, C)) { 168 169 max_inline_size = C->freq_inline_size(); 170 if (size <= max_inline_size && TraceFrequencyInlining) { 171 CompileTask::print_inline_indent(inline_level()); 172 tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count); 173 CompileTask::print_inline_indent(inline_level()); 174 callee_method->print(); 175 tty->cr(); 176 } 177 } else { 178 // Not hot. Check for medium-sized pre-existing nmethod at cold sites. 179 if (callee_method->has_compiled_code() && 180 callee_method->instructions_size() > inline_small_code_size) { 181 set_msg("already compiled into a medium method"); 182 return false; 183 } 184 } 185 if (size > max_inline_size) { 186 if (max_inline_size > default_max_inline_size) { 187 set_msg("hot method too big"); 188 } else { 189 set_msg("too big"); 190 } 191 return false; 192 } 193 return true; 194 } 195 196 197 // negative filter: should callee NOT be inlined? 198 bool InlineTree::should_not_inline(ciMethod *callee_method, 199 ciMethod* caller_method, 200 WarmCallInfo* wci_result) { 201 202 const char* fail_msg = NULL; 203 204 // First check all inlining restrictions which are required for correctness 205 if ( callee_method->is_abstract()) { 206 fail_msg = "abstract method"; // // note: we allow ik->is_abstract() 207 } else if (!callee_method->holder()->is_initialized()) { 208 fail_msg = "method holder not initialized"; 209 } else if ( callee_method->is_native()) { 210 fail_msg = "native method"; 211 } else if ( callee_method->dont_inline()) { 212 fail_msg = "don't inline by annotation"; 213 } 214 215 if (!UseOldInlining) { 216 if (fail_msg != NULL) { 217 *wci_result = *(WarmCallInfo::always_cold()); 218 set_msg(fail_msg); 219 return true; 220 } 221 222 if (callee_method->has_unloaded_classes_in_signature()) { 223 wci_result->set_profit(wci_result->profit() * 0.1); 224 } 225 226 // don't inline exception code unless the top method belongs to an 227 // exception class 228 if (callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { 229 ciMethod* top_method = caller_jvms() ? caller_jvms()->of_depth(1)->method() : method(); 230 if (!top_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { 231 wci_result->set_profit(wci_result->profit() * 0.1); 232 } 233 } 234 235 if (callee_method->has_compiled_code() && 236 callee_method->instructions_size() > InlineSmallCode) { 237 wci_result->set_profit(wci_result->profit() * 0.1); 238 // %%% adjust wci_result->size()? 239 } 240 241 return false; 242 } 243 244 // one more inlining restriction 245 if (fail_msg == NULL && callee_method->has_unloaded_classes_in_signature()) { 246 fail_msg = "unloaded signature classes"; 247 } 248 249 if (fail_msg != NULL) { 250 set_msg(fail_msg); 251 return true; 252 } 253 254 // ignore heuristic controls on inlining 255 if (callee_method->should_inline()) { 256 set_msg("force inline by CompilerOracle"); 257 return false; 258 } 259 260 if (callee_method->should_not_inline()) { 261 set_msg("disallowed by CompilerOracle"); 262 return true; 263 } 264 265 #ifndef PRODUCT 266 if (ciReplay::should_not_inline(callee_method)) { 267 set_msg("disallowed by ciReplay"); 268 return true; 269 } 270 #endif 271 272 // Now perform checks which are heuristic 273 274 if (is_unboxing_method(callee_method, C)) { 275 // Inline unboxing methods. 276 return false; 277 } 278 279 if (!callee_method->force_inline()) { 280 if (callee_method->has_compiled_code() && 281 callee_method->instructions_size() > InlineSmallCode) { 282 set_msg("already compiled into a big method"); 283 return true; 284 } 285 } 286 287 // don't inline exception code unless the top method belongs to an 288 // exception class 289 if (caller_tree() != NULL && 290 callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { 291 const InlineTree *top = this; 292 while (top->caller_tree() != NULL) top = top->caller_tree(); 293 ciInstanceKlass* k = top->method()->holder(); 294 if (!k->is_subclass_of(C->env()->Throwable_klass())) { 295 set_msg("exception method"); 296 return true; 297 } 298 } 299 300 if (UseStringCache) { 301 // Do not inline StringCache::profile() method used only at the beginning. 302 if (callee_method->name() == ciSymbol::profile_name() && 303 callee_method->holder()->name() == ciSymbol::java_lang_StringCache()) { 304 set_msg("profiling method"); 305 return true; 306 } 307 } 308 309 // use frequency-based objections only for non-trivial methods 310 if (callee_method->code_size() <= MaxTrivialSize) { 311 return false; 312 } 313 314 // don't use counts with -Xcomp or CTW 315 if (UseInterpreter && !CompileTheWorld) { 316 317 if (!callee_method->has_compiled_code() && 318 !callee_method->was_executed_more_than(0)) { 319 set_msg("never executed"); 320 return true; 321 } 322 323 if (is_init_with_ea(callee_method, caller_method, C)) { 324 // Escape Analysis: inline all executed constructors 325 return false; 326 } else if (!callee_method->was_executed_more_than(MIN2(MinInliningThreshold, 327 CompileThreshold >> 1))) { 328 set_msg("executed < MinInliningThreshold times"); 329 return true; 330 } 331 } 332 333 return false; 334 } 335 336 //-----------------------------try_to_inline----------------------------------- 337 // return true if ok 338 // Relocated from "InliningClosure::try_to_inline" 339 bool InlineTree::try_to_inline(ciMethod* callee_method, ciMethod* caller_method, 340 int caller_bci, ciCallProfile& profile, 341 WarmCallInfo* wci_result, bool& should_delay) { 342 343 // Old algorithm had funny accumulating BC-size counters 344 if (UseOldInlining && ClipInlining 345 && (int)count_inline_bcs() >= DesiredMethodLimit) { 346 if (!callee_method->force_inline() || !IncrementalInline) { 347 set_msg("size > DesiredMethodLimit"); 348 return false; 349 } else if (!C->inlining_incrementally()) { 350 should_delay = true; 351 } 352 } 353 354 if (!should_inline(callee_method, caller_method, caller_bci, profile, 355 wci_result)) { 356 return false; 357 } 358 if (should_not_inline(callee_method, caller_method, wci_result)) { 359 return false; 360 } 361 362 if (InlineAccessors && callee_method->is_accessor()) { 363 // accessor methods are not subject to any of the following limits. 364 set_msg("accessor"); 365 return true; 366 } 367 368 // suppress a few checks for accessors and trivial methods 369 if (callee_method->code_size() > MaxTrivialSize) { 370 371 // don't inline into giant methods 372 if (C->over_inlining_cutoff()) { 373 if ((!callee_method->force_inline() && !caller_method->is_compiled_lambda_form()) 374 || !IncrementalInline) { 375 set_msg("NodeCountInliningCutoff"); 376 return false; 377 } else { 378 should_delay = true; 379 } 380 } 381 382 if ((!UseInterpreter || CompileTheWorld) && 383 is_init_with_ea(callee_method, caller_method, C)) { 384 385 // Escape Analysis stress testing when running Xcomp or CTW: 386 // inline constructors even if they are not reached. 387 388 } else if (profile.count() == 0) { 389 // don't inline unreached call sites 390 set_msg("call site not reached"); 391 return false; 392 } 393 } 394 395 if (!C->do_inlining() && InlineAccessors) { 396 set_msg("not an accessor"); 397 return false; 398 } 399 if (inline_level() > _max_inline_level) { 400 if (!callee_method->force_inline() || !IncrementalInline) { 401 set_msg("inlining too deep"); 402 return false; 403 } else if (!C->inlining_incrementally()) { 404 should_delay = true; 405 } 406 } 407 408 // detect direct and indirect recursive inlining 409 if (!callee_method->is_compiled_lambda_form()) { 410 // count the current method and the callee 411 int inline_level = (method() == callee_method) ? 1 : 0; 412 if (inline_level > MaxRecursiveInlineLevel) { 413 set_msg("recursively inlining too deep"); 414 return false; 415 } 416 // count callers of current method and callee 417 JVMState* jvms = caller_jvms(); 418 while (jvms != NULL && jvms->has_method()) { 419 if (jvms->method() == callee_method) { 420 inline_level++; 421 if (inline_level > MaxRecursiveInlineLevel) { 422 set_msg("recursively inlining too deep"); 423 return false; 424 } 425 } 426 jvms = jvms->caller(); 427 } 428 } 429 430 int size = callee_method->code_size_for_inlining(); 431 432 if (UseOldInlining && ClipInlining 433 && (int)count_inline_bcs() + size >= DesiredMethodLimit) { 434 if (!callee_method->force_inline() || !IncrementalInline) { 435 set_msg("size > DesiredMethodLimit"); 436 return false; 437 } else if (!C->inlining_incrementally()) { 438 should_delay = true; 439 } 440 } 441 442 // ok, inline this method 443 return true; 444 } 445 446 //------------------------------pass_initial_checks---------------------------- 447 bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method) { 448 ciInstanceKlass *callee_holder = callee_method ? callee_method->holder() : NULL; 449 // Check if a callee_method was suggested 450 if( callee_method == NULL ) return false; 451 // Check if klass of callee_method is loaded 452 if( !callee_holder->is_loaded() ) return false; 453 if( !callee_holder->is_initialized() ) return false; 454 if( !UseInterpreter || CompileTheWorld /* running Xcomp or CTW */ ) { 455 // Checks that constant pool's call site has been visited 456 // stricter than callee_holder->is_initialized() 457 ciBytecodeStream iter(caller_method); 458 iter.force_bci(caller_bci); 459 Bytecodes::Code call_bc = iter.cur_bc(); 460 // An invokedynamic instruction does not have a klass. 461 if (call_bc != Bytecodes::_invokedynamic) { 462 int index = iter.get_index_u2_cpcache(); 463 if (!caller_method->is_klass_loaded(index, true)) { 464 return false; 465 } 466 // Try to do constant pool resolution if running Xcomp 467 if( !caller_method->check_call(index, call_bc == Bytecodes::_invokestatic) ) { 468 return false; 469 } 470 } 471 } 472 // We will attempt to see if a class/field/etc got properly loaded. If it 473 // did not, it may attempt to throw an exception during our probing. Catch 474 // and ignore such exceptions and do not attempt to compile the method. 475 if( callee_method->should_exclude() ) return false; 476 477 return true; 478 } 479 480 //------------------------------check_can_parse-------------------------------- 481 const char* InlineTree::check_can_parse(ciMethod* callee) { 482 // Certain methods cannot be parsed at all: 483 if ( callee->is_native()) return "native method"; 484 if ( callee->is_abstract()) return "abstract method"; 485 if (!callee->can_be_compiled()) return "not compilable (disabled)"; 486 if (!callee->has_balanced_monitors()) return "not compilable (unbalanced monitors)"; 487 if ( callee->get_flow_analysis()->failing()) return "not compilable (flow analysis failed)"; 488 return NULL; 489 } 490 491 //------------------------------print_inlining--------------------------------- 492 void InlineTree::print_inlining(ciMethod* callee_method, int caller_bci, 493 bool success) const { 494 const char* inline_msg = msg(); 495 assert(inline_msg != NULL, "just checking"); 496 if (C->log() != NULL) { 497 if (success) { 498 C->log()->inline_success(inline_msg); 499 } else { 500 C->log()->inline_fail(inline_msg); 501 } 502 } 503 if (PrintInlining) { 504 C->print_inlining(callee_method, inline_level(), caller_bci, inline_msg); 505 if (callee_method == NULL) tty->print(" callee not monotonic or profiled"); 506 if (Verbose && callee_method) { 507 const InlineTree *top = this; 508 while( top->caller_tree() != NULL ) { top = top->caller_tree(); } 509 //tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count()); 510 } 511 } 512 } 513 514 //------------------------------ok_to_inline----------------------------------- 515 WarmCallInfo* InlineTree::ok_to_inline(ciMethod* callee_method, JVMState* jvms, ciCallProfile& profile, WarmCallInfo* initial_wci, bool& should_delay) { 516 assert(callee_method != NULL, "caller checks for optimized virtual!"); 517 assert(!should_delay, "should be initialized to false"); 518 #ifdef ASSERT 519 // Make sure the incoming jvms has the same information content as me. 520 // This means that we can eventually make this whole class AllStatic. 521 if (jvms->caller() == NULL) { 522 assert(_caller_jvms == NULL, "redundant instance state"); 523 } else { 524 assert(_caller_jvms->same_calls_as(jvms->caller()), "redundant instance state"); 525 } 526 assert(_method == jvms->method(), "redundant instance state"); 527 #endif 528 int caller_bci = jvms->bci(); 529 ciMethod* caller_method = jvms->method(); 530 531 // Do some initial checks. 532 if (!pass_initial_checks(caller_method, caller_bci, callee_method)) { 533 set_msg("failed initial checks"); 534 print_inlining(callee_method, caller_bci, false /* !success */); 535 return NULL; 536 } 537 538 // Do some parse checks. 539 set_msg(check_can_parse(callee_method)); 540 if (msg() != NULL) { 541 print_inlining(callee_method, caller_bci, false /* !success */); 542 return NULL; 543 } 544 545 // Check if inlining policy says no. 546 WarmCallInfo wci = *(initial_wci); 547 bool success = try_to_inline(callee_method, caller_method, caller_bci, 548 profile, &wci, should_delay); 549 550 #ifndef PRODUCT 551 if (UseOldInlining && InlineWarmCalls 552 && (PrintOpto || PrintOptoInlining || PrintInlining)) { 553 bool cold = wci.is_cold(); 554 bool hot = !cold && wci.is_hot(); 555 bool old_cold = !success; 556 if (old_cold != cold || (Verbose || WizardMode)) { 557 if (msg() == NULL) { 558 set_msg("OK"); 559 } 560 tty->print(" OldInlining= %4s : %s\n WCI=", 561 old_cold ? "cold" : "hot", msg()); 562 wci.print(); 563 } 564 } 565 #endif 566 if (UseOldInlining) { 567 if (success) { 568 wci = *(WarmCallInfo::always_hot()); 569 } else { 570 wci = *(WarmCallInfo::always_cold()); 571 } 572 } 573 if (!InlineWarmCalls) { 574 if (!wci.is_cold() && !wci.is_hot()) { 575 // Do not inline the warm calls. 576 wci = *(WarmCallInfo::always_cold()); 577 } 578 } 579 580 if (!wci.is_cold()) { 581 // Inline! 582 if (msg() == NULL) { 583 set_msg("inline (hot)"); 584 } 585 print_inlining(callee_method, caller_bci, true /* success */); 586 if (UseOldInlining) 587 build_inline_tree_for_callee(callee_method, jvms, caller_bci); 588 if (InlineWarmCalls && !wci.is_hot()) 589 return new (C) WarmCallInfo(wci); // copy to heap 590 return WarmCallInfo::always_hot(); 591 } 592 593 // Do not inline 594 if (msg() == NULL) { 595 set_msg("too cold to inline"); 596 } 597 print_inlining(callee_method, caller_bci, false /* !success */ ); 598 return NULL; 599 } 600 601 //------------------------------compute_callee_frequency----------------------- 602 float InlineTree::compute_callee_frequency( int caller_bci ) const { 603 int count = method()->interpreter_call_site_count(caller_bci); 604 int invcnt = method()->interpreter_invocation_count(); 605 float freq = (float)count/(float)invcnt; 606 // Call-site count / interpreter invocation count, scaled recursively. 607 // Always between 0.0 and 1.0. Represents the percentage of the method's 608 // total execution time used at this call site. 609 610 return freq; 611 } 612 613 //------------------------------build_inline_tree_for_callee------------------- 614 InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) { 615 float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci); 616 // Attempt inlining. 617 InlineTree* old_ilt = callee_at(caller_bci, callee_method); 618 if (old_ilt != NULL) { 619 return old_ilt; 620 } 621 int max_inline_level_adjust = 0; 622 if (caller_jvms->method() != NULL) { 623 if (caller_jvms->method()->is_compiled_lambda_form()) 624 max_inline_level_adjust += 1; // don't count actions in MH or indy adapter frames 625 else if (callee_method->is_method_handle_intrinsic() || 626 callee_method->is_compiled_lambda_form()) { 627 max_inline_level_adjust += 1; // don't count method handle calls from java.lang.invoke implem 628 } 629 if (max_inline_level_adjust != 0 && PrintInlining && (Verbose || WizardMode)) { 630 CompileTask::print_inline_indent(inline_level()); 631 tty->print_cr(" \\-> discounting inline depth"); 632 } 633 if (max_inline_level_adjust != 0 && C->log()) { 634 int id1 = C->log()->identify(caller_jvms->method()); 635 int id2 = C->log()->identify(callee_method); 636 C->log()->elem("inline_level_discount caller='%d' callee='%d'", id1, id2); 637 } 638 } 639 InlineTree* ilt = new InlineTree(C, this, callee_method, caller_jvms, caller_bci, recur_frequency, _max_inline_level + max_inline_level_adjust); 640 _subtrees.append(ilt); 641 642 NOT_PRODUCT( _count_inlines += 1; ) 643 644 return ilt; 645 } 646 647 648 //---------------------------------------callee_at----------------------------- 649 InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const { 650 for (int i = 0; i < _subtrees.length(); i++) { 651 InlineTree* sub = _subtrees.at(i); 652 if (sub->caller_bci() == bci && callee == sub->method()) { 653 return sub; 654 } 655 } 656 return NULL; 657 } 658 659 660 //------------------------------build_inline_tree_root------------------------- 661 InlineTree *InlineTree::build_inline_tree_root() { 662 Compile* C = Compile::current(); 663 664 // Root of inline tree 665 InlineTree* ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F, MaxInlineLevel); 666 667 return ilt; 668 } 669 670 671 //-------------------------find_subtree_from_root----------------------------- 672 // Given a jvms, which determines a call chain from the root method, 673 // find the corresponding inline tree. 674 // Note: This method will be removed or replaced as InlineTree goes away. 675 InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee) { 676 InlineTree* iltp = root; 677 uint depth = jvms && jvms->has_method() ? jvms->depth() : 0; 678 for (uint d = 1; d <= depth; d++) { 679 JVMState* jvmsp = jvms->of_depth(d); 680 // Select the corresponding subtree for this bci. 681 assert(jvmsp->method() == iltp->method(), "tree still in sync"); 682 ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method(); 683 InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee); 684 if (sub == NULL) { 685 if (d == depth) { 686 sub = iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci()); 687 } 688 guarantee(sub != NULL, "should be a sub-ilt here"); 689 return sub; 690 } 691 iltp = sub; 692 } 693 return iltp; 694 } 695 696 697 698 #ifndef PRODUCT 699 void InlineTree::print_impl(outputStream* st, int indent) const { 700 for (int i = 0; i < indent; i++) st->print(" "); 701 st->print(" @ %d ", caller_bci()); 702 method()->print_short_name(st); 703 st->cr(); 704 705 for (int i = 0 ; i < _subtrees.length(); i++) { 706 _subtrees.at(i)->print_impl(st, indent + 2); 707 } 708 } 709 710 void InlineTree::print_value_on(outputStream* st) const { 711 print_impl(st, 2); 712 } 713 #endif