LLVM 19.0.0git
llvm::MachineDominatorTree Member List

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

addNewBlock(MachineBasicBlock *BB, MachineBasicBlock *DomBB)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::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
applyUpdates(ArrayRef< UpdateType > Updates, ArrayRef< UpdateType > PostViewUpdates)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
Base typedefllvm::MachineDominatorTree
calculate(MachineFunction &F)llvm::MachineDominatorTree
changeImmediateDominator(MachineBasicBlock *N, MachineBasicBlock *NewIDom)llvm::MachineDominatorTreeinline
changeImmediateDominator(MachineDomTreeNode *N, MachineDomTreeNode *NewIDom)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::changeImmediateDominator(DomTreeNodeBase< NodeT > *N, DomTreeNodeBase< NodeT > *NewIDom)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
llvm::DominatorTreeBase::changeImmediateDominator(NodeT *BB, NodeT *NewBB)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
compare(const DominatorTreeBase &Other) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
const_root_iterator typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
createChild(NodeT *BB, DomTreeNodeBase< NodeT > *IDom)llvm::DominatorTreeBase< NodeT, IsPostDom >inlineprotected
createNode(NodeT *BB)llvm::DominatorTreeBase< NodeT, IsPostDom >inlineprotected
Deletellvm::DominatorTreeBase< NodeT, IsPostDom >static
deleteEdge(NodeT *From, NodeT *To)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
DFSInfoValidllvm::DominatorTreeBase< NodeT, IsPostDom >mutableprotected
dominates(const MachineDomTreeNode *A, const MachineDomTreeNode *B) constllvm::MachineDominatorTreeinline
dominates(const MachineBasicBlock *A, const MachineBasicBlock *B) constllvm::MachineDominatorTreeinline
dominates(const MachineInstr *A, const MachineInstr *B) constllvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::dominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
llvm::DominatorTreeBase::dominates(const NodeT *A, const NodeT *B) constllvm::DominatorTreeBase< NodeT, IsPostDom >
DominatorTreeBase()=defaultllvm::DominatorTreeBase< NodeT, IsPostDom >
DominatorTreeBase(DominatorTreeBase &&Arg)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
DominatorTreeBase(const DominatorTreeBase &)=deletellvm::DominatorTreeBase< NodeT, IsPostDom >
DomTreeNodeMapType typedefllvm::DominatorTreeBase< NodeT, IsPostDom >protected
DomTreeNodesllvm::DominatorTreeBase< NodeT, IsPostDom >protected
eraseNode(MachineBasicBlock *BB)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::eraseNode(NodeT *BB)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
findNearestCommonDominator(MachineBasicBlock *A, MachineBasicBlock *B)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::findNearestCommonDominator(NodeT *A, NodeT *B) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
llvm::DominatorTreeBase::findNearestCommonDominator(const NodeT *A, const NodeT *B) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
getBase()llvm::MachineDominatorTreeinline
getDescendants(MachineBasicBlock *A, SmallVectorImpl< MachineBasicBlock * > &Result)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::getDescendants(NodeT *R, SmallVectorImpl< NodeT * > &Result) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
getNode(MachineBasicBlock *BB) constllvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::getNode(const NodeT *BB) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
getRoot() constllvm::MachineDominatorTreeinline
getRootNode() constllvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::getRootNode()llvm::DominatorTreeBase< NodeT, IsPostDom >inline
Insertllvm::DominatorTreeBase< NodeT, IsPostDom >static
insertEdge(NodeT *From, NodeT *To)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
invalidate(MachineFunction &, const PreservedAnalyses &PA, MachineFunctionAnalysisManager::Invalidator &)llvm::MachineDominatorTree
isPostDominator() constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
IsPostDominatorllvm::DominatorTreeBase< NodeT, IsPostDom >static
isReachableFromEntry(const MachineBasicBlock *A)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::isReachableFromEntry(const NodeT *A) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
llvm::DominatorTreeBase::isReachableFromEntry(const DomTreeNodeBase< NodeT > *A) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
isVirtualRoot(const DomTreeNodeBase< NodeT > *A) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
MachineDominatorTree()=defaultllvm::MachineDominatorTree
MachineDominatorTree(MachineFunction &MF)llvm::MachineDominatorTreeinlineexplicit
NodePtr typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
NodeTrait typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
NodeType typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
operator=(DominatorTreeBase &&RHS)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
operator=(const DominatorTreeBase &)=deletellvm::DominatorTreeBase< NodeT, IsPostDom >
operator[](MachineBasicBlock *BB) constllvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::operator[](const NodeT *BB) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
Parentllvm::DominatorTreeBase< NodeT, IsPostDom >protected
ParentPtr typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
ParentType typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
print(raw_ostream &O) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
properlyDominates(const MachineDomTreeNode *A, const MachineDomTreeNode *B) constllvm::MachineDominatorTreeinline
properlyDominates(const MachineBasicBlock *A, const MachineBasicBlock *B) constllvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::properlyDominates(const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
llvm::DominatorTreeBase::properlyDominates(const NodeT *A, const NodeT *B) constllvm::DominatorTreeBase< NodeT, IsPostDom >
recalculate(ParentType &Func)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
recalculate(ParentType &Func, ArrayRef< UpdateType > Updates)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
recordSplitCriticalEdge(MachineBasicBlock *FromBB, MachineBasicBlock *ToBB, MachineBasicBlock *NewBB)llvm::MachineDominatorTreeinline
reset()llvm::DominatorTreeBase< NodeT, IsPostDom >inline
root_begin()llvm::DominatorTreeBase< NodeT, IsPostDom >inline
root_begin() constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
root_end()llvm::DominatorTreeBase< NodeT, IsPostDom >inline
root_end() constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
root_iterator typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
root_size() constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
RootNodellvm::DominatorTreeBase< NodeT, IsPostDom >protected
roots()llvm::DominatorTreeBase< NodeT, IsPostDom >inline
roots() constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
Rootsllvm::DominatorTreeBase< NodeT, IsPostDom >protected
setNewRoot(NodeT *BB)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
SlowQueriesllvm::DominatorTreeBase< NodeT, IsPostDom >mutableprotected
Split(typename GraphTraits< N >::NodeRef NewBB)llvm::DominatorTreeBase< NodeT, IsPostDom >inlineprotected
splitBlock(MachineBasicBlock *NewBB)llvm::MachineDominatorTreeinline
llvm::DominatorTreeBase::splitBlock(NodeT *NewBB)llvm::DominatorTreeBase< NodeT, IsPostDom >inline
updateDFSNumbers() constllvm::DominatorTreeBase< NodeT, IsPostDom >inline
UpdateKind typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
UpdateType typedefllvm::DominatorTreeBase< NodeT, IsPostDom >
VerificationLevel enum namellvm::DominatorTreeBase< NodeT, IsPostDom >
verify(VerificationLevel VL=VerificationLevel::Full) constllvm::DominatorTreeBase< NodeT, IsPostDom >inline