llvm::DominatorTree Member List

This is the complete list of members for llvm::DominatorTree, including all inherited members.

addNewBlock(BasicBlock *BB, BasicBlock *DomBB)	llvm::DominatorTreeBase< BasicBlock >	[inline]
addRoot(BasicBlock *BB)	llvm::DominatorTreeBase< BasicBlock >	[inline, protected]
Base typedef	llvm::DominatorTree
Calculate(DominatorTreeBase< typename GraphTraits< N >::NodeType > &DT, FuncT &F)	llvm::DominatorTreeBase< BasicBlock >	[friend]
changeImmediateDominator(DomTreeNodeBase< BasicBlock > *N, DomTreeNodeBase< BasicBlock > *NewIDom)	llvm::DominatorTreeBase< BasicBlock >	[inline]
changeImmediateDominator(BasicBlock *BB, BasicBlock *NewBB)	llvm::DominatorTreeBase< BasicBlock >	[inline]
compare(const DominatorTree &Other) const	llvm::DominatorTree	[inline]
DominatorTreeBase< BasicBlock >::compare(const DominatorTreeBase &Other) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
DFSInfoValid	llvm::DominatorTreeBase< BasicBlock >	[mutable, protected]
DFSPass(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned N)	llvm::DominatorTreeBase< BasicBlock >	[friend]
dominates(const Instruction *Def, const Use &U) const	llvm::DominatorTree
dominates(const Instruction *Def, const Instruction *User) const	llvm::DominatorTree
dominates(const Instruction *Def, const BasicBlock *BB) const	llvm::DominatorTree
dominates(const BasicBlockEdge &BBE, const Use &U) const	llvm::DominatorTree
dominates(const BasicBlockEdge &BBE, const BasicBlock *BB) const	llvm::DominatorTree
DominatorTreeBase< BasicBlock >::dominates(const DomTreeNodeBase< BasicBlock > *A, const DomTreeNodeBase< BasicBlock > *B) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
DominatorTreeBase< BasicBlock >::dominates(const BasicBlock *A, const BasicBlock *B) const	llvm::DominatorTreeBase< BasicBlock >
DominatorBase(bool isPostDom)	llvm::DominatorBase< BasicBlock >	[inline, explicit, protected]
DominatorTree()	llvm::DominatorTree	[inline]
DominatorTreeBase(bool isPostDom)	llvm::DominatorTreeBase< BasicBlock >	[inline, explicit]
DomTreeNodeMapType typedef	llvm::DominatorTreeBase< BasicBlock >	[protected]
DomTreeNodes	llvm::DominatorTreeBase< BasicBlock >	[protected]
eraseNode(BasicBlock *BB)	llvm::DominatorTreeBase< BasicBlock >	[inline]
Eval(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned LastLinked)	llvm::DominatorTreeBase< BasicBlock >	[friend]
findNearestCommonDominator(BasicBlock *A, BasicBlock *B)	llvm::DominatorTreeBase< BasicBlock >	[inline]
findNearestCommonDominator(const BasicBlock *A, const BasicBlock *B)	llvm::DominatorTreeBase< BasicBlock >	[inline]
getDescendants(BasicBlock *R, SmallVectorImpl< BasicBlock * > &Result) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
getIDom(BasicBlock *BB) const	llvm::DominatorTreeBase< BasicBlock >	[inline, protected]
getNode(BasicBlock *BB) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
getNodeForBlock(BasicBlock *BB)	llvm::DominatorTreeBase< BasicBlock >	[inline, protected]
getRoot() const	llvm::DominatorTreeBase< BasicBlock >	[inline]
getRootNode()	llvm::DominatorTreeBase< BasicBlock >	[inline]
getRootNode() const	llvm::DominatorTreeBase< BasicBlock >	[inline]
getRoots() const	llvm::DominatorBase< BasicBlock >	[inline]
IDoms	llvm::DominatorTreeBase< BasicBlock >	[protected]
Info	llvm::DominatorTreeBase< BasicBlock >	[protected]
isPostDominator() const	llvm::DominatorBase< BasicBlock >	[inline]
IsPostDominators	llvm::DominatorBase< BasicBlock >	[protected]
isReachableFromEntry(const Use &U) const	llvm::DominatorTree
DominatorTreeBase< BasicBlock >::isReachableFromEntry(const BasicBlock *A) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
DominatorTreeBase< BasicBlock >::isReachableFromEntry(const DomTreeNodeBase< BasicBlock > *A) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
operator[](BasicBlock *BB) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
print(raw_ostream &o) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
properlyDominates(const DomTreeNodeBase< BasicBlock > *A, const DomTreeNodeBase< BasicBlock > *B) const	llvm::DominatorTreeBase< BasicBlock >	[inline]
properlyDominates(const BasicBlock *A, const BasicBlock *B) const	llvm::DominatorTreeBase< BasicBlock >
recalculate(FT &F)	llvm::DominatorTreeBase< BasicBlock >	[inline]
releaseMemory()	llvm::DominatorTreeBase< BasicBlock >	[inline, virtual]
removeNode(BasicBlock *BB)	llvm::DominatorTreeBase< BasicBlock >	[inline]
reset()	llvm::DominatorTreeBase< BasicBlock >	[inline, protected]
RootNode	llvm::DominatorTreeBase< BasicBlock >	[protected]
Roots	llvm::DominatorBase< BasicBlock >	[protected]
SlowQueries	llvm::DominatorTreeBase< BasicBlock >	[mutable, protected]
Split(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *NewBB)	llvm::DominatorTreeBase< BasicBlock >	[inline, protected]
splitBlock(BasicBlock *NewBB)	llvm::DominatorTreeBase< BasicBlock >	[inline]
updateDFSNumbers() const	llvm::DominatorTreeBase< BasicBlock >	[inline, protected]
verifyDomTree() const	llvm::DominatorTree
Vertex	llvm::DominatorTreeBase< BasicBlock >	[protected]
~DominatorTreeBase()	llvm::DominatorTreeBase< BasicBlock >	[inline, virtual]