List of all members.
Public Member Functions
| ||MachineDominatorTree ()|
| ||~MachineDominatorTree ()|
< MachineBasicBlock > &
|virtual void ||getAnalysisUsage (AnalysisUsage &AU) const |
< MachineBasicBlock * > &
|getRoots () const |
|MachineBasicBlock * ||getRoot () const |
|MachineDomTreeNode * ||getRootNode () const |
|virtual bool ||runOnMachineFunction (MachineFunction &F)|
|bool ||dominates (const MachineDomTreeNode *A, const MachineDomTreeNode *B) const |
|bool ||dominates (const MachineBasicBlock *A, const MachineBasicBlock *B) const |
|bool ||dominates (const MachineInstr *A, const MachineInstr *B) const |
|bool ||properlyDominates (const MachineDomTreeNode *A, const MachineDomTreeNode *B) const |
|bool ||properlyDominates (const MachineBasicBlock *A, const MachineBasicBlock *B) const |
|MachineBasicBlock * ||findNearestCommonDominator (MachineBasicBlock *A, MachineBasicBlock *B)|
|MachineDomTreeNode * ||operator (MachineBasicBlock *BB) const |
|MachineDomTreeNode * ||getNode (MachineBasicBlock *BB) const |
|MachineDomTreeNode * ||addNewBlock (MachineBasicBlock *BB, MachineBasicBlock *DomBB)|
|void ||changeImmediateDominator (MachineBasicBlock *N, MachineBasicBlock *NewIDom)|
|void ||changeImmediateDominator (MachineDomTreeNode *N, MachineDomTreeNode *NewIDom)|
|void ||eraseNode (MachineBasicBlock *BB)|
|void ||splitBlock (MachineBasicBlock *NewBB)|
|bool ||isReachableFromEntry (const MachineBasicBlock *A)|
|virtual void ||releaseMemory ()|
|virtual void ||print (raw_ostream &OS, const Module *) const |
< MachineBasicBlock > *
Static Public Attributes
|static char ||ID = 0|
DominatorTree Class - Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Definition at line 40 of file MachineDominators.h.
Constructor & Destructor Documentation
Member Function Documentation
addNewBlock - Add a new node to the dominator tree information. This creates a new node as a child of DomBB dominator node,linking it into the children list of the immediate dominator.
Definition at line 132 of file MachineDominators.h.
changeImmediateDominator - This method is used to update the dominator tree information when a node's immediate dominator changes.
Definition at line 140 of file MachineDominators.h.
eraseNode - Removes a node from the dominator tree. Block must not dominate any other blocks. Removes node from its immediate dominator's children list. Deletes dominator node associated with basic block BB.
Definition at line 153 of file MachineDominators.h.
findNearestCommonDominator - Find nearest common dominator basic block for basic block A and B. If there is no such block then return NULL.
Definition at line 113 of file MachineDominators.h.
|virtual void llvm::MachineDominatorTree::getAnalysisUsage
getAnalysisUsage - Subclasses that override getAnalysisUsage must call this.
For MachineFunctionPasses, calling AU.preservesCFG() indicates that the pass does not modify the MachineBasicBlock CFG.
Reimplemented from llvm::MachineFunctionPass.
getNode - return the (Post)DominatorTree node for the specified basic block. This is the same as using operator on this class.
Definition at line 125 of file MachineDominators.h.
|const std::vector<MachineBasicBlock*>& llvm::MachineDominatorTree::getRoots
getRoots - Return the root blocks of the current CFG. This may include multiple blocks if we are computing post dominators. For forward dominators, this will always be a single block (the entry node).
Definition at line 57 of file MachineDominators.h.
isReachableFromEntry - Return true if A is dominated by the entry block of the function containing it.
Definition at line 165 of file MachineDominators.h.
||const Module *
print - Print out the internal state of the pass. This is called by Analyze to print out the contents of an analysis. Otherwise it is not necessary to implement this method. Beware that the module pointer MAY be null. This automatically forwards to a virtual function that does not provide the Module* in case the analysis doesn't need it it can just be ignored.
Reimplemented from llvm::Pass.
Definition at line 57 of file MachineDominators.cpp.
References DT, and llvm::DominatorTreeBase< NodeT >::print().
releaseMemory() - This member can be implemented by a pass if it wants to be able to release its memory when it is no longer needed. The default behavior of passes is to hold onto memory for the entire duration of their lifetime (which is the entire compile time). For pipelined passes, this is not a big deal because that memory gets recycled every time the pass is invoked on another program unit. For IP passes, it is more important to free memory when it is unused.
Optionally implement this function to release pass memory when it is no longer used.
Reimplemented from llvm::Pass.
Definition at line 53 of file MachineDominators.cpp.
References DT, and llvm::DominatorTreeBase< NodeT >::releaseMemory().
splitBlock - BB is split and now it has one successor. Update dominator tree to reflect this change.
Definition at line 159 of file MachineDominators.h.
Member Data Documentation
The documentation for this class was generated from the following files: