Home
last modified time | relevance | path

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

/freebsd-14.2/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.h48 template <class BlockT, bool IsPostDom>
56 template <class BlockT, bool IsPostDom>
63 template <class BlockT, bool IsPostDom>
71 template <class BlockT, bool IsPostDom>
72 bool DominanceFrontierBase<BlockT, IsPostDom>::compareDomSet( in compareDomSet()
96 template <class BlockT, bool IsPostDom>
97 bool DominanceFrontierBase<BlockT, IsPostDom>::compare( in compare()
98 DominanceFrontierBase<BlockT, IsPostDom> &Other) const { in compare()
126 template <class BlockT, bool IsPostDom>
150 template <class BlockT, bool IsPostDom>
[all …]
H A DDominanceFrontier.h39 template <class BlockT, bool IsPostDom>
52 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots;
53 static constexpr bool IsPostDominators = IsPostDom;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h38 template <class NodeTy, bool IsPostDom> struct ChildrenGetterTy {
56 template <class NodeTy, bool IsPostDom> class IDFCalculatorBase {
59 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
61 IDFCalculatorDetail::ChildrenGetterTy<NodeTy, IsPostDom>;
65 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT, in IDFCalculatorBase()
104 DominatorTreeBase<NodeTy, IsPostDom> &DT;
117 template <class NodeTy, bool IsPostDom>
118 typename ChildrenGetterTy<NodeTy, IsPostDom>::ChildrenTy
119 ChildrenGetterTy<NodeTy, IsPostDom>::get(const NodeRef &N) { in get()
129 template <class NodeTy, bool IsPostDom>
[all …]
H A DGenericDomTreeConstruction.h61 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>;
352 if (!IsPostDom) { in FindRoots()
544 if (!IsPostDom) { in doFullDFSWalk()
588 NodePtr Root = IsPostDom ? nullptr : DT.Roots[0]; in CalculateFromScratch()
648 assert((From || IsPostDom) && in InsertEdge()
657 if (!IsPostDom) return; in InsertEdge()
856 if (IsPostDom) UpdateRootsAfterUpdate(DT, BUI); in UpdateInsertion()
921 auto Successors = getChildren<IsPostDom>(Of, BUI); in DeleteEdge()
959 if (IsPostDom) UpdateRootsAfterUpdate(DT, BUI); in DeleteEdge()
1035 if (IsPostDom) { in DeleteUnreachable()
[all …]
H A DGenericDomTree.h45 template <typename NodeT, bool IsPostDom>
242 template <typename NodeT, bool IsPostDom>
254 static constexpr bool IsPostDominator = IsPostDom;
265 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
575 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
585 GraphDiff<NodePtr, IsPostDom> PreViewCFG(AllUpdates,
587 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
705 if (!IsPostDom) return;
938 template <typename NodeT, bool IsPostDom>
950 template <typename NodeT, bool IsPostDom>
[all …]
/freebsd-14.2/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;