/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/opto/ |
H A D | RegionNode.java | 33 public class RegionNode extends Node { class in inherits:Node 43 Type type = db.lookupType("RegionNode"); 47 public RegionNode(Address addr) { method in class:RegionNode
|
H A D | LoopNode.java | 33 public class LoopNode extends RegionNode {
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | library_call.cpp | 123 void set_result(RegionNode* region, PhiNode* value); 129 Node* generate_guard(Node* test, RegionNode* region, float true_prob); 130 Node* generate_slow_guard(Node* test, RegionNode* region); 131 Node* generate_fair_guard(Node* test, RegionNode* region); 132 Node* generate_negative_guard(Node* index, RegionNode* region, 140 RegionNode* region); 146 RegionNode* region, int null_path, 149 RegionNode* region, int null_path) { 156 RegionNode* region, int null_path) { 164 RegionNode* regio [all...] |
H A D | cfgnode.hpp | 39 class RegionNode; 60 //------------------------------RegionNode------------------------------------- 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 { class in inherits:Node 73 RegionNode( uint required ) : Node(required) { function in class:RegionNode 116 // controlling RegionNode. Other slots map 1-for-1 with incoming control flow 117 // paths to the RegionNode [all...] |
H A D | stringopts.cpp | 983 RegionNode *final_merge = new (C) RegionNode(3); 1002 RegionNode *r = new (C) RegionNode(3); 1031 RegionNode *loop = new (C) RegionNode(3); 1068 RegionNode *final_merge = new (C) RegionNode(4); 1118 RegionNode *merge = new (C) RegionNode( [all...] |
H A D | cfgnode.cpp | 46 // Compute the type of the RegionNode. 47 const Type *RegionNode::Value( PhaseTransform *phase ) const { 59 Node *RegionNode::Identity( PhaseTransform *phase ) { 69 static Node *merge_region(RegionNode *region, PhaseGVN *phase) { 120 PhiNode* RegionNode::has_phi() const { 135 PhiNode* RegionNode::has_unique_phi() const { 155 // Helper function for RegionNode's identification of FP clipping 202 // Helper function for RegionNode's identification of FP clipping 212 static bool check_if_clipping( const RegionNode *region, IfNode * &bot_if, IfNode * &top_if ) { 216 // Check control structure above RegionNode fo [all...] |
H A D | macro.cpp | 1133 slow_region = new (C) RegionNode(3); 1177 result_region = new (C) RegionNode(3); 1190 contended_region = new (C) RegionNode(3); 1618 Node *pf_region = new (C) RegionNode(3); 1698 Node *pf_region = new (C) RegionNode(3); 2096 region = new (C) RegionNode(5); 2100 Node* fast_lock_region = new (C) RegionNode(3); 2165 Node* rebiased_region = new (C) RegionNode(3); 2207 slow_path = new (C) RegionNode(3); 2232 region = new (C) RegionNode( [all...] |
H A D | parse1.cpp | 326 bad_type_exit->set_control(new (C) RegionNode(1)); 651 RegionNode *r = new (C) RegionNode(edges+1); 718 RegionNode* region = new (C) RegionNode(1); 1533 RegionNode *r = new (C) RegionNode(edges+1); 1570 RegionNode* r = control()->as_Region(); 1679 RegionNode* r = control()->as_Region(); 1780 RegionNode* [all...] |
H A D | ifnode.cpp | 241 Node *region_c = new (igvn->C) RegionNode(req_c + 1); 244 Node *region_x = new (igvn->C) RegionNode(len - req_c); 319 Node *region_s = new (igvn->C) RegionNode(3); 326 Node *region_f = new (igvn->C) RegionNode(3); 697 RegionNode* region = otherproj->unique_out()->as_Region();
|
H A D | block.cpp | 394 // or a RegionNode. Make every block end with either a Goto, If or Return. 408 // 'np' is _root (see above) or RegionNode, StartNode: we push on stack 435 RegionNode *r = new (C) RegionNode( 2 ); 436 r->init_req(1, p); // Insert RegionNode in the way 437 proj->set_req(0, r); // Insert RegionNode in the way 458 // This breaks critical edges. The RegionNode to start the block 469 nstack.push(p, i); // 'p' is RegionNode or StartNode 511 RegionNode* region = new (C) RegionNode( [all...] |
H A D | callGenerator.cpp | 672 RegionNode* region = new (kit.C) RegionNode(3); 921 RegionNode* region = new (kit.C) RegionNode(3);
|
H A D | loopnode.hpp | 53 class LoopNode : public RegionNode { 88 LoopNode( Node *entry, Node *backedge ) : RegionNode(3), _loop_flags(0), _unswitch_count(0) { 369 // private RegionNode before the loop. This becomes the loop landing pad. 380 // Insert a LoopNode to replace the RegionNode. 830 // edges are the same. All exits from the old-loop now have a RegionNode 994 RegionNode* insert_region_before_proj(ProjNode* proj);
|
H A D | loopopts.cpp | 638 // RegionNode::Ideal. 1233 // same. All exits from the old-loop now have a RegionNode that merges the 1330 RegionNode *r = new (C) RegionNode(3); 1452 // Get new RegionNode merging old and new loop exits 1720 RegionNode* PhaseIdealLoop::insert_region_before_proj(ProjNode* proj) { 1733 RegionNode* reg = new (C)RegionNode(2); 1807 RegionNode* reg = insert_region_before_proj(lp_exit);
|
H A D | graphKit.cpp | 345 region = new (C) RegionNode(2); 2389 RegionNode *r_ok_subtype = new (C) RegionNode(4); 2391 RegionNode *r_not_subtype = new (C) RegionNode(3); 2607 RegionNode* region = new(C) RegionNode(PATH_LIMIT); 2710 RegionNode* region = new (C) RegionNode(PATH_LIMIT);
|
H A D | loopPredicate.cpp | 162 rgn = new (C) RegionNode(1); 249 rgn = new (C) RegionNode(1);
|
H A D | idealKit.cpp | 208 Node* reg = delay_transform(new (C) RegionNode(sz));
|
H A D | parseHelper.cpp | 219 Node* merge = new (C) RegionNode(3);
|
H A D | split_if.cpp | 38 Node *r = new (C) RegionNode( region->req() ); 56 r->set_req(0,region); // Not a TRUE RegionNode 251 // 'new_true'. Figure out which edges into the RegionNode eventually lead up 464 ifpx->set_req(0, ifpx); // A TRUE RegionNode
|
H A D | callnode.cpp | 1384 RegionNode *r = ctrl->as_Region(); 1504 bool AbstractLockNode::find_unlocks_for_region(const RegionNode* region, LockNode* lock,
|
H A D | callnode.hpp | 885 bool find_unlocks_for_region(const RegionNode* region, LockNode* lock,
|
H A D | loopnode.cpp | 267 // Counted loop head must be a good RegionNode with only 3 not NULL 845 return RegionNode::Ideal(phase, can_reshape); 854 return RegionNode::Ideal(phase, can_reshape); 1184 // private RegionNode before the loop. This becomes the loop landing pad. 1189 // Make a new RegionNode to be the landing pad. 1190 Node *landing_pad = new (phase->C) RegionNode( fall_in_cnt+1 ); 1253 // Finally clean out the fall-in edges from the RegionNode 1390 Node *r = new (phase->C) RegionNode(1); 1471 // Insert a LoopNode to replace the RegionNode. 2721 // number as the RegionNode the [all...] |
H A D | node.hpp | 125 class RegionNode; 464 // Find the one non-null required input. RegionNode only 799 // Ideal beginning Nodes are RootNode, RegionNode and StartNode.
|
H A D | parse2.cpp | 177 Node *region = new (C) RegionNode(3); // 2 results
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | vmStructs.cpp | 1748 declare_c2_type(RegionNode, Node) \ 1827 declare_c2_type(LoopNode, RegionNode) \
|