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