| addNewBlock(T *BB, T *DomBB) | llvm::DominatorTreeBase< T, true > | inline |
| addRoot(T *BB) | llvm::DominatorTreeBase< T, true > | inlineprotected |
| applyUpdates(ArrayRef< UpdateType > Updates) | llvm::DominatorTreeBase< T, true > | inline |
| applyUpdates(ArrayRef< UpdateType > Updates, ArrayRef< UpdateType > PostViewUpdates) | llvm::DominatorTreeBase< T, true > | inline |
| Base typedef | llvm::PostDominatorTree | |
| BlockNumberEpoch | llvm::DominatorTreeBase< T, true > | protected |
| changeImmediateDominator(DomTreeNodeBase< T > *N, DomTreeNodeBase< T > *NewIDom) | llvm::DominatorTreeBase< T, true > | inline |
| changeImmediateDominator(T *BB, T *NewBB) | llvm::DominatorTreeBase< T, true > | inline |
| compare(const DominatorTreeBase &Other) const | llvm::DominatorTreeBase< T, true > | inline |
| const_root_iterator typedef | llvm::DominatorTreeBase< T, true > | |
| createNode(T *BB, DomTreeNodeBase< T > *IDom=nullptr) | llvm::DominatorTreeBase< T, true > | inlineprotected |
| Delete | llvm::DominatorTreeBase< T, true > | static |
| deleteEdge(T *From, T *To) | llvm::DominatorTreeBase< T, true > | inline |
| DFSInfoValid | llvm::DominatorTreeBase< T, true > | mutableprotected |
| dominates(const Instruction *I1, const Instruction *I2) const | llvm::PostDominatorTree | |
| dominates(const DomTreeNodeBase< T > *A, const DomTreeNodeBase< T > *B) const | llvm::PostDominatorTree | inline |
| dominates(const T *A, const T *B) const | llvm::PostDominatorTree | |
| DominatorTreeBase()=default | llvm::DominatorTreeBase< T, true > | |
| DominatorTreeBase(DominatorTreeBase &&Arg) | llvm::DominatorTreeBase< T, true > | inline |
| DominatorTreeBase(const DominatorTreeBase &)=delete | llvm::DominatorTreeBase< T, true > | |
| DomTreeNodes | llvm::DominatorTreeBase< T, true > | protected |
| DomTreeNodeStorageTy typedef | llvm::DominatorTreeBase< T, true > | protected |
| eraseNode(T *BB) | llvm::DominatorTreeBase< T, true > | inline |
| findNearestCommonDominator(T *A, T *B) const | llvm::DominatorTreeBase< T, true > | inline |
| findNearestCommonDominator(const T *A, const T *B) const | llvm::DominatorTreeBase< T, true > | inline |
| findNearestCommonDominator(iterator_range< IteratorTy > Nodes) const | llvm::DominatorTreeBase< T, true > | inline |
| getDescendants(T *R, SmallVectorImpl< T * > &Result) const | llvm::DominatorTreeBase< T, true > | inline |
| getNode(const T *BB) const | llvm::DominatorTreeBase< T, true > | inline |
| getRoot() const | llvm::DominatorTreeBase< T, true > | inline |
| getRootNode() | llvm::DominatorTreeBase< T, true > | inline |
| getRootNode() const | llvm::DominatorTreeBase< T, true > | inline |
| Insert | llvm::DominatorTreeBase< T, true > | static |
| insertEdge(T *From, T *To) | llvm::DominatorTreeBase< T, true > | inline |
| invalidate(Function &F, const PreservedAnalyses &PA, FunctionAnalysisManager::Invalidator &) | llvm::PostDominatorTree | |
| IsPostDominator | llvm::DominatorTreeBase< T, true > | static |
| isPostDominator() const | llvm::DominatorTreeBase< T, true > | inline |
| isReachableFromEntry(const T *A) const | llvm::DominatorTreeBase< T, true > | inline |
| isReachableFromEntry(const DomTreeNodeBase< T > *A) const | llvm::DominatorTreeBase< T, true > | inline |
| isVirtualRoot(const DomTreeNodeBase< T > *A) const | llvm::DominatorTreeBase< T, true > | inline |
| NodeNumberMap | llvm::DominatorTreeBase< T, true > | protected |
| NodePtr typedef | llvm::DominatorTreeBase< T, true > | |
| NodeTrait typedef | llvm::DominatorTreeBase< T, true > | |
| NodeType typedef | llvm::DominatorTreeBase< T, true > | |
| operator=(DominatorTreeBase &&RHS) | llvm::DominatorTreeBase< T, true > | inline |
| operator=(const DominatorTreeBase &)=delete | llvm::DominatorTreeBase< T, true > | |
| operator[](const T *BB) const | llvm::DominatorTreeBase< T, true > | inline |
| Parent | llvm::DominatorTreeBase< T, true > | protected |
| ParentPtr typedef | llvm::DominatorTreeBase< T, true > | |
| ParentType typedef | llvm::DominatorTreeBase< T, true > | |
| PostDominatorTree()=default | llvm::PostDominatorTree | |
| PostDominatorTree(Function &F) | llvm::PostDominatorTree | inlineexplicit |
| print(raw_ostream &O) const | llvm::DominatorTreeBase< T, true > | inline |
| properlyDominates(const DomTreeNodeBase< T > *A, const DomTreeNodeBase< T > *B) const | llvm::DominatorTreeBase< T, true > | inline |
| properlyDominates(const T *A, const T *B) const | llvm::DominatorTreeBase< T, true > | |
| recalculate(ParentType &Func) | llvm::DominatorTreeBase< T, true > | inline |
| recalculate(ParentType &Func, ArrayRef< UpdateType > Updates) | llvm::DominatorTreeBase< T, true > | inline |
| reset() | llvm::DominatorTreeBase< T, true > | inline |
| root_begin() | llvm::DominatorTreeBase< T, true > | inline |
| root_begin() const | llvm::DominatorTreeBase< T, true > | inline |
| root_end() | llvm::DominatorTreeBase< T, true > | inline |
| root_end() const | llvm::DominatorTreeBase< T, true > | inline |
| root_iterator typedef | llvm::DominatorTreeBase< T, true > | |
| root_size() const | llvm::DominatorTreeBase< T, true > | inline |
| RootNode | llvm::DominatorTreeBase< T, true > | protected |
| Roots | llvm::DominatorTreeBase< T, true > | protected |
| roots() | llvm::DominatorTreeBase< T, true > | inline |
| roots() const | llvm::DominatorTreeBase< T, true > | inline |
| setNewRoot(T *BB) | llvm::DominatorTreeBase< T, true > | inline |
| SlowQueries | llvm::DominatorTreeBase< T, true > | mutableprotected |
| Split(typename GraphTraits< N >::NodeRef NewBB) | llvm::DominatorTreeBase< T, true > | inlineprotected |
| splitBlock(T *NewBB) | llvm::DominatorTreeBase< T, true > | inline |
| updateBlockNumbers() | llvm::DominatorTreeBase< T, true > | inline |
| updateDFSNumbers() const | llvm::DominatorTreeBase< T, true > | inline |
| UpdateKind typedef | llvm::DominatorTreeBase< T, true > | |
| UpdateType typedef | llvm::DominatorTreeBase< T, true > | |
| VerificationLevel enum name | llvm::DominatorTreeBase< T, true > | |
| verify(VerificationLevel VL=VerificationLevel::Full) const | llvm::DominatorTreeBase< T, true > | inline |
1.14.0