Fri, 02 Sep 2011 00:36:18 -0700
7085404: JSR 292: VolatileCallSites should have push notification too
Reviewed-by: never, 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 if (!is_static) {
141 // Make an explicit receiver null_check as part of this call.
142 // Since we share a map with the caller, his JVMS gets adjusted.
143 kit.null_check_receiver(method());
144 if (kit.stopped()) {
145 // And dump it back to the caller, decorated with any exceptions:
146 return kit.transfer_exceptions_into_jvms();
147 }
148 // Mark the call node as virtual, sort of:
149 call->set_optimized_virtual(true);
150 if (method()->is_method_handle_invoke()) {
151 call->set_method_handle_invoke(true);
152 kit.C->set_has_method_handle_invokes(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 _call_node = call; // Save the call node in case we need it later
160 return kit.transfer_exceptions_into_jvms();
161 }
163 //---------------------------DynamicCallGenerator-----------------------------
164 // Internal class which handles all out-of-line invokedynamic calls.
165 class DynamicCallGenerator : public CallGenerator {
166 public:
167 DynamicCallGenerator(ciMethod* method)
168 : CallGenerator(method)
169 {
170 }
171 virtual JVMState* generate(JVMState* jvms);
172 };
174 JVMState* DynamicCallGenerator::generate(JVMState* jvms) {
175 GraphKit kit(jvms);
177 if (kit.C->log() != NULL) {
178 kit.C->log()->elem("dynamic_call bci='%d'", jvms->bci());
179 }
181 // Get the constant pool cache from the caller class.
182 ciMethod* caller_method = jvms->method();
183 ciBytecodeStream str(caller_method);
184 str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci.
185 assert(str.cur_bc() == Bytecodes::_invokedynamic, "wrong place to issue a dynamic call!");
186 ciCPCache* cpcache = str.get_cpcache();
188 // Get the offset of the CallSite from the constant pool cache
189 // pointer.
190 int index = str.get_method_index();
191 size_t call_site_offset = cpcache->get_f1_offset(index);
193 // Load the CallSite object from the constant pool cache.
194 const TypeOopPtr* cpcache_ptr = TypeOopPtr::make_from_constant(cpcache);
195 Node* cpcache_adr = kit.makecon(cpcache_ptr);
196 Node* call_site_adr = kit.basic_plus_adr(cpcache_adr, cpcache_adr, call_site_offset);
197 Node* call_site = kit.make_load(kit.control(), call_site_adr, TypeInstPtr::BOTTOM, T_OBJECT, Compile::AliasIdxRaw);
199 // Load the target MethodHandle from the CallSite object.
200 Node* target_mh_adr = kit.basic_plus_adr(call_site, call_site, java_lang_invoke_CallSite::target_offset_in_bytes());
201 Node* target_mh = kit.make_load(kit.control(), target_mh_adr, TypeInstPtr::BOTTOM, T_OBJECT);
203 address resolve_stub = SharedRuntime::get_resolve_opt_virtual_call_stub();
205 CallStaticJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallStaticJavaNode(tf(), resolve_stub, method(), kit.bci());
206 // invokedynamic is treated as an optimized invokevirtual.
207 call->set_optimized_virtual(true);
208 // Take extra care (in the presence of argument motion) not to trash the SP:
209 call->set_method_handle_invoke(true);
210 kit.C->set_has_method_handle_invokes(true);
212 // Pass the target MethodHandle as first argument and shift the
213 // other arguments.
214 call->init_req(0 + TypeFunc::Parms, target_mh);
215 uint nargs = call->method()->arg_size();
216 for (uint i = 1; i < nargs; i++) {
217 Node* arg = kit.argument(i - 1);
218 call->init_req(i + TypeFunc::Parms, arg);
219 }
221 kit.set_edges_for_java_call(call);
222 Node* ret = kit.set_results_for_java_call(call);
223 kit.push_node(method()->return_type()->basic_type(), ret);
224 return kit.transfer_exceptions_into_jvms();
225 }
227 //--------------------------VirtualCallGenerator------------------------------
228 // Internal class which handles all out-of-line calls checking receiver type.
229 class VirtualCallGenerator : public CallGenerator {
230 private:
231 int _vtable_index;
232 public:
233 VirtualCallGenerator(ciMethod* method, int vtable_index)
234 : CallGenerator(method), _vtable_index(vtable_index)
235 {
236 assert(vtable_index == methodOopDesc::invalid_vtable_index ||
237 vtable_index >= 0, "either invalid or usable");
238 }
239 virtual bool is_virtual() const { return true; }
240 virtual JVMState* generate(JVMState* jvms);
241 };
243 JVMState* VirtualCallGenerator::generate(JVMState* jvms) {
244 GraphKit kit(jvms);
245 Node* receiver = kit.argument(0);
247 if (kit.C->log() != NULL) {
248 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci());
249 }
251 // If the receiver is a constant null, do not torture the system
252 // by attempting to call through it. The compile will proceed
253 // correctly, but may bail out in final_graph_reshaping, because
254 // the call instruction will have a seemingly deficient out-count.
255 // (The bailout says something misleading about an "infinite loop".)
256 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) {
257 kit.inc_sp(method()->arg_size()); // restore arguments
258 kit.uncommon_trap(Deoptimization::Reason_null_check,
259 Deoptimization::Action_none,
260 NULL, "null receiver");
261 return kit.transfer_exceptions_into_jvms();
262 }
264 // Ideally we would unconditionally do a null check here and let it
265 // be converted to an implicit check based on profile information.
266 // However currently the conversion to implicit null checks in
267 // Block::implicit_null_check() only looks for loads and stores, not calls.
268 ciMethod *caller = kit.method();
269 ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data();
270 if (!UseInlineCaches || !ImplicitNullChecks ||
271 ((ImplicitNullCheckThreshold > 0) && caller_md &&
272 (caller_md->trap_count(Deoptimization::Reason_null_check)
273 >= (uint)ImplicitNullCheckThreshold))) {
274 // Make an explicit receiver null_check as part of this call.
275 // Since we share a map with the caller, his JVMS gets adjusted.
276 receiver = kit.null_check_receiver(method());
277 if (kit.stopped()) {
278 // And dump it back to the caller, decorated with any exceptions:
279 return kit.transfer_exceptions_into_jvms();
280 }
281 }
283 assert(!method()->is_static(), "virtual call must not be to static");
284 assert(!method()->is_final(), "virtual call should not be to final");
285 assert(!method()->is_private(), "virtual call should not be to private");
286 assert(_vtable_index == methodOopDesc::invalid_vtable_index || !UseInlineCaches,
287 "no vtable calls if +UseInlineCaches ");
288 address target = SharedRuntime::get_resolve_virtual_call_stub();
289 // Normal inline cache used for call
290 CallDynamicJavaNode *call = new (kit.C, tf()->domain()->cnt()) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci());
291 kit.set_arguments_for_java_call(call);
292 kit.set_edges_for_java_call(call);
293 Node* ret = kit.set_results_for_java_call(call);
294 kit.push_node(method()->return_type()->basic_type(), ret);
296 // Represent the effect of an implicit receiver null_check
297 // as part of this call. Since we share a map with the caller,
298 // his JVMS gets adjusted.
299 kit.cast_not_null(receiver);
300 return kit.transfer_exceptions_into_jvms();
301 }
303 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) {
304 if (InlineTree::check_can_parse(m) != NULL) return NULL;
305 return new ParseGenerator(m, expected_uses);
306 }
308 // As a special case, the JVMS passed to this CallGenerator is
309 // for the method execution already in progress, not just the JVMS
310 // of the caller. Thus, this CallGenerator cannot be mixed with others!
311 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) {
312 if (InlineTree::check_can_parse(m) != NULL) return NULL;
313 float past_uses = m->interpreter_invocation_count();
314 float expected_uses = past_uses;
315 return new ParseGenerator(m, expected_uses, true);
316 }
318 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) {
319 assert(!m->is_abstract(), "for_direct_call mismatch");
320 return new DirectCallGenerator(m, separate_io_proj);
321 }
323 CallGenerator* CallGenerator::for_dynamic_call(ciMethod* m) {
324 assert(m->is_method_handle_invoke() || m->is_method_handle_adapter(), "for_dynamic_call mismatch");
325 return new DynamicCallGenerator(m);
326 }
328 CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) {
329 assert(!m->is_static(), "for_virtual_call mismatch");
330 assert(!m->is_method_handle_invoke(), "should be a direct call");
331 return new VirtualCallGenerator(m, vtable_index);
332 }
334 // Allow inlining decisions to be delayed
335 class LateInlineCallGenerator : public DirectCallGenerator {
336 CallGenerator* _inline_cg;
338 public:
339 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
340 DirectCallGenerator(method, true), _inline_cg(inline_cg) {}
342 virtual bool is_late_inline() const { return true; }
344 // Convert the CallStaticJava into an inline
345 virtual void do_late_inline();
347 JVMState* generate(JVMState* jvms) {
348 // Record that this call site should be revisited once the main
349 // parse is finished.
350 Compile::current()->add_late_inline(this);
352 // Emit the CallStaticJava and request separate projections so
353 // that the late inlining logic can distinguish between fall
354 // through and exceptional uses of the memory and io projections
355 // as is done for allocations and macro expansion.
356 return DirectCallGenerator::generate(jvms);
357 }
359 };
362 void LateInlineCallGenerator::do_late_inline() {
363 // Can't inline it
364 if (call_node() == NULL || call_node()->outcnt() == 0 ||
365 call_node()->in(0) == NULL || call_node()->in(0)->is_top())
366 return;
368 CallStaticJavaNode* call = call_node();
370 // Make a clone of the JVMState that appropriate to use for driving a parse
371 Compile* C = Compile::current();
372 JVMState* jvms = call->jvms()->clone_shallow(C);
373 uint size = call->req();
374 SafePointNode* map = new (C, size) SafePointNode(size, jvms);
375 for (uint i1 = 0; i1 < size; i1++) {
376 map->init_req(i1, call->in(i1));
377 }
379 // Make sure the state is a MergeMem for parsing.
380 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
381 map->set_req(TypeFunc::Memory, MergeMemNode::make(C, map->in(TypeFunc::Memory)));
382 }
384 // Make enough space for the expression stack and transfer the incoming arguments
385 int nargs = method()->arg_size();
386 jvms->set_map(map);
387 map->ensure_stack(jvms, jvms->method()->max_stack());
388 if (nargs > 0) {
389 for (int i1 = 0; i1 < nargs; i1++) {
390 map->set_req(i1 + jvms->argoff(), call->in(TypeFunc::Parms + i1));
391 }
392 }
394 CompileLog* log = C->log();
395 if (log != NULL) {
396 log->head("late_inline method='%d'", log->identify(method()));
397 JVMState* p = jvms;
398 while (p != NULL) {
399 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
400 p = p->caller();
401 }
402 log->tail("late_inline");
403 }
405 // Setup default node notes to be picked up by the inlining
406 Node_Notes* old_nn = C->default_node_notes();
407 if (old_nn != NULL) {
408 Node_Notes* entry_nn = old_nn->clone(C);
409 entry_nn->set_jvms(jvms);
410 C->set_default_node_notes(entry_nn);
411 }
413 // Now perform the inling using the synthesized JVMState
414 JVMState* new_jvms = _inline_cg->generate(jvms);
415 if (new_jvms == NULL) return; // no change
416 if (C->failing()) return;
418 // Capture any exceptional control flow
419 GraphKit kit(new_jvms);
421 // Find the result object
422 Node* result = C->top();
423 int result_size = method()->return_type()->size();
424 if (result_size != 0 && !kit.stopped()) {
425 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
426 }
428 kit.replace_call(call, result);
429 }
432 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
433 return new LateInlineCallGenerator(method, inline_cg);
434 }
437 //---------------------------WarmCallGenerator--------------------------------
438 // Internal class which handles initial deferral of inlining decisions.
439 class WarmCallGenerator : public CallGenerator {
440 WarmCallInfo* _call_info;
441 CallGenerator* _if_cold;
442 CallGenerator* _if_hot;
443 bool _is_virtual; // caches virtuality of if_cold
444 bool _is_inline; // caches inline-ness of if_hot
446 public:
447 WarmCallGenerator(WarmCallInfo* ci,
448 CallGenerator* if_cold,
449 CallGenerator* if_hot)
450 : CallGenerator(if_cold->method())
451 {
452 assert(method() == if_hot->method(), "consistent choices");
453 _call_info = ci;
454 _if_cold = if_cold;
455 _if_hot = if_hot;
456 _is_virtual = if_cold->is_virtual();
457 _is_inline = if_hot->is_inline();
458 }
460 virtual bool is_inline() const { return _is_inline; }
461 virtual bool is_virtual() const { return _is_virtual; }
462 virtual bool is_deferred() const { return true; }
464 virtual JVMState* generate(JVMState* jvms);
465 };
468 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci,
469 CallGenerator* if_cold,
470 CallGenerator* if_hot) {
471 return new WarmCallGenerator(ci, if_cold, if_hot);
472 }
474 JVMState* WarmCallGenerator::generate(JVMState* jvms) {
475 Compile* C = Compile::current();
476 if (C->log() != NULL) {
477 C->log()->elem("warm_call bci='%d'", jvms->bci());
478 }
479 jvms = _if_cold->generate(jvms);
480 if (jvms != NULL) {
481 Node* m = jvms->map()->control();
482 if (m->is_CatchProj()) m = m->in(0); else m = C->top();
483 if (m->is_Catch()) m = m->in(0); else m = C->top();
484 if (m->is_Proj()) m = m->in(0); else m = C->top();
485 if (m->is_CallJava()) {
486 _call_info->set_call(m->as_Call());
487 _call_info->set_hot_cg(_if_hot);
488 #ifndef PRODUCT
489 if (PrintOpto || PrintOptoInlining) {
490 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci());
491 tty->print("WCI: ");
492 _call_info->print();
493 }
494 #endif
495 _call_info->set_heat(_call_info->compute_heat());
496 C->set_warm_calls(_call_info->insert_into(C->warm_calls()));
497 }
498 }
499 return jvms;
500 }
502 void WarmCallInfo::make_hot() {
503 Unimplemented();
504 }
506 void WarmCallInfo::make_cold() {
507 // No action: Just dequeue.
508 }
511 //------------------------PredictedCallGenerator------------------------------
512 // Internal class which handles all out-of-line calls checking receiver type.
513 class PredictedCallGenerator : public CallGenerator {
514 ciKlass* _predicted_receiver;
515 CallGenerator* _if_missed;
516 CallGenerator* _if_hit;
517 float _hit_prob;
519 public:
520 PredictedCallGenerator(ciKlass* predicted_receiver,
521 CallGenerator* if_missed,
522 CallGenerator* if_hit, float hit_prob)
523 : CallGenerator(if_missed->method())
524 {
525 // The call profile data may predict the hit_prob as extreme as 0 or 1.
526 // Remove the extremes values from the range.
527 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX;
528 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
530 _predicted_receiver = predicted_receiver;
531 _if_missed = if_missed;
532 _if_hit = if_hit;
533 _hit_prob = hit_prob;
534 }
536 virtual bool is_virtual() const { return true; }
537 virtual bool is_inline() const { return _if_hit->is_inline(); }
538 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
540 virtual JVMState* generate(JVMState* jvms);
541 };
544 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver,
545 CallGenerator* if_missed,
546 CallGenerator* if_hit,
547 float hit_prob) {
548 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob);
549 }
552 JVMState* PredictedCallGenerator::generate(JVMState* jvms) {
553 GraphKit kit(jvms);
554 PhaseGVN& gvn = kit.gvn();
555 // We need an explicit receiver null_check before checking its type.
556 // We share a map with the caller, so his JVMS gets adjusted.
557 Node* receiver = kit.argument(0);
559 CompileLog* log = kit.C->log();
560 if (log != NULL) {
561 log->elem("predicted_call bci='%d' klass='%d'",
562 jvms->bci(), log->identify(_predicted_receiver));
563 }
565 receiver = kit.null_check_receiver(method());
566 if (kit.stopped()) {
567 return kit.transfer_exceptions_into_jvms();
568 }
570 Node* exact_receiver = receiver; // will get updated in place...
571 Node* slow_ctl = kit.type_check_receiver(receiver,
572 _predicted_receiver, _hit_prob,
573 &exact_receiver);
575 SafePointNode* slow_map = NULL;
576 JVMState* slow_jvms;
577 { PreserveJVMState pjvms(&kit);
578 kit.set_control(slow_ctl);
579 if (!kit.stopped()) {
580 slow_jvms = _if_missed->generate(kit.sync_jvms());
581 assert(slow_jvms != NULL, "miss path must not fail to generate");
582 kit.add_exception_states_from(slow_jvms);
583 kit.set_map(slow_jvms->map());
584 if (!kit.stopped())
585 slow_map = kit.stop();
586 }
587 }
589 if (kit.stopped()) {
590 // Instance exactly does not matches the desired type.
591 kit.set_jvms(slow_jvms);
592 return kit.transfer_exceptions_into_jvms();
593 }
595 // fall through if the instance exactly matches the desired type
596 kit.replace_in_map(receiver, exact_receiver);
598 // Make the hot call:
599 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
600 if (new_jvms == NULL) {
601 // Inline failed, so make a direct call.
602 assert(_if_hit->is_inline(), "must have been a failed inline");
603 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
604 new_jvms = cg->generate(kit.sync_jvms());
605 }
606 kit.add_exception_states_from(new_jvms);
607 kit.set_jvms(new_jvms);
609 // Need to merge slow and fast?
610 if (slow_map == NULL) {
611 // The fast path is the only path remaining.
612 return kit.transfer_exceptions_into_jvms();
613 }
615 if (kit.stopped()) {
616 // Inlined method threw an exception, so it's just the slow path after all.
617 kit.set_jvms(slow_jvms);
618 return kit.transfer_exceptions_into_jvms();
619 }
621 // Finish the diamond.
622 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
623 RegionNode* region = new (kit.C, 3) RegionNode(3);
624 region->init_req(1, kit.control());
625 region->init_req(2, slow_map->control());
626 kit.set_control(gvn.transform(region));
627 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
628 iophi->set_req(2, slow_map->i_o());
629 kit.set_i_o(gvn.transform(iophi));
630 kit.merge_memory(slow_map->merged_memory(), region, 2);
631 uint tos = kit.jvms()->stkoff() + kit.sp();
632 uint limit = slow_map->req();
633 for (uint i = TypeFunc::Parms; i < limit; i++) {
634 // Skip unused stack slots; fast forward to monoff();
635 if (i == tos) {
636 i = kit.jvms()->monoff();
637 if( i >= limit ) break;
638 }
639 Node* m = kit.map()->in(i);
640 Node* n = slow_map->in(i);
641 if (m != n) {
642 const Type* t = gvn.type(m)->meet(gvn.type(n));
643 Node* phi = PhiNode::make(region, m, t);
644 phi->set_req(2, n);
645 kit.map()->set_req(i, gvn.transform(phi));
646 }
647 }
648 return kit.transfer_exceptions_into_jvms();
649 }
652 //------------------------PredictedDynamicCallGenerator-----------------------
653 // Internal class which handles all out-of-line calls checking receiver type.
654 class PredictedDynamicCallGenerator : public CallGenerator {
655 ciMethodHandle* _predicted_method_handle;
656 CallGenerator* _if_missed;
657 CallGenerator* _if_hit;
658 float _hit_prob;
660 public:
661 PredictedDynamicCallGenerator(ciMethodHandle* predicted_method_handle,
662 CallGenerator* if_missed,
663 CallGenerator* if_hit,
664 float hit_prob)
665 : CallGenerator(if_missed->method()),
666 _predicted_method_handle(predicted_method_handle),
667 _if_missed(if_missed),
668 _if_hit(if_hit),
669 _hit_prob(hit_prob)
670 {}
672 virtual bool is_inline() const { return _if_hit->is_inline(); }
673 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
675 virtual JVMState* generate(JVMState* jvms);
676 };
679 CallGenerator* CallGenerator::for_predicted_dynamic_call(ciMethodHandle* predicted_method_handle,
680 CallGenerator* if_missed,
681 CallGenerator* if_hit,
682 float hit_prob) {
683 return new PredictedDynamicCallGenerator(predicted_method_handle, if_missed, if_hit, hit_prob);
684 }
687 CallGenerator* CallGenerator::for_method_handle_inline(Node* method_handle, JVMState* jvms,
688 ciMethod* caller, ciMethod* callee, ciCallProfile profile) {
689 if (method_handle->Opcode() == Op_ConP) {
690 const TypeOopPtr* oop_ptr = method_handle->bottom_type()->is_oopptr();
691 ciObject* const_oop = oop_ptr->const_oop();
692 ciMethodHandle* method_handle = const_oop->as_method_handle();
694 // Set the callee to have access to the class and signature in
695 // the MethodHandleCompiler.
696 method_handle->set_callee(callee);
697 method_handle->set_caller(caller);
698 method_handle->set_call_profile(profile);
700 // Get an adapter for the MethodHandle.
701 ciMethod* target_method = method_handle->get_method_handle_adapter();
702 if (target_method != NULL) {
703 CallGenerator* cg = Compile::current()->call_generator(target_method, -1, false, jvms, true, PROB_ALWAYS);
704 if (cg != NULL && cg->is_inline())
705 return cg;
706 }
707 } else if (method_handle->Opcode() == Op_Phi && method_handle->req() == 3 &&
708 method_handle->in(1)->Opcode() == Op_ConP && method_handle->in(2)->Opcode() == Op_ConP) {
709 // selectAlternative idiom merging two constant MethodHandles.
710 // Generate a guard so that each can be inlined. We might want to
711 // do more inputs at later point but this gets the most common
712 // case.
713 const TypeOopPtr* oop_ptr = method_handle->in(1)->bottom_type()->is_oopptr();
714 ciObject* const_oop = oop_ptr->const_oop();
715 ciMethodHandle* mh = const_oop->as_method_handle();
717 CallGenerator* cg1 = for_method_handle_inline(method_handle->in(1), jvms, caller, callee, profile);
718 CallGenerator* cg2 = for_method_handle_inline(method_handle->in(2), jvms, caller, callee, profile);
719 if (cg1 != NULL && cg2 != NULL) {
720 return new PredictedDynamicCallGenerator(mh, cg2, cg1, PROB_FAIR);
721 }
722 }
723 return NULL;
724 }
727 CallGenerator* CallGenerator::for_invokedynamic_inline(ciCallSite* call_site, JVMState* jvms,
728 ciMethod* caller, ciMethod* callee, ciCallProfile profile) {
729 ciMethodHandle* method_handle = call_site->get_target();
731 // Set the callee to have access to the class and signature in the
732 // MethodHandleCompiler.
733 method_handle->set_callee(callee);
734 method_handle->set_caller(caller);
735 method_handle->set_call_profile(profile);
737 // Get an adapter for the MethodHandle.
738 ciMethod* target_method = method_handle->get_invokedynamic_adapter();
739 if (target_method != NULL) {
740 Compile *C = Compile::current();
741 CallGenerator* cg = C->call_generator(target_method, -1, false, jvms, true, PROB_ALWAYS);
742 if (cg != NULL && cg->is_inline()) {
743 // Add a dependence for invalidation of the optimization.
744 if (!call_site->is_constant_call_site()) {
745 C->dependencies()->assert_call_site_target_value(call_site, method_handle);
746 }
747 return cg;
748 }
749 }
750 return NULL;
751 }
754 JVMState* PredictedDynamicCallGenerator::generate(JVMState* jvms) {
755 GraphKit kit(jvms);
756 PhaseGVN& gvn = kit.gvn();
758 CompileLog* log = kit.C->log();
759 if (log != NULL) {
760 log->elem("predicted_dynamic_call bci='%d'", jvms->bci());
761 }
763 const TypeOopPtr* predicted_mh_ptr = TypeOopPtr::make_from_constant(_predicted_method_handle, true);
764 Node* predicted_mh = kit.makecon(predicted_mh_ptr);
766 Node* bol = NULL;
767 int bc = jvms->method()->java_code_at_bci(jvms->bci());
768 if (bc == Bytecodes::_invokespecial) {
769 // This is the selectAlternative idiom for guardWithTest
770 Node* receiver = kit.argument(0);
772 // Check if the MethodHandle is the expected one
773 Node* cmp = gvn.transform(new(kit.C, 3) CmpPNode(receiver, predicted_mh));
774 bol = gvn.transform(new(kit.C, 2) BoolNode(cmp, BoolTest::eq) );
775 } else {
776 assert(bc == Bytecodes::_invokedynamic, "must be");
777 // Get the constant pool cache from the caller class.
778 ciMethod* caller_method = jvms->method();
779 ciBytecodeStream str(caller_method);
780 str.force_bci(jvms->bci()); // Set the stream to the invokedynamic bci.
781 ciCPCache* cpcache = str.get_cpcache();
783 // Get the offset of the CallSite from the constant pool cache
784 // pointer.
785 int index = str.get_method_index();
786 size_t call_site_offset = cpcache->get_f1_offset(index);
788 // Load the CallSite object from the constant pool cache.
789 const TypeOopPtr* cpcache_ptr = TypeOopPtr::make_from_constant(cpcache);
790 Node* cpcache_adr = kit.makecon(cpcache_ptr);
791 Node* call_site_adr = kit.basic_plus_adr(cpcache_adr, cpcache_adr, call_site_offset);
792 Node* call_site = kit.make_load(kit.control(), call_site_adr, TypeInstPtr::BOTTOM, T_OBJECT, Compile::AliasIdxRaw);
794 // Load the target MethodHandle from the CallSite object.
795 Node* target_adr = kit.basic_plus_adr(call_site, call_site, java_lang_invoke_CallSite::target_offset_in_bytes());
796 Node* target_mh = kit.make_load(kit.control(), target_adr, TypeInstPtr::BOTTOM, T_OBJECT);
798 // Check if the MethodHandle is still the same.
799 Node* cmp = gvn.transform(new(kit.C, 3) CmpPNode(target_mh, predicted_mh));
800 bol = gvn.transform(new(kit.C, 2) BoolNode(cmp, BoolTest::eq) );
801 }
802 IfNode* iff = kit.create_and_xform_if(kit.control(), bol, _hit_prob, COUNT_UNKNOWN);
803 kit.set_control( gvn.transform(new(kit.C, 1) IfTrueNode (iff)));
804 Node* slow_ctl = gvn.transform(new(kit.C, 1) IfFalseNode(iff));
806 SafePointNode* slow_map = NULL;
807 JVMState* slow_jvms;
808 { PreserveJVMState pjvms(&kit);
809 kit.set_control(slow_ctl);
810 if (!kit.stopped()) {
811 slow_jvms = _if_missed->generate(kit.sync_jvms());
812 assert(slow_jvms != NULL, "miss path must not fail to generate");
813 kit.add_exception_states_from(slow_jvms);
814 kit.set_map(slow_jvms->map());
815 if (!kit.stopped())
816 slow_map = kit.stop();
817 }
818 }
820 if (kit.stopped()) {
821 // Instance exactly does not matches the desired type.
822 kit.set_jvms(slow_jvms);
823 return kit.transfer_exceptions_into_jvms();
824 }
826 // Make the hot call:
827 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
828 if (new_jvms == NULL) {
829 // Inline failed, so make a direct call.
830 assert(_if_hit->is_inline(), "must have been a failed inline");
831 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
832 new_jvms = cg->generate(kit.sync_jvms());
833 }
834 kit.add_exception_states_from(new_jvms);
835 kit.set_jvms(new_jvms);
837 // Need to merge slow and fast?
838 if (slow_map == NULL) {
839 // The fast path is the only path remaining.
840 return kit.transfer_exceptions_into_jvms();
841 }
843 if (kit.stopped()) {
844 // Inlined method threw an exception, so it's just the slow path after all.
845 kit.set_jvms(slow_jvms);
846 return kit.transfer_exceptions_into_jvms();
847 }
849 // Finish the diamond.
850 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
851 RegionNode* region = new (kit.C, 3) RegionNode(3);
852 region->init_req(1, kit.control());
853 region->init_req(2, slow_map->control());
854 kit.set_control(gvn.transform(region));
855 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
856 iophi->set_req(2, slow_map->i_o());
857 kit.set_i_o(gvn.transform(iophi));
858 kit.merge_memory(slow_map->merged_memory(), region, 2);
859 uint tos = kit.jvms()->stkoff() + kit.sp();
860 uint limit = slow_map->req();
861 for (uint i = TypeFunc::Parms; i < limit; i++) {
862 // Skip unused stack slots; fast forward to monoff();
863 if (i == tos) {
864 i = kit.jvms()->monoff();
865 if( i >= limit ) break;
866 }
867 Node* m = kit.map()->in(i);
868 Node* n = slow_map->in(i);
869 if (m != n) {
870 const Type* t = gvn.type(m)->meet(gvn.type(n));
871 Node* phi = PhiNode::make(region, m, t);
872 phi->set_req(2, n);
873 kit.map()->set_req(i, gvn.transform(phi));
874 }
875 }
876 return kit.transfer_exceptions_into_jvms();
877 }
880 //-------------------------UncommonTrapCallGenerator-----------------------------
881 // Internal class which handles all out-of-line calls checking receiver type.
882 class UncommonTrapCallGenerator : public CallGenerator {
883 Deoptimization::DeoptReason _reason;
884 Deoptimization::DeoptAction _action;
886 public:
887 UncommonTrapCallGenerator(ciMethod* m,
888 Deoptimization::DeoptReason reason,
889 Deoptimization::DeoptAction action)
890 : CallGenerator(m)
891 {
892 _reason = reason;
893 _action = action;
894 }
896 virtual bool is_virtual() const { ShouldNotReachHere(); return false; }
897 virtual bool is_trap() const { return true; }
899 virtual JVMState* generate(JVMState* jvms);
900 };
903 CallGenerator*
904 CallGenerator::for_uncommon_trap(ciMethod* m,
905 Deoptimization::DeoptReason reason,
906 Deoptimization::DeoptAction action) {
907 return new UncommonTrapCallGenerator(m, reason, action);
908 }
911 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) {
912 GraphKit kit(jvms);
913 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver).
914 int nargs = method()->arg_size();
915 kit.inc_sp(nargs);
916 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed");
917 if (_reason == Deoptimization::Reason_class_check &&
918 _action == Deoptimization::Action_maybe_recompile) {
919 // Temp fix for 6529811
920 // Don't allow uncommon_trap to override our decision to recompile in the event
921 // of a class cast failure for a monomorphic call as it will never let us convert
922 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops
923 bool keep_exact_action = true;
924 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action);
925 } else {
926 kit.uncommon_trap(_reason, _action);
927 }
928 return kit.transfer_exceptions_into_jvms();
929 }
931 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.)
933 // (Node: Merged hook_up_exits into ParseGenerator::generate.)
935 #define NODES_OVERHEAD_PER_METHOD (30.0)
936 #define NODES_PER_BYTECODE (9.5)
938 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) {
939 int call_count = profile.count();
940 int code_size = call_method->code_size();
942 // Expected execution count is based on the historical count:
943 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor);
945 // Expected profit from inlining, in units of simple call-overheads.
946 _profit = 1.0;
948 // Expected work performed by the call in units of call-overheads.
949 // %%% need an empirical curve fit for "work" (time in call)
950 float bytecodes_per_call = 3;
951 _work = 1.0 + code_size / bytecodes_per_call;
953 // Expected size of compilation graph:
954 // -XX:+PrintParseStatistics once reported:
955 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391
956 // Histogram of 144298 parsed bytecodes:
957 // %%% Need an better predictor for graph size.
958 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size);
959 }
961 // is_cold: Return true if the node should never be inlined.
962 // This is true if any of the key metrics are extreme.
963 bool WarmCallInfo::is_cold() const {
964 if (count() < WarmCallMinCount) return true;
965 if (profit() < WarmCallMinProfit) return true;
966 if (work() > WarmCallMaxWork) return true;
967 if (size() > WarmCallMaxSize) return true;
968 return false;
969 }
971 // is_hot: Return true if the node should be inlined immediately.
972 // This is true if any of the key metrics are extreme.
973 bool WarmCallInfo::is_hot() const {
974 assert(!is_cold(), "eliminate is_cold cases before testing is_hot");
975 if (count() >= HotCallCountThreshold) return true;
976 if (profit() >= HotCallProfitThreshold) return true;
977 if (work() <= HotCallTrivialWork) return true;
978 if (size() <= HotCallTrivialSize) return true;
979 return false;
980 }
982 // compute_heat:
983 float WarmCallInfo::compute_heat() const {
984 assert(!is_cold(), "compute heat only on warm nodes");
985 assert(!is_hot(), "compute heat only on warm nodes");
986 int min_size = MAX2(0, (int)HotCallTrivialSize);
987 int max_size = MIN2(500, (int)WarmCallMaxSize);
988 float method_size = (size() - min_size) / MAX2(1, max_size - min_size);
989 float size_factor;
990 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg.
991 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg.
992 else if (method_size < 0.5) size_factor = 1; // better than avg.
993 else size_factor = 0.5; // worse than avg.
994 return (count() * profit() * size_factor);
995 }
997 bool WarmCallInfo::warmer_than(WarmCallInfo* that) {
998 assert(this != that, "compare only different WCIs");
999 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st");
1000 if (this->heat() > that->heat()) return true;
1001 if (this->heat() < that->heat()) return false;
1002 assert(this->heat() == that->heat(), "no NaN heat allowed");
1003 // Equal heat. Break the tie some other way.
1004 if (!this->call() || !that->call()) return (address)this > (address)that;
1005 return this->call()->_idx > that->call()->_idx;
1006 }
1008 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress)
1009 #define UNINIT_NEXT ((WarmCallInfo*)NULL)
1011 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) {
1012 assert(next() == UNINIT_NEXT, "not yet on any list");
1013 WarmCallInfo* prev_p = NULL;
1014 WarmCallInfo* next_p = head;
1015 while (next_p != NULL && next_p->warmer_than(this)) {
1016 prev_p = next_p;
1017 next_p = prev_p->next();
1018 }
1019 // Install this between prev_p and next_p.
1020 this->set_next(next_p);
1021 if (prev_p == NULL)
1022 head = this;
1023 else
1024 prev_p->set_next(this);
1025 return head;
1026 }
1028 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) {
1029 WarmCallInfo* prev_p = NULL;
1030 WarmCallInfo* next_p = head;
1031 while (next_p != this) {
1032 assert(next_p != NULL, "this must be in the list somewhere");
1033 prev_p = next_p;
1034 next_p = prev_p->next();
1035 }
1036 next_p = this->next();
1037 debug_only(this->set_next(UNINIT_NEXT));
1038 // Remove this from between prev_p and next_p.
1039 if (prev_p == NULL)
1040 head = next_p;
1041 else
1042 prev_p->set_next(next_p);
1043 return head;
1044 }
1046 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(),
1047 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE());
1048 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(),
1049 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE());
1051 WarmCallInfo* WarmCallInfo::always_hot() {
1052 assert(_always_hot.is_hot(), "must always be hot");
1053 return &_always_hot;
1054 }
1056 WarmCallInfo* WarmCallInfo::always_cold() {
1057 assert(_always_cold.is_cold(), "must always be cold");
1058 return &_always_cold;
1059 }
1062 #ifndef PRODUCT
1064 void WarmCallInfo::print() const {
1065 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p",
1066 is_cold() ? "cold" : is_hot() ? "hot " : "warm",
1067 count(), profit(), work(), size(), compute_heat(), next());
1068 tty->cr();
1069 if (call() != NULL) call()->dump();
1070 }
1072 void print_wci(WarmCallInfo* ci) {
1073 ci->print();
1074 }
1076 void WarmCallInfo::print_all() const {
1077 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1078 p->print();
1079 }
1081 int WarmCallInfo::count_all() const {
1082 int cnt = 0;
1083 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1084 cnt++;
1085 return cnt;
1086 }
1088 #endif //PRODUCT