annotate src/share/vm/opto/doCall.cpp @ 3196:b40ac3579043

6658428: C2 doesn't inline java method if corresponding intrinsic failed to inline. Summary: Allow fallback to non-intrinsic inline case Reviewed-by: kvn, jrose, never Contributed-by: nils.eliasson@oracle.com
author never
date Mon, 05 Mar 2012 18:10:31 -0800
parents a04a201f0f5a
children cdd249497b34
rev   line source
duke@0 1 /*
twisti@2252 2 * Copyright (c) 1998, 2011, Oracle and/or its affiliates. All rights reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
trims@1472 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1472 20 * or visit www.oracle.com if you need additional information or have any
trims@1472 21 * questions.
duke@0 22 *
duke@0 23 */
duke@0 24
stefank@1879 25 #include "precompiled.hpp"
stefank@1879 26 #include "ci/ciCPCache.hpp"
stefank@1879 27 #include "ci/ciCallSite.hpp"
stefank@1879 28 #include "ci/ciMethodHandle.hpp"
stefank@1879 29 #include "classfile/vmSymbols.hpp"
twisti@2252 30 #include "compiler/compileBroker.hpp"
stefank@1879 31 #include "compiler/compileLog.hpp"
stefank@1879 32 #include "interpreter/linkResolver.hpp"
stefank@1879 33 #include "opto/addnode.hpp"
stefank@1879 34 #include "opto/callGenerator.hpp"
stefank@1879 35 #include "opto/cfgnode.hpp"
stefank@1879 36 #include "opto/mulnode.hpp"
stefank@1879 37 #include "opto/parse.hpp"
stefank@1879 38 #include "opto/rootnode.hpp"
stefank@1879 39 #include "opto/runtime.hpp"
stefank@1879 40 #include "opto/subnode.hpp"
stefank@1879 41 #include "prims/nativeLookup.hpp"
stefank@1879 42 #include "runtime/sharedRuntime.hpp"
duke@0 43
duke@0 44 #ifndef PRODUCT
duke@0 45 void trace_type_profile(ciMethod *method, int depth, int bci, ciMethod *prof_method, ciKlass *prof_klass, int site_count, int receiver_count) {
duke@0 46 if (TraceTypeProfile || PrintInlining || PrintOptoInlining) {
twisti@2252 47 if (!PrintInlining) {
twisti@2252 48 if (!PrintOpto && !PrintCompilation) {
twisti@2252 49 method->print_short_name();
twisti@2252 50 tty->cr();
twisti@2252 51 }
twisti@2252 52 CompileTask::print_inlining(prof_method, depth, bci);
duke@0 53 }
twisti@2252 54 CompileTask::print_inline_indent(depth);
twisti@2252 55 tty->print(" \\-> TypeProfile (%d/%d counts) = ", receiver_count, site_count);
duke@0 56 prof_klass->name()->print_symbol();
twisti@2252 57 tty->cr();
duke@0 58 }
duke@0 59 }
duke@0 60 #endif
duke@0 61
jrose@1157 62 CallGenerator* Compile::call_generator(ciMethod* call_method, int vtable_index, bool call_is_virtual,
jrose@1157 63 JVMState* jvms, bool allow_inline,
never@3196 64 float prof_factor, bool allow_intrinsics) {
twisti@2468 65 ciMethod* caller = jvms->method();
twisti@2468 66 int bci = jvms->bci();
twisti@2468 67 Bytecodes::Code bytecode = caller->java_code_at_bci(bci);
jrose@2309 68 guarantee(call_method != NULL, "failed method resolution");
duke@0 69
duke@0 70 // Dtrace currently doesn't work unless all calls are vanilla
kvn@780 71 if (env()->dtrace_method_probes()) {
duke@0 72 allow_inline = false;
duke@0 73 }
duke@0 74
duke@0 75 // Note: When we get profiling during stage-1 compiles, we want to pull
duke@0 76 // from more specific profile data which pertains to this inlining.
duke@0 77 // Right now, ignore the information in jvms->caller(), and do method[bci].
twisti@2468 78 ciCallProfile profile = caller->call_profile_at_bci(bci);
duke@0 79
duke@0 80 // See how many times this site has been invoked.
duke@0 81 int site_count = profile.count();
duke@0 82 int receiver_count = -1;
duke@0 83 if (call_is_virtual && UseTypeProfile && profile.has_receiver(0)) {
duke@0 84 // Receivers in the profile structure are ordered by call counts
duke@0 85 // so that the most called (major) receiver is profile.receiver(0).
duke@0 86 receiver_count = profile.receiver_count(0);
duke@0 87 }
duke@0 88
duke@0 89 CompileLog* log = this->log();
duke@0 90 if (log != NULL) {
duke@0 91 int rid = (receiver_count >= 0)? log->identify(profile.receiver(0)): -1;
kvn@1251 92 int r2id = (rid != -1 && profile.has_receiver(1))? log->identify(profile.receiver(1)):-1;
duke@0 93 log->begin_elem("call method='%d' count='%d' prof_factor='%g'",
duke@0 94 log->identify(call_method), site_count, prof_factor);
duke@0 95 if (call_is_virtual) log->print(" virtual='1'");
duke@0 96 if (allow_inline) log->print(" inline='1'");
duke@0 97 if (receiver_count >= 0) {
duke@0 98 log->print(" receiver='%d' receiver_count='%d'", rid, receiver_count);
duke@0 99 if (profile.has_receiver(1)) {
duke@0 100 log->print(" receiver2='%d' receiver2_count='%d'", r2id, profile.receiver_count(1));
duke@0 101 }
duke@0 102 }
duke@0 103 log->end_elem();
duke@0 104 }
duke@0 105
duke@0 106 // Special case the handling of certain common, profitable library
duke@0 107 // methods. If these methods are replaced with specialized code,
duke@0 108 // then we return it as the inlined version of the call.
duke@0 109 // We do this before the strict f.p. check below because the
duke@0 110 // intrinsics handle strict f.p. correctly.
never@3196 111 if (allow_inline && allow_intrinsics) {
twisti@2878 112 CallGenerator* cg = find_intrinsic(call_method, call_is_virtual);
duke@0 113 if (cg != NULL) return cg;
duke@0 114 }
duke@0 115
twisti@2615 116 // Do method handle calls.
twisti@1743 117 // NOTE: This must happen before normal inlining logic below since
twisti@1743 118 // MethodHandle.invoke* are native methods which obviously don't
twisti@1743 119 // have bytecodes and so normal inlining fails.
twisti@1743 120 if (call_method->is_method_handle_invoke()) {
twisti@2463 121 if (bytecode != Bytecodes::_invokedynamic) {
twisti@1743 122 GraphKit kit(jvms);
twisti@2878 123 Node* method_handle = kit.argument(0);
twisti@2878 124 return CallGenerator::for_method_handle_call(method_handle, jvms, caller, call_method, profile);
twisti@1743 125 }
twisti@1743 126 else {
twisti@2878 127 return CallGenerator::for_invokedynamic_call(jvms, caller, call_method, profile);
twisti@1743 128 }
twisti@1743 129 }
twisti@1743 130
duke@0 131 // Do not inline strict fp into non-strict code, or the reverse
twisti@2878 132 if (caller->is_strict() ^ call_method->is_strict()) {
duke@0 133 allow_inline = false;
duke@0 134 }
duke@0 135
duke@0 136 // Attempt to inline...
duke@0 137 if (allow_inline) {
duke@0 138 // The profile data is only partly attributable to this caller,
duke@0 139 // scale back the call site information.
duke@0 140 float past_uses = jvms->method()->scale_count(site_count, prof_factor);
duke@0 141 // This is the number of times we expect the call code to be used.
duke@0 142 float expected_uses = past_uses;
duke@0 143
duke@0 144 // Try inlining a bytecoded method:
duke@0 145 if (!call_is_virtual) {
duke@0 146 InlineTree* ilt;
duke@0 147 if (UseOldInlining) {
duke@0 148 ilt = InlineTree::find_subtree_from_root(this->ilt(), jvms->caller(), jvms->method());
duke@0 149 } else {
duke@0 150 // Make a disembodied, stateless ILT.
duke@0 151 // TO DO: When UseOldInlining is removed, copy the ILT code elsewhere.
duke@0 152 float site_invoke_ratio = prof_factor;
duke@0 153 // Note: ilt is for the root of this parse, not the present call site.
never@2546 154 ilt = new InlineTree(this, jvms->method(), jvms->caller(), site_invoke_ratio, MaxInlineLevel);
duke@0 155 }
duke@0 156 WarmCallInfo scratch_ci;
duke@0 157 if (!UseOldInlining)
duke@0 158 scratch_ci.init(jvms, call_method, profile, prof_factor);
duke@0 159 WarmCallInfo* ci = ilt->ok_to_inline(call_method, jvms, profile, &scratch_ci);
duke@0 160 assert(ci != &scratch_ci, "do not let this pointer escape");
duke@0 161 bool allow_inline = (ci != NULL && !ci->is_cold());
duke@0 162 bool require_inline = (allow_inline && ci->is_hot());
duke@0 163
duke@0 164 if (allow_inline) {
duke@0 165 CallGenerator* cg = CallGenerator::for_inline(call_method, expected_uses);
never@1080 166 if (require_inline && cg != NULL && should_delay_inlining(call_method, jvms)) {
never@1080 167 // Delay the inlining of this method to give us the
never@1080 168 // opportunity to perform some high level optimizations
never@1080 169 // first.
never@1080 170 return CallGenerator::for_late_inline(call_method, cg);
never@1080 171 }
duke@0 172 if (cg == NULL) {
duke@0 173 // Fall through.
duke@0 174 } else if (require_inline || !InlineWarmCalls) {
duke@0 175 return cg;
duke@0 176 } else {
duke@0 177 CallGenerator* cold_cg = call_generator(call_method, vtable_index, call_is_virtual, jvms, false, prof_factor);
duke@0 178 return CallGenerator::for_warm_call(ci, cold_cg, cg);
duke@0 179 }
duke@0 180 }
duke@0 181 }
duke@0 182
duke@0 183 // Try using the type profile.
duke@0 184 if (call_is_virtual && site_count > 0 && receiver_count > 0) {
duke@0 185 // The major receiver's count >= TypeProfileMajorReceiverPercent of site_count.
duke@0 186 bool have_major_receiver = (100.*profile.receiver_prob(0) >= (float)TypeProfileMajorReceiverPercent);
duke@0 187 ciMethod* receiver_method = NULL;
duke@0 188 if (have_major_receiver || profile.morphism() == 1 ||
duke@0 189 (profile.morphism() == 2 && UseBimorphicInlining)) {
duke@0 190 // receiver_method = profile.method();
duke@0 191 // Profiles do not suggest methods now. Look it up in the major receiver.
duke@0 192 receiver_method = call_method->resolve_invoke(jvms->method()->holder(),
duke@0 193 profile.receiver(0));
duke@0 194 }
duke@0 195 if (receiver_method != NULL) {
duke@0 196 // The single majority receiver sufficiently outweighs the minority.
duke@0 197 CallGenerator* hit_cg = this->call_generator(receiver_method,
duke@0 198 vtable_index, !call_is_virtual, jvms, allow_inline, prof_factor);
duke@0 199 if (hit_cg != NULL) {
duke@0 200 // Look up second receiver.
duke@0 201 CallGenerator* next_hit_cg = NULL;
duke@0 202 ciMethod* next_receiver_method = NULL;
duke@0 203 if (profile.morphism() == 2 && UseBimorphicInlining) {
duke@0 204 next_receiver_method = call_method->resolve_invoke(jvms->method()->holder(),
duke@0 205 profile.receiver(1));
duke@0 206 if (next_receiver_method != NULL) {
duke@0 207 next_hit_cg = this->call_generator(next_receiver_method,
duke@0 208 vtable_index, !call_is_virtual, jvms,
duke@0 209 allow_inline, prof_factor);
duke@0 210 if (next_hit_cg != NULL && !next_hit_cg->is_inline() &&
duke@0 211 have_major_receiver && UseOnlyInlinedBimorphic) {
duke@0 212 // Skip if we can't inline second receiver's method
duke@0 213 next_hit_cg = NULL;
duke@0 214 }
duke@0 215 }
duke@0 216 }
duke@0 217 CallGenerator* miss_cg;
kvn@1206 218 Deoptimization::DeoptReason reason = (profile.morphism() == 2) ?
kvn@1206 219 Deoptimization::Reason_bimorphic :
kvn@1206 220 Deoptimization::Reason_class_check;
duke@0 221 if (( profile.morphism() == 1 ||
duke@0 222 (profile.morphism() == 2 && next_hit_cg != NULL) ) &&
kvn@1206 223 !too_many_traps(jvms->method(), jvms->bci(), reason)
duke@0 224 ) {
duke@0 225 // Generate uncommon trap for class check failure path
duke@0 226 // in case of monomorphic or bimorphic virtual call site.
kvn@1206 227 miss_cg = CallGenerator::for_uncommon_trap(call_method, reason,
duke@0 228 Deoptimization::Action_maybe_recompile);
duke@0 229 } else {
duke@0 230 // Generate virtual call for class check failure path
duke@0 231 // in case of polymorphic virtual call site.
duke@0 232 miss_cg = CallGenerator::for_virtual_call(call_method, vtable_index);
duke@0 233 }
duke@0 234 if (miss_cg != NULL) {
duke@0 235 if (next_hit_cg != NULL) {
twisti@2252 236 NOT_PRODUCT(trace_type_profile(jvms->method(), jvms->depth() - 1, jvms->bci(), next_receiver_method, profile.receiver(1), site_count, profile.receiver_count(1)));
duke@0 237 // We don't need to record dependency on a receiver here and below.
duke@0 238 // Whenever we inline, the dependency is added by Parse::Parse().
duke@0 239 miss_cg = CallGenerator::for_predicted_call(profile.receiver(1), miss_cg, next_hit_cg, PROB_MAX);
duke@0 240 }
duke@0 241 if (miss_cg != NULL) {
twisti@2252 242 NOT_PRODUCT(trace_type_profile(jvms->method(), jvms->depth() - 1, jvms->bci(), receiver_method, profile.receiver(0), site_count, receiver_count));
twisti@2878 243 CallGenerator* cg = CallGenerator::for_predicted_call(profile.receiver(0), miss_cg, hit_cg, profile.receiver_prob(0));
duke@0 244 if (cg != NULL) return cg;
duke@0 245 }
duke@0 246 }
duke@0 247 }
duke@0 248 }
duke@0 249 }
duke@0 250 }
duke@0 251
duke@0 252 // There was no special inlining tactic, or it bailed out.
duke@0 253 // Use a more generic tactic, like a simple call.
duke@0 254 if (call_is_virtual) {
duke@0 255 return CallGenerator::for_virtual_call(call_method, vtable_index);
duke@0 256 } else {
duke@0 257 // Class Hierarchy Analysis or Type Profile reveals a unique target,
duke@0 258 // or it is a static or special call.
never@1080 259 return CallGenerator::for_direct_call(call_method, should_delay_inlining(call_method, jvms));
duke@0 260 }
duke@0 261 }
duke@0 262
never@1080 263 // Return true for methods that shouldn't be inlined early so that
never@1080 264 // they are easier to analyze and optimize as intrinsics.
never@1080 265 bool Compile::should_delay_inlining(ciMethod* call_method, JVMState* jvms) {
never@1080 266 if (has_stringbuilder()) {
never@1080 267
never@1080 268 if ((call_method->holder() == C->env()->StringBuilder_klass() ||
never@1080 269 call_method->holder() == C->env()->StringBuffer_klass()) &&
never@1080 270 (jvms->method()->holder() == C->env()->StringBuilder_klass() ||
never@1080 271 jvms->method()->holder() == C->env()->StringBuffer_klass())) {
never@1080 272 // Delay SB calls only when called from non-SB code
never@1080 273 return false;
never@1080 274 }
never@1080 275
never@1080 276 switch (call_method->intrinsic_id()) {
never@1080 277 case vmIntrinsics::_StringBuilder_void:
never@1080 278 case vmIntrinsics::_StringBuilder_int:
never@1080 279 case vmIntrinsics::_StringBuilder_String:
never@1080 280 case vmIntrinsics::_StringBuilder_append_char:
never@1080 281 case vmIntrinsics::_StringBuilder_append_int:
never@1080 282 case vmIntrinsics::_StringBuilder_append_String:
never@1080 283 case vmIntrinsics::_StringBuilder_toString:
never@1080 284 case vmIntrinsics::_StringBuffer_void:
never@1080 285 case vmIntrinsics::_StringBuffer_int:
never@1080 286 case vmIntrinsics::_StringBuffer_String:
never@1080 287 case vmIntrinsics::_StringBuffer_append_char:
never@1080 288 case vmIntrinsics::_StringBuffer_append_int:
never@1080 289 case vmIntrinsics::_StringBuffer_append_String:
never@1080 290 case vmIntrinsics::_StringBuffer_toString:
never@1080 291 case vmIntrinsics::_Integer_toString:
never@1080 292 return true;
never@1080 293
never@1080 294 case vmIntrinsics::_String_String:
never@1080 295 {
never@1080 296 Node* receiver = jvms->map()->in(jvms->argoff() + 1);
never@1080 297 if (receiver->is_Proj() && receiver->in(0)->is_CallStaticJava()) {
never@1080 298 CallStaticJavaNode* csj = receiver->in(0)->as_CallStaticJava();
never@1080 299 ciMethod* m = csj->method();
never@1080 300 if (m != NULL &&
never@1080 301 (m->intrinsic_id() == vmIntrinsics::_StringBuffer_toString ||
never@1080 302 m->intrinsic_id() == vmIntrinsics::_StringBuilder_toString))
never@1080 303 // Delay String.<init>(new SB())
never@1080 304 return true;
never@1080 305 }
never@1080 306 return false;
never@1080 307 }
never@1080 308
never@1080 309 default:
never@1080 310 return false;
never@1080 311 }
never@1080 312 }
never@1080 313 return false;
never@1080 314 }
never@1080 315
duke@0 316
duke@0 317 // uncommon-trap call-sites where callee is unloaded, uninitialized or will not link
duke@0 318 bool Parse::can_not_compile_call_site(ciMethod *dest_method, ciInstanceKlass* klass) {
duke@0 319 // Additional inputs to consider...
duke@0 320 // bc = bc()
duke@0 321 // caller = method()
duke@0 322 // iter().get_method_holder_index()
duke@0 323 assert( dest_method->is_loaded(), "ciTypeFlow should not let us get here" );
duke@0 324 // Interface classes can be loaded & linked and never get around to
duke@0 325 // being initialized. Uncommon-trap for not-initialized static or
duke@0 326 // v-calls. Let interface calls happen.
twisti@1137 327 ciInstanceKlass* holder_klass = dest_method->holder();
never@1565 328 if (!holder_klass->is_being_initialized() &&
never@1565 329 !holder_klass->is_initialized() &&
duke@0 330 !holder_klass->is_interface()) {
duke@0 331 uncommon_trap(Deoptimization::Reason_uninitialized,
duke@0 332 Deoptimization::Action_reinterpret,
duke@0 333 holder_klass);
duke@0 334 return true;
duke@0 335 }
duke@0 336
duke@0 337 assert(dest_method->will_link(method()->holder(), klass, bc()), "dest_method: typeflow responsibility");
duke@0 338 return false;
duke@0 339 }
duke@0 340
duke@0 341
duke@0 342 //------------------------------do_call----------------------------------------
duke@0 343 // Handle your basic call. Inline if we can & want to, else just setup call.
duke@0 344 void Parse::do_call() {
duke@0 345 // It's likely we are going to add debug info soon.
duke@0 346 // Also, if we inline a guy who eventually needs debug info for this JVMS,
duke@0 347 // our contribution to it is cleaned up right here.
duke@0 348 kill_dead_locals();
duke@0 349
duke@0 350 // Set frequently used booleans
duke@0 351 bool is_virtual = bc() == Bytecodes::_invokevirtual;
duke@0 352 bool is_virtual_or_interface = is_virtual || bc() == Bytecodes::_invokeinterface;
duke@0 353 bool has_receiver = is_virtual_or_interface || bc() == Bytecodes::_invokespecial;
twisti@1137 354 bool is_invokedynamic = bc() == Bytecodes::_invokedynamic;
duke@0 355
duke@0 356 // Find target being called
duke@0 357 bool will_link;
duke@0 358 ciMethod* dest_method = iter().get_method(will_link);
duke@0 359 ciInstanceKlass* holder_klass = dest_method->holder();
duke@0 360 ciKlass* holder = iter().get_declared_method_holder();
duke@0 361 ciInstanceKlass* klass = ciEnv::get_instance_klass_for_declared_method_holder(holder);
duke@0 362
twisti@1137 363 int nargs = dest_method->arg_size();
twisti@1137 364 if (is_invokedynamic) nargs -= 1;
duke@0 365
duke@0 366 // uncommon-trap when callee is unloaded, uninitialized or will not link
duke@0 367 // bailout when too many arguments for register representation
duke@0 368 if (!will_link || can_not_compile_call_site(dest_method, klass)) {
duke@0 369 #ifndef PRODUCT
duke@0 370 if (PrintOpto && (Verbose || WizardMode)) {
duke@0 371 method()->print_name(); tty->print_cr(" can not compile call at bci %d to:", bci());
duke@0 372 dest_method->print_name(); tty->cr();
duke@0 373 }
duke@0 374 #endif
duke@0 375 return;
duke@0 376 }
duke@0 377 assert(holder_klass->is_loaded(), "");
twisti@1137 378 assert((dest_method->is_static() || is_invokedynamic) == !has_receiver , "must match bc");
duke@0 379 // Note: this takes into account invokeinterface of methods declared in java/lang/Object,
duke@0 380 // which should be invokevirtuals but according to the VM spec may be invokeinterfaces
duke@0 381 assert(holder_klass->is_interface() || holder_klass->super() == NULL || (bc() != Bytecodes::_invokeinterface), "must match bc");
duke@0 382 // Note: In the absence of miranda methods, an abstract class K can perform
duke@0 383 // an invokevirtual directly on an interface method I.m if K implements I.
duke@0 384
duke@0 385 // ---------------------
duke@0 386 // Does Class Hierarchy Analysis reveal only a single target of a v-call?
duke@0 387 // Then we may inline or make a static call, but become dependent on there being only 1 target.
duke@0 388 // Does the call-site type profile reveal only one receiver?
duke@0 389 // Then we may introduce a run-time check and inline on the path where it succeeds.
duke@0 390 // The other path may uncommon_trap, check for another receiver, or do a v-call.
duke@0 391
duke@0 392 // Choose call strategy.
duke@0 393 bool call_is_virtual = is_virtual_or_interface;
duke@0 394 int vtable_index = methodOopDesc::invalid_vtable_index;
duke@0 395 ciMethod* call_method = dest_method;
duke@0 396
duke@0 397 // Try to get the most accurate receiver type
duke@0 398 if (is_virtual_or_interface) {
duke@0 399 Node* receiver_node = stack(sp() - nargs);
duke@0 400 const TypeOopPtr* receiver_type = _gvn.type(receiver_node)->isa_oopptr();
duke@0 401 ciMethod* optimized_virtual_method = optimize_inlining(method(), bci(), klass, dest_method, receiver_type);
duke@0 402
duke@0 403 // Have the call been sufficiently improved such that it is no longer a virtual?
duke@0 404 if (optimized_virtual_method != NULL) {
duke@0 405 call_method = optimized_virtual_method;
duke@0 406 call_is_virtual = false;
duke@0 407 } else if (!UseInlineCaches && is_virtual && call_method->is_loaded()) {
duke@0 408 // We can make a vtable call at this site
duke@0 409 vtable_index = call_method->resolve_vtable_index(method()->holder(), klass);
duke@0 410 }
duke@0 411 }
duke@0 412
duke@0 413 // Note: It's OK to try to inline a virtual call.
duke@0 414 // The call generator will not attempt to inline a polymorphic call
duke@0 415 // unless it knows how to optimize the receiver dispatch.
duke@0 416 bool try_inline = (C->do_inlining() || InlineAccessors);
duke@0 417
duke@0 418 // ---------------------
duke@0 419 inc_sp(- nargs); // Temporarily pop args for JVM state of call
duke@0 420 JVMState* jvms = sync_jvms();
duke@0 421
duke@0 422 // ---------------------
duke@0 423 // Decide call tactic.
duke@0 424 // This call checks with CHA, the interpreter profile, intrinsics table, etc.
duke@0 425 // It decides whether inlining is desirable or not.
duke@0 426 CallGenerator* cg = C->call_generator(call_method, vtable_index, call_is_virtual, jvms, try_inline, prof_factor());
duke@0 427
duke@0 428 // ---------------------
duke@0 429 // Round double arguments before call
duke@0 430 round_double_arguments(dest_method);
duke@0 431
duke@0 432 #ifndef PRODUCT
duke@0 433 // bump global counters for calls
duke@0 434 count_compiled_calls(false/*at_method_entry*/, cg->is_inline());
duke@0 435
duke@0 436 // Record first part of parsing work for this call
duke@0 437 parse_histogram()->record_change();
duke@0 438 #endif // not PRODUCT
duke@0 439
duke@0 440 assert(jvms == this->jvms(), "still operating on the right JVMS");
duke@0 441 assert(jvms_in_sync(), "jvms must carry full info into CG");
duke@0 442
duke@0 443 // save across call, for a subsequent cast_not_null.
duke@0 444 Node* receiver = has_receiver ? argument(0) : NULL;
duke@0 445
duke@0 446 // Bump method data counters (We profile *before* the call is made
duke@0 447 // because exceptions don't return to the call site.)
duke@0 448 profile_call(receiver);
duke@0 449
duke@0 450 JVMState* new_jvms;
duke@0 451 if ((new_jvms = cg->generate(jvms)) == NULL) {
duke@0 452 // When inlining attempt fails (e.g., too many arguments),
duke@0 453 // it may contaminate the current compile state, making it
duke@0 454 // impossible to pull back and try again. Once we call
duke@0 455 // cg->generate(), we are committed. If it fails, the whole
duke@0 456 // compilation task is compromised.
duke@0 457 if (failing()) return;
never@3196 458
duke@0 459 // This can happen if a library intrinsic is available, but refuses
duke@0 460 // the call site, perhaps because it did not match a pattern the
never@3196 461 // intrinsic was expecting to optimize. Should always be possible to
never@3196 462 // get a normal java call that may inline in that case
never@3196 463 cg = C->call_generator(call_method, vtable_index, call_is_virtual, jvms, try_inline, prof_factor(), /* allow_intrinsics= */ false);
duke@0 464 if ((new_jvms = cg->generate(jvms)) == NULL) {
duke@0 465 guarantee(failing(), "call failed to generate: calls should work");
duke@0 466 return;
duke@0 467 }
duke@0 468 }
duke@0 469
duke@0 470 if (cg->is_inline()) {
never@67 471 // Accumulate has_loops estimate
never@67 472 C->set_has_loops(C->has_loops() || call_method->has_loops());
duke@0 473 C->env()->notice_inlined_method(call_method);
duke@0 474 }
duke@0 475
duke@0 476 // Reset parser state from [new_]jvms, which now carries results of the call.
duke@0 477 // Return value (if any) is already pushed on the stack by the cg.
duke@0 478 add_exception_states_from(new_jvms);
duke@0 479 if (new_jvms->map()->control() == top()) {
duke@0 480 stop_and_kill_map();
duke@0 481 } else {
duke@0 482 assert(new_jvms->same_calls_as(jvms), "method/bci left unchanged");
duke@0 483 set_jvms(new_jvms);
duke@0 484 }
duke@0 485
duke@0 486 if (!stopped()) {
duke@0 487 // This was some sort of virtual call, which did a null check for us.
duke@0 488 // Now we can assert receiver-not-null, on the normal return path.
duke@0 489 if (receiver != NULL && cg->is_virtual()) {
duke@0 490 Node* cast = cast_not_null(receiver);
duke@0 491 // %%% assert(receiver == cast, "should already have cast the receiver");
duke@0 492 }
duke@0 493
duke@0 494 // Round double result after a call from strict to non-strict code
duke@0 495 round_double_result(dest_method);
duke@0 496
duke@0 497 // If the return type of the method is not loaded, assert that the
duke@0 498 // value we got is a null. Otherwise, we need to recompile.
duke@0 499 if (!dest_method->return_type()->is_loaded()) {
duke@0 500 #ifndef PRODUCT
duke@0 501 if (PrintOpto && (Verbose || WizardMode)) {
duke@0 502 method()->print_name(); tty->print_cr(" asserting nullness of result at bci: %d", bci());
duke@0 503 dest_method->print_name(); tty->cr();
duke@0 504 }
duke@0 505 #endif
duke@0 506 if (C->log() != NULL) {
duke@0 507 C->log()->elem("assert_null reason='return' klass='%d'",
duke@0 508 C->log()->identify(dest_method->return_type()));
duke@0 509 }
duke@0 510 // If there is going to be a trap, put it at the next bytecode:
duke@0 511 set_bci(iter().next_bci());
duke@0 512 do_null_assert(peek(), T_OBJECT);
duke@0 513 set_bci(iter().cur_bci()); // put it back
duke@0 514 }
duke@0 515 }
duke@0 516
duke@0 517 // Restart record of parsing work after possible inlining of call
duke@0 518 #ifndef PRODUCT
duke@0 519 parse_histogram()->set_initial_state(bc());
duke@0 520 #endif
duke@0 521 }
duke@0 522
duke@0 523 //---------------------------catch_call_exceptions-----------------------------
duke@0 524 // Put a Catch and CatchProj nodes behind a just-created call.
duke@0 525 // Send their caught exceptions to the proper handler.
duke@0 526 // This may be used after a call to the rethrow VM stub,
duke@0 527 // when it is needed to process unloaded exception classes.
duke@0 528 void Parse::catch_call_exceptions(ciExceptionHandlerStream& handlers) {
duke@0 529 // Exceptions are delivered through this channel:
duke@0 530 Node* i_o = this->i_o();
duke@0 531
duke@0 532 // Add a CatchNode.
duke@0 533 GrowableArray<int>* bcis = new (C->node_arena()) GrowableArray<int>(C->node_arena(), 8, 0, -1);
duke@0 534 GrowableArray<const Type*>* extypes = new (C->node_arena()) GrowableArray<const Type*>(C->node_arena(), 8, 0, NULL);
duke@0 535 GrowableArray<int>* saw_unloaded = new (C->node_arena()) GrowableArray<int>(C->node_arena(), 8, 0, 0);
duke@0 536
duke@0 537 for (; !handlers.is_done(); handlers.next()) {
duke@0 538 ciExceptionHandler* h = handlers.handler();
duke@0 539 int h_bci = h->handler_bci();
duke@0 540 ciInstanceKlass* h_klass = h->is_catch_all() ? env()->Throwable_klass() : h->catch_klass();
duke@0 541 // Do not introduce unloaded exception types into the graph:
duke@0 542 if (!h_klass->is_loaded()) {
duke@0 543 if (saw_unloaded->contains(h_bci)) {
duke@0 544 /* We've already seen an unloaded exception with h_bci,
duke@0 545 so don't duplicate. Duplication will cause the CatchNode to be
duke@0 546 unnecessarily large. See 4713716. */
duke@0 547 continue;
duke@0 548 } else {
duke@0 549 saw_unloaded->append(h_bci);
duke@0 550 }
duke@0 551 }
duke@0 552 const Type* h_extype = TypeOopPtr::make_from_klass(h_klass);
duke@0 553 // (We use make_from_klass because it respects UseUniqueSubclasses.)
duke@0 554 h_extype = h_extype->join(TypeInstPtr::NOTNULL);
duke@0 555 assert(!h_extype->empty(), "sanity");
duke@0 556 // Note: It's OK if the BCIs repeat themselves.
duke@0 557 bcis->append(h_bci);
duke@0 558 extypes->append(h_extype);
duke@0 559 }
duke@0 560
duke@0 561 int len = bcis->length();
duke@0 562 CatchNode *cn = new (C, 2) CatchNode(control(), i_o, len+1);
duke@0 563 Node *catch_ = _gvn.transform(cn);
duke@0 564
duke@0 565 // now branch with the exception state to each of the (potential)
duke@0 566 // handlers
duke@0 567 for(int i=0; i < len; i++) {
duke@0 568 // Setup JVM state to enter the handler.
duke@0 569 PreserveJVMState pjvms(this);
duke@0 570 // Locals are just copied from before the call.
duke@0 571 // Get control from the CatchNode.
duke@0 572 int handler_bci = bcis->at(i);
duke@0 573 Node* ctrl = _gvn.transform( new (C, 1) CatchProjNode(catch_, i+1,handler_bci));
duke@0 574 // This handler cannot happen?
duke@0 575 if (ctrl == top()) continue;
duke@0 576 set_control(ctrl);
duke@0 577
duke@0 578 // Create exception oop
duke@0 579 const TypeInstPtr* extype = extypes->at(i)->is_instptr();
duke@0 580 Node *ex_oop = _gvn.transform(new (C, 2) CreateExNode(extypes->at(i), ctrl, i_o));
duke@0 581
duke@0 582 // Handle unloaded exception classes.
duke@0 583 if (saw_unloaded->contains(handler_bci)) {
duke@0 584 // An unloaded exception type is coming here. Do an uncommon trap.
duke@0 585 #ifndef PRODUCT
duke@0 586 // We do not expect the same handler bci to take both cold unloaded
duke@0 587 // and hot loaded exceptions. But, watch for it.
duke@0 588 if (extype->is_loaded()) {
duke@0 589 tty->print_cr("Warning: Handler @%d takes mixed loaded/unloaded exceptions in ");
duke@0 590 method()->print_name(); tty->cr();
duke@0 591 } else if (PrintOpto && (Verbose || WizardMode)) {
duke@0 592 tty->print("Bailing out on unloaded exception type ");
duke@0 593 extype->klass()->print_name();
duke@0 594 tty->print(" at bci:%d in ", bci());
duke@0 595 method()->print_name(); tty->cr();
duke@0 596 }
duke@0 597 #endif
duke@0 598 // Emit an uncommon trap instead of processing the block.
duke@0 599 set_bci(handler_bci);
duke@0 600 push_ex_oop(ex_oop);
duke@0 601 uncommon_trap(Deoptimization::Reason_unloaded,
duke@0 602 Deoptimization::Action_reinterpret,
duke@0 603 extype->klass(), "!loaded exception");
duke@0 604 set_bci(iter().cur_bci()); // put it back
duke@0 605 continue;
duke@0 606 }
duke@0 607
duke@0 608 // go to the exception handler
duke@0 609 if (handler_bci < 0) { // merge with corresponding rethrow node
duke@0 610 throw_to_exit(make_exception_state(ex_oop));
duke@0 611 } else { // Else jump to corresponding handle
duke@0 612 push_ex_oop(ex_oop); // Clear stack and push just the oop.
duke@0 613 merge_exception(handler_bci);
duke@0 614 }
duke@0 615 }
duke@0 616
duke@0 617 // The first CatchProj is for the normal return.
duke@0 618 // (Note: If this is a call to rethrow_Java, this node goes dead.)
duke@0 619 set_control(_gvn.transform( new (C, 1) CatchProjNode(catch_, CatchProjNode::fall_through_index, CatchProjNode::no_handler_bci)));
duke@0 620 }
duke@0 621
duke@0 622
duke@0 623 //----------------------------catch_inline_exceptions--------------------------
duke@0 624 // Handle all exceptions thrown by an inlined method or individual bytecode.
duke@0 625 // Common case 1: we have no handler, so all exceptions merge right into
duke@0 626 // the rethrow case.
duke@0 627 // Case 2: we have some handlers, with loaded exception klasses that have
duke@0 628 // no subklasses. We do a Deutsch-Shiffman style type-check on the incoming
duke@0 629 // exception oop and branch to the handler directly.
duke@0 630 // Case 3: We have some handlers with subklasses or are not loaded at
duke@0 631 // compile-time. We have to call the runtime to resolve the exception.
duke@0 632 // So we insert a RethrowCall and all the logic that goes with it.
duke@0 633 void Parse::catch_inline_exceptions(SafePointNode* ex_map) {
duke@0 634 // Caller is responsible for saving away the map for normal control flow!
duke@0 635 assert(stopped(), "call set_map(NULL) first");
duke@0 636 assert(method()->has_exception_handlers(), "don't come here w/o work to do");
duke@0 637
duke@0 638 Node* ex_node = saved_ex_oop(ex_map);
duke@0 639 if (ex_node == top()) {
duke@0 640 // No action needed.
duke@0 641 return;
duke@0 642 }
duke@0 643 const TypeInstPtr* ex_type = _gvn.type(ex_node)->isa_instptr();
duke@0 644 NOT_PRODUCT(if (ex_type==NULL) tty->print_cr("*** Exception not InstPtr"));
duke@0 645 if (ex_type == NULL)
duke@0 646 ex_type = TypeOopPtr::make_from_klass(env()->Throwable_klass())->is_instptr();
duke@0 647
duke@0 648 // determine potential exception handlers
duke@0 649 ciExceptionHandlerStream handlers(method(), bci(),
duke@0 650 ex_type->klass()->as_instance_klass(),
duke@0 651 ex_type->klass_is_exact());
duke@0 652
duke@0 653 // Start executing from the given throw state. (Keep its stack, for now.)
duke@0 654 // Get the exception oop as known at compile time.
duke@0 655 ex_node = use_exception_state(ex_map);
duke@0 656
duke@0 657 // Get the exception oop klass from its header
duke@0 658 Node* ex_klass_node = NULL;
duke@0 659 if (has_ex_handler() && !ex_type->klass_is_exact()) {
duke@0 660 Node* p = basic_plus_adr( ex_node, ex_node, oopDesc::klass_offset_in_bytes());
kvn@164 661 ex_klass_node = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT) );
duke@0 662
duke@0 663 // Compute the exception klass a little more cleverly.
duke@0 664 // Obvious solution is to simple do a LoadKlass from the 'ex_node'.
duke@0 665 // However, if the ex_node is a PhiNode, I'm going to do a LoadKlass for
duke@0 666 // each arm of the Phi. If I know something clever about the exceptions
duke@0 667 // I'm loading the class from, I can replace the LoadKlass with the
duke@0 668 // klass constant for the exception oop.
duke@0 669 if( ex_node->is_Phi() ) {
duke@0 670 ex_klass_node = new (C, ex_node->req()) PhiNode( ex_node->in(0), TypeKlassPtr::OBJECT );
duke@0 671 for( uint i = 1; i < ex_node->req(); i++ ) {
duke@0 672 Node* p = basic_plus_adr( ex_node->in(i), ex_node->in(i), oopDesc::klass_offset_in_bytes() );
kvn@164 673 Node* k = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), p, TypeInstPtr::KLASS, TypeKlassPtr::OBJECT) );
duke@0 674 ex_klass_node->init_req( i, k );
duke@0 675 }
duke@0 676 _gvn.set_type(ex_klass_node, TypeKlassPtr::OBJECT);
duke@0 677
duke@0 678 }
duke@0 679 }
duke@0 680
duke@0 681 // Scan the exception table for applicable handlers.
duke@0 682 // If none, we can call rethrow() and be done!
duke@0 683 // If precise (loaded with no subklasses), insert a D.S. style
duke@0 684 // pointer compare to the correct handler and loop back.
duke@0 685 // If imprecise, switch to the Rethrow VM-call style handling.
duke@0 686
duke@0 687 int remaining = handlers.count_remaining();
duke@0 688
duke@0 689 // iterate through all entries sequentially
duke@0 690 for (;!handlers.is_done(); handlers.next()) {
duke@0 691 ciExceptionHandler* handler = handlers.handler();
duke@0 692
duke@0 693 if (handler->is_rethrow()) {
duke@0 694 // If we fell off the end of the table without finding an imprecise
duke@0 695 // exception klass (and without finding a generic handler) then we
duke@0 696 // know this exception is not handled in this method. We just rethrow
duke@0 697 // the exception into the caller.
duke@0 698 throw_to_exit(make_exception_state(ex_node));
duke@0 699 return;
duke@0 700 }
duke@0 701
duke@0 702 // exception handler bci range covers throw_bci => investigate further
duke@0 703 int handler_bci = handler->handler_bci();
duke@0 704
duke@0 705 if (remaining == 1) {
duke@0 706 push_ex_oop(ex_node); // Push exception oop for handler
duke@0 707 #ifndef PRODUCT
duke@0 708 if (PrintOpto && WizardMode) {
duke@0 709 tty->print_cr(" Catching every inline exception bci:%d -> handler_bci:%d", bci(), handler_bci);
duke@0 710 }
duke@0 711 #endif
duke@0 712 merge_exception(handler_bci); // jump to handler
duke@0 713 return; // No more handling to be done here!
duke@0 714 }
duke@0 715
never@1344 716 // Get the handler's klass
never@1344 717 ciInstanceKlass* klass = handler->catch_klass();
duke@0 718
never@1344 719 if (!klass->is_loaded()) { // klass is not loaded?
never@1344 720 // fall through into catch_call_exceptions which will emit a
never@1344 721 // handler with an uncommon trap.
never@1344 722 break;
duke@0 723 }
duke@0 724
duke@0 725 if (klass->is_interface()) // should not happen, but...
duke@0 726 break; // bail out
duke@0 727
never@1344 728 // Check the type of the exception against the catch type
duke@0 729 const TypeKlassPtr *tk = TypeKlassPtr::make(klass);
duke@0 730 Node* con = _gvn.makecon(tk);
never@1344 731 Node* not_subtype_ctrl = gen_subtype_check(ex_klass_node, con);
never@1344 732 if (!stopped()) {
never@1344 733 PreserveJVMState pjvms(this);
never@1344 734 const TypeInstPtr* tinst = TypeOopPtr::make_from_klass_unique(klass)->cast_to_ptr_type(TypePtr::NotNull)->is_instptr();
never@1344 735 assert(klass->has_subklass() || tinst->klass_is_exact(), "lost exactness");
duke@0 736 Node* ex_oop = _gvn.transform(new (C, 2) CheckCastPPNode(control(), ex_node, tinst));
duke@0 737 push_ex_oop(ex_oop); // Push exception oop for handler
duke@0 738 #ifndef PRODUCT
duke@0 739 if (PrintOpto && WizardMode) {
duke@0 740 tty->print(" Catching inline exception bci:%d -> handler_bci:%d -- ", bci(), handler_bci);
duke@0 741 klass->print_name();
duke@0 742 tty->cr();
duke@0 743 }
duke@0 744 #endif
duke@0 745 merge_exception(handler_bci);
duke@0 746 }
never@1344 747 set_control(not_subtype_ctrl);
duke@0 748
duke@0 749 // Come here if exception does not match handler.
duke@0 750 // Carry on with more handler checks.
duke@0 751 --remaining;
duke@0 752 }
duke@0 753
duke@0 754 assert(!stopped(), "you should return if you finish the chain");
duke@0 755
duke@0 756 // Oops, need to call into the VM to resolve the klasses at runtime.
duke@0 757 // Note: This call must not deoptimize, since it is not a real at this bci!
duke@0 758 kill_dead_locals();
duke@0 759
duke@0 760 make_runtime_call(RC_NO_LEAF | RC_MUST_THROW,
duke@0 761 OptoRuntime::rethrow_Type(),
duke@0 762 OptoRuntime::rethrow_stub(),
duke@0 763 NULL, NULL,
duke@0 764 ex_node);
duke@0 765
duke@0 766 // Rethrow is a pure call, no side effects, only a result.
duke@0 767 // The result cannot be allocated, so we use I_O
duke@0 768
duke@0 769 // Catch exceptions from the rethrow
duke@0 770 catch_call_exceptions(handlers);
duke@0 771 }
duke@0 772
duke@0 773
duke@0 774 // (Note: Moved add_debug_info into GraphKit::add_safepoint_edges.)
duke@0 775
duke@0 776
duke@0 777 #ifndef PRODUCT
duke@0 778 void Parse::count_compiled_calls(bool at_method_entry, bool is_inline) {
duke@0 779 if( CountCompiledCalls ) {
duke@0 780 if( at_method_entry ) {
duke@0 781 // bump invocation counter if top method (for statistics)
duke@0 782 if (CountCompiledCalls && depth() == 1) {
duke@0 783 const TypeInstPtr* addr_type = TypeInstPtr::make(method());
duke@0 784 Node* adr1 = makecon(addr_type);
duke@0 785 Node* adr2 = basic_plus_adr(adr1, adr1, in_bytes(methodOopDesc::compiled_invocation_counter_offset()));
duke@0 786 increment_counter(adr2);
duke@0 787 }
duke@0 788 } else if (is_inline) {
duke@0 789 switch (bc()) {
duke@0 790 case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_inlined_calls_addr()); break;
duke@0 791 case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_inlined_interface_calls_addr()); break;
duke@0 792 case Bytecodes::_invokestatic:
jrose@726 793 case Bytecodes::_invokedynamic:
duke@0 794 case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_inlined_static_calls_addr()); break;
duke@0 795 default: fatal("unexpected call bytecode");
duke@0 796 }
duke@0 797 } else {
duke@0 798 switch (bc()) {
duke@0 799 case Bytecodes::_invokevirtual: increment_counter(SharedRuntime::nof_normal_calls_addr()); break;
duke@0 800 case Bytecodes::_invokeinterface: increment_counter(SharedRuntime::nof_interface_calls_addr()); break;
duke@0 801 case Bytecodes::_invokestatic:
jrose@726 802 case Bytecodes::_invokedynamic:
duke@0 803 case Bytecodes::_invokespecial: increment_counter(SharedRuntime::nof_static_calls_addr()); break;
duke@0 804 default: fatal("unexpected call bytecode");
duke@0 805 }
duke@0 806 }
duke@0 807 }
duke@0 808 }
duke@0 809 #endif //PRODUCT
duke@0 810
duke@0 811
duke@0 812 // Identify possible target method and inlining style
duke@0 813 ciMethod* Parse::optimize_inlining(ciMethod* caller, int bci, ciInstanceKlass* klass,
duke@0 814 ciMethod *dest_method, const TypeOopPtr* receiver_type) {
duke@0 815 // only use for virtual or interface calls
duke@0 816
duke@0 817 // If it is obviously final, do not bother to call find_monomorphic_target,
duke@0 818 // because the class hierarchy checks are not needed, and may fail due to
duke@0 819 // incompletely loaded classes. Since we do our own class loading checks
duke@0 820 // in this module, we may confidently bind to any method.
duke@0 821 if (dest_method->can_be_statically_bound()) {
duke@0 822 return dest_method;
duke@0 823 }
duke@0 824
duke@0 825 // Attempt to improve the receiver
duke@0 826 bool actual_receiver_is_exact = false;
duke@0 827 ciInstanceKlass* actual_receiver = klass;
duke@0 828 if (receiver_type != NULL) {
duke@0 829 // Array methods are all inherited from Object, and are monomorphic.
duke@0 830 if (receiver_type->isa_aryptr() &&
duke@0 831 dest_method->holder() == env()->Object_klass()) {
duke@0 832 return dest_method;
duke@0 833 }
duke@0 834
duke@0 835 // All other interesting cases are instance klasses.
duke@0 836 if (!receiver_type->isa_instptr()) {
duke@0 837 return NULL;
duke@0 838 }
duke@0 839
duke@0 840 ciInstanceKlass *ikl = receiver_type->klass()->as_instance_klass();
duke@0 841 if (ikl->is_loaded() && ikl->is_initialized() && !ikl->is_interface() &&
never@367 842 (ikl == actual_receiver || ikl->is_subtype_of(actual_receiver))) {
duke@0 843 // ikl is a same or better type than the original actual_receiver,
duke@0 844 // e.g. static receiver from bytecodes.
duke@0 845 actual_receiver = ikl;
duke@0 846 // Is the actual_receiver exact?
duke@0 847 actual_receiver_is_exact = receiver_type->klass_is_exact();
duke@0 848 }
duke@0 849 }
duke@0 850
duke@0 851 ciInstanceKlass* calling_klass = caller->holder();
duke@0 852 ciMethod* cha_monomorphic_target = dest_method->find_monomorphic_target(calling_klass, klass, actual_receiver);
duke@0 853 if (cha_monomorphic_target != NULL) {
duke@0 854 assert(!cha_monomorphic_target->is_abstract(), "");
duke@0 855 // Look at the method-receiver type. Does it add "too much information"?
duke@0 856 ciKlass* mr_klass = cha_monomorphic_target->holder();
duke@0 857 const Type* mr_type = TypeInstPtr::make(TypePtr::BotPTR, mr_klass);
duke@0 858 if (receiver_type == NULL || !receiver_type->higher_equal(mr_type)) {
duke@0 859 // Calling this method would include an implicit cast to its holder.
duke@0 860 // %%% Not yet implemented. Would throw minor asserts at present.
duke@0 861 // %%% The most common wins are already gained by +UseUniqueSubclasses.
duke@0 862 // To fix, put the higher_equal check at the call of this routine,
duke@0 863 // and add a CheckCastPP to the receiver.
duke@0 864 if (TraceDependencies) {
duke@0 865 tty->print_cr("found unique CHA method, but could not cast up");
duke@0 866 tty->print(" method = ");
duke@0 867 cha_monomorphic_target->print();
duke@0 868 tty->cr();
duke@0 869 }
duke@0 870 if (C->log() != NULL) {
duke@0 871 C->log()->elem("missed_CHA_opportunity klass='%d' method='%d'",
duke@0 872 C->log()->identify(klass),
duke@0 873 C->log()->identify(cha_monomorphic_target));
duke@0 874 }
duke@0 875 cha_monomorphic_target = NULL;
duke@0 876 }
duke@0 877 }
duke@0 878 if (cha_monomorphic_target != NULL) {
duke@0 879 // Hardwiring a virtual.
duke@0 880 // If we inlined because CHA revealed only a single target method,
duke@0 881 // then we are dependent on that target method not getting overridden
duke@0 882 // by dynamic class loading. Be sure to test the "static" receiver
duke@0 883 // dest_method here, as opposed to the actual receiver, which may
duke@0 884 // falsely lead us to believe that the receiver is final or private.
duke@0 885 C->dependencies()->assert_unique_concrete_method(actual_receiver, cha_monomorphic_target);
duke@0 886 return cha_monomorphic_target;
duke@0 887 }
duke@0 888
duke@0 889 // If the type is exact, we can still bind the method w/o a vcall.
duke@0 890 // (This case comes after CHA so we can see how much extra work it does.)
duke@0 891 if (actual_receiver_is_exact) {
duke@0 892 // In case of evolution, there is a dependence on every inlined method, since each
duke@0 893 // such method can be changed when its class is redefined.
duke@0 894 ciMethod* exact_method = dest_method->resolve_invoke(calling_klass, actual_receiver);
duke@0 895 if (exact_method != NULL) {
duke@0 896 #ifndef PRODUCT
duke@0 897 if (PrintOpto) {
duke@0 898 tty->print(" Calling method via exact type @%d --- ", bci);
duke@0 899 exact_method->print_name();
duke@0 900 tty->cr();
duke@0 901 }
duke@0 902 #endif
duke@0 903 return exact_method;
duke@0 904 }
duke@0 905 }
duke@0 906
duke@0 907 return NULL;
duke@0 908 }