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