annotate src/share/vm/opto/doCall.cpp @ 3974:d092d1b31229

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