Sat, 16 Mar 2013 07:39:14 -0700
8009166: [parfait] Null pointer deference in hotspot/src/share/vm/opto/type.cpp
Summary: add guarantee() to as_instance_type()
Reviewed-by: kvn, twisti
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 */
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"
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 }
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 }
88 static bool is_init_with_ea(ciMethod* callee_method,
89 ciMethod* caller_method, Compile* C) {
90 // True when EA is ON and a java constructor is called or
91 // a super constructor is called from an inlined java constructor.
92 return C->do_escape_analysis() && EliminateAllocations &&
93 ( callee_method->is_initializer() ||
94 (caller_method->is_initializer() &&
95 caller_method != C->method() &&
96 caller_method->holder()->is_subclass_of(callee_method->holder()))
97 );
98 }
100 // positive filter: should callee be inlined?
101 bool InlineTree::should_inline(ciMethod* callee_method, ciMethod* caller_method,
102 int caller_bci, ciCallProfile& profile,
103 WarmCallInfo* wci_result) {
104 // Allows targeted inlining
105 if(callee_method->should_inline()) {
106 *wci_result = *(WarmCallInfo::always_hot());
107 if (PrintInlining && Verbose) {
108 CompileTask::print_inline_indent(inline_level());
109 tty->print_cr("Inlined method is hot: ");
110 }
111 set_msg("force inline by CompilerOracle");
112 return true;
113 }
115 int size = callee_method->code_size_for_inlining();
117 // Check for too many throws (and not too huge)
118 if(callee_method->interpreter_throwout_count() > InlineThrowCount &&
119 size < InlineThrowMaxSize ) {
120 wci_result->set_profit(wci_result->profit() * 100);
121 if (PrintInlining && Verbose) {
122 CompileTask::print_inline_indent(inline_level());
123 tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count());
124 }
125 set_msg("many throws");
126 return true;
127 }
129 if (!UseOldInlining) {
130 set_msg("!UseOldInlining");
131 return true; // size and frequency are represented in a new way
132 }
134 int default_max_inline_size = C->max_inline_size();
135 int inline_small_code_size = InlineSmallCode / 4;
136 int max_inline_size = default_max_inline_size;
138 int call_site_count = method()->scale_count(profile.count());
139 int invoke_count = method()->interpreter_invocation_count();
141 assert(invoke_count != 0, "require invocation count greater than zero");
142 int freq = call_site_count / invoke_count;
144 // bump the max size if the call is frequent
145 if ((freq >= InlineFrequencyRatio) ||
146 (call_site_count >= InlineFrequencyCount) ||
147 is_init_with_ea(callee_method, caller_method, C)) {
149 max_inline_size = C->freq_inline_size();
150 if (size <= max_inline_size && TraceFrequencyInlining) {
151 CompileTask::print_inline_indent(inline_level());
152 tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count);
153 CompileTask::print_inline_indent(inline_level());
154 callee_method->print();
155 tty->cr();
156 }
157 } else {
158 // Not hot. Check for medium-sized pre-existing nmethod at cold sites.
159 if (callee_method->has_compiled_code() &&
160 callee_method->instructions_size() > inline_small_code_size)
161 set_msg("already compiled into a medium method");
162 return false;
163 }
164 if (size > max_inline_size) {
165 if (max_inline_size > default_max_inline_size) {
166 set_msg("hot method too big");
167 } else {
168 set_msg("too big");
169 }
170 return false;
171 }
172 return true;
173 }
176 // negative filter: should callee NOT be inlined?
177 bool InlineTree::should_not_inline(ciMethod *callee_method,
178 ciMethod* caller_method,
179 WarmCallInfo* wci_result) {
181 const char* fail_msg = NULL;
183 // First check all inlining restrictions which are required for correctness
184 if ( callee_method->is_abstract()) {
185 fail_msg = "abstract method"; // // note: we allow ik->is_abstract()
186 } else if (!callee_method->holder()->is_initialized()) {
187 fail_msg = "method holder not initialized";
188 } else if ( callee_method->is_native()) {
189 fail_msg = "native method";
190 } else if ( callee_method->dont_inline()) {
191 fail_msg = "don't inline by annotation";
192 }
194 if (!UseOldInlining) {
195 if (fail_msg != NULL) {
196 *wci_result = *(WarmCallInfo::always_cold());
197 set_msg(fail_msg);
198 return true;
199 }
201 if (callee_method->has_unloaded_classes_in_signature()) {
202 wci_result->set_profit(wci_result->profit() * 0.1);
203 }
205 // don't inline exception code unless the top method belongs to an
206 // exception class
207 if (callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
208 ciMethod* top_method = caller_jvms() ? caller_jvms()->of_depth(1)->method() : method();
209 if (!top_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
210 wci_result->set_profit(wci_result->profit() * 0.1);
211 }
212 }
214 if (callee_method->has_compiled_code() &&
215 callee_method->instructions_size() > InlineSmallCode) {
216 wci_result->set_profit(wci_result->profit() * 0.1);
217 // %%% adjust wci_result->size()?
218 }
220 return false;
221 }
223 // one more inlining restriction
224 if (fail_msg == NULL && callee_method->has_unloaded_classes_in_signature()) {
225 fail_msg = "unloaded signature classes";
226 }
228 if (fail_msg != NULL) {
229 set_msg(fail_msg);
230 return true;
231 }
233 // ignore heuristic controls on inlining
234 if (callee_method->should_inline()) {
235 set_msg("force inline by CompilerOracle");
236 return false;
237 }
239 // Now perform checks which are heuristic
241 if (!callee_method->force_inline()) {
242 if (callee_method->has_compiled_code() &&
243 callee_method->instructions_size() > InlineSmallCode) {
244 set_msg("already compiled into a big method");
245 return true;
246 }
247 }
249 // don't inline exception code unless the top method belongs to an
250 // exception class
251 if (caller_tree() != NULL &&
252 callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
253 const InlineTree *top = this;
254 while (top->caller_tree() != NULL) top = top->caller_tree();
255 ciInstanceKlass* k = top->method()->holder();
256 if (!k->is_subclass_of(C->env()->Throwable_klass())) {
257 set_msg("exception method");
258 return true;
259 }
260 }
262 if (callee_method->should_not_inline()) {
263 set_msg("disallowed by CompilerOracle");
264 return true;
265 }
267 #ifndef PRODUCT
268 if (ciReplay::should_not_inline(callee_method)) {
269 set_msg("disallowed by ciReplay");
270 return true;
271 }
272 #endif
274 if (UseStringCache) {
275 // Do not inline StringCache::profile() method used only at the beginning.
276 if (callee_method->name() == ciSymbol::profile_name() &&
277 callee_method->holder()->name() == ciSymbol::java_lang_StringCache()) {
278 set_msg("profiling method");
279 return true;
280 }
281 }
283 // use frequency-based objections only for non-trivial methods
284 if (callee_method->code_size() <= MaxTrivialSize) {
285 return false;
286 }
288 // don't use counts with -Xcomp or CTW
289 if (UseInterpreter && !CompileTheWorld) {
291 if (!callee_method->has_compiled_code() &&
292 !callee_method->was_executed_more_than(0)) {
293 set_msg("never executed");
294 return true;
295 }
297 if (is_init_with_ea(callee_method, caller_method, C)) {
299 // Escape Analysis: inline all executed constructors
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 }
308 return false;
309 }
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, ciCallProfile& profile,
316 WarmCallInfo* wci_result, bool& should_delay) {
318 // Old algorithm had funny accumulating BC-size counters
319 if (UseOldInlining && ClipInlining
320 && (int)count_inline_bcs() >= DesiredMethodLimit) {
321 if (!callee_method->force_inline() || !IncrementalInline) {
322 set_msg("size > DesiredMethodLimit");
323 return false;
324 } else if (!C->inlining_incrementally()) {
325 should_delay = true;
326 }
327 }
329 if (!should_inline(callee_method, caller_method, caller_bci, profile,
330 wci_result)) {
331 return false;
332 }
333 if (should_not_inline(callee_method, caller_method, wci_result)) {
334 return false;
335 }
337 if (InlineAccessors && callee_method->is_accessor()) {
338 // accessor methods are not subject to any of the following limits.
339 set_msg("accessor");
340 return true;
341 }
343 // suppress a few checks for accessors and trivial methods
344 if (callee_method->code_size() > MaxTrivialSize) {
346 // don't inline into giant methods
347 if (C->over_inlining_cutoff()) {
348 if ((!callee_method->force_inline() && !caller_method->is_compiled_lambda_form())
349 || !IncrementalInline) {
350 set_msg("NodeCountInliningCutoff");
351 return false;
352 } else {
353 should_delay = true;
354 }
355 }
357 if ((!UseInterpreter || CompileTheWorld) &&
358 is_init_with_ea(callee_method, caller_method, C)) {
360 // Escape Analysis stress testing when running Xcomp or CTW:
361 // inline constructors even if they are not reached.
363 } else if (profile.count() == 0) {
364 // don't inline unreached call sites
365 set_msg("call site not reached");
366 return false;
367 }
368 }
370 if (!C->do_inlining() && InlineAccessors) {
371 set_msg("not an accessor");
372 return false;
373 }
374 if (inline_level() > _max_inline_level) {
375 if (!callee_method->force_inline() || !IncrementalInline) {
376 set_msg("inlining too deep");
377 return false;
378 } else if (!C->inlining_incrementally()) {
379 should_delay = true;
380 }
381 }
383 // detect direct and indirect recursive inlining
384 if (!callee_method->is_compiled_lambda_form()) {
385 // count the current method and the callee
386 int inline_level = (method() == callee_method) ? 1 : 0;
387 if (inline_level > MaxRecursiveInlineLevel) {
388 set_msg("recursively inlining too deep");
389 return false;
390 }
391 // count callers of current method and callee
392 JVMState* jvms = caller_jvms();
393 while (jvms != NULL && jvms->has_method()) {
394 if (jvms->method() == callee_method) {
395 inline_level++;
396 if (inline_level > MaxRecursiveInlineLevel) {
397 set_msg("recursively inlining too deep");
398 return false;
399 }
400 }
401 jvms = jvms->caller();
402 }
403 }
405 int size = callee_method->code_size_for_inlining();
407 if (UseOldInlining && ClipInlining
408 && (int)count_inline_bcs() + size >= DesiredMethodLimit) {
409 if (!callee_method->force_inline() || !IncrementalInline) {
410 set_msg("size > DesiredMethodLimit");
411 return false;
412 } else if (!C->inlining_incrementally()) {
413 should_delay = true;
414 }
415 }
417 // ok, inline this method
418 return true;
419 }
421 //------------------------------pass_initial_checks----------------------------
422 bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method) {
423 ciInstanceKlass *callee_holder = callee_method ? callee_method->holder() : NULL;
424 // Check if a callee_method was suggested
425 if( callee_method == NULL ) return false;
426 // Check if klass of callee_method is loaded
427 if( !callee_holder->is_loaded() ) return false;
428 if( !callee_holder->is_initialized() ) return false;
429 if( !UseInterpreter || CompileTheWorld /* running Xcomp or CTW */ ) {
430 // Checks that constant pool's call site has been visited
431 // stricter than callee_holder->is_initialized()
432 ciBytecodeStream iter(caller_method);
433 iter.force_bci(caller_bci);
434 Bytecodes::Code call_bc = iter.cur_bc();
435 // An invokedynamic instruction does not have a klass.
436 if (call_bc != Bytecodes::_invokedynamic) {
437 int index = iter.get_index_u2_cpcache();
438 if (!caller_method->is_klass_loaded(index, true)) {
439 return false;
440 }
441 // Try to do constant pool resolution if running Xcomp
442 if( !caller_method->check_call(index, call_bc == Bytecodes::_invokestatic) ) {
443 return false;
444 }
445 }
446 }
447 // We will attempt to see if a class/field/etc got properly loaded. If it
448 // did not, it may attempt to throw an exception during our probing. Catch
449 // and ignore such exceptions and do not attempt to compile the method.
450 if( callee_method->should_exclude() ) return false;
452 return true;
453 }
455 //------------------------------check_can_parse--------------------------------
456 const char* InlineTree::check_can_parse(ciMethod* callee) {
457 // Certain methods cannot be parsed at all:
458 if ( callee->is_native()) return "native method";
459 if ( callee->is_abstract()) return "abstract method";
460 if (!callee->can_be_compiled()) return "not compilable (disabled)";
461 if (!callee->has_balanced_monitors()) return "not compilable (unbalanced monitors)";
462 if ( callee->get_flow_analysis()->failing()) return "not compilable (flow analysis failed)";
463 return NULL;
464 }
466 //------------------------------print_inlining---------------------------------
467 void InlineTree::print_inlining(ciMethod* callee_method, int caller_bci,
468 bool success) const {
469 const char* inline_msg = msg();
470 assert(inline_msg != NULL, "just checking");
471 if (C->log() != NULL) {
472 if (success) {
473 C->log()->inline_success(inline_msg);
474 } else {
475 C->log()->inline_fail(inline_msg);
476 }
477 }
478 if (PrintInlining) {
479 C->print_inlining(callee_method, inline_level(), caller_bci, inline_msg);
480 if (callee_method == NULL) tty->print(" callee not monotonic or profiled");
481 if (Verbose && callee_method) {
482 const InlineTree *top = this;
483 while( top->caller_tree() != NULL ) { top = top->caller_tree(); }
484 //tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count());
485 }
486 }
487 }
489 //------------------------------ok_to_inline-----------------------------------
490 WarmCallInfo* InlineTree::ok_to_inline(ciMethod* callee_method, JVMState* jvms, ciCallProfile& profile, WarmCallInfo* initial_wci, bool& should_delay) {
491 assert(callee_method != NULL, "caller checks for optimized virtual!");
492 assert(!should_delay, "should be initialized to false");
493 #ifdef ASSERT
494 // Make sure the incoming jvms has the same information content as me.
495 // This means that we can eventually make this whole class AllStatic.
496 if (jvms->caller() == NULL) {
497 assert(_caller_jvms == NULL, "redundant instance state");
498 } else {
499 assert(_caller_jvms->same_calls_as(jvms->caller()), "redundant instance state");
500 }
501 assert(_method == jvms->method(), "redundant instance state");
502 #endif
503 int caller_bci = jvms->bci();
504 ciMethod* caller_method = jvms->method();
506 // Do some initial checks.
507 if (!pass_initial_checks(caller_method, caller_bci, callee_method)) {
508 set_msg("failed initial checks");
509 print_inlining(callee_method, caller_bci, false /* !success */);
510 return NULL;
511 }
513 // Do some parse checks.
514 set_msg(check_can_parse(callee_method));
515 if (msg() != NULL) {
516 print_inlining(callee_method, caller_bci, false /* !success */);
517 return NULL;
518 }
520 // Check if inlining policy says no.
521 WarmCallInfo wci = *(initial_wci);
522 bool success = try_to_inline(callee_method, caller_method, caller_bci,
523 profile, &wci, should_delay);
525 #ifndef PRODUCT
526 if (UseOldInlining && InlineWarmCalls
527 && (PrintOpto || PrintOptoInlining || PrintInlining)) {
528 bool cold = wci.is_cold();
529 bool hot = !cold && wci.is_hot();
530 bool old_cold = !success;
531 if (old_cold != cold || (Verbose || WizardMode)) {
532 if (msg() == NULL) {
533 set_msg("OK");
534 }
535 tty->print(" OldInlining= %4s : %s\n WCI=",
536 old_cold ? "cold" : "hot", msg());
537 wci.print();
538 }
539 }
540 #endif
541 if (UseOldInlining) {
542 if (success) {
543 wci = *(WarmCallInfo::always_hot());
544 } else {
545 wci = *(WarmCallInfo::always_cold());
546 }
547 }
548 if (!InlineWarmCalls) {
549 if (!wci.is_cold() && !wci.is_hot()) {
550 // Do not inline the warm calls.
551 wci = *(WarmCallInfo::always_cold());
552 }
553 }
555 if (!wci.is_cold()) {
556 // Inline!
557 if (msg() == NULL) {
558 set_msg("inline (hot)");
559 }
560 print_inlining(callee_method, caller_bci, true /* success */);
561 if (UseOldInlining)
562 build_inline_tree_for_callee(callee_method, jvms, caller_bci);
563 if (InlineWarmCalls && !wci.is_hot())
564 return new (C) WarmCallInfo(wci); // copy to heap
565 return WarmCallInfo::always_hot();
566 }
568 // Do not inline
569 if (msg() == NULL) {
570 set_msg("too cold to inline");
571 }
572 print_inlining(callee_method, caller_bci, false /* !success */ );
573 return NULL;
574 }
576 //------------------------------compute_callee_frequency-----------------------
577 float InlineTree::compute_callee_frequency( int caller_bci ) const {
578 int count = method()->interpreter_call_site_count(caller_bci);
579 int invcnt = method()->interpreter_invocation_count();
580 float freq = (float)count/(float)invcnt;
581 // Call-site count / interpreter invocation count, scaled recursively.
582 // Always between 0.0 and 1.0. Represents the percentage of the method's
583 // total execution time used at this call site.
585 return freq;
586 }
588 //------------------------------build_inline_tree_for_callee-------------------
589 InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) {
590 float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci);
591 // Attempt inlining.
592 InlineTree* old_ilt = callee_at(caller_bci, callee_method);
593 if (old_ilt != NULL) {
594 return old_ilt;
595 }
596 int max_inline_level_adjust = 0;
597 if (caller_jvms->method() != NULL) {
598 if (caller_jvms->method()->is_compiled_lambda_form())
599 max_inline_level_adjust += 1; // don't count actions in MH or indy adapter frames
600 else if (callee_method->is_method_handle_intrinsic() ||
601 callee_method->is_compiled_lambda_form()) {
602 max_inline_level_adjust += 1; // don't count method handle calls from java.lang.invoke implem
603 }
604 if (max_inline_level_adjust != 0 && PrintInlining && (Verbose || WizardMode)) {
605 CompileTask::print_inline_indent(inline_level());
606 tty->print_cr(" \\-> discounting inline depth");
607 }
608 if (max_inline_level_adjust != 0 && C->log()) {
609 int id1 = C->log()->identify(caller_jvms->method());
610 int id2 = C->log()->identify(callee_method);
611 C->log()->elem("inline_level_discount caller='%d' callee='%d'", id1, id2);
612 }
613 }
614 InlineTree* ilt = new InlineTree(C, this, callee_method, caller_jvms, caller_bci, recur_frequency, _max_inline_level + max_inline_level_adjust);
615 _subtrees.append(ilt);
617 NOT_PRODUCT( _count_inlines += 1; )
619 return ilt;
620 }
623 //---------------------------------------callee_at-----------------------------
624 InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const {
625 for (int i = 0; i < _subtrees.length(); i++) {
626 InlineTree* sub = _subtrees.at(i);
627 if (sub->caller_bci() == bci && callee == sub->method()) {
628 return sub;
629 }
630 }
631 return NULL;
632 }
635 //------------------------------build_inline_tree_root-------------------------
636 InlineTree *InlineTree::build_inline_tree_root() {
637 Compile* C = Compile::current();
639 // Root of inline tree
640 InlineTree* ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F, MaxInlineLevel);
642 return ilt;
643 }
646 //-------------------------find_subtree_from_root-----------------------------
647 // Given a jvms, which determines a call chain from the root method,
648 // find the corresponding inline tree.
649 // Note: This method will be removed or replaced as InlineTree goes away.
650 InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee) {
651 InlineTree* iltp = root;
652 uint depth = jvms && jvms->has_method() ? jvms->depth() : 0;
653 for (uint d = 1; d <= depth; d++) {
654 JVMState* jvmsp = jvms->of_depth(d);
655 // Select the corresponding subtree for this bci.
656 assert(jvmsp->method() == iltp->method(), "tree still in sync");
657 ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method();
658 InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee);
659 if (sub == NULL) {
660 if (d == depth) {
661 sub = iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci());
662 }
663 guarantee(sub != NULL, "should be a sub-ilt here");
664 return sub;
665 }
666 iltp = sub;
667 }
668 return iltp;
669 }
673 #ifndef PRODUCT
674 void InlineTree::print_impl(outputStream* st, int indent) const {
675 for (int i = 0; i < indent; i++) st->print(" ");
676 st->print(" @ %d ", caller_bci());
677 method()->print_short_name(st);
678 st->cr();
680 for (int i = 0 ; i < _subtrees.length(); i++) {
681 _subtrees.at(i)->print_impl(st, indent + 2);
682 }
683 }
685 void InlineTree::print_value_on(outputStream* st) const {
686 print_impl(st, 2);
687 }
688 #endif