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

annotate hotspot/src/share/vm/opto/parse1.cpp @ 22845:d8812d0ff387

8024921: PPC64 (part 113): Extend Load and Store nodes to know about memory ordering Summary: Add a field to C2 LoadNode and StoreNode classes which indicates whether the load/store should do an acquire/release on platforms which support it. Reviewed-by: kvn

author	goetz
date	Fri, 15 Nov 2013 11:05:32 -0800
parents	46e6bbecd9e5
children	7f6eb436873b

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

OpenJDK / jdk / jdk

annotate hotspot/src/share/vm/opto/parse1.cpp @ 22845:d8812d0ff387