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