1 /*
2 * Copyright (c) 2000, 2013, 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/bcEscapeAnalyzer.hpp"
27 #include "ci/ciCallSite.hpp"
28 #include "ci/ciObjArray.hpp"
29 #include "ci/ciMemberName.hpp"
30 #include "ci/ciMethodHandle.hpp"
31 #include "classfile/javaClasses.hpp"
32 #include "compiler/compileLog.hpp"
33 #include "opto/addnode.hpp"
34 #include "opto/callGenerator.hpp"
35 #include "opto/callnode.hpp"
36 #include "opto/cfgnode.hpp"
37 #include "opto/connode.hpp"
38 #include "opto/parse.hpp"
39 #include "opto/rootnode.hpp"
40 #include "opto/runtime.hpp"
41 #include "opto/subnode.hpp"
42
43
44 // Utility function.
45 const TypeFunc* CallGenerator::tf() const {
46 return TypeFunc::make(method());
47 }
48
49 //-----------------------------ParseGenerator---------------------------------
50 // Internal class which handles all direct bytecode traversal.
51 class ParseGenerator : public InlineCallGenerator {
52 private:
53 bool _is_osr;
54 float _expected_uses;
55
56 public:
57 ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false)
58 : InlineCallGenerator(method)
59 {
60 _is_osr = is_osr;
61 _expected_uses = expected_uses;
62 assert(InlineTree::check_can_parse(method) == NULL, "parse must be possible");
63 }
64
65 virtual bool is_parse() const { return true; }
66 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
67 int is_osr() { return _is_osr; }
68
69 };
70
71 JVMState* ParseGenerator::generate(JVMState* jvms, Parse* parent_parser) {
72 Compile* C = Compile::current();
73 C->print_inlining_update(this);
74
75 if (is_osr()) {
76 // The JVMS for a OSR has a single argument (see its TypeFunc).
77 assert(jvms->depth() == 1, "no inline OSR");
78 }
79
80 if (C->failing()) {
81 return NULL; // bailing out of the compile; do not try to parse
82 }
83
84 Parse parser(jvms, method(), _expected_uses, parent_parser);
85 // Grab signature for matching/allocation
86 #ifdef ASSERT
87 if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) {
88 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag);
89 assert(C->env()->system_dictionary_modification_counter_changed(),
90 "Must invalidate if TypeFuncs differ");
91 }
92 #endif
93
94 GraphKit& exits = parser.exits();
95
96 if (C->failing()) {
97 while (exits.pop_exception_state() != NULL) ;
98 return NULL;
99 }
100
101 assert(exits.jvms()->same_calls_as(jvms), "sanity");
102
103 // Simply return the exit state of the parser,
104 // augmented by any exceptional states.
105 return exits.transfer_exceptions_into_jvms();
106 }
107
108 //---------------------------DirectCallGenerator------------------------------
109 // Internal class which handles all out-of-line calls w/o receiver type checks.
110 class DirectCallGenerator : public CallGenerator {
111 private:
112 CallStaticJavaNode* _call_node;
113 // Force separate memory and I/O projections for the exceptional
114 // paths to facilitate late inlinig.
115 bool _separate_io_proj;
116
117 public:
118 DirectCallGenerator(ciMethod* method, bool separate_io_proj)
119 : CallGenerator(method),
120 _separate_io_proj(separate_io_proj)
121 {
122 }
123 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
124
125 CallStaticJavaNode* call_node() const { return _call_node; }
126 };
127
128 JVMState* DirectCallGenerator::generate(JVMState* jvms, Parse* parent_parser) {
129 GraphKit kit(jvms);
130 kit.C->print_inlining_update(this);
131 bool is_static = method()->is_static();
132 address target = is_static ? SharedRuntime::get_resolve_static_call_stub()
133 : SharedRuntime::get_resolve_opt_virtual_call_stub();
134
135 if (kit.C->log() != NULL) {
136 kit.C->log()->elem("direct_call bci='%d'", jvms->bci());
137 }
138
139 CallStaticJavaNode *call = new (kit.C) CallStaticJavaNode(kit.C, tf(), target, method(), kit.bci());
140 _call_node = call; // Save the call node in case we need it later
141 if (!is_static) {
142 // Make an explicit receiver null_check as part of this call.
143 // Since we share a map with the caller, his JVMS gets adjusted.
144 kit.null_check_receiver_before_call(method());
145 if (kit.stopped()) {
146 // And dump it back to the caller, decorated with any exceptions:
147 return kit.transfer_exceptions_into_jvms();
148 }
149 // Mark the call node as virtual, sort of:
150 call->set_optimized_virtual(true);
151 if (method()->is_method_handle_intrinsic() ||
152 method()->is_compiled_lambda_form()) {
153 call->set_method_handle_invoke(true);
154 }
155 }
156 kit.set_arguments_for_java_call(call);
157 kit.set_edges_for_java_call(call, false, _separate_io_proj);
158 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
159 kit.push_node(method()->return_type()->basic_type(), ret);
160 return kit.transfer_exceptions_into_jvms();
161 }
162
163 //--------------------------VirtualCallGenerator------------------------------
164 // Internal class which handles all out-of-line calls checking receiver type.
165 class VirtualCallGenerator : public CallGenerator {
166 private:
167 int _vtable_index;
168 public:
169 VirtualCallGenerator(ciMethod* method, int vtable_index)
170 : CallGenerator(method), _vtable_index(vtable_index)
171 {
172 assert(vtable_index == Method::invalid_vtable_index ||
173 vtable_index >= 0, "either invalid or usable");
174 }
175 virtual bool is_virtual() const { return true; }
176 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
177 };
178
179 JVMState* VirtualCallGenerator::generate(JVMState* jvms, Parse* parent_parser) {
180 GraphKit kit(jvms);
181 Node* receiver = kit.argument(0);
182
183 kit.C->print_inlining_update(this);
184
185 if (kit.C->log() != NULL) {
186 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci());
187 }
188
189 // If the receiver is a constant null, do not torture the system
190 // by attempting to call through it. The compile will proceed
191 // correctly, but may bail out in final_graph_reshaping, because
192 // the call instruction will have a seemingly deficient out-count.
193 // (The bailout says something misleading about an "infinite loop".)
194 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) {
195 kit.inc_sp(method()->arg_size()); // restore arguments
196 kit.uncommon_trap(Deoptimization::Reason_null_check,
197 Deoptimization::Action_none,
198 NULL, "null receiver");
199 return kit.transfer_exceptions_into_jvms();
200 }
201
202 // Ideally we would unconditionally do a null check here and let it
203 // be converted to an implicit check based on profile information.
204 // However currently the conversion to implicit null checks in
205 // Block::implicit_null_check() only looks for loads and stores, not calls.
206 ciMethod *caller = kit.method();
207 ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data();
208 if (!UseInlineCaches || !ImplicitNullChecks || !os::zero_page_read_protected() ||
209 ((ImplicitNullCheckThreshold > 0) && caller_md &&
210 (caller_md->trap_count(Deoptimization::Reason_null_check)
211 >= (uint)ImplicitNullCheckThreshold))) {
212 // Make an explicit receiver null_check as part of this call.
213 // Since we share a map with the caller, his JVMS gets adjusted.
214 receiver = kit.null_check_receiver_before_call(method());
215 if (kit.stopped()) {
216 // And dump it back to the caller, decorated with any exceptions:
217 return kit.transfer_exceptions_into_jvms();
218 }
219 }
220
221 assert(!method()->is_static(), "virtual call must not be to static");
222 assert(!method()->is_final(), "virtual call should not be to final");
223 assert(!method()->is_private(), "virtual call should not be to private");
224 assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches,
225 "no vtable calls if +UseInlineCaches ");
226 address target = SharedRuntime::get_resolve_virtual_call_stub();
227 // Normal inline cache used for call
228 CallDynamicJavaNode *call = new (kit.C) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci());
229 kit.set_arguments_for_java_call(call);
230 kit.set_edges_for_java_call(call);
231 Node* ret = kit.set_results_for_java_call(call);
232 kit.push_node(method()->return_type()->basic_type(), ret);
233
234 // Represent the effect of an implicit receiver null_check
235 // as part of this call. Since we share a map with the caller,
236 // his JVMS gets adjusted.
237 kit.cast_not_null(receiver);
238 return kit.transfer_exceptions_into_jvms();
239 }
240
241 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) {
242 if (InlineTree::check_can_parse(m) != NULL) return NULL;
243 return new ParseGenerator(m, expected_uses);
244 }
245
246 // As a special case, the JVMS passed to this CallGenerator is
247 // for the method execution already in progress, not just the JVMS
248 // of the caller. Thus, this CallGenerator cannot be mixed with others!
249 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) {
250 if (InlineTree::check_can_parse(m) != NULL) return NULL;
251 float past_uses = m->interpreter_invocation_count();
252 float expected_uses = past_uses;
253 return new ParseGenerator(m, expected_uses, true);
254 }
255
256 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) {
257 assert(!m->is_abstract(), "for_direct_call mismatch");
258 return new DirectCallGenerator(m, separate_io_proj);
259 }
260
261 CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) {
262 assert(!m->is_static(), "for_virtual_call mismatch");
263 assert(!m->is_method_handle_intrinsic(), "should be a direct call");
264 return new VirtualCallGenerator(m, vtable_index);
265 }
266
267 // Allow inlining decisions to be delayed
268 class LateInlineCallGenerator : public DirectCallGenerator {
269 protected:
270 CallGenerator* _inline_cg;
271
272 virtual bool do_late_inline_check(JVMState* jvms) { return true; }
273
274 public:
275 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
276 DirectCallGenerator(method, true), _inline_cg(inline_cg) {}
277
278 virtual bool is_late_inline() const { return true; }
279
280 // Convert the CallStaticJava into an inline
281 virtual void do_late_inline();
282
283 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) {
284 Compile *C = Compile::current();
285
286 // Record that this call site should be revisited once the main
287 // parse is finished.
288 if (!is_mh_late_inline()) {
289 C->add_late_inline(this);
290 }
291
292 // Emit the CallStaticJava and request separate projections so
293 // that the late inlining logic can distinguish between fall
294 // through and exceptional uses of the memory and io projections
295 // as is done for allocations and macro expansion.
296 return DirectCallGenerator::generate(jvms, parent_parser);
297 }
298
299 virtual void print_inlining_late(const char* msg) {
300 CallNode* call = call_node();
301 Compile* C = Compile::current();
302 C->print_inlining_assert_ready();
303 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), msg);
304 C->print_inlining_move_to(this);
305 C->print_inlining_update_delayed(this);
306 }
307 };
308
309 void LateInlineCallGenerator::do_late_inline() {
310 // Can't inline it
311 CallStaticJavaNode* call = call_node();
312 if (call == NULL || call->outcnt() == 0 ||
313 call->in(0) == NULL || call->in(0)->is_top()) {
314 return;
315 }
316
317 const TypeTuple *r = call->tf()->domain();
318 for (int i1 = 0; i1 < method()->arg_size(); i1++) {
319 if (call->in(TypeFunc::Parms + i1)->is_top() && r->field_at(TypeFunc::Parms + i1) != Type::HALF) {
320 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
321 return;
322 }
323 }
324
325 if (call->in(TypeFunc::Memory)->is_top()) {
326 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
327 return;
328 }
329
330 Compile* C = Compile::current();
331 // Remove inlined methods from Compiler's lists.
332 if (call->is_macro()) {
333 C->remove_macro_node(call);
334 }
335
336 // Make a clone of the JVMState that appropriate to use for driving a parse
337 JVMState* old_jvms = call->jvms();
338 JVMState* jvms = old_jvms->clone_shallow(C);
339 uint size = call->req();
340 SafePointNode* map = new (C) SafePointNode(size, jvms);
341 for (uint i1 = 0; i1 < size; i1++) {
342 map->init_req(i1, call->in(i1));
343 }
344
345 // Make sure the state is a MergeMem for parsing.
346 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
347 Node* mem = MergeMemNode::make(C, map->in(TypeFunc::Memory));
348 C->initial_gvn()->set_type_bottom(mem);
349 map->set_req(TypeFunc::Memory, mem);
350 }
351
352 uint nargs = method()->arg_size();
353 // blow away old call arguments
354 Node* top = C->top();
355 for (uint i1 = 0; i1 < nargs; i1++) {
356 map->set_req(TypeFunc::Parms + i1, top);
357 }
358 jvms->set_map(map);
359
360 // Make enough space in the expression stack to transfer
361 // the incoming arguments and return value.
362 map->ensure_stack(jvms, jvms->method()->max_stack());
363 for (uint i1 = 0; i1 < nargs; i1++) {
364 map->set_argument(jvms, i1, call->in(TypeFunc::Parms + i1));
365 }
366
367 C->print_inlining_assert_ready();
368
369 C->print_inlining_move_to(this);
370
371 // This check is done here because for_method_handle_inline() method
372 // needs jvms for inlined state.
373 if (!do_late_inline_check(jvms)) {
374 map->disconnect_inputs(NULL, C);
375 return;
376 }
377
378 CompileLog* log = C->log();
379 if (log != NULL) {
380 log->head("late_inline method='%d'", log->identify(method()));
381 JVMState* p = jvms;
382 while (p != NULL) {
383 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
384 p = p->caller();
385 }
386 log->tail("late_inline");
387 }
388
389 // Setup default node notes to be picked up by the inlining
390 Node_Notes* old_nn = C->default_node_notes();
391 if (old_nn != NULL) {
392 Node_Notes* entry_nn = old_nn->clone(C);
393 entry_nn->set_jvms(jvms);
394 C->set_default_node_notes(entry_nn);
395 }
396
397 // Now perform the inlining using the synthesized JVMState
398 JVMState* new_jvms = _inline_cg->generate(jvms, NULL);
399 if (new_jvms == NULL) return; // no change
400 if (C->failing()) return;
401
402 // Capture any exceptional control flow
403 GraphKit kit(new_jvms);
404
405 // Find the result object
406 Node* result = C->top();
407 int result_size = method()->return_type()->size();
408 if (result_size != 0 && !kit.stopped()) {
409 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
410 }
411
412 C->set_has_loops(C->has_loops() || _inline_cg->method()->has_loops());
413 C->env()->notice_inlined_method(_inline_cg->method());
414 C->set_inlining_progress(true);
415
416 kit.replace_call(call, result);
417 }
418
419
420 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
421 return new LateInlineCallGenerator(method, inline_cg);
422 }
423
424 class LateInlineMHCallGenerator : public LateInlineCallGenerator {
425 ciMethod* _caller;
426 int _attempt;
427 bool _input_not_const;
428
429 virtual bool do_late_inline_check(JVMState* jvms);
430 virtual bool already_attempted() const { return _attempt > 0; }
431
432 public:
433 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) :
434 LateInlineCallGenerator(callee, NULL), _caller(caller), _attempt(0), _input_not_const(input_not_const) {}
435
436 virtual bool is_mh_late_inline() const { return true; }
437
438 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) {
439 JVMState* new_jvms = LateInlineCallGenerator::generate(jvms, parent_parser);
440
441 if (_input_not_const) {
442 // inlining won't be possible so no need to enqueue right now.
443 call_node()->set_generator(this);
444 } else {
445 Compile::current()->add_late_inline(this);
446 }
447 return new_jvms;
448 }
449 };
450
451 bool LateInlineMHCallGenerator::do_late_inline_check(JVMState* jvms) {
452
453 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), _input_not_const);
454
455 Compile::current()->print_inlining_update_delayed(this);
456
457 if (!_input_not_const) {
458 _attempt++;
459 }
460
461 if (cg != NULL) {
462 assert(!cg->is_late_inline() && cg->is_inline(), "we're doing late inlining");
463 _inline_cg = cg;
464 Compile::current()->dec_number_of_mh_late_inlines();
465 return true;
466 }
467
468 call_node()->set_generator(this);
469 return false;
470 }
471
472 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) {
473 Compile::current()->inc_number_of_mh_late_inlines();
474 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const);
475 return cg;
476 }
477
478 class LateInlineStringCallGenerator : public LateInlineCallGenerator {
479
480 public:
481 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
482 LateInlineCallGenerator(method, inline_cg) {}
483
484 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) {
485 Compile *C = Compile::current();
486 C->add_string_late_inline(this);
487
488 JVMState* new_jvms = DirectCallGenerator::generate(jvms, parent_parser);
489 return new_jvms;
490 }
491
492 virtual bool is_string_late_inline() const { return true; }
493 };
494
495 CallGenerator* CallGenerator::for_string_late_inline(ciMethod* method, CallGenerator* inline_cg) {
496 return new LateInlineStringCallGenerator(method, inline_cg);
497 }
498
499 class LateInlineBoxingCallGenerator : public LateInlineCallGenerator {
500
501 public:
502 LateInlineBoxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
503 LateInlineCallGenerator(method, inline_cg) {}
504
505 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) {
506 Compile *C = Compile::current();
507
508 C->add_boxing_late_inline(this);
509
510 JVMState* new_jvms = DirectCallGenerator::generate(jvms, parent_parser);
511 return new_jvms;
512 }
513 };
514
515 CallGenerator* CallGenerator::for_boxing_late_inline(ciMethod* method, CallGenerator* inline_cg) {
516 return new LateInlineBoxingCallGenerator(method, inline_cg);
517 }
518
519 //---------------------------WarmCallGenerator--------------------------------
520 // Internal class which handles initial deferral of inlining decisions.
521 class WarmCallGenerator : public CallGenerator {
522 WarmCallInfo* _call_info;
523 CallGenerator* _if_cold;
524 CallGenerator* _if_hot;
525 bool _is_virtual; // caches virtuality of if_cold
526 bool _is_inline; // caches inline-ness of if_hot
527
528 public:
529 WarmCallGenerator(WarmCallInfo* ci,
530 CallGenerator* if_cold,
531 CallGenerator* if_hot)
532 : CallGenerator(if_cold->method())
533 {
534 assert(method() == if_hot->method(), "consistent choices");
535 _call_info = ci;
536 _if_cold = if_cold;
537 _if_hot = if_hot;
538 _is_virtual = if_cold->is_virtual();
539 _is_inline = if_hot->is_inline();
540 }
541
542 virtual bool is_inline() const { return _is_inline; }
543 virtual bool is_virtual() const { return _is_virtual; }
544 virtual bool is_deferred() const { return true; }
545
546 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
547 };
548
549
550 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci,
551 CallGenerator* if_cold,
552 CallGenerator* if_hot) {
553 return new WarmCallGenerator(ci, if_cold, if_hot);
554 }
555
556 JVMState* WarmCallGenerator::generate(JVMState* jvms, Parse* parent_parser) {
557 Compile* C = Compile::current();
558 C->print_inlining_update(this);
559
560 if (C->log() != NULL) {
561 C->log()->elem("warm_call bci='%d'", jvms->bci());
562 }
563 jvms = _if_cold->generate(jvms, parent_parser);
564 if (jvms != NULL) {
565 Node* m = jvms->map()->control();
566 if (m->is_CatchProj()) m = m->in(0); else m = C->top();
567 if (m->is_Catch()) m = m->in(0); else m = C->top();
568 if (m->is_Proj()) m = m->in(0); else m = C->top();
569 if (m->is_CallJava()) {
570 _call_info->set_call(m->as_Call());
571 _call_info->set_hot_cg(_if_hot);
572 #ifndef PRODUCT
573 if (PrintOpto || PrintOptoInlining) {
574 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci());
575 tty->print("WCI: ");
576 _call_info->print();
577 }
578 #endif
579 _call_info->set_heat(_call_info->compute_heat());
580 C->set_warm_calls(_call_info->insert_into(C->warm_calls()));
581 }
582 }
583 return jvms;
584 }
585
586 void WarmCallInfo::make_hot() {
587 Unimplemented();
588 }
589
590 void WarmCallInfo::make_cold() {
591 // No action: Just dequeue.
592 }
593
594
595 //------------------------PredictedCallGenerator------------------------------
596 // Internal class which handles all out-of-line calls checking receiver type.
597 class PredictedCallGenerator : public CallGenerator {
598 ciKlass* _predicted_receiver;
599 CallGenerator* _if_missed;
600 CallGenerator* _if_hit;
601 float _hit_prob;
602
603 public:
604 PredictedCallGenerator(ciKlass* predicted_receiver,
605 CallGenerator* if_missed,
606 CallGenerator* if_hit, float hit_prob)
607 : CallGenerator(if_missed->method())
608 {
609 // The call profile data may predict the hit_prob as extreme as 0 or 1.
610 // Remove the extremes values from the range.
611 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX;
612 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
613
614 _predicted_receiver = predicted_receiver;
615 _if_missed = if_missed;
616 _if_hit = if_hit;
617 _hit_prob = hit_prob;
618 }
619
620 virtual bool is_virtual() const { return true; }
621 virtual bool is_inline() const { return _if_hit->is_inline(); }
622 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
623
624 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
625 };
626
627
628 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver,
629 CallGenerator* if_missed,
630 CallGenerator* if_hit,
631 float hit_prob) {
632 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob);
633 }
634
635
636 JVMState* PredictedCallGenerator::generate(JVMState* jvms, Parse* parent_parser) {
637 GraphKit kit(jvms);
638 kit.C->print_inlining_update(this);
639 PhaseGVN& gvn = kit.gvn();
640 // We need an explicit receiver null_check before checking its type.
641 // We share a map with the caller, so his JVMS gets adjusted.
642 Node* receiver = kit.argument(0);
643
644 CompileLog* log = kit.C->log();
645 if (log != NULL) {
646 log->elem("predicted_call bci='%d' klass='%d'",
647 jvms->bci(), log->identify(_predicted_receiver));
648 }
649
650 receiver = kit.null_check_receiver_before_call(method());
651 if (kit.stopped()) {
652 return kit.transfer_exceptions_into_jvms();
653 }
654
655 Node* exact_receiver = receiver; // will get updated in place...
656 Node* slow_ctl = kit.type_check_receiver(receiver,
657 _predicted_receiver, _hit_prob,
658 &exact_receiver);
659
660 SafePointNode* slow_map = NULL;
661 JVMState* slow_jvms;
662 { PreserveJVMState pjvms(&kit);
663 kit.set_control(slow_ctl);
664 if (!kit.stopped()) {
665 slow_jvms = _if_missed->generate(kit.sync_jvms(), parent_parser);
666 if (kit.failing())
667 return NULL; // might happen because of NodeCountInliningCutoff
668 assert(slow_jvms != NULL, "must be");
669 kit.add_exception_states_from(slow_jvms);
670 kit.set_map(slow_jvms->map());
671 if (!kit.stopped())
672 slow_map = kit.stop();
673 }
674 }
675
676 if (kit.stopped()) {
677 // Instance exactly does not matches the desired type.
678 kit.set_jvms(slow_jvms);
679 return kit.transfer_exceptions_into_jvms();
680 }
681
682 // fall through if the instance exactly matches the desired type
683 kit.replace_in_map(receiver, exact_receiver);
684
685 // Make the hot call:
686 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms(), parent_parser);
687 if (new_jvms == NULL) {
688 // Inline failed, so make a direct call.
689 assert(_if_hit->is_inline(), "must have been a failed inline");
690 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
691 new_jvms = cg->generate(kit.sync_jvms(), parent_parser);
692 }
693 kit.add_exception_states_from(new_jvms);
694 kit.set_jvms(new_jvms);
695
696 // Need to merge slow and fast?
697 if (slow_map == NULL) {
698 // The fast path is the only path remaining.
699 return kit.transfer_exceptions_into_jvms();
700 }
701
702 if (kit.stopped()) {
703 // Inlined method threw an exception, so it's just the slow path after all.
704 kit.set_jvms(slow_jvms);
705 return kit.transfer_exceptions_into_jvms();
706 }
707
708 // Finish the diamond.
709 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
710 RegionNode* region = new (kit.C) RegionNode(3);
711 region->init_req(1, kit.control());
712 region->init_req(2, slow_map->control());
713 kit.set_control(gvn.transform(region));
714 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
715 iophi->set_req(2, slow_map->i_o());
716 kit.set_i_o(gvn.transform(iophi));
717 kit.merge_memory(slow_map->merged_memory(), region, 2);
718 uint tos = kit.jvms()->stkoff() + kit.sp();
719 uint limit = slow_map->req();
720 for (uint i = TypeFunc::Parms; i < limit; i++) {
721 // Skip unused stack slots; fast forward to monoff();
722 if (i == tos) {
723 i = kit.jvms()->monoff();
724 if( i >= limit ) break;
725 }
726 Node* m = kit.map()->in(i);
727 Node* n = slow_map->in(i);
728 if (m != n) {
729 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
730 Node* phi = PhiNode::make(region, m, t);
731 phi->set_req(2, n);
732 kit.map()->set_req(i, gvn.transform(phi));
733 }
734 }
735 return kit.transfer_exceptions_into_jvms();
736 }
737
738
739 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool delayed_forbidden) {
740 assert(callee->is_method_handle_intrinsic() ||
741 callee->is_compiled_lambda_form(), "for_method_handle_call mismatch");
742 bool input_not_const;
743 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, input_not_const);
744 Compile* C = Compile::current();
745 if (cg != NULL) {
746 if (!delayed_forbidden && AlwaysIncrementalInline) {
747 return CallGenerator::for_late_inline(callee, cg);
748 } else {
749 return cg;
750 }
751 }
752 int bci = jvms->bci();
753 ciCallProfile profile = caller->call_profile_at_bci(bci);
754 int call_site_count = caller->scale_count(profile.count());
755
756 if (IncrementalInline && call_site_count > 0 &&
757 (input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())) {
758 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const);
759 } else {
760 // Out-of-line call.
761 return CallGenerator::for_direct_call(callee);
762 }
763 }
764
765 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool& input_not_const) {
766 GraphKit kit(jvms);
767 PhaseGVN& gvn = kit.gvn();
768 Compile* C = kit.C;
769 vmIntrinsics::ID iid = callee->intrinsic_id();
770 input_not_const = true;
771 switch (iid) {
772 case vmIntrinsics::_invokeBasic:
773 {
774 // Get MethodHandle receiver:
775 Node* receiver = kit.argument(0);
776 if (receiver->Opcode() == Op_ConP) {
777 input_not_const = false;
778 const TypeOopPtr* oop_ptr = receiver->bottom_type()->is_oopptr();
779 ciMethod* target = oop_ptr->const_oop()->as_method_handle()->get_vmtarget();
780 guarantee(!target->is_method_handle_intrinsic(), "should not happen"); // XXX remove
781 const int vtable_index = Method::invalid_vtable_index;
782 CallGenerator* cg = C->call_generator(target, vtable_index, false, jvms, true, PROB_ALWAYS, NULL, true, true);
783 assert(cg == NULL || !cg->is_late_inline() || cg->is_mh_late_inline(), "no late inline here");
784 if (cg != NULL && cg->is_inline())
785 return cg;
786 } else {
787 const char* msg = "receiver not constant";
788 if (PrintInlining) C->print_inlining(callee, jvms->depth() - 1, jvms->bci(), msg);
789 }
790 }
791 break;
792
793 case vmIntrinsics::_linkToVirtual:
794 case vmIntrinsics::_linkToStatic:
795 case vmIntrinsics::_linkToSpecial:
796 case vmIntrinsics::_linkToInterface:
797 {
798 // Get MemberName argument:
799 Node* member_name = kit.argument(callee->arg_size() - 1);
800 if (member_name->Opcode() == Op_ConP) {
801 input_not_const = false;
802 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr();
803 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget();
804
805 // In lamda forms we erase signature types to avoid resolving issues
806 // involving class loaders. When we optimize a method handle invoke
807 // to a direct call we must cast the receiver and arguments to its
808 // actual types.
809 ciSignature* signature = target->signature();
810 const int receiver_skip = target->is_static() ? 0 : 1;
811 // Cast receiver to its type.
812 if (!target->is_static()) {
813 Node* arg = kit.argument(0);
814 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr();
815 const Type* sig_type = TypeOopPtr::make_from_klass(signature->accessing_klass());
816 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) {
817 Node* cast_obj = gvn.transform(new (C) CheckCastPPNode(kit.control(), arg, sig_type));
818 kit.set_argument(0, cast_obj);
819 }
820 }
821 // Cast reference arguments to its type.
822 for (int i = 0; i < signature->count(); i++) {
823 ciType* t = signature->type_at(i);
824 if (t->is_klass()) {
825 Node* arg = kit.argument(receiver_skip + i);
826 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr();
827 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass());
828 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) {
829 Node* cast_obj = gvn.transform(new (C) CheckCastPPNode(kit.control(), arg, sig_type));
830 kit.set_argument(receiver_skip + i, cast_obj);
831 }
832 }
833 }
834
835 // Try to get the most accurate receiver type
836 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual);
837 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface);
838 int vtable_index = Method::invalid_vtable_index;
839 bool call_does_dispatch = false;
840
841 ciKlass* speculative_receiver_type = NULL;
842 if (is_virtual_or_interface) {
843 ciInstanceKlass* klass = target->holder();
844 Node* receiver_node = kit.argument(0);
845 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr();
846 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
847 target = C->optimize_virtual_call(caller, jvms->bci(), klass, target, receiver_type,
848 is_virtual,
849 call_does_dispatch, vtable_index); // out-parameters
850 // We lack profiling at this call but type speculation may
851 // provide us with a type
852 speculative_receiver_type = receiver_type->speculative_type();
853 }
854 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms, true, PROB_ALWAYS, speculative_receiver_type, true, true);
855 assert(cg == NULL || !cg->is_late_inline() || cg->is_mh_late_inline(), "no late inline here");
856 if (cg != NULL && cg->is_inline())
857 return cg;
858 } else {
859 const char* msg = "member_name not constant";
860 if (PrintInlining) C->print_inlining(callee, jvms->depth() - 1, jvms->bci(), msg);
861 }
862 }
863 break;
864
865 default:
866 fatal(err_msg_res("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid)));
867 break;
868 }
869 return NULL;
870 }
871
872
873 //------------------------PredictedIntrinsicGenerator------------------------------
874 // Internal class which handles all predicted Intrinsic calls.
875 class PredictedIntrinsicGenerator : public CallGenerator {
876 CallGenerator* _intrinsic;
877 CallGenerator* _cg;
878
879 public:
880 PredictedIntrinsicGenerator(CallGenerator* intrinsic,
881 CallGenerator* cg)
882 : CallGenerator(cg->method())
883 {
884 _intrinsic = intrinsic;
885 _cg = cg;
886 }
887
888 virtual bool is_virtual() const { return true; }
889 virtual bool is_inlined() const { return true; }
890 virtual bool is_intrinsic() const { return true; }
891
892 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
893 };
894
895
896 CallGenerator* CallGenerator::for_predicted_intrinsic(CallGenerator* intrinsic,
897 CallGenerator* cg) {
898 return new PredictedIntrinsicGenerator(intrinsic, cg);
899 }
900
901
902 JVMState* PredictedIntrinsicGenerator::generate(JVMState* jvms, Parse* parent_parser) {
903 GraphKit kit(jvms);
904 PhaseGVN& gvn = kit.gvn();
905
906 CompileLog* log = kit.C->log();
907 if (log != NULL) {
908 log->elem("predicted_intrinsic bci='%d' method='%d'",
909 jvms->bci(), log->identify(method()));
910 }
911
912 Node* slow_ctl = _intrinsic->generate_predicate(kit.sync_jvms());
913 if (kit.failing())
914 return NULL; // might happen because of NodeCountInliningCutoff
915
916 kit.C->print_inlining_update(this);
917 SafePointNode* slow_map = NULL;
918 JVMState* slow_jvms;
919 if (slow_ctl != NULL) {
920 PreserveJVMState pjvms(&kit);
921 kit.set_control(slow_ctl);
922 if (!kit.stopped()) {
923 slow_jvms = _cg->generate(kit.sync_jvms(), parent_parser);
924 if (kit.failing())
925 return NULL; // might happen because of NodeCountInliningCutoff
926 assert(slow_jvms != NULL, "must be");
927 kit.add_exception_states_from(slow_jvms);
928 kit.set_map(slow_jvms->map());
929 if (!kit.stopped())
930 slow_map = kit.stop();
931 }
932 }
933
934 if (kit.stopped()) {
935 // Predicate is always false.
936 kit.set_jvms(slow_jvms);
937 return kit.transfer_exceptions_into_jvms();
938 }
939
940 // Generate intrinsic code:
941 JVMState* new_jvms = _intrinsic->generate(kit.sync_jvms(), parent_parser);
942 if (new_jvms == NULL) {
943 // Intrinsic failed, so use slow code or make a direct call.
944 if (slow_map == NULL) {
945 CallGenerator* cg = CallGenerator::for_direct_call(method());
946 new_jvms = cg->generate(kit.sync_jvms(), parent_parser);
947 } else {
948 kit.set_jvms(slow_jvms);
949 return kit.transfer_exceptions_into_jvms();
950 }
951 }
952 kit.add_exception_states_from(new_jvms);
953 kit.set_jvms(new_jvms);
954
955 // Need to merge slow and fast?
956 if (slow_map == NULL) {
957 // The fast path is the only path remaining.
958 return kit.transfer_exceptions_into_jvms();
959 }
960
961 if (kit.stopped()) {
962 // Intrinsic method threw an exception, so it's just the slow path after all.
963 kit.set_jvms(slow_jvms);
964 return kit.transfer_exceptions_into_jvms();
965 }
966
967 // Finish the diamond.
968 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
969 RegionNode* region = new (kit.C) RegionNode(3);
970 region->init_req(1, kit.control());
971 region->init_req(2, slow_map->control());
972 kit.set_control(gvn.transform(region));
973 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
974 iophi->set_req(2, slow_map->i_o());
975 kit.set_i_o(gvn.transform(iophi));
976 kit.merge_memory(slow_map->merged_memory(), region, 2);
977 uint tos = kit.jvms()->stkoff() + kit.sp();
978 uint limit = slow_map->req();
979 for (uint i = TypeFunc::Parms; i < limit; i++) {
980 // Skip unused stack slots; fast forward to monoff();
981 if (i == tos) {
982 i = kit.jvms()->monoff();
983 if( i >= limit ) break;
984 }
985 Node* m = kit.map()->in(i);
986 Node* n = slow_map->in(i);
987 if (m != n) {
988 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
989 Node* phi = PhiNode::make(region, m, t);
990 phi->set_req(2, n);
991 kit.map()->set_req(i, gvn.transform(phi));
992 }
993 }
994 return kit.transfer_exceptions_into_jvms();
995 }
996
997 //-------------------------UncommonTrapCallGenerator-----------------------------
998 // Internal class which handles all out-of-line calls checking receiver type.
999 class UncommonTrapCallGenerator : public CallGenerator {
1000 Deoptimization::DeoptReason _reason;
1001 Deoptimization::DeoptAction _action;
1002
1003 public:
1004 UncommonTrapCallGenerator(ciMethod* m,
1005 Deoptimization::DeoptReason reason,
1006 Deoptimization::DeoptAction action)
1007 : CallGenerator(m)
1008 {
1009 _reason = reason;
1010 _action = action;
1011 }
1012
1013 virtual bool is_virtual() const { ShouldNotReachHere(); return false; }
1014 virtual bool is_trap() const { return true; }
1015
1016 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser);
1017 };
1018
1019
1020 CallGenerator*
1021 CallGenerator::for_uncommon_trap(ciMethod* m,
1022 Deoptimization::DeoptReason reason,
1023 Deoptimization::DeoptAction action) {
1024 return new UncommonTrapCallGenerator(m, reason, action);
1025 }
1026
1027
1028 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms, Parse* parent_parser) {
1029 GraphKit kit(jvms);
1030 kit.C->print_inlining_update(this);
1031 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver).
1032 int nargs = method()->arg_size();
1033 kit.inc_sp(nargs);
1034 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed");
1035 if (_reason == Deoptimization::Reason_class_check &&
1036 _action == Deoptimization::Action_maybe_recompile) {
1037 // Temp fix for 6529811
1038 // Don't allow uncommon_trap to override our decision to recompile in the event
1039 // of a class cast failure for a monomorphic call as it will never let us convert
1040 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops
1041 bool keep_exact_action = true;
1042 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action);
1043 } else {
1044 kit.uncommon_trap(_reason, _action);
1045 }
1046 return kit.transfer_exceptions_into_jvms();
1047 }
1048
1049 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.)
1050
1051 // (Node: Merged hook_up_exits into ParseGenerator::generate.)
1052
1053 #define NODES_OVERHEAD_PER_METHOD (30.0)
1054 #define NODES_PER_BYTECODE (9.5)
1055
1056 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) {
1057 int call_count = profile.count();
1058 int code_size = call_method->code_size();
1059
1060 // Expected execution count is based on the historical count:
1061 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor);
1062
1063 // Expected profit from inlining, in units of simple call-overheads.
1064 _profit = 1.0;
1065
1066 // Expected work performed by the call in units of call-overheads.
1067 // %%% need an empirical curve fit for "work" (time in call)
1068 float bytecodes_per_call = 3;
1069 _work = 1.0 + code_size / bytecodes_per_call;
1070
1071 // Expected size of compilation graph:
1072 // -XX:+PrintParseStatistics once reported:
1073 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391
1074 // Histogram of 144298 parsed bytecodes:
1075 // %%% Need an better predictor for graph size.
1076 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size);
1077 }
1078
1079 // is_cold: Return true if the node should never be inlined.
1080 // This is true if any of the key metrics are extreme.
1081 bool WarmCallInfo::is_cold() const {
1082 if (count() < WarmCallMinCount) return true;
1083 if (profit() < WarmCallMinProfit) return true;
1084 if (work() > WarmCallMaxWork) return true;
1085 if (size() > WarmCallMaxSize) return true;
1086 return false;
1087 }
1088
1089 // is_hot: Return true if the node should be inlined immediately.
1090 // This is true if any of the key metrics are extreme.
1091 bool WarmCallInfo::is_hot() const {
1092 assert(!is_cold(), "eliminate is_cold cases before testing is_hot");
1093 if (count() >= HotCallCountThreshold) return true;
1094 if (profit() >= HotCallProfitThreshold) return true;
1095 if (work() <= HotCallTrivialWork) return true;
1096 if (size() <= HotCallTrivialSize) return true;
1097 return false;
1098 }
1099
1100 // compute_heat:
1101 float WarmCallInfo::compute_heat() const {
1102 assert(!is_cold(), "compute heat only on warm nodes");
1103 assert(!is_hot(), "compute heat only on warm nodes");
1104 int min_size = MAX2(0, (int)HotCallTrivialSize);
1105 int max_size = MIN2(500, (int)WarmCallMaxSize);
1106 float method_size = (size() - min_size) / MAX2(1, max_size - min_size);
1107 float size_factor;
1108 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg.
1109 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg.
1110 else if (method_size < 0.5) size_factor = 1; // better than avg.
1111 else size_factor = 0.5; // worse than avg.
1112 return (count() * profit() * size_factor);
1113 }
1114
1115 bool WarmCallInfo::warmer_than(WarmCallInfo* that) {
1116 assert(this != that, "compare only different WCIs");
1117 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st");
1118 if (this->heat() > that->heat()) return true;
1119 if (this->heat() < that->heat()) return false;
1120 assert(this->heat() == that->heat(), "no NaN heat allowed");
1121 // Equal heat. Break the tie some other way.
1122 if (!this->call() || !that->call()) return (address)this > (address)that;
1123 return this->call()->_idx > that->call()->_idx;
1124 }
1125
1126 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress)
1127 #define UNINIT_NEXT ((WarmCallInfo*)NULL)
1128
1129 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) {
1130 assert(next() == UNINIT_NEXT, "not yet on any list");
1131 WarmCallInfo* prev_p = NULL;
1132 WarmCallInfo* next_p = head;
1133 while (next_p != NULL && next_p->warmer_than(this)) {
1134 prev_p = next_p;
1135 next_p = prev_p->next();
1136 }
1137 // Install this between prev_p and next_p.
1138 this->set_next(next_p);
1139 if (prev_p == NULL)
1140 head = this;
1141 else
1142 prev_p->set_next(this);
1143 return head;
1144 }
1145
1146 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) {
1147 WarmCallInfo* prev_p = NULL;
1148 WarmCallInfo* next_p = head;
1149 while (next_p != this) {
1150 assert(next_p != NULL, "this must be in the list somewhere");
1151 prev_p = next_p;
1152 next_p = prev_p->next();
1153 }
1154 next_p = this->next();
1155 debug_only(this->set_next(UNINIT_NEXT));
1156 // Remove this from between prev_p and next_p.
1157 if (prev_p == NULL)
1158 head = next_p;
1159 else
1160 prev_p->set_next(next_p);
1161 return head;
1162 }
1163
1164 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(),
1165 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE());
1166 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(),
1167 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE());
1168
1169 WarmCallInfo* WarmCallInfo::always_hot() {
1170 assert(_always_hot.is_hot(), "must always be hot");
1171 return &_always_hot;
1172 }
1173
1174 WarmCallInfo* WarmCallInfo::always_cold() {
1175 assert(_always_cold.is_cold(), "must always be cold");
1176 return &_always_cold;
1177 }
1178
1179
1180 #ifndef PRODUCT
1181
1182 void WarmCallInfo::print() const {
1183 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p",
1184 is_cold() ? "cold" : is_hot() ? "hot " : "warm",
1185 count(), profit(), work(), size(), compute_heat(), next());
1186 tty->cr();
1187 if (call() != NULL) call()->dump();
1188 }
1189
1190 void print_wci(WarmCallInfo* ci) {
1191 ci->print();
1192 }
1193
1194 void WarmCallInfo::print_all() const {
1195 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1196 p->print();
1197 }
1198
1199 int WarmCallInfo::count_all() const {
1200 int cnt = 0;
1201 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1202 cnt++;
1203 return cnt;
1204 }
1205
1206 #endif //PRODUCT