#include "mlir/IR/Dominance.h"
Inheritance diagram for mlir::detail::DominanceInfoBase< IsPostDom >:
Public Member Functions | |
| DominanceInfoBase (Operation *op=nullptr) | |
| DominanceInfoBase (DominanceInfoBase &&)=default | |
| DominanceInfoBase & | operator= (DominanceInfoBase &&)=default |
| ~DominanceInfoBase () | |
| DominanceInfoBase (const DominanceInfoBase &)=delete | |
| DominanceInfoBase & | operator= (const DominanceInfoBase &)=delete |
| void | invalidate () |
| Invalidate dominance info. More... | |
| void | invalidate (Region *region) |
| Block * | findNearestCommonDominator (Block *a, Block *b) const |
| Finds the nearest common dominator block for the two given blocks a and b. More... | |
| template<typename BlockRangeT > | |
| Block * | findNearestCommonDominator (BlockRangeT &&blocks) const |
| Finds the nearest common dominator block for the given range of blocks. More... | |
| DominanceInfoNode * | getRootNode (Region *region) |
| Get the root dominance node of the given region. More... | |
| DominanceInfoNode * | getNode (Block *a) |
| Return the dominance node from the Region containing block A. More... | |
| bool | isReachableFromEntry (Block *a) const |
| Return true if the specified block is reachable from the entry block of its region. More... | |
| bool | hasSSADominance (Block *block) const |
| Return true if operations in the specified block are known to obey SSA dominance requirements. More... | |
| bool | hasSSADominance (Region *region) const |
| Return true if operations in the specified block are known to obey SSA dominance requirements. More... | |
| DomTree & | getDomTree (Region *region) const |
Protected Types | |
| using | super = DominanceInfoBase< IsPostDom > |
Protected Member Functions | |
| llvm::PointerIntPair< DomTree *, 1, bool > | getDominanceInfo (Region *region, bool needsDomTree) const |
| Return the dom tree and "hasSSADominance" bit for the given region. More... | |
| bool | properlyDominatesImpl (Block *aBlock, Block::iterator aIt, Block *bBlock, Block::iterator bIt, bool enclosingOk=true) const |
| Return "true" if block iterator A properly (post)dominates block iterator B. More... | |
Protected Attributes | |
| DenseMap< Region *, llvm::PointerIntPair< DomTree *, 1, bool > > | dominanceInfos |
| A mapping of regions to their base dominator tree and a cached "hasSSADominance" bit. More... | |
Detailed Description
template<bool IsPostDom>
class mlir::detail::DominanceInfoBase< IsPostDom >
Definition at line 35 of file Dominance.h.
Member Typedef Documentation
◆ super
|
protected |
Definition at line 108 of file Dominance.h.
Constructor & Destructor Documentation
◆ DominanceInfoBase() [1/3]
|
inline |
Definition at line 39 of file Dominance.h.
◆ DominanceInfoBase() [2/3]
|
default |
◆ ~DominanceInfoBase()
| DominanceInfoBase::~DominanceInfoBase |
Definition at line 32 of file Dominance.cpp.
◆ DominanceInfoBase() [3/3]
|
delete |
Member Function Documentation
◆ findNearestCommonDominator() [1/2]
| Block * DominanceInfoBase::findNearestCommonDominator | ( | Block * | a, |
| Block * | b | ||
| ) | const |
Finds the nearest common dominator block for the two given blocks a and b.
If no common dominator can be found, this function will return nullptr.
Definition at line 192 of file Dominance.cpp.
References mlir::Block::getParent(), and tryGetBlocksInSameRegion().
◆ findNearestCommonDominator() [2/2]
|
inline |
Finds the nearest common dominator block for the given range of blocks.
If no common dominator can be found, this function will return nullptr.
Definition at line 60 of file Dominance.h.
References mlir::Block::begin().
◆ getDominanceInfo()
|
protected |
Return the dom tree and "hasSSADominance" bit for the given region.
The DomTree will be null for single-block regions. This lazily constructs the DomTree on demand when needsDomTree=true.
Definition at line 57 of file Dominance.cpp.
References mlir::Region::hasOneBlock().
◆ getDomTree()
|
inline |
Definition at line 101 of file Dominance.h.
References mlir::Region::hasOneBlock().
◆ getNode()
|
inline |
Return the dominance node from the Region containing block A.
This only works for multi-block regions.
Definition at line 82 of file Dominance.h.
References mlir::Block::getParent().
Referenced by transformToStructuredCFBranches().
◆ getRootNode()
|
inline |
Get the root dominance node of the given region.
Note that this operation is only defined for multi-block regions!
Definition at line 74 of file Dominance.h.
◆ hasSSADominance() [1/2]
|
inline |
Return true if operations in the specified block are known to obey SSA dominance requirements.
False if the block is a graph region or unknown.
Definition at line 92 of file Dominance.h.
References mlir::Block::getParent().
◆ hasSSADominance() [2/2]
|
inline |
Return true if operations in the specified block are known to obey SSA dominance requirements.
False if the block is a graph region or unknown.
Definition at line 97 of file Dominance.h.
◆ invalidate() [1/2]
| void DominanceInfoBase::invalidate |
Invalidate dominance info.
This can be used by clients that make major changes to the CFG and don't have a good way to update it.
Definition at line 38 of file Dominance.cpp.
Referenced by mlir::transformCFGToSCF(), and transformToStructuredCFBranches().
◆ invalidate() [2/2]
| void DominanceInfoBase::invalidate | ( | Region * | region | ) |
Definition at line 45 of file Dominance.cpp.
◆ isReachableFromEntry()
| bool DominanceInfoBase::isReachableFromEntry | ( | Block * | a | ) | const |
Return true if the specified block is reachable from the entry block of its region.
Definition at line 307 of file Dominance.cpp.
References mlir::Region::front(), and mlir::Block::getParent().
Referenced by findCapturedOmpOp().
◆ operator=() [1/2]
|
delete |
◆ operator=() [2/2]
|
default |
◆ properlyDominatesImpl()
|
protected |
Return "true" if block iterator A properly (post)dominates block iterator B.
If enclosingOk is set, A is considered to (post)dominate B if A encloses B.
Definition at line 254 of file Dominance.cpp.
References findAncestorIteratorInRegion(), mlir::Block::getParent(), and isBeforeInBlock().
Member Data Documentation
◆ dominanceInfos
|
mutableprotected |
A mapping of regions to their base dominator tree and a cached "hasSSADominance" bit.
This map does not contain dominator trees for single block CFG regions, but we do want to cache the "hasSSADominance" bit for them. We may also not have computed the DomTree yet. In either case, the DomTree is just null.
Definition at line 130 of file Dominance.h.
The documentation for this class was generated from the following files:
- include/mlir/IR/Dominance.h
- lib/IR/Dominance.cpp
