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