llvm::MachinePostDominatorTree Member List

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

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
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 DomTreeNodeBase< T > *A, const DomTreeNodeBase< T > *B) const	llvm::DominatorTreeBase< T, true >	inline
dominates(const T *A, const T *B) const	llvm::DominatorTreeBase< T, true >
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(ArrayRef< MachineBasicBlock * > Blocks) const	llvm::MachinePostDominatorTree
findNearestCommonDominator(T *A, T *B) const	llvm::MachinePostDominatorTree	inline
findNearestCommonDominator(const T *A, const T *B) const	llvm::MachinePostDominatorTree	inline
findNearestCommonDominator(iterator_range< IteratorTy > Nodes) const	llvm::MachinePostDominatorTree	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(MachineFunction &, const PreservedAnalyses &PA, MachineFunctionAnalysisManager::Invalidator &)	llvm::MachinePostDominatorTree
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
MachinePostDominatorTree()=default	llvm::MachinePostDominatorTree
MachinePostDominatorTree(MachineFunction &MF)	llvm::MachinePostDominatorTree	inlineexplicit
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 >
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