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