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 ValueTypeNode* vt = result->as_ValueType();
500 if (!call->tf()->returns_value_type_as_fields()) {
501 result = vt->allocate(&kit);
502 result = C->initial_gvn()->transform(new ValueTypePtrNode(vt, result, C));
503 } else {
504 // Return of multiple values (the fields of a value type)
505 vt->replace_call_results(call, C);
506 }
507 } else {
508 assert(result->is_top(), "what else?");
509 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) {
510 ProjNode *pn = call->fast_out(i)->as_Proj();
511 uint con = pn->_con;
512 if (con >= TypeFunc::Parms) {
513 // C->gvn_replace_by(pn, C->top());
514 C->initial_gvn()->hash_delete(pn);
515 pn->set_req(0, C->top());
516 --i; --imax;
517 }
518 }
519 }
520 }
521
522 kit.replace_call(call, result, true);
523 }
524
525
526 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) {
527 return new LateInlineCallGenerator(method, inline_cg);
528 }
529
530 class LateInlineMHCallGenerator : public LateInlineCallGenerator {
531 ciMethod* _caller;
532 int _attempt;
533 bool _input_not_const;
534
535 virtual bool do_late_inline_check(JVMState* jvms);
536 virtual bool already_attempted() const { return _attempt > 0; }
537
538 public:
539 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) :
540 LateInlineCallGenerator(callee, NULL), _caller(caller), _attempt(0), _input_not_const(input_not_const) {}
541
542 virtual bool is_mh_late_inline() const { return true; }
543
544 virtual JVMState* generate(JVMState* jvms) {
545 JVMState* new_jvms = LateInlineCallGenerator::generate(jvms);
546
547 Compile* C = Compile::current();
548 if (_input_not_const) {
549 // inlining won't be possible so no need to enqueue right now.
550 call_node()->set_generator(this);
551 } else {
552 C->add_late_inline(this);
553 }
554 return new_jvms;
555 }
556 };
557
558 bool LateInlineMHCallGenerator::do_late_inline_check(JVMState* jvms) {
559
560 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), _input_not_const, AlwaysIncrementalInline);
561
562 Compile::current()->print_inlining_update_delayed(this);
563
564 if (!_input_not_const) {
565 _attempt++;
566 }
567
568 if (cg != NULL && (cg->is_inline() || cg->is_inlined_method_handle_intrinsic(jvms, cg->method()))) {
569 assert(!cg->is_late_inline(), "we're doing late inlining");
570 _inline_cg = cg;
571 Compile::current()->dec_number_of_mh_late_inlines();
572 return true;
573 }
574
575 call_node()->set_generator(this);
576 return false;
577 }
578
579 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) {
580 Compile::current()->inc_number_of_mh_late_inlines();
581 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const);
582 return cg;
583 }
584
585 class LateInlineStringCallGenerator : public LateInlineCallGenerator {
586
587 public:
588 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
589 LateInlineCallGenerator(method, inline_cg) {}
590
591 virtual JVMState* generate(JVMState* jvms) {
592 Compile *C = Compile::current();
593
594 C->log_inline_id(this);
595
596 C->add_string_late_inline(this);
597
598 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
599 return new_jvms;
600 }
601
602 virtual bool is_string_late_inline() const { return true; }
603 };
604
605 CallGenerator* CallGenerator::for_string_late_inline(ciMethod* method, CallGenerator* inline_cg) {
606 return new LateInlineStringCallGenerator(method, inline_cg);
607 }
608
609 class LateInlineBoxingCallGenerator : public LateInlineCallGenerator {
610
611 public:
612 LateInlineBoxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) :
613 LateInlineCallGenerator(method, inline_cg) {}
614
615 virtual JVMState* generate(JVMState* jvms) {
616 Compile *C = Compile::current();
617
618 C->log_inline_id(this);
619
620 C->add_boxing_late_inline(this);
621
622 JVMState* new_jvms = DirectCallGenerator::generate(jvms);
623 return new_jvms;
624 }
625 };
626
627 CallGenerator* CallGenerator::for_boxing_late_inline(ciMethod* method, CallGenerator* inline_cg) {
628 return new LateInlineBoxingCallGenerator(method, inline_cg);
629 }
630
631 //---------------------------WarmCallGenerator--------------------------------
632 // Internal class which handles initial deferral of inlining decisions.
633 class WarmCallGenerator : public CallGenerator {
634 WarmCallInfo* _call_info;
635 CallGenerator* _if_cold;
636 CallGenerator* _if_hot;
637 bool _is_virtual; // caches virtuality of if_cold
638 bool _is_inline; // caches inline-ness of if_hot
639
640 public:
641 WarmCallGenerator(WarmCallInfo* ci,
642 CallGenerator* if_cold,
643 CallGenerator* if_hot)
644 : CallGenerator(if_cold->method())
645 {
646 assert(method() == if_hot->method(), "consistent choices");
647 _call_info = ci;
648 _if_cold = if_cold;
649 _if_hot = if_hot;
650 _is_virtual = if_cold->is_virtual();
651 _is_inline = if_hot->is_inline();
652 }
653
654 virtual bool is_inline() const { return _is_inline; }
655 virtual bool is_virtual() const { return _is_virtual; }
656 virtual bool is_deferred() const { return true; }
657
658 virtual JVMState* generate(JVMState* jvms);
659 };
660
661
662 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci,
663 CallGenerator* if_cold,
664 CallGenerator* if_hot) {
665 return new WarmCallGenerator(ci, if_cold, if_hot);
666 }
667
668 JVMState* WarmCallGenerator::generate(JVMState* jvms) {
669 Compile* C = Compile::current();
670 C->print_inlining_update(this);
671
672 if (C->log() != NULL) {
673 C->log()->elem("warm_call bci='%d'", jvms->bci());
674 }
675 jvms = _if_cold->generate(jvms);
676 if (jvms != NULL) {
677 Node* m = jvms->map()->control();
678 if (m->is_CatchProj()) m = m->in(0); else m = C->top();
679 if (m->is_Catch()) m = m->in(0); else m = C->top();
680 if (m->is_Proj()) m = m->in(0); else m = C->top();
681 if (m->is_CallJava()) {
682 _call_info->set_call(m->as_Call());
683 _call_info->set_hot_cg(_if_hot);
684 #ifndef PRODUCT
685 if (PrintOpto || PrintOptoInlining) {
686 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci());
687 tty->print("WCI: ");
688 _call_info->print();
689 }
690 #endif
691 _call_info->set_heat(_call_info->compute_heat());
692 C->set_warm_calls(_call_info->insert_into(C->warm_calls()));
693 }
694 }
695 return jvms;
696 }
697
698 void WarmCallInfo::make_hot() {
699 Unimplemented();
700 }
701
702 void WarmCallInfo::make_cold() {
703 // No action: Just dequeue.
704 }
705
706
707 //------------------------PredictedCallGenerator------------------------------
708 // Internal class which handles all out-of-line calls checking receiver type.
709 class PredictedCallGenerator : public CallGenerator {
710 ciKlass* _predicted_receiver;
711 CallGenerator* _if_missed;
712 CallGenerator* _if_hit;
713 float _hit_prob;
714
715 public:
716 PredictedCallGenerator(ciKlass* predicted_receiver,
717 CallGenerator* if_missed,
718 CallGenerator* if_hit, float hit_prob)
719 : CallGenerator(if_missed->method())
720 {
721 // The call profile data may predict the hit_prob as extreme as 0 or 1.
722 // Remove the extremes values from the range.
723 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX;
724 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
725
726 _predicted_receiver = predicted_receiver;
727 _if_missed = if_missed;
728 _if_hit = if_hit;
729 _hit_prob = hit_prob;
730 }
731
732 virtual bool is_virtual() const { return true; }
733 virtual bool is_inline() const { return _if_hit->is_inline(); }
734 virtual bool is_deferred() const { return _if_hit->is_deferred(); }
735
736 virtual JVMState* generate(JVMState* jvms);
737 };
738
739
740 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver,
741 CallGenerator* if_missed,
742 CallGenerator* if_hit,
743 float hit_prob) {
744 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob);
745 }
746
747
748 JVMState* PredictedCallGenerator::generate(JVMState* jvms) {
749 GraphKit kit(jvms);
750 kit.C->print_inlining_update(this);
751 PhaseGVN& gvn = kit.gvn();
752 // We need an explicit receiver null_check before checking its type.
753 // We share a map with the caller, so his JVMS gets adjusted.
754 Node* receiver = kit.argument(0);
755 CompileLog* log = kit.C->log();
756 if (log != NULL) {
757 log->elem("predicted_call bci='%d' klass='%d'",
758 jvms->bci(), log->identify(_predicted_receiver));
759 }
760
761 receiver = kit.null_check_receiver_before_call(method());
762 if (kit.stopped()) {
763 return kit.transfer_exceptions_into_jvms();
764 }
765
766 // Make a copy of the replaced nodes in case we need to restore them
767 ReplacedNodes replaced_nodes = kit.map()->replaced_nodes();
768 replaced_nodes.clone();
769
770 Node* exact_receiver = receiver; // will get updated in place...
771 Node* slow_ctl = kit.type_check_receiver(receiver,
772 _predicted_receiver, _hit_prob,
773 &exact_receiver);
774
775 SafePointNode* slow_map = NULL;
776 JVMState* slow_jvms = NULL;
777 { PreserveJVMState pjvms(&kit);
778 kit.set_control(slow_ctl);
779 if (!kit.stopped()) {
780 slow_jvms = _if_missed->generate(kit.sync_jvms());
781 if (kit.failing())
782 return NULL; // might happen because of NodeCountInliningCutoff
783 assert(slow_jvms != NULL, "must be");
784 kit.add_exception_states_from(slow_jvms);
785 kit.set_map(slow_jvms->map());
786 if (!kit.stopped())
787 slow_map = kit.stop();
788 }
789 }
790
791 if (kit.stopped()) {
792 // Instance exactly does not matches the desired type.
793 kit.set_jvms(slow_jvms);
794 return kit.transfer_exceptions_into_jvms();
795 }
796
797 // fall through if the instance exactly matches the desired type
798 kit.replace_in_map(receiver, exact_receiver);
799
800 // Make the hot call:
801 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms());
802 if (new_jvms == NULL) {
803 // Inline failed, so make a direct call.
804 assert(_if_hit->is_inline(), "must have been a failed inline");
805 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method());
806 new_jvms = cg->generate(kit.sync_jvms());
807 }
808 kit.add_exception_states_from(new_jvms);
809 kit.set_jvms(new_jvms);
810
811 // Need to merge slow and fast?
812 if (slow_map == NULL) {
813 // The fast path is the only path remaining.
814 return kit.transfer_exceptions_into_jvms();
815 }
816
817 if (kit.stopped()) {
818 // Inlined method threw an exception, so it's just the slow path after all.
819 kit.set_jvms(slow_jvms);
820 return kit.transfer_exceptions_into_jvms();
821 }
822
823 // There are 2 branches and the replaced nodes are only valid on
824 // one: restore the replaced nodes to what they were before the
825 // branch.
826 kit.map()->set_replaced_nodes(replaced_nodes);
827
828 // Finish the diamond.
829 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
830 RegionNode* region = new RegionNode(3);
831 region->init_req(1, kit.control());
832 region->init_req(2, slow_map->control());
833 kit.set_control(gvn.transform(region));
834 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
835 iophi->set_req(2, slow_map->i_o());
836 kit.set_i_o(gvn.transform(iophi));
837 // Merge memory
838 kit.merge_memory(slow_map->merged_memory(), region, 2);
839 // Transform new memory Phis.
840 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
841 Node* phi = mms.memory();
842 if (phi->is_Phi() && phi->in(0) == region) {
843 mms.set_memory(gvn.transform(phi));
844 }
845 }
846 uint tos = kit.jvms()->stkoff() + kit.sp();
847 uint limit = slow_map->req();
848 for (uint i = TypeFunc::Parms; i < limit; i++) {
849 // Skip unused stack slots; fast forward to monoff();
850 if (i == tos) {
851 i = kit.jvms()->monoff();
852 if( i >= limit ) break;
853 }
854 Node* m = kit.map()->in(i);
855 Node* n = slow_map->in(i);
856 if (m != n) {
857 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n));
858 Node* phi = PhiNode::make(region, m, t);
859 phi->set_req(2, n);
860 kit.map()->set_req(i, gvn.transform(phi));
861 }
862 }
863 return kit.transfer_exceptions_into_jvms();
864 }
865
866
867 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool delayed_forbidden) {
868 assert(callee->is_method_handle_intrinsic(), "for_method_handle_call mismatch");
869 bool input_not_const;
870 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, input_not_const, false);
871 Compile* C = Compile::current();
872 if (cg != NULL) {
873 if (!delayed_forbidden && AlwaysIncrementalInline) {
874 return CallGenerator::for_late_inline(callee, cg);
875 } else {
876 return cg;
877 }
878 }
879 int bci = jvms->bci();
880 ciCallProfile profile = caller->call_profile_at_bci(bci);
881 int call_site_count = caller->scale_count(profile.count());
882
883 if (IncrementalInline && (AlwaysIncrementalInline ||
884 (call_site_count > 0 && (input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())))) {
885 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const);
886 } else {
887 // Out-of-line call.
888 return CallGenerator::for_direct_call(callee);
889 }
890 }
891
892 static void cast_argument(int arg_nb, ciType* t, GraphKit& kit) {
893 PhaseGVN& gvn = kit.gvn();
894 Node* arg = kit.argument(arg_nb);
895 const Type* arg_type = arg->bottom_type();
896 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass());
897 if (t->is_valuetype()) {
898 assert(!(arg_type->isa_valuetype() && t == kit.C->env()->___Value_klass()), "need a pointer to the value type");
899 if (arg_type->isa_valuetypeptr() && t != kit.C->env()->___Value_klass()) {
900 Node* cast = gvn.transform(new CheckCastPPNode(kit.control(), arg, sig_type));
901 Node* vt = ValueTypeNode::make(gvn, kit.merged_memory(), cast);
902 kit.set_argument(arg_nb, vt);
903 } else {
904 assert(t == kit.C->env()->___Value_klass() || arg->is_ValueType(), "inconsistent argument");
905 }
906 } else {
907 if (arg_type->isa_oopptr() && !arg_type->higher_equal(sig_type)) {
908 Node* cast_obj = gvn.transform(new CheckCastPPNode(kit.control(), arg, sig_type));
909 kit.set_argument(arg_nb, cast_obj);
910 }
911 }
912 }
913
914 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool& input_not_const, bool delayed_forbidden) {
915 GraphKit kit(jvms);
916 PhaseGVN& gvn = kit.gvn();
917 Compile* C = kit.C;
918 vmIntrinsics::ID iid = callee->intrinsic_id();
919 input_not_const = true;
920 switch (iid) {
921 case vmIntrinsics::_invokeBasic:
922 {
923 // Get MethodHandle receiver:
924 Node* receiver = kit.argument(0);
925 if (receiver->Opcode() == Op_ConP) {
926 input_not_const = false;
927 const TypeOopPtr* oop_ptr = receiver->bottom_type()->is_oopptr();
928 ciMethod* target = oop_ptr->const_oop()->as_method_handle()->get_vmtarget();
929 const int vtable_index = Method::invalid_vtable_index;
930
931 if (!ciMethod::is_consistent_info(callee, target)) {
932 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
933 "signatures mismatch");
934 return NULL;
935 }
936
937 CallGenerator* cg = C->call_generator(target, vtable_index,
938 false /* call_does_dispatch */,
939 jvms,
940 true /* allow_inline */,
941 PROB_ALWAYS,
942 NULL,
943 true,
944 delayed_forbidden);
945 return cg;
946 } else {
947 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
948 "receiver not constant");
949 }
950 }
951 break;
952
953 case vmIntrinsics::_linkToVirtual:
954 case vmIntrinsics::_linkToStatic:
955 case vmIntrinsics::_linkToSpecial:
956 case vmIntrinsics::_linkToInterface:
957 {
958 // Get MemberName argument:
959 Node* member_name = kit.argument(callee->arg_size() - 1);
960 if (member_name->Opcode() == Op_ConP) {
961 input_not_const = false;
962 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr();
963 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget();
964
965 if (!ciMethod::is_consistent_info(callee, target)) {
966 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
967 "signatures mismatch");
968 return NULL;
969 }
970
971 // In lambda forms we erase signature types to avoid resolving issues
972 // involving class loaders. When we optimize a method handle invoke
973 // to a direct call we must cast the receiver and arguments to its
974 // actual types.
975 ciSignature* signature = target->signature();
976 const int receiver_skip = target->is_static() ? 0 : 1;
977 // Cast receiver to its type.
978 if (!target->is_static()) {
979 cast_argument(0, signature->accessing_klass(), kit);
980 }
981 // Cast reference arguments to its type.
982 for (int i = 0, j = 0; i < signature->count(); i++) {
983 ciType* t = signature->type_at(i);
984 if (t->is_klass()) {
985 cast_argument(receiver_skip + j, t, kit);
986 }
987 j += t->size(); // long and double take two slots
988 }
989
990 // Try to get the most accurate receiver type
991 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual);
992 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface);
993 int vtable_index = Method::invalid_vtable_index;
994 bool call_does_dispatch = false;
995
996 ciKlass* speculative_receiver_type = NULL;
997 if (is_virtual_or_interface) {
998 ciInstanceKlass* klass = target->holder();
999 Node* receiver_node = kit.argument(0);
1000 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr();
1001 // call_does_dispatch and vtable_index are out-parameters. They might be changed.
1002 // optimize_virtual_call() takes 2 different holder
1003 // arguments for a corner case that doesn't apply here (see
1004 // Parse::do_call())
1005 target = C->optimize_virtual_call(caller, jvms->bci(), klass, klass,
1006 target, receiver_type, is_virtual,
1007 call_does_dispatch, vtable_index, // out-parameters
1008 false /* check_access */);
1009 // We lack profiling at this call but type speculation may
1010 // provide us with a type
1011 speculative_receiver_type = (receiver_type != NULL) ? receiver_type->speculative_type() : NULL;
1012 }
1013 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms,
1014 true /* allow_inline */,
1015 PROB_ALWAYS,
1016 speculative_receiver_type,
1017 true,
1018 delayed_forbidden);
1019 return cg;
1020 } else {
1021 print_inlining_failure(C, callee, jvms->depth() - 1, jvms->bci(),
1022 "member_name not constant");
1023 }
1024 }
1025 break;
1026
1027 default:
1028 fatal("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid));
1029 break;
1030 }
1031 return NULL;
1032 }
1033
1034
1035 //------------------------PredicatedIntrinsicGenerator------------------------------
1036 // Internal class which handles all predicated Intrinsic calls.
1037 class PredicatedIntrinsicGenerator : public CallGenerator {
1038 CallGenerator* _intrinsic;
1039 CallGenerator* _cg;
1040
1041 public:
1042 PredicatedIntrinsicGenerator(CallGenerator* intrinsic,
1043 CallGenerator* cg)
1044 : CallGenerator(cg->method())
1045 {
1046 _intrinsic = intrinsic;
1047 _cg = cg;
1048 }
1049
1050 virtual bool is_virtual() const { return true; }
1051 virtual bool is_inlined() const { return true; }
1052 virtual bool is_intrinsic() const { return true; }
1053
1054 virtual JVMState* generate(JVMState* jvms);
1055 };
1056
1057
1058 CallGenerator* CallGenerator::for_predicated_intrinsic(CallGenerator* intrinsic,
1059 CallGenerator* cg) {
1060 return new PredicatedIntrinsicGenerator(intrinsic, cg);
1061 }
1062
1063
1064 JVMState* PredicatedIntrinsicGenerator::generate(JVMState* jvms) {
1065 // The code we want to generate here is:
1066 // if (receiver == NULL)
1067 // uncommon_Trap
1068 // if (predicate(0))
1069 // do_intrinsic(0)
1070 // else
1071 // if (predicate(1))
1072 // do_intrinsic(1)
1073 // ...
1074 // else
1075 // do_java_comp
1076
1077 GraphKit kit(jvms);
1078 PhaseGVN& gvn = kit.gvn();
1079
1080 CompileLog* log = kit.C->log();
1081 if (log != NULL) {
1082 log->elem("predicated_intrinsic bci='%d' method='%d'",
1083 jvms->bci(), log->identify(method()));
1084 }
1085
1086 if (!method()->is_static()) {
1087 // We need an explicit receiver null_check before checking its type in predicate.
1088 // We share a map with the caller, so his JVMS gets adjusted.
1089 Node* receiver = kit.null_check_receiver_before_call(method());
1090 if (kit.stopped()) {
1091 return kit.transfer_exceptions_into_jvms();
1092 }
1093 }
1094
1095 int n_predicates = _intrinsic->predicates_count();
1096 assert(n_predicates > 0, "sanity");
1097
1098 JVMState** result_jvms = NEW_RESOURCE_ARRAY(JVMState*, (n_predicates+1));
1099
1100 // Region for normal compilation code if intrinsic failed.
1101 Node* slow_region = new RegionNode(1);
1102
1103 int results = 0;
1104 for (int predicate = 0; (predicate < n_predicates) && !kit.stopped(); predicate++) {
1105 #ifdef ASSERT
1106 JVMState* old_jvms = kit.jvms();
1107 SafePointNode* old_map = kit.map();
1108 Node* old_io = old_map->i_o();
1109 Node* old_mem = old_map->memory();
1110 Node* old_exc = old_map->next_exception();
1111 #endif
1112 Node* else_ctrl = _intrinsic->generate_predicate(kit.sync_jvms(), predicate);
1113 #ifdef ASSERT
1114 // Assert(no_new_memory && no_new_io && no_new_exceptions) after generate_predicate.
1115 assert(old_jvms == kit.jvms(), "generate_predicate should not change jvm state");
1116 SafePointNode* new_map = kit.map();
1117 assert(old_io == new_map->i_o(), "generate_predicate should not change i_o");
1118 assert(old_mem == new_map->memory(), "generate_predicate should not change memory");
1119 assert(old_exc == new_map->next_exception(), "generate_predicate should not add exceptions");
1120 #endif
1121 if (!kit.stopped()) {
1122 PreserveJVMState pjvms(&kit);
1123 // Generate intrinsic code:
1124 JVMState* new_jvms = _intrinsic->generate(kit.sync_jvms());
1125 if (new_jvms == NULL) {
1126 // Intrinsic failed, use normal compilation path for this predicate.
1127 slow_region->add_req(kit.control());
1128 } else {
1129 kit.add_exception_states_from(new_jvms);
1130 kit.set_jvms(new_jvms);
1131 if (!kit.stopped()) {
1132 result_jvms[results++] = kit.jvms();
1133 }
1134 }
1135 }
1136 if (else_ctrl == NULL) {
1137 else_ctrl = kit.C->top();
1138 }
1139 kit.set_control(else_ctrl);
1140 }
1141 if (!kit.stopped()) {
1142 // Final 'else' after predicates.
1143 slow_region->add_req(kit.control());
1144 }
1145 if (slow_region->req() > 1) {
1146 PreserveJVMState pjvms(&kit);
1147 // Generate normal compilation code:
1148 kit.set_control(gvn.transform(slow_region));
1149 JVMState* new_jvms = _cg->generate(kit.sync_jvms());
1150 if (kit.failing())
1151 return NULL; // might happen because of NodeCountInliningCutoff
1152 assert(new_jvms != NULL, "must be");
1153 kit.add_exception_states_from(new_jvms);
1154 kit.set_jvms(new_jvms);
1155 if (!kit.stopped()) {
1156 result_jvms[results++] = kit.jvms();
1157 }
1158 }
1159
1160 if (results == 0) {
1161 // All paths ended in uncommon traps.
1162 (void) kit.stop();
1163 return kit.transfer_exceptions_into_jvms();
1164 }
1165
1166 if (results == 1) { // Only one path
1167 kit.set_jvms(result_jvms[0]);
1168 return kit.transfer_exceptions_into_jvms();
1169 }
1170
1171 // Merge all paths.
1172 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization
1173 RegionNode* region = new RegionNode(results + 1);
1174 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO);
1175 for (int i = 0; i < results; i++) {
1176 JVMState* jvms = result_jvms[i];
1177 int path = i + 1;
1178 SafePointNode* map = jvms->map();
1179 region->init_req(path, map->control());
1180 iophi->set_req(path, map->i_o());
1181 if (i == 0) {
1182 kit.set_jvms(jvms);
1183 } else {
1184 kit.merge_memory(map->merged_memory(), region, path);
1185 }
1186 }
1187 kit.set_control(gvn.transform(region));
1188 kit.set_i_o(gvn.transform(iophi));
1189 // Transform new memory Phis.
1190 for (MergeMemStream mms(kit.merged_memory()); mms.next_non_empty();) {
1191 Node* phi = mms.memory();
1192 if (phi->is_Phi() && phi->in(0) == region) {
1193 mms.set_memory(gvn.transform(phi));
1194 }
1195 }
1196
1197 // Merge debug info.
1198 Node** ins = NEW_RESOURCE_ARRAY(Node*, results);
1199 uint tos = kit.jvms()->stkoff() + kit.sp();
1200 Node* map = kit.map();
1201 uint limit = map->req();
1202 for (uint i = TypeFunc::Parms; i < limit; i++) {
1203 // Skip unused stack slots; fast forward to monoff();
1204 if (i == tos) {
1205 i = kit.jvms()->monoff();
1206 if( i >= limit ) break;
1207 }
1208 Node* n = map->in(i);
1209 ins[0] = n;
1210 const Type* t = gvn.type(n);
1211 bool needs_phi = false;
1212 for (int j = 1; j < results; j++) {
1213 JVMState* jvms = result_jvms[j];
1214 Node* jmap = jvms->map();
1215 Node* m = NULL;
1216 if (jmap->req() > i) {
1217 m = jmap->in(i);
1218 if (m != n) {
1219 needs_phi = true;
1220 t = t->meet_speculative(gvn.type(m));
1221 }
1222 }
1223 ins[j] = m;
1224 }
1225 if (needs_phi) {
1226 Node* phi = PhiNode::make(region, n, t);
1227 for (int j = 1; j < results; j++) {
1228 phi->set_req(j + 1, ins[j]);
1229 }
1230 map->set_req(i, gvn.transform(phi));
1231 }
1232 }
1233
1234 return kit.transfer_exceptions_into_jvms();
1235 }
1236
1237 //-------------------------UncommonTrapCallGenerator-----------------------------
1238 // Internal class which handles all out-of-line calls checking receiver type.
1239 class UncommonTrapCallGenerator : public CallGenerator {
1240 Deoptimization::DeoptReason _reason;
1241 Deoptimization::DeoptAction _action;
1242
1243 public:
1244 UncommonTrapCallGenerator(ciMethod* m,
1245 Deoptimization::DeoptReason reason,
1246 Deoptimization::DeoptAction action)
1247 : CallGenerator(m)
1248 {
1249 _reason = reason;
1250 _action = action;
1251 }
1252
1253 virtual bool is_virtual() const { ShouldNotReachHere(); return false; }
1254 virtual bool is_trap() const { return true; }
1255
1256 virtual JVMState* generate(JVMState* jvms);
1257 };
1258
1259
1260 CallGenerator*
1261 CallGenerator::for_uncommon_trap(ciMethod* m,
1262 Deoptimization::DeoptReason reason,
1263 Deoptimization::DeoptAction action) {
1264 return new UncommonTrapCallGenerator(m, reason, action);
1265 }
1266
1267
1268 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) {
1269 GraphKit kit(jvms);
1270 kit.C->print_inlining_update(this);
1271 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver).
1272 // Callsite signature can be different from actual method being called (i.e _linkTo* sites).
1273 // Use callsite signature always.
1274 ciMethod* declared_method = kit.method()->get_method_at_bci(kit.bci());
1275 int nargs = declared_method->arg_size();
1276 kit.inc_sp(nargs);
1277 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed");
1278 if (_reason == Deoptimization::Reason_class_check &&
1279 _action == Deoptimization::Action_maybe_recompile) {
1280 // Temp fix for 6529811
1281 // Don't allow uncommon_trap to override our decision to recompile in the event
1282 // of a class cast failure for a monomorphic call as it will never let us convert
1283 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops
1284 bool keep_exact_action = true;
1285 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action);
1286 } else {
1287 kit.uncommon_trap(_reason, _action);
1288 }
1289 return kit.transfer_exceptions_into_jvms();
1290 }
1291
1292 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.)
1293
1294 // (Node: Merged hook_up_exits into ParseGenerator::generate.)
1295
1296 #define NODES_OVERHEAD_PER_METHOD (30.0)
1297 #define NODES_PER_BYTECODE (9.5)
1298
1299 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) {
1300 int call_count = profile.count();
1301 int code_size = call_method->code_size();
1302
1303 // Expected execution count is based on the historical count:
1304 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor);
1305
1306 // Expected profit from inlining, in units of simple call-overheads.
1307 _profit = 1.0;
1308
1309 // Expected work performed by the call in units of call-overheads.
1310 // %%% need an empirical curve fit for "work" (time in call)
1311 float bytecodes_per_call = 3;
1312 _work = 1.0 + code_size / bytecodes_per_call;
1313
1314 // Expected size of compilation graph:
1315 // -XX:+PrintParseStatistics once reported:
1316 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391
1317 // Histogram of 144298 parsed bytecodes:
1318 // %%% Need an better predictor for graph size.
1319 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size);
1320 }
1321
1322 // is_cold: Return true if the node should never be inlined.
1323 // This is true if any of the key metrics are extreme.
1324 bool WarmCallInfo::is_cold() const {
1325 if (count() < WarmCallMinCount) return true;
1326 if (profit() < WarmCallMinProfit) return true;
1327 if (work() > WarmCallMaxWork) return true;
1328 if (size() > WarmCallMaxSize) return true;
1329 return false;
1330 }
1331
1332 // is_hot: Return true if the node should be inlined immediately.
1333 // This is true if any of the key metrics are extreme.
1334 bool WarmCallInfo::is_hot() const {
1335 assert(!is_cold(), "eliminate is_cold cases before testing is_hot");
1336 if (count() >= HotCallCountThreshold) return true;
1337 if (profit() >= HotCallProfitThreshold) return true;
1338 if (work() <= HotCallTrivialWork) return true;
1339 if (size() <= HotCallTrivialSize) return true;
1340 return false;
1341 }
1342
1343 // compute_heat:
1344 float WarmCallInfo::compute_heat() const {
1345 assert(!is_cold(), "compute heat only on warm nodes");
1346 assert(!is_hot(), "compute heat only on warm nodes");
1347 int min_size = MAX2(0, (int)HotCallTrivialSize);
1348 int max_size = MIN2(500, (int)WarmCallMaxSize);
1349 float method_size = (size() - min_size) / MAX2(1, max_size - min_size);
1350 float size_factor;
1351 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg.
1352 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg.
1353 else if (method_size < 0.5) size_factor = 1; // better than avg.
1354 else size_factor = 0.5; // worse than avg.
1355 return (count() * profit() * size_factor);
1356 }
1357
1358 bool WarmCallInfo::warmer_than(WarmCallInfo* that) {
1359 assert(this != that, "compare only different WCIs");
1360 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st");
1361 if (this->heat() > that->heat()) return true;
1362 if (this->heat() < that->heat()) return false;
1363 assert(this->heat() == that->heat(), "no NaN heat allowed");
1364 // Equal heat. Break the tie some other way.
1365 if (!this->call() || !that->call()) return (address)this > (address)that;
1366 return this->call()->_idx > that->call()->_idx;
1367 }
1368
1369 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress)
1370 #define UNINIT_NEXT ((WarmCallInfo*)NULL)
1371
1372 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) {
1373 assert(next() == UNINIT_NEXT, "not yet on any list");
1374 WarmCallInfo* prev_p = NULL;
1375 WarmCallInfo* next_p = head;
1376 while (next_p != NULL && next_p->warmer_than(this)) {
1377 prev_p = next_p;
1378 next_p = prev_p->next();
1379 }
1380 // Install this between prev_p and next_p.
1381 this->set_next(next_p);
1382 if (prev_p == NULL)
1383 head = this;
1384 else
1385 prev_p->set_next(this);
1386 return head;
1387 }
1388
1389 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) {
1390 WarmCallInfo* prev_p = NULL;
1391 WarmCallInfo* next_p = head;
1392 while (next_p != this) {
1393 assert(next_p != NULL, "this must be in the list somewhere");
1394 prev_p = next_p;
1395 next_p = prev_p->next();
1396 }
1397 next_p = this->next();
1398 debug_only(this->set_next(UNINIT_NEXT));
1399 // Remove this from between prev_p and next_p.
1400 if (prev_p == NULL)
1401 head = next_p;
1402 else
1403 prev_p->set_next(next_p);
1404 return head;
1405 }
1406
1407 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(),
1408 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE());
1409 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(),
1410 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE());
1411
1412 WarmCallInfo* WarmCallInfo::always_hot() {
1413 assert(_always_hot.is_hot(), "must always be hot");
1414 return &_always_hot;
1415 }
1416
1417 WarmCallInfo* WarmCallInfo::always_cold() {
1418 assert(_always_cold.is_cold(), "must always be cold");
1419 return &_always_cold;
1420 }
1421
1422
1423 #ifndef PRODUCT
1424
1425 void WarmCallInfo::print() const {
1426 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p",
1427 is_cold() ? "cold" : is_hot() ? "hot " : "warm",
1428 count(), profit(), work(), size(), compute_heat(), next());
1429 tty->cr();
1430 if (call() != NULL) call()->dump();
1431 }
1432
1433 void print_wci(WarmCallInfo* ci) {
1434 ci->print();
1435 }
1436
1437 void WarmCallInfo::print_all() const {
1438 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1439 p->print();
1440 }
1441
1442 int WarmCallInfo::count_all() const {
1443 int cnt = 0;
1444 for (const WarmCallInfo* p = this; p != NULL; p = p->next())
1445 cnt++;
1446 return cnt;
1447 }
1448
1449 #endif //PRODUCT