1 /*
   2  * Copyright (c) 1997, 2015, 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 "ci/bcEscapeAnalyzer.hpp"
  28 #include "compiler/oopMap.hpp"
  29 #include "opto/callGenerator.hpp"
  30 #include "opto/callnode.hpp"
  31 #include "opto/castnode.hpp"
  32 #include "opto/convertnode.hpp"
  33 #include "opto/escape.hpp"
  34 #include "opto/locknode.hpp"
  35 #include "opto/machnode.hpp"
  36 #include "opto/matcher.hpp"
  37 #include "opto/parse.hpp"
  38 #include "opto/regalloc.hpp"
  39 #include "opto/regmask.hpp"
  40 #include "opto/rootnode.hpp"
  41 #include "opto/runtime.hpp"
  42 #include "opto/valuetypenode.hpp"
  43 
  44 // Portions of code courtesy of Clifford Click
  45 
  46 // Optimization - Graph Style
  47 
  48 //=============================================================================
  49 uint StartNode::size_of() const { return sizeof(*this); }
  50 uint StartNode::cmp( const Node &n ) const
  51 { return _domain == ((StartNode&)n)._domain; }
  52 const Type *StartNode::bottom_type() const { return _domain; }
  53 const Type* StartNode::Value(PhaseGVN* phase) const { return _domain; }
  54 #ifndef PRODUCT
  55 void StartNode::dump_spec(outputStream *st) const { st->print(" #"); _domain->dump_on(st);}
  56 void StartNode::dump_compact_spec(outputStream *st) const { /* empty */ }
  57 #endif
  58 
  59 //------------------------------Ideal------------------------------------------
  60 Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){
  61   return remove_dead_region(phase, can_reshape) ? this : NULL;
  62 }
  63 
  64 //------------------------------calling_convention-----------------------------
  65 void StartNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
  66   Matcher::calling_convention( sig_bt, parm_regs, argcnt, false );
  67 }
  68 
  69 //------------------------------Registers--------------------------------------
  70 const RegMask &StartNode::in_RegMask(uint) const {
  71   return RegMask::Empty;
  72 }
  73 
  74 //------------------------------match------------------------------------------
  75 // Construct projections for incoming parameters, and their RegMask info
  76 Node *StartNode::match( const ProjNode *proj, const Matcher *match ) {
  77   switch (proj->_con) {
  78   case TypeFunc::Control:
  79   case TypeFunc::I_O:
  80   case TypeFunc::Memory:
  81     return new MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
  82   case TypeFunc::FramePtr:
  83     return new MachProjNode(this,proj->_con,Matcher::c_frame_ptr_mask, Op_RegP);
  84   case TypeFunc::ReturnAdr:
  85     return new MachProjNode(this,proj->_con,match->_return_addr_mask,Op_RegP);
  86   case TypeFunc::Parms:
  87   default: {
  88       uint parm_num = proj->_con - TypeFunc::Parms;
  89       const Type *t = _domain->field_at(proj->_con);
  90       if (t->base() == Type::Half)  // 2nd half of Longs and Doubles
  91         return new ConNode(Type::TOP);
  92       uint ideal_reg = t->ideal_reg();
  93       RegMask &rm = match->_calling_convention_mask[parm_num];
  94       return new MachProjNode(this,proj->_con,rm,ideal_reg);
  95     }
  96   }
  97   return NULL;
  98 }
  99 
 100 //------------------------------StartOSRNode----------------------------------
 101 // The method start node for an on stack replacement adapter
 102 
 103 //------------------------------osr_domain-----------------------------
 104 const TypeTuple *StartOSRNode::osr_domain() {
 105   const Type **fields = TypeTuple::fields(2);
 106   fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM;  // address of osr buffer
 107 
 108   return TypeTuple::make(TypeFunc::Parms+1, fields);
 109 }
 110 
 111 //=============================================================================
 112 const char * const ParmNode::names[TypeFunc::Parms+1] = {
 113   "Control", "I_O", "Memory", "FramePtr", "ReturnAdr", "Parms"
 114 };
 115 
 116 #ifndef PRODUCT
 117 void ParmNode::dump_spec(outputStream *st) const {
 118   if( _con < TypeFunc::Parms ) {
 119     st->print("%s", names[_con]);
 120   } else {
 121     st->print("Parm%d: ",_con-TypeFunc::Parms);
 122     // Verbose and WizardMode dump bottom_type for all nodes
 123     if( !Verbose && !WizardMode )   bottom_type()->dump_on(st);
 124   }
 125 }
 126 
 127 void ParmNode::dump_compact_spec(outputStream *st) const {
 128   if (_con < TypeFunc::Parms) {
 129     st->print("%s", names[_con]);
 130   } else {
 131     st->print("%d:", _con-TypeFunc::Parms);
 132     // unconditionally dump bottom_type
 133     bottom_type()->dump_on(st);
 134   }
 135 }
 136 
 137 // For a ParmNode, all immediate inputs and outputs are considered relevant
 138 // both in compact and standard representation.
 139 void ParmNode::related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const {
 140   this->collect_nodes(in_rel, 1, false, false);
 141   this->collect_nodes(out_rel, -1, false, false);
 142 }
 143 #endif
 144 
 145 uint ParmNode::ideal_reg() const {
 146   switch( _con ) {
 147   case TypeFunc::Control  : // fall through
 148   case TypeFunc::I_O      : // fall through
 149   case TypeFunc::Memory   : return 0;
 150   case TypeFunc::FramePtr : // fall through
 151   case TypeFunc::ReturnAdr: return Op_RegP;
 152   default                 : assert( _con > TypeFunc::Parms, "" );
 153     // fall through
 154   case TypeFunc::Parms    : {
 155     // Type of argument being passed
 156     const Type *t = in(0)->as_Start()->_domain->field_at(_con);
 157     return t->ideal_reg();
 158   }
 159   }
 160   ShouldNotReachHere();
 161   return 0;
 162 }
 163 
 164 //=============================================================================
 165 ReturnNode::ReturnNode(uint edges, Node *cntrl, Node *i_o, Node *memory, Node *frameptr, Node *retadr ) : Node(edges) {
 166   init_req(TypeFunc::Control,cntrl);
 167   init_req(TypeFunc::I_O,i_o);
 168   init_req(TypeFunc::Memory,memory);
 169   init_req(TypeFunc::FramePtr,frameptr);
 170   init_req(TypeFunc::ReturnAdr,retadr);
 171 }
 172 
 173 Node *ReturnNode::Ideal(PhaseGVN *phase, bool can_reshape){
 174   return remove_dead_region(phase, can_reshape) ? this : NULL;
 175 }
 176 
 177 const Type* ReturnNode::Value(PhaseGVN* phase) const {
 178   return ( phase->type(in(TypeFunc::Control)) == Type::TOP)
 179     ? Type::TOP
 180     : Type::BOTTOM;
 181 }
 182 
 183 // Do we Match on this edge index or not?  No edges on return nodes
 184 uint ReturnNode::match_edge(uint idx) const {
 185   return 0;
 186 }
 187 
 188 
 189 #ifndef PRODUCT
 190 void ReturnNode::dump_req(outputStream *st) const {
 191   // Dump the required inputs, enclosed in '(' and ')'
 192   uint i;                       // Exit value of loop
 193   for (i = 0; i < req(); i++) {    // For all required inputs
 194     if (i == TypeFunc::Parms) st->print("returns");
 195     if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
 196     else st->print("_ ");
 197   }
 198 }
 199 #endif
 200 
 201 //=============================================================================
 202 RethrowNode::RethrowNode(
 203   Node* cntrl,
 204   Node* i_o,
 205   Node* memory,
 206   Node* frameptr,
 207   Node* ret_adr,
 208   Node* exception
 209 ) : Node(TypeFunc::Parms + 1) {
 210   init_req(TypeFunc::Control  , cntrl    );
 211   init_req(TypeFunc::I_O      , i_o      );
 212   init_req(TypeFunc::Memory   , memory   );
 213   init_req(TypeFunc::FramePtr , frameptr );
 214   init_req(TypeFunc::ReturnAdr, ret_adr);
 215   init_req(TypeFunc::Parms    , exception);
 216 }
 217 
 218 Node *RethrowNode::Ideal(PhaseGVN *phase, bool can_reshape){
 219   return remove_dead_region(phase, can_reshape) ? this : NULL;
 220 }
 221 
 222 const Type* RethrowNode::Value(PhaseGVN* phase) const {
 223   return (phase->type(in(TypeFunc::Control)) == Type::TOP)
 224     ? Type::TOP
 225     : Type::BOTTOM;
 226 }
 227 
 228 uint RethrowNode::match_edge(uint idx) const {
 229   return 0;
 230 }
 231 
 232 #ifndef PRODUCT
 233 void RethrowNode::dump_req(outputStream *st) const {
 234   // Dump the required inputs, enclosed in '(' and ')'
 235   uint i;                       // Exit value of loop
 236   for (i = 0; i < req(); i++) {    // For all required inputs
 237     if (i == TypeFunc::Parms) st->print("exception");
 238     if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
 239     else st->print("_ ");
 240   }
 241 }
 242 #endif
 243 
 244 //=============================================================================
 245 // Do we Match on this edge index or not?  Match only target address & method
 246 uint TailCallNode::match_edge(uint idx) const {
 247   return TypeFunc::Parms <= idx  &&  idx <= TypeFunc::Parms+1;
 248 }
 249 
 250 //=============================================================================
 251 // Do we Match on this edge index or not?  Match only target address & oop
 252 uint TailJumpNode::match_edge(uint idx) const {
 253   return TypeFunc::Parms <= idx  &&  idx <= TypeFunc::Parms+1;
 254 }
 255 
 256 //=============================================================================
 257 JVMState::JVMState(ciMethod* method, JVMState* caller) :
 258   _method(method) {
 259   assert(method != NULL, "must be valid call site");
 260   _bci = InvocationEntryBci;
 261   _reexecute = Reexecute_Undefined;
 262   debug_only(_bci = -99);  // random garbage value
 263   debug_only(_map = (SafePointNode*)-1);
 264   _caller = caller;
 265   _depth  = 1 + (caller == NULL ? 0 : caller->depth());
 266   _locoff = TypeFunc::Parms;
 267   _stkoff = _locoff + _method->max_locals();
 268   _monoff = _stkoff + _method->max_stack();
 269   _scloff = _monoff;
 270   _endoff = _monoff;
 271   _sp = 0;
 272 }
 273 JVMState::JVMState(int stack_size) :
 274   _method(NULL) {
 275   _bci = InvocationEntryBci;
 276   _reexecute = Reexecute_Undefined;
 277   debug_only(_map = (SafePointNode*)-1);
 278   _caller = NULL;
 279   _depth  = 1;
 280   _locoff = TypeFunc::Parms;
 281   _stkoff = _locoff;
 282   _monoff = _stkoff + stack_size;
 283   _scloff = _monoff;
 284   _endoff = _monoff;
 285   _sp = 0;
 286 }
 287 
 288 //--------------------------------of_depth-------------------------------------
 289 JVMState* JVMState::of_depth(int d) const {
 290   const JVMState* jvmp = this;
 291   assert(0 < d && (uint)d <= depth(), "oob");
 292   for (int skip = depth() - d; skip > 0; skip--) {
 293     jvmp = jvmp->caller();
 294   }
 295   assert(jvmp->depth() == (uint)d, "found the right one");
 296   return (JVMState*)jvmp;
 297 }
 298 
 299 //-----------------------------same_calls_as-----------------------------------
 300 bool JVMState::same_calls_as(const JVMState* that) const {
 301   if (this == that)                    return true;
 302   if (this->depth() != that->depth())  return false;
 303   const JVMState* p = this;
 304   const JVMState* q = that;
 305   for (;;) {
 306     if (p->_method != q->_method)    return false;
 307     if (p->_method == NULL)          return true;   // bci is irrelevant
 308     if (p->_bci    != q->_bci)       return false;
 309     if (p->_reexecute != q->_reexecute)  return false;
 310     p = p->caller();
 311     q = q->caller();
 312     if (p == q)                      return true;
 313     assert(p != NULL && q != NULL, "depth check ensures we don't run off end");
 314   }
 315 }
 316 
 317 //------------------------------debug_start------------------------------------
 318 uint JVMState::debug_start()  const {
 319   debug_only(JVMState* jvmroot = of_depth(1));
 320   assert(jvmroot->locoff() <= this->locoff(), "youngest JVMState must be last");
 321   return of_depth(1)->locoff();
 322 }
 323 
 324 //-------------------------------debug_end-------------------------------------
 325 uint JVMState::debug_end() const {
 326   debug_only(JVMState* jvmroot = of_depth(1));
 327   assert(jvmroot->endoff() <= this->endoff(), "youngest JVMState must be last");
 328   return endoff();
 329 }
 330 
 331 //------------------------------debug_depth------------------------------------
 332 uint JVMState::debug_depth() const {
 333   uint total = 0;
 334   for (const JVMState* jvmp = this; jvmp != NULL; jvmp = jvmp->caller()) {
 335     total += jvmp->debug_size();
 336   }
 337   return total;
 338 }
 339 
 340 #ifndef PRODUCT
 341 
 342 //------------------------------format_helper----------------------------------
 343 // Given an allocation (a Chaitin object) and a Node decide if the Node carries
 344 // any defined value or not.  If it does, print out the register or constant.
 345 static void format_helper( PhaseRegAlloc *regalloc, outputStream* st, Node *n, const char *msg, uint i, GrowableArray<SafePointScalarObjectNode*> *scobjs ) {
 346   if (n == NULL) { st->print(" NULL"); return; }
 347   if (n->is_SafePointScalarObject()) {
 348     // Scalar replacement.
 349     SafePointScalarObjectNode* spobj = n->as_SafePointScalarObject();
 350     scobjs->append_if_missing(spobj);
 351     int sco_n = scobjs->find(spobj);
 352     assert(sco_n >= 0, "");
 353     st->print(" %s%d]=#ScObj" INT32_FORMAT, msg, i, sco_n);
 354     return;
 355   }
 356   if (regalloc->node_regs_max_index() > 0 &&
 357       OptoReg::is_valid(regalloc->get_reg_first(n))) { // Check for undefined
 358     char buf[50];
 359     regalloc->dump_register(n,buf);
 360     st->print(" %s%d]=%s",msg,i,buf);
 361   } else {                      // No register, but might be constant
 362     const Type *t = n->bottom_type();
 363     switch (t->base()) {
 364     case Type::Int:
 365       st->print(" %s%d]=#" INT32_FORMAT,msg,i,t->is_int()->get_con());
 366       break;
 367     case Type::AnyPtr:
 368       assert( t == TypePtr::NULL_PTR || n->in_dump(), "" );
 369       st->print(" %s%d]=#NULL",msg,i);
 370       break;
 371     case Type::AryPtr:
 372     case Type::InstPtr:
 373       st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,p2i(t->isa_oopptr()->const_oop()));
 374       break;
 375     case Type::KlassPtr:
 376       st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,p2i(t->make_ptr()->isa_klassptr()->klass()));
 377       break;
 378     case Type::MetadataPtr:
 379       st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,p2i(t->make_ptr()->isa_metadataptr()->metadata()));
 380       break;
 381     case Type::NarrowOop:
 382       st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,p2i(t->make_ptr()->isa_oopptr()->const_oop()));
 383       break;
 384     case Type::RawPtr:
 385       st->print(" %s%d]=#Raw" INTPTR_FORMAT,msg,i,p2i(t->is_rawptr()));
 386       break;
 387     case Type::DoubleCon:
 388       st->print(" %s%d]=#%fD",msg,i,t->is_double_constant()->_d);
 389       break;
 390     case Type::FloatCon:
 391       st->print(" %s%d]=#%fF",msg,i,t->is_float_constant()->_f);
 392       break;
 393     case Type::Long:
 394       st->print(" %s%d]=#" INT64_FORMAT,msg,i,(int64_t)(t->is_long()->get_con()));
 395       break;
 396     case Type::Half:
 397     case Type::Top:
 398       st->print(" %s%d]=_",msg,i);
 399       break;
 400     default: ShouldNotReachHere();
 401     }
 402   }
 403 }
 404 
 405 //------------------------------format-----------------------------------------
 406 void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st) const {
 407   st->print("        #");
 408   if (_method) {
 409     _method->print_short_name(st);
 410     st->print(" @ bci:%d ",_bci);
 411   } else {
 412     st->print_cr(" runtime stub ");
 413     return;
 414   }
 415   if (n->is_MachSafePoint()) {
 416     GrowableArray<SafePointScalarObjectNode*> scobjs;
 417     MachSafePointNode *mcall = n->as_MachSafePoint();
 418     uint i;
 419     // Print locals
 420     for (i = 0; i < (uint)loc_size(); i++)
 421       format_helper(regalloc, st, mcall->local(this, i), "L[", i, &scobjs);
 422     // Print stack
 423     for (i = 0; i < (uint)stk_size(); i++) {
 424       if ((uint)(_stkoff + i) >= mcall->len())
 425         st->print(" oob ");
 426       else
 427        format_helper(regalloc, st, mcall->stack(this, i), "STK[", i, &scobjs);
 428     }
 429     for (i = 0; (int)i < nof_monitors(); i++) {
 430       Node *box = mcall->monitor_box(this, i);
 431       Node *obj = mcall->monitor_obj(this, i);
 432       if (regalloc->node_regs_max_index() > 0 &&
 433           OptoReg::is_valid(regalloc->get_reg_first(box))) {
 434         box = BoxLockNode::box_node(box);
 435         format_helper(regalloc, st, box, "MON-BOX[", i, &scobjs);
 436       } else {
 437         OptoReg::Name box_reg = BoxLockNode::reg(box);
 438         st->print(" MON-BOX%d=%s+%d",
 439                    i,
 440                    OptoReg::regname(OptoReg::c_frame_pointer),
 441                    regalloc->reg2offset(box_reg));
 442       }
 443       const char* obj_msg = "MON-OBJ[";
 444       if (EliminateLocks) {
 445         if (BoxLockNode::box_node(box)->is_eliminated())
 446           obj_msg = "MON-OBJ(LOCK ELIMINATED)[";
 447       }
 448       format_helper(regalloc, st, obj, obj_msg, i, &scobjs);
 449     }
 450 
 451     for (i = 0; i < (uint)scobjs.length(); i++) {
 452       // Scalar replaced objects.
 453       st->cr();
 454       st->print("        # ScObj" INT32_FORMAT " ", i);
 455       SafePointScalarObjectNode* spobj = scobjs.at(i);
 456       ciKlass* cik = spobj->bottom_type()->is_oopptr()->klass();
 457       assert(cik->is_instance_klass() ||
 458              cik->is_array_klass(), "Not supported allocation.");
 459       ciInstanceKlass *iklass = NULL;
 460       if (cik->is_instance_klass()) {
 461         cik->print_name_on(st);
 462         iklass = cik->as_instance_klass();
 463       } else if (cik->is_type_array_klass()) {
 464         cik->as_array_klass()->base_element_type()->print_name_on(st);
 465         st->print("[%d]", spobj->n_fields());
 466       } else if (cik->is_obj_array_klass()) {
 467         ciKlass* cie = cik->as_obj_array_klass()->base_element_klass();
 468         if (cie->is_instance_klass()) {
 469           cie->print_name_on(st);
 470         } else if (cie->is_type_array_klass()) {
 471           cie->as_array_klass()->base_element_type()->print_name_on(st);
 472         } else {
 473           ShouldNotReachHere();
 474         }
 475         st->print("[%d]", spobj->n_fields());
 476         int ndim = cik->as_array_klass()->dimension() - 1;
 477         while (ndim-- > 0) {
 478           st->print("[]");
 479         }
 480       }
 481       st->print("={");
 482       uint nf = spobj->n_fields();
 483       if (nf > 0) {
 484         uint first_ind = spobj->first_index(mcall->jvms());
 485         Node* fld_node = mcall->in(first_ind);
 486         ciField* cifield;
 487         if (iklass != NULL) {
 488           st->print(" [");
 489           cifield = iklass->nonstatic_field_at(0);
 490           cifield->print_name_on(st);
 491           format_helper(regalloc, st, fld_node, ":", 0, &scobjs);
 492         } else {
 493           format_helper(regalloc, st, fld_node, "[", 0, &scobjs);
 494         }
 495         for (uint j = 1; j < nf; j++) {
 496           fld_node = mcall->in(first_ind+j);
 497           if (iklass != NULL) {
 498             st->print(", [");
 499             cifield = iklass->nonstatic_field_at(j);
 500             cifield->print_name_on(st);
 501             format_helper(regalloc, st, fld_node, ":", j, &scobjs);
 502           } else {
 503             format_helper(regalloc, st, fld_node, ", [", j, &scobjs);
 504           }
 505         }
 506       }
 507       st->print(" }");
 508     }
 509   }
 510   st->cr();
 511   if (caller() != NULL) caller()->format(regalloc, n, st);
 512 }
 513 
 514 
 515 void JVMState::dump_spec(outputStream *st) const {
 516   if (_method != NULL) {
 517     bool printed = false;
 518     if (!Verbose) {
 519       // The JVMS dumps make really, really long lines.
 520       // Take out the most boring parts, which are the package prefixes.
 521       char buf[500];
 522       stringStream namest(buf, sizeof(buf));
 523       _method->print_short_name(&namest);
 524       if (namest.count() < sizeof(buf)) {
 525         const char* name = namest.base();
 526         if (name[0] == ' ')  ++name;
 527         const char* endcn = strchr(name, ':');  // end of class name
 528         if (endcn == NULL)  endcn = strchr(name, '(');
 529         if (endcn == NULL)  endcn = name + strlen(name);
 530         while (endcn > name && endcn[-1] != '.' && endcn[-1] != '/')
 531           --endcn;
 532         st->print(" %s", endcn);
 533         printed = true;
 534       }
 535     }
 536     if (!printed)
 537       _method->print_short_name(st);
 538     st->print(" @ bci:%d",_bci);
 539     if(_reexecute == Reexecute_True)
 540       st->print(" reexecute");
 541   } else {
 542     st->print(" runtime stub");
 543   }
 544   if (caller() != NULL)  caller()->dump_spec(st);
 545 }
 546 
 547 
 548 void JVMState::dump_on(outputStream* st) const {
 549   bool print_map = _map && !((uintptr_t)_map & 1) &&
 550                   ((caller() == NULL) || (caller()->map() != _map));
 551   if (print_map) {
 552     if (_map->len() > _map->req()) {  // _map->has_exceptions()
 553       Node* ex = _map->in(_map->req());  // _map->next_exception()
 554       // skip the first one; it's already being printed
 555       while (ex != NULL && ex->len() > ex->req()) {
 556         ex = ex->in(ex->req());  // ex->next_exception()
 557         ex->dump(1);
 558       }
 559     }
 560     _map->dump(Verbose ? 2 : 1);
 561   }
 562   if (caller() != NULL) {
 563     caller()->dump_on(st);
 564   }
 565   st->print("JVMS depth=%d loc=%d stk=%d arg=%d mon=%d scalar=%d end=%d mondepth=%d sp=%d bci=%d reexecute=%s method=",
 566              depth(), locoff(), stkoff(), argoff(), monoff(), scloff(), endoff(), monitor_depth(), sp(), bci(), should_reexecute()?"true":"false");
 567   if (_method == NULL) {
 568     st->print_cr("(none)");
 569   } else {
 570     _method->print_name(st);
 571     st->cr();
 572     if (bci() >= 0 && bci() < _method->code_size()) {
 573       st->print("    bc: ");
 574       _method->print_codes_on(bci(), bci()+1, st);
 575     }
 576   }
 577 }
 578 
 579 // Extra way to dump a jvms from the debugger,
 580 // to avoid a bug with C++ member function calls.
 581 void dump_jvms(JVMState* jvms) {
 582   jvms->dump();
 583 }
 584 #endif
 585 
 586 //--------------------------clone_shallow--------------------------------------
 587 JVMState* JVMState::clone_shallow(Compile* C) const {
 588   JVMState* n = has_method() ? new (C) JVMState(_method, _caller) : new (C) JVMState(0);
 589   n->set_bci(_bci);
 590   n->_reexecute = _reexecute;
 591   n->set_locoff(_locoff);
 592   n->set_stkoff(_stkoff);
 593   n->set_monoff(_monoff);
 594   n->set_scloff(_scloff);
 595   n->set_endoff(_endoff);
 596   n->set_sp(_sp);
 597   n->set_map(_map);
 598   return n;
 599 }
 600 
 601 //---------------------------clone_deep----------------------------------------
 602 JVMState* JVMState::clone_deep(Compile* C) const {
 603   JVMState* n = clone_shallow(C);
 604   for (JVMState* p = n; p->_caller != NULL; p = p->_caller) {
 605     p->_caller = p->_caller->clone_shallow(C);
 606   }
 607   assert(n->depth() == depth(), "sanity");
 608   assert(n->debug_depth() == debug_depth(), "sanity");
 609   return n;
 610 }
 611 
 612 /**
 613  * Reset map for all callers
 614  */
 615 void JVMState::set_map_deep(SafePointNode* map) {
 616   for (JVMState* p = this; p->_caller != NULL; p = p->_caller) {
 617     p->set_map(map);
 618   }
 619 }
 620 
 621 // Adapt offsets in in-array after adding or removing an edge.
 622 // Prerequisite is that the JVMState is used by only one node.
 623 void JVMState::adapt_position(int delta) {
 624   for (JVMState* jvms = this; jvms != NULL; jvms = jvms->caller()) {
 625     jvms->set_locoff(jvms->locoff() + delta);
 626     jvms->set_stkoff(jvms->stkoff() + delta);
 627     jvms->set_monoff(jvms->monoff() + delta);
 628     jvms->set_scloff(jvms->scloff() + delta);
 629     jvms->set_endoff(jvms->endoff() + delta);
 630   }
 631 }
 632 
 633 // Mirror the stack size calculation in the deopt code
 634 // How much stack space would we need at this point in the program in
 635 // case of deoptimization?
 636 int JVMState::interpreter_frame_size() const {
 637   const JVMState* jvms = this;
 638   int size = 0;
 639   int callee_parameters = 0;
 640   int callee_locals = 0;
 641   int extra_args = method()->max_stack() - stk_size();
 642 
 643   while (jvms != NULL) {
 644     int locks = jvms->nof_monitors();
 645     int temps = jvms->stk_size();
 646     bool is_top_frame = (jvms == this);
 647     ciMethod* method = jvms->method();
 648 
 649     int frame_size = BytesPerWord * Interpreter::size_activation(method->max_stack(),
 650                                                                  temps + callee_parameters,
 651                                                                  extra_args,
 652                                                                  locks,
 653                                                                  callee_parameters,
 654                                                                  callee_locals,
 655                                                                  is_top_frame);
 656     size += frame_size;
 657 
 658     callee_parameters = method->size_of_parameters();
 659     callee_locals = method->max_locals();
 660     extra_args = 0;
 661     jvms = jvms->caller();
 662   }
 663   return size + Deoptimization::last_frame_adjust(0, callee_locals) * BytesPerWord;
 664 }
 665 
 666 //=============================================================================
 667 uint CallNode::cmp( const Node &n ) const
 668 { return _tf == ((CallNode&)n)._tf && _jvms == ((CallNode&)n)._jvms; }
 669 #ifndef PRODUCT
 670 void CallNode::dump_req(outputStream *st) const {
 671   // Dump the required inputs, enclosed in '(' and ')'
 672   uint i;                       // Exit value of loop
 673   for (i = 0; i < req(); i++) {    // For all required inputs
 674     if (i == TypeFunc::Parms) st->print("(");
 675     if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
 676     else st->print("_ ");
 677   }
 678   st->print(")");
 679 }
 680 
 681 void CallNode::dump_spec(outputStream *st) const {
 682   st->print(" ");
 683   if (tf() != NULL)  tf()->dump_on(st);
 684   if (_cnt != COUNT_UNKNOWN)  st->print(" C=%f",_cnt);
 685   if (jvms() != NULL)  jvms()->dump_spec(st);
 686 }
 687 #endif
 688 
 689 const Type *CallNode::bottom_type() const { return tf()->range(); }
 690 const Type* CallNode::Value(PhaseGVN* phase) const {
 691   if (phase->type(in(0)) == Type::TOP)  return Type::TOP;
 692   return tf()->range();
 693 }
 694 
 695 //------------------------------calling_convention-----------------------------
 696 void CallNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
 697   // Use the standard compiler calling convention
 698   Matcher::calling_convention( sig_bt, parm_regs, argcnt, true );
 699 }
 700 
 701 
 702 //------------------------------match------------------------------------------
 703 // Construct projections for control, I/O, memory-fields, ..., and
 704 // return result(s) along with their RegMask info
 705 Node *CallNode::match( const ProjNode *proj, const Matcher *match ) {
 706   switch (proj->_con) {
 707   case TypeFunc::Control:
 708   case TypeFunc::I_O:
 709   case TypeFunc::Memory:
 710     return new MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
 711 
 712   case TypeFunc::Parms+1:       // For LONG & DOUBLE returns
 713     assert(tf()->range()->field_at(TypeFunc::Parms+1) == Type::HALF, "");
 714     // 2nd half of doubles and longs
 715     return new MachProjNode(this,proj->_con, RegMask::Empty, (uint)OptoReg::Bad);
 716 
 717   case TypeFunc::Parms: {       // Normal returns
 718     uint ideal_reg = tf()->range()->field_at(TypeFunc::Parms)->ideal_reg();
 719     OptoRegPair regs = is_CallRuntime()
 720       ? match->c_return_value(ideal_reg,true)  // Calls into C runtime
 721       : match->  return_value(ideal_reg,true); // Calls into compiled Java code
 722     RegMask rm = RegMask(regs.first());
 723     if( OptoReg::is_valid(regs.second()) )
 724       rm.Insert( regs.second() );
 725     return new MachProjNode(this,proj->_con,rm,ideal_reg);
 726   }
 727 
 728   case TypeFunc::ReturnAdr:
 729   case TypeFunc::FramePtr:
 730   default:
 731     ShouldNotReachHere();
 732   }
 733   return NULL;
 734 }
 735 
 736 // Do we Match on this edge index or not?  Match no edges
 737 uint CallNode::match_edge(uint idx) const {
 738   return 0;
 739 }
 740 
 741 //
 742 // Determine whether the call could modify the field of the specified
 743 // instance at the specified offset.
 744 //
 745 bool CallNode::may_modify(const TypeOopPtr *t_oop, PhaseTransform *phase) {
 746   assert((t_oop != NULL), "sanity");
 747   if (is_call_to_arraycopystub() && strcmp(_name, "unsafe_arraycopy") != 0) {
 748     const TypeTuple* args = _tf->domain_sig();
 749     Node* dest = NULL;
 750     // Stubs that can be called once an ArrayCopyNode is expanded have
 751     // different signatures. Look for the second pointer argument,
 752     // that is the destination of the copy.
 753     for (uint i = TypeFunc::Parms, j = 0; i < args->cnt(); i++) {
 754       if (args->field_at(i)->isa_ptr()) {
 755         j++;
 756         if (j == 2) {
 757           dest = in(i);
 758           break;
 759         }
 760       }
 761     }
 762     if (!dest->is_top() && may_modify_arraycopy_helper(phase->type(dest)->is_oopptr(), t_oop, phase)) {
 763       return true;
 764     }
 765     return false;
 766   }
 767   if (t_oop->is_known_instance()) {
 768     // The instance_id is set only for scalar-replaceable allocations which
 769     // are not passed as arguments according to Escape Analysis.
 770     return false;
 771   }
 772   if (t_oop->is_ptr_to_boxed_value()) {
 773     ciKlass* boxing_klass = t_oop->klass();
 774     if (is_CallStaticJava() && as_CallStaticJava()->is_boxing_method()) {
 775       // Skip unrelated boxing methods.
 776       Node* proj = proj_out(TypeFunc::Parms);
 777       if ((proj == NULL) || (phase->type(proj)->is_instptr()->klass() != boxing_klass)) {
 778         return false;
 779       }
 780     }
 781     if (is_CallJava() && as_CallJava()->method() != NULL) {
 782       ciMethod* meth = as_CallJava()->method();
 783       if (meth->is_getter()) {
 784         return false;
 785       }
 786       // May modify (by reflection) if an boxing object is passed
 787       // as argument or returned.
 788       if (returns_pointer() && (proj_out(TypeFunc::Parms) != NULL)) {
 789         Node* proj = proj_out(TypeFunc::Parms);
 790         const TypeInstPtr* inst_t = phase->type(proj)->isa_instptr();
 791         if ((inst_t != NULL) && (!inst_t->klass_is_exact() ||
 792                                  (inst_t->klass() == boxing_klass))) {
 793           return true;
 794         }
 795       }
 796       const TypeTuple* d = tf()->domain_cc();
 797       for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
 798         const TypeInstPtr* inst_t = d->field_at(i)->isa_instptr();
 799         if ((inst_t != NULL) && (!inst_t->klass_is_exact() ||
 800                                  (inst_t->klass() == boxing_klass))) {
 801           return true;
 802         }
 803       }
 804       return false;
 805     }
 806   }
 807   return true;
 808 }
 809 
 810 // Does this call have a direct reference to n other than debug information?
 811 bool CallNode::has_non_debug_use(Node *n) {
 812   const TypeTuple * d = tf()->domain_cc();
 813   for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
 814     Node *arg = in(i);
 815     if (arg == n) {
 816       return true;
 817     }
 818   }
 819   return false;
 820 }
 821 
 822 bool CallNode::has_debug_use(Node *n) {
 823   for (uint i = jvms()->debug_start(); i < jvms()->debug_end(); i++) {
 824     Node *arg = in(i);
 825     if (arg == n) {
 826       return true;
 827     }
 828   }
 829   return false;
 830 }
 831 
 832 // Returns the unique CheckCastPP of a call
 833 // or 'this' if there are several CheckCastPP or unexpected uses
 834 // or returns NULL if there is no one.
 835 Node *CallNode::result_cast() {
 836   Node *cast = NULL;
 837 
 838   Node *p = proj_out(TypeFunc::Parms);
 839   if (p == NULL)
 840     return NULL;
 841 
 842   for (DUIterator_Fast imax, i = p->fast_outs(imax); i < imax; i++) {
 843     Node *use = p->fast_out(i);
 844     if (use->is_CheckCastPP()) {
 845       if (cast != NULL) {
 846         return this;  // more than 1 CheckCastPP
 847       }
 848       cast = use;
 849     } else if (!use->is_Initialize() &&
 850                !use->is_AddP() &&
 851                use->Opcode() != Op_MemBarStoreStore) {
 852       // Expected uses are restricted to a CheckCastPP, an Initialize
 853       // node, a MemBarStoreStore (clone) and AddP nodes. If we
 854       // encounter any other use (a Phi node can be seen in rare
 855       // cases) return this to prevent incorrect optimizations.
 856       return this;
 857     }
 858   }
 859   return cast;
 860 }
 861 
 862 
 863 void CallNode::extract_projections(CallProjections* projs, bool separate_io_proj, bool do_asserts) {
 864   projs->fallthrough_proj      = NULL;
 865   projs->fallthrough_catchproj = NULL;
 866   projs->fallthrough_ioproj    = NULL;
 867   projs->catchall_ioproj       = NULL;
 868   projs->catchall_catchproj    = NULL;
 869   projs->fallthrough_memproj   = NULL;
 870   projs->catchall_memproj      = NULL;
 871   projs->resproj               = NULL;
 872   projs->exobj                 = NULL;
 873 
 874   for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) {
 875     ProjNode *pn = fast_out(i)->as_Proj();
 876     if (pn->outcnt() == 0) continue;
 877     switch (pn->_con) {
 878     case TypeFunc::Control:
 879       {
 880         // For Control (fallthrough) and I_O (catch_all_index) we have CatchProj -> Catch -> Proj
 881         projs->fallthrough_proj = pn;
 882         DUIterator_Fast jmax, j = pn->fast_outs(jmax);
 883         const Node *cn = pn->fast_out(j);
 884         if (cn->is_Catch()) {
 885           ProjNode *cpn = NULL;
 886           for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) {
 887             cpn = cn->fast_out(k)->as_Proj();
 888             assert(cpn->is_CatchProj(), "must be a CatchProjNode");
 889             if (cpn->_con == CatchProjNode::fall_through_index)
 890               projs->fallthrough_catchproj = cpn;
 891             else {
 892               assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index.");
 893               projs->catchall_catchproj = cpn;
 894             }
 895           }
 896         }
 897         break;
 898       }
 899     case TypeFunc::I_O:
 900       if (pn->_is_io_use)
 901         projs->catchall_ioproj = pn;
 902       else
 903         projs->fallthrough_ioproj = pn;
 904       for (DUIterator j = pn->outs(); pn->has_out(j); j++) {
 905         Node* e = pn->out(j);
 906         if (e->Opcode() == Op_CreateEx && e->in(0)->is_CatchProj() && e->outcnt() > 0) {
 907           assert(projs->exobj == NULL, "only one");
 908           projs->exobj = e;
 909         }
 910       }
 911       break;
 912     case TypeFunc::Memory:
 913       if (pn->_is_io_use)
 914         projs->catchall_memproj = pn;
 915       else
 916         projs->fallthrough_memproj = pn;
 917       break;
 918     case TypeFunc::Parms:
 919       projs->resproj = pn;
 920       break;
 921     default:
 922       assert(false, "unexpected projection from allocation node.");
 923     }
 924   }
 925 
 926   // The resproj may not exist because the result could be ignored
 927   // and the exception object may not exist if an exception handler
 928   // swallows the exception but all the other must exist and be found.
 929   assert(projs->fallthrough_proj      != NULL, "must be found");
 930   do_asserts = do_asserts && !Compile::current()->inlining_incrementally();
 931   assert(!do_asserts || projs->fallthrough_catchproj != NULL, "must be found");
 932   assert(!do_asserts || projs->fallthrough_memproj   != NULL, "must be found");
 933   assert(!do_asserts || projs->fallthrough_ioproj    != NULL, "must be found");
 934   assert(!do_asserts || projs->catchall_catchproj    != NULL, "must be found");
 935   if (separate_io_proj) {
 936     assert(!do_asserts || projs->catchall_memproj    != NULL, "must be found");
 937     assert(!do_asserts || projs->catchall_ioproj     != NULL, "must be found");
 938   }
 939 }
 940 
 941 Node *CallNode::Ideal(PhaseGVN *phase, bool can_reshape) {
 942   CallGenerator* cg = generator();
 943   if (can_reshape && cg != NULL && cg->is_mh_late_inline() && !cg->already_attempted()) {
 944     // Check whether this MH handle call becomes a candidate for inlining
 945     ciMethod* callee = cg->method();
 946     vmIntrinsics::ID iid = callee->intrinsic_id();
 947     if (iid == vmIntrinsics::_invokeBasic) {
 948       if (in(TypeFunc::Parms)->Opcode() == Op_ConP) {
 949         phase->C->prepend_late_inline(cg);
 950         set_generator(NULL);
 951       }
 952     } else {
 953       assert(callee->has_member_arg(), "wrong type of call?");
 954       if (in(TypeFunc::Parms + callee->arg_size() - 1)->Opcode() == Op_ConP) {
 955         phase->C->prepend_late_inline(cg);
 956         set_generator(NULL);
 957       }
 958     }
 959   }
 960   return SafePointNode::Ideal(phase, can_reshape);
 961 }
 962 
 963 bool CallNode::is_call_to_arraycopystub() const {
 964   if (_name != NULL && strstr(_name, "arraycopy") != 0) {
 965     return true;
 966   }
 967   return false;
 968 }
 969 
 970 //=============================================================================
 971 uint CallJavaNode::size_of() const { return sizeof(*this); }
 972 uint CallJavaNode::cmp( const Node &n ) const {
 973   CallJavaNode &call = (CallJavaNode&)n;
 974   return CallNode::cmp(call) && _method == call._method &&
 975          _override_symbolic_info == call._override_symbolic_info;
 976 }
 977 #ifndef PRODUCT
 978 void CallJavaNode::dump_spec(outputStream *st) const {
 979   if( _method ) _method->print_short_name(st);
 980   CallNode::dump_spec(st);
 981 }
 982 
 983 void CallJavaNode::dump_compact_spec(outputStream* st) const {
 984   if (_method) {
 985     _method->print_short_name(st);
 986   } else {
 987     st->print("<?>");
 988   }
 989 }
 990 #endif
 991 
 992 //=============================================================================
 993 uint CallStaticJavaNode::size_of() const { return sizeof(*this); }
 994 uint CallStaticJavaNode::cmp( const Node &n ) const {
 995   CallStaticJavaNode &call = (CallStaticJavaNode&)n;
 996   return CallJavaNode::cmp(call);
 997 }
 998 
 999 //----------------------------uncommon_trap_request----------------------------
