annotate src/share/vm/opto/doCall.cpp @ 9462:231763c1883e

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