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