1000 // If this is an uncommon trap, return the request code, else zero.
1001 int CallStaticJavaNode::uncommon_trap_request() const {
1002   if (_name != NULL && !strcmp(_name, "uncommon_trap")) {
1003     return extract_uncommon_trap_request(this);
1004   }
1005   return 0;
1006 }
1007 int CallStaticJavaNode::extract_uncommon_trap_request(const Node* call) {
1008 #ifndef PRODUCT
1009   if (!(call->req() > TypeFunc::Parms &&
1010         call->in(TypeFunc::Parms) != NULL &&
1011         call->in(TypeFunc::Parms)->is_Con() &&
1012         call->in(TypeFunc::Parms)->bottom_type()->isa_int())) {
1013     assert(in_dump() != 0, "OK if dumping");
1014     tty->print("[bad uncommon trap]");
1015     return 0;
1016   }
1017 #endif
1018   return call->in(TypeFunc::Parms)->bottom_type()->is_int()->get_con();
1019 }
1020 
1021 #ifndef PRODUCT
1022 void CallStaticJavaNode::dump_spec(outputStream *st) const {
1023   st->print("# Static ");
1024   if (_name != NULL) {
1025     st->print("%s", _name);
1026     int trap_req = uncommon_trap_request();
1027     if (trap_req != 0) {
1028       char buf[100];
1029       st->print("(%s)",
1030                  Deoptimization::format_trap_request(buf, sizeof(buf),
1031                                                      trap_req));
1032     }
1033     st->print(" ");
1034   }
1035   CallJavaNode::dump_spec(st);
1036 }
1037 
1038 void CallStaticJavaNode::dump_compact_spec(outputStream* st) const {
1039   if (_method) {
1040     _method->print_short_name(st);
1041   } else if (_name) {
1042     st->print("%s", _name);
1043   } else {
1044     st->print("<?>");
1045   }
1046 }
1047 #endif
1048 
1049 //=============================================================================
1050 uint CallDynamicJavaNode::size_of() const { return sizeof(*this); }
1051 uint CallDynamicJavaNode::cmp( const Node &n ) const {
1052   CallDynamicJavaNode &call = (CallDynamicJavaNode&)n;
1053   return CallJavaNode::cmp(call);
1054 }
1055 #ifndef PRODUCT
1056 void CallDynamicJavaNode::dump_spec(outputStream *st) const {
1057   st->print("# Dynamic ");
1058   CallJavaNode::dump_spec(st);
1059 }
1060 #endif
1061 
1062 //=============================================================================
1063 uint CallRuntimeNode::size_of() const { return sizeof(*this); }
1064 uint CallRuntimeNode::cmp( const Node &n ) const {
1065   CallRuntimeNode &call = (CallRuntimeNode&)n;
1066   return CallNode::cmp(call) && !strcmp(_name,call._name);
1067 }
1068 #ifndef PRODUCT
1069 void CallRuntimeNode::dump_spec(outputStream *st) const {
1070   st->print("# ");
1071   st->print("%s", _name);
1072   CallNode::dump_spec(st);
1073 }
1074 #endif
1075 
1076 //------------------------------calling_convention-----------------------------
1077 void CallRuntimeNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
1078   Matcher::c_calling_convention( sig_bt, parm_regs, argcnt );
1079 }
1080 
1081 //=============================================================================
1082 //------------------------------calling_convention-----------------------------
1083 
1084 
1085 //=============================================================================
1086 #ifndef PRODUCT
1087 void CallLeafNode::dump_spec(outputStream *st) const {
1088   st->print("# ");
1089   st->print("%s", _name);
1090   CallNode::dump_spec(st);
1091 }
1092 #endif
1093 
1094 //=============================================================================
1095 
1096 void SafePointNode::set_local(JVMState* jvms, uint idx, Node *c) {
1097   assert(verify_jvms(jvms), "jvms must match");
1098   int loc = jvms->locoff() + idx;
1099   if (in(loc)->is_top() && idx > 0 && !c->is_top() ) {
1100     // If current local idx is top then local idx - 1 could
1101     // be a long/double that needs to be killed since top could
1102     // represent the 2nd half ofthe long/double.
1103     uint ideal = in(loc -1)->ideal_reg();
1104     if (ideal == Op_RegD || ideal == Op_RegL) {
1105       // set other (low index) half to top
1106       set_req(loc - 1, in(loc));
1107     }
1108   }
1109   set_req(loc, c);
1110 }
1111 
1112 uint SafePointNode::size_of() const { return sizeof(*this); }
1113 uint SafePointNode::cmp( const Node &n ) const {
1114   return (&n == this);          // Always fail except on self
1115 }
1116 
1117 //-------------------------set_next_exception----------------------------------
1118 void SafePointNode::set_next_exception(SafePointNode* n) {
1119   assert(n == NULL || n->Opcode() == Op_SafePoint, "correct value for next_exception");
1120   if (len() == req()) {
1121     if (n != NULL)  add_prec(n);
1122   } else {
1123     set_prec(req(), n);
1124   }
1125 }
1126 
1127 
1128 //----------------------------next_exception-----------------------------------
1129 SafePointNode* SafePointNode::next_exception() const {
1130   if (len() == req()) {
1131     return NULL;
1132   } else {
1133     Node* n = in(req());
1134     assert(n == NULL || n->Opcode() == Op_SafePoint, "no other uses of prec edges");
1135     return (SafePointNode*) n;
1136   }
1137 }
1138 
1139 
1140 //------------------------------Ideal------------------------------------------
1141 // Skip over any collapsed Regions
1142 Node *SafePointNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1143   if (remove_dead_region(phase, can_reshape)) {
1144     return this;
1145   }
1146   if (jvms() != NULL) {
1147     bool progress = false;
1148     // A ValueTypeNode that was already heap allocated in the debug
1149     // info?  Reference the object directly. Helps removal of useless
1150     // value type allocations with incremental inlining.
1151     for (uint i = jvms()->debug_start(); i < jvms()->debug_end(); i++) {
1152       Node *arg = in(i);
1153       if (arg->is_ValueType()) {
1154         ValueTypeNode* vt = arg->as_ValueType();
1155         Node* in_oop = vt->get_oop();
1156         const Type* oop_type = phase->type(in_oop);
1157         if (!TypePtr::NULL_PTR->higher_equal(oop_type)) {
1158           set_req(i, in_oop);
1159           progress = true;
1160         }
1161       }
1162     }
1163     if (progress) {
1164       return this;
1165     }
1166   }
1167   return NULL;
1168 }
1169 
1170 //------------------------------Identity---------------------------------------
1171 // Remove obviously duplicate safepoints
1172 Node* SafePointNode::Identity(PhaseGVN* phase) {
1173 
1174   // If you have back to back safepoints, remove one
1175   if( in(TypeFunc::Control)->is_SafePoint() )
1176     return in(TypeFunc::Control);
1177 
1178   if( in(0)->is_Proj() ) {
1179     Node *n0 = in(0)->in(0);
1180     // Check if he is a call projection (except Leaf Call)
1181     if( n0->is_Catch() ) {
1182       n0 = n0->in(0)->in(0);
1183       assert( n0->is_Call(), "expect a call here" );
1184     }
1185     if( n0->is_Call() && n0->as_Call()->guaranteed_safepoint() ) {
1186       // Useless Safepoint, so remove it
1187       return in(TypeFunc::Control);
1188     }
1189   }
1190 
1191   return this;
1192 }
1193 
1194 //------------------------------Value------------------------------------------
1195 const Type* SafePointNode::Value(PhaseGVN* phase) const {
1196   if( phase->type(in(0)) == Type::TOP ) return Type::TOP;
1197   if( phase->eqv( in(0), this ) ) return Type::TOP; // Dead infinite loop
1198   return Type::CONTROL;
1199 }
1200 
1201 #ifndef PRODUCT
1202 void SafePointNode::dump_spec(outputStream *st) const {
1203   st->print(" SafePoint ");
1204   _replaced_nodes.dump(st);
1205 }
1206 
1207 // The related nodes of a SafepointNode are all data inputs, excluding the
1208 // control boundary, as well as all outputs till level 2 (to include projection
1209 // nodes and targets). In compact mode, just include inputs till level 1 and
1210 // outputs as before.
1211 void SafePointNode::related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const {
1212   if (compact) {
1213     this->collect_nodes(in_rel, 1, false, false);
1214   } else {
1215     this->collect_nodes_in_all_data(in_rel, false);
1216   }
1217   this->collect_nodes(out_rel, -2, false, false);
1218 }
1219 #endif
1220 
1221 const RegMask &SafePointNode::in_RegMask(uint idx) const {
1222   if( idx < TypeFunc::Parms ) return RegMask::Empty;
1223   // Values outside the domain represent debug info
1224   return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]);
1225 }
1226 const RegMask &SafePointNode::out_RegMask() const {
1227   return RegMask::Empty;
1228 }
1229 
1230 
1231 void SafePointNode::grow_stack(JVMState* jvms, uint grow_by) {
1232   assert((int)grow_by > 0, "sanity");
1233   int monoff = jvms->monoff();
1234   int scloff = jvms->scloff();
1235   int endoff = jvms->endoff();
1236   assert(endoff == (int)req(), "no other states or debug info after me");
1237   Node* top = Compile::current()->top();
1238   for (uint i = 0; i < grow_by; i++) {
1239     ins_req(monoff, top);
1240   }
1241   jvms->set_monoff(monoff + grow_by);
1242   jvms->set_scloff(scloff + grow_by);
1243   jvms->set_endoff(endoff + grow_by);
1244 }
1245 
1246 void SafePointNode::push_monitor(const FastLockNode *lock) {
1247   // Add a LockNode, which points to both the original BoxLockNode (the
1248   // stack space for the monitor) and the Object being locked.
1249   const int MonitorEdges = 2;
1250   assert(JVMState::logMonitorEdges == exact_log2(MonitorEdges), "correct MonitorEdges");
1251   assert(req() == jvms()->endoff(), "correct sizing");
1252   int nextmon = jvms()->scloff();
1253   if (GenerateSynchronizationCode) {
1254     ins_req(nextmon,   lock->box_node());
1255     ins_req(nextmon+1, lock->obj_node());
1256   } else {
1257     Node* top = Compile::current()->top();
1258     ins_req(nextmon, top);
1259     ins_req(nextmon, top);
1260   }
1261   jvms()->set_scloff(nextmon + MonitorEdges);
1262   jvms()->set_endoff(req());
1263 }
1264 
1265 void SafePointNode::pop_monitor() {
1266   // Delete last monitor from debug info
1267   debug_only(int num_before_pop = jvms()->nof_monitors());
1268   const int MonitorEdges = 2;
1269   assert(JVMState::logMonitorEdges == exact_log2(MonitorEdges), "correct MonitorEdges");
1270   int scloff = jvms()->scloff();
1271   int endoff = jvms()->endoff();
1272   int new_scloff = scloff - MonitorEdges;
1273   int new_endoff = endoff - MonitorEdges;
1274   jvms()->set_scloff(new_scloff);
1275   jvms()->set_endoff(new_endoff);
1276   while (scloff > new_scloff)  del_req_ordered(--scloff);
1277   assert(jvms()->nof_monitors() == num_before_pop-1, "");
1278 }
1279 
1280 Node *SafePointNode::peek_monitor_box() const {
1281   int mon = jvms()->nof_monitors() - 1;
1282   assert(mon >= 0, "must have a monitor");
1283   return monitor_box(jvms(), mon);
1284 }
1285 
1286 Node *SafePointNode::peek_monitor_obj() const {
1287   int mon = jvms()->nof_monitors() - 1;
1288   assert(mon >= 0, "must have a monitor");
1289   return monitor_obj(jvms(), mon);
1290 }
1291 
1292 // Do we Match on this edge index or not?  Match no edges
1293 uint SafePointNode::match_edge(uint idx) const {
1294   if( !needs_polling_address_input() )
1295     return 0;
1296 
1297   return (TypeFunc::Parms == idx);
1298 }
1299 
1300 //==============  SafePointScalarObjectNode  ==============
1301 
1302 SafePointScalarObjectNode::SafePointScalarObjectNode(const TypeOopPtr* tp,
1303 #ifdef ASSERT
1304                                                      AllocateNode* alloc,
1305 #endif
1306                                                      uint first_index,
1307                                                      uint n_fields) :
1308   TypeNode(tp, 1), // 1 control input -- seems required.  Get from root.
1309 #ifdef ASSERT
1310   _alloc(alloc),
1311 #endif
1312   _first_index(first_index),
1313   _n_fields(n_fields)
1314 {
1315   init_class_id(Class_SafePointScalarObject);
1316 }
1317 
1318 // Do not allow value-numbering for SafePointScalarObject node.
1319 uint SafePointScalarObjectNode::hash() const { return NO_HASH; }
1320 uint SafePointScalarObjectNode::cmp( const Node &n ) const {
1321   return (&n == this); // Always fail except on self
1322 }
1323 
1324 uint SafePointScalarObjectNode::ideal_reg() const {
1325   return 0; // No matching to machine instruction
1326 }
1327 
1328 const RegMask &SafePointScalarObjectNode::in_RegMask(uint idx) const {
1329   return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]);
1330 }
1331 
1332 const RegMask &SafePointScalarObjectNode::out_RegMask() const {
1333   return RegMask::Empty;
1334 }
1335 
1336 uint SafePointScalarObjectNode::match_edge(uint idx) const {
1337   return 0;
1338 }
1339 
1340 SafePointScalarObjectNode*
1341 SafePointScalarObjectNode::clone(Dict* sosn_map) const {
1342   void* cached = (*sosn_map)[(void*)this];
1343   if (cached != NULL) {
1344     return (SafePointScalarObjectNode*)cached;
1345   }
1346   SafePointScalarObjectNode* res = (SafePointScalarObjectNode*)Node::clone();
1347   sosn_map->Insert((void*)this, (void*)res);
1348   return res;
1349 }
1350 
1351 
1352 #ifndef PRODUCT
1353 void SafePointScalarObjectNode::dump_spec(outputStream *st) const {
1354   st->print(" # fields@[%d..%d]", first_index(),
1355              first_index() + n_fields() - 1);
1356 }
1357 
1358 #endif
1359 
1360 //=============================================================================
1361 uint AllocateNode::size_of() const { return sizeof(*this); }
1362 
1363 AllocateNode::AllocateNode(Compile* C, const TypeFunc *atype,
1364                            Node *ctrl, Node *mem, Node *abio,
1365                            Node *size, Node *klass_node, Node *initial_test)
1366   : CallNode(atype, NULL, TypeRawPtr::BOTTOM)
1367 {
1368   init_class_id(Class_Allocate);
1369   init_flags(Flag_is_macro);
1370   _is_scalar_replaceable = false;
1371   _is_non_escaping = false;
1372   _is_allocation_MemBar_redundant = false;
1373   Node *topnode = C->top();
1374 
1375   init_req( TypeFunc::Control  , ctrl );
1376   init_req( TypeFunc::I_O      , abio );
1377   init_req( TypeFunc::Memory   , mem );
1378   init_req( TypeFunc::ReturnAdr, topnode );
1379   init_req( TypeFunc::FramePtr , topnode );
1380   init_req( AllocSize          , size);
1381   init_req( KlassNode          , klass_node);
1382   init_req( InitialTest        , initial_test);
1383   init_req( ALength            , topnode);
1384   C->add_macro_node(this);
1385 }
1386 
1387 void AllocateNode::compute_MemBar_redundancy(ciMethod* initializer)
1388 {
1389   assert(initializer != NULL &&
1390          initializer->is_initializer() &&
1391          !initializer->is_static(),
1392              "unexpected initializer method");
1393   BCEscapeAnalyzer* analyzer = initializer->get_bcea();
1394   if (analyzer == NULL) {
1395     return;
1396   }
1397 
1398   // Allocation node is first parameter in its initializer
1399   if (analyzer->is_arg_stack(0) || analyzer->is_arg_local(0)) {
1400     _is_allocation_MemBar_redundant = true;
1401   }
1402 }
1403 
1404 //=============================================================================
1405 Node* AllocateArrayNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1406   Node* res = SafePointNode::Ideal(phase, can_reshape);
1407   if (res != NULL) {
1408     return res;
1409   }
1410   // Don't bother trying to transform a dead node
1411   if (in(0) && in(0)->is_top())  return NULL;
1412 
1413   const Type* type = phase->type(Ideal_length());
1414   if (type->isa_int() && type->is_int()->_hi < 0) {
1415     if (can_reshape) {
1416       PhaseIterGVN *igvn = phase->is_IterGVN();
1417       // Unreachable fall through path (negative array length),
1418       // the allocation can only throw so disconnect it.
1419       Node* proj = proj_out(TypeFunc::Control);
1420       Node* catchproj = NULL;
1421       if (proj != NULL) {
1422         for (DUIterator_Fast imax, i = proj->fast_outs(imax); i < imax; i++) {
1423           Node *cn = proj->fast_out(i);
1424           if (cn->is_Catch()) {
1425             catchproj = cn->as_Multi()->proj_out(CatchProjNode::fall_through_index);
1426             break;
1427           }
1428         }
1429       }
1430       if (catchproj != NULL && catchproj->outcnt() > 0 &&
1431           (catchproj->outcnt() > 1 ||
1432            catchproj->unique_out()->Opcode() != Op_Halt)) {
1433         assert(catchproj->is_CatchProj(), "must be a CatchProjNode");
1434         Node* nproj = catchproj->clone();
1435         igvn->register_new_node_with_optimizer(nproj);
1436 
1437         Node *frame = new ParmNode( phase->C->start(), TypeFunc::FramePtr );
1438         frame = phase->transform(frame);
1439         // Halt & Catch Fire
1440         Node *halt = new HaltNode( nproj, frame );
1441         phase->C->root()->add_req(halt);
1442         phase->transform(halt);
1443 
1444         igvn->replace_node(catchproj, phase->C->top());
1445         return this;
1446       }
1447     } else {
1448       // Can't correct it during regular GVN so register for IGVN
1449       phase->C->record_for_igvn(this);
1450     }
1451   }
1452   return NULL;
1453 }
1454 
1455 // Retrieve the length from the AllocateArrayNode. Narrow the type with a
1456 // CastII, if appropriate.  If we are not allowed to create new nodes, and
1457 // a CastII is appropriate, return NULL.
1458 Node *AllocateArrayNode::make_ideal_length(const TypeOopPtr* oop_type, PhaseTransform *phase, bool allow_new_nodes) {
1459   Node *length = in(AllocateNode::ALength);
1460   assert(length != NULL, "length is not null");
1461 
1462   const TypeInt* length_type = phase->find_int_type(length);
1463   const TypeAryPtr* ary_type = oop_type->isa_aryptr();
1464 
1465   if (ary_type != NULL && length_type != NULL) {
1466     const TypeInt* narrow_length_type = ary_type->narrow_size_type(length_type);
1467     if (narrow_length_type != length_type) {
1468       // Assert one of:
1469       //   - the narrow_length is 0
1470       //   - the narrow_length is not wider than length
1471       assert(narrow_length_type == TypeInt::ZERO ||
1472              length_type->is_con() && narrow_length_type->is_con() &&
1473                 (narrow_length_type->_hi <= length_type->_lo) ||
1474              (narrow_length_type->_hi <= length_type->_hi &&
1475               narrow_length_type->_lo >= length_type->_lo),
1476              "narrow type must be narrower than length type");
1477 
1478       // Return NULL if new nodes are not allowed
1479       if (!allow_new_nodes) return NULL;
1480       // Create a cast which is control dependent on the initialization to
1481       // propagate the fact that the array length must be positive.
1482       length = new CastIINode(length, narrow_length_type);
1483       length->set_req(0, initialization()->proj_out(0));
1484     }
1485   }
1486 
1487   return length;
1488 }
1489 
1490 //=============================================================================
1491 uint LockNode::size_of() const { return sizeof(*this); }
1492 
1493 // Redundant lock elimination
1494 //
1495 // There are various patterns of locking where we release and
1496 // immediately reacquire a lock in a piece of code where no operations
1497 // occur in between that would be observable.  In those cases we can
1498 // skip releasing and reacquiring the lock without violating any
1499 // fairness requirements.  Doing this around a loop could cause a lock
1500 // to be held for a very long time so we concentrate on non-looping
1501 // control flow.  We also require that the operations are fully
1502 // redundant meaning that we don't introduce new lock operations on
1503 // some paths so to be able to eliminate it on others ala PRE.  This
1504 // would probably require some more extensive graph manipulation to
1505 // guarantee that the memory edges were all handled correctly.
1506 //
1507 // Assuming p is a simple predicate which can't trap in any way and s
1508 // is a synchronized method consider this code:
1509 //
1510 //   s();
1511 //   if (p)
1512 //     s();
1513 //   else
1514 //     s();
1515 //   s();
1516 //
1517 // 1. The unlocks of the first call to s can be eliminated if the
1518 // locks inside the then and else branches are eliminated.
1519 //
1520 // 2. The unlocks of the then and else branches can be eliminated if
1521 // the lock of the final call to s is eliminated.
1522 //
1523 // Either of these cases subsumes the simple case of sequential control flow
1524 //
1525 // Addtionally we can eliminate versions without the else case:
1526 //
1527 //   s();
1528 //   if (p)
1529 //     s();
1530 //   s();
1531 //
1532 // 3. In this case we eliminate the unlock of the first s, the lock
1533 // and unlock in the then case and the lock in the final s.
1534 //
1535 // Note also that in all these cases the then/else pieces don't have
1536 // to be trivial as long as they begin and end with synchronization
1537 // operations.
1538 //
1539 //   s();
1540 //   if (p)
1541 //     s();
1542 //     f();
1543 //     s();
1544 //   s();
1545 //
1546 // The code will work properly for this case, leaving in the unlock
1547 // before the call to f and the relock after it.
1548 //
1549 // A potentially interesting case which isn't handled here is when the
1550 // locking is partially redundant.
1551 //
1552 //   s();
1553 //   if (p)
1554 //     s();
1555 //
1556 // This could be eliminated putting unlocking on the else case and
1557 // eliminating the first unlock and the lock in the then side.
1558 // Alternatively the unlock could be moved out of the then side so it
1559 // was after the merge and the first unlock and second lock
1560 // eliminated.  This might require less manipulation of the memory
1561 // state to get correct.
1562 //
1563 // Additionally we might allow work between a unlock and lock before
1564 // giving up eliminating the locks.  The current code disallows any
1565 // conditional control flow between these operations.  A formulation
1566 // similar to partial redundancy elimination computing the
1567 // availability of unlocking and the anticipatability of locking at a
1568 // program point would allow detection of fully redundant locking with
1569 // some amount of work in between.  I'm not sure how often I really
1570 // think that would occur though.  Most of the cases I've seen
1571 // indicate it's likely non-trivial work would occur in between.
1572 // There may be other more complicated constructs where we could
1573 // eliminate locking but I haven't seen any others appear as hot or
1574 // interesting.
1575 //
1576 // Locking and unlocking have a canonical form in ideal that looks
1577 // roughly like this:
1578 //
1579 //              <obj>
1580 //                | \\------+
1581 //                |  \       \
1582 //                | BoxLock   \
1583 //                |  |   |     \
1584 //                |  |    \     \
1585 //                |  |   FastLock
1586 //                |  |   /
1587 //                |  |  /
1588 //                |  |  |
1589 //
1590 //               Lock
1591 //                |
1592 //            Proj #0
1593 //                |
1594 //            MembarAcquire
1595 //                |
1596 //            Proj #0
1597 //
1598 //            MembarRelease
1599 //                |
1600 //            Proj #0
1601 //                |
1602 //              Unlock
1603 //                |
1604 //            Proj #0
1605 //
1606 //
1607 // This code proceeds by processing Lock nodes during PhaseIterGVN
1608 // and searching back through its control for the proper code
1609 // patterns.  Once it finds a set of lock and unlock operations to
1610 // eliminate they are marked as eliminatable which causes the
1611 // expansion of the Lock and Unlock macro nodes to make the operation a NOP
1612 //
1613 //=============================================================================
1614 
1615 //
1616 // Utility function to skip over uninteresting control nodes.  Nodes skipped are:
1617 //   - copy regions.  (These may not have been optimized away yet.)
1618 //   - eliminated locking nodes
1619 //
1620 static Node *next_control(Node *ctrl) {
1621   if (ctrl == NULL)
1622     return NULL;
1623   while (1) {
1624     if (ctrl->is_Region()) {
1625       RegionNode *r = ctrl->as_Region();
1626       Node *n = r->is_copy();
1627       if (n == NULL)
1628         break;  // hit a region, return it
1629       else
1630         ctrl = n;
1631     } else if (ctrl->is_Proj()) {
1632       Node *in0 = ctrl->in(0);
1633       if (in0->is_AbstractLock() && in0->as_AbstractLock()->is_eliminated()) {
1634         ctrl = in0->in(0);
1635       } else {
1636         break;
1637       }
1638     } else {
1639       break; // found an interesting control
1640     }
1641   }
1642   return ctrl;
1643 }
1644 //
1645 // Given a control, see if it's the control projection of an Unlock which
1646 // operating on the same object as lock.
1647 //
1648 bool AbstractLockNode::find_matching_unlock(const Node* ctrl, LockNode* lock,
1649                                             GrowableArray<AbstractLockNode*> &lock_ops) {
1650   ProjNode *ctrl_proj = (ctrl->is_Proj()) ? ctrl->as_Proj() : NULL;
1651   if (ctrl_proj != NULL && ctrl_proj->_con == TypeFunc::Control) {
1652     Node *n = ctrl_proj->in(0);
1653     if (n != NULL && n->is_Unlock()) {
1654       UnlockNode *unlock = n->as_Unlock();
1655       if (lock->obj_node()->eqv_uncast(unlock->obj_node()) &&
1656           BoxLockNode::same_slot(lock->box_node(), unlock->box_node()) &&
1657           !unlock->is_eliminated()) {
1658         lock_ops.append(unlock);
1659         return true;
1660       }
1661     }
1662   }
1663   return false;
1664 }
1665 
1666 //
1667 // Find the lock matching an unlock.  Returns null if a safepoint
1668 // or complicated control is encountered first.
1669 LockNode *AbstractLockNode::find_matching_lock(UnlockNode* unlock) {
1670   LockNode *lock_result = NULL;
1671   // find the matching lock, or an intervening safepoint
1672   Node *ctrl = next_control(unlock->in(0));
1673   while (1) {
1674     assert(ctrl != NULL, "invalid control graph");
1675     assert(!ctrl->is_Start(), "missing lock for unlock");
1676     if (ctrl->is_top()) break;  // dead control path
1677     if (ctrl->is_Proj()) ctrl = ctrl->in(0);
1678     if (ctrl->is_SafePoint()) {
1679         break;  // found a safepoint (may be the lock we are searching for)
1680     } else if (ctrl->is_Region()) {
1681       // Check for a simple diamond pattern.  Punt on anything more complicated
1682       if (ctrl->req() == 3 && ctrl->in(1) != NULL && ctrl->in(2) != NULL) {
1683         Node *in1 = next_control(ctrl->in(1));
1684         Node *in2 = next_control(ctrl->in(2));
1685         if (((in1->is_IfTrue() && in2->is_IfFalse()) ||
1686              (in2->is_IfTrue() && in1->is_IfFalse())) && (in1->in(0) == in2->in(0))) {
1687           ctrl = next_control(in1->in(0)->in(0));
1688         } else {
1689           break;
1690         }
1691       } else {
1692         break;
1693       }
1694     } else {
1695       ctrl = next_control(ctrl->in(0));  // keep searching
1696     }
1697   }
1698   if (ctrl->is_Lock()) {
1699     LockNode *lock = ctrl->as_Lock();
1700     if (lock->obj_node()->eqv_uncast(unlock->obj_node()) &&
1701         BoxLockNode::same_slot(lock->box_node(), unlock->box_node())) {
1702       lock_result = lock;
1703     }
1704   }
1705   return lock_result;
1706 }
1707 
1708 // This code corresponds to case 3 above.
1709 
1710 bool AbstractLockNode::find_lock_and_unlock_through_if(Node* node, LockNode* lock,
1711                                                        GrowableArray<AbstractLockNode*> &lock_ops) {
1712   Node* if_node = node->in(0);
1713   bool  if_true = node->is_IfTrue();
1714 
1715   if (if_node->is_If() && if_node->outcnt() == 2 && (if_true || node->is_IfFalse())) {
1716     Node *lock_ctrl = next_control(if_node->in(0));
1717     if (find_matching_unlock(lock_ctrl, lock, lock_ops)) {
1718       Node* lock1_node = NULL;
1719       ProjNode* proj = if_node->as_If()->proj_out(!if_true);
1720       if (if_true) {
1721         if (proj->is_IfFalse() && proj->outcnt() == 1) {
1722           lock1_node = proj->unique_out();
1723         }
1724       } else {
1725         if (proj->is_IfTrue() && proj->outcnt() == 1) {
1726           lock1_node = proj->unique_out();
1727         }
1728       }
1729       if (lock1_node != NULL && lock1_node->is_Lock()) {
1730         LockNode *lock1 = lock1_node->as_Lock();
1731         if (lock->obj_node()->eqv_uncast(lock1->obj_node()) &&
1732             BoxLockNode::same_slot(lock->box_node(), lock1->box_node()) &&
1733             !lock1->is_eliminated()) {
1734           lock_ops.append(lock1);
1735           return true;
1736         }
1737       }
1738     }
1739   }
1740 
1741   lock_ops.trunc_to(0);
1742   return false;
1743 }
1744 
1745 bool AbstractLockNode::find_unlocks_for_region(const RegionNode* region, LockNode* lock,
1746                                GrowableArray<AbstractLockNode*> &lock_ops) {
1747   // check each control merging at this point for a matching unlock.
1748   // in(0) should be self edge so skip it.
1749   for (int i = 1; i < (int)region->req(); i++) {
1750     Node *in_node = next_control(region->in(i));
1751     if (in_node != NULL) {
1752       if (find_matching_unlock(in_node, lock, lock_ops)) {
1753         // found a match so keep on checking.
1754         continue;
1755       } else if (find_lock_and_unlock_through_if(in_node, lock, lock_ops)) {
1756         continue;
1757       }
1758 
1759       // If we fall through to here then it was some kind of node we
1760       // don't understand or there wasn't a matching unlock, so give
1761       // up trying to merge locks.
1762       lock_ops.trunc_to(0);
1763       return false;
1764     }
1765   }
1766   return true;
1767 
1768 }
1769 
1770 #ifndef PRODUCT
1771 //
1772 // Create a counter which counts the number of times this lock is acquired
1773 //
1774 void AbstractLockNode::create_lock_counter(JVMState* state) {
1775   _counter = OptoRuntime::new_named_counter(state, NamedCounter::LockCounter);
1776 }
1777 
1778 void AbstractLockNode::set_eliminated_lock_counter() {
1779   if (_counter) {
1780     // Update the counter to indicate that this lock was eliminated.
1781     // The counter update code will stay around even though the
1782     // optimizer will eliminate the lock operation itself.
1783     _counter->set_tag(NamedCounter::EliminatedLockCounter);
1784   }
1785 }
1786 
1787 const char* AbstractLockNode::_kind_names[] = {"Regular", "NonEscObj", "Coarsened", "Nested"};
1788 
1789 void AbstractLockNode::dump_spec(outputStream* st) const {
1790   st->print("%s ", _kind_names[_kind]);
1791   CallNode::dump_spec(st);
1792 }
1793 
1794 void AbstractLockNode::dump_compact_spec(outputStream* st) const {
1795   st->print("%s", _kind_names[_kind]);
1796 }
1797 
1798 // The related set of lock nodes includes the control boundary.
1799 void AbstractLockNode::related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const {
1800   if (compact) {
1801       this->collect_nodes(in_rel, 1, false, false);
1802     } else {
1803       this->collect_nodes_in_all_data(in_rel, true);
1804     }
1805     this->collect_nodes(out_rel, -2, false, false);
1806 }
1807 #endif
1808 
1809 //=============================================================================
1810 Node *LockNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1811 
1812   // perform any generic optimizations first (returns 'this' or NULL)
1813   Node *result = SafePointNode::Ideal(phase, can_reshape);
1814   if (result != NULL)  return result;
1815   // Don't bother trying to transform a dead node
1816   if (in(0) && in(0)->is_top())  return NULL;
1817 
1818   // Now see if we can optimize away this lock.  We don't actually
1819   // remove the locking here, we simply set the _eliminate flag which
1820   // prevents macro expansion from expanding the lock.  Since we don't
1821   // modify the graph, the value returned from this function is the
1822   // one computed above.
1823   if (can_reshape && EliminateLocks && !is_non_esc_obj()) {
1824     //
1825     // If we are locking an unescaped object, the lock/unlock is unnecessary
1826     //
1827     ConnectionGraph *cgr = phase->C->congraph();
1828     if (cgr != NULL && cgr->not_global_escape(obj_node())) {
1829       assert(!is_eliminated() || is_coarsened(), "sanity");
1830       // The lock could be marked eliminated by lock coarsening
1831       // code during first IGVN before EA. Replace coarsened flag
1832       // to eliminate all associated locks/unlocks.
1833 #ifdef ASSERT
1834       this->log_lock_optimization(phase->C,"eliminate_lock_set_non_esc1");
1835 #endif
1836       this->set_non_esc_obj();
1837       return result;
1838     }
1839 
1840     //
1841     // Try lock coarsening
1842     //
1843     PhaseIterGVN* iter = phase->is_IterGVN();
1844     if (iter != NULL && !is_eliminated()) {
1845 
1846       GrowableArray<AbstractLockNode*>   lock_ops;
1847 
1848       Node *ctrl = next_control(in(0));
1849 
1850       // now search back for a matching Unlock
1851       if (find_matching_unlock(ctrl, this, lock_ops)) {
1852         // found an unlock directly preceding this lock.  This is the
1853         // case of single unlock directly control dependent on a
1854         // single lock which is the trivial version of case 1 or 2.
1855       } else if (ctrl->is_Region() ) {
1856         if (find_unlocks_for_region(ctrl->as_Region(), this, lock_ops)) {
1857         // found lock preceded by multiple unlocks along all paths
1858         // joining at this point which is case 3 in description above.
1859         }
1860       } else {
1861         // see if this lock comes from either half of an if and the
1862         // predecessors merges unlocks and the other half of the if
1863         // performs a lock.
1864         if (find_lock_and_unlock_through_if(ctrl, this, lock_ops)) {
1865           // found unlock splitting to an if with locks on both branches.
1866         }
1867       }
1868 
1869       if (lock_ops.length() > 0) {
1870         // add ourselves to the list of locks to be eliminated.
1871         lock_ops.append(this);
1872 
1873   #ifndef PRODUCT
1874         if (PrintEliminateLocks) {
1875           int locks = 0;
1876           int unlocks = 0;
1877           for (int i = 0; i < lock_ops.length(); i++) {
1878             AbstractLockNode* lock = lock_ops.at(i);
1879             if (lock->Opcode() == Op_Lock)
1880               locks++;
1881             else
1882               unlocks++;
1883             if (Verbose) {
1884               lock->dump(1);
1885             }
1886           }
1887           tty->print_cr("***Eliminated %d unlocks and %d locks", unlocks, locks);
1888         }
1889   #endif
1890 
1891         // for each of the identified locks, mark them
1892         // as eliminatable
1893         for (int i = 0; i < lock_ops.length(); i++) {
1894           AbstractLockNode* lock = lock_ops.at(i);
1895 
1896           // Mark it eliminated by coarsening and update any counters
1897 #ifdef ASSERT
1898           lock->log_lock_optimization(phase->C, "eliminate_lock_set_coarsened");
1899 #endif
1900           lock->set_coarsened();
1901         }
1902       } else if (ctrl->is_Region() &&
1903                  iter->_worklist.member(ctrl)) {
1904         // We weren't able to find any opportunities but the region this
1905         // lock is control dependent on hasn't been processed yet so put
1906         // this lock back on the worklist so we can check again once any
1907         // region simplification has occurred.
1908         iter->_worklist.push(this);
1909       }
1910     }
1911   }
1912 
1913   return result;
1914 }
1915 
1916 //=============================================================================
1917 bool LockNode::is_nested_lock_region() {
1918   return is_nested_lock_region(NULL);
1919 }
1920 
1921 // p is used for access to compilation log; no logging if NULL
1922 bool LockNode::is_nested_lock_region(Compile * c) {
1923   BoxLockNode* box = box_node()->as_BoxLock();
1924   int stk_slot = box->stack_slot();
1925   if (stk_slot <= 0) {
1926 #ifdef ASSERT
1927     this->log_lock_optimization(c, "eliminate_lock_INLR_1");
1928 #endif
1929     return false; // External lock or it is not Box (Phi node).
1930   }
1931 
1932   // Ignore complex cases: merged locks or multiple locks.
1933   Node* obj = obj_node();
1934   LockNode* unique_lock = NULL;
1935   if (!box->is_simple_lock_region(&unique_lock, obj)) {
1936 #ifdef ASSERT
1937     this->log_lock_optimization(c, "eliminate_lock_INLR_2a");
1938 #endif
1939     return false;
1940   }
1941   if (unique_lock != this) {
1942 #ifdef ASSERT
1943     this->log_lock_optimization(c, "eliminate_lock_INLR_2b");
1944 #endif
1945     return false;
1946   }
1947 
1948   // Look for external lock for the same object.
1949   SafePointNode* sfn = this->as_SafePoint();
1950   JVMState* youngest_jvms = sfn->jvms();
1951   int max_depth = youngest_jvms->depth();
1952   for (int depth = 1; depth <= max_depth; depth++) {
1953     JVMState* jvms = youngest_jvms->of_depth(depth);
1954     int num_mon  = jvms->nof_monitors();
1955     // Loop over monitors
1956     for (int idx = 0; idx < num_mon; idx++) {
1957       Node* obj_node = sfn->monitor_obj(jvms, idx);
1958       BoxLockNode* box_node = sfn->monitor_box(jvms, idx)->as_BoxLock();
1959       if ((box_node->stack_slot() < stk_slot) && obj_node->eqv_uncast(obj)) {
1960         return true;
1961       }
1962     }
1963   }
1964 #ifdef ASSERT
1965   this->log_lock_optimization(c, "eliminate_lock_INLR_3");
1966 #endif
1967   return false;
1968 }
1969 
1970 //=============================================================================
1971 uint UnlockNode::size_of() const { return sizeof(*this); }
1972 
1973 //=============================================================================
1974 Node *UnlockNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1975 
1976   // perform any generic optimizations first (returns 'this' or NULL)
1977   Node *result = SafePointNode::Ideal(phase, can_reshape);
1978   if (result != NULL)  return result;
1979   // Don't bother trying to transform a dead node
1980   if (in(0) && in(0)->is_top())  return NULL;
1981 
1982   // Now see if we can optimize away this unlock.  We don't actually
1983   // remove the unlocking here, we simply set the _eliminate flag which
1984   // prevents macro expansion from expanding the unlock.  Since we don't
1985   // modify the graph, the value returned from this function is the
1986   // one computed above.
1987   // Escape state is defined after Parse phase.
1988   if (can_reshape && EliminateLocks && !is_non_esc_obj()) {
1989     //
1990     // If we are unlocking an unescaped object, the lock/unlock is unnecessary.
1991     //
1992     ConnectionGraph *cgr = phase->C->congraph();
1993     if (cgr != NULL && cgr->not_global_escape(obj_node())) {
1994       assert(!is_eliminated() || is_coarsened(), "sanity");
1995       // The lock could be marked eliminated by lock coarsening
1996       // code during first IGVN before EA. Replace coarsened flag
1997       // to eliminate all associated locks/unlocks.
1998 #ifdef ASSERT
1999       this->log_lock_optimization(phase->C, "eliminate_lock_set_non_esc2");
2000 #endif
2001       this->set_non_esc_obj();
2002     }
2003   }
2004   return result;
2005 }
2006 
2007 const char * AbstractLockNode::kind_as_string() const {
2008   return is_coarsened()   ? "coarsened" :
2009          is_nested()      ? "nested" :
2010          is_non_esc_obj() ? "non_escaping" :
2011          "?";
2012 }
2013 
2014 void AbstractLockNode::log_lock_optimization(Compile *C, const char * tag)  const {
2015   if (C == NULL) {
2016     return;
2017   }
2018   CompileLog* log = C->log();
2019   if (log != NULL) {
2020     log->begin_head("%s lock='%d' compile_id='%d' class_id='%s' kind='%s'",
2021           tag, is_Lock(), C->compile_id(),
2022           is_Unlock() ? "unlock" : is_Lock() ? "lock" : "?",
2023           kind_as_string());
2024     log->stamp();
2025     log->end_head();
2026     JVMState* p = is_Unlock() ? (as_Unlock()->dbg_jvms()) : jvms();
2027     while (p != NULL) {
2028       log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method()));
2029       p = p->caller();
2030     }
2031     log->tail(tag);
2032   }
2033 }
2034 
2035 bool CallNode::may_modify_arraycopy_helper(const TypeOopPtr* dest_t, const TypeOopPtr *t_oop, PhaseTransform *phase) {
2036   if (dest_t->is_known_instance() && t_oop->is_known_instance()) {
2037     return dest_t->instance_id() == t_oop->instance_id();
2038   }
2039 
2040   if (dest_t->isa_instptr() && !dest_t->klass()->equals(phase->C->env()->Object_klass())) {
2041     // clone
2042     if (t_oop->isa_aryptr()) {
2043       return false;
2044     }
2045     if (!t_oop->isa_instptr()) {
2046       return true;
2047     }
2048     if (dest_t->klass()->is_subtype_of(t_oop->klass()) || t_oop->klass()->is_subtype_of(dest_t->klass())) {
2049       return true;
2050     }
2051     // unrelated
2052     return false;
2053   }
2054 
2055   if (dest_t->isa_aryptr()) {
2056     // arraycopy or array clone
2057     if (t_oop->isa_instptr()) {
2058       return false;
2059     }
2060     if (!t_oop->isa_aryptr()) {
2061       return true;
2062     }
2063 
2064     const Type* elem = dest_t->is_aryptr()->elem();
2065     if (elem == Type::BOTTOM) {
2066       // An array but we don't know what elements are
2067       return true;
2068     }
2069 
2070     dest_t = dest_t->add_offset(Type::OffsetBot)->is_oopptr();
2071     uint dest_alias = phase->C->get_alias_index(dest_t);
2072     uint t_oop_alias = phase->C->get_alias_index(t_oop);
2073 
2074     return dest_alias == t_oop_alias;
2075   }
2076 
2077   return true;
2078 }
2079