Core dominator tree base class. More...
#include "llvm/Support/GenericDomTree.h"
Public Types | |
| enum class | VerificationLevel { Fast , Basic , Full } |
| using | NodeTrait = DomTreeNodeTraits<NodeT> |
| using | NodeType = typename NodeTrait::NodeType |
| using | NodePtr = typename NodeTrait::NodePtr |
| using | ParentPtr = typename NodeTrait::ParentPtr |
| using | ParentType = std::remove_pointer_t<ParentPtr> |
| using | UpdateType = cfg::Update<NodePtr> |
| using | UpdateKind = cfg::UpdateKind |
| using | root_iterator = typename SmallVectorImpl<NodeT *>::iterator |
| Iteration over roots. | |
| using | const_root_iterator = typename SmallVectorImpl<NodeT *>::const_iterator |
Public Member Functions | |
| DominatorTreeBase ()=default | |
| DominatorTreeBase (DominatorTreeBase &&Arg) | |
| DominatorTreeBase & | operator= (DominatorTreeBase &&RHS) |
| DominatorTreeBase (const DominatorTreeBase &)=delete | |
| DominatorTreeBase & | operator= (const DominatorTreeBase &)=delete |
| root_iterator | root_begin () |
| const_root_iterator | root_begin () const |
| root_iterator | root_end () |
| const_root_iterator | root_end () const |
| size_t | root_size () const |
| iterator_range< root_iterator > | roots () |
| iterator_range< const_root_iterator > | roots () const |
| bool | isPostDominator () const |
| isPostDominator - Returns true if analysis based of postdoms | |
| bool | compare (const DominatorTreeBase &Other) const |
| compare - Return false if the other dominator tree base matches this dominator tree base. | |
| DomTreeNodeBase< NodeT > * | getNode (const NodeT *BB) const |
| getNode - return the (Post)DominatorTree node for the specified basic block. | |
| DomTreeNodeBase< NodeT > * | operator[] (const NodeT *BB) const |
| See getNode. | |
| DomTreeNodeBase< NodeT > * | getRootNode () |
| getRootNode - This returns the entry node for the CFG of the function. | |
| const DomTreeNodeBase< NodeT > * | getRootNode () const |
| void | getDescendants (NodeT *R, SmallVectorImpl< NodeT * > &Result) const |
| Get all nodes dominated by R, including R itself. | |
| bool | properlyDominates (const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const |
| properlyDominates - Returns true iff A dominates B and A != B. | |
| bool | properlyDominates (const NodeT *A, const NodeT *B) const |
| bool | isReachableFromEntry (const NodeT *A) const |
| isReachableFromEntry - Return true if A is dominated by the entry block of the function containing it. | |
| bool | isReachableFromEntry (const DomTreeNodeBase< NodeT > *A) const |
| bool | dominates (const DomTreeNodeBase< NodeT > *A, const DomTreeNodeBase< NodeT > *B) const |
| dominates - Returns true iff A dominates B. | |
| bool | dominates (const NodeT *A, const NodeT *B) const |
| NodeT * | getRoot () const |
| NodeT * | findNearestCommonDominator (NodeT *A, NodeT *B) const |
| Find nearest common dominator basic block for basic block A and B. | |
| const NodeT * | findNearestCommonDominator (const NodeT *A, const NodeT *B) const |
| bool | isVirtualRoot (const DomTreeNodeBase< NodeT > *A) const |
| template<typename IteratorTy> | |
| NodeT * | findNearestCommonDominator (iterator_range< IteratorTy > Nodes) const |
| void | applyUpdates (ArrayRef< UpdateType > Updates) |
| Inform the dominator tree about a sequence of CFG edge insertions and deletions and perform a batch update on the tree. | |
| void | applyUpdates (ArrayRef< UpdateType > Updates, ArrayRef< UpdateType > PostViewUpdates) |
| void | insertEdge (NodeT *From, NodeT *To) |
| Inform the dominator tree about a CFG edge insertion and update the tree. | |
| void | deleteEdge (NodeT *From, NodeT *To) |
| Inform the dominator tree about a CFG edge deletion and update the tree. | |
| DomTreeNodeBase< NodeT > * | addNewBlock (NodeT *BB, NodeT *DomBB) |
| Add a new node to the dominator tree information. | |
| DomTreeNodeBase< NodeT > * | setNewRoot (NodeT *BB) |
| Add a new node to the forward dominator tree and make it a new root. | |
| void | changeImmediateDominator (DomTreeNodeBase< NodeT > *N, DomTreeNodeBase< NodeT > *NewIDom) |
| changeImmediateDominator - This method is used to update the dominator tree information when a node's immediate dominator changes. | |
| void | changeImmediateDominator (NodeT *BB, NodeT *NewBB) |
| void | eraseNode (NodeT *BB) |
| eraseNode - Removes a node from the dominator tree. | |
| void | splitBlock (NodeT *NewBB) |
| splitBlock - BB is split and now it has one successor. | |
| void | print (raw_ostream &O) const |
| print - Convert to human readable form | |
| void | updateDFSNumbers () const |
| updateDFSNumbers - Assign In and Out numbers to the nodes while walking dominator tree in dfs order. | |
| void | recalculate (ParentType &Func) |
| recalculate - compute a dominator tree for the given function | |
| void | recalculate (ParentType &Func, ArrayRef< UpdateType > Updates) |
| template<typename T = NodeT> | |
| std::enable_if_t< GraphHasNodeNumbers< T * >, void > | updateBlockNumbers () |
| Update dominator tree after renumbering blocks. | |
| bool | verify (VerificationLevel VL=VerificationLevel::Full) const |
| verify - checks if the tree is correct. | |
| void | reset () |
Static Public Attributes | |
| static constexpr bool | IsPostDominator = IsPostDom |
| static constexpr UpdateKind | Insert = UpdateKind::Insert |
| static constexpr UpdateKind | Delete = UpdateKind::Delete |
Protected Types | |
| using | DomTreeNodeStorageTy |
Protected Member Functions | |
| void | addRoot (NodeT *BB) |
| DomTreeNodeBase< NodeT > * | createNode (NodeT *BB, DomTreeNodeBase< NodeT > *IDom=nullptr) |
| template<class N> | |
| void | Split (typename GraphTraits< N >::NodeRef NewBB) |
Protected Attributes | |
| SmallVector< NodeT *, IsPostDom ? 4 :1 > | Roots |
| DomTreeNodeStorageTy | DomTreeNodes |
| std::conditional_t<!GraphHasNodeNumbers< NodeT * >, DenseMap< const NodeT *, unsigned >, std::tuple<> > | NodeNumberMap |
| DomTreeNodeBase< NodeT > * | RootNode = nullptr |
| ParentPtr | Parent = nullptr |
| bool | DFSInfoValid = false |
| unsigned int | SlowQueries = 0 |
| unsigned | BlockNumberEpoch = 0 |
Friends | |
| struct | DomTreeBuilder::SemiNCAInfo< DominatorTreeBase > |
Detailed Description
class llvm::DominatorTreeBase< NodeT, IsPostDom >
Core dominator tree base class.
This class is a generic template over graph nodes. It is instantiated for various graphs in the LLVM IR or in the code generator.
Definition at line 237 of file GenericDomTree.h.
Member Typedef Documentation
◆ const_root_iterator
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::const_root_iterator = typename SmallVectorImpl<NodeT *>::const_iterator |
Definition at line 313 of file GenericDomTree.h.
◆ DomTreeNodeStorageTy
|
protected |
Definition at line 261 of file GenericDomTree.h.
◆ NodePtr
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::NodePtr = typename NodeTrait::NodePtr |
Definition at line 243 of file GenericDomTree.h.
◆ NodeTrait
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::NodeTrait = DomTreeNodeTraits<NodeT> |
Definition at line 241 of file GenericDomTree.h.
◆ NodeType
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::NodeType = typename NodeTrait::NodeType |
Definition at line 242 of file GenericDomTree.h.
◆ ParentPtr
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::ParentPtr = typename NodeTrait::ParentPtr |
Definition at line 244 of file GenericDomTree.h.
◆ ParentType
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::ParentType = std::remove_pointer_t<ParentPtr> |
Definition at line 247 of file GenericDomTree.h.
◆ root_iterator
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::root_iterator = typename SmallVectorImpl<NodeT *>::iterator |
Iteration over roots.
This may include multiple blocks if we are computing post dominators. For forward dominators, this will always be a single block (the entry block).
Definition at line 312 of file GenericDomTree.h.
◆ UpdateKind
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::UpdateKind = cfg::UpdateKind |
Definition at line 251 of file GenericDomTree.h.
◆ UpdateType
| using llvm::DominatorTreeBase< NodeT, IsPostDom >::UpdateType = cfg::Update<NodePtr> |
Definition at line 250 of file GenericDomTree.h.
Member Enumeration Documentation
◆ VerificationLevel
|
strong |
| Enumerator | |
|---|---|
| Fast | |
| Basic | |
| Full | |
Definition at line 255 of file GenericDomTree.h.
Constructor & Destructor Documentation
◆ DominatorTreeBase() [1/3]
|
default |
◆ DominatorTreeBase() [2/3]
|
inline |
Definition at line 281 of file GenericDomTree.h.
◆ DominatorTreeBase() [3/3]
|
delete |
Member Function Documentation
◆ addNewBlock()
|
inline |
Add a new node to the dominator tree information.
This creates a new node as a child of DomBB dominator node, linking it into the children list of the immediate dominator.
- Parameters
-
BB New node in CFG. DomBB CFG node that is dominator for BB.
- Returns
- New dominator tree node that represents new CFG node.
Definition at line 687 of file GenericDomTree.h.
Referenced by CloneLoopBlocks(), cloneLoopBlocks(), llvm::cloneLoopWithPreheader(), loadMBUFScalarOperandsFromVGPR(), llvm::DominatorTreeBase< BlockT, false >::Split(), SplitBlockImpl(), llvm::UnrollAndJamLoop(), and llvm::UnrollLoop().
◆ addRoot()
|
inlineprotected |
Definition at line 921 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::setNewRoot().
◆ applyUpdates() [1/2]
|
inline |
Inform the dominator tree about a sequence of CFG edge insertions and deletions and perform a batch update on the tree.
This function should be used when there were multiple CFG updates after the last dominator tree update. It takes care of performing the updates in sync with the CFG and optimizes away the redundant operations that cancel each other. The functions expects the sequence of updates to be balanced. Eg.:
- {{Insert, A, B}, {Delete, A, B}, {Insert, A, B}} is fine, because logically it results in a single insertions.
- {{Insert, A, B}, {Insert, A, B}} is invalid, because it doesn't make sense to insert the same edge twice.
What's more, the functions assumes that it's safe to ask every node in the CFG about its children and inverse children. This implies that deletions of CFG edges must not delete the CFG nodes before calling this function.
The applyUpdates function can reorder the updates and remove redundant ones internally (as long as it is done in a deterministic fashion). The batch updater is also able to detect sequences of zero and exactly one update – it's optimized to do less work in these cases.
Note that for postdominators it automatically takes care of applying updates on reverse edges internally (so there's no need to swap the From and To pointers when constructing DominatorTree::UpdateType). The type of updates is the same for DomTreeBase<T> and PostDomTreeBase<T> with the same template parameter T.
- Parameters
-
Updates An ordered sequence of updates to perform. The current CFG and the reverse of these updates provides the pre-view of the CFG.
Definition at line 612 of file GenericDomTree.h.
Referenced by llvm::MemorySSAUpdater::applyUpdates(), injectPendingInvariantConditions(), splitBlock(), unswitchNontrivialInvariants(), and unswitchTrivialSwitch().
◆ applyUpdates() [2/2]
|
inline |
- Parameters
-
Updates An ordered sequence of updates to perform. The current CFG and the reverse of these updates provides the pre-view of the CFG. PostViewUpdates An ordered sequence of update to perform in order to obtain a post-view of the CFG. The DT will be updated assuming the obtained PostViewCFG is the desired end state.
Definition at line 623 of file GenericDomTree.h.
◆ changeImmediateDominator() [1/2]
|
inline |
changeImmediateDominator - This method is used to update the dominator tree information when a node's immediate dominator changes.
Definition at line 723 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::changeImmediateDominator(), cloneLoopBlocks(), llvm::cloneLoopWithPreheader(), ConnectEpilog(), ConnectProlog(), loadMBUFScalarOperandsFromVGPR(), llvm::peelLoop(), simplifyOneLoop(), llvm::DominatorTreeBase< BlockT, false >::Split(), SplitBlockImpl(), llvm::splitLoopBound(), llvm::UnrollLoop(), and llvm::UnrollRuntimeLoopRemainder().
◆ changeImmediateDominator() [2/2]
|
inline |
Definition at line 730 of file GenericDomTree.h.
◆ compare()
|
inline |
compare - Return false if the other dominator tree base matches this dominator tree base.
Otherwise return true.
Definition at line 335 of file GenericDomTree.h.
◆ createNode()
|
inlineprotected |
Definition at line 923 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::addNewBlock(), and llvm::DominatorTreeBase< BlockT, false >::setNewRoot().
◆ deleteEdge()
|
inline |
Inform the dominator tree about a CFG edge deletion and update the tree.
This function has to be called just after making the update on the actual CFG. An internal functions checks if the edge doesn't exist in the CFG in DEBUG mode. There cannot be any other updates that the dominator tree doesn't know about.
Note that for postdominators it automatically takes care of deleting a reverse edge internally (so there's no need to swap the parameters).
Definition at line 670 of file GenericDomTree.h.
Referenced by DoFlattenLoopPair(), replaceArgumentUses(), and unswitchTrivialBranch().
◆ dominates() [1/2]
|
inline |
dominates - Returns true iff A dominates B.
Note that this is not a constant time operation!
Definition at line 467 of file GenericDomTree.h.
Referenced by llvm::LoopInfoBase< BlockT, LoopT >::analyze(), canonicalHeaderAndLatch(), llvm::VPlanTransforms::cse(), llvm::VPBlockUtils::isHeader(), llvm::VPlanTransforms::materializeBroadcasts(), llvm::DominatorTreeBase< BlockT, false >::properlyDominates(), and llvm::DominatorTreeBase< BlockT, false >::Split().
◆ dominates() [2/2]
| bool llvm::DominatorTreeBase< NodeT, IsPostDom >::dominates | ( | const NodeT * | A, |
| const NodeT * | B ) const |
Definition at line 1028 of file GenericDomTree.h.
References A(), B(), dominates(), and getNode().
◆ eraseNode()
|
inline |
eraseNode - Removes a node from the dominator tree.
Block must not dominate any other blocks. Removes node from its immediate dominator's children list. Deletes dominator node associated with basic block BB.
Definition at line 737 of file GenericDomTree.h.
Referenced by llvm::MergeBlockIntoPredecessor(), and simplifyOneLoop().
◆ findNearestCommonDominator() [1/3]
|
inline |
Definition at line 549 of file GenericDomTree.h.
◆ findNearestCommonDominator() [2/3]
|
inline |
Definition at line 562 of file GenericDomTree.h.
◆ findNearestCommonDominator() [3/3]
|
inline |
Find nearest common dominator basic block for basic block A and B.
A and B must have tree nodes.
Definition at line 519 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::findNearestCommonDominator(), llvm::DominatorTreeBase< BlockT, false >::findNearestCommonDominator(), hoistAndMergeSGPRInits(), and llvm::DominatorTreeBase< BlockT, false >::Split().
◆ getDescendants()
|
inline |
Get all nodes dominated by R, including R itself.
Definition at line 425 of file GenericDomTree.h.
Referenced by replaceArgumentUses().
◆ getNode()
|
inline |
getNode - return the (Post)DominatorTree node for the specified basic block.
This is the same as using operator[] on this class. The result may (but is not required to) be null for a forward (backwards) statically unreachable block.
Definition at line 401 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::addNewBlock(), llvm::LoopInfoBase< BlockT, LoopT >::analyze(), llvm::DominatorTreeBase< BlockT, false >::changeImmediateDominator(), checkAndReplaceCondition(), checkHoistValue(), CloneLoopBlocks(), cloneLoopBlocks(), llvm::cloneLoopWithPreheader(), llvm::collectChildrenInLoop(), collectUnswitchCandidatesWithInjections(), compareCmp(), computeBlocksDominatingExits(), containsUnconditionalCallSafepoint(), domTreeLevelBefore(), eliminateConstraints(), llvm::MustBeExecutedContextExplorer::findBackwardJoinPoint(), findBestInsertionSet(), llvm::MustBeExecutedContextExplorer::findForwardJoinPoint(), llvm::DominatorTreeBase< BlockT, false >::findNearestCommonDominator(), llvm::DominatorTreeBase< BlockT, false >::findNearestCommonDominator(), formLCSSAForInstructionsImpl(), llvm::DominatorTreeBase< BlockT, false >::getDescendants(), getDominatees(), getDominators(), llvm::hoistRegion(), hoistValue(), isGuaranteedNotToBeUndefOrPoison(), llvm::DominatorTreeBase< BlockT, false >::isReachableFromEntry(), loadCSE(), llvm::MergeBlockIntoPredecessor(), llvm::DominatorTreeBase< BlockT, false >::operator[](), llvm::peelLoop(), preheader(), llvm::SSAUpdaterBulk::RewriteAllUses(), llvm::GuardWideningPass::run(), llvm::DominatorTreeBase< BlockT, false >::setNewRoot(), shouldSplitOnPredicatedArgument(), simplifyOneLoop(), simplifyUsingControlFlow(), SinkInstruction(), llvm::sinkRegionForLoopNest(), llvm::DominatorTreeBase< BlockT, false >::Split(), SplitBlockImpl(), llvm::UnrollAndJamLoop(), llvm::UnrollLoop(), and llvm::UnrollRuntimeLoopRemainder().
◆ getRoot()
|
inline |
Definition at line 512 of file GenericDomTree.h.
Referenced by llvm::ForwardDominanceFrontierBase< BlockT >::analyze(), getFreezeInsertPt(), and nearest_common_dominatee().
◆ getRootNode() [1/2]
|
inline |
getRootNode - This returns the entry node for the CFG of the function.
If this tree represents the post-dominance relations for a function, however, this root may be a node with the block == NULL. This is the case when there are multiple exit nodes from a particular function. Consumers of post-dominance information must be capable of dealing with this possibility.
Definition at line 421 of file GenericDomTree.h.
Referenced by llvm::LoopInfoBase< BlockT, LoopT >::analyze(), llvm::GraphTraits< DominatorTree * >::getEntryNode(), llvm::GraphTraits< MachineDominatorTree * >::getEntryNode(), llvm::GraphTraits< PostDominatorTree * >::getEntryNode(), llvm::DominatorTreeBase< BlockT, false >::print(), llvm::GuardWideningPass::run(), UpdateAnalysisInformation(), and llvm::DominatorTreeBase< BlockT, false >::updateDFSNumbers().
◆ getRootNode() [2/2]
|
inline |
Definition at line 422 of file GenericDomTree.h.
◆ insertEdge()
|
inline |
Inform the dominator tree about a CFG edge insertion and update the tree.
This function has to be called just before or just after making the update on the actual CFG. There cannot be any other updates that the dominator tree doesn't know about.
Note that for postdominators it automatically takes care of inserting a reverse edge internally (so there's no need to swap the parameters).
Definition at line 652 of file GenericDomTree.h.
Referenced by replaceArgumentUses(), and unswitchTrivialBranch().
◆ isPostDominator()
|
inline |
isPostDominator - Returns true if analysis based of postdoms
Definition at line 331 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::findNearestCommonDominator(), llvm::DominatorTreeBase< BlockT, false >::isReachableFromEntry(), llvm::DominatorTreeBase< BlockT, false >::isVirtualRoot(), and llvm::DominatorTreeBase< BlockT, false >::setNewRoot().
◆ isReachableFromEntry() [1/2]
|
inline |
Definition at line 462 of file GenericDomTree.h.
◆ isReachableFromEntry() [2/2]
|
inline |
isReachableFromEntry - Return true if A is dominated by the entry block of the function containing it.
Definition at line 456 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::dominates(), llvm::DominatorTreeBase< BlockT, false >::isReachableFromEntry(), llvm::DominatorTreeBase< BlockT, false >::Split(), and llvm::LoopBase< BasicBlock, Loop >::verifyLoopNest().
◆ isVirtualRoot()
|
inline |
Definition at line 557 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::findNearestCommonDominator().
◆ operator=() [1/2]
|
delete |
◆ operator=() [2/2]
|
inline |
Definition at line 289 of file GenericDomTree.h.
◆ operator[]()
|
inline |
See getNode.
Definition at line 410 of file GenericDomTree.h.
◆ print()
|
inline |
print - Convert to human readable form
Definition at line 782 of file GenericDomTree.h.
◆ properlyDominates() [1/2]
|
inline |
properlyDominates - Returns true iff A dominates B and A != B.
Note that this is not a constant time operation!
Definition at line 443 of file GenericDomTree.h.
Referenced by ConstructSSAForLoadSet(), hoistAndMergeSGPRInits(), isLoadInvariantInLoop(), and loadMBUFScalarOperandsFromVGPR().
◆ properlyDominates() [2/2]
| bool llvm::DominatorTreeBase< NodeT, IsPostDom >::properlyDominates | ( | const NodeT * | A, |
| const NodeT * | B ) const |
Definition at line 1036 of file GenericDomTree.h.
References A(), B(), dominates(), and getNode().
◆ recalculate() [1/2]
|
inline |
recalculate - compute a dominator tree for the given function
Definition at line 859 of file GenericDomTree.h.
Referenced by AddAliasScopeMetadata(), AddAlignmentAssumptions(), addInitialSkeleton(), llvm::VPlanTransforms::adjustFixedOrderRecurrences(), llvm::VPlanTransforms::createInterleaveGroups(), llvm::VPlanTransforms::createLoopRegions(), llvm::VPlanTransforms::materializeBroadcasts(), llvm::OptimizationRemarkEmitter::OptimizationRemarkEmitter(), llvm::DominatorTreeAnalysis::run(), llvm::PlaceSafepointsPass::runImpl(), verifyConvergenceControl(), and llvm::verifyVPlanIsValid().
◆ recalculate() [2/2]
|
inline |
Definition at line 865 of file GenericDomTree.h.
◆ reset()
|
inline |
Definition at line 909 of file GenericDomTree.h.
◆ root_begin() [1/2]
|
inline |
Definition at line 315 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::roots(), and llvm::DominatorTreeBase< BlockT, false >::roots().
◆ root_begin() [2/2]
|
inline |
Definition at line 316 of file GenericDomTree.h.
◆ root_end() [1/2]
|
inline |
Definition at line 317 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::roots(), and llvm::DominatorTreeBase< BlockT, false >::roots().
◆ root_end() [2/2]
|
inline |
Definition at line 318 of file GenericDomTree.h.
◆ root_size()
|
inline |
Definition at line 320 of file GenericDomTree.h.
Referenced by llvm::ForwardDominanceFrontierBase< BlockT >::analyze().
◆ roots() [1/2]
|
inline |
Definition at line 322 of file GenericDomTree.h.
◆ roots() [2/2]
|
inline |
Definition at line 325 of file GenericDomTree.h.
◆ setNewRoot()
|
inline |
Add a new node to the forward dominator tree and make it a new root.
- Parameters
-
BB New node in CFG.
- Returns
- New dominator tree node that represents new CFG node.
Definition at line 700 of file GenericDomTree.h.
Referenced by UpdateAnalysisInformation().
◆ Split()
|
inlineprotected |
Definition at line 937 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::splitBlock().
◆ splitBlock()
|
inline |
splitBlock - BB is split and now it has one successor.
Update dominator tree to reflect this change.
Definition at line 773 of file GenericDomTree.h.
Referenced by insertUniqueBackedgeBlock(), and UpdateAnalysisInformation().
◆ updateBlockNumbers()
|
inline |
Update dominator tree after renumbering blocks.
Definition at line 873 of file GenericDomTree.h.
Referenced by sortBlocks().
◆ updateDFSNumbers()
|
inline |
updateDFSNumbers - Assign In and Out numbers to the nodes while walking dominator tree in dfs order.
Definition at line 805 of file GenericDomTree.h.
Referenced by llvm::DominatorTreeBase< BlockT, false >::dominates(), eliminateConstraints(), and llvm::isSafeToMoveBefore().
◆ verify()
|
inline |
verify - checks if the tree is correct.
There are 3 level of verification:
- Full – verifies if the tree is correct by making sure all the properties (including the parent and the sibling property) hold. Takes O(N^3) time.
- Basic – checks if the tree is correct, but compares it to a freshly constructed tree instead of checking the sibling property. Takes O(N^2) time.
- Fast – checks basic tree structure and compares it with a freshly constructed tree. Takes O(N^2) time worst case, but is faster in practise (same as tree construction).
Definition at line 905 of file GenericDomTree.h.
Referenced by fixIrreducible(), llvm::hoistRegion(), injectPendingInvariantConditions(), llvm::peelLoop(), llvm::FunctionToLoopPassAdaptor::run(), llvm::LoopBoundSplitPass::run(), llvm::SimpleLoopUnswitchPass::run(), runImpl(), simplifyFunctionCFG(), unifyLoopExits(), llvm::UnrollAndJamLoop(), llvm::UnrollLoop(), llvm::UnrollRuntimeLoopRemainder(), unswitchNontrivialInvariants(), and unswitchTrivialSwitch().
Friends And Related Symbol Documentation
◆ DomTreeBuilder::SemiNCAInfo< DominatorTreeBase >
|
friend |
Definition at line 274 of file GenericDomTree.h.
Member Data Documentation
◆ BlockNumberEpoch
|
protected |
Definition at line 274 of file GenericDomTree.h.
◆ Delete
|
staticconstexpr |
Definition at line 253 of file GenericDomTree.h.
Referenced by llvm::MemorySSAUpdater::applyUpdates(), and unswitchTrivialSwitch().
◆ DFSInfoValid
|
mutableprotected |
Definition at line 272 of file GenericDomTree.h.
◆ DomTreeNodes
|
protected |
Definition at line 263 of file GenericDomTree.h.
◆ Insert
|
staticconstexpr |
Definition at line 252 of file GenericDomTree.h.
Referenced by llvm::MemorySSAUpdater::applyUpdates(), and unswitchTrivialSwitch().
◆ IsPostDominator
|
staticconstexpr |
Definition at line 248 of file GenericDomTree.h.
◆ NodeNumberMap
|
protected |
Definition at line 268 of file GenericDomTree.h.
◆ Parent
|
protected |
Definition at line 270 of file GenericDomTree.h.
Referenced by llvm::DominatorTree::DominatorTree().
◆ RootNode
|
protected |
Definition at line 269 of file GenericDomTree.h.
◆ Roots
|
protected |
Definition at line 259 of file GenericDomTree.h.
◆ SlowQueries
|
mutableprotected |
Definition at line 273 of file GenericDomTree.h.
The documentation for this class was generated from the following files:
- include/llvm/ADT/GenericSSAContext.h
- include/llvm/Support/GenericDomTree.h
Generated on for LLVM by
1.14.0