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