LLVM  3.7.0
llvm::DominatorTreeBase< N > Member List

This is the complete list of members for llvm::DominatorTreeBase< N >, including all inherited members.

addNewBlock(NodeT *BB, NodeT *DomBB)llvm::DominatorTreeBase< N >inline
addRoot(NodeT *BB)llvm::DominatorTreeBase< N >inlineprotected
addRoot(MachineBasicBlock *MBB)llvm::DominatorTreeBase< N >inlineprotected
Calculate(DominatorTreeBase< typename GraphTraits< N >::NodeType > &DT, FuncT &F)llvm::DominatorTreeBase< N >friend
changeImmediateDominator(DomTreeNodeBase< NodeT > *N, DomTreeNodeBase< NodeT > *NewIDom)llvm::DominatorTreeBase< N >inline
changeImmediateDominator(NodeT *BB, NodeT *NewBB)llvm::DominatorTreeBase< N >inline
compare(const DominatorTreeBase &Other) const llvm::DominatorTreeBase< N >inline
DFSInfoValidllvm::DominatorTreeBase< N >mutableprotected
DFSPass(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned N)llvm::DominatorTreeBase< N >friend
dominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const llvm::DominatorTreeBase< N >inline
dominates(const NodeT *A, const NodeT *B) const llvm::DominatorTreeBase< N >
DominatorBase(bool isPostDom)llvm::DominatorBase< NodeT >inlineexplicitprotected
DominatorBase(DominatorBase &&Arg)llvm::DominatorBase< NodeT >inlineprotected
DominatorTreeBase(bool isPostDom)llvm::DominatorTreeBase< N >inlineexplicit
DominatorTreeBase(DominatorTreeBase &&Arg)llvm::DominatorTreeBase< N >inline
DomTreeNodeMapType typedefllvm::DominatorTreeBase< N >protected
DomTreeNodesllvm::DominatorTreeBase< N >protected
eraseNode(NodeT *BB)llvm::DominatorTreeBase< N >inline
Eval(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *V, unsigned LastLinked)llvm::DominatorTreeBase< N >friend
findNearestCommonDominator(NodeT *A, NodeT *B)llvm::DominatorTreeBase< N >inline
findNearestCommonDominator(const NodeT *A, const NodeT *B)llvm::DominatorTreeBase< N >inline
getDescendants(NodeT *R, SmallVectorImpl< NodeT * > &Result) const llvm::DominatorTreeBase< N >inline
getIDom(NodeT *BB) const llvm::DominatorTreeBase< N >inlineprotected
getNode(NodeT *BB) const llvm::DominatorTreeBase< N >inline
getNodeForBlock(NodeT *BB)llvm::DominatorTreeBase< N >inlineprotected
getRoot() const llvm::DominatorTreeBase< N >inline
getRootNode()llvm::DominatorTreeBase< N >inline
getRootNode() const llvm::DominatorTreeBase< N >inline
getRoots() const llvm::DominatorBase< NodeT >inline
IDomsllvm::DominatorTreeBase< N >protected
Infollvm::DominatorTreeBase< N >protected
isPostDominator() const llvm::DominatorBase< NodeT >inline
IsPostDominatorsllvm::DominatorBase< NodeT >protected
isReachableFromEntry(const NodeT *A) const llvm::DominatorTreeBase< N >inline
isReachableFromEntry(const DomTreeNodeBase< NodeT > *A) const llvm::DominatorTreeBase< N >inline
operator=(DominatorTreeBase &&RHS)llvm::DominatorTreeBase< N >inline
llvm::DominatorBase::operator=(DominatorBase &&RHS)llvm::DominatorBase< NodeT >inlineprotected
operator[](NodeT *BB) const llvm::DominatorTreeBase< N >inline
print(raw_ostream &o) const llvm::DominatorTreeBase< N >inline
properlyDominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const llvm::DominatorTreeBase< N >inline
properlyDominates(const NodeT *A, const NodeT *B) const llvm::DominatorTreeBase< N >
recalculate(FT &F)llvm::DominatorTreeBase< N >inline
releaseMemory()llvm::DominatorTreeBase< N >inline
reset()llvm::DominatorTreeBase< N >inlineprotected
RootNodellvm::DominatorTreeBase< N >protected
Rootsllvm::DominatorBase< NodeT >protected
SlowQueriesllvm::DominatorTreeBase< N >mutableprotected
Split(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *NewBB)llvm::DominatorTreeBase< N >inlineprotected
splitBlock(NodeT *NewBB)llvm::DominatorTreeBase< N >inline
updateDFSNumbers() const llvm::DominatorTreeBase< N >inline
Vertexllvm::DominatorTreeBase< N >protected