duke@435: /* coleenp@4037: * Copyright (c) 1998, 2012, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "ci/ciCallSite.hpp" stefank@2314: #include "ci/ciMethodHandle.hpp" stefank@2314: #include "classfile/vmSymbols.hpp" twisti@2687: #include "compiler/compileBroker.hpp" stefank@2314: #include "compiler/compileLog.hpp" stefank@2314: #include "interpreter/linkResolver.hpp" stefank@2314: #include "opto/addnode.hpp" stefank@2314: #include "opto/callGenerator.hpp" stefank@2314: #include "opto/cfgnode.hpp" stefank@2314: #include "opto/mulnode.hpp" stefank@2314: #include "opto/parse.hpp" stefank@2314: #include "opto/rootnode.hpp" stefank@2314: #include "opto/runtime.hpp" stefank@2314: #include "opto/subnode.hpp" stefank@2314: #include "prims/nativeLookup.hpp" stefank@2314: #include "runtime/sharedRuntime.hpp" duke@435: roland@4357: void trace_type_profile(Compile* C, ciMethod *method, int depth, int bci, ciMethod *prof_method, ciKlass *prof_klass, int site_count, int receiver_count) { twisti@4104: if (TraceTypeProfile || PrintInlining NOT_PRODUCT(|| PrintOptoInlining)) { roland@4357: outputStream* out = tty; twisti@2687: if (!PrintInlining) { twisti@4104: if (NOT_PRODUCT(!PrintOpto &&) !PrintCompilation) { twisti@2687: method->print_short_name(); twisti@2687: tty->cr(); twisti@2687: } twisti@2687: CompileTask::print_inlining(prof_method, depth, bci); roland@4357: } else { roland@4357: out = C->print_inlining_stream(); duke@435: } roland@4357: CompileTask::print_inline_indent(depth, out); roland@4357: out->print(" \\-> TypeProfile (%d/%d counts) = ", receiver_count, site_count); roland@4357: stringStream ss; roland@4357: prof_klass->name()->print_symbol_on(&ss); roland@4357: out->print(ss.as_string()); roland@4357: out->cr(); duke@435: } duke@435: } duke@435: twisti@4414: CallGenerator* Compile::call_generator(ciMethod* callee, int vtable_index, bool call_does_dispatch, jrose@1592: JVMState* jvms, bool allow_inline, roland@4409: float prof_factor, bool allow_intrinsics, bool delayed_forbidden) { twisti@2903: ciMethod* caller = jvms->method(); twisti@2903: int bci = jvms->bci(); twisti@2903: Bytecodes::Code bytecode = caller->java_code_at_bci(bci); twisti@3969: guarantee(callee != NULL, "failed method resolution"); duke@435: duke@435: // Dtrace currently doesn't work unless all calls are vanilla kvn@1215: if (env()->dtrace_method_probes()) { duke@435: allow_inline = false; duke@435: } duke@435: duke@435: // Note: When we get profiling during stage-1 compiles, we want to pull duke@435: // from more specific profile data which pertains to this inlining. duke@435: // Right now, ignore the information in jvms->caller(), and do method[bci]. twisti@2903: ciCallProfile profile = caller->call_profile_at_bci(bci); duke@435: duke@435: // See how many times this site has been invoked. duke@435: int site_count = profile.count(); duke@435: int receiver_count = -1; twisti@4414: if (call_does_dispatch && UseTypeProfile && profile.has_receiver(0)) { duke@435: // Receivers in the profile structure are ordered by call counts duke@435: // so that the most called (major) receiver is profile.receiver(0). duke@435: receiver_count = profile.receiver_count(0); duke@435: } duke@435: duke@435: CompileLog* log = this->log(); duke@435: if (log != NULL) { duke@435: int rid = (receiver_count >= 0)? log->identify(profile.receiver(0)): -1; kvn@1686: int r2id = (rid != -1 && profile.has_receiver(1))? log->identify(profile.receiver(1)):-1; duke@435: log->begin_elem("call method='%d' count='%d' prof_factor='%g'", twisti@3969: log->identify(callee), site_count, prof_factor); twisti@4414: if (call_does_dispatch) log->print(" virtual='1'"); duke@435: if (allow_inline) log->print(" inline='1'"); duke@435: if (receiver_count >= 0) { duke@435: log->print(" receiver='%d' receiver_count='%d'", rid, receiver_count); duke@435: if (profile.has_receiver(1)) { duke@435: log->print(" receiver2='%d' receiver2_count='%d'", r2id, profile.receiver_count(1)); duke@435: } duke@435: } duke@435: log->end_elem(); duke@435: } duke@435: duke@435: // Special case the handling of certain common, profitable library duke@435: // methods. If these methods are replaced with specialized code, duke@435: // then we return it as the inlined version of the call. duke@435: // We do this before the strict f.p. check below because the duke@435: // intrinsics handle strict f.p. correctly. never@3631: if (allow_inline && allow_intrinsics) { twisti@4414: CallGenerator* cg = find_intrinsic(callee, call_does_dispatch); kvn@4205: if (cg != NULL) { kvn@4205: if (cg->is_predicted()) { kvn@4205: // Code without intrinsic but, hopefully, inlined. kvn@4205: CallGenerator* inline_cg = this->call_generator(callee, twisti@4414: vtable_index, call_does_dispatch, jvms, allow_inline, prof_factor, false); kvn@4205: if (inline_cg != NULL) { kvn@4205: cg = CallGenerator::for_predicted_intrinsic(cg, inline_cg); kvn@4205: } kvn@4205: } kvn@4205: return cg; kvn@4205: } duke@435: } duke@435: twisti@3050: // Do method handle calls. twisti@2178: // NOTE: This must happen before normal inlining logic below since twisti@2178: // MethodHandle.invoke* are native methods which obviously don't twisti@2178: // have bytecodes and so normal inlining fails. twisti@3969: if (callee->is_method_handle_intrinsic()) { roland@4409: CallGenerator* cg = CallGenerator::for_method_handle_call(jvms, caller, callee, delayed_forbidden); twisti@4414: assert(cg == NULL || !delayed_forbidden || !cg->is_late_inline() || cg->is_mh_late_inline(), "unexpected CallGenerator"); roland@4409: return cg; twisti@2178: } twisti@2178: duke@435: // Do not inline strict fp into non-strict code, or the reverse twisti@3969: if (caller->is_strict() ^ callee->is_strict()) { duke@435: allow_inline = false; duke@435: } duke@435: duke@435: // Attempt to inline... duke@435: if (allow_inline) { duke@435: // The profile data is only partly attributable to this caller, duke@435: // scale back the call site information. duke@435: float past_uses = jvms->method()->scale_count(site_count, prof_factor); duke@435: // This is the number of times we expect the call code to be used. duke@435: float expected_uses = past_uses; duke@435: duke@435: // Try inlining a bytecoded method: twisti@4414: if (!call_does_dispatch) { duke@435: InlineTree* ilt; duke@435: if (UseOldInlining) { duke@435: ilt = InlineTree::find_subtree_from_root(this->ilt(), jvms->caller(), jvms->method()); duke@435: } else { duke@435: // Make a disembodied, stateless ILT. duke@435: // TO DO: When UseOldInlining is removed, copy the ILT code elsewhere. duke@435: float site_invoke_ratio = prof_factor; duke@435: // Note: ilt is for the root of this parse, not the present call site. never@2981: ilt = new InlineTree(this, jvms->method(), jvms->caller(), site_invoke_ratio, MaxInlineLevel); duke@435: } duke@435: WarmCallInfo scratch_ci; duke@435: if (!UseOldInlining) twisti@3969: scratch_ci.init(jvms, callee, profile, prof_factor); roland@4409: bool should_delay = false; roland@4409: WarmCallInfo* ci = ilt->ok_to_inline(callee, jvms, profile, &scratch_ci, should_delay); duke@435: assert(ci != &scratch_ci, "do not let this pointer escape"); duke@435: bool allow_inline = (ci != NULL && !ci->is_cold()); duke@435: bool require_inline = (allow_inline && ci->is_hot()); duke@435: duke@435: if (allow_inline) { twisti@3969: CallGenerator* cg = CallGenerator::for_inline(callee, expected_uses); roland@4409: roland@4409: if (require_inline && cg != NULL) { never@1515: // Delay the inlining of this method to give us the never@1515: // opportunity to perform some high level optimizations never@1515: // first. roland@4409: if (should_delay_inlining(callee, jvms)) { roland@4409: assert(!delayed_forbidden, "strange"); roland@4409: return CallGenerator::for_string_late_inline(callee, cg); roland@4409: } else if ((should_delay || AlwaysIncrementalInline) && !delayed_forbidden) { roland@4409: return CallGenerator::for_late_inline(callee, cg); roland@4409: } never@1515: } roland@4409: if (cg == NULL || should_delay) { duke@435: // Fall through. duke@435: } else if (require_inline || !InlineWarmCalls) { duke@435: return cg; duke@435: } else { twisti@4414: CallGenerator* cold_cg = call_generator(callee, vtable_index, call_does_dispatch, jvms, false, prof_factor); duke@435: return CallGenerator::for_warm_call(ci, cold_cg, cg); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Try using the type profile. twisti@4414: if (call_does_dispatch && site_count > 0 && receiver_count > 0) { duke@435: // The major receiver's count >= TypeProfileMajorReceiverPercent of site_count. duke@435: bool have_major_receiver = (100.*profile.receiver_prob(0) >= (float)TypeProfileMajorReceiverPercent); duke@435: ciMethod* receiver_method = NULL; duke@435: if (have_major_receiver || profile.morphism() == 1 || duke@435: (profile.morphism() == 2 && UseBimorphicInlining)) { duke@435: // receiver_method = profile.method(); duke@435: // Profiles do not suggest methods now. Look it up in the major receiver. twisti@3969: receiver_method = callee->resolve_invoke(jvms->method()->holder(), duke@435: profile.receiver(0)); duke@435: } duke@435: if (receiver_method != NULL) { duke@435: // The single majority receiver sufficiently outweighs the minority. duke@435: CallGenerator* hit_cg = this->call_generator(receiver_method, twisti@4414: vtable_index, !call_does_dispatch, jvms, allow_inline, prof_factor); duke@435: if (hit_cg != NULL) { duke@435: // Look up second receiver. duke@435: CallGenerator* next_hit_cg = NULL; duke@435: ciMethod* next_receiver_method = NULL; duke@435: if (profile.morphism() == 2 && UseBimorphicInlining) { twisti@3969: next_receiver_method = callee->resolve_invoke(jvms->method()->holder(), duke@435: profile.receiver(1)); duke@435: if (next_receiver_method != NULL) { duke@435: next_hit_cg = this->call_generator(next_receiver_method, twisti@4414: vtable_index, !call_does_dispatch, jvms, duke@435: allow_inline, prof_factor); duke@435: if (next_hit_cg != NULL && !next_hit_cg->is_inline() && duke@435: have_major_receiver && UseOnlyInlinedBimorphic) { duke@435: // Skip if we can't inline second receiver's method duke@435: next_hit_cg = NULL; duke@435: } duke@435: } duke@435: } duke@435: CallGenerator* miss_cg; kvn@1641: Deoptimization::DeoptReason reason = (profile.morphism() == 2) ? kvn@1641: Deoptimization::Reason_bimorphic : kvn@1641: Deoptimization::Reason_class_check; duke@435: if (( profile.morphism() == 1 || duke@435: (profile.morphism() == 2 && next_hit_cg != NULL) ) && kvn@1641: !too_many_traps(jvms->method(), jvms->bci(), reason) duke@435: ) { duke@435: // Generate uncommon trap for class check failure path duke@435: // in case of monomorphic or bimorphic virtual call site. twisti@3969: miss_cg = CallGenerator::for_uncommon_trap(callee, reason, duke@435: Deoptimization::Action_maybe_recompile); duke@435: } else { duke@435: // Generate virtual call for class check failure path duke@435: // in case of polymorphic virtual call site. twisti@3969: miss_cg = CallGenerator::for_virtual_call(callee, vtable_index); duke@435: } duke@435: if (miss_cg != NULL) { duke@435: if (next_hit_cg != NULL) { roland@4357: trace_type_profile(C, jvms->method(), jvms->depth() - 1, jvms->bci(), next_receiver_method, profile.receiver(1), site_count, profile.receiver_count(1)); duke@435: // We don't need to record dependency on a receiver here and below. duke@435: // Whenever we inline, the dependency is added by Parse::Parse(). duke@435: miss_cg = CallGenerator::for_predicted_call(profile.receiver(1), miss_cg, next_hit_cg, PROB_MAX); duke@435: } duke@435: if (miss_cg != NULL) { roland@4357: trace_type_profile(C, jvms->method(), jvms->depth() - 1, jvms->bci(), receiver_method, profile.receiver(0), site_count, receiver_count); twisti@3313: CallGenerator* cg = CallGenerator::for_predicted_call(profile.receiver(0), miss_cg, hit_cg, profile.receiver_prob(0)); duke@435: if (cg != NULL) return cg; duke@435: } duke@435: } duke@435: } duke@435: } duke@435: } duke@435: } duke@435: duke@435: // There was no special inlining tactic, or it bailed out. duke@435: // Use a more generic tactic, like a simple call. twisti@4414: if (call_does_dispatch) { twisti@3969: return CallGenerator::for_virtual_call(callee, vtable_index); duke@435: } else { duke@435: // Class Hierarchy Analysis or Type Profile reveals a unique target, duke@435: // or it is a static or special call. twisti@3969: return CallGenerator::for_direct_call(callee, should_delay_inlining(callee, jvms)); duke@435: } duke@435: } duke@435: never@1515: // Return true for methods that shouldn't be inlined early so that never@1515: // they are easier to analyze and optimize as intrinsics. never@1515: bool Compile::should_delay_inlining(ciMethod* call_method, JVMState* jvms) { never@1515: if (has_stringbuilder()) { never@1515: never@1515: if ((call_method->holder() == C->env()->StringBuilder_klass() || never@1515: call_method->holder() == C->env()->StringBuffer_klass()) && never@1515: (jvms->method()->holder() == C->env()->StringBuilder_klass() || never@1515: jvms->method()->holder() == C->env()->StringBuffer_klass())) { never@1515: // Delay SB calls only when called from non-SB code never@1515: return false; never@1515: } never@1515: never@1515: switch (call_method->intrinsic_id()) { never@1515: case vmIntrinsics::_StringBuilder_void: never@1515: case vmIntrinsics::_StringBuilder_int: never@1515: case vmIntrinsics::_StringBuilder_String: never@1515: case vmIntrinsics::_StringBuilder_append_char: never@1515: case vmIntrinsics::_StringBuilder_append_int: never@1515: case vmIntrinsics::_StringBuilder_append_String: never@1515: case vmIntrinsics::_StringBuilder_toString: never@1515: case vmIntrinsics::_StringBuffer_void: never@1515: case vmIntrinsics::_StringBuffer_int: never@1515: case vmIntrinsics::_StringBuffer_String: never@1515: case vmIntrinsics::_StringBuffer_append_char: never@1515: case vmIntrinsics::_StringBuffer_append_int: never@1515: case vmIntrinsics::_StringBuffer_append_String: never@1515: case vmIntrinsics::_StringBuffer_toString: never@1515: case vmIntrinsics::_Integer_toString: never@1515: return true; never@1515: never@1515: case vmIntrinsics::_String_String: never@1515: { never@1515: Node* receiver = jvms->map()->in(jvms->argoff() + 1); never@1515: if (receiver->is_Proj() && receiver->in(0)->is_CallStaticJava()) { never@1515: CallStaticJavaNode* csj = receiver->in(0)->as_CallStaticJava(); never@1515: ciMethod* m = csj->method(); never@1515: if (m != NULL && never@1515: (m->intrinsic_id() == vmIntrinsics::_StringBuffer_toString || never@1515: m->intrinsic_id() == vmIntrinsics::_StringBuilder_toString)) never@1515: // Delay String.(new SB()) never@1515: return true; never@1515: } never@1515: return false; never@1515: } never@1515: never@1515: default: never@1515: return false; never@1515: } never@1515: } never@1515: return false; never@1515: } never@1515: duke@435: duke@435: // uncommon-trap call-sites where callee is unloaded, uninitialized or will not link duke@435: bool Parse::can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass* klass) { duke@435: // Additional inputs to consider... duke@435: // bc = bc() duke@435: // caller = method() duke@435: // iter().get_method_holder_index() duke@435: assert( dest_method->is_loaded(), "ciTypeFlow should not let us get here" ); duke@435: // Interface classes can be loaded & linked and never get around to duke@435: // being initialized. Uncommon-trap for not-initialized static or duke@435: // v-calls. Let interface calls happen. twisti@1572: ciInstanceKlass* holder_klass = dest_method->holder(); never@2000: if (!holder_klass->is_being_initialized() && never@2000: !holder_klass->is_initialized() && duke@435: !holder_klass->is_interface()) { duke@435: uncommon_trap(Deoptimization::Reason_uninitialized, duke@435: Deoptimization::Action_reinterpret, duke@435: holder_klass); duke@435: return true; duke@435: } duke@435: bharadwaj@4268: assert(dest_method->is_loaded(), "dest_method: typeflow responsibility"); duke@435: return false; duke@435: } duke@435: duke@435: duke@435: //------------------------------do_call---------------------------------------- duke@435: // Handle your basic call. Inline if we can & want to, else just setup call. duke@435: void Parse::do_call() { duke@435: // It's likely we are going to add debug info soon. duke@435: // Also, if we inline a guy who eventually needs debug info for this JVMS, duke@435: // our contribution to it is cleaned up right here. duke@435: kill_dead_locals(); duke@435: duke@435: // Set frequently used booleans twisti@4021: const bool is_virtual = bc() == Bytecodes::_invokevirtual; twisti@4021: const bool is_virtual_or_interface = is_virtual || bc() == Bytecodes::_invokeinterface; twisti@4313: const bool has_receiver = Bytecodes::has_receiver(bc()); duke@435: duke@435: // Find target being called duke@435: bool will_link; twisti@4021: ciSignature* declared_signature = NULL; twisti@4021: ciMethod* orig_callee = iter().get_method(will_link, &declared_signature); // callee in the bytecode twisti@4021: ciInstanceKlass* holder_klass = orig_callee->holder(); twisti@4021: ciKlass* holder = iter().get_declared_method_holder(); duke@435: ciInstanceKlass* klass = ciEnv::get_instance_klass_for_declared_method_holder(holder); twisti@4021: assert(declared_signature != NULL, "cannot be null"); duke@435: duke@435: // uncommon-trap when callee is unloaded, uninitialized or will not link duke@435: // bailout when too many arguments for register representation twisti@4021: if (!will_link || can_not_compile_call_site(orig_callee, klass)) { duke@435: #ifndef PRODUCT duke@435: if (PrintOpto && (Verbose || WizardMode)) { duke@435: method()->print_name(); tty->print_cr(" can not compile call at bci %d to:", bci()); twisti@4021: orig_callee->print_name(); tty->cr(); duke@435: } duke@435: #endif duke@435: return; duke@435: } duke@435: assert(holder_klass->is_loaded(), ""); twisti@3969: //assert((bc_callee->is_static() || is_invokedynamic) == !has_receiver , "must match bc"); // XXX invokehandle (cur_bc_raw) duke@435: // Note: this takes into account invokeinterface of methods declared in java/lang/Object, duke@435: // which should be invokevirtuals but according to the VM spec may be invokeinterfaces duke@435: assert(holder_klass->is_interface() || holder_klass->super() == NULL || (bc() != Bytecodes::_invokeinterface), "must match bc"); duke@435: // Note: In the absence of miranda methods, an abstract class K can perform duke@435: // an invokevirtual directly on an interface method I.m if K implements I. duke@435: twisti@4313: // orig_callee is the resolved callee which's signature includes the twisti@4313: // appendix argument. twisti@4021: const int nargs = orig_callee->arg_size(); twisti@4414: const bool is_signature_polymorphic = MethodHandles::is_signature_polymorphic(orig_callee->intrinsic_id()); twisti@3969: twisti@3969: // Push appendix argument (MethodType, CallSite, etc.), if one. twisti@3969: if (iter().has_appendix()) { twisti@3969: ciObject* appendix_arg = iter().get_appendix(); twisti@3969: const TypeOopPtr* appendix_arg_type = TypeOopPtr::make_from_constant(appendix_arg); twisti@3969: Node* appendix_arg_node = _gvn.makecon(appendix_arg_type); twisti@3969: push(appendix_arg_node); twisti@3969: } twisti@3969: duke@435: // --------------------- duke@435: // Does Class Hierarchy Analysis reveal only a single target of a v-call? duke@435: // Then we may inline or make a static call, but become dependent on there being only 1 target. duke@435: // Does the call-site type profile reveal only one receiver? duke@435: // Then we may introduce a run-time check and inline on the path where it succeeds. duke@435: // The other path may uncommon_trap, check for another receiver, or do a v-call. duke@435: twisti@4414: // Try to get the most accurate receiver type twisti@4414: ciMethod* callee = orig_callee; twisti@4414: int vtable_index = Method::invalid_vtable_index; twisti@4414: bool call_does_dispatch = false; duke@435: duke@435: if (is_virtual_or_interface) { duke@435: Node* receiver_node = stack(sp() - nargs); duke@435: const TypeOopPtr* receiver_type = _gvn.type(receiver_node)->isa_oopptr(); twisti@4414: // call_does_dispatch and vtable_index are out-parameters. They might be changed. twisti@4414: callee = C->optimize_virtual_call(method(), bci(), klass, orig_callee, receiver_type, twisti@4414: is_virtual, twisti@4414: call_does_dispatch, vtable_index); // out-parameters duke@435: } duke@435: duke@435: // Note: It's OK to try to inline a virtual call. duke@435: // The call generator will not attempt to inline a polymorphic call duke@435: // unless it knows how to optimize the receiver dispatch. duke@435: bool try_inline = (C->do_inlining() || InlineAccessors); duke@435: duke@435: // --------------------- twisti@3969: dec_sp(nargs); // Temporarily pop args for JVM state of call duke@435: JVMState* jvms = sync_jvms(); duke@435: duke@435: // --------------------- duke@435: // Decide call tactic. duke@435: // This call checks with CHA, the interpreter profile, intrinsics table, etc. duke@435: // It decides whether inlining is desirable or not. twisti@4414: CallGenerator* cg = C->call_generator(callee, vtable_index, call_does_dispatch, jvms, try_inline, prof_factor()); twisti@3969: twisti@4021: // NOTE: Don't use orig_callee and callee after this point! Use cg->method() instead. twisti@4021: orig_callee = callee = NULL; duke@435: duke@435: // --------------------- duke@435: // Round double arguments before call twisti@3969: round_double_arguments(cg->method()); duke@435: duke@435: #ifndef PRODUCT duke@435: // bump global counters for calls twisti@3969: count_compiled_calls(/*at_method_entry*/ false, cg->is_inline()); duke@435: duke@435: // Record first part of parsing work for this call duke@435: parse_histogram()->record_change(); duke@435: #endif // not PRODUCT duke@435: duke@435: assert(jvms == this->jvms(), "still operating on the right JVMS"); duke@435: assert(jvms_in_sync(), "jvms must carry full info into CG"); duke@435: duke@435: // save across call, for a subsequent cast_not_null. duke@435: Node* receiver = has_receiver ? argument(0) : NULL; duke@435: duke@435: // Bump method data counters (We profile *before* the call is made duke@435: // because exceptions don't return to the call site.) duke@435: profile_call(receiver); duke@435: twisti@3969: JVMState* new_jvms = cg->generate(jvms); twisti@3969: if (new_jvms == NULL) { duke@435: // When inlining attempt fails (e.g., too many arguments), duke@435: // it may contaminate the current compile state, making it duke@435: // impossible to pull back and try again. Once we call duke@435: // cg->generate(), we are committed. If it fails, the whole duke@435: // compilation task is compromised. duke@435: if (failing()) return; never@3631: duke@435: // This can happen if a library intrinsic is available, but refuses duke@435: // the call site, perhaps because it did not match a pattern the never@3631: // intrinsic was expecting to optimize. Should always be possible to never@3631: // get a normal java call that may inline in that case twisti@4414: cg = C->call_generator(cg->method(), vtable_index, call_does_dispatch, jvms, try_inline, prof_factor(), /* allow_intrinsics= */ false); duke@435: if ((new_jvms = cg->generate(jvms)) == NULL) { duke@435: guarantee(failing(), "call failed to generate: calls should work"); duke@435: return; duke@435: } duke@435: } duke@435: duke@435: if (cg->is_inline()) { never@502: // Accumulate has_loops estimate twisti@3969: C->set_has_loops(C->has_loops() || cg->method()->has_loops()); twisti@3969: C->env()->notice_inlined_method(cg->method()); duke@435: } duke@435: duke@435: // Reset parser state from [new_]jvms, which now carries results of the call. duke@435: // Return value (if any) is already pushed on the stack by the cg. duke@435: add_exception_states_from(new_jvms); duke@435: if (new_jvms->map()->control() == top()) { duke@435: stop_and_kill_map(); duke@435: } else { duke@435: assert(new_jvms->same_calls_as(jvms), "method/bci left unchanged"); duke@435: set_jvms(new_jvms); duke@435: } duke@435: duke@435: if (!stopped()) { duke@435: // This was some sort of virtual call, which did a null check for us. duke@435: // Now we can assert receiver-not-null, on the normal return path. duke@435: if (receiver != NULL && cg->is_virtual()) { duke@435: Node* cast = cast_not_null(receiver); duke@435: // %%% assert(receiver == cast, "should already have cast the receiver"); duke@435: } duke@435: duke@435: // Round double result after a call from strict to non-strict code twisti@3969: round_double_result(cg->method()); twisti@3969: twisti@3969: ciType* rtype = cg->method()->return_type(); twisti@4414: ciType* ctype = declared_signature->return_type(); twisti@4414: twisti@4414: if (Bytecodes::has_optional_appendix(iter().cur_bc_raw()) || is_signature_polymorphic) { twisti@3969: // Be careful here with return types. twisti@3969: if (ctype != rtype) { twisti@3969: BasicType rt = rtype->basic_type(); twisti@3969: BasicType ct = ctype->basic_type(); twisti@3969: if (ct == T_VOID) { twisti@3969: // It's OK for a method to return a value that is discarded. twisti@3969: // The discarding does not require any special action from the caller. twisti@3969: // The Java code knows this, at VerifyType.isNullConversion. twisti@3969: pop_node(rt); // whatever it was, pop it twisti@3969: } else if (rt == T_INT || is_subword_type(rt)) { twisti@4414: // Nothing. These cases are handled in lambda form bytecode. twisti@4414: assert(ct == T_INT || is_subword_type(ct), err_msg_res("must match: rt=%s, ct=%s", type2name(rt), type2name(ct))); twisti@3973: } else if (rt == T_OBJECT || rt == T_ARRAY) { twisti@3973: assert(ct == T_OBJECT || ct == T_ARRAY, err_msg_res("rt=%s, ct=%s", type2name(rt), type2name(ct))); twisti@3969: if (ctype->is_loaded()) { twisti@4021: const TypeOopPtr* arg_type = TypeOopPtr::make_from_klass(rtype->as_klass()); twisti@4021: const Type* sig_type = TypeOopPtr::make_from_klass(ctype->as_klass()); twisti@4021: if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { twisti@4414: Node* retnode = pop(); kvn@4115: Node* cast_obj = _gvn.transform(new (C) CheckCastPPNode(control(), retnode, sig_type)); twisti@4021: push(cast_obj); twisti@3969: } twisti@3969: } twisti@3969: } else { twisti@4414: assert(rt == ct, err_msg_res("unexpected mismatch: rt=%s, ct=%s", type2name(rt), type2name(ct))); twisti@3969: // push a zero; it's better than getting an oop/int mismatch twisti@4414: pop_node(rt); twisti@4414: Node* retnode = zerocon(ct); twisti@3969: push_node(ct, retnode); twisti@3969: } twisti@3969: // Now that the value is well-behaved, continue with the call-site type. twisti@3969: rtype = ctype; twisti@3969: } twisti@4414: } else { twisti@4447: // Symbolic resolution enforces the types to be the same. twisti@4447: // NOTE: We must relax the assert for unloaded types because two twisti@4447: // different ciType instances of the same unloaded class type twisti@4447: // can appear to be "loaded" by different loaders (depending on twisti@4447: // the accessing class). twisti@4447: assert(!rtype->is_loaded() || !ctype->is_loaded() || rtype == ctype, twisti@4447: err_msg_res("mismatched return types: rtype=%s, ctype=%s", rtype->name(), ctype->name())); twisti@3969: } duke@435: duke@435: // If the return type of the method is not loaded, assert that the duke@435: // value we got is a null. Otherwise, we need to recompile. twisti@3969: if (!rtype->is_loaded()) { duke@435: #ifndef PRODUCT duke@435: if (PrintOpto && (Verbose || WizardMode)) { duke@435: method()->print_name(); tty->print_cr(" asserting nullness of result at bci: %d", bci()); twisti@3969: cg->method()->print_name(); tty->cr(); duke@435: } duke@435: #endif duke@435: if (C->log() != NULL) { duke@435: C->log()->elem("assert_null reason='return' klass='%d'", twisti@3969: C->log()->identify(rtype)); duke@435: } duke@435: // If there is going to be a trap, put it at the next bytecode: duke@435: set_bci(iter().next_bci()); twisti@4313: null_assert(peek()); duke@435: set_bci(iter().cur_bci()); // put it back duke@435: } duke@435: } duke@435: duke@435: // Restart record of parsing work after possible inlining of call duke@435: #ifndef PRODUCT duke@435: parse_histogram()->set_initial_state(bc()); duke@435: #endif duke@435: } duke@435: duke@435: //---------------------------catch_call_exceptions----------------------------- duke@435: // Put a Catch and CatchProj nodes behind a just-created call. duke@435: // Send their caught exceptions to the proper handler. duke@435: // This may be used after a call to the rethrow VM stub, duke@435: // when it is needed to process unloaded exception classes. duke@435: void Parse::catch_call_exceptions(ciExceptionHandlerStream& handlers) { duke@435: // Exceptions are delivered through this channel: duke@435: Node* i_o = this->i_o(); duke@435: duke@435: // Add a CatchNode. duke@435: GrowableArray* bcis = new (C->node_arena()) GrowableArray(C->node_arena(), 8, 0, -1); duke@435: GrowableArray* extypes = new (C->node_arena()) GrowableArray(C->node_arena(), 8, 0, NULL); duke@435: GrowableArray* saw_unloaded = new (C->node_arena()) GrowableArray(C->node_arena(), 8, 0, 0); duke@435: duke@435: for (; !handlers.is_done(); handlers.next()) { duke@435: ciExceptionHandler* h = handlers.handler(); duke@435: int h_bci = h->handler_bci(); duke@435: ciInstanceKlass* h_klass = h->is_catch_all() ? env()->Throwable_klass() : h->catch_klass(); duke@435: // Do not introduce unloaded exception types into the graph: duke@435: if (!h_klass->is_loaded()) { duke@435: if (saw_unloaded->contains(h_bci)) { duke@435: /* We've already seen an unloaded exception with h_bci, duke@435: so don't duplicate. Duplication will cause the CatchNode to be duke@435: unnecessarily large. See 4713716. */ duke@435: continue; duke@435: } else { duke@435: saw_unloaded->append(h_bci); duke@435: } duke@435: } duke@435: const Type* h_extype = TypeOopPtr::make_from_klass(h_klass); duke@435: // (We use make_from_klass because it respects UseUniqueSubclasses.) duke@435: h_extype = h_extype->join(TypeInstPtr::NOTNULL); duke@435: assert(!h_extype->empty(), "sanity"); duke@435: // Note: It's OK if the BCIs repeat themselves. duke@435: bcis->append(h_bci); duke@435: extypes->append(h_extype); duke@435: } duke@435: duke@435: int len = bcis->length(); kvn@4115: CatchNode *cn = new (C) CatchNode(control(), i_o, len+1); duke@435: Node *catch_ = _gvn.transform(cn); duke@435: duke@435: // now branch with the exception state to each of the (potential) duke@435: // handlers duke@435: for(int i=0; i < len; i++) { duke@435: // Setup JVM state to enter the handler. duke@435: PreserveJVMState pjvms(this); duke@435: // Locals are just copied from before the call. duke@435: // Get control from the CatchNode. duke@435: int handler_bci = bcis->at(i); kvn@4115: Node* ctrl = _gvn.transform( new (C) CatchProjNode(catch_, i+1,handler_bci)); duke@435: // This handler cannot happen? duke@435: if (ctrl == top()) continue; duke@435: set_control(ctrl); duke@435: duke@435: // Create exception oop duke@435: const TypeInstPtr* extype = extypes->at(i)->is_instptr(); kvn@4115: Node *ex_oop = _gvn.transform(new (C) CreateExNode(extypes->at(i), ctrl, i_o)); duke@435: duke@435: // Handle unloaded exception classes. duke@435: if (saw_unloaded->contains(handler_bci)) { duke@435: // An unloaded exception type is coming here. Do an uncommon trap. duke@435: #ifndef PRODUCT duke@435: // We do not expect the same handler bci to take both cold unloaded duke@435: // and hot loaded exceptions. But, watch for it. twisti@3970: if ((Verbose || WizardMode) && extype->is_loaded()) { twisti@3970: tty->print("Warning: Handler @%d takes mixed loaded/unloaded exceptions in ", bci()); duke@435: method()->print_name(); tty->cr(); duke@435: } else if (PrintOpto && (Verbose || WizardMode)) { duke@435: tty->print("Bailing out on unloaded exception type "); duke@435: extype->klass()->print_name(); duke@435: tty->print(" at bci:%d in ", bci()); duke@435: method()->print_name(); tty->cr(); duke@435: } duke@435: #endif duke@435: // Emit an uncommon trap instead of processing the block. duke@435: set_bci(handler_bci); duke@435: push_ex_oop(ex_oop); duke@435: uncommon_trap(Deoptimization::Reason_unloaded, duke@435: Deoptimization::Action_reinterpret, duke@435: extype->klass(), "!loaded exception"); duke@435: set_bci(iter().cur_bci()); // put it back duke@435: continue; duke@435: } duke@435: duke@435: // go to the exception handler duke@435: if (handler_bci < 0) { // merge with corresponding rethrow node duke@435: throw_to_exit(make_exception_state(ex_oop)); duke@435: } else { // Else jump to corresponding handle duke@435: push_ex_oop(ex_oop); // Clear stack and push just the oop. duke@435: merge_exception(handler_bci); duke@435: } duke@435: } duke@435: duke@435: // The first CatchProj is for the normal return. duke@435: // (Note: If this is a call to rethrow_Java, this node goes dead.) kvn@4115: set_control(_gvn.transform( new (C) CatchProjNode(catch_, CatchProjNode::fall_through_index, CatchProjNode::no_handler_bci))); duke@435: } duke@435: duke@435: duke@435: //----------------------------catch_inline_exceptions-------------------------- duke@435: // Handle all exceptions thrown by an inlined method or individual bytecode. duke@435: // Common case 1: we have no handler, so all exceptions merge right into duke@435: // the rethrow case. duke@435: // Case 2: we have some handlers, with loaded exception klasses that have duke@435: // no subklasses. We do a Deutsch-Shiffman style type-check on the incoming duke@435: // exception oop and branch to the handler directly. duke@435: // Case 3: We have some handlers with subklasses or are not loaded at duke@435: // compile-time. We have to call the runtime to resolve the exception. duke@435: // So we insert a RethrowCall and all the logic that goes with it. duke@435: void Parse::catch_inline_exceptions(SafePointNode* ex_map) { duke@435: // Caller is responsible for saving away the map for normal control flow! duke@435: assert(stopped(), "call set_map(NULL) first"); duke@435: assert(method()->has_exception_handlers(), "don't come here w/o work to do"); duke@435: duke@435: Node* ex_node = saved_ex_oop(ex_map); duke@435: if (ex_node == top()) { duke@435: // No action needed. duke@435: return; duke@435: } duke@435: const TypeInstPtr* ex_type = _gvn.type(ex_node)->isa_instptr(); duke@435: NOT_PRODUCT(if (ex_type==NULL) tty->print_cr("*** Exception not InstPtr")); duke@435: if (ex_type == NULL) duke@435: ex_type = TypeOopPtr::make_from_klass(env()->Throwable_klass())->is_instptr(); duke@435: duke@435: // determine potential exception handlers duke@435: ciExceptionHandlerStream handlers(method(), bci(), duke@435: ex_type->klass()->as_instance_klass(), duke@435: ex_type->klass_is_exact()); duke@435: duke@435: // Start executing from the given throw state. (Keep its stack, for now.) duke@435: // Get the exception oop as known at compile time. duke@435: ex_node = use_exception_state(ex_map); duke@435: duke@435: // Get the exception oop klass from its header duke@435: Node* ex_klass_node = NULL; duke@435: if (has_ex_handler() && !ex_type->klass_is_exact()) { duke@435: Node* p = basic_plus_adr( ex_node, ex_node, oopDesc::klass_offset_in_bytes()); kvn@599: ex_klass_node = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT) ); duke@435: duke@435: // Compute the exception klass a little more cleverly. duke@435: // Obvious solution is to simple do a LoadKlass from the 'ex_node'. duke@435: // However, if the ex_node is a PhiNode, I'm going to do a LoadKlass for duke@435: // each arm of the Phi. If I know something clever about the exceptions duke@435: // I'm loading the class from, I can replace the LoadKlass with the duke@435: // klass constant for the exception oop. duke@435: if( ex_node->is_Phi() ) { kvn@4115: ex_klass_node = new (C) PhiNode( ex_node->in(0), TypeKlassPtr::OBJECT ); duke@435: for( uint i = 1; i < ex_node->req(); i++ ) { duke@435: Node* p = basic_plus_adr( ex_node->in(i), ex_node->in(i), oopDesc::klass_offset_in_bytes() ); kvn@599: Node* k = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT) ); duke@435: ex_klass_node->init_req( i, k ); duke@435: } duke@435: _gvn.set_type(ex_klass_node, TypeKlassPtr::OBJECT); duke@435: duke@435: } duke@435: } duke@435: duke@435: // Scan the exception table for applicable handlers. duke@435: // If none, we can call rethrow() and be done! duke@435: // If precise (loaded with no subklasses), insert a D.S. style duke@435: // pointer compare to the correct handler and loop back. duke@435: // If imprecise, switch to the Rethrow VM-call style handling. duke@435: duke@435: int remaining = handlers.count_remaining(); duke@435: duke@435: // iterate through all entries sequentially duke@435: for (;!handlers.is_done(); handlers.next()) { duke@435: ciExceptionHandler* handler = handlers.handler(); duke@435: duke@435: if (handler->is_rethrow()) { duke@435: // If we fell off the end of the table without finding an imprecise duke@435: // exception klass (and without finding a generic handler) then we duke@435: // know this exception is not handled in this method. We just rethrow duke@435: // the exception into the caller. duke@435: throw_to_exit(make_exception_state(ex_node)); duke@435: return; duke@435: } duke@435: duke@435: // exception handler bci range covers throw_bci => investigate further duke@435: int handler_bci = handler->handler_bci(); duke@435: duke@435: if (remaining == 1) { duke@435: push_ex_oop(ex_node); // Push exception oop for handler duke@435: #ifndef PRODUCT duke@435: if (PrintOpto && WizardMode) { duke@435: tty->print_cr(" Catching every inline exception bci:%d -> handler_bci:%d", bci(), handler_bci); duke@435: } duke@435: #endif duke@435: merge_exception(handler_bci); // jump to handler duke@435: return; // No more handling to be done here! duke@435: } duke@435: never@1779: // Get the handler's klass never@1779: ciInstanceKlass* klass = handler->catch_klass(); duke@435: never@1779: if (!klass->is_loaded()) { // klass is not loaded? never@1779: // fall through into catch_call_exceptions which will emit a never@1779: // handler with an uncommon trap. never@1779: break; duke@435: } duke@435: duke@435: if (klass->is_interface()) // should not happen, but... duke@435: break; // bail out duke@435: never@1779: // Check the type of the exception against the catch type duke@435: const TypeKlassPtr *tk = TypeKlassPtr::make(klass); duke@435: Node* con = _gvn.makecon(tk); never@1779: Node* not_subtype_ctrl = gen_subtype_check(ex_klass_node, con); never@1779: if (!stopped()) { never@1779: PreserveJVMState pjvms(this); never@1779: const TypeInstPtr* tinst = TypeOopPtr::make_from_klass_unique(klass)->cast_to_ptr_type(TypePtr::NotNull)->is_instptr(); never@1779: assert(klass->has_subklass() || tinst->klass_is_exact(), "lost exactness"); kvn@4115: Node* ex_oop = _gvn.transform(new (C) CheckCastPPNode(control(), ex_node, tinst)); duke@435: push_ex_oop(ex_oop); // Push exception oop for handler duke@435: #ifndef PRODUCT duke@435: if (PrintOpto && WizardMode) { duke@435: tty->print(" Catching inline exception bci:%d -> handler_bci:%d -- ", bci(), handler_bci); duke@435: klass->print_name(); duke@435: tty->cr(); duke@435: } duke@435: #endif duke@435: merge_exception(handler_bci); duke@435: } never@1779: set_control(not_subtype_ctrl); duke@435: duke@435: // Come here if exception does not match handler. duke@435: // Carry on with more handler checks. duke@435: --remaining; duke@435: } duke@435: duke@435: assert(!stopped(), "you should return if you finish the chain"); duke@435: duke@435: // Oops, need to call into the VM to resolve the klasses at runtime. duke@435: // Note: This call must not deoptimize, since it is not a real at this bci! duke@435: kill_dead_locals(); duke@435: duke@435: make_runtime_call(RC_NO_LEAF | RC_MUST_THROW, duke@435: OptoRuntime::rethrow_Type(), duke@435: OptoRuntime::rethrow_stub(), duke@435: NULL, NULL, duke@435: ex_node); duke@435: duke@435: // Rethrow is a pure call, no side effects, only a result. duke@435: // The result cannot be allocated, so we use I_O duke@435: duke@435: // Catch exceptions from the rethrow duke@435: catch_call_exceptions(handlers); duke@435: } duke@435: duke@435: duke@435: // (Note: Moved add_debug_info into GraphKit::add_safepoint_edges.) duke@435: duke@435: duke@435: #ifndef PRODUCT duke@435: void Parse::count_compiled_calls(bool at_method_entry, bool is_inline) { duke@435: if( CountCompiledCalls ) { duke@435: if( at_method_entry ) { duke@435: // bump invocation counter if top method (for statistics) duke@435: if (CountCompiledCalls && depth() == 1) { coleenp@4037: const TypePtr* addr_type = TypeMetadataPtr::make(method()); duke@435: Node* adr1 = makecon(addr_type); coleenp@4037: Node* adr2 = basic_plus_adr(adr1, adr1, in_bytes(Method::compiled_invocation_counter_offset())); duke@435: increment_counter(adr2); duke@435: } duke@435: } else if (is_inline) { duke@435: switch (bc()) { duke@435: case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_inlined_calls_addr()); break; duke@435: case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_inlined_interface_calls_addr()); break; duke@435: case Bytecodes::_invokestatic: jrose@1161: case Bytecodes::_invokedynamic: duke@435: case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_inlined_static_calls_addr()); break; duke@435: default: fatal("unexpected call bytecode"); duke@435: } duke@435: } else { duke@435: switch (bc()) { duke@435: case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_normal_calls_addr()); break; duke@435: case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_interface_calls_addr()); break; duke@435: case Bytecodes::_invokestatic: jrose@1161: case Bytecodes::_invokedynamic: duke@435: case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_static_calls_addr()); break; duke@435: default: fatal("unexpected call bytecode"); duke@435: } duke@435: } duke@435: } duke@435: } duke@435: #endif //PRODUCT duke@435: duke@435: twisti@4414: ciMethod* Compile::optimize_virtual_call(ciMethod* caller, int bci, ciInstanceKlass* klass, twisti@4414: ciMethod* callee, const TypeOopPtr* receiver_type, twisti@4414: bool is_virtual, twisti@4414: bool& call_does_dispatch, int& vtable_index) { twisti@4414: // Set default values for out-parameters. twisti@4414: call_does_dispatch = true; twisti@4414: vtable_index = Method::invalid_vtable_index; twisti@4414: twisti@4414: // Choose call strategy. twisti@4414: ciMethod* optimized_virtual_method = optimize_inlining(caller, bci, klass, callee, receiver_type); twisti@4414: twisti@4414: // Have the call been sufficiently improved such that it is no longer a virtual? twisti@4414: if (optimized_virtual_method != NULL) { twisti@4414: callee = optimized_virtual_method; twisti@4414: call_does_dispatch = false; twisti@4414: } else if (!UseInlineCaches && is_virtual && callee->is_loaded()) { twisti@4414: // We can make a vtable call at this site twisti@4414: vtable_index = callee->resolve_vtable_index(caller->holder(), klass); twisti@4414: } twisti@4414: return callee; twisti@4414: } twisti@4414: duke@435: // Identify possible target method and inlining style twisti@4414: ciMethod* Compile::optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass, twisti@4414: ciMethod* callee, const TypeOopPtr* receiver_type) { duke@435: // only use for virtual or interface calls duke@435: duke@435: // If it is obviously final, do not bother to call find_monomorphic_target, duke@435: // because the class hierarchy checks are not needed, and may fail due to duke@435: // incompletely loaded classes. Since we do our own class loading checks duke@435: // in this module, we may confidently bind to any method. twisti@4414: if (callee->can_be_statically_bound()) { twisti@4414: return callee; duke@435: } duke@435: duke@435: // Attempt to improve the receiver duke@435: bool actual_receiver_is_exact = false; duke@435: ciInstanceKlass* actual_receiver = klass; duke@435: if (receiver_type != NULL) { duke@435: // Array methods are all inherited from Object, and are monomorphic. duke@435: if (receiver_type->isa_aryptr() && twisti@4414: callee->holder() == env()->Object_klass()) { twisti@4414: return callee; duke@435: } duke@435: duke@435: // All other interesting cases are instance klasses. duke@435: if (!receiver_type->isa_instptr()) { duke@435: return NULL; duke@435: } duke@435: duke@435: ciInstanceKlass *ikl = receiver_type->klass()->as_instance_klass(); duke@435: if (ikl->is_loaded() && ikl->is_initialized() && !ikl->is_interface() && never@802: (ikl == actual_receiver || ikl->is_subtype_of(actual_receiver))) { duke@435: // ikl is a same or better type than the original actual_receiver, duke@435: // e.g. static receiver from bytecodes. duke@435: actual_receiver = ikl; duke@435: // Is the actual_receiver exact? duke@435: actual_receiver_is_exact = receiver_type->klass_is_exact(); duke@435: } duke@435: } duke@435: duke@435: ciInstanceKlass* calling_klass = caller->holder(); twisti@4414: ciMethod* cha_monomorphic_target = callee->find_monomorphic_target(calling_klass, klass, actual_receiver); duke@435: if (cha_monomorphic_target != NULL) { duke@435: assert(!cha_monomorphic_target->is_abstract(), ""); duke@435: // Look at the method-receiver type. Does it add "too much information"? duke@435: ciKlass* mr_klass = cha_monomorphic_target->holder(); duke@435: const Type* mr_type = TypeInstPtr::make(TypePtr::BotPTR, mr_klass); duke@435: if (receiver_type == NULL || !receiver_type->higher_equal(mr_type)) { duke@435: // Calling this method would include an implicit cast to its holder. duke@435: // %%% Not yet implemented. Would throw minor asserts at present. duke@435: // %%% The most common wins are already gained by +UseUniqueSubclasses. duke@435: // To fix, put the higher_equal check at the call of this routine, duke@435: // and add a CheckCastPP to the receiver. duke@435: if (TraceDependencies) { duke@435: tty->print_cr("found unique CHA method, but could not cast up"); duke@435: tty->print(" method = "); duke@435: cha_monomorphic_target->print(); duke@435: tty->cr(); duke@435: } twisti@4414: if (log() != NULL) { twisti@4414: log()->elem("missed_CHA_opportunity klass='%d' method='%d'", twisti@4414: log()->identify(klass), twisti@4414: log()->identify(cha_monomorphic_target)); duke@435: } duke@435: cha_monomorphic_target = NULL; duke@435: } duke@435: } duke@435: if (cha_monomorphic_target != NULL) { duke@435: // Hardwiring a virtual. duke@435: // If we inlined because CHA revealed only a single target method, duke@435: // then we are dependent on that target method not getting overridden duke@435: // by dynamic class loading. Be sure to test the "static" receiver duke@435: // dest_method here, as opposed to the actual receiver, which may duke@435: // falsely lead us to believe that the receiver is final or private. twisti@4414: dependencies()->assert_unique_concrete_method(actual_receiver, cha_monomorphic_target); duke@435: return cha_monomorphic_target; duke@435: } duke@435: duke@435: // If the type is exact, we can still bind the method w/o a vcall. duke@435: // (This case comes after CHA so we can see how much extra work it does.) duke@435: if (actual_receiver_is_exact) { duke@435: // In case of evolution, there is a dependence on every inlined method, since each duke@435: // such method can be changed when its class is redefined. twisti@4414: ciMethod* exact_method = callee->resolve_invoke(calling_klass, actual_receiver); duke@435: if (exact_method != NULL) { duke@435: #ifndef PRODUCT duke@435: if (PrintOpto) { duke@435: tty->print(" Calling method via exact type @%d --- ", bci); duke@435: exact_method->print_name(); duke@435: tty->cr(); duke@435: } duke@435: #endif duke@435: return exact_method; duke@435: } duke@435: } duke@435: duke@435: return NULL; duke@435: }