|
duke@1
|
1 /*
|
|
drchase@24424
|
2 * Copyright (c) 1997, 2014, Oracle and/or its affiliates. All rights reserved.
|
|
duke@1
|
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
duke@1
|
4 *
|
|
duke@1
|
5 * This code is free software; you can redistribute it and/or modify it
|
|
duke@1
|
6 * under the terms of the GNU General Public License version 2 only, as
|
|
duke@1
|
7 * published by the Free Software Foundation.
|
|
duke@1
|
8 *
|
|
duke@1
|
9 * This code is distributed in the hope that it will be useful, but WITHOUT
|
|
duke@1
|
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
duke@1
|
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
duke@1
|
12 * version 2 for more details (a copy is included in the LICENSE file that
|
|
duke@1
|
13 * accompanied this code).
|
|
duke@1
|
14 *
|
|
duke@1
|
15 * You should have received a copy of the GNU General Public License version
|
|
duke@1
|
16 * 2 along with this work; if not, write to the Free Software Foundation,
|
|
duke@1
|
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
duke@1
|
18 *
|
|
trims@5547
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
trims@5547
|
20 * or visit www.oracle.com if you need additional information or have any
|
|
trims@5547
|
21 * questions.
|
|
duke@1
|
22 *
|
|
duke@1
|
23 */
|
|
duke@1
|
24
|
|
stefank@7397
|
25 #include "precompiled.hpp"
|
|
stefank@7397
|
26 #include "compiler/compileLog.hpp"
|
|
stefank@7397
|
27 #include "interpreter/linkResolver.hpp"
|
|
coleenp@13728
|
28 #include "oops/method.hpp"
|
|
stefank@7397
|
29 #include "opto/addnode.hpp"
|
|
morris@23528
|
30 #include "opto/castnode.hpp"
|
|
stefank@7397
|
31 #include "opto/idealGraphPrinter.hpp"
|
|
stefank@7397
|
32 #include "opto/locknode.hpp"
|
|
stefank@7397
|
33 #include "opto/memnode.hpp"
|
|
morris@23528
|
34 #include "opto/opaquenode.hpp"
|
|
stefank@7397
|
35 #include "opto/parse.hpp"
|
|
stefank@7397
|
36 #include "opto/rootnode.hpp"
|
|
stefank@7397
|
37 #include "opto/runtime.hpp"
|
|
stefank@7397
|
38 #include "runtime/arguments.hpp"
|
|
stefank@7397
|
39 #include "runtime/handles.inline.hpp"
|
|
stefank@7397
|
40 #include "runtime/sharedRuntime.hpp"
|
|
stefank@7397
|
41 #include "utilities/copy.hpp"
|
|
duke@1
|
42
|
|
duke@1
|
43 // Static array so we can figure out which bytecodes stop us from compiling
|
|
duke@1
|
44 // the most. Some of the non-static variables are needed in bytecodeInfo.cpp
|
|
duke@1
|
45 // and eventually should be encapsulated in a proper class (gri 8/18/98).
|
|
duke@1
|
46
|
|
never@1399
|
47 int nodes_created = 0;
|
|
never@1399
|
48 int methods_parsed = 0;
|
|
never@1399
|
49 int methods_seen = 0;
|
|
never@1399
|
50 int blocks_parsed = 0;
|
|
never@1399
|
51 int blocks_seen = 0;
|
|
duke@1
|
52
|
|
never@1399
|
53 int explicit_null_checks_inserted = 0;
|
|
never@1399
|
54 int explicit_null_checks_elided = 0;
|
|
duke@1
|
55 int all_null_checks_found = 0, implicit_null_checks = 0;
|
|
duke@1
|
56 int implicit_null_throws = 0;
|
|
duke@1
|
57
|
|
duke@1
|
58 int reclaim_idx = 0;
|
|
duke@1
|
59 int reclaim_in = 0;
|
|
duke@1
|
60 int reclaim_node = 0;
|
|
duke@1
|
61
|
|
duke@1
|
62 #ifndef PRODUCT
|
|
duke@1
|
63 bool Parse::BytecodeParseHistogram::_initialized = false;
|
|
duke@1
|
64 uint Parse::BytecodeParseHistogram::_bytecodes_parsed [Bytecodes::number_of_codes];
|
|
duke@1
|
65 uint Parse::BytecodeParseHistogram::_nodes_constructed[Bytecodes::number_of_codes];
|
|
duke@1
|
66 uint Parse::BytecodeParseHistogram::_nodes_transformed[Bytecodes::number_of_codes];
|
|
duke@1
|
67 uint Parse::BytecodeParseHistogram::_new_values [Bytecodes::number_of_codes];
|
|
duke@1
|
68 #endif
|
|
duke@1
|
69
|
|
duke@1
|
70 //------------------------------print_statistics-------------------------------
|
|
duke@1
|
71 #ifndef PRODUCT
|
|
duke@1
|
72 void Parse::print_statistics() {
|
|
duke@1
|
73 tty->print_cr("--- Compiler Statistics ---");
|
|
duke@1
|
74 tty->print("Methods seen: %d Methods parsed: %d", methods_seen, methods_parsed);
|
|
duke@1
|
75 tty->print(" Nodes created: %d", nodes_created);
|
|
duke@1
|
76 tty->cr();
|
|
duke@1
|
77 if (methods_seen != methods_parsed)
|
|
duke@1
|
78 tty->print_cr("Reasons for parse failures (NOT cumulative):");
|
|
never@1399
|
79 tty->print_cr("Blocks parsed: %d Blocks seen: %d", blocks_parsed, blocks_seen);
|
|
duke@1
|
80
|
|
duke@1
|
81 if( explicit_null_checks_inserted )
|
|
duke@1
|
82 tty->print_cr("%d original NULL checks - %d elided (%2d%%); optimizer leaves %d,", explicit_null_checks_inserted, explicit_null_checks_elided, (100*explicit_null_checks_elided)/explicit_null_checks_inserted, all_null_checks_found);
|
|
duke@1
|
83 if( all_null_checks_found )
|
|
duke@1
|
84 tty->print_cr("%d made implicit (%2d%%)", implicit_null_checks,
|
|
duke@1
|
85 (100*implicit_null_checks)/all_null_checks_found);
|
|
duke@1
|
86 if( implicit_null_throws )
|
|
duke@1
|
87 tty->print_cr("%d implicit null exceptions at runtime",
|
|
duke@1
|
88 implicit_null_throws);
|
|
duke@1
|
89
|
|
duke@1
|
90 if( PrintParseStatistics && BytecodeParseHistogram::initialized() ) {
|
|
duke@1
|
91 BytecodeParseHistogram::print();
|
|
duke@1
|
92 }
|
|
duke@1
|
93 }
|
|
duke@1
|
94 #endif
|
|
duke@1
|
95
|
|
duke@1
|
96 //------------------------------ON STACK REPLACEMENT---------------------------
|
|
duke@1
|
97
|
|
duke@1
|
98 // Construct a node which can be used to get incoming state for
|
|
duke@1
|
99 // on stack replacement.
|
|
duke@1
|
100 Node *Parse::fetch_interpreter_state(int index,
|
|
duke@1
|
101 BasicType bt,
|
|
duke@1
|
102 Node *local_addrs,
|
|
duke@1
|
103 Node *local_addrs_base) {
|
|
duke@1
|
104 Node *mem = memory(Compile::AliasIdxRaw);
|
|
duke@1
|
105 Node *adr = basic_plus_adr( local_addrs_base, local_addrs, -index*wordSize );
|
|
kvn@5889
|
106 Node *ctl = control();
|
|
duke@1
|
107
|
|
duke@1
|
108 // Very similar to LoadNode::make, except we handle un-aligned longs and
|
|
duke@1
|
109 // doubles on Sparc. Intel can handle them just fine directly.
|
|
duke@1
|
110 Node *l;
|
|
goetz@22845
|
111 switch (bt) { // Signature is flattened
|
|
goetz@22845
|
112 case T_INT: l = new (C) LoadINode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeInt::INT, MemNode::unordered); break;
|
|
goetz@22845
|
113 case T_FLOAT: l = new (C) LoadFNode(ctl, mem, adr, TypeRawPtr::BOTTOM, Type::FLOAT, MemNode::unordered); break;
|
|
goetz@22845
|
114 case T_ADDRESS: l = new (C) LoadPNode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM, MemNode::unordered); break;
|
|
goetz@22845
|
115 case T_OBJECT: l = new (C) LoadPNode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeInstPtr::BOTTOM, MemNode::unordered); break;
|
|
duke@1
|
116 case T_LONG:
|
|
duke@1
|
117 case T_DOUBLE: {
|
|
duke@1
|
118 // Since arguments are in reverse order, the argument address 'adr'
|
|
duke@1
|
119 // refers to the back half of the long/double. Recompute adr.
|
|
goetz@22845
|
120 adr = basic_plus_adr(local_addrs_base, local_addrs, -(index+1)*wordSize);
|
|
goetz@22845
|
121 if (Matcher::misaligned_doubles_ok) {
|
|
duke@1
|
122 l = (bt == T_DOUBLE)
|
|
goetz@22845
|
123 ? (Node*)new (C) LoadDNode(ctl, mem, adr, TypeRawPtr::BOTTOM, Type::DOUBLE, MemNode::unordered)
|
|
goetz@22845
|
124 : (Node*)new (C) LoadLNode(ctl, mem, adr, TypeRawPtr::BOTTOM, TypeLong::LONG, MemNode::unordered);
|
|
duke@1
|
125 } else {
|
|
duke@1
|
126 l = (bt == T_DOUBLE)
|
|
goetz@22845
|
127 ? (Node*)new (C) LoadD_unalignedNode(ctl, mem, adr, TypeRawPtr::BOTTOM, MemNode::unordered)
|
|
goetz@22845
|
128 : (Node*)new (C) LoadL_unalignedNode(ctl, mem, adr, TypeRawPtr::BOTTOM, MemNode::unordered);
|
|
duke@1
|
129 }
|
|
duke@1
|
130 break;
|
|
duke@1
|
131 }
|
|
duke@1
|
132 default: ShouldNotReachHere();
|
|
duke@1
|
133 }
|
|
duke@1
|
134 return _gvn.transform(l);
|
|
duke@1
|
135 }
|
|
duke@1
|
136
|
|
duke@1
|
137 // Helper routine to prevent the interpreter from handing
|
|
duke@1
|
138 // unexpected typestate to an OSR method.
|
|
duke@1
|
139 // The Node l is a value newly dug out of the interpreter frame.
|
|
duke@1
|
140 // The type is the type predicted by ciTypeFlow. Note that it is
|
|
duke@1
|
141 // not a general type, but can only come from Type::get_typeflow_type.
|
|
duke@1
|
142 // The safepoint is a map which will feed an uncommon trap.
|
|
duke@1
|
143 Node* Parse::check_interpreter_type(Node* l, const Type* type,
|
|
duke@1
|
144 SafePointNode* &bad_type_exit) {
|
|
duke@1
|
145
|
|
duke@1
|
146 const TypeOopPtr* tp = type->isa_oopptr();
|
|
duke@1
|
147
|
|
duke@1
|
148 // TypeFlow may assert null-ness if a type appears unloaded.
|
|
duke@1
|
149 if (type == TypePtr::NULL_PTR ||
|
|
duke@1
|
150 (tp != NULL && !tp->klass()->is_loaded())) {
|
|
duke@1
|
151 // Value must be null, not a real oop.
|
|
kvn@13895
|
152 Node* chk = _gvn.transform( new (C) CmpPNode(l, null()) );
|
|
kvn@13895
|
153 Node* tst = _gvn.transform( new (C) BoolNode(chk, BoolTest::eq) );
|
|
duke@1
|
154 IfNode* iff = create_and_map_if(control(), tst, PROB_MAX, COUNT_UNKNOWN);
|
|
kvn@13895
|
155 set_control(_gvn.transform( new (C) IfTrueNode(iff) ));
|
|
kvn@13895
|
156 Node* bad_type = _gvn.transform( new (C) IfFalseNode(iff) );
|
|
duke@1
|
157 bad_type_exit->control()->add_req(bad_type);
|
|
duke@1
|
158 l = null();
|
|
duke@1
|
159 }
|
|
duke@1
|
160
|
|
duke@1
|
161 // Typeflow can also cut off paths from the CFG, based on
|
|
duke@1
|
162 // types which appear unloaded, or call sites which appear unlinked.
|
|
duke@1
|
163 // When paths are cut off, values at later merge points can rise
|
|
duke@1
|
164 // toward more specific classes. Make sure these specific classes
|
|
duke@1
|
165 // are still in effect.
|
|
duke@1
|
166 if (tp != NULL && tp->klass() != C->env()->Object_klass()) {
|
|
duke@1
|
167 // TypeFlow asserted a specific object type. Value must have that type.
|
|
duke@1
|
168 Node* bad_type_ctrl = NULL;
|
|
duke@1
|
169 l = gen_checkcast(l, makecon(TypeKlassPtr::make(tp->klass())), &bad_type_ctrl);
|
|
duke@1
|
170 bad_type_exit->control()->add_req(bad_type_ctrl);
|
|
duke@1
|
171 }
|
|
duke@1
|
172
|
|
duke@1
|
173 BasicType bt_l = _gvn.type(l)->basic_type();
|
|
duke@1
|
174 BasicType bt_t = type->basic_type();
|
|
duke@1
|
175 assert(_gvn.type(l)->higher_equal(type), "must constrain OSR typestate");
|
|
duke@1
|
176 return l;
|
|
duke@1
|
177 }
|
|
duke@1
|
178
|
|
duke@1
|
179 // Helper routine which sets up elements of the initial parser map when
|
|
duke@1
|
180 // performing a parse for on stack replacement. Add values into map.
|
|
duke@1
|
181 // The only parameter contains the address of a interpreter arguments.
|
|
duke@1
|
182 void Parse::load_interpreter_state(Node* osr_buf) {
|
|
duke@1
|
183 int index;
|
|
duke@1
|
184 int max_locals = jvms()->loc_size();
|
|
duke@1
|
185 int max_stack = jvms()->stk_size();
|
|
duke@1
|
186
|
|
duke@1
|
187
|
|
duke@1
|
188 // Mismatch between method and jvms can occur since map briefly held
|
|
duke@1
|
189 // an OSR entry state (which takes up one RawPtr word).
|
|
duke@1
|
190 assert(max_locals == method()->max_locals(), "sanity");
|
|
duke@1
|
191 assert(max_stack >= method()->max_stack(), "sanity");
|
|
duke@1
|
192 assert((int)jvms()->endoff() == TypeFunc::Parms + max_locals + max_stack, "sanity");
|
|
duke@1
|
193 assert((int)jvms()->endoff() == (int)map()->req(), "sanity");
|
|
duke@1
|
194
|
|
duke@1
|
195 // Find the start block.
|
|
duke@1
|
196 Block* osr_block = start_block();
|
|
duke@1
|
197 assert(osr_block->start() == osr_bci(), "sanity");
|
|
duke@1
|
198
|
|
duke@1
|
199 // Set initial BCI.
|
|
duke@1
|
200 set_parse_bci(osr_block->start());
|
|
duke@1
|
201
|
|
duke@1
|
202 // Set initial stack depth.
|
|
duke@1
|
203 set_sp(osr_block->start_sp());
|
|
duke@1
|
204
|
|
duke@1
|
205 // Check bailouts. We currently do not perform on stack replacement
|
|
duke@1
|
206 // of loops in catch blocks or loops which branch with a non-empty stack.
|
|
duke@1
|
207 if (sp() != 0) {
|
|
duke@1
|
208 C->record_method_not_compilable("OSR starts with non-empty stack");
|
|
duke@1
|
209 return;
|
|
duke@1
|
210 }
|
|
duke@1
|
211 // Do not OSR inside finally clauses:
|
|
duke@1
|
212 if (osr_block->has_trap_at(osr_block->start())) {
|
|
duke@1
|
213 C->record_method_not_compilable("OSR starts with an immediate trap");
|
|
duke@1
|
214 return;
|
|
duke@1
|
215 }
|
|
duke@1
|
216
|
|
duke@1
|
217 // Commute monitors from interpreter frame to compiler frame.
|
|
duke@1
|
218 assert(jvms()->monitor_depth() == 0, "should be no active locks at beginning of osr");
|
|
duke@1
|
219 int mcnt = osr_block->flow()->monitor_count();
|
|
duke@1
|
220 Node *monitors_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals+mcnt*2-1)*wordSize);
|
|
duke@1
|
221 for (index = 0; index < mcnt; index++) {
|
|
duke@1
|
222 // Make a BoxLockNode for the monitor.
|
|
kvn@13895
|
223 Node *box = _gvn.transform(new (C) BoxLockNode(next_monitor()));
|
|
duke@1
|
224
|
|
duke@1
|
225
|
|
duke@1
|
226 // Displaced headers and locked objects are interleaved in the
|
|
duke@1
|
227 // temp OSR buffer. We only copy the locked objects out here.
|
|
duke@1
|
228 // Fetch the locked object from the OSR temp buffer and copy to our fastlock node.
|
|
duke@1
|
229 Node *lock_object = fetch_interpreter_state(index*2, T_OBJECT, monitors_addr, osr_buf);
|
|
duke@1
|
230 // Try and copy the displaced header to the BoxNode
|
|
duke@1
|
231 Node *displaced_hdr = fetch_interpreter_state((index*2) + 1, T_ADDRESS, monitors_addr, osr_buf);
|
|
duke@1
|
232
|
|
duke@1
|
233
|
|
goetz@22845
|
234 store_to_memory(control(), box, displaced_hdr, T_ADDRESS, Compile::AliasIdxRaw, MemNode::unordered);
|
|
duke@1
|
235
|
|
duke@1
|
236 // Build a bogus FastLockNode (no code will be generated) and push the
|
|
duke@1
|
237 // monitor into our debug info.
|
|
kvn@13895
|
238 const FastLockNode *flock = _gvn.transform(new (C) FastLockNode( 0, lock_object, box ))->as_FastLock();
|
|
duke@1
|
239 map()->push_monitor(flock);
|
|
duke@1
|
240
|
|
duke@1
|
241 // If the lock is our method synchronization lock, tuck it away in
|
|
duke@1
|
242 // _sync_lock for return and rethrow exit paths.
|
|
duke@1
|
243 if (index == 0 && method()->is_synchronized()) {
|
|
duke@1
|
244 _synch_lock = flock;
|
|
duke@1
|
245 }
|
|
duke@1
|
246 }
|
|
duke@1
|
247
|
|
never@3910
|
248 // Use the raw liveness computation to make sure that unexpected
|
|
never@3910
|
249 // values don't propagate into the OSR frame.
|
|
never@4440
|
250 MethodLivenessResult live_locals = method()->liveness_at_bci(osr_bci());
|
|
duke@1
|
251 if (!live_locals.is_valid()) {
|
|
duke@1
|
252 // Degenerate or breakpointed method.
|
|
duke@1
|
253 C->record_method_not_compilable("OSR in empty or breakpointed method");
|
|
duke@1
|
254 return;
|
|
duke@1
|
255 }
|
|
duke@1
|
256
|
|
duke@1
|
257 // Extract the needed locals from the interpreter frame.
|
|
duke@1
|
258 Node *locals_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals-1)*wordSize);
|
|
duke@1
|
259
|
|
duke@1
|
260 // find all the locals that the interpreter thinks contain live oops
|
|
duke@1
|
261 const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci());
|
|
duke@1
|
262 for (index = 0; index < max_locals; index++) {
|
|
duke@1
|
263
|
|
duke@1
|
264 if (!live_locals.at(index)) {
|
|
duke@1
|
265 continue;
|
|
duke@1
|
266 }
|
|
duke@1
|
267
|
|
duke@1
|
268 const Type *type = osr_block->local_type_at(index);
|
|
duke@1
|
269
|
|
duke@1
|
270 if (type->isa_oopptr() != NULL) {
|
|
duke@1
|
271
|
|
duke@1
|
272 // 6403625: Verify that the interpreter oopMap thinks that the oop is live
|
|
duke@1
|
273 // else we might load a stale oop if the MethodLiveness disagrees with the
|
|
duke@1
|
274 // result of the interpreter. If the interpreter says it is dead we agree
|
|
duke@1
|
275 // by making the value go to top.
|
|
duke@1
|
276 //
|
|
duke@1
|
277
|
|
duke@1
|
278 if (!live_oops.at(index)) {
|
|
duke@1
|
279 if (C->log() != NULL) {
|
|
duke@1
|
280 C->log()->elem("OSR_mismatch local_index='%d'",index);
|
|
duke@1
|
281 }
|
|
duke@1
|
282 set_local(index, null());
|
|
duke@1
|
283 // and ignore it for the loads
|
|
duke@1
|
284 continue;
|
|
duke@1
|
285 }
|
|
duke@1
|
286 }
|
|
duke@1
|
287
|
|
duke@1
|
288 // Filter out TOP, HALF, and BOTTOM. (Cf. ensure_phi.)
|
|
duke@1
|
289 if (type == Type::TOP || type == Type::HALF) {
|
|
duke@1
|
290 continue;
|
|
duke@1
|
291 }
|
|
duke@1
|
292 // If the type falls to bottom, then this must be a local that
|
|
duke@1
|
293 // is mixing ints and oops or some such. Forcing it to top
|
|
duke@1
|
294 // makes it go dead.
|
|
duke@1
|
295 if (type == Type::BOTTOM) {
|
|
duke@1
|
296 continue;
|
|
duke@1
|
297 }
|
|
duke@1
|
298 // Construct code to access the appropriate local.
|
|
never@5333
|
299 BasicType bt = type->basic_type();
|
|
never@5333
|
300 if (type == TypePtr::NULL_PTR) {
|
|
never@5333
|
301 // Ptr types are mixed together with T_ADDRESS but NULL is
|
|
never@5333
|
302 // really for T_OBJECT types so correct it.
|
|
never@5333
|
303 bt = T_OBJECT;
|
|
never@5333
|
304 }
|
|
never@5333
|
305 Node *value = fetch_interpreter_state(index, bt, locals_addr, osr_buf);
|
|
duke@1
|
306 set_local(index, value);
|
|
duke@1
|
307 }
|
|
duke@1
|
308
|
|
duke@1
|
309 // Extract the needed stack entries from the interpreter frame.
|
|
duke@1
|
310 for (index = 0; index < sp(); index++) {
|
|
duke@1
|
311 const Type *type = osr_block->stack_type_at(index);
|
|
duke@1
|
312 if (type != Type::TOP) {
|
|
duke@1
|
313 // Currently the compiler bails out when attempting to on stack replace
|
|
duke@1
|
314 // at a bci with a non-empty stack. We should not reach here.
|
|
duke@1
|
315 ShouldNotReachHere();
|
|
duke@1
|
316 }
|
|
duke@1
|
317 }
|
|
duke@1
|
318
|
|
duke@1
|
319 // End the OSR migration
|
|
duke@1
|
320 make_runtime_call(RC_LEAF, OptoRuntime::osr_end_Type(),
|
|
duke@1
|
321 CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end),
|
|
duke@1
|
322 "OSR_migration_end", TypeRawPtr::BOTTOM,
|
|
duke@1
|
323 osr_buf);
|
|
duke@1
|
324
|
|
duke@1
|
325 // Now that the interpreter state is loaded, make sure it will match
|
|
duke@1
|
326 // at execution time what the compiler is expecting now:
|
|
duke@1
|
327 SafePointNode* bad_type_exit = clone_map();
|
|
kvn@13895
|
328 bad_type_exit->set_control(new (C) RegionNode(1));
|
|
duke@1
|
329
|
|
never@5029
|
330 assert(osr_block->flow()->jsrs()->size() == 0, "should be no jsrs live at osr point");
|
|
duke@1
|
331 for (index = 0; index < max_locals; index++) {
|
|
duke@1
|
332 if (stopped()) break;
|
|
duke@1
|
333 Node* l = local(index);
|
|
duke@1
|
334 if (l->is_top()) continue; // nothing here
|
|
duke@1
|
335 const Type *type = osr_block->local_type_at(index);
|
|
duke@1
|
336 if (type->isa_oopptr() != NULL) {
|
|
duke@1
|
337 if (!live_oops.at(index)) {
|
|
duke@1
|
338 // skip type check for dead oops
|
|
duke@1
|
339 continue;
|
|
duke@1
|
340 }
|
|
duke@1
|
341 }
|
|
never@5032
|
342 if (osr_block->flow()->local_type_at(index)->is_return_address()) {
|
|
never@5029
|
343 // In our current system it's illegal for jsr addresses to be
|
|
never@5029
|
344 // live into an OSR entry point because the compiler performs
|
|
never@5029
|
345 // inlining of jsrs. ciTypeFlow has a bailout that detect this
|
|
never@5029
|
346 // case and aborts the compile if addresses are live into an OSR
|
|
never@5029
|
347 // entry point. Because of that we can assume that any address
|
|
never@5029
|
348 // locals at the OSR entry point are dead. Method liveness
|
|
never@5029
|
349 // isn't precise enought to figure out that they are dead in all
|
|
never@5029
|
350 // cases so simply skip checking address locals all
|
|
never@5029
|
351 // together. Any type check is guaranteed to fail since the
|
|
never@5029
|
352 // interpreter type is the result of a load which might have any
|
|
never@5029
|
353 // value and the expected type is a constant.
|
|
never@4440
|
354 continue;
|
|
never@4440
|
355 }
|
|
duke@1
|
356 set_local(index, check_interpreter_type(l, type, bad_type_exit));
|
|
duke@1
|
357 }
|
|
duke@1
|
358
|
|
duke@1
|
359 for (index = 0; index < sp(); index++) {
|
|
duke@1
|
360 if (stopped()) break;
|
|
duke@1
|
361 Node* l = stack(index);
|
|
duke@1
|
362 if (l->is_top()) continue; // nothing here
|
|
duke@1
|
363 const Type *type = osr_block->stack_type_at(index);
|
|
duke@1
|
364 set_stack(index, check_interpreter_type(l, type, bad_type_exit));
|
|
duke@1
|
365 }
|
|
duke@1
|
366
|
|
duke@1
|
367 if (bad_type_exit->control()->req() > 1) {
|
|
duke@1
|
368 // Build an uncommon trap here, if any inputs can be unexpected.
|
|
duke@1
|
369 bad_type_exit->set_control(_gvn.transform( bad_type_exit->control() ));
|
|
duke@1
|
370 record_for_igvn(bad_type_exit->control());
|
|
duke@1
|
371 SafePointNode* types_are_good = map();
|
|
duke@1
|
372 set_map(bad_type_exit);
|
|
duke@1
|
373 // The unexpected type happens because a new edge is active
|
|
duke@1
|
374 // in the CFG, which typeflow had previously ignored.
|
|
duke@1
|
375 // E.g., Object x = coldAtFirst() && notReached()? "str": new Integer(123).
|
|
duke@1
|
376 // This x will be typed as Integer if notReached is not yet linked.
|
|
kvn@13931
|
377 // It could also happen due to a problem in ciTypeFlow analysis.
|
|
kvn@13931
|
378 uncommon_trap(Deoptimization::Reason_constraint,
|
|
duke@1
|
379 Deoptimization::Action_reinterpret);
|
|
duke@1
|
380 set_map(types_are_good);
|
|
duke@1
|
381 }
|
|
duke@1
|
382 }
|
|
duke@1
|
383
|
|
duke@1
|
384 //------------------------------Parse------------------------------------------
|
|
duke@1
|
385 // Main parser constructor.
|
|
roland@21089
|
386 Parse::Parse(JVMState* caller, ciMethod* parse_method, float expected_uses, Parse* parent)
|
|
roland@21089
|
387 : _exits(caller), _parent(parent)
|
|
duke@1
|
388 {
|
|
duke@1
|
389 // Init some variables
|
|
duke@1
|
390 _caller = caller;
|
|
duke@1
|
391 _method = parse_method;
|
|
duke@1
|
392 _expected_uses = expected_uses;
|
|
duke@1
|
393 _depth = 1 + (caller->has_method() ? caller->depth() : 0);
|
|
duke@1
|
394 _wrote_final = false;
|
|
goetz@22868
|
395 _wrote_volatile = false;
|
|
shade@23190
|
396 _wrote_stable = false;
|
|
shade@23190
|
397 _wrote_fields = false;
|
|
kvn@17383
|
398 _alloc_with_final = NULL;
|
|
duke@1
|
399 _entry_bci = InvocationEntryBci;
|
|
duke@1
|
400 _tf = NULL;
|
|
duke@1
|
401 _block = NULL;
|
|
duke@1
|
402 debug_only(_block_count = -1);
|
|
duke@1
|
403 debug_only(_blocks = (Block*)-1);
|
|
duke@1
|
404 #ifndef PRODUCT
|
|
duke@1
|
405 if (PrintCompilation || PrintOpto) {
|
|
duke@1
|
406 // Make sure I have an inline tree, so I can print messages about it.
|
|
duke@1
|
407 JVMState* ilt_caller = is_osr_parse() ? caller->caller() : caller;
|
|
twisti@13391
|
408 InlineTree::find_subtree_from_root(C->ilt(), ilt_caller, parse_method);
|
|
duke@1
|
409 }
|
|
duke@1
|
410 _max_switch_depth = 0;
|
|
duke@1
|
411 _est_switch_depth = 0;
|
|
duke@1
|
412 #endif
|
|
duke@1
|
413
|
|
duke@1
|
414 _tf = TypeFunc::make(method());
|
|
duke@1
|
415 _iter.reset_to_method(method());
|
|
duke@1
|
416 _flow = method()->get_flow_analysis();
|
|
duke@1
|
417 if (_flow->failing()) {
|
|
duke@1
|
418 C->record_method_not_compilable_all_tiers(_flow->failure_reason());
|
|
duke@1
|
419 }
|
|
duke@1
|
420
|
|
never@1399
|
421 #ifndef PRODUCT
|
|
never@1399
|
422 if (_flow->has_irreducible_entry()) {
|
|
never@1399
|
423 C->set_parsed_irreducible_loop(true);
|
|
never@1399
|
424 }
|
|
never@1399
|
425 #endif
|
|
never@1399
|
426
|
|
duke@1
|
427 if (_expected_uses <= 0) {
|
|
duke@1
|
428 _prof_factor = 1;
|
|
duke@1
|
429 } else {
|
|
duke@1
|
430 float prof_total = parse_method->interpreter_invocation_count();
|
|
duke@1
|
431 if (prof_total <= _expected_uses) {
|
|
duke@1
|
432 _prof_factor = 1;
|
|
duke@1
|
433 } else {
|
|
duke@1
|
434 _prof_factor = _expected_uses / prof_total;
|
|
duke@1
|
435 }
|
|
duke@1
|
436 }
|
|
duke@1
|
437
|
|
duke@1
|
438 CompileLog* log = C->log();
|
|
duke@1
|
439 if (log != NULL) {
|
|
duke@1
|
440 log->begin_head("parse method='%d' uses='%g'",
|
|
duke@1
|
441 log->identify(parse_method), expected_uses);
|
|
duke@1
|
442 if (depth() == 1 && C->is_osr_compilation()) {
|
|
duke@1
|
443 log->print(" osr_bci='%d'", C->entry_bci());
|
|
duke@1
|
444 }
|
|
duke@1
|
445 log->stamp();
|
|
duke@1
|
446 log->end_head();
|
|
duke@1
|
447 }
|
|
duke@1
|
448
|
|
duke@1
|
449 // Accumulate deoptimization counts.
|
|
duke@1
|
450 // (The range_check and store_check counts are checked elsewhere.)
|
|
duke@1
|
451 ciMethodData* md = method()->method_data();
|
|
duke@1
|
452 for (uint reason = 0; reason < md->trap_reason_limit(); reason++) {
|
|
duke@1
|
453 uint md_count = md->trap_count(reason);
|
|
duke@1
|
454 if (md_count != 0) {
|
|
duke@1
|
455 if (md_count == md->trap_count_limit())
|
|
duke@1
|
456 md_count += md->overflow_trap_count();
|
|
duke@1
|
457 uint total_count = C->trap_count(reason);
|
|
duke@1
|
458 uint old_count = total_count;
|
|
duke@1
|
459 total_count += md_count;
|
|
duke@1
|
460 // Saturate the add if it overflows.
|
|
duke@1
|
461 if (total_count < old_count || total_count < md_count)
|
|
duke@1
|
462 total_count = (uint)-1;
|
|
duke@1
|
463 C->set_trap_count(reason, total_count);
|
|
duke@1
|
464 if (log != NULL)
|
|
duke@1
|
465 log->elem("observe trap='%s' count='%d' total='%d'",
|
|
duke@1
|
466 Deoptimization::trap_reason_name(reason),
|
|
duke@1
|
467 md_count, total_count);
|
|
duke@1
|
468 }
|
|
duke@1
|
469 }
|
|
duke@1
|
470 // Accumulate total sum of decompilations, also.
|
|
duke@1
|
471 C->set_decompile_count(C->decompile_count() + md->decompile_count());
|
|
duke@1
|
472
|
|
duke@1
|
473 _count_invocations = C->do_count_invocations();
|
|
duke@1
|
474 _method_data_update = C->do_method_data_update();
|
|
duke@1
|
475
|
|
duke@1
|
476 if (log != NULL && method()->has_exception_handlers()) {
|
|
duke@1
|
477 log->elem("observe that='has_exception_handlers'");
|
|
duke@1
|
478 }
|
|
duke@1
|
479
|
|
duke@1
|
480 assert(method()->can_be_compiled(), "Can not parse this method, cutout earlier");
|
|
duke@1
|
481 assert(method()->has_balanced_monitors(), "Can not parse unbalanced monitors, cutout earlier");
|
|
duke@1
|
482
|
|
duke@1
|
483 // Always register dependence if JVMTI is enabled, because
|
|
duke@1
|
484 // either breakpoint setting or hotswapping of methods may
|
|
duke@1
|
485 // cause deoptimization.
|
|
kvn@2867
|
486 if (C->env()->jvmti_can_hotswap_or_post_breakpoint()) {
|
|
duke@1
|
487 C->dependencies()->assert_evol_method(method());
|
|
duke@1
|
488 }
|
|
duke@1
|
489
|
|
duke@1
|
490 methods_seen++;
|
|
duke@1
|
491
|
|
duke@1
|
492 // Do some special top-level things.
|
|
duke@1
|
493 if (depth() == 1 && C->is_osr_compilation()) {
|
|
duke@1
|
494 _entry_bci = C->entry_bci();
|
|
duke@1
|
495 _flow = method()->get_osr_flow_analysis(osr_bci());
|
|
duke@1
|
496 if (_flow->failing()) {
|
|
duke@1
|
497 C->record_method_not_compilable(_flow->failure_reason());
|
|
duke@1
|
498 #ifndef PRODUCT
|
|
duke@1
|
499 if (PrintOpto && (Verbose || WizardMode)) {
|
|
duke@1
|
500 tty->print_cr("OSR @%d type flow bailout: %s", _entry_bci, _flow->failure_reason());
|
|
duke@1
|
501 if (Verbose) {
|
|
coleenp@13728
|
502 method()->print();
|
|
duke@1
|
503 method()->print_codes();
|
|
duke@1
|
504 _flow->print();
|
|
duke@1
|
505 }
|
|
duke@1
|
506 }
|
|
duke@1
|
507 #endif
|
|
duke@1
|
508 }
|
|
duke@1
|
509 _tf = C->tf(); // the OSR entry type is different
|
|
duke@1
|
510 }
|
|
duke@1
|
511
|
|
duke@1
|
512 #ifdef ASSERT
|
|
duke@1
|
513 if (depth() == 1) {
|
|
duke@1
|
514 assert(C->is_osr_compilation() == this->is_osr_parse(), "OSR in sync");
|
|
duke@1
|
515 if (C->tf() != tf()) {
|
|
duke@1
|
516 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag);
|
|
duke@1
|
517 assert(C->env()->system_dictionary_modification_counter_changed(),
|
|
duke@1
|
518 "Must invalidate if TypeFuncs differ");
|
|
duke@1
|
519 }
|
|
duke@1
|
520 } else {
|
|
duke@1
|
521 assert(!this->is_osr_parse(), "no recursive OSR");
|
|
duke@1
|
522 }
|
|
duke@1
|
523 #endif
|
|
duke@1
|
524
|
|
duke@1
|
525 methods_parsed++;
|
|
duke@1
|
526 #ifndef PRODUCT
|
|
duke@1
|
527 // add method size here to guarantee that inlined methods are added too
|
|
duke@1
|
528 if (TimeCompiler)
|
|
duke@1
|
529 _total_bytes_compiled += method()->code_size();
|
|
duke@1
|
530
|
|
duke@1
|
531 show_parse_info();
|
|
duke@1
|
532 #endif
|
|
duke@1
|
533
|
|
duke@1
|
534 if (failing()) {
|
|
duke@1
|
535 if (log) log->done("parse");
|
|
duke@1
|
536 return;
|
|
duke@1
|
537 }
|
|
duke@1
|
538
|
|
duke@1
|
539 gvn().set_type(root(), root()->bottom_type());
|
|
duke@1
|
540 gvn().transform(top());
|
|
duke@1
|
541
|
|
duke@1
|
542 // Import the results of the ciTypeFlow.
|
|
duke@1
|
543 init_blocks();
|
|
duke@1
|
544
|
|
duke@1
|
545 // Merge point for all normal exits
|
|
duke@1
|
546 build_exits();
|
|
duke@1
|
547
|
|
duke@1
|
548 // Setup the initial JVM state map.
|
|
duke@1
|
549 SafePointNode* entry_map = create_entry_map();
|
|
duke@1
|
550
|
|
duke@1
|
551 // Check for bailouts during map initialization
|
|
duke@1
|
552 if (failing() || entry_map == NULL) {
|
|
duke@1
|
553 if (log) log->done("parse");
|
|
duke@1
|
554 return;
|
|
duke@1
|
555 }
|
|
duke@1
|
556
|
|
duke@1
|
557 Node_Notes* caller_nn = C->default_node_notes();
|
|
duke@1
|
558 // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls.
|
|
duke@1
|
559 if (DebugInlinedCalls || depth() == 1) {
|
|
duke@1
|
560 C->set_default_node_notes(make_node_notes(caller_nn));
|
|
duke@1
|
561 }
|
|
duke@1
|
562
|
|
duke@1
|
563 if (is_osr_parse()) {
|
|
duke@1
|
564 Node* osr_buf = entry_map->in(TypeFunc::Parms+0);
|
|
duke@1
|
565 entry_map->set_req(TypeFunc::Parms+0, top());
|
|
duke@1
|
566 set_map(entry_map);
|
|
duke@1
|
567 load_interpreter_state(osr_buf);
|
|
duke@1
|
568 } else {
|
|
duke@1
|
569 set_map(entry_map);
|
|
duke@1
|
570 do_method_entry();
|
|
iveresov@24442
|
571 if (depth() == 1 && C->age_code()) {
|
|
iveresov@24442
|
572 decrement_age();
|
|
iveresov@24442
|
573 }
|
|
duke@1
|
574 }
|
|
kvn@23491
|
575 if (depth() == 1) {
|
|
kvn@23491
|
576 // Add check to deoptimize the nmethod if RTM state was changed
|
|
kvn@23491
|
577 rtm_deopt();
|
|
kvn@23491
|
578 }
|
|
duke@1
|
579
|
|
duke@1
|
580 // Check for bailouts during method entry.
|
|
duke@1
|
581 if (failing()) {
|
|
duke@1
|
582 if (log) log->done("parse");
|
|
duke@1
|
583 C->set_default_node_notes(caller_nn);
|
|
duke@1
|
584 return;
|
|
duke@1
|
585 }
|
|
duke@1
|
586
|
|
duke@1
|
587 entry_map = map(); // capture any changes performed by method setup code
|
|
duke@1
|
588 assert(jvms()->endoff() == map()->req(), "map matches JVMS layout");
|
|
duke@1
|
589
|
|
duke@1
|
590 // We begin parsing as if we have just encountered a jump to the
|
|
duke@1
|
591 // method entry.
|
|
duke@1
|
592 Block* entry_block = start_block();
|
|
duke@1
|
593 assert(entry_block->start() == (is_osr_parse() ? osr_bci() : 0), "");
|
|
duke@1
|
594 set_map_clone(entry_map);
|
|
duke@1
|
595 merge_common(entry_block, entry_block->next_path_num());
|
|
duke@1
|
596
|
|
duke@1
|
597 #ifndef PRODUCT
|
|
duke@1
|
598 BytecodeParseHistogram *parse_histogram_obj = new (C->env()->arena()) BytecodeParseHistogram(this, C);
|
|
duke@1
|
599 set_parse_histogram( parse_histogram_obj );
|
|
duke@1
|
600 #endif
|
|
duke@1
|
601
|
|
duke@1
|
602 // Parse all the basic blocks.
|
|
duke@1
|
603 do_all_blocks();
|
|
duke@1
|
604
|
|
duke@1
|
605 C->set_default_node_notes(caller_nn);
|
|
duke@1
|
606
|
|
duke@1
|
607 // Check for bailouts during conversion to graph
|
|
duke@1
|
608 if (failing()) {
|
|
duke@1
|
609 if (log) log->done("parse");
|
|
duke@1
|
610 return;
|
|
duke@1
|
611 }
|
|
duke@1
|
612
|
|
duke@1
|
613 // Fix up all exiting control flow.
|
|
duke@1
|
614 set_map(entry_map);
|
|
duke@1
|
615 do_exits();
|
|
duke@1
|
616
|
|
drchase@24424
|
617 if (log) log->done("parse nodes='%d' live='%d' memory='" SIZE_FORMAT "'",
|
|
bharadwaj@14623
|
618 C->unique(), C->live_nodes(), C->node_arena()->used());
|
|
duke@1
|
619 }
|
|
duke@1
|
620
|
|
duke@1
|
621 //---------------------------do_all_blocks-------------------------------------
|
|
duke@1
|
622 void Parse::do_all_blocks() {
|
|
never@1399
|
623 bool has_irreducible = flow()->has_irreducible_entry();
|
|
duke@1
|
624
|
|
never@1399
|
625 // Walk over all blocks in Reverse Post-Order.
|
|
never@1399
|
626 while (true) {
|
|
never@1399
|
627 bool progress = false;
|
|
never@1399
|
628 for (int rpo = 0; rpo < block_count(); rpo++) {
|
|
never@1399
|
629 Block* block = rpo_at(rpo);
|
|
duke@1
|
630
|
|
never@1399
|
631 if (block->is_parsed()) continue;
|
|
duke@1
|
632
|
|
never@1399
|
633 if (!block->is_merged()) {
|
|
never@1399
|
634 // Dead block, no state reaches this block
|
|
never@1399
|
635 continue;
|
|
never@1399
|
636 }
|
|
duke@1
|
637
|
|
never@1399
|
638 // Prepare to parse this block.
|
|
never@1399
|
639 load_state_from(block);
|
|
duke@1
|
640
|
|
never@1399
|
641 if (stopped()) {
|
|
never@1399
|
642 // Block is dead.
|
|
never@1399
|
643 continue;
|
|
duke@1
|
644 }
|
|
never@1399
|
645
|
|
never@1399
|
646 blocks_parsed++;
|
|
never@1399
|
647
|
|
never@1399
|
648 progress = true;
|
|
never@1399
|
649 if (block->is_loop_head() || block->is_handler() || has_irreducible && !block->is_ready()) {
|
|
never@1399
|
650 // Not all preds have been parsed. We must build phis everywhere.
|
|
never@1399
|
651 // (Note that dead locals do not get phis built, ever.)
|
|
never@1399
|
652 ensure_phis_everywhere();
|
|
never@1399
|
653
|
|
kvn@8732
|
654 if (block->is_SEL_head() &&
|
|
kvn@9446
|
655 (UseLoopPredicate || LoopLimitCheck)) {
|
|
kvn@8732
|
656 // Add predicate to single entry (not irreducible) loop head.
|
|
kvn@8732
|
657 assert(!block->has_merged_backedge(), "only entry paths should be merged for now");
|
|
kvn@8732
|
658 // Need correct bci for predicate.
|
|
kvn@8732
|
659 // It is fine to set it here since do_one_block() will set it anyway.
|
|
kvn@8732
|
660 set_parse_bci(block->start());
|
|
kvn@8732
|
661 add_predicate();
|
|
kvn@8732
|
662 // Add new region for back branches.
|
|
kvn@8732
|
663 int edges = block->pred_count() - block->preds_parsed() + 1; // +1 for original region
|
|
kvn@13895
|
664 RegionNode *r = new (C) RegionNode(edges+1);
|
|
kvn@8732
|
665 _gvn.set_type(r, Type::CONTROL);
|
|
kvn@8732
|
666 record_for_igvn(r);
|
|
kvn@8732
|
667 r->init_req(edges, control());
|
|
kvn@8732
|
668 set_control(r);
|
|
kvn@8732
|
669 // Add new phis.
|
|
kvn@8732
|
670 ensure_phis_everywhere();
|
|
kvn@8732
|
671 }
|
|
kvn@8732
|
672
|
|
never@1399
|
673 // Leave behind an undisturbed copy of the map, for future merges.
|
|
never@1399
|
674 set_map(clone_map());
|
|
never@1399
|
675 }
|
|
never@1399
|
676
|
|
never@1399
|
677 if (control()->is_Region() && !block->is_loop_head() && !has_irreducible && !block->is_handler()) {
|
|
never@1399
|
678 // In the absence of irreducible loops, the Region and Phis
|
|
never@1399
|
679 // associated with a merge that doesn't involve a backedge can
|
|
twisti@2131
|
680 // be simplified now since the RPO parsing order guarantees
|
|
never@1399
|
681 // that any path which was supposed to reach here has already
|
|
never@1399
|
682 // been parsed or must be dead.
|
|
never@1399
|
683 Node* c = control();
|
|
never@1399
|
684 Node* result = _gvn.transform_no_reclaim(control());
|
|
never@1399
|
685 if (c != result && TraceOptoParse) {
|
|
never@1399
|
686 tty->print_cr("Block #%d replace %d with %d", block->rpo(), c->_idx, result->_idx);
|
|
never@1399
|
687 }
|
|
never@1399
|
688 if (result != top()) {
|
|
never@1399
|
689 record_for_igvn(result);
|
|
never@1399
|
690 }
|
|
never@1399
|
691 }
|
|
never@1399
|
692
|
|
never@1399
|
693 // Parse the block.
|
|
never@1399
|
694 do_one_block();
|
|
never@1399
|
695
|
|
never@1399
|
696 // Check for bailouts.
|
|
never@1399
|
697 if (failing()) return;
|
|
never@1399
|
698 }
|
|
never@1399
|
699
|
|
never@1399
|
700 // with irreducible loops multiple passes might be necessary to parse everything
|
|
never@1399
|
701 if (!has_irreducible || !progress) {
|
|
duke@1
|
702 break;
|
|
duke@1
|
703 }
|
|
never@1399
|
704 }
|
|
duke@1
|
705
|
|
never@1399
|
706 blocks_seen += block_count();
|
|
duke@1
|
707
|
|
duke@1
|
708 #ifndef PRODUCT
|
|
duke@1
|
709 // Make sure there are no half-processed blocks remaining.
|
|
duke@1
|
710 // Every remaining unprocessed block is dead and may be ignored now.
|
|
never@1399
|
711 for (int rpo = 0; rpo < block_count(); rpo++) {
|
|
never@1399
|
712 Block* block = rpo_at(rpo);
|
|
duke@1
|
713 if (!block->is_parsed()) {
|
|
duke@1
|
714 if (TraceOptoParse) {
|
|
never@1399
|
715 tty->print_cr("Skipped dead block %d at bci:%d", rpo, block->start());
|
|
duke@1
|
716 }
|
|
never@1399
|
717 assert(!block->is_merged(), "no half-processed blocks");
|
|
duke@1
|
718 }
|
|
duke@1
|
719 }
|
|
duke@1
|
720 #endif
|
|
duke@1
|
721 }
|
|
duke@1
|
722
|
|
duke@1
|
723 //-------------------------------build_exits----------------------------------
|
|
duke@1
|
724 // Build normal and exceptional exit merge points.
|
|
duke@1
|
725 void Parse::build_exits() {
|
|
duke@1
|
726 // make a clone of caller to prevent sharing of side-effects
|
|
duke@1
|
727 _exits.set_map(_exits.clone_map());
|
|
duke@1
|
728 _exits.clean_stack(_exits.sp());
|
|
duke@1
|
729 _exits.sync_jvms();
|
|
duke@1
|
730
|
|
kvn@13895
|
731 RegionNode* region = new (C) RegionNode(1);
|
|
duke@1
|
732 record_for_igvn(region);
|
|
duke@1
|
733 gvn().set_type_bottom(region);
|
|
duke@1
|
734 _exits.set_control(region);
|
|
duke@1
|
735
|
|
duke@1
|
736 // Note: iophi and memphi are not transformed until do_exits.
|
|
kvn@13895
|
737 Node* iophi = new (C) PhiNode(region, Type::ABIO);
|
|
kvn@13895
|
738 Node* memphi = new (C) PhiNode(region, Type::MEMORY, TypePtr::BOTTOM);
|
|
kvn@17383
|
739 gvn().set_type_bottom(iophi);
|
|
kvn@17383
|
740 gvn().set_type_bottom(memphi);
|
|
duke@1
|
741 _exits.set_i_o(iophi);
|
|
duke@1
|
742 _exits.set_all_memory(memphi);
|
|
duke@1
|
743
|
|
duke@1
|
744 // Add a return value to the exit state. (Do not push it yet.)
|
|
duke@1
|
745 if (tf()->range()->cnt() > TypeFunc::Parms) {
|
|
duke@1
|
746 const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms);
|
|
duke@1
|
747 // Don't "bind" an unloaded return klass to the ret_phi. If the klass
|
|
duke@1
|
748 // becomes loaded during the subsequent parsing, the loaded and unloaded
|
|
duke@1
|
749 // types will not join when we transform and push in do_exits().
|
|
duke@1
|
750 const TypeOopPtr* ret_oop_type = ret_type->isa_oopptr();
|
|
duke@1
|
751 if (ret_oop_type && !ret_oop_type->klass()->is_loaded()) {
|
|
duke@1
|
752 ret_type = TypeOopPtr::BOTTOM;
|
|
duke@1
|
753 }
|
|
duke@1
|
754 int ret_size = type2size[ret_type->basic_type()];
|
|
kvn@13895
|
755 Node* ret_phi = new (C) PhiNode(region, ret_type);
|
|
kvn@17383
|
756 gvn().set_type_bottom(ret_phi);
|
|
duke@1
|
757 _exits.ensure_stack(ret_size);
|
|
duke@1
|
758 assert((int)(tf()->range()->cnt() - TypeFunc::Parms) == ret_size, "good tf range");
|
|
duke@1
|
759 assert(method()->return_type()->size() == ret_size, "tf agrees w/ method");
|
|
duke@1
|
760 _exits.set_argument(0, ret_phi); // here is where the parser finds it
|
|
duke@1
|
761 // Note: ret_phi is not yet pushed, until do_exits.
|
|
duke@1
|
762 }
|
|
duke@1
|
763 }
|
|
duke@1
|
764
|
|
duke@1
|
765
|
|
duke@1
|
766 //----------------------------build_start_state-------------------------------
|
|
duke@1
|
767 // Construct a state which contains only the incoming arguments from an
|
|
duke@1
|
768 // unknown caller. The method & bci will be NULL & InvocationEntryBci.
|
|
duke@1
|
769 JVMState* Compile::build_start_state(StartNode* start, const TypeFunc* tf) {
|
|
duke@1
|
770 int arg_size = tf->domain()->cnt();
|
|
duke@1
|
771 int max_size = MAX2(arg_size, (int)tf->range()->cnt());
|
|
duke@1
|
772 JVMState* jvms = new (this) JVMState(max_size - TypeFunc::Parms);
|
|
kvn@13895
|
773 SafePointNode* map = new (this) SafePointNode(max_size, NULL);
|
|
duke@1
|
774 record_for_igvn(map);
|
|
duke@1
|
775 assert(arg_size == TypeFunc::Parms + (is_osr_compilation() ? 1 : method()->arg_size()), "correct arg_size");
|
|
duke@1
|
776 Node_Notes* old_nn = default_node_notes();
|
|
duke@1
|
777 if (old_nn != NULL && has_method()) {
|
|
duke@1
|
778 Node_Notes* entry_nn = old_nn->clone(this);
|
|
duke@1
|
779 JVMState* entry_jvms = new(this) JVMState(method(), old_nn->jvms());
|
|
duke@1
|
780 entry_jvms->set_offsets(0);
|
|
duke@1
|
781 entry_jvms->set_bci(entry_bci());
|
|
duke@1
|
782 entry_nn->set_jvms(entry_jvms);
|
|
duke@1
|
783 set_default_node_notes(entry_nn);
|
|
duke@1
|
784 }
|
|
duke@1
|
785 uint i;
|
|
duke@1
|
786 for (i = 0; i < (uint)arg_size; i++) {
|
|
kvn@13895
|
787 Node* parm = initial_gvn()->transform(new (this) ParmNode(start, i));
|
|
duke@1
|
788 map->init_req(i, parm);
|
|
duke@1
|
789 // Record all these guys for later GVN.
|
|
duke@1
|
790 record_for_igvn(parm);
|
|
duke@1
|
791 }
|
|
duke@1
|
792 for (; i < map->req(); i++) {
|
|
duke@1
|
793 map->init_req(i, top());
|
|
duke@1
|
794 }
|
|
duke@1
|
795 assert(jvms->argoff() == TypeFunc::Parms, "parser gets arguments here");
|
|
duke@1
|
796 set_default_node_notes(old_nn);
|
|
duke@1
|
797 map->set_jvms(jvms);
|
|
duke@1
|
798 jvms->set_map(map);
|
|
duke@1
|
799 return jvms;
|
|
duke@1
|
800 }
|
|
duke@1
|
801
|
|
duke@1
|
802 //-----------------------------make_node_notes---------------------------------
|
|
duke@1
|
803 Node_Notes* Parse::make_node_notes(Node_Notes* caller_nn) {
|
|
duke@1
|
804 if (caller_nn == NULL) return NULL;
|
|
duke@1
|
805 Node_Notes* nn = caller_nn->clone(C);
|
|
duke@1
|
806 JVMState* caller_jvms = nn->jvms();
|
|
duke@1
|
807 JVMState* jvms = new (C) JVMState(method(), caller_jvms);
|
|
duke@1
|
808 jvms->set_offsets(0);
|
|
duke@1
|
809 jvms->set_bci(_entry_bci);
|
|
duke@1
|
810 nn->set_jvms(jvms);
|
|
duke@1
|
811 return nn;
|
|
duke@1
|
812 }
|
|
duke@1
|
813
|
|
duke@1
|
814
|
|
duke@1
|
815 //--------------------------return_values--------------------------------------
|
|
duke@1
|
816 void Compile::return_values(JVMState* jvms) {
|
|
duke@1
|
817 GraphKit kit(jvms);
|
|
kvn@13895
|
818 Node* ret = new (this) ReturnNode(TypeFunc::Parms,
|
|
duke@1
|
819 kit.control(),
|
|
duke@1
|
820 kit.i_o(),
|
|
duke@1
|
821 kit.reset_memory(),
|
|
duke@1
|
822 kit.frameptr(),
|
|
duke@1
|
823 kit.returnadr());
|
|
duke@1
|
824 // Add zero or 1 return values
|
|
duke@1
|
825 int ret_size = tf()->range()->cnt() - TypeFunc::Parms;
|
|
duke@1
|
826 if (ret_size > 0) {
|
|
duke@1
|
827 kit.inc_sp(-ret_size); // pop the return value(s)
|
|
duke@1
|
828 kit.sync_jvms();
|
|
duke@1
|
829 ret->add_req(kit.argument(0));
|
|
duke@1
|
830 // Note: The second dummy edge is not needed by a ReturnNode.
|
|
duke@1
|
831 }
|
|
duke@1
|
832 // bind it to root
|
|
duke@1
|
833 root()->add_req(ret);
|
|
duke@1
|
834 record_for_igvn(ret);
|
|
duke@1
|
835 initial_gvn()->transform_no_reclaim(ret);
|
|
duke@1
|
836 }
|
|
duke@1
|
837
|
|
duke@1
|
838 //------------------------rethrow_exceptions-----------------------------------
|
|
duke@1
|
839 // Bind all exception states in the list into a single RethrowNode.
|
|
duke@1
|
840 void Compile::rethrow_exceptions(JVMState* jvms) {
|
|
duke@1
|
841 GraphKit kit(jvms);
|
|
duke@1
|
842 if (!kit.has_exceptions()) return; // nothing to generate
|
|
duke@1
|
843 // Load my combined exception state into the kit, with all phis transformed:
|
|
duke@1
|
844 SafePointNode* ex_map = kit.combine_and_pop_all_exception_states();
|
|
duke@1
|
845 Node* ex_oop = kit.use_exception_state(ex_map);
|
|
kvn@13895
|
846 RethrowNode* exit = new (this) RethrowNode(kit.control(),
|
|
duke@1
|
847 kit.i_o(), kit.reset_memory(),
|
|
duke@1
|
848 kit.frameptr(), kit.returnadr(),
|
|
duke@1
|
849 // like a return but with exception input
|
|
duke@1
|
850 ex_oop);
|
|
duke@1
|
851 // bind to root
|
|
duke@1
|
852 root()->add_req(exit);
|
|
duke@1
|
853 record_for_igvn(exit);
|
|
duke@1
|
854 initial_gvn()->transform_no_reclaim(exit);
|
|
duke@1
|
855 }
|
|
duke@1
|
856
|
|
duke@1
|
857 //---------------------------do_exceptions-------------------------------------
|
|
duke@1
|
858 // Process exceptions arising from the current bytecode.
|
|
duke@1
|
859 // Send caught exceptions to the proper handler within this method.
|
|
duke@1
|
860 // Unhandled exceptions feed into _exit.
|
|
duke@1
|
861 void Parse::do_exceptions() {
|
|
duke@1
|
862 if (!has_exceptions()) return;
|
|
duke@1
|
863
|
|
duke@1
|
864 if (failing()) {
|
|
duke@1
|
865 // Pop them all off and throw them away.
|
|
duke@1
|
866 while (pop_exception_state() != NULL) ;
|
|
duke@1
|
867 return;
|
|
duke@1
|
868 }
|
|
duke@1
|
869
|
|
duke@1
|
870 PreserveJVMState pjvms(this, false);
|
|
duke@1
|
871
|
|
duke@1
|
872 SafePointNode* ex_map;
|
|
duke@1
|
873 while ((ex_map = pop_exception_state()) != NULL) {
|
|
duke@1
|
874 if (!method()->has_exception_handlers()) {
|
|
duke@1
|
875 // Common case: Transfer control outward.
|
|
duke@1
|
876 // Doing it this early allows the exceptions to common up
|
|
duke@1
|
877 // even between adjacent method calls.
|
|
duke@1
|
878 throw_to_exit(ex_map);
|
|
duke@1
|
879 } else {
|
|
duke@1
|
880 // Have to look at the exception first.
|
|
duke@1
|
881 assert(stopped(), "catch_inline_exceptions trashes the map");
|
|
duke@1
|
882 catch_inline_exceptions(ex_map);
|
|
duke@1
|
883 stop_and_kill_map(); // we used up this exception state; kill it
|
|
duke@1
|
884 }
|
|
duke@1
|
885 }
|
|
duke@1
|
886
|
|
duke@1
|
887 // We now return to our regularly scheduled program:
|
|
duke@1
|
888 }
|
|
duke@1
|
889
|
|
duke@1
|
890 //---------------------------throw_to_exit-------------------------------------
|
|
duke@1
|
891 // Merge the given map into an exception exit from this method.
|
|
duke@1
|
892 // The exception exit will handle any unlocking of receiver.
|
|
duke@1
|
893 // The ex_oop must be saved within the ex_map, unlike merge_exception.
|
|
duke@1
|
894 void Parse::throw_to_exit(SafePointNode* ex_map) {
|
|
duke@1
|
895 // Pop the JVMS to (a copy of) the caller.
|
|
duke@1
|
896 GraphKit caller;
|
|
duke@1
|
897 caller.set_map_clone(_caller->map());
|
|
duke@1
|
898 caller.set_bci(_caller->bci());
|
|
duke@1
|
899 caller.set_sp(_caller->sp());
|
|
duke@1
|
900 // Copy out the standard machine state:
|
|
duke@1
|
901 for (uint i = 0; i < TypeFunc::Parms; i++) {
|
|
duke@1
|
902 caller.map()->set_req(i, ex_map->in(i));
|
|
duke@1
|
903 }
|
|
duke@1
|
904 // ...and the exception:
|
|
duke@1
|
905 Node* ex_oop = saved_ex_oop(ex_map);
|
|
duke@1
|
906 SafePointNode* caller_ex_map = caller.make_exception_state(ex_oop);
|
|
duke@1
|
907 // Finally, collect the new exception state in my exits:
|
|
duke@1
|
908 _exits.add_exception_state(caller_ex_map);
|
|
duke@1
|
909 }
|
|
duke@1
|
910
|
|
duke@1
|
911 //------------------------------do_exits---------------------------------------
|
|
duke@1
|
912 void Parse::do_exits() {
|
|
duke@1
|
913 set_parse_bci(InvocationEntryBci);
|
|
duke@1
|
914
|
|
duke@1
|
915 // Now peephole on the return bits
|
|
duke@1
|
916 Node* region = _exits.control();
|
|
duke@1
|
917 _exits.set_control(gvn().transform(region));
|
|
duke@1
|
918
|
|
duke@1
|
919 Node* iophi = _exits.i_o();
|
|
duke@1
|
920 _exits.set_i_o(gvn().transform(iophi));
|
|
duke@1
|
921
|
|
shade@23190
|
922 // Figure out if we need to emit the trailing barrier. The barrier is only
|
|
shade@23190
|
923 // needed in the constructors, and only in three cases:
|
|
shade@23190
|
924 //
|
|
shade@23190
|
925 // 1. The constructor wrote a final. The effects of all initializations
|
|
shade@23190
|
926 // must be committed to memory before any code after the constructor
|
|
shade@23190
|
927 // publishes the reference to the newly constructed object. Rather
|
|
shade@23190
|
928 // than wait for the publication, we simply block the writes here.
|
|
shade@23190
|
929 // Rather than put a barrier on only those writes which are required
|
|
shade@23190
|
930 // to complete, we force all writes to complete.
|
|
shade@23190
|
931 //
|
|
shade@23190
|
932 // 2. On PPC64, also add MemBarRelease for constructors which write
|
|
shade@23190
|
933 // volatile fields. As support_IRIW_for_not_multiple_copy_atomic_cpu
|
|
shade@23190
|
934 // is set on PPC64, no sync instruction is issued after volatile
|
|
shade@23190
|
935 // stores. We want to guarantee the same behavior as on platforms
|
|
shade@23190
|
936 // with total store order, although this is not required by the Java
|
|
shade@23190
|
937 // memory model. So as with finals, we add a barrier here.
|
|
shade@23190
|
938 //
|
|
shade@23190
|
939 // 3. Experimental VM option is used to force the barrier if any field
|
|
shade@23190
|
940 // was written out in the constructor.
|
|
shade@23190
|
941 //
|
|
shade@23190
|
942 // "All bets are off" unless the first publication occurs after a
|
|
shade@23190
|
943 // normal return from the constructor. We do not attempt to detect
|
|
shade@23190
|
944 // such unusual early publications. But no barrier is needed on
|
|
shade@23190
|
945 // exceptional returns, since they cannot publish normally.
|
|
shade@23190
|
946 //
|
|
shade@23190
|
947 if (method()->is_initializer() &&
|
|
shade@23190
|
948 (wrote_final() ||
|
|
shade@23190
|
949 PPC64_ONLY(wrote_volatile() ||)
|
|
shade@23190
|
950 (AlwaysSafeConstructors && wrote_fields()))) {
|
|
kvn@17383
|
951 _exits.insert_mem_bar(Op_MemBarRelease, alloc_with_final());
|
|
duke@1
|
952 #ifndef PRODUCT
|
|
duke@1
|
953 if (PrintOpto && (Verbose || WizardMode)) {
|
|
duke@1
|
954 method()->print_name();
|
|
duke@1
|
955 tty->print_cr(" writes finals and needs a memory barrier");
|
|
duke@1
|
956 }
|
|
duke@1
|
957 #endif
|
|
duke@1
|
958 }
|
|
duke@1
|
959
|
|
shade@23190
|
960 // Any method can write a @Stable field; insert memory barriers after
|
|
shade@23190
|
961 // those also. If there is a predecessor allocation node, bind the
|
|
shade@23190
|
962 // barrier there.
|
|
shade@23190
|
963 if (wrote_stable()) {
|
|
shade@23190
|
964 _exits.insert_mem_bar(Op_MemBarRelease, alloc_with_final());
|
|
shade@23190
|
965 #ifndef PRODUCT
|
|
shade@23190
|
966 if (PrintOpto && (Verbose || WizardMode)) {
|
|
shade@23190
|
967 method()->print_name();
|
|
shade@23190
|
968 tty->print_cr(" writes @Stable and needs a memory barrier");
|
|
shade@23190
|
969 }
|
|
shade@23190
|
970 #endif
|
|
shade@23190
|
971 }
|
|
shade@23190
|
972
|
|
duke@1
|
973 for (MergeMemStream mms(_exits.merged_memory()); mms.next_non_empty(); ) {
|
|
duke@1
|
974 // transform each slice of the original memphi:
|
|
duke@1
|
975 mms.set_memory(_gvn.transform(mms.memory()));
|
|
duke@1
|
976 }
|
|
duke@1
|
977
|
|
duke@1
|
978 if (tf()->range()->cnt() > TypeFunc::Parms) {
|
|
duke@1
|
979 const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms);
|
|
duke@1
|
980 Node* ret_phi = _gvn.transform( _exits.argument(0) );
|
|
duke@1
|
981 assert(_exits.control()->is_top() || !_gvn.type(ret_phi)->empty(), "return value must be well defined");
|
|
duke@1
|
982 _exits.push_node(ret_type->basic_type(), ret_phi);
|
|
duke@1
|
983 }
|
|
duke@1
|
984
|
|
duke@1
|
985 // Note: Logic for creating and optimizing the ReturnNode is in Compile.
|
|
duke@1
|
986
|
|
duke@1
|
987 // Unlock along the exceptional paths.
|
|
duke@1
|
988 // This is done late so that we can common up equivalent exceptions
|
|
duke@1
|
989 // (e.g., null checks) arising from multiple points within this method.
|
|
duke@1
|
990 // See GraphKit::add_exception_state, which performs the commoning.
|
|
duke@1
|
991 bool do_synch = method()->is_synchronized() && GenerateSynchronizationCode;
|
|
duke@1
|
992
|
|
duke@1
|
993 // record exit from a method if compiled while Dtrace is turned on.
|
|
kvn@2867
|
994 if (do_synch || C->env()->dtrace_method_probes()) {
|
|
duke@1
|
995 // First move the exception list out of _exits:
|
|
duke@1
|
996 GraphKit kit(_exits.transfer_exceptions_into_jvms());
|
|
duke@1
|
997 SafePointNode* normal_map = kit.map(); // keep this guy safe
|
|
duke@1
|
998 // Now re-collect the exceptions into _exits:
|
|
duke@1
|
999 SafePointNode* ex_map;
|
|
duke@1
|
1000 while ((ex_map = kit.pop_exception_state()) != NULL) {
|
|
duke@1
|
1001 Node* ex_oop = kit.use_exception_state(ex_map);
|
|
duke@1
|
1002 // Force the exiting JVM state to have this method at InvocationEntryBci.
|
|
duke@1
|
1003 // The exiting JVM state is otherwise a copy of the calling JVMS.
|
|
duke@1
|
1004 JVMState* caller = kit.jvms();
|
|
duke@1
|
1005 JVMState* ex_jvms = caller->clone_shallow(C);
|
|
duke@1
|
1006 ex_jvms->set_map(kit.clone_map());
|
|
duke@1
|
1007 ex_jvms->map()->set_jvms(ex_jvms);
|
|
duke@1
|
1008 ex_jvms->set_bci( InvocationEntryBci);
|
|
duke@1
|
1009 kit.set_jvms(ex_jvms);
|
|
duke@1
|
1010 if (do_synch) {
|
|
duke@1
|
1011 // Add on the synchronized-method box/object combo
|
|
duke@1
|
1012 kit.map()->push_monitor(_synch_lock);
|
|
duke@1
|
1013 // Unlock!
|
|
duke@1
|
1014 kit.shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node());
|
|
duke@1
|
1015 }
|
|
kvn@2867
|
1016 if (C->env()->dtrace_method_probes()) {
|
|
duke@1
|
1017 kit.make_dtrace_method_exit(method());
|
|
duke@1
|
1018 }
|
|
duke@1
|
1019 // Done with exception-path processing.
|
|
duke@1
|
1020 ex_map = kit.make_exception_state(ex_oop);
|
|
duke@1
|
1021 assert(ex_jvms->same_calls_as(ex_map->jvms()), "sanity");
|
|
duke@1
|
1022 // Pop the last vestige of this method:
|
|
duke@1
|
1023 ex_map->set_jvms(caller->clone_shallow(C));
|
|
duke@1
|
1024 ex_map->jvms()->set_map(ex_map);
|
|
duke@1
|
1025 _exits.push_exception_state(ex_map);
|
|
duke@1
|
1026 }
|
|
duke@1
|
1027 assert(_exits.map() == normal_map, "keep the same return state");
|
|
duke@1
|
1028 }
|
|
duke@1
|
1029
|
|
duke@1
|
1030 {
|
|
duke@1
|
1031 // Capture very early exceptions (receiver null checks) from caller JVMS
|
|
duke@1
|
1032 GraphKit caller(_caller);
|
|
duke@1
|
1033 SafePointNode* ex_map;
|
|
duke@1
|
1034 while ((ex_map = caller.pop_exception_state()) != NULL) {
|
|
duke@1
|
1035 _exits.add_exception_state(ex_map);
|
|
duke@1
|
1036 }
|
|
duke@1
|
1037 }
|
|
duke@1
|
1038 }
|
|
duke@1
|
1039
|
|
duke@1
|
1040 //-----------------------------create_entry_map-------------------------------
|
|
duke@1
|
1041 // Initialize our parser map to contain the types at method entry.
|
|
duke@1
|
1042 // For OSR, the map contains a single RawPtr parameter.
|
|
duke@1
|
1043 // Initial monitor locking for sync. methods is performed by do_method_entry.
|
|
duke@1
|
1044 SafePointNode* Parse::create_entry_map() {
|
|
duke@1
|
1045 // Check for really stupid bail-out cases.
|
|
duke@1
|
1046 uint len = TypeFunc::Parms + method()->max_locals() + method()->max_stack();
|
|
duke@1
|
1047 if (len >= 32760) {
|
|
duke@1
|
1048 C->record_method_not_compilable_all_tiers("too many local variables");
|
|
duke@1
|
1049 return NULL;
|
|
duke@1
|
1050 }
|
|
duke@1
|
1051
|
|
duke@1
|
1052 // If this is an inlined method, we may have to do a receiver null check.
|
|
duke@1
|
1053 if (_caller->has_method() && is_normal_parse() && !method()->is_static()) {
|
|
duke@1
|
1054 GraphKit kit(_caller);
|
|
twisti@14621
|
1055 kit.null_check_receiver_before_call(method());
|
|
duke@1
|
1056 _caller = kit.transfer_exceptions_into_jvms();
|
|
duke@1
|
1057 if (kit.stopped()) {
|
|
duke@1
|
1058 _exits.add_exception_states_from(_caller);
|
|
duke@1
|
1059 _exits.set_jvms(_caller);
|
|
duke@1
|
1060 return NULL;
|
|
duke@1
|
1061 }
|
|
duke@1
|
1062 }
|
|
duke@1
|
1063
|
|
duke@1
|
1064 assert(method() != NULL, "parser must have a method");
|
|
duke@1
|
1065
|
|
duke@1
|
1066 // Create an initial safepoint to hold JVM state during parsing
|
|
duke@1
|
1067 JVMState* jvms = new (C) JVMState(method(), _caller->has_method() ? _caller : NULL);
|
|
kvn@13895
|
1068 set_map(new (C) SafePointNode(len, jvms));
|
|
duke@1
|
1069 jvms->set_map(map());
|
|
duke@1
|
1070 record_for_igvn(map());
|
|
duke@1
|
1071 assert(jvms->endoff() == len, "correct jvms sizing");
|
|
duke@1
|
1072
|
|
duke@1
|
1073 SafePointNode* inmap = _caller->map();
|
|
duke@1
|
1074 assert(inmap != NULL, "must have inmap");
|
|
duke@1
|
1075
|
|
duke@1
|
1076 uint i;
|
|
duke@1
|
1077
|
|
duke@1
|
1078 // Pass thru the predefined input parameters.
|
|
duke@1
|
1079 for (i = 0; i < TypeFunc::Parms; i++) {
|
|
duke@1
|
1080 map()->init_req(i, inmap->in(i));
|
|
duke@1
|
1081 }
|
|
duke@1
|
1082
|
|
duke@1
|
1083 if (depth() == 1) {
|
|
duke@1
|
1084 assert(map()->memory()->Opcode() == Op_Parm, "");
|
|
duke@1
|
1085 // Insert the memory aliasing node
|
|
duke@1
|
1086 set_all_memory(reset_memory());
|
|
duke@1
|
1087 }
|
|
duke@1
|
1088 assert(merged_memory(), "");
|
|
duke@1
|
1089
|
|
duke@1
|
1090 // Now add the locals which are initially bound to arguments:
|
|
duke@1
|
1091 uint arg_size = tf()->domain()->cnt();
|
|
duke@1
|
1092 ensure_stack(arg_size - TypeFunc::Parms); // OSR methods have funny args
|
|
duke@1
|
1093 for (i = TypeFunc::Parms; i < arg_size; i++) {
|
|
duke@1
|
1094 map()->init_req(i, inmap->argument(_caller, i - TypeFunc::Parms));
|
|
duke@1
|
1095 }
|
|
duke@1
|
1096
|
|
duke@1
|
1097 // Clear out the rest of the map (locals and stack)
|
|
duke@1
|
1098 for (i = arg_size; i < len; i++) {
|
|
duke@1
|
1099 map()->init_req(i, top());
|
|
duke@1
|
1100 }
|
|
duke@1
|
1101
|
|
duke@1
|
1102 SafePointNode* entry_map = stop();
|
|
duke@1
|
1103 return entry_map;
|
|
duke@1
|
1104 }
|
|
duke@1
|
1105
|
|
duke@1
|
1106 //-----------------------------do_method_entry--------------------------------
|
|
duke@1
|
1107 // Emit any code needed in the pseudo-block before BCI zero.
|
|
duke@1
|
1108 // The main thing to do is lock the receiver of a synchronized method.
|
|
duke@1
|
1109 void Parse::do_method_entry() {
|
|
duke@1
|
1110 set_parse_bci(InvocationEntryBci); // Pseudo-BCP
|
|
duke@1
|
1111 set_sp(0); // Java Stack Pointer
|
|
duke@1
|
1112
|
|
duke@1
|
1113 NOT_PRODUCT( count_compiled_calls(true/*at_method_entry*/, false/*is_inline*/); )
|
|
duke@1
|
1114
|
|
kvn@2867
|
1115 if (C->env()->dtrace_method_probes()) {
|
|
duke@1
|
1116 make_dtrace_method_entry(method());
|
|
duke@1
|
1117 }
|
|
duke@1
|
1118
|
|
duke@1
|
1119 // If the method is synchronized, we need to construct a lock node, attach
|
|
duke@1
|
1120 // it to the Start node, and pin it there.
|
|
duke@1
|
1121 if (method()->is_synchronized()) {
|
|
duke@1
|
1122 // Insert a FastLockNode right after the Start which takes as arguments
|
|
duke@1
|
1123 // the current thread pointer, the "this" pointer & the address of the
|
|
duke@1
|
1124 // stack slot pair used for the lock. The "this" pointer is a projection
|
|
duke@1
|
1125 // off the start node, but the locking spot has to be constructed by
|
|
duke@1
|
1126 // creating a ConLNode of 0, and boxing it with a BoxLockNode. The BoxLockNode
|
|
duke@1
|
1127 // becomes the second argument to the FastLockNode call. The
|
|
duke@1
|
1128 // FastLockNode becomes the new control parent to pin it to the start.
|
|
duke@1
|
1129
|
|
duke@1
|
1130 // Setup Object Pointer
|
|
duke@1
|
1131 Node *lock_obj = NULL;
|
|
duke@1
|
1132 if(method()->is_static()) {
|
|
duke@1
|
1133 ciInstance* mirror = _method->holder()->java_mirror();
|
|
duke@1
|
1134 const TypeInstPtr *t_lock = TypeInstPtr::make(mirror);
|
|
duke@1
|
1135 lock_obj = makecon(t_lock);
|
|
duke@1
|
1136 } else { // Else pass the "this" pointer,
|
|
duke@1
|
1137 lock_obj = local(0); // which is Parm0 from StartNode
|
|
duke@1
|
1138 }
|
|
duke@1
|
1139 // Clear out dead values from the debug info.
|
|
duke@1
|
1140 kill_dead_locals();
|
|
duke@1
|
1141 // Build the FastLockNode
|
|
duke@1
|
1142 _synch_lock = shared_lock(lock_obj);
|
|
duke@1
|
1143 }
|
|
duke@1
|
1144
|
|
roland@21099
|
1145 // Feed profiling data for parameters to the type system so it can
|
|
roland@21099
|
1146 // propagate it as speculative types
|
|
roland@21099
|
1147 record_profiled_parameters_for_speculation();
|
|
roland@21099
|
1148
|
|
duke@1
|
1149 if (depth() == 1) {
|
|
duke@1
|
1150 increment_and_test_invocation_counter(Tier2CompileThreshold);
|
|
duke@1
|
1151 }
|
|
duke@1
|
1152 }
|
|
duke@1
|
1153
|
|
duke@1
|
1154 //------------------------------init_blocks------------------------------------
|
|
duke@1
|
1155 // Initialize our parser map to contain the types/monitors at method entry.
|
|
duke@1
|
1156 void Parse::init_blocks() {
|
|
duke@1
|
1157 // Create the blocks.
|
|
duke@1
|
1158 _block_count = flow()->block_count();
|
|
duke@1
|
1159 _blocks = NEW_RESOURCE_ARRAY(Block, _block_count);
|
|
duke@1
|
1160 Copy::zero_to_bytes(_blocks, sizeof(Block)*_block_count);
|
|
duke@1
|
1161
|
|
never@1399
|
1162 int rpo;
|
|
duke@1
|
1163
|
|
duke@1
|
1164 // Initialize the structs.
|
|
never@1399
|
1165 for (rpo = 0; rpo < block_count(); rpo++) {
|
|
never@1399
|
1166 Block* block = rpo_at(rpo);
|
|
never@1399
|
1167 block->init_node(this, rpo);
|
|
duke@1
|
1168 }
|
|
duke@1
|
1169
|
|
duke@1
|
1170 // Collect predecessor and successor information.
|
|
never@1399
|
1171 for (rpo = 0; rpo < block_count(); rpo++) {
|
|
never@1399
|
1172 Block* block = rpo_at(rpo);
|
|
duke@1
|
1173 block->init_graph(this);
|
|
duke@1
|
1174 }
|
|
duke@1
|
1175 }
|
|
duke@1
|
1176
|
|
duke@1
|
1177 //-------------------------------init_node-------------------------------------
|
|
never@1399
|
1178 void Parse::Block::init_node(Parse* outer, int rpo) {
|
|
never@1399
|
1179 _flow = outer->flow()->rpo_at(rpo);
|
|
duke@1
|
1180 _pred_count = 0;
|
|
duke@1
|
1181 _preds_parsed = 0;
|
|
duke@1
|
1182 _count = 0;
|
|
duke@1
|
1183 assert(pred_count() == 0 && preds_parsed() == 0, "sanity");
|
|
kvn@8732
|
1184 assert(!(is_merged() || is_parsed() || is_handler() || has_merged_backedge()), "sanity");
|
|
duke@1
|
1185 assert(_live_locals.size() == 0, "sanity");
|
|
duke@1
|
1186
|
|
duke@1
|
1187 // entry point has additional predecessor
|
|
duke@1
|
1188 if (flow()->is_start()) _pred_count++;
|
|
duke@1
|
1189 assert(flow()->is_start() == (this == outer->start_block()), "");
|
|
duke@1
|
1190 }
|
|
duke@1
|
1191
|
|
duke@1
|
1192 //-------------------------------init_graph------------------------------------
|
|
duke@1
|
1193 void Parse::Block::init_graph(Parse* outer) {
|
|
duke@1
|
1194 // Create the successor list for this parser block.
|
|
duke@1
|
1195 GrowableArray<ciTypeFlow::Block*>* tfs = flow()->successors();
|
|
duke@1
|
1196 GrowableArray<ciTypeFlow::Block*>* tfe = flow()->exceptions();
|
|
duke@1
|
1197 int ns = tfs->length();
|
|
duke@1
|
1198 int ne = tfe->length();
|
|
duke@1
|
1199 _num_successors = ns;
|
|
duke@1
|
1200 _all_successors = ns+ne;
|
|
duke@1
|
1201 _successors = (ns+ne == 0) ? NULL : NEW_RESOURCE_ARRAY(Block*, ns+ne);
|
|
duke@1
|
1202 int p = 0;
|
|
duke@1
|
1203 for (int i = 0; i < ns+ne; i++) {
|
|
duke@1
|
1204 ciTypeFlow::Block* tf2 = (i < ns) ? tfs->at(i) : tfe->at(i-ns);
|
|
never@1399
|
1205 Block* block2 = outer->rpo_at(tf2->rpo());
|
|
duke@1
|
1206 _successors[i] = block2;
|
|
duke@1
|
1207
|
|
duke@1
|
1208 // Accumulate pred info for the other block, too.
|
|
duke@1
|
1209 if (i < ns) {
|
|
duke@1
|
1210 block2->_pred_count++;
|
|
duke@1
|
1211 } else {
|
|
duke@1
|
1212 block2->_is_handler = true;
|
|
duke@1
|
1213 }
|
|
duke@1
|
1214
|
|
duke@1
|
1215 #ifdef ASSERT
|
|
duke@1
|
1216 // A block's successors must be distinguishable by BCI.
|
|
duke@1
|
1217 // That is, no bytecode is allowed to branch to two different
|
|
duke@1
|
1218 // clones of the same code location.
|
|
duke@1
|
1219 for (int j = 0; j < i; j++) {
|
|
duke@1
|
1220 Block* block1 = _successors[j];
|
|
duke@1
|
1221 if (block1 == block2) continue; // duplicates are OK
|
|
duke@1
|
1222 assert(block1->start() != block2->start(), "successors have unique bcis");
|
|
duke@1
|
1223 }
|
|
duke@1
|
1224 #endif
|
|
duke@1
|
1225 }
|
|
duke@1
|
1226
|
|
duke@1
|
1227 // Note: We never call next_path_num along exception paths, so they
|
|
duke@1
|
1228 // never get processed as "ready". Also, the input phis of exception
|
|
duke@1
|
1229 // handlers get specially processed, so that
|
|
duke@1
|
1230 }
|
|
duke@1
|
1231
|
|
duke@1
|
1232 //---------------------------successor_for_bci---------------------------------
|
|
duke@1
|
1233 Parse::Block* Parse::Block::successor_for_bci(int bci) {
|
|
duke@1
|
1234 for (int i = 0; i < all_successors(); i++) {
|
|
duke@1
|
1235 Block* block2 = successor_at(i);
|
|
duke@1
|
1236 if (block2->start() == bci) return block2;
|
|
duke@1
|
1237 }
|
|
duke@1
|
1238 // We can actually reach here if ciTypeFlow traps out a block
|
|
duke@1
|
1239 // due to an unloaded class, and concurrently with compilation the
|
|
duke@1
|
1240 // class is then loaded, so that a later phase of the parser is
|
|
duke@1
|
1241 // able to see more of the bytecode CFG. Or, the flow pass and
|
|
duke@1
|
1242 // the parser can have a minor difference of opinion about executability
|
|
duke@1
|
1243 // of bytecodes. For example, "obj.field = null" is executable even
|
|
duke@1
|
1244 // if the field's type is an unloaded class; the flow pass used to
|
|
duke@1
|
1245 // make a trap for such code.
|
|
duke@1
|
1246 return NULL;
|
|
duke@1
|
1247 }
|
|
duke@1
|
1248
|
|
duke@1
|
1249
|
|
duke@1
|
1250 //-----------------------------stack_type_at-----------------------------------
|
|
duke@1
|
1251 const Type* Parse::Block::stack_type_at(int i) const {
|
|
duke@1
|
1252 return get_type(flow()->stack_type_at(i));
|
|
duke@1
|
1253 }
|
|
duke@1
|
1254
|
|
duke@1
|
1255
|
|
duke@1
|
1256 //-----------------------------local_type_at-----------------------------------
|
|
duke@1
|
1257 const Type* Parse::Block::local_type_at(int i) const {
|
|
duke@1
|
1258 // Make dead locals fall to bottom.
|
|
duke@1
|
1259 if (_live_locals.size() == 0) {
|
|
duke@1
|
1260 MethodLivenessResult live_locals = flow()->outer()->method()->liveness_at_bci(start());
|
|
duke@1
|
1261 // This bitmap can be zero length if we saw a breakpoint.
|
|
duke@1
|
1262 // In such cases, pretend they are all live.
|
|
duke@1
|
1263 ((Block*)this)->_live_locals = live_locals;
|
|
duke@1
|
1264 }
|
|
duke@1
|
1265 if (_live_locals.size() > 0 && !_live_locals.at(i))
|
|
duke@1
|
1266 return Type::BOTTOM;
|
|
duke@1
|
1267
|
|
duke@1
|
1268 return get_type(flow()->local_type_at(i));
|
|
duke@1
|
1269 }
|
|
duke@1
|
1270
|
|
duke@1
|
1271
|
|
duke@1
|
1272 #ifndef PRODUCT
|
|
duke@1
|
1273
|
|
duke@1
|
1274 //----------------------------name_for_bc--------------------------------------
|
|
duke@1
|
1275 // helper method for BytecodeParseHistogram
|
|
duke@1
|
1276 static const char* name_for_bc(int i) {
|
|
duke@1
|
1277 return Bytecodes::is_defined(i) ? Bytecodes::name(Bytecodes::cast(i)) : "xxxunusedxxx";
|
|
duke@1
|
1278 }
|
|
duke@1
|
1279
|
|
duke@1
|
1280 //----------------------------BytecodeParseHistogram------------------------------------
|
|
duke@1
|
1281 Parse::BytecodeParseHistogram::BytecodeParseHistogram(Parse *p, Compile *c) {
|
|
duke@1
|
1282 _parser = p;
|
|
duke@1
|
1283 _compiler = c;
|
|
duke@1
|
1284 if( ! _initialized ) { _initialized = true; reset(); }
|
|
duke@1
|
1285 }
|
|
duke@1
|
1286
|
|
duke@1
|
1287 //----------------------------current_count------------------------------------
|
|
duke@1
|
1288 int Parse::BytecodeParseHistogram::current_count(BPHType bph_type) {
|
|
duke@1
|
1289 switch( bph_type ) {
|
|
duke@1
|
1290 case BPH_transforms: { return _parser->gvn().made_progress(); }
|
|
duke@1
|
1291 case BPH_values: { return _parser->gvn().made_new_values(); }
|
|
duke@1
|
1292 default: { ShouldNotReachHere(); return 0; }
|
|
duke@1
|
1293 }
|
|
duke@1
|
1294 }
|
|
duke@1
|
1295
|
|
duke@1
|
1296 //----------------------------initialized--------------------------------------
|
|
duke@1
|
1297 bool Parse::BytecodeParseHistogram::initialized() { return _initialized; }
|
|
duke@1
|
1298
|
|
duke@1
|
1299 //----------------------------reset--------------------------------------------
|
|
duke@1
|
1300 void Parse::BytecodeParseHistogram::reset() {
|
|
duke@1
|
1301 int i = Bytecodes::number_of_codes;
|
|
duke@1
|
1302 while (i-- > 0) { _bytecodes_parsed[i] = 0; _nodes_constructed[i] = 0; _nodes_transformed[i] = 0; _new_values[i] = 0; }
|
|
duke@1
|
1303 }
|
|
duke@1
|
1304
|
|
duke@1
|
1305 //----------------------------set_initial_state--------------------------------
|
|
duke@1
|
1306 // Record info when starting to parse one bytecode
|
|
duke@1
|
1307 void Parse::BytecodeParseHistogram::set_initial_state( Bytecodes::Code bc ) {
|
|
duke@1
|
1308 if( PrintParseStatistics && !_parser->is_osr_parse() ) {
|
|
duke@1
|
1309 _initial_bytecode = bc;
|
|
duke@1
|
1310 _initial_node_count = _compiler->unique();
|
|
duke@1
|
1311 _initial_transforms = current_count(BPH_transforms);
|
|
duke@1
|
1312 _initial_values = current_count(BPH_values);
|
|
duke@1
|
1313 }
|
|
duke@1
|
1314 }
|
|
duke@1
|
1315
|
|
duke@1
|
1316 //----------------------------record_change--------------------------------
|
|
duke@1
|
1317 // Record results of parsing one bytecode
|
|
duke@1
|
1318 void Parse::BytecodeParseHistogram::record_change() {
|
|
duke@1
|
1319 if( PrintParseStatistics && !_parser->is_osr_parse() ) {
|
|
duke@1
|
1320 ++_bytecodes_parsed[_initial_bytecode];
|
|
duke@1
|
1321 _nodes_constructed [_initial_bytecode] += (_compiler->unique() - _initial_node_count);
|
|
duke@1
|
1322 _nodes_transformed [_initial_bytecode] += (current_count(BPH_transforms) - _initial_transforms);
|
|
duke@1
|
1323 _new_values [_initial_bytecode] += (current_count(BPH_values) - _initial_values);
|
|
duke@1
|
1324 }
|
|
duke@1
|
1325 }
|
|
duke@1
|
1326
|
|
duke@1
|
1327
|
|
duke@1
|
1328 //----------------------------print--------------------------------------------
|
|
duke@1
|
1329 void Parse::BytecodeParseHistogram::print(float cutoff) {
|
|
duke@1
|
1330 ResourceMark rm;
|
|
duke@1
|
1331 // print profile
|
|
duke@1
|
1332 int total = 0;
|
|
duke@1
|
1333 int i = 0;
|
|
duke@1
|
1334 for( i = 0; i < Bytecodes::number_of_codes; ++i ) { total += _bytecodes_parsed[i]; }
|
|
duke@1
|
1335 int abs_sum = 0;
|
|
duke@1
|
1336 tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789
|
|
duke@1
|
1337 tty->print_cr("Histogram of %d parsed bytecodes:", total);
|
|
duke@1
|
1338 if( total == 0 ) { return; }
|
|
duke@1
|
1339 tty->cr();
|
|
duke@1
|
1340 tty->print_cr("absolute: count of compiled bytecodes of this type");
|
|
duke@1
|
1341 tty->print_cr("relative: percentage contribution to compiled nodes");
|
|
duke@1
|
1342 tty->print_cr("nodes : Average number of nodes constructed per bytecode");
|
|
duke@1
|
1343 tty->print_cr("rnodes : Significance towards total nodes constructed, (nodes*relative)");
|
|
duke@1
|
1344 tty->print_cr("transforms: Average amount of tranform progress per bytecode compiled");
|
|
duke@1
|
1345 tty->print_cr("values : Average number of node values improved per bytecode");
|
|
duke@1
|
1346 tty->print_cr("name : Bytecode name");
|
|
duke@1
|
1347 tty->cr();
|
|
duke@1
|
1348 tty->print_cr(" absolute relative nodes rnodes transforms values name");
|
|
duke@1
|
1349 tty->print_cr("----------------------------------------------------------------------");
|
|
duke@1
|
1350 while (--i > 0) {
|
|
duke@1
|
1351 int abs = _bytecodes_parsed[i];
|
|
duke@1
|
1352 float rel = abs * 100.0F / total;
|
|
duke@1
|
1353 float nodes = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_constructed[i])/_bytecodes_parsed[i];
|
|
duke@1
|
1354 float rnodes = _bytecodes_parsed[i] == 0 ? 0 : rel * nodes;
|
|
duke@1
|
1355 float xforms = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_transformed[i])/_bytecodes_parsed[i];
|
|
duke@1
|
1356 float values = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _new_values [i])/_bytecodes_parsed[i];
|
|
duke@1
|
1357 if (cutoff <= rel) {
|
|
duke@1
|
1358 tty->print_cr("%10d %7.2f%% %6.1f %6.2f %6.1f %6.1f %s", abs, rel, nodes, rnodes, xforms, values, name_for_bc(i));
|
|
duke@1
|
1359 abs_sum += abs;
|
|
duke@1
|
1360 }
|
|
duke@1
|
1361 }
|
|
duke@1
|
1362 tty->print_cr("----------------------------------------------------------------------");
|
|
duke@1
|
1363 float rel_sum = abs_sum * 100.0F / total;
|
|
duke@1
|
1364 tty->print_cr("%10d %7.2f%% (cutoff = %.2f%%)", abs_sum, rel_sum, cutoff);
|
|
duke@1
|
1365 tty->print_cr("----------------------------------------------------------------------");
|
|
duke@1
|
1366 tty->cr();
|
|
duke@1
|
1367 }
|
|
duke@1
|
1368 #endif
|
|
duke@1
|
1369
|
|
duke@1
|
1370 //----------------------------load_state_from----------------------------------
|
|
duke@1
|
1371 // Load block/map/sp. But not do not touch iter/bci.
|
|
duke@1
|
1372 void Parse::load_state_from(Block* block) {
|
|
duke@1
|
1373 set_block(block);
|
|
duke@1
|
1374 // load the block's JVM state:
|
|
duke@1
|
1375 set_map(block->start_map());
|
|
duke@1
|
1376 set_sp( block->start_sp());
|
|
duke@1
|
1377 }
|
|
duke@1
|
1378
|
|
duke@1
|
1379
|
|
duke@1
|
1380 //-----------------------------record_state------------------------------------
|
|
duke@1
|
1381 void Parse::Block::record_state(Parse* p) {
|
|
duke@1
|
1382 assert(!is_merged(), "can only record state once, on 1st inflow");
|
|
duke@1
|
1383 assert(start_sp() == p->sp(), "stack pointer must agree with ciTypeFlow");
|
|
duke@1
|
1384 set_start_map(p->stop());
|
|
duke@1
|
1385 }
|
|
duke@1
|
1386
|
|
duke@1
|
1387
|
|
duke@1
|
1388 //------------------------------do_one_block-----------------------------------
|
|
duke@1
|
1389 void Parse::do_one_block() {
|
|
duke@1
|
1390 if (TraceOptoParse) {
|
|
duke@1
|
1391 Block *b = block();
|
|
duke@1
|
1392 int ns = b->num_successors();
|
|
duke@1
|
1393 int nt = b->all_successors();
|
|
duke@1
|
1394
|
|
duke@1
|
1395 tty->print("Parsing block #%d at bci [%d,%d), successors: ",
|
|
never@1399
|
1396 block()->rpo(), block()->start(), block()->limit());
|
|
duke@1
|
1397 for (int i = 0; i < nt; i++) {
|
|
never@1399
|
1398 tty->print((( i < ns) ? " %d" : " %d(e)"), b->successor_at(i)->rpo());
|
|
duke@1
|
1399 }
|
|
never@1399
|
1400 if (b->is_loop_head()) tty->print(" lphd");
|
|
drchase@24424
|
1401 tty->cr();
|
|
duke@1
|
1402 }
|
|
duke@1
|
1403
|
|
duke@1
|
1404 assert(block()->is_merged(), "must be merged before being parsed");
|
|
duke@1
|
1405 block()->mark_parsed();
|
|
duke@1
|
1406 ++_blocks_parsed;
|
|
duke@1
|
1407
|
|
duke@1
|
1408 // Set iterator to start of block.
|
|
duke@1
|
1409 iter().reset_to_bci(block()->start());
|
|
duke@1
|
1410
|
|
duke@1
|
1411 CompileLog* log = C->log();
|
|
duke@1
|
1412
|
|
duke@1
|
1413 // Parse bytecodes
|
|
duke@1
|
1414 while (!stopped() && !failing()) {
|
|
duke@1
|
1415 iter().next();
|
|
duke@1
|
1416
|
|
duke@1
|
1417 // Learn the current bci from the iterator:
|
|
duke@1
|
1418 set_parse_bci(iter().cur_bci());
|
|
duke@1
|
1419
|
|
duke@1
|
1420 if (bci() == block()->limit()) {
|
|
duke@1
|
1421 // Do not walk into the next block until directed by do_all_blocks.
|
|
duke@1
|
1422 merge(bci());
|
|
duke@1
|
1423 break;
|
|
duke@1
|
1424 }
|
|
duke@1
|
1425 assert(bci() < block()->limit(), "bci still in block");
|
|
duke@1
|
1426
|
|
duke@1
|
1427 if (log != NULL) {
|
|
duke@1
|
1428 // Output an optional context marker, to help place actions
|
|
duke@1
|
1429 // that occur during parsing of this BC. If there is no log
|
|
duke@1
|
1430 // output until the next context string, this context string
|
|
duke@1
|
1431 // will be silently ignored.
|
|
vlivanov@13964
|
1432 log->set_context("bc code='%d' bci='%d'", (int)bc(), bci());
|
|
duke@1
|
1433 }
|
|
duke@1
|
1434
|
|
duke@1
|
1435 if (block()->has_trap_at(bci())) {
|
|
duke@1
|
1436 // We must respect the flow pass's traps, because it will refuse
|
|
duke@1
|
1437 // to produce successors for trapping blocks.
|
|
duke@1
|
1438 int trap_index = block()->flow()->trap_index();
|
|
duke@1
|
1439 assert(trap_index != 0, "trap index must be valid");
|
|
duke@1
|
1440 uncommon_trap(trap_index);
|
|
duke@1
|
1441 break;
|
|
duke@1
|
1442 }
|
|
duke@1
|
1443
|
|
duke@1
|
1444 NOT_PRODUCT( parse_histogram()->set_initial_state(bc()); );
|
|
duke@1
|
1445
|
|
duke@1
|
1446 #ifdef ASSERT
|
|
duke@1
|
1447 int pre_bc_sp = sp();
|
|
duke@1
|
1448 int inputs, depth;
|
|
twisti@14621
|
1449 bool have_se = !stopped() && compute_stack_effects(inputs, depth);
|
|
kvn@13393
|
1450 assert(!have_se || pre_bc_sp >= inputs, err_msg_res("have enough stack to execute this BC: pre_bc_sp=%d, inputs=%d", pre_bc_sp, inputs));
|
|
duke@1
|
1451 #endif //ASSERT
|
|
duke@1
|
1452
|
|
duke@1
|
1453 do_one_bytecode();
|
|
duke@1
|
1454
|
|
twisti@15118
|
1455 assert(!have_se || stopped() || failing() || (sp() - pre_bc_sp) == depth,
|
|
twisti@15118
|
1456 err_msg_res("incorrect depth prediction: sp=%d, pre_bc_sp=%d, depth=%d", sp(), pre_bc_sp, depth));
|
|
duke@1
|
1457
|
|
duke@1
|
1458 do_exceptions();
|
|
duke@1
|
1459
|
|
duke@1
|
1460 NOT_PRODUCT( parse_histogram()->record_change(); );
|
|
duke@1
|
1461
|
|
vlivanov@13964
|
1462 if (log != NULL)
|
|
vlivanov@13964
|
1463 log->clear_context(); // skip marker if nothing was printed
|
|
duke@1
|
1464
|
|
duke@1
|
1465 // Fall into next bytecode. Each bytecode normally has 1 sequential
|
|
duke@1
|
1466 // successor which is typically made ready by visiting this bytecode.
|
|
duke@1
|
1467 // If the successor has several predecessors, then it is a merge
|
|
duke@1
|
1468 // point, starts a new basic block, and is handled like other basic blocks.
|
|
duke@1
|
1469 }
|
|
duke@1
|
1470 }
|
|
duke@1
|
1471
|
|
duke@1
|
1472
|
|
duke@1
|
1473 //------------------------------merge------------------------------------------
|
|
duke@1
|
1474 void Parse::set_parse_bci(int bci) {
|
|
duke@1
|
1475 set_bci(bci);
|
|
duke@1
|
1476 Node_Notes* nn = C->default_node_notes();
|
|
duke@1
|
1477 if (nn == NULL) return;
|
|
duke@1
|
1478
|
|
duke@1
|
1479 // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls.
|
|
duke@1
|
1480 if (!DebugInlinedCalls && depth() > 1) {
|
|
duke@1
|
1481 return;
|
|
duke@1
|
1482 }
|
|
duke@1
|
1483
|
|
duke@1
|
1484 // Update the JVMS annotation, if present.
|
|
duke@1
|
1485 JVMState* jvms = nn->jvms();
|
|
duke@1
|
1486 if (jvms != NULL && jvms->bci() != bci) {
|
|
duke@1
|
1487 // Update the JVMS.
|
|
duke@1
|
1488 jvms = jvms->clone_shallow(C);
|
|
duke@1
|
1489 jvms->set_bci(bci);
|
|
duke@1
|
1490 nn->set_jvms(jvms);
|
|
duke@1
|
1491 }
|
|
duke@1
|
1492 }
|
|
duke@1
|
1493
|
|
duke@1
|
1494 //------------------------------merge------------------------------------------
|
|
duke@1
|
1495 // Merge the current mapping into the basic block starting at bci
|
|
duke@1
|
1496 void Parse::merge(int target_bci) {
|
|
duke@1
|
1497 Block* target = successor_for_bci(target_bci);
|
|
duke@1
|
1498 if (target == NULL) { handle_missing_successor(target_bci); return; }
|
|
duke@1
|
1499 assert(!target->is_ready(), "our arrival must be expected");
|
|
duke@1
|
1500 int pnum = target->next_path_num();
|
|
duke@1
|
1501 merge_common(target, pnum);
|
|
duke@1
|
1502 }
|
|
duke@1
|
1503
|
|
duke@1
|
1504 //-------------------------merge_new_path--------------------------------------
|
|
duke@1
|
1505 // Merge the current mapping into the basic block, using a new path
|
|
duke@1
|
1506 void Parse::merge_new_path(int target_bci) {
|
|
duke@1
|
1507 Block* target = successor_for_bci(target_bci);
|
|
duke@1
|
1508 if (target == NULL) { handle_missing_successor(target_bci); return; }
|
|
duke@1
|
1509 assert(!target->is_ready(), "new path into frozen graph");
|
|
duke@1
|
1510 int pnum = target->add_new_path();
|
|
duke@1
|
1511 merge_common(target, pnum);
|
|
duke@1
|
1512 }
|
|
duke@1
|
1513
|
|
duke@1
|
1514 //-------------------------merge_exception-------------------------------------
|
|
duke@1
|
1515 // Merge the current mapping into the basic block starting at bci
|
|
duke@1
|
1516 // The ex_oop must be pushed on the stack, unlike throw_to_exit.
|
|
duke@1
|
1517 void Parse::merge_exception(int target_bci) {
|
|
duke@1
|
1518 assert(sp() == 1, "must have only the throw exception on the stack");
|
|
duke@1
|
1519 Block* target = successor_for_bci(target_bci);
|
|
duke@1
|
1520 if (target == NULL) { handle_missing_successor(target_bci); return; }
|
|
duke@1
|
1521 assert(target->is_handler(), "exceptions are handled by special blocks");
|
|
duke@1
|
1522 int pnum = target->add_new_path();
|
|
duke@1
|
1523 merge_common(target, pnum);
|
|
duke@1
|
1524 }
|
|
duke@1
|
1525
|
|
duke@1
|
1526 //--------------------handle_missing_successor---------------------------------
|
|
duke@1
|
1527 void Parse::handle_missing_successor(int target_bci) {
|
|
duke@1
|
1528 #ifndef PRODUCT
|
|
duke@1
|
1529 Block* b = block();
|
|
duke@1
|
1530 int trap_bci = b->flow()->has_trap()? b->flow()->trap_bci(): -1;
|
|
never@1399
|
1531 tty->print_cr("### Missing successor at bci:%d for block #%d (trap_bci:%d)", target_bci, b->rpo(), trap_bci);
|
|
duke@1
|
1532 #endif
|
|
duke@1
|
1533 ShouldNotReachHere();
|
|
duke@1
|
1534 }
|
|
duke@1
|
1535
|
|
duke@1
|
1536 //--------------------------merge_common---------------------------------------
|
|
duke@1
|
1537 void Parse::merge_common(Parse::Block* target, int pnum) {
|
|
duke@1
|
1538 if (TraceOptoParse) {
|
|
never@1399
|
1539 tty->print("Merging state at block #%d bci:%d", target->rpo(), target->start());
|
|
duke@1
|
1540 }
|
|
duke@1
|
1541
|
|
duke@1
|
1542 // Zap extra stack slots to top
|
|
duke@1
|
1543 assert(sp() == target->start_sp(), "");
|
|
duke@1
|
1544 clean_stack(sp());
|
|
duke@1
|
1545
|
|
duke@1
|
1546 if (!target->is_merged()) { // No prior mapping at this bci
|
|
duke@1
|
1547 if (TraceOptoParse) { tty->print(" with empty state"); }
|
|
duke@1
|
1548
|
|
duke@1
|
1549 // If this path is dead, do not bother capturing it as a merge.
|
|
duke@1
|
1550 // It is "as if" we had 1 fewer predecessors from the beginning.
|
|
duke@1
|
1551 if (stopped()) {
|
|
duke@1
|
1552 if (TraceOptoParse) tty->print_cr(", but path is dead and doesn't count");
|
|
duke@1
|
1553 return;
|
|
duke@1
|
1554 }
|
|
duke@1
|
1555
|
|
duke@1
|
1556 // Record that a new block has been merged.
|
|
duke@1
|
1557 ++_blocks_merged;
|
|
duke@1
|
1558
|
|
duke@1
|
1559 // Make a region if we know there are multiple or unpredictable inputs.
|
|
duke@1
|
1560 // (Also, if this is a plain fall-through, we might see another region,
|
|
duke@1
|
1561 // which must not be allowed into this block's map.)
|
|
duke@1
|
1562 if (pnum > PhiNode::Input // Known multiple inputs.
|
|
duke@1
|
1563 || target->is_handler() // These have unpredictable inputs.
|
|
never@1399
|
1564 || target->is_loop_head() // Known multiple inputs
|
|
duke@1
|
1565 || control()->is_Region()) { // We must hide this guy.
|
|
kvn@8732
|
1566
|
|
kvn@8732
|
1567 int current_bci = bci();
|
|
kvn@8732
|
1568 set_parse_bci(target->start()); // Set target bci
|
|
kvn@8732
|
1569 if (target->is_SEL_head()) {
|
|
kvn@8732
|
1570 DEBUG_ONLY( target->mark_merged_backedge(block()); )
|
|
kvn@8732
|
1571 if (target->start() == 0) {
|
|
kvn@8732
|
1572 // Add loop predicate for the special case when
|
|
kvn@8732
|
1573 // there are backbranches to the method entry.
|
|
kvn@8732
|
1574 add_predicate();
|
|
kvn@8732
|
1575 }
|
|
kvn@8732
|
1576 }
|
|
duke@1
|
1577 // Add a Region to start the new basic block. Phis will be added
|
|
duke@1
|
1578 // later lazily.
|
|
duke@1
|
1579 int edges = target->pred_count();
|
|
duke@1
|
1580 if (edges < pnum) edges = pnum; // might be a new path!
|
|
kvn@13895
|
1581 RegionNode *r = new (C) RegionNode(edges+1);
|
|
duke@1
|
1582 gvn().set_type(r, Type::CONTROL);
|
|
duke@1
|
1583 record_for_igvn(r);
|
|
duke@1
|
1584 // zap all inputs to NULL for debugging (done in Node(uint) constructor)
|
|
duke@1
|
1585 // for (int j = 1; j < edges+1; j++) { r->init_req(j, NULL); }
|
|
duke@1
|
1586 r->init_req(pnum, control());
|
|
duke@1
|
1587 set_control(r);
|
|
kvn@8732
|
1588 set_parse_bci(current_bci); // Restore bci
|
|
duke@1
|
1589 }
|
|
duke@1
|
1590
|
|
duke@1
|
1591 // Convert the existing Parser mapping into a mapping at this bci.
|
|
duke@1
|
1592 store_state_to(target);
|
|
duke@1
|
1593 assert(target->is_merged(), "do not come here twice");
|
|
duke@1
|
1594
|
|
duke@1
|
1595 } else { // Prior mapping at this bci
|
|
duke@1
|
1596 if (TraceOptoParse) { tty->print(" with previous state"); }
|
|
kvn@8732
|
1597 #ifdef ASSERT
|
|
kvn@8732
|
1598 if (target->is_SEL_head()) {
|
|
kvn@8732
|
1599 target->mark_merged_backedge(block());
|
|
kvn@8732
|
1600 }
|
|
kvn@8732
|
1601 #endif
|
|
duke@1
|
1602 // We must not manufacture more phis if the target is already parsed.
|
|
duke@1
|
1603 bool nophi = target->is_parsed();
|
|
duke@1
|
1604
|
|
duke@1
|
1605 SafePointNode* newin = map();// Hang on to incoming mapping
|
|
duke@1
|
1606 Block* save_block = block(); // Hang on to incoming block;
|
|
duke@1
|
1607 load_state_from(target); // Get prior mapping
|
|
duke@1
|
1608
|
|
duke@1
|
1609 assert(newin->jvms()->locoff() == jvms()->locoff(), "JVMS layouts agree");
|
|
duke@1
|
1610 assert(newin->jvms()->stkoff() == jvms()->stkoff(), "JVMS layouts agree");
|
|
duke@1
|
1611 assert(newin->jvms()->monoff() == jvms()->monoff(), "JVMS layouts agree");
|
|
duke@1
|
1612 assert(newin->jvms()->endoff() == jvms()->endoff(), "JVMS layouts agree");
|
|
duke@1
|
1613
|
|
duke@1
|
1614 // Iterate over my current mapping and the old mapping.
|
|
duke@1
|
1615 // Where different, insert Phi functions.
|
|
duke@1
|
1616 // Use any existing Phi functions.
|
|
duke@1
|
1617 assert(control()->is_Region(), "must be merging to a region");
|
|
duke@1
|
1618 RegionNode* r = control()->as_Region();
|
|
duke@1
|
1619
|
|
duke@1
|
1620 // Compute where to merge into
|
|
duke@1
|
1621 // Merge incoming control path
|
|
never@1399
|
1622 r->init_req(pnum, newin->control());
|
|
duke@1
|
1623
|
|
duke@1
|
1624 if (pnum == 1) { // Last merge for this Region?
|
|
never@1399
|
1625 if (!block()->flow()->is_irreducible_entry()) {
|
|
never@1399
|
1626 Node* result = _gvn.transform_no_reclaim(r);
|
|
never@1399
|
1627 if (r != result && TraceOptoParse) {
|
|
never@1399
|
1628 tty->print_cr("Block #%d replace %d with %d", block()->rpo(), r->_idx, result->_idx);
|
|
never@1399
|
1629 }
|
|
never@1399
|
1630 }
|
|
duke@1
|
1631 record_for_igvn(r);
|
|
duke@1
|
1632 }
|
|
duke@1
|
1633
|
|
duke@1
|
1634 // Update all the non-control inputs to map:
|
|
duke@1
|
1635 assert(TypeFunc::Parms == newin->jvms()->locoff(), "parser map should contain only youngest jvms");
|
|
never@1399
|
1636 bool check_elide_phi = target->is_SEL_backedge(save_block);
|
|
duke@1
|
1637 for (uint j = 1; j < newin->req(); j++) {
|
|
duke@1
|
1638 Node* m = map()->in(j); // Current state of target.
|
|
duke@1
|
1639 Node* n = newin->in(j); // Incoming change to target state.
|
|
duke@1
|
1640 PhiNode* phi;
|
|
duke@1
|
1641 if (m->is_Phi() && m->as_Phi()->region() == r)
|
|
duke@1
|
1642 phi = m->as_Phi();
|
|
duke@1
|
1643 else
|
|
duke@1
|
1644 phi = NULL;
|
|
duke@1
|
1645 if (m != n) { // Different; must merge
|
|
duke@1
|
1646 switch (j) {
|
|
duke@1
|
1647 // Frame pointer and Return Address never changes
|
|
duke@1
|
1648 case TypeFunc::FramePtr:// Drop m, use the original value
|
|
duke@1
|
1649 case TypeFunc::ReturnAdr:
|
|
duke@1
|
1650 break;
|
|
duke@1
|
1651 case TypeFunc::Memory: // Merge inputs to the MergeMem node
|
|
duke@1
|
1652 assert(phi == NULL, "the merge contains phis, not vice versa");
|
|
duke@1
|
1653 merge_memory_edges(n->as_MergeMem(), pnum, nophi);
|
|
duke@1
|
1654 continue;
|
|
duke@1
|
1655 default: // All normal stuff
|
|
never@1399
|
1656 if (phi == NULL) {
|
|
kvn@11458
|
1657 const JVMState* jvms = map()->jvms();
|
|
kvn@11458
|
1658 if (EliminateNestedLocks &&
|
|
kvn@11458
|
1659 jvms->is_mon(j) && jvms->is_monitor_box(j)) {
|
|
kvn@11458
|
1660 // BoxLock nodes are not commoning.
|
|
kvn@11458
|
1661 // Use old BoxLock node as merged box.
|
|
kvn@11458
|
1662 assert(newin->jvms()->is_monitor_box(j), "sanity");
|
|
kvn@11458
|
1663 // This assert also tests that nodes are BoxLock.
|
|
kvn@11458
|
1664 assert(BoxLockNode::same_slot(n, m), "sanity");
|
|
kvn@11458
|
1665 C->gvn_replace_by(n, m);
|
|
kvn@11458
|
1666 } else if (!check_elide_phi || !target->can_elide_SEL_phi(j)) {
|
|
never@1399
|
1667 phi = ensure_phi(j, nophi);
|
|
never@1399
|
1668 }
|
|
never@1399
|
1669 }
|
|
duke@1
|
1670 break;
|
|
duke@1
|
1671 }
|
|
duke@1
|
1672 }
|
|
duke@1
|
1673 // At this point, n might be top if:
|
|
duke@1
|
1674 // - there is no phi (because TypeFlow detected a conflict), or
|
|
duke@1
|
1675 // - the corresponding control edges is top (a dead incoming path)
|
|
duke@1
|
1676 // It is a bug if we create a phi which sees a garbage value on a live path.
|
|
duke@1
|
1677
|
|
duke@1
|
1678 if (phi != NULL) {
|
|
duke@1
|
1679 assert(n != top() || r->in(pnum) == top(), "live value must not be garbage");
|
|
duke@1
|
1680 assert(phi->region() == r, "");
|
|
duke@1
|
1681 phi->set_req(pnum, n); // Then add 'n' to the merge
|
|
duke@1
|
1682 if (pnum == PhiNode::Input) {
|
|
duke@1
|
1683 // Last merge for this Phi.
|
|
duke@1
|
1684 // So far, Phis have had a reasonable type from ciTypeFlow.
|
|
duke@1
|
1685 // Now _gvn will join that with the meet of current inputs.
|
|
duke@1
|
1686 // BOTTOM is never permissible here, 'cause pessimistically
|
|
duke@1
|
1687 // Phis of pointers cannot lose the basic pointer type.
|
|
duke@1
|
1688 debug_only(const Type* bt1 = phi->bottom_type());
|
|
duke@1
|
1689 assert(bt1 != Type::BOTTOM, "should not be building conflict phis");
|
|
duke@1
|
1690 map()->set_req(j, _gvn.transform_no_reclaim(phi));
|
|
duke@1
|
1691 debug_only(const Type* bt2 = phi->bottom_type());
|
|
roland@22799
|
1692 assert(bt2->higher_equal_speculative(bt1), "must be consistent with type-flow");
|
|
duke@1
|
1693 record_for_igvn(phi);
|
|
duke@1
|
1694 }
|
|
duke@1
|
1695 }
|
|
duke@1
|
1696 } // End of for all values to be merged
|
|
duke@1
|
1697
|
|
duke@1
|
1698 if (pnum == PhiNode::Input &&
|
|
duke@1
|
1699 !r->in(0)) { // The occasional useless Region
|
|
duke@1
|
1700 assert(control() == r, "");
|
|
duke@1
|
1701 set_control(r->nonnull_req());
|
|
duke@1
|
1702 }
|
|
duke@1
|
1703
|
|
duke@1
|
1704 // newin has been subsumed into the lazy merge, and is now dead.
|
|
duke@1
|
1705 set_block(save_block);
|
|
duke@1
|
1706
|
|
duke@1
|
1707 stop(); // done with this guy, for now
|
|
duke@1
|
1708 }
|
|
duke@1
|
1709
|
|
duke@1
|
1710 if (TraceOptoParse) {
|
|
duke@1
|
1711 tty->print_cr(" on path %d", pnum);
|
|
duke@1
|
1712 }
|
|
duke@1
|
1713
|
|
duke@1
|
1714 // Done with this parser state.
|
|
duke@1
|
1715 assert(stopped(), "");
|
|
duke@1
|
1716 }
|
|
duke@1
|
1717
|
|
duke@1
|
1718
|
|
duke@1
|
1719 //--------------------------merge_memory_edges---------------------------------
|
|
duke@1
|
1720 void Parse::merge_memory_edges(MergeMemNode* n, int pnum, bool nophi) {
|
|
duke@1
|
1721 // (nophi means we must not create phis, because we already parsed here)
|
|
duke@1
|
1722 assert(n != NULL, "");
|
|
duke@1
|
1723 // Merge the inputs to the MergeMems
|
|
duke@1
|
1724 MergeMemNode* m = merged_memory();
|
|
duke@1
|
1725
|
|
duke@1
|
1726 assert(control()->is_Region(), "must be merging to a region");
|
|
duke@1
|
1727 RegionNode* r = control()->as_Region();
|
|
duke@1
|
1728
|
|
duke@1
|
1729 PhiNode* base = NULL;
|
|
duke@1
|
1730 MergeMemNode* remerge = NULL;
|
|
duke@1
|
1731 for (MergeMemStream mms(m, n); mms.next_non_empty2(); ) {
|
|
duke@1
|
1732 Node *p = mms.force_memory();
|
|
duke@1
|
1733 Node *q = mms.memory2();
|
|
duke@1
|
1734 if (mms.is_empty() && nophi) {
|
|
duke@1
|
1735 // Trouble: No new splits allowed after a loop body is parsed.
|
|
duke@1
|
1736 // Instead, wire the new split into a MergeMem on the backedge.
|
|
duke@1
|
1737 // The optimizer will sort it out, slicing the phi.
|
|
duke@1
|
1738 if (remerge == NULL) {
|
|
duke@1
|
1739 assert(base != NULL, "");
|
|
duke@1
|
1740 assert(base->in(0) != NULL, "should not be xformed away");
|
|
duke@1
|
1741 remerge = MergeMemNode::make(C, base->in(pnum));
|
|
duke@1
|
1742 gvn().set_type(remerge, Type::MEMORY);
|
|
duke@1
|
1743 base->set_req(pnum, remerge);
|
|
duke@1
|
1744 }
|
|
duke@1
|
1745 remerge->set_memory_at(mms.alias_idx(), q);
|
|
duke@1
|
1746 continue;
|
|
duke@1
|
1747 }
|
|
duke@1
|
1748 assert(!q->is_MergeMem(), "");
|
|
duke@1
|
1749 PhiNode* phi;
|
|
duke@1
|
1750 if (p != q) {
|
|
duke@1
|
1751 phi = ensure_memory_phi(mms.alias_idx(), nophi);
|
|
duke@1
|
1752 } else {
|
|
duke@1
|
1753 if (p->is_Phi() && p->as_Phi()->region() == r)
|
|
duke@1
|
1754 phi = p->as_Phi();
|
|
duke@1
|
1755 else
|
|
duke@1
|
1756 phi = NULL;
|
|
duke@1
|
1757 }
|
|
duke@1
|
1758 // Insert q into local phi
|
|
duke@1
|
1759 if (phi != NULL) {
|
|
duke@1
|
1760 assert(phi->region() == r, "");
|
|
duke@1
|
1761 p = phi;
|
|
duke@1
|
1762 phi->set_req(pnum, q);
|
|
duke@1
|
1763 if (mms.at_base_memory()) {
|
|
duke@1
|
1764 base = phi; // delay transforming it
|
|
duke@1
|
1765 } else if (pnum == 1) {
|
|
duke@1
|
1766 record_for_igvn(phi);
|
|
duke@1
|
1767 p = _gvn.transform_no_reclaim(phi);
|
|
duke@1
|
1768 }
|
|
duke@1
|
1769 mms.set_memory(p);// store back through the iterator
|
|
duke@1
|
1770 }
|
|
duke@1
|
1771 }
|
|
duke@1
|
1772 // Transform base last, in case we must fiddle with remerging.
|
|
duke@1
|
1773 if (base != NULL && pnum == 1) {
|
|
duke@1
|
1774 record_for_igvn(base);
|
|
duke@1
|
1775 m->set_base_memory( _gvn.transform_no_reclaim(base) );
|
|
duke@1
|
1776 }
|
|
duke@1
|
1777 }
|
|
duke@1
|
1778
|
|
duke@1
|
1779
|
|
duke@1
|
1780 //------------------------ensure_phis_everywhere-------------------------------
|
|
duke@1
|
1781 void Parse::ensure_phis_everywhere() {
|
|
duke@1
|
1782 ensure_phi(TypeFunc::I_O);
|
|
duke@1
|
1783
|
|
duke@1
|
1784 // Ensure a phi on all currently known memories.
|
|
duke@1
|
1785 for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) {
|
|
duke@1
|
1786 ensure_memory_phi(mms.alias_idx());
|
|
duke@1
|
1787 debug_only(mms.set_memory()); // keep the iterator happy
|
|
duke@1
|
1788 }
|
|
duke@1
|
1789
|
|
duke@1
|
1790 // Note: This is our only chance to create phis for memory slices.
|
|
duke@1
|
1791 // If we miss a slice that crops up later, it will have to be
|
|
duke@1
|
1792 // merged into the base-memory phi that we are building here.
|
|
duke@1
|
1793 // Later, the optimizer will comb out the knot, and build separate
|
|
duke@1
|
1794 // phi-loops for each memory slice that matters.
|
|
duke@1
|
1795
|
|
duke@1
|
1796 // Monitors must nest nicely and not get confused amongst themselves.
|
|
duke@1
|
1797 // Phi-ify everything up to the monitors, though.
|
|
duke@1
|
1798 uint monoff = map()->jvms()->monoff();
|
|
duke@1
|
1799 uint nof_monitors = map()->jvms()->nof_monitors();
|
|
duke@1
|
1800
|
|
duke@1
|
1801 assert(TypeFunc::Parms == map()->jvms()->locoff(), "parser map should contain only youngest jvms");
|
|
never@1399
|
1802 bool check_elide_phi = block()->is_SEL_head();
|
|
duke@1
|
1803 for (uint i = TypeFunc::Parms; i < monoff; i++) {
|
|
never@1399
|
1804 if (!check_elide_phi || !block()->can_elide_SEL_phi(i)) {
|
|
never@1399
|
1805 ensure_phi(i);
|
|
never@1399
|
1806 }
|
|
duke@1
|
1807 }
|
|
never@1399
|
1808
|
|
duke@1
|
1809 // Even monitors need Phis, though they are well-structured.
|
|
duke@1
|
1810 // This is true for OSR methods, and also for the rare cases where
|
|
duke@1
|
1811 // a monitor object is the subject of a replace_in_map operation.
|
|
duke@1
|
1812 // See bugs 4426707 and 5043395.
|
|
duke@1
|
1813 for (uint m = 0; m < nof_monitors; m++) {
|
|
duke@1
|
1814 ensure_phi(map()->jvms()->monitor_obj_offset(m));
|
|
duke@1
|
1815 }
|
|
duke@1
|
1816 }
|
|
duke@1
|
1817
|
|
duke@1
|
1818
|
|
duke@1
|
1819 //-----------------------------add_new_path------------------------------------
|
|
duke@1
|
1820 // Add a previously unaccounted predecessor to this block.
|
|
duke@1
|
1821 int Parse::Block::add_new_path() {
|
|
duke@1
|
1822 // If there is no map, return the lowest unused path number.
|
|
duke@1
|
1823 if (!is_merged()) return pred_count()+1; // there will be a map shortly
|
|
duke@1
|
1824
|
|
duke@1
|
1825 SafePointNode* map = start_map();
|
|
duke@1
|
1826 if (!map->control()->is_Region())
|
|
duke@1
|
1827 return pred_count()+1; // there may be a region some day
|
|
duke@1
|
1828 RegionNode* r = map->control()->as_Region();
|
|
duke@1
|
1829
|
|
duke@1
|
1830 // Add new path to the region.
|
|
duke@1
|
1831 uint pnum = r->req();
|
|
duke@1
|
1832 r->add_req(NULL);
|
|
duke@1
|
1833
|
|
duke@1
|
1834 for (uint i = 1; i < map->req(); i++) {
|
|
duke@1
|
1835 Node* n = map->in(i);
|
|
duke@1
|
1836 if (i == TypeFunc::Memory) {
|
|
duke@1
|
1837 // Ensure a phi on all currently known memories.
|
|
duke@1
|
1838 for (MergeMemStream mms(n->as_MergeMem()); mms.next_non_empty(); ) {
|
|
duke@1
|
1839 Node* phi = mms.memory();
|
|
duke@1
|
1840 if (phi->is_Phi() && phi->as_Phi()->region() == r) {
|
|
duke@1
|
1841 assert(phi->req() == pnum, "must be same size as region");
|
|
duke@1
|
1842 phi->add_req(NULL);
|
|
duke@1
|
1843 }
|
|
duke@1
|
1844 }
|
|
duke@1
|
1845 } else {
|
|
duke@1
|
1846 if (n->is_Phi() && n->as_Phi()->region() == r) {
|
|
duke@1
|
1847 assert(n->req() == pnum, "must be same size as region");
|
|
duke@1
|
1848 n->add_req(NULL);
|
|
duke@1
|
1849 }
|
|
duke@1
|
1850 }
|
|
duke@1
|
1851 }
|
|
duke@1
|
1852
|
|
duke@1
|
1853 return pnum;
|
|
duke@1
|
1854 }
|
|
duke@1
|
1855
|
|
duke@1
|
1856 //------------------------------ensure_phi-------------------------------------
|
|
duke@1
|
1857 // Turn the idx'th entry of the current map into a Phi
|
|
duke@1
|
1858 PhiNode *Parse::ensure_phi(int idx, bool nocreate) {
|
|
duke@1
|
1859 SafePointNode* map = this->map();
|
|
duke@1
|
1860 Node* region = map->control();
|
|
duke@1
|
1861 assert(region->is_Region(), "");
|
|
duke@1
|
1862
|
|
duke@1
|
1863 Node* o = map->in(idx);
|
|
duke@1
|
1864 assert(o != NULL, "");
|
|
duke@1
|
1865
|
|
duke@1
|
1866 if (o == top()) return NULL; // TOP always merges into TOP
|
|
duke@1
|
1867
|
|
duke@1
|
1868 if (o->is_Phi() && o->as_Phi()->region() == region) {
|
|
duke@1
|
1869 return o->as_Phi();
|
|
duke@1
|
1870 }
|
|
duke@1
|
1871
|
|
duke@1
|
1872 // Now use a Phi here for merging
|
|
duke@1
|
1873 assert(!nocreate, "Cannot build a phi for a block already parsed.");
|
|
duke@1
|
1874 const JVMState* jvms = map->jvms();
|
|
duke@1
|
1875 const Type* t;
|
|
duke@1
|
1876 if (jvms->is_loc(idx)) {
|
|
duke@1
|
1877 t = block()->local_type_at(idx - jvms->locoff());
|
|
duke@1
|
1878 } else if (jvms->is_stk(idx)) {
|
|
duke@1
|
1879 t = block()->stack_type_at(idx - jvms->stkoff());
|
|
duke@1
|
1880 } else if (jvms->is_mon(idx)) {
|
|
kvn@11458
|
1881 assert(!jvms->is_monitor_box(idx), "no phis for boxes");
|
|
kvn@11458
|
1882 t = TypeInstPtr::BOTTOM; // this is sufficient for a lock object
|
|
duke@1
|
1883 } else if ((uint)idx < TypeFunc::Parms) {
|
|
duke@1
|
1884 t = o->bottom_type(); // Type::RETURN_ADDRESS or such-like.
|
|
duke@1
|
1885 } else {
|
|
duke@1
|
1886 assert(false, "no type information for this phi");
|
|
duke@1
|
1887 }
|
|
duke@1
|
1888
|
|
duke@1
|
1889 // If the type falls to bottom, then this must be a local that
|
|
duke@1
|
1890 // is mixing ints and oops or some such. Forcing it to top
|
|
duke@1
|
1891 // makes it go dead.
|
|
duke@1
|
1892 if (t == Type::BOTTOM) {
|
|
duke@1
|
1893 map->set_req(idx, top());
|
|
duke@1
|
1894 return NULL;
|
|
duke@1
|
1895 }
|
|
duke@1
|
1896
|
|
duke@1
|
1897 // Do not create phis for top either.
|
|
duke@1
|
1898 // A top on a non-null control flow must be an unused even after the.phi.
|
|
duke@1
|
1899 if (t == Type::TOP || t == Type::HALF) {
|
|
duke@1
|
1900 map->set_req(idx, top());
|
|
duke@1
|
1901 return NULL;
|
|
duke@1
|
1902 }
|
|
duke@1
|
1903
|
|
duke@1
|
1904 PhiNode* phi = PhiNode::make(region, o, t);
|
|
duke@1
|
1905 gvn().set_type(phi, t);
|
|
kvn@211
|
1906 if (C->do_escape_analysis()) record_for_igvn(phi);
|
|
duke@1
|
1907 map->set_req(idx, phi);
|
|
duke@1
|
1908 return phi;
|
|
duke@1
|
1909 }
|
|
duke@1
|
1910
|
|
duke@1
|
1911 //--------------------------ensure_memory_phi----------------------------------
|
|
duke@1
|
1912 // Turn the idx'th slice of the current memory into a Phi
|
|
duke@1
|
1913 PhiNode *Parse::ensure_memory_phi(int idx, bool nocreate) {
|
|
duke@1
|
1914 MergeMemNode* mem = merged_memory();
|
|
duke@1
|
1915 Node* region = control();
|
|
duke@1
|
1916 assert(region->is_Region(), "");
|
|
duke@1
|
1917
|
|
duke@1
|
1918 Node *o = (idx == Compile::AliasIdxBot)? mem->base_memory(): mem->memory_at(idx);
|
|
duke@1
|
1919 assert(o != NULL && o != top(), "");
|
|
duke@1
|
1920
|
|
duke@1
|
1921 PhiNode* phi;
|
|
duke@1
|
1922 if (o->is_Phi() && o->as_Phi()->region() == region) {
|
|
duke@1
|
1923 phi = o->as_Phi();
|
|
duke@1
|
1924 if (phi == mem->base_memory() && idx >= Compile::AliasIdxRaw) {
|
|
duke@1
|
1925 // clone the shared base memory phi to make a new memory split
|
|
duke@1
|
1926 assert(!nocreate, "Cannot build a phi for a block already parsed.");
|
|
duke@1
|
1927 const Type* t = phi->bottom_type();
|
|
duke@1
|
1928 const TypePtr* adr_type = C->get_adr_type(idx);
|
|
duke@1
|
1929 phi = phi->slice_memory(adr_type);
|
|
duke@1
|
1930 gvn().set_type(phi, t);
|
|
duke@1
|
1931 }
|
|
duke@1
|
1932 return phi;
|
|
duke@1
|
1933 }
|
|
duke@1
|
1934
|
|
duke@1
|
1935 // Now use a Phi here for merging
|
|
duke@1
|
1936 assert(!nocreate, "Cannot build a phi for a block already parsed.");
|
|
duke@1
|
1937 const Type* t = o->bottom_type();
|
|
duke@1
|
1938 const TypePtr* adr_type = C->get_adr_type(idx);
|
|
duke@1
|
1939 phi = PhiNode::make(region, o, t, adr_type);
|
|
duke@1
|
1940 gvn().set_type(phi, t);
|
|
duke@1
|
1941 if (idx == Compile::AliasIdxBot)
|
|
duke@1
|
1942 mem->set_base_memory(phi);
|
|
duke@1
|
1943 else
|
|
duke@1
|
1944 mem->set_memory_at(idx, phi);
|
|
duke@1
|
1945 return phi;
|
|
duke@1
|
1946 }
|
|
duke@1
|
1947
|
|
duke@1
|
1948 //------------------------------call_register_finalizer-----------------------
|
|
duke@1
|
1949 // Check the klass of the receiver and call register_finalizer if the
|
|
duke@1
|
1950 // class need finalization.
|
|
duke@1
|
1951 void Parse::call_register_finalizer() {
|
|
duke@1
|
1952 Node* receiver = local(0);
|
|
duke@1
|
1953 assert(receiver != NULL && receiver->bottom_type()->isa_instptr() != NULL,
|
|
duke@1
|
1954 "must have non-null instance type");
|
|
duke@1
|
1955
|
|
duke@1
|
1956 const TypeInstPtr *tinst = receiver->bottom_type()->isa_instptr();
|
|
duke@1
|
1957 if (tinst != NULL && tinst->klass()->is_loaded() && !tinst->klass_is_exact()) {
|
|
duke@1
|
1958 // The type isn't known exactly so see if CHA tells us anything.
|
|
duke@1
|
1959 ciInstanceKlass* ik = tinst->klass()->as_instance_klass();
|
|
duke@1
|
1960 if (!Dependencies::has_finalizable_subclass(ik)) {
|
|
duke@1
|
1961 // No finalizable subclasses so skip the dynamic check.
|
|
duke@1
|
1962 C->dependencies()->assert_has_no_finalizable_subclasses(ik);
|
|
duke@1
|
1963 return;
|
|
duke@1
|
1964 }
|
|
duke@1
|
1965 }
|
|
duke@1
|
1966
|
|
duke@1
|
1967 // Insert a dynamic test for whether the instance needs
|
|
duke@1
|
1968 // finalization. In general this will fold up since the concrete
|
|
duke@1
|
1969 // class is often visible so the access flags are constant.
|
|
duke@1
|
1970 Node* klass_addr = basic_plus_adr( receiver, receiver, oopDesc::klass_offset_in_bytes() );
|
|
kvn@590
|
1971 Node* klass = _gvn.transform( LoadKlassNode::make(_gvn, immutable_memory(), klass_addr, TypeInstPtr::KLASS) );
|
|
duke@1
|
1972
|
|
stefank@11430
|
1973 Node* access_flags_addr = basic_plus_adr(klass, klass, in_bytes(Klass::access_flags_offset()));
|
|
goetz@22845
|
1974 Node* access_flags = make_load(NULL, access_flags_addr, TypeInt::INT, T_INT, MemNode::unordered);
|
|
duke@1
|
1975
|
|
kvn@13895
|
1976 Node* mask = _gvn.transform(new (C) AndINode(access_flags, intcon(JVM_ACC_HAS_FINALIZER)));
|
|
kvn@13895
|
1977 Node* check = _gvn.transform(new (C) CmpINode(mask, intcon(0)));
|
|
kvn@13895
|
1978 Node* test = _gvn.transform(new (C) BoolNode(check, BoolTest::ne));
|
|
duke@1
|
1979
|
|
duke@1
|
1980 IfNode* iff = create_and_map_if(control(), test, PROB_MAX, COUNT_UNKNOWN);
|
|
duke@1
|
1981
|
|
kvn@13895
|
1982 RegionNode* result_rgn = new (C) RegionNode(3);
|
|
duke@1
|
1983 record_for_igvn(result_rgn);
|
|
duke@1
|
1984
|
|
kvn@13895
|
1985 Node *skip_register = _gvn.transform(new (C) IfFalseNode(iff));
|
|
duke@1
|
1986 result_rgn->init_req(1, skip_register);
|
|
duke@1
|
1987
|
|
kvn@13895
|
1988 Node *needs_register = _gvn.transform(new (C) IfTrueNode(iff));
|
|
duke@1
|
1989 set_control(needs_register);
|
|
duke@1
|
1990 if (stopped()) {
|
|
duke@1
|
1991 // There is no slow path.
|
|
duke@1
|
1992 result_rgn->init_req(2, top());
|
|
duke@1
|
1993 } else {
|
|
duke@1
|
1994 Node *call = make_runtime_call(RC_NO_LEAF,
|
|
duke@1
|
1995 OptoRuntime::register_finalizer_Type(),
|
|
duke@1
|
1996 OptoRuntime::register_finalizer_Java(),
|
|
duke@1
|
1997 NULL, TypePtr::BOTTOM,
|
|
duke@1
|
1998 receiver);
|
|
duke@1
|
1999 make_slow_call_ex(call, env()->Throwable_klass(), true);
|
|
duke@1
|
2000
|
|
duke@1
|
2001 Node* fast_io = call->in(TypeFunc::I_O);
|
|
duke@1
|
2002 Node* fast_mem = call->in(TypeFunc::Memory);
|
|
duke@1
|
2003 // These two phis are pre-filled with copies of of the fast IO and Memory
|
|
duke@1
|
2004 Node* io_phi = PhiNode::make(result_rgn, fast_io, Type::ABIO);
|
|
duke@1
|
2005 Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM);
|
|
duke@1
|
2006
|
|
duke@1
|
2007 result_rgn->init_req(2, control());
|
|
duke@1
|
2008 io_phi ->init_req(2, i_o());
|
|
duke@1
|
2009 mem_phi ->init_req(2, reset_memory());
|
|
duke@1
|
2010
|
|
duke@1
|
2011 set_all_memory( _gvn.transform(mem_phi) );
|
|
duke@1
|
2012 set_i_o( _gvn.transform(io_phi) );
|
|
duke@1
|
2013 }
|
|
duke@1
|
2014
|
|
duke@1
|
2015 set_control( _gvn.transform(result_rgn) );
|
|
duke@1
|
2016 }
|
|
duke@1
|
2017
|
|
kvn@23491
|
2018 // Add check to deoptimize if RTM state is not ProfileRTM
|
|
kvn@23491
|
2019 void Parse::rtm_deopt() {
|
|
kvn@23491
|
2020 #if INCLUDE_RTM_OPT
|
|
kvn@23491
|
2021 if (C->profile_rtm()) {
|
|
kvn@23491
|
2022 assert(C->method() != NULL, "only for normal compilations");
|
|
kvn@23491
|
2023 assert(!C->method()->method_data()->is_empty(), "MDO is needed to record RTM state");
|
|
kvn@23491
|
2024 assert(depth() == 1, "generate check only for main compiled method");
|
|
kvn@23491
|
2025
|
|
kvn@23491
|
2026 // Set starting bci for uncommon trap.
|
|
kvn@23491
|
2027 set_parse_bci(is_osr_parse() ? osr_bci() : 0);
|
|
kvn@23491
|
2028
|
|
kvn@23491
|
2029 // Load the rtm_state from the MethodData.
|
|
kvn@23491
|
2030 const TypePtr* adr_type = TypeMetadataPtr::make(C->method()->method_data());
|
|
kvn@23491
|
2031 Node* mdo = makecon(adr_type);
|
|
kvn@23491
|
2032 int offset = MethodData::rtm_state_offset_in_bytes();
|
|
kvn@23491
|
2033 Node* adr_node = basic_plus_adr(mdo, mdo, offset);
|
|
kvn@23491
|
2034 Node* rtm_state = make_load(control(), adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
|
|
kvn@23491
|
2035
|
|
kvn@23491
|
2036 // Separate Load from Cmp by Opaque.
|
|
kvn@23491
|
2037 // In expand_macro_nodes() it will be replaced either
|
|
kvn@23491
|
2038 // with this load when there are locks in the code
|
|
kvn@23491
|
2039 // or with ProfileRTM (cmp->in(2)) otherwise so that
|
|
kvn@23491
|
2040 // the check will fold.
|
|
kvn@23491
|
2041 Node* profile_state = makecon(TypeInt::make(ProfileRTM));
|
|
kvn@23491
|
2042 Node* opq = _gvn.transform( new (C) Opaque3Node(C, rtm_state, Opaque3Node::RTM_OPT) );
|
|
kvn@23491
|
2043 Node* chk = _gvn.transform( new (C) CmpINode(opq, profile_state) );
|
|
kvn@23491
|
2044 Node* tst = _gvn.transform( new (C) BoolNode(chk, BoolTest::eq) );
|
|
kvn@23491
|
2045 // Branch to failure if state was changed
|
|
kvn@23491
|
2046 { BuildCutout unless(this, tst, PROB_ALWAYS);
|
|
kvn@23491
|
2047 uncommon_trap(Deoptimization::Reason_rtm_state_change,
|
|
kvn@23491
|
2048 Deoptimization::Action_make_not_entrant);
|
|
kvn@23491
|
2049 }
|
|
kvn@23491
|
2050 }
|
|
kvn@23491
|
2051 #endif
|
|
kvn@23491
|
2052 }
|
|
kvn@23491
|
2053
|
|
iveresov@24442
|
2054 void Parse::decrement_age() {
|
|
iveresov@24442
|
2055 MethodCounters* mc = method()->ensure_method_counters();
|
|
iveresov@24442
|
2056 if (mc == NULL) {
|
|
iveresov@24442
|
2057 C->record_failure("Must have MCs");
|
|
iveresov@24442
|
2058 return;
|
|
iveresov@24442
|
2059 }
|
|
iveresov@24442
|
2060 assert(!is_osr_parse(), "Not doing this for OSRs");
|
|
iveresov@24442
|
2061
|
|
iveresov@24442
|
2062 // Set starting bci for uncommon trap.
|
|
iveresov@24442
|
2063 set_parse_bci(0);
|
|
iveresov@24442
|
2064
|
|
iveresov@24442
|
2065 const TypePtr* adr_type = TypeRawPtr::make((address)mc);
|
|
iveresov@24442
|
2066 Node* mc_adr = makecon(adr_type);
|
|
iveresov@24442
|
2067 Node* cnt_adr = basic_plus_adr(mc_adr, mc_adr, in_bytes(MethodCounters::nmethod_age_offset()));
|
|
iveresov@24442
|
2068 Node* cnt = make_load(control(), cnt_adr, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
|
|
iveresov@24442
|
2069 Node* decr = _gvn.transform(new (C) SubINode(cnt, makecon(TypeInt::ONE)));
|
|
iveresov@24442
|
2070 store_to_memory(control(), cnt_adr, decr, T_INT, adr_type, MemNode::unordered);
|
|
iveresov@24442
|
2071 Node *chk = _gvn.transform(new (C) CmpINode(decr, makecon(TypeInt::ZERO)));
|
|
iveresov@24442
|
2072 Node* tst = _gvn.transform(new (C) BoolNode(chk, BoolTest::gt));
|
|
iveresov@24442
|
2073 { BuildCutout unless(this, tst, PROB_ALWAYS);
|
|
iveresov@24442
|
2074 uncommon_trap(Deoptimization::Reason_tenured,
|
|
iveresov@24442
|
2075 Deoptimization::Action_make_not_entrant);
|
|
iveresov@24442
|
2076 }
|
|
iveresov@24442
|
2077 }
|
|
iveresov@24442
|
2078
|
|
duke@1
|
2079 //------------------------------return_current---------------------------------
|
|
duke@1
|
2080 // Append current _map to _exit_return
|
|
duke@1
|
2081 void Parse::return_current(Node* value) {
|
|
duke@1
|
2082 if (RegisterFinalizersAtInit &&
|
|
duke@1
|
2083 method()->intrinsic_id() == vmIntrinsics::_Object_init) {
|
|
duke@1
|
2084 call_register_finalizer();
|
|
duke@1
|
2085 }
|
|
duke@1
|
2086
|
|
duke@1
|
2087 // Do not set_parse_bci, so that return goo is credited to the return insn.
|
|
duke@1
|
2088 set_bci(InvocationEntryBci);
|
|
duke@1
|
2089 if (method()->is_synchronized() && GenerateSynchronizationCode) {
|
|
duke@1
|
2090 shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node());
|
|
duke@1
|
2091 }
|
|
kvn@2867
|
2092 if (C->env()->dtrace_method_probes()) {
|
|
duke@1
|
2093 make_dtrace_method_exit(method());
|
|
duke@1
|
2094 }
|
|
duke@1
|
2095 SafePointNode* exit_return = _exits.map();
|
|
duke@1
|
2096 exit_return->in( TypeFunc::Control )->add_req( control() );
|
|
duke@1
|
2097 exit_return->in( TypeFunc::I_O )->add_req( i_o () );
|
|
duke@1
|
2098 Node *mem = exit_return->in( TypeFunc::Memory );
|
|
duke@1
|
2099 for (MergeMemStream mms(mem->as_MergeMem(), merged_memory()); mms.next_non_empty2(); ) {
|
|
duke@1
|
2100 if (mms.is_empty()) {
|
|
duke@1
|
2101 // get a copy of the base memory, and patch just this one input
|
|
duke@1
|
2102 const TypePtr* adr_type = mms.adr_type(C);
|
|
duke@1
|
2103 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type);
|
|
duke@1
|
2104 assert(phi->as_Phi()->region() == mms.base_memory()->in(0), "");
|
|
duke@1
|
2105 gvn().set_type_bottom(phi);
|
|
duke@1
|
2106 phi->del_req(phi->req()-1); // prepare to re-patch
|
|
duke@1
|
2107 mms.set_memory(phi);
|
|
duke@1
|
2108 }
|
|
duke@1
|
2109 mms.memory()->add_req(mms.memory2());
|
|
duke@1
|
2110 }
|
|
duke@1
|
2111
|
|
duke@1
|
2112 // frame pointer is always same, already captured
|
|
duke@1
|
2113 if (value != NULL) {
|
|
duke@1
|
2114 // If returning oops to an interface-return, there is a silent free
|
|
duke@1
|
2115 // cast from oop to interface allowed by the Verifier. Make it explicit
|
|
duke@1
|
2116 // here.
|
|
duke@1
|
2117 Node* phi = _exits.argument(0);
|
|
duke@1
|
2118 const TypeInstPtr *tr = phi->bottom_type()->isa_instptr();
|
|
duke@1
|
2119 if( tr && tr->klass()->is_loaded() &&
|
|
duke@1
|
2120 tr->klass()->is_interface() ) {
|
|
duke@1
|
2121 const TypeInstPtr *tp = value->bottom_type()->isa_instptr();
|
|
duke@1
|
2122 if (tp && tp->klass()->is_loaded() &&
|
|
duke@1
|
2123 !tp->klass()->is_interface()) {
|
|
duke@1
|
2124 // sharpen the type eagerly; this eases certain assert checking
|
|
duke@1
|
2125 if (tp->higher_equal(TypeInstPtr::NOTNULL))
|
|
roland@22799
|
2126 tr = tr->join_speculative(TypeInstPtr::NOTNULL)->is_instptr();
|
|
kvn@13895
|
2127 value = _gvn.transform(new (C) CheckCastPPNode(0,value,tr));
|
|
duke@1
|
2128 }
|
|
duke@1
|
2129 }
|
|
duke@1
|
2130 phi->add_req(value);
|
|
duke@1
|
2131 }
|
|
duke@1
|
2132
|
|
duke@1
|
2133 stop_and_kill_map(); // This CFG path dies here
|
|
duke@1
|
2134 }
|
|
duke@1
|
2135
|
|
duke@1
|
2136
|
|
duke@1
|
2137 //------------------------------add_safepoint----------------------------------
|
|
duke@1
|
2138 void Parse::add_safepoint() {
|
|
duke@1
|
2139 // See if we can avoid this safepoint. No need for a SafePoint immediately
|
|
duke@1
|
2140 // after a Call (except Leaf Call) or another SafePoint.
|
|
duke@1
|
2141 Node *proj = control();
|
|
duke@1
|
2142 bool add_poll_param = SafePointNode::needs_polling_address_input();
|
|
duke@1
|
2143 uint parms = add_poll_param ? TypeFunc::Parms+1 : TypeFunc::Parms;
|
|
duke@1
|
2144 if( proj->is_Proj() ) {
|
|
duke@1
|
2145 Node *n0 = proj->in(0);
|
|
duke@1
|
2146 if( n0->is_Catch() ) {
|
|
duke@1
|
2147 n0 = n0->in(0)->in(0);
|
|
duke@1
|
2148 assert( n0->is_Call(), "expect a call here" );
|
|
duke@1
|
2149 }
|
|
duke@1
|
2150 if( n0->is_Call() ) {
|
|
duke@1
|
2151 if( n0->as_Call()->guaranteed_safepoint() )
|
|
duke@1
|
2152 return;
|
|
duke@1
|
2153 } else if( n0->is_SafePoint() && n0->req() >= parms ) {
|
|
duke@1
|
2154 return;
|
|
duke@1
|
2155 }
|
|
duke@1
|
2156 }
|
|
duke@1
|
2157
|
|
duke@1
|
2158 // Clear out dead values from the debug info.
|
|
duke@1
|
2159 kill_dead_locals();
|
|
duke@1
|
2160
|
|
duke@1
|
2161 // Clone the JVM State
|
|
kvn@13895
|
2162 SafePointNode *sfpnt = new (C) SafePointNode(parms, NULL);
|
|
duke@1
|
2163
|
|
duke@1
|
2164 // Capture memory state BEFORE a SafePoint. Since we can block at a
|
|
duke@1
|
2165 // SafePoint we need our GC state to be safe; i.e. we need all our current
|
|
duke@1
|
2166 // write barriers (card marks) to not float down after the SafePoint so we
|
|
duke@1
|
2167 // must read raw memory. Likewise we need all oop stores to match the card
|
|
duke@1
|
2168 // marks. If deopt can happen, we need ALL stores (we need the correct JVM
|
|
duke@1
|
2169 // state on a deopt).
|
|
duke@1
|
2170
|
|
duke@1
|
2171 // We do not need to WRITE the memory state after a SafePoint. The control
|
|
duke@1
|
2172 // edge will keep card-marks and oop-stores from floating up from below a
|
|
duke@1
|
2173 // SafePoint and our true dependency added here will keep them from floating
|
|
duke@1
|
2174 // down below a SafePoint.
|
|
duke@1
|
2175
|
|
duke@1
|
2176 // Clone the current memory state
|
|
duke@1
|
2177 Node* mem = MergeMemNode::make(C, map()->memory());
|
|
duke@1
|
2178
|
|
duke@1
|
2179 mem = _gvn.transform(mem);
|
|
duke@1
|
2180
|
|
duke@1
|
2181 // Pass control through the safepoint
|
|
duke@1
|
2182 sfpnt->init_req(TypeFunc::Control , control());
|
|
duke@1
|
2183 // Fix edges normally used by a call
|
|
duke@1
|
2184 sfpnt->init_req(TypeFunc::I_O , top() );
|
|
duke@1
|
2185 sfpnt->init_req(TypeFunc::Memory , mem );
|
|
duke@1
|
2186 sfpnt->init_req(TypeFunc::ReturnAdr, top() );
|
|
duke@1
|
2187 sfpnt->init_req(TypeFunc::FramePtr , top() );
|
|
duke@1
|
2188
|
|
duke@1
|
2189 // Create a node for the polling address
|
|
duke@1
|
2190 if( add_poll_param ) {
|
|
duke@1
|
2191 Node *polladr = ConPNode::make(C, (address)os::get_polling_page());
|
|
duke@1
|
2192 sfpnt->init_req(TypeFunc::Parms+0, _gvn.transform(polladr));
|
|
duke@1
|
2193 }
|
|
duke@1
|
2194
|
|
duke@1
|
2195 // Fix up the JVM State edges
|
|
duke@1
|
2196 add_safepoint_edges(sfpnt);
|
|
duke@1
|
2197 Node *transformed_sfpnt = _gvn.transform(sfpnt);
|
|
duke@1
|
2198 set_control(transformed_sfpnt);
|
|
duke@1
|
2199
|
|
duke@1
|
2200 // Provide an edge from root to safepoint. This makes the safepoint
|
|
duke@1
|
2201 // appear useful until the parse has completed.
|
|
duke@1
|
2202 if( OptoRemoveUseless && transformed_sfpnt->is_SafePoint() ) {
|
|
duke@1
|
2203 assert(C->root() != NULL, "Expect parse is still valid");
|
|
duke@1
|
2204 C->root()->add_prec(transformed_sfpnt);
|
|
duke@1
|
2205 }
|
|
duke@1
|
2206 }
|
|
duke@1
|
2207
|
|
duke@1
|
2208 #ifndef PRODUCT
|
|
duke@1
|
2209 //------------------------show_parse_info--------------------------------------
|
|
duke@1
|
2210 void Parse::show_parse_info() {
|
|
duke@1
|
2211 InlineTree* ilt = NULL;
|
|
duke@1
|
2212 if (C->ilt() != NULL) {
|
|
duke@1
|
2213 JVMState* caller_jvms = is_osr_parse() ? caller()->caller() : caller();
|
|
duke@1
|
2214 ilt = InlineTree::find_subtree_from_root(C->ilt(), caller_jvms, method());
|
|
duke@1
|
2215 }
|
|
duke@1
|
2216 if (PrintCompilation && Verbose) {
|
|
duke@1
|
2217 if (depth() == 1) {
|
|
duke@1
|
2218 if( ilt->count_inlines() ) {
|
|
duke@1
|
2219 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(),
|
|
duke@1
|
2220 ilt->count_inline_bcs());
|
|
duke@1
|
2221 tty->cr();
|
|
duke@1
|
2222 }
|
|
duke@1
|
2223 } else {
|
|
duke@1
|
2224 if (method()->is_synchronized()) tty->print("s");
|
|
duke@1
|
2225 if (method()->has_exception_handlers()) tty->print("!");
|
|
duke@1
|
2226 // Check this is not the final compiled version
|
|
duke@1
|
2227 if (C->trap_can_recompile()) {
|
|
duke@1
|
2228 tty->print("-");
|
|
duke@1
|
2229 } else {
|
|
duke@1
|
2230 tty->print(" ");
|
|
duke@1
|
2231 }
|
|
duke@1
|
2232 method()->print_short_name();
|
|
duke@1
|
2233 if (is_osr_parse()) {
|
|
duke@1
|
2234 tty->print(" @ %d", osr_bci());
|
|
duke@1
|
2235 }
|
|
duke@1
|
2236 tty->print(" (%d bytes)",method()->code_size());
|
|
duke@1
|
2237 if (ilt->count_inlines()) {
|
|
duke@1
|
2238 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(),
|
|
duke@1
|
2239 ilt->count_inline_bcs());
|
|
duke@1
|
2240 }
|
|
duke@1
|
2241 tty->cr();
|
|
duke@1
|
2242 }
|
|
duke@1
|
2243 }
|
|
duke@1
|
2244 if (PrintOpto && (depth() == 1 || PrintOptoInlining)) {
|
|
duke@1
|
2245 // Print that we succeeded; suppress this message on the first osr parse.
|
|
duke@1
|
2246
|
|
duke@1
|
2247 if (method()->is_synchronized()) tty->print("s");
|
|
duke@1
|
2248 if (method()->has_exception_handlers()) tty->print("!");
|
|
duke@1
|
2249 // Check this is not the final compiled version
|
|
duke@1
|
2250 if (C->trap_can_recompile() && depth() == 1) {
|
|
duke@1
|
2251 tty->print("-");
|
|
duke@1
|
2252 } else {
|
|
duke@1
|
2253 tty->print(" ");
|
|
duke@1
|
2254 }
|
|
duke@1
|
2255 if( depth() != 1 ) { tty->print(" "); } // missing compile count
|
|
duke@1
|
2256 for (int i = 1; i < depth(); ++i) { tty->print(" "); }
|
|
duke@1
|
2257 method()->print_short_name();
|
|
duke@1
|
2258 if (is_osr_parse()) {
|
|
duke@1
|
2259 tty->print(" @ %d", osr_bci());
|
|
duke@1
|
2260 }
|
|
duke@1
|
2261 if (ilt->caller_bci() != -1) {
|
|
duke@1
|
2262 tty->print(" @ %d", ilt->caller_bci());
|
|
duke@1
|
2263 }
|
|
duke@1
|
2264 tty->print(" (%d bytes)",method()->code_size());
|
|
duke@1
|
2265 if (ilt->count_inlines()) {
|
|
duke@1
|
2266 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(),
|
|
duke@1
|
2267 ilt->count_inline_bcs());
|
|
duke@1
|
2268 }
|
|
duke@1
|
2269 tty->cr();
|
|
duke@1
|
2270 }
|
|
duke@1
|
2271 }
|
|
duke@1
|
2272
|
|
duke@1
|
2273
|
|
duke@1
|
2274 //------------------------------dump-------------------------------------------
|
|
duke@1
|
2275 // Dump information associated with the bytecodes of current _method
|
|
duke@1
|
2276 void Parse::dump() {
|
|
duke@1
|
2277 if( method() != NULL ) {
|
|
duke@1
|
2278 // Iterate over bytecodes
|
|
duke@1
|
2279 ciBytecodeStream iter(method());
|
|
duke@1
|
2280 for( Bytecodes::Code bc = iter.next(); bc != ciBytecodeStream::EOBC() ; bc = iter.next() ) {
|
|
duke@1
|
2281 dump_bci( iter.cur_bci() );
|
|
duke@1
|
2282 tty->cr();
|
|
duke@1
|
2283 }
|
|
duke@1
|
2284 }
|
|
duke@1
|
2285 }
|
|
duke@1
|
2286
|
|
duke@1
|
2287 // Dump information associated with a byte code index, 'bci'
|
|
duke@1
|
2288 void Parse::dump_bci(int bci) {
|
|
duke@1
|
2289 // Output info on merge-points, cloning, and within _jsr..._ret
|
|
duke@1
|
2290 // NYI
|
|
duke@1
|
2291 tty->print(" bci:%d", bci);
|
|
duke@1
|
2292 }
|
|
duke@1
|
2293
|
|
duke@1
|
2294 #endif
|
