LLVM API Documentation

llvm::DominatorTreeBase< NodeT > Member List
This is the complete list of members for llvm::DominatorTreeBase< NodeT >, including all inherited members.
addNewBlock(NodeT *BB, NodeT *DomBB)llvm::DominatorTreeBase< NodeT > [inline]
addRoot(NodeT *BB)llvm::DominatorTreeBase< NodeT > [inline, protected]
addRoot(MachineBasicBlock *MBB)llvm::DominatorTreeBase< NodeT > [inline, protected]
Calculate(DominatorTreeBase< typename GraphTraits< N >::NodeType > &DT, FuncT &F)llvm::DominatorTreeBase< NodeT > [friend]
changeImmediateDominator(DomTreeNodeBase< NodeT > *N, DomTreeNodeBase< NodeT > *NewIDom)llvm::DominatorTreeBase< NodeT > [inline]
changeImmediateDominator(NodeT *BB, NodeT *NewBB)llvm::DominatorTreeBase< NodeT > [inline]
compare(const DominatorTreeBase &Other) const llvm::DominatorTreeBase< NodeT > [inline]
DFSInfoValidllvm::DominatorTreeBase< NodeT > [mutable, protected]
DFSPass(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned N)llvm::DominatorTreeBase< NodeT > [friend]
dominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const llvm::DominatorTreeBase< NodeT > [inline]
dominates(const NodeT *A, const NodeT *B) const llvm::DominatorTreeBase< NodeT >
DominatorBase(bool isPostDom)llvm::DominatorBase< NodeT > [inline, explicit, protected]
DominatorTreeBase(bool isPostDom)llvm::DominatorTreeBase< NodeT > [inline, explicit]
DomTreeNodeMapType typedefllvm::DominatorTreeBase< NodeT > [protected]
DomTreeNodesllvm::DominatorTreeBase< NodeT > [protected]
eraseNode(NodeT *BB)llvm::DominatorTreeBase< NodeT > [inline]
Eval(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned LastLinked)llvm::DominatorTreeBase< NodeT > [friend]
findNearestCommonDominator(NodeT *A, NodeT *B)llvm::DominatorTreeBase< NodeT > [inline]
findNearestCommonDominator(const NodeT *A, const NodeT *B)llvm::DominatorTreeBase< NodeT > [inline]
getDescendants(NodeT *R, SmallVectorImpl< NodeT * > &Result) const llvm::DominatorTreeBase< NodeT > [inline]
getIDom(NodeT *BB) const llvm::DominatorTreeBase< NodeT > [inline, protected]
getNode(NodeT *BB) const llvm::DominatorTreeBase< NodeT > [inline]
getNodeForBlock(NodeT *BB)llvm::DominatorTreeBase< NodeT > [inline, protected]
getRoot() const llvm::DominatorTreeBase< NodeT > [inline]
getRootNode()llvm::DominatorTreeBase< NodeT > [inline]
getRootNode() const llvm::DominatorTreeBase< NodeT > [inline]
getRoots() const llvm::DominatorBase< NodeT > [inline]
IDomsllvm::DominatorTreeBase< NodeT > [protected]
Infollvm::DominatorTreeBase< NodeT > [protected]
isPostDominator() const llvm::DominatorBase< NodeT > [inline]
IsPostDominatorsllvm::DominatorBase< NodeT > [protected]
isReachableFromEntry(const NodeT *A) const llvm::DominatorTreeBase< NodeT > [inline]
isReachableFromEntry(const DomTreeNodeBase< NodeT > *A) const llvm::DominatorTreeBase< NodeT > [inline]
operator[](NodeT *BB) const llvm::DominatorTreeBase< NodeT > [inline]
print(raw_ostream &o) const llvm::DominatorTreeBase< NodeT > [inline]
properlyDominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const llvm::DominatorTreeBase< NodeT > [inline]
properlyDominates(const NodeT *A, const NodeT *B) const llvm::DominatorTreeBase< NodeT >
recalculate(FT &F)llvm::DominatorTreeBase< NodeT > [inline]
releaseMemory()llvm::DominatorTreeBase< NodeT > [inline, virtual]
removeNode(NodeT *BB)llvm::DominatorTreeBase< NodeT > [inline]
reset()llvm::DominatorTreeBase< NodeT > [inline, protected]
RootNodellvm::DominatorTreeBase< NodeT > [protected]
Rootsllvm::DominatorBase< NodeT > [protected]
SlowQueriesllvm::DominatorTreeBase< NodeT > [mutable, protected]
Split(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *NewBB)llvm::DominatorTreeBase< NodeT > [inline, protected]
splitBlock(NodeT *NewBB)llvm::DominatorTreeBase< NodeT > [inline]
updateDFSNumbers() const llvm::DominatorTreeBase< NodeT > [inline, protected]
Vertexllvm::DominatorTreeBase< NodeT > [protected]
~DominatorTreeBase()llvm::DominatorTreeBase< NodeT > [inline, virtual]