1 /* 2 * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #ifndef SHARE_VM_OPTO_CFGNODE_HPP 26 #define SHARE_VM_OPTO_CFGNODE_HPP 27 28 #include "opto/multnode.hpp" 29 #include "opto/node.hpp" 30 #include "opto/opcodes.hpp" 31 #include "opto/type.hpp" 32 33 // Portions of code courtesy of Clifford Click 34 35 // Optimization - Graph Style 36 37 class Matcher; 38 class Node; 39 class RegionNode; 40 class TypeNode; 41 class PhiNode; 42 class GotoNode; 43 class MultiNode; 44 class MultiBranchNode; 45 class IfNode; 46 class PCTableNode; 47 class JumpNode; 48 class CatchNode; 49 class NeverBranchNode; 50 class ProjNode; 51 class CProjNode; 52 class IfTrueNode; 53 class IfFalseNode; 54 class CatchProjNode; 55 class JProjNode; 56 class JumpProjNode; 57 class SCMemProjNode; 58 class PhaseIdealLoop; 59 60 //------------------------------RegionNode------------------------------------- 61 // The class of RegionNodes, which can be mapped to basic blocks in the 62 // program. Their inputs point to Control sources. PhiNodes (described 63 // below) have an input point to a RegionNode. Merged data inputs to PhiNodes 64 // correspond 1-to-1 with RegionNode inputs. The zero input of a PhiNode is 65 // the RegionNode, and the zero input of the RegionNode is itself. 66 class RegionNode : public Node { 67 public: 68 // Node layout (parallels PhiNode): 69 enum { Region, // Generally points to self. 70 Control // Control arcs are [1..len) 71 }; 72 RegionNode(uint required)73 RegionNode( uint required ) : Node(required) { 74 init_class_id(Class_Region); 75 init_req(0,this); 76 } 77 is_copy() const78 Node* is_copy() const { 79 const Node* r = _in[Region]; 80 if (r == NULL) 81 return nonnull_req(); 82 return NULL; // not a copy! 83 } 84 PhiNode* has_phi() const; // returns an arbitrary phi user, or NULL 85 PhiNode* has_unique_phi() const; // returns the unique phi user, or NULL 86 // Is this region node unreachable from root? 87 bool is_unreachable_region(PhaseGVN *phase) const; 88 virtual int Opcode() const; pinned() const89 virtual bool pinned() const { return (const Node *)in(0) == this; } is_CFG() const90 virtual bool is_CFG () const { return true; } hash() const91 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash depends_only_on_test() const92 virtual bool depends_only_on_test() const { return false; } bottom_type() const93 virtual const Type *bottom_type() const { return Type::CONTROL; } 94 virtual const Type* Value(PhaseGVN* phase) const; 95 virtual Node* Identity(PhaseGVN* phase); 96 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 97 virtual const RegMask &out_RegMask() const; 98 bool try_clean_mem_phi(PhaseGVN *phase); 99 }; 100 101 //------------------------------JProjNode-------------------------------------- 102 // jump projection for node that produces multiple control-flow paths 103 class JProjNode : public ProjNode { 104 public: JProjNode(Node * ctrl,uint idx)105 JProjNode( Node* ctrl, uint idx ) : ProjNode(ctrl,idx) {} 106 virtual int Opcode() const; is_CFG() const107 virtual bool is_CFG() const { return true; } hash() const108 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash is_block_proj() const109 virtual const Node* is_block_proj() const { return in(0); } 110 virtual const RegMask& out_RegMask() const; ideal_reg() const111 virtual uint ideal_reg() const { return 0; } 112 }; 113 114 //------------------------------PhiNode---------------------------------------- 115 // PhiNodes merge values from different Control paths. Slot 0 points to the 116 // controlling RegionNode. Other slots map 1-for-1 with incoming control flow 117 // paths to the RegionNode. For speed reasons (to avoid another pass) we 118 // can turn PhiNodes into copys in-place by NULL'ing out their RegionNode 119 // input in slot 0. 120 class PhiNode : public TypeNode { 121 friend class PhaseRenumberLive; 122 123 const TypePtr* const _adr_type; // non-null only for Type::MEMORY nodes. 124 // The following fields are only used for data PhiNodes to indicate 125 // that the PhiNode represents the value of a known instance field. 126 int _inst_mem_id; // Instance memory id (node index of the memory Phi) 127 int _inst_id; // Instance id of the memory slice. 128 const int _inst_index; // Alias index of the instance memory slice. 129 // Array elements references have the same alias_idx but different offset. 130 const int _inst_offset; // Offset of the instance memory slice. 131 // Size is bigger to hold the _adr_type field. 132 virtual uint hash() const; // Check the type 133 virtual uint cmp( const Node &n ) const; size_of() const134 virtual uint size_of() const { return sizeof(*this); } 135 136 // Determine if CMoveNode::is_cmove_id can be used at this join point. 137 Node* is_cmove_id(PhaseTransform* phase, int true_path); 138 139 public: 140 // Node layout (parallels RegionNode): 141 enum { Region, // Control input is the Phi's region. 142 Input // Input values are [1..len) 143 }; 144 PhiNode(Node * r,const Type * t,const TypePtr * at=NULL,const int imid=-1,const int iid=TypeOopPtr::InstanceTop,const int iidx=Compile::AliasIdxTop,const int ioffs=Type::OffsetTop)145 PhiNode( Node *r, const Type *t, const TypePtr* at = NULL, 146 const int imid = -1, 147 const int iid = TypeOopPtr::InstanceTop, 148 const int iidx = Compile::AliasIdxTop, 149 const int ioffs = Type::OffsetTop ) 150 : TypeNode(t,r->req()), 151 _adr_type(at), 152 _inst_mem_id(imid), 153 _inst_id(iid), 154 _inst_index(iidx), 155 _inst_offset(ioffs) 156 { 157 init_class_id(Class_Phi); 158 init_req(0, r); 159 verify_adr_type(); 160 } 161 // create a new phi with in edges matching r and set (initially) to x 162 static PhiNode* make( Node* r, Node* x ); 163 // extra type arguments override the new phi's bottom_type and adr_type 164 static PhiNode* make( Node* r, Node* x, const Type *t, const TypePtr* at = NULL ); 165 // create a new phi with narrowed memory type 166 PhiNode* slice_memory(const TypePtr* adr_type) const; 167 PhiNode* split_out_instance(const TypePtr* at, PhaseIterGVN *igvn) const; 168 // like make(r, x), but does not initialize the in edges to x 169 static PhiNode* make_blank( Node* r, Node* x ); 170 171 // Accessors region() const172 RegionNode* region() const { Node* r = in(Region); assert(!r || r->is_Region(), ""); return (RegionNode*)r; } 173 is_copy() const174 Node* is_copy() const { 175 // The node is a real phi if _in[0] is a Region node. 176 DEBUG_ONLY(const Node* r = _in[Region];) 177 assert(r != NULL && r->is_Region(), "Not valid control"); 178 return NULL; // not a copy! 179 } 180 181 bool is_tripcount() const; 182 183 // Determine a unique non-trivial input, if any. 184 // Ignore casts if it helps. Return NULL on failure. 185 Node* unique_input(PhaseTransform *phase, bool uncast); unique_input(PhaseTransform * phase)186 Node* unique_input(PhaseTransform *phase) { 187 Node* uin = unique_input(phase, false); 188 if (uin == NULL) { 189 uin = unique_input(phase, true); 190 } 191 return uin; 192 } 193 194 // Check for a simple dead loop. 195 enum LoopSafety { Safe = 0, Unsafe, UnsafeLoop }; 196 LoopSafety simple_data_loop_check(Node *in) const; 197 // Is it unsafe data loop? It becomes a dead loop if this phi node removed. 198 bool is_unsafe_data_reference(Node *in) const; 199 int is_diamond_phi(bool check_control_only = false) const; 200 virtual int Opcode() const; pinned() const201 virtual bool pinned() const { return in(0) != 0; } adr_type() const202 virtual const TypePtr *adr_type() const { verify_adr_type(true); return _adr_type; } 203 set_inst_mem_id(int inst_mem_id)204 void set_inst_mem_id(int inst_mem_id) { _inst_mem_id = inst_mem_id; } inst_mem_id() const205 const int inst_mem_id() const { return _inst_mem_id; } inst_id() const206 const int inst_id() const { return _inst_id; } inst_index() const207 const int inst_index() const { return _inst_index; } inst_offset() const208 const int inst_offset() const { return _inst_offset; } is_same_inst_field(const Type * tp,int mem_id,int id,int index,int offset)209 bool is_same_inst_field(const Type* tp, int mem_id, int id, int index, int offset) { 210 return type()->basic_type() == tp->basic_type() && 211 inst_mem_id() == mem_id && 212 inst_id() == id && 213 inst_index() == index && 214 inst_offset() == offset && 215 type()->higher_equal(tp); 216 } 217 218 virtual const Type* Value(PhaseGVN* phase) const; 219 virtual Node* Identity(PhaseGVN* phase); 220 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 221 virtual const RegMask &out_RegMask() const; 222 virtual const RegMask &in_RegMask(uint) const; 223 #ifndef PRODUCT 224 virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; 225 virtual void dump_spec(outputStream *st) const; 226 #endif 227 #ifdef ASSERT 228 void verify_adr_type(VectorSet& visited, const TypePtr* at) const; 229 void verify_adr_type(bool recursive = false) const; 230 #else //ASSERT verify_adr_type(bool recursive=false) const231 void verify_adr_type(bool recursive = false) const {} 232 #endif //ASSERT 233 }; 234 235 //------------------------------GotoNode--------------------------------------- 236 // GotoNodes perform direct branches. 237 class GotoNode : public Node { 238 public: GotoNode(Node * control)239 GotoNode( Node *control ) : Node(control) {} 240 virtual int Opcode() const; pinned() const241 virtual bool pinned() const { return true; } is_CFG() const242 virtual bool is_CFG() const { return true; } hash() const243 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash is_block_proj() const244 virtual const Node *is_block_proj() const { return this; } depends_only_on_test() const245 virtual bool depends_only_on_test() const { return false; } bottom_type() const246 virtual const Type *bottom_type() const { return Type::CONTROL; } 247 virtual const Type* Value(PhaseGVN* phase) const; 248 virtual Node* Identity(PhaseGVN* phase); 249 virtual const RegMask &out_RegMask() const; 250 251 #ifndef PRODUCT 252 virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; 253 #endif 254 }; 255 256 //------------------------------CProjNode-------------------------------------- 257 // control projection for node that produces multiple control-flow paths 258 class CProjNode : public ProjNode { 259 public: CProjNode(Node * ctrl,uint idx)260 CProjNode( Node *ctrl, uint idx ) : ProjNode(ctrl,idx) {} 261 virtual int Opcode() const; is_CFG() const262 virtual bool is_CFG() const { return true; } hash() const263 virtual uint hash() const { return NO_HASH; } // CFG nodes do not hash is_block_proj() const264 virtual const Node *is_block_proj() const { return in(0); } 265 virtual const RegMask &out_RegMask() const; ideal_reg() const266 virtual uint ideal_reg() const { return 0; } 267 }; 268 269 //---------------------------MultiBranchNode----------------------------------- 270 // This class defines a MultiBranchNode, a MultiNode which yields multiple 271 // control values. These are distinguished from other types of MultiNodes 272 // which yield multiple values, but control is always and only projection #0. 273 class MultiBranchNode : public MultiNode { 274 public: MultiBranchNode(uint required)275 MultiBranchNode( uint required ) : MultiNode(required) { 276 init_class_id(Class_MultiBranch); 277 } 278 // returns required number of users to be well formed. 279 virtual int required_outcnt() const = 0; 280 }; 281 282 //------------------------------IfNode----------------------------------------- 283 // Output selected Control, based on a boolean test 284 class IfNode : public MultiBranchNode { 285 // Size is bigger to hold the probability field. However, _prob does not 286 // change the semantics so it does not appear in the hash & cmp functions. size_of() const287 virtual uint size_of() const { return sizeof(*this); } 288 289 private: 290 // Helper methods for fold_compares 291 bool cmpi_folds(PhaseIterGVN* igvn); 292 bool is_ctrl_folds(Node* ctrl, PhaseIterGVN* igvn); 293 bool has_shared_region(ProjNode* proj, ProjNode*& success, ProjNode*& fail); 294 bool has_only_uncommon_traps(ProjNode* proj, ProjNode*& success, ProjNode*& fail, PhaseIterGVN* igvn); 295 Node* merge_uncommon_traps(ProjNode* proj, ProjNode* success, ProjNode* fail, PhaseIterGVN* igvn); 296 static void improve_address_types(Node* l, Node* r, ProjNode* fail, PhaseIterGVN* igvn); 297 bool is_cmp_with_loadrange(ProjNode* proj); 298 bool is_null_check(ProjNode* proj, PhaseIterGVN* igvn); 299 bool is_side_effect_free_test(ProjNode* proj, PhaseIterGVN* igvn); 300 void reroute_side_effect_free_unc(ProjNode* proj, ProjNode* dom_proj, PhaseIterGVN* igvn); 301 ProjNode* uncommon_trap_proj(CallStaticJavaNode*& call) const; 302 bool fold_compares_helper(ProjNode* proj, ProjNode* success, ProjNode* fail, PhaseIterGVN* igvn); 303 static bool is_dominator_unc(CallStaticJavaNode* dom_unc, CallStaticJavaNode* unc); 304 305 protected: 306 ProjNode* range_check_trap_proj(int& flip, Node*& l, Node*& r); 307 Node* Ideal_common(PhaseGVN *phase, bool can_reshape); 308 SHENANDOAHGC_ONLY(public:) 309 Node* dominated_by(Node* prev_dom, PhaseIterGVN* igvn); 310 SHENANDOAHGC_ONLY(protected:) 311 Node* search_identical(int dist); 312 313 public: 314 315 // Degrees of branch prediction probability by order of magnitude: 316 // PROB_UNLIKELY_1e(N) is a 1 in 1eN chance. 317 // PROB_LIKELY_1e(N) is a 1 - PROB_UNLIKELY_1e(N) 318 #define PROB_UNLIKELY_MAG(N) (1e- ## N ## f) 319 #define PROB_LIKELY_MAG(N) (1.0f-PROB_UNLIKELY_MAG(N)) 320 321 // Maximum and minimum branch prediction probabilties 322 // 1 in 1,000,000 (magnitude 6) 323 // 324 // Although PROB_NEVER == PROB_MIN and PROB_ALWAYS == PROB_MAX 325 // they are used to distinguish different situations: 326 // 327 // The name PROB_MAX (PROB_MIN) is for probabilities which correspond to 328 // very likely (unlikely) but with a concrete possibility of a rare 329 // contrary case. These constants would be used for pinning 330 // measurements, and as measures for assertions that have high 331 // confidence, but some evidence of occasional failure. 332 // 333 // The name PROB_ALWAYS (PROB_NEVER) is to stand for situations for which 334 // there is no evidence at all that the contrary case has ever occurred. 335 336 #define PROB_NEVER PROB_UNLIKELY_MAG(6) 337 #define PROB_ALWAYS PROB_LIKELY_MAG(6) 338 339 #define PROB_MIN PROB_UNLIKELY_MAG(6) 340 #define PROB_MAX PROB_LIKELY_MAG(6) 341 342 // Static branch prediction probabilities 343 // 1 in 10 (magnitude 1) 344 #define PROB_STATIC_INFREQUENT PROB_UNLIKELY_MAG(1) 345 #define PROB_STATIC_FREQUENT PROB_LIKELY_MAG(1) 346 347 // Fair probability 50/50 348 #define PROB_FAIR (0.5f) 349 350 // Unknown probability sentinel 351 #define PROB_UNKNOWN (-1.0f) 352 353 // Probability "constructors", to distinguish as a probability any manifest 354 // constant without a names 355 #define PROB_LIKELY(x) ((float) (x)) 356 #define PROB_UNLIKELY(x) (1.0f - (float)(x)) 357 358 // Other probabilities in use, but without a unique name, are documented 359 // here for lack of a better place: 360 // 361 // 1 in 1000 probabilities (magnitude 3): 362 // threshold for converting to conditional move 363 // likelihood of null check failure if a null HAS been seen before 364 // likelihood of slow path taken in library calls 365 // 366 // 1 in 10,000 probabilities (magnitude 4): 367 // threshold for making an uncommon trap probability more extreme 368 // threshold for for making a null check implicit 369 // likelihood of needing a gc if eden top moves during an allocation 370 // likelihood of a predicted call failure 371 // 372 // 1 in 100,000 probabilities (magnitude 5): 373 // threshold for ignoring counts when estimating path frequency 374 // likelihood of FP clipping failure 375 // likelihood of catching an exception from a try block 376 // likelihood of null check failure if a null has NOT been seen before 377 // 378 // Magic manifest probabilities such as 0.83, 0.7, ... can be found in 379 // gen_subtype_check() and catch_inline_exceptions(). 380 381 float _prob; // Probability of true path being taken. 382 float _fcnt; // Frequency counter IfNode(Node * control,Node * b,float p,float fcnt)383 IfNode( Node *control, Node *b, float p, float fcnt ) 384 : MultiBranchNode(2), _prob(p), _fcnt(fcnt) { 385 init_class_id(Class_If); 386 init_req(0,control); 387 init_req(1,b); 388 } 389 virtual int Opcode() const; pinned() const390 virtual bool pinned() const { return true; } bottom_type() const391 virtual const Type *bottom_type() const { return TypeTuple::IFBOTH; } 392 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 393 virtual const Type* Value(PhaseGVN* phase) const; required_outcnt() const394 virtual int required_outcnt() const { return 2; } 395 virtual const RegMask &out_RegMask() const; 396 Node* fold_compares(PhaseIterGVN* phase); 397 static Node* up_one_dom(Node* curr, bool linear_only = false); 398 399 // Takes the type of val and filters it through the test represented 400 // by if_proj and returns a more refined type if one is produced. 401 // Returns NULL is it couldn't improve the type. 402 static const TypeInt* filtered_int_type(PhaseGVN* phase, Node* val, Node* if_proj); 403 404 #ifndef PRODUCT 405 virtual void dump_spec(outputStream *st) const; 406 virtual void related(GrowableArray <Node *> *in_rel, GrowableArray <Node *> *out_rel, bool compact) const; 407 #endif 408 }; 409 410 class RangeCheckNode : public IfNode { 411 private: 412 int is_range_check(Node* &range, Node* &index, jint &offset); 413 414 public: RangeCheckNode(Node * control,Node * b,float p,float fcnt)415 RangeCheckNode(Node* control, Node *b, float p, float fcnt) 416 : IfNode(control, b, p, fcnt) { 417 init_class_id(Class_RangeCheck); 418 } 419 420 virtual int Opcode() const; 421 virtual Node* Ideal(PhaseGVN *phase, bool can_reshape); 422 }; 423 424 class IfProjNode : public CProjNode { 425 public: IfProjNode(IfNode * ifnode,uint idx)426 IfProjNode(IfNode *ifnode, uint idx) : CProjNode(ifnode,idx) {} 427 virtual Node* Identity(PhaseGVN* phase); 428 429 protected: 430 // Type of If input when this branch is always taken 431 virtual bool always_taken(const TypeTuple* t) const = 0; 432 433 #ifndef PRODUCT 434 public: 435 virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; 436 #endif 437 }; 438 439 class IfTrueNode : public IfProjNode { 440 public: IfTrueNode(IfNode * ifnode)441 IfTrueNode( IfNode *ifnode ) : IfProjNode(ifnode,1) { 442 init_class_id(Class_IfTrue); 443 } 444 virtual int Opcode() const; 445 446 protected: always_taken(const TypeTuple * t) const447 virtual bool always_taken(const TypeTuple* t) const { return t == TypeTuple::IFTRUE; } 448 }; 449 450 class IfFalseNode : public IfProjNode { 451 public: IfFalseNode(IfNode * ifnode)452 IfFalseNode( IfNode *ifnode ) : IfProjNode(ifnode,0) { 453 init_class_id(Class_IfFalse); 454 } 455 virtual int Opcode() const; 456 457 protected: always_taken(const TypeTuple * t) const458 virtual bool always_taken(const TypeTuple* t) const { return t == TypeTuple::IFFALSE; } 459 }; 460 461 462 //------------------------------PCTableNode------------------------------------ 463 // Build an indirect branch table. Given a control and a table index, 464 // control is passed to the Projection matching the table index. Used to 465 // implement switch statements and exception-handling capabilities. 466 // Undefined behavior if passed-in index is not inside the table. 467 class PCTableNode : public MultiBranchNode { 468 virtual uint hash() const; // Target count; table size 469 virtual uint cmp( const Node &n ) const; size_of() const470 virtual uint size_of() const { return sizeof(*this); } 471 472 public: 473 const uint _size; // Number of targets 474 PCTableNode(Node * ctrl,Node * idx,uint size)475 PCTableNode( Node *ctrl, Node *idx, uint size ) : MultiBranchNode(2), _size(size) { 476 init_class_id(Class_PCTable); 477 init_req(0, ctrl); 478 init_req(1, idx); 479 } 480 virtual int Opcode() const; 481 virtual const Type* Value(PhaseGVN* phase) const; 482 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 483 virtual const Type *bottom_type() const; pinned() const484 virtual bool pinned() const { return true; } required_outcnt() const485 virtual int required_outcnt() const { return _size; } 486 }; 487 488 //------------------------------JumpNode--------------------------------------- 489 // Indirect branch. Uses PCTable above to implement a switch statement. 490 // It emits as a table load and local branch. 491 class JumpNode : public PCTableNode { size_of() const492 virtual uint size_of() const { return sizeof(*this); } 493 public: 494 float* _probs; // probability of each projection 495 float _fcnt; // total number of times this Jump was executed JumpNode(Node * control,Node * switch_val,uint size,float * probs,float cnt)496 JumpNode( Node* control, Node* switch_val, uint size, float* probs, float cnt) 497 : PCTableNode(control, switch_val, size), 498 _probs(probs), _fcnt(cnt) { 499 init_class_id(Class_Jump); 500 } 501 virtual int Opcode() const; 502 virtual const RegMask& out_RegMask() const; is_block_proj() const503 virtual const Node* is_block_proj() const { return this; } 504 #ifndef PRODUCT 505 virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; 506 #endif 507 }; 508 509 class JumpProjNode : public JProjNode { 510 virtual uint hash() const; 511 virtual uint cmp( const Node &n ) const; size_of() const512 virtual uint size_of() const { return sizeof(*this); } 513 514 private: 515 const int _dest_bci; 516 const uint _proj_no; 517 const int _switch_val; 518 public: JumpProjNode(Node * jumpnode,uint proj_no,int dest_bci,int switch_val)519 JumpProjNode(Node* jumpnode, uint proj_no, int dest_bci, int switch_val) 520 : JProjNode(jumpnode, proj_no), _dest_bci(dest_bci), _proj_no(proj_no), _switch_val(switch_val) { 521 init_class_id(Class_JumpProj); 522 } 523 524 virtual int Opcode() const; bottom_type() const525 virtual const Type* bottom_type() const { return Type::CONTROL; } dest_bci() const526 int dest_bci() const { return _dest_bci; } switch_val() const527 int switch_val() const { return _switch_val; } proj_no() const528 uint proj_no() const { return _proj_no; } 529 #ifndef PRODUCT 530 virtual void dump_spec(outputStream *st) const; 531 virtual void dump_compact_spec(outputStream *st) const; 532 virtual void related(GrowableArray<Node*> *in_rel, GrowableArray<Node*> *out_rel, bool compact) const; 533 #endif 534 }; 535 536 //------------------------------CatchNode-------------------------------------- 537 // Helper node to fork exceptions. "Catch" catches any exceptions thrown by 538 // a just-prior call. Looks like a PCTableNode but emits no code - just the 539 // table. The table lookup and branch is implemented by RethrowNode. 540 class CatchNode : public PCTableNode { 541 public: CatchNode(Node * ctrl,Node * idx,uint size)542 CatchNode( Node *ctrl, Node *idx, uint size ) : PCTableNode(ctrl,idx,size){ 543 init_class_id(Class_Catch); 544 } 545 virtual int Opcode() const; 546 virtual const Type* Value(PhaseGVN* phase) const; 547 }; 548 549 // CatchProjNode controls which exception handler is targetted after a call. 550 // It is passed in the bci of the target handler, or no_handler_bci in case 551 // the projection doesn't lead to an exception handler. 552 class CatchProjNode : public CProjNode { 553 virtual uint hash() const; 554 virtual uint cmp( const Node &n ) const; size_of() const555 virtual uint size_of() const { return sizeof(*this); } 556 557 private: 558 const int _handler_bci; 559 560 public: 561 enum { 562 fall_through_index = 0, // the fall through projection index 563 catch_all_index = 1, // the projection index for catch-alls 564 no_handler_bci = -1 // the bci for fall through or catch-all projs 565 }; 566 CatchProjNode(Node * catchnode,uint proj_no,int handler_bci)567 CatchProjNode(Node* catchnode, uint proj_no, int handler_bci) 568 : CProjNode(catchnode, proj_no), _handler_bci(handler_bci) { 569 init_class_id(Class_CatchProj); 570 assert(proj_no != fall_through_index || handler_bci < 0, "fall through case must have bci < 0"); 571 } 572 573 virtual int Opcode() const; 574 virtual Node* Identity(PhaseGVN* phase); bottom_type() const575 virtual const Type *bottom_type() const { return Type::CONTROL; } handler_bci() const576 int handler_bci() const { return _handler_bci; } is_handler_proj() const577 bool is_handler_proj() const { return _handler_bci >= 0; } 578 #ifndef PRODUCT 579 virtual void dump_spec(outputStream *st) const; 580 #endif 581 }; 582 583 584 //---------------------------------CreateExNode-------------------------------- 585 // Helper node to create the exception coming back from a call 586 class CreateExNode : public TypeNode { 587 public: CreateExNode(const Type * t,Node * control,Node * i_o)588 CreateExNode(const Type* t, Node* control, Node* i_o) : TypeNode(t, 2) { 589 init_req(0, control); 590 init_req(1, i_o); 591 } 592 virtual int Opcode() const; 593 virtual Node* Identity(PhaseGVN* phase); pinned() const594 virtual bool pinned() const { return true; } match_edge(uint idx) const595 uint match_edge(uint idx) const { return 0; } ideal_reg() const596 virtual uint ideal_reg() const { return Op_RegP; } 597 }; 598 599 //------------------------------NeverBranchNode------------------------------- 600 // The never-taken branch. Used to give the appearance of exiting infinite 601 // loops to those algorithms that like all paths to be reachable. Encodes 602 // empty. 603 class NeverBranchNode : public MultiBranchNode { 604 public: NeverBranchNode(Node * ctrl)605 NeverBranchNode( Node *ctrl ) : MultiBranchNode(1) { init_req(0,ctrl); } 606 virtual int Opcode() const; pinned() const607 virtual bool pinned() const { return true; }; bottom_type() const608 virtual const Type *bottom_type() const { return TypeTuple::IFBOTH; } 609 virtual const Type* Value(PhaseGVN* phase) const; 610 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); required_outcnt() const611 virtual int required_outcnt() const { return 2; } emit(CodeBuffer & cbuf,PhaseRegAlloc * ra_) const612 virtual void emit(CodeBuffer &cbuf, PhaseRegAlloc *ra_) const { } size(PhaseRegAlloc * ra_) const613 virtual uint size(PhaseRegAlloc *ra_) const { return 0; } 614 #ifndef PRODUCT 615 virtual void format( PhaseRegAlloc *, outputStream *st ) const; 616 #endif 617 }; 618 619 #endif // SHARE_VM_OPTO_CFGNODE_HPP 620