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