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