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