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