addNewBlock(NodeT *BB, NodeT *DomBB) | llvm::DominatorTreeBase< NodeT > | inline |
addRoot(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | inlineprotected |
addRoot(MachineBasicBlock *MBB) | llvm::DominatorTreeBase< NodeT > | inlineprotected |
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(DominatorTreeBase &Other) const | llvm::DominatorTreeBase< NodeT > | inline |
DFSInfoValid | llvm::DominatorTreeBase< NodeT > | 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) | llvm::DominatorTreeBase< NodeT > | inline |
dominates(const NodeT *A, const NodeT *B) | llvm::DominatorTreeBase< NodeT > | |
DominatorBase(bool isPostDom) | llvm::DominatorBase< NodeT > | inlineexplicitprotected |
DominatorTreeBase(bool isPostDom) | llvm::DominatorTreeBase< NodeT > | inlineexplicit |
DomTreeNodeMapType typedef | llvm::DominatorTreeBase< NodeT > | protected |
DomTreeNodes | llvm::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 > | inlineprotected |
getNode(NodeT *BB) const | llvm::DominatorTreeBase< NodeT > | inline |
getNodeForBlock(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | inlineprotected |
getRoot() const | llvm::DominatorTreeBase< NodeT > | inline |
getRootNode() | llvm::DominatorTreeBase< NodeT > | inline |
getRootNode() const | llvm::DominatorTreeBase< NodeT > | inline |
getRoots() const | llvm::DominatorBase< NodeT > | inline |
IDoms | llvm::DominatorTreeBase< NodeT > | protected |
Info | llvm::DominatorTreeBase< NodeT > | protected |
isPostDominator() const | llvm::DominatorBase< NodeT > | inline |
IsPostDominators | llvm::DominatorBase< NodeT > | protected |
isReachableFromEntry(const NodeT *A) const | llvm::DominatorTreeBase< NodeT > | inline |
isReachableFromEntry(const DomTreeNodeBase< NodeT > *A) const | llvm::DominatorTreeBase< NodeT > | inline |
print(raw_ostream &o) const | llvm::DominatorTreeBase< NodeT > | inline |
properlyDominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) | llvm::DominatorTreeBase< NodeT > | inline |
properlyDominates(const NodeT *A, const NodeT *B) | llvm::DominatorTreeBase< NodeT > | |
recalculate(FT &F) | llvm::DominatorTreeBase< NodeT > | inline |
releaseMemory() | llvm::DominatorTreeBase< NodeT > | inlinevirtual |
removeNode(NodeT *BB) | llvm::DominatorTreeBase< NodeT > | inline |
reset() | llvm::DominatorTreeBase< NodeT > | inlineprotected |
RootNode | llvm::DominatorTreeBase< NodeT > | protected |
Roots | llvm::DominatorBase< NodeT > | protected |
SlowQueries | llvm::DominatorTreeBase< NodeT > | protected |
Split(DominatorTreeBase< typename GraphT::NodeType > &DT, typename GraphT::NodeType *NewBB) | llvm::DominatorTreeBase< NodeT > | inlineprotected |
splitBlock(NodeT *NewBB) | llvm::DominatorTreeBase< NodeT > | inline |
updateDFSNumbers() | llvm::DominatorTreeBase< NodeT > | inlineprotected |
Vertex | llvm::DominatorTreeBase< NodeT > | protected |
~DominatorTreeBase() | llvm::DominatorTreeBase< NodeT > | inlinevirtual |