Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIteratedDominanceFrontier.h22 template <bool IsPostDom> struct ChildrenGetterTy<BasicBlock, IsPostDom> {
27 ChildrenGetterTy(const GraphDiff<BasicBlock *, IsPostDom> *GD) : GD(GD) {
33 const GraphDiff<BasicBlock *, IsPostDom> *GD = nullptr;
38 template <bool IsPostDom>
39 class IDFCalculator final : public IDFCalculatorBase<BasicBlock, 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>
[all …]
H A DDominanceFrontierImpl.h48 template <class BlockT, bool IsPostDom>
49 void DominanceFrontierBase<BlockT, IsPostDom>::print(raw_ostream &OS) const { in print()
72 template <class BlockT, bool IsPostDom>
73 void DominanceFrontierBase<BlockT, IsPostDom>::dump() const { in dump()
H A DDominanceFrontier.h39 template <class BlockT, bool IsPostDom>
52 SmallVector<BlockT *, IsPostDom ? 4 : 1> Roots;
53 static constexpr bool IsPostDominators = IsPostDom;
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h39 template <class NodeTy, bool IsPostDom> struct ChildrenGetterTy {
58 template <class NodeTy, bool IsPostDom> class IDFCalculatorBase {
61 std::conditional_t<IsPostDom, Inverse<NodeTy *>, NodeTy *>;
63 IDFCalculatorDetail::ChildrenGetterTy<NodeTy, IsPostDom>;
65 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT) : DT(DT) {} in IDFCalculatorBase()
67 IDFCalculatorBase(DominatorTreeBase<NodeTy, IsPostDom> &DT, in IDFCalculatorBase()
106 DominatorTreeBase<NodeTy, IsPostDom> &DT;
119 template <class NodeTy, bool IsPostDom>
120 typename ChildrenGetterTy<NodeTy, IsPostDom>::range
121 ChildrenGetterTy<NodeTy, IsPostDom>::get(const NodeRef &N) { in get()
[all …]
H A DGenericDomTreeConstruction.h60 static constexpr bool IsPostDom = DomTreeT::IsPostDominator; member
61 using GraphDiffT = GraphDiff<NodePtr, IsPostDom>;
213 constexpr bool Direction = IsReverse != IsPostDom; // XOR.
327 assert(IsPostDom && "Only postdominators have a virtual root"); in addVirtualRoot()
357 if (!IsPostDom) { in FindRoots()
510 assert(IsPostDom && "This function is for postdominators only"); in RemoveRedundantRoots()
549 if (!IsPostDom) { in doFullDFSWalk()
593 NodePtr Root = IsPostDom ? nullptr : DT.Roots[0]; in CalculateFromScratch()
650 assert((From || IsPostDom) && in InsertEdge()
659 if (!IsPostDom) return; in InsertEdge()
[all …]
H A DGenericDomTree.h45 template <typename NodeT, bool IsPostDom>
236 template <typename NodeT, bool IsPostDom>
248 static constexpr bool IsPostDominator = IsPostDom;
259 SmallVector<NodeT *, IsPostDom ? 4 : 1> Roots;
626 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
636 GraphDiff<NodePtr, IsPostDom> PreViewCFG(AllUpdates,
638 GraphDiff<NodePtr, IsPostDom> PostViewCFG(PostViewUpdates);
761 if (!IsPostDom) return;
1027 template <typename NodeT, bool IsPostDom>
1028 bool DominatorTreeBase<NodeT, IsPostDom>::dominates(const NodeT *A,
[all …]