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