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