/openjdk7/hotspot/src/share/vm/opto/ |
H A D | rootnode.hpp | 46 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 57 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
|
H A D | mulnode.hpp | 54 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 86 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 102 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 161 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 178 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 195 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 208 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 221 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 247 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 260 virtual Node *Ideal(PhaseGV [all...] |
H A D | rootnode.cpp | 35 //------------------------------Ideal------------------------------------------ 37 Node *RootNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:RootNode 45 // I used to do tail-splitting in the Ideal graph here, but it does not 74 //------------------------------Ideal------------------------------------------ 75 Node *HaltNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:HaltNode
|
H A D | addnode.hpp | 54 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 82 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 96 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 107 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 122 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 146 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 249 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
|
H A D | divnode.hpp | 48 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 61 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 74 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 87 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 100 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 112 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 151 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape) { return NULL; } function in class:DivModNode
|
H A D | connode.hpp | 164 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 177 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 185 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 193 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 227 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 264 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 345 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 358 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 382 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 395 virtual Node *Ideal(PhaseGV [all...] |
H A D | subnode.hpp | 73 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 86 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 110 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 124 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 150 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 170 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 180 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 243 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 299 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
|
H A D | cfgnode.hpp | 96 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 203 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 345 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 403 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 521 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
|
H A D | addnode.cpp | 109 Node *AddNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AddNode 140 assert(false, "dead loop in AddNode::Ideal"); 166 assert(add1->in(1) != this, "dead loop in AddNode::Ideal"); 184 assert(add2->in(1) != this, "dead loop in AddNode::Ideal"); 239 Node *AddINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AddINode 262 "dead loop in AddINode::Ideal" ); 270 assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddINode::Ideal"); 275 assert(in1->in(1) != this && in2->in(1) != this,"dead loop in AddINode::Ideal"); 280 assert(in1->in(1) != this && in2->in(2) != this,"dead loop in AddINode::Ideal"); 285 assert(in1->in(2) != this && in2->in(1) != this,"dead loop in AddINode::Ideal"); 371 Node *AddLNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AddLNode 513 Node *AddFNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AddFNode 550 Node *AddDNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AddDNode 570 Node *AddPNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AddPNode 851 Node *MinINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:MinINode [all...] |
H A D | memnode.hpp | 89 // Shared code for Ideal methods: 160 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 217 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 231 virtual Node* Ideal(PhaseGVN *phase, bool can_reshape); 245 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 259 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 286 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 469 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 496 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 506 virtual Node *Ideal(PhaseGV [all...] |
H A D | mulnode.cpp | 56 //------------------------------Ideal------------------------------------------ 59 Node *MulNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:MulNode 93 assert(false, "dead loop in MulNode::Ideal"); 118 assert( add1->in(1) != add1, "dead loop in MulNode::Ideal" ); 174 //------------------------------Ideal------------------------------------------ 175 // Check for power-of-2 multiply, then try the regular MulNode::Ideal 176 Node *MulINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:MulINode 183 return MulNode::Ideal(phase, can_reshape); 218 return MulNode::Ideal(phase, can_reshape); 270 //------------------------------Ideal 272 Node *MulLNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:MulLNode 468 Node *AndINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AndINode 596 Node *AndLNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AndLNode 646 Node *LShiftINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LShiftINode 758 Node *LShiftLNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LShiftLNode 886 Node *RShiftINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:RShiftINode 1100 Node *URShiftINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:URShiftINode 1246 Node *URShiftLNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:URShiftLNode [all...] |
H A D | connode.cpp | 108 //------------------------------Ideal------------------------------------------ 111 Node *CMoveNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CMoveNode 117 !phase->eqv(in(IfTrue), this), "dead loop in CMoveNode::Ideal" ); 211 //------------------------------Ideal------------------------------------------ 214 Node *CMoveINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CMoveINode 216 Node *x = CMoveNode::Ideal(phase, can_reshape); 220 // constant is on the right (otherwise the shared CMove::Ideal code would 278 //------------------------------Ideal------------------------------------------ 281 Node *CMoveFNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CMoveFNode 283 Node *x = CMoveNode::Ideal(phas 337 Node *CMoveDNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CMoveDNode 428 Node *ConstraintCastNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:ConstraintCastNode 568 Node *CheckCastPPNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:CheckCastPPNode 679 Node *ConvD2INode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ConvD2INode 713 Node *ConvD2LNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ConvD2LNode 750 Node *ConvF2INode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ConvF2INode 777 Node *ConvF2LNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ConvF2LNode 833 Node *ConvI2LNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ConvI2LNode 1018 Node *ConvL2INode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ConvL2INode 1087 Node *CastX2PNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CastX2PNode 1135 Node *CastP2XNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CastP2XNode [all...] |
H A D | callnode.hpp | 78 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 124 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 145 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 432 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 545 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 844 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 966 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 986 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
|
H A D | callnode.cpp | 54 //------------------------------Ideal------------------------------------------ 55 Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:StartNode 151 Node *ReturnNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:ReturnNode 196 Node *RethrowNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:RethrowNode 786 Node *CallNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CallNode 805 return SafePointNode::Ideal(phase, can_reshape); 959 //------------------------------Ideal------------------------------------------ 961 Node *SafePointNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:SafePointNode 1169 Node* AllocateArrayNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:AllocateArrayNode 1548 Node *LockNode::Ideal(PhaseGV function in class:LockNode 1686 Node *UnlockNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:UnlockNode [all...] |
H A D | subnode.cpp | 130 //------------------------------Ideal------------------------------------------ 131 Node *SubINode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:SubINode 143 assert(false, "dead loop in SubINode::Ideal"); 188 assert(false, "dead loop in SubINode::Ideal"); 260 //------------------------------Ideal------------------------------------------ 261 Node *SubLNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:SubLNode 273 assert(false, "dead loop in SubLNode::Ideal"); 316 assert(false, "dead loop in SubLNode::Ideal"); 397 //------------------------------Ideal------------------------------------------ 398 Node *SubFNode::Ideal(PhaseGV function in class:SubFNode 441 Node *SubDNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:SubDNode 580 Node *CmpINode::Ideal( PhaseGVN *phase, bool can_reshape ) { function in class:CmpINode 758 Node *CmpPNode::Ideal( PhaseGVN *phase, bool can_reshape ) { function in class:CmpPNode 936 Node *CmpNNode::Ideal( PhaseGVN *phase, bool can_reshape ) { function in class:CmpNNode 1000 Node *CmpDNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:CmpDNode 1137 Node *BoolNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:BoolNode [all...] |
H A D | divnode.cpp | 88 // Convert a division by constant divisor into an alternate Ideal graph. 340 // Convert a division by constant divisor into an alternate Ideal graph. 464 Node *DivINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:DivINode 563 Node *DivLNode::Ideal( PhaseGVN *phase, bool can_reshape) { function in class:DivLNode 706 Node *DivFNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:DivFNode 800 Node *DivDNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:DivDNode 837 Node *ModINode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:ModINode 894 // Convention is to not transform the return value of an Ideal 895 // since Ideal is expected to return a modified 'this' or a new node. 1008 Node *ModLNode::Ideal(PhaseGV function in class:ModLNode [all...] |
H A D | memnode.cpp | 221 // Equivalent code in PhiNode::Ideal 266 assert(mem != this, "dead loop in MemNode::Ideal"); 383 // Or Region for the check in LoadNode::Ideal(); 490 // (Currently, only LoadNode::Ideal has steps (c), (d). More later.) 950 // everywhere. We need to make a coordinated change: first LoadNode::Ideal 1032 // (This can happen after LoadNode::Ideal resets the load's memory input 1089 // Ideal call instead of an Identity call. 1092 // it must be truncated via an Ideal call. 1277 // since Ideal can't return existing nodes 1414 //------------------------------Ideal 1419 Node *LoadNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoadNode 1793 Node *LoadBNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoadBNode 1825 Node* LoadUBNode::Ideal(PhaseGVN* phase, bool can_reshape) { function in class:LoadUBNode 1855 Node *LoadUSNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoadUSNode 1885 Node *LoadSNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoadSNode 2168 Node *LoadRangeNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoadRangeNode 2291 Node *StoreNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:StoreNode 2495 Node *StoreBNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:StoreBNode 2510 Node *StoreCNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:StoreCNode 2537 Node *StoreCMNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:StoreCMNode 2632 Node *ClearArrayNode::Ideal(PhaseGVN *phase, bool can_reshape){ function in class:ClearArrayNode 2789 Node *StrIntrinsicNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:StrIntrinsicNode 2851 Node *MemBarNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:MemBarNode 4057 Node *MergeMemNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:MergeMemNode [all...] |
H A D | loopnode.hpp | 94 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 169 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 320 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 776 // Compute the Ideal Node to Loop mapping
|
H A D | phaseX.cpp | 678 // Apply the Ideal call in a loop until it no longer applies 682 Node *i = k->Ideal(this, /*can_reshape=*/false); 895 assert(false, "loop in Ideal transformation"); 1037 // Apply the Ideal call in a loop until it no longer applies 1041 Node *i = k->Ideal(this, /*can_reshape=*/true); 1081 i = k->Ideal(this, /*can_reshape=*/true);
|
H A D | cfgnode.cpp | 409 //------------------------------Ideal------------------------------------------ 412 Node *RegionNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:RegionNode 1586 //------------------------------Ideal------------------------------------------ 1589 Node *PhiNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:PhiNode 2063 //------------------------------Ideal------------------------------------------ 2066 Node *PCTableNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:PCTableNode 2199 //------------------------------Ideal------------------------------------------ 2201 Node *NeverBranchNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:NeverBranchNode
|
H A D | loopnode.cpp | 838 //------------------------------Ideal------------------------------------------ 841 Node *LoopNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoopNode 845 return RegionNode::Ideal(phase, can_reshape); 850 //------------------------------Ideal------------------------------------------ 853 Node *CountedLoopNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:CountedLoopNode 854 return RegionNode::Ideal(phase, can_reshape); 908 //------------------------------Ideal------------------------------------------ 910 Node *LoopLimitNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:LoopLimitNode 924 // done to keep Ideal graph simple. 2088 // Create a PhaseLoop. Build the ideal Loop tree. Map each Ideal Nod [all...] |
H A D | ifnode.cpp | 822 //------------------------------Ideal------------------------------------------ 825 Node *IfNode::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:IfNode
|
H A D | node.hpp | 799 // Ideal beginning Nodes are RootNode, RegionNode and StartNode. 807 // The Ideal control projection Nodes are IfTrue/IfFalse, JumpProjNode, Root, 844 virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); 846 // Some nodes have specific Ideal subgraph transformations only if they are 899 // Ideal register class for Matching. Zero means unmatched instruction
|
H A D | node.cpp | 992 //------------------------------Ideal------------------------------------------ 997 // these Ideal calls need to hold. Running with '+VerifyIterativeGVN' checks 999 // hacking an Ideal call, be sure to test with +VerifyIterativeGVN! 1001 // The Ideal call almost arbitrarily reshape the graph rooted at the 'this' 1009 // another Node have the Ideal call make no change and return NULL. 1010 // Example: AddINode::Ideal must check for add of zero; in this case it 1045 Node *Node::Ideal(PhaseGVN *phase, bool can_reshape) { function in class:Node 1046 return NULL; // Default to being Ideal already 1049 // Some nodes have specific Ideal subgraph transformations only if they are
|