hotspot/src/share/vm/opto/cfgnode.hpp
author roland
Thu, 08 Jan 2015 11:00:38 +0100
changeset 28486 b0df113b962e
parent 15113 823590505eb4
child 30183 a6588c0a3259
permissions -rw-r--r--
8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1 Summary: IGVN encounters IfNode with single projection when optimizing dying subgraph Reviewed-by: kvn
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
     1
/*
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
     2
 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. 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
 *
5547
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 1432
diff changeset
    19
 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 1432
diff changeset
    20
 * or visit www.oracle.com if you need additional information or have any
f4b087cbb361 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 1432
diff changeset
    21
 * questions.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    22
 *
489c9b5090e2 Initial load
duke
parents:
diff changeset
    23
 */
489c9b5090e2 Initial load
duke
parents:
diff changeset
    24
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    25
#ifndef SHARE_VM_OPTO_CFGNODE_HPP
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    26
#define SHARE_VM_OPTO_CFGNODE_HPP
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    27
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    28
#include "opto/multnode.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    29
#include "opto/node.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    30
#include "opto/opcodes.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    31
#include "opto/type.hpp"
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
    32
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    33
// Portions of code courtesy of Clifford Click
489c9b5090e2 Initial load
duke
parents:
diff changeset
    34
489c9b5090e2 Initial load
duke
parents:
diff changeset
    35
// Optimization - Graph Style
489c9b5090e2 Initial load
duke
parents:
diff changeset
    36
489c9b5090e2 Initial load
duke
parents:
diff changeset
    37
class Matcher;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    38
class Node;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    39
class   RegionNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    40
class   TypeNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    41
class     PhiNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    42
class   GotoNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    43
class   MultiNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    44
class     MultiBranchNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    45
class       IfNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    46
class       PCTableNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    47
class         JumpNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    48
class         CatchNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    49
class       NeverBranchNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    50
class   ProjNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    51
class     CProjNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    52
class       IfTrueNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    53
class       IfFalseNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    54
class       CatchProjNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    55
class     JProjNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    56
class       JumpProjNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    57
class     SCMemProjNode;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    58
class PhaseIdealLoop;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    59
489c9b5090e2 Initial load
duke
parents:
diff changeset
    60
//------------------------------RegionNode-------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
    61
// The class of RegionNodes, which can be mapped to basic blocks in the
489c9b5090e2 Initial load
duke
parents:
diff changeset
    62
// program.  Their inputs point to Control sources.  PhiNodes (described
489c9b5090e2 Initial load
duke
parents:
diff changeset
    63
// below) have an input point to a RegionNode.  Merged data inputs to PhiNodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
    64
// correspond 1-to-1 with RegionNode inputs.  The zero input of a PhiNode is
489c9b5090e2 Initial load
duke
parents:
diff changeset
    65
