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