duke@435: /* duke@435: * Copyright 1997-2007 Sun Microsystems, Inc. All Rights Reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * duke@435: * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, duke@435: * CA 95054 USA or visit www.sun.com if you need additional information or duke@435: * have any questions. duke@435: * duke@435: */ duke@435: duke@435: #include "incls/_precompiled.incl" duke@435: #include "incls/_parse1.cpp.incl" duke@435: duke@435: // Static array so we can figure out which bytecodes stop us from compiling duke@435: // the most. Some of the non-static variables are needed in bytecodeInfo.cpp duke@435: // and eventually should be encapsulated in a proper class (gri 8/18/98). duke@435: duke@435: int nodes_created = 0; int nodes_created_old = 0; duke@435: int methods_parsed = 0; int methods_parsed_old = 0; duke@435: int methods_seen = 0; int methods_seen_old = 0; duke@435: duke@435: int explicit_null_checks_inserted = 0, explicit_null_checks_inserted_old = 0; duke@435: int explicit_null_checks_elided = 0, explicit_null_checks_elided_old = 0; duke@435: int all_null_checks_found = 0, implicit_null_checks = 0; duke@435: int implicit_null_throws = 0; duke@435: duke@435: int parse_idx = 0; duke@435: size_t parse_arena = 0; duke@435: int reclaim_idx = 0; duke@435: int reclaim_in = 0; duke@435: int reclaim_node = 0; duke@435: duke@435: #ifndef PRODUCT duke@435: bool Parse::BytecodeParseHistogram::_initialized = false; duke@435: uint Parse::BytecodeParseHistogram::_bytecodes_parsed [Bytecodes::number_of_codes]; duke@435: uint Parse::BytecodeParseHistogram::_nodes_constructed[Bytecodes::number_of_codes]; duke@435: uint Parse::BytecodeParseHistogram::_nodes_transformed[Bytecodes::number_of_codes]; duke@435: uint Parse::BytecodeParseHistogram::_new_values [Bytecodes::number_of_codes]; duke@435: #endif duke@435: duke@435: //------------------------------print_statistics------------------------------- duke@435: #ifndef PRODUCT duke@435: void Parse::print_statistics() { duke@435: tty->print_cr("--- Compiler Statistics ---"); duke@435: tty->print("Methods seen: %d Methods parsed: %d", methods_seen, methods_parsed); duke@435: tty->print(" Nodes created: %d", nodes_created); duke@435: tty->cr(); duke@435: if (methods_seen != methods_parsed) duke@435: tty->print_cr("Reasons for parse failures (NOT cumulative):"); duke@435: duke@435: if( explicit_null_checks_inserted ) duke@435: tty->print_cr("%d original NULL checks - %d elided (%2d%%); optimizer leaves %d,", explicit_null_checks_inserted, explicit_null_checks_elided, (100*explicit_null_checks_elided)/explicit_null_checks_inserted, all_null_checks_found); duke@435: if( all_null_checks_found ) duke@435: tty->print_cr("%d made implicit (%2d%%)", implicit_null_checks, duke@435: (100*implicit_null_checks)/all_null_checks_found); duke@435: if( implicit_null_throws ) duke@435: tty->print_cr("%d implicit null exceptions at runtime", duke@435: implicit_null_throws); duke@435: duke@435: if( PrintParseStatistics && BytecodeParseHistogram::initialized() ) { duke@435: BytecodeParseHistogram::print(); duke@435: } duke@435: } duke@435: #endif duke@435: duke@435: //------------------------------ON STACK REPLACEMENT--------------------------- duke@435: duke@435: // Construct a node which can be used to get incoming state for duke@435: // on stack replacement. duke@435: Node *Parse::fetch_interpreter_state(int index, duke@435: BasicType bt, duke@435: Node *local_addrs, duke@435: Node *local_addrs_base) { duke@435: Node *mem = memory(Compile::AliasIdxRaw); duke@435: Node *adr = basic_plus_adr( local_addrs_base, local_addrs, -index*wordSize ); duke@435: duke@435: // Very similar to LoadNode::make, except we handle un-aligned longs and duke@435: // doubles on Sparc. Intel can handle them just fine directly. duke@435: Node *l; duke@435: switch( bt ) { // Signature is flattened duke@435: case T_INT: l = new (C, 3) LoadINode( 0, mem, adr, TypeRawPtr::BOTTOM ); break; duke@435: case T_FLOAT: l = new (C, 3) LoadFNode( 0, mem, adr, TypeRawPtr::BOTTOM ); break; duke@435: case T_ADDRESS: duke@435: case T_OBJECT: l = new (C, 3) LoadPNode( 0, mem, adr, TypeRawPtr::BOTTOM, TypeInstPtr::BOTTOM ); break; duke@435: case T_LONG: duke@435: case T_DOUBLE: { duke@435: // Since arguments are in reverse order, the argument address 'adr' duke@435: // refers to the back half of the long/double. Recompute adr. duke@435: adr = basic_plus_adr( local_addrs_base, local_addrs, -(index+1)*wordSize ); duke@435: if( Matcher::misaligned_doubles_ok ) { duke@435: l = (bt == T_DOUBLE) duke@435: ? (Node*)new (C, 3) LoadDNode( 0, mem, adr, TypeRawPtr::BOTTOM ) duke@435: : (Node*)new (C, 3) LoadLNode( 0, mem, adr, TypeRawPtr::BOTTOM ); duke@435: } else { duke@435: l = (bt == T_DOUBLE) duke@435: ? (Node*)new (C, 3) LoadD_unalignedNode( 0, mem, adr, TypeRawPtr::BOTTOM ) duke@435: : (Node*)new (C, 3) LoadL_unalignedNode( 0, mem, adr, TypeRawPtr::BOTTOM ); duke@435: } duke@435: break; duke@435: } duke@435: default: ShouldNotReachHere(); duke@435: } duke@435: return _gvn.transform(l); duke@435: } duke@435: duke@435: // Helper routine to prevent the interpreter from handing duke@435: // unexpected typestate to an OSR method. duke@435: // The Node l is a value newly dug out of the interpreter frame. duke@435: // The type is the type predicted by ciTypeFlow. Note that it is duke@435: // not a general type, but can only come from Type::get_typeflow_type. duke@435: // The safepoint is a map which will feed an uncommon trap. duke@435: Node* Parse::check_interpreter_type(Node* l, const Type* type, duke@435: SafePointNode* &bad_type_exit) { duke@435: duke@435: const TypeOopPtr* tp = type->isa_oopptr(); duke@435: duke@435: // TypeFlow may assert null-ness if a type appears unloaded. duke@435: if (type == TypePtr::NULL_PTR || duke@435: (tp != NULL && !tp->klass()->is_loaded())) { duke@435: // Value must be null, not a real oop. duke@435: Node* chk = _gvn.transform( new (C, 3) CmpPNode(l, null()) ); duke@435: Node* tst = _gvn.transform( new (C, 2) BoolNode(chk, BoolTest::eq) ); duke@435: IfNode* iff = create_and_map_if(control(), tst, PROB_MAX, COUNT_UNKNOWN); duke@435: set_control(_gvn.transform( new (C, 1) IfTrueNode(iff) )); duke@435: Node* bad_type = _gvn.transform( new (C, 1) IfFalseNode(iff) ); duke@435: bad_type_exit->control()->add_req(bad_type); duke@435: l = null(); duke@435: } duke@435: duke@435: // Typeflow can also cut off paths from the CFG, based on duke@435: // types which appear unloaded, or call sites which appear unlinked. duke@435: // When paths are cut off, values at later merge points can rise duke@435: // toward more specific classes. Make sure these specific classes duke@435: // are still in effect. duke@435: if (tp != NULL && tp->klass() != C->env()->Object_klass()) { duke@435: // TypeFlow asserted a specific object type. Value must have that type. duke@435: Node* bad_type_ctrl = NULL; duke@435: l = gen_checkcast(l, makecon(TypeKlassPtr::make(tp->klass())), &bad_type_ctrl); duke@435: bad_type_exit->control()->add_req(bad_type_ctrl); duke@435: } duke@435: duke@435: BasicType bt_l = _gvn.type(l)->basic_type(); duke@435: BasicType bt_t = type->basic_type(); duke@435: assert(_gvn.type(l)->higher_equal(type), "must constrain OSR typestate"); duke@435: return l; duke@435: } duke@435: duke@435: // Helper routine which sets up elements of the initial parser map when duke@435: // performing a parse for on stack replacement. Add values into map. duke@435: // The only parameter contains the address of a interpreter arguments. duke@435: void Parse::load_interpreter_state(Node* osr_buf) { duke@435: int index; duke@435: int max_locals = jvms()->loc_size(); duke@435: int max_stack = jvms()->stk_size(); duke@435: duke@435: duke@435: // Mismatch between method and jvms can occur since map briefly held duke@435: // an OSR entry state (which takes up one RawPtr word). duke@435: assert(max_locals == method()->max_locals(), "sanity"); duke@435: assert(max_stack >= method()->max_stack(), "sanity"); duke@435: assert((int)jvms()->endoff() == TypeFunc::Parms + max_locals + max_stack, "sanity"); duke@435: assert((int)jvms()->endoff() == (int)map()->req(), "sanity"); duke@435: duke@435: // Find the start block. duke@435: Block* osr_block = start_block(); duke@435: assert(osr_block->start() == osr_bci(), "sanity"); duke@435: duke@435: // Set initial BCI. duke@435: set_parse_bci(osr_block->start()); duke@435: duke@435: // Set initial stack depth. duke@435: set_sp(osr_block->start_sp()); duke@435: duke@435: // Check bailouts. We currently do not perform on stack replacement duke@435: // of loops in catch blocks or loops which branch with a non-empty stack. duke@435: if (sp() != 0) { duke@435: C->record_method_not_compilable("OSR starts with non-empty stack"); duke@435: return; duke@435: } duke@435: // Do not OSR inside finally clauses: duke@435: if (osr_block->has_trap_at(osr_block->start())) { duke@435: C->record_method_not_compilable("OSR starts with an immediate trap"); duke@435: return; duke@435: } duke@435: duke@435: // Commute monitors from interpreter frame to compiler frame. duke@435: assert(jvms()->monitor_depth() == 0, "should be no active locks at beginning of osr"); duke@435: int mcnt = osr_block->flow()->monitor_count(); duke@435: Node *monitors_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals+mcnt*2-1)*wordSize); duke@435: for (index = 0; index < mcnt; index++) { duke@435: // Make a BoxLockNode for the monitor. duke@435: Node *box = _gvn.transform(new (C, 1) BoxLockNode(next_monitor())); duke@435: duke@435: duke@435: // Displaced headers and locked objects are interleaved in the duke@435: // temp OSR buffer. We only copy the locked objects out here. duke@435: // Fetch the locked object from the OSR temp buffer and copy to our fastlock node. duke@435: Node *lock_object = fetch_interpreter_state(index*2, T_OBJECT, monitors_addr, osr_buf); duke@435: // Try and copy the displaced header to the BoxNode duke@435: Node *displaced_hdr = fetch_interpreter_state((index*2) + 1, T_ADDRESS, monitors_addr, osr_buf); duke@435: duke@435: duke@435: store_to_memory(control(), box, displaced_hdr, T_ADDRESS, Compile::AliasIdxRaw); duke@435: duke@435: // Build a bogus FastLockNode (no code will be generated) and push the duke@435: // monitor into our debug info. duke@435: const FastLockNode *flock = _gvn.transform(new (C, 3) FastLockNode( 0, lock_object, box ))->as_FastLock(); duke@435: map()->push_monitor(flock); duke@435: duke@435: // If the lock is our method synchronization lock, tuck it away in duke@435: // _sync_lock for return and rethrow exit paths. duke@435: if (index == 0 && method()->is_synchronized()) { duke@435: _synch_lock = flock; duke@435: } duke@435: } duke@435: duke@435: MethodLivenessResult live_locals = method()->liveness_at_bci(osr_bci()); duke@435: if (!live_locals.is_valid()) { duke@435: // Degenerate or breakpointed method. duke@435: C->record_method_not_compilable("OSR in empty or breakpointed method"); duke@435: return; duke@435: } duke@435: duke@435: // Extract the needed locals from the interpreter frame. duke@435: Node *locals_addr = basic_plus_adr(osr_buf, osr_buf, (max_locals-1)*wordSize); duke@435: duke@435: // find all the locals that the interpreter thinks contain live oops duke@435: const BitMap live_oops = method()->live_local_oops_at_bci(osr_bci()); duke@435: for (index = 0; index < max_locals; index++) { duke@435: duke@435: if (!live_locals.at(index)) { duke@435: continue; duke@435: } duke@435: duke@435: const Type *type = osr_block->local_type_at(index); duke@435: duke@435: if (type->isa_oopptr() != NULL) { duke@435: duke@435: // 6403625: Verify that the interpreter oopMap thinks that the oop is live duke@435: // else we might load a stale oop if the MethodLiveness disagrees with the duke@435: // result of the interpreter. If the interpreter says it is dead we agree duke@435: // by making the value go to top. duke@435: // duke@435: duke@435: if (!live_oops.at(index)) { duke@435: if (C->log() != NULL) { duke@435: C->log()->elem("OSR_mismatch local_index='%d'",index); duke@435: } duke@435: set_local(index, null()); duke@435: // and ignore it for the loads duke@435: continue; duke@435: } duke@435: } duke@435: duke@435: // Filter out TOP, HALF, and BOTTOM. (Cf. ensure_phi.) duke@435: if (type == Type::TOP || type == Type::HALF) { duke@435: continue; duke@435: } duke@435: // If the type falls to bottom, then this must be a local that duke@435: // is mixing ints and oops or some such. Forcing it to top duke@435: // makes it go dead. duke@435: if (type == Type::BOTTOM) { duke@435: continue; duke@435: } duke@435: // Construct code to access the appropriate local. duke@435: Node *value = fetch_interpreter_state(index, type->basic_type(), locals_addr, osr_buf); duke@435: set_local(index, value); duke@435: } duke@435: duke@435: // Extract the needed stack entries from the interpreter frame. duke@435: for (index = 0; index < sp(); index++) { duke@435: const Type *type = osr_block->stack_type_at(index); duke@435: if (type != Type::TOP) { duke@435: // Currently the compiler bails out when attempting to on stack replace duke@435: // at a bci with a non-empty stack. We should not reach here. duke@435: ShouldNotReachHere(); duke@435: } duke@435: } duke@435: duke@435: // End the OSR migration duke@435: make_runtime_call(RC_LEAF, OptoRuntime::osr_end_Type(), duke@435: CAST_FROM_FN_PTR(address, SharedRuntime::OSR_migration_end), duke@435: "OSR_migration_end", TypeRawPtr::BOTTOM, duke@435: osr_buf); duke@435: duke@435: // Now that the interpreter state is loaded, make sure it will match duke@435: // at execution time what the compiler is expecting now: duke@435: SafePointNode* bad_type_exit = clone_map(); duke@435: bad_type_exit->set_control(new (C, 1) RegionNode(1)); duke@435: duke@435: for (index = 0; index < max_locals; index++) { duke@435: if (stopped()) break; duke@435: Node* l = local(index); duke@435: if (l->is_top()) continue; // nothing here duke@435: const Type *type = osr_block->local_type_at(index); duke@435: if (type->isa_oopptr() != NULL) { duke@435: if (!live_oops.at(index)) { duke@435: // skip type check for dead oops duke@435: continue; duke@435: } duke@435: } duke@435: set_local(index, check_interpreter_type(l, type, bad_type_exit)); duke@435: } duke@435: duke@435: for (index = 0; index < sp(); index++) { duke@435: if (stopped()) break; duke@435: Node* l = stack(index); duke@435: if (l->is_top()) continue; // nothing here duke@435: const Type *type = osr_block->stack_type_at(index); duke@435: set_stack(index, check_interpreter_type(l, type, bad_type_exit)); duke@435: } duke@435: duke@435: if (bad_type_exit->control()->req() > 1) { duke@435: // Build an uncommon trap here, if any inputs can be unexpected. duke@435: bad_type_exit->set_control(_gvn.transform( bad_type_exit->control() )); duke@435: record_for_igvn(bad_type_exit->control()); duke@435: SafePointNode* types_are_good = map(); duke@435: set_map(bad_type_exit); duke@435: // The unexpected type happens because a new edge is active duke@435: // in the CFG, which typeflow had previously ignored. duke@435: // E.g., Object x = coldAtFirst() && notReached()? "str": new Integer(123). duke@435: // This x will be typed as Integer if notReached is not yet linked. duke@435: uncommon_trap(Deoptimization::Reason_unreached, duke@435: Deoptimization::Action_reinterpret); duke@435: set_map(types_are_good); duke@435: } duke@435: } duke@435: duke@435: //------------------------------Parse------------------------------------------ duke@435: // Main parser constructor. duke@435: Parse::Parse(JVMState* caller, ciMethod* parse_method, float expected_uses) duke@435: : _exits(caller) duke@435: { duke@435: // Init some variables duke@435: _caller = caller; duke@435: _method = parse_method; duke@435: _expected_uses = expected_uses; duke@435: _depth = 1 + (caller->has_method() ? caller->depth() : 0); duke@435: _wrote_final = false; duke@435: _entry_bci = InvocationEntryBci; duke@435: _tf = NULL; duke@435: _block = NULL; duke@435: debug_only(_block_count = -1); duke@435: debug_only(_blocks = (Block*)-1); duke@435: #ifndef PRODUCT duke@435: if (PrintCompilation || PrintOpto) { duke@435: // Make sure I have an inline tree, so I can print messages about it. duke@435: JVMState* ilt_caller = is_osr_parse() ? caller->caller() : caller; duke@435: InlineTree::find_subtree_from_root(C->ilt(), ilt_caller, parse_method, true); duke@435: } duke@435: _max_switch_depth = 0; duke@435: _est_switch_depth = 0; duke@435: #endif duke@435: duke@435: _tf = TypeFunc::make(method()); duke@435: _iter.reset_to_method(method()); duke@435: _flow = method()->get_flow_analysis(); duke@435: if (_flow->failing()) { duke@435: C->record_method_not_compilable_all_tiers(_flow->failure_reason()); duke@435: } duke@435: duke@435: if (_expected_uses <= 0) { duke@435: _prof_factor = 1; duke@435: } else { duke@435: float prof_total = parse_method->interpreter_invocation_count(); duke@435: if (prof_total <= _expected_uses) { duke@435: _prof_factor = 1; duke@435: } else { duke@435: _prof_factor = _expected_uses / prof_total; duke@435: } duke@435: } duke@435: duke@435: CompileLog* log = C->log(); duke@435: if (log != NULL) { duke@435: log->begin_head("parse method='%d' uses='%g'", duke@435: log->identify(parse_method), expected_uses); duke@435: if (depth() == 1 && C->is_osr_compilation()) { duke@435: log->print(" osr_bci='%d'", C->entry_bci()); duke@435: } duke@435: log->stamp(); duke@435: log->end_head(); duke@435: } duke@435: duke@435: // Accumulate deoptimization counts. duke@435: // (The range_check and store_check counts are checked elsewhere.) duke@435: ciMethodData* md = method()->method_data(); duke@435: for (uint reason = 0; reason < md->trap_reason_limit(); reason++) { duke@435: uint md_count = md->trap_count(reason); duke@435: if (md_count != 0) { duke@435: if (md_count == md->trap_count_limit()) duke@435: md_count += md->overflow_trap_count(); duke@435: uint total_count = C->trap_count(reason); duke@435: uint old_count = total_count; duke@435: total_count += md_count; duke@435: // Saturate the add if it overflows. duke@435: if (total_count < old_count || total_count < md_count) duke@435: total_count = (uint)-1; duke@435: C->set_trap_count(reason, total_count); duke@435: if (log != NULL) duke@435: log->elem("observe trap='%s' count='%d' total='%d'", duke@435: Deoptimization::trap_reason_name(reason), duke@435: md_count, total_count); duke@435: } duke@435: } duke@435: // Accumulate total sum of decompilations, also. duke@435: C->set_decompile_count(C->decompile_count() + md->decompile_count()); duke@435: duke@435: _count_invocations = C->do_count_invocations(); duke@435: _method_data_update = C->do_method_data_update(); duke@435: duke@435: if (log != NULL && method()->has_exception_handlers()) { duke@435: log->elem("observe that='has_exception_handlers'"); duke@435: } duke@435: duke@435: assert(method()->can_be_compiled(), "Can not parse this method, cutout earlier"); duke@435: assert(method()->has_balanced_monitors(), "Can not parse unbalanced monitors, cutout earlier"); duke@435: duke@435: // Always register dependence if JVMTI is enabled, because duke@435: // either breakpoint setting or hotswapping of methods may duke@435: // cause deoptimization. duke@435: if (JvmtiExport::can_hotswap_or_post_breakpoint()) { duke@435: C->dependencies()->assert_evol_method(method()); duke@435: } duke@435: duke@435: methods_seen++; duke@435: duke@435: // Do some special top-level things. duke@435: if (depth() == 1 && C->is_osr_compilation()) { duke@435: _entry_bci = C->entry_bci(); duke@435: _flow = method()->get_osr_flow_analysis(osr_bci()); duke@435: if (_flow->failing()) { duke@435: C->record_method_not_compilable(_flow->failure_reason()); duke@435: #ifndef PRODUCT duke@435: if (PrintOpto && (Verbose || WizardMode)) { duke@435: tty->print_cr("OSR @%d type flow bailout: %s", _entry_bci, _flow->failure_reason()); duke@435: if (Verbose) { duke@435: method()->print_oop(); duke@435: method()->print_codes(); duke@435: _flow->print(); duke@435: } duke@435: } duke@435: #endif duke@435: } duke@435: _tf = C->tf(); // the OSR entry type is different duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: if (depth() == 1) { duke@435: assert(C->is_osr_compilation() == this->is_osr_parse(), "OSR in sync"); duke@435: if (C->tf() != tf()) { duke@435: MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); duke@435: assert(C->env()->system_dictionary_modification_counter_changed(), duke@435: "Must invalidate if TypeFuncs differ"); duke@435: } duke@435: } else { duke@435: assert(!this->is_osr_parse(), "no recursive OSR"); duke@435: } duke@435: #endif duke@435: duke@435: methods_parsed++; duke@435: #ifndef PRODUCT duke@435: // add method size here to guarantee that inlined methods are added too duke@435: if (TimeCompiler) duke@435: _total_bytes_compiled += method()->code_size(); duke@435: duke@435: show_parse_info(); duke@435: #endif duke@435: duke@435: if (failing()) { duke@435: if (log) log->done("parse"); duke@435: return; duke@435: } duke@435: duke@435: gvn().set_type(root(), root()->bottom_type()); duke@435: gvn().transform(top()); duke@435: duke@435: // Import the results of the ciTypeFlow. duke@435: init_blocks(); duke@435: duke@435: // Merge point for all normal exits duke@435: build_exits(); duke@435: duke@435: // Setup the initial JVM state map. duke@435: SafePointNode* entry_map = create_entry_map(); duke@435: duke@435: // Check for bailouts during map initialization duke@435: if (failing() || entry_map == NULL) { duke@435: if (log) log->done("parse"); duke@435: return; duke@435: } duke@435: duke@435: Node_Notes* caller_nn = C->default_node_notes(); duke@435: // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls. duke@435: if (DebugInlinedCalls || depth() == 1) { duke@435: C->set_default_node_notes(make_node_notes(caller_nn)); duke@435: } duke@435: duke@435: if (is_osr_parse()) { duke@435: Node* osr_buf = entry_map->in(TypeFunc::Parms+0); duke@435: entry_map->set_req(TypeFunc::Parms+0, top()); duke@435: set_map(entry_map); duke@435: load_interpreter_state(osr_buf); duke@435: } else { duke@435: set_map(entry_map); duke@435: do_method_entry(); duke@435: } duke@435: duke@435: // Check for bailouts during method entry. duke@435: if (failing()) { duke@435: if (log) log->done("parse"); duke@435: C->set_default_node_notes(caller_nn); duke@435: return; duke@435: } duke@435: duke@435: entry_map = map(); // capture any changes performed by method setup code duke@435: assert(jvms()->endoff() == map()->req(), "map matches JVMS layout"); duke@435: duke@435: // We begin parsing as if we have just encountered a jump to the duke@435: // method entry. duke@435: Block* entry_block = start_block(); duke@435: assert(entry_block->start() == (is_osr_parse() ? osr_bci() : 0), ""); duke@435: set_map_clone(entry_map); duke@435: merge_common(entry_block, entry_block->next_path_num()); duke@435: duke@435: #ifndef PRODUCT duke@435: BytecodeParseHistogram *parse_histogram_obj = new (C->env()->arena()) BytecodeParseHistogram(this, C); duke@435: set_parse_histogram( parse_histogram_obj ); duke@435: #endif duke@435: duke@435: // Parse all the basic blocks. duke@435: do_all_blocks(); duke@435: duke@435: C->set_default_node_notes(caller_nn); duke@435: duke@435: // Check for bailouts during conversion to graph duke@435: if (failing()) { duke@435: if (log) log->done("parse"); duke@435: return; duke@435: } duke@435: duke@435: // Fix up all exiting control flow. duke@435: set_map(entry_map); duke@435: do_exits(); duke@435: duke@435: // Collect a few more statistics. duke@435: parse_idx += C->unique(); duke@435: parse_arena += C->node_arena()->used(); duke@435: duke@435: if (log) log->done("parse nodes='%d' memory='%d'", duke@435: C->unique(), C->node_arena()->used()); duke@435: } duke@435: duke@435: //---------------------------do_all_blocks------------------------------------- duke@435: void Parse::do_all_blocks() { duke@435: _blocks_merged = 0; duke@435: _blocks_parsed = 0; duke@435: duke@435: int old_blocks_merged = -1; duke@435: int old_blocks_parsed = -1; duke@435: duke@435: for (int tries = 0; ; tries++) { duke@435: visit_blocks(); duke@435: if (failing()) return; // Check for bailout duke@435: duke@435: // No need for a work list. The outer loop is hardly ever repeated. duke@435: // The following loop traverses the blocks in a reasonable pre-order, duke@435: // as produced by the ciTypeFlow pass. duke@435: duke@435: // This loop can be taken more than once if there are two entries to duke@435: // a loop (irreduceable CFG), and the edge which ciTypeFlow chose duke@435: // as the first predecessor to the loop goes dead in the parser, duke@435: // due to parse-time optimization. (Could happen with obfuscated code.) duke@435: duke@435: // Look for progress, or the lack of it: duke@435: if (_blocks_parsed == block_count()) { duke@435: // That's all, folks. duke@435: if (TraceOptoParse) { duke@435: tty->print_cr("All blocks parsed."); duke@435: } duke@435: break; duke@435: } duke@435: duke@435: // How much work was done this time around? duke@435: int new_blocks_merged = _blocks_merged - old_blocks_merged; duke@435: int new_blocks_parsed = _blocks_parsed - old_blocks_parsed; duke@435: if (new_blocks_merged == 0) { duke@435: if (TraceOptoParse) { duke@435: tty->print_cr("All live blocks parsed; %d dead blocks.", block_count() - _blocks_parsed); duke@435: } duke@435: // No new blocks have become parseable. Some blocks are just dead. duke@435: break; duke@435: } duke@435: assert(new_blocks_parsed > 0, "must make progress"); duke@435: assert(tries < block_count(), "the pre-order cannot be this bad!"); duke@435: duke@435: old_blocks_merged = _blocks_merged; duke@435: old_blocks_parsed = _blocks_parsed; duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: // Make sure there are no half-processed blocks remaining. duke@435: // Every remaining unprocessed block is dead and may be ignored now. duke@435: for (int po = 0; po < block_count(); po++) { duke@435: Block* block = pre_order_at(po); duke@435: if (!block->is_parsed()) { duke@435: if (TraceOptoParse) { duke@435: tty->print("Skipped dead block %d at bci:%d", po, block->start()); duke@435: assert(!block->is_merged(), "no half-processed blocks"); duke@435: } duke@435: } duke@435: } duke@435: #endif duke@435: } duke@435: duke@435: //---------------------------visit_blocks-------------------------------------- duke@435: void Parse::visit_blocks() { duke@435: // Walk over all blocks, parsing every one that has been reached (merged). duke@435: for (int po = 0; po < block_count(); po++) { duke@435: Block* block = pre_order_at(po); duke@435: duke@435: if (block->is_parsed()) { duke@435: // Do not parse twice. duke@435: continue; duke@435: } duke@435: duke@435: if (!block->is_merged()) { duke@435: // No state on this block. It had not yet been reached. duke@435: // Delay reaching it until later. duke@435: continue; duke@435: } duke@435: duke@435: // Prepare to parse this block. duke@435: load_state_from(block); duke@435: duke@435: if (stopped()) { duke@435: // Block is dead. duke@435: continue; duke@435: } duke@435: duke@435: if (!block->is_ready() || block->is_handler()) { duke@435: // Not all preds have been parsed. We must build phis everywhere. duke@435: // (Note that dead locals do not get phis built, ever.) duke@435: ensure_phis_everywhere(); duke@435: duke@435: // Leave behind an undisturbed copy of the map, for future merges. duke@435: set_map(clone_map()); duke@435: } duke@435: duke@435: // Ready or not, parse the block. duke@435: do_one_block(); duke@435: duke@435: // Check for bailouts. duke@435: if (failing()) return; duke@435: } duke@435: } duke@435: duke@435: //-------------------------------build_exits---------------------------------- duke@435: // Build normal and exceptional exit merge points. duke@435: void Parse::build_exits() { duke@435: // make a clone of caller to prevent sharing of side-effects duke@435: _exits.set_map(_exits.clone_map()); duke@435: _exits.clean_stack(_exits.sp()); duke@435: _exits.sync_jvms(); duke@435: duke@435: RegionNode* region = new (C, 1) RegionNode(1); duke@435: record_for_igvn(region); duke@435: gvn().set_type_bottom(region); duke@435: _exits.set_control(region); duke@435: duke@435: // Note: iophi and memphi are not transformed until do_exits. duke@435: Node* iophi = new (C, region->req()) PhiNode(region, Type::ABIO); duke@435: Node* memphi = new (C, region->req()) PhiNode(region, Type::MEMORY, TypePtr::BOTTOM); duke@435: _exits.set_i_o(iophi); duke@435: _exits.set_all_memory(memphi); duke@435: duke@435: // Add a return value to the exit state. (Do not push it yet.) duke@435: if (tf()->range()->cnt() > TypeFunc::Parms) { duke@435: const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms); duke@435: // Don't "bind" an unloaded return klass to the ret_phi. If the klass duke@435: // becomes loaded during the subsequent parsing, the loaded and unloaded duke@435: // types will not join when we transform and push in do_exits(). duke@435: const TypeOopPtr* ret_oop_type = ret_type->isa_oopptr(); duke@435: if (ret_oop_type && !ret_oop_type->klass()->is_loaded()) { duke@435: ret_type = TypeOopPtr::BOTTOM; duke@435: } duke@435: int ret_size = type2size[ret_type->basic_type()]; duke@435: Node* ret_phi = new (C, region->req()) PhiNode(region, ret_type); duke@435: _exits.ensure_stack(ret_size); duke@435: assert((int)(tf()->range()->cnt() - TypeFunc::Parms) == ret_size, "good tf range"); duke@435: assert(method()->return_type()->size() == ret_size, "tf agrees w/ method"); duke@435: _exits.set_argument(0, ret_phi); // here is where the parser finds it duke@435: // Note: ret_phi is not yet pushed, until do_exits. duke@435: } duke@435: } duke@435: duke@435: duke@435: //----------------------------build_start_state------------------------------- duke@435: // Construct a state which contains only the incoming arguments from an duke@435: // unknown caller. The method & bci will be NULL & InvocationEntryBci. duke@435: JVMState* Compile::build_start_state(StartNode* start, const TypeFunc* tf) { duke@435: int arg_size = tf->domain()->cnt(); duke@435: int max_size = MAX2(arg_size, (int)tf->range()->cnt()); duke@435: JVMState* jvms = new (this) JVMState(max_size - TypeFunc::Parms); duke@435: SafePointNode* map = new (this, max_size) SafePointNode(max_size, NULL); duke@435: record_for_igvn(map); duke@435: assert(arg_size == TypeFunc::Parms + (is_osr_compilation() ? 1 : method()->arg_size()), "correct arg_size"); duke@435: Node_Notes* old_nn = default_node_notes(); duke@435: if (old_nn != NULL && has_method()) { duke@435: Node_Notes* entry_nn = old_nn->clone(this); duke@435: JVMState* entry_jvms = new(this) JVMState(method(), old_nn->jvms()); duke@435: entry_jvms->set_offsets(0); duke@435: entry_jvms->set_bci(entry_bci()); duke@435: entry_nn->set_jvms(entry_jvms); duke@435: set_default_node_notes(entry_nn); duke@435: } duke@435: uint i; duke@435: for (i = 0; i < (uint)arg_size; i++) { duke@435: Node* parm = initial_gvn()->transform(new (this, 1) ParmNode(start, i)); duke@435: map->init_req(i, parm); duke@435: // Record all these guys for later GVN. duke@435: record_for_igvn(parm); duke@435: } duke@435: for (; i < map->req(); i++) { duke@435: map->init_req(i, top()); duke@435: } duke@435: assert(jvms->argoff() == TypeFunc::Parms, "parser gets arguments here"); duke@435: set_default_node_notes(old_nn); duke@435: map->set_jvms(jvms); duke@435: jvms->set_map(map); duke@435: return jvms; duke@435: } duke@435: duke@435: //-----------------------------make_node_notes--------------------------------- duke@435: Node_Notes* Parse::make_node_notes(Node_Notes* caller_nn) { duke@435: if (caller_nn == NULL) return NULL; duke@435: Node_Notes* nn = caller_nn->clone(C); duke@435: JVMState* caller_jvms = nn->jvms(); duke@435: JVMState* jvms = new (C) JVMState(method(), caller_jvms); duke@435: jvms->set_offsets(0); duke@435: jvms->set_bci(_entry_bci); duke@435: nn->set_jvms(jvms); duke@435: return nn; duke@435: } duke@435: duke@435: duke@435: //--------------------------return_values-------------------------------------- duke@435: void Compile::return_values(JVMState* jvms) { duke@435: GraphKit kit(jvms); duke@435: Node* ret = new (this, TypeFunc::Parms) ReturnNode(TypeFunc::Parms, duke@435: kit.control(), duke@435: kit.i_o(), duke@435: kit.reset_memory(), duke@435: kit.frameptr(), duke@435: kit.returnadr()); duke@435: // Add zero or 1 return values duke@435: int ret_size = tf()->range()->cnt() - TypeFunc::Parms; duke@435: if (ret_size > 0) { duke@435: kit.inc_sp(-ret_size); // pop the return value(s) duke@435: kit.sync_jvms(); duke@435: ret->add_req(kit.argument(0)); duke@435: // Note: The second dummy edge is not needed by a ReturnNode. duke@435: } duke@435: // bind it to root duke@435: root()->add_req(ret); duke@435: record_for_igvn(ret); duke@435: initial_gvn()->transform_no_reclaim(ret); duke@435: } duke@435: duke@435: //------------------------rethrow_exceptions----------------------------------- duke@435: // Bind all exception states in the list into a single RethrowNode. duke@435: void Compile::rethrow_exceptions(JVMState* jvms) { duke@435: GraphKit kit(jvms); duke@435: if (!kit.has_exceptions()) return; // nothing to generate duke@435: // Load my combined exception state into the kit, with all phis transformed: duke@435: SafePointNode* ex_map = kit.combine_and_pop_all_exception_states(); duke@435: Node* ex_oop = kit.use_exception_state(ex_map); duke@435: RethrowNode* exit = new (this, TypeFunc::Parms + 1) RethrowNode(kit.control(), duke@435: kit.i_o(), kit.reset_memory(), duke@435: kit.frameptr(), kit.returnadr(), duke@435: // like a return but with exception input duke@435: ex_oop); duke@435: // bind to root duke@435: root()->add_req(exit); duke@435: record_for_igvn(exit); duke@435: initial_gvn()->transform_no_reclaim(exit); duke@435: } duke@435: duke@435: bool Parse::can_rerun_bytecode() { duke@435: switch (bc()) { duke@435: case Bytecodes::_ldc: duke@435: case Bytecodes::_ldc_w: duke@435: case Bytecodes::_ldc2_w: duke@435: case Bytecodes::_getfield: duke@435: case Bytecodes::_putfield: duke@435: case Bytecodes::_getstatic: duke@435: case Bytecodes::_putstatic: duke@435: case Bytecodes::_arraylength: duke@435: case Bytecodes::_baload: duke@435: case Bytecodes::_caload: duke@435: case Bytecodes::_iaload: duke@435: case Bytecodes::_saload: duke@435: case Bytecodes::_faload: duke@435: case Bytecodes::_aaload: duke@435: case Bytecodes::_laload: duke@435: case Bytecodes::_daload: duke@435: case Bytecodes::_bastore: duke@435: case Bytecodes::_castore: duke@435: case Bytecodes::_iastore: duke@435: case Bytecodes::_sastore: duke@435: case Bytecodes::_fastore: duke@435: case Bytecodes::_aastore: duke@435: case Bytecodes::_lastore: duke@435: case Bytecodes::_dastore: duke@435: case Bytecodes::_irem: duke@435: case Bytecodes::_idiv: duke@435: case Bytecodes::_lrem: duke@435: case Bytecodes::_ldiv: duke@435: case Bytecodes::_frem: duke@435: case Bytecodes::_fdiv: duke@435: case Bytecodes::_drem: duke@435: case Bytecodes::_ddiv: duke@435: case Bytecodes::_checkcast: duke@435: case Bytecodes::_instanceof: duke@435: case Bytecodes::_athrow: duke@435: case Bytecodes::_anewarray: duke@435: case Bytecodes::_newarray: duke@435: case Bytecodes::_multianewarray: duke@435: case Bytecodes::_new: duke@435: case Bytecodes::_monitorenter: // can re-run initial null check, only duke@435: case Bytecodes::_return: duke@435: return true; duke@435: break; duke@435: duke@435: case Bytecodes::_invokestatic: duke@435: case Bytecodes::_invokespecial: duke@435: case Bytecodes::_invokevirtual: duke@435: case Bytecodes::_invokeinterface: duke@435: return false; duke@435: break; duke@435: duke@435: default: duke@435: assert(false, "unexpected bytecode produced an exception"); duke@435: return true; duke@435: } duke@435: } duke@435: duke@435: //---------------------------do_exceptions------------------------------------- duke@435: // Process exceptions arising from the current bytecode. duke@435: // Send caught exceptions to the proper handler within this method. duke@435: // Unhandled exceptions feed into _exit. duke@435: void Parse::do_exceptions() { duke@435: if (!has_exceptions()) return; duke@435: duke@435: if (failing()) { duke@435: // Pop them all off and throw them away. duke@435: while (pop_exception_state() != NULL) ; duke@435: return; duke@435: } duke@435: duke@435: // Make sure we can classify this bytecode if we need to. duke@435: debug_only(can_rerun_bytecode()); duke@435: duke@435: PreserveJVMState pjvms(this, false); duke@435: duke@435: SafePointNode* ex_map; duke@435: while ((ex_map = pop_exception_state()) != NULL) { duke@435: if (!method()->has_exception_handlers()) { duke@435: // Common case: Transfer control outward. duke@435: // Doing it this early allows the exceptions to common up duke@435: // even between adjacent method calls. duke@435: throw_to_exit(ex_map); duke@435: } else { duke@435: // Have to look at the exception first. duke@435: assert(stopped(), "catch_inline_exceptions trashes the map"); duke@435: catch_inline_exceptions(ex_map); duke@435: stop_and_kill_map(); // we used up this exception state; kill it duke@435: } duke@435: } duke@435: duke@435: // We now return to our regularly scheduled program: duke@435: } duke@435: duke@435: //---------------------------throw_to_exit------------------------------------- duke@435: // Merge the given map into an exception exit from this method. duke@435: // The exception exit will handle any unlocking of receiver. duke@435: // The ex_oop must be saved within the ex_map, unlike merge_exception. duke@435: void Parse::throw_to_exit(SafePointNode* ex_map) { duke@435: // Pop the JVMS to (a copy of) the caller. duke@435: GraphKit caller; duke@435: caller.set_map_clone(_caller->map()); duke@435: caller.set_bci(_caller->bci()); duke@435: caller.set_sp(_caller->sp()); duke@435: // Copy out the standard machine state: duke@435: for (uint i = 0; i < TypeFunc::Parms; i++) { duke@435: caller.map()->set_req(i, ex_map->in(i)); duke@435: } duke@435: // ...and the exception: duke@435: Node* ex_oop = saved_ex_oop(ex_map); duke@435: SafePointNode* caller_ex_map = caller.make_exception_state(ex_oop); duke@435: // Finally, collect the new exception state in my exits: duke@435: _exits.add_exception_state(caller_ex_map); duke@435: } duke@435: duke@435: //------------------------------do_exits--------------------------------------- duke@435: void Parse::do_exits() { duke@435: set_parse_bci(InvocationEntryBci); duke@435: duke@435: // Now peephole on the return bits duke@435: Node* region = _exits.control(); duke@435: _exits.set_control(gvn().transform(region)); duke@435: duke@435: Node* iophi = _exits.i_o(); duke@435: _exits.set_i_o(gvn().transform(iophi)); duke@435: duke@435: if (wrote_final()) { duke@435: // This method (which must be a constructor by the rules of Java) duke@435: // wrote a final. The effects of all initializations must be duke@435: // committed to memory before any code after the constructor duke@435: // publishes the reference to the newly constructor object. duke@435: // Rather than wait for the publication, we simply block the duke@435: // writes here. Rather than put a barrier on only those writes duke@435: // which are required to complete, we force all writes to complete. duke@435: // duke@435: // "All bets are off" unless the first publication occurs after a duke@435: // normal return from the constructor. We do not attempt to detect duke@435: // such unusual early publications. But no barrier is needed on duke@435: // exceptional returns, since they cannot publish normally. duke@435: // duke@435: _exits.insert_mem_bar(Op_MemBarRelease); duke@435: #ifndef PRODUCT duke@435: if (PrintOpto && (Verbose || WizardMode)) { duke@435: method()->print_name(); duke@435: tty->print_cr(" writes finals and needs a memory barrier"); duke@435: } duke@435: #endif duke@435: } duke@435: duke@435: for (MergeMemStream mms(_exits.merged_memory()); mms.next_non_empty(); ) { duke@435: // transform each slice of the original memphi: duke@435: mms.set_memory(_gvn.transform(mms.memory())); duke@435: } duke@435: duke@435: if (tf()->range()->cnt() > TypeFunc::Parms) { duke@435: const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms); duke@435: Node* ret_phi = _gvn.transform( _exits.argument(0) ); duke@435: assert(_exits.control()->is_top() || !_gvn.type(ret_phi)->empty(), "return value must be well defined"); duke@435: _exits.push_node(ret_type->basic_type(), ret_phi); duke@435: } duke@435: duke@435: // Note: Logic for creating and optimizing the ReturnNode is in Compile. duke@435: duke@435: // Unlock along the exceptional paths. duke@435: // This is done late so that we can common up equivalent exceptions duke@435: // (e.g., null checks) arising from multiple points within this method. duke@435: // See GraphKit::add_exception_state, which performs the commoning. duke@435: bool do_synch = method()->is_synchronized() && GenerateSynchronizationCode; duke@435: duke@435: // record exit from a method if compiled while Dtrace is turned on. duke@435: if (do_synch || DTraceMethodProbes) { duke@435: // First move the exception list out of _exits: duke@435: GraphKit kit(_exits.transfer_exceptions_into_jvms()); duke@435: SafePointNode* normal_map = kit.map(); // keep this guy safe duke@435: // Now re-collect the exceptions into _exits: duke@435: SafePointNode* ex_map; duke@435: while ((ex_map = kit.pop_exception_state()) != NULL) { duke@435: Node* ex_oop = kit.use_exception_state(ex_map); duke@435: // Force the exiting JVM state to have this method at InvocationEntryBci. duke@435: // The exiting JVM state is otherwise a copy of the calling JVMS. duke@435: JVMState* caller = kit.jvms(); duke@435: JVMState* ex_jvms = caller->clone_shallow(C); duke@435: ex_jvms->set_map(kit.clone_map()); duke@435: ex_jvms->map()->set_jvms(ex_jvms); duke@435: ex_jvms->set_bci( InvocationEntryBci); duke@435: kit.set_jvms(ex_jvms); duke@435: if (do_synch) { duke@435: // Add on the synchronized-method box/object combo duke@435: kit.map()->push_monitor(_synch_lock); duke@435: // Unlock! duke@435: kit.shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node()); duke@435: } duke@435: if (DTraceMethodProbes) { duke@435: kit.make_dtrace_method_exit(method()); duke@435: } duke@435: // Done with exception-path processing. duke@435: ex_map = kit.make_exception_state(ex_oop); duke@435: assert(ex_jvms->same_calls_as(ex_map->jvms()), "sanity"); duke@435: // Pop the last vestige of this method: duke@435: ex_map->set_jvms(caller->clone_shallow(C)); duke@435: ex_map->jvms()->set_map(ex_map); duke@435: _exits.push_exception_state(ex_map); duke@435: } duke@435: assert(_exits.map() == normal_map, "keep the same return state"); duke@435: } duke@435: duke@435: { duke@435: // Capture very early exceptions (receiver null checks) from caller JVMS duke@435: GraphKit caller(_caller); duke@435: SafePointNode* ex_map; duke@435: while ((ex_map = caller.pop_exception_state()) != NULL) { duke@435: _exits.add_exception_state(ex_map); duke@435: } duke@435: } duke@435: } duke@435: duke@435: //-----------------------------create_entry_map------------------------------- duke@435: // Initialize our parser map to contain the types at method entry. duke@435: // For OSR, the map contains a single RawPtr parameter. duke@435: // Initial monitor locking for sync. methods is performed by do_method_entry. duke@435: SafePointNode* Parse::create_entry_map() { duke@435: // Check for really stupid bail-out cases. duke@435: uint len = TypeFunc::Parms + method()->max_locals() + method()->max_stack(); duke@435: if (len >= 32760) { duke@435: C->record_method_not_compilable_all_tiers("too many local variables"); duke@435: return NULL; duke@435: } duke@435: duke@435: // If this is an inlined method, we may have to do a receiver null check. duke@435: if (_caller->has_method() && is_normal_parse() && !method()->is_static()) { duke@435: GraphKit kit(_caller); duke@435: kit.null_check_receiver(method()); duke@435: _caller = kit.transfer_exceptions_into_jvms(); duke@435: if (kit.stopped()) { duke@435: _exits.add_exception_states_from(_caller); duke@435: _exits.set_jvms(_caller); duke@435: return NULL; duke@435: } duke@435: } duke@435: duke@435: assert(method() != NULL, "parser must have a method"); duke@435: duke@435: // Create an initial safepoint to hold JVM state during parsing duke@435: JVMState* jvms = new (C) JVMState(method(), _caller->has_method() ? _caller : NULL); duke@435: set_map(new (C, len) SafePointNode(len, jvms)); duke@435: jvms->set_map(map()); duke@435: record_for_igvn(map()); duke@435: assert(jvms->endoff() == len, "correct jvms sizing"); duke@435: duke@435: SafePointNode* inmap = _caller->map(); duke@435: assert(inmap != NULL, "must have inmap"); duke@435: duke@435: uint i; duke@435: duke@435: // Pass thru the predefined input parameters. duke@435: for (i = 0; i < TypeFunc::Parms; i++) { duke@435: map()->init_req(i, inmap->in(i)); duke@435: } duke@435: duke@435: if (depth() == 1) { duke@435: assert(map()->memory()->Opcode() == Op_Parm, ""); duke@435: // Insert the memory aliasing node duke@435: set_all_memory(reset_memory()); duke@435: } duke@435: assert(merged_memory(), ""); duke@435: duke@435: // Now add the locals which are initially bound to arguments: duke@435: uint arg_size = tf()->domain()->cnt(); duke@435: ensure_stack(arg_size - TypeFunc::Parms); // OSR methods have funny args duke@435: for (i = TypeFunc::Parms; i < arg_size; i++) { duke@435: map()->init_req(i, inmap->argument(_caller, i - TypeFunc::Parms)); duke@435: } duke@435: duke@435: // Clear out the rest of the map (locals and stack) duke@435: for (i = arg_size; i < len; i++) { duke@435: map()->init_req(i, top()); duke@435: } duke@435: duke@435: SafePointNode* entry_map = stop(); duke@435: return entry_map; duke@435: } duke@435: duke@435: //-----------------------------do_method_entry-------------------------------- duke@435: // Emit any code needed in the pseudo-block before BCI zero. duke@435: // The main thing to do is lock the receiver of a synchronized method. duke@435: void Parse::do_method_entry() { duke@435: set_parse_bci(InvocationEntryBci); // Pseudo-BCP duke@435: set_sp(0); // Java Stack Pointer duke@435: duke@435: NOT_PRODUCT( count_compiled_calls(true/*at_method_entry*/, false/*is_inline*/); ) duke@435: duke@435: if (DTraceMethodProbes) { duke@435: make_dtrace_method_entry(method()); duke@435: } duke@435: duke@435: // If the method is synchronized, we need to construct a lock node, attach duke@435: // it to the Start node, and pin it there. duke@435: if (method()->is_synchronized()) { duke@435: // Insert a FastLockNode right after the Start which takes as arguments duke@435: // the current thread pointer, the "this" pointer & the address of the duke@435: // stack slot pair used for the lock. The "this" pointer is a projection duke@435: // off the start node, but the locking spot has to be constructed by duke@435: // creating a ConLNode of 0, and boxing it with a BoxLockNode. The BoxLockNode duke@435: // becomes the second argument to the FastLockNode call. The duke@435: // FastLockNode becomes the new control parent to pin it to the start. duke@435: duke@435: // Setup Object Pointer duke@435: Node *lock_obj = NULL; duke@435: if(method()->is_static()) { duke@435: ciInstance* mirror = _method->holder()->java_mirror(); duke@435: const TypeInstPtr *t_lock = TypeInstPtr::make(mirror); duke@435: lock_obj = makecon(t_lock); duke@435: } else { // Else pass the "this" pointer, duke@435: lock_obj = local(0); // which is Parm0 from StartNode duke@435: } duke@435: // Clear out dead values from the debug info. duke@435: kill_dead_locals(); duke@435: // Build the FastLockNode duke@435: _synch_lock = shared_lock(lock_obj); duke@435: } duke@435: duke@435: if (depth() == 1) { duke@435: increment_and_test_invocation_counter(Tier2CompileThreshold); duke@435: } duke@435: } duke@435: duke@435: //------------------------------init_blocks------------------------------------ duke@435: // Initialize our parser map to contain the types/monitors at method entry. duke@435: void Parse::init_blocks() { duke@435: // Create the blocks. duke@435: _block_count = flow()->block_count(); duke@435: _blocks = NEW_RESOURCE_ARRAY(Block, _block_count); duke@435: Copy::zero_to_bytes(_blocks, sizeof(Block)*_block_count); duke@435: duke@435: int po; duke@435: duke@435: // Initialize the structs. duke@435: for (po = 0; po < block_count(); po++) { duke@435: Block* block = pre_order_at(po); duke@435: block->init_node(this, po); duke@435: } duke@435: duke@435: // Collect predecessor and successor information. duke@435: for (po = 0; po < block_count(); po++) { duke@435: Block* block = pre_order_at(po); duke@435: block->init_graph(this); duke@435: } duke@435: } duke@435: duke@435: //-------------------------------init_node------------------------------------- duke@435: void Parse::Block::init_node(Parse* outer, int po) { duke@435: _flow = outer->flow()->pre_order_at(po); duke@435: _pred_count = 0; duke@435: _preds_parsed = 0; duke@435: _count = 0; duke@435: assert(pred_count() == 0 && preds_parsed() == 0, "sanity"); duke@435: assert(!(is_merged() || is_parsed() || is_handler()), "sanity"); duke@435: assert(_live_locals.size() == 0, "sanity"); duke@435: duke@435: // entry point has additional predecessor duke@435: if (flow()->is_start()) _pred_count++; duke@435: assert(flow()->is_start() == (this == outer->start_block()), ""); duke@435: } duke@435: duke@435: //-------------------------------init_graph------------------------------------ duke@435: void Parse::Block::init_graph(Parse* outer) { duke@435: // Create the successor list for this parser block. duke@435: GrowableArray* tfs = flow()->successors(); duke@435: GrowableArray* tfe = flow()->exceptions(); duke@435: int ns = tfs->length(); duke@435: int ne = tfe->length(); duke@435: _num_successors = ns; duke@435: _all_successors = ns+ne; duke@435: _successors = (ns+ne == 0) ? NULL : NEW_RESOURCE_ARRAY(Block*, ns+ne); duke@435: int p = 0; duke@435: for (int i = 0; i < ns+ne; i++) { duke@435: ciTypeFlow::Block* tf2 = (i < ns) ? tfs->at(i) : tfe->at(i-ns); duke@435: Block* block2 = outer->pre_order_at(tf2->pre_order()); duke@435: _successors[i] = block2; duke@435: duke@435: // Accumulate pred info for the other block, too. duke@435: if (i < ns) { duke@435: block2->_pred_count++; duke@435: } else { duke@435: block2->_is_handler = true; duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: // A block's successors must be distinguishable by BCI. duke@435: // That is, no bytecode is allowed to branch to two different duke@435: // clones of the same code location. duke@435: for (int j = 0; j < i; j++) { duke@435: Block* block1 = _successors[j]; duke@435: if (block1 == block2) continue; // duplicates are OK duke@435: assert(block1->start() != block2->start(), "successors have unique bcis"); duke@435: } duke@435: #endif duke@435: } duke@435: duke@435: // Note: We never call next_path_num along exception paths, so they duke@435: // never get processed as "ready". Also, the input phis of exception duke@435: // handlers get specially processed, so that duke@435: } duke@435: duke@435: //---------------------------successor_for_bci--------------------------------- duke@435: Parse::Block* Parse::Block::successor_for_bci(int bci) { duke@435: for (int i = 0; i < all_successors(); i++) { duke@435: Block* block2 = successor_at(i); duke@435: if (block2->start() == bci) return block2; duke@435: } duke@435: // We can actually reach here if ciTypeFlow traps out a block duke@435: // due to an unloaded class, and concurrently with compilation the duke@435: // class is then loaded, so that a later phase of the parser is duke@435: // able to see more of the bytecode CFG. Or, the flow pass and duke@435: // the parser can have a minor difference of opinion about executability duke@435: // of bytecodes. For example, "obj.field = null" is executable even duke@435: // if the field's type is an unloaded class; the flow pass used to duke@435: // make a trap for such code. duke@435: return NULL; duke@435: } duke@435: duke@435: duke@435: //-----------------------------stack_type_at----------------------------------- duke@435: const Type* Parse::Block::stack_type_at(int i) const { duke@435: return get_type(flow()->stack_type_at(i)); duke@435: } duke@435: duke@435: duke@435: //-----------------------------local_type_at----------------------------------- duke@435: const Type* Parse::Block::local_type_at(int i) const { duke@435: // Make dead locals fall to bottom. duke@435: if (_live_locals.size() == 0) { duke@435: MethodLivenessResult live_locals = flow()->outer()->method()->liveness_at_bci(start()); duke@435: // This bitmap can be zero length if we saw a breakpoint. duke@435: // In such cases, pretend they are all live. duke@435: ((Block*)this)->_live_locals = live_locals; duke@435: } duke@435: if (_live_locals.size() > 0 && !_live_locals.at(i)) duke@435: return Type::BOTTOM; duke@435: duke@435: return get_type(flow()->local_type_at(i)); duke@435: } duke@435: duke@435: duke@435: #ifndef PRODUCT duke@435: duke@435: //----------------------------name_for_bc-------------------------------------- duke@435: // helper method for BytecodeParseHistogram duke@435: static const char* name_for_bc(int i) { duke@435: return Bytecodes::is_defined(i) ? Bytecodes::name(Bytecodes::cast(i)) : "xxxunusedxxx"; duke@435: } duke@435: duke@435: //----------------------------BytecodeParseHistogram------------------------------------ duke@435: Parse::BytecodeParseHistogram::BytecodeParseHistogram(Parse *p, Compile *c) { duke@435: _parser = p; duke@435: _compiler = c; duke@435: if( ! _initialized ) { _initialized = true; reset(); } duke@435: } duke@435: duke@435: //----------------------------current_count------------------------------------ duke@435: int Parse::BytecodeParseHistogram::current_count(BPHType bph_type) { duke@435: switch( bph_type ) { duke@435: case BPH_transforms: { return _parser->gvn().made_progress(); } duke@435: case BPH_values: { return _parser->gvn().made_new_values(); } duke@435: default: { ShouldNotReachHere(); return 0; } duke@435: } duke@435: } duke@435: duke@435: //----------------------------initialized-------------------------------------- duke@435: bool Parse::BytecodeParseHistogram::initialized() { return _initialized; } duke@435: duke@435: //----------------------------reset-------------------------------------------- duke@435: void Parse::BytecodeParseHistogram::reset() { duke@435: int i = Bytecodes::number_of_codes; duke@435: while (i-- > 0) { _bytecodes_parsed[i] = 0; _nodes_constructed[i] = 0; _nodes_transformed[i] = 0; _new_values[i] = 0; } duke@435: } duke@435: duke@435: //----------------------------set_initial_state-------------------------------- duke@435: // Record info when starting to parse one bytecode duke@435: void Parse::BytecodeParseHistogram::set_initial_state( Bytecodes::Code bc ) { duke@435: if( PrintParseStatistics && !_parser->is_osr_parse() ) { duke@435: _initial_bytecode = bc; duke@435: _initial_node_count = _compiler->unique(); duke@435: _initial_transforms = current_count(BPH_transforms); duke@435: _initial_values = current_count(BPH_values); duke@435: } duke@435: } duke@435: duke@435: //----------------------------record_change-------------------------------- duke@435: // Record results of parsing one bytecode duke@435: void Parse::BytecodeParseHistogram::record_change() { duke@435: if( PrintParseStatistics && !_parser->is_osr_parse() ) { duke@435: ++_bytecodes_parsed[_initial_bytecode]; duke@435: _nodes_constructed [_initial_bytecode] += (_compiler->unique() - _initial_node_count); duke@435: _nodes_transformed [_initial_bytecode] += (current_count(BPH_transforms) - _initial_transforms); duke@435: _new_values [_initial_bytecode] += (current_count(BPH_values) - _initial_values); duke@435: } duke@435: } duke@435: duke@435: duke@435: //----------------------------print-------------------------------------------- duke@435: void Parse::BytecodeParseHistogram::print(float cutoff) { duke@435: ResourceMark rm; duke@435: // print profile duke@435: int total = 0; duke@435: int i = 0; duke@435: for( i = 0; i < Bytecodes::number_of_codes; ++i ) { total += _bytecodes_parsed[i]; } duke@435: int abs_sum = 0; duke@435: tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789 duke@435: tty->print_cr("Histogram of %d parsed bytecodes:", total); duke@435: if( total == 0 ) { return; } duke@435: tty->cr(); duke@435: tty->print_cr("absolute: count of compiled bytecodes of this type"); duke@435: tty->print_cr("relative: percentage contribution to compiled nodes"); duke@435: tty->print_cr("nodes : Average number of nodes constructed per bytecode"); duke@435: tty->print_cr("rnodes : Significance towards total nodes constructed, (nodes*relative)"); duke@435: tty->print_cr("transforms: Average amount of tranform progress per bytecode compiled"); duke@435: tty->print_cr("values : Average number of node values improved per bytecode"); duke@435: tty->print_cr("name : Bytecode name"); duke@435: tty->cr(); duke@435: tty->print_cr(" absolute relative nodes rnodes transforms values name"); duke@435: tty->print_cr("----------------------------------------------------------------------"); duke@435: while (--i > 0) { duke@435: int abs = _bytecodes_parsed[i]; duke@435: float rel = abs * 100.0F / total; duke@435: float nodes = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_constructed[i])/_bytecodes_parsed[i]; duke@435: float rnodes = _bytecodes_parsed[i] == 0 ? 0 : rel * nodes; duke@435: float xforms = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_transformed[i])/_bytecodes_parsed[i]; duke@435: float values = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _new_values [i])/_bytecodes_parsed[i]; duke@435: if (cutoff <= rel) { duke@435: tty->print_cr("%10d %7.2f%% %6.1f %6.2f %6.1f %6.1f %s", abs, rel, nodes, rnodes, xforms, values, name_for_bc(i)); duke@435: abs_sum += abs; duke@435: } duke@435: } duke@435: tty->print_cr("----------------------------------------------------------------------"); duke@435: float rel_sum = abs_sum * 100.0F / total; duke@435: tty->print_cr("%10d %7.2f%% (cutoff = %.2f%%)", abs_sum, rel_sum, cutoff); duke@435: tty->print_cr("----------------------------------------------------------------------"); duke@435: tty->cr(); duke@435: } duke@435: #endif duke@435: duke@435: //----------------------------load_state_from---------------------------------- duke@435: // Load block/map/sp. But not do not touch iter/bci. duke@435: void Parse::load_state_from(Block* block) { duke@435: set_block(block); duke@435: // load the block's JVM state: duke@435: set_map(block->start_map()); duke@435: set_sp( block->start_sp()); duke@435: } duke@435: duke@435: duke@435: //-----------------------------record_state------------------------------------ duke@435: void Parse::Block::record_state(Parse* p) { duke@435: assert(!is_merged(), "can only record state once, on 1st inflow"); duke@435: assert(start_sp() == p->sp(), "stack pointer must agree with ciTypeFlow"); duke@435: set_start_map(p->stop()); duke@435: } duke@435: duke@435: duke@435: //------------------------------do_one_block----------------------------------- duke@435: void Parse::do_one_block() { duke@435: if (TraceOptoParse) { duke@435: Block *b = block(); duke@435: int ns = b->num_successors(); duke@435: int nt = b->all_successors(); duke@435: duke@435: tty->print("Parsing block #%d at bci [%d,%d), successors: ", duke@435: block()->pre_order(), block()->start(), block()->limit()); duke@435: for (int i = 0; i < nt; i++) { duke@435: tty->print((( i < ns) ? " %d" : " %d(e)"), b->successor_at(i)->pre_order()); duke@435: } duke@435: tty->print_cr(""); duke@435: } duke@435: duke@435: assert(block()->is_merged(), "must be merged before being parsed"); duke@435: block()->mark_parsed(); duke@435: ++_blocks_parsed; duke@435: duke@435: // Set iterator to start of block. duke@435: iter().reset_to_bci(block()->start()); duke@435: duke@435: CompileLog* log = C->log(); duke@435: duke@435: // Parse bytecodes duke@435: while (!stopped() && !failing()) { duke@435: iter().next(); duke@435: duke@435: // Learn the current bci from the iterator: duke@435: set_parse_bci(iter().cur_bci()); duke@435: duke@435: if (bci() == block()->limit()) { duke@435: // Do not walk into the next block until directed by do_all_blocks. duke@435: merge(bci()); duke@435: break; duke@435: } duke@435: assert(bci() < block()->limit(), "bci still in block"); duke@435: duke@435: if (log != NULL) { duke@435: // Output an optional context marker, to help place actions duke@435: // that occur during parsing of this BC. If there is no log duke@435: // output until the next context string, this context string duke@435: // will be silently ignored. duke@435: log->context()->reset(); duke@435: log->context()->print_cr("", (int)bc(), bci()); duke@435: } duke@435: duke@435: if (block()->has_trap_at(bci())) { duke@435: // We must respect the flow pass's traps, because it will refuse duke@435: // to produce successors for trapping blocks. duke@435: int trap_index = block()->flow()->trap_index(); duke@435: assert(trap_index != 0, "trap index must be valid"); duke@435: uncommon_trap(trap_index); duke@435: break; duke@435: } duke@435: duke@435: NOT_PRODUCT( parse_histogram()->set_initial_state(bc()); ); duke@435: duke@435: #ifdef ASSERT duke@435: int pre_bc_sp = sp(); duke@435: int inputs, depth; duke@435: bool have_se = !stopped() && compute_stack_effects(inputs, depth); duke@435: assert(!have_se || pre_bc_sp >= inputs, "have enough stack to execute this BC"); duke@435: #endif //ASSERT duke@435: duke@435: do_one_bytecode(); duke@435: duke@435: assert(!have_se || stopped() || failing() || (sp() - pre_bc_sp) == depth, "correct depth prediction"); duke@435: duke@435: do_exceptions(); duke@435: duke@435: NOT_PRODUCT( parse_histogram()->record_change(); ); duke@435: duke@435: if (log != NULL) log->context()->reset(); // done w/ this one duke@435: duke@435: // Fall into next bytecode. Each bytecode normally has 1 sequential duke@435: // successor which is typically made ready by visiting this bytecode. duke@435: // If the successor has several predecessors, then it is a merge duke@435: // point, starts a new basic block, and is handled like other basic blocks. duke@435: } duke@435: } duke@435: duke@435: duke@435: //------------------------------merge------------------------------------------ duke@435: void Parse::set_parse_bci(int bci) { duke@435: set_bci(bci); duke@435: Node_Notes* nn = C->default_node_notes(); duke@435: if (nn == NULL) return; duke@435: duke@435: // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls. duke@435: if (!DebugInlinedCalls && depth() > 1) { duke@435: return; duke@435: } duke@435: duke@435: // Update the JVMS annotation, if present. duke@435: JVMState* jvms = nn->jvms(); duke@435: if (jvms != NULL && jvms->bci() != bci) { duke@435: // Update the JVMS. duke@435: jvms = jvms->clone_shallow(C); duke@435: jvms->set_bci(bci); duke@435: nn->set_jvms(jvms); duke@435: } duke@435: } duke@435: duke@435: //------------------------------merge------------------------------------------ duke@435: // Merge the current mapping into the basic block starting at bci duke@435: void Parse::merge(int target_bci) { duke@435: Block* target = successor_for_bci(target_bci); duke@435: if (target == NULL) { handle_missing_successor(target_bci); return; } duke@435: assert(!target->is_ready(), "our arrival must be expected"); duke@435: int pnum = target->next_path_num(); duke@435: merge_common(target, pnum); duke@435: } duke@435: duke@435: //-------------------------merge_new_path-------------------------------------- duke@435: // Merge the current mapping into the basic block, using a new path duke@435: void Parse::merge_new_path(int target_bci) { duke@435: Block* target = successor_for_bci(target_bci); duke@435: if (target == NULL) { handle_missing_successor(target_bci); return; } duke@435: assert(!target->is_ready(), "new path into frozen graph"); duke@435: int pnum = target->add_new_path(); duke@435: merge_common(target, pnum); duke@435: } duke@435: duke@435: //-------------------------merge_exception------------------------------------- duke@435: // Merge the current mapping into the basic block starting at bci duke@435: // The ex_oop must be pushed on the stack, unlike throw_to_exit. duke@435: void Parse::merge_exception(int target_bci) { duke@435: assert(sp() == 1, "must have only the throw exception on the stack"); duke@435: Block* target = successor_for_bci(target_bci); duke@435: if (target == NULL) { handle_missing_successor(target_bci); return; } duke@435: assert(target->is_handler(), "exceptions are handled by special blocks"); duke@435: int pnum = target->add_new_path(); duke@435: merge_common(target, pnum); duke@435: } duke@435: duke@435: //--------------------handle_missing_successor--------------------------------- duke@435: void Parse::handle_missing_successor(int target_bci) { duke@435: #ifndef PRODUCT duke@435: Block* b = block(); duke@435: int trap_bci = b->flow()->has_trap()? b->flow()->trap_bci(): -1; duke@435: tty->print_cr("### Missing successor at bci:%d for block #%d (trap_bci:%d)", target_bci, b->pre_order(), trap_bci); duke@435: #endif duke@435: ShouldNotReachHere(); duke@435: } duke@435: duke@435: //--------------------------merge_common--------------------------------------- duke@435: void Parse::merge_common(Parse::Block* target, int pnum) { duke@435: if (TraceOptoParse) { duke@435: tty->print("Merging state at block #%d bci:%d", target->pre_order(), target->start()); duke@435: } duke@435: duke@435: // Zap extra stack slots to top duke@435: assert(sp() == target->start_sp(), ""); duke@435: clean_stack(sp()); duke@435: duke@435: if (!target->is_merged()) { // No prior mapping at this bci duke@435: if (TraceOptoParse) { tty->print(" with empty state"); } duke@435: duke@435: // If this path is dead, do not bother capturing it as a merge. duke@435: // It is "as if" we had 1 fewer predecessors from the beginning. duke@435: if (stopped()) { duke@435: if (TraceOptoParse) tty->print_cr(", but path is dead and doesn't count"); duke@435: return; duke@435: } duke@435: duke@435: // Record that a new block has been merged. duke@435: ++_blocks_merged; duke@435: duke@435: // Make a region if we know there are multiple or unpredictable inputs. duke@435: // (Also, if this is a plain fall-through, we might see another region, duke@435: // which must not be allowed into this block's map.) duke@435: if (pnum > PhiNode::Input // Known multiple inputs. duke@435: || target->is_handler() // These have unpredictable inputs. duke@435: || control()->is_Region()) { // We must hide this guy. duke@435: // Add a Region to start the new basic block. Phis will be added duke@435: // later lazily. duke@435: int edges = target->pred_count(); duke@435: if (edges < pnum) edges = pnum; // might be a new path! duke@435: Node *r = new (C, edges+1) RegionNode(edges+1); duke@435: gvn().set_type(r, Type::CONTROL); duke@435: record_for_igvn(r); duke@435: // zap all inputs to NULL for debugging (done in Node(uint) constructor) duke@435: // for (int j = 1; j < edges+1; j++) { r->init_req(j, NULL); } duke@435: r->init_req(pnum, control()); duke@435: set_control(r); duke@435: } duke@435: duke@435: // Convert the existing Parser mapping into a mapping at this bci. duke@435: store_state_to(target); duke@435: assert(target->is_merged(), "do not come here twice"); duke@435: duke@435: } else { // Prior mapping at this bci duke@435: if (TraceOptoParse) { tty->print(" with previous state"); } duke@435: duke@435: // We must not manufacture more phis if the target is already parsed. duke@435: bool nophi = target->is_parsed(); duke@435: duke@435: SafePointNode* newin = map();// Hang on to incoming mapping duke@435: Block* save_block = block(); // Hang on to incoming block; duke@435: load_state_from(target); // Get prior mapping duke@435: duke@435: assert(newin->jvms()->locoff() == jvms()->locoff(), "JVMS layouts agree"); duke@435: assert(newin->jvms()->stkoff() == jvms()->stkoff(), "JVMS layouts agree"); duke@435: assert(newin->jvms()->monoff() == jvms()->monoff(), "JVMS layouts agree"); duke@435: assert(newin->jvms()->endoff() == jvms()->endoff(), "JVMS layouts agree"); duke@435: duke@435: // Iterate over my current mapping and the old mapping. duke@435: // Where different, insert Phi functions. duke@435: // Use any existing Phi functions. duke@435: assert(control()->is_Region(), "must be merging to a region"); duke@435: RegionNode* r = control()->as_Region(); duke@435: duke@435: // Compute where to merge into duke@435: // Merge incoming control path duke@435: r->set_req(pnum, newin->control()); duke@435: duke@435: if (pnum == 1) { // Last merge for this Region? duke@435: _gvn.transform_no_reclaim(r); duke@435: record_for_igvn(r); duke@435: } duke@435: duke@435: // Update all the non-control inputs to map: duke@435: assert(TypeFunc::Parms == newin->jvms()->locoff(), "parser map should contain only youngest jvms"); duke@435: for (uint j = 1; j < newin->req(); j++) { duke@435: Node* m = map()->in(j); // Current state of target. duke@435: Node* n = newin->in(j); // Incoming change to target state. duke@435: PhiNode* phi; duke@435: if (m->is_Phi() && m->as_Phi()->region() == r) duke@435: phi = m->as_Phi(); duke@435: else duke@435: phi = NULL; duke@435: if (m != n) { // Different; must merge duke@435: switch (j) { duke@435: // Frame pointer and Return Address never changes duke@435: case TypeFunc::FramePtr:// Drop m, use the original value duke@435: case TypeFunc::ReturnAdr: duke@435: break; duke@435: case TypeFunc::Memory: // Merge inputs to the MergeMem node duke@435: assert(phi == NULL, "the merge contains phis, not vice versa"); duke@435: merge_memory_edges(n->as_MergeMem(), pnum, nophi); duke@435: continue; duke@435: default: // All normal stuff duke@435: if (phi == NULL) phi = ensure_phi(j, nophi); duke@435: break; duke@435: } duke@435: } duke@435: // At this point, n might be top if: duke@435: // - there is no phi (because TypeFlow detected a conflict), or duke@435: // - the corresponding control edges is top (a dead incoming path) duke@435: // It is a bug if we create a phi which sees a garbage value on a live path. duke@435: duke@435: if (phi != NULL) { duke@435: assert(n != top() || r->in(pnum) == top(), "live value must not be garbage"); duke@435: assert(phi->region() == r, ""); duke@435: phi->set_req(pnum, n); // Then add 'n' to the merge duke@435: if (pnum == PhiNode::Input) { duke@435: // Last merge for this Phi. duke@435: // So far, Phis have had a reasonable type from ciTypeFlow. duke@435: // Now _gvn will join that with the meet of current inputs. duke@435: // BOTTOM is never permissible here, 'cause pessimistically duke@435: // Phis of pointers cannot lose the basic pointer type. duke@435: debug_only(const Type* bt1 = phi->bottom_type()); duke@435: assert(bt1 != Type::BOTTOM, "should not be building conflict phis"); duke@435: map()->set_req(j, _gvn.transform_no_reclaim(phi)); duke@435: debug_only(const Type* bt2 = phi->bottom_type()); duke@435: assert(bt2->higher_equal(bt1), "must be consistent with type-flow"); duke@435: record_for_igvn(phi); duke@435: } duke@435: } duke@435: } // End of for all values to be merged duke@435: duke@435: if (pnum == PhiNode::Input && duke@435: !r->in(0)) { // The occasional useless Region duke@435: assert(control() == r, ""); duke@435: set_control(r->nonnull_req()); duke@435: } duke@435: duke@435: // newin has been subsumed into the lazy merge, and is now dead. duke@435: set_block(save_block); duke@435: duke@435: stop(); // done with this guy, for now duke@435: } duke@435: duke@435: if (TraceOptoParse) { duke@435: tty->print_cr(" on path %d", pnum); duke@435: } duke@435: duke@435: // Done with this parser state. duke@435: assert(stopped(), ""); duke@435: } duke@435: duke@435: duke@435: //--------------------------merge_memory_edges--------------------------------- duke@435: void Parse::merge_memory_edges(MergeMemNode* n, int pnum, bool nophi) { duke@435: // (nophi means we must not create phis, because we already parsed here) duke@435: assert(n != NULL, ""); duke@435: // Merge the inputs to the MergeMems duke@435: MergeMemNode* m = merged_memory(); duke@435: duke@435: assert(control()->is_Region(), "must be merging to a region"); duke@435: RegionNode* r = control()->as_Region(); duke@435: duke@435: PhiNode* base = NULL; duke@435: MergeMemNode* remerge = NULL; duke@435: for (MergeMemStream mms(m, n); mms.next_non_empty2(); ) { duke@435: Node *p = mms.force_memory(); duke@435: Node *q = mms.memory2(); duke@435: if (mms.is_empty() && nophi) { duke@435: // Trouble: No new splits allowed after a loop body is parsed. duke@435: // Instead, wire the new split into a MergeMem on the backedge. duke@435: // The optimizer will sort it out, slicing the phi. duke@435: if (remerge == NULL) { duke@435: assert(base != NULL, ""); duke@435: assert(base->in(0) != NULL, "should not be xformed away"); duke@435: remerge = MergeMemNode::make(C, base->in(pnum)); duke@435: gvn().set_type(remerge, Type::MEMORY); duke@435: base->set_req(pnum, remerge); duke@435: } duke@435: remerge->set_memory_at(mms.alias_idx(), q); duke@435: continue; duke@435: } duke@435: assert(!q->is_MergeMem(), ""); duke@435: PhiNode* phi; duke@435: if (p != q) { duke@435: phi = ensure_memory_phi(mms.alias_idx(), nophi); duke@435: } else { duke@435: if (p->is_Phi() && p->as_Phi()->region() == r) duke@435: phi = p->as_Phi(); duke@435: else duke@435: phi = NULL; duke@435: } duke@435: // Insert q into local phi duke@435: if (phi != NULL) { duke@435: assert(phi->region() == r, ""); duke@435: p = phi; duke@435: phi->set_req(pnum, q); duke@435: if (mms.at_base_memory()) { duke@435: base = phi; // delay transforming it duke@435: } else if (pnum == 1) { duke@435: record_for_igvn(phi); duke@435: p = _gvn.transform_no_reclaim(phi); duke@435: } duke@435: mms.set_memory(p);// store back through the iterator duke@435: } duke@435: } duke@435: // Transform base last, in case we must fiddle with remerging. duke@435: if (base != NULL && pnum == 1) { duke@435: record_for_igvn(base); duke@435: m->set_base_memory( _gvn.transform_no_reclaim(base) ); duke@435: } duke@435: } duke@435: duke@435: duke@435: //------------------------ensure_phis_everywhere------------------------------- duke@435: void Parse::ensure_phis_everywhere() { duke@435: ensure_phi(TypeFunc::I_O); duke@435: duke@435: // Ensure a phi on all currently known memories. duke@435: for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) { duke@435: ensure_memory_phi(mms.alias_idx()); duke@435: debug_only(mms.set_memory()); // keep the iterator happy duke@435: } duke@435: duke@435: // Note: This is our only chance to create phis for memory slices. duke@435: // If we miss a slice that crops up later, it will have to be duke@435: // merged into the base-memory phi that we are building here. duke@435: // Later, the optimizer will comb out the knot, and build separate duke@435: // phi-loops for each memory slice that matters. duke@435: duke@435: // Monitors must nest nicely and not get confused amongst themselves. duke@435: // Phi-ify everything up to the monitors, though. duke@435: uint monoff = map()->jvms()->monoff(); duke@435: uint nof_monitors = map()->jvms()->nof_monitors(); duke@435: duke@435: assert(TypeFunc::Parms == map()->jvms()->locoff(), "parser map should contain only youngest jvms"); duke@435: for (uint i = TypeFunc::Parms; i < monoff; i++) { duke@435: ensure_phi(i); duke@435: } duke@435: // Even monitors need Phis, though they are well-structured. duke@435: // This is true for OSR methods, and also for the rare cases where duke@435: // a monitor object is the subject of a replace_in_map operation. duke@435: // See bugs 4426707 and 5043395. duke@435: for (uint m = 0; m < nof_monitors; m++) { duke@435: ensure_phi(map()->jvms()->monitor_obj_offset(m)); duke@435: } duke@435: } duke@435: duke@435: duke@435: //-----------------------------add_new_path------------------------------------ duke@435: // Add a previously unaccounted predecessor to this block. duke@435: int Parse::Block::add_new_path() { duke@435: // If there is no map, return the lowest unused path number. duke@435: if (!is_merged()) return pred_count()+1; // there will be a map shortly duke@435: duke@435: SafePointNode* map = start_map(); duke@435: if (!map->control()->is_Region()) duke@435: return pred_count()+1; // there may be a region some day duke@435: RegionNode* r = map->control()->as_Region(); duke@435: duke@435: // Add new path to the region. duke@435: uint pnum = r->req(); duke@435: r->add_req(NULL); duke@435: duke@435: for (uint i = 1; i < map->req(); i++) { duke@435: Node* n = map->in(i); duke@435: if (i == TypeFunc::Memory) { duke@435: // Ensure a phi on all currently known memories. duke@435: for (MergeMemStream mms(n->as_MergeMem()); mms.next_non_empty(); ) { duke@435: Node* phi = mms.memory(); duke@435: if (phi->is_Phi() && phi->as_Phi()->region() == r) { duke@435: assert(phi->req() == pnum, "must be same size as region"); duke@435: phi->add_req(NULL); duke@435: } duke@435: } duke@435: } else { duke@435: if (n->is_Phi() && n->as_Phi()->region() == r) { duke@435: assert(n->req() == pnum, "must be same size as region"); duke@435: n->add_req(NULL); duke@435: } duke@435: } duke@435: } duke@435: duke@435: return pnum; duke@435: } duke@435: duke@435: //------------------------------ensure_phi------------------------------------- duke@435: // Turn the idx'th entry of the current map into a Phi duke@435: PhiNode *Parse::ensure_phi(int idx, bool nocreate) { duke@435: SafePointNode* map = this->map(); duke@435: Node* region = map->control(); duke@435: assert(region->is_Region(), ""); duke@435: duke@435: Node* o = map->in(idx); duke@435: assert(o != NULL, ""); duke@435: duke@435: if (o == top()) return NULL; // TOP always merges into TOP duke@435: duke@435: if (o->is_Phi() && o->as_Phi()->region() == region) { duke@435: return o->as_Phi(); duke@435: } duke@435: duke@435: // Now use a Phi here for merging duke@435: assert(!nocreate, "Cannot build a phi for a block already parsed."); duke@435: const JVMState* jvms = map->jvms(); duke@435: const Type* t; duke@435: if (jvms->is_loc(idx)) { duke@435: t = block()->local_type_at(idx - jvms->locoff()); duke@435: } else if (jvms->is_stk(idx)) { duke@435: t = block()->stack_type_at(idx - jvms->stkoff()); duke@435: } else if (jvms->is_mon(idx)) { duke@435: assert(!jvms->is_monitor_box(idx), "no phis for boxes"); duke@435: t = TypeInstPtr::BOTTOM; // this is sufficient for a lock object duke@435: } else if ((uint)idx < TypeFunc::Parms) { duke@435: t = o->bottom_type(); // Type::RETURN_ADDRESS or such-like. duke@435: } else { duke@435: assert(false, "no type information for this phi"); duke@435: } duke@435: duke@435: // If the type falls to bottom, then this must be a local that duke@435: // is mixing ints and oops or some such. Forcing it to top duke@435: // makes it go dead. duke@435: if (t == Type::BOTTOM) { duke@435: map->set_req(idx, top()); duke@435: return NULL; duke@435: } duke@435: duke@435: // Do not create phis for top either. duke@435: // A top on a non-null control flow must be an unused even after the.phi. duke@435: if (t == Type::TOP || t == Type::HALF) { duke@435: map->set_req(idx, top()); duke@435: return NULL; duke@435: } duke@435: duke@435: PhiNode* phi = PhiNode::make(region, o, t); duke@435: gvn().set_type(phi, t); kvn@473: if (C->do_escape_analysis()) record_for_igvn(phi); duke@435: map->set_req(idx, phi); duke@435: return phi; duke@435: } duke@435: duke@435: //--------------------------ensure_memory_phi---------------------------------- duke@435: // Turn the idx'th slice of the current memory into a Phi duke@435: PhiNode *Parse::ensure_memory_phi(int idx, bool nocreate) { duke@435: MergeMemNode* mem = merged_memory(); duke@435: Node* region = control(); duke@435: assert(region->is_Region(), ""); duke@435: duke@435: Node *o = (idx == Compile::AliasIdxBot)? mem->base_memory(): mem->memory_at(idx); duke@435: assert(o != NULL && o != top(), ""); duke@435: duke@435: PhiNode* phi; duke@435: if (o->is_Phi() && o->as_Phi()->region() == region) { duke@435: phi = o->as_Phi(); duke@435: if (phi == mem->base_memory() && idx >= Compile::AliasIdxRaw) { duke@435: // clone the shared base memory phi to make a new memory split duke@435: assert(!nocreate, "Cannot build a phi for a block already parsed."); duke@435: const Type* t = phi->bottom_type(); duke@435: const TypePtr* adr_type = C->get_adr_type(idx); duke@435: phi = phi->slice_memory(adr_type); duke@435: gvn().set_type(phi, t); duke@435: } duke@435: return phi; duke@435: } duke@435: duke@435: // Now use a Phi here for merging duke@435: assert(!nocreate, "Cannot build a phi for a block already parsed."); duke@435: const Type* t = o->bottom_type(); duke@435: const TypePtr* adr_type = C->get_adr_type(idx); duke@435: phi = PhiNode::make(region, o, t, adr_type); duke@435: gvn().set_type(phi, t); duke@435: if (idx == Compile::AliasIdxBot) duke@435: mem->set_base_memory(phi); duke@435: else duke@435: mem->set_memory_at(idx, phi); duke@435: return phi; duke@435: } duke@435: duke@435: //------------------------------call_register_finalizer----------------------- duke@435: // Check the klass of the receiver and call register_finalizer if the duke@435: // class need finalization. duke@435: void Parse::call_register_finalizer() { duke@435: Node* receiver = local(0); duke@435: assert(receiver != NULL && receiver->bottom_type()->isa_instptr() != NULL, duke@435: "must have non-null instance type"); duke@435: duke@435: const TypeInstPtr *tinst = receiver->bottom_type()->isa_instptr(); duke@435: if (tinst != NULL && tinst->klass()->is_loaded() && !tinst->klass_is_exact()) { duke@435: // The type isn't known exactly so see if CHA tells us anything. duke@435: ciInstanceKlass* ik = tinst->klass()->as_instance_klass(); duke@435: if (!Dependencies::has_finalizable_subclass(ik)) { duke@435: // No finalizable subclasses so skip the dynamic check. duke@435: C->dependencies()->assert_has_no_finalizable_subclasses(ik); duke@435: return; duke@435: } duke@435: } duke@435: duke@435: // Insert a dynamic test for whether the instance needs duke@435: // finalization. In general this will fold up since the concrete duke@435: // class is often visible so the access flags are constant. duke@435: Node* klass_addr = basic_plus_adr( receiver, receiver, oopDesc::klass_offset_in_bytes() ); duke@435: Node* klass = _gvn.transform(new (C, 3) LoadKlassNode(NULL, immutable_memory(), klass_addr, TypeInstPtr::KLASS)); duke@435: duke@435: Node* access_flags_addr = basic_plus_adr(klass, klass, Klass::access_flags_offset_in_bytes() + sizeof(oopDesc)); duke@435: Node* access_flags = make_load(NULL, access_flags_addr, TypeInt::INT, T_INT); duke@435: duke@435: Node* mask = _gvn.transform(new (C, 3) AndINode(access_flags, intcon(JVM_ACC_HAS_FINALIZER))); duke@435: Node* check = _gvn.transform(new (C, 3) CmpINode(mask, intcon(0))); duke@435: Node* test = _gvn.transform(new (C, 2) BoolNode(check, BoolTest::ne)); duke@435: duke@435: IfNode* iff = create_and_map_if(control(), test, PROB_MAX, COUNT_UNKNOWN); duke@435: duke@435: RegionNode* result_rgn = new (C, 3) RegionNode(3); duke@435: record_for_igvn(result_rgn); duke@435: duke@435: Node *skip_register = _gvn.transform(new (C, 1) IfFalseNode(iff)); duke@435: result_rgn->init_req(1, skip_register); duke@435: duke@435: Node *needs_register = _gvn.transform(new (C, 1) IfTrueNode(iff)); duke@435: set_control(needs_register); duke@435: if (stopped()) { duke@435: // There is no slow path. duke@435: result_rgn->init_req(2, top()); duke@435: } else { duke@435: Node *call = make_runtime_call(RC_NO_LEAF, duke@435: OptoRuntime::register_finalizer_Type(), duke@435: OptoRuntime::register_finalizer_Java(), duke@435: NULL, TypePtr::BOTTOM, duke@435: receiver); duke@435: make_slow_call_ex(call, env()->Throwable_klass(), true); duke@435: duke@435: Node* fast_io = call->in(TypeFunc::I_O); duke@435: Node* fast_mem = call->in(TypeFunc::Memory); duke@435: // These two phis are pre-filled with copies of of the fast IO and Memory duke@435: Node* io_phi = PhiNode::make(result_rgn, fast_io, Type::ABIO); duke@435: Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM); duke@435: duke@435: result_rgn->init_req(2, control()); duke@435: io_phi ->init_req(2, i_o()); duke@435: mem_phi ->init_req(2, reset_memory()); duke@435: duke@435: set_all_memory( _gvn.transform(mem_phi) ); duke@435: set_i_o( _gvn.transform(io_phi) ); duke@435: } duke@435: duke@435: set_control( _gvn.transform(result_rgn) ); duke@435: } duke@435: duke@435: //------------------------------return_current--------------------------------- duke@435: // Append current _map to _exit_return duke@435: void Parse::return_current(Node* value) { duke@435: if (RegisterFinalizersAtInit && duke@435: method()->intrinsic_id() == vmIntrinsics::_Object_init) { duke@435: call_register_finalizer(); duke@435: } duke@435: duke@435: // Do not set_parse_bci, so that return goo is credited to the return insn. duke@435: set_bci(InvocationEntryBci); duke@435: if (method()->is_synchronized() && GenerateSynchronizationCode) { duke@435: shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node()); duke@435: } duke@435: if (DTraceMethodProbes) { duke@435: make_dtrace_method_exit(method()); duke@435: } duke@435: SafePointNode* exit_return = _exits.map(); duke@435: exit_return->in( TypeFunc::Control )->add_req( control() ); duke@435: exit_return->in( TypeFunc::I_O )->add_req( i_o () ); duke@435: Node *mem = exit_return->in( TypeFunc::Memory ); duke@435: for (MergeMemStream mms(mem->as_MergeMem(), merged_memory()); mms.next_non_empty2(); ) { duke@435: if (mms.is_empty()) { duke@435: // get a copy of the base memory, and patch just this one input duke@435: const TypePtr* adr_type = mms.adr_type(C); duke@435: Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); duke@435: assert(phi->as_Phi()->region() == mms.base_memory()->in(0), ""); duke@435: gvn().set_type_bottom(phi); duke@435: phi->del_req(phi->req()-1); // prepare to re-patch duke@435: mms.set_memory(phi); duke@435: } duke@435: mms.memory()->add_req(mms.memory2()); duke@435: } duke@435: duke@435: // frame pointer is always same, already captured duke@435: if (value != NULL) { duke@435: // If returning oops to an interface-return, there is a silent free duke@435: // cast from oop to interface allowed by the Verifier. Make it explicit duke@435: // here. duke@435: Node* phi = _exits.argument(0); duke@435: const TypeInstPtr *tr = phi->bottom_type()->isa_instptr(); duke@435: if( tr && tr->klass()->is_loaded() && duke@435: tr->klass()->is_interface() ) { duke@435: const TypeInstPtr *tp = value->bottom_type()->isa_instptr(); duke@435: if (tp && tp->klass()->is_loaded() && duke@435: !tp->klass()->is_interface()) { duke@435: // sharpen the type eagerly; this eases certain assert checking duke@435: if (tp->higher_equal(TypeInstPtr::NOTNULL)) duke@435: tr = tr->join(TypeInstPtr::NOTNULL)->is_instptr(); duke@435: value = _gvn.transform(new (C, 2) CheckCastPPNode(0,value,tr)); duke@435: } duke@435: } duke@435: phi->add_req(value); duke@435: } duke@435: duke@435: stop_and_kill_map(); // This CFG path dies here duke@435: } duke@435: duke@435: duke@435: //------------------------------add_safepoint---------------------------------- duke@435: void Parse::add_safepoint() { duke@435: // See if we can avoid this safepoint. No need for a SafePoint immediately duke@435: // after a Call (except Leaf Call) or another SafePoint. duke@435: Node *proj = control(); duke@435: bool add_poll_param = SafePointNode::needs_polling_address_input(); duke@435: uint parms = add_poll_param ? TypeFunc::Parms+1 : TypeFunc::Parms; duke@435: if( proj->is_Proj() ) { duke@435: Node *n0 = proj->in(0); duke@435: if( n0->is_Catch() ) { duke@435: n0 = n0->in(0)->in(0); duke@435: assert( n0->is_Call(), "expect a call here" ); duke@435: } duke@435: if( n0->is_Call() ) { duke@435: if( n0->as_Call()->guaranteed_safepoint() ) duke@435: return; duke@435: } else if( n0->is_SafePoint() && n0->req() >= parms ) { duke@435: return; duke@435: } duke@435: } duke@435: duke@435: // Clear out dead values from the debug info. duke@435: kill_dead_locals(); duke@435: duke@435: // Clone the JVM State duke@435: SafePointNode *sfpnt = new (C, parms) SafePointNode(parms, NULL); duke@435: duke@435: // Capture memory state BEFORE a SafePoint. Since we can block at a duke@435: // SafePoint we need our GC state to be safe; i.e. we need all our current duke@435: // write barriers (card marks) to not float down after the SafePoint so we duke@435: // must read raw memory. Likewise we need all oop stores to match the card duke@435: // marks. If deopt can happen, we need ALL stores (we need the correct JVM duke@435: // state on a deopt). duke@435: duke@435: // We do not need to WRITE the memory state after a SafePoint. The control duke@435: // edge will keep card-marks and oop-stores from floating up from below a duke@435: // SafePoint and our true dependency added here will keep them from floating duke@435: // down below a SafePoint. duke@435: duke@435: // Clone the current memory state duke@435: Node* mem = MergeMemNode::make(C, map()->memory()); duke@435: duke@435: mem = _gvn.transform(mem); duke@435: duke@435: // Pass control through the safepoint duke@435: sfpnt->init_req(TypeFunc::Control , control()); duke@435: // Fix edges normally used by a call duke@435: sfpnt->init_req(TypeFunc::I_O , top() ); duke@435: sfpnt->init_req(TypeFunc::Memory , mem ); duke@435: sfpnt->init_req(TypeFunc::ReturnAdr, top() ); duke@435: sfpnt->init_req(TypeFunc::FramePtr , top() ); duke@435: duke@435: // Create a node for the polling address duke@435: if( add_poll_param ) { duke@435: Node *polladr = ConPNode::make(C, (address)os::get_polling_page()); duke@435: sfpnt->init_req(TypeFunc::Parms+0, _gvn.transform(polladr)); duke@435: } duke@435: duke@435: // Fix up the JVM State edges duke@435: add_safepoint_edges(sfpnt); duke@435: Node *transformed_sfpnt = _gvn.transform(sfpnt); duke@435: set_control(transformed_sfpnt); duke@435: duke@435: // Provide an edge from root to safepoint. This makes the safepoint duke@435: // appear useful until the parse has completed. duke@435: if( OptoRemoveUseless && transformed_sfpnt->is_SafePoint() ) { duke@435: assert(C->root() != NULL, "Expect parse is still valid"); duke@435: C->root()->add_prec(transformed_sfpnt); duke@435: } duke@435: } duke@435: duke@435: #ifndef PRODUCT duke@435: //------------------------show_parse_info-------------------------------------- duke@435: void Parse::show_parse_info() { duke@435: InlineTree* ilt = NULL; duke@435: if (C->ilt() != NULL) { duke@435: JVMState* caller_jvms = is_osr_parse() ? caller()->caller() : caller(); duke@435: ilt = InlineTree::find_subtree_from_root(C->ilt(), caller_jvms, method()); duke@435: } duke@435: if (PrintCompilation && Verbose) { duke@435: if (depth() == 1) { duke@435: if( ilt->count_inlines() ) { duke@435: tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), duke@435: ilt->count_inline_bcs()); duke@435: tty->cr(); duke@435: } duke@435: } else { duke@435: if (method()->is_synchronized()) tty->print("s"); duke@435: if (method()->has_exception_handlers()) tty->print("!"); duke@435: // Check this is not the final compiled version duke@435: if (C->trap_can_recompile()) { duke@435: tty->print("-"); duke@435: } else { duke@435: tty->print(" "); duke@435: } duke@435: method()->print_short_name(); duke@435: if (is_osr_parse()) { duke@435: tty->print(" @ %d", osr_bci()); duke@435: } duke@435: tty->print(" (%d bytes)",method()->code_size()); duke@435: if (ilt->count_inlines()) { duke@435: tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), duke@435: ilt->count_inline_bcs()); duke@435: } duke@435: tty->cr(); duke@435: } duke@435: } duke@435: if (PrintOpto && (depth() == 1 || PrintOptoInlining)) { duke@435: // Print that we succeeded; suppress this message on the first osr parse. duke@435: duke@435: if (method()->is_synchronized()) tty->print("s"); duke@435: if (method()->has_exception_handlers()) tty->print("!"); duke@435: // Check this is not the final compiled version duke@435: if (C->trap_can_recompile() && depth() == 1) { duke@435: tty->print("-"); duke@435: } else { duke@435: tty->print(" "); duke@435: } duke@435: if( depth() != 1 ) { tty->print(" "); } // missing compile count duke@435: for (int i = 1; i < depth(); ++i) { tty->print(" "); } duke@435: method()->print_short_name(); duke@435: if (is_osr_parse()) { duke@435: tty->print(" @ %d", osr_bci()); duke@435: } duke@435: if (ilt->caller_bci() != -1) { duke@435: tty->print(" @ %d", ilt->caller_bci()); duke@435: } duke@435: tty->print(" (%d bytes)",method()->code_size()); duke@435: if (ilt->count_inlines()) { duke@435: tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), duke@435: ilt->count_inline_bcs()); duke@435: } duke@435: tty->cr(); duke@435: } duke@435: } duke@435: duke@435: duke@435: //------------------------------dump------------------------------------------- duke@435: // Dump information associated with the bytecodes of current _method duke@435: void Parse::dump() { duke@435: if( method() != NULL ) { duke@435: // Iterate over bytecodes duke@435: ciBytecodeStream iter(method()); duke@435: for( Bytecodes::Code bc = iter.next(); bc != ciBytecodeStream::EOBC() ; bc = iter.next() ) { duke@435: dump_bci( iter.cur_bci() ); duke@435: tty->cr(); duke@435: } duke@435: } duke@435: } duke@435: duke@435: // Dump information associated with a byte code index, 'bci' duke@435: void Parse::dump_bci(int bci) { duke@435: // Output info on merge-points, cloning, and within _jsr..._ret duke@435: // NYI duke@435: tty->print(" bci:%d", bci); duke@435: } duke@435: duke@435: #endif