annotate src/share/vm/opto/parse1.cpp @ 3700:f13867c41f73

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