Mon, 18 Jun 2012 15:17:30 -0700
7157365: jruby/bench.bench_timeout crashes with JVM internal error
Reviewed-by: jrose, kvn
1 /*
2 * Copyright (c) 2000, 2011, 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/bcEscapeAnalyzer.hpp"
27 #include "ci/ciCallSite.hpp"
28 #include "ci/ciCPCache.hpp"
29 #include "ci/ciMethodHandle.hpp"
30 #include "classfile/javaClasses.hpp"
31 #include "compiler/compileLog.hpp"
32 #include "opto/addnode.hpp"
33 #include "opto/callGenerator.hpp"
34 #include "opto/callnode.hpp"
35 #include "opto/cfgnode.hpp"
36 #include "opto/connode.hpp"
37 #include "opto/parse.hpp"
38 #include "opto/rootnode.hpp"
39 #include "opto/runtime.hpp"
40 #include "opto/subnode.hpp"
42 CallGenerator::CallGenerator(ciMethod* method) {
43 _method = method;
44 }
46 // Utility function.
47 const TypeFunc* CallGenerator::tf() const {
48 return TypeFunc::make(method());
49 }
51 //-----------------------------ParseGenerator---------------------------------
52 // Internal class which handles all direct bytecode traversal.
53 class ParseGenerator : public InlineCallGenerator {
54 private:
55 bool _is_osr;
56 float _expected_uses;
58 public:
59 ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false)
60 : InlineCallGenerator(method)
61 {
62 _is_osr = is_osr;
63 _expected_uses = expected_uses;
64 assert(InlineTree::check_can_parse(method) == NULL, "parse must be possible");
65 }
67 virtual bool is_parse() const { return true; }
68 virtual JVMState* generate(JVMState* jvms);
69 int is_osr() { return _is_osr; }
71 };
73 JVMState* ParseGenerator::generate(JVMState* jvms) {
74 Compile* C = Compile::current();
76 if (is_osr()) {
77 // The JVMS for a OSR has a single argument (see its TypeFunc).
78 assert(jvms->depth() == 1, "no inline OSR");
79 }
81 if (C->failing()) {
82 return NULL; // bailing out of the compile; do not try to parse
83 }
85 Parse parser(jvms, method(), _expected_uses);
86 // Grab signature for matching/allocation
87 #ifdef ASSERT
88 if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) {
89 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag);
90 assert(C->env()->system_dictionary_modification_counter_changed(),
91 "Must invalidate if TypeFuncs differ");
92 }
93 #endif
95 GraphKit& exits = parser.exits();
97 if (C->failing()) {
98 while (exits.pop_exception_state() != NULL) ;
99 return NULL;
100 }
102 assert(exits.jvms()->same_calls_as(jvms), "sanity");
104 // Simply return the exit state of the parser,
105 // augmented by any exceptional states.
106 return exits.transfer_exceptions_into_jvms();
107 }
109 //---------------------------DirectCallGenerator------------------------------
110 // Internal class which handles all out-of-line calls w/o receiver type checks.
111 class DirectCallGenerator : public CallGenerator {
112 private:
113 CallStaticJavaNode* _call_node;
114 // Force separate memory and I/O projections for the exceptional
115 // paths to facilitate late inlinig.
116 bool _separate_io_proj;
118 public:
119 DirectCallGenerator(ciMethod* method, bool separate_io_proj)
120 : CallGenerator(method),
121 _separate_io_proj(separate_io_proj)
122 {
123 }
124 virtual JVMState* generate(JVMState* jvms);
126 CallStaticJavaNode* call_node() const { return _call_node; }
127 };
129 JVMState* DirectCallGenerator::generate(JVMState* jvms) {
130 GraphKit kit(jvms);
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();
135 if (kit.C->log() != NULL) {
136 kit.C->log()->elem("direct_call bci='%d'", jvms->bci());
137 }
139 CallStaticJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallStaticJavaNode(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(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_invoke()) {
152 call->set_method_handle_invoke(true);
153 }
154 }
155 kit.set_arguments_for_java_call(call);
156 kit.set_edges_for_java_call(call, false, _separate_io_proj);
157 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
158 kit.push_node(method()->return_type()->basic_type(), ret);
159 return kit.transfer_exceptions_into_jvms();
160 }
162 //---------------------------DynamicCallGenerator-----------------------------
163 // Internal class which handles all out-of-line invokedynamic calls.
164 class DynamicCallGenerator : public CallGenerator {
165 public:
166 DynamicCallGenerator(ciMethod* method)
167 : CallGenerator(method)
168 {
169 }
170 virtual JVMState* generate(JVMState* jvms);
171 };
173 JVMState* DynamicCallGenerator::generate(JVMState* jvms) {
174 GraphKit kit(jvms);
175 Compile* C = kit.C;
176 PhaseGVN& gvn = kit.gvn();
178 if (C->log() != NULL) {
179 C->log()->elem("dynamic_call bci='%d'", jvms->bci());
180 }
182 // Get the constant pool cache from the caller class.
183 ciMethod* caller_method = jvms->method();
184 ciBytecodeStream str(caller_method);
185 str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci.
186 assert(str.cur_bc() == Bytecodes::_invokedynamic, "wrong place to issue a dynamic call!");
187 ciCPCache* cpcache = str.get_cpcache();
189 // Get the offset of the CallSite from the constant pool cache
190 // pointer.
191 int index = str.get_method_index();
192 size_t call_site_offset = cpcache->get_f1_offset(index);
194 // Load the CallSite object from the constant pool cache.
195 const TypeOopPtr* cpcache_type = TypeOopPtr::make_from_constant(cpcache); // returns TypeAryPtr of type T_OBJECT
196 const TypeOopPtr* call_site_type = TypeOopPtr::make_from_klass(C->env()->CallSite_klass());
197 Node* cpcache_adr = kit.makecon(cpcache_type);
198 Node* call_site_adr = kit.basic_plus_adr(cpcache_adr, call_site_offset);
199 // The oops in the constant pool cache are not compressed; load then as raw pointers.
200 Node* call_site = kit.make_load(kit.control(), call_site_adr, call_site_type, T_ADDRESS, Compile::AliasIdxRaw);
202 // Load the target MethodHandle from the CallSite object.
203 const TypeOopPtr* target_type = TypeOopPtr::make_from_klass(C->env()->MethodHandle_klass());
204 Node* target_mh_adr = kit.basic_plus_adr(call_site, java_lang_invoke_CallSite::target_offset_in_bytes());
205 Node* target_mh = kit.make_load(kit.control(), target_mh_adr, target_type, T_OBJECT);
207 address resolve_stub = SharedRuntime::get_resolve_opt_virtual_call_stub();
209 CallStaticJavaNode* call = new (C, tf()->domain()->cnt()) CallStaticJavaNode(tf(), resolve_stub, method(), kit.bci());
210 // invokedynamic is treated as an optimized invokevirtual.
211 call->set_optimized_virtual(true);
212 // Take extra care (in the presence of argument motion) not to trash the SP:
213 call->set_method_handle_invoke(true);
215 // Pass the target MethodHandle as first argument and shift the
216 // other arguments.
217 call->init_req(0 + TypeFunc::Parms, target_mh);
218 uint nargs = call->method()->arg_size();
219 for (uint i = 1; i < nargs; i++) {
220 Node* arg = kit.argument(i - 1);
221 call->init_req(i + TypeFunc::Parms, arg);
222 }
224 kit.set_edges_for_java_call(call);
225 Node* ret = kit.set_results_for_java_call(call);
226 kit.push_node(method()->return_type()->basic_type(), ret);
227 return kit.transfer_exceptions_into_jvms();
228 }
230 //--------------------------VirtualCallGenerator------------------------------
231 // Internal class which handles all out-of-line calls checking receiver type.
232 class VirtualCallGenerator : public CallGenerator {
233 private:
234 int _vtable_index;
235 public:
236 VirtualCallGenerator(ciMethod* method, int vtable_index)
237 : CallGenerator(method), _vtable_index(vtable_index)
238 {
239 assert(vtable_index == methodOopDesc::invalid_vtable_index ||
240 vtable_index >= 0, "either invalid or usable");
241 }
242 virtual bool is_virtual() const { return true; }
243 virtual JVMState* generate(JVMState* jvms);
244 };
246 JVMState* VirtualCallGenerator::generate(JVMState* jvms) {
247 GraphKit kit(jvms);
248 Node* receiver = kit.argument(0);
250 if (kit.C->log() != NULL) {
251 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci());
252 }
254 // If the receiver is a constant null, do not torture the system
255 // by attempting to call through it. The compile will proceed
256 // correctly, but may bail out in final_graph_reshaping, because
257 // the call instruction will have a seemingly deficient out-count.
258 // (The bailout says something misleading about an "infinite loop".)
259 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) {
260 kit.inc_sp(method()->arg_size()); // restore arguments
261 kit.uncommon_trap(Deoptimization::Reason_null_check,
262 Deoptimization::Action_none,
263 NULL, "null receiver");
264 return kit.transfer_exceptions_into_jvms();
265 }
267 // Ideally we would unconditionally do a null check here and let it
268 // be converted to an implicit check based on profile information.
269 // However currently the conversion to implicit null checks in
270 // Block::implicit_null_check() only looks for loads and stores, not calls.
271 ciMethod *caller = kit.method();
272 ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data();
273 if (!UseInlineCaches || !ImplicitNullChecks ||
274 ((ImplicitNullCheckThreshold > 0) && caller_md &&
275 (caller_md->trap_count(Deoptimization::Reason_null_check)
276 >= (uint)ImplicitNullCheckThreshold))) {
277 // Make an explicit receiver null_check as part of this call.
278 // Since we share a map with the caller, his JVMS gets adjusted.
279 receiver = kit.null_check_receiver(method());
280 if (kit.stopped()) {
281 // And dump it back to the caller, decorated with any exceptions:
282 return kit.transfer_exceptions_into_jvms();
283 }
284 }
286 assert(!method()->is_static(), "virtual call must not be to static");
287 assert(!method()->is_final(), "virtual call should not be to final");
288 assert(!method()->is_private(), "virtual call should not be to private");
289 assert(_vtable_index == methodOopDesc::invalid_vtable_index || !UseInlineCaches,
290 "no vtable calls if +UseInlineCaches ");
291 address target = SharedRuntime::get_resolve_virtual_call_stub();
292 // Normal inline cache used for call
293 CallDynamicJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci());
294 kit.set_arguments_for_java_call(call);
295 kit.set_edges_for_java_call(call);
296 Node* ret = kit.set_results_for_java_call(call);
297 kit.push_node(method()->return_type()->basic_type(), ret);
299 // Represent the effect of an implicit receiver null_check
300 // as part of this call. Since we share a map with the caller,
301 // his JVMS gets adjusted.
302 kit.cast_not_null(receiver);
303 return kit.transfer_exceptions_into_jvms();
304 }
306 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) {
307 if (InlineTree::check_can_parse(m) != NULL) return NULL;
308 return new ParseGenerator(m, expected_uses);
309 }
311 // As a special case, the JVMS passed to this CallGenerator is
312 // for the method execution already in progress, not just the JVMS
313 // of the caller. Thus, this CallGenerator cannot be mixed with others!
314 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) {
315 if (InlineTree::check_can_parse(m) != NULL) return NULL;
316 float past_uses = m->interpreter_invocation_count();
317 float expected_uses = past_uses;
318 return new ParseGenerator(m, expected_uses, true);
319 }
321 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) {
322 assert(!m->is_abstract(), "for_direct_call mismatch");
323 return new DirectCallGenerator(m, separate_io_proj);
324 }
326 CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) {
327 assert(!m->is_static(), "for_virtual_call mismatch");
328 assert(!m->is_method_handle_invoke(), "should be a direct call");
329 return new VirtualCallGenerator(m, vtable_index);
330 }
332 CallGenerator* CallGenerator::for_dynamic_call(ciMethod* m) {
333 assert(m->is_method_handle_invoke() || m->is_method_handle_adapter(), "for_dynamic_call mismatch");
334 return new DynamicCallGenerator(m);
335 }
337 // Allow inlining decisions to be delayed
338 class LateInlineCallGenerator : public DirectCallGenerator {
339 CallGenerator* _inline_cg;
341 public:
342 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
343 DirectCallGenerator(method, true), _inline_cg(inline_cg) {}
345 virtual bool is_late_inline() const { return true; }
347 // Convert the CallStaticJava into an inline
348 virtual void do_late_inline();
350 JVMState* generate(JVMState* jvms) {
351 // Record that this call site should be revisited once the main
352 // parse is finished.
353 Compile::current()->add_late_inline(this);
355 // Emit the CallStaticJava and request separate projections so
356 // that the late inlining logic can distinguish between fall
357 // through and exceptional uses of the memory and io projections
358 // as is done for allocations and macro expansion.
359 return DirectCallGenerator::generate(jvms);
360 }
362 };
365 void LateInlineCallGenerator::do_late_inline() {
366 // Can't inline it
367 if (call_node() == NULL || call_node()->outcnt() == 0 ||
368 call_node()->in(0) == NULL || call_node()->in(0)->is_top())
369 return;
371 CallStaticJavaNode* call = call_node();
373 // Make a clone of the JVMState that appropriate to use for driving a parse
374 Compile* C = Compile::current();
375 JVMState* jvms = call->jvms()->clone_shallow(C);
376 uint size = call->req();
377 SafePointNode* map = new (C, size) SafePointNode(size, jvms);
378 for (uint i1 = 0; i1 < size; i1++) {
379 map->init_req(i1, call->in(i1));
380 }
382 // Make sure the state is a MergeMem for parsing.
383 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
384 map->set_req(TypeFunc::Memory, MergeMemNode::make(C, map->in(TypeFunc::Memory)));
385 }
387 // Make enough space for the expression stack and transfer the incoming arguments
388 int nargs = method()->arg_size();
389 jvms->set_map(map);
390 map->ensure_stack(jvms, jvms->method()->max_stack());
391 if (nargs > 0) {
392 for (int i1 = 0; i1 < nargs; i1++) {
393 map->set_req(i1 + jvms->argoff(), call->in(TypeFunc::Parms + i1));
394 }
395 }
397 CompileLog* log = C->log();
398 if (log != NULL) {
399 log->head("late_inline method='%d'", log->identify(method()));
400 JVMState* p = jvms;
401 while (p != NULL) {
402 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
403 p = p->caller();
404 }
405 log->tail("late_inline");
406 }
408 // Setup default node notes to be picked up by the inlining
409 Node_Notes* old_nn = C->default_node_notes();
410 if (old_nn != NULL) {
411 Node_Notes* entry_nn = old_nn->clone(C);
412 entry_nn->set_jvms(jvms);
413 C->set_default_node_notes(entry_nn);
414 }
416 // Now perform the inling using the synthesized JVMState
417 JVMState* new_jvms = _inline_cg->generate(jvms);
418 if (new_jvms == NULL) return; // no change
419 if (C->failing()) return;
421 // Capture any exceptional control flow
422 GraphKit kit(new_jvms);
424 // Find the result object
425 Node* result = C->top();
426 int result_size = method()->return_type()->size();
427 if (result_size != 0 && !kit.stopped()) {
428 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
429 }
431 kit.replace_call(call, result);
432 }
435 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
436 return new LateInlineCallGenerator(method, inline_cg);
437 }
440 //---------------------------WarmCallGenerator--------------------------------
441 // Internal class which handles initial deferral of inlining decisions.
442 class WarmCallGenerator : public CallGenerator {
443 WarmCallInfo* _call_info;
444 CallGenerator* _if_cold;
445 CallGenerator* _if_hot;
446 bool _is_virtual; // caches virtuality of if_cold
447 bool _is_inline; // caches inline-ness of if_hot
449 public:
450 WarmCallGenerator(WarmCallInfo* ci,
451 CallGenerator* if_cold,
452 CallGenerator* if_hot)
453 : CallGenerator(if_cold->method())
454 {
455 assert(method() == if_hot->method(), "consistent choices");
456 _call_info = ci;
457 _if_cold = if_cold;
458 _if_hot = if_hot;
459 _is_virtual = if_cold->is_virtual();
460 _is_inline = if_hot->is_inline();
461 }
463 virtual bool is_inline() const { return _is_inline; }
464 virtual bool is_virtual() const { return _is_virtual; }
465 virtual bool is_deferred() const { return true; }
467 virtual JVMState* generate(JVMState* jvms);
468 };
471 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci,
472 CallGenerator* if_cold,
473 CallGenerator* if_hot) {
474 return new WarmCallGenerator(ci, if_cold, if_hot);
475 }
477 JVMState* WarmCallGenerator::generate(JVMState* jvms) {
478 Compile* C = Compile::current();
479 if (C->log() != NULL) {
480 C->log()->elem("warm_call bci='%d'", jvms->bci());
481 }
482 jvms = _if_cold->generate(jvms);
483 if (jvms != NULL) {
484 Node* m = jvms->map()->control();
485 if (m->is_CatchProj()) m = m->in(0); else m = C->top();
486 if (m->is_Catch()) m = m->in(0); else m = C->top();
487 if (m->is_Proj()) m = m->in(0); else m = C->top();
488 if (m->is_CallJava()) {
489 _call_info->set_call(m->as_Call());
490 _call_info->set_hot_cg(_if_hot);
491 #ifndef PRODUCT
492 if (PrintOpto || PrintOptoInlining) {
493 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci());
494 tty->print("WCI: ");
495 _call_info->print();
496 }
497 #endif
498 _call_info->set_heat(_call_info->compute_heat());
499 C->set_warm_calls(_call_info->insert_into(C->warm_calls()));
500 }
501 }
502 return jvms;
503 }
505 void WarmCallInfo::make_hot() {
506 Unimplemented();
507 }
509 void WarmCallInfo::make_cold() {
510 // No action: Just dequeue.
511 }
514 //------------------------PredictedCallGenerator------------------------------
515 // Internal class which handles all out-of-line calls checking receiver type.
516 class PredictedCallGenerator : public CallGenerator {
517 ciKlass* _predicted_receiver;
518 CallGenerator* _if_missed;
519 CallGenerator* _if_hit;
520 float _hit_prob;
522 public:
523 PredictedCallGenerator(ciKlass* predicted_receiver,
524 CallGenerator* if_missed,
525 CallGenerator* if_hit, float hit_prob)
526 : CallGenerator(if_missed->method())
527 {
528 // The call profile data may predict the hit_prob as extreme as 0 or 1.
529 // Remove the extremes values from the range.
530 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX;
531 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
533 _predicted_receiver = predicted_receiver;
534 _if_missed = if_missed;
535 _if_hit = if_hit;
536 _hit_prob = hit_prob;
537 }
539 virtual bool is_virtual() const { return true; }
540 virtual bool is_inline() const { return _if_hit->is_inline(); }
541 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
543 virtual JVMState* generate(JVMState* jvms);
544 };
547 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver,
548 CallGenerator* if_missed,
549 CallGenerator* if_hit,
550 float hit_prob) {
551 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob);
552 }
555 JVMState* PredictedCallGenerator::generate(JVMState* jvms) {
556 GraphKit kit(jvms);
557 PhaseGVN& gvn = kit.gvn();
558 // We need an explicit receiver null_check before checking its type.
559 // We share a map with the caller, so his JVMS gets adjusted.
560 Node* receiver = kit.argument(0);
562 CompileLog* log = kit.C->log();
563 if (log != NULL) {
564 log->elem("predicted_call bci='%d' klass='%d'",
565 jvms->bci(), log->identify(_predicted_receiver));
566 }
568 receiver = kit.null_check_receiver(method());
569 if (kit.stopped()) {
570 return kit.transfer_exceptions_into_jvms();
571 }
573 Node* exact_receiver = receiver; // will get updated in place...
574 Node* slow_ctl = kit.type_check_receiver(receiver,
575 _predicted_receiver, _hit_prob,
576 &exact_receiver);
578 SafePointNode* slow_map = NULL;
579 JVMState* slow_jvms;
580 { PreserveJVMState pjvms(&kit);
581 kit.set_control(slow_ctl);
582 if (!kit.stopped()) {
583 slow_jvms = _if_missed->generate(kit.sync_jvms());
584 if (kit.failing())
585 return NULL; // might happen because of NodeCountInliningCutoff
586 assert(slow_jvms != NULL, "must be");
587 kit.add_exception_states_from(slow_jvms);
588 kit.set_map(slow_jvms->map());
589 if (!kit.stopped())
590 slow_map = kit.stop();
591 }
592 }
594 if (kit.stopped()) {
595 // Instance exactly does not matches the desired type.
596 kit.set_jvms(slow_jvms);
597 return kit.transfer_exceptions_into_jvms();
598 }
600 // fall through if the instance exactly matches the desired type
601 kit.replace_in_map(receiver, exact_receiver);
603 // Make the hot call:
604 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
605 if (new_jvms == NULL) {
606 // Inline failed, so make a direct call.
607 assert(_if_hit->is_inline(), "must have been a failed inline");
608 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
609 new_jvms = cg->generate(kit.sync_jvms());
610 }
611 kit.add_exception_states_from(new_jvms);
612 kit.set_jvms(new_jvms);
614 // Need to merge slow and fast?
615 if (slow_map == NULL) {
616 // The fast path is the only path remaining.
617 return kit.transfer_exceptions_into_jvms();
618 }
620 if (kit.stopped()) {
621 // Inlined method threw an exception, so it's just the slow path after all.
622 kit.set_jvms(slow_jvms);
623 return kit.transfer_exceptions_into_jvms();
624 }
626 // Finish the diamond.
627 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
628 RegionNode* region = new (kit.C, 3) RegionNode(3);
629 region->init_req(1, kit.control());
630 region->init_req(2, slow_map->control());
631 kit.set_control(gvn.transform(region));
632 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
633 iophi->set_req(2, slow_map->i_o());
634 kit.set_i_o(gvn.transform(iophi));
635 kit.merge_memory(slow_map->merged_memory(), region, 2);
636 uint tos = kit.jvms()->stkoff() + kit.sp();
637 uint limit = slow_map->req();
638 for (uint i = TypeFunc::Parms; i < limit; i++) {
639 // Skip unused stack slots; fast forward to monoff();
640 if (i == tos) {
641 i = kit.jvms()->monoff();
642 if( i >= limit ) break;
643 }
644 Node* m = kit.map()->in(i);
645 Node* n = slow_map->in(i);
646 if (m != n) {
647 const Type* t = gvn.type(m)->meet(gvn.type(n));
648 Node* phi = PhiNode::make(region, m, t);
649 phi->set_req(2, n);
650 kit.map()->set_req(i, gvn.transform(phi));
651 }
652 }
653 return kit.transfer_exceptions_into_jvms();
654 }
657 //------------------------PredictedDynamicCallGenerator-----------------------
658 // Internal class which handles all out-of-line calls checking receiver type.
659 class PredictedDynamicCallGenerator : public CallGenerator {
660 ciMethodHandle* _predicted_method_handle;
661 CallGenerator* _if_missed;
662 CallGenerator* _if_hit;
663 float _hit_prob;
665 public:
666 PredictedDynamicCallGenerator(ciMethodHandle* predicted_method_handle,
667 CallGenerator* if_missed,
668 CallGenerator* if_hit,
669 float hit_prob)
670 : CallGenerator(if_missed->method()),
671 _predicted_method_handle(predicted_method_handle),
672 _if_missed(if_missed),
673 _if_hit(if_hit),
674 _hit_prob(hit_prob)
675 {}
677 virtual bool is_inline() const { return _if_hit->is_inline(); }
678 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
680 virtual JVMState* generate(JVMState* jvms);
681 };
684 CallGenerator* CallGenerator::for_predicted_dynamic_call(ciMethodHandle* predicted_method_handle,
685 CallGenerator* if_missed,
686 CallGenerator* if_hit,
687 float hit_prob) {
688 return new PredictedDynamicCallGenerator(predicted_method_handle, if_missed, if_hit, hit_prob);
689 }
692 CallGenerator* CallGenerator::for_method_handle_call(Node* method_handle, JVMState* jvms,
693 ciMethod* caller, ciMethod* callee, ciCallProfile profile) {
694 assert(callee->is_method_handle_invoke() || callee->is_method_handle_adapter(), "for_method_handle_call mismatch");
695 CallGenerator* cg = CallGenerator::for_method_handle_inline(method_handle, jvms, caller, callee, profile);
696 if (cg != NULL)
697 return cg;
698 return CallGenerator::for_direct_call(callee);
699 }
701 CallGenerator* CallGenerator::for_method_handle_inline(Node* method_handle, JVMState* jvms,
702 ciMethod* caller, ciMethod* callee, ciCallProfile profile) {
703 if (method_handle->Opcode() == Op_ConP) {
704 const TypeOopPtr* oop_ptr = method_handle->bottom_type()->is_oopptr();
705 ciObject* const_oop = oop_ptr->const_oop();
706 ciMethodHandle* method_handle = const_oop->as_method_handle();
708 // Set the callee to have access to the class and signature in
709 // the MethodHandleCompiler.
710 method_handle->set_callee(callee);
711 method_handle->set_caller(caller);
712 method_handle->set_call_profile(profile);
714 // Get an adapter for the MethodHandle.
715 ciMethod* target_method = method_handle->get_method_handle_adapter();
716 if (target_method != NULL) {
717 CallGenerator* cg = Compile::current()->call_generator(target_method, -1, false, jvms, true, PROB_ALWAYS);
718 if (cg != NULL && cg->is_inline())
719 return cg;
720 }
721 } else if (method_handle->Opcode() == Op_Phi && method_handle->req() == 3 &&
722 method_handle->in(1)->Opcode() == Op_ConP && method_handle->in(2)->Opcode() == Op_ConP) {
723 float prob = PROB_FAIR;
724 Node* meth_region = method_handle->in(0);
725 if (meth_region->is_Region() &&
726 meth_region->in(1)->is_Proj() && meth_region->in(2)->is_Proj() &&
727 meth_region->in(1)->in(0) == meth_region->in(2)->in(0) &&
728 meth_region->in(1)->in(0)->is_If()) {
729 // If diamond, so grab the probability of the test to drive the inlining below
730 prob = meth_region->in(1)->in(0)->as_If()->_prob;
731 if (meth_region->in(1)->is_IfTrue()) {
732 prob = 1 - prob;
733 }
734 }
736 // selectAlternative idiom merging two constant MethodHandles.
737 // Generate a guard so that each can be inlined. We might want to
738 // do more inputs at later point but this gets the most common
739 // case.
740 CallGenerator* cg1 = for_method_handle_call(method_handle->in(1), jvms, caller, callee, profile.rescale(1.0 - prob));
741 CallGenerator* cg2 = for_method_handle_call(method_handle->in(2), jvms, caller, callee, profile.rescale(prob));
742 if (cg1 != NULL && cg2 != NULL) {
743 const TypeOopPtr* oop_ptr = method_handle->in(1)->bottom_type()->is_oopptr();
744 ciObject* const_oop = oop_ptr->const_oop();
745 ciMethodHandle* mh = const_oop->as_method_handle();
746 return new PredictedDynamicCallGenerator(mh, cg2, cg1, prob);
747 }
748 }
749 return NULL;
750 }
752 CallGenerator* CallGenerator::for_invokedynamic_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, ciCallProfile profile) {
753 assert(callee->is_method_handle_invoke() || callee->is_method_handle_adapter(), "for_invokedynamic_call mismatch");
754 // Get the CallSite object.
755 ciBytecodeStream str(caller);
756 str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci.
757 ciCallSite* call_site = str.get_call_site();
758 CallGenerator* cg = CallGenerator::for_invokedynamic_inline(call_site, jvms, caller, callee, profile);
759 if (cg != NULL)
760 return cg;
761 return CallGenerator::for_dynamic_call(callee);
762 }
764 CallGenerator* CallGenerator::for_invokedynamic_inline(ciCallSite* call_site, JVMState* jvms,
765 ciMethod* caller, ciMethod* callee, ciCallProfile profile) {
766 ciMethodHandle* method_handle = call_site->get_target();
768 // Set the callee to have access to the class and signature in the
769 // MethodHandleCompiler.
770 method_handle->set_callee(callee);
771 method_handle->set_caller(caller);
772 method_handle->set_call_profile(profile);
774 // Get an adapter for the MethodHandle.
775 ciMethod* target_method = method_handle->get_invokedynamic_adapter();
776 if (target_method != NULL) {
777 Compile *C = Compile::current();
778 CallGenerator* cg = C->call_generator(target_method, -1, false, jvms, true, PROB_ALWAYS);
779 if (cg != NULL && cg->is_inline()) {
780 // Add a dependence for invalidation of the optimization.
781 if (!call_site->is_constant_call_site()) {
782 C->dependencies()->assert_call_site_target_value(call_site, method_handle);
783 }
784 return cg;
785 }
786 }
787 return NULL;
788 }
791 JVMState* PredictedDynamicCallGenerator::generate(JVMState* jvms) {
792 GraphKit kit(jvms);
793 Compile* C = kit.C;
794 PhaseGVN& gvn = kit.gvn();
796 CompileLog* log = C->log();
797 if (log != NULL) {
798 log->elem("predicted_dynamic_call bci='%d'", jvms->bci());
799 }
801 const TypeOopPtr* predicted_mh_ptr = TypeOopPtr::make_from_constant(_predicted_method_handle, true);
802 Node* predicted_mh = kit.makecon(predicted_mh_ptr);
804 Node* bol = NULL;
805 int bc = jvms->method()->java_code_at_bci(jvms->bci());
806 if (bc != Bytecodes::_invokedynamic) {
807 // This is the selectAlternative idiom for guardWithTest or
808 // similar idioms.
809 Node* receiver = kit.argument(0);
811 // Check if the MethodHandle is the expected one
812 Node* cmp = gvn.transform(new (C, 3) CmpPNode(receiver, predicted_mh));
813 bol = gvn.transform(new (C, 2) BoolNode(cmp, BoolTest::eq) );
814 } else {
815 // Get the constant pool cache from the caller class.
816 ciMethod* caller_method = jvms->method();
817 ciBytecodeStream str(caller_method);
818 str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci.
819 ciCPCache* cpcache = str.get_cpcache();
821 // Get the offset of the CallSite from the constant pool cache
822 // pointer.
823 int index = str.get_method_index();
824 size_t call_site_offset = cpcache->get_f1_offset(index);
826 // Load the CallSite object from the constant pool cache.
827 const TypeOopPtr* cpcache_type = TypeOopPtr::make_from_constant(cpcache); // returns TypeAryPtr of type T_OBJECT
828 const TypeOopPtr* call_site_type = TypeOopPtr::make_from_klass(C->env()->CallSite_klass());
829 Node* cpcache_adr = kit.makecon(cpcache_type);
830 Node* call_site_adr = kit.basic_plus_adr(cpcache_adr, call_site_offset);
831 // The oops in the constant pool cache are not compressed; load then as raw pointers.
832 Node* call_site = kit.make_load(kit.control(), call_site_adr, call_site_type, T_ADDRESS, Compile::AliasIdxRaw);
834 // Load the target MethodHandle from the CallSite object.
835 const TypeOopPtr* target_type = TypeOopPtr::make_from_klass(C->env()->MethodHandle_klass());
836 Node* target_adr = kit.basic_plus_adr(call_site, call_site, java_lang_invoke_CallSite::target_offset_in_bytes());
837 Node* target_mh = kit.make_load(kit.control(), target_adr, target_type, T_OBJECT);
839 // Check if the MethodHandle is still the same.
840 Node* cmp = gvn.transform(new (C, 3) CmpPNode(target_mh, predicted_mh));
841 bol = gvn.transform(new (C, 2) BoolNode(cmp, BoolTest::eq) );
842 }
843 IfNode* iff = kit.create_and_xform_if(kit.control(), bol, _hit_prob, COUNT_UNKNOWN);
844 kit.set_control( gvn.transform(new (C, 1) IfTrueNode (iff)));
845 Node* slow_ctl = gvn.transform(new (C, 1) IfFalseNode(iff));
847 SafePointNode* slow_map = NULL;
848 JVMState* slow_jvms;
849 { PreserveJVMState pjvms(&kit);
850 kit.set_control(slow_ctl);
851 if (!kit.stopped()) {
852 slow_jvms = _if_missed->generate(kit.sync_jvms());
853 if (kit.failing())
854 return NULL; // might happen because of NodeCountInliningCutoff
855 assert(slow_jvms != NULL, "must be");
856 kit.add_exception_states_from(slow_jvms);
857 kit.set_map(slow_jvms->map());
858 if (!kit.stopped())
859 slow_map = kit.stop();
860 }
861 }
863 if (kit.stopped()) {
864 // Instance exactly does not matches the desired type.
865 kit.set_jvms(slow_jvms);
866 return kit.transfer_exceptions_into_jvms();
867 }
869 // Make the hot call:
870 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
871 if (new_jvms == NULL) {
872 // Inline failed, so make a direct call.
873 assert(_if_hit->is_inline(), "must have been a failed inline");
874 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
875 new_jvms = cg->generate(kit.sync_jvms());
876 }
877 kit.add_exception_states_from(new_jvms);
878 kit.set_jvms(new_jvms);
880 // Need to merge slow and fast?
881 if (slow_map == NULL) {
882 // The fast path is the only path remaining.
883 return kit.transfer_exceptions_into_jvms();
884 }
886 if (kit.stopped()) {
887 // Inlined method threw an exception, so it's just the slow path after all.
888 kit.set_jvms(slow_jvms);
889 return kit.transfer_exceptions_into_jvms();
890 }
892 // Finish the diamond.
893 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
894 RegionNode* region = new (C, 3) RegionNode(3);
895 region->init_req(1, kit.control());
896 region->init_req(2, slow_map->control());
897 kit.set_control(gvn.transform(region));
898 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
899 iophi->set_req(2, slow_map->i_o());
900 kit.set_i_o(gvn.transform(iophi));
901 kit.merge_memory(slow_map->merged_memory(), region, 2);
902 uint tos = kit.jvms()->stkoff() + kit.sp();
903 uint limit = slow_map->req();
904 for (uint i = TypeFunc::Parms; i < limit; i++) {
905 // Skip unused stack slots; fast forward to monoff();
906 if (i == tos) {
907 i = kit.jvms()->monoff();
908 if( i >= limit ) break;
909 }
910 Node* m = kit.map()->in(i);
911 Node* n = slow_map->in(i);
912 if (m != n) {
913 const Type* t = gvn.type(m)->meet(gvn.type(n));
914 Node* phi = PhiNode::make(region, m, t);
915 phi->set_req(2, n);
916 kit.map()->set_req(i, gvn.transform(phi));
917 }
918 }
919 return kit.transfer_exceptions_into_jvms();
920 }
923 //-------------------------UncommonTrapCallGenerator-----------------------------
924 // Internal class which handles all out-of-line calls checking receiver type.
925 class UncommonTrapCallGenerator : public CallGenerator {
926 Deoptimization::DeoptReason _reason;
927 Deoptimization::DeoptAction _action;
929 public:
930 UncommonTrapCallGenerator(ciMethod* m,
931 Deoptimization::DeoptReason reason,
932 Deoptimization::DeoptAction action)
933 : CallGenerator(m)
934 {
935 _reason = reason;
936 _action = action;
937 }
939 virtual bool is_virtual() const { ShouldNotReachHere(); return false; }
940 virtual bool is_trap() const { return true; }
942 virtual JVMState* generate(JVMState* jvms);
943 };
946 CallGenerator*
947 CallGenerator::for_uncommon_trap(ciMethod* m,
948 Deoptimization::DeoptReason reason,
949 Deoptimization::DeoptAction action) {
950 return new UncommonTrapCallGenerator(m, reason, action);
951 }
954 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) {
955 GraphKit kit(jvms);
956 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver).
957 int nargs = method()->arg_size();
958 kit.inc_sp(nargs);
959 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed");
960 if (_reason == Deoptimization::Reason_class_check &&
961 _action == Deoptimization::Action_maybe_recompile) {
962 // Temp fix for 6529811
963 // Don't allow uncommon_trap to override our decision to recompile in the event
964 // of a class cast failure for a monomorphic call as it will never let us convert
965 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops
966 bool keep_exact_action = true;
967 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action);
968 } else {
969 kit.uncommon_trap(_reason, _action);
970 }
971 return kit.transfer_exceptions_into_jvms();
972 }
974 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.)
976 // (Node: Merged hook_up_exits into ParseGenerator::generate.)
978 #define NODES_OVERHEAD_PER_METHOD (30.0)
979 #define NODES_PER_BYTECODE (9.5)
981 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) {
982 int call_count = profile.count();
983 int code_size = call_method->code_size();
985 // Expected execution count is based on the historical count:
986 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor);
988 // Expected profit from inlining, in units of simple call-overheads.
989 _profit = 1.0;
991 // Expected work performed by the call in units of call-overheads.
992 // %%% need an empirical curve fit for "work" (time in call)
993 float bytecodes_per_call = 3;
994 _work = 1.0 + code_size / bytecodes_per_call;
996 // Expected size of compilation graph:
997 // -XX:+PrintParseStatistics once reported:
998 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391
999 // Histogram of 144298 parsed bytecodes:
1000 // %%% Need an better predictor for graph size.
1001 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size);
1002 }
1004 // is_cold: Return true if the node should never be inlined.
1005 // This is true if any of the key metrics are extreme.
1006 bool WarmCallInfo::is_cold() const {
1007 if (count() < WarmCallMinCount) return true;
1008 if (profit() < WarmCallMinProfit) return true;
1009 if (work() > WarmCallMaxWork) return true;
1010 if (size() > WarmCallMaxSize) return true;
1011 return false;
1012 }
1014 // is_hot: Return true if the node should be inlined immediately.
1015 // This is true if any of the key metrics are extreme.
1016 bool WarmCallInfo::is_hot() const {
1017 assert(!is_cold(), "eliminate is_cold cases before testing is_hot");
1018 if (count() >= HotCallCountThreshold) return true;
1019 if (profit() >= HotCallProfitThreshold) return true;
1020 if (work() <= HotCallTrivialWork) return true;
1021 if (size() <= HotCallTrivialSize) return true;
1022 return false;
1023 }
1025 // compute_heat:
1026 float WarmCallInfo::compute_heat() const {
1027 assert(!is_cold(), "compute heat only on warm nodes");
1028 assert(!is_hot(), "compute heat only on warm nodes");
1029 int min_size = MAX2(0, (int)HotCallTrivialSize);
1030 int max_size = MIN2(500, (int)WarmCallMaxSize);
1031 float method_size = (size() - min_size) / MAX2(1, max_size - min_size);
1032 float size_factor;
1033 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg.
1034 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg.
1035 else if (method_size < 0.5) size_factor = 1; // better than avg.
1036 else size_factor = 0.5; // worse than avg.
1037 return (count() * profit() * size_factor);
1038 }
1040 bool WarmCallInfo::warmer_than(WarmCallInfo* that) {
1041 assert(this != that, "compare only different WCIs");
1042 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st");
1043 if (this->heat() > that->heat()) return true;
1044 if (this->heat() < that->heat()) return false;
1045 assert(this->heat() == that->heat(), "no NaN heat allowed");
1046 // Equal heat. Break the tie some other way.
1047 if (!this->call() || !that->call()) return (address)this > (address)that;
1048 return this->call()->_idx > that->call()->_idx;
1049 }
1051 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress)
1052 #define UNINIT_NEXT ((WarmCallInfo*)NULL)
1054 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) {
1055 assert(next() == UNINIT_NEXT, "not yet on any list");
1056 WarmCallInfo* prev_p = NULL;
1057 WarmCallInfo* next_p = head;
1058 while (next_p != NULL && next_p->warmer_than(this)) {
1059 prev_p = next_p;
1060 next_p = prev_p->next();
1061 }
1062 // Install this between prev_p and next_p.
1063 this->set_next(next_p);
1064 if (prev_p == NULL)
1065 head = this;
1066 else
1067 prev_p->set_next(this);
1068 return head;
1069 }
1071 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) {
1072 WarmCallInfo* prev_p = NULL;
1073 WarmCallInfo* next_p = head;
1074 while (next_p != this) {
1075 assert(next_p != NULL, "this must be in the list somewhere");
1076 prev_p = next_p;
1077 next_p = prev_p->next();
1078 }
1079 next_p = this->next();
1080 debug_only(this->set_next(UNINIT_NEXT));
1081 // Remove this from between prev_p and next_p.
1082 if (prev_p == NULL)
1083 head = next_p;
1084 else
1085 prev_p->set_next(next_p);
1086 return head;
1087 }
1089 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(),
1090 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE());
1091 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(),
1092 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE());
1094 WarmCallInfo* WarmCallInfo::always_hot() {
1095 assert(_always_hot.is_hot(), "must always be hot");
1096 return &_always_hot;
1097 }
1099 WarmCallInfo* WarmCallInfo::always_cold() {
1100 assert(_always_cold.is_cold(), "must always be cold");
1101 return &_always_cold;
1102 }
1105 #ifndef PRODUCT
1107 void WarmCallInfo::print() const {
1108 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p",
1109 is_cold() ? "cold" : is_hot() ? "hot " : "warm",
1110 count(), profit(), work(), size(), compute_heat(), next());
1111 tty->cr();
1112 if (call() != NULL) call()->dump();
1113 }
1115 void print_wci(WarmCallInfo* ci) {
1116 ci->print();
1117 }
1119 void WarmCallInfo::print_all() const {
1120 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1121 p->print();
1122 }
1124 int WarmCallInfo::count_all() const {
1125 int cnt = 0;
1126 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1127 cnt++;
1128 return cnt;
1129 }
1131 #endif //PRODUCT