LLVM API Documentation
#include <MachineDominators.h>
DominatorTree Class - Concrete subclass of DominatorTreeBase that is used to compute a normal dominator tree.
Definition at line 41 of file MachineDominators.h.
Definition at line 45 of file MachineDominators.cpp.
References DT, llvm::PassRegistry::getPassRegistry(), and llvm::initializeMachineDominatorTreePass().
Definition at line 51 of file MachineDominators.cpp.
References DT.
MachineDomTreeNode* llvm::MachineDominatorTree::addNewBlock | ( | MachineBasicBlock * | BB, |
MachineBasicBlock * | DomBB | ||
) | [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 244 of file MachineDominators.h.
void llvm::MachineDominatorTree::changeImmediateDominator | ( | MachineBasicBlock * | N, |
MachineBasicBlock * | NewIDom | ||
) | [inline] |
changeImmediateDominator - This method is used to update the dominator tree information when a node's immediate dominator changes.
Definition at line 253 of file MachineDominators.h.
void llvm::MachineDominatorTree::changeImmediateDominator | ( | MachineDomTreeNode * | N, |
MachineDomTreeNode * | NewIDom | ||
) | [inline] |
Definition at line 259 of file MachineDominators.h.
bool llvm::MachineDominatorTree::dominates | ( | const MachineDomTreeNode * | A, |
const MachineDomTreeNode * | B | ||
) | const [inline] |
Definition at line 175 of file MachineDominators.h.
Referenced by computeADRP(), and isCandidate().
bool llvm::MachineDominatorTree::dominates | ( | const MachineBasicBlock * | A, |
const MachineBasicBlock * | B | ||
) | const [inline] |
Definition at line 181 of file MachineDominators.h.
bool llvm::MachineDominatorTree::dominates | ( | const MachineInstr * | A, |
const MachineInstr * | B | ||
) | const [inline] |
Definition at line 189 of file MachineDominators.h.
References llvm::ARM_PROC::A, llvm::MachineBasicBlock::begin(), llvm::MachineInstr::getParent(), and I.
void llvm::MachineDominatorTree::eraseNode | ( | MachineBasicBlock * | BB | ) | [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 268 of file MachineDominators.h.
MachineBasicBlock* llvm::MachineDominatorTree::findNearestCommonDominator | ( | MachineBasicBlock * | A, |
MachineBasicBlock * | B | ||
) | [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 222 of file MachineDominators.h.
void llvm::MachineDominatorTree::getAnalysisUsage | ( | AnalysisUsage & | AU | ) | const [override, 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.
Definition at line 147 of file MachineDominators.h.
MachineDomTreeNode* llvm::MachineDominatorTree::getNode | ( | MachineBasicBlock * | BB | ) | const [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 236 of file MachineDominators.h.
MachineBasicBlock* llvm::MachineDominatorTree::getRoot | ( | ) | const [inline] |
Definition at line 163 of file MachineDominators.h.
MachineDomTreeNode* llvm::MachineDominatorTree::getRootNode | ( | ) | const [inline] |
Definition at line 168 of file MachineDominators.h.
Referenced by llvm::GraphTraits< MachineDominatorTree * >::getEntryNode().
const std::vector<MachineBasicBlock*>& llvm::MachineDominatorTree::getRoots | ( | ) | const [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 158 of file MachineDominators.h.
bool llvm::MachineDominatorTree::isReachableFromEntry | ( | const MachineBasicBlock * | A | ) | [inline] |
isReachableFromEntry - Return true if A is dominated by the entry block of the function containing it.
Definition at line 282 of file MachineDominators.h.
MachineDomTreeNode* llvm::MachineDominatorTree::operator[] | ( | MachineBasicBlock * | BB | ) | const [inline] |
Definition at line 228 of file MachineDominators.h.
void MachineDominatorTree::print | ( | raw_ostream & | O, |
const Module * | M | ||
) | const [override, 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 59 of file MachineDominators.cpp.
References DT, and llvm::DominatorTreeBase< NodeT >::print().
bool llvm::MachineDominatorTree::properlyDominates | ( | const MachineDomTreeNode * | A, |
const MachineDomTreeNode * | B | ||
) | const [inline] |
Definition at line 208 of file MachineDominators.h.
bool llvm::MachineDominatorTree::properlyDominates | ( | const MachineBasicBlock * | A, |
const MachineBasicBlock * | B | ||
) | const [inline] |
Definition at line 214 of file MachineDominators.h.
void llvm::MachineDominatorTree::recordSplitCriticalEdge | ( | MachineBasicBlock * | FromBB, |
MachineBasicBlock * | ToBB, | ||
MachineBasicBlock * | NewBB | ||
) | [inline] |
Record that the critical edge (FromBB, ToBB) has been split with NewBB. This is best to use this method instead of directly update the underlying information, because this helps mitigating the number of time the DT information is invalidated.
Definition at line 303 of file MachineDominators.h.
void MachineDominatorTree::releaseMemory | ( | ) | [override, 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 55 of file MachineDominators.cpp.
References DT, and llvm::DominatorTreeBase< NodeT >::releaseMemory().
bool MachineDominatorTree::runOnMachineFunction | ( | MachineFunction & | MF | ) | [override, 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 llvm::SmallSet< T, N, C >::clear(), llvm::SmallVectorImpl< T >::clear(), DT, and llvm::DominatorTreeBase< NodeT >::recalculate().
void llvm::MachineDominatorTree::splitBlock | ( | MachineBasicBlock * | NewBB | ) | [inline] |
splitBlock - BB is split and now it has one successor. Update dominator tree to reflect this change.
Definition at line 275 of file MachineDominators.h.
Definition at line 141 of file MachineDominators.h.
Referenced by MachineDominatorTree(), print(), releaseMemory(), runOnMachineFunction(), and ~MachineDominatorTree().
char MachineDominatorTree::ID = 0 [static] |
Definition at line 140 of file MachineDominators.h.