LLVM API Documentation
#include <MachineDominators.h>
Public Attributes | |
DominatorTreeBase < MachineBasicBlock > * | DT |
Static Public Attributes | |
static char | ID = 0 |
Additional Inherited Members | |
![]() | |
static const PassInfo * | lookupPassInfo (const void *TI) |
static const PassInfo * | lookupPassInfo (StringRef Arg) |
static Pass * | createPass (AnalysisID ID) |
![]() | |
MachineFunctionPass (char &ID) | |
DominatorTree Class - Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Definition at line 40 of file MachineDominators.h.
MachineDominatorTree::MachineDominatorTree | ( | ) |
Definition at line 43 of file MachineDominators.cpp.
References DT, llvm::PassRegistry::getPassRegistry(), and llvm::initializeMachineDominatorTreePass().
MachineDominatorTree::~MachineDominatorTree | ( | ) |
Definition at line 49 of file MachineDominators.cpp.
References DT.
|
inline |
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.
References DT.
|
inline |
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.
References DT.
|
inline |
Definition at line 145 of file MachineDominators.h.
References DT.
|
inline |
Definition at line 71 of file MachineDominators.h.
References DT.
|
inline |
Definition at line 76 of file MachineDominators.h.
References DT.
|
inline |
Definition at line 83 of file MachineDominators.h.
References llvm::ARM_PROC::A, llvm::MachineBasicBlock::begin(), DT, llvm::MachineInstr::getParent(), and I.
|
inline |
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.
References DT.
|
inline |
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.
References DT.
|
virtual |
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.
|
inline |
Definition at line 49 of file MachineDominators.h.
References DT.
|
inline |
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.
References DT.
|
inline |
Definition at line 61 of file MachineDominators.h.
References DT.
|
inline |
Definition at line 65 of file MachineDominators.h.
References DT.
Referenced by llvm::GraphTraits< MachineDominatorTree * >::getEntryNode().
|
inline |
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.
References DT.
|
inline |
isReachableFromEntry - Return true if A is dominated by the entry block of the function containing it.
Definition at line 165 of file MachineDominators.h.
References DT.
|
inline |
Definition at line 118 of file MachineDominators.h.
References DT.
|
virtual |
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.
|
inline |
Definition at line 101 of file MachineDominators.h.
References DT.
|
inline |
Definition at line 106 of file MachineDominators.h.
References DT.
|
virtual |
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.
|
virtual |
runOnMachineFunction - This method must be overloaded to perform the desired machine code transformation or analysis.
Implements llvm::MachineFunctionPass.
Definition at line 37 of file MachineDominators.cpp.
References DT.
|
inline |
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.
References DT.
DominatorTreeBase<MachineBasicBlock>* llvm::MachineDominatorTree::DT |
Definition at line 43 of file MachineDominators.h.
Referenced by addNewBlock(), changeImmediateDominator(), dominates(), eraseNode(), findNearestCommonDominator(), getBase(), getNode(), getRoot(), getRootNode(), getRoots(), isReachableFromEntry(), MachineDominatorTree(), operator[](), print(), properlyDominates(), releaseMemory(), runOnMachineFunction(), splitBlock(), and ~MachineDominatorTree().
|
static |
Definition at line 42 of file MachineDominators.h.