1 /*
2 * Copyright (c) 1998, 2014, 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/ciCallSite.hpp"
27 #include "ci/ciMethodHandle.hpp"
28 #include "classfile/vmSymbols.hpp"
29 #include "compiler/compileBroker.hpp"
30 #include "compiler/compileLog.hpp"
31 #include "interpreter/linkResolver.hpp"
32 #include "opto/addnode.hpp"
33 #include "opto/callGenerator.hpp"
34 #include "opto/castnode.hpp"
35 #include "opto/cfgnode.hpp"
36 #include "opto/mulnode.hpp"
37 #include "opto/parse.hpp"
38 #include "opto/rootnode.hpp"
39 #include "opto/runtime.hpp"
40 #include "opto/subnode.hpp"
41 #include "prims/nativeLookup.hpp"
42 #include "runtime/sharedRuntime.hpp"
43
44 void trace_type_profile(Compile* C, ciMethod *method, int depth, int bci, ciMethod *prof_method, ciKlass *prof_klass, int site_count, int receiver_count) {
45 if (TraceTypeProfile || C->print_inlining()) {
46 outputStream* out = tty;
47 if (!C->print_inlining()) {
48 if (!PrintOpto && !PrintCompilation) {
49 method->print_short_name();
50 tty->cr();
51 }
52 CompileTask::print_inlining_tty(prof_method, depth, bci);
53 } else {
54 out = C->print_inlining_stream();
55 }
56 CompileTask::print_inline_indent(depth, out);
57 out->print(" \\-> TypeProfile (%d/%d counts) = ", receiver_count, site_count);
58 stringStream ss;
59 prof_klass->name()->print_symbol_on(&ss);
60 out->print("%s", ss.as_string());
61 out->cr();
62 }
63 }
64
65 CallGenerator* Compile::call_generator(ciMethod* callee, int vtable_index, bool call_does_dispatch,
66 JVMState* jvms, bool allow_inline, bool is_mh_inline,
67 float prof_factor, ciKlass* speculative_receiver_type,
68 bool allow_intrinsics, bool delayed_forbidden) {
69 ciMethod* caller = jvms->method();
70 int bci = jvms->bci();
71 Bytecodes::Code bytecode = caller->java_code_at_bci(bci);
72 guarantee(callee != NULL, "failed method resolution");
73
74 // Dtrace currently doesn't work unless all calls are vanilla
75 if (env()->dtrace_method_probes()) {
76 allow_inline = false;
77 }
78
79 // Note: When we get profiling during stage-1 compiles, we want to pull
80 // from more specific profile data which pertains to this inlining.
81 // Right now, ignore the information in jvms->caller(), and do method[bci].
82 ciCallProfile profile = caller->call_profile_at_bci(bci);
83
84 // See how many times this site has been invoked.
85 int site_count = profile.count();
86 int receiver_count = -1;
87 if (call_does_dispatch && UseTypeProfile && profile.has_receiver(0)) {
88 // Receivers in the profile structure are ordered by call counts
89 // so that the most called (major) receiver is profile.receiver(0).
90 receiver_count = profile.receiver_count(0);
91 }
92
93 CompileLog* log = this->log();
94 if (log != NULL) {
95 int rid = (receiver_count >= 0)? log->identify(profile.receiver(0)): -1;
96 int r2id = (rid != -1 && profile.has_receiver(1))? log->identify(profile.receiver(1)):-1;
97 log->begin_elem("call method='%d' count='%d' prof_factor='%f'",
98 log->identify(callee), site_count, prof_factor);
99 if (call_does_dispatch) log->print(" virtual='1'");
100 if (allow_inline) log->print(" inline='1'");
101 if (receiver_count >= 0) {
102 log->print(" receiver='%d' receiver_count='%d'", rid, receiver_count);
103 if (profile.has_receiver(1)) {
104 log->print(" receiver2='%d' receiver2_count='%d'", r2id, profile.receiver_count(1));
105 }
106 }
107 if (callee->is_method_handle_intrinsic()) {
108 log->print(" method_handle_intrinsic='1'");
109 }
110 log->end_elem();
111 }
112
113 // Special case the handling of certain common, profitable library
114 // methods. If these methods are replaced with specialized code,
115 // then we return it as the inlined version of the call.
116 // We do this before the strict f.p. check below because the
117 // intrinsics handle strict f.p. correctly.
118 CallGenerator* cg_intrinsic = NULL;
119 if (allow_inline && allow_intrinsics) {
120 CallGenerator* cg = find_intrinsic(callee, call_does_dispatch);
121 if (cg != NULL) {
122 if (cg->is_predicated()) {
123 // Code without intrinsic but, hopefully, inlined.
124 CallGenerator* inline_cg = this->call_generator(callee,
125 vtable_index, call_does_dispatch, jvms, allow_inline, false /* is_mh_inline */, prof_factor, speculative_receiver_type, false);
126 if (inline_cg != NULL) {
127 cg = CallGenerator::for_predicated_intrinsic(cg, inline_cg);
128 }
129 }
130
131 // If intrinsic does the virtual dispatch, we try to use the type profile
132 // first, and hopefully inline it as the regular virtual call below.
133 // We will retry the intrinsic if nothing had claimed it afterwards.
134 if (cg->does_virtual_dispatch()) {
135 cg_intrinsic = cg;
136 cg = NULL;
137 } else {
138 return cg;
139 }
140 }
141 }
142
143 // Do method handle calls.
144 // NOTE: This must happen before normal inlining logic below since
145 // MethodHandle.invoke* are native methods which obviously don't
146 // have bytecodes and so normal inlining fails.
147 if (callee->is_method_handle_intrinsic()) {
148 CallGenerator* cg = CallGenerator::for_method_handle_call(jvms, caller, callee, delayed_forbidden);
149 assert(cg == NULL || !delayed_forbidden || !cg->is_late_inline() || cg->is_mh_late_inline(), "unexpected CallGenerator");
150 return cg;
151 }
152
153 // Do not inline strict fp into non-strict code, or the reverse
154 if (caller->is_strict() ^ callee->is_strict()) {
155 allow_inline = false;
156 }
157
158 // Attempt to inline...
159 if (allow_inline) {
160 // The profile data is only partly attributable to this caller,
161 // scale back the call site information.
162 float past_uses = jvms->method()->scale_count(site_count, prof_factor);
163 // This is the number of times we expect the call code to be used.
164 float expected_uses = past_uses;
165
166 // Try inlining a bytecoded method:
167 if (!call_does_dispatch) {
168 InlineTree* ilt = InlineTree::find_subtree_from_root(this->ilt(), jvms->caller(), jvms->method());
169 WarmCallInfo scratch_ci;
170 bool should_delay = false;
171 WarmCallInfo* ci = ilt->ok_to_inline(callee, jvms, profile, &scratch_ci, should_delay, is_mh_inline);
172 assert(ci != &scratch_ci, "do not let this pointer escape");
173 bool allow_inline = (ci != NULL && !ci->is_cold());
174 bool require_inline = (allow_inline && ci->is_hot());
175
176 if (allow_inline) {
177 CallGenerator* cg = CallGenerator::for_inline(callee, expected_uses);
178
179 if (require_inline && cg != NULL) {
180 // Delay the inlining of this method to give us the
181 // opportunity to perform some high level optimizations
182 // first.
183 if (should_delay_string_inlining(callee, jvms)) {
184 assert(!delayed_forbidden, "strange");
185 return CallGenerator::for_string_late_inline(callee, cg);
186 } else if (should_delay_boxing_inlining(callee, jvms)) {
187 assert(!delayed_forbidden, "strange");
188 return CallGenerator::for_boxing_late_inline(callee, cg);
189 } else if ((should_delay || AlwaysIncrementalInline) && !delayed_forbidden) {
190 return CallGenerator::for_late_inline(callee, cg);
191 }
192 }
193 if (cg == NULL || should_delay) {
194 // Fall through.
195 } else if (require_inline || !InlineWarmCalls) {
196 return cg;
197 } else {
198 CallGenerator* cold_cg = call_generator(callee, vtable_index, call_does_dispatch, jvms, false /* is_mh_inline */, is_mh_inline, prof_factor);
199 return CallGenerator::for_warm_call(ci, cold_cg, cg);
200 }
201 }
202 }
203
204 // Try using the type profile.
205 if (call_does_dispatch && site_count > 0 && receiver_count > 0) {
206 // The major receiver's count >= TypeProfileMajorReceiverPercent of site_count.
207 bool have_major_receiver = (100.*profile.receiver_prob(0) >= (float)TypeProfileMajorReceiverPercent);
208 ciMethod* receiver_method = NULL;
209
210 int morphism = profile.morphism();
211 if (speculative_receiver_type != NULL) {
212 if (!too_many_traps(caller, bci, Deoptimization::Reason_speculate_class_check)) {
213 // We have a speculative type, we should be able to resolve
214 // the call. We do that before looking at the profiling at
215 // this invoke because it may lead to bimorphic inlining which
216 // a speculative type should help us avoid.
217 receiver_method = callee->resolve_invoke(jvms->method()->holder(),
218 speculative_receiver_type);
219 if (receiver_method == NULL) {
220 speculative_receiver_type = NULL;
221 } else {
222 morphism = 1;
223 }
224 } else {
225 // speculation failed before. Use profiling at the call
226 // (could allow bimorphic inlining for instance).
227 speculative_receiver_type = NULL;
228 }
229 }
230 if (receiver_method == NULL &&
231 (have_major_receiver || morphism == 1 ||
232 (morphism == 2 && UseBimorphicInlining))) {
233 // receiver_method = profile.method();
234 // Profiles do not suggest methods now. Look it up in the major receiver.
235 receiver_method = callee->resolve_invoke(jvms->method()->holder(),
236 profile.receiver(0));
237 }
238 if (receiver_method != NULL) {
239 // The single majority receiver sufficiently outweighs the minority.
240 CallGenerator* hit_cg = this->call_generator(receiver_method,
241 vtable_index, !call_does_dispatch, jvms, allow_inline, false /* is_mh_inline */, prof_factor);
242 if (hit_cg != NULL) {
243 // Look up second receiver.
244 CallGenerator* next_hit_cg = NULL;
245 ciMethod* next_receiver_method = NULL;
246 if (morphism == 2 && UseBimorphicInlining) {
247 next_receiver_method = callee->resolve_invoke(jvms->method()->holder(),
248 profile.receiver(1));
249 if (next_receiver_method != NULL) {
250 next_hit_cg = this->call_generator(next_receiver_method,
251 vtable_index, !call_does_dispatch, jvms,
252 allow_inline, false /* is_mh_inline */, prof_factor);
253 if (next_hit_cg != NULL && !next_hit_cg->is_inline() &&
254 have_major_receiver && UseOnlyInlinedBimorphic) {
255 // Skip if we can't inline second receiver's method
256 next_hit_cg = NULL;
257 }
258 }
259 }
260 CallGenerator* miss_cg;
261 Deoptimization::DeoptReason reason = morphism == 2 ?
262 Deoptimization::Reason_bimorphic : Deoptimization::reason_class_check(speculative_receiver_type != NULL);
263 if ((morphism == 1 || (morphism == 2 && next_hit_cg != NULL)) &&
264 !too_many_traps(caller, bci, reason)
265 ) {
266 // Generate uncommon trap for class check failure path
267 // in case of monomorphic or bimorphic virtual call site.
268 miss_cg = CallGenerator::for_uncommon_trap(callee, reason,
269 Deoptimization::Action_maybe_recompile);
270 } else {
271 // Generate virtual call for class check failure path
272 // in case of polymorphic virtual call site.
273 miss_cg = CallGenerator::for_virtual_call(callee, vtable_index);
274 }
275 if (miss_cg != NULL) {
276 if (next_hit_cg != NULL) {
277 assert(speculative_receiver_type == NULL, "shouldn't end up here if we used speculation");
278 trace_type_profile(C, jvms->method(), jvms->depth() - 1, jvms->bci(), next_receiver_method, profile.receiver(1), site_count, profile.receiver_count(1));
279 // We don't need to record dependency on a receiver here and below.
280 // Whenever we inline, the dependency is added by Parse::Parse().
281 miss_cg = CallGenerator::for_predicted_call(profile.receiver(1), miss_cg, next_hit_cg, PROB_MAX);
282 }
283 if (miss_cg != NULL) {
284 trace_type_profile(C, jvms->method(), jvms->depth() - 1, jvms->bci(), receiver_method, profile.receiver(0), site_count, receiver_count);
285 ciKlass* k = speculative_receiver_type != NULL ? speculative_receiver_type : profile.receiver(0);
286 float hit_prob = speculative_receiver_type != NULL ? 1.0 : profile.receiver_prob(0);
287 CallGenerator* cg = CallGenerator::for_predicted_call(k, miss_cg, hit_cg, hit_prob);
288 if (cg != NULL) return cg;
289 }
290 }
291 }
292 }
293 }
294 }
295
296 // Nothing claimed the intrinsic, we go with straight-forward inlining
297 // for already discovered intrinsic.
298 if (allow_inline && allow_intrinsics && cg_intrinsic != NULL) {
299 assert(cg_intrinsic->does_virtual_dispatch(), "sanity");
300 return cg_intrinsic;
301 }
302
303 // There was no special inlining tactic, or it bailed out.
304 // Use a more generic tactic, like a simple call.
305 if (call_does_dispatch) {
306 const char* msg = "virtual call";
307 if (PrintInlining) print_inlining(callee, jvms->depth() - 1, jvms->bci(), msg);
308 C->log_inline_failure(msg);
309 return CallGenerator::for_virtual_call(callee, vtable_index);
310 } else {
311 // Class Hierarchy Analysis or Type Profile reveals a unique target,
312 // or it is a static or special call.
313 return CallGenerator::for_direct_call(callee, should_delay_inlining(callee, jvms));
314 }
315 }
316
317 // Return true for methods that shouldn't be inlined early so that
318 // they are easier to analyze and optimize as intrinsics.
319 bool Compile::should_delay_string_inlining(ciMethod* call_method, JVMState* jvms) {
320 if (has_stringbuilder()) {
321
322 if ((call_method->holder() == C->env()->StringBuilder_klass() ||
323 call_method->holder() == C->env()->StringBuffer_klass()) &&
324 (jvms->method()->holder() == C->env()->StringBuilder_klass() ||
325 jvms->method()->holder() == C->env()->StringBuffer_klass())) {
326 // Delay SB calls only when called from non-SB code
327 return false;
328 }
329
330 switch (call_method->intrinsic_id()) {
331 case vmIntrinsics::_StringBuilder_void:
332 case vmIntrinsics::_StringBuilder_int:
333 case vmIntrinsics::_StringBuilder_String:
334 case vmIntrinsics::_StringBuilder_append_char:
335 case vmIntrinsics::_StringBuilder_append_int:
336 case vmIntrinsics::_StringBuilder_append_String:
337 case vmIntrinsics::_StringBuilder_toString:
338 case vmIntrinsics::_StringBuffer_void:
339 case vmIntrinsics::_StringBuffer_int:
340 case vmIntrinsics::_StringBuffer_String:
341 case vmIntrinsics::_StringBuffer_append_char:
342 case vmIntrinsics::_StringBuffer_append_int:
343 case vmIntrinsics::_StringBuffer_append_String:
344 case vmIntrinsics::_StringBuffer_toString:
345 case vmIntrinsics::_Integer_toString:
346 return true;
347
348 case vmIntrinsics::_String_String:
349 {
350 Node* receiver = jvms->map()->in(jvms->argoff() + 1);
351 if (receiver->is_Proj() && receiver->in(0)->is_CallStaticJava()) {
352 CallStaticJavaNode* csj = receiver->in(0)->as_CallStaticJava();
353 ciMethod* m = csj->method();
354 if (m != NULL &&
355 (m->intrinsic_id() == vmIntrinsics::_StringBuffer_toString ||
356 m->intrinsic_id() == vmIntrinsics::_StringBuilder_toString))
357 // Delay String.<init>(new SB())
358 return true;
359 }
360 return false;
361 }
362
363 default:
364 return false;
365 }
366 }
367 return false;
368 }
369
370 bool Compile::should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms) {
371 if (eliminate_boxing() && call_method->is_boxing_method()) {
372 set_has_boxed_value(true);
373 return aggressive_unboxing();
374 }
375 return false;
376 }
377
378 // uncommon-trap call-sites where callee is unloaded, uninitialized or will not link
379 bool Parse::can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass* klass) {
380 // Additional inputs to consider...
381 // bc = bc()
382 // caller = method()
383 // iter().get_method_holder_index()
384 assert( dest_method->is_loaded(), "ciTypeFlow should not let us get here" );
385 // Interface classes can be loaded & linked and never get around to
386 // being initialized. Uncommon-trap for not-initialized static or
387 // v-calls. Let interface calls happen.
388 ciInstanceKlass* holder_klass = dest_method->holder();
389 if (!holder_klass->is_being_initialized() &&
390 !holder_klass->is_initialized() &&
391 !holder_klass->is_interface()) {
392 uncommon_trap(Deoptimization::Reason_uninitialized,
393 Deoptimization::Action_reinterpret,
394 holder_klass);
395 return true;
396 }
397
398 assert(dest_method->is_loaded(), "dest_method: typeflow responsibility");
399 return false;
400 }
401
402 #ifdef ASSERT
403 static bool check_type(ciType* t1, ciType* t2) {
404 // Either oop-oop or prim-prim pair.
405 if (t1->is_primitive_type() && t2->is_primitive_type()) {
406 return t1->size() == t2->size(); // argument sizes should match
407 } else {
408 return !t1->is_primitive_type() && !t2->is_primitive_type(); // oop-oop
409 }
410 }
411
412 static bool check_inlined_mh_linker_info(ciMethod* symbolic_info, ciMethod* resolved_method) {
413 assert(symbolic_info->is_method_handle_intrinsic(), "sanity");
414 assert(!resolved_method->is_method_handle_intrinsic(), "sanity");
415
416 if (!symbolic_info->is_loaded() || !resolved_method->is_loaded()) {
417 return true; // Don't compare unloaded methods.
418 }
419 // Linkers have appendix argument which is not passed to callee.
420 int has_appendix = MethodHandles::has_member_arg(symbolic_info->intrinsic_id()) ? 1 : 0;
421 if (symbolic_info->arg_size() != (resolved_method->arg_size() + has_appendix)) {
422 return false; // Total size of arguments on stack mismatch.
423 }
424 if (!symbolic_info->return_type()->is_void()) {
425 // Only check the return type if the symbolic method is not void
426 // i.e. the return value of the resolved method can be dropped
427 if (!check_type(symbolic_info->return_type(), resolved_method->return_type())) {
428 return false; // Return value size or type mismatch encountered.
429 }
430 }
431
432 switch (symbolic_info->intrinsic_id()) {
433 case vmIntrinsics::_linkToVirtual:
434 case vmIntrinsics::_linkToInterface:
435 case vmIntrinsics::_linkToSpecial: {
436 if (resolved_method->is_static()) return false;
437 break;
438 }
439 case vmIntrinsics::_linkToStatic: {
440 if (!resolved_method->is_static()) return false;
441 break;
442 }
443 }
444
445 ciSignature* symbolic_sig = symbolic_info->signature();
446 ciSignature* resolved_sig = resolved_method->signature();
447
448 if (symbolic_sig->count() + (symbolic_info->is_static() ? 0 : 1) !=
449 resolved_sig->count() + (resolved_method->is_static() ? 0 : 1) + has_appendix) {
450 return false; // Argument count mismatch
451 }
452
453 int sbase = 0, rbase = 0;
454 int arg_count = MIN2(symbolic_sig->count() - has_appendix, resolved_sig->count());
455 ciType* recv_type = NULL;
456 if (symbolic_info->is_static() && !resolved_method->is_static()) {
457 recv_type = symbolic_sig->type_at(0);
458 sbase = 1;
459 } else if (!symbolic_info->is_static() && resolved_method->is_static()) {
460 recv_type = resolved_sig->type_at(0);
461 rbase = 1;
462 }
463 if (recv_type != NULL && recv_type->is_primitive_type()) {
464 return false; // Receiver should be an oop.
465 }
466 for (int i = 0; i < arg_count; i++) {
467 if (!check_type(symbolic_sig->type_at(sbase + i), resolved_sig->type_at(rbase + i))) {
468 return false; // Argument size or type mismatch encountered.
469 }
470 }
471 return true;
472 }
473
474 static bool is_call_consistent_with_jvms(JVMState* jvms, CallGenerator* cg) {
475 ciMethod* symbolic_info = jvms->method()->get_method_at_bci(jvms->bci());
476 ciMethod* resolved_method = cg->method();
477
478 if (CallGenerator::is_inlined_mh_linker(jvms, resolved_method)) {
479 return check_inlined_mh_linker_info(symbolic_info, resolved_method);
480 } else {
481 // Method name & descriptor should stay the same.
482 return (symbolic_info->get_Method()->name() == resolved_method->get_Method()->name()) &&
483 (symbolic_info->get_Method()->signature() == resolved_method->get_Method()->signature());
484 }
485 }
486
487 static bool check_call_consistency(JVMState* jvms, CallGenerator* cg) {
488 if (!is_call_consistent_with_jvms(jvms, cg)) {
489 tty->print_cr("JVMS:");
490 jvms->dump();
491 tty->print_cr("Bytecode info:");
492 jvms->method()->get_method_at_bci(jvms->bci())->print(); tty->cr();
493 tty->print_cr("Resolved method:");
494 cg->method()->print(); tty->cr();
495 return false;
496 }
497 return true;
498 }
499 #endif // ASSERT
500
501 //------------------------------do_call----------------------------------------
502 // Handle your basic call. Inline if we can & want to, else just setup call.
503 void Parse::do_call() {
504 // It's likely we are going to add debug info soon.
505 // Also, if we inline a guy who eventually needs debug info for this JVMS,
506 // our contribution to it is cleaned up right here.
507 kill_dead_locals();
508
509 C->print_inlining_assert_ready();
510
511 // Set frequently used booleans
512 const bool is_virtual = bc() == Bytecodes::_invokevirtual;
513 const bool is_virtual_or_interface = is_virtual || bc() == Bytecodes::_invokeinterface;
514 const bool has_receiver = Bytecodes::has_receiver(bc());
515
516 // Find target being called
517 bool will_link;
518 ciSignature* declared_signature = NULL;
519 ciMethod* orig_callee = iter().get_method(will_link, &declared_signature); // callee in the bytecode
520 ciInstanceKlass* holder_klass = orig_callee->holder();
521 ciKlass* holder = iter().get_declared_method_holder();
522 ciInstanceKlass* klass = ciEnv::get_instance_klass_for_declared_method_holder(holder);
523 assert(declared_signature != NULL, "cannot be null");
524
525 // Bump max node limit for JSR292 users
526 if (bc() == Bytecodes::_invokedynamic || orig_callee->is_method_handle_intrinsic()) {
527 C->set_max_node_limit(3*MaxNodeLimit);
528 }
529
530 // uncommon-trap when callee is unloaded, uninitialized or will not link
531 // bailout when too many arguments for register representation
532 if (!will_link || can_not_compile_call_site(orig_callee, klass)) {
533 if (PrintOpto && (Verbose || WizardMode)) {
534 method()->print_name(); tty->print_cr(" can not compile call at bci %d to:", bci());
535 orig_callee->print_name(); tty->cr();
536 }
537 return;
538 }
539 assert(holder_klass->is_loaded(), "");
540 //assert((bc_callee->is_static() || is_invokedynamic) == !has_receiver , "must match bc"); // XXX invokehandle (cur_bc_raw)
541 // Note: this takes into account invokeinterface of methods declared in java/lang/Object,
542 // which should be invokevirtuals but according to the VM spec may be invokeinterfaces
543 assert(holder_klass->is_interface() || holder_klass->super() == NULL || (bc() != Bytecodes::_invokeinterface), "must match bc");
544 // Note: In the absence of miranda methods, an abstract class K can perform
545 // an invokevirtual directly on an interface method I.m if K implements I.
546
547 // orig_callee is the resolved callee which's signature includes the
548 // appendix argument.
549 const int nargs = orig_callee->arg_size();
550 const bool is_signature_polymorphic = MethodHandles::is_signature_polymorphic(orig_callee->intrinsic_id());
551
552 // Push appendix argument (MethodType, CallSite, etc.), if one.
553 if (iter().has_appendix()) {
554 ciObject* appendix_arg = iter().get_appendix();
555 const TypeOopPtr* appendix_arg_type = TypeOopPtr::make_from_constant(appendix_arg);
556 Node* appendix_arg_node = _gvn.makecon(appendix_arg_type);
557 push(appendix_arg_node);
558 }
559
560 // ---------------------
561 // Does Class Hierarchy Analysis reveal only a single target of a v-call?
562 // Then we may inline or make a static call, but become dependent on there being only 1 target.
563 // Does the call-site type profile reveal only one receiver?
564 // Then we may introduce a run-time check and inline on the path where it succeeds.
565 // The other path may uncommon_trap, check for another receiver, or do a v-call.
566
567 // Try to get the most accurate receiver type
568 ciMethod* callee = orig_callee;
569 int vtable_index = Method::invalid_vtable_index;
570 bool call_does_dispatch = false;
571
572 // Speculative type of the receiver if any
573 ciKlass* speculative_receiver_type = NULL;
574 if (is_virtual_or_interface) {
575 Node* receiver_node = stack(sp() - nargs);
576 const TypeOopPtr* receiver_type = _gvn.type(receiver_node)->isa_oopptr();
577 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
578 // For arrays, klass below is Object. When vtable calls are used,
579 // resolving the call with Object would allow an illegal call to
580 // finalize() on an array. We use holder instead: illegal calls to
581 // finalize() won't be compiled as vtable calls (IC call
582 // resolution will catch the illegal call) and the few legal calls
583 // on array types won't be either.
584 callee = C->optimize_virtual_call(method(), bci(), klass, holder, orig_callee,
585 receiver_type, is_virtual,
586 call_does_dispatch, vtable_index); // out-parameters
587 speculative_receiver_type = receiver_type != NULL ? receiver_type->speculative_type() : NULL;
588 }
589
590 // Note: It's OK to try to inline a virtual call.
591 // The call generator will not attempt to inline a polymorphic call
592 // unless it knows how to optimize the receiver dispatch.
593 bool try_inline = (C->do_inlining() || InlineAccessors);
594
595 // ---------------------
596 dec_sp(nargs); // Temporarily pop args for JVM state of call
597 JVMState* jvms = sync_jvms();
598
599 // ---------------------
600 // Decide call tactic.
601 // This call checks with CHA, the interpreter profile, intrinsics table, etc.
602 // It decides whether inlining is desirable or not.
603 CallGenerator* cg = C->call_generator(callee, vtable_index, call_does_dispatch, jvms, try_inline, false /* is_mh_inline */, prof_factor(), speculative_receiver_type);
604
605 // NOTE: Don't use orig_callee and callee after this point! Use cg->method() instead.
606 orig_callee = callee = NULL;
607
608 // ---------------------
609 // Round double arguments before call
610 round_double_arguments(cg->method());
611
612 // Feed profiling data for arguments to the type system so it can
613 // propagate it as speculative types
614 record_profiled_arguments_for_speculation(cg->method(), bc());
615
616 #ifndef PRODUCT
617 // bump global counters for calls
618 count_compiled_calls(/*at_method_entry*/ false, cg->is_inline());
619
620 // Record first part of parsing work for this call
621 parse_histogram()->record_change();
622 #endif // not PRODUCT
623
624 assert(jvms == this->jvms(), "still operating on the right JVMS");
625 assert(jvms_in_sync(), "jvms must carry full info into CG");
626
627 // save across call, for a subsequent cast_not_null.
628 Node* receiver = has_receiver ? argument(0) : NULL;
629
630 // The extra CheckCastPP for speculative types mess with PhaseStringOpts
631 if (receiver != NULL && !call_does_dispatch && !cg->is_string_late_inline()) {
632 // Feed profiling data for a single receiver to the type system so
633 // it can propagate it as a speculative type
634 receiver = record_profiled_receiver_for_speculation(receiver);
635 }
636
637 // Bump method data counters (We profile *before* the call is made
638 // because exceptions don't return to the call site.)
639 profile_call(receiver);
640
641 JVMState* new_jvms = cg->generate(jvms);
642 if (new_jvms == NULL) {
643 // When inlining attempt fails (e.g., too many arguments),
644 // it may contaminate the current compile state, making it
645 // impossible to pull back and try again. Once we call
646 // cg->generate(), we are committed. If it fails, the whole
647 // compilation task is compromised.
648 if (failing()) return;
649
650 // This can happen if a library intrinsic is available, but refuses
651 // the call site, perhaps because it did not match a pattern the
652 // intrinsic was expecting to optimize. Should always be possible to
653 // get a normal java call that may inline in that case
654 cg = C->call_generator(cg->method(), vtable_index, call_does_dispatch, jvms, try_inline, false /* is_mh_inline */, prof_factor(), speculative_receiver_type, /* allow_intrinsics= */ false);
655 new_jvms = cg->generate(jvms);
656 if (new_jvms == NULL) {
657 guarantee(failing(), "call failed to generate: calls should work");
658 return;
659 }
660 }
661
662 if (cg->is_inline()) {
663 // Accumulate has_loops estimate
664 C->set_has_loops(C->has_loops() || cg->method()->has_loops());
665 C->env()->notice_inlined_method(cg->method());
666 }
667
668 // Reset parser state from [new_]jvms, which now carries results of the call.
669 // Return value (if any) is already pushed on the stack by the cg.
670 add_exception_states_from(new_jvms);
671 if (new_jvms->map()->control() == top()) {
672 stop_and_kill_map();
673 } else {
674 assert(new_jvms->same_calls_as(jvms), "method/bci left unchanged");
675 set_jvms(new_jvms);
676 }
677
678 assert(check_call_consistency(jvms, cg), "inconsistent info");
679
680 if (!stopped()) {
681 // This was some sort of virtual call, which did a null check for us.
682 // Now we can assert receiver-not-null, on the normal return path.
683 if (receiver != NULL && cg->is_virtual()) {
684 Node* cast = cast_not_null(receiver);
685 // %%% assert(receiver == cast, "should already have cast the receiver");
686 }
687
688 // Round double result after a call from strict to non-strict code
689 round_double_result(cg->method());
690
691 ciType* rtype = cg->method()->return_type();
692 ciType* ctype = declared_signature->return_type();
693
694 if (Bytecodes::has_optional_appendix(iter().cur_bc_raw()) || is_signature_polymorphic) {
695 // Be careful here with return types.
696 if (ctype != rtype) {
697 BasicType rt = rtype->basic_type();
698 BasicType ct = ctype->basic_type();
699 if (ct == T_VOID) {
700 // It's OK for a method to return a value that is discarded.
701 // The discarding does not require any special action from the caller.
702 // The Java code knows this, at VerifyType.isNullConversion.
703 pop_node(rt); // whatever it was, pop it
704 } else if (rt == T_INT || is_subword_type(rt)) {
705 // Nothing. These cases are handled in lambda form bytecode.
706 assert(ct == T_INT || is_subword_type(ct), "must match: rt=%s, ct=%s", type2name(rt), type2name(ct));
707 } else if (rt == T_OBJECT || rt == T_ARRAY) {
708 assert(ct == T_OBJECT || ct == T_ARRAY, "rt=%s, ct=%s", type2name(rt), type2name(ct));
709 if (ctype->is_loaded()) {
710 const TypeOopPtr* arg_type = TypeOopPtr::make_from_klass(rtype->as_klass());
711 const Type* sig_type = TypeOopPtr::make_from_klass(ctype->as_klass());
712 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) {
713 Node* retnode = pop();
714 Node* cast_obj = _gvn.transform(new CheckCastPPNode(control(), retnode, sig_type));
715 push(cast_obj);
716 }
717 }
718 } else {
719 assert(rt == ct, "unexpected mismatch: rt=%s, ct=%s", type2name(rt), type2name(ct));
720 // push a zero; it's better than getting an oop/int mismatch
721 pop_node(rt);
722 Node* retnode = zerocon(ct);
723 push_node(ct, retnode);
724 }
725 // Now that the value is well-behaved, continue with the call-site type.
726 rtype = ctype;
727 }
728 } else {
729 // Symbolic resolution enforces the types to be the same.
730 // NOTE: We must relax the assert for unloaded types because two
731 // different ciType instances of the same unloaded class type
732 // can appear to be "loaded" by different loaders (depending on
733 // the accessing class).
734 assert(!rtype->is_loaded() || !ctype->is_loaded() || rtype == ctype,
735 "mismatched return types: rtype=%s, ctype=%s", rtype->name(), ctype->name());
736 }
737
738 // If the return type of the method is not loaded, assert that the
739 // value we got is a null. Otherwise, we need to recompile.
740 if (!rtype->is_loaded()) {
741 if (PrintOpto && (Verbose || WizardMode)) {
742 method()->print_name(); tty->print_cr(" asserting nullness of result at bci: %d", bci());
743 cg->method()->print_name(); tty->cr();
744 }
745 if (C->log() != NULL) {
746 C->log()->elem("assert_null reason='return' klass='%d'",
747 C->log()->identify(rtype));
748 }
749 // If there is going to be a trap, put it at the next bytecode:
750 set_bci(iter().next_bci());
751 null_assert(peek());
752 set_bci(iter().cur_bci()); // put it back
753 }
754 BasicType ct = ctype->basic_type();
755 if (ct == T_OBJECT || ct == T_ARRAY) {
756 record_profiled_return_for_speculation();
757 }
758 }
759
760 // Restart record of parsing work after possible inlining of call
761 #ifndef PRODUCT
762 parse_histogram()->set_initial_state(bc());
763 #endif
764 }
765
766 //---------------------------catch_call_exceptions-----------------------------
767 // Put a Catch and CatchProj nodes behind a just-created call.
768 // Send their caught exceptions to the proper handler.
769 // This may be used after a call to the rethrow VM stub,
770 // when it is needed to process unloaded exception classes.
771 void Parse::catch_call_exceptions(ciExceptionHandlerStream& handlers) {
772 // Exceptions are delivered through this channel:
773 Node* i_o = this->i_o();
774
775 // Add a CatchNode.
776 GrowableArray<int>* bcis = new (C->node_arena()) GrowableArray<int>(C->node_arena(), 8, 0, -1);
777 GrowableArray<const Type*>* extypes = new (C->node_arena()) GrowableArray<const Type*>(C->node_arena(), 8, 0, NULL);
778 GrowableArray<int>* saw_unloaded = new (C->node_arena()) GrowableArray<int>(C->node_arena(), 8, 0, 0);
779
780 for (; !handlers.is_done(); handlers.next()) {
781 ciExceptionHandler* h = handlers.handler();
782 int h_bci = h->handler_bci();
783 ciInstanceKlass* h_klass = h->is_catch_all() ? env()->Throwable_klass() : h->catch_klass();
784 // Do not introduce unloaded exception types into the graph:
785 if (!h_klass->is_loaded()) {
786 if (saw_unloaded->contains(h_bci)) {
787 /* We've already seen an unloaded exception with h_bci,
788 so don't duplicate. Duplication will cause the CatchNode to be
789 unnecessarily large. See 4713716. */
790 continue;
791 } else {
792 saw_unloaded->append(h_bci);
793 }
794 }
795 const Type* h_extype = TypeOopPtr::make_from_klass(h_klass);
796 // (We use make_from_klass because it respects UseUniqueSubclasses.)
797 h_extype = h_extype->join(TypeInstPtr::NOTNULL);
798 assert(!h_extype->empty(), "sanity");
799 // Note: It's OK if the BCIs repeat themselves.
800 bcis->append(h_bci);
801 extypes->append(h_extype);
802 }
803
804 int len = bcis->length();
805 CatchNode *cn = new CatchNode(control(), i_o, len+1);
806 Node *catch_ = _gvn.transform(cn);
807
808 // now branch with the exception state to each of the (potential)
809 // handlers
810 for(int i=0; i < len; i++) {
811 // Setup JVM state to enter the handler.
812 PreserveJVMState pjvms(this);
813 // Locals are just copied from before the call.
814 // Get control from the CatchNode.
815 int handler_bci = bcis->at(i);
816 Node* ctrl = _gvn.transform( new CatchProjNode(catch_, i+1,handler_bci));
817 // This handler cannot happen?
818 if (ctrl == top()) continue;
819 set_control(ctrl);
820
821 // Create exception oop
822 const TypeInstPtr* extype = extypes->at(i)->is_instptr();
823 Node *ex_oop = _gvn.transform(new CreateExNode(extypes->at(i), ctrl, i_o));
824
825 // Handle unloaded exception classes.
826 if (saw_unloaded->contains(handler_bci)) {
827 // An unloaded exception type is coming here. Do an uncommon trap.
828 #ifndef PRODUCT
829 // We do not expect the same handler bci to take both cold unloaded
830 // and hot loaded exceptions. But, watch for it.
831 if ((Verbose || WizardMode) && extype->is_loaded()) {
832 tty->print("Warning: Handler @%d takes mixed loaded/unloaded exceptions in ", bci());
833 method()->print_name(); tty->cr();
834 } else if (PrintOpto && (Verbose || WizardMode)) {
835 tty->print("Bailing out on unloaded exception type ");
836 extype->klass()->print_name();
837 tty->print(" at bci:%d in ", bci());
838 method()->print_name(); tty->cr();
839 }
840 #endif
841 // Emit an uncommon trap instead of processing the block.
842 set_bci(handler_bci);
843 push_ex_oop(ex_oop);
844 uncommon_trap(Deoptimization::Reason_unloaded,
845 Deoptimization::Action_reinterpret,
846 extype->klass(), "!loaded exception");
847 set_bci(iter().cur_bci()); // put it back
848 continue;
849 }
850
851 // go to the exception handler
852 if (handler_bci < 0) { // merge with corresponding rethrow node
853 throw_to_exit(make_exception_state(ex_oop));
854 } else { // Else jump to corresponding handle
855 push_ex_oop(ex_oop); // Clear stack and push just the oop.
856 merge_exception(handler_bci);
857 }
858 }
859
860 // The first CatchProj is for the normal return.
861 // (Note: If this is a call to rethrow_Java, this node goes dead.)
862 set_control(_gvn.transform( new CatchProjNode(catch_, CatchProjNode::fall_through_index, CatchProjNode::no_handler_bci)));
863 }
864
865
866 //----------------------------catch_inline_exceptions--------------------------
867 // Handle all exceptions thrown by an inlined method or individual bytecode.
868 // Common case 1: we have no handler, so all exceptions merge right into
869 // the rethrow case.
870 // Case 2: we have some handlers, with loaded exception klasses that have
871 // no subklasses. We do a Deutsch-Shiffman style type-check on the incoming
872 // exception oop and branch to the handler directly.
873 // Case 3: We have some handlers with subklasses or are not loaded at
874 // compile-time. We have to call the runtime to resolve the exception.
875 // So we insert a RethrowCall and all the logic that goes with it.
876 void Parse::catch_inline_exceptions(SafePointNode* ex_map) {
877 // Caller is responsible for saving away the map for normal control flow!
878 assert(stopped(), "call set_map(NULL) first");
879 assert(method()->has_exception_handlers(), "don't come here w/o work to do");
880
881 Node* ex_node = saved_ex_oop(ex_map);
882 if (ex_node == top()) {
883 // No action needed.
884 return;
885 }
886 const TypeInstPtr* ex_type = _gvn.type(ex_node)->isa_instptr();
887 NOT_PRODUCT(if (ex_type==NULL) tty->print_cr("*** Exception not InstPtr"));
888 if (ex_type == NULL)
889 ex_type = TypeOopPtr::make_from_klass(env()->Throwable_klass())->is_instptr();
890
891 // determine potential exception handlers
892 ciExceptionHandlerStream handlers(method(), bci(),
893 ex_type->klass()->as_instance_klass(),
894 ex_type->klass_is_exact());
895
896 // Start executing from the given throw state. (Keep its stack, for now.)
897 // Get the exception oop as known at compile time.
898 ex_node = use_exception_state(ex_map);
899
900 // Get the exception oop klass from its header
901 Node* ex_klass_node = NULL;
902 if (has_ex_handler() && !ex_type->klass_is_exact()) {
903 Node* p = basic_plus_adr( ex_node, ex_node, oopDesc::klass_offset_in_bytes());
904 ex_klass_node = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT));
905
906 // Compute the exception klass a little more cleverly.
907 // Obvious solution is to simple do a LoadKlass from the 'ex_node'.
908 // However, if the ex_node is a PhiNode, I'm going to do a LoadKlass for
909 // each arm of the Phi. If I know something clever about the exceptions
910 // I'm loading the class from, I can replace the LoadKlass with the
911 // klass constant for the exception oop.
912 if (ex_node->is_Phi()) {
913 ex_klass_node = new PhiNode(ex_node->in(0), TypeKlassPtr::OBJECT);
914 for (uint i = 1; i < ex_node->req(); i++) {
915 Node* ex_in = ex_node->in(i);
916 if (ex_in == top() || ex_in == NULL) {
917 // This path was not taken.
918 ex_klass_node->init_req(i, top());
919 continue;
920 }
921 Node* p = basic_plus_adr(ex_in, ex_in, oopDesc::klass_offset_in_bytes());
922 Node* k = _gvn.transform( LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT));
923 ex_klass_node->init_req( i, k );
924 }
925 _gvn.set_type(ex_klass_node, TypeKlassPtr::OBJECT);
926
927 }
928 }
929
930 // Scan the exception table for applicable handlers.
931 // If none, we can call rethrow() and be done!
932 // If precise (loaded with no subklasses), insert a D.S. style
933 // pointer compare to the correct handler and loop back.
934 // If imprecise, switch to the Rethrow VM-call style handling.
935
936 int remaining = handlers.count_remaining();
937
938 // iterate through all entries sequentially
939 for (;!handlers.is_done(); handlers.next()) {
940 ciExceptionHandler* handler = handlers.handler();
941
942 if (handler->is_rethrow()) {
943 // If we fell off the end of the table without finding an imprecise
944 // exception klass (and without finding a generic handler) then we
945 // know this exception is not handled in this method. We just rethrow
946 // the exception into the caller.
947 throw_to_exit(make_exception_state(ex_node));
948 return;
949 }
950
951 // exception handler bci range covers throw_bci => investigate further
952 int handler_bci = handler->handler_bci();
953
954 if (remaining == 1) {
955 push_ex_oop(ex_node); // Push exception oop for handler
956 if (PrintOpto && WizardMode) {
957 tty->print_cr(" Catching every inline exception bci:%d -> handler_bci:%d", bci(), handler_bci);
958 }
959 merge_exception(handler_bci); // jump to handler
960 return; // No more handling to be done here!
961 }
962
963 // Get the handler's klass
964 ciInstanceKlass* klass = handler->catch_klass();
965
966 if (!klass->is_loaded()) { // klass is not loaded?
967 // fall through into catch_call_exceptions which will emit a
968 // handler with an uncommon trap.
969 break;
970 }
971
972 if (klass->is_interface()) // should not happen, but...
973 break; // bail out
974
975 // Check the type of the exception against the catch type
976 const TypeKlassPtr *tk = TypeKlassPtr::make(klass);
977 Node* con = _gvn.makecon(tk);
978 Node* not_subtype_ctrl = gen_subtype_check(ex_klass_node, con);
979 if (!stopped()) {
980 PreserveJVMState pjvms(this);
981 const TypeInstPtr* tinst = TypeOopPtr::make_from_klass_unique(klass)->cast_to_ptr_type(TypePtr::NotNull)->is_instptr();
982 assert(klass->has_subklass() || tinst->klass_is_exact(), "lost exactness");
983 Node* ex_oop = _gvn.transform(new CheckCastPPNode(control(), ex_node, tinst));
984 push_ex_oop(ex_oop); // Push exception oop for handler
985 if (PrintOpto && WizardMode) {
986 tty->print(" Catching inline exception bci:%d -> handler_bci:%d -- ", bci(), handler_bci);
987 klass->print_name();
988 tty->cr();
989 }
990 merge_exception(handler_bci);
991 }
992 set_control(not_subtype_ctrl);
993
994 // Come here if exception does not match handler.
995 // Carry on with more handler checks.
996 --remaining;
997 }
998
999 assert(!stopped(), "you should return if you finish the chain");
1000
1001 // Oops, need to call into the VM to resolve the klasses at runtime.
1002 // Note: This call must not deoptimize, since it is not a real at this bci!
1003 kill_dead_locals();
1004
1005 make_runtime_call(RC_NO_LEAF | RC_MUST_THROW,
1006 OptoRuntime::rethrow_Type(),
1007 OptoRuntime::rethrow_stub(),
1008 NULL, NULL,
1009 ex_node);
1010
1011 // Rethrow is a pure call, no side effects, only a result.
1012 // The result cannot be allocated, so we use I_O
1013
1014 // Catch exceptions from the rethrow
1015 catch_call_exceptions(handlers);
1016 }
1017
1018
1019 // (Note: Moved add_debug_info into GraphKit::add_safepoint_edges.)
1020
1021
1022 #ifndef PRODUCT
1023 void Parse::count_compiled_calls(bool at_method_entry, bool is_inline) {
1024 if( CountCompiledCalls ) {
1025 if( at_method_entry ) {
1026 // bump invocation counter if top method (for statistics)
1027 if (CountCompiledCalls && depth() == 1) {
1028 const TypePtr* addr_type = TypeMetadataPtr::make(method());
1029 Node* adr1 = makecon(addr_type);
1030 Node* adr2 = basic_plus_adr(adr1, adr1, in_bytes(Method::compiled_invocation_counter_offset()));
1031 increment_counter(adr2);
1032 }
1033 } else if (is_inline) {
1034 switch (bc()) {
1035 case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_inlined_calls_addr()); break;
1036 case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_inlined_interface_calls_addr()); break;
1037 case Bytecodes::_invokestatic:
1038 case Bytecodes::_invokedynamic:
1039 case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_inlined_static_calls_addr()); break;
1040 default: fatal("unexpected call bytecode");
1041 }
1042 } else {
1043 switch (bc()) {
1044 case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_normal_calls_addr()); break;
1045 case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_interface_calls_addr()); break;
1046 case Bytecodes::_invokestatic:
1047 case Bytecodes::_invokedynamic:
1048 case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_static_calls_addr()); break;
1049 default: fatal("unexpected call bytecode");
1050 }
1051 }
1052 }
1053 }
1054 #endif //PRODUCT
1055
1056
1057 ciMethod* Compile::optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass,
1058 ciKlass* holder, ciMethod* callee,
1059 const TypeOopPtr* receiver_type, bool is_virtual,
1060 bool& call_does_dispatch, int& vtable_index,
1061 bool check_access) {
1062 // Set default values for out-parameters.
1063 call_does_dispatch = true;
1064 vtable_index = Method::invalid_vtable_index;
1065
1066 // Choose call strategy.
1067 ciMethod* optimized_virtual_method = optimize_inlining(caller, bci, klass, callee,
1068 receiver_type, check_access);
1069
1070 // Have the call been sufficiently improved such that it is no longer a virtual?
1071 if (optimized_virtual_method != NULL) {
1072 callee = optimized_virtual_method;
1073 call_does_dispatch = false;
1074 } else if (!UseInlineCaches && is_virtual && callee->is_loaded()) {
1075 // We can make a vtable call at this site
1076 vtable_index = callee->resolve_vtable_index(caller->holder(), holder);
1077 }
1078 return callee;
1079 }
1080
1081 // Identify possible target method and inlining style
1082 ciMethod* Compile::optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass,
1083 ciMethod* callee, const TypeOopPtr* receiver_type,
1084 bool check_access) {
1085 // only use for virtual or interface calls
1086
1087 // If it is obviously final, do not bother to call find_monomorphic_target,
1088 // because the class hierarchy checks are not needed, and may fail due to
1089 // incompletely loaded classes. Since we do our own class loading checks
1090 // in this module, we may confidently bind to any method.
1091 if (callee->can_be_statically_bound()) {
1092 return callee;
1093 }
1094
1095 // Attempt to improve the receiver
1096 bool actual_receiver_is_exact = false;
1097 ciInstanceKlass* actual_receiver = klass;
1098 if (receiver_type != NULL) {
1099 // Array methods are all inherited from Object, and are monomorphic.
1100 // finalize() call on array is not allowed.
1101 if (receiver_type->isa_aryptr() &&
1102 callee->holder() == env()->Object_klass() &&
1103 callee->name() != ciSymbol::finalize_method_name()) {
1104 return callee;
1105 }
1106
1107 // All other interesting cases are instance klasses.
1108 if (!receiver_type->isa_instptr()) {
1109 return NULL;
1110 }
1111
1112 ciInstanceKlass *ikl = receiver_type->klass()->as_instance_klass();
1113 if (ikl->is_loaded() && ikl->is_initialized() && !ikl->is_interface() &&
1114 (ikl == actual_receiver || ikl->is_subtype_of(actual_receiver))) {
1115 // ikl is a same or better type than the original actual_receiver,
1116 // e.g. static receiver from bytecodes.
1117 actual_receiver = ikl;
1118 // Is the actual_receiver exact?
1119 actual_receiver_is_exact = receiver_type->klass_is_exact();
1120 }
1121 }
1122
1123 ciInstanceKlass* calling_klass = caller->holder();
1124 ciMethod* cha_monomorphic_target = callee->find_monomorphic_target(calling_klass, klass, actual_receiver, check_access);
1125 if (cha_monomorphic_target != NULL) {
1126 assert(!cha_monomorphic_target->is_abstract(), "");
1127 // Look at the method-receiver type. Does it add "too much information"?
1128 ciKlass* mr_klass = cha_monomorphic_target->holder();
1129 const Type* mr_type = TypeInstPtr::make(TypePtr::BotPTR, mr_klass);
1130 if (receiver_type == NULL || !receiver_type->higher_equal(mr_type)) {
1131 // Calling this method would include an implicit cast to its holder.
1132 // %%% Not yet implemented. Would throw minor asserts at present.
1133 // %%% The most common wins are already gained by +UseUniqueSubclasses.
1134 // To fix, put the higher_equal check at the call of this routine,
1135 // and add a CheckCastPP to the receiver.
1136 if (TraceDependencies) {
1137 tty->print_cr("found unique CHA method, but could not cast up");
1138 tty->print(" method = ");
1139 cha_monomorphic_target->print();
1140 tty->cr();
1141 }
1142 if (log() != NULL) {
1143 log()->elem("missed_CHA_opportunity klass='%d' method='%d'",
1144 log()->identify(klass),
1145 log()->identify(cha_monomorphic_target));
1146 }
1147 cha_monomorphic_target = NULL;
1148 }
1149 }
1150 if (cha_monomorphic_target != NULL) {
1151 // Hardwiring a virtual.
1152 // If we inlined because CHA revealed only a single target method,
1153 // then we are dependent on that target method not getting overridden
1154 // by dynamic class loading. Be sure to test the "static" receiver
1155 // dest_method here, as opposed to the actual receiver, which may
1156 // falsely lead us to believe that the receiver is final or private.
1157 dependencies()->assert_unique_concrete_method(actual_receiver, cha_monomorphic_target);
1158 return cha_monomorphic_target;
1159 }
1160
1161 // If the type is exact, we can still bind the method w/o a vcall.
1162 // (This case comes after CHA so we can see how much extra work it does.)
1163 if (actual_receiver_is_exact) {
1164 // In case of evolution, there is a dependence on every inlined method, since each
1165 // such method can be changed when its class is redefined.
1166 ciMethod* exact_method = callee->resolve_invoke(calling_klass, actual_receiver);
1167 if (exact_method != NULL) {
1168 if (PrintOpto) {
1169 tty->print(" Calling method via exact type @%d --- ", bci);
1170 exact_method->print_name();
1171 tty->cr();
1172 }
1173 return exact_method;
1174 }
1175 }
1176
1177 return NULL;
1178 }