jdk/jdk: hotspot/src/share/vm/opto/parse1.cpp annotate

annotate hotspot/src/share/vm/opto/parse1.cpp @ 8732:16fc1c68714b

7008866: Missing loop predicate for loop with multiple entries Summary: Add predicates when loop head bytecode is parsed instead of when back branch bytecode is parsed. Reviewed-by: never

author	kvn
date	Mon, 21 Mar 2011 11:28:14 -0700
parents	5b173b4ca846
children	14bfe81f2a9d

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

OpenJDK / jdk / jdk

annotate hotspot/src/share/vm/opto/parse1.cpp @ 8732:16fc1c68714b