Home
last modified time | relevance | path

Searched refs:IsPostDom (Results 1 – 8 of 8) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIteratedDominanceFrontier.h22 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 DDominanceFrontierImpl.h49 template <class BlockT, bool IsPostDom>
57 template <class BlockT, bool IsPostDom>
65 template <class BlockT, bool IsPostDom>
73 template <class BlockT, bool IsPostDom>
74 bool DominanceFrontierBase<BlockT, IsPostDom>::compareDomSet( in compareDomSet()
98 template <class BlockT, bool IsPostDom>
99 bool DominanceFrontierBase<BlockT, IsPostDom>::compare( in compare()
100 DominanceFrontierBase<BlockT, IsPostDom> &Other) const { in compare()
128 template <class BlockT, bool IsPostDom>
152 template <class BlockT, bool IsPostDom>
[all …]
H A DDominanceFrontier.h39 template <class BlockT, bool IsPostDom>
50 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots;
51 static constexpr bool IsPostDominators = IsPostDom;
H A DLoopInfo.h65 template <class N, bool IsPostDom> class DominatorTreeBase;
/freebsd-13.1/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h39 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 DGenericDomTreeConstruction.h61 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>;
355 if (!IsPostDom) { in FindRoots()
549 if (!IsPostDom) { in doFullDFSWalk()
593 NodePtr Root = IsPostDom ? nullptr : DT.Roots[0]; in CalculateFromScratch()
653 assert((From || IsPostDom) && in InsertEdge()
662 if (!IsPostDom) return; in InsertEdge()
861 if (IsPostDom) UpdateRootsAfterUpdate(DT, BUI); in UpdateInsertion()
926 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge()
964 if (IsPostDom) UpdateRootsAfterUpdate(DT, BUI); in DeleteEdge()
1040 if (IsPostDom) { in DeleteUnreachable()
[all …]
H A DGenericDomTree.h44 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 …]
/freebsd-13.1/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DDominators.h41 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;