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