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