1 /*
2 * Copyright (c) 2000, 2023, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
5 * This code is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation.
8 *
9 * This code is distributed in the hope that it will be useful, but WITHOUT
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
12 * version 2 for more details (a copy is included in the LICENSE file that
13 * accompanied this code).
14 *
15 * You should have received a copy of the GNU General Public License version
16 * 2 along with this work; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
18 *
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
24
25 #include "precompiled.hpp"
26 #include "ci/bcEscapeAnalyzer.hpp"
27 #include "ci/ciCallSite.hpp"
28 #include "ci/ciObjArray.hpp"
29 #include "ci/ciMemberName.hpp"
30 #include "ci/ciMethodHandle.hpp"
31 #include "classfile/javaClasses.hpp"
32 #include "compiler/compileLog.hpp"
33 #include "opto/addnode.hpp"
34 #include "opto/callGenerator.hpp"
35 #include "opto/callnode.hpp"
36 #include "opto/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);
59 }
60
61 bool CallGenerator::is_inlined_method_handle_intrinsic(ciMethod* symbolic_info, ciMethod* m) {
62 return symbolic_info->is_method_handle_intrinsic() && !m->is_method_handle_intrinsic();
63 }
64
65 //-----------------------------ParseGenerator---------------------------------
66 // Internal class which handles all direct bytecode traversal.
67 class ParseGenerator : public InlineCallGenerator {
68 private:
69 bool _is_osr;
70 float _expected_uses;
71
72 public:
73 ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false)
74 : InlineCallGenerator(method)
75 {
76 _is_osr = is_osr;
77 _expected_uses = expected_uses;
78 assert(InlineTree::check_can_parse(method) == nullptr, "parse must be possible");
79 }
80
81 virtual bool is_parse() const { return true; }
82 virtual JVMState* generate(JVMState* jvms);
83 int is_osr() { return _is_osr; }
84
85 };
86
87 JVMState* ParseGenerator::generate(JVMState* jvms) {
88 Compile* C = Compile::current();
89 C->print_inlining_update(this);
90
91 if (is_osr()) {
92 // The JVMS for a OSR has a single argument (see its TypeFunc).
93 assert(jvms->depth() == 1, "no inline OSR");
94 }
95
96 if (C->failing()) {
97 return nullptr; // bailing out of the compile; do not try to parse
98 }
99
100 Parse parser(jvms, method(), _expected_uses);
101 if (C->failing()) return nullptr;
102
103 // Grab signature for matching/allocation
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();
255 }
256
257 // Ideally we would unconditionally do a null check here and let it
258 // be converted to an implicit check based on profile information.
259 // However currently the conversion to implicit null checks in
260 // Block::implicit_null_check() only looks for loads and stores, not calls.
261 ciMethod *caller = kit.method();
262 ciMethodData *caller_md = (caller == nullptr) ? nullptr : caller->method_data();
263 if (!UseInlineCaches || !ImplicitNullChecks || !os::zero_page_read_protected() ||
264 ((ImplicitNullCheckThreshold > 0) && caller_md &&
265 (caller_md->trap_count(Deoptimization::Reason_null_check)
266 >= (uint)ImplicitNullCheckThreshold))) {
267 // Make an explicit receiver null_check as part of this call.
268 // Since we share a map with the caller, his JVMS gets adjusted.
269 receiver = kit.null_check_receiver_before_call(method());
270 if (kit.stopped()) {
271 // And dump it back to the caller, decorated with any exceptions:
272 return kit.transfer_exceptions_into_jvms();
273 }
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) {
317 if (InlineTree::check_can_parse(m) != nullptr) return nullptr;
318 float past_uses = m->interpreter_invocation_count();
319 float expected_uses = past_uses;
320 return new ParseGenerator(m, expected_uses, true);
321 }
322
323 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) {
324 assert(!m->is_abstract(), "for_direct_call mismatch");
325 return new DirectCallGenerator(m, separate_io_proj);
326 }
327
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_intrinsic(), "should be a direct call");
331 return new VirtualCallGenerator(m, vtable_index, false /*separate_io_projs*/);
332 }
333
334 // Allow inlining decisions to be delayed
335 class LateInlineCallGenerator : public DirectCallGenerator {
336 private:
337 jlong _unique_id; // unique id for log compilation
338 bool _is_pure_call; // a hint that the call doesn't have important side effects to care about
339
340 protected:
341 CallGenerator* _inline_cg;
342 virtual bool do_late_inline_check(Compile* C, JVMState* jvms) { return true; }
343 virtual CallGenerator* inline_cg() const { return _inline_cg; }
344 virtual bool is_pure_call() const { return _is_pure_call; }
345
346 public:
347 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg, bool is_pure_call = false) :
348 DirectCallGenerator(method, true), _unique_id(0), _is_pure_call(is_pure_call), _inline_cg(inline_cg) {}
349
350 virtual bool is_late_inline() const { return true; }
351
352 // Convert the CallStaticJava into an inline
353 virtual void do_late_inline();
354
355 virtual JVMState* generate(JVMState* jvms) {
356 Compile *C = Compile::current();
357
358 C->log_inline_id(this);
359
360 // Record that this call site should be revisited once the main
361 // parse is finished.
362 if (!is_mh_late_inline()) {
363 C->add_late_inline(this);
364 }
365
366 // Emit the CallStaticJava and request separate projections so
367 // that the late inlining logic can distinguish between fall
368 // through and exceptional uses of the memory and io projections
369 // as is done for allocations and macro expansion.
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) {}
414
415 virtual bool is_mh_late_inline() const { return true; }
416
417 // Convert the CallStaticJava into an inline
418 virtual void do_late_inline();
419
420 virtual JVMState* generate(JVMState* jvms) {
421 JVMState* new_jvms = LateInlineCallGenerator::generate(jvms);
422
423 Compile* C = Compile::current();
424 if (_input_not_const) {
425 // inlining won't be possible so no need to enqueue right now.
426 call_node()->set_generator(this);
427 } else {
428 C->add_late_inline(this);
429 }
430 return new_jvms;
431 }
432
433 virtual CallGenerator* with_call_node(CallNode* call) {
434 LateInlineMHCallGenerator* cg = new LateInlineMHCallGenerator(_caller, method(), _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 if (!allow_inline && (C->print_inlining() || C->print_intrinsics())) {
464 C->print_inlining(cg->method(), jvms->depth()-1, call_node()->jvms()->bci(), InliningResult::FAILURE,
465 "late method handle call resolution");
466 }
467 assert(!cg->is_late_inline() || cg->is_mh_late_inline() || AlwaysIncrementalInline || StressIncrementalInlining, "we're doing late inlining");
468 _inline_cg = cg;
469 C->dec_number_of_mh_late_inlines();
470 return true;
471 } else {
472 // Method handle call which has a constant appendix argument should be either inlined or replaced with a direct call
473 // unless there's a signature mismatch between caller and callee. If the failure occurs, there's not much to be improved later,
474 // so don't reinstall the generator to avoid pushing the generator between IGVN and incremental inlining indefinitely.
475 return false;
476 }
477 }
478
479 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) {
480 assert(IncrementalInlineMH, "required");
481 Compile::current()->inc_number_of_mh_late_inlines();
482 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const);
483 return cg;
484 }
485
486 // Allow inlining decisions to be delayed
487 class LateInlineVirtualCallGenerator : public VirtualCallGenerator {
488 private:
489 jlong _unique_id; // unique id for log compilation
490 CallGenerator* _inline_cg;
491 ciMethod* _callee;
492 bool _is_pure_call;
493 float _prof_factor;
494
495 protected:
496 virtual bool do_late_inline_check(Compile* C, JVMState* jvms);
497 virtual CallGenerator* inline_cg() const { return _inline_cg; }
498 virtual bool is_pure_call() const { return _is_pure_call; }
499
500 public:
501 LateInlineVirtualCallGenerator(ciMethod* method, int vtable_index, float prof_factor)
502 : VirtualCallGenerator(method, vtable_index, true /*separate_io_projs*/),
503 _unique_id(0), _inline_cg(nullptr), _callee(nullptr), _is_pure_call(false), _prof_factor(prof_factor) {
504 assert(IncrementalInlineVirtual, "required");
505 }
506
507 virtual bool is_late_inline() const { return true; }
508
509 virtual bool is_virtual_late_inline() const { return true; }
510
511 // Convert the CallDynamicJava into an inline
512 virtual void do_late_inline();
513
514 virtual void set_callee_method(ciMethod* m) {
515 assert(_callee == nullptr, "repeated inlining attempt");
516 _callee = m;
517 }
518
519 virtual JVMState* generate(JVMState* jvms) {
520 // Emit the CallDynamicJava and request separate projections so
521 // that the late inlining logic can distinguish between fall
522 // through and exceptional uses of the memory and io projections
523 // as is done for allocations and macro expansion.
524 JVMState* new_jvms = VirtualCallGenerator::generate(jvms);
525 if (call_node() != nullptr) {
526 call_node()->set_generator(this);
527 }
528 return new_jvms;
529 }
530
531 virtual void print_inlining_late(InliningResult result, const char* msg) {
532 CallNode* call = call_node();
533 Compile* C = Compile::current();
534 C->print_inlining_assert_ready();
535 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), result, msg);
536 C->print_inlining_move_to(this);
537 C->print_inlining_update_delayed(this);
538 }
539
540 virtual void set_unique_id(jlong id) {
541 _unique_id = id;
542 }
543
544 virtual jlong unique_id() const {
545 return _unique_id;
546 }
547
548 virtual CallGenerator* with_call_node(CallNode* call) {
549 LateInlineVirtualCallGenerator* cg = new LateInlineVirtualCallGenerator(method(), vtable_index(), _prof_factor);
550 cg->set_call_node(call->as_CallDynamicJava());
551 return cg;
552 }
553 };
554
555 bool LateInlineVirtualCallGenerator::do_late_inline_check(Compile* C, JVMState* jvms) {
556 // Method handle linker case is handled in CallDynamicJavaNode::Ideal().
557 // Unless inlining is performed, _override_symbolic_info bit will be set in DirectCallGenerator::generate().
558
559 // Implicit receiver null checks introduce problems when exception states are combined.
560 Node* receiver = jvms->map()->argument(jvms, 0);
561 const Type* recv_type = C->initial_gvn()->type(receiver);
562 if (recv_type->maybe_null()) {
563 if (C->print_inlining() || C->print_intrinsics()) {
564 C->print_inlining(method(), jvms->depth()-1, call_node()->jvms()->bci(), InliningResult::FAILURE,
565 "late call devirtualization failed (receiver may be null)");
566 }
567 return false;
568 }
569 // Even if inlining is not allowed, a virtual call can be strength-reduced to a direct call.
570 bool allow_inline = C->inlining_incrementally();
571 if (!allow_inline && _callee->holder()->is_interface()) {
572 // Don't convert the interface call to a direct call guarded by an interface subtype check.
573 if (C->print_inlining() || C->print_intrinsics()) {
574 C->print_inlining(method(), jvms->depth()-1, call_node()->jvms()->bci(), InliningResult::FAILURE,
575 "late call devirtualization failed (interface call)");
576 }
577 return false;
578 }
579 CallGenerator* cg = C->call_generator(_callee,
580 vtable_index(),
581 false /*call_does_dispatch*/,
582 jvms,
583 allow_inline,
584 _prof_factor,
585 nullptr /*speculative_receiver_type*/,
586 true /*allow_intrinsics*/);
587
588 if (cg != nullptr) {
589 if (!allow_inline && (C->print_inlining() || C->print_intrinsics())) {
590 C->print_inlining(cg->method(), jvms->depth()-1, call_node()->jvms()->bci(), InliningResult::FAILURE,
591 "late call devirtualization");
592 }
593 assert(!cg->is_late_inline() || cg->is_mh_late_inline() || AlwaysIncrementalInline || StressIncrementalInlining, "we're doing late inlining");
594 _inline_cg = cg;
595 return true;
596 } else {
597 // Virtual call which provably doesn't dispatch should be either inlined or replaced with a direct call.
598 assert(false, "no progress");
599 return false;
600 }
601 }
602
603 CallGenerator* CallGenerator::for_late_inline_virtual(ciMethod* m, int vtable_index, float prof_factor) {
604 assert(IncrementalInlineVirtual, "required");
605 assert(!m->is_static(), "for_virtual_call mismatch");
606 assert(!m->is_method_handle_intrinsic(), "should be a direct call");
607 return new LateInlineVirtualCallGenerator(m, vtable_index, prof_factor);
608 }
609
610 void LateInlineCallGenerator::do_late_inline() {
611 CallGenerator::do_late_inline_helper();
612 }
613
614 void LateInlineMHCallGenerator::do_late_inline() {
615 CallGenerator::do_late_inline_helper();
616 }
617
618 void LateInlineVirtualCallGenerator::do_late_inline() {
619 assert(_callee != nullptr, "required"); // set up in CallDynamicJavaNode::Ideal
620 CallGenerator::do_late_inline_helper();
621 }
622
623 void CallGenerator::do_late_inline_helper() {
624 assert(is_late_inline(), "only late inline allowed");
625
626 // Can't inline it
627 CallNode* call = call_node();
628 if (call == nullptr || call->outcnt() == 0 ||
629 call->in(0) == nullptr || call->in(0)->is_top()) {
630 return;
631 }
632
633 const TypeTuple* r = call->tf()->domain_cc();
634 for (uint i1 = TypeFunc::Parms; i1 < r->cnt(); i1++) {
635 if (call->in(i1)->is_top() && r->field_at(i1) != Type::HALF) {
636 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
637 return;
638 }
639 }
640
641 if (call->in(TypeFunc::Memory)->is_top()) {
642 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
643 return;
644 }
645 if (call->in(TypeFunc::Memory)->is_MergeMem()) {
646 MergeMemNode* merge_mem = call->in(TypeFunc::Memory)->as_MergeMem();
647 if (merge_mem->base_memory() == merge_mem->empty_memory()) {
648 return; // dead path
649 }
650 }
651
652 // check for unreachable loop
653 // Similar to incremental inlining, don't assert that all call
654 // projections are still there for post-parse call devirtualization.
655 bool do_asserts = !is_mh_late_inline() && !is_virtual_late_inline();
656 CallProjections* callprojs = call->extract_projections(true, do_asserts);
657 if ((callprojs->fallthrough_catchproj == call->in(0)) ||
658 (callprojs->catchall_catchproj == call->in(0)) ||
659 (callprojs->fallthrough_memproj == call->in(TypeFunc::Memory)) ||
660 (callprojs->catchall_memproj == call->in(TypeFunc::Memory)) ||
661 (callprojs->fallthrough_ioproj == call->in(TypeFunc::I_O)) ||
662 (callprojs->catchall_ioproj == call->in(TypeFunc::I_O)) ||
663 (callprojs->exobj != nullptr && call->find_edge(callprojs->exobj) != -1)) {
664 return;
665 }
666
667 Compile* C = Compile::current();
668 // Remove inlined methods from Compiler's lists.
669 if (call->is_macro()) {
670 C->remove_macro_node(call);
671 }
672
673
674 bool result_not_used = true;
675 for (uint i = 0; i < callprojs->nb_resproj; i++) {
676 if (callprojs->resproj[i] != nullptr) {
677 if (callprojs->resproj[i]->outcnt() != 0) {
678 result_not_used = false;
679 }
680 if (call->find_edge(callprojs->resproj[i]) != -1) {
681 return;
682 }
683 }
684 }
685
686 if (is_pure_call() && result_not_used) {
687 // The call is marked as pure (no important side effects), but result isn't used.
688 // It's safe to remove the call.
689 GraphKit kit(call->jvms());
690 kit.replace_call(call, C->top(), true, do_asserts);
691 } else {
692 // Make a clone of the JVMState that appropriate to use for driving a parse
693 JVMState* old_jvms = call->jvms();
694 JVMState* jvms = old_jvms->clone_shallow(C);
695 uint size = call->req();
696 SafePointNode* map = new SafePointNode(size, jvms);
697 for (uint i1 = 0; i1 < size; i1++) {
698 map->init_req(i1, call->in(i1));
699 }
700
701 PhaseGVN& gvn = *C->initial_gvn();
702 // Make sure the state is a MergeMem for parsing.
703 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
704 Node* mem = MergeMemNode::make(map->in(TypeFunc::Memory));
705 gvn.set_type_bottom(mem);
706 map->set_req(TypeFunc::Memory, mem);
707 }
708
709 // blow away old call arguments
710 for (uint i1 = TypeFunc::Parms; i1 < r->cnt(); i1++) {
711 map->set_req(i1, C->top());
712 }
713 jvms->set_map(map);
714
715 // Make enough space in the expression stack to transfer
716 // the incoming arguments and return value.
717 map->ensure_stack(jvms, jvms->method()->max_stack());
718 const TypeTuple* domain_sig = call->_tf->domain_sig();
719 uint nargs = method()->arg_size();
720 assert(domain_sig->cnt() - TypeFunc::Parms == nargs, "inconsistent signature");
721
722 uint j = TypeFunc::Parms;
723 int arg_num = 0;
724 for (uint i1 = 0; i1 < nargs; i1++) {
725 const Type* t = domain_sig->field_at(TypeFunc::Parms + i1);
726 if (t->is_inlinetypeptr() && !method()->get_Method()->mismatch() && method()->is_scalarized_arg(arg_num)) {
727 // Inline type arguments are not passed by reference: we get an argument per
728 // field of the inline type. Build InlineTypeNodes from the inline type arguments.
729 GraphKit arg_kit(jvms, &gvn);
730 Node* vt = InlineTypeNode::make_from_multi(&arg_kit, call, t->inline_klass(), j, /* in= */ true, /* null_free= */ !t->maybe_null());
731 map->set_control(arg_kit.control());
732 map->set_argument(jvms, i1, vt);
733 } else {
734 map->set_argument(jvms, i1, call->in(j++));
735 }
736 if (t != Type::HALF) {
737 arg_num++;
738 }
739 }
740
741 C->print_inlining_assert_ready();
742
743 C->print_inlining_move_to(this);
744
745 C->log_late_inline(this);
746
747 // JVMState is ready, so time to perform some checks and prepare for inlining attempt.
748 if (!do_late_inline_check(C, jvms)) {
749 map->disconnect_inputs(C);
750 C->print_inlining_update_delayed(this);
751 return;
752 }
753 if (C->print_inlining() && (is_mh_late_inline() || is_virtual_late_inline())) {
754 C->print_inlining_update_delayed(this);
755 }
756
757 // Check if we are late inlining a method handle call that returns an inline type as fields.
758 Node* buffer_oop = nullptr;
759 ciMethod* inline_method = inline_cg()->method();
760 ciType* return_type = inline_method->return_type();
761 if (!call->tf()->returns_inline_type_as_fields() && is_mh_late_inline() &&
762 return_type->is_inlinetype() && return_type->as_inline_klass()->can_be_returned_as_fields()) {
763 // Allocate a buffer for the inline type returned as fields because the caller expects an oop return.
764 // Do this before the method handle call in case the buffer allocation triggers deoptimization and
765 // we need to "re-execute" the call in the interpreter (to make sure the call is only executed once).
766 GraphKit arg_kit(jvms, &gvn);
767 {
768 PreserveReexecuteState preexecs(&arg_kit);
769 arg_kit.jvms()->set_should_reexecute(true);
770 arg_kit.inc_sp(nargs);
771 Node* klass_node = arg_kit.makecon(TypeKlassPtr::make(return_type->as_inline_klass()));
772 buffer_oop = arg_kit.new_instance(klass_node, nullptr, nullptr, /* deoptimize_on_exception */ true);
773 }
774 jvms = arg_kit.transfer_exceptions_into_jvms();
775 }
776
777 // Setup default node notes to be picked up by the inlining
778 Node_Notes* old_nn = C->node_notes_at(call->_idx);
779 if (old_nn != nullptr) {
780 Node_Notes* entry_nn = old_nn->clone(C);
781 entry_nn->set_jvms(jvms);
782 C->set_default_node_notes(entry_nn);
783 }
784
785 // Now perform the inlining using the synthesized JVMState
786 JVMState* new_jvms = inline_cg()->generate(jvms);
787 if (new_jvms == nullptr) return; // no change
788 if (C->failing()) return;
789
790 // Capture any exceptional control flow
791 GraphKit kit(new_jvms);
792
793 // Find the result object
794 Node* result = C->top();
795 int result_size = method()->return_type()->size();
796 if (result_size != 0 && !kit.stopped()) {
797 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
798 }
799
800 if (call->is_CallStaticJava() && call->as_CallStaticJava()->is_boxing_method()) {
801 result = kit.must_be_not_null(result, false);
802 }
803
804 if (inline_cg()->is_inline()) {
805 C->set_has_loops(C->has_loops() || inline_method->has_loops());
806 C->env()->notice_inlined_method(inline_method);
807 }
808 C->set_inlining_progress(true);
809 C->set_do_cleanup(kit.stopped()); // path is dead; needs cleanup
810
811 // Handle inline type returns
812 InlineTypeNode* vt = result->isa_InlineType();
813 if (vt != nullptr) {
814 if (call->tf()->returns_inline_type_as_fields()) {
815 vt->replace_call_results(&kit, call, C);
816 } else if (vt->is_InlineType()) {
817 // Result might still be allocated (for example, if it has been stored to a non-flat field)
818 if (!vt->is_allocated(&kit.gvn())) {
819 assert(buffer_oop != nullptr, "should have allocated a buffer");
820 RegionNode* region = new RegionNode(3);
821
822 // Check if result is null
823 Node* null_ctl = kit.top();
824 kit.null_check_common(vt->get_is_init(), T_INT, false, &null_ctl);
825 region->init_req(1, null_ctl);
826 PhiNode* oop = PhiNode::make(region, kit.gvn().zerocon(T_OBJECT), TypeInstPtr::make(TypePtr::BotPTR, vt->type()->inline_klass()));
827 Node* init_mem = kit.reset_memory();
828 PhiNode* mem = PhiNode::make(region, init_mem, Type::MEMORY, TypePtr::BOTTOM);
829
830 // Not null, initialize the buffer
831 kit.set_all_memory(init_mem);
832 vt->store(&kit, buffer_oop, buffer_oop, vt->type()->inline_klass());
833 // Do not let stores that initialize this buffer be reordered with a subsequent
834 // store that would make this buffer accessible by other threads.
835 AllocateNode* alloc = AllocateNode::Ideal_allocation(buffer_oop);
836 assert(alloc != nullptr, "must have an allocation node");
837 kit.insert_mem_bar(Op_MemBarStoreStore, alloc->proj_out_or_null(AllocateNode::RawAddress));
838 region->init_req(2, kit.control());
839 oop->init_req(2, buffer_oop);
840 mem->init_req(2, kit.merged_memory());
841
842 // Update oop input to buffer
843 kit.gvn().hash_delete(vt);
844 vt->set_oop(kit.gvn(), kit.gvn().transform(oop));
845 vt->set_is_buffered(kit.gvn());
846 vt = kit.gvn().transform(vt)->as_InlineType();
847
848 kit.set_control(kit.gvn().transform(region));
849 kit.set_all_memory(kit.gvn().transform(mem));
850 kit.record_for_igvn(region);
851 kit.record_for_igvn(oop);
852 kit.record_for_igvn(mem);
853 }
854 result = vt;
855 }
856 DEBUG_ONLY(buffer_oop = nullptr);
857 } else {
858 assert(result->is_top() || !call->tf()->returns_inline_type_as_fields(), "Unexpected return value");
859 }
860 assert(buffer_oop == nullptr, "unused buffer allocation");
861
862 kit.replace_call(call, result, true, do_asserts);
863 }
864 }
865
866 class LateInlineStringCallGenerator : public LateInlineCallGenerator {
867
868 public:
869 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
870 LateInlineCallGenerator(method, inline_cg) {}
871
872 virtual JVMState* generate(JVMState* jvms) {
873 Compile *C = Compile::current();
874
875 C->log_inline_id(this);
876
877 C->add_string_late_inline(this);
878
879 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
880 return new_jvms;
881 }
882
883 virtual bool is_string_late_inline() const { return true; }
884
885 virtual CallGenerator* with_call_node(CallNode* call) {
886 LateInlineStringCallGenerator* cg = new LateInlineStringCallGenerator(method(), _inline_cg);
887 cg->set_call_node(call->as_CallStaticJava());
888 return cg;
889 }
890 };
891
892 CallGenerator* CallGenerator::for_string_late_inline(ciMethod* method, CallGenerator* inline_cg) {
893 return new LateInlineStringCallGenerator(method, inline_cg);
894 }
895
896 class LateInlineBoxingCallGenerator : public LateInlineCallGenerator {
897
898 public:
899 LateInlineBoxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
900 LateInlineCallGenerator(method, inline_cg, /*is_pure=*/true) {}
901
902 virtual JVMState* generate(JVMState* jvms) {
903 Compile *C = Compile::current();
904
905 C->log_inline_id(this);
906
907 C->add_boxing_late_inline(this);
908
909 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
910 return new_jvms;
911 }
912
913 virtual CallGenerator* with_call_node(CallNode* call) {
914 LateInlineBoxingCallGenerator* cg = new LateInlineBoxingCallGenerator(method(), _inline_cg);
915 cg->set_call_node(call->as_CallStaticJava());
916 return cg;
917 }
918 };
919
920 CallGenerator* CallGenerator::for_boxing_late_inline(ciMethod* method, CallGenerator* inline_cg) {
921 return new LateInlineBoxingCallGenerator(method, inline_cg);
922 }
923
924 class LateInlineVectorReboxingCallGenerator : public LateInlineCallGenerator {
925
926 public:
927 LateInlineVectorReboxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
928 LateInlineCallGenerator(method, inline_cg, /*is_pure=*/true) {}
929
930 virtual JVMState* generate(JVMState* jvms) {
931 Compile *C = Compile::current();
932
933 C->log_inline_id(this);
934
935 C->add_vector_reboxing_late_inline(this);
936
937 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
938 return new_jvms;
939 }
940
941 virtual CallGenerator* with_call_node(CallNode* call) {
942 LateInlineVectorReboxingCallGenerator* cg = new LateInlineVectorReboxingCallGenerator(method(), _inline_cg);
943 cg->set_call_node(call->as_CallStaticJava());
944 return cg;
945 }
946 };
947
948 // static CallGenerator* for_vector_reboxing_late_inline(ciMethod* m, CallGenerator* inline_cg);
949 CallGenerator* CallGenerator::for_vector_reboxing_late_inline(ciMethod* method, CallGenerator* inline_cg) {
950 return new LateInlineVectorReboxingCallGenerator(method, inline_cg);
951 }
952
953 //------------------------PredictedCallGenerator------------------------------
954 // Internal class which handles all out-of-line calls checking receiver type.
955 class PredictedCallGenerator : public CallGenerator {
956 ciKlass* _predicted_receiver;
957 CallGenerator* _if_missed;
958 CallGenerator* _if_hit;
959 float _hit_prob;
960 bool _exact_check;
961
962 public:
963 PredictedCallGenerator(ciKlass* predicted_receiver,
964 CallGenerator* if_missed,
965 CallGenerator* if_hit, bool exact_check,
966 float hit_prob)
967 : CallGenerator(if_missed->method())
968 {
969 // The call profile data may predict the hit_prob as extreme as 0 or 1.
970 // Remove the extremes values from the range.
971 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX;
972 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
973
974 _predicted_receiver = predicted_receiver;
975 _if_missed = if_missed;
976 _if_hit = if_hit;
977 _hit_prob = hit_prob;
978 _exact_check = exact_check;
979 }
980
981 virtual bool is_virtual() const { return true; }
982 virtual bool is_inline() const { return _if_hit->is_inline(); }
983 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
984
985 virtual JVMState* generate(JVMState* jvms);
986 };
987
988
989 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver,
990 CallGenerator* if_missed,
991 CallGenerator* if_hit,
992 float hit_prob) {
993 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit,
994 /*exact_check=*/true, hit_prob);
995 }
996
997 CallGenerator* CallGenerator::for_guarded_call(ciKlass* guarded_receiver,
998 CallGenerator* if_missed,
999 CallGenerator* if_hit) {
1000 return new PredictedCallGenerator(guarded_receiver, if_missed, if_hit,
1001 /*exact_check=*/false, PROB_ALWAYS);
1002 }
1003
1004 JVMState* PredictedCallGenerator::generate(JVMState* jvms) {
1005 GraphKit kit(jvms);
1006 kit.C->print_inlining_update(this);
1007 PhaseGVN& gvn = kit.gvn();
1008 // We need an explicit receiver null_check before checking its type.
1009 // We share a map with the caller, so his JVMS gets adjusted.
1010 Node* receiver = kit.argument(0);
1011 CompileLog* log = kit.C->log();
1012 if (log != nullptr) {
1013 log->elem("predicted_call bci='%d' exact='%d' klass='%d'",
1014 jvms->bci(), (_exact_check ? 1 : 0), log->identify(_predicted_receiver));
1015 }
1016
1017 receiver = kit.null_check_receiver_before_call(method());
1018 if (kit.stopped()) {
1019 return kit.transfer_exceptions_into_jvms();
1020 }
1021
1022 // Make a copy of the replaced nodes in case we need to restore them
1023 ReplacedNodes replaced_nodes = kit.map()->replaced_nodes();
1024 replaced_nodes.clone();
1025
1026 Node* casted_receiver = receiver; // will get updated in place...
1027 Node* slow_ctl = nullptr;
1028 if (_exact_check) {
1029 slow_ctl = kit.type_check_receiver(receiver, _predicted_receiver, _hit_prob,
1030 &casted_receiver);
1031 } else {
1032 slow_ctl = kit.subtype_check_receiver(receiver, _predicted_receiver,
1033 &casted_receiver);
1034 }
1035
1036 SafePointNode* slow_map = nullptr;
1037 JVMState* slow_jvms = nullptr;
1038 { PreserveJVMState pjvms(&kit);
1039 kit.set_control(slow_ctl);
1040 if (!kit.stopped()) {
1041 slow_jvms = _if_missed->generate(kit.sync_jvms());
1042 if (kit.failing())
1043 return nullptr; // might happen because of NodeCountInliningCutoff
1044 assert(slow_jvms != nullptr, "must be");
1045 kit.add_exception_states_from(slow_jvms);
1046 kit.set_map(slow_jvms->map());
1047 if (!kit.stopped())
1048 slow_map = kit.stop();
1049 }
1050 }
1051
1052 if (kit.stopped()) {
1053 // Instance does not match the predicted type.
1054 kit.set_jvms(slow_jvms);
1055 return kit.transfer_exceptions_into_jvms();
1056 }
1057
1058 // Fall through if the instance matches the desired type.
1059 kit.replace_in_map(receiver, casted_receiver);
1060
1061 // Make the hot call:
1062 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
1063 if (new_jvms == nullptr) {
1064 // Inline failed, so make a direct call.
1065 assert(_if_hit->is_inline(), "must have been a failed inline");
1066 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
1067 new_jvms = cg->generate(kit.sync_jvms());
1068 }
1069 kit.add_exception_states_from(new_jvms);
1070 kit.set_jvms(new_jvms);
1071
1072 // Need to merge slow and fast?
1073 if (slow_map == nullptr) {
1074 // The fast path is the only path remaining.
1075 return kit.transfer_exceptions_into_jvms();
1076 }
1077
1078 if (kit.stopped()) {
1079 // Inlined method threw an exception, so it's just the slow path after all.
1080 kit.set_jvms(slow_jvms);
1081 return kit.transfer_exceptions_into_jvms();
1082 }
1083
1084 // Allocate inline types if they are merged with objects (similar to Parse::merge_common())
1085 uint tos = kit.jvms()->stkoff() + kit.sp();
1086 uint limit = slow_map->req();
1087 for (uint i = TypeFunc::Parms; i < limit; i++) {
1088 Node* m = kit.map()->in(i);
1089 Node* n = slow_map->in(i);
1090 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
1091 // TODO 8284443 still needed?
1092 if (m->is_InlineType() && !t->is_inlinetypeptr()) {
1093 // Allocate inline type in fast path
1094 m = m->as_InlineType()->buffer(&kit);
1095 kit.map()->set_req(i, m);
1096 }
1097 if (n->is_InlineType() && !t->is_inlinetypeptr()) {
1098 // Allocate inline type in slow path
1099 PreserveJVMState pjvms(&kit);
1100 kit.set_map(slow_map);
1101 n = n->as_InlineType()->buffer(&kit);
1102 kit.map()->set_req(i, n);
1103 slow_map = kit.stop();
1104 }
1105 }
1106
1107 // There are 2 branches and the replaced nodes are only valid on
1108 // one: restore the replaced nodes to what they were before the
1109 // branch.
1110 kit.map()->set_replaced_nodes(replaced_nodes);
1111
1112 // Finish the diamond.
1113 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
1114 RegionNode* region = new RegionNode(3);
1115 region->init_req(1, kit.control());
1116 region->init_req(2, slow_map->control());
1117 kit.set_control(gvn.transform(region));
1118 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
1119 iophi->set_req(2, slow_map->i_o());
1120 kit.set_i_o(gvn.transform(iophi));
1121 // Merge memory
1122 kit.merge_memory(slow_map->merged_memory(), region, 2);
1123 // Transform new memory Phis.
1124 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
1125 Node* phi = mms.memory();
1126 if (phi->is_Phi() && phi->in(0) == region) {
1127 mms.set_memory(gvn.transform(phi));
1128 }
1129 }
1130 for (uint i = TypeFunc::Parms; i < limit; i++) {
1131 // Skip unused stack slots; fast forward to monoff();
1132 if (i == tos) {
1133 i = kit.jvms()->monoff();
1134 if( i >= limit ) break;
1135 }
1136 Node* m = kit.map()->in(i);
1137 Node* n = slow_map->in(i);
1138 if (m != n) {
1139 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
1140 Node* phi = PhiNode::make(region, m, t);
1141 phi->set_req(2, n);
1142 kit.map()->set_req(i, gvn.transform(phi));
1143 }
1144 }
1145 return kit.transfer_exceptions_into_jvms();
1146 }
1147
1148
1149 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool allow_inline) {
1150 assert(callee->is_method_handle_intrinsic(), "for_method_handle_call mismatch");
1151 bool input_not_const;
1152 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, allow_inline, input_not_const);
1153 Compile* C = Compile::current();
1154 bool should_delay = C->should_delay_inlining();
1155 if (cg != nullptr) {
1156 if (should_delay) {
1157 return CallGenerator::for_late_inline(callee, cg);
1158 } else {
1159 return cg;
1160 }
1161 }
1162 int bci = jvms->bci();
1163 ciCallProfile profile = caller->call_profile_at_bci(bci);
1164 int call_site_count = caller->scale_count(profile.count());
1165
1166 if (IncrementalInlineMH && (AlwaysIncrementalInline ||
1167 (call_site_count > 0 && (should_delay || input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())))) {
1168 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const);
1169 } else {
1170 // Out-of-line call.
1171 return CallGenerator::for_direct_call(callee);
1172 }
1173 }
1174
1175
1176 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool allow_inline, bool& input_not_const) {
1177 GraphKit kit(jvms);
1178 PhaseGVN& gvn = kit.gvn();
1179 Compile* C = kit.C;
1180 vmIntrinsics::ID iid = callee->intrinsic_id();
1181 input_not_const = true;
1182 if (StressMethodHandleLinkerInlining) {
1183 allow_inline = false;
1184 }
1185 switch (iid) {
1186 case vmIntrinsics::_invokeBasic:
1187 {
1188 // Get MethodHandle receiver:
1189 Node* receiver = kit.argument(0);
1190 if (receiver->Opcode() == Op_ConP) {
1191 input_not_const = false;
1192 const TypeOopPtr* recv_toop = receiver->bottom_type()->isa_oopptr();
1193 if (recv_toop != nullptr) {
1194 ciMethod* target = recv_toop->const_oop()->as_method_handle()->get_vmtarget();
1195 const int vtable_index = Method::invalid_vtable_index;
1196
1197 if (!ciMethod::is_consistent_info(callee, target)) {
1198 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1199 "signatures mismatch");
1200 return nullptr;
1201 }
1202
1203 CallGenerator *cg = C->call_generator(target, vtable_index,
1204 false /* call_does_dispatch */,
1205 jvms,
1206 allow_inline,
1207 PROB_ALWAYS);
1208 return cg;
1209 } else {
1210 assert(receiver->bottom_type() == TypePtr::NULL_PTR, "not a null: %s",
1211 Type::str(receiver->bottom_type()));
1212 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1213 "receiver is always null");
1214 }
1215 } else {
1216 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1217 "receiver not constant");
1218 }
1219 }
1220 break;
1221
1222 case vmIntrinsics::_linkToVirtual:
1223 case vmIntrinsics::_linkToStatic:
1224 case vmIntrinsics::_linkToSpecial:
1225 case vmIntrinsics::_linkToInterface:
1226 {
1227 int nargs = callee->arg_size();
1228 // Get MemberName argument:
1229 Node* member_name = kit.argument(nargs - 1);
1230 if (member_name->Opcode() == Op_ConP) {
1231 input_not_const = false;
1232 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr();
1233 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget();
1234
1235 if (!ciMethod::is_consistent_info(callee, target)) {
1236 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1237 "signatures mismatch");
1238 return nullptr;
1239 }
1240
1241 // In lambda forms we erase signature types to avoid resolving issues
1242 // involving class loaders. When we optimize a method handle invoke
1243 // to a direct call we must cast the receiver and arguments to its
1244 // actual types.
1245 ciSignature* signature = target->signature();
1246 const int receiver_skip = target->is_static() ? 0 : 1;
1247 // Cast receiver to its type.
1248 if (!target->is_static()) {
1249 Node* recv = kit.argument(0);
1250 Node* casted_recv = kit.maybe_narrow_object_type(recv, signature->accessing_klass());
1251 if (casted_recv->is_top()) {
1252 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1253 "argument types mismatch");
1254 return nullptr; // FIXME: effectively dead; issue a halt node instead
1255 } else if (casted_recv != recv) {
1256 kit.set_argument(0, casted_recv);
1257 }
1258 }
1259 // Cast reference arguments to its type.
1260 for (int i = 0, j = 0; i < signature->count(); i++) {
1261 ciType* t = signature->type_at(i);
1262 if (t->is_klass()) {
1263 Node* arg = kit.argument(receiver_skip + j);
1264 Node* casted_arg = kit.maybe_narrow_object_type(arg, t->as_klass());
1265 if (casted_arg->is_top()) {
1266 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1267 "argument types mismatch");
1268 return nullptr; // FIXME: effectively dead; issue a halt node instead
1269 } else if (casted_arg != arg) {
1270 kit.set_argument(receiver_skip + j, casted_arg);
1271 }
1272 }
1273 j += t->size(); // long and double take two slots
1274 }
1275
1276 // Try to get the most accurate receiver type
1277 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual);
1278 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface);
1279 int vtable_index = Method::invalid_vtable_index;
1280 bool call_does_dispatch = false;
1281
1282 ciKlass* speculative_receiver_type = nullptr;
1283 if (is_virtual_or_interface) {
1284 ciInstanceKlass* klass = target->holder();
1285 Node* receiver_node = kit.argument(0);
1286 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr();
1287 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
1288 // optimize_virtual_call() takes 2 different holder
1289 // arguments for a corner case that doesn't apply here (see
1290 // Parse::do_call())
1291 target = C->optimize_virtual_call(caller, klass, klass,
1292 target, receiver_type, is_virtual,
1293 call_does_dispatch, vtable_index, // out-parameters
1294 false /* check_access */);
1295 // We lack profiling at this call but type speculation may
1296 // provide us with a type
1297 speculative_receiver_type = (receiver_type != nullptr) ? receiver_type->speculative_type() : nullptr;
1298 }
1299 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms,
1300 allow_inline,
1301 PROB_ALWAYS,
1302 speculative_receiver_type,
1303 true);
1304 return cg;
1305 } else {
1306 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1307 "member_name not constant");
1308 }
1309 }
1310 break;
1311
1312 case vmIntrinsics::_linkToNative:
1313 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1314 "native call");
1315 break;
1316
1317 default:
1318 fatal("unexpected intrinsic %d: %s", vmIntrinsics::as_int(iid), vmIntrinsics::name_at(iid));
1319 break;
1320 }
1321 return nullptr;
1322 }
1323
1324 //------------------------PredicatedIntrinsicGenerator------------------------------
1325 // Internal class which handles all predicated Intrinsic calls.
1326 class PredicatedIntrinsicGenerator : public CallGenerator {
1327 CallGenerator* _intrinsic;
1328 CallGenerator* _cg;
1329
1330 public:
1331 PredicatedIntrinsicGenerator(CallGenerator* intrinsic,
1332 CallGenerator* cg)
1333 : CallGenerator(cg->method())
1334 {
1335 _intrinsic = intrinsic;
1336 _cg = cg;
1337 }
1338
1339 virtual bool is_virtual() const { return true; }
1340 virtual bool is_inline() const { return true; }
1341 virtual bool is_intrinsic() const { return true; }
1342
1343 virtual JVMState* generate(JVMState* jvms);
1344 };
1345
1346
1347 CallGenerator* CallGenerator::for_predicated_intrinsic(CallGenerator* intrinsic,
1348 CallGenerator* cg) {
1349 return new PredicatedIntrinsicGenerator(intrinsic, cg);
1350 }
1351
1352
1353 JVMState* PredicatedIntrinsicGenerator::generate(JVMState* jvms) {
1354 // The code we want to generate here is:
1355 // if (receiver == nullptr)
1356 // uncommon_Trap
1357 // if (predicate(0))
1358 // do_intrinsic(0)
1359 // else
1360 // if (predicate(1))
1361 // do_intrinsic(1)
1362 // ...
1363 // else
1364 // do_java_comp
1365
1366 GraphKit kit(jvms);
1367 PhaseGVN& gvn = kit.gvn();
1368
1369 CompileLog* log = kit.C->log();
1370 if (log != nullptr) {
1371 log->elem("predicated_intrinsic bci='%d' method='%d'",
1372 jvms->bci(), log->identify(method()));
1373 }
1374
1375 if (!method()->is_static()) {
1376 // We need an explicit receiver null_check before checking its type in predicate.
1377 // We share a map with the caller, so his JVMS gets adjusted.
1378 kit.null_check_receiver_before_call(method());
1379 if (kit.stopped()) {
1380 return kit.transfer_exceptions_into_jvms();
1381 }
1382 }
1383
1384 int n_predicates = _intrinsic->predicates_count();
1385 assert(n_predicates > 0, "sanity");
1386
1387 JVMState** result_jvms = NEW_RESOURCE_ARRAY(JVMState*, (n_predicates+1));
1388
1389 // Region for normal compilation code if intrinsic failed.
1390 Node* slow_region = new RegionNode(1);
1391
1392 int results = 0;
1393 for (int predicate = 0; (predicate < n_predicates) && !kit.stopped(); predicate++) {
1394 #ifdef ASSERT
1395 JVMState* old_jvms = kit.jvms();
1396 SafePointNode* old_map = kit.map();
1397 Node* old_io = old_map->i_o();
1398 Node* old_mem = old_map->memory();
1399 Node* old_exc = old_map->next_exception();
1400 #endif
1401 Node* else_ctrl = _intrinsic->generate_predicate(kit.sync_jvms(), predicate);
1402 #ifdef ASSERT
1403 // Assert(no_new_memory && no_new_io && no_new_exceptions) after generate_predicate.
1404 assert(old_jvms == kit.jvms(), "generate_predicate should not change jvm state");
1405 SafePointNode* new_map = kit.map();
1406 assert(old_io == new_map->i_o(), "generate_predicate should not change i_o");
1407 assert(old_mem == new_map->memory(), "generate_predicate should not change memory");
1408 assert(old_exc == new_map->next_exception(), "generate_predicate should not add exceptions");
1409 #endif
1410 if (!kit.stopped()) {
1411 PreserveJVMState pjvms(&kit);
1412 // Generate intrinsic code:
1413 JVMState* new_jvms = _intrinsic->generate(kit.sync_jvms());
1414 if (new_jvms == nullptr) {
1415 // Intrinsic failed, use normal compilation path for this predicate.
1416 slow_region->add_req(kit.control());
1417 } else {
1418 kit.add_exception_states_from(new_jvms);
1419 kit.set_jvms(new_jvms);
1420 if (!kit.stopped()) {
1421 result_jvms[results++] = kit.jvms();
1422 }
1423 }
1424 }
1425 if (else_ctrl == nullptr) {
1426 else_ctrl = kit.C->top();
1427 }
1428 kit.set_control(else_ctrl);
1429 }
1430 if (!kit.stopped()) {
1431 // Final 'else' after predicates.
1432 slow_region->add_req(kit.control());
1433 }
1434 if (slow_region->req() > 1) {
1435 PreserveJVMState pjvms(&kit);
1436 // Generate normal compilation code:
1437 kit.set_control(gvn.transform(slow_region));
1438 JVMState* new_jvms = _cg->generate(kit.sync_jvms());
1439 if (kit.failing())
1440 return nullptr; // might happen because of NodeCountInliningCutoff
1441 assert(new_jvms != nullptr, "must be");
1442 kit.add_exception_states_from(new_jvms);
1443 kit.set_jvms(new_jvms);
1444 if (!kit.stopped()) {
1445 result_jvms[results++] = kit.jvms();
1446 }
1447 }
1448
1449 if (results == 0) {
1450 // All paths ended in uncommon traps.
1451 (void) kit.stop();
1452 return kit.transfer_exceptions_into_jvms();
1453 }
1454
1455 if (results == 1) { // Only one path
1456 kit.set_jvms(result_jvms[0]);
1457 return kit.transfer_exceptions_into_jvms();
1458 }
1459
1460 // Merge all paths.
1461 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
1462 RegionNode* region = new RegionNode(results + 1);
1463 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
1464 for (int i = 0; i < results; i++) {
1465 JVMState* jvms = result_jvms[i];
1466 int path = i + 1;
1467 SafePointNode* map = jvms->map();
1468 region->init_req(path, map->control());
1469 iophi->set_req(path, map->i_o());
1470 if (i == 0) {
1471 kit.set_jvms(jvms);
1472 } else {
1473 kit.merge_memory(map->merged_memory(), region, path);
1474 }
1475 }
1476 kit.set_control(gvn.transform(region));
1477 kit.set_i_o(gvn.transform(iophi));
1478 // Transform new memory Phis.
1479 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
1480 Node* phi = mms.memory();
1481 if (phi->is_Phi() && phi->in(0) == region) {
1482 mms.set_memory(gvn.transform(phi));
1483 }
1484 }
1485
1486 // Merge debug info.
1487 Node** ins = NEW_RESOURCE_ARRAY(Node*, results);
1488 uint tos = kit.jvms()->stkoff() + kit.sp();
1489 Node* map = kit.map();
1490 uint limit = map->req();
1491 for (uint i = TypeFunc::Parms; i < limit; i++) {
1492 // Skip unused stack slots; fast forward to monoff();
1493 if (i == tos) {
1494 i = kit.jvms()->monoff();
1495 if( i >= limit ) break;
1496 }
1497 Node* n = map->in(i);
1498 ins[0] = n;
1499 const Type* t = gvn.type(n);
1500 bool needs_phi = false;
1501 for (int j = 1; j < results; j++) {
1502 JVMState* jvms = result_jvms[j];
1503 Node* jmap = jvms->map();
1504 Node* m = nullptr;
1505 if (jmap->req() > i) {
1506 m = jmap->in(i);
1507 if (m != n) {
1508 needs_phi = true;
1509 t = t->meet_speculative(gvn.type(m));
1510 }
1511 }
1512 ins[j] = m;
1513 }
1514 if (needs_phi) {
1515 Node* phi = PhiNode::make(region, n, t);
1516 for (int j = 1; j < results; j++) {
1517 phi->set_req(j + 1, ins[j]);
1518 }
1519 map->set_req(i, gvn.transform(phi));
1520 }
1521 }
1522
1523 return kit.transfer_exceptions_into_jvms();
1524 }
1525
1526 //-------------------------UncommonTrapCallGenerator-----------------------------
1527 // Internal class which handles all out-of-line calls checking receiver type.
1528 class UncommonTrapCallGenerator : public CallGenerator {
1529 Deoptimization::DeoptReason _reason;
1530 Deoptimization::DeoptAction _action;
1531
1532 public:
1533 UncommonTrapCallGenerator(ciMethod* m,
1534 Deoptimization::DeoptReason reason,
1535 Deoptimization::DeoptAction action)
1536 : CallGenerator(m)
1537 {
1538 _reason = reason;
1539 _action = action;
1540 }
1541
1542 virtual bool is_virtual() const { ShouldNotReachHere(); return false; }
1543 virtual bool is_trap() const { return true; }
1544
1545 virtual JVMState* generate(JVMState* jvms);
1546 };
1547
1548
1549 CallGenerator*
1550 CallGenerator::for_uncommon_trap(ciMethod* m,
1551 Deoptimization::DeoptReason reason,
1552 Deoptimization::DeoptAction action) {
1553 return new UncommonTrapCallGenerator(m, reason, action);
1554 }
1555
1556
1557 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) {
1558 GraphKit kit(jvms);
1559 kit.C->print_inlining_update(this);
1560 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver).
1561 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
1562 // Use callsite signature always.
1563 ciMethod* declared_method = kit.method()->get_method_at_bci(kit.bci());
1564 int nargs = declared_method->arg_size();
1565 kit.inc_sp(nargs);
1566 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed");
1567 if (_reason == Deoptimization::Reason_class_check &&
1568 _action == Deoptimization::Action_maybe_recompile) {
1569 // Temp fix for 6529811
1570 // Don't allow uncommon_trap to override our decision to recompile in the event
1571 // of a class cast failure for a monomorphic call as it will never let us convert
1572 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops
1573 bool keep_exact_action = true;
1574 kit.uncommon_trap(_reason, _action, nullptr, "monomorphic vcall checkcast", false, keep_exact_action);
1575 } else {
1576 kit.uncommon_trap(_reason, _action);
1577 }
1578 return kit.transfer_exceptions_into_jvms();
1579 }
1580
1581 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.)
1582
1583 // (Node: Merged hook_up_exits into ParseGenerator::generate.)