hotspot/src/share/vm/opto/callnode.cpp
author kvn
Wed, 27 Aug 2008 09:15:46 -0700
changeset 1067 f82e0a8cd438
parent 955 723d7b577fba
child 1135 9487203e5789
permissions -rw-r--r--
6736417: Fastdebug C2 crashes in StoreBNode::Ideal Summary: The result of step_through_mergemem() and remove_dead_region() is not checked in some cases. Reviewed-by: never
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
670
ddf3e9583f2f 6719955: Update copyright year
xdono
parents: 589
diff changeset
     2
 * Copyright 1997-2008 Sun Microsystems, Inc.  All Rights Reserved.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     3
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     4
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     5
 * This code is free software; you can redistribute it and/or modify it
489c9b5090e2 Initial load
duke
parents:
diff changeset
     6
 * under the terms of the GNU General Public License version 2 only, as
489c9b5090e2 Initial load
duke
parents:
diff changeset
     7
 * published by the Free Software Foundation.
489c9b5090e2 Initial load
duke
parents:
diff changeset
     8
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
     9
 * This code is distributed in the hope that it will be useful, but WITHOUT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    10
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    11
 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
489c9b5090e2 Initial load
duke
parents:
diff changeset
    12
 * version 2 for more details (a copy is included in the LICENSE file that
489c9b5090e2 Initial load
duke
parents:
diff changeset
    13
 * accompanied this code).
489c9b5090e2 Initial load
duke
parents:
diff changeset
    14
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    15
 * You should have received a copy of the GNU General Public License version
489c9b5090e2 Initial load
duke
parents:
diff changeset
    16
 * 2 along with this work; if not, write to the Free Software Foundation,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    17
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    18
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    19
 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
489c9b5090e2 Initial load
duke
parents:
diff changeset
    20
 * CA 95054 USA or visit www.sun.com if you need additional information or
489c9b5090e2 Initial load
duke
parents:
diff changeset
    21
 * have any questions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
489c9b5090e2 Initial load
duke
parents:
diff changeset
    25
// Portions of code courtesy of Clifford Click
489c9b5090e2 Initial load
duke
parents:
diff changeset
    26
489c9b5090e2 Initial load
duke
parents:
diff changeset
    27
// Optimization - Graph Style
489c9b5090e2 Initial load
duke
parents:
diff changeset
    28
489c9b5090e2 Initial load
duke
parents:
diff changeset
    29
