Mercurial > hg > truffle
annotate src/share/vm/opto/callGenerator.cpp @ 12888:4a2acfb16e97
8025657: compiler/intrinsics/mathexact/ConstantTest.java fails on assert in lcm.cpp on solaris x64
Reviewed-by: kvn, twisti
author | rbackman |
---|---|
date | Fri, 11 Oct 2013 12:06:14 +0200 |
parents | 6f3fd5150b67 |
children | 3213ba4d3dff |
rev | line source |
---|---|
0 | 1 /* |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
2 * Copyright (c) 2000, 2012, Oracle and/or its affiliates. All rights reserved. |
0 | 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 * | |
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1265
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1265
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1265
diff
changeset
|
21 * questions. |
0 | 22 * |
23 */ | |
24 | |
1972 | 25 #include "precompiled.hpp" |
26 #include "ci/bcEscapeAnalyzer.hpp" | |
3852
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
27 #include "ci/ciCallSite.hpp" |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6616
diff
changeset
|
28 #include "ci/ciObjArray.hpp" |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
29 #include "ci/ciMemberName.hpp" |
1972 | 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/cfgnode.hpp" | |
37 #include "opto/connode.hpp" | |
38 #include "opto/parse.hpp" | |
39 #include "opto/rootnode.hpp" | |
40 #include "opto/runtime.hpp" | |
41 #include "opto/subnode.hpp" | |
0 | 42 |
43 | |
44 // Utility function. | |
45 const TypeFunc* CallGenerator::tf() const { | |
46 return TypeFunc::make(method()); | |
47 } | |
48 | |
49 //-----------------------------ParseGenerator--------------------------------- | |
50 // Internal class which handles all direct bytecode traversal. | |
51 class ParseGenerator : public InlineCallGenerator { | |
52 private: | |
53 bool _is_osr; | |
54 float _expected_uses; | |
55 | |
56 public: | |
57 ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false) | |
58 : InlineCallGenerator(method) | |
59 { | |
60 _is_osr = is_osr; | |
61 _expected_uses = expected_uses; | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3894
diff
changeset
|
62 assert(InlineTree::check_can_parse(method) == NULL, "parse must be possible"); |
0 | 63 } |
64 | |
65 virtual bool is_parse() const { return true; } | |
66 virtual JVMState* generate(JVMState* jvms); | |
67 int is_osr() { return _is_osr; } | |
68 | |
69 }; | |
70 | |
71 JVMState* ParseGenerator::generate(JVMState* jvms) { | |
72 Compile* C = Compile::current(); | |
73 | |
74 if (is_osr()) { | |
75 // The JVMS for a OSR has a single argument (see its TypeFunc). | |
76 assert(jvms->depth() == 1, "no inline OSR"); | |
77 } | |
78 | |
79 if (C->failing()) { | |
80 return NULL; // bailing out of the compile; do not try to parse | |
81 } | |
82 | |
83 Parse parser(jvms, method(), _expected_uses); | |
84 // Grab signature for matching/allocation | |
85 #ifdef ASSERT | |
86 if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) { | |
87 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); | |
88 assert(C->env()->system_dictionary_modification_counter_changed(), | |
89 "Must invalidate if TypeFuncs differ"); | |
90 } | |
91 #endif | |
92 | |
93 GraphKit& exits = parser.exits(); | |
94 | |
95 if (C->failing()) { | |
96 while (exits.pop_exception_state() != NULL) ; | |
97 return NULL; | |
98 } | |
99 | |
100 assert(exits.jvms()->same_calls_as(jvms), "sanity"); | |
101 | |
102 // Simply return the exit state of the parser, | |
103 // augmented by any exceptional states. | |
104 return exits.transfer_exceptions_into_jvms(); | |
105 } | |
106 | |
107 //---------------------------DirectCallGenerator------------------------------ | |
108 // Internal class which handles all out-of-line calls w/o receiver type checks. | |
109 class DirectCallGenerator : public CallGenerator { | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
110 private: |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
111 CallStaticJavaNode* _call_node; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
112 // Force separate memory and I/O projections for the exceptional |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
113 // paths to facilitate late inlinig. |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
114 bool _separate_io_proj; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
115 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
116 public: |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
117 DirectCallGenerator(ciMethod* method, bool separate_io_proj) |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
118 : CallGenerator(method), |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
119 _separate_io_proj(separate_io_proj) |
0 | 120 { |
121 } | |
122 virtual JVMState* generate(JVMState* jvms); | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
123 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
124 CallStaticJavaNode* call_node() const { return _call_node; } |
0 | 125 }; |
126 | |
127 JVMState* DirectCallGenerator::generate(JVMState* jvms) { | |
128 GraphKit kit(jvms); | |
129 bool is_static = method()->is_static(); | |
130 address target = is_static ? SharedRuntime::get_resolve_static_call_stub() | |
131 : SharedRuntime::get_resolve_opt_virtual_call_stub(); | |
132 | |
133 if (kit.C->log() != NULL) { | |
134 kit.C->log()->elem("direct_call bci='%d'", jvms->bci()); | |
135 } | |
136 | |
10278 | 137 CallStaticJavaNode *call = new (kit.C) CallStaticJavaNode(kit.C, tf(), target, method(), kit.bci()); |
6042
847da049d62f
7162094: LateInlineCallGenerator::do_late_inline crashed on uninitialized _call_node
never
parents:
4117
diff
changeset
|
138 _call_node = call; // Save the call node in case we need it later |
0 | 139 if (!is_static) { |
140 // Make an explicit receiver null_check as part of this call. | |
141 // Since we share a map with the caller, his JVMS gets adjusted. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
142 kit.null_check_receiver_before_call(method()); |
0 | 143 if (kit.stopped()) { |
144 // And dump it back to the caller, decorated with any exceptions: | |
145 return kit.transfer_exceptions_into_jvms(); | |
146 } | |
147 // Mark the call node as virtual, sort of: | |
148 call->set_optimized_virtual(true); | |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
149 if (method()->is_method_handle_intrinsic() || |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
150 method()->is_compiled_lambda_form()) { |
1137
97125851f396
6829187: compiler optimizations required for JSR 292
twisti
parents:
1080
diff
changeset
|
151 call->set_method_handle_invoke(true); |
1265 | 152 } |
0 | 153 } |
154 kit.set_arguments_for_java_call(call); | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
155 kit.set_edges_for_java_call(call, false, _separate_io_proj); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
156 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj); |
0 | 157 kit.push_node(method()->return_type()->basic_type(), ret); |
158 return kit.transfer_exceptions_into_jvms(); | |
159 } | |
160 | |
1137
97125851f396
6829187: compiler optimizations required for JSR 292
twisti
parents:
1080
diff
changeset
|
161 //--------------------------VirtualCallGenerator------------------------------ |
97125851f396
6829187: compiler optimizations required for JSR 292
twisti
parents:
1080
diff
changeset
|
162 // Internal class which handles all out-of-line calls checking receiver type. |
0 | 163 class VirtualCallGenerator : public CallGenerator { |
164 private: | |
165 int _vtable_index; | |
166 public: | |
167 VirtualCallGenerator(ciMethod* method, int vtable_index) | |
168 : CallGenerator(method), _vtable_index(vtable_index) | |
169 { | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6616
diff
changeset
|
170 assert(vtable_index == Method::invalid_vtable_index || |
0 | 171 vtable_index >= 0, "either invalid or usable"); |
172 } | |
173 virtual bool is_virtual() const { return true; } | |
174 virtual JVMState* generate(JVMState* jvms); | |
175 }; | |
176 | |
177 JVMState* VirtualCallGenerator::generate(JVMState* jvms) { | |
178 GraphKit kit(jvms); | |
179 Node* receiver = kit.argument(0); | |
180 | |
181 if (kit.C->log() != NULL) { | |
182 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci()); | |
183 } | |
184 | |
185 // If the receiver is a constant null, do not torture the system | |
186 // by attempting to call through it. The compile will proceed | |
187 // correctly, but may bail out in final_graph_reshaping, because | |
188 // the call instruction will have a seemingly deficient out-count. | |
189 // (The bailout says something misleading about an "infinite loop".) | |
190 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) { | |
191 kit.inc_sp(method()->arg_size()); // restore arguments | |
192 kit.uncommon_trap(Deoptimization::Reason_null_check, | |
193 Deoptimization::Action_none, | |
194 NULL, "null receiver"); | |
195 return kit.transfer_exceptions_into_jvms(); | |
196 } | |
197 | |
198 // Ideally we would unconditionally do a null check here and let it | |
199 // be converted to an implicit check based on profile information. | |
200 // However currently the conversion to implicit null checks in | |
201 // Block::implicit_null_check() only looks for loads and stores, not calls. | |
202 ciMethod *caller = kit.method(); | |
203 ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data(); | |
204 if (!UseInlineCaches || !ImplicitNullChecks || | |
205 ((ImplicitNullCheckThreshold > 0) && caller_md && | |
206 (caller_md->trap_count(Deoptimization::Reason_null_check) | |
207 >= (uint)ImplicitNullCheckThreshold))) { | |
208 // Make an explicit receiver null_check as part of this call. | |
209 // Since we share a map with the caller, his JVMS gets adjusted. | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
210 receiver = kit.null_check_receiver_before_call(method()); |
0 | 211 if (kit.stopped()) { |
212 // And dump it back to the caller, decorated with any exceptions: | |
213 return kit.transfer_exceptions_into_jvms(); | |
214 } | |
215 } | |
216 | |
217 assert(!method()->is_static(), "virtual call must not be to static"); | |
218 assert(!method()->is_final(), "virtual call should not be to final"); | |
219 assert(!method()->is_private(), "virtual call should not be to private"); | |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6616
diff
changeset
|
220 assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches, |
0 | 221 "no vtable calls if +UseInlineCaches "); |
222 address target = SharedRuntime::get_resolve_virtual_call_stub(); | |
223 // Normal inline cache used for call | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
224 CallDynamicJavaNode *call = new (kit.C) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci()); |
0 | 225 kit.set_arguments_for_java_call(call); |
226 kit.set_edges_for_java_call(call); | |
227 Node* ret = kit.set_results_for_java_call(call); | |
228 kit.push_node(method()->return_type()->basic_type(), ret); | |
229 | |
230 // Represent the effect of an implicit receiver null_check | |
231 // as part of this call. Since we share a map with the caller, | |
232 // his JVMS gets adjusted. | |
233 kit.cast_not_null(receiver); | |
234 return kit.transfer_exceptions_into_jvms(); | |
235 } | |
236 | |
237 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) { | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3894
diff
changeset
|
238 if (InlineTree::check_can_parse(m) != NULL) return NULL; |
0 | 239 return new ParseGenerator(m, expected_uses); |
240 } | |
241 | |
242 // As a special case, the JVMS passed to this CallGenerator is | |
243 // for the method execution already in progress, not just the JVMS | |
244 // of the caller. Thus, this CallGenerator cannot be mixed with others! | |
245 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) { | |
3900
a32de5085326
7079673: JSR 292: C1 should inline bytecoded method handle adapters
twisti
parents:
3894
diff
changeset
|
246 if (InlineTree::check_can_parse(m) != NULL) return NULL; |
0 | 247 float past_uses = m->interpreter_invocation_count(); |
248 float expected_uses = past_uses; | |
249 return new ParseGenerator(m, expected_uses, true); | |
250 } | |
251 | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
252 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) { |
0 | 253 assert(!m->is_abstract(), "for_direct_call mismatch"); |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
254 return new DirectCallGenerator(m, separate_io_proj); |
0 | 255 } |
256 | |
257 CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) { | |
258 assert(!m->is_static(), "for_virtual_call mismatch"); | |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
259 assert(!m->is_method_handle_intrinsic(), "should be a direct call"); |
0 | 260 return new VirtualCallGenerator(m, vtable_index); |
261 } | |
262 | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
263 // Allow inlining decisions to be delayed |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
264 class LateInlineCallGenerator : public DirectCallGenerator { |
7473 | 265 protected: |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
266 CallGenerator* _inline_cg; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
267 |
7473 | 268 virtual bool do_late_inline_check(JVMState* jvms) { return true; } |
269 | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
270 public: |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
271 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) : |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
272 DirectCallGenerator(method, true), _inline_cg(inline_cg) {} |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
273 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
274 virtual bool is_late_inline() const { return true; } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
275 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
276 // Convert the CallStaticJava into an inline |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
277 virtual void do_late_inline(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
278 |
6616
7a302948f5a4
7192167: JSR 292: C1 has old broken code which needs to be removed
twisti
parents:
6268
diff
changeset
|
279 virtual JVMState* generate(JVMState* jvms) { |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
280 Compile *C = Compile::current(); |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
281 C->print_inlining_skip(this); |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
282 |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
283 // Record that this call site should be revisited once the main |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
284 // parse is finished. |
7473 | 285 if (!is_mh_late_inline()) { |
286 C->add_late_inline(this); | |
287 } | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
288 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
289 // Emit the CallStaticJava and request separate projections so |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
290 // that the late inlining logic can distinguish between fall |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
291 // through and exceptional uses of the memory and io projections |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
292 // as is done for allocations and macro expansion. |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
293 return DirectCallGenerator::generate(jvms); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
294 } |
7473 | 295 |
296 virtual void print_inlining_late(const char* msg) { | |
297 CallNode* call = call_node(); | |
298 Compile* C = Compile::current(); | |
299 C->print_inlining_insert(this); | |
300 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), msg); | |
301 } | |
302 | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
303 }; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
304 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
305 void LateInlineCallGenerator::do_late_inline() { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
306 // Can't inline it |
10278 | 307 CallStaticJavaNode* call = call_node(); |
308 if (call == NULL || call->outcnt() == 0 || | |
309 call->in(0) == NULL || call->in(0)->is_top()) { | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
310 return; |
7997
8bd61471a109
8007144: Incremental inlining mistakes some call sites for dead ones and doesn't inline them
roland
parents:
7478
diff
changeset
|
311 } |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
312 |
10278 | 313 const TypeTuple *r = call->tf()->domain(); |
7473 | 314 for (int i1 = 0; i1 < method()->arg_size(); i1++) { |
10278 | 315 if (call->in(TypeFunc::Parms + i1)->is_top() && r->field_at(TypeFunc::Parms + i1) != Type::HALF) { |
7473 | 316 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing"); |
317 return; | |
318 } | |
319 } | |
320 | |
10278 | 321 if (call->in(TypeFunc::Memory)->is_top()) { |
7473 | 322 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing"); |
323 return; | |
324 } | |
325 | |
10278 | 326 Compile* C = Compile::current(); |
327 // Remove inlined methods from Compiler's lists. | |
328 if (call->is_macro()) { | |
329 C->remove_macro_node(call); | |
330 } | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
331 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
332 // Make a clone of the JVMState that appropriate to use for driving a parse |
10278 | 333 JVMState* old_jvms = call->jvms(); |
334 JVMState* jvms = old_jvms->clone_shallow(C); | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
335 uint size = call->req(); |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
336 SafePointNode* map = new (C) SafePointNode(size, jvms); |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
337 for (uint i1 = 0; i1 < size; i1++) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
338 map->init_req(i1, call->in(i1)); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
339 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
340 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
341 // Make sure the state is a MergeMem for parsing. |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
342 if (!map->in(TypeFunc::Memory)->is_MergeMem()) { |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
343 Node* mem = MergeMemNode::make(C, map->in(TypeFunc::Memory)); |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
344 C->initial_gvn()->set_type_bottom(mem); |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
345 map->set_req(TypeFunc::Memory, mem); |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
346 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
347 |
10278 | 348 uint nargs = method()->arg_size(); |
349 // blow away old call arguments | |
350 Node* top = C->top(); | |
351 for (uint i1 = 0; i1 < nargs; i1++) { | |
352 map->set_req(TypeFunc::Parms + i1, top); | |
353 } | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
354 jvms->set_map(map); |
10278 | 355 |
356 // Make enough space in the expression stack to transfer | |
357 // the incoming arguments and return value. | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
358 map->ensure_stack(jvms, jvms->method()->max_stack()); |
10278 | 359 for (uint i1 = 0; i1 < nargs; i1++) { |
360 map->set_argument(jvms, i1, call->in(TypeFunc::Parms + i1)); | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
361 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
362 |
10278 | 363 // This check is done here because for_method_handle_inline() method |
364 // needs jvms for inlined state. | |
7473 | 365 if (!do_late_inline_check(jvms)) { |
366 map->disconnect_inputs(NULL, C); | |
367 return; | |
368 } | |
369 | |
7421
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
370 C->print_inlining_insert(this); |
ad5dd04754ee
8005031: Some cleanup in c2 to prepare for incremental inlining support
roland
parents:
7194
diff
changeset
|
371 |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
372 CompileLog* log = C->log(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
373 if (log != NULL) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
374 log->head("late_inline method='%d'", log->identify(method())); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
375 JVMState* p = jvms; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
376 while (p != NULL) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
377 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method())); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
378 p = p->caller(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
379 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
380 log->tail("late_inline"); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
381 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
382 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
383 // Setup default node notes to be picked up by the inlining |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
384 Node_Notes* old_nn = C->default_node_notes(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
385 if (old_nn != NULL) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
386 Node_Notes* entry_nn = old_nn->clone(C); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
387 entry_nn->set_jvms(jvms); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
388 C->set_default_node_notes(entry_nn); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
389 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
390 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
391 // Now perform the inling using the synthesized JVMState |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
392 JVMState* new_jvms = _inline_cg->generate(jvms); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
393 if (new_jvms == NULL) return; // no change |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
394 if (C->failing()) return; |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
395 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
396 // Capture any exceptional control flow |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
397 GraphKit kit(new_jvms); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
398 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
399 // Find the result object |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
400 Node* result = C->top(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
401 int result_size = method()->return_type()->size(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
402 if (result_size != 0 && !kit.stopped()) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
403 result = (result_size == 1) ? kit.pop() : kit.pop_pair(); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
404 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
405 |
7473 | 406 C->set_has_loops(C->has_loops() || _inline_cg->method()->has_loops()); |
407 C->env()->notice_inlined_method(_inline_cg->method()); | |
408 C->set_inlining_progress(true); | |
409 | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
410 kit.replace_call(call, result); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
411 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
412 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
413 |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
414 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) { |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
415 return new LateInlineCallGenerator(method, inline_cg); |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
416 } |
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
417 |
7473 | 418 class LateInlineMHCallGenerator : public LateInlineCallGenerator { |
419 ciMethod* _caller; | |
420 int _attempt; | |
421 bool _input_not_const; | |
422 | |
423 virtual bool do_late_inline_check(JVMState* jvms); | |
424 virtual bool already_attempted() const { return _attempt > 0; } | |
425 | |
426 public: | |
427 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) : | |
428 LateInlineCallGenerator(callee, NULL), _caller(caller), _attempt(0), _input_not_const(input_not_const) {} | |
429 | |
430 virtual bool is_mh_late_inline() const { return true; } | |
431 | |
432 virtual JVMState* generate(JVMState* jvms) { | |
433 JVMState* new_jvms = LateInlineCallGenerator::generate(jvms); | |
434 if (_input_not_const) { | |
435 // inlining won't be possible so no need to enqueue right now. | |
436 call_node()->set_generator(this); | |
437 } else { | |
438 Compile::current()->add_late_inline(this); | |
439 } | |
440 return new_jvms; | |
441 } | |
442 | |
443 virtual void print_inlining_late(const char* msg) { | |
444 if (!_input_not_const) return; | |
445 LateInlineCallGenerator::print_inlining_late(msg); | |
446 } | |
447 }; | |
448 | |
449 bool LateInlineMHCallGenerator::do_late_inline_check(JVMState* jvms) { | |
450 | |
451 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), _input_not_const); | |
452 | |
453 if (!_input_not_const) { | |
454 _attempt++; | |
455 } | |
456 | |
457 if (cg != NULL) { | |
458 assert(!cg->is_late_inline() && cg->is_inline(), "we're doing late inlining"); | |
459 _inline_cg = cg; | |
460 Compile::current()->dec_number_of_mh_late_inlines(); | |
461 return true; | |
462 } | |
463 | |
464 call_node()->set_generator(this); | |
465 return false; | |
466 } | |
467 | |
468 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) { | |
469 Compile::current()->inc_number_of_mh_late_inlines(); | |
470 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const); | |
471 return cg; | |
472 } | |
473 | |
474 class LateInlineStringCallGenerator : public LateInlineCallGenerator { | |
475 | |
476 public: | |
477 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) : | |
478 LateInlineCallGenerator(method, inline_cg) {} | |
479 | |
480 virtual JVMState* generate(JVMState* jvms) { | |
481 Compile *C = Compile::current(); | |
482 C->print_inlining_skip(this); | |
483 | |
484 C->add_string_late_inline(this); | |
485 | |
486 JVMState* new_jvms = DirectCallGenerator::generate(jvms); | |
487 return new_jvms; | |
488 } | |
489 }; | |
490 | |
491 CallGenerator* CallGenerator::for_string_late_inline(ciMethod* method, CallGenerator* inline_cg) { | |
492 return new LateInlineStringCallGenerator(method, inline_cg); | |
493 } | |
494 | |
10278 | 495 class LateInlineBoxingCallGenerator : public LateInlineCallGenerator { |
496 | |
497 public: | |
498 LateInlineBoxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) : | |
499 LateInlineCallGenerator(method, inline_cg) {} | |
500 | |
501 virtual JVMState* generate(JVMState* jvms) { | |
502 Compile *C = Compile::current(); | |
503 C->print_inlining_skip(this); | |
504 | |
505 C->add_boxing_late_inline(this); | |
506 | |
507 JVMState* new_jvms = DirectCallGenerator::generate(jvms); | |
508 return new_jvms; | |
509 } | |
510 }; | |
511 | |
512 CallGenerator* CallGenerator::for_boxing_late_inline(ciMethod* method, CallGenerator* inline_cg) { | |
513 return new LateInlineBoxingCallGenerator(method, inline_cg); | |
514 } | |
0 | 515 |
516 //---------------------------WarmCallGenerator-------------------------------- | |
517 // Internal class which handles initial deferral of inlining decisions. | |
518 class WarmCallGenerator : public CallGenerator { | |
519 WarmCallInfo* _call_info; | |
520 CallGenerator* _if_cold; | |
521 CallGenerator* _if_hot; | |
522 bool _is_virtual; // caches virtuality of if_cold | |
523 bool _is_inline; // caches inline-ness of if_hot | |
524 | |
525 public: | |
526 WarmCallGenerator(WarmCallInfo* ci, | |
527 CallGenerator* if_cold, | |
528 CallGenerator* if_hot) | |
529 : CallGenerator(if_cold->method()) | |
530 { | |
531 assert(method() == if_hot->method(), "consistent choices"); | |
532 _call_info = ci; | |
533 _if_cold = if_cold; | |
534 _if_hot = if_hot; | |
535 _is_virtual = if_cold->is_virtual(); | |
536 _is_inline = if_hot->is_inline(); | |
537 } | |
538 | |
539 virtual bool is_inline() const { return _is_inline; } | |
540 virtual bool is_virtual() const { return _is_virtual; } | |
541 virtual bool is_deferred() const { return true; } | |
542 | |
543 virtual JVMState* generate(JVMState* jvms); | |
544 }; | |
545 | |
546 | |
547 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci, | |
548 CallGenerator* if_cold, | |
549 CallGenerator* if_hot) { | |
550 return new WarmCallGenerator(ci, if_cold, if_hot); | |
551 } | |
552 | |
553 JVMState* WarmCallGenerator::generate(JVMState* jvms) { | |
554 Compile* C = Compile::current(); | |
555 if (C->log() != NULL) { | |
556 C->log()->elem("warm_call bci='%d'", jvms->bci()); | |
557 } | |
558 jvms = _if_cold->generate(jvms); | |
559 if (jvms != NULL) { | |
560 Node* m = jvms->map()->control(); | |
561 if (m->is_CatchProj()) m = m->in(0); else m = C->top(); | |
562 if (m->is_Catch()) m = m->in(0); else m = C->top(); | |
563 if (m->is_Proj()) m = m->in(0); else m = C->top(); | |
564 if (m->is_CallJava()) { | |
565 _call_info->set_call(m->as_Call()); | |
566 _call_info->set_hot_cg(_if_hot); | |
567 #ifndef PRODUCT | |
568 if (PrintOpto || PrintOptoInlining) { | |
569 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci()); | |
570 tty->print("WCI: "); | |
571 _call_info->print(); | |
572 } | |
573 #endif | |
574 _call_info->set_heat(_call_info->compute_heat()); | |
575 C->set_warm_calls(_call_info->insert_into(C->warm_calls())); | |
576 } | |
577 } | |
578 return jvms; | |
579 } | |
580 | |
581 void WarmCallInfo::make_hot() { | |
1080
7c57aead6d3e
6892658: C2 should optimize some stringbuilder patterns
never
parents:
337
diff
changeset
|
582 Unimplemented(); |
0 | 583 } |
584 | |
585 void WarmCallInfo::make_cold() { | |
586 // No action: Just dequeue. | |
587 } | |
588 | |
589 | |
590 //------------------------PredictedCallGenerator------------------------------ | |
591 // Internal class which handles all out-of-line calls checking receiver type. | |
592 class PredictedCallGenerator : public CallGenerator { | |
593 ciKlass* _predicted_receiver; | |
594 CallGenerator* _if_missed; | |
595 CallGenerator* _if_hit; | |
596 float _hit_prob; | |
597 | |
598 public: | |
599 PredictedCallGenerator(ciKlass* predicted_receiver, | |
600 CallGenerator* if_missed, | |
601 CallGenerator* if_hit, float hit_prob) | |
602 : CallGenerator(if_missed->method()) | |
603 { | |
604 // The call profile data may predict the hit_prob as extreme as 0 or 1. | |
605 // Remove the extremes values from the range. | |
606 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX; | |
607 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN; | |
608 | |
609 _predicted_receiver = predicted_receiver; | |
610 _if_missed = if_missed; | |
611 _if_hit = if_hit; | |
612 _hit_prob = hit_prob; | |
613 } | |
614 | |
615 virtual bool is_virtual() const { return true; } | |
616 virtual bool is_inline() const { return _if_hit->is_inline(); } | |
617 virtual bool is_deferred() const { return _if_hit->is_deferred(); } | |
618 | |
619 virtual JVMState* generate(JVMState* jvms); | |
620 }; | |
621 | |
622 | |
623 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver, | |
624 CallGenerator* if_missed, | |
625 CallGenerator* if_hit, | |
626 float hit_prob) { | |
627 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob); | |
628 } | |
629 | |
630 | |
631 JVMState* PredictedCallGenerator::generate(JVMState* jvms) { | |
632 GraphKit kit(jvms); | |
633 PhaseGVN& gvn = kit.gvn(); | |
634 // We need an explicit receiver null_check before checking its type. | |
635 // We share a map with the caller, so his JVMS gets adjusted. | |
636 Node* receiver = kit.argument(0); | |
637 | |
638 CompileLog* log = kit.C->log(); | |
639 if (log != NULL) { | |
640 log->elem("predicted_call bci='%d' klass='%d'", | |
641 jvms->bci(), log->identify(_predicted_receiver)); | |
642 } | |
643 | |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
644 receiver = kit.null_check_receiver_before_call(method()); |
0 | 645 if (kit.stopped()) { |
646 return kit.transfer_exceptions_into_jvms(); | |
647 } | |
648 | |
649 Node* exact_receiver = receiver; // will get updated in place... | |
650 Node* slow_ctl = kit.type_check_receiver(receiver, | |
651 _predicted_receiver, _hit_prob, | |
652 &exact_receiver); | |
653 | |
654 SafePointNode* slow_map = NULL; | |
655 JVMState* slow_jvms; | |
656 { PreserveJVMState pjvms(&kit); | |
657 kit.set_control(slow_ctl); | |
658 if (!kit.stopped()) { | |
659 slow_jvms = _if_missed->generate(kit.sync_jvms()); | |
4117
a04a201f0f5a
7108383: JSR 292: JRuby bench_define_method_methods.rb: assert(slow_jvms != NULL) failed: miss path must not
twisti
parents:
4062
diff
changeset
|
660 if (kit.failing()) |
a04a201f0f5a
7108383: JSR 292: JRuby bench_define_method_methods.rb: assert(slow_jvms != NULL) failed: miss path must not
twisti
parents:
4062
diff
changeset
|
661 return NULL; // might happen because of NodeCountInliningCutoff |
a04a201f0f5a
7108383: JSR 292: JRuby bench_define_method_methods.rb: assert(slow_jvms != NULL) failed: miss path must not
twisti
parents:
4062
diff
changeset
|
662 assert(slow_jvms != NULL, "must be"); |
0 | 663 kit.add_exception_states_from(slow_jvms); |
664 kit.set_map(slow_jvms->map()); | |
665 if (!kit.stopped()) | |
666 slow_map = kit.stop(); | |
667 } | |
668 } | |
669 | |
293
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
0
diff
changeset
|
670 if (kit.stopped()) { |
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
0
diff
changeset
|
671 // Instance exactly does not matches the desired type. |
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
0
diff
changeset
|
672 kit.set_jvms(slow_jvms); |
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
0
diff
changeset
|
673 return kit.transfer_exceptions_into_jvms(); |
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
0
diff
changeset
|
674 } |
c3e045194476
6731641: assert(m->adr_type() == mach->adr_type(),"matcher should not change adr type")
kvn
parents:
0
diff
changeset
|
675 |
0 | 676 // fall through if the instance exactly matches the desired type |
677 kit.replace_in_map(receiver, exact_receiver); | |
678 | |
679 // Make the hot call: | |
680 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms()); | |
681 if (new_jvms == NULL) { | |
682 // Inline failed, so make a direct call. | |
683 assert(_if_hit->is_inline(), "must have been a failed inline"); | |
684 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method()); | |
685 new_jvms = cg->generate(kit.sync_jvms()); | |
686 } | |
687 kit.add_exception_states_from(new_jvms); | |
688 kit.set_jvms(new_jvms); | |
689 | |
690 // Need to merge slow and fast? | |
691 if (slow_map == NULL) { | |
692 // The fast path is the only path remaining. | |
693 return kit.transfer_exceptions_into_jvms(); | |
694 } | |
695 | |
696 if (kit.stopped()) { | |
697 // Inlined method threw an exception, so it's just the slow path after all. | |
698 kit.set_jvms(slow_jvms); | |
699 return kit.transfer_exceptions_into_jvms(); | |
700 } | |
701 | |
702 // Finish the diamond. | |
703 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization | |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
704 RegionNode* region = new (kit.C) RegionNode(3); |
0 | 705 region->init_req(1, kit.control()); |
706 region->init_req(2, slow_map->control()); | |
707 kit.set_control(gvn.transform(region)); | |
708 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); | |
709 iophi->set_req(2, slow_map->i_o()); | |
710 kit.set_i_o(gvn.transform(iophi)); | |
711 kit.merge_memory(slow_map->merged_memory(), region, 2); | |
712 uint tos = kit.jvms()->stkoff() + kit.sp(); | |
713 uint limit = slow_map->req(); | |
714 for (uint i = TypeFunc::Parms; i < limit; i++) { | |
715 // Skip unused stack slots; fast forward to monoff(); | |
716 if (i == tos) { | |
717 i = kit.jvms()->monoff(); | |
718 if( i >= limit ) break; | |
719 } | |
720 Node* m = kit.map()->in(i); | |
721 Node* n = slow_map->in(i); | |
722 if (m != n) { | |
723 const Type* t = gvn.type(m)->meet(gvn.type(n)); | |
724 Node* phi = PhiNode::make(region, m, t); | |
725 phi->set_req(2, n); | |
726 kit.map()->set_req(i, gvn.transform(phi)); | |
727 } | |
728 } | |
729 return kit.transfer_exceptions_into_jvms(); | |
730 } | |
731 | |
732 | |
7473 | 733 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool delayed_forbidden) { |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
734 assert(callee->is_method_handle_intrinsic() || |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
735 callee->is_compiled_lambda_form(), "for_method_handle_call mismatch"); |
7473 | 736 bool input_not_const; |
737 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, input_not_const); | |
738 Compile* C = Compile::current(); | |
739 if (cg != NULL) { | |
740 if (!delayed_forbidden && AlwaysIncrementalInline) { | |
741 return CallGenerator::for_late_inline(callee, cg); | |
742 } else { | |
743 return cg; | |
744 } | |
745 } | |
746 int bci = jvms->bci(); | |
747 ciCallProfile profile = caller->call_profile_at_bci(bci); | |
748 int call_site_count = caller->scale_count(profile.count()); | |
749 | |
750 if (IncrementalInline && call_site_count > 0 && | |
751 (input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())) { | |
752 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const); | |
753 } else { | |
7478 | 754 // Out-of-line call. |
7473 | 755 return CallGenerator::for_direct_call(callee); |
756 } | |
4117
a04a201f0f5a
7108383: JSR 292: JRuby bench_define_method_methods.rb: assert(slow_jvms != NULL) failed: miss path must not
twisti
parents:
4062
diff
changeset
|
757 } |
a04a201f0f5a
7108383: JSR 292: JRuby bench_define_method_methods.rb: assert(slow_jvms != NULL) failed: miss path must not
twisti
parents:
4062
diff
changeset
|
758 |
7473 | 759 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool& input_not_const) { |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
760 GraphKit kit(jvms); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
761 PhaseGVN& gvn = kit.gvn(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
762 Compile* C = kit.C; |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
763 vmIntrinsics::ID iid = callee->intrinsic_id(); |
7473 | 764 input_not_const = true; |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
765 switch (iid) { |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
766 case vmIntrinsics::_invokeBasic: |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
767 { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
768 // Get MethodHandle receiver: |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
769 Node* receiver = kit.argument(0); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
770 if (receiver->Opcode() == Op_ConP) { |
7473 | 771 input_not_const = false; |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
772 const TypeOopPtr* oop_ptr = receiver->bottom_type()->is_oopptr(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
773 ciMethod* target = oop_ptr->const_oop()->as_method_handle()->get_vmtarget(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
774 guarantee(!target->is_method_handle_intrinsic(), "should not happen"); // XXX remove |
6725
da91efe96a93
6964458: Reimplement class meta-data storage to use native memory
coleenp
parents:
6616
diff
changeset
|
775 const int vtable_index = Method::invalid_vtable_index; |
7473 | 776 CallGenerator* cg = C->call_generator(target, vtable_index, false, jvms, true, PROB_ALWAYS, true, true); |
7478 | 777 assert(!cg->is_late_inline() || cg->is_mh_late_inline(), "no late inline here"); |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
778 if (cg != NULL && cg->is_inline()) |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
779 return cg; |
3905
c26de9aef2ed
7071307: MethodHandle bimorphic inlining should consider the frequency
never
parents:
3901
diff
changeset
|
780 } |
c26de9aef2ed
7071307: MethodHandle bimorphic inlining should consider the frequency
never
parents:
3901
diff
changeset
|
781 } |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
782 break; |
3905
c26de9aef2ed
7071307: MethodHandle bimorphic inlining should consider the frequency
never
parents:
3901
diff
changeset
|
783 |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
784 case vmIntrinsics::_linkToVirtual: |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
785 case vmIntrinsics::_linkToStatic: |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
786 case vmIntrinsics::_linkToSpecial: |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
787 case vmIntrinsics::_linkToInterface: |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
788 { |
7194
beebba0acc11
7172640: C2: instrinsic implementations in LibraryCallKit should use argument() instead of pop()
twisti
parents:
6894
diff
changeset
|
789 // Get MemberName argument: |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
790 Node* member_name = kit.argument(callee->arg_size() - 1); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
791 if (member_name->Opcode() == Op_ConP) { |
7473 | 792 input_not_const = false; |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
793 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
794 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget(); |
3752
f918d6096e23
7050554: JSR 292 - need optimization for selectAlternative
never
parents:
2443
diff
changeset
|
795 |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
796 // In lamda forms we erase signature types to avoid resolving issues |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
797 // involving class loaders. When we optimize a method handle invoke |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
798 // to a direct call we must cast the receiver and arguments to its |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
799 // actual types. |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
800 ciSignature* signature = target->signature(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
801 const int receiver_skip = target->is_static() ? 0 : 1; |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
802 // Cast receiver to its type. |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
803 if (!target->is_static()) { |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
804 Node* arg = kit.argument(0); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
805 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
806 const Type* sig_type = TypeOopPtr::make_from_klass(signature->accessing_klass()); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
807 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
808 Node* cast_obj = gvn.transform(new (C) CheckCastPPNode(kit.control(), arg, sig_type)); |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
809 kit.set_argument(0, cast_obj); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
810 } |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
811 } |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
812 // Cast reference arguments to its type. |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
813 for (int i = 0; i < signature->count(); i++) { |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
814 ciType* t = signature->type_at(i); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
815 if (t->is_klass()) { |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
816 Node* arg = kit.argument(receiver_skip + i); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
817 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr(); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
818 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass()); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
819 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { |
6804
e626685e9f6c
7193318: C2: remove number of inputs requirement from Node's new operator
kvn
parents:
6725
diff
changeset
|
820 Node* cast_obj = gvn.transform(new (C) CheckCastPPNode(kit.control(), arg, sig_type)); |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
821 kit.set_argument(receiver_skip + i, cast_obj); |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
822 } |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
823 } |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
824 } |
7478 | 825 |
826 // Try to get the most accurate receiver type | |
827 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual); | |
828 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface); | |
829 int vtable_index = Method::invalid_vtable_index; | |
830 bool call_does_dispatch = false; | |
831 | |
832 if (is_virtual_or_interface) { | |
833 ciInstanceKlass* klass = target->holder(); | |
834 Node* receiver_node = kit.argument(0); | |
835 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr(); | |
836 // call_does_dispatch and vtable_index are out-parameters. They might be changed. | |
837 target = C->optimize_virtual_call(caller, jvms->bci(), klass, target, receiver_type, | |
838 is_virtual, | |
839 call_does_dispatch, vtable_index); // out-parameters | |
840 } | |
841 | |
842 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms, true, PROB_ALWAYS, true, true); | |
843 assert(!cg->is_late_inline() || cg->is_mh_late_inline(), "no late inline here"); | |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
844 if (cg != NULL && cg->is_inline()) |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
845 return cg; |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
846 } |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
847 } |
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
848 break; |
3852
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
849 |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
850 default: |
6268
6c5b7a6becc8
7187454: stack overflow in C2 compiler thread on Solaris x86
kvn
parents:
6266
diff
changeset
|
851 fatal(err_msg_res("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid))); |
6266
1d7922586cf6
7023639: JSR 292 method handle invocation needs a fast path for compiled code
twisti
parents:
6182
diff
changeset
|
852 break; |
3852
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
853 } |
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
854 return NULL; |
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
855 } |
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
856 |
fdb992d83a87
7071653: JSR 292: call site change notification should be pushed not pulled
twisti
parents:
3752
diff
changeset
|
857 |
6894 | 858 //------------------------PredictedIntrinsicGenerator------------------------------ |
859 // Internal class which handles all predicted Intrinsic calls. | |
860 class PredictedIntrinsicGenerator : public CallGenerator { | |
861 CallGenerator* _intrinsic; | |
862 CallGenerator* _cg; | |
863 | |
864 public: | |
865 PredictedIntrinsicGenerator(CallGenerator* intrinsic, | |
866 CallGenerator* cg) | |
867 : CallGenerator(cg->method()) | |
868 { | |
869 _intrinsic = intrinsic; | |
870 _cg = cg; | |
871 } | |
872 | |
873 virtual bool is_virtual() const { return true; } | |
874 virtual bool is_inlined() const { return true; } | |
875 virtual bool is_intrinsic() const { return true; } | |
876 | |
877 virtual JVMState* generate(JVMState* jvms); | |
878 }; | |
879 | |
880 | |
881 CallGenerator* CallGenerator::for_predicted_intrinsic(CallGenerator* intrinsic, | |
882 CallGenerator* cg) { | |
883 return new PredictedIntrinsicGenerator(intrinsic, cg); | |
884 } | |
885 | |
886 | |
887 JVMState* PredictedIntrinsicGenerator::generate(JVMState* jvms) { | |
888 GraphKit kit(jvms); | |
889 PhaseGVN& gvn = kit.gvn(); | |
890 | |
891 CompileLog* log = kit.C->log(); | |
892 if (log != NULL) { | |
893 log->elem("predicted_intrinsic bci='%d' method='%d'", | |
894 jvms->bci(), log->identify(method())); | |
895 } | |
896 | |
897 Node* slow_ctl = _intrinsic->generate_predicate(kit.sync_jvms()); | |
898 if (kit.failing()) | |
899 return NULL; // might happen because of NodeCountInliningCutoff | |
900 | |
901 SafePointNode* slow_map = NULL; | |
902 JVMState* slow_jvms; | |
903 if (slow_ctl != NULL) { | |
904 PreserveJVMState pjvms(&kit); | |
905 kit.set_control(slow_ctl); | |
906 if (!kit.stopped()) { | |
907 slow_jvms = _cg->generate(kit.sync_jvms()); | |
908 if (kit.failing()) | |
909 return NULL; // might happen because of NodeCountInliningCutoff | |
910 assert(slow_jvms != NULL, "must be"); | |
911 kit.add_exception_states_from(slow_jvms); | |
912 kit.set_map(slow_jvms->map()); | |
913 if (!kit.stopped()) | |
914 slow_map = kit.stop(); | |
915 } | |
916 } | |
917 | |
918 if (kit.stopped()) { | |
919 // Predicate is always false. | |
920 kit.set_jvms(slow_jvms); | |
921 return kit.transfer_exceptions_into_jvms(); | |
922 } | |
923 | |
924 // Generate intrinsic code: | |
925 JVMState* new_jvms = _intrinsic->generate(kit.sync_jvms()); | |
926 if (new_jvms == NULL) { | |
927 // Intrinsic failed, so use slow code or make a direct call. | |
928 if (slow_map == NULL) { | |
929 CallGenerator* cg = CallGenerator::for_direct_call(method()); | |
930 new_jvms = cg->generate(kit.sync_jvms()); | |
931 } else { | |
932 kit.set_jvms(slow_jvms); | |
933 return kit.transfer_exceptions_into_jvms(); | |
934 } | |
935 } | |
936 kit.add_exception_states_from(new_jvms); | |
937 kit.set_jvms(new_jvms); | |
938 | |
939 // Need to merge slow and fast? | |
940 if (slow_map == NULL) { | |
941 // The fast path is the only path remaining. | |
942 return kit.transfer_exceptions_into_jvms(); | |
943 } | |
944 | |
945 if (kit.stopped()) { | |
946 // Intrinsic method threw an exception, so it's just the slow path after all. | |
947 kit.set_jvms(slow_jvms); | |
948 return kit.transfer_exceptions_into_jvms(); | |
949 } | |
950 | |
951 // Finish the diamond. | |
952 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization | |
953 RegionNode* region = new (kit.C) RegionNode(3); | |
954 region->init_req(1, kit.control()); | |
955 region->init_req(2, slow_map->control()); | |
956 kit.set_control(gvn.transform(region)); | |
957 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); | |
958 iophi->set_req(2, slow_map->i_o()); | |
959 kit.set_i_o(gvn.transform(iophi)); | |
960 kit.merge_memory(slow_map->merged_memory(), region, 2); | |
961 uint tos = kit.jvms()->stkoff() + kit.sp(); | |
962 uint limit = slow_map->req(); | |
963 for (uint i = TypeFunc::Parms; i < limit; i++) { | |
964 // Skip unused stack slots; fast forward to monoff(); | |
965 if (i == tos) { | |
966 i = kit.jvms()->monoff(); | |
967 if( i >= limit ) break; | |
968 } | |
969 Node* m = kit.map()->in(i); | |
970 Node* n = slow_map->in(i); | |
971 if (m != n) { | |
972 const Type* t = gvn.type(m)->meet(gvn.type(n)); | |
973 Node* phi = PhiNode::make(region, m, t); | |
974 phi->set_req(2, n); | |
975 kit.map()->set_req(i, gvn.transform(phi)); | |
976 } | |
977 } | |
978 return kit.transfer_exceptions_into_jvms(); | |
979 } | |
980 | |
0 | 981 //-------------------------UncommonTrapCallGenerator----------------------------- |
982 // Internal class which handles all out-of-line calls checking receiver type. | |
983 class UncommonTrapCallGenerator : public CallGenerator { | |
984 Deoptimization::DeoptReason _reason; | |
985 Deoptimization::DeoptAction _action; | |
986 | |
987 public: | |
988 UncommonTrapCallGenerator(ciMethod* m, | |
989 Deoptimization::DeoptReason reason, | |
990 Deoptimization::DeoptAction action) | |
991 : CallGenerator(m) | |
992 { | |
993 _reason = reason; | |
994 _action = action; | |
995 } | |
996 | |
997 virtual bool is_virtual() const { ShouldNotReachHere(); return false; } | |
998 virtual bool is_trap() const { return true; } | |
999 | |
1000 virtual JVMState* generate(JVMState* jvms); | |
1001 }; | |
1002 | |
1003 | |
1004 CallGenerator* | |
1005 CallGenerator::for_uncommon_trap(ciMethod* m, | |
1006 Deoptimization::DeoptReason reason, | |
1007 Deoptimization::DeoptAction action) { | |
1008 return new UncommonTrapCallGenerator(m, reason, action); | |
1009 } | |
1010 | |
1011 | |
1012 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms) { | |
1013 GraphKit kit(jvms); | |
1014 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver). | |
1015 int nargs = method()->arg_size(); | |
1016 kit.inc_sp(nargs); | |
1017 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed"); | |
1018 if (_reason == Deoptimization::Reason_class_check && | |
1019 _action == Deoptimization::Action_maybe_recompile) { | |
1020 // Temp fix for 6529811 | |
1021 // Don't allow uncommon_trap to override our decision to recompile in the event | |
1022 // of a class cast failure for a monomorphic call as it will never let us convert | |
1023 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops | |
1024 bool keep_exact_action = true; | |
1025 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action); | |
1026 } else { | |
1027 kit.uncommon_trap(_reason, _action); | |
1028 } | |
1029 return kit.transfer_exceptions_into_jvms(); | |
1030 } | |
1031 | |
1032 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.) | |
1033 | |
1034 // (Node: Merged hook_up_exits into ParseGenerator::generate.) | |
1035 | |
1036 #define NODES_OVERHEAD_PER_METHOD (30.0) | |
1037 #define NODES_PER_BYTECODE (9.5) | |
1038 | |
1039 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) { | |
1040 int call_count = profile.count(); | |
1041 int code_size = call_method->code_size(); | |
1042 | |
1043 // Expected execution count is based on the historical count: | |
1044 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor); | |
1045 | |
1046 // Expected profit from inlining, in units of simple call-overheads. | |
1047 _profit = 1.0; | |
1048 | |
1049 // Expected work performed by the call in units of call-overheads. | |
1050 // %%% need an empirical curve fit for "work" (time in call) | |
1051 float bytecodes_per_call = 3; | |
1052 _work = 1.0 + code_size / bytecodes_per_call; | |
1053 | |
1054 // Expected size of compilation graph: | |
1055 // -XX:+PrintParseStatistics once reported: | |
1056 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391 | |
1057 // Histogram of 144298 parsed bytecodes: | |
1058 // %%% Need an better predictor for graph size. | |
1059 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size); | |
1060 } | |
1061 | |
1062 // is_cold: Return true if the node should never be inlined. | |
1063 // This is true if any of the key metrics are extreme. | |
1064 bool WarmCallInfo::is_cold() const { | |
1065 if (count() < WarmCallMinCount) return true; | |
1066 if (profit() < WarmCallMinProfit) return true; | |
1067 if (work() > WarmCallMaxWork) return true; | |
1068 if (size() > WarmCallMaxSize) return true; | |
1069 return false; | |
1070 } | |
1071 | |
1072 // is_hot: Return true if the node should be inlined immediately. | |
1073 // This is true if any of the key metrics are extreme. | |
1074 bool WarmCallInfo::is_hot() const { | |
1075 assert(!is_cold(), "eliminate is_cold cases before testing is_hot"); | |
1076 if (count() >= HotCallCountThreshold) return true; | |
1077 if (profit() >= HotCallProfitThreshold) return true; | |
1078 if (work() <= HotCallTrivialWork) return true; | |
1079 if (size() <= HotCallTrivialSize) return true; | |
1080 return false; | |
1081 } | |
1082 | |
1083 // compute_heat: | |
1084 float WarmCallInfo::compute_heat() const { | |
1085 assert(!is_cold(), "compute heat only on warm nodes"); | |
1086 assert(!is_hot(), "compute heat only on warm nodes"); | |
1087 int min_size = MAX2(0, (int)HotCallTrivialSize); | |
1088 int max_size = MIN2(500, (int)WarmCallMaxSize); | |
1089 float method_size = (size() - min_size) / MAX2(1, max_size - min_size); | |
1090 float size_factor; | |
1091 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg. | |
1092 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg. | |
1093 else if (method_size < 0.5) size_factor = 1; // better than avg. | |
1094 else size_factor = 0.5; // worse than avg. | |
1095 return (count() * profit() * size_factor); | |
1096 } | |
1097 | |
1098 bool WarmCallInfo::warmer_than(WarmCallInfo* that) { | |
1099 assert(this != that, "compare only different WCIs"); | |
1100 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st"); | |
1101 if (this->heat() > that->heat()) return true; | |
1102 if (this->heat() < that->heat()) return false; | |
1103 assert(this->heat() == that->heat(), "no NaN heat allowed"); | |
1104 // Equal heat. Break the tie some other way. | |
1105 if (!this->call() || !that->call()) return (address)this > (address)that; | |
1106 return this->call()->_idx > that->call()->_idx; | |
1107 } | |
1108 | |
1109 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress) | |
1110 #define UNINIT_NEXT ((WarmCallInfo*)NULL) | |
1111 | |
1112 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) { | |
1113 assert(next() == UNINIT_NEXT, "not yet on any list"); | |
1114 WarmCallInfo* prev_p = NULL; | |
1115 WarmCallInfo* next_p = head; | |
1116 while (next_p != NULL && next_p->warmer_than(this)) { | |
1117 prev_p = next_p; | |
1118 next_p = prev_p->next(); | |
1119 } | |
1120 // Install this between prev_p and next_p. | |
1121 this->set_next(next_p); | |
1122 if (prev_p == NULL) | |
1123 head = this; | |
1124 else | |
1125 prev_p->set_next(this); | |
1126 return head; | |
1127 } | |
1128 | |
1129 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) { | |
1130 WarmCallInfo* prev_p = NULL; | |
1131 WarmCallInfo* next_p = head; | |
1132 while (next_p != this) { | |
1133 assert(next_p != NULL, "this must be in the list somewhere"); | |
1134 prev_p = next_p; | |
1135 next_p = prev_p->next(); | |
1136 } | |
1137 next_p = this->next(); | |
1138 debug_only(this->set_next(UNINIT_NEXT)); | |
1139 // Remove this from between prev_p and next_p. | |
1140 if (prev_p == NULL) | |
1141 head = next_p; | |
1142 else | |
1143 prev_p->set_next(next_p); | |
1144 return head; | |
1145 } | |
1146 | |
2443
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1147 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(), |
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1148 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE()); |
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1149 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(), |
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1150 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE()); |
0 | 1151 |
1152 WarmCallInfo* WarmCallInfo::always_hot() { | |
2443
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1153 assert(_always_hot.is_hot(), "must always be hot"); |
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1154 return &_always_hot; |
0 | 1155 } |
1156 | |
1157 WarmCallInfo* WarmCallInfo::always_cold() { | |
2443
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1158 assert(_always_cold.is_cold(), "must always be cold"); |
f8b038506985
6909440: C2 fails with assertion (_always_cold->is_cold(),"must always be cold")
never
parents:
2357
diff
changeset
|
1159 return &_always_cold; |
0 | 1160 } |
1161 | |
1162 | |
1163 #ifndef PRODUCT | |
1164 | |
1165 void WarmCallInfo::print() const { | |
1166 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p", | |
1167 is_cold() ? "cold" : is_hot() ? "hot " : "warm", | |
1168 count(), profit(), work(), size(), compute_heat(), next()); | |
1169 tty->cr(); | |
1170 if (call() != NULL) call()->dump(); | |
1171 } | |
1172 | |
1173 void print_wci(WarmCallInfo* ci) { | |
1174 ci->print(); | |
1175 } | |
1176 | |
1177 void WarmCallInfo::print_all() const { | |
1178 for (const WarmCallInfo* p = this; p != NULL; p = p->next()) | |
1179 p->print(); | |
1180 } | |
1181 | |
1182 int WarmCallInfo::count_all() const { | |
1183 int cnt = 0; | |
1184 for (const WarmCallInfo* p = this; p != NULL; p = p->next()) | |
1185 cnt++; | |
1186 return cnt; | |
1187 } | |
1188 | |
1189 #endif //PRODUCT |