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