#include "incls/_precompiled.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    30
#include "incls/_callnode.cpp.incl"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    31
489c9b5090e2 Initial load
duke
parents:
diff changeset
    32
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
uint StartNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
uint StartNode::cmp( const Node &n ) const
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
{ return _domain == ((StartNode&)n)._domain; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
const Type *StartNode::bottom_type() const { return _domain; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
const Type *StartNode::Value(PhaseTransform *phase) const { return _domain; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
void StartNode::dump_spec(outputStream *st) const { st->print(" #"); _domain->dump_on(st);}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
//------------------------------Ideal------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
  return remove_dead_region(phase, can_reshape) ? this : NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
//------------------------------calling_convention-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
void StartNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
  Matcher::calling_convention( sig_bt, parm_regs, argcnt, false );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
//------------------------------Registers--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
const RegMask &StartNode::in_RegMask(uint) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
  return RegMask::Empty;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
//------------------------------match------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
// Construct projections for incoming parameters, and their RegMask info
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
Node *StartNode::match( const ProjNode *proj, const Matcher *match ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
  switch (proj->_con) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
  case TypeFunc::Control:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
  case TypeFunc::I_O:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
  case TypeFunc::Memory:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
    return new (match->C, 1) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
  case TypeFunc::FramePtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
    return new (match->C, 1) MachProjNode(this,proj->_con,Matcher::c_frame_ptr_mask, Op_RegP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
  case TypeFunc::ReturnAdr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
    return new (match->C, 1) MachProjNode(this,proj->_con,match->_return_addr_mask,Op_RegP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
  case TypeFunc::Parms:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
  default: {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
      uint parm_num = proj->_con - TypeFunc::Parms;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
      const Type *t = _domain->field_at(proj->_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
      if (t->base() == Type::Half)  // 2nd half of Longs and Doubles
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
        return new (match->C, 1) ConNode(Type::TOP);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
      uint ideal_reg = Matcher::base2reg[t->base()];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
      RegMask &rm = match->_calling_convention_mask[parm_num];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
      return new (match->C, 1) MachProjNode(this,proj->_con,rm,ideal_reg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
//------------------------------StartOSRNode----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
// The method start node for an on stack replacement adapter
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
//------------------------------osr_domain-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
const TypeTuple *StartOSRNode::osr_domain() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  const Type **fields = TypeTuple::fields(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM;  // address of osr buffer
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  return TypeTuple::make(TypeFunc::Parms+1, fields);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
const char * const ParmNode::names[TypeFunc::Parms+1] = {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
  "Control", "I_O", "Memory", "FramePtr", "ReturnAdr", "Parms"
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
    98
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
void ParmNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
  if( _con < TypeFunc::Parms ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
    st->print(names[_con]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
    st->print("Parm%d: ",_con-TypeFunc::Parms);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
    // Verbose and WizardMode dump bottom_type for all nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
    if( !Verbose && !WizardMode )   bottom_type()->dump_on(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
uint ParmNode::ideal_reg() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
  switch( _con ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
  case TypeFunc::Control  : // fall through
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
  case TypeFunc::I_O      : // fall through
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
  case TypeFunc::Memory   : return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
  case TypeFunc::FramePtr : // fall through
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
  case TypeFunc::ReturnAdr: return Op_RegP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
  default                 : assert( _con > TypeFunc::Parms, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
    // fall through
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
  case TypeFunc::Parms    : {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
    // Type of argument being passed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   122
    const Type *t = in(0)->as_Start()->_domain->field_at(_con);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   123
    return Matcher::base2reg[t->base()];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   124
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   125
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
  ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
ReturnNode::ReturnNode(uint edges, Node *cntrl, Node *i_o, Node *memory, Node *frameptr, Node *retadr ) : Node(edges) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  init_req(TypeFunc::Control,cntrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
  init_req(TypeFunc::I_O,i_o);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
  init_req(TypeFunc::Memory,memory);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
  init_req(TypeFunc::FramePtr,frameptr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  init_req(TypeFunc::ReturnAdr,retadr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
Node *ReturnNode::Ideal(PhaseGVN *phase, bool can_reshape){
489c9b5090e2 Initial load
duke
parents:
diff changeset
   140
  return remove_dead_region(phase, can_reshape) ? this : NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   141
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   142
489c9b5090e2 Initial load
duke
parents:
diff changeset
   143
const Type *ReturnNode::Value( PhaseTransform *phase ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   144
  return ( phase->type(in(TypeFunc::Control)) == Type::TOP)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   145
    ? Type::TOP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   146
    : Type::BOTTOM;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   147
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   148
489c9b5090e2 Initial load
duke
parents:
diff changeset
   149
// Do we Match on this edge index or not?  No edges on return nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
uint ReturnNode::match_edge(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
void ReturnNode::dump_req() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
  // Dump the required inputs, enclosed in '(' and ')'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
  uint i;                       // Exit value of loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
  for( i=0; i<req(); i++ ) {    // For all required inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   160
    if( i == TypeFunc::Parms ) tty->print("returns");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
    if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
    else tty->print("_ ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
RethrowNode::RethrowNode(
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
  Node* cntrl,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
  Node* i_o,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
  Node* memory,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
  Node* frameptr,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
  Node* ret_adr,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   174
  Node* exception
489c9b5090e2 Initial load
duke
parents:
diff changeset
   175
) : Node(TypeFunc::Parms + 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   176
  init_req(TypeFunc::Control  , cntrl    );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   177
  init_req(TypeFunc::I_O      , i_o      );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   178
  init_req(TypeFunc::Memory   , memory   );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   179
  init_req(TypeFunc::FramePtr , frameptr );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
  init_req(TypeFunc::ReturnAdr, ret_adr);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
  init_req(TypeFunc::Parms    , exception);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
Node *RethrowNode::Ideal(PhaseGVN *phase, bool can_reshape){
489c9b5090e2 Initial load
duke
parents:
diff changeset
   185
  return remove_dead_region(phase, can_reshape) ? this : NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
const Type *RethrowNode::Value( PhaseTransform *phase ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   189
  return (phase->type(in(TypeFunc::Control)) == Type::TOP)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   190
    ? Type::TOP
489c9b5090e2 Initial load
duke
parents:
diff changeset
   191
    : Type::BOTTOM;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   192
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   193
489c9b5090e2 Initial load
duke
parents:
diff changeset
   194
uint RethrowNode::match_edge(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   195
  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   196
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   197
489c9b5090e2 Initial load
duke
parents:
diff changeset
   198
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   199
void RethrowNode::dump_req() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   200
  // Dump the required inputs, enclosed in '(' and ')'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
  uint i;                       // Exit value of loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
  for( i=0; i<req(); i++ ) {    // For all required inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
    if( i == TypeFunc::Parms ) tty->print("exception");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
    if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
    else tty->print("_ ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
// Do we Match on this edge index or not?  Match only target address & method
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
uint TailCallNode::match_edge(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
  return TypeFunc::Parms <= idx  &&  idx <= TypeFunc::Parms+1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
// Do we Match on this edge index or not?  Match only target address & oop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
uint TailJumpNode::match_edge(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
  return TypeFunc::Parms <= idx  &&  idx <= TypeFunc::Parms+1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   221
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
JVMState::JVMState(ciMethod* method, JVMState* caller) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
  assert(method != NULL, "must be valid call site");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
  _method = method;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
  debug_only(_bci = -99);  // random garbage value
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  debug_only(_map = (SafePointNode*)-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
  _caller = caller;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
  _depth  = 1 + (caller == NULL ? 0 : caller->depth());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
  _locoff = TypeFunc::Parms;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
  _stkoff = _locoff + _method->max_locals();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
  _monoff = _stkoff + _method->max_stack();
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   233
  _scloff = _monoff;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
  _endoff = _monoff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
  _sp = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
JVMState::JVMState(int stack_size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
  _method = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
  _bci = InvocationEntryBci;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
  debug_only(_map = (SafePointNode*)-1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
  _caller = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
  _depth  = 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
  _locoff = TypeFunc::Parms;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
  _stkoff = _locoff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
  _monoff = _stkoff + stack_size;
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   246
  _scloff = _monoff;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
  _endoff = _monoff;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
  _sp = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
//--------------------------------of_depth-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
JVMState* JVMState::of_depth(int d) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
  const JVMState* jvmp = this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
  assert(0 < d && (uint)d <= depth(), "oob");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
  for (int skip = depth() - d; skip > 0; skip--) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   256
    jvmp = jvmp->caller();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   257
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
  assert(jvmp->depth() == (uint)d, "found the right one");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
  return (JVMState*)jvmp;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
//-----------------------------same_calls_as-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
bool JVMState::same_calls_as(const JVMState* that) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  if (this == that)                    return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  if (this->depth() != that->depth())  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
  const JVMState* p = this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
  const JVMState* q = that;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
  for (;;) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
    if (p->_method != q->_method)    return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
    if (p->_method == NULL)          return true;   // bci is irrelevant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
    if (p->_bci    != q->_bci)       return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
    p = p->caller();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
    q = q->caller();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
    if (p == q)                      return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
    assert(p != NULL && q != NULL, "depth check ensures we don't run off end");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
//------------------------------debug_start------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
uint JVMState::debug_start()  const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  debug_only(JVMState* jvmroot = of_depth(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  assert(jvmroot->locoff() <= this->locoff(), "youngest JVMState must be last");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  return of_depth(1)->locoff();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
//-------------------------------debug_end-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
uint JVMState::debug_end() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
  debug_only(JVMState* jvmroot = of_depth(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
  assert(jvmroot->endoff() <= this->endoff(), "youngest JVMState must be last");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
  return endoff();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
//------------------------------debug_depth------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
uint JVMState::debug_depth() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  uint total = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
  for (const JVMState* jvmp = this; jvmp != NULL; jvmp = jvmp->caller()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
    total += jvmp->debug_size();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
  return total;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   302
#ifndef PRODUCT
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   303
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
//------------------------------format_helper----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
// Given an allocation (a Chaitin object) and a Node decide if the Node carries
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
// any defined value or not.  If it does, print out the register or constant.
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   307
static void format_helper( PhaseRegAlloc *regalloc, outputStream* st, Node *n, const char *msg, uint i, GrowableArray<SafePointScalarObjectNode*> *scobjs ) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
  if (n == NULL) { st->print(" NULL"); return; }
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   309
  if (n->is_SafePointScalarObject()) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   310
    // Scalar replacement.
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   311
    SafePointScalarObjectNode* spobj = n->as_SafePointScalarObject();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   312
    scobjs->append_if_missing(spobj);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   313
    int sco_n = scobjs->find(spobj);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   314
    assert(sco_n >= 0, "");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   315
    st->print(" %s%d]=#ScObj" INT32_FORMAT, msg, i, sco_n);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   316
    return;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   317
  }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  if( OptoReg::is_valid(regalloc->get_reg_first(n))) { // Check for undefined
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
    char buf[50];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
    regalloc->dump_register(n,buf);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
    st->print(" %s%d]=%s",msg,i,buf);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
  } else {                      // No register, but might be constant
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
    const Type *t = n->bottom_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
    switch (t->base()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
    case Type::Int:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
      st->print(" %s%d]=#"INT32_FORMAT,msg,i,t->is_int()->get_con());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
    case Type::AnyPtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
      assert( t == TypePtr::NULL_PTR, "" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
      st->print(" %s%d]=#NULL",msg,i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
    case Type::AryPtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
    case Type::KlassPtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
    case Type::InstPtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
      st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,t->isa_oopptr()->const_oop());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
    case Type::RawPtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
      st->print(" %s%d]=#Raw" INTPTR_FORMAT,msg,i,t->is_rawptr());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
    case Type::DoubleCon:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
      st->print(" %s%d]=#%fD",msg,i,t->is_double_constant()->_d);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
    case Type::FloatCon:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
      st->print(" %s%d]=#%fF",msg,i,t->is_float_constant()->_f);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
    case Type::Long:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   347
      st->print(" %s%d]=#"INT64_FORMAT,msg,i,t->is_long()->get_con());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
    case Type::Half:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
    case Type::Top:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   351
      st->print(" %s%d]=_",msg,i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
      break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
    default: ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   354
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   355
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   356
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   357
489c9b5090e2 Initial load
duke
parents:
diff changeset
   358
//------------------------------format-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
  st->print("        #");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
  if( _method ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
    _method->print_short_name(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
    st->print(" @ bci:%d ",_bci);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   364
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
    st->print_cr(" runtime stub ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   366
    return;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   367
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   368
  if (n->is_MachSafePoint()) {
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   369
    GrowableArray<SafePointScalarObjectNode*> scobjs;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   370
    MachSafePointNode *mcall = n->as_MachSafePoint();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   371
    uint i;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   372
    // Print locals
489c9b5090e2 Initial load
duke
parents:
diff changeset
   373
    for( i = 0; i < (uint)loc_size(); i++ )
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   374
      format_helper( regalloc, st, mcall->local(this, i), "L[", i, &scobjs );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   375
    // Print stack
489c9b5090e2 Initial load
duke
parents:
diff changeset
   376
    for (i = 0; i < (uint)stk_size(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
      if ((uint)(_stkoff + i) >= mcall->len())
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
        st->print(" oob ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
      else
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   380
       format_helper( regalloc, st, mcall->stack(this, i), "STK[", i, &scobjs );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   381
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   382
    for (i = 0; (int)i < nof_monitors(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
      Node *box = mcall->monitor_box(this, i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
      Node *obj = mcall->monitor_obj(this, i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   385
      if ( OptoReg::is_valid(regalloc->get_reg_first(box)) ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
        while( !box->is_BoxLock() )  box = box->in(1);
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   387
        format_helper( regalloc, st, box, "MON-BOX[", i, &scobjs );
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
        OptoReg::Name box_reg = BoxLockNode::stack_slot(box);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
        st->print(" MON-BOX%d=%s+%d",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   391
                   i,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   392
                   OptoReg::regname(OptoReg::c_frame_pointer),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   393
                   regalloc->reg2offset(box_reg));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
      }
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   395
      format_helper( regalloc, st, obj, "MON-OBJ[", i, &scobjs );
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   396
    }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   397
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   398
    for (i = 0; i < (uint)scobjs.length(); i++) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   399
      // Scalar replaced objects.
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   400
      st->print_cr("");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   401
      st->print("        # ScObj" INT32_FORMAT " ", i);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   402
      SafePointScalarObjectNode* spobj = scobjs.at(i);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   403
      ciKlass* cik = spobj->bottom_type()->is_oopptr()->klass();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   404
      assert(cik->is_instance_klass() ||
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   405
             cik->is_array_klass(), "Not supported allocation.");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   406
      ciInstanceKlass *iklass = NULL;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   407
      if (cik->is_instance_klass()) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   408
        cik->print_name_on(st);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   409
        iklass = cik->as_instance_klass();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   410
      } else if (cik->is_type_array_klass()) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   411
        cik->as_array_klass()->base_element_type()->print_name_on(st);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   412
        st->print("[%d]=", spobj->n_fields());
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   413
      } else if (cik->is_obj_array_klass()) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   414
        ciType* cie = cik->as_array_klass()->base_element_type();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   415
        int ndim = 1;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   416
        while (cie->is_obj_array_klass()) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   417
          ndim += 1;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   418
          cie = cie->as_array_klass()->base_element_type();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   419
        }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   420
        cie->print_name_on(st);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   421
        while (ndim-- > 0) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   422
          st->print("[]");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   423
        }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   424
        st->print("[%d]=", spobj->n_fields());
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   425
      }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   426
      st->print("{");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   427
      uint nf = spobj->n_fields();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   428
      if (nf > 0) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   429
        uint first_ind = spobj->first_index();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   430
        Node* fld_node = mcall->in(first_ind);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   431
        ciField* cifield;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   432
        if (iklass != NULL) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   433
          st->print(" [");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   434
          cifield = iklass->nonstatic_field_at(0);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   435
          cifield->print_name_on(st);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   436
          format_helper( regalloc, st, fld_node, ":", 0, &scobjs );
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   437
        } else {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   438
          format_helper( regalloc, st, fld_node, "[", 0, &scobjs );
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   439
        }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   440
        for (uint j = 1; j < nf; j++) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   441
          fld_node = mcall->in(first_ind+j);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   442
          if (iklass != NULL) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   443
            st->print(", [");
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   444
            cifield = iklass->nonstatic_field_at(j);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   445
            cifield->print_name_on(st);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   446
            format_helper( regalloc, st, fld_node, ":", j, &scobjs );
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   447
          } else {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   448
            format_helper( regalloc, st, fld_node, ", [", j, &scobjs );
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   449
          }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   450
        }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   451
      }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   452
      st->print(" }");
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  st->print_cr("");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
  if (caller() != NULL)  caller()->format(regalloc, n, st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   459
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
void JVMState::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
  if (_method != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
    bool printed = false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
    if (!Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
      // The JVMS dumps make really, really long lines.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
      // Take out the most boring parts, which are the package prefixes.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
      char buf[500];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
      stringStream namest(buf, sizeof(buf));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
      _method->print_short_name(&namest);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
      if (namest.count() < sizeof(buf)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
        const char* name = namest.base();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
        if (name[0] == ' ')  ++name;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
        const char* endcn = strchr(name, ':');  // end of class name
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
        if (endcn == NULL)  endcn = strchr(name, '(');
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
        if (endcn == NULL)  endcn = name + strlen(name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
        while (endcn > name && endcn[-1] != '.' && endcn[-1] != '/')
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
          --endcn;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
        st->print(" %s", endcn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
        printed = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
    if (!printed)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
      _method->print_short_name(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
    st->print(" @ bci:%d",_bci);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
    st->print(" runtime stub");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
  if (caller() != NULL)  caller()->dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   490
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
void JVMState::dump_on(outputStream* st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
  if (_map && !((uintptr_t)_map & 1)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
    if (_map->len() > _map->req()) {  // _map->has_exceptions()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
      Node* ex = _map->in(_map->req());  // _map->next_exception()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
      // skip the first one; it's already being printed
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
      while (ex != NULL && ex->len() > ex->req()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
        ex = ex->in(ex->req());  // ex->next_exception()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
        ex->dump(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
    _map->dump(2);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  }
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   503
  st->print("JVMS depth=%d loc=%d stk=%d mon=%d scalar=%d end=%d mondepth=%d sp=%d bci=%d method=",
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   504
             depth(), locoff(), stkoff(), monoff(), scloff(), endoff(), monitor_depth(), sp(), bci());
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
  if (_method == NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
    st->print_cr("(none)");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
    _method->print_name(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
    st->cr();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
    if (bci() >= 0 && bci() < _method->code_size()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
      st->print("    bc: ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
      _method->print_codes_on(bci(), bci()+1, st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
  if (caller() != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
    caller()->dump_on(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
// Extra way to dump a jvms from the debugger,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
// to avoid a bug with C++ member function calls.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
void dump_jvms(JVMState* jvms) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
  jvms->dump();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
//--------------------------clone_shallow--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
JVMState* JVMState::clone_shallow(Compile* C) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
  JVMState* n = has_method() ? new (C) JVMState(_method, _caller) : new (C) JVMState(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  n->set_bci(_bci);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  n->set_locoff(_locoff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
  n->set_stkoff(_stkoff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  n->set_monoff(_monoff);
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   534
  n->set_scloff(_scloff);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   535
  n->set_endoff(_endoff);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   536
  n->set_sp(_sp);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  n->set_map(_map);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
//---------------------------clone_deep----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
JVMState* JVMState::clone_deep(Compile* C) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   543
  JVMState* n = clone_shallow(C);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   544
  for (JVMState* p = n; p->_caller != NULL; p = p->_caller) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   545
    p->_caller = p->_caller->clone_shallow(C);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   546
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   547
  assert(n->depth() == depth(), "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   548
  assert(n->debug_depth() == debug_depth(), "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   549
  return n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   550
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   551
489c9b5090e2 Initial load
duke
parents:
diff changeset
   552
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   553
uint CallNode::cmp( const Node &n ) const
489c9b5090e2 Initial load
duke
parents:
diff changeset
   554
{ return _tf == ((CallNode&)n)._tf && _jvms == ((CallNode&)n)._jvms; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   555
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   556
void CallNode::dump_req() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   557
  // Dump the required inputs, enclosed in '(' and ')'
489c9b5090e2 Initial load
duke
parents:
diff changeset
   558
  uint i;                       // Exit value of loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   559
  for( i=0; i<req(); i++ ) {    // For all required inputs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   560
    if( i == TypeFunc::Parms ) tty->print("(");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   561
    if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   562
    else tty->print("_ ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   563
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   564
  tty->print(")");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   565
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   566
489c9b5090e2 Initial load
duke
parents:
diff changeset
   567
void CallNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   568
  st->print(" ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   569
  tf()->dump_on(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   570
  if (_cnt != COUNT_UNKNOWN)  st->print(" C=%f",_cnt);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   571
  if (jvms() != NULL)  jvms()->dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   572
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   573
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   574
489c9b5090e2 Initial load
duke
parents:
diff changeset
   575
const Type *CallNode::bottom_type() const { return tf()->range(); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   576
const Type *CallNode::Value(PhaseTransform *phase) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   577
  if (phase->type(in(0)) == Type::TOP)  return Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   578
  return tf()->range();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   579
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   580
489c9b5090e2 Initial load
duke
parents:
diff changeset
   581
//------------------------------calling_convention-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   582
void CallNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   583
  // Use the standard compiler calling convention
489c9b5090e2 Initial load
duke
parents:
diff changeset
   584
  Matcher::calling_convention( sig_bt, parm_regs, argcnt, true );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   585
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   586
489c9b5090e2 Initial load
duke
parents:
diff changeset
   587
489c9b5090e2 Initial load
duke
parents:
diff changeset
   588
//------------------------------match------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   589
// Construct projections for control, I/O, memory-fields, ..., and
489c9b5090e2 Initial load
duke
parents:
diff changeset
   590
// return result(s) along with their RegMask info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   591
Node *CallNode::match( const ProjNode *proj, const Matcher *match ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   592
  switch (proj->_con) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   593
  case TypeFunc::Control:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   594
  case TypeFunc::I_O:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   595
  case TypeFunc::Memory:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   596
    return new (match->C, 1) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   597
489c9b5090e2 Initial load
duke
parents:
diff changeset
   598
  case TypeFunc::Parms+1:       // For LONG & DOUBLE returns
489c9b5090e2 Initial load
duke
parents:
diff changeset
   599
    assert(tf()->_range->field_at(TypeFunc::Parms+1) == Type::HALF, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   600
    // 2nd half of doubles and longs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   601
    return new (match->C, 1) MachProjNode(this,proj->_con, RegMask::Empty, (uint)OptoReg::Bad);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   602
489c9b5090e2 Initial load
duke
parents:
diff changeset
   603
  case TypeFunc::Parms: {       // Normal returns
489c9b5090e2 Initial load
duke
parents:
diff changeset
   604
    uint ideal_reg = Matcher::base2reg[tf()->range()->field_at(TypeFunc::Parms)->base()];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   605
    OptoRegPair regs = is_CallRuntime()
489c9b5090e2 Initial load
duke
parents:
diff changeset
   606
      ? match->c_return_value(ideal_reg,true)  // Calls into C runtime
489c9b5090e2 Initial load
duke
parents:
diff changeset
   607
      : match->  return_value(ideal_reg,true); // Calls into compiled Java code
489c9b5090e2 Initial load
duke
parents:
diff changeset
   608
    RegMask rm = RegMask(regs.first());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   609
    if( OptoReg::is_valid(regs.second()) )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   610
      rm.Insert( regs.second() );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   611
    return new (match->C, 1) MachProjNode(this,proj->_con,rm,ideal_reg);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   612
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   613
489c9b5090e2 Initial load
duke
parents:
diff changeset
   614
  case TypeFunc::ReturnAdr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   615
  case TypeFunc::FramePtr:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   616
  default:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   617
    ShouldNotReachHere();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   618
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   619
  return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   620
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   621
489c9b5090e2 Initial load
duke
parents:
diff changeset
   622
// Do we Match on this edge index or not?  Match no edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   623
uint CallNode::match_edge(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   624
  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   625
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   626
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   627
//
247
2aeab9ac7fea 6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents: 239
diff changeset
   628
// Determine whether the call could modify the field of the specified
2aeab9ac7fea 6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents: 239
diff changeset
   629
// instance at the specified offset.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   630
//
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   631
bool CallNode::may_modify(const TypePtr *addr_t, PhaseTransform *phase) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   632
  const TypeOopPtr *adrInst_t  = addr_t->isa_oopptr();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   633
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 781
diff changeset
   634
  // If not an OopPtr or not an instance type, assume the worst.
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 781
diff changeset
   635
  // Note: currently this method is called only for instance types.
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 781
diff changeset
   636
  if (adrInst_t == NULL || !adrInst_t->is_known_instance()) {
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   637
    return true;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   638
  }
955
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 781
diff changeset
   639
  // The instance_id is set only for scalar-replaceable allocations which
723d7b577fba 6723160: Nightly failure: Error: meet not symmetric
kvn
parents: 781
diff changeset
   640
  // are not passed as arguments according to Escape Analysis.
238
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   641
  return false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   642
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   643
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   644
// Does this call have a direct reference to n other than debug information?
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   645
bool CallNode::has_non_debug_use(Node *n) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   646
  const TypeTuple * d = tf()->domain();
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   647
  for (uint i = TypeFunc::Parms; i < d->cnt(); i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   648
    Node *arg = in(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   649
    if (arg == n) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   650
      return true;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   651
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   652
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   653
  return false;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   654
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   655
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   656
// Returns the unique CheckCastPP of a call
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   657
// or 'this' if there are several CheckCastPP
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   658
// or returns NULL if there is no one.
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   659
Node *CallNode::result_cast() {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   660
  Node *cast = NULL;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   661
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   662
  Node *p = proj_out(TypeFunc::Parms);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   663
  if (p == NULL)
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   664
    return NULL;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   665
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   666
  for (DUIterator_Fast imax, i = p->fast_outs(imax); i < imax; i++) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   667
    Node *use = p->fast_out(i);
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   668
    if (use->is_CheckCastPP()) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   669
      if (cast != NULL) {
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   670
        return this;  // more than 1 CheckCastPP
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   671
      }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   672
      cast = use;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   673
    }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   674
  }
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   675
  return cast;
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   676
}
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   677
803c80713999 6674588: (Escape Analysis) Improve Escape Analysis code
kvn
parents: 236
diff changeset
   678
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   679
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   680
uint CallJavaNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   681
uint CallJavaNode::cmp( const Node &n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   682
  CallJavaNode &call = (CallJavaNode&)n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   683
  return CallNode::cmp(call) && _method == call._method;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   684
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   685
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   686
void CallJavaNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   687
  if( _method ) _method->print_short_name(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   688
  CallNode::dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   689
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   690
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   691
489c9b5090e2 Initial load
duke
parents:
diff changeset
   692
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   693
uint CallStaticJavaNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   694
uint CallStaticJavaNode::cmp( const Node &n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   695
  CallStaticJavaNode &call = (CallStaticJavaNode&)n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   696
  return CallJavaNode::cmp(call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   697
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   698
489c9b5090e2 Initial load
duke
parents:
diff changeset
   699
//----------------------------uncommon_trap_request----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   700
// If this is an uncommon trap, return the request code, else zero.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   701
int CallStaticJavaNode::uncommon_trap_request() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   702
  if (_name != NULL && !strcmp(_name, "uncommon_trap")) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   703
    return extract_uncommon_trap_request(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   704
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   705
  return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   706
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   707
int CallStaticJavaNode::extract_uncommon_trap_request(const Node* call) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   708
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   709
  if (!(call->req() > TypeFunc::Parms &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   710
        call->in(TypeFunc::Parms) != NULL &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
   711
        call->in(TypeFunc::Parms)->is_Con())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   712
    assert(_in_dump_cnt != 0, "OK if dumping");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   713
    tty->print("[bad uncommon trap]");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   714
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   715
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   716
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   717
  return call->in(TypeFunc::Parms)->bottom_type()->is_int()->get_con();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   718
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   719
489c9b5090e2 Initial load
duke
parents:
diff changeset
   720
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   721
void CallStaticJavaNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   722
  st->print("# Static ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   723
  if (_name != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   724
    st->print("%s", _name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   725
    int trap_req = uncommon_trap_request();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   726
    if (trap_req != 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   727
      char buf[100];
489c9b5090e2 Initial load
duke
parents:
diff changeset
   728
      st->print("(%s)",
489c9b5090e2 Initial load
duke
parents:
diff changeset
   729
                 Deoptimization::format_trap_request(buf, sizeof(buf),
489c9b5090e2 Initial load
duke
parents:
diff changeset
   730
                                                     trap_req));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   731
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   732
    st->print(" ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   733
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   734
  CallJavaNode::dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   735
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   736
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   737
489c9b5090e2 Initial load
duke
parents:
diff changeset
   738
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   739
uint CallDynamicJavaNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   740
uint CallDynamicJavaNode::cmp( const Node &n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   741
  CallDynamicJavaNode &call = (CallDynamicJavaNode&)n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   742
  return CallJavaNode::cmp(call);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   743
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   744
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   745
void CallDynamicJavaNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   746
  st->print("# Dynamic ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   747
  CallJavaNode::dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   748
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   749
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   750
489c9b5090e2 Initial load
duke
parents:
diff changeset
   751
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   752
uint CallRuntimeNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   753
uint CallRuntimeNode::cmp( const Node &n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   754
  CallRuntimeNode &call = (CallRuntimeNode&)n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   755
  return CallNode::cmp(call) && !strcmp(_name,call._name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   756
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   757
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   758
void CallRuntimeNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   759
  st->print("# ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   760
  st->print(_name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   761
  CallNode::dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   762
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   763
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   764
489c9b5090e2 Initial load
duke
parents:
diff changeset
   765
//------------------------------calling_convention-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   766
void CallRuntimeNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   767
  Matcher::c_calling_convention( sig_bt, parm_regs, argcnt );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   768
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   769
489c9b5090e2 Initial load
duke
parents:
diff changeset
   770
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   771
//------------------------------calling_convention-----------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   772
489c9b5090e2 Initial load
duke
parents:
diff changeset
   773
489c9b5090e2 Initial load
duke
parents:
diff changeset
   774
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   775
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   776
void CallLeafNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   777
  st->print("# ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   778
  st->print(_name);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   779
  CallNode::dump_spec(st);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   780
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   781
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   782
489c9b5090e2 Initial load
duke
parents:
diff changeset
   783
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
   784
489c9b5090e2 Initial load
duke
parents:
diff changeset
   785
void SafePointNode::set_local(JVMState* jvms, uint idx, Node *c) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   786
  assert(verify_jvms(jvms), "jvms must match");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   787
  int loc = jvms->locoff() + idx;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   788
  if (in(loc)->is_top() && idx > 0 && !c->is_top() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   789
    // If current local idx is top then local idx - 1 could
489c9b5090e2 Initial load
duke
parents:
diff changeset
   790
    // be a long/double that needs to be killed since top could
489c9b5090e2 Initial load
duke
parents:
diff changeset
   791
    // represent the 2nd half ofthe long/double.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   792
    uint ideal = in(loc -1)->ideal_reg();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   793
    if (ideal == Op_RegD || ideal == Op_RegL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   794
      // set other (low index) half to top
489c9b5090e2 Initial load
duke
parents:
diff changeset
   795
      set_req(loc - 1, in(loc));
489c9b5090e2 Initial load
duke
parents:
diff changeset
   796
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   797
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   798
  set_req(loc, c);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   799
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   800
489c9b5090e2 Initial load
duke
parents:
diff changeset
   801
uint SafePointNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   802
uint SafePointNode::cmp( const Node &n ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   803
  return (&n == this);          // Always fail except on self
489c9b5090e2 Initial load
duke
parents:
diff changeset
   804
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   805
489c9b5090e2 Initial load
duke
parents:
diff changeset
   806
//-------------------------set_next_exception----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   807
void SafePointNode::set_next_exception(SafePointNode* n) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   808
  assert(n == NULL || n->Opcode() == Op_SafePoint, "correct value for next_exception");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   809
  if (len() == req()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   810
    if (n != NULL)  add_prec(n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   811
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   812
    set_prec(req(), n);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   813
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   814
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   815
489c9b5090e2 Initial load
duke
parents:
diff changeset
   816
489c9b5090e2 Initial load
duke
parents:
diff changeset
   817
//----------------------------next_exception-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   818
SafePointNode* SafePointNode::next_exception() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   819
  if (len() == req()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   820
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   821
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   822
    Node* n = in(req());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   823
    assert(n == NULL || n->Opcode() == Op_SafePoint, "no other uses of prec edges");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   824
    return (SafePointNode*) n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   825
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   826
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   827
489c9b5090e2 Initial load
duke
parents:
diff changeset
   828
489c9b5090e2 Initial load
duke
parents:
diff changeset
   829
//------------------------------Ideal------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   830
// Skip over any collapsed Regions
489c9b5090e2 Initial load
duke
parents:
diff changeset
   831
Node *SafePointNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1067
f82e0a8cd438 6736417: Fastdebug C2 crashes in StoreBNode::Ideal
kvn
parents: 955
diff changeset
   832
  return remove_dead_region(phase, can_reshape) ? this : NULL;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   833
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   834
489c9b5090e2 Initial load
duke
parents:
diff changeset
   835
//------------------------------Identity---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   836
// Remove obviously duplicate safepoints
489c9b5090e2 Initial load
duke
parents:
diff changeset
   837
Node *SafePointNode::Identity( PhaseTransform *phase ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   838
489c9b5090e2 Initial load
duke
parents:
diff changeset
   839
  // If you have back to back safepoints, remove one
489c9b5090e2 Initial load
duke
parents:
diff changeset
   840
  if( in(TypeFunc::Control)->is_SafePoint() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   841
    return in(TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   842
489c9b5090e2 Initial load
duke
parents:
diff changeset
   843
  if( in(0)->is_Proj() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   844
    Node *n0 = in(0)->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   845
    // Check if he is a call projection (except Leaf Call)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   846
    if( n0->is_Catch() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   847
      n0 = n0->in(0)->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   848
      assert( n0->is_Call(), "expect a call here" );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   849
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   850
    if( n0->is_Call() && n0->as_Call()->guaranteed_safepoint() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   851
      // Useless Safepoint, so remove it
489c9b5090e2 Initial load
duke
parents:
diff changeset
   852
      return in(TypeFunc::Control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   853
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   854
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   855
489c9b5090e2 Initial load
duke
parents:
diff changeset
   856
  return this;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   857
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   858
489c9b5090e2 Initial load
duke
parents:
diff changeset
   859
//------------------------------Value------------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   860
const Type *SafePointNode::Value( PhaseTransform *phase ) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   861
  if( phase->type(in(0)) == Type::TOP ) return Type::TOP;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   862
  if( phase->eqv( in(0), this ) ) return Type::TOP; // Dead infinite loop
489c9b5090e2 Initial load
duke
parents:
diff changeset
   863
  return Type::CONTROL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   864
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   865
489c9b5090e2 Initial load
duke
parents:
diff changeset
   866
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   867
void SafePointNode::dump_spec(outputStream *st) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   868
  st->print(" SafePoint ");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   869
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   870
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   871
489c9b5090e2 Initial load
duke
parents:
diff changeset
   872
const RegMask &SafePointNode::in_RegMask(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   873
  if( idx < TypeFunc::Parms ) return RegMask::Empty;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   874
  // Values outside the domain represent debug info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   875
  return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   876
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   877
const RegMask &SafePointNode::out_RegMask() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   878
  return RegMask::Empty;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   879
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   880
489c9b5090e2 Initial load
duke
parents:
diff changeset
   881
489c9b5090e2 Initial load
duke
parents:
diff changeset
   882
void SafePointNode::grow_stack(JVMState* jvms, uint grow_by) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   883
  assert((int)grow_by > 0, "sanity");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   884
  int monoff = jvms->monoff();
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   885
  int scloff = jvms->scloff();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   886
  int endoff = jvms->endoff();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   887
  assert(endoff == (int)req(), "no other states or debug info after me");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   888
  Node* top = Compile::current()->top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   889
  for (uint i = 0; i < grow_by; i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   890
    ins_req(monoff, top);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   891
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   892
  jvms->set_monoff(monoff + grow_by);
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   893
  jvms->set_scloff(scloff + grow_by);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   894
  jvms->set_endoff(endoff + grow_by);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   895
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   896
489c9b5090e2 Initial load
duke
parents:
diff changeset
   897
void SafePointNode::push_monitor(const FastLockNode *lock) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   898
  // Add a LockNode, which points to both the original BoxLockNode (the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   899
  // stack space for the monitor) and the Object being locked.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   900
  const int MonitorEdges = 2;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   901
  assert(JVMState::logMonitorEdges == exact_log2(MonitorEdges), "correct MonitorEdges");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   902
  assert(req() == jvms()->endoff(), "correct sizing");
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   903
  int nextmon = jvms()->scloff();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   904
  if (GenerateSynchronizationCode) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   905
    add_req(lock->box_node());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   906
    add_req(lock->obj_node());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   907
  } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   908
    add_req(NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   909
    add_req(NULL);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   910
  }
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   911
  jvms()->set_scloff(nextmon+MonitorEdges);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   912
  jvms()->set_endoff(req());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   913
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   914
489c9b5090e2 Initial load
duke
parents:
diff changeset
   915
void SafePointNode::pop_monitor() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   916
  // Delete last monitor from debug info
489c9b5090e2 Initial load
duke
parents:
diff changeset
   917
  debug_only(int num_before_pop = jvms()->nof_monitors());
489c9b5090e2 Initial load
duke
parents:
diff changeset
   918
  const int MonitorEdges = (1<<JVMState::logMonitorEdges);
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   919
  int scloff = jvms()->scloff();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   920
  int endoff = jvms()->endoff();
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   921
  int new_scloff = scloff - MonitorEdges;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   922
  int new_endoff = endoff - MonitorEdges;
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   923
  jvms()->set_scloff(new_scloff);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   924
  jvms()->set_endoff(new_endoff);
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   925
  while (scloff > new_scloff)  del_req(--scloff);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   926
  assert(jvms()->nof_monitors() == num_before_pop-1, "");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   927
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   928
489c9b5090e2 Initial load
duke
parents:
diff changeset
   929
Node *SafePointNode::peek_monitor_box() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   930
  int mon = jvms()->nof_monitors() - 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   931
  assert(mon >= 0, "most have a monitor");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   932
  return monitor_box(jvms(), mon);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   933
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   934
489c9b5090e2 Initial load
duke
parents:
diff changeset
   935
Node *SafePointNode::peek_monitor_obj() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   936
  int mon = jvms()->nof_monitors() - 1;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   937
  assert(mon >= 0, "most have a monitor");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   938
  return monitor_obj(jvms(), mon);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   939
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   940
489c9b5090e2 Initial load
duke
parents:
diff changeset
   941
// Do we Match on this edge index or not?  Match no edges
489c9b5090e2 Initial load
duke
parents:
diff changeset
   942
uint SafePointNode::match_edge(uint idx) const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   943
  if( !needs_polling_address_input() )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   944
    return 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   945
489c9b5090e2 Initial load
duke
parents:
diff changeset
   946
  return (TypeFunc::Parms == idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   947
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   948
236
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   949
//==============  SafePointScalarObjectNode  ==============
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   950
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   951
SafePointScalarObjectNode::SafePointScalarObjectNode(const TypeOopPtr* tp,
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   952
#ifdef ASSERT
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   953
                                                     AllocateNode* alloc,
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   954
#endif
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   955
                                                     uint first_index,
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   956
                                                     uint n_fields) :
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   957
  TypeNode(tp, 1), // 1 control input -- seems required.  Get from root.
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   958
#ifdef ASSERT
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   959
  _alloc(alloc),
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   960
#endif
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   961
  _first_index(first_index),
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   962
  _n_fields(n_fields)
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   963
{
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   964
  init_class_id(Class_SafePointScalarObject);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   965
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   966
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   967
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   968
uint SafePointScalarObjectNode::ideal_reg() const {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   969
  return 0; // No matching to machine instruction
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   970
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   971
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   972
const RegMask &SafePointScalarObjectNode::in_RegMask(uint idx) const {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   973
  return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   974
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   975
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   976
const RegMask &SafePointScalarObjectNode::out_RegMask() const {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   977
  return RegMask::Empty;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   978
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   979
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   980
uint SafePointScalarObjectNode::match_edge(uint idx) const {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   981
  return 0;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   982
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   983
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   984
SafePointScalarObjectNode*
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   985
SafePointScalarObjectNode::clone(int jvms_adj, Dict* sosn_map) const {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   986
  void* cached = (*sosn_map)[(void*)this];
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   987
  if (cached != NULL) {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   988
    return (SafePointScalarObjectNode*)cached;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   989
  }
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   990
  Compile* C = Compile::current();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   991
  SafePointScalarObjectNode* res = (SafePointScalarObjectNode*)Node::clone();
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   992
  res->_first_index += jvms_adj;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   993
  sosn_map->Insert((void*)this, (void*)res);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   994
  return res;
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   995
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   996
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   997
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   998
#ifndef PRODUCT
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
   999
void SafePointScalarObjectNode::dump_spec(outputStream *st) const {
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
  1000
  st->print(" # fields@[%d..%d]", first_index(),
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
  1001
             first_index() + n_fields() - 1);
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
  1002
}
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
  1003
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
  1004
#endif
9a04268c8eea 6671807: (Escape Analysis) Add new ideal node to represent the state of a scalarized object at a safepoint
kvn
parents: 212
diff changeset
  1005
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1006
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1007
uint AllocateNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1008
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1009
AllocateNode::AllocateNode(Compile* C, const TypeFunc *atype,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1010
                           Node *ctrl, Node *mem, Node *abio,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1011
                           Node *size, Node *klass_node, Node *initial_test)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1012
  : CallNode(atype, NULL, TypeRawPtr::BOTTOM)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1013
{
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1014
  init_class_id(Class_Allocate);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1015
  init_flags(Flag_is_macro);
212
cd4963e67949 6667612: (Escape Analysis) disable loop cloning if it has a scalar replaceable allocation
kvn
parents: 1
diff changeset
  1016
  _is_scalar_replaceable = false;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1017
  Node *topnode = C->top();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1018
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1019
  init_req( TypeFunc::Control  , ctrl );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1020
  init_req( TypeFunc::I_O      , abio );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1021
  init_req( TypeFunc::Memory   , mem );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1022
  init_req( TypeFunc::ReturnAdr, topnode );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1023
  init_req( TypeFunc::FramePtr , topnode );
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1024
  init_req( AllocSize          , size);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1025
  init_req( KlassNode          , klass_node);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1026
  init_req( InitialTest        , initial_test);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1027
  init_req( ALength            , topnode);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1028
  C->add_macro_node(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1029
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1030
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1031
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1032
uint AllocateArrayNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1033
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1034
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1035
uint LockNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1036
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1037
// Redundant lock elimination
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1038
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1039
// There are various patterns of locking where we release and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1040
// immediately reacquire a lock in a piece of code where no operations
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1041
// occur in between that would be observable.  In those cases we can
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1042
// skip releasing and reacquiring the lock without violating any
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1043
// fairness requirements.  Doing this around a loop could cause a lock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1044
// to be held for a very long time so we concentrate on non-looping
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1045
// control flow.  We also require that the operations are fully
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1046
// redundant meaning that we don't introduce new lock operations on
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1047
// some paths so to be able to eliminate it on others ala PRE.  This
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1048
// would probably require some more extensive graph manipulation to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1049
// guarantee that the memory edges were all handled correctly.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1050
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1051
// Assuming p is a simple predicate which can't trap in any way and s
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1052
// is a synchronized method consider this code:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1053
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1054
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1055
//   if (p)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1056
//     s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1057
//   else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1058
//     s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1059
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1060
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1061
// 1. The unlocks of the first call to s can be eliminated if the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1062
// locks inside the then and else branches are eliminated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1063
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1064
// 2. The unlocks of the then and else branches can be eliminated if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1065
// the lock of the final call to s is eliminated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1066
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1067
// Either of these cases subsumes the simple case of sequential control flow
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1068
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1069
// Addtionally we can eliminate versions without the else case:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1070
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1071
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1072
//   if (p)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1073
//     s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1074
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1075
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1076
// 3. In this case we eliminate the unlock of the first s, the lock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1077
// and unlock in the then case and the lock in the final s.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1078
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1079
// Note also that in all these cases the then/else pieces don't have
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1080
// to be trivial as long as they begin and end with synchronization
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1081
// operations.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1082
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1083
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1084
//   if (p)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1085
//     s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1086
//     f();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1087
//     s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1088
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1089
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1090
// The code will work properly for this case, leaving in the unlock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1091
// before the call to f and the relock after it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1092
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1093
// A potentially interesting case which isn't handled here is when the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1094
// locking is partially redundant.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1095
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1096
//   s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1097
//   if (p)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1098
//     s();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1099
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1100
// This could be eliminated putting unlocking on the else case and
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1101
// eliminating the first unlock and the lock in the then side.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1102
// Alternatively the unlock could be moved out of the then side so it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1103
// was after the merge and the first unlock and second lock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1104
// eliminated.  This might require less manipulation of the memory
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1105
// state to get correct.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1106
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1107
// Additionally we might allow work between a unlock and lock before
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1108
// giving up eliminating the locks.  The current code disallows any
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1109
// conditional control flow between these operations.  A formulation
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1110
// similar to partial redundancy elimination computing the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1111
// availability of unlocking and the anticipatability of locking at a
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1112
// program point would allow detection of fully redundant locking with
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1113
// some amount of work in between.  I'm not sure how often I really
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1114
// think that would occur though.  Most of the cases I've seen
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1115
// indicate it's likely non-trivial work would occur in between.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1116
// There may be other more complicated constructs where we could
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1117
// eliminate locking but I haven't seen any others appear as hot or
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1118
// interesting.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1119
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1120
// Locking and unlocking have a canonical form in ideal that looks
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1121
// roughly like this:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1122
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1123
//              <obj>
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1124
//                | \\------+
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1125
//                |  \       \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1126
//                | BoxLock   \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1127
//                |  |   |     \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1128
//                |  |    \     \
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1129
//                |  |   FastLock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1130
//                |  |   /
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1131
//                |  |  /
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1132
//                |  |  |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1133
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1134
//               Lock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1135
//                |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1136
//            Proj #0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1137
//                |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1138
//            MembarAcquire
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1139
//                |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1140
//            Proj #0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1141
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1142
//            MembarRelease
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1143
//                |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1144
//            Proj #0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1145
//                |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1146
//              Unlock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1147
//                |
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1148
//            Proj #0
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1149
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1150
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1151
// This code proceeds by processing Lock nodes during PhaseIterGVN
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1152
// and searching back through its control for the proper code
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1153
// patterns.  Once it finds a set of lock and unlock operations to
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1154
// eliminate they are marked as eliminatable which causes the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1155
// expansion of the Lock and Unlock macro nodes to make the operation a NOP
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1156
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1157
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1158
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1159
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1160
// Utility function to skip over uninteresting control nodes.  Nodes skipped are:
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1161
//   - copy regions.  (These may not have been optimized away yet.)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1162
//   - eliminated locking nodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1163
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1164
static Node *next_control(Node *ctrl) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1165
  if (ctrl == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1166
    return NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1167
  while (1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1168
    if (ctrl->is_Region()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1169
      RegionNode *r = ctrl->as_Region();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1170
      Node *n = r->is_copy();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1171
      if (n == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1172
        break;  // hit a region, return it
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1173
      else
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1174
        ctrl = n;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1175
    } else if (ctrl->is_Proj()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1176
      Node *in0 = ctrl->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1177
      if (in0->is_AbstractLock() && in0->as_AbstractLock()->is_eliminated()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1178
        ctrl = in0->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1179
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1180
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1181
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1182
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1183
      break; // found an interesting control
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1184
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1185
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1186
  return ctrl;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1187
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1188
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1189
// Given a control, see if it's the control projection of an Unlock which
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1190
// operating on the same object as lock.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1191
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1192
bool AbstractLockNode::find_matching_unlock(const Node* ctrl, LockNode* lock,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1193
                                            GrowableArray<AbstractLockNode*> &lock_ops) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1194
  ProjNode *ctrl_proj = (ctrl->is_Proj()) ? ctrl->as_Proj() : NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1195
  if (ctrl_proj != NULL && ctrl_proj->_con == TypeFunc::Control) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1196
    Node *n = ctrl_proj->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1197
    if (n != NULL && n->is_Unlock()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1198
      UnlockNode *unlock = n->as_Unlock();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1199
      if ((lock->obj_node() == unlock->obj_node()) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1200
          (lock->box_node() == unlock->box_node()) && !unlock->is_eliminated()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1201
        lock_ops.append(unlock);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1202
        return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1203
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1204
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1205
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1206
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1207
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1208
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1209
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1210
// Find the lock matching an unlock.  Returns null if a safepoint
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1211
// or complicated control is encountered first.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1212
LockNode *AbstractLockNode::find_matching_lock(UnlockNode* unlock) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1213
  LockNode *lock_result = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1214
  // find the matching lock, or an intervening safepoint
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1215
  Node *ctrl = next_control(unlock->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1216
  while (1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1217
    assert(ctrl != NULL, "invalid control graph");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1218
    assert(!ctrl->is_Start(), "missing lock for unlock");
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1219
    if (ctrl->is_top()) break;  // dead control path
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1220
    if (ctrl->is_Proj()) ctrl = ctrl->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1221
    if (ctrl->is_SafePoint()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1222
        break;  // found a safepoint (may be the lock we are searching for)
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1223
    } else if (ctrl->is_Region()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1224
      // Check for a simple diamond pattern.  Punt on anything more complicated
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1225
      if (ctrl->req() == 3 && ctrl->in(1) != NULL && ctrl->in(2) != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1226
        Node *in1 = next_control(ctrl->in(1));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1227
        Node *in2 = next_control(ctrl->in(2));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1228
        if (((in1->is_IfTrue() && in2->is_IfFalse()) ||
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1229
             (in2->is_IfTrue() && in1->is_IfFalse())) && (in1->in(0) == in2->in(0))) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1230
          ctrl = next_control(in1->in(0)->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1231
        } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1232
          break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1233
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1234
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1235
        break;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1236
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1237
    } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1238
      ctrl = next_control(ctrl->in(0));  // keep searching
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1239
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1240
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1241
  if (ctrl->is_Lock()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1242
    LockNode *lock = ctrl->as_Lock();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1243
    if ((lock->obj_node() == unlock->obj_node()) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1244
            (lock->box_node() == unlock->box_node())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1245
      lock_result = lock;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1246
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1247
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1248
  return lock_result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1249
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1250
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1251
// This code corresponds to case 3 above.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1252
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1253
bool AbstractLockNode::find_lock_and_unlock_through_if(Node* node, LockNode* lock,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1254
                                                       GrowableArray<AbstractLockNode*> &lock_ops) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1255
  Node* if_node = node->in(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1256
  bool  if_true = node->is_IfTrue();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1257
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1258
  if (if_node->is_If() && if_node->outcnt() == 2 && (if_true || node->is_IfFalse())) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1259
    Node *lock_ctrl = next_control(if_node->in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1260
    if (find_matching_unlock(lock_ctrl, lock, lock_ops)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1261
      Node* lock1_node = NULL;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1262
      ProjNode* proj = if_node->as_If()->proj_out(!if_true);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1263
      if (if_true) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1264
        if (proj->is_IfFalse() && proj->outcnt() == 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1265
          lock1_node = proj->unique_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1266
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1267
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1268
        if (proj->is_IfTrue() && proj->outcnt() == 1) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1269
          lock1_node = proj->unique_out();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1270
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1271
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1272
      if (lock1_node != NULL && lock1_node->is_Lock()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1273
        LockNode *lock1 = lock1_node->as_Lock();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1274
        if ((lock->obj_node() == lock1->obj_node()) &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1275
            (lock->box_node() == lock1->box_node()) && !lock1->is_eliminated()) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1276
          lock_ops.append(lock1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1277
          return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1278
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1279
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1280
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1281
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1282
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1283
  lock_ops.trunc_to(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1284
  return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1285
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1286
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1287
bool AbstractLockNode::find_unlocks_for_region(const RegionNode* region, LockNode* lock,
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1288
                               GrowableArray<AbstractLockNode*> &lock_ops) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1289
  // check each control merging at this point for a matching unlock.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1290
  // in(0) should be self edge so skip it.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1291
  for (int i = 1; i < (int)region->req(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1292
    Node *in_node = next_control(region->in(i));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1293
    if (in_node != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1294
      if (find_matching_unlock(in_node, lock, lock_ops)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1295
        // found a match so keep on checking.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1296
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1297
      } else if (find_lock_and_unlock_through_if(in_node, lock, lock_ops)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1298
        continue;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1299
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1300
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1301
      // If we fall through to here then it was some kind of node we
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1302
      // don't understand or there wasn't a matching unlock, so give
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1303
      // up trying to merge locks.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1304
      lock_ops.trunc_to(0);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1305
      return false;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1306
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1307
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1308
  return true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1309
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1310
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1311
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1312
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1313
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1314
// Create a counter which counts the number of times this lock is acquired
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1315
//
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1316
void AbstractLockNode::create_lock_counter(JVMState* state) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1317
  _counter = OptoRuntime::new_named_counter(state, NamedCounter::LockCounter);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1318
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1319
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1320
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1321
void AbstractLockNode::set_eliminated() {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1322
  _eliminate = true;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1323
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1324
  if (_counter) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1325
    // Update the counter to indicate that this lock was eliminated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1326
    // The counter update code will stay around even though the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1327
    // optimizer will eliminate the lock operation itself.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1328
    _counter->set_tag(NamedCounter::EliminatedLockCounter);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1329
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1330
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1331
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1332
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1333
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1334
Node *LockNode::Ideal(PhaseGVN *phase, bool can_reshape) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1335
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1336
  // perform any generic optimizations first (returns 'this' or NULL)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1337
  Node *result = SafePointNode::Ideal(phase, can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1338
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1339
  // Now see if we can optimize away this lock.  We don't actually
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1340
  // remove the locking here, we simply set the _eliminate flag which
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1341
  // prevents macro expansion from expanding the lock.  Since we don't
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1342
  // modify the graph, the value returned from this function is the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1343
  // one computed above.
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1344
  if (result == NULL && can_reshape && EliminateLocks && !is_eliminated()) {
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1345
    //
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1346
    // If we are locking an unescaped object, the lock/unlock is unnecessary
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1347
    //
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1348
    ConnectionGraph *cgr = Compile::current()->congraph();
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1349
    PointsToNode::EscapeState es = PointsToNode::GlobalEscape;
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1350
    if (cgr != NULL)
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1351
      es = cgr->escape_state(obj_node(), phase);
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1352
    if (es != PointsToNode::UnknownEscape && es != PointsToNode::GlobalEscape) {
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1353
      // Mark it eliminated to update any counters
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1354
      this->set_eliminated();
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1355
      return result;
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1356
    }
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1357
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1358
    //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1359
    // Try lock coarsening
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1360
    //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1361
    PhaseIterGVN* iter = phase->is_IterGVN();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1362
    if (iter != NULL) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1363
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1364
      GrowableArray<AbstractLockNode*>   lock_ops;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1365
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1366
      Node *ctrl = next_control(in(0));
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1367
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1368
      // now search back for a matching Unlock
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1369
      if (find_matching_unlock(ctrl, this, lock_ops)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1370
        // found an unlock directly preceding this lock.  This is the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1371
        // case of single unlock directly control dependent on a
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1372
        // single lock which is the trivial version of case 1 or 2.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1373
      } else if (ctrl->is_Region() ) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1374
        if (find_unlocks_for_region(ctrl->as_Region(), this, lock_ops)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1375
        // found lock preceded by multiple unlocks along all paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1376
        // joining at this point which is case 3 in description above.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1377
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1378
      } else {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1379
        // see if this lock comes from either half of an if and the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1380
        // predecessors merges unlocks and the other half of the if
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1381
        // performs a lock.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1382
        if (find_lock_and_unlock_through_if(ctrl, this, lock_ops)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1383
          // found unlock splitting to an if with locks on both branches.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1384
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1385
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1386
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1387
      if (lock_ops.length() > 0) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1388
        // add ourselves to the list of locks to be eliminated.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1389
        lock_ops.append(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1390
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1391
  #ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1392
        if (PrintEliminateLocks) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1393
          int locks = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1394
          int unlocks = 0;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1395
          for (int i = 0; i < lock_ops.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1396
            AbstractLockNode* lock = lock_ops.at(i);
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1397
            if (lock->Opcode() == Op_Lock)
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1398
              locks++;
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1399
            else
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1400
              unlocks++;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1401
            if (Verbose) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1402
              lock->dump(1);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1403
            }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1404
          }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1405
          tty->print_cr("***Eliminated %d unlocks and %d locks", unlocks, locks);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1406
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1407
  #endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1408
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1409
        // for each of the identified locks, mark them
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1410
        // as eliminatable
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1411
        for (int i = 0; i < lock_ops.length(); i++) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1412
          AbstractLockNode* lock = lock_ops.at(i);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1413
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1414
          // Mark it eliminated to update any counters
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1415
          lock->set_eliminated();
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1416
        }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1417
      } else if (result != NULL && ctrl->is_Region() &&
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1418
                 iter->_worklist.member(ctrl)) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1419
        // We weren't able to find any opportunities but the region this
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1420
        // lock is control dependent on hasn't been processed yet so put
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1421
        // this lock back on the worklist so we can check again once any
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1422
        // region simplification has occurred.
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1423
        iter->_worklist.push(this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1424
      }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1425
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1426
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1427
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1428
  return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1429
}
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1430
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1431
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1432
uint UnlockNode::size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1433
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1434
//=============================================================================
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1435
Node *UnlockNode::Ideal(PhaseGVN *phase, bool can_reshape) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1436
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1437
  // perform any generic optimizations first (returns 'this' or NULL)
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1438
  Node * result = SafePointNode::Ideal(phase, can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1439
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1440
  // Now see if we can optimize away this unlock.  We don't actually
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1441
  // remove the unlocking here, we simply set the _eliminate flag which
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1442
  // prevents macro expansion from expanding the unlock.  Since we don't
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1443
  // modify the graph, the value returned from this function is the
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1444
  // one computed above.
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1445
  // Escape state is defined after Parse phase.
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1446
  if (result == NULL && can_reshape && EliminateLocks && !is_eliminated()) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1447
    //
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1448
    // If we are unlocking an unescaped object, the lock/unlock is unnecessary.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1449
    //
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1450
    ConnectionGraph *cgr = Compile::current()->congraph();
239
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1451
    PointsToNode::EscapeState es = PointsToNode::GlobalEscape;
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1452
    if (cgr != NULL)
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1453
      es = cgr->escape_state(obj_node(), phase);
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1454
    if (es != PointsToNode::UnknownEscape && es != PointsToNode::GlobalEscape) {
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1455
      // Mark it eliminated to update any counters
fb31825d5444 6672848: (Escape Analysis) improve lock elimination with EA
kvn
parents: 238
diff changeset
  1456
      this->set_eliminated();
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1457
    }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1458
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1459
  return result;
489c9b5090e2 Initial load
duke
parents:
diff changeset
  1460
}