1 /*
2 * Copyright (c) 1998, 2019, 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 // Update hierarchical counts, count_inline_bcs() and count_inlines()
67 InlineTree *caller = (InlineTree *)caller_tree;
68 for( ; caller != NULL; caller = ((InlineTree *)(caller->caller_tree())) ) {
69 caller->_count_inline_bcs += count_inline_bcs();
70 NOT_PRODUCT(caller->_count_inlines++;)
71 }
72 }
73
74 /**
75 * Return true when EA is ON and a java constructor is called or
76 * a super constructor is called from an inlined java constructor.
77 * Also return true for boxing methods.
78 */
79 static bool is_init_with_ea(ciMethod* callee_method,
80 ciMethod* caller_method, Compile* C) {
81 if (!C->do_escape_analysis() || !EliminateAllocations) {
82 return false; // EA is off
83 }
84 if (callee_method->is_initializer()) {
85 return true; // constuctor
86 }
87 if (caller_method->is_initializer() &&
88 caller_method != C->method() &&
89 caller_method->holder()->is_subclass_of(callee_method->holder())) {
90 return true; // super constructor is called from inlined constructor
91 }
92 if (C->eliminate_boxing() && callee_method->is_boxing_method()) {
93 return true;
94 }
95 return false;
96 }
97
98 /**
99 * Force inlining unboxing accessor.
100 */
101 static bool is_unboxing_method(ciMethod* callee_method, Compile* C) {
102 return C->eliminate_boxing() && callee_method->is_unboxing_method();
103 }
104
105 // positive filter: should callee be inlined?
106 bool InlineTree::should_inline(ciMethod* callee_method, ciMethod* caller_method,
107 int caller_bci, ciCallProfile& profile,
108 WarmCallInfo* wci_result) {
109 // Allows targeted inlining
110 if (callee_method->should_inline()) {
111 *wci_result = *(WarmCallInfo::always_hot());
112 if (C->print_inlining() && Verbose) {
113 CompileTask::print_inline_indent(inline_level());
114 tty->print_cr("Inlined method is hot: ");
115 }
116 set_msg("force inline by CompilerOracle");
117 _forced_inline = true;
118 return true;
119 }
120
121 if (callee_method->force_inline()) {
122 set_msg("force inline by annotation");
123 _forced_inline = true;
124 return true;
125 }
126
127 #ifndef PRODUCT
128 int inline_depth = inline_level()+1;
129 if (ciReplay::should_inline(C->replay_inline_data(), callee_method, caller_bci, inline_depth)) {
130 set_msg("force inline by ciReplay");
131 _forced_inline = true;
132 return true;
133 }
134 #endif
135
136 int size = callee_method->code_size_for_inlining();
137
138 // Check for too many throws (and not too huge)
139 if(callee_method->interpreter_throwout_count() > InlineThrowCount &&
140 size < InlineThrowMaxSize ) {
141 wci_result->set_profit(wci_result->profit() * 100);
142 if (C->print_inlining() && Verbose) {
143 CompileTask::print_inline_indent(inline_level());
144 tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count());
145 }
146 set_msg("many throws");
147 return true;
148 }
149
150 int default_max_inline_size = C->max_inline_size();
151 int inline_small_code_size = InlineSmallCode / 4;
152 int max_inline_size = default_max_inline_size;
153
154 int call_site_count = method()->scale_count(profile.count());
155 int invoke_count = method()->interpreter_invocation_count();
156
157 assert(invoke_count != 0, "require invocation count greater than zero");
158 int freq = call_site_count / invoke_count;
159
160 // bump the max size if the call is frequent
161 if ((freq >= InlineFrequencyRatio) ||
162 (call_site_count >= InlineFrequencyCount) ||
163 is_unboxing_method(callee_method, C) ||
164 is_init_with_ea(callee_method, caller_method, C)) {
165
166 max_inline_size = C->freq_inline_size();
167 if (size <= max_inline_size && TraceFrequencyInlining) {
168 CompileTask::print_inline_indent(inline_level());
169 tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count);
170 CompileTask::print_inline_indent(inline_level());
171 callee_method->print();
172 tty->cr();
173 }
174 } else {
175 // Not hot. Check for medium-sized pre-existing nmethod at cold sites.
176 if (callee_method->has_compiled_code() &&
177 callee_method->instructions_size() > inline_small_code_size) {
178 set_msg("already compiled into a medium method");
179 return false;
180 }
181 }
182 if (size > max_inline_size) {
183 if (max_inline_size > default_max_inline_size) {
184 set_msg("hot method too big");
185 } else {
186 set_msg("too big");
187 }
188 return false;
189 }
190 return true;
191 }
192
193
194 // negative filter: should callee NOT be inlined?
195 bool InlineTree::should_not_inline(ciMethod *callee_method,
196 ciMethod* caller_method,
197 JVMState* jvms,
198 WarmCallInfo* wci_result) {
199
200 const char* fail_msg = NULL;
201
202 // First check all inlining restrictions which are required for correctness
203 if ( callee_method->is_abstract()) {
204 fail_msg = "abstract method"; // // note: we allow ik->is_abstract()
205 } else if (!callee_method->holder()->is_initialized()) {
206 fail_msg = "method holder not initialized";
207 } else if ( callee_method->is_native()) {
208 fail_msg = "native method";
209 } else if ( callee_method->dont_inline()) {
210 fail_msg = "don't inline by annotation";
211 }
212
213 // one more inlining restriction
214 if (fail_msg == NULL && callee_method->has_unloaded_classes_in_signature()) {
215 fail_msg = "unloaded signature classes";
216 }
217
218 if (fail_msg != NULL) {
219 set_msg(fail_msg);
220 return true;
221 }
222
223 // ignore heuristic controls on inlining
224 if (callee_method->should_inline()) {
225 set_msg("force inline by CompilerOracle");
226 return false;
227 }
228
229 if (callee_method->should_not_inline()) {
230 set_msg("disallowed by CompilerOracle");
231 return true;
232 }
233
234 #ifndef PRODUCT
235 int caller_bci = jvms->bci();
236 int inline_depth = inline_level()+1;
237 if (ciReplay::should_inline(C->replay_inline_data(), callee_method, caller_bci, inline_depth)) {
238 set_msg("force inline by ciReplay");
239 return false;
240 }
241
242 if (ciReplay::should_not_inline(C->replay_inline_data(), callee_method, caller_bci, inline_depth)) {
243 set_msg("disallowed by ciReplay");
244 return true;
245 }
246
247 if (ciReplay::should_not_inline(callee_method)) {
248 set_msg("disallowed by ciReplay");
249 return true;
250 }
251 #endif
252
253 if (callee_method->force_inline()) {
254 set_msg("force inline by annotation");
255 return false;
256 }
257
258 // Now perform checks which are heuristic
259
260 if (is_unboxing_method(callee_method, C)) {
261 // Inline unboxing methods.
262 return false;
263 }
264
265 if (callee_method->has_compiled_code() &&
266 callee_method->instructions_size() > InlineSmallCode) {
267 set_msg("already compiled into a big method");
268 return true;
269 }
270
271 // don't inline exception code unless the top method belongs to an
272 // exception class
273 if (caller_tree() != NULL &&
274 callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
275 const InlineTree *top = this;
276 while (top->caller_tree() != NULL) top = top->caller_tree();
277 ciInstanceKlass* k = top->method()->holder();
278 if (!k->is_subclass_of(C->env()->Throwable_klass())) {
279 set_msg("exception 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 // Escape Analysis: inline all executed constructors
300 return false;
301 } else if (!callee_method->was_executed_more_than(MIN2(MinInliningThreshold,
302 CompileThreshold >> 1))) {
303 set_msg("executed < MinInliningThreshold times");
304 return true;
305 }
306 }
307
308 return false;
309 }
310
311 //-----------------------------try_to_inline-----------------------------------
312 // return true if ok
313 // Relocated from "InliningClosure::try_to_inline"
314 bool InlineTree::try_to_inline(ciMethod* callee_method, ciMethod* caller_method,
315 int caller_bci, JVMState* jvms, ciCallProfile& profile,
316 WarmCallInfo* wci_result, bool& should_delay) {
317
318 if (ClipInlining && (int)count_inline_bcs() >= DesiredMethodLimit) {
319 if (!callee_method->force_inline() || !IncrementalInline) {
320 set_msg("size > DesiredMethodLimit");
321 return false;
322 } else if (!C->inlining_incrementally()) {
323 should_delay = true;
324 }
325 }
326
327 _forced_inline = false; // Reset
328 if (!should_inline(callee_method, caller_method, caller_bci, profile,
329 wci_result)) {
330 return false;
331 }
332 if (should_not_inline(callee_method, caller_method, jvms, wci_result)) {
333 return false;
334 }
335
336 if (InlineAccessors && callee_method->is_accessor()) {
337 // accessor methods are not subject to any of the following limits.
338 set_msg("accessor");
339 return true;
340 }
341
342 // suppress a few checks for accessors and trivial methods
343 if (callee_method->code_size() > MaxTrivialSize) {
344
345 // don't inline into giant methods
346 if (C->over_inlining_cutoff()) {
347 if ((!callee_method->force_inline() && !caller_method->is_compiled_lambda_form())
348 || !IncrementalInline) {
349 set_msg("NodeCountInliningCutoff");
350 return false;
351 } else {
352 should_delay = true;
353 }
354 }
355
356 if ((!UseInterpreter || CompileTheWorld) &&
357 is_init_with_ea(callee_method, caller_method, C)) {
358 // Escape Analysis stress testing when running Xcomp or CTW:
359 // inline constructors even if they are not reached.
360 } else if (forced_inline()) {
361 // Inlining was forced by CompilerOracle, ciReplay or annotation
362 } else if (profile.count() == 0) {
363 // don't inline unreached call sites
364 set_msg("call site not reached");
365 return false;
366 }
367 }
368
369 if (!C->do_inlining() && InlineAccessors) {
370 set_msg("not an accessor");
371 return false;
372 }
373
374 // Limit inlining depth in case inlining is forced or
375 // _max_inline_level was increased to compensate for lambda forms.
376 if (inline_level() > MaxForceInlineLevel) {
377 set_msg("MaxForceInlineLevel");
378 return false;
379 }
380 if (inline_level() > _max_inline_level) {
381 if (!callee_method->force_inline() || !IncrementalInline) {
382 set_msg("inlining too deep");
383 return false;
384 } else if (!C->inlining_incrementally()) {
385 should_delay = true;
386 }
387 }
388
389 // detect direct and indirect recursive inlining
390 {
391 // count the current method and the callee
392 const bool is_compiled_lambda_form = callee_method->is_compiled_lambda_form();
393 int inline_level = 0;
394 if (!is_compiled_lambda_form) {
395 if (method() == callee_method) {
396 inline_level++;
397 }
398 }
399 // count callers of current method and callee
400 Node* callee_argument0 = is_compiled_lambda_form ? jvms->map()->argument(jvms, 0)->uncast() : NULL;
401 for (JVMState* j = jvms->caller(); j != NULL && j->has_method(); j = j->caller()) {
402 if (j->method() == callee_method) {
403 if (is_compiled_lambda_form) {
404 // Since compiled lambda forms are heavily reused we allow recursive inlining. If it is truly
405 // a recursion (using the same "receiver") we limit inlining otherwise we can easily blow the
406 // compiler stack.
407 Node* caller_argument0 = j->map()->argument(j, 0)->uncast();
408 if (caller_argument0 == callee_argument0) {
409 inline_level++;
410 }
411 } else {
412 inline_level++;
413 }
414 }
415 }
416 if (inline_level > MaxRecursiveInlineLevel) {
417 set_msg("recursive inlining is too deep");
418 return false;
419 }
420 }
421
422 int size = callee_method->code_size_for_inlining();
423
424 if (ClipInlining && (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 #if INCLUDE_TRACE
504 EventCompilerInlining event;
505 if (event.should_commit()) {
506 event.set_compileId(C->compile_id());
507 event.set_message(inline_msg);
508 event.set_succeeded(success);
509 event.set_bci(caller_bci);
510 event.set_caller(_method->get_Method());
511 event.set_callee(callee_method->to_trace_struct());
512 event.commit();
513 }
514 #endif // INCLUDE_TRACE
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 (InlineWarmCalls && (PrintOpto || C->print_inlining())) {
555 bool cold = wci.is_cold();
556 bool hot = !cold && wci.is_hot();
557 bool old_cold = !success;
558 if (old_cold != cold || (Verbose || WizardMode)) {
559 if (msg() == NULL) {
560 set_msg("OK");
561 }
562 tty->print(" OldInlining= %4s : %s\n WCI=",
563 old_cold ? "cold" : "hot", msg());
564 wci.print();
565 }
566 }
567 #endif
568 if (success) {
569 wci = *(WarmCallInfo::always_hot());
570 } else {
571 wci = *(WarmCallInfo::always_cold());
572 }
573
574 if (!InlineWarmCalls) {
575 if (!wci.is_cold() && !wci.is_hot()) {
576 // Do not inline the warm calls.
577 wci = *(WarmCallInfo::always_cold());
578 }
579 }
580
581 if (!wci.is_cold()) {
582 // Inline!
583 if (msg() == NULL) {
584 set_msg("inline (hot)");
585 }
586 print_inlining(callee_method, caller_bci, true /* success */);
587 build_inline_tree_for_callee(callee_method, jvms, caller_bci);
588 if (InlineWarmCalls && !wci.is_hot())
589 return new (C) WarmCallInfo(wci); // copy to heap
590 return WarmCallInfo::always_hot();
591 }
592
593 // Do not inline
594 if (msg() == NULL) {
595 set_msg("too cold to inline");
596 }
597 print_inlining(callee_method, caller_bci, false /* !success */ );
598 return NULL;
599 }
600
601 //------------------------------compute_callee_frequency-----------------------
602 float InlineTree::compute_callee_frequency( int caller_bci ) const {
603 int count = method()->interpreter_call_site_count(caller_bci);
604 int invcnt = method()->interpreter_invocation_count();
605 float freq = (float)count/(float)invcnt;
606 // Call-site count / interpreter invocation count, scaled recursively.
607 // Always between 0.0 and 1.0. Represents the percentage of the method's
608 // total execution time used at this call site.
609
610 return freq;
611 }
612
613 //------------------------------build_inline_tree_for_callee-------------------
614 InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) {
615 float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci);
616 // Attempt inlining.
617 InlineTree* old_ilt = callee_at(caller_bci, callee_method);
618 if (old_ilt != NULL) {
619 return old_ilt;
620 }
621 int max_inline_level_adjust = 0;
622 if (caller_jvms->method() != NULL) {
623 if (caller_jvms->method()->is_compiled_lambda_form()) {
624 max_inline_level_adjust += 1; // don't count actions in MH or indy adapter frames
625 } else if (callee_method->is_method_handle_intrinsic() ||
626 callee_method->is_compiled_lambda_form()) {
627 max_inline_level_adjust += 1; // don't count method handle calls from java.lang.invoke implementation
628 }
629 if (max_inline_level_adjust != 0 && C->print_inlining() && (Verbose || WizardMode)) {
630 CompileTask::print_inline_indent(inline_level());
631 tty->print_cr(" \\-> discounting inline depth");
632 }
633 if (max_inline_level_adjust != 0 && C->log()) {
634 int id1 = C->log()->identify(caller_jvms->method());
635 int id2 = C->log()->identify(callee_method);
636 C->log()->elem("inline_level_discount caller='%d' callee='%d'", id1, id2);
637 }
638 }
639 InlineTree* ilt = new InlineTree(C, this, callee_method, caller_jvms, caller_bci, recur_frequency, _max_inline_level + max_inline_level_adjust);
640 _subtrees.append(ilt);
641
642 NOT_PRODUCT( _count_inlines += 1; )
643
644 return ilt;
645 }
646
647
648 //---------------------------------------callee_at-----------------------------
649 InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const {
650 for (int i = 0; i < _subtrees.length(); i++) {
651 InlineTree* sub = _subtrees.at(i);
652 if (sub->caller_bci() == bci && callee == sub->method()) {
653 return sub;
654 }
655 }
656 return NULL;
657 }
658
659
660 //------------------------------build_inline_tree_root-------------------------
661 InlineTree *InlineTree::build_inline_tree_root() {
662 Compile* C = Compile::current();
663
664 // Root of inline tree
665 InlineTree* ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F, MaxInlineLevel);
666
667 return ilt;
668 }
669
670
671 //-------------------------find_subtree_from_root-----------------------------
672 // Given a jvms, which determines a call chain from the root method,
673 // find the corresponding inline tree.
674 // Note: This method will be removed or replaced as InlineTree goes away.
675 InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee) {
676 InlineTree* iltp = root;
677 uint depth = jvms && jvms->has_method() ? jvms->depth() : 0;
678 for (uint d = 1; d <= depth; d++) {
679 JVMState* jvmsp = jvms->of_depth(d);
680 // Select the corresponding subtree for this bci.
681 assert(jvmsp->method() == iltp->method(), "tree still in sync");
682 ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method();
683 InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee);
684 if (sub == NULL) {
685 if (d == depth) {
686 sub = iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci());
687 }
688 guarantee(sub != NULL, "should be a sub-ilt here");
689 return sub;
690 }
691 iltp = sub;
692 }
693 return iltp;
694 }
695
696 // Count number of nodes in this subtree
697 int InlineTree::count() const {
698 int result = 1;
699 for (int i = 0 ; i < _subtrees.length(); i++) {
700 result += _subtrees.at(i)->count();
701 }
702 return result;
703 }
704
705 void InlineTree::dump_replay_data(outputStream* out) {
706 out->print(" %d %d ", inline_level(), caller_bci());
707 method()->dump_name_as_ascii(out);
708 for (int i = 0 ; i < _subtrees.length(); i++) {
709 _subtrees.at(i)->dump_replay_data(out);
710 }
711 }
712
713
714 #ifndef PRODUCT
715 void InlineTree::print_impl(outputStream* st, int indent) const {
716 for (int i = 0; i < indent; i++) st->print(" ");
717 st->print(" @ %d", caller_bci());
718 method()->print_short_name(st);
719 st->cr();
720
721 for (int i = 0 ; i < _subtrees.length(); i++) {
722 _subtrees.at(i)->print_impl(st, indent + 2);
723 }
724 }
725
726 void InlineTree::print_value_on(outputStream* st) const {
727 print_impl(st, 2);
728 }
729 #endif