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