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/castnode.hpp"
37 #include "opto/cfgnode.hpp"
38 #include "opto/parse.hpp"
39 #include "opto/rootnode.hpp"
40 #include "opto/runtime.hpp"
41 #include "opto/subnode.hpp"
42 #include "runtime/os.inline.hpp"
43 #include "runtime/sharedRuntime.hpp"
44 #include "utilities/debug.hpp"
45
46 // Utility function.
47 const TypeFunc* CallGenerator::tf() const {
48 return TypeFunc::make(method());
49 }
50
51 bool CallGenerator::is_inlined_method_handle_intrinsic(JVMState* jvms, ciMethod* m) {
52 return is_inlined_method_handle_intrinsic(jvms->method(), jvms->bci(), m);
53 }
54
55 bool CallGenerator::is_inlined_method_handle_intrinsic(ciMethod* caller, int bci, ciMethod* m) {
56 ciMethod* symbolic_info = caller->get_method_at_bci(bci);
57 return is_inlined_method_handle_intrinsic(symbolic_info, m);
103 GraphKit& exits = parser.exits();
104
105 if (C->failing()) {
106 while (exits.pop_exception_state() != nullptr) ;
107 return nullptr;
108 }
109
110 assert(exits.jvms()->same_calls_as(jvms), "sanity");
111
112 // Simply return the exit state of the parser,
113 // augmented by any exceptional states.
114 return exits.transfer_exceptions_into_jvms();
115 }
116
117 //---------------------------DirectCallGenerator------------------------------
118 // Internal class which handles all out-of-line calls w/o receiver type checks.
119 class DirectCallGenerator : public CallGenerator {
120 private:
121 CallStaticJavaNode* _call_node;
122 // Force separate memory and I/O projections for the exceptional
123 // paths to facilitate late inlinig.
124 bool _separate_io_proj;
125
126 protected:
127 void set_call_node(CallStaticJavaNode* call) { _call_node = call; }
128
129 public:
130 DirectCallGenerator(ciMethod* method, bool separate_io_proj)
131 : CallGenerator(method),
132 _separate_io_proj(separate_io_proj)
133 {
134 }
135 virtual JVMState* generate(JVMState* jvms);
136
137 virtual CallNode* call_node() const { return _call_node; }
138 virtual CallGenerator* with_call_node(CallNode* call) {
139 DirectCallGenerator* dcg = new DirectCallGenerator(method(), _separate_io_proj);
140 dcg->set_call_node(call->as_CallStaticJava());
141 return dcg;
142 }
143 };
144
145 JVMState* DirectCallGenerator::generate(JVMState* jvms) {
146 GraphKit kit(jvms);
147 kit.C->print_inlining_update(this);
148 bool is_static = method()->is_static();
149 address target = is_static ? SharedRuntime::get_resolve_static_call_stub()
150 : SharedRuntime::get_resolve_opt_virtual_call_stub();
151
152 if (kit.C->log() != nullptr) {
153 kit.C->log()->elem("direct_call bci='%d'", jvms->bci());
154 }
155
156 CallStaticJavaNode* call = new CallStaticJavaNode(kit.C, tf(), target, method());
157 if (is_inlined_method_handle_intrinsic(jvms, method())) {
158 // To be able to issue a direct call and skip a call to MH.linkTo*/invokeBasic adapter,
159 // additional information about the method being invoked should be attached
160 // to the call site to make resolution logic work
161 // (see SharedRuntime::resolve_static_call_C).
162 call->set_override_symbolic_info(true);
163 }
164 _call_node = call; // Save the call node in case we need it later
165 if (!is_static) {
166 // Make an explicit receiver null_check as part of this call.
167 // Since we share a map with the caller, his JVMS gets adjusted.
168 kit.null_check_receiver_before_call(method());
169 if (kit.stopped()) {
170 // And dump it back to the caller, decorated with any exceptions:
171 return kit.transfer_exceptions_into_jvms();
172 }
173 // Mark the call node as virtual, sort of:
174 call->set_optimized_virtual(true);
175 if (method()->is_method_handle_intrinsic() ||
176 method()->is_compiled_lambda_form()) {
177 call->set_method_handle_invoke(true);
178 }
179 }
180 kit.set_arguments_for_java_call(call);
181 kit.set_edges_for_java_call(call, false, _separate_io_proj);
182 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
183 kit.push_node(method()->return_type()->basic_type(), ret);
184 return kit.transfer_exceptions_into_jvms();
185 }
186
187 //--------------------------VirtualCallGenerator------------------------------
188 // Internal class which handles all out-of-line calls checking receiver type.
189 class VirtualCallGenerator : public CallGenerator {
190 private:
191 int _vtable_index;
192 bool _separate_io_proj;
193 CallDynamicJavaNode* _call_node;
194
195 protected:
196 void set_call_node(CallDynamicJavaNode* call) { _call_node = call; }
197
198 public:
199 VirtualCallGenerator(ciMethod* method, int vtable_index, bool separate_io_proj)
200 : CallGenerator(method), _vtable_index(vtable_index), _separate_io_proj(separate_io_proj), _call_node(nullptr)
201 {
202 assert(vtable_index == Method::invalid_vtable_index ||
203 vtable_index >= 0, "either invalid or usable");
204 }
205 virtual bool is_virtual() const { return true; }
206 virtual JVMState* generate(JVMState* jvms);
207
208 virtual CallNode* call_node() const { return _call_node; }
209 int vtable_index() const { return _vtable_index; }
210
211 virtual CallGenerator* with_call_node(CallNode* call) {
212 VirtualCallGenerator* cg = new VirtualCallGenerator(method(), _vtable_index, _separate_io_proj);
213 cg->set_call_node(call->as_CallDynamicJava());
214 return cg;
215 }
216 };
217
218 JVMState* VirtualCallGenerator::generate(JVMState* jvms) {
219 GraphKit kit(jvms);
220 Node* receiver = kit.argument(0);
221
222 kit.C->print_inlining_update(this);
223
224 if (kit.C->log() != nullptr) {
225 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci());
226 }
227
228 // If the receiver is a constant null, do not torture the system
229 // by attempting to call through it. The compile will proceed
230 // correctly, but may bail out in final_graph_reshaping, because
231 // the call instruction will have a seemingly deficient out-count.
232 // (The bailout says something misleading about an "infinite loop".)
233 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) {
234 assert(Bytecodes::is_invoke(kit.java_bc()), "%d: %s", kit.java_bc(), Bytecodes::name(kit.java_bc()));
235 ciMethod* declared_method = kit.method()->get_method_at_bci(kit.bci());
236 int arg_size = declared_method->signature()->arg_size_for_bc(kit.java_bc());
237 kit.inc_sp(arg_size); // restore arguments
238 kit.uncommon_trap(Deoptimization::Reason_null_check,
239 Deoptimization::Action_none,
240 nullptr, "null receiver");
241 return kit.transfer_exceptions_into_jvms();
261 }
262
263 assert(!method()->is_static(), "virtual call must not be to static");
264 assert(!method()->is_final(), "virtual call should not be to final");
265 assert(!method()->is_private(), "virtual call should not be to private");
266 assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches,
267 "no vtable calls if +UseInlineCaches ");
268 address target = SharedRuntime::get_resolve_virtual_call_stub();
269 // Normal inline cache used for call
270 CallDynamicJavaNode* call = new CallDynamicJavaNode(tf(), target, method(), _vtable_index);
271 if (is_inlined_method_handle_intrinsic(jvms, method())) {
272 // To be able to issue a direct call (optimized virtual or virtual)
273 // and skip a call to MH.linkTo*/invokeBasic adapter, additional information
274 // about the method being invoked should be attached to the call site to
275 // make resolution logic work (see SharedRuntime::resolve_{virtual,opt_virtual}_call_C).
276 call->set_override_symbolic_info(true);
277 }
278 _call_node = call; // Save the call node in case we need it later
279
280 kit.set_arguments_for_java_call(call);
281 kit.set_edges_for_java_call(call, false /*must_throw*/, _separate_io_proj);
282 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
283 kit.push_node(method()->return_type()->basic_type(), ret);
284
285 // Represent the effect of an implicit receiver null_check
286 // as part of this call. Since we share a map with the caller,
287 // his JVMS gets adjusted.
288 kit.cast_not_null(receiver);
289 return kit.transfer_exceptions_into_jvms();
290 }
291
292 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) {
293 if (InlineTree::check_can_parse(m) != nullptr) return nullptr;
294 return new ParseGenerator(m, expected_uses);
295 }
296
297 // As a special case, the JVMS passed to this CallGenerator is
298 // for the method execution already in progress, not just the JVMS
299 // of the caller. Thus, this CallGenerator cannot be mixed with others!
300 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) {
354 return DirectCallGenerator::generate(jvms);
355 }
356
357 virtual void print_inlining_late(InliningResult result, const char* msg) {
358 CallNode* call = call_node();
359 Compile* C = Compile::current();
360 C->print_inlining_assert_ready();
361 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), result, msg);
362 C->print_inlining_move_to(this);
363 C->print_inlining_update_delayed(this);
364 }
365
366 virtual void set_unique_id(jlong id) {
367 _unique_id = id;
368 }
369
370 virtual jlong unique_id() const {
371 return _unique_id;
372 }
373
374 virtual CallGenerator* with_call_node(CallNode* call) {
375 LateInlineCallGenerator* cg = new LateInlineCallGenerator(method(), _inline_cg, _is_pure_call);
376 cg->set_call_node(call->as_CallStaticJava());
377 return cg;
378 }
379 };
380
381 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
382 return new LateInlineCallGenerator(method, inline_cg);
383 }
384
385 class LateInlineMHCallGenerator : public LateInlineCallGenerator {
386 ciMethod* _caller;
387 bool _input_not_const;
388
389 virtual bool do_late_inline_check(Compile* C, JVMState* jvms);
390
391 public:
392 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) :
393 LateInlineCallGenerator(callee, nullptr), _caller(caller), _input_not_const(input_not_const) {}
415 cg->set_call_node(call->as_CallStaticJava());
416 return cg;
417 }
418 };
419
420 bool LateInlineMHCallGenerator::do_late_inline_check(Compile* C, JVMState* jvms) {
421 // When inlining a virtual call, the null check at the call and the call itself can throw. These 2 paths have different
422 // expression stacks which causes late inlining to break. The MH invoker is not expected to be called from a method with
423 // exception handlers. When there is no exception handler, GraphKit::builtin_throw() pops the stack which solves the issue
424 // of late inlining with exceptions.
425 assert(!jvms->method()->has_exception_handlers() ||
426 (method()->intrinsic_id() != vmIntrinsics::_linkToVirtual &&
427 method()->intrinsic_id() != vmIntrinsics::_linkToInterface), "no exception handler expected");
428 // Even if inlining is not allowed, a virtual call can be strength-reduced to a direct call.
429 bool allow_inline = C->inlining_incrementally();
430 bool input_not_const = true;
431 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), allow_inline, input_not_const);
432 assert(!input_not_const, "sanity"); // shouldn't have been scheduled for inlining in the first place
433
434 if (cg != nullptr) {
435 assert(!cg->is_late_inline() || cg->is_mh_late_inline() || AlwaysIncrementalInline || StressIncrementalInlining, "we're doing late inlining");
436 _inline_cg = cg;
437 C->dec_number_of_mh_late_inlines();
438 return true;
439 } else {
440 // Method handle call which has a constant appendix argument should be either inlined or replaced with a direct call
441 // unless there's a signature mismatch between caller and callee. If the failure occurs, there's not much to be improved later,
442 // so don't reinstall the generator to avoid pushing the generator between IGVN and incremental inlining indefinitely.
443 return false;
444 }
445 }
446
447 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) {
448 assert(IncrementalInlineMH, "required");
449 Compile::current()->inc_number_of_mh_late_inlines();
450 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const);
451 return cg;
452 }
453
454 // Allow inlining decisions to be delayed
577
578 void LateInlineMHCallGenerator::do_late_inline() {
579 CallGenerator::do_late_inline_helper();
580 }
581
582 void LateInlineVirtualCallGenerator::do_late_inline() {
583 assert(_callee != nullptr, "required"); // set up in CallDynamicJavaNode::Ideal
584 CallGenerator::do_late_inline_helper();
585 }
586
587 void CallGenerator::do_late_inline_helper() {
588 assert(is_late_inline(), "only late inline allowed");
589
590 // Can't inline it
591 CallNode* call = call_node();
592 if (call == nullptr || call->outcnt() == 0 ||
593 call->in(0) == nullptr || call->in(0)->is_top()) {
594 return;
595 }
596
597 const TypeTuple *r = call->tf()->domain();
598 for (int i1 = 0; i1 < method()->arg_size(); i1++) {
599 if (call->in(TypeFunc::Parms + i1)->is_top() && r->field_at(TypeFunc::Parms + i1) != Type::HALF) {
600 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
601 return;
602 }
603 }
604
605 if (call->in(TypeFunc::Memory)->is_top()) {
606 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
607 return;
608 }
609 if (call->in(TypeFunc::Memory)->is_MergeMem()) {
610 MergeMemNode* merge_mem = call->in(TypeFunc::Memory)->as_MergeMem();
611 if (merge_mem->base_memory() == merge_mem->empty_memory()) {
612 return; // dead path
613 }
614 }
615
616 // check for unreachable loop
617 CallProjections callprojs;
618 call->extract_projections(&callprojs, true);
619 if ((callprojs.fallthrough_catchproj == call->in(0)) ||
620 (callprojs.catchall_catchproj == call->in(0)) ||
621 (callprojs.fallthrough_memproj == call->in(TypeFunc::Memory)) ||
622 (callprojs.catchall_memproj == call->in(TypeFunc::Memory)) ||
623 (callprojs.fallthrough_ioproj == call->in(TypeFunc::I_O)) ||
624 (callprojs.catchall_ioproj == call->in(TypeFunc::I_O)) ||
625 (callprojs.resproj != nullptr && call->find_edge(callprojs.resproj) != -1) ||
626 (callprojs.exobj != nullptr && call->find_edge(callprojs.exobj) != -1)) {
627 return;
628 }
629
630 Compile* C = Compile::current();
631 // Remove inlined methods from Compiler's lists.
632 if (call->is_macro()) {
633 C->remove_macro_node(call);
634 }
635
636 // The call is marked as pure (no important side effects), but result isn't used.
637 // It's safe to remove the call.
638 bool result_not_used = (callprojs.resproj == nullptr || callprojs.resproj->outcnt() == 0);
639
640 if (is_pure_call() && result_not_used) {
641 GraphKit kit(call->jvms());
642 kit.replace_call(call, C->top(), true);
643 } else {
644 // Make a clone of the JVMState that appropriate to use for driving a parse
645 JVMState* old_jvms = call->jvms();
646 JVMState* jvms = old_jvms->clone_shallow(C);
647 uint size = call->req();
648 SafePointNode* map = new SafePointNode(size, jvms);
649 for (uint i1 = 0; i1 < size; i1++) {
650 map->init_req(i1, call->in(i1));
651 }
652
653 // Make sure the state is a MergeMem for parsing.
654 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
655 Node* mem = MergeMemNode::make(map->in(TypeFunc::Memory));
656 C->initial_gvn()->set_type_bottom(mem);
657 map->set_req(TypeFunc::Memory, mem);
658 }
659
660 uint nargs = method()->arg_size();
661 // blow away old call arguments
662 Node* top = C->top();
663 for (uint i1 = 0; i1 < nargs; i1++) {
664 map->set_req(TypeFunc::Parms + i1, top);
665 }
666 jvms->set_map(map);
667
668 // Make enough space in the expression stack to transfer
669 // the incoming arguments and return value.
670 map->ensure_stack(jvms, jvms->method()->max_stack());
671 for (uint i1 = 0; i1 < nargs; i1++) {
672 map->set_argument(jvms, i1, call->in(TypeFunc::Parms + i1));
673 }
674
675 C->print_inlining_assert_ready();
676
677 C->print_inlining_move_to(this);
678
679 C->log_late_inline(this);
680
681 // JVMState is ready, so time to perform some checks and prepare for inlining attempt.
682 if (!do_late_inline_check(C, jvms)) {
683 map->disconnect_inputs(C);
684 C->print_inlining_update_delayed(this);
685 return;
686 }
687
688 // Setup default node notes to be picked up by the inlining
689 Node_Notes* old_nn = C->node_notes_at(call->_idx);
690 if (old_nn != nullptr) {
691 Node_Notes* entry_nn = old_nn->clone(C);
692 entry_nn->set_jvms(jvms);
693 C->set_default_node_notes(entry_nn);
694 }
695
696 // Now perform the inlining using the synthesized JVMState
697 JVMState* new_jvms = inline_cg()->generate(jvms);
698 if (new_jvms == nullptr) return; // no change
699 if (C->failing()) return;
700
701 // Capture any exceptional control flow
702 GraphKit kit(new_jvms);
703
704 // Find the result object
705 Node* result = C->top();
706 int result_size = method()->return_type()->size();
707 if (result_size != 0 && !kit.stopped()) {
708 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
709 }
710
711 if (call->is_CallStaticJava() && call->as_CallStaticJava()->is_boxing_method()) {
712 result = kit.must_be_not_null(result, false);
713 }
714
715 if (inline_cg()->is_inline()) {
716 C->set_has_loops(C->has_loops() || inline_cg()->method()->has_loops());
717 C->env()->notice_inlined_method(inline_cg()->method());
718 }
719 C->set_inlining_progress(true);
720 C->set_do_cleanup(kit.stopped()); // path is dead; needs cleanup
721 kit.replace_call(call, result, true);
722 }
723 }
724
725 class LateInlineStringCallGenerator : public LateInlineCallGenerator {
726
727 public:
728 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
729 LateInlineCallGenerator(method, inline_cg) {}
730
731 virtual JVMState* generate(JVMState* jvms) {
732 Compile *C = Compile::current();
733
734 C->log_inline_id(this);
735
736 C->add_string_late_inline(this);
737
738 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
739 return new_jvms;
740 }
923 // Inline failed, so make a direct call.
924 assert(_if_hit->is_inline(), "must have been a failed inline");
925 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
926 new_jvms = cg->generate(kit.sync_jvms());
927 }
928 kit.add_exception_states_from(new_jvms);
929 kit.set_jvms(new_jvms);
930
931 // Need to merge slow and fast?
932 if (slow_map == nullptr) {
933 // The fast path is the only path remaining.
934 return kit.transfer_exceptions_into_jvms();
935 }
936
937 if (kit.stopped()) {
938 // Inlined method threw an exception, so it's just the slow path after all.
939 kit.set_jvms(slow_jvms);
940 return kit.transfer_exceptions_into_jvms();
941 }
942
943 // There are 2 branches and the replaced nodes are only valid on
944 // one: restore the replaced nodes to what they were before the
945 // branch.
946 kit.map()->set_replaced_nodes(replaced_nodes);
947
948 // Finish the diamond.
949 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
950 RegionNode* region = new RegionNode(3);
951 region->init_req(1, kit.control());
952 region->init_req(2, slow_map->control());
953 kit.set_control(gvn.transform(region));
954 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
955 iophi->set_req(2, slow_map->i_o());
956 kit.set_i_o(gvn.transform(iophi));
957 // Merge memory
958 kit.merge_memory(slow_map->merged_memory(), region, 2);
959 // Transform new memory Phis.
960 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
961 Node* phi = mms.memory();
962 if (phi->is_Phi() && phi->in(0) == region) {
963 mms.set_memory(gvn.transform(phi));
964 }
965 }
966 uint tos = kit.jvms()->stkoff() + kit.sp();
967 uint limit = slow_map->req();
968 for (uint i = TypeFunc::Parms; i < limit; i++) {
969 // Skip unused stack slots; fast forward to monoff();
970 if (i == tos) {
971 i = kit.jvms()->monoff();
972 if( i >= limit ) break;
973 }
974 Node* m = kit.map()->in(i);
975 Node* n = slow_map->in(i);
976 if (m != n) {
977 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
978 Node* phi = PhiNode::make(region, m, t);
979 phi->set_req(2, n);
980 kit.map()->set_req(i, gvn.transform(phi));
981 }
982 }
983 return kit.transfer_exceptions_into_jvms();
984 }
985
986
987 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool allow_inline) {
988 assert(callee->is_method_handle_intrinsic(), "for_method_handle_call mismatch");
989 bool input_not_const;
990 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, allow_inline, input_not_const);
991 Compile* C = Compile::current();
992 bool should_delay = C->should_delay_inlining();
993 if (cg != nullptr) {
994 if (should_delay) {
995 return CallGenerator::for_late_inline(callee, cg);
996 } else {
997 return cg;
998 }
999 }
1000 int bci = jvms->bci();
1001 ciCallProfile profile = caller->call_profile_at_bci(bci);
1002 int call_site_count = caller->scale_count(profile.count());
1003
1004 if (IncrementalInlineMH && call_site_count > 0 &&
1005 (should_delay || input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())) {
1006 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const);
1007 } else {
1008 // Out-of-line call.
1009 return CallGenerator::for_direct_call(callee);
1010 }
1011 }
1012
1013 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool allow_inline, bool& input_not_const) {
1014 GraphKit kit(jvms);
1015 PhaseGVN& gvn = kit.gvn();
1016 Compile* C = kit.C;
1017 vmIntrinsics::ID iid = callee->intrinsic_id();
1018 input_not_const = true;
1019 if (StressMethodHandleLinkerInlining) {
1020 allow_inline = false;
1021 }
1022 switch (iid) {
1023 case vmIntrinsics::_invokeBasic:
1024 {
1025 // Get MethodHandle receiver:
1026 Node* receiver = kit.argument(0);
1027 if (receiver->Opcode() == Op_ConP) {
1028 input_not_const = false;
1029 const TypeOopPtr* recv_toop = receiver->bottom_type()->isa_oopptr();
1030 if (recv_toop != nullptr) {
1031 ciMethod* target = recv_toop->const_oop()->as_method_handle()->get_vmtarget();
1032 const int vtable_index = Method::invalid_vtable_index;
1044 PROB_ALWAYS);
1045 return cg;
1046 } else {
1047 assert(receiver->bottom_type() == TypePtr::NULL_PTR, "not a null: %s",
1048 Type::str(receiver->bottom_type()));
1049 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1050 "receiver is always null");
1051 }
1052 } else {
1053 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1054 "receiver not constant");
1055 }
1056 }
1057 break;
1058
1059 case vmIntrinsics::_linkToVirtual:
1060 case vmIntrinsics::_linkToStatic:
1061 case vmIntrinsics::_linkToSpecial:
1062 case vmIntrinsics::_linkToInterface:
1063 {
1064 // Get MemberName argument:
1065 Node* member_name = kit.argument(callee->arg_size() - 1);
1066 if (member_name->Opcode() == Op_ConP) {
1067 input_not_const = false;
1068 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr();
1069 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget();
1070
1071 if (!ciMethod::is_consistent_info(callee, target)) {
1072 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1073 "signatures mismatch");
1074 return nullptr;
1075 }
1076
1077 // In lambda forms we erase signature types to avoid resolving issues
1078 // involving class loaders. When we optimize a method handle invoke
1079 // to a direct call we must cast the receiver and arguments to its
1080 // actual types.
1081 ciSignature* signature = target->signature();
1082 const int receiver_skip = target->is_static() ? 0 : 1;
1083 // Cast receiver to its type.
1084 if (!target->is_static()) {
1085 Node* arg = kit.argument(0);
1086 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr();
1087 const Type* sig_type = TypeOopPtr::make_from_klass(signature->accessing_klass());
1088 if (arg_type != nullptr && !arg_type->higher_equal(sig_type)) {
1089 const Type* recv_type = arg_type->filter_speculative(sig_type); // keep speculative part
1090 Node* cast_obj = gvn.transform(new CheckCastPPNode(kit.control(), arg, recv_type));
1091 kit.set_argument(0, cast_obj);
1092 }
1093 }
1094 // Cast reference arguments to its type.
1095 for (int i = 0, j = 0; i < signature->count(); i++) {
1096 ciType* t = signature->type_at(i);
1097 if (t->is_klass()) {
1098 Node* arg = kit.argument(receiver_skip + j);
1099 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr();
1100 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass());
1101 if (arg_type != nullptr && !arg_type->higher_equal(sig_type)) {
1102 const Type* narrowed_arg_type = arg_type->filter_speculative(sig_type); // keep speculative part
1103 Node* cast_obj = gvn.transform(new CheckCastPPNode(kit.control(), arg, narrowed_arg_type));
1104 kit.set_argument(receiver_skip + j, cast_obj);
1105 }
1106 }
1107 j += t->size(); // long and double take two slots
1108 }
1109
1110 // Try to get the most accurate receiver type
1111 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual);
1112 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface);
1113 int vtable_index = Method::invalid_vtable_index;
1114 bool call_does_dispatch = false;
1115
1116 ciKlass* speculative_receiver_type = nullptr;
1117 if (is_virtual_or_interface) {
1118 ciInstanceKlass* klass = target->holder();
1119 Node* receiver_node = kit.argument(0);
1120 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr();
1121 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
1122 // optimize_virtual_call() takes 2 different holder
1123 // arguments for a corner case that doesn't apply here (see
1124 // Parse::do_call())
1125 target = C->optimize_virtual_call(caller, klass, klass,
1126 target, receiver_type, is_virtual,
1127 call_does_dispatch, vtable_index, // out-parameters
1128 false /* check_access */);
1129 // We lack profiling at this call but type speculation may
1130 // provide us with a type
1131 speculative_receiver_type = (receiver_type != nullptr) ? receiver_type->speculative_type() : nullptr;
1132 }
1133 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms,
1134 allow_inline,
1135 PROB_ALWAYS,
1136 speculative_receiver_type);
1137 return cg;
1138 } else {
1139 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1140 "member_name not constant");
1141 }
1142 }
1143 break;
1144
1145 case vmIntrinsics::_linkToNative:
1146 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1147 "native call");
1148 break;
1149
1150 default:
1151 fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
1152 break;
1153 }
1154 return nullptr;
1155 }
1156
1191 // do_intrinsic(0)
1192 // else
1193 // if (predicate(1))
1194 // do_intrinsic(1)
1195 // ...
1196 // else
1197 // do_java_comp
1198
1199 GraphKit kit(jvms);
1200 PhaseGVN& gvn = kit.gvn();
1201
1202 CompileLog* log = kit.C->log();
1203 if (log != nullptr) {
1204 log->elem("predicated_intrinsic bci='%d' method='%d'",
1205 jvms->bci(), log->identify(method()));
1206 }
1207
1208 if (!method()->is_static()) {
1209 // We need an explicit receiver null_check before checking its type in predicate.
1210 // We share a map with the caller, so his JVMS gets adjusted.
1211 Node* receiver = kit.null_check_receiver_before_call(method());
1212 if (kit.stopped()) {
1213 return kit.transfer_exceptions_into_jvms();
1214 }
1215 }
1216
1217 int n_predicates = _intrinsic->predicates_count();
1218 assert(n_predicates > 0, "sanity");
1219
1220 JVMState** result_jvms = NEW_RESOURCE_ARRAY(JVMState*, (n_predicates+1));
1221
1222 // Region for normal compilation code if intrinsic failed.
1223 Node* slow_region = new RegionNode(1);
1224
1225 int results = 0;
1226 for (int predicate = 0; (predicate < n_predicates) && !kit.stopped(); predicate++) {
1227 #ifdef ASSERT
1228 JVMState* old_jvms = kit.jvms();
1229 SafePointNode* old_map = kit.map();
1230 Node* old_io = old_map->i_o();
1231 Node* old_mem = old_map->memory();
|
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/castnode.hpp"
37 #include "opto/cfgnode.hpp"
38 #include "opto/inlinetypenode.hpp"
39 #include "opto/parse.hpp"
40 #include "opto/rootnode.hpp"
41 #include "opto/runtime.hpp"
42 #include "opto/subnode.hpp"
43 #include "runtime/os.inline.hpp"
44 #include "runtime/sharedRuntime.hpp"
45 #include "utilities/debug.hpp"
46
47 // Utility function.
48 const TypeFunc* CallGenerator::tf() const {
49 return TypeFunc::make(method());
50 }
51
52 bool CallGenerator::is_inlined_method_handle_intrinsic(JVMState* jvms, ciMethod* m) {
53 return is_inlined_method_handle_intrinsic(jvms->method(), jvms->bci(), m);
54 }
55
56 bool CallGenerator::is_inlined_method_handle_intrinsic(ciMethod* caller, int bci, ciMethod* m) {
57 ciMethod* symbolic_info = caller->get_method_at_bci(bci);
58 return is_inlined_method_handle_intrinsic(symbolic_info, m);
104 GraphKit& exits = parser.exits();
105
106 if (C->failing()) {
107 while (exits.pop_exception_state() != nullptr) ;
108 return nullptr;
109 }
110
111 assert(exits.jvms()->same_calls_as(jvms), "sanity");
112
113 // Simply return the exit state of the parser,
114 // augmented by any exceptional states.
115 return exits.transfer_exceptions_into_jvms();
116 }
117
118 //---------------------------DirectCallGenerator------------------------------
119 // Internal class which handles all out-of-line calls w/o receiver type checks.
120 class DirectCallGenerator : public CallGenerator {
121 private:
122 CallStaticJavaNode* _call_node;
123 // Force separate memory and I/O projections for the exceptional
124 // paths to facilitate late inlining.
125 bool _separate_io_proj;
126
127 protected:
128 void set_call_node(CallStaticJavaNode* call) { _call_node = call; }
129
130 public:
131 DirectCallGenerator(ciMethod* method, bool separate_io_proj)
132 : CallGenerator(method),
133 _call_node(nullptr),
134 _separate_io_proj(separate_io_proj)
135 {
136 if (InlineTypeReturnedAsFields && method->is_method_handle_intrinsic()) {
137 // If that call has not been optimized by the time optimizations are over,
138 // we'll need to add a call to create an inline type instance from the klass
139 // returned by the call (see PhaseMacroExpand::expand_mh_intrinsic_return).
140 // Separating memory and I/O projections for exceptions is required to
141 // perform that graph transformation.
142 _separate_io_proj = true;
143 }
144 }
145 virtual JVMState* generate(JVMState* jvms);
146
147 virtual CallNode* call_node() const { return _call_node; }
148 virtual CallGenerator* with_call_node(CallNode* call) {
149 DirectCallGenerator* dcg = new DirectCallGenerator(method(), _separate_io_proj);
150 dcg->set_call_node(call->as_CallStaticJava());
151 return dcg;
152 }
153 };
154
155 JVMState* DirectCallGenerator::generate(JVMState* jvms) {
156 GraphKit kit(jvms);
157 kit.C->print_inlining_update(this);
158 PhaseGVN& gvn = kit.gvn();
159 bool is_static = method()->is_static();
160 address target = is_static ? SharedRuntime::get_resolve_static_call_stub()
161 : SharedRuntime::get_resolve_opt_virtual_call_stub();
162
163 if (kit.C->log() != nullptr) {
164 kit.C->log()->elem("direct_call bci='%d'", jvms->bci());
165 }
166
167 CallStaticJavaNode* call = new CallStaticJavaNode(kit.C, tf(), target, method());
168 if (is_inlined_method_handle_intrinsic(jvms, method())) {
169 // To be able to issue a direct call and skip a call to MH.linkTo*/invokeBasic adapter,
170 // additional information about the method being invoked should be attached
171 // to the call site to make resolution logic work
172 // (see SharedRuntime::resolve_static_call_C).
173 call->set_override_symbolic_info(true);
174 }
175 _call_node = call; // Save the call node in case we need it later
176 if (!is_static) {
177 // Make an explicit receiver null_check as part of this call.
178 // Since we share a map with the caller, his JVMS gets adjusted.
179 kit.null_check_receiver_before_call(method());
180 if (kit.stopped()) {
181 // And dump it back to the caller, decorated with any exceptions:
182 return kit.transfer_exceptions_into_jvms();
183 }
184 // Mark the call node as virtual, sort of:
185 call->set_optimized_virtual(true);
186 if (method()->is_method_handle_intrinsic() ||
187 method()->is_compiled_lambda_form()) {
188 call->set_method_handle_invoke(true);
189 }
190 }
191 kit.set_arguments_for_java_call(call, is_late_inline());
192 if (kit.stopped()) {
193 return kit.transfer_exceptions_into_jvms();
194 }
195 kit.set_edges_for_java_call(call, false, _separate_io_proj);
196 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
197 kit.push_node(method()->return_type()->basic_type(), ret);
198 return kit.transfer_exceptions_into_jvms();
199 }
200
201 //--------------------------VirtualCallGenerator------------------------------
202 // Internal class which handles all out-of-line calls checking receiver type.
203 class VirtualCallGenerator : public CallGenerator {
204 private:
205 int _vtable_index;
206 bool _separate_io_proj;
207 CallDynamicJavaNode* _call_node;
208
209 protected:
210 void set_call_node(CallDynamicJavaNode* call) { _call_node = call; }
211
212 public:
213 VirtualCallGenerator(ciMethod* method, int vtable_index, bool separate_io_proj)
214 : CallGenerator(method), _vtable_index(vtable_index), _separate_io_proj(separate_io_proj), _call_node(nullptr)
215 {
216 assert(vtable_index == Method::invalid_vtable_index ||
217 vtable_index >= 0, "either invalid or usable");
218 }
219 virtual bool is_virtual() const { return true; }
220 virtual JVMState* generate(JVMState* jvms);
221
222 virtual CallNode* call_node() const { return _call_node; }
223 int vtable_index() const { return _vtable_index; }
224
225 virtual CallGenerator* with_call_node(CallNode* call) {
226 VirtualCallGenerator* cg = new VirtualCallGenerator(method(), _vtable_index, _separate_io_proj);
227 cg->set_call_node(call->as_CallDynamicJava());
228 return cg;
229 }
230 };
231
232 JVMState* VirtualCallGenerator::generate(JVMState* jvms) {
233 GraphKit kit(jvms);
234 Node* receiver = kit.argument(0);
235 kit.C->print_inlining_update(this);
236
237 if (kit.C->log() != nullptr) {
238 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci());
239 }
240
241 // If the receiver is a constant null, do not torture the system
242 // by attempting to call through it. The compile will proceed
243 // correctly, but may bail out in final_graph_reshaping, because
244 // the call instruction will have a seemingly deficient out-count.
245 // (The bailout says something misleading about an "infinite loop".)
246 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) {
247 assert(Bytecodes::is_invoke(kit.java_bc()), "%d: %s", kit.java_bc(), Bytecodes::name(kit.java_bc()));
248 ciMethod* declared_method = kit.method()->get_method_at_bci(kit.bci());
249 int arg_size = declared_method->signature()->arg_size_for_bc(kit.java_bc());
250 kit.inc_sp(arg_size); // restore arguments
251 kit.uncommon_trap(Deoptimization::Reason_null_check,
252 Deoptimization::Action_none,
253 nullptr, "null receiver");
254 return kit.transfer_exceptions_into_jvms();
274 }
275
276 assert(!method()->is_static(), "virtual call must not be to static");
277 assert(!method()->is_final(), "virtual call should not be to final");
278 assert(!method()->is_private(), "virtual call should not be to private");
279 assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches,
280 "no vtable calls if +UseInlineCaches ");
281 address target = SharedRuntime::get_resolve_virtual_call_stub();
282 // Normal inline cache used for call
283 CallDynamicJavaNode* call = new CallDynamicJavaNode(tf(), target, method(), _vtable_index);
284 if (is_inlined_method_handle_intrinsic(jvms, method())) {
285 // To be able to issue a direct call (optimized virtual or virtual)
286 // and skip a call to MH.linkTo*/invokeBasic adapter, additional information
287 // about the method being invoked should be attached to the call site to
288 // make resolution logic work (see SharedRuntime::resolve_{virtual,opt_virtual}_call_C).
289 call->set_override_symbolic_info(true);
290 }
291 _call_node = call; // Save the call node in case we need it later
292
293 kit.set_arguments_for_java_call(call);
294 if (kit.stopped()) {
295 return kit.transfer_exceptions_into_jvms();
296 }
297 kit.set_edges_for_java_call(call, false /*must_throw*/, _separate_io_proj);
298 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
299 kit.push_node(method()->return_type()->basic_type(), ret);
300
301 // Represent the effect of an implicit receiver null_check
302 // as part of this call. Since we share a map with the caller,
303 // his JVMS gets adjusted.
304 kit.cast_not_null(receiver);
305 return kit.transfer_exceptions_into_jvms();
306 }
307
308 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) {
309 if (InlineTree::check_can_parse(m) != nullptr) return nullptr;
310 return new ParseGenerator(m, expected_uses);
311 }
312
313 // As a special case, the JVMS passed to this CallGenerator is
314 // for the method execution already in progress, not just the JVMS
315 // of the caller. Thus, this CallGenerator cannot be mixed with others!
316 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) {
370 return DirectCallGenerator::generate(jvms);
371 }
372
373 virtual void print_inlining_late(InliningResult result, const char* msg) {
374 CallNode* call = call_node();
375 Compile* C = Compile::current();
376 C->print_inlining_assert_ready();
377 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), result, msg);
378 C->print_inlining_move_to(this);
379 C->print_inlining_update_delayed(this);
380 }
381
382 virtual void set_unique_id(jlong id) {
383 _unique_id = id;
384 }
385
386 virtual jlong unique_id() const {
387 return _unique_id;
388 }
389
390 virtual CallGenerator* inline_cg() {
391 return _inline_cg;
392 }
393
394 virtual CallGenerator* with_call_node(CallNode* call) {
395 LateInlineCallGenerator* cg = new LateInlineCallGenerator(method(), _inline_cg, _is_pure_call);
396 cg->set_call_node(call->as_CallStaticJava());
397 return cg;
398 }
399 };
400
401 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
402 return new LateInlineCallGenerator(method, inline_cg);
403 }
404
405 class LateInlineMHCallGenerator : public LateInlineCallGenerator {
406 ciMethod* _caller;
407 bool _input_not_const;
408
409 virtual bool do_late_inline_check(Compile* C, JVMState* jvms);
410
411 public:
412 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) :
413 LateInlineCallGenerator(callee, nullptr), _caller(caller), _input_not_const(input_not_const) {}
435 cg->set_call_node(call->as_CallStaticJava());
436 return cg;
437 }
438 };
439
440 bool LateInlineMHCallGenerator::do_late_inline_check(Compile* C, JVMState* jvms) {
441 // When inlining a virtual call, the null check at the call and the call itself can throw. These 2 paths have different
442 // expression stacks which causes late inlining to break. The MH invoker is not expected to be called from a method with
443 // exception handlers. When there is no exception handler, GraphKit::builtin_throw() pops the stack which solves the issue
444 // of late inlining with exceptions.
445 assert(!jvms->method()->has_exception_handlers() ||
446 (method()->intrinsic_id() != vmIntrinsics::_linkToVirtual &&
447 method()->intrinsic_id() != vmIntrinsics::_linkToInterface), "no exception handler expected");
448 // Even if inlining is not allowed, a virtual call can be strength-reduced to a direct call.
449 bool allow_inline = C->inlining_incrementally();
450 bool input_not_const = true;
451 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), allow_inline, input_not_const);
452 assert(!input_not_const, "sanity"); // shouldn't have been scheduled for inlining in the first place
453
454 if (cg != nullptr) {
455 // AlwaysIncrementalInline causes for_method_handle_inline() to
456 // return a LateInlineCallGenerator. Extract the
457 // InlineCallGenerator from it.
458 if (AlwaysIncrementalInline && cg->is_late_inline() && !cg->is_virtual_late_inline()) {
459 cg = cg->inline_cg();
460 assert(cg != nullptr, "inline call generator expected");
461 }
462
463 assert(!cg->is_late_inline() || cg->is_mh_late_inline() || AlwaysIncrementalInline || StressIncrementalInlining, "we're doing late inlining");
464 _inline_cg = cg;
465 C->dec_number_of_mh_late_inlines();
466 return true;
467 } else {
468 // Method handle call which has a constant appendix argument should be either inlined or replaced with a direct call
469 // unless there's a signature mismatch between caller and callee. If the failure occurs, there's not much to be improved later,
470 // so don't reinstall the generator to avoid pushing the generator between IGVN and incremental inlining indefinitely.
471 return false;
472 }
473 }
474
475 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) {
476 assert(IncrementalInlineMH, "required");
477 Compile::current()->inc_number_of_mh_late_inlines();
478 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const);
479 return cg;
480 }
481
482 // Allow inlining decisions to be delayed
605
606 void LateInlineMHCallGenerator::do_late_inline() {
607 CallGenerator::do_late_inline_helper();
608 }
609
610 void LateInlineVirtualCallGenerator::do_late_inline() {
611 assert(_callee != nullptr, "required"); // set up in CallDynamicJavaNode::Ideal
612 CallGenerator::do_late_inline_helper();
613 }
614
615 void CallGenerator::do_late_inline_helper() {
616 assert(is_late_inline(), "only late inline allowed");
617
618 // Can't inline it
619 CallNode* call = call_node();
620 if (call == nullptr || call->outcnt() == 0 ||
621 call->in(0) == nullptr || call->in(0)->is_top()) {
622 return;
623 }
624
625 const TypeTuple* r = call->tf()->domain_cc();
626 for (uint i1 = TypeFunc::Parms; i1 < r->cnt(); i1++) {
627 if (call->in(i1)->is_top() && r->field_at(i1) != Type::HALF) {
628 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
629 return;
630 }
631 }
632
633 if (call->in(TypeFunc::Memory)->is_top()) {
634 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
635 return;
636 }
637 if (call->in(TypeFunc::Memory)->is_MergeMem()) {
638 MergeMemNode* merge_mem = call->in(TypeFunc::Memory)->as_MergeMem();
639 if (merge_mem->base_memory() == merge_mem->empty_memory()) {
640 return; // dead path
641 }
642 }
643
644 // check for unreachable loop
645 CallProjections* callprojs = call->extract_projections(true);
646 if ((callprojs->fallthrough_catchproj == call->in(0)) ||
647 (callprojs->catchall_catchproj == call->in(0)) ||
648 (callprojs->fallthrough_memproj == call->in(TypeFunc::Memory)) ||
649 (callprojs->catchall_memproj == call->in(TypeFunc::Memory)) ||
650 (callprojs->fallthrough_ioproj == call->in(TypeFunc::I_O)) ||
651 (callprojs->catchall_ioproj == call->in(TypeFunc::I_O)) ||
652 (callprojs->exobj != nullptr && call->find_edge(callprojs->exobj) != -1)) {
653 return;
654 }
655
656 Compile* C = Compile::current();
657 // Remove inlined methods from Compiler's lists.
658 if (call->is_macro()) {
659 C->remove_macro_node(call);
660 }
661
662
663 bool result_not_used = true;
664 for (uint i = 0; i < callprojs->nb_resproj; i++) {
665 if (callprojs->resproj[i] != nullptr) {
666 if (callprojs->resproj[i]->outcnt() != 0) {
667 result_not_used = false;
668 }
669 if (call->find_edge(callprojs->resproj[i]) != -1) {
670 return;
671 }
672 }
673 }
674
675 if (is_pure_call() && result_not_used) {
676 // The call is marked as pure (no important side effects), but result isn't used.
677 // It's safe to remove the call.
678 GraphKit kit(call->jvms());
679 kit.replace_call(call, C->top(), true);
680 } else {
681 // Make a clone of the JVMState that appropriate to use for driving a parse
682 JVMState* old_jvms = call->jvms();
683 JVMState* jvms = old_jvms->clone_shallow(C);
684 uint size = call->req();
685 SafePointNode* map = new SafePointNode(size, jvms);
686 for (uint i1 = 0; i1 < size; i1++) {
687 map->init_req(i1, call->in(i1));
688 }
689
690 PhaseGVN& gvn = *C->initial_gvn();
691 // Make sure the state is a MergeMem for parsing.
692 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
693 Node* mem = MergeMemNode::make(map->in(TypeFunc::Memory));
694 gvn.set_type_bottom(mem);
695 map->set_req(TypeFunc::Memory, mem);
696 }
697
698 // blow away old call arguments
699 for (uint i1 = TypeFunc::Parms; i1 < r->cnt(); i1++) {
700 map->set_req(i1, C->top());
701 }
702 jvms->set_map(map);
703
704 // Make enough space in the expression stack to transfer
705 // the incoming arguments and return value.
706 map->ensure_stack(jvms, jvms->method()->max_stack());
707 const TypeTuple* domain_sig = call->_tf->domain_sig();
708 uint nargs = method()->arg_size();
709 assert(domain_sig->cnt() - TypeFunc::Parms == nargs, "inconsistent signature");
710
711 uint j = TypeFunc::Parms;
712 int arg_num = 0;
713 for (uint i1 = 0; i1 < nargs; i1++) {
714 const Type* t = domain_sig->field_at(TypeFunc::Parms + i1);
715 if (t->is_inlinetypeptr() && !method()->get_Method()->mismatch() && method()->is_scalarized_arg(arg_num)) {
716 // Inline type arguments are not passed by reference: we get an argument per
717 // field of the inline type. Build InlineTypeNodes from the inline type arguments.
718 GraphKit arg_kit(jvms, &gvn);
719 Node* vt = InlineTypeNode::make_from_multi(&arg_kit, call, t->inline_klass(), j, /* in= */ true, /* null_free= */ !t->maybe_null());
720 map->set_control(arg_kit.control());
721 map->set_argument(jvms, i1, vt);
722 } else {
723 map->set_argument(jvms, i1, call->in(j++));
724 }
725 if (t != Type::HALF) {
726 arg_num++;
727 }
728 }
729
730 C->print_inlining_assert_ready();
731
732 C->print_inlining_move_to(this);
733
734 C->log_late_inline(this);
735
736 // JVMState is ready, so time to perform some checks and prepare for inlining attempt.
737 if (!do_late_inline_check(C, jvms)) {
738 map->disconnect_inputs(C);
739 C->print_inlining_update_delayed(this);
740 return;
741 }
742
743 // Check if we are late inlining a method handle call that returns an inline type as fields.
744 Node* buffer_oop = nullptr;
745 ciMethod* inline_method = inline_cg()->method();
746 ciType* return_type = inline_method->return_type();
747 if (!call->tf()->returns_inline_type_as_fields() && is_mh_late_inline() &&
748 return_type->is_inlinetype() && return_type->as_inline_klass()->can_be_returned_as_fields()) {
749 // Allocate a buffer for the inline type returned as fields because the caller expects an oop return.
750 // Do this before the method handle call in case the buffer allocation triggers deoptimization and
751 // we need to "re-execute" the call in the interpreter (to make sure the call is only executed once).
752 GraphKit arg_kit(jvms, &gvn);
753 {
754 PreserveReexecuteState preexecs(&arg_kit);
755 arg_kit.jvms()->set_should_reexecute(true);
756 arg_kit.inc_sp(nargs);
757 Node* klass_node = arg_kit.makecon(TypeKlassPtr::make(return_type->as_inline_klass()));
758 buffer_oop = arg_kit.new_instance(klass_node, nullptr, nullptr, /* deoptimize_on_exception */ true);
759 }
760 jvms = arg_kit.transfer_exceptions_into_jvms();
761 }
762
763 // Setup default node notes to be picked up by the inlining
764 Node_Notes* old_nn = C->node_notes_at(call->_idx);
765 if (old_nn != nullptr) {
766 Node_Notes* entry_nn = old_nn->clone(C);
767 entry_nn->set_jvms(jvms);
768 C->set_default_node_notes(entry_nn);
769 }
770
771 // Now perform the inlining using the synthesized JVMState
772 JVMState* new_jvms = inline_cg()->generate(jvms);
773 if (new_jvms == nullptr) return; // no change
774 if (C->failing()) return;
775
776 // Capture any exceptional control flow
777 GraphKit kit(new_jvms);
778
779 // Find the result object
780 Node* result = C->top();
781 int result_size = method()->return_type()->size();
782 if (result_size != 0 && !kit.stopped()) {
783 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
784 }
785
786 if (call->is_CallStaticJava() && call->as_CallStaticJava()->is_boxing_method()) {
787 result = kit.must_be_not_null(result, false);
788 }
789
790 if (inline_cg()->is_inline()) {
791 C->set_has_loops(C->has_loops() || inline_method->has_loops());
792 C->env()->notice_inlined_method(inline_method);
793 }
794 C->set_inlining_progress(true);
795 C->set_do_cleanup(kit.stopped()); // path is dead; needs cleanup
796
797 // Handle inline type returns
798 InlineTypeNode* vt = result->isa_InlineType();
799 if (vt != nullptr) {
800 if (call->tf()->returns_inline_type_as_fields()) {
801 vt->replace_call_results(&kit, call, C);
802 } else if (vt->is_InlineType()) {
803 // Result might still be allocated (for example, if it has been stored to a non-flat field)
804 if (!vt->is_allocated(&kit.gvn())) {
805 assert(buffer_oop != nullptr, "should have allocated a buffer");
806 RegionNode* region = new RegionNode(3);
807
808 // Check if result is null
809 Node* null_ctl = kit.top();
810 kit.null_check_common(vt->get_is_init(), T_INT, false, &null_ctl);
811 region->init_req(1, null_ctl);
812 PhiNode* oop = PhiNode::make(region, kit.gvn().zerocon(T_OBJECT), TypeInstPtr::make(TypePtr::BotPTR, vt->type()->inline_klass()));
813 Node* init_mem = kit.reset_memory();
814 PhiNode* mem = PhiNode::make(region, init_mem, Type::MEMORY, TypePtr::BOTTOM);
815
816 // Not null, initialize the buffer
817 kit.set_all_memory(init_mem);
818 vt->store(&kit, buffer_oop, buffer_oop, vt->type()->inline_klass());
819 // Do not let stores that initialize this buffer be reordered with a subsequent
820 // store that would make this buffer accessible by other threads.
821 AllocateNode* alloc = AllocateNode::Ideal_allocation(buffer_oop);
822 assert(alloc != nullptr, "must have an allocation node");
823 kit.insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out_or_null(AllocateNode::RawAddress));
824 region->init_req(2, kit.control());
825 oop->init_req(2, buffer_oop);
826 mem->init_req(2, kit.merged_memory());
827
828 // Update oop input to buffer
829 kit.gvn().hash_delete(vt);
830 vt->set_oop(kit.gvn(), kit.gvn().transform(oop));
831 vt->set_is_buffered(kit.gvn());
832 vt = kit.gvn().transform(vt)->as_InlineType();
833
834 kit.set_control(kit.gvn().transform(region));
835 kit.set_all_memory(kit.gvn().transform(mem));
836 kit.record_for_igvn(region);
837 kit.record_for_igvn(oop);
838 kit.record_for_igvn(mem);
839 }
840 result = vt;
841 }
842 DEBUG_ONLY(buffer_oop = nullptr);
843 } else {
844 assert(result->is_top() || !call->tf()->returns_inline_type_as_fields(), "Unexpected return value");
845 }
846 assert(buffer_oop == nullptr, "unused buffer allocation");
847
848 kit.replace_call(call, result, true);
849 }
850 }
851
852 class LateInlineStringCallGenerator : public LateInlineCallGenerator {
853
854 public:
855 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
856 LateInlineCallGenerator(method, inline_cg) {}
857
858 virtual JVMState* generate(JVMState* jvms) {
859 Compile *C = Compile::current();
860
861 C->log_inline_id(this);
862
863 C->add_string_late_inline(this);
864
865 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
866 return new_jvms;
867 }
1050 // Inline failed, so make a direct call.
1051 assert(_if_hit->is_inline(), "must have been a failed inline");
1052 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
1053 new_jvms = cg->generate(kit.sync_jvms());
1054 }
1055 kit.add_exception_states_from(new_jvms);
1056 kit.set_jvms(new_jvms);
1057
1058 // Need to merge slow and fast?
1059 if (slow_map == nullptr) {
1060 // The fast path is the only path remaining.
1061 return kit.transfer_exceptions_into_jvms();
1062 }
1063
1064 if (kit.stopped()) {
1065 // Inlined method threw an exception, so it's just the slow path after all.
1066 kit.set_jvms(slow_jvms);
1067 return kit.transfer_exceptions_into_jvms();
1068 }
1069
1070 // Allocate inline types if they are merged with objects (similar to Parse::merge_common())
1071 uint tos = kit.jvms()->stkoff() + kit.sp();
1072 uint limit = slow_map->req();
1073 for (uint i = TypeFunc::Parms; i < limit; i++) {
1074 Node* m = kit.map()->in(i);
1075 Node* n = slow_map->in(i);
1076 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
1077 // TODO 8284443 still needed?
1078 if (m->is_InlineType() && !t->is_inlinetypeptr()) {
1079 // Allocate inline type in fast path
1080 m = m->as_InlineType()->buffer(&kit);
1081 kit.map()->set_req(i, m);
1082 }
1083 if (n->is_InlineType() && !t->is_inlinetypeptr()) {
1084 // Allocate inline type in slow path
1085 PreserveJVMState pjvms(&kit);
1086 kit.set_map(slow_map);
1087 n = n->as_InlineType()->buffer(&kit);
1088 kit.map()->set_req(i, n);
1089 slow_map = kit.stop();
1090 }
1091 }
1092
1093 // There are 2 branches and the replaced nodes are only valid on
1094 // one: restore the replaced nodes to what they were before the
1095 // branch.
1096 kit.map()->set_replaced_nodes(replaced_nodes);
1097
1098 // Finish the diamond.
1099 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
1100 RegionNode* region = new RegionNode(3);
1101 region->init_req(1, kit.control());
1102 region->init_req(2, slow_map->control());
1103 kit.set_control(gvn.transform(region));
1104 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
1105 iophi->set_req(2, slow_map->i_o());
1106 kit.set_i_o(gvn.transform(iophi));
1107 // Merge memory
1108 kit.merge_memory(slow_map->merged_memory(), region, 2);
1109 // Transform new memory Phis.
1110 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
1111 Node* phi = mms.memory();
1112 if (phi->is_Phi() && phi->in(0) == region) {
1113 mms.set_memory(gvn.transform(phi));
1114 }
1115 }
1116 for (uint i = TypeFunc::Parms; i < limit; i++) {
1117 // Skip unused stack slots; fast forward to monoff();
1118 if (i == tos) {
1119 i = kit.jvms()->monoff();
1120 if( i >= limit ) break;
1121 }
1122 Node* m = kit.map()->in(i);
1123 Node* n = slow_map->in(i);
1124 if (m != n) {
1125 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
1126 Node* phi = PhiNode::make(region, m, t);
1127 phi->set_req(2, n);
1128 kit.map()->set_req(i, gvn.transform(phi));
1129 }
1130 }
1131 return kit.transfer_exceptions_into_jvms();
1132 }
1133
1134
1135 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool allow_inline) {
1136 assert(callee->is_method_handle_intrinsic(), "for_method_handle_call mismatch");
1137 bool input_not_const;
1138 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, allow_inline, input_not_const);
1139 Compile* C = Compile::current();
1140 bool should_delay = C->should_delay_inlining();
1141 if (cg != nullptr) {
1142 if (should_delay) {
1143 return CallGenerator::for_late_inline(callee, cg);
1144 } else {
1145 return cg;
1146 }
1147 }
1148 int bci = jvms->bci();
1149 ciCallProfile profile = caller->call_profile_at_bci(bci);
1150 int call_site_count = caller->scale_count(profile.count());
1151
1152 if (IncrementalInlineMH && (AlwaysIncrementalInline ||
1153 (call_site_count > 0 && (should_delay || input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())))) {
1154 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const);
1155 } else {
1156 // Out-of-line call.
1157 return CallGenerator::for_direct_call(callee);
1158 }
1159 }
1160
1161 static void cast_argument(int nargs, int arg_nb, ciType* t, GraphKit& kit) {
1162 PhaseGVN& gvn = kit.gvn();
1163 Node* arg = kit.argument(arg_nb);
1164 const Type* arg_type = arg->bottom_type();
1165 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass());
1166 if (arg_type->isa_oopptr() && !arg_type->higher_equal(sig_type)) {
1167 const Type* narrowed_arg_type = arg_type->filter_speculative(sig_type); // keep speculative part
1168 arg = gvn.transform(new CheckCastPPNode(kit.control(), arg, narrowed_arg_type));
1169 kit.set_argument(arg_nb, arg);
1170 }
1171 if (sig_type->is_inlinetypeptr()) {
1172 arg = InlineTypeNode::make_from_oop(&kit, arg, sig_type->inline_klass(), !kit.gvn().type(arg)->maybe_null());
1173 kit.set_argument(arg_nb, arg);
1174 }
1175 }
1176
1177 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool allow_inline, bool& input_not_const) {
1178 GraphKit kit(jvms);
1179 PhaseGVN& gvn = kit.gvn();
1180 Compile* C = kit.C;
1181 vmIntrinsics::ID iid = callee->intrinsic_id();
1182 input_not_const = true;
1183 if (StressMethodHandleLinkerInlining) {
1184 allow_inline = false;
1185 }
1186 switch (iid) {
1187 case vmIntrinsics::_invokeBasic:
1188 {
1189 // Get MethodHandle receiver:
1190 Node* receiver = kit.argument(0);
1191 if (receiver->Opcode() == Op_ConP) {
1192 input_not_const = false;
1193 const TypeOopPtr* recv_toop = receiver->bottom_type()->isa_oopptr();
1194 if (recv_toop != nullptr) {
1195 ciMethod* target = recv_toop->const_oop()->as_method_handle()->get_vmtarget();
1196 const int vtable_index = Method::invalid_vtable_index;
1208 PROB_ALWAYS);
1209 return cg;
1210 } else {
1211 assert(receiver->bottom_type() == TypePtr::NULL_PTR, "not a null: %s",
1212 Type::str(receiver->bottom_type()));
1213 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1214 "receiver is always null");
1215 }
1216 } else {
1217 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1218 "receiver not constant");
1219 }
1220 }
1221 break;
1222
1223 case vmIntrinsics::_linkToVirtual:
1224 case vmIntrinsics::_linkToStatic:
1225 case vmIntrinsics::_linkToSpecial:
1226 case vmIntrinsics::_linkToInterface:
1227 {
1228 int nargs = callee->arg_size();
1229 // Get MemberName argument:
1230 Node* member_name = kit.argument(nargs - 1);
1231 if (member_name->Opcode() == Op_ConP) {
1232 input_not_const = false;
1233 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr();
1234 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget();
1235
1236 if (!ciMethod::is_consistent_info(callee, target)) {
1237 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1238 "signatures mismatch");
1239 return nullptr;
1240 }
1241
1242 // In lambda forms we erase signature types to avoid resolving issues
1243 // involving class loaders. When we optimize a method handle invoke
1244 // to a direct call we must cast the receiver and arguments to its
1245 // actual types.
1246 ciSignature* signature = target->signature();
1247 const int receiver_skip = target->is_static() ? 0 : 1;
1248 // Cast receiver to its type.
1249 if (!target->is_static()) {
1250 cast_argument(nargs, 0, signature->accessing_klass(), kit);
1251 }
1252 // Cast reference arguments to its type.
1253 for (int i = 0, j = 0; i < signature->count(); i++) {
1254 ciType* t = signature->type_at(i);
1255 if (t->is_klass()) {
1256 cast_argument(nargs, receiver_skip + j, t, kit);
1257 }
1258 j += t->size(); // long and double take two slots
1259 }
1260
1261 // Try to get the most accurate receiver type
1262 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual);
1263 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface);
1264 int vtable_index = Method::invalid_vtable_index;
1265 bool call_does_dispatch = false;
1266
1267 ciKlass* speculative_receiver_type = nullptr;
1268 if (is_virtual_or_interface) {
1269 ciInstanceKlass* klass = target->holder();
1270 Node* receiver_node = kit.argument(0);
1271 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr();
1272 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
1273 // optimize_virtual_call() takes 2 different holder
1274 // arguments for a corner case that doesn't apply here (see
1275 // Parse::do_call())
1276 target = C->optimize_virtual_call(caller, klass, klass,
1277 target, receiver_type, is_virtual,
1278 call_does_dispatch, vtable_index, // out-parameters
1279 false /* check_access */);
1280 // We lack profiling at this call but type speculation may
1281 // provide us with a type
1282 speculative_receiver_type = (receiver_type != nullptr) ? receiver_type->speculative_type() : nullptr;
1283 }
1284 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms,
1285 allow_inline,
1286 PROB_ALWAYS,
1287 speculative_receiver_type,
1288 true);
1289 return cg;
1290 } else {
1291 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1292 "member_name not constant");
1293 }
1294 }
1295 break;
1296
1297 case vmIntrinsics::_linkToNative:
1298 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1299 "native call");
1300 break;
1301
1302 default:
1303 fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
1304 break;
1305 }
1306 return nullptr;
1307 }
1308
1343 // do_intrinsic(0)
1344 // else
1345 // if (predicate(1))
1346 // do_intrinsic(1)
1347 // ...
1348 // else
1349 // do_java_comp
1350
1351 GraphKit kit(jvms);
1352 PhaseGVN& gvn = kit.gvn();
1353
1354 CompileLog* log = kit.C->log();
1355 if (log != nullptr) {
1356 log->elem("predicated_intrinsic bci='%d' method='%d'",
1357 jvms->bci(), log->identify(method()));
1358 }
1359
1360 if (!method()->is_static()) {
1361 // We need an explicit receiver null_check before checking its type in predicate.
1362 // We share a map with the caller, so his JVMS gets adjusted.
1363 kit.null_check_receiver_before_call(method());
1364 if (kit.stopped()) {
1365 return kit.transfer_exceptions_into_jvms();
1366 }
1367 }
1368
1369 int n_predicates = _intrinsic->predicates_count();
1370 assert(n_predicates > 0, "sanity");
1371
1372 JVMState** result_jvms = NEW_RESOURCE_ARRAY(JVMState*, (n_predicates+1));
1373
1374 // Region for normal compilation code if intrinsic failed.
1375 Node* slow_region = new RegionNode(1);
1376
1377 int results = 0;
1378 for (int predicate = 0; (predicate < n_predicates) && !kit.stopped(); predicate++) {
1379 #ifdef ASSERT
1380 JVMState* old_jvms = kit.jvms();
1381 SafePointNode* old_map = kit.map();
1382 Node* old_io = old_map->i_o();
1383 Node* old_mem = old_map->memory();
|