Searched refs:IsPostDom (Results 1 – 10 of 10) sorted by relevance
| /llvm-project-15.0.7/llvm/include/llvm/Analysis/ |
| H A D | IteratedDominanceFrontier.h | 22 template <bool IsPostDom> struct ChildrenGetterTy<BasicBlock, IsPostDom> { 33 const GraphDiff<BasicBlock *, IsPostDom> *GD = nullptr; 38 template <bool IsPostDom> 42 typename llvm::IDFCalculatorBase<BasicBlock, IsPostDom>; 45 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT) 48 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT, 49 const GraphDiff<BasicBlock *, IsPostDom> *GD) 64 template <bool IsPostDom> 65 typename ChildrenGetterTy<BasicBlock, IsPostDom>::ChildrenTy 66 ChildrenGetterTy<BasicBlock, IsPostDom>::get(const NodeRef &N) { [all …]
|
| H A D | DominanceFrontierImpl.h | 48 template <class BlockT, bool IsPostDom> 56 template <class BlockT, bool IsPostDom> 64 template <class BlockT, bool IsPostDom> 72 template <class BlockT, bool IsPostDom> 73 bool DominanceFrontierBase<BlockT, IsPostDom>::compareDomSet( in compareDomSet() 97 template <class BlockT, bool IsPostDom> 98 bool DominanceFrontierBase<BlockT, IsPostDom>::compare( in compare() 99 DominanceFrontierBase<BlockT, IsPostDom> &Other) const { in compare() 127 template <class BlockT, bool IsPostDom> 151 template <class BlockT, bool IsPostDom> [all …]
|
| H A D | DominanceFrontier.h | 39 template <class BlockT, bool IsPostDom> 50 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots; 51 static constexpr bool IsPostDominators = IsPostDom;
|
| H A D | LoopInfo.h | 65 template <class N, bool IsPostDom> class DominatorTreeBase;
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | GenericIteratedDominanceFrontier.h | 39 template <class NodeTy, bool IsPostDom> struct ChildrenGetterTy { 57 template <class NodeTy, bool IsPostDom> class IDFCalculatorBase { 60 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>; 62 IDFCalculatorDetail::ChildrenGetterTy<NodeTy, IsPostDom>; 66 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT, in IDFCalculatorBase() 105 DominatorTreeBase<NodeTy, IsPostDom> &DT; 118 template <class NodeTy, bool IsPostDom> 119 typename ChildrenGetterTy<NodeTy, IsPostDom>::ChildrenTy 120 ChildrenGetterTy<NodeTy, IsPostDom>::get(const NodeRef &N) { in get() 130 template <class NodeTy, bool IsPostDom> [all …]
|
| H A D | GenericDomTreeConstruction.h | 61 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>; 355 if (!IsPostDom) { in FindRoots() 547 if (!IsPostDom) { in doFullDFSWalk() 591 NodePtr Root = IsPostDom ? nullptr : DT.Roots[0]; in CalculateFromScratch() 651 assert((From || IsPostDom) && in InsertEdge() 660 if (!IsPostDom) return; in InsertEdge() 859 if (IsPostDom) UpdateRootsAfterUpdate(DT, BUI); in UpdateInsertion() 924 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge() 962 if (IsPostDom) UpdateRootsAfterUpdate(DT, BUI); in DeleteEdge() 1038 if (IsPostDom) { in DeleteUnreachable() [all …]
|
| H A D | GenericDomTree.h | 44 template <typename NodeT, bool IsPostDom> 227 template <typename NodeT, bool IsPostDom> 238 static constexpr bool IsPostDominator = IsPostDom; 249 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots; 558 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates); 568 GraphDiff<NodePtr, IsPostDom> PreViewCFG(AllUpdates, 570 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates); 688 if (!IsPostDom) return; 922 template <typename NodeT, bool IsPostDom> 934 template <typename NodeT, bool IsPostDom> [all …]
|
| /llvm-project-15.0.7/mlir/lib/IR/ |
| H A D | Dominance.cpp | 31 template <bool IsPostDom> 32 DominanceInfoBase<IsPostDom>::~DominanceInfoBase() { in ~DominanceInfoBase() 40 template <bool IsPostDom> 41 auto DominanceInfoBase<IsPostDom>::getDominanceInfo(Region *region, in getDominanceInfo() 174 template <bool IsPostDom> 176 DominanceInfoBase<IsPostDom>::findNearestCommonDominator(Block *a, in findNearestCommonDominator() 201 template <bool IsPostDom> 202 bool DominanceInfoBase<IsPostDom>::properlyDominates(Block *a, Block *b) const { in properlyDominates() 231 template <bool IsPostDom> 232 bool DominanceInfoBase<IsPostDom>::isReachableFromEntry(Block *a) const { in isReachableFromEntry()
|
| /llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/ |
| H A D | Dominators.h | 41 template <bool IsPostDom> 46 using DominatorTreeBase = llvm::DominatorTreeBase<CFGBlock, IsPostDom>; 95 llvm::errs() << "Immediate " << (IsPostDom ? "post " : "") in dump() 114 bool IsDomTreeRoot = !IDom && !IsPostDom && IsEntryBlock; in dump() 116 IDom && !IDom->getBlock() && IsPostDom && IsExitBlock; in dump() 194 template <bool IsPostDom> 195 struct ChildrenGetterTy<clang::CFGBlock, IsPostDom> { 201 typename IDFCalculatorBase<clang::CFGBlock, IsPostDom>::OrderedNodeTy;
|
| /llvm-project-15.0.7/mlir/include/mlir/IR/ |
| H A D | Dominance.h | 33 template <bool IsPostDom> 35 using DomTree = llvm::DominatorTreeBase<Block, IsPostDom>; 92 using super = DominanceInfoBase<IsPostDom>;
|