| addNewBlock(NodeT *BB, NodeT *DomBB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| addRoot(NodeT *BB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inlineprotected |
| addRoot(MachineBasicBlock *MBB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inlineprotected |
| applyUpdates(ArrayRef< UpdateType > Updates) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| Base typedef | llvm::PostDominatorTree | |
| changeImmediateDominator(DomTreeNodeBase< NodeT > *N, DomTreeNodeBase< NodeT > *NewIDom) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| changeImmediateDominator(NodeT *BB, NodeT *NewBB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| compare(const DominatorTreeBase &Other) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| Delete | llvm::DominatorTreeBase< NodeT, IsPostDom > | static |
| deleteEdge(NodeT *From, NodeT *To) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| DFSInfoValid | llvm::DominatorTreeBase< NodeT, IsPostDom > | mutableprotected |
| dominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| dominates(const NodeT *A, const NodeT *B) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| DominatorTreeBase() | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| DominatorTreeBase(DominatorTreeBase &&Arg) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| DominatorTreeBase(const DominatorTreeBase &)=delete | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| DomTreeNodeMapType typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | protected |
| DomTreeNodes | llvm::DominatorTreeBase< NodeT, IsPostDom > | protected |
| eraseNode(NodeT *BB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| findNearestCommonDominator(NodeT *A, NodeT *B) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| findNearestCommonDominator(const NodeT *A, const NodeT *B) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| getDescendants(NodeT *R, SmallVectorImpl< NodeT *> &Result) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| getNode(const NodeT *BB) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| getRoot() const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| getRootNode() | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| getRootNode() const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| getRoots() const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| Insert | llvm::DominatorTreeBase< NodeT, IsPostDom > | static |
| insertEdge(NodeT *From, NodeT *To) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| invalidate(Function &F, const PreservedAnalyses &PA, FunctionAnalysisManager::Invalidator &) | llvm::PostDominatorTree | |
| IsPostDominator | llvm::DominatorTreeBase< NodeT, IsPostDom > | static |
| isPostDominator() const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| isReachableFromEntry(const NodeT *A) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| isReachableFromEntry(const DomTreeNodeBase< NodeT > *A) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| isVirtualRoot(const DomTreeNodeBase< NodeT > *A) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| NodePtr typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| NodeType typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| operator=(DominatorTreeBase &&RHS) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| operator=(const DominatorTreeBase &)=delete | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| operator[](const NodeT *BB) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| Parent | llvm::DominatorTreeBase< NodeT, IsPostDom > | protected |
| ParentPtr typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| ParentType typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| PostDominatorTree()=default | llvm::PostDominatorTree | |
| PostDominatorTree(Function &F) | llvm::PostDominatorTree | inlineexplicit |
| print(raw_ostream &O) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| properlyDominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| properlyDominates(const NodeT *A, const NodeT *B) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| recalculate(ParentType &Func) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| recalculate(ParentType &Func, ArrayRef< UpdateType > Updates) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| releaseMemory() | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| reset() | llvm::DominatorTreeBase< NodeT, IsPostDom > | inlineprotected |
| RootNode | llvm::DominatorTreeBase< NodeT, IsPostDom > | protected |
| Roots | llvm::DominatorTreeBase< NodeT, IsPostDom > | protected |
| setNewRoot(NodeT *BB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| SlowQueries | llvm::DominatorTreeBase< NodeT, IsPostDom > | mutableprotected |
| Split(typename GraphTraits< N >::NodeRef NewBB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inlineprotected |
| splitBlock(NodeT *NewBB) | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| updateDFSNumbers() const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
| UpdateKind typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| UpdateType typedef | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| VerificationLevel enum name | llvm::DominatorTreeBase< NodeT, IsPostDom > | |
| verify(VerificationLevel VL=VerificationLevel::Full) const | llvm::DominatorTreeBase< NodeT, IsPostDom > | inline |
