LLVM  4.0.0
llvm::DominatorTree Member List

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

addNewBlock(NodeT *BB, NodeT *DomBB)llvm::DominatorTreeBase< BasicBlock >inline
addRoot(NodeT *BB)llvm::DominatorTreeBase< BasicBlock >inlineprotected
Base typedefllvm::DominatorTree
changeImmediateDominator(DomTreeNodeBase< NodeT > *BasicBlock, DomTreeNodeBase< NodeT > *NewIDom)llvm::DominatorTreeBase< BasicBlock >inline
changeImmediateDominator(NodeT *BB, NodeT *NewBB)llvm::DominatorTreeBase< BasicBlock >inline
compare(const DominatorTree &Other) const llvm::DominatorTreeinline
DominatorTreeBase< BasicBlock >::compare(const DominatorTreeBase &Other) constllvm::DominatorTreeBase< BasicBlock >inline
DFSInfoValidllvm::DominatorTreeBase< BasicBlock >mutableprotected
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< NodeT > *A, const DomTreeNodeBase< NodeT > *B) constllvm::DominatorTreeBase< BasicBlock >inline
DominatorTreeBase< BasicBlock >::dominates(const NodeT *A, const NodeT *B) constllvm::DominatorTreeBase< BasicBlock >
DominatorBase(bool isPostDom)llvm::DominatorBase< NodeT >inlineexplicitprotected
DominatorBase(DominatorBase &&Arg)llvm::DominatorBase< NodeT >inlineprotected
DominatorTree()llvm::DominatorTreeinline
DominatorTree(Function &F)llvm::DominatorTreeinlineexplicit
DominatorTreeBase(bool isPostDom)llvm::DominatorTreeBase< BasicBlock >inlineexplicit
DominatorTreeBase(DominatorTreeBase &&Arg)llvm::DominatorTreeBase< BasicBlock >inline
DomTreeNodeMapType typedefllvm::DominatorTreeBase< BasicBlock >protected
DomTreeNodesllvm::DominatorTreeBase< BasicBlock >protected
eraseNode(NodeT *BB)llvm::DominatorTreeBase< BasicBlock >inline
findNearestCommonDominator(NodeT *A, NodeT *B)llvm::DominatorTreeBase< BasicBlock >inline
findNearestCommonDominator(const NodeT *A, const NodeT *B)llvm::DominatorTreeBase< BasicBlock >inline
getDescendants(NodeT *R, SmallVectorImpl< NodeT * > &Result) constllvm::DominatorTreeBase< BasicBlock >inline
getIDom(NodeT *BB) constllvm::DominatorTreeBase< BasicBlock >inlineprotected
getNode(NodeT *BB) constllvm::DominatorTreeBase< BasicBlock >inline
getNodeForBlock(NodeT *BB)llvm::DominatorTreeBase< BasicBlock >inlineprotected
getRoot() constllvm::DominatorTreeBase< BasicBlock >inline
getRootNode()llvm::DominatorTreeBase< BasicBlock >inline
getRootNode() constllvm::DominatorTreeBase< BasicBlock >inline
getRoots() const llvm::DominatorBase< NodeT >inline
IDomsllvm::DominatorTreeBase< BasicBlock >protected
Infollvm::DominatorTreeBase< BasicBlock >protected
isPostDominator() const llvm::DominatorBase< NodeT >inline
IsPostDominatorsllvm::DominatorBase< NodeT >protected
isReachableFromEntry(const Use &U) const llvm::DominatorTree
DominatorTreeBase< BasicBlock >::isReachableFromEntry(const NodeT *A) constllvm::DominatorTreeBase< BasicBlock >inline
DominatorTreeBase< BasicBlock >::isReachableFromEntry(const DomTreeNodeBase< NodeT > *A) constllvm::DominatorTreeBase< BasicBlock >inline
operator=(DominatorTreeBase &&RHS)llvm::DominatorTreeBase< BasicBlock >inline
llvm::DominatorBase::operator=(DominatorBase &&RHS)llvm::DominatorBase< NodeT >inlineprotected
operator[](NodeT *BB) constllvm::DominatorTreeBase< BasicBlock >inline
print(raw_ostream &o) constllvm::DominatorTreeBase< BasicBlock >inline
properlyDominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) constllvm::DominatorTreeBase< BasicBlock >inline
properlyDominates(const NodeT *A, const NodeT *B) constllvm::DominatorTreeBase< BasicBlock >
recalculate(FT &F)llvm::DominatorTreeBase< BasicBlock >inline
releaseMemory()llvm::DominatorTreeBase< BasicBlock >inline
reset()llvm::DominatorTreeBase< BasicBlock >inlineprotected
RootNodellvm::DominatorTreeBase< BasicBlock >protected
Rootsllvm::DominatorBase< NodeT >protected
setNewRoot(NodeT *BB)llvm::DominatorTreeBase< BasicBlock >inline
SlowQueriesllvm::DominatorTreeBase< BasicBlock >mutableprotected
Split(DominatorTreeBaseByGraphTraits< GraphT > &DT, typename GraphT::NodeRef NewBB)llvm::DominatorTreeBase< BasicBlock >inlineprotected
splitBlock(NodeT *NewBB)llvm::DominatorTreeBase< BasicBlock >inline
updateDFSNumbers() constllvm::DominatorTreeBase< BasicBlock >inline
verifyDomTree() const llvm::DominatorTree
Vertexllvm::DominatorTreeBase< BasicBlock >protected