// the RegionNode, and the zero input of the RegionNode is itself.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    66
class RegionNode : public Node {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    67
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
    68
  // Node layout (parallels PhiNode):
489c9b5090e2 Initial load
duke
parents:
diff changeset
    69
  enum { Region,                // Generally points to self.
489c9b5090e2 Initial load
duke
parents:
diff changeset
    70
         Control                // Control arcs are [1..len)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    71
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
    72
489c9b5090e2 Initial load
duke
parents:
diff changeset
    73
  RegionNode( uint required ) : Node(required) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    74
    init_class_id(Class_Region);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    75
    init_req(0,this);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    76
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    77
489c9b5090e2 Initial load
duke
parents:
diff changeset
    78
  Node* is_copy() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
    79
    const Node* r = _in[Region];
489c9b5090e2 Initial load
duke
parents:
diff changeset
    80
    if (r == NULL)
489c9b5090e2 Initial load
duke
parents:
diff changeset
    81
      return nonnull_req();
489c9b5090e2 Initial load
duke
parents:
diff changeset
    82
    return NULL;  // not a copy!
489c9b5090e2 Initial load
duke
parents:
diff changeset
    83
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    84
  PhiNode* has_phi() const;        // returns an arbitrary phi user, or NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
    85
  PhiNode* has_unique_phi() const; // returns the unique phi user, or NULL
489c9b5090e2 Initial load
duke
parents:
diff changeset
    86
  // Is this region node unreachable from root?
489c9b5090e2 Initial load
duke
parents:
diff changeset
    87
  bool is_unreachable_region(PhaseGVN *phase) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    88
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    89
  virtual bool pinned() const { return (const Node *)in(0) == this; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    90
  virtual bool  is_CFG   () const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    91
  virtual uint hash() const { return NO_HASH; }  // CFG nodes do not hash
489c9b5090e2 Initial load
duke
parents:
diff changeset
    92
  virtual bool depends_only_on_test() const { return false; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    93
  virtual const Type *bottom_type() const { return Type::CONTROL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
    94
  virtual const Type *Value( PhaseTransform *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
    95
  virtual Node *Identity( PhaseTransform *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
    96
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
    97
  virtual const RegMask &out_RegMask() const;
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 10255
diff changeset
    98
  bool try_clean_mem_phi(PhaseGVN *phase);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
    99
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   100
489c9b5090e2 Initial load
duke
parents:
diff changeset
   101
//------------------------------JProjNode--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   102
// jump projection for node that produces multiple control-flow paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
   103
class JProjNode : public ProjNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   104
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   105
  JProjNode( Node* ctrl, uint idx ) : ProjNode(ctrl,idx) {}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   106
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   107
  virtual bool  is_CFG() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   108
  virtual uint  hash() const { return NO_HASH; }  // CFG nodes do not hash
489c9b5090e2 Initial load
duke
parents:
diff changeset
   109
  virtual const Node* is_block_proj() const { return in(0); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   110
  virtual const RegMask& out_RegMask() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   111
  virtual uint  ideal_reg() const { return 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   112
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   113
489c9b5090e2 Initial load
duke
parents:
diff changeset
   114
//------------------------------PhiNode----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   115
// PhiNodes merge values from different Control paths.  Slot 0 points to the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   116
// controlling RegionNode.  Other slots map 1-for-1 with incoming control flow
489c9b5090e2 Initial load
duke
parents:
diff changeset
   117
// paths to the RegionNode.  For speed reasons (to avoid another pass) we
489c9b5090e2 Initial load
duke
parents:
diff changeset
   118
// can turn PhiNodes into copys in-place by NULL'ing out their RegionNode
489c9b5090e2 Initial load
duke
parents:
diff changeset
   119
// input in slot 0.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   120
class PhiNode : public TypeNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   121
  const TypePtr* const _adr_type; // non-null only for Type::MEMORY nodes.
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   122
  const int _inst_id;     // Instance id of the memory slice.
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   123
  const int _inst_index;  // Alias index of the instance memory slice.
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   124
  // Array elements references have the same alias_idx but different offset.
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   125
  const int _inst_offset; // Offset of the instance memory slice.
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   126
  // Size is bigger to hold the _adr_type field.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   127
  virtual uint hash() const;    // Check the type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   128
  virtual uint cmp( const Node &n ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   129
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   130
489c9b5090e2 Initial load
duke
parents:
diff changeset
   131
  // Determine if CMoveNode::is_cmove_id can be used at this join point.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   132
  Node* is_cmove_id(PhaseTransform* phase, int true_path);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   133
489c9b5090e2 Initial load
duke
parents:
diff changeset
   134
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   135
  // Node layout (parallels RegionNode):
489c9b5090e2 Initial load
duke
parents:
diff changeset
   136
  enum { Region,                // Control input is the Phi's region.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   137
         Input                  // Input values are [1..len)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   138
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   139
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   140
  PhiNode( Node *r, const Type *t, const TypePtr* at = NULL,
769
78e5090c7a20 6716441: error in meet with +DoEscapeAnalysis
kvn
parents: 374
diff changeset
   141
           const int iid = TypeOopPtr::InstanceTop,
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   142
           const int iidx = Compile::AliasIdxTop,
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   143
           const int ioffs = Type::OffsetTop )
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   144
    : TypeNode(t,r->req()),
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   145
      _adr_type(at),
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   146
      _inst_id(iid),
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   147
      _inst_index(iidx),
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   148
      _inst_offset(ioffs)
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   149
  {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   150
    init_class_id(Class_Phi);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   151
    init_req(0, r);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   152
    verify_adr_type();
489c9b5090e2 Initial load
duke
parents:
diff changeset
   153
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   154
  // create a new phi with in edges matching r and set (initially) to x
489c9b5090e2 Initial load
duke
parents:
diff changeset
   155
  static PhiNode* make( Node* r, Node* x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   156
  // extra type arguments override the new phi's bottom_type and adr_type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   157
  static PhiNode* make( Node* r, Node* x, const Type *t, const TypePtr* at = NULL );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   158
  // create a new phi with narrowed memory type
489c9b5090e2 Initial load
duke
parents:
diff changeset
   159
  PhiNode* slice_memory(const TypePtr* adr_type) const;
247
2aeab9ac7fea 6674600: (Escape Analysis) Optimize memory graph for instance's fields
kvn
parents: 237
diff changeset
   160
  PhiNode* split_out_instance(const TypePtr* at, PhaseIterGVN *igvn) const;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   161
  // like make(r, x), but does not initialize the in edges to x
489c9b5090e2 Initial load
duke
parents:
diff changeset
   162
  static PhiNode* make_blank( Node* r, Node* x );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   163
489c9b5090e2 Initial load
duke
parents:
diff changeset
   164
  // Accessors
489c9b5090e2 Initial load
duke
parents:
diff changeset
   165
  RegionNode* region() const { Node* r = in(Region); assert(!r || r->is_Region(), ""); return (RegionNode*)r; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   166
489c9b5090e2 Initial load
duke
parents:
diff changeset
   167
  Node* is_copy() const {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   168
    // The node is a real phi if _in[0] is a Region node.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   169
    DEBUG_ONLY(const Node* r = _in[Region];)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   170
    assert(r != NULL && r->is_Region(), "Not valid control");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   171
    return NULL;  // not a copy!
489c9b5090e2 Initial load
duke
parents:
diff changeset
   172
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   173
1432
44f076e3d2a4 6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents: 781
diff changeset
   174
  bool is_tripcount() const;
44f076e3d2a4 6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
kvn
parents: 781
diff changeset
   175
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   176
  // Determine a unique non-trivial input, if any.
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   177
  // Ignore casts if it helps.  Return NULL on failure.
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   178
  Node* unique_input(PhaseTransform *phase);
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   179
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   180
  // Check for a simple dead loop.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   181
  enum LoopSafety { Safe = 0, Unsafe, UnsafeLoop };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   182
  LoopSafety simple_data_loop_check(Node *in) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   183
  // Is it unsafe data loop? It becomes a dead loop if this phi node removed.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   184
  bool is_unsafe_data_reference(Node *in) const;
15113
823590505eb4 8005071: Incremental inlining for JSR 292
roland
parents: 10255
diff changeset
   185
  int  is_diamond_phi(bool check_control_only = false) const;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   186
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   187
  virtual bool pinned() const { return in(0) != 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   188
  virtual const TypePtr *adr_type() const { verify_adr_type(true); return _adr_type; }
237
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   189
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   190
  const int inst_id()     const { return _inst_id; }
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   191
  const int inst_index()  const { return _inst_index; }
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   192
  const int inst_offset() const { return _inst_offset; }
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   193
  bool is_same_inst_field(const Type* tp, int id, int index, int offset) {
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   194
    return type()->basic_type() == tp->basic_type() &&
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   195
           inst_id()     == id     &&
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   196
           inst_index()  == index  &&
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   197
           inst_offset() == offset &&
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   198
           type()->higher_equal(tp);
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   199
  }
fba97e902303 6673473: (Escape Analysis) Add the instance's field information to PhiNode
kvn
parents: 190
diff changeset
   200
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   201
  virtual const Type *Value( PhaseTransform *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   202
  virtual Node *Identity( PhaseTransform *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   203
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   204
  virtual const RegMask &out_RegMask() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   205
  virtual const RegMask &in_RegMask(uint) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   206
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   207
  virtual void dump_spec(outputStream *st) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   208
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   209
#ifdef ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   210
  void verify_adr_type(VectorSet& visited, const TypePtr* at) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   211
  void verify_adr_type(bool recursive = false) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   212
#else //ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   213
  void verify_adr_type(bool recursive = false) const {}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   214
#endif //ASSERT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   215
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   216
489c9b5090e2 Initial load
duke
parents:
diff changeset
   217
//------------------------------GotoNode---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   218
// GotoNodes perform direct branches.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   219
class GotoNode : public Node {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   220
public:
10255
bab46e6f7661 7069452: Cleanup NodeFlags
kvn
parents: 7397
diff changeset
   221
  GotoNode( Node *control ) : Node(control) {}
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   222
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   223
  virtual bool pinned() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   224
  virtual bool  is_CFG() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   225
  virtual uint hash() const { return NO_HASH; }  // CFG nodes do not hash
489c9b5090e2 Initial load
duke
parents:
diff changeset
   226
  virtual const Node *is_block_proj() const { return this; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   227
  virtual bool depends_only_on_test() const { return false; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   228
  virtual const Type *bottom_type() const { return Type::CONTROL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   229
  virtual const Type *Value( PhaseTransform *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   230
  virtual Node *Identity( PhaseTransform *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   231
  virtual const RegMask &out_RegMask() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   232
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   233
489c9b5090e2 Initial load
duke
parents:
diff changeset
   234
//------------------------------CProjNode--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   235
// control projection for node that produces multiple control-flow paths
489c9b5090e2 Initial load
duke
parents:
diff changeset
   236
class CProjNode : public ProjNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   237
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   238
  CProjNode( Node *ctrl, uint idx ) : ProjNode(ctrl,idx) {}
489c9b5090e2 Initial load
duke
parents:
diff changeset
   239
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   240
  virtual bool  is_CFG() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   241
  virtual uint hash() const { return NO_HASH; }  // CFG nodes do not hash
489c9b5090e2 Initial load
duke
parents:
diff changeset
   242
  virtual const Node *is_block_proj() const { return in(0); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   243
  virtual const RegMask &out_RegMask() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   244
  virtual uint ideal_reg() const { return 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   245
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   246
489c9b5090e2 Initial load
duke
parents:
diff changeset
   247
//---------------------------MultiBranchNode-----------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   248
// This class defines a MultiBranchNode, a MultiNode which yields multiple
489c9b5090e2 Initial load
duke
parents:
diff changeset
   249
// control values. These are distinguished from other types of MultiNodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   250
// which yield multiple values, but control is always and only projection #0.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   251
class MultiBranchNode : public MultiNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   252
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   253
  MultiBranchNode( uint required ) : MultiNode(required) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   254
    init_class_id(Class_MultiBranch);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   255
  }
374
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   256
  // returns required number of users to be well formed.
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   257
  virtual int required_outcnt() const = 0;
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   258
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   259
489c9b5090e2 Initial load
duke
parents:
diff changeset
   260
//------------------------------IfNode-----------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   261
// Output selected Control, based on a boolean test
489c9b5090e2 Initial load
duke
parents:
diff changeset
   262
class IfNode : public MultiBranchNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   263
  // Size is bigger to hold the probability field.  However, _prob does not
489c9b5090e2 Initial load
duke
parents:
diff changeset
   264
  // change the semantics so it does not appear in the hash & cmp functions.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   265
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   266
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   267
489c9b5090e2 Initial load
duke
parents:
diff changeset
   268
  // Degrees of branch prediction probability by order of magnitude:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   269
  // PROB_UNLIKELY_1e(N) is a 1 in 1eN chance.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   270
  // PROB_LIKELY_1e(N) is a 1 - PROB_UNLIKELY_1e(N)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   271
#define PROB_UNLIKELY_MAG(N)    (1e- ## N ## f)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   272
#define PROB_LIKELY_MAG(N)      (1.0f-PROB_UNLIKELY_MAG(N))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   273
489c9b5090e2 Initial load
duke
parents:
diff changeset
   274
  // Maximum and minimum branch prediction probabilties
489c9b5090e2 Initial load
duke
parents:
diff changeset
   275
  // 1 in 1,000,000 (magnitude 6)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   276
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   277
  // Although PROB_NEVER == PROB_MIN and PROB_ALWAYS == PROB_MAX
489c9b5090e2 Initial load
duke
parents:
diff changeset
   278
  // they are used to distinguish different situations:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   279
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   280
  // The name PROB_MAX (PROB_MIN) is for probabilities which correspond to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   281
  // very likely (unlikely) but with a concrete possibility of a rare
489c9b5090e2 Initial load
duke
parents:
diff changeset
   282
  // contrary case.  These constants would be used for pinning
489c9b5090e2 Initial load
duke
parents:
diff changeset
   283
  // measurements, and as measures for assertions that have high
489c9b5090e2 Initial load
duke
parents:
diff changeset
   284
  // confidence, but some evidence of occasional failure.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   285
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   286
  // The name PROB_ALWAYS (PROB_NEVER) is to stand for situations for which
489c9b5090e2 Initial load
duke
parents:
diff changeset
   287
  // there is no evidence at all that the contrary case has ever occurred.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   288
489c9b5090e2 Initial load
duke
parents:
diff changeset
   289
#define PROB_NEVER              PROB_UNLIKELY_MAG(6)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   290
#define PROB_ALWAYS             PROB_LIKELY_MAG(6)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   291
489c9b5090e2 Initial load
duke
parents:
diff changeset
   292
#define PROB_MIN                PROB_UNLIKELY_MAG(6)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   293
#define PROB_MAX                PROB_LIKELY_MAG(6)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   294
489c9b5090e2 Initial load
duke
parents:
diff changeset
   295
  // Static branch prediction probabilities
489c9b5090e2 Initial load
duke
parents:
diff changeset
   296
  // 1 in 10 (magnitude 1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   297
#define PROB_STATIC_INFREQUENT  PROB_UNLIKELY_MAG(1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   298
#define PROB_STATIC_FREQUENT    PROB_LIKELY_MAG(1)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   299
489c9b5090e2 Initial load
duke
parents:
diff changeset
   300
  // Fair probability 50/50
489c9b5090e2 Initial load
duke
parents:
diff changeset
   301
#define PROB_FAIR               (0.5f)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   302
489c9b5090e2 Initial load
duke
parents:
diff changeset
   303
  // Unknown probability sentinel
489c9b5090e2 Initial load
duke
parents:
diff changeset
   304
#define PROB_UNKNOWN            (-1.0f)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   305
489c9b5090e2 Initial load
duke
parents:
diff changeset
   306
  // Probability "constructors", to distinguish as a probability any manifest
489c9b5090e2 Initial load
duke
parents:
diff changeset
   307
  // constant without a names
489c9b5090e2 Initial load
duke
parents:
diff changeset
   308
#define PROB_LIKELY(x)          ((float) (x))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   309
#define PROB_UNLIKELY(x)        (1.0f - (float)(x))
489c9b5090e2 Initial load
duke
parents:
diff changeset
   310
489c9b5090e2 Initial load
duke
parents:
diff changeset
   311
  // Other probabilities in use, but without a unique name, are documented
489c9b5090e2 Initial load
duke
parents:
diff changeset
   312
  // here for lack of a better place:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   313
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   314
  // 1 in 1000 probabilities (magnitude 3):
489c9b5090e2 Initial load
duke
parents:
diff changeset
   315
  //     threshold for converting to conditional move
489c9b5090e2 Initial load
duke
parents:
diff changeset
   316
  //     likelihood of null check failure if a null HAS been seen before
489c9b5090e2 Initial load
duke
parents:
diff changeset
   317
  //     likelihood of slow path taken in library calls
489c9b5090e2 Initial load
duke
parents:
diff changeset
   318
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   319
  // 1 in 10,000 probabilities (magnitude 4):
489c9b5090e2 Initial load
duke
parents:
diff changeset
   320
  //     threshold for making an uncommon trap probability more extreme
489c9b5090e2 Initial load
duke
parents:
diff changeset
   321
  //     threshold for for making a null check implicit
489c9b5090e2 Initial load
duke
parents:
diff changeset
   322
  //     likelihood of needing a gc if eden top moves during an allocation
489c9b5090e2 Initial load
duke
parents:
diff changeset
   323
  //     likelihood of a predicted call failure
489c9b5090e2 Initial load
duke
parents:
diff changeset
   324
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   325
  // 1 in 100,000 probabilities (magnitude 5):
489c9b5090e2 Initial load
duke
parents:
diff changeset
   326
  //     threshold for ignoring counts when estimating path frequency
489c9b5090e2 Initial load
duke
parents:
diff changeset
   327
  //     likelihood of FP clipping failure
489c9b5090e2 Initial load
duke
parents:
diff changeset
   328
  //     likelihood of catching an exception from a try block
489c9b5090e2 Initial load
duke
parents:
diff changeset
   329
  //     likelihood of null check failure if a null has NOT been seen before
489c9b5090e2 Initial load
duke
parents:
diff changeset
   330
  //
489c9b5090e2 Initial load
duke
parents:
diff changeset
   331
  // Magic manifest probabilities such as 0.83, 0.7, ... can be found in
489c9b5090e2 Initial load
duke
parents:
diff changeset
   332
  // gen_subtype_check() and catch_inline_exceptions().
489c9b5090e2 Initial load
duke
parents:
diff changeset
   333
489c9b5090e2 Initial load
duke
parents:
diff changeset
   334
  float _prob;                  // Probability of true path being taken.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   335
  float _fcnt;                  // Frequency counter
489c9b5090e2 Initial load
duke
parents:
diff changeset
   336
  IfNode( Node *control, Node *b, float p, float fcnt )
489c9b5090e2 Initial load
duke
parents:
diff changeset
   337
    : MultiBranchNode(2), _prob(p), _fcnt(fcnt) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   338
    init_class_id(Class_If);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   339
    init_req(0,control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   340
    init_req(1,b);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   341
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   342
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   343
  virtual bool pinned() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   344
  virtual const Type *bottom_type() const { return TypeTuple::IFBOTH; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   345
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   346
  virtual const Type *Value( PhaseTransform *phase ) const;
374
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   347
  virtual int required_outcnt() const { return 2; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   348
  virtual const RegMask &out_RegMask() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   349
  void dominated_by(Node* prev_dom, PhaseIterGVN* igvn);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   350
  int is_range_check(Node* &range, Node* &index, jint &offset);
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   351
  Node* fold_compares(PhaseGVN* phase);
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   352
  static Node* up_one_dom(Node* curr, bool linear_only = false);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   353
190
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   354
  // Takes the type of val and filters it through the test represented
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   355
  // by if_proj and returns a more refined type if one is produced.
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   356
  // Returns NULL is it couldn't improve the type.
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   357
  static const TypeInt* filtered_int_type(PhaseGVN* phase, Node* val, Node* if_proj);
e9a0a9dcd4f6 6395208: Elide autoboxing for calls to HashMap.get(int) and HashMap.get(long)
never
parents: 1
diff changeset
   358
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   359
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   360
  virtual void dump_spec(outputStream *st) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   361
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   362
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   363
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   364
class IfProjNode : public CProjNode {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   365
public:
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   366
  IfProjNode(IfNode *ifnode, uint idx) : CProjNode(ifnode,idx) {}
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   367
  virtual Node *Identity(PhaseTransform *phase);
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   368
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   369
protected:
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   370
  // Type of If input when this branch is always taken
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   371
  virtual bool always_taken(const TypeTuple* t) const = 0;
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   372
};
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   373
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   374
class IfTrueNode : public IfProjNode {
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   375
public:
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   376
  IfTrueNode( IfNode *ifnode ) : IfProjNode(ifnode,1) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   377
    init_class_id(Class_IfTrue);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   378
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   379
  virtual int Opcode() const;
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   380
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   381
protected:
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   382
  virtual bool always_taken(const TypeTuple* t) const { return t == TypeTuple::IFTRUE; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   383
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   384
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   385
class IfFalseNode : public IfProjNode {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   386
public:
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   387
  IfFalseNode( IfNode *ifnode ) : IfProjNode(ifnode,0) {
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   388
    init_class_id(Class_IfFalse);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   389
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   390
  virtual int Opcode() const;
28486
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   391
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   392
protected:
b0df113b962e 8027626: assert(Opcode() != Op_If || outcnt() == 2) failed: bad if #1
roland
parents: 15113
diff changeset
   393
  virtual bool always_taken(const TypeTuple* t) const { return t == TypeTuple::IFFALSE; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   394
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   395
489c9b5090e2 Initial load
duke
parents:
diff changeset
   396
489c9b5090e2 Initial load
duke
parents:
diff changeset
   397
//------------------------------PCTableNode------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   398
// Build an indirect branch table.  Given a control and a table index,
489c9b5090e2 Initial load
duke
parents:
diff changeset
   399
// control is passed to the Projection matching the table index.  Used to
489c9b5090e2 Initial load
duke
parents:
diff changeset
   400
// implement switch statements and exception-handling capabilities.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   401
// Undefined behavior if passed-in index is not inside the table.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   402
class PCTableNode : public MultiBranchNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   403
  virtual uint hash() const;    // Target count; table size
489c9b5090e2 Initial load
duke
parents:
diff changeset
   404
  virtual uint cmp( const Node &n ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   405
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   406
489c9b5090e2 Initial load
duke
parents:
diff changeset
   407
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   408
  const uint _size;             // Number of targets
489c9b5090e2 Initial load
duke
parents:
diff changeset
   409
489c9b5090e2 Initial load
duke
parents:
diff changeset
   410
  PCTableNode( Node *ctrl, Node *idx, uint size ) : MultiBranchNode(2), _size(size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   411
    init_class_id(Class_PCTable);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   412
    init_req(0, ctrl);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   413
    init_req(1, idx);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   414
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   415
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   416
  virtual const Type *Value( PhaseTransform *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   417
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   418
  virtual const Type *bottom_type() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   419
  virtual bool pinned() const { return true; }
374
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   420
  virtual int required_outcnt() const { return _size; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   421
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   422
489c9b5090e2 Initial load
duke
parents:
diff changeset
   423
//------------------------------JumpNode---------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   424
// Indirect branch.  Uses PCTable above to implement a switch statement.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   425
// It emits as a table load and local branch.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   426
class JumpNode : public PCTableNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   427
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   428
  JumpNode( Node* control, Node* switch_val, uint size) : PCTableNode(control, switch_val, size) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   429
    init_class_id(Class_Jump);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   430
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   431
  virtual int   Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   432
  virtual const RegMask& out_RegMask() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   433
  virtual const Node* is_block_proj() const { return this; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   434
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   435
489c9b5090e2 Initial load
duke
parents:
diff changeset
   436
class JumpProjNode : public JProjNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   437
  virtual uint hash() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   438
  virtual uint cmp( const Node &n ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   439
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   440
489c9b5090e2 Initial load
duke
parents:
diff changeset
   441
 private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   442
  const int  _dest_bci;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   443
  const uint _proj_no;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   444
  const int  _switch_val;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   445
 public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   446
  JumpProjNode(Node* jumpnode, uint proj_no, int dest_bci, int switch_val)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   447
    : JProjNode(jumpnode, proj_no), _dest_bci(dest_bci), _proj_no(proj_no), _switch_val(switch_val) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   448
    init_class_id(Class_JumpProj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   449
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   450
489c9b5090e2 Initial load
duke
parents:
diff changeset
   451
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   452
  virtual const Type* bottom_type() const { return Type::CONTROL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   453
  int  dest_bci()    const { return _dest_bci; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   454
  int  switch_val()  const { return _switch_val; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   455
  uint proj_no()     const { return _proj_no; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   456
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   457
  virtual void dump_spec(outputStream *st) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   458
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   459
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   460
489c9b5090e2 Initial load
duke
parents:
diff changeset
   461
//------------------------------CatchNode--------------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   462
// Helper node to fork exceptions.  "Catch" catches any exceptions thrown by
489c9b5090e2 Initial load
duke
parents:
diff changeset
   463
// a just-prior call.  Looks like a PCTableNode but emits no code - just the
489c9b5090e2 Initial load
duke
parents:
diff changeset
   464
// table.  The table lookup and branch is implemented by RethrowNode.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   465
class CatchNode : public PCTableNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   466
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   467
  CatchNode( Node *ctrl, Node *idx, uint size ) : PCTableNode(ctrl,idx,size){
489c9b5090e2 Initial load
duke
parents:
diff changeset
   468
    init_class_id(Class_Catch);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   469
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   470
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   471
  virtual const Type *Value( PhaseTransform *phase ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   472
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   473
489c9b5090e2 Initial load
duke
parents:
diff changeset
   474
// CatchProjNode controls which exception handler is targetted after a call.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   475
// It is passed in the bci of the target handler, or no_handler_bci in case
489c9b5090e2 Initial load
duke
parents:
diff changeset
   476
// the projection doesn't lead to an exception handler.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   477
class CatchProjNode : public CProjNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   478
  virtual uint hash() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   479
  virtual uint cmp( const Node &n ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   480
  virtual uint size_of() const { return sizeof(*this); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   481
489c9b5090e2 Initial load
duke
parents:
diff changeset
   482
private:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   483
  const int _handler_bci;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   484
489c9b5090e2 Initial load
duke
parents:
diff changeset
   485
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   486
  enum {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   487
    fall_through_index =  0,      // the fall through projection index
489c9b5090e2 Initial load
duke
parents:
diff changeset
   488
    catch_all_index    =  1,      // the projection index for catch-alls
489c9b5090e2 Initial load
duke
parents:
diff changeset
   489
    no_handler_bci     = -1       // the bci for fall through or catch-all projs
489c9b5090e2 Initial load
duke
parents:
diff changeset
   490
  };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   491
489c9b5090e2 Initial load
duke
parents:
diff changeset
   492
  CatchProjNode(Node* catchnode, uint proj_no, int handler_bci)
489c9b5090e2 Initial load
duke
parents:
diff changeset
   493
    : CProjNode(catchnode, proj_no), _handler_bci(handler_bci) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   494
    init_class_id(Class_CatchProj);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   495
    assert(proj_no != fall_through_index || handler_bci < 0, "fall through case must have bci < 0");
489c9b5090e2 Initial load
duke
parents:
diff changeset
   496
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   497
489c9b5090e2 Initial load
duke
parents:
diff changeset
   498
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   499
  virtual Node *Identity( PhaseTransform *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   500
  virtual const Type *bottom_type() const { return Type::CONTROL; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   501
  int  handler_bci() const        { return _handler_bci; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   502
  bool is_handler_proj() const    { return _handler_bci >= 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   503
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   504
  virtual void dump_spec(outputStream *st) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   505
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   506
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   507
489c9b5090e2 Initial load
duke
parents:
diff changeset
   508
489c9b5090e2 Initial load
duke
parents:
diff changeset
   509
//---------------------------------CreateExNode--------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   510
// Helper node to create the exception coming back from a call
489c9b5090e2 Initial load
duke
parents:
diff changeset
   511
class CreateExNode : public TypeNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   512
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   513
  CreateExNode(const Type* t, Node* control, Node* i_o) : TypeNode(t, 2) {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   514
    init_req(0, control);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   515
    init_req(1, i_o);
489c9b5090e2 Initial load
duke
parents:
diff changeset
   516
  }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   517
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   518
  virtual Node *Identity( PhaseTransform *phase );
489c9b5090e2 Initial load
duke
parents:
diff changeset
   519
  virtual bool pinned() const { return true; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   520
  uint match_edge(uint idx) const { return 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   521
  virtual uint ideal_reg() const { return Op_RegP; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   522
};
489c9b5090e2 Initial load
duke
parents:
diff changeset
   523
489c9b5090e2 Initial load
duke
parents:
diff changeset
   524
//------------------------------NeverBranchNode-------------------------------
489c9b5090e2 Initial load
duke
parents:
diff changeset
   525
// The never-taken branch.  Used to give the appearance of exiting infinite
489c9b5090e2 Initial load
duke
parents:
diff changeset
   526
// loops to those algorithms that like all paths to be reachable.  Encodes
489c9b5090e2 Initial load
duke
parents:
diff changeset
   527
// empty.
489c9b5090e2 Initial load
duke
parents:
diff changeset
   528
class NeverBranchNode : public MultiBranchNode {
489c9b5090e2 Initial load
duke
parents:
diff changeset
   529
public:
489c9b5090e2 Initial load
duke
parents:
diff changeset
   530
  NeverBranchNode( Node *ctrl ) : MultiBranchNode(1) { init_req(0,ctrl); }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   531
  virtual int Opcode() const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   532
  virtual bool pinned() const { return true; };
489c9b5090e2 Initial load
duke
parents:
diff changeset
   533
  virtual const Type *bottom_type() const { return TypeTuple::IFBOTH; }
374
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   534
  virtual const Type *Value( PhaseTransform *phase ) const;
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   535
  virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
585c671c9c0e 6663848: assert(i < Max(),"oob") in C2 with -Xcomp
never
parents: 247
diff changeset
   536
  virtual int required_outcnt() const { return 2; }
1
489c9b5090e2 Initial load
duke
parents:
diff changeset
   537
  virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const { }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   538
  virtual uint size(PhaseRegAlloc *ra_) const { return 0; }
489c9b5090e2 Initial load
duke
parents:
diff changeset
   539
#ifndef PRODUCT
489c9b5090e2 Initial load
duke
parents:
diff changeset
   540
  virtual void format( PhaseRegAlloc *, outputStream *st ) const;
489c9b5090e2 Initial load
duke
parents:
diff changeset
   541
#endif
489c9b5090e2 Initial load
duke
parents:
diff changeset
   542
};
7397
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
   543
5b173b4ca846 6989984: Use standard include model for Hospot
stefank
parents: 5547
diff changeset
   544
#endif // SHARE_VM_OPTO_CFGNODE_HPP