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