1 /*
2 * Copyright (c) 2000, 2015, 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 */
24
25 #include "precompiled.hpp"
26 #include "ci/bcEscapeAnalyzer.hpp"
27 #include "ci/ciCallSite.hpp"
28 #include "ci/ciObjArray.hpp"
29 #include "ci/ciMemberName.hpp"
30 #include "ci/ciMethodHandle.hpp"
31 #include "classfile/javaClasses.hpp"
32 #include "compiler/compileLog.hpp"
33 #include "opto/addnode.hpp"
34 #include "opto/callGenerator.hpp"
35 #include "opto/callnode.hpp"
36 #include "opto/castnode.hpp"
37 #include "opto/cfgnode.hpp"
38 #include "opto/parse.hpp"
39 #include "opto/rootnode.hpp"
40 #include "opto/runtime.hpp"
41 #include "opto/subnode.hpp"
42 #include "opto/valuetypenode.hpp"
43 #include "runtime/sharedRuntime.hpp"
44
45 // Utility function.
46 const TypeFunc* CallGenerator::tf() const {
47 return TypeFunc::make(method());
48 }
49
50 bool CallGenerator::is_inlined_method_handle_intrinsic(JVMState* jvms, ciMethod* callee) {
51 ciMethod* symbolic_info = jvms->method()->get_method_at_bci(jvms->bci());
52 return symbolic_info->is_method_handle_intrinsic() && !callee->is_method_handle_intrinsic();
53 }
54
55 //-----------------------------ParseGenerator---------------------------------
56 // Internal class which handles all direct bytecode traversal.
57 class ParseGenerator : public InlineCallGenerator {
58 private:
59 bool _is_osr;
60 float _expected_uses;
61
62 public:
63 ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false)
64 : InlineCallGenerator(method)
65 {
66 _is_osr = is_osr;
67 _expected_uses = expected_uses;
68 assert(InlineTree::check_can_parse(method) == NULL, "parse must be possible");
69 }
70
71 virtual bool is_parse() const { return true; }
72 virtual JVMState* generate(JVMState* jvms);
73 int is_osr() { return _is_osr; }
74
75 };
76
77 JVMState* ParseGenerator::generate(JVMState* jvms) {
78 Compile* C = Compile::current();
79 C->print_inlining_update(this);
80
81 if (is_osr()) {
82 // The JVMS for a OSR has a single argument (see its TypeFunc).
83 assert(jvms->depth() == 1, "no inline OSR");
84 }
85
86 if (C->failing()) {
87 return NULL; // bailing out of the compile; do not try to parse
88 }
89
90 Parse parser(jvms, method(), _expected_uses);
91 // Grab signature for matching/allocation
92 #ifdef ASSERT
93 if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) {
94 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag);
95 assert(C->env()->system_dictionary_modification_counter_changed(),
96 "Must invalidate if TypeFuncs differ");
97 }
98 #endif
99
100 GraphKit& exits = parser.exits();
101
102 if (C->failing()) {
103 while (exits.pop_exception_state() != NULL) ;
104 return NULL;
105 }
106
107 assert(exits.jvms()->same_calls_as(jvms), "sanity");
108
109 // Simply return the exit state of the parser,
110 // augmented by any exceptional states.
111 return exits.transfer_exceptions_into_jvms();
112 }
113
114 //---------------------------DirectCallGenerator------------------------------
115 // Internal class which handles all out-of-line calls w/o receiver type checks.
116 class DirectCallGenerator : public CallGenerator {
117 private:
118 CallStaticJavaNode* _call_node;
119 // Force separate memory and I/O projections for the exceptional
120 // paths to facilitate late inlining.
121 bool _separate_io_proj;
122
123 public:
124 DirectCallGenerator(ciMethod* method, bool separate_io_proj)
125 : CallGenerator(method),
126 _separate_io_proj(separate_io_proj)
127 {
128 if (method->is_method_handle_intrinsic() &&
129 method->signature()->return_type() == ciEnv::current()->___Value_klass()) {
130 // If that call has not been optimized by the time optimizations
131 // are over, we'll need to add a call to create a value type
132 // instance from the klass returned by the call. Separating
133 // memory and I/O projections for exceptions is required to
134 // perform that graph transformation.
135 _separate_io_proj = true;
136 }
137 }
138 virtual JVMState* generate(JVMState* jvms);
139
140 CallStaticJavaNode* call_node() const { return _call_node; }
141 };
142
143 JVMState* DirectCallGenerator::generate(JVMState* jvms) {
144 GraphKit kit(jvms);
145 kit.C->print_inlining_update(this);
146 PhaseGVN& gvn = kit.gvn();
147 bool is_static = method()->is_static();
148 address target = is_static ? SharedRuntime::get_resolve_static_call_stub()
149 : SharedRuntime::get_resolve_opt_virtual_call_stub();
150
151 if (kit.C->log() != NULL) {
152 kit.C->log()->elem("direct_call bci='%d'", jvms->bci());
153 }
154
155 CallStaticJavaNode *call = new CallStaticJavaNode(kit.C, tf(), target, method(), kit.bci());
156 if (is_inlined_method_handle_intrinsic(jvms, method())) {
157 // To be able to issue a direct call and skip a call to MH.linkTo*/invokeBasic adapter,
158 // additional information about the method being invoked should be attached
159 // to the call site to make resolution logic work
160 // (see SharedRuntime::resolve_static_call_C).
161 call->set_override_symbolic_info(true);
162 }
163 _call_node = call; // Save the call node in case we need it later
164 if (!is_static) {
165 if (!kit.argument(0)->is_ValueType()) {
166 // Make an explicit receiver null_check as part of this call.
167 // Since we share a map with the caller, his JVMS gets adjusted.
168 kit.null_check_receiver_before_call(method());
169 }
170 if (kit.stopped()) {
171 // And dump it back to the caller, decorated with any exceptions:
172 return kit.transfer_exceptions_into_jvms();
173 }
174 // Mark the call node as virtual, sort of:
175 call->set_optimized_virtual(true);
176 if (method()->is_method_handle_intrinsic() ||
177 method()->is_compiled_lambda_form()) {
178 call->set_method_handle_invoke(true);
179 }
180 }
181 kit.set_arguments_for_java_call(call);
182 kit.set_edges_for_java_call(call, false, _separate_io_proj);
183 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj);
184 // Check if return value is a value type pointer
185 const TypeValueTypePtr* vtptr = gvn.type(ret)->isa_valuetypeptr();
186 if (vtptr != NULL) {
187 if (vtptr->klass() != kit.C->env()->___Value_klass()) {
188 // Create ValueTypeNode from the oop and replace the return value
189 Node* vt = ValueTypeNode::make(gvn, kit.merged_memory(), ret);
190 kit.push_node(T_VALUETYPE, vt);
191 } else {
192 kit.push_node(T_VALUETYPE, ret);
193 }
194 } else {
195 kit.push_node(method()->return_type()->basic_type(), ret);
196 }
197 return kit.transfer_exceptions_into_jvms();
198 }
199
200 //--------------------------VirtualCallGenerator------------------------------
201 // Internal class which handles all out-of-line calls checking receiver type.
202 class VirtualCallGenerator : public CallGenerator {
203 private:
204 int _vtable_index;
205 public:
206 VirtualCallGenerator(ciMethod* method, int vtable_index)
207 : CallGenerator(method), _vtable_index(vtable_index)
208 {
209 assert(vtable_index == Method::invalid_vtable_index ||
210 vtable_index >= 0, "either invalid or usable");
211 }
212 virtual bool is_virtual() const { return true; }
213 virtual JVMState* generate(JVMState* jvms);
214 };
215
216 JVMState* VirtualCallGenerator::generate(JVMState* jvms) {
217 GraphKit kit(jvms);
218 Node* receiver = kit.argument(0);
219 PhaseGVN& gvn = kit.gvn();
220 kit.C->print_inlining_update(this);
221
222 if (kit.C->log() != NULL) {
223 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci());
224 }
225
226 // If the receiver is a constant null, do not torture the system
227 // by attempting to call through it. The compile will proceed
228 // correctly, but may bail out in final_graph_reshaping, because
229 // the call instruction will have a seemingly deficient out-count.
230 // (The bailout says something misleading about an "infinite loop".)
231 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) {
232 assert(Bytecodes::is_invoke(kit.java_bc()), "%d: %s", kit.java_bc(), Bytecodes::name(kit.java_bc()));
233 ciMethod* declared_method = kit.method()->get_method_at_bci(kit.bci());
234 int arg_size = declared_method->signature()->arg_size_for_bc(kit.java_bc());
235 kit.inc_sp(arg_size); // restore arguments
236 kit.uncommon_trap(Deoptimization::Reason_null_check,
237 Deoptimization::Action_none,
238 NULL, "null receiver");
239 return kit.transfer_exceptions_into_jvms();
240 }
241
242 // Ideally we would unconditionally do a null check here and let it
243 // be converted to an implicit check based on profile information.
244 // However currently the conversion to implicit null checks in
245 // Block::implicit_null_check() only looks for loads and stores, not calls.
246 ciMethod *caller = kit.method();
247 ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data();
248 if (!UseInlineCaches || !ImplicitNullChecks || !os::zero_page_read_protected() ||
249 ((ImplicitNullCheckThreshold > 0) && caller_md &&
250 (caller_md->trap_count(Deoptimization::Reason_null_check)
251 >= (uint)ImplicitNullCheckThreshold))) {
252 // Make an explicit receiver null_check as part of this call.
253 // Since we share a map with the caller, his JVMS gets adjusted.
254 receiver = kit.null_check_receiver_before_call(method());
255 if (kit.stopped()) {
256 // And dump it back to the caller, decorated with any exceptions:
257 return kit.transfer_exceptions_into_jvms();
258 }
259 }
260
261 assert(!method()->is_static(), "virtual call must not be to static");
262 assert(!method()->is_final(), "virtual call should not be to final");
263 assert(!method()->is_private(), "virtual call should not be to private");
264 assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches,
265 "no vtable calls if +UseInlineCaches ");
266 address target = SharedRuntime::get_resolve_virtual_call_stub();
267 // Normal inline cache used for call
268 CallDynamicJavaNode *call = new CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci());
269 if (is_inlined_method_handle_intrinsic(jvms, method())) {
270 // To be able to issue a direct call (optimized virtual or virtual)
271 // and skip a call to MH.linkTo*/invokeBasic adapter, additional information
272 // about the method being invoked should be attached to the call site to
273 // make resolution logic work (see SharedRuntime::resolve_{virtual,opt_virtual}_call_C).
274 call->set_override_symbolic_info(true);
275 }
276 kit.set_arguments_for_java_call(call);
277 kit.set_edges_for_java_call(call);
278 Node* ret = kit.set_results_for_java_call(call);
279 // Check if return value is a value type pointer
280 if (gvn.type(ret)->isa_valuetypeptr()) {
281 // Create ValueTypeNode from the oop and replace the return value
282 Node* vt = ValueTypeNode::make(gvn, kit.merged_memory(), ret);
283 kit.push_node(T_VALUETYPE, vt);
284 } else {
285 kit.push_node(method()->return_type()->basic_type(), ret);
286 }
287
288 // Represent the effect of an implicit receiver null_check
289 // as part of this call. Since we share a map with the caller,
290 // his JVMS gets adjusted.
291 kit.cast_not_null(receiver);
292 return kit.transfer_exceptions_into_jvms();
293 }
294
295 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) {
296 if (InlineTree::check_can_parse(m) != NULL) return NULL;
297 return new ParseGenerator(m, expected_uses);
298 }
299
300 // As a special case, the JVMS passed to this CallGenerator is
301 // for the method execution already in progress, not just the JVMS
302 // of the caller. Thus, this CallGenerator cannot be mixed with others!
303 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) {
304 if (InlineTree::check_can_parse(m) != NULL) return NULL;
305 float past_uses = m->interpreter_invocation_count();
306 float expected_uses = past_uses;
307 return new ParseGenerator(m, expected_uses, true);
308 }
309
310 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) {
311 assert(!m->is_abstract(), "for_direct_call mismatch");
312 return new DirectCallGenerator(m, separate_io_proj);
313 }
314
315 CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) {
316 assert(!m->is_static(), "for_virtual_call mismatch");
317 assert(!m->is_method_handle_intrinsic(), "should be a direct call");
318 return new VirtualCallGenerator(m, vtable_index);
319 }
320
321 // Allow inlining decisions to be delayed
322 class LateInlineCallGenerator : public DirectCallGenerator {
323 private:
324 // unique id for log compilation
325 jlong _unique_id;
326
327 protected:
328 CallGenerator* _inline_cg;
329 virtual bool do_late_inline_check(JVMState* jvms) { return true; }
330
331 public:
332 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
333 DirectCallGenerator(method, true), _inline_cg(inline_cg), _unique_id(0) {}
334
335 virtual bool is_late_inline() const { return true; }
336
337 // Convert the CallStaticJava into an inline
338 virtual void do_late_inline();
339
340 virtual JVMState* generate(JVMState* jvms) {
341 Compile *C = Compile::current();
342
343 C->log_inline_id(this);
344
345 // Record that this call site should be revisited once the main
346 // parse is finished.
347 if (!is_mh_late_inline()) {
348 C->add_late_inline(this);
349 }
350
351 // Emit the CallStaticJava and request separate projections so
352 // that the late inlining logic can distinguish between fall
353 // through and exceptional uses of the memory and io projections
354 // as is done for allocations and macro expansion.
355 return DirectCallGenerator::generate(jvms);
356 }
357
358 virtual void print_inlining_late(const char* msg) {
359 CallNode* call = call_node();
360 Compile* C = Compile::current();
361 C->print_inlining_assert_ready();
362 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), msg);
363 C->print_inlining_move_to(this);
364 C->print_inlining_update_delayed(this);
365 }
366
367 virtual void set_unique_id(jlong id) {
368 _unique_id = id;
369 }
370
371 virtual jlong unique_id() const {
372 return _unique_id;
373 }
374 };
375
376 void LateInlineCallGenerator::do_late_inline() {
377 // Can't inline it
378 CallStaticJavaNode* call = call_node();
379 if (call == NULL || call->outcnt() == 0 ||
380 call->in(0) == NULL || call->in(0)->is_top()) {
381 return;
382 }
383
384 const TypeTuple *r = call->tf()->domain_cc();
385 for (int i1 = 0; i1 < method()->arg_size(); i1++) {
386 if (call->in(TypeFunc::Parms + i1)->is_top() && r->field_at(TypeFunc::Parms + i1) != Type::HALF) {
387 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
388 return;
389 }
390 }
391
392 if (call->in(TypeFunc::Memory)->is_top()) {
393 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing");
394 return;
395 }
396
397 Compile* C = Compile::current();
398 // Remove inlined methods from Compiler's lists.
399 if (call->is_macro()) {
400 C->remove_macro_node(call);
401 }
402
403 // Make a clone of the JVMState that appropriate to use for driving a parse
404 JVMState* old_jvms = call->jvms();
405 JVMState* jvms = old_jvms->clone_shallow(C);
406 uint size = call->req();
407 SafePointNode* map = new SafePointNode(size, jvms);
408 for (uint i1 = 0; i1 < size; i1++) {
409 map->init_req(i1, call->in(i1));
410 }
411
412 PhaseGVN& gvn = *C->initial_gvn();
413 // Make sure the state is a MergeMem for parsing.
414 if (!map->in(TypeFunc::Memory)->is_MergeMem()) {
415 Node* mem = MergeMemNode::make(map->in(TypeFunc::Memory));
416 gvn.set_type_bottom(mem);
417 map->set_req(TypeFunc::Memory, mem);
418 }
419
420 // blow away old call arguments
421 Node* top = C->top();
422 for (uint i1 = TypeFunc::Parms; i1 < call->_tf->domain_cc()->cnt(); i1++) {
423 map->set_req(i1, top);
424 }
425 jvms->set_map(map);
426
427 // Make enough space in the expression stack to transfer
428 // the incoming arguments and return value.
429 map->ensure_stack(jvms, jvms->method()->max_stack());
430 const TypeTuple *domain_sig = call->_tf->domain_sig();
431 uint nargs = method()->arg_size();
432 assert(domain_sig->cnt() - TypeFunc::Parms == nargs, "inconsistent signature");
433
434 uint j = TypeFunc::Parms;
435 for (uint i1 = 0; i1 < nargs; i1++) {
436 const Type* t = domain_sig->field_at(TypeFunc::Parms + i1);
437 if (!ValueTypePassFieldsAsArgs) {
438 Node* arg = call->in(TypeFunc::Parms + i1);
439 if (t->isa_valuetypeptr()) {
440 arg = ValueTypeNode::make(gvn, map->memory(), arg);
441 }
442 map->set_argument(jvms, i1, arg);
443 } else {
444 if (t->isa_valuetypeptr() && t->is_valuetypeptr()->klass() != C->env()->___Value_klass()) {
445 ciValueKlass* vk = t->is_valuetypeptr()->value_type()->value_klass();
446 Node* vt = C->create_vt_node(call, vk, vk, 0, j, true);
447 map->set_argument(jvms, i1, gvn.transform(vt));
448 j += vk->value_arg_slots();
449 } else {
450 map->set_argument(jvms, i1, call->in(j));
451 j++;
452 }
453 }
454 }
455
456 C->print_inlining_assert_ready();
457
458 C->print_inlining_move_to(this);
459
460 C->log_late_inline(this);
461
462 // This check is done here because for_method_handle_inline() method
463 // needs jvms for inlined state.
464 if (!do_late_inline_check(jvms)) {
465 map->disconnect_inputs(NULL, C);
466 return;
467 }
468
469 // Setup default node notes to be picked up by the inlining
470 Node_Notes* old_nn = C->node_notes_at(call->_idx);
471 if (old_nn != NULL) {
472 Node_Notes* entry_nn = old_nn->clone(C);
473 entry_nn->set_jvms(jvms);
474 C->set_default_node_notes(entry_nn);
475 }
476
477 // Now perform the inlining using the synthesized JVMState
478 JVMState* new_jvms = _inline_cg->generate(jvms);
479 if (new_jvms == NULL) return; // no change
480 if (C->failing()) return;
481
482 // Capture any exceptional control flow
483 GraphKit kit(new_jvms);
484
485 // Find the result object
486 Node* result = C->top();
487 ciType* return_type = _inline_cg->method()->return_type();
488 int result_size = return_type->size();
489 if (result_size != 0 && !kit.stopped()) {
490 result = (result_size == 1) ? kit.pop() : kit.pop_pair();
491 }
492
493 C->set_has_loops(C->has_loops() || _inline_cg->method()->has_loops());
494 C->env()->notice_inlined_method(_inline_cg->method());
495 C->set_inlining_progress(true);
496
497 if (return_type->is_valuetype() && return_type != C->env()->___Value_klass()) {
498 if (result->is_ValueType()) {
499 if (!call->tf()->returns_value_type_as_fields()) {
500 result = result->as_ValueType()->store_to_memory(&kit);
501 } else {
502 // Return of multiple values (the fields of a value type)
503 ValueTypeNode* vt = result->as_ValueType();
504 vt->replace_call_results(call, C);
505 }
506 } else {
507 assert(result->is_top(), "what else?");
508 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) {
509 ProjNode *pn = call->fast_out(i)->as_Proj();
510 uint con = pn->_con;
511 if (con >= TypeFunc::Parms) {
512 // C->gvn_replace_by(pn, C->top());
513 C->initial_gvn()->hash_delete(pn);
514 pn->set_req(0, C->top());
515 --i; --imax;
516 }
517 }
518 }
519 }
520
521 kit.replace_call(call, result, true);
522 }
523
524
525 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
526 return new LateInlineCallGenerator(method, inline_cg);
527 }
528
529 class LateInlineMHCallGenerator : public LateInlineCallGenerator {
530 ciMethod* _caller;
531 int _attempt;
532 bool _input_not_const;
533
534 virtual bool do_late_inline_check(JVMState* jvms);
535 virtual bool already_attempted() const { return _attempt > 0; }
536
537 public:
538 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) :
539 LateInlineCallGenerator(callee, NULL), _caller(caller), _attempt(0), _input_not_const(input_not_const) {}
540
541 virtual bool is_mh_late_inline() const { return true; }
542
543 virtual JVMState* generate(JVMState* jvms) {
544 JVMState* new_jvms = LateInlineCallGenerator::generate(jvms);
545
546 Compile* C = Compile::current();
547 if (_input_not_const) {
548 // inlining won't be possible so no need to enqueue right now.
549 call_node()->set_generator(this);
550 } else {
551 C->add_late_inline(this);
552 }
553 return new_jvms;
554 }
555 };
556
557 bool LateInlineMHCallGenerator::do_late_inline_check(JVMState* jvms) {
558
559 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), _input_not_const, AlwaysIncrementalInline);
560
561 Compile::current()->print_inlining_update_delayed(this);
562
563 if (!_input_not_const) {
564 _attempt++;
565 }
566
567 if (cg != NULL && (cg->is_inline() || cg->is_inlined_method_handle_intrinsic(jvms, cg->method()))) {
568 assert(!cg->is_late_inline(), "we're doing late inlining");
569 _inline_cg = cg;
570 Compile::current()->dec_number_of_mh_late_inlines();
571 return true;
572 }
573
574 call_node()->set_generator(this);
575 return false;
576 }
577
578 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) {
579 Compile::current()->inc_number_of_mh_late_inlines();
580 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const);
581 return cg;
582 }
583
584 class LateInlineStringCallGenerator : public LateInlineCallGenerator {
585
586 public:
587 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
588 LateInlineCallGenerator(method, inline_cg) {}
589
590 virtual JVMState* generate(JVMState* jvms) {
591 Compile *C = Compile::current();
592
593 C->log_inline_id(this);
594
595 C->add_string_late_inline(this);
596
597 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
598 return new_jvms;
599 }
600
601 virtual bool is_string_late_inline() const { return true; }
602 };
603
604 CallGenerator* CallGenerator::for_string_late_inline(ciMethod* method, CallGenerator* inline_cg) {
605 return new LateInlineStringCallGenerator(method, inline_cg);
606 }
607
608 class LateInlineBoxingCallGenerator : public LateInlineCallGenerator {
609
610 public:
611 LateInlineBoxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
612 LateInlineCallGenerator(method, inline_cg) {}
613
614 virtual JVMState* generate(JVMState* jvms) {
615 Compile *C = Compile::current();
616
617 C->log_inline_id(this);
618
619 C->add_boxing_late_inline(this);
620
621 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
622 return new_jvms;
623 }
624 };
625
626 CallGenerator* CallGenerator::for_boxing_late_inline(ciMethod* method, CallGenerator* inline_cg) {
627 return new LateInlineBoxingCallGenerator(method, inline_cg);
628 }
629
630 //---------------------------WarmCallGenerator--------------------------------
631 // Internal class which handles initial deferral of inlining decisions.
632 class WarmCallGenerator : public CallGenerator {
633 WarmCallInfo* _call_info;
634 CallGenerator* _if_cold;
635 CallGenerator* _if_hot;
636 bool _is_virtual; // caches virtuality of if_cold
637 bool _is_inline; // caches inline-ness of if_hot
638
639 public:
640 WarmCallGenerator(WarmCallInfo* ci,
641 CallGenerator* if_cold,
642 CallGenerator* if_hot)
643 : CallGenerator(if_cold->method())
644 {
645 assert(method() == if_hot->method(), "consistent choices");
646 _call_info = ci;
647 _if_cold = if_cold;
648 _if_hot = if_hot;
649 _is_virtual = if_cold->is_virtual();
650 _is_inline = if_hot->is_inline();
651 }
652
653 virtual bool is_inline() const { return _is_inline; }
654 virtual bool is_virtual() const { return _is_virtual; }
655 virtual bool is_deferred() const { return true; }
656
657 virtual JVMState* generate(JVMState* jvms);
658 };
659
660
661 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci,
662 CallGenerator* if_cold,
663 CallGenerator* if_hot) {
664 return new WarmCallGenerator(ci, if_cold, if_hot);
665 }
666
667 JVMState* WarmCallGenerator::generate(JVMState* jvms) {
668 Compile* C = Compile::current();
669 C->print_inlining_update(this);
670
671 if (C->log() != NULL) {
672 C->log()->elem("warm_call bci='%d'", jvms->bci());
673 }
674 jvms = _if_cold->generate(jvms);
675 if (jvms != NULL) {
676 Node* m = jvms->map()->control();
677 if (m->is_CatchProj()) m = m->in(0); else m = C->top();
678 if (m->is_Catch()) m = m->in(0); else m = C->top();
679 if (m->is_Proj()) m = m->in(0); else m = C->top();
680 if (m->is_CallJava()) {
681 _call_info->set_call(m->as_Call());
682 _call_info->set_hot_cg(_if_hot);
683 #ifndef PRODUCT
684 if (PrintOpto || PrintOptoInlining) {
685 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci());
686 tty->print("WCI: ");
687 _call_info->print();
688 }
689 #endif
690 _call_info->set_heat(_call_info->compute_heat());
691 C->set_warm_calls(_call_info->insert_into(C->warm_calls()));
692 }
693 }
694 return jvms;
695 }
696
697 void WarmCallInfo::make_hot() {
698 Unimplemented();
699 }
700
701 void WarmCallInfo::make_cold() {
702 // No action: Just dequeue.
703 }
704
705
706 //------------------------PredictedCallGenerator------------------------------
707 // Internal class which handles all out-of-line calls checking receiver type.
708 class PredictedCallGenerator : public CallGenerator {
709 ciKlass* _predicted_receiver;
710 CallGenerator* _if_missed;
711 CallGenerator* _if_hit;
712 float _hit_prob;
713
714 public:
715 PredictedCallGenerator(ciKlass* predicted_receiver,
716 CallGenerator* if_missed,
717 CallGenerator* if_hit, float hit_prob)
718 : CallGenerator(if_missed->method())
719 {
720 // The call profile data may predict the hit_prob as extreme as 0 or 1.
721 // Remove the extremes values from the range.
722 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX;
723 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
724
725 _predicted_receiver = predicted_receiver;
726 _if_missed = if_missed;
727 _if_hit = if_hit;
728 _hit_prob = hit_prob;
729 }
730
731 virtual bool is_virtual() const { return true; }
732 virtual bool is_inline() const { return _if_hit->is_inline(); }
733 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
734
735 virtual JVMState* generate(JVMState* jvms);
736 };
737
738
739 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver,
740 CallGenerator* if_missed,
741 CallGenerator* if_hit,
742 float hit_prob) {
743 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob);
744 }
745
746
747 JVMState* PredictedCallGenerator::generate(JVMState* jvms) {
748 GraphKit kit(jvms);
749 kit.C->print_inlining_update(this);
750 PhaseGVN& gvn = kit.gvn();
751 // We need an explicit receiver null_check before checking its type.
752 // We share a map with the caller, so his JVMS gets adjusted.
753 Node* receiver = kit.argument(0);
754 CompileLog* log = kit.C->log();
755 if (log != NULL) {
756 log->elem("predicted_call bci='%d' klass='%d'",
757 jvms->bci(), log->identify(_predicted_receiver));
758 }
759
760 receiver = kit.null_check_receiver_before_call(method());
761 if (kit.stopped()) {
762 return kit.transfer_exceptions_into_jvms();
763 }
764
765 // Make a copy of the replaced nodes in case we need to restore them
766 ReplacedNodes replaced_nodes = kit.map()->replaced_nodes();
767 replaced_nodes.clone();
768
769 Node* exact_receiver = receiver; // will get updated in place...
770 Node* slow_ctl = kit.type_check_receiver(receiver,
771 _predicted_receiver, _hit_prob,
772 &exact_receiver);
773
774 SafePointNode* slow_map = NULL;
775 JVMState* slow_jvms = NULL;
776 { PreserveJVMState pjvms(&kit);
777 kit.set_control(slow_ctl);
778 if (!kit.stopped()) {
779 slow_jvms = _if_missed->generate(kit.sync_jvms());
780 if (kit.failing())
781 return NULL; // might happen because of NodeCountInliningCutoff
782 assert(slow_jvms != NULL, "must be");
783 kit.add_exception_states_from(slow_jvms);
784 kit.set_map(slow_jvms->map());
785 if (!kit.stopped())
786 slow_map = kit.stop();
787 }
788 }
789
790 if (kit.stopped()) {
791 // Instance exactly does not matches the desired type.
792 kit.set_jvms(slow_jvms);
793 return kit.transfer_exceptions_into_jvms();
794 }
795
796 // fall through if the instance exactly matches the desired type
797 kit.replace_in_map(receiver, exact_receiver);
798
799 // Make the hot call:
800 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
801 if (new_jvms == NULL) {
802 // Inline failed, so make a direct call.
803 assert(_if_hit->is_inline(), "must have been a failed inline");
804 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
805 new_jvms = cg->generate(kit.sync_jvms());
806 }
807 kit.add_exception_states_from(new_jvms);
808 kit.set_jvms(new_jvms);
809
810 // Need to merge slow and fast?
811 if (slow_map == NULL) {
812 // The fast path is the only path remaining.
813 return kit.transfer_exceptions_into_jvms();
814 }
815
816 if (kit.stopped()) {
817 // Inlined method threw an exception, so it's just the slow path after all.
818 kit.set_jvms(slow_jvms);
819 return kit.transfer_exceptions_into_jvms();
820 }
821
822 // There are 2 branches and the replaced nodes are only valid on
823 // one: restore the replaced nodes to what they were before the
824 // branch.
825 kit.map()->set_replaced_nodes(replaced_nodes);
826
827 // Finish the diamond.
828 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
829 RegionNode* region = new RegionNode(3);
830 region->init_req(1, kit.control());
831 region->init_req(2, slow_map->control());
832 kit.set_control(gvn.transform(region));
833 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
834 iophi->set_req(2, slow_map->i_o());
835 kit.set_i_o(gvn.transform(iophi));
836 // Merge memory
837 kit.merge_memory(slow_map->merged_memory(), region, 2);
838 // Transform new memory Phis.
839 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
840 Node* phi = mms.memory();
841 if (phi->is_Phi() && phi->in(0) == region) {
842 mms.set_memory(gvn.transform(phi));
843 }
844 }
845 uint tos = kit.jvms()->stkoff() + kit.sp();
846 uint limit = slow_map->req();
847 for (uint i = TypeFunc::Parms; i < limit; i++) {
848 // Skip unused stack slots; fast forward to monoff();
849 if (i == tos) {
850 i = kit.jvms()->monoff();
851 if( i >= limit ) break;
852 }
853 Node* m = kit.map()->in(i);
854 Node* n = slow_map->in(i);
855 if (m != n) {
856 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
857 Node* phi = PhiNode::make(region, m, t);
858 phi->set_req(2, n);
859 kit.map()->set_req(i, gvn.transform(phi));
860 }
861 }
862 return kit.transfer_exceptions_into_jvms();
863 }
864
865
866 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool delayed_forbidden) {
867 assert(callee->is_method_handle_intrinsic(), "for_method_handle_call mismatch");
868 bool input_not_const;
869 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, input_not_const, false);
870 Compile* C = Compile::current();
871 if (cg != NULL) {
872 if (!delayed_forbidden && AlwaysIncrementalInline) {
873 return CallGenerator::for_late_inline(callee, cg);
874 } else {
875 return cg;
876 }
877 }
878 int bci = jvms->bci();
879 ciCallProfile profile = caller->call_profile_at_bci(bci);
880 int call_site_count = caller->scale_count(profile.count());
881
882 if (IncrementalInline && (AlwaysIncrementalInline ||
883 (call_site_count > 0 && (input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())))) {
884 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const);
885 } else {
886 // Out-of-line call.
887 return CallGenerator::for_direct_call(callee);
888 }
889 }
890
891 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool& input_not_const, bool delayed_forbidden) {
892 GraphKit kit(jvms);
893 PhaseGVN& gvn = kit.gvn();
894 Compile* C = kit.C;
895 vmIntrinsics::ID iid = callee->intrinsic_id();
896 input_not_const = true;
897 switch (iid) {
898 case vmIntrinsics::_invokeBasic:
899 {
900 // Get MethodHandle receiver:
901 Node* receiver = kit.argument(0);
902 if (receiver->Opcode() == Op_ConP) {
903 input_not_const = false;
904 const TypeOopPtr* oop_ptr = receiver->bottom_type()->is_oopptr();
905 ciMethod* target = oop_ptr->const_oop()->as_method_handle()->get_vmtarget();
906 const int vtable_index = Method::invalid_vtable_index;
907
908 if (!ciMethod::is_consistent_info(callee, target)) {
909 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
910 "signatures mismatch");
911 return NULL;
912 }
913
914 CallGenerator* cg = C->call_generator(target, vtable_index,
915 false /* call_does_dispatch */,
916 jvms,
917 true /* allow_inline */,
918 PROB_ALWAYS,
919 NULL,
920 true,
921 delayed_forbidden);
922 return cg;
923 } else {
924 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
925 "receiver not constant");
926 }
927 }
928 break;
929
930 case vmIntrinsics::_linkToVirtual:
931 case vmIntrinsics::_linkToStatic:
932 case vmIntrinsics::_linkToSpecial:
933 case vmIntrinsics::_linkToInterface:
934 {
935 // Get MemberName argument:
936 Node* member_name = kit.argument(callee->arg_size() - 1);
937 if (member_name->Opcode() == Op_ConP) {
938 input_not_const = false;
939 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr();
940 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget();
941
942 if (!ciMethod::is_consistent_info(callee, target)) {
943 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
944 "signatures mismatch");
945 return NULL;
946 }
947
948 // In lambda forms we erase signature types to avoid resolving issues
949 // involving class loaders. When we optimize a method handle invoke
950 // to a direct call we must cast the receiver and arguments to its
951 // actual types.
952 ciSignature* signature = target->signature();
953 const int receiver_skip = target->is_static() ? 0 : 1;
954 // Cast receiver to its type.
955 if (!target->is_static()) {
956 Node* arg = kit.argument(0);
957 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr();
958 const Type* sig_type = TypeOopPtr::make_from_klass(signature->accessing_klass());
959 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) {
960 Node* cast_obj = gvn.transform(new CheckCastPPNode(kit.control(), arg, sig_type));
961 kit.set_argument(0, cast_obj);
962 }
963 }
964 // Cast reference arguments to its type.
965 for (int i = 0, j = 0; i < signature->count(); i++) {
966 ciType* t = signature->type_at(i);
967 if (t->is_klass()) {
968 Node* arg = kit.argument(receiver_skip + j);
969 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr();
970 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass());
971 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) {
972 Node* cast_obj = gvn.transform(new CheckCastPPNode(kit.control(), arg, sig_type));
973 kit.set_argument(receiver_skip + j, cast_obj);
974 }
975 }
976 j += t->size(); // long and double take two slots
977 }
978
979 // Try to get the most accurate receiver type
980 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual);
981 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface);
982 int vtable_index = Method::invalid_vtable_index;
983 bool call_does_dispatch = false;
984
985 ciKlass* speculative_receiver_type = NULL;
986 if (is_virtual_or_interface) {
987 ciInstanceKlass* klass = target->holder();
988 Node* receiver_node = kit.argument(0);
989 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr();
990 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
991 // optimize_virtual_call() takes 2 different holder
992 // arguments for a corner case that doesn't apply here (see
993 // Parse::do_call())
994 target = C->optimize_virtual_call(caller, jvms->bci(), klass, klass,
995 target, receiver_type, is_virtual,
996 call_does_dispatch, vtable_index, // out-parameters
997 false /* check_access */);
998 // We lack profiling at this call but type speculation may
999 // provide us with a type
1000 speculative_receiver_type = (receiver_type != NULL) ? receiver_type->speculative_type() : NULL;
1001 }
1002 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms,
1003 true /* allow_inline */,
1004 PROB_ALWAYS,
1005 speculative_receiver_type,
1006 true,
1007 delayed_forbidden);
1008 return cg;
1009 } else {
1010 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1011 "member_name not constant");
1012 }
1013 }
1014 break;
1015
1016 default:
1017 fatal("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid));
1018 break;
1019 }
1020 return NULL;
1021 }
1022
1023
1024 //------------------------PredicatedIntrinsicGenerator------------------------------
1025 // Internal class which handles all predicated Intrinsic calls.
1026 class PredicatedIntrinsicGenerator : public CallGenerator {
1027 CallGenerator* _intrinsic;
1028 CallGenerator* _cg;
1029
1030 public:
1031 PredicatedIntrinsicGenerator(CallGenerator* intrinsic,
1032 CallGenerator* cg)
1033 : CallGenerator(cg->method())
1034 {
1035 _intrinsic = intrinsic;
1036 _cg = cg;
1037 }
1038
1039 virtual bool is_virtual() const { return true; }
1040 virtual bool is_inlined() const { return true; }
1041 virtual bool is_intrinsic() const { return true; }
1042
1043 virtual JVMState* generate(JVMState* jvms);
1044 };
1045
1046
1047 CallGenerator* CallGenerator::for_predicated_intrinsic(CallGenerator* intrinsic,
1048 CallGenerator* cg) {
1049 return new PredicatedIntrinsicGenerator(intrinsic, cg);
1050 }
1051
1052
1053 JVMState* PredicatedIntrinsicGenerator::generate(JVMState* jvms) {
1054 // The code we want to generate here is:
1055 // if (receiver == NULL)
1056 // uncommon_Trap
1057 // if (predicate(0))
1058 // do_intrinsic(0)
1059 // else
1060 // if (predicate(1))
1061 // do_intrinsic(1)
1062 // ...
1063 // else
1064 // do_java_comp
1065
1066 GraphKit kit(jvms);
1067 PhaseGVN& gvn = kit.gvn();
1068
1069 CompileLog* log = kit.C->log();
1070 if (log != NULL) {
1071 log->elem("predicated_intrinsic bci='%d' method='%d'",
1072 jvms->bci(), log->identify(method()));
1073 }
1074
1075 if (!method()->is_static()) {
1076 // We need an explicit receiver null_check before checking its type in predicate.
1077 // We share a map with the caller, so his JVMS gets adjusted.
1078 Node* receiver = kit.null_check_receiver_before_call(method());
1079 if (kit.stopped()) {
1080 return kit.transfer_exceptions_into_jvms();
1081 }
1082 }
1083
1084 int n_predicates = _intrinsic->predicates_count();
1085 assert(n_predicates > 0, "sanity");
1086
1087 JVMState** result_jvms = NEW_RESOURCE_ARRAY(JVMState*, (n_predicates+1));
1088
1089 // Region for normal compilation code if intrinsic failed.
1090 Node* slow_region = new RegionNode(1);
1091
1092 int results = 0;
1093 for (int predicate = 0; (predicate < n_predicates) && !kit.stopped(); predicate++) {
1094 #ifdef ASSERT
1095 JVMState* old_jvms = kit.jvms();
1096 SafePointNode* old_map = kit.map();
1097 Node* old_io = old_map->i_o();
1098 Node* old_mem = old_map->memory();
1099 Node* old_exc = old_map->next_exception();
1100 #endif
1101 Node* else_ctrl = _intrinsic->generate_predicate(kit.sync_jvms(), predicate);
1102 #ifdef ASSERT
1103 // Assert(no_new_memory && no_new_io && no_new_exceptions) after generate_predicate.
1104 assert(old_jvms == kit.jvms(), "generate_predicate should not change jvm state");
1105 SafePointNode* new_map = kit.map();
1106 assert(old_io == new_map->i_o(), "generate_predicate should not change i_o");
1107 assert(old_mem == new_map->memory(), "generate_predicate should not change memory");
1108 assert(old_exc == new_map->next_exception(), "generate_predicate should not add exceptions");
1109 #endif
1110 if (!kit.stopped()) {
1111 PreserveJVMState pjvms(&kit);
1112 // Generate intrinsic code:
1113 JVMState* new_jvms = _intrinsic->generate(kit.sync_jvms());
1114 if (new_jvms == NULL) {
1115 // Intrinsic failed, use normal compilation path for this predicate.
1116 slow_region->add_req(kit.control());
1117 } else {
1118 kit.add_exception_states_from(new_jvms);
1119 kit.set_jvms(new_jvms);
1120 if (!kit.stopped()) {
1121 result_jvms[results++] = kit.jvms();
1122 }
1123 }
1124 }
1125 if (else_ctrl == NULL) {
1126 else_ctrl = kit.C->top();
1127 }
1128 kit.set_control(else_ctrl);
1129 }
1130 if (!kit.stopped()) {
1131 // Final 'else' after predicates.
1132 slow_region->add_req(kit.control());
1133 }
1134 if (slow_region->req() > 1) {
1135 PreserveJVMState pjvms(&kit);
1136 // Generate normal compilation code:
1137 kit.set_control(gvn.transform(slow_region));
1138 JVMState* new_jvms = _cg->generate(kit.sync_jvms());
1139 if (kit.failing())
1140 return NULL; // might happen because of NodeCountInliningCutoff
1141 assert(new_jvms != NULL, "must be");
1142 kit.add_exception_states_from(new_jvms);
1143 kit.set_jvms(new_jvms);
1144 if (!kit.stopped()) {
1145 result_jvms[results++] = kit.jvms();
1146 }
1147 }
1148
1149 if (results == 0) {
1150 // All paths ended in uncommon traps.
1151 (void) kit.stop();
1152 return kit.transfer_exceptions_into_jvms();
1153 }
1154
1155 if (results == 1) { // Only one path
1156 kit.set_jvms(result_jvms[0]);
1157 return kit.transfer_exceptions_into_jvms();
1158 }
1159
1160 // Merge all paths.
1161 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
1162 RegionNode* region = new RegionNode(results + 1);
1163 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
1164 for (int i = 0; i < results; i++) {
1165 JVMState* jvms = result_jvms[i];
1166 int path = i + 1;
1167 SafePointNode* map = jvms->map();
1168 region->init_req(path, map->control());
1169 iophi->set_req(path, map->i_o());
1170 if (i == 0) {
1171 kit.set_jvms(jvms);
1172 } else {
1173 kit.merge_memory(map->merged_memory(), region, path);
1174 }
1175 }
1176 kit.set_control(gvn.transform(region));
1177 kit.set_i_o(gvn.transform(iophi));
1178 // Transform new memory Phis.
1179 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
1180 Node* phi = mms.memory();
1181 if (phi->is_Phi() && phi->in(0) == region) {
1182 mms.set_memory(gvn.transform(phi));
1183 }
1184 }
1185
1186 // Merge debug info.
1187 Node** ins = NEW_RESOURCE_ARRAY(Node*, results);
1188 uint tos = kit.jvms()->stkoff() + kit.sp();
1189 Node* map = kit.map();
1190 uint limit = map->req();
1191 for (uint i = TypeFunc::Parms; i < limit; i++) {
1192 // Skip unused stack slots; fast forward to monoff();
1193 if (i == tos) {
1194 i = kit.jvms()->monoff();
1195 if( i >= limit ) break;
1196 }
1197 Node* n = map->in(i);
1198 ins[0] = n;
1199 const Type* t = gvn.type(n);
1200 bool needs_phi = false;
1201 for (int j = 1; j < results; j++) {
1202 JVMState* jvms = result_jvms[j];
1203 Node* jmap = jvms->map();
1204 Node* m = NULL;
1205 if (jmap->req() > i) {
1206 m = jmap->in(i);
1207 if (m != n) {
1208 needs_phi = true;
1209 t = t->meet_speculative(gvn.type(m));
1210 }
1211 }
1212 ins[j] = m;
1213 }
1214 if (needs_phi) {
1215 Node* phi = PhiNode::make(region, n, t);
1216 for (int j = 1; j < results; j++) {
1217 phi->set_req(j + 1, ins[j]);
1218 }
1219 map->set_req(i, gvn.transform(phi));
1220 }
1221 }
1222
1223 return kit.transfer_exceptions_into_jvms();
1224 }
1225
1226 //-------------------------UncommonTrapCallGenerator-----------------------------
1227 // Internal class which handles all out-of-line calls checking receiver type.
1228 class UncommonTrapCallGenerator : public CallGenerator {
1229 Deoptimization::DeoptReason _reason;
1230 Deoptimization::DeoptAction _action;
1231
1232 public:
1233 UncommonTrapCallGenerator(ciMethod* m,
1234 Deoptimization::DeoptReason reason,
1235 Deoptimization::DeoptAction action)
1236 : CallGenerator(m)
1237 {
1238 _reason = reason;
1239 _action = action;
1240 }
1241
1242 virtual bool is_virtual() const { ShouldNotReachHere(); return false; }
1243 virtual bool is_trap() const { return true; }
1244
1245 virtual JVMState* generate(JVMState* jvms);
1246 };
1247
1248
1249 CallGenerator*
1250 CallGenerator::for_uncommon_trap(ciMethod* m,
1251 Deoptimization::DeoptReason reason,
1252 Deoptimization::DeoptAction action) {
1253 return new UncommonTrapCallGenerator(m, reason, action);
1254 }
1255
1256
1257 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) {
1258 GraphKit kit(jvms);
1259 kit.C->print_inlining_update(this);
1260 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver).
1261 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
1262 // Use callsite signature always.
1263 ciMethod* declared_method = kit.method()->get_method_at_bci(kit.bci());
1264 int nargs = declared_method->arg_size();
1265 kit.inc_sp(nargs);
1266 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed");
1267 if (_reason == Deoptimization::Reason_class_check &&
1268 _action == Deoptimization::Action_maybe_recompile) {
1269 // Temp fix for 6529811
1270 // Don't allow uncommon_trap to override our decision to recompile in the event
1271 // of a class cast failure for a monomorphic call as it will never let us convert
1272 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops
1273 bool keep_exact_action = true;
1274 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action);
1275 } else {
1276 kit.uncommon_trap(_reason, _action);
1277 }
1278 return kit.transfer_exceptions_into_jvms();
1279 }
1280
1281 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.)
1282
1283 // (Node: Merged hook_up_exits into ParseGenerator::generate.)
1284
1285 #define NODES_OVERHEAD_PER_METHOD (30.0)
1286 #define NODES_PER_BYTECODE (9.5)
1287
1288 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) {
1289 int call_count = profile.count();
1290 int code_size = call_method->code_size();
1291
1292 // Expected execution count is based on the historical count:
1293 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor);
1294
1295 // Expected profit from inlining, in units of simple call-overheads.
1296 _profit = 1.0;
1297
1298 // Expected work performed by the call in units of call-overheads.
1299 // %%% need an empirical curve fit for "work" (time in call)
1300 float bytecodes_per_call = 3;
1301 _work = 1.0 + code_size / bytecodes_per_call;
1302
1303 // Expected size of compilation graph:
1304 // -XX:+PrintParseStatistics once reported:
1305 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391
1306 // Histogram of 144298 parsed bytecodes:
1307 // %%% Need an better predictor for graph size.
1308 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size);
1309 }
1310
1311 // is_cold: Return true if the node should never be inlined.
1312 // This is true if any of the key metrics are extreme.
1313 bool WarmCallInfo::is_cold() const {
1314 if (count() < WarmCallMinCount) return true;
1315 if (profit() < WarmCallMinProfit) return true;
1316 if (work() > WarmCallMaxWork) return true;
1317 if (size() > WarmCallMaxSize) return true;
1318 return false;
1319 }
1320
1321 // is_hot: Return true if the node should be inlined immediately.
1322 // This is true if any of the key metrics are extreme.
1323 bool WarmCallInfo::is_hot() const {
1324 assert(!is_cold(), "eliminate is_cold cases before testing is_hot");
1325 if (count() >= HotCallCountThreshold) return true;
1326 if (profit() >= HotCallProfitThreshold) return true;
1327 if (work() <= HotCallTrivialWork) return true;
1328 if (size() <= HotCallTrivialSize) return true;
1329 return false;
1330 }
1331
1332 // compute_heat:
1333 float WarmCallInfo::compute_heat() const {
1334 assert(!is_cold(), "compute heat only on warm nodes");
1335 assert(!is_hot(), "compute heat only on warm nodes");
1336 int min_size = MAX2(0, (int)HotCallTrivialSize);
1337 int max_size = MIN2(500, (int)WarmCallMaxSize);
1338 float method_size = (size() - min_size) / MAX2(1, max_size - min_size);
1339 float size_factor;
1340 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg.
1341 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg.
1342 else if (method_size < 0.5) size_factor = 1; // better than avg.
1343 else size_factor = 0.5; // worse than avg.
1344 return (count() * profit() * size_factor);
1345 }
1346
1347 bool WarmCallInfo::warmer_than(WarmCallInfo* that) {
1348 assert(this != that, "compare only different WCIs");
1349 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st");
1350 if (this->heat() > that->heat()) return true;
1351 if (this->heat() < that->heat()) return false;
1352 assert(this->heat() == that->heat(), "no NaN heat allowed");
1353 // Equal heat. Break the tie some other way.
1354 if (!this->call() || !that->call()) return (address)this > (address)that;
1355 return this->call()->_idx > that->call()->_idx;
1356 }
1357
1358 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress)
1359 #define UNINIT_NEXT ((WarmCallInfo*)NULL)
1360
1361 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) {
1362 assert(next() == UNINIT_NEXT, "not yet on any list");
1363 WarmCallInfo* prev_p = NULL;
1364 WarmCallInfo* next_p = head;
1365 while (next_p != NULL && next_p->warmer_than(this)) {
1366 prev_p = next_p;
1367 next_p = prev_p->next();
1368 }
1369 // Install this between prev_p and next_p.
1370 this->set_next(next_p);
1371 if (prev_p == NULL)
1372 head = this;
1373 else
1374 prev_p->set_next(this);
1375 return head;
1376 }
1377
1378 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) {
1379 WarmCallInfo* prev_p = NULL;
1380 WarmCallInfo* next_p = head;
1381 while (next_p != this) {
1382 assert(next_p != NULL, "this must be in the list somewhere");
1383 prev_p = next_p;
1384 next_p = prev_p->next();
1385 }
1386 next_p = this->next();
1387 debug_only(this->set_next(UNINIT_NEXT));
1388 // Remove this from between prev_p and next_p.
1389 if (prev_p == NULL)
1390 head = next_p;
1391 else
1392 prev_p->set_next(next_p);
1393 return head;
1394 }
1395
1396 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(),
1397 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE());
1398 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(),
1399 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE());
1400
1401 WarmCallInfo* WarmCallInfo::always_hot() {
1402 assert(_always_hot.is_hot(), "must always be hot");
1403 return &_always_hot;
1404 }
1405
1406 WarmCallInfo* WarmCallInfo::always_cold() {
1407 assert(_always_cold.is_cold(), "must always be cold");
1408 return &_always_cold;
1409 }
1410
1411
1412 #ifndef PRODUCT
1413
1414 void WarmCallInfo::print() const {
1415 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p",
1416 is_cold() ? "cold" : is_hot() ? "hot " : "warm",
1417 count(), profit(), work(), size(), compute_heat(), next());
1418 tty->cr();
1419 if (call() != NULL) call()->dump();
1420 }
1421
1422 void print_wci(WarmCallInfo* ci) {
1423 ci->print();
1424 }
1425
1426 void WarmCallInfo::print_all() const {
1427 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1428 p->print();
1429 }
1430
1431 int WarmCallInfo::count_all() const {
1432 int cnt = 0;
1433 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1434 cnt++;
1435 return cnt;
1436 }
1437
1438 #endif //PRODUCT