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,
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, 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);
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, 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, 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, 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 // If there is only one implementor of this interface then we
296 // may be able bind this invoke directly to the implementing
297 // klass but we need both a dependence on the single interface
298 // and on the method we bind to. Additionally since all we know
299 // about the receiver type is the it's supposed to implement the
300 // interface we have to insert a check that it's the class we
301 // expect. Interface types are not checked by the verifier so
302 // they are roughly equivalent to Object.
303 // The number of implementors for declared_interface is less or
304 // equal to the number of implementors for target->holder() so
305 // if number of implementors of target->holder() == 1 then
306 // number of implementors for decl_interface is 0 or 1. If
307 // it's 0 then no class implements decl_interface and there's
308 // no point in inlining.
309 if (call_does_dispatch && bytecode == Bytecodes::_invokeinterface) {
310 ciInstanceKlass* declared_interface =
311 caller->get_declared_method_holder_at_bci(bci)->as_instance_klass();
312
313 if (declared_interface->nof_implementors() == 1 &&
314 (!callee->is_default_method() || callee->is_overpass()) /*CHA doesn't support default methods yet.*/) {
315 ciInstanceKlass* singleton = declared_interface->implementor();
316 ciMethod* cha_monomorphic_target =
317 callee->find_monomorphic_target(caller->holder(), declared_interface, singleton);
318
319 if (cha_monomorphic_target != NULL) {
320 ciKlass* holder = cha_monomorphic_target->holder();
321
322 // Try to inline the method found by CHA. Inlined method is guarded by the type check.
323 CallGenerator* hit_cg = call_generator(cha_monomorphic_target,
324 vtable_index, !call_does_dispatch, jvms, allow_inline, prof_factor);
325
326 // Deoptimize on type check fail. The interpreter will throw ICCE for us.
327 CallGenerator* miss_cg = CallGenerator::for_uncommon_trap(callee,
328 Deoptimization::Reason_class_check, Deoptimization::Action_none);
329
330 CallGenerator* cg = CallGenerator::for_guarded_call(holder, miss_cg, hit_cg);
331 if (hit_cg != NULL && cg != NULL) {
332 dependencies()->assert_unique_concrete_method(declared_interface, cha_monomorphic_target);
333 return cg;
334 }
335 }
336 }
337 }
338 }
339
340 // Nothing claimed the intrinsic, we go with straight-forward inlining
341 // for already discovered intrinsic.
342 if (allow_inline && allow_intrinsics && cg_intrinsic != NULL) {
343 assert(cg_intrinsic->does_virtual_dispatch(), "sanity");
344 return cg_intrinsic;
345 }
346
347 // There was no special inlining tactic, or it bailed out.
348 // Use a more generic tactic, like a simple call.
349 if (call_does_dispatch) {
350 const char* msg = "virtual call";
351 if (PrintInlining) print_inlining(callee, jvms->depth() - 1, jvms->bci(), msg);
352 C->log_inline_failure(msg);
353 return CallGenerator::for_virtual_call(callee, vtable_index);
354 } else {
355 // Class Hierarchy Analysis or Type Profile reveals a unique target,
356 // or it is a static or special call.
357 return CallGenerator::for_direct_call(callee, should_delay_inlining(callee, jvms));
358 }
359 }
360
361 // Return true for methods that shouldn't be inlined early so that
362 // they are easier to analyze and optimize as intrinsics.
363 bool Compile::should_delay_string_inlining(ciMethod* call_method, JVMState* jvms) {
364 if (has_stringbuilder()) {
365
366 if ((call_method->holder() == C->env()->StringBuilder_klass() ||
367 call_method->holder() == C->env()->StringBuffer_klass()) &&
368 (jvms->method()->holder() == C->env()->StringBuilder_klass() ||
369 jvms->method()->holder() == C->env()->StringBuffer_klass())) {
370 // Delay SB calls only when called from non-SB code
371 return false;
372 }
373
374 switch (call_method->intrinsic_id()) {
375 case vmIntrinsics::_StringBuilder_void:
376 case vmIntrinsics::_StringBuilder_int:
377 case vmIntrinsics::_StringBuilder_String:
378 case vmIntrinsics::_StringBuilder_append_char:
379 case vmIntrinsics::_StringBuilder_append_int:
380 case vmIntrinsics::_StringBuilder_append_String:
381 case vmIntrinsics::_StringBuilder_toString:
382 case vmIntrinsics::_StringBuffer_void:
383 case vmIntrinsics::_StringBuffer_int:
384 case vmIntrinsics::_StringBuffer_String:
385 case vmIntrinsics::_StringBuffer_append_char:
386 case vmIntrinsics::_StringBuffer_append_int:
387 case vmIntrinsics::_StringBuffer_append_String:
388 case vmIntrinsics::_StringBuffer_toString:
389 case vmIntrinsics::_Integer_toString:
390 return true;
391
392 case vmIntrinsics::_String_String:
393 {
394 Node* receiver = jvms->map()->in(jvms->argoff() + 1);
395 if (receiver->is_Proj() && receiver->in(0)->is_CallStaticJava()) {
396 CallStaticJavaNode* csj = receiver->in(0)->as_CallStaticJava();
397 ciMethod* m = csj->method();
398 if (m != NULL &&
399 (m->intrinsic_id() == vmIntrinsics::_StringBuffer_toString ||
400 m->intrinsic_id() == vmIntrinsics::_StringBuilder_toString))
401 // Delay String.<init>(new SB())
402 return true;
403 }
404 return false;
405 }
406
407 default:
408 return false;
409 }
410 }
411 return false;
412 }
413
414 bool Compile::should_delay_boxing_inlining(ciMethod* call_method, JVMState* jvms) {
415 if (eliminate_boxing() && call_method->is_boxing_method()) {
416 set_has_boxed_value(true);
417 return aggressive_unboxing();
418 }
419 return false;
420 }
421
422 // uncommon-trap call-sites where callee is unloaded, uninitialized or will not link
423 bool Parse::can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass* klass) {
424 // Additional inputs to consider...
425 // bc = bc()
426 // caller = method()
427 // iter().get_method_holder_index()
428 assert( dest_method->is_loaded(), "ciTypeFlow should not let us get here" );
429 // Interface classes can be loaded & linked and never get around to
430 // being initialized. Uncommon-trap for not-initialized static or
431 // v-calls. Let interface calls happen.
432 ciInstanceKlass* holder_klass = dest_method->holder();
433 if (!holder_klass->is_being_initialized() &&
434 !holder_klass->is_initialized() &&
435 !holder_klass->is_interface()) {
436 uncommon_trap(Deoptimization::Reason_uninitialized,
437 Deoptimization::Action_reinterpret,
438 holder_klass);
439 return true;
440 }
441
442 assert(dest_method->is_loaded(), "dest_method: typeflow responsibility");
443 return false;
444 }
445
446 #ifdef ASSERT
447 static bool check_call_consistency(JVMState* jvms, CallGenerator* cg) {
448 ciMethod* symbolic_info = jvms->method()->get_method_at_bci(jvms->bci());
449 ciMethod* resolved_method = cg->method();
450 if (!ciMethod::is_consistent_info(symbolic_info, resolved_method)) {
451 tty->print_cr("JVMS:");
452 jvms->dump();
453 tty->print_cr("Bytecode info:");
454 jvms->method()->get_method_at_bci(jvms->bci())->print(); tty->cr();
455 tty->print_cr("Resolved method:");
456 cg->method()->print(); tty->cr();
457 return false;
458 }
459 return true;
460 }
461 #endif // ASSERT
462
463 //------------------------------do_call----------------------------------------
464 // Handle your basic call. Inline if we can & want to, else just setup call.
465 void Parse::do_call() {
466 // It's likely we are going to add debug info soon.
467 // Also, if we inline a guy who eventually needs debug info for this JVMS,
468 // our contribution to it is cleaned up right here.
469 kill_dead_locals();
470
471 C->print_inlining_assert_ready();
472
473 // Set frequently used booleans
474 const bool is_virtual = bc() == Bytecodes::_invokevirtual;
475 const bool is_virtual_or_interface = is_virtual || bc() == Bytecodes::_invokeinterface;
476 const bool has_receiver = Bytecodes::has_receiver(bc());
477
478 // Find target being called
479 bool will_link;
480 ciSignature* declared_signature = NULL;
481 ciMethod* orig_callee = iter().get_method(will_link, &declared_signature); // callee in the bytecode
482 ciInstanceKlass* holder_klass = orig_callee->holder();
483 ciKlass* holder = iter().get_declared_method_holder();
484 ciInstanceKlass* klass = ciEnv::get_instance_klass_for_declared_method_holder(holder);
485 assert(declared_signature != NULL, "cannot be null");
486
487 // Bump max node limit for JSR292 users
488 if (bc() == Bytecodes::_invokedynamic || orig_callee->is_method_handle_intrinsic()) {
489 C->set_max_node_limit(3*MaxNodeLimit);
490 }
491
492 // uncommon-trap when callee is unloaded, uninitialized or will not link
493 // bailout when too many arguments for register representation
494 if (!will_link || can_not_compile_call_site(orig_callee, klass)) {
495 if (PrintOpto && (Verbose || WizardMode)) {
496 method()->print_name(); tty->print_cr(" can not compile call at bci %d to:", bci());
497 orig_callee->print_name(); tty->cr();
498 }
499 return;
500 }
501 assert(holder_klass->is_loaded(), "");
502 //assert((bc_callee->is_static() || is_invokedynamic) == !has_receiver , "must match bc"); // XXX invokehandle (cur_bc_raw)
503 // Note: this takes into account invokeinterface of methods declared in java/lang/Object,
504 // which should be invokevirtuals but according to the VM spec may be invokeinterfaces
505 assert(holder_klass->is_interface() || holder_klass->super() == NULL || (bc() != Bytecodes::_invokeinterface), "must match bc");
506 // Note: In the absence of miranda methods, an abstract class K can perform
507 // an invokevirtual directly on an interface method I.m if K implements I.
508
509 // orig_callee is the resolved callee which's signature includes the
510 // appendix argument.
511 const int nargs = orig_callee->arg_size();
512 const bool is_signature_polymorphic = MethodHandles::is_signature_polymorphic(orig_callee->intrinsic_id());
513
514 // Push appendix argument (MethodType, CallSite, etc.), if one.
515 if (iter().has_appendix()) {
516 ciObject* appendix_arg = iter().get_appendix();
517 const TypeOopPtr* appendix_arg_type = TypeOopPtr::make_from_constant(appendix_arg);
518 Node* appendix_arg_node = _gvn.makecon(appendix_arg_type);
519 push(appendix_arg_node);
520 }
521
522 // ---------------------
523 // Does Class Hierarchy Analysis reveal only a single target of a v-call?
524 // Then we may inline or make a static call, but become dependent on there being only 1 target.
525 // Does the call-site type profile reveal only one receiver?
526 // Then we may introduce a run-time check and inline on the path where it succeeds.
527 // The other path may uncommon_trap, check for another receiver, or do a v-call.
528
529 // Try to get the most accurate receiver type
530 ciMethod* callee = orig_callee;
531 int vtable_index = Method::invalid_vtable_index;
532 bool call_does_dispatch = false;
533
534 // Speculative type of the receiver if any
535 ciKlass* speculative_receiver_type = NULL;
536 if (is_virtual_or_interface) {
537 Node* receiver_node = stack(sp() - nargs);
538 const TypeOopPtr* receiver_type = _gvn.type(receiver_node)->isa_oopptr();
539 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
540 // For arrays, klass below is Object. When vtable calls are used,
541 // resolving the call with Object would allow an illegal call to
542 // finalize() on an array. We use holder instead: illegal calls to
543 // finalize() won't be compiled as vtable calls (IC call
544 // resolution will catch the illegal call) and the few legal calls
545 // on array types won't be either.
546 callee = C->optimize_virtual_call(method(), bci(), klass, holder, orig_callee,
547 receiver_type, is_virtual,
548 call_does_dispatch, vtable_index); // out-parameters
549 speculative_receiver_type = receiver_type != NULL ? receiver_type->speculative_type() : NULL;
550 }
551
552 // Note: It's OK to try to inline a virtual call.
553 // The call generator will not attempt to inline a polymorphic call
554 // unless it knows how to optimize the receiver dispatch.
555 bool try_inline = (C->do_inlining() || InlineAccessors);
556
557 // ---------------------
558 dec_sp(nargs); // Temporarily pop args for JVM state of call
559 JVMState* jvms = sync_jvms();
560
561 // ---------------------
562 // Decide call tactic.
563 // This call checks with CHA, the interpreter profile, intrinsics table, etc.
564 // It decides whether inlining is desirable or not.
565 CallGenerator* cg = C->call_generator(callee, vtable_index, call_does_dispatch, jvms, try_inline, prof_factor(), speculative_receiver_type);
566
567 // NOTE: Don't use orig_callee and callee after this point! Use cg->method() instead.
568 orig_callee = callee = NULL;
569
570 // ---------------------
571 // Round double arguments before call
572 round_double_arguments(cg->method());
573
574 // Feed profiling data for arguments to the type system so it can
575 // propagate it as speculative types
576 record_profiled_arguments_for_speculation(cg->method(), bc());
577
578 #ifndef PRODUCT
579 // bump global counters for calls
580 count_compiled_calls(/*at_method_entry*/ false, cg->is_inline());
581
582 // Record first part of parsing work for this call
583 parse_histogram()->record_change();
584 #endif // not PRODUCT
585
586 assert(jvms == this->jvms(), "still operating on the right JVMS");
587 assert(jvms_in_sync(), "jvms must carry full info into CG");
588
589 // save across call, for a subsequent cast_not_null.
590 Node* receiver = has_receiver ? argument(0) : NULL;
591
592 // The extra CheckCastPP for speculative types mess with PhaseStringOpts
593 if (receiver != NULL && !call_does_dispatch && !cg->is_string_late_inline()) {
594 // Feed profiling data for a single receiver to the type system so
595 // it can propagate it as a speculative type
596 receiver = record_profiled_receiver_for_speculation(receiver);
597 }
598
599 // Bump method data counters (We profile *before* the call is made
600 // because exceptions don't return to the call site.)
601 profile_call(receiver);
602
603 JVMState* new_jvms = cg->generate(jvms);
604 if (new_jvms == NULL) {
605 // When inlining attempt fails (e.g., too many arguments),
606 // it may contaminate the current compile state, making it
607 // impossible to pull back and try again. Once we call
608 // cg->generate(), we are committed. If it fails, the whole
609 // compilation task is compromised.
610 if (failing()) return;
611
612 // This can happen if a library intrinsic is available, but refuses
613 // the call site, perhaps because it did not match a pattern the
614 // intrinsic was expecting to optimize. Should always be possible to
615 // get a normal java call that may inline in that case
616 cg = C->call_generator(cg->method(), vtable_index, call_does_dispatch, jvms, try_inline, prof_factor(), speculative_receiver_type, /* allow_intrinsics= */ false);
617 new_jvms = cg->generate(jvms);
618 if (new_jvms == NULL) {
619 guarantee(failing(), "call failed to generate: calls should work");
620 return;
621 }
622 }
623
624 if (cg->is_inline()) {
625 // Accumulate has_loops estimate
626 C->set_has_loops(C->has_loops() || cg->method()->has_loops());
627 C->env()->notice_inlined_method(cg->method());
628 }
629
630 // Reset parser state from [new_]jvms, which now carries results of the call.
631 // Return value (if any) is already pushed on the stack by the cg.
632 add_exception_states_from(new_jvms);
633 if (new_jvms->map()->control() == top()) {
634 stop_and_kill_map();
635 } else {
636 assert(new_jvms->same_calls_as(jvms), "method/bci left unchanged");
637 set_jvms(new_jvms);
638 }
639
640 assert(check_call_consistency(jvms, cg), "inconsistent info");
641
642 if (!stopped()) {
643 // This was some sort of virtual call, which did a null check for us.
644 // Now we can assert receiver-not-null, on the normal return path.
645 if (receiver != NULL && cg->is_virtual()) {
646 Node* cast = cast_not_null(receiver);
647 // %%% assert(receiver == cast, "should already have cast the receiver");
648 }
649
650 // Round double result after a call from strict to non-strict code
651 round_double_result(cg->method());
652
653 ciType* rtype = cg->method()->return_type();
654 ciType* ctype = declared_signature->return_type();
655
656 if (Bytecodes::has_optional_appendix(iter().cur_bc_raw()) || is_signature_polymorphic) {
657 // Be careful here with return types.
658 if (ctype != rtype) {
659 BasicType rt = rtype->basic_type();
660 BasicType ct = ctype->basic_type();
661 if (ct == T_VOID) {
662 // It's OK for a method to return a value that is discarded.
663 // The discarding does not require any special action from the caller.
664 // The Java code knows this, at VerifyType.isNullConversion.
665 pop_node(rt); // whatever it was, pop it
666 } else if (rt == T_INT || is_subword_type(rt)) {
667 // Nothing. These cases are handled in lambda form bytecode.
668 assert(ct == T_INT || is_subword_type(ct), "must match: rt=%s, ct=%s", type2name(rt), type2name(ct));
669 } else if (rt == T_OBJECT || rt == T_ARRAY) {
670 assert(ct == T_OBJECT || ct == T_ARRAY, "rt=%s, ct=%s", type2name(rt), type2name(ct));
671 if (ctype->is_loaded()) {
672 const TypeOopPtr* arg_type = TypeOopPtr::make_from_klass(rtype->as_klass());
673 const Type* sig_type = TypeOopPtr::make_from_klass(ctype->as_klass());
674 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) {
675 Node* retnode = pop();
676 Node* cast_obj = _gvn.transform(new CheckCastPPNode(control(), retnode, sig_type));
677 push(cast_obj);
678 }
679 }
680 } else {
681 assert(rt == ct, "unexpected mismatch: rt=%s, ct=%s", type2name(rt), type2name(ct));
682 // push a zero; it's better than getting an oop/int mismatch
683 pop_node(rt);
684 Node* retnode = zerocon(ct);
685 push_node(ct, retnode);
686 }
687 // Now that the value is well-behaved, continue with the call-site type.
688 rtype = ctype;
689 }
690 } else {
691 // Symbolic resolution enforces the types to be the same.
692 // NOTE: We must relax the assert for unloaded types because two
693 // different ciType instances of the same unloaded class type
694 // can appear to be "loaded" by different loaders (depending on
695 // the accessing class).
696 assert(!rtype->is_loaded() || !ctype->is_loaded() || rtype == ctype,
697 "mismatched return types: rtype=%s, ctype=%s", rtype->name(), ctype->name());
698 }
699
700 // If the return type of the method is not loaded, assert that the
701 // value we got is a null. Otherwise, we need to recompile.
702 if (!rtype->is_loaded()) {
703 if (PrintOpto && (Verbose || WizardMode)) {
704 method()->print_name(); tty->print_cr(" asserting nullness of result at bci: %d", bci());
705 cg->method()->print_name(); tty->cr();
706 }
707 if (C->log() != NULL) {
708 C->log()->elem("assert_null reason='return' klass='%d'",
709 C->log()->identify(rtype));
710 }
711 // If there is going to be a trap, put it at the next bytecode:
712 set_bci(iter().next_bci());
713 null_assert(peek());
714 set_bci(iter().cur_bci()); // put it back
715 }
716 BasicType ct = ctype->basic_type();
717 if (ct == T_OBJECT || ct == T_ARRAY) {
718 record_profiled_return_for_speculation();
719 }
720 }
721
722 // Restart record of parsing work after possible inlining of call
723 #ifndef PRODUCT
724 parse_histogram()->set_initial_state(bc());
725 #endif
726 }
727
728 //---------------------------catch_call_exceptions-----------------------------
729 // Put a Catch and CatchProj nodes behind a just-created call.
730 // Send their caught exceptions to the proper handler.
731 // This may be used after a call to the rethrow VM stub,
732 // when it is needed to process unloaded exception classes.
733 void Parse::catch_call_exceptions(ciExceptionHandlerStream& handlers) {
734 // Exceptions are delivered through this channel:
735 Node* i_o = this->i_o();
736
737 // Add a CatchNode.
738 GrowableArray<int>* bcis = new (C->node_arena()) GrowableArray<int>(C->node_arena(), 8, 0, -1);
739 GrowableArray<const Type*>* extypes = new (C->node_arena()) GrowableArray<const Type*>(C->node_arena(), 8, 0, NULL);
740 GrowableArray<int>* saw_unloaded = new (C->node_arena()) GrowableArray<int>(C->node_arena(), 8, 0, 0);
741
742 for (; !handlers.is_done(); handlers.next()) {
743 ciExceptionHandler* h = handlers.handler();
744 int h_bci = h->handler_bci();
745 ciInstanceKlass* h_klass = h->is_catch_all() ? env()->Throwable_klass() : h->catch_klass();
746 // Do not introduce unloaded exception types into the graph:
747 if (!h_klass->is_loaded()) {
748 if (saw_unloaded->contains(h_bci)) {
749 /* We've already seen an unloaded exception with h_bci,
750 so don't duplicate. Duplication will cause the CatchNode to be
751 unnecessarily large. See 4713716. */
752 continue;
753 } else {
754 saw_unloaded->append(h_bci);
755 }
756 }
757 const Type* h_extype = TypeOopPtr::make_from_klass(h_klass);
758 // (We use make_from_klass because it respects UseUniqueSubclasses.)
759 h_extype = h_extype->join(TypeInstPtr::NOTNULL);
760 assert(!h_extype->empty(), "sanity");
761 // Note: It's OK if the BCIs repeat themselves.
762 bcis->append(h_bci);
763 extypes->append(h_extype);
764 }
765
766 int len = bcis->length();
767 CatchNode *cn = new CatchNode(control(), i_o, len+1);
768 Node *catch_ = _gvn.transform(cn);
769
770 // now branch with the exception state to each of the (potential)
771 // handlers
772 for(int i=0; i < len; i++) {
773 // Setup JVM state to enter the handler.
774 PreserveJVMState pjvms(this);
775 // Locals are just copied from before the call.
776 // Get control from the CatchNode.
777 int handler_bci = bcis->at(i);
778 Node* ctrl = _gvn.transform( new CatchProjNode(catch_, i+1,handler_bci));
779 // This handler cannot happen?
780 if (ctrl == top()) continue;
781 set_control(ctrl);
782
783 // Create exception oop
784 const TypeInstPtr* extype = extypes->at(i)->is_instptr();
785 Node *ex_oop = _gvn.transform(new CreateExNode(extypes->at(i), ctrl, i_o));
786
787 // Handle unloaded exception classes.
788 if (saw_unloaded->contains(handler_bci)) {
789 // An unloaded exception type is coming here. Do an uncommon trap.
790 #ifndef PRODUCT
791 // We do not expect the same handler bci to take both cold unloaded
792 // and hot loaded exceptions. But, watch for it.
793 if ((Verbose || WizardMode) && extype->is_loaded()) {
794 tty->print("Warning: Handler @%d takes mixed loaded/unloaded exceptions in ", bci());
795 method()->print_name(); tty->cr();
796 } else if (PrintOpto && (Verbose || WizardMode)) {
797 tty->print("Bailing out on unloaded exception type ");
798 extype->klass()->print_name();
799 tty->print(" at bci:%d in ", bci());
800 method()->print_name(); tty->cr();
801 }
802 #endif
803 // Emit an uncommon trap instead of processing the block.
804 set_bci(handler_bci);
805 push_ex_oop(ex_oop);
806 uncommon_trap(Deoptimization::Reason_unloaded,
807 Deoptimization::Action_reinterpret,
808 extype->klass(), "!loaded exception");
809 set_bci(iter().cur_bci()); // put it back
810 continue;
811 }
812
813 // go to the exception handler
814 if (handler_bci < 0) { // merge with corresponding rethrow node
815 throw_to_exit(make_exception_state(ex_oop));
816 } else { // Else jump to corresponding handle
817 push_ex_oop(ex_oop); // Clear stack and push just the oop.
818 merge_exception(handler_bci);
819 }
820 }
821
822 // The first CatchProj is for the normal return.
823 // (Note: If this is a call to rethrow_Java, this node goes dead.)
824 set_control(_gvn.transform( new CatchProjNode(catch_, CatchProjNode::fall_through_index, CatchProjNode::no_handler_bci)));
825 }
826
827
828 //----------------------------catch_inline_exceptions--------------------------
829 // Handle all exceptions thrown by an inlined method or individual bytecode.
830 // Common case 1: we have no handler, so all exceptions merge right into
831 // the rethrow case.
832 // Case 2: we have some handlers, with loaded exception klasses that have
833 // no subklasses. We do a Deutsch-Shiffman style type-check on the incoming
834 // exception oop and branch to the handler directly.
835 // Case 3: We have some handlers with subklasses or are not loaded at
836 // compile-time. We have to call the runtime to resolve the exception.
837 // So we insert a RethrowCall and all the logic that goes with it.
838 void Parse::catch_inline_exceptions(SafePointNode* ex_map) {
839 // Caller is responsible for saving away the map for normal control flow!
840 assert(stopped(), "call set_map(NULL) first");
841 assert(method()->has_exception_handlers(), "don't come here w/o work to do");
842
843 Node* ex_node = saved_ex_oop(ex_map);
844 if (ex_node == top()) {
845 // No action needed.
846 return;
847 }
848 const TypeInstPtr* ex_type = _gvn.type(ex_node)->isa_instptr();
849 NOT_PRODUCT(if (ex_type==NULL) tty->print_cr("*** Exception not InstPtr"));
850 if (ex_type == NULL)
851 ex_type = TypeOopPtr::make_from_klass(env()->Throwable_klass())->is_instptr();
852
853 // determine potential exception handlers
854 ciExceptionHandlerStream handlers(method(), bci(),
855 ex_type->klass()->as_instance_klass(),
856 ex_type->klass_is_exact());
857
858 // Start executing from the given throw state. (Keep its stack, for now.)
859 // Get the exception oop as known at compile time.
860 ex_node = use_exception_state(ex_map);
861
862 // Get the exception oop klass from its header
863 Node* ex_klass_node = NULL;
864 if (has_ex_handler() && !ex_type->klass_is_exact()) {
865 Node* p = basic_plus_adr( ex_node, ex_node, oopDesc::klass_offset_in_bytes());
866 ex_klass_node = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT));
867
868 // Compute the exception klass a little more cleverly.
869 // Obvious solution is to simple do a LoadKlass from the 'ex_node'.
870 // However, if the ex_node is a PhiNode, I'm going to do a LoadKlass for
871 // each arm of the Phi. If I know something clever about the exceptions
872 // I'm loading the class from, I can replace the LoadKlass with the
873 // klass constant for the exception oop.
874 if (ex_node->is_Phi()) {
875 ex_klass_node = new PhiNode(ex_node->in(0), TypeKlassPtr::OBJECT);
876 for (uint i = 1; i < ex_node->req(); i++) {
877 Node* ex_in = ex_node->in(i);
878 if (ex_in == top() || ex_in == NULL) {
879 // This path was not taken.
880 ex_klass_node->init_req(i, top());
881 continue;
882 }
883 Node* p = basic_plus_adr(ex_in, ex_in, oopDesc::klass_offset_in_bytes());
884 Node* k = _gvn.transform( LoadKlassNode::make(_gvn, NULL, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT));
885 ex_klass_node->init_req( i, k );
886 }
887 _gvn.set_type(ex_klass_node, TypeKlassPtr::OBJECT);
888
889 }
890 }
891
892 // Scan the exception table for applicable handlers.
893 // If none, we can call rethrow() and be done!
894 // If precise (loaded with no subklasses), insert a D.S. style
895 // pointer compare to the correct handler and loop back.
896 // If imprecise, switch to the Rethrow VM-call style handling.
897
898 int remaining = handlers.count_remaining();
899
900 // iterate through all entries sequentially
901 for (;!handlers.is_done(); handlers.next()) {
902 ciExceptionHandler* handler = handlers.handler();
903
904 if (handler->is_rethrow()) {
905 // If we fell off the end of the table without finding an imprecise
906 // exception klass (and without finding a generic handler) then we
907 // know this exception is not handled in this method. We just rethrow
908 // the exception into the caller.
909 throw_to_exit(make_exception_state(ex_node));
910 return;
911 }
912
913 // exception handler bci range covers throw_bci => investigate further
914 int handler_bci = handler->handler_bci();
915
916 if (remaining == 1) {
917 push_ex_oop(ex_node); // Push exception oop for handler
918 if (PrintOpto && WizardMode) {
919 tty->print_cr(" Catching every inline exception bci:%d -> handler_bci:%d", bci(), handler_bci);
920 }
921 merge_exception(handler_bci); // jump to handler
922 return; // No more handling to be done here!
923 }
924
925 // Get the handler's klass
926 ciInstanceKlass* klass = handler->catch_klass();
927
928 if (!klass->is_loaded()) { // klass is not loaded?
929 // fall through into catch_call_exceptions which will emit a
930 // handler with an uncommon trap.
931 break;
932 }
933
934 if (klass->is_interface()) // should not happen, but...
935 break; // bail out
936
937 // Check the type of the exception against the catch type
938 const TypeKlassPtr *tk = TypeKlassPtr::make(klass);
939 Node* con = _gvn.makecon(tk);
940 Node* not_subtype_ctrl = gen_subtype_check(ex_klass_node, con);
941 if (!stopped()) {
942 PreserveJVMState pjvms(this);
943 const TypeInstPtr* tinst = TypeOopPtr::make_from_klass_unique(klass)->cast_to_ptr_type(TypePtr::NotNull)->is_instptr();
944 assert(klass->has_subklass() || tinst->klass_is_exact(), "lost exactness");
945 Node* ex_oop = _gvn.transform(new CheckCastPPNode(control(), ex_node, tinst));
946 push_ex_oop(ex_oop); // Push exception oop for handler
947 if (PrintOpto && WizardMode) {
948 tty->print(" Catching inline exception bci:%d -> handler_bci:%d -- ", bci(), handler_bci);
949 klass->print_name();
950 tty->cr();
951 }
952 merge_exception(handler_bci);
953 }
954 set_control(not_subtype_ctrl);
955
956 // Come here if exception does not match handler.
957 // Carry on with more handler checks.
958 --remaining;
959 }
960
961 assert(!stopped(), "you should return if you finish the chain");
962
963 // Oops, need to call into the VM to resolve the klasses at runtime.
964 // Note: This call must not deoptimize, since it is not a real at this bci!
965 kill_dead_locals();
966
967 make_runtime_call(RC_NO_LEAF | RC_MUST_THROW,
968 OptoRuntime::rethrow_Type(),
969 OptoRuntime::rethrow_stub(),
970 NULL, NULL,
971 ex_node);
972
973 // Rethrow is a pure call, no side effects, only a result.
974 // The result cannot be allocated, so we use I_O
975
976 // Catch exceptions from the rethrow
977 catch_call_exceptions(handlers);
978 }
979
980
981 // (Note: Moved add_debug_info into GraphKit::add_safepoint_edges.)
982
983
984 #ifndef PRODUCT
985 void Parse::count_compiled_calls(bool at_method_entry, bool is_inline) {
986 if( CountCompiledCalls ) {
987 if( at_method_entry ) {
988 // bump invocation counter if top method (for statistics)
989 if (CountCompiledCalls && depth() == 1) {
990 const TypePtr* addr_type = TypeMetadataPtr::make(method());
991 Node* adr1 = makecon(addr_type);
992 Node* adr2 = basic_plus_adr(adr1, adr1, in_bytes(Method::compiled_invocation_counter_offset()));
993 increment_counter(adr2);
994 }
995 } else if (is_inline) {
996 switch (bc()) {
997 case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_inlined_calls_addr()); break;
998 case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_inlined_interface_calls_addr()); break;
999 case Bytecodes::_invokestatic:
1000 case Bytecodes::_invokedynamic:
1001 case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_inlined_static_calls_addr()); break;
1002 default: fatal("unexpected call bytecode");
1003 }
1004 } else {
1005 switch (bc()) {
1006 case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_normal_calls_addr()); break;
1007 case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_interface_calls_addr()); break;
1008 case Bytecodes::_invokestatic:
1009 case Bytecodes::_invokedynamic:
1010 case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_static_calls_addr()); break;
1011 default: fatal("unexpected call bytecode");
1012 }
1013 }
1014 }
1015 }
1016 #endif //PRODUCT
1017
1018
1019 ciMethod* Compile::optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass,
1020 ciKlass* holder, ciMethod* callee,
1021 const TypeOopPtr* receiver_type, bool is_virtual,
1022 bool& call_does_dispatch, int& vtable_index,
1023 bool check_access) {
1024 // Set default values for out-parameters.
1025 call_does_dispatch = true;
1026 vtable_index = Method::invalid_vtable_index;
1027
1028 // Choose call strategy.
1029 ciMethod* optimized_virtual_method = optimize_inlining(caller, bci, klass, callee,
1030 receiver_type, check_access);
1031
1032 // Have the call been sufficiently improved such that it is no longer a virtual?
1033 if (optimized_virtual_method != NULL) {
1034 callee = optimized_virtual_method;
1035 call_does_dispatch = false;
1036 } else if (!UseInlineCaches && is_virtual && callee->is_loaded()) {
1037 // We can make a vtable call at this site
1038 vtable_index = callee->resolve_vtable_index(caller->holder(), holder);
1039 }
1040 return callee;
1041 }
1042
1043 // Identify possible target method and inlining style
1044 ciMethod* Compile::optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass,
1045 ciMethod* callee, const TypeOopPtr* receiver_type,
1046 bool check_access) {
1047 // only use for virtual or interface calls
1048
1049 // If it is obviously final, do not bother to call find_monomorphic_target,
1050 // because the class hierarchy checks are not needed, and may fail due to
1051 // incompletely loaded classes. Since we do our own class loading checks
1052 // in this module, we may confidently bind to any method.
1053 if (callee->can_be_statically_bound()) {
1054 return callee;
1055 }
1056
1057 // Attempt to improve the receiver
1058 bool actual_receiver_is_exact = false;
1059 ciInstanceKlass* actual_receiver = klass;
1060 if (receiver_type != NULL) {
1061 // Array methods are all inherited from Object, and are monomorphic.
1062 // finalize() call on array is not allowed.
1063 if (receiver_type->isa_aryptr() &&
1064 callee->holder() == env()->Object_klass() &&
1065 callee->name() != ciSymbol::finalize_method_name()) {
1066 return callee;
1067 }
1068
1069 // All other interesting cases are instance klasses.
1070 if (!receiver_type->isa_instptr()) {
1071 return NULL;
1072 }
1073
1074 ciInstanceKlass *ikl = receiver_type->klass()->as_instance_klass();
1075 if (ikl->is_loaded() && ikl->is_initialized() && !ikl->is_interface() &&
1076 (ikl == actual_receiver || ikl->is_subtype_of(actual_receiver))) {
1077 // ikl is a same or better type than the original actual_receiver,
1078 // e.g. static receiver from bytecodes.
1079 actual_receiver = ikl;
1080 // Is the actual_receiver exact?
1081 actual_receiver_is_exact = receiver_type->klass_is_exact();
1082 }
1083 }
1084
1085 ciInstanceKlass* calling_klass = caller->holder();
1086 ciMethod* cha_monomorphic_target = callee->find_monomorphic_target(calling_klass, klass, actual_receiver, check_access);
1087 if (cha_monomorphic_target != NULL) {
1088 assert(!cha_monomorphic_target->is_abstract(), "");
1089 // Look at the method-receiver type. Does it add "too much information"?
1090 ciKlass* mr_klass = cha_monomorphic_target->holder();
1091 const Type* mr_type = TypeInstPtr::make(TypePtr::BotPTR, mr_klass);
1092 if (receiver_type == NULL || !receiver_type->higher_equal(mr_type)) {
1093 // Calling this method would include an implicit cast to its holder.
1094 // %%% Not yet implemented. Would throw minor asserts at present.
1095 // %%% The most common wins are already gained by +UseUniqueSubclasses.
1096 // To fix, put the higher_equal check at the call of this routine,
1097 // and add a CheckCastPP to the receiver.
1098 if (TraceDependencies) {
1099 tty->print_cr("found unique CHA method, but could not cast up");
1100 tty->print(" method = ");
1101 cha_monomorphic_target->print();
1102 tty->cr();
1103 }
1104 if (log() != NULL) {
1105 log()->elem("missed_CHA_opportunity klass='%d' method='%d'",
1106 log()->identify(klass),
1107 log()->identify(cha_monomorphic_target));
1108 }
1109 cha_monomorphic_target = NULL;
1110 }
1111 }
1112 if (cha_monomorphic_target != NULL) {
1113 // Hardwiring a virtual.
1114 // If we inlined because CHA revealed only a single target method,
1115 // then we are dependent on that target method not getting overridden
1116 // by dynamic class loading. Be sure to test the "static" receiver
1117 // dest_method here, as opposed to the actual receiver, which may
1118 // falsely lead us to believe that the receiver is final or private.
1119 dependencies()->assert_unique_concrete_method(actual_receiver, cha_monomorphic_target);
1120 return cha_monomorphic_target;
1121 }
1122
1123 // If the type is exact, we can still bind the method w/o a vcall.
1124 // (This case comes after CHA so we can see how much extra work it does.)
1125 if (actual_receiver_is_exact) {
1126 // In case of evolution, there is a dependence on every inlined method, since each
1127 // such method can be changed when its class is redefined.
1128 ciMethod* exact_method = callee->resolve_invoke(calling_klass, actual_receiver);
1129 if (exact_method != NULL) {
1130 if (PrintOpto) {
1131 tty->print(" Calling method via exact type @%d --- ", bci);
1132 exact_method->print_name();
1133 tty->cr();
1134 }
1135 return exact_method;
1136 }
1137 }
1138
1139 return NULL;
1140 }