annotate src/share/vm/opto/doCall.cpp @ 1080:7c57aead6d3e

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