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 = NULL; 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 if (PrintOpto && (Verbose || WizardMode)) { 962 method()->print_name(); 963 tty->print_cr(" writes finals and needs a memory barrier"); 964 } 965 } 966 967 // Any method can write a @Stable field; insert memory barriers 968 // after those also. Can't bind predecessor allocation node (if any) 969 // with barrier because allocation doesn't always dominate 970 // MemBarRelease. 971 if (wrote_stable()) { 972 _exits.insert_mem_bar(Op_MemBarRelease); 973 if (PrintOpto && (Verbose || WizardMode)) { 974 method()->print_name(); 975 tty->print_cr(" writes @Stable and needs a memory barrier"); 976 } 977 } 978 979 for (MergeMemStream mms(_exits.merged_memory()); mms.next_non_empty(); ) { 980 // transform each slice of the original memphi: 981 mms.set_memory(_gvn.transform(mms.memory())); 982 } 983 984 if (tf()->range()->cnt() > TypeFunc::Parms) { 985 const Type* ret_type = tf()->range()->field_at(TypeFunc::Parms); 986 Node* ret_phi = _gvn.transform( _exits.argument(0) ); 987 if (!_exits.control()->is_top() && _gvn.type(ret_phi)->empty()) { 988 // In case of concurrent class loading, the type we set for the 989 // ret_phi in build_exits() may have been too optimistic and the 990 // ret_phi may be top now. 991 // Otherwise, we've encountered an error and have to mark the method as 992 // not compilable. Just using an assertion instead would be dangerous 993 // as this could lead to an infinite compile loop in non-debug builds. 994 { 995 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); 996 if (C->env()->system_dictionary_modification_counter_changed()) { 997 C->record_failure(C2Compiler::retry_class_loading_during_parsing()); 998 } else { 999 C->record_method_not_compilable("Can't determine return type."); 1000 } 1001 } 1002 return; 1003 } 1004 _exits.push_node(ret_type->basic_type(), ret_phi); 1005 } 1006 1007 // Note: Logic for creating and optimizing the ReturnNode is in Compile. 1008 1009 // Unlock along the exceptional paths. 1010 // This is done late so that we can common up equivalent exceptions 1011 // (e.g., null checks) arising from multiple points within this method. 1012 // See GraphKit::add_exception_state, which performs the commoning. 1013 bool do_synch = method()->is_synchronized() && GenerateSynchronizationCode; 1014 1015 // record exit from a method if compiled while Dtrace is turned on. 1016 if (do_synch || C->env()->dtrace_method_probes() || _replaced_nodes_for_exceptions) { 1017 // First move the exception list out of _exits: 1018 GraphKit kit(_exits.transfer_exceptions_into_jvms()); 1019 SafePointNode* normal_map = kit.map(); // keep this guy safe 1020 // Now re-collect the exceptions into _exits: 1021 SafePointNode* ex_map; 1022 while ((ex_map = kit.pop_exception_state()) != NULL) { 1023 Node* ex_oop = kit.use_exception_state(ex_map); 1024 // Force the exiting JVM state to have this method at InvocationEntryBci. 1025 // The exiting JVM state is otherwise a copy of the calling JVMS. 1026 JVMState* caller = kit.jvms(); 1027 JVMState* ex_jvms = caller->clone_shallow(C); 1028 ex_jvms->set_map(kit.clone_map()); 1029 ex_jvms->map()->set_jvms(ex_jvms); 1030 ex_jvms->set_bci( InvocationEntryBci); 1031 kit.set_jvms(ex_jvms); 1032 if (do_synch) { 1033 // Add on the synchronized-method box/object combo 1034 kit.map()->push_monitor(_synch_lock); 1035 // Unlock! 1036 kit.shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node()); 1037 } 1038 if (C->env()->dtrace_method_probes()) { 1039 kit.make_dtrace_method_exit(method()); 1040 } 1041 if (_replaced_nodes_for_exceptions) { 1042 kit.map()->apply_replaced_nodes(); 1043 } 1044 // Done with exception-path processing. 1045 ex_map = kit.make_exception_state(ex_oop); 1046 assert(ex_jvms->same_calls_as(ex_map->jvms()), "sanity"); 1047 // Pop the last vestige of this method: 1048 ex_map->set_jvms(caller->clone_shallow(C)); 1049 ex_map->jvms()->set_map(ex_map); 1050 _exits.push_exception_state(ex_map); 1051 } 1052 assert(_exits.map() == normal_map, "keep the same return state"); 1053 } 1054 1055 { 1056 // Capture very early exceptions (receiver null checks) from caller JVMS 1057 GraphKit caller(_caller); 1058 SafePointNode* ex_map; 1059 while ((ex_map = caller.pop_exception_state()) != NULL) { 1060 _exits.add_exception_state(ex_map); 1061 } 1062 } 1063 _exits.map()->apply_replaced_nodes(); 1064 } 1065 1066 //-----------------------------create_entry_map------------------------------- 1067 // Initialize our parser map to contain the types at method entry. 1068 // For OSR, the map contains a single RawPtr parameter. 1069 // Initial monitor locking for sync. methods is performed by do_method_entry. 1070 SafePointNode* Parse::create_entry_map() { 1071 // Check for really stupid bail-out cases. 1072 uint len = TypeFunc::Parms + method()->max_locals() + method()->max_stack(); 1073 if (len >= 32760) { 1074 C->record_method_not_compilable_all_tiers("too many local variables"); 1075 return NULL; 1076 } 1077 1078 // clear current replaced nodes that are of no use from here on (map was cloned in build_exits). 1079 _caller->map()->delete_replaced_nodes(); 1080 1081 // If this is an inlined method, we may have to do a receiver null check. 1082 if (_caller->has_method() && is_normal_parse() && !method()->is_static()) { 1083 GraphKit kit(_caller); 1084 kit.null_check_receiver_before_call(method()); 1085 _caller = kit.transfer_exceptions_into_jvms(); 1086 if (kit.stopped()) { 1087 _exits.add_exception_states_from(_caller); 1088 _exits.set_jvms(_caller); 1089 return NULL; 1090 } 1091 } 1092 1093 assert(method() != NULL, "parser must have a method"); 1094 1095 // Create an initial safepoint to hold JVM state during parsing 1096 JVMState* jvms = new (C) JVMState(method(), _caller->has_method() ? _caller : NULL); 1097 set_map(new SafePointNode(len, jvms)); 1098 jvms->set_map(map()); 1099 record_for_igvn(map()); 1100 assert(jvms->endoff() == len, "correct jvms sizing"); 1101 1102 SafePointNode* inmap = _caller->map(); 1103 assert(inmap != NULL, "must have inmap"); 1104 // In case of null check on receiver above 1105 map()->transfer_replaced_nodes_from(inmap, _new_idx); 1106 1107 uint i; 1108 1109 // Pass thru the predefined input parameters. 1110 for (i = 0; i < TypeFunc::Parms; i++) { 1111 map()->init_req(i, inmap->in(i)); 1112 } 1113 1114 if (depth() == 1) { 1115 assert(map()->memory()->Opcode() == Op_Parm, ""); 1116 // Insert the memory aliasing node 1117 set_all_memory(reset_memory()); 1118 } 1119 assert(merged_memory(), ""); 1120 1121 // Now add the locals which are initially bound to arguments: 1122 uint arg_size = tf()->domain()->cnt(); 1123 ensure_stack(arg_size - TypeFunc::Parms); // OSR methods have funny args 1124 for (i = TypeFunc::Parms; i < arg_size; i++) { 1125 map()->init_req(i, inmap->argument(_caller, i - TypeFunc::Parms)); 1126 } 1127 1128 // Clear out the rest of the map (locals and stack) 1129 for (i = arg_size; i < len; i++) { 1130 map()->init_req(i, top()); 1131 } 1132 1133 SafePointNode* entry_map = stop(); 1134 return entry_map; 1135 } 1136 1137 //-----------------------------do_method_entry-------------------------------- 1138 // Emit any code needed in the pseudo-block before BCI zero. 1139 // The main thing to do is lock the receiver of a synchronized method. 1140 void Parse::do_method_entry() { 1141 set_parse_bci(InvocationEntryBci); // Pseudo-BCP 1142 set_sp(0); // Java Stack Pointer 1143 1144 NOT_PRODUCT( count_compiled_calls(true/*at_method_entry*/, false/*is_inline*/); ) 1145 1146 if (C->env()->dtrace_method_probes()) { 1147 make_dtrace_method_entry(method()); 1148 } 1149 1150 // If the method is synchronized, we need to construct a lock node, attach 1151 // it to the Start node, and pin it there. 1152 if (method()->is_synchronized()) { 1153 // Insert a FastLockNode right after the Start which takes as arguments 1154 // the current thread pointer, the "this" pointer & the address of the 1155 // stack slot pair used for the lock. The "this" pointer is a projection 1156 // off the start node, but the locking spot has to be constructed by 1157 // creating a ConLNode of 0, and boxing it with a BoxLockNode. The BoxLockNode 1158 // becomes the second argument to the FastLockNode call. The 1159 // FastLockNode becomes the new control parent to pin it to the start. 1160 1161 // Setup Object Pointer 1162 Node *lock_obj = NULL; 1163 if(method()->is_static()) { 1164 ciInstance* mirror = _method->holder()->java_mirror(); 1165 const TypeInstPtr *t_lock = TypeInstPtr::make(mirror); 1166 lock_obj = makecon(t_lock); 1167 } else { // Else pass the "this" pointer, 1168 lock_obj = local(0); // which is Parm0 from StartNode 1169 } 1170 // Clear out dead values from the debug info. 1171 kill_dead_locals(); 1172 // Build the FastLockNode 1173 _synch_lock = shared_lock(lock_obj); 1174 } 1175 1176 // Feed profiling data for parameters to the type system so it can 1177 // propagate it as speculative types 1178 record_profiled_parameters_for_speculation(); 1179 1180 if (depth() == 1) { 1181 increment_and_test_invocation_counter(Tier2CompileThreshold); 1182 } 1183 } 1184 1185 //------------------------------init_blocks------------------------------------ 1186 // Initialize our parser map to contain the types/monitors at method entry. 1187 void Parse::init_blocks() { 1188 // Create the blocks. 1189 _block_count = flow()->block_count(); 1190 _blocks = NEW_RESOURCE_ARRAY(Block, _block_count); 1191 Copy::zero_to_bytes(_blocks, sizeof(Block)*_block_count); 1192 1193 int rpo; 1194 1195 // Initialize the structs. 1196 for (rpo = 0; rpo < block_count(); rpo++) { 1197 Block* block = rpo_at(rpo); 1198 block->init_node(this, rpo); 1199 } 1200 1201 // Collect predecessor and successor information. 1202 for (rpo = 0; rpo < block_count(); rpo++) { 1203 Block* block = rpo_at(rpo); 1204 block->init_graph(this); 1205 } 1206 } 1207 1208 //-------------------------------init_node------------------------------------- 1209 void Parse::Block::init_node(Parse* outer, int rpo) { 1210 _flow = outer->flow()->rpo_at(rpo); 1211 _pred_count = 0; 1212 _preds_parsed = 0; 1213 _count = 0; 1214 assert(pred_count() == 0 && preds_parsed() == 0, "sanity"); 1215 assert(!(is_merged() || is_parsed() || is_handler() || has_merged_backedge()), "sanity"); 1216 assert(_live_locals.size() == 0, "sanity"); 1217 1218 // entry point has additional predecessor 1219 if (flow()->is_start()) _pred_count++; 1220 assert(flow()->is_start() == (this == outer->start_block()), ""); 1221 } 1222 1223 //-------------------------------init_graph------------------------------------ 1224 void Parse::Block::init_graph(Parse* outer) { 1225 // Create the successor list for this parser block. 1226 GrowableArray<ciTypeFlow::Block*>* tfs = flow()->successors(); 1227 GrowableArray<ciTypeFlow::Block*>* tfe = flow()->exceptions(); 1228 int ns = tfs->length(); 1229 int ne = tfe->length(); 1230 _num_successors = ns; 1231 _all_successors = ns+ne; 1232 _successors = (ns+ne == 0) ? NULL : NEW_RESOURCE_ARRAY(Block*, ns+ne); 1233 int p = 0; 1234 for (int i = 0; i < ns+ne; i++) { 1235 ciTypeFlow::Block* tf2 = (i < ns) ? tfs->at(i) : tfe->at(i-ns); 1236 Block* block2 = outer->rpo_at(tf2->rpo()); 1237 _successors[i] = block2; 1238 1239 // Accumulate pred info for the other block, too. 1240 if (i < ns) { 1241 block2->_pred_count++; 1242 } else { 1243 block2->_is_handler = true; 1244 } 1245 1246 #ifdef ASSERT 1247 // A block's successors must be distinguishable by BCI. 1248 // That is, no bytecode is allowed to branch to two different 1249 // clones of the same code location. 1250 for (int j = 0; j < i; j++) { 1251 Block* block1 = _successors[j]; 1252 if (block1 == block2) continue; // duplicates are OK 1253 assert(block1->start() != block2->start(), "successors have unique bcis"); 1254 } 1255 #endif 1256 } 1257 1258 // Note: We never call next_path_num along exception paths, so they 1259 // never get processed as "ready". Also, the input phis of exception 1260 // handlers get specially processed, so that 1261 } 1262 1263 //---------------------------successor_for_bci--------------------------------- 1264 Parse::Block* Parse::Block::successor_for_bci(int bci) { 1265 for (int i = 0; i < all_successors(); i++) { 1266 Block* block2 = successor_at(i); 1267 if (block2->start() == bci) return block2; 1268 } 1269 // We can actually reach here if ciTypeFlow traps out a block 1270 // due to an unloaded class, and concurrently with compilation the 1271 // class is then loaded, so that a later phase of the parser is 1272 // able to see more of the bytecode CFG. Or, the flow pass and 1273 // the parser can have a minor difference of opinion about executability 1274 // of bytecodes. For example, "obj.field = null" is executable even 1275 // if the field's type is an unloaded class; the flow pass used to 1276 // make a trap for such code. 1277 return NULL; 1278 } 1279 1280 1281 //-----------------------------stack_type_at----------------------------------- 1282 const Type* Parse::Block::stack_type_at(int i) const { 1283 return get_type(flow()->stack_type_at(i)); 1284 } 1285 1286 1287 //-----------------------------local_type_at----------------------------------- 1288 const Type* Parse::Block::local_type_at(int i) const { 1289 // Make dead locals fall to bottom. 1290 if (_live_locals.size() == 0) { 1291 MethodLivenessResult live_locals = flow()->outer()->method()->liveness_at_bci(start()); 1292 // This bitmap can be zero length if we saw a breakpoint. 1293 // In such cases, pretend they are all live. 1294 ((Block*)this)->_live_locals = live_locals; 1295 } 1296 if (_live_locals.size() > 0 && !_live_locals.at(i)) 1297 return Type::BOTTOM; 1298 1299 return get_type(flow()->local_type_at(i)); 1300 } 1301 1302 1303 #ifndef PRODUCT 1304 1305 //----------------------------name_for_bc-------------------------------------- 1306 // helper method for BytecodeParseHistogram 1307 static const char* name_for_bc(int i) { 1308 return Bytecodes::is_defined(i) ? Bytecodes::name(Bytecodes::cast(i)) : "xxxunusedxxx"; 1309 } 1310 1311 //----------------------------BytecodeParseHistogram------------------------------------ 1312 Parse::BytecodeParseHistogram::BytecodeParseHistogram(Parse *p, Compile *c) { 1313 _parser = p; 1314 _compiler = c; 1315 if( ! _initialized ) { _initialized = true; reset(); } 1316 } 1317 1318 //----------------------------current_count------------------------------------ 1319 int Parse::BytecodeParseHistogram::current_count(BPHType bph_type) { 1320 switch( bph_type ) { 1321 case BPH_transforms: { return _parser->gvn().made_progress(); } 1322 case BPH_values: { return _parser->gvn().made_new_values(); } 1323 default: { ShouldNotReachHere(); return 0; } 1324 } 1325 } 1326 1327 //----------------------------initialized-------------------------------------- 1328 bool Parse::BytecodeParseHistogram::initialized() { return _initialized; } 1329 1330 //----------------------------reset-------------------------------------------- 1331 void Parse::BytecodeParseHistogram::reset() { 1332 int i = Bytecodes::number_of_codes; 1333 while (i-- > 0) { _bytecodes_parsed[i] = 0; _nodes_constructed[i] = 0; _nodes_transformed[i] = 0; _new_values[i] = 0; } 1334 } 1335 1336 //----------------------------set_initial_state-------------------------------- 1337 // Record info when starting to parse one bytecode 1338 void Parse::BytecodeParseHistogram::set_initial_state( Bytecodes::Code bc ) { 1339 if( PrintParseStatistics && !_parser->is_osr_parse() ) { 1340 _initial_bytecode = bc; 1341 _initial_node_count = _compiler->unique(); 1342 _initial_transforms = current_count(BPH_transforms); 1343 _initial_values = current_count(BPH_values); 1344 } 1345 } 1346 1347 //----------------------------record_change-------------------------------- 1348 // Record results of parsing one bytecode 1349 void Parse::BytecodeParseHistogram::record_change() { 1350 if( PrintParseStatistics && !_parser->is_osr_parse() ) { 1351 ++_bytecodes_parsed[_initial_bytecode]; 1352 _nodes_constructed [_initial_bytecode] += (_compiler->unique() - _initial_node_count); 1353 _nodes_transformed [_initial_bytecode] += (current_count(BPH_transforms) - _initial_transforms); 1354 _new_values [_initial_bytecode] += (current_count(BPH_values) - _initial_values); 1355 } 1356 } 1357 1358 1359 //----------------------------print-------------------------------------------- 1360 void Parse::BytecodeParseHistogram::print(float cutoff) { 1361 ResourceMark rm; 1362 // print profile 1363 int total = 0; 1364 int i = 0; 1365 for( i = 0; i < Bytecodes::number_of_codes; ++i ) { total += _bytecodes_parsed[i]; } 1366 int abs_sum = 0; 1367 tty->cr(); //0123456789012345678901234567890123456789012345678901234567890123456789 1368 tty->print_cr("Histogram of %d parsed bytecodes:", total); 1369 if( total == 0 ) { return; } 1370 tty->cr(); 1371 tty->print_cr("absolute: count of compiled bytecodes of this type"); 1372 tty->print_cr("relative: percentage contribution to compiled nodes"); 1373 tty->print_cr("nodes : Average number of nodes constructed per bytecode"); 1374 tty->print_cr("rnodes : Significance towards total nodes constructed, (nodes*relative)"); 1375 tty->print_cr("transforms: Average amount of tranform progress per bytecode compiled"); 1376 tty->print_cr("values : Average number of node values improved per bytecode"); 1377 tty->print_cr("name : Bytecode name"); 1378 tty->cr(); 1379 tty->print_cr(" absolute relative nodes rnodes transforms values name"); 1380 tty->print_cr("----------------------------------------------------------------------"); 1381 while (--i > 0) { 1382 int abs = _bytecodes_parsed[i]; 1383 float rel = abs * 100.0F / total; 1384 float nodes = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_constructed[i])/_bytecodes_parsed[i]; 1385 float rnodes = _bytecodes_parsed[i] == 0 ? 0 : rel * nodes; 1386 float xforms = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _nodes_transformed[i])/_bytecodes_parsed[i]; 1387 float values = _bytecodes_parsed[i] == 0 ? 0 : (1.0F * _new_values [i])/_bytecodes_parsed[i]; 1388 if (cutoff <= rel) { 1389 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)); 1390 abs_sum += abs; 1391 } 1392 } 1393 tty->print_cr("----------------------------------------------------------------------"); 1394 float rel_sum = abs_sum * 100.0F / total; 1395 tty->print_cr("%10d %7.2f%% (cutoff = %.2f%%)", abs_sum, rel_sum, cutoff); 1396 tty->print_cr("----------------------------------------------------------------------"); 1397 tty->cr(); 1398 } 1399 #endif 1400 1401 //----------------------------load_state_from---------------------------------- 1402 // Load block/map/sp. But not do not touch iter/bci. 1403 void Parse::load_state_from(Block* block) { 1404 set_block(block); 1405 // load the block's JVM state: 1406 set_map(block->start_map()); 1407 set_sp( block->start_sp()); 1408 } 1409 1410 1411 //-----------------------------record_state------------------------------------ 1412 void Parse::Block::record_state(Parse* p) { 1413 assert(!is_merged(), "can only record state once, on 1st inflow"); 1414 assert(start_sp() == p->sp(), "stack pointer must agree with ciTypeFlow"); 1415 set_start_map(p->stop()); 1416 } 1417 1418 1419 //------------------------------do_one_block----------------------------------- 1420 void Parse::do_one_block() { 1421 if (TraceOptoParse) { 1422 Block *b = block(); 1423 int ns = b->num_successors(); 1424 int nt = b->all_successors(); 1425 1426 tty->print("Parsing block #%d at bci [%d,%d), successors: ", 1427 block()->rpo(), block()->start(), block()->limit()); 1428 for (int i = 0; i < nt; i++) { 1429 tty->print((( i < ns) ? " %d" : " %d(e)"), b->successor_at(i)->rpo()); 1430 } 1431 if (b->is_loop_head()) tty->print(" lphd"); 1432 tty->cr(); 1433 } 1434 1435 assert(block()->is_merged(), "must be merged before being parsed"); 1436 block()->mark_parsed(); 1437 ++_blocks_parsed; 1438 1439 // Set iterator to start of block. 1440 iter().reset_to_bci(block()->start()); 1441 1442 CompileLog* log = C->log(); 1443 1444 // Parse bytecodes 1445 while (!stopped() && !failing()) { 1446 iter().next(); 1447 1448 // Learn the current bci from the iterator: 1449 set_parse_bci(iter().cur_bci()); 1450 1451 if (bci() == block()->limit()) { 1452 // Do not walk into the next block until directed by do_all_blocks. 1453 merge(bci()); 1454 break; 1455 } 1456 assert(bci() < block()->limit(), "bci still in block"); 1457 1458 if (log != NULL) { 1459 // Output an optional context marker, to help place actions 1460 // that occur during parsing of this BC. If there is no log 1461 // output until the next context string, this context string 1462 // will be silently ignored. 1463 log->set_context("bc code='%d' bci='%d'", (int)bc(), bci()); 1464 } 1465 1466 if (block()->has_trap_at(bci())) { 1467 // We must respect the flow pass's traps, because it will refuse 1468 // to produce successors for trapping blocks. 1469 int trap_index = block()->flow()->trap_index(); 1470 assert(trap_index != 0, "trap index must be valid"); 1471 uncommon_trap(trap_index); 1472 break; 1473 } 1474 1475 NOT_PRODUCT( parse_histogram()->set_initial_state(bc()); ); 1476 1477 #ifdef ASSERT 1478 int pre_bc_sp = sp(); 1479 int inputs, depth; 1480 bool have_se = !stopped() && compute_stack_effects(inputs, depth); 1481 assert(!have_se || pre_bc_sp >= inputs, "have enough stack to execute this BC: pre_bc_sp=%d, inputs=%d", pre_bc_sp, inputs); 1482 #endif //ASSERT 1483 1484 do_one_bytecode(); 1485 1486 assert(!have_se || stopped() || failing() || (sp() - pre_bc_sp) == depth, 1487 "incorrect depth prediction: sp=%d, pre_bc_sp=%d, depth=%d", sp(), pre_bc_sp, depth); 1488 1489 do_exceptions(); 1490 1491 NOT_PRODUCT( parse_histogram()->record_change(); ); 1492 1493 if (log != NULL) 1494 log->clear_context(); // skip marker if nothing was printed 1495 1496 // Fall into next bytecode. Each bytecode normally has 1 sequential 1497 // successor which is typically made ready by visiting this bytecode. 1498 // If the successor has several predecessors, then it is a merge 1499 // point, starts a new basic block, and is handled like other basic blocks. 1500 } 1501 } 1502 1503 1504 //------------------------------merge------------------------------------------ 1505 void Parse::set_parse_bci(int bci) { 1506 set_bci(bci); 1507 Node_Notes* nn = C->default_node_notes(); 1508 if (nn == NULL) return; 1509 1510 // Collect debug info for inlined calls unless -XX:-DebugInlinedCalls. 1511 if (!DebugInlinedCalls && depth() > 1) { 1512 return; 1513 } 1514 1515 // Update the JVMS annotation, if present. 1516 JVMState* jvms = nn->jvms(); 1517 if (jvms != NULL && jvms->bci() != bci) { 1518 // Update the JVMS. 1519 jvms = jvms->clone_shallow(C); 1520 jvms->set_bci(bci); 1521 nn->set_jvms(jvms); 1522 } 1523 } 1524 1525 //------------------------------merge------------------------------------------ 1526 // Merge the current mapping into the basic block starting at bci 1527 void Parse::merge(int target_bci) { 1528 Block* target = successor_for_bci(target_bci); 1529 if (target == NULL) { handle_missing_successor(target_bci); return; } 1530 assert(!target->is_ready(), "our arrival must be expected"); 1531 int pnum = target->next_path_num(); 1532 merge_common(target, pnum); 1533 } 1534 1535 //-------------------------merge_new_path-------------------------------------- 1536 // Merge the current mapping into the basic block, using a new path 1537 void Parse::merge_new_path(int target_bci) { 1538 Block* target = successor_for_bci(target_bci); 1539 if (target == NULL) { handle_missing_successor(target_bci); return; } 1540 assert(!target->is_ready(), "new path into frozen graph"); 1541 int pnum = target->add_new_path(); 1542 merge_common(target, pnum); 1543 } 1544 1545 //-------------------------merge_exception------------------------------------- 1546 // Merge the current mapping into the basic block starting at bci 1547 // The ex_oop must be pushed on the stack, unlike throw_to_exit. 1548 void Parse::merge_exception(int target_bci) { 1549 assert(sp() == 1, "must have only the throw exception on the stack"); 1550 Block* target = successor_for_bci(target_bci); 1551 if (target == NULL) { handle_missing_successor(target_bci); return; } 1552 assert(target->is_handler(), "exceptions are handled by special blocks"); 1553 int pnum = target->add_new_path(); 1554 merge_common(target, pnum); 1555 } 1556 1557 //--------------------handle_missing_successor--------------------------------- 1558 void Parse::handle_missing_successor(int target_bci) { 1559 #ifndef PRODUCT 1560 Block* b = block(); 1561 int trap_bci = b->flow()->has_trap()? b->flow()->trap_bci(): -1; 1562 tty->print_cr("### Missing successor at bci:%d for block #%d (trap_bci:%d)", target_bci, b->rpo(), trap_bci); 1563 #endif 1564 ShouldNotReachHere(); 1565 } 1566 1567 //--------------------------merge_common--------------------------------------- 1568 void Parse::merge_common(Parse::Block* target, int pnum) { 1569 if (TraceOptoParse) { 1570 tty->print("Merging state at block #%d bci:%d", target->rpo(), target->start()); 1571 } 1572 1573 // Zap extra stack slots to top 1574 assert(sp() == target->start_sp(), ""); 1575 clean_stack(sp()); 1576 1577 if (!target->is_merged()) { // No prior mapping at this bci 1578 if (TraceOptoParse) { tty->print(" with empty state"); } 1579 1580 // If this path is dead, do not bother capturing it as a merge. 1581 // It is "as if" we had 1 fewer predecessors from the beginning. 1582 if (stopped()) { 1583 if (TraceOptoParse) tty->print_cr(", but path is dead and doesn't count"); 1584 return; 1585 } 1586 1587 // Record that a new block has been merged. 1588 ++_blocks_merged; 1589 1590 // Make a region if we know there are multiple or unpredictable inputs. 1591 // (Also, if this is a plain fall-through, we might see another region, 1592 // which must not be allowed into this block's map.) 1593 if (pnum > PhiNode::Input // Known multiple inputs. 1594 || target->is_handler() // These have unpredictable inputs. 1595 || target->is_loop_head() // Known multiple inputs 1596 || control()->is_Region()) { // We must hide this guy. 1597 1598 int current_bci = bci(); 1599 set_parse_bci(target->start()); // Set target bci 1600 if (target->is_SEL_head()) { 1601 DEBUG_ONLY( target->mark_merged_backedge(block()); ) 1602 if (target->start() == 0) { 1603 // Add loop predicate for the special case when 1604 // there are backbranches to the method entry. 1605 add_predicate(); 1606 } 1607 } 1608 // Add a Region to start the new basic block. Phis will be added 1609 // later lazily. 1610 int edges = target->pred_count(); 1611 if (edges < pnum) edges = pnum; // might be a new path! 1612 RegionNode *r = new RegionNode(edges+1); 1613 gvn().set_type(r, Type::CONTROL); 1614 record_for_igvn(r); 1615 // zap all inputs to NULL for debugging (done in Node(uint) constructor) 1616 // for (int j = 1; j < edges+1; j++) { r->init_req(j, NULL); } 1617 r->init_req(pnum, control()); 1618 set_control(r); 1619 set_parse_bci(current_bci); // Restore bci 1620 } 1621 1622 // Convert the existing Parser mapping into a mapping at this bci. 1623 store_state_to(target); 1624 assert(target->is_merged(), "do not come here twice"); 1625 1626 } else { // Prior mapping at this bci 1627 if (TraceOptoParse) { tty->print(" with previous state"); } 1628 #ifdef ASSERT 1629 if (target->is_SEL_head()) { 1630 target->mark_merged_backedge(block()); 1631 } 1632 #endif 1633 // We must not manufacture more phis if the target is already parsed. 1634 bool nophi = target->is_parsed(); 1635 1636 SafePointNode* newin = map();// Hang on to incoming mapping 1637 Block* save_block = block(); // Hang on to incoming block; 1638 load_state_from(target); // Get prior mapping 1639 1640 assert(newin->jvms()->locoff() == jvms()->locoff(), "JVMS layouts agree"); 1641 assert(newin->jvms()->stkoff() == jvms()->stkoff(), "JVMS layouts agree"); 1642 assert(newin->jvms()->monoff() == jvms()->monoff(), "JVMS layouts agree"); 1643 assert(newin->jvms()->endoff() == jvms()->endoff(), "JVMS layouts agree"); 1644 1645 // Iterate over my current mapping and the old mapping. 1646 // Where different, insert Phi functions. 1647 // Use any existing Phi functions. 1648 assert(control()->is_Region(), "must be merging to a region"); 1649 RegionNode* r = control()->as_Region(); 1650 1651 // Compute where to merge into 1652 // Merge incoming control path 1653 r->init_req(pnum, newin->control()); 1654 1655 if (pnum == 1) { // Last merge for this Region? 1656 if (!block()->flow()->is_irreducible_entry()) { 1657 Node* result = _gvn.transform_no_reclaim(r); 1658 if (r != result && TraceOptoParse) { 1659 tty->print_cr("Block #%d replace %d with %d", block()->rpo(), r->_idx, result->_idx); 1660 } 1661 } 1662 record_for_igvn(r); 1663 } 1664 1665 // Update all the non-control inputs to map: 1666 assert(TypeFunc::Parms == newin->jvms()->locoff(), "parser map should contain only youngest jvms"); 1667 bool check_elide_phi = target->is_SEL_backedge(save_block); 1668 for (uint j = 1; j < newin->req(); j++) { 1669 Node* m = map()->in(j); // Current state of target. 1670 Node* n = newin->in(j); // Incoming change to target state. 1671 PhiNode* phi; 1672 if (m->is_Phi() && m->as_Phi()->region() == r) 1673 phi = m->as_Phi(); 1674 else 1675 phi = NULL; 1676 if (m != n) { // Different; must merge 1677 switch (j) { 1678 // Frame pointer and Return Address never changes 1679 case TypeFunc::FramePtr:// Drop m, use the original value 1680 case TypeFunc::ReturnAdr: 1681 break; 1682 case TypeFunc::Memory: // Merge inputs to the MergeMem node 1683 assert(phi == NULL, "the merge contains phis, not vice versa"); 1684 merge_memory_edges(n->as_MergeMem(), pnum, nophi); 1685 continue; 1686 default: // All normal stuff 1687 if (phi == NULL) { 1688 const JVMState* jvms = map()->jvms(); 1689 if (EliminateNestedLocks && 1690 jvms->is_mon(j) && jvms->is_monitor_box(j)) { 1691 // BoxLock nodes are not commoning. 1692 // Use old BoxLock node as merged box. 1693 assert(newin->jvms()->is_monitor_box(j), "sanity"); 1694 // This assert also tests that nodes are BoxLock. 1695 assert(BoxLockNode::same_slot(n, m), "sanity"); 1696 C->gvn_replace_by(n, m); 1697 } else if (!check_elide_phi || !target->can_elide_SEL_phi(j)) { 1698 phi = ensure_phi(j, nophi); 1699 } 1700 } 1701 break; 1702 } 1703 } 1704 // At this point, n might be top if: 1705 // - there is no phi (because TypeFlow detected a conflict), or 1706 // - the corresponding control edges is top (a dead incoming path) 1707 // It is a bug if we create a phi which sees a garbage value on a live path. 1708 1709 if (phi != NULL) { 1710 assert(n != top() || r->in(pnum) == top(), "live value must not be garbage"); 1711 assert(phi->region() == r, ""); 1712 phi->set_req(pnum, n); // Then add 'n' to the merge 1713 if (pnum == PhiNode::Input) { 1714 // Last merge for this Phi. 1715 // So far, Phis have had a reasonable type from ciTypeFlow. 1716 // Now _gvn will join that with the meet of current inputs. 1717 // BOTTOM is never permissible here, 'cause pessimistically 1718 // Phis of pointers cannot lose the basic pointer type. 1719 debug_only(const Type* bt1 = phi->bottom_type()); 1720 assert(bt1 != Type::BOTTOM, "should not be building conflict phis"); 1721 map()->set_req(j, _gvn.transform_no_reclaim(phi)); 1722 debug_only(const Type* bt2 = phi->bottom_type()); 1723 assert(bt2->higher_equal_speculative(bt1), "must be consistent with type-flow"); 1724 record_for_igvn(phi); 1725 } 1726 } 1727 } // End of for all values to be merged 1728 1729 if (pnum == PhiNode::Input && 1730 !r->in(0)) { // The occasional useless Region 1731 assert(control() == r, ""); 1732 set_control(r->nonnull_req()); 1733 } 1734 1735 map()->merge_replaced_nodes_with(newin); 1736 1737 // newin has been subsumed into the lazy merge, and is now dead. 1738 set_block(save_block); 1739 1740 stop(); // done with this guy, for now 1741 } 1742 1743 if (TraceOptoParse) { 1744 tty->print_cr(" on path %d", pnum); 1745 } 1746 1747 // Done with this parser state. 1748 assert(stopped(), ""); 1749 } 1750 1751 1752 //--------------------------merge_memory_edges--------------------------------- 1753 void Parse::merge_memory_edges(MergeMemNode* n, int pnum, bool nophi) { 1754 // (nophi means we must not create phis, because we already parsed here) 1755 assert(n != NULL, ""); 1756 // Merge the inputs to the MergeMems 1757 MergeMemNode* m = merged_memory(); 1758 1759 assert(control()->is_Region(), "must be merging to a region"); 1760 RegionNode* r = control()->as_Region(); 1761 1762 PhiNode* base = NULL; 1763 MergeMemNode* remerge = NULL; 1764 for (MergeMemStream mms(m, n); mms.next_non_empty2(); ) { 1765 Node *p = mms.force_memory(); 1766 Node *q = mms.memory2(); 1767 if (mms.is_empty() && nophi) { 1768 // Trouble: No new splits allowed after a loop body is parsed. 1769 // Instead, wire the new split into a MergeMem on the backedge. 1770 // The optimizer will sort it out, slicing the phi. 1771 if (remerge == NULL) { 1772 assert(base != NULL, ""); 1773 assert(base->in(0) != NULL, "should not be xformed away"); 1774 remerge = MergeMemNode::make(base->in(pnum)); 1775 gvn().set_type(remerge, Type::MEMORY); 1776 base->set_req(pnum, remerge); 1777 } 1778 remerge->set_memory_at(mms.alias_idx(), q); 1779 continue; 1780 } 1781 assert(!q->is_MergeMem(), ""); 1782 PhiNode* phi; 1783 if (p != q) { 1784 phi = ensure_memory_phi(mms.alias_idx(), nophi); 1785 } else { 1786 if (p->is_Phi() && p->as_Phi()->region() == r) 1787 phi = p->as_Phi(); 1788 else 1789 phi = NULL; 1790 } 1791 // Insert q into local phi 1792 if (phi != NULL) { 1793 assert(phi->region() == r, ""); 1794 p = phi; 1795 phi->set_req(pnum, q); 1796 if (mms.at_base_memory()) { 1797 base = phi; // delay transforming it 1798 } else if (pnum == 1) { 1799 record_for_igvn(phi); 1800 p = _gvn.transform_no_reclaim(phi); 1801 } 1802 mms.set_memory(p);// store back through the iterator 1803 } 1804 } 1805 // Transform base last, in case we must fiddle with remerging. 1806 if (base != NULL && pnum == 1) { 1807 record_for_igvn(base); 1808 m->set_base_memory( _gvn.transform_no_reclaim(base) ); 1809 } 1810 } 1811 1812 1813 //------------------------ensure_phis_everywhere------------------------------- 1814 void Parse::ensure_phis_everywhere() { 1815 ensure_phi(TypeFunc::I_O); 1816 1817 // Ensure a phi on all currently known memories. 1818 for (MergeMemStream mms(merged_memory()); mms.next_non_empty(); ) { 1819 ensure_memory_phi(mms.alias_idx()); 1820 debug_only(mms.set_memory()); // keep the iterator happy 1821 } 1822 1823 // Note: This is our only chance to create phis for memory slices. 1824 // If we miss a slice that crops up later, it will have to be 1825 // merged into the base-memory phi that we are building here. 1826 // Later, the optimizer will comb out the knot, and build separate 1827 // phi-loops for each memory slice that matters. 1828 1829 // Monitors must nest nicely and not get confused amongst themselves. 1830 // Phi-ify everything up to the monitors, though. 1831 uint monoff = map()->jvms()->monoff(); 1832 uint nof_monitors = map()->jvms()->nof_monitors(); 1833 1834 assert(TypeFunc::Parms == map()->jvms()->locoff(), "parser map should contain only youngest jvms"); 1835 bool check_elide_phi = block()->is_SEL_head(); 1836 for (uint i = TypeFunc::Parms; i < monoff; i++) { 1837 if (!check_elide_phi || !block()->can_elide_SEL_phi(i)) { 1838 ensure_phi(i); 1839 } 1840 } 1841 1842 // Even monitors need Phis, though they are well-structured. 1843 // This is true for OSR methods, and also for the rare cases where 1844 // a monitor object is the subject of a replace_in_map operation. 1845 // See bugs 4426707 and 5043395. 1846 for (uint m = 0; m < nof_monitors; m++) { 1847 ensure_phi(map()->jvms()->monitor_obj_offset(m)); 1848 } 1849 } 1850 1851 1852 //-----------------------------add_new_path------------------------------------ 1853 // Add a previously unaccounted predecessor to this block. 1854 int Parse::Block::add_new_path() { 1855 // If there is no map, return the lowest unused path number. 1856 if (!is_merged()) return pred_count()+1; // there will be a map shortly 1857 1858 SafePointNode* map = start_map(); 1859 if (!map->control()->is_Region()) 1860 return pred_count()+1; // there may be a region some day 1861 RegionNode* r = map->control()->as_Region(); 1862 1863 // Add new path to the region. 1864 uint pnum = r->req(); 1865 r->add_req(NULL); 1866 1867 for (uint i = 1; i < map->req(); i++) { 1868 Node* n = map->in(i); 1869 if (i == TypeFunc::Memory) { 1870 // Ensure a phi on all currently known memories. 1871 for (MergeMemStream mms(n->as_MergeMem()); mms.next_non_empty(); ) { 1872 Node* phi = mms.memory(); 1873 if (phi->is_Phi() && phi->as_Phi()->region() == r) { 1874 assert(phi->req() == pnum, "must be same size as region"); 1875 phi->add_req(NULL); 1876 } 1877 } 1878 } else { 1879 if (n->is_Phi() && n->as_Phi()->region() == r) { 1880 assert(n->req() == pnum, "must be same size as region"); 1881 n->add_req(NULL); 1882 } 1883 } 1884 } 1885 1886 return pnum; 1887 } 1888 1889 //------------------------------ensure_phi------------------------------------- 1890 // Turn the idx'th entry of the current map into a Phi 1891 PhiNode *Parse::ensure_phi(int idx, bool nocreate) { 1892 SafePointNode* map = this->map(); 1893 Node* region = map->control(); 1894 assert(region->is_Region(), ""); 1895 1896 Node* o = map->in(idx); 1897 assert(o != NULL, ""); 1898 1899 if (o == top()) return NULL; // TOP always merges into TOP 1900 1901 if (o->is_Phi() && o->as_Phi()->region() == region) { 1902 return o->as_Phi(); 1903 } 1904 1905 // Now use a Phi here for merging 1906 assert(!nocreate, "Cannot build a phi for a block already parsed."); 1907 const JVMState* jvms = map->jvms(); 1908 const Type* t = NULL; 1909 if (jvms->is_loc(idx)) { 1910 t = block()->local_type_at(idx - jvms->locoff()); 1911 } else if (jvms->is_stk(idx)) { 1912 t = block()->stack_type_at(idx - jvms->stkoff()); 1913 } else if (jvms->is_mon(idx)) { 1914 assert(!jvms->is_monitor_box(idx), "no phis for boxes"); 1915 t = TypeInstPtr::BOTTOM; // this is sufficient for a lock object 1916 } else if ((uint)idx < TypeFunc::Parms) { 1917 t = o->bottom_type(); // Type::RETURN_ADDRESS or such-like. 1918 } else { 1919 assert(false, "no type information for this phi"); 1920 } 1921 1922 // If the type falls to bottom, then this must be a local that 1923 // is mixing ints and oops or some such. Forcing it to top 1924 // makes it go dead. 1925 if (t == Type::BOTTOM) { 1926 map->set_req(idx, top()); 1927 return NULL; 1928 } 1929 1930 // Do not create phis for top either. 1931 // A top on a non-null control flow must be an unused even after the.phi. 1932 if (t == Type::TOP || t == Type::HALF) { 1933 map->set_req(idx, top()); 1934 return NULL; 1935 } 1936 1937 PhiNode* phi = PhiNode::make(region, o, t); 1938 gvn().set_type(phi, t); 1939 if (C->do_escape_analysis()) record_for_igvn(phi); 1940 map->set_req(idx, phi); 1941 return phi; 1942 } 1943 1944 //--------------------------ensure_memory_phi---------------------------------- 1945 // Turn the idx'th slice of the current memory into a Phi 1946 PhiNode *Parse::ensure_memory_phi(int idx, bool nocreate) { 1947 MergeMemNode* mem = merged_memory(); 1948 Node* region = control(); 1949 assert(region->is_Region(), ""); 1950 1951 Node *o = (idx == Compile::AliasIdxBot)? mem->base_memory(): mem->memory_at(idx); 1952 assert(o != NULL && o != top(), ""); 1953 1954 PhiNode* phi; 1955 if (o->is_Phi() && o->as_Phi()->region() == region) { 1956 phi = o->as_Phi(); 1957 if (phi == mem->base_memory() && idx >= Compile::AliasIdxRaw) { 1958 // clone the shared base memory phi to make a new memory split 1959 assert(!nocreate, "Cannot build a phi for a block already parsed."); 1960 const Type* t = phi->bottom_type(); 1961 const TypePtr* adr_type = C->get_adr_type(idx); 1962 phi = phi->slice_memory(adr_type); 1963 gvn().set_type(phi, t); 1964 } 1965 return phi; 1966 } 1967 1968 // Now use a Phi here for merging 1969 assert(!nocreate, "Cannot build a phi for a block already parsed."); 1970 const Type* t = o->bottom_type(); 1971 const TypePtr* adr_type = C->get_adr_type(idx); 1972 phi = PhiNode::make(region, o, t, adr_type); 1973 gvn().set_type(phi, t); 1974 if (idx == Compile::AliasIdxBot) 1975 mem->set_base_memory(phi); 1976 else 1977 mem->set_memory_at(idx, phi); 1978 return phi; 1979 } 1980 1981 //------------------------------call_register_finalizer----------------------- 1982 // Check the klass of the receiver and call register_finalizer if the 1983 // class need finalization. 1984 void Parse::call_register_finalizer() { 1985 Node* receiver = local(0); 1986 assert(receiver != NULL && receiver->bottom_type()->isa_instptr() != NULL, 1987 "must have non-null instance type"); 1988 1989 const TypeInstPtr *tinst = receiver->bottom_type()->isa_instptr(); 1990 if (tinst != NULL && tinst->klass()->is_loaded() && !tinst->klass_is_exact()) { 1991 // The type isn't known exactly so see if CHA tells us anything. 1992 ciInstanceKlass* ik = tinst->klass()->as_instance_klass(); 1993 if (!Dependencies::has_finalizable_subclass(ik)) { 1994 // No finalizable subclasses so skip the dynamic check. 1995 C->dependencies()->assert_has_no_finalizable_subclasses(ik); 1996 return; 1997 } 1998 } 1999 2000 // Insert a dynamic test for whether the instance needs 2001 // finalization. In general this will fold up since the concrete 2002 // class is often visible so the access flags are constant. 2003 Node* klass_addr = basic_plus_adr( receiver, receiver, oopDesc::klass_offset_in_bytes() ); 2004 Node* klass = _gvn.transform(LoadKlassNode::make(_gvn, NULL, immutable_memory(), klass_addr, TypeInstPtr::KLASS)); 2005 2006 Node* access_flags_addr = basic_plus_adr(klass, klass, in_bytes(Klass::access_flags_offset())); 2007 Node* access_flags = make_load(NULL, access_flags_addr, TypeInt::INT, T_INT, MemNode::unordered); 2008 2009 Node* mask = _gvn.transform(new AndINode(access_flags, intcon(JVM_ACC_HAS_FINALIZER))); 2010 Node* check = _gvn.transform(new CmpINode(mask, intcon(0))); 2011 Node* test = _gvn.transform(new BoolNode(check, BoolTest::ne)); 2012 2013 IfNode* iff = create_and_map_if(control(), test, PROB_MAX, COUNT_UNKNOWN); 2014 2015 RegionNode* result_rgn = new RegionNode(3); 2016 record_for_igvn(result_rgn); 2017 2018 Node *skip_register = _gvn.transform(new IfFalseNode(iff)); 2019 result_rgn->init_req(1, skip_register); 2020 2021 Node *needs_register = _gvn.transform(new IfTrueNode(iff)); 2022 set_control(needs_register); 2023 if (stopped()) { 2024 // There is no slow path. 2025 result_rgn->init_req(2, top()); 2026 } else { 2027 Node *call = make_runtime_call(RC_NO_LEAF, 2028 OptoRuntime::register_finalizer_Type(), 2029 OptoRuntime::register_finalizer_Java(), 2030 NULL, TypePtr::BOTTOM, 2031 receiver); 2032 make_slow_call_ex(call, env()->Throwable_klass(), true); 2033 2034 Node* fast_io = call->in(TypeFunc::I_O); 2035 Node* fast_mem = call->in(TypeFunc::Memory); 2036 // These two phis are pre-filled with copies of of the fast IO and Memory 2037 Node* io_phi = PhiNode::make(result_rgn, fast_io, Type::ABIO); 2038 Node* mem_phi = PhiNode::make(result_rgn, fast_mem, Type::MEMORY, TypePtr::BOTTOM); 2039 2040 result_rgn->init_req(2, control()); 2041 io_phi ->init_req(2, i_o()); 2042 mem_phi ->init_req(2, reset_memory()); 2043 2044 set_all_memory( _gvn.transform(mem_phi) ); 2045 set_i_o( _gvn.transform(io_phi) ); 2046 } 2047 2048 set_control( _gvn.transform(result_rgn) ); 2049 } 2050 2051 // Add check to deoptimize if RTM state is not ProfileRTM 2052 void Parse::rtm_deopt() { 2053 #if INCLUDE_RTM_OPT 2054 if (C->profile_rtm()) { 2055 assert(C->method() != NULL, "only for normal compilations"); 2056 assert(!C->method()->method_data()->is_empty(), "MDO is needed to record RTM state"); 2057 assert(depth() == 1, "generate check only for main compiled method"); 2058 2059 // Set starting bci for uncommon trap. 2060 set_parse_bci(is_osr_parse() ? osr_bci() : 0); 2061 2062 // Load the rtm_state from the MethodData. 2063 const TypePtr* adr_type = TypeMetadataPtr::make(C->method()->method_data()); 2064 Node* mdo = makecon(adr_type); 2065 int offset = MethodData::rtm_state_offset_in_bytes(); 2066 Node* adr_node = basic_plus_adr(mdo, mdo, offset); 2067 Node* rtm_state = make_load(control(), adr_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered); 2068 2069 // Separate Load from Cmp by Opaque. 2070 // In expand_macro_nodes() it will be replaced either 2071 // with this load when there are locks in the code 2072 // or with ProfileRTM (cmp->in(2)) otherwise so that 2073 // the check will fold. 2074 Node* profile_state = makecon(TypeInt::make(ProfileRTM)); 2075 Node* opq = _gvn.transform( new Opaque3Node(C, rtm_state, Opaque3Node::RTM_OPT) ); 2076 Node* chk = _gvn.transform( new CmpINode(opq, profile_state) ); 2077 Node* tst = _gvn.transform( new BoolNode(chk, BoolTest::eq) ); 2078 // Branch to failure if state was changed 2079 { BuildCutout unless(this, tst, PROB_ALWAYS); 2080 uncommon_trap(Deoptimization::Reason_rtm_state_change, 2081 Deoptimization::Action_make_not_entrant); 2082 } 2083 } 2084 #endif 2085 } 2086 2087 void Parse::decrement_age() { 2088 MethodCounters* mc = method()->ensure_method_counters(); 2089 if (mc == NULL) { 2090 C->record_failure("Must have MCs"); 2091 return; 2092 } 2093 assert(!is_osr_parse(), "Not doing this for OSRs"); 2094 2095 // Set starting bci for uncommon trap. 2096 set_parse_bci(0); 2097 2098 const TypePtr* adr_type = TypeRawPtr::make((address)mc); 2099 Node* mc_adr = makecon(adr_type); 2100 Node* cnt_adr = basic_plus_adr(mc_adr, mc_adr, in_bytes(MethodCounters::nmethod_age_offset())); 2101 Node* cnt = make_load(control(), cnt_adr, TypeInt::INT, T_INT, adr_type, MemNode::unordered); 2102 Node* decr = _gvn.transform(new SubINode(cnt, makecon(TypeInt::ONE))); 2103 store_to_memory(control(), cnt_adr, decr, T_INT, adr_type, MemNode::unordered); 2104 Node *chk = _gvn.transform(new CmpINode(decr, makecon(TypeInt::ZERO))); 2105 Node* tst = _gvn.transform(new BoolNode(chk, BoolTest::gt)); 2106 { BuildCutout unless(this, tst, PROB_ALWAYS); 2107 uncommon_trap(Deoptimization::Reason_tenured, 2108 Deoptimization::Action_make_not_entrant); 2109 } 2110 } 2111 2112 //------------------------------return_current--------------------------------- 2113 // Append current _map to _exit_return 2114 void Parse::return_current(Node* value) { 2115 if (RegisterFinalizersAtInit && 2116 method()->intrinsic_id() == vmIntrinsics::_Object_init) { 2117 call_register_finalizer(); 2118 } 2119 2120 // Do not set_parse_bci, so that return goo is credited to the return insn. 2121 set_bci(InvocationEntryBci); 2122 if (method()->is_synchronized() && GenerateSynchronizationCode) { 2123 shared_unlock(_synch_lock->box_node(), _synch_lock->obj_node()); 2124 } 2125 if (C->env()->dtrace_method_probes()) { 2126 make_dtrace_method_exit(method()); 2127 } 2128 SafePointNode* exit_return = _exits.map(); 2129 exit_return->in( TypeFunc::Control )->add_req( control() ); 2130 exit_return->in( TypeFunc::I_O )->add_req( i_o () ); 2131 Node *mem = exit_return->in( TypeFunc::Memory ); 2132 for (MergeMemStream mms(mem->as_MergeMem(), merged_memory()); mms.next_non_empty2(); ) { 2133 if (mms.is_empty()) { 2134 // get a copy of the base memory, and patch just this one input 2135 const TypePtr* adr_type = mms.adr_type(C); 2136 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); 2137 assert(phi->as_Phi()->region() == mms.base_memory()->in(0), ""); 2138 gvn().set_type_bottom(phi); 2139 phi->del_req(phi->req()-1); // prepare to re-patch 2140 mms.set_memory(phi); 2141 } 2142 mms.memory()->add_req(mms.memory2()); 2143 } 2144 2145 // frame pointer is always same, already captured 2146 if (value != NULL) { 2147 // If returning oops to an interface-return, there is a silent free 2148 // cast from oop to interface allowed by the Verifier. Make it explicit 2149 // here. 2150 Node* phi = _exits.argument(0); 2151 const TypeInstPtr *tr = phi->bottom_type()->isa_instptr(); 2152 if (tr && tr->klass()->is_loaded() && 2153 tr->klass()->is_interface()) { 2154 const TypeInstPtr *tp = value->bottom_type()->isa_instptr(); 2155 if (tp && tp->klass()->is_loaded() && 2156 !tp->klass()->is_interface()) { 2157 // sharpen the type eagerly; this eases certain assert checking 2158 if (tp->higher_equal(TypeInstPtr::NOTNULL)) 2159 tr = tr->join_speculative(TypeInstPtr::NOTNULL)->is_instptr(); 2160 value = _gvn.transform(new CheckCastPPNode(0, value, tr)); 2161 } 2162 } else { 2163 // Also handle returns of oop-arrays to an arrays-of-interface return 2164 const TypeInstPtr* phi_tip; 2165 const TypeInstPtr* val_tip; 2166 Type::get_arrays_base_elements(phi->bottom_type(), value->bottom_type(), &phi_tip, &val_tip); 2167 if (phi_tip != NULL && phi_tip->is_loaded() && phi_tip->klass()->is_interface() && 2168 val_tip != NULL && val_tip->is_loaded() && !val_tip->klass()->is_interface()) { 2169 value = _gvn.transform(new CheckCastPPNode(0, value, phi->bottom_type())); 2170 } 2171 } 2172 phi->add_req(value); 2173 } 2174 2175 if (_first_return) { 2176 _exits.map()->transfer_replaced_nodes_from(map(), _new_idx); 2177 _first_return = false; 2178 } else { 2179 _exits.map()->merge_replaced_nodes_with(map()); 2180 } 2181 2182 stop_and_kill_map(); // This CFG path dies here 2183 } 2184 2185 2186 //------------------------------add_safepoint---------------------------------- 2187 void Parse::add_safepoint() { 2188 // See if we can avoid this safepoint. No need for a SafePoint immediately 2189 // after a Call (except Leaf Call) or another SafePoint. 2190 Node *proj = control(); 2191 bool add_poll_param = SafePointNode::needs_polling_address_input(); 2192 uint parms = add_poll_param ? TypeFunc::Parms+1 : TypeFunc::Parms; 2193 if( proj->is_Proj() ) { 2194 Node *n0 = proj->in(0); 2195 if( n0->is_Catch() ) { 2196 n0 = n0->in(0)->in(0); 2197 assert( n0->is_Call(), "expect a call here" ); 2198 } 2199 if( n0->is_Call() ) { 2200 if( n0->as_Call()->guaranteed_safepoint() ) 2201 return; 2202 } else if( n0->is_SafePoint() && n0->req() >= parms ) { 2203 return; 2204 } 2205 } 2206 2207 // Clear out dead values from the debug info. 2208 kill_dead_locals(); 2209 2210 // Clone the JVM State 2211 SafePointNode *sfpnt = new SafePointNode(parms, NULL); 2212 2213 // Capture memory state BEFORE a SafePoint. Since we can block at a 2214 // SafePoint we need our GC state to be safe; i.e. we need all our current 2215 // write barriers (card marks) to not float down after the SafePoint so we 2216 // must read raw memory. Likewise we need all oop stores to match the card 2217 // marks. If deopt can happen, we need ALL stores (we need the correct JVM 2218 // state on a deopt). 2219 2220 // We do not need to WRITE the memory state after a SafePoint. The control 2221 // edge will keep card-marks and oop-stores from floating up from below a 2222 // SafePoint and our true dependency added here will keep them from floating 2223 // down below a SafePoint. 2224 2225 // Clone the current memory state 2226 Node* mem = MergeMemNode::make(map()->memory()); 2227 2228 mem = _gvn.transform(mem); 2229 2230 // Pass control through the safepoint 2231 sfpnt->init_req(TypeFunc::Control , control()); 2232 // Fix edges normally used by a call 2233 sfpnt->init_req(TypeFunc::I_O , top() ); 2234 sfpnt->init_req(TypeFunc::Memory , mem ); 2235 sfpnt->init_req(TypeFunc::ReturnAdr, top() ); 2236 sfpnt->init_req(TypeFunc::FramePtr , top() ); 2237 2238 // Create a node for the polling address 2239 if( add_poll_param ) { 2240 Node *polladr = ConPNode::make((address)os::get_polling_page()); 2241 sfpnt->init_req(TypeFunc::Parms+0, _gvn.transform(polladr)); 2242 } 2243 2244 // Fix up the JVM State edges 2245 add_safepoint_edges(sfpnt); 2246 Node *transformed_sfpnt = _gvn.transform(sfpnt); 2247 set_control(transformed_sfpnt); 2248 2249 // Provide an edge from root to safepoint. This makes the safepoint 2250 // appear useful until the parse has completed. 2251 if( OptoRemoveUseless && transformed_sfpnt->is_SafePoint() ) { 2252 assert(C->root() != NULL, "Expect parse is still valid"); 2253 C->root()->add_prec(transformed_sfpnt); 2254 } 2255 } 2256 2257 #ifndef PRODUCT 2258 //------------------------show_parse_info-------------------------------------- 2259 void Parse::show_parse_info() { 2260 InlineTree* ilt = NULL; 2261 if (C->ilt() != NULL) { 2262 JVMState* caller_jvms = is_osr_parse() ? caller()->caller() : caller(); 2263 ilt = InlineTree::find_subtree_from_root(C->ilt(), caller_jvms, method()); 2264 } 2265 if (PrintCompilation && Verbose) { 2266 if (depth() == 1) { 2267 if( ilt->count_inlines() ) { 2268 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), 2269 ilt->count_inline_bcs()); 2270 tty->cr(); 2271 } 2272 } else { 2273 if (method()->is_synchronized()) tty->print("s"); 2274 if (method()->has_exception_handlers()) tty->print("!"); 2275 // Check this is not the final compiled version 2276 if (C->trap_can_recompile()) { 2277 tty->print("-"); 2278 } else { 2279 tty->print(" "); 2280 } 2281 method()->print_short_name(); 2282 if (is_osr_parse()) { 2283 tty->print(" @ %d", osr_bci()); 2284 } 2285 tty->print(" (%d bytes)",method()->code_size()); 2286 if (ilt->count_inlines()) { 2287 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), 2288 ilt->count_inline_bcs()); 2289 } 2290 tty->cr(); 2291 } 2292 } 2293 if (PrintOpto && (depth() == 1 || PrintOptoInlining)) { 2294 // Print that we succeeded; suppress this message on the first osr parse. 2295 2296 if (method()->is_synchronized()) tty->print("s"); 2297 if (method()->has_exception_handlers()) tty->print("!"); 2298 // Check this is not the final compiled version 2299 if (C->trap_can_recompile() && depth() == 1) { 2300 tty->print("-"); 2301 } else { 2302 tty->print(" "); 2303 } 2304 if( depth() != 1 ) { tty->print(" "); } // missing compile count 2305 for (int i = 1; i < depth(); ++i) { tty->print(" "); } 2306 method()->print_short_name(); 2307 if (is_osr_parse()) { 2308 tty->print(" @ %d", osr_bci()); 2309 } 2310 if (ilt->caller_bci() != -1) { 2311 tty->print(" @ %d", ilt->caller_bci()); 2312 } 2313 tty->print(" (%d bytes)",method()->code_size()); 2314 if (ilt->count_inlines()) { 2315 tty->print(" __inlined %d (%d bytes)", ilt->count_inlines(), 2316 ilt->count_inline_bcs()); 2317 } 2318 tty->cr(); 2319 } 2320 } 2321 2322 2323 //------------------------------dump------------------------------------------- 2324 // Dump information associated with the bytecodes of current _method 2325 void Parse::dump() { 2326 if( method() != NULL ) { 2327 // Iterate over bytecodes 2328 ciBytecodeStream iter(method()); 2329 for( Bytecodes::Code bc = iter.next(); bc != ciBytecodeStream::EOBC() ; bc = iter.next() ) { 2330 dump_bci( iter.cur_bci() ); 2331 tty->cr(); 2332 } 2333 } 2334 } 2335 2336 // Dump information associated with a byte code index, 'bci' 2337 void Parse::dump_bci(int bci) { 2338 // Output info on merge-points, cloning, and within _jsr..._ret 2339 // NYI 2340 tty->print(" bci:%d", bci); 2341 } 2342 2343 #endif