Home
last modified time | relevance | path

Searched refs:DominatorTreeBase (Results 1 – 25 of 25) sorted by relevance

/external/llvm/include/llvm/Support/
DGenericDomTree.h65 template <class NodeT> class DominatorTreeBase; variable
75 template <class N> friend class DominatorTreeBase; variable
180 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType> &DT,
187 template <class NodeT> class DominatorTreeBase : public DominatorBase<NodeT> {
188 DominatorTreeBase(const DominatorTreeBase &) = delete;
189 DominatorTreeBase &operator=(const DominatorTreeBase &) = delete;
254 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT, in Split()
317 explicit DominatorTreeBase(bool isPostDom) in DominatorTreeBase() function
320 DominatorTreeBase(DominatorTreeBase &&Arg) in DominatorTreeBase() function
330 DominatorTreeBase &operator=(DominatorTreeBase &&RHS) {
[all …]
DGenericDomTreeConstruction.h33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
62 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
94 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = in DFSPass()
107 Eval(DominatorTreeBase<typename GraphT::NodeType> &DT, in Eval()
109 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInInfo = in Eval()
122 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInfo = in Eval()
137 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VAInfo = in Eval()
150 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
157 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in Calculate()
192 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &WInfo = in Calculate()
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DDominatorInternals.h34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, in DFSPass()
63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in DFSPass()
95 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &SuccVInfo = in DFSPass()
108 Eval(DominatorTreeBase<typename GraphT::NodeType>& DT, in Eval()
110 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInInfo = in Eval()
123 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VInfo = in Eval()
138 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &VAInfo = in Eval()
151 void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT, in Calculate()
158 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = in Calculate()
193 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &WInfo = in Calculate()
DDominators.h59 template<class NodeT> class DominatorTreeBase; variable
70 template<class N> friend class DominatorTreeBase; variable
183 void Calculate(DominatorTreeBase<typename GraphTraits<N>::NodeType>& DT,
187 class DominatorTreeBase : public DominatorBase<NodeT> {
227 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT, in Split()
288 explicit DominatorTreeBase(bool isPostDom) in DominatorTreeBase() function
290 virtual ~DominatorTreeBase() { reset(); } in ~DominatorTreeBase()
294 bool compare(DominatorTreeBase &Other) const { in compare()
568 DominatorTreeBase<typename GraphT::NodeType>& DT,
573 friend unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
[all …]
DPostDominators.h26 DominatorTreeBase<BasicBlock>* DT;
30 DT = new DominatorTreeBase<BasicBlock>(true); in PostDominatorTree()
DLoopInfo.h764 void Calculate(DominatorTreeBase<BlockT> &DT) { in Calculate()
773 LoopT *ConsiderForLoop(BlockT *BB, DominatorTreeBase<BlockT> &DT) { in ConsiderForLoop()
/external/llvm/include/llvm/IR/
DDominators.h33 extern template class DominatorTreeBase<BasicBlock>;
36 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT, Function &F);
38 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
96 class DominatorTree : public DominatorTreeBase<BasicBlock> {
98 typedef DominatorTreeBase<BasicBlock> Base;
100 DominatorTree() : DominatorTreeBase<BasicBlock>(false) {}
101 explicit DominatorTree(Function &F) : DominatorTreeBase<BasicBlock>(false) {
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/
DMachineDominators.h27 inline void DominatorTreeBase<MachineBasicBlock>::addRoot(MachineBasicBlock* MBB) { in addRoot()
32 EXTERN_TEMPLATE_INSTANTIATION(class DominatorTreeBase<MachineBasicBlock>);
43 DominatorTreeBase<MachineBasicBlock>* DT;
49 DominatorTreeBase<MachineBasicBlock>& getBase() { return *DT; } in getBase()
/external/llvm/include/llvm/Analysis/
DPostDominators.h25 struct PostDominatorTree : public DominatorTreeBase<BasicBlock> {
26 typedef DominatorTreeBase<BasicBlock> Base;
28 PostDominatorTree() : DominatorTreeBase<BasicBlock>(true) {} in PostDominatorTree()
DIteratedDominanceFrontier.h49 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {} in IDFCalculator()
87 DominatorTreeBase<BasicBlock> &DT;
DDominanceFrontier.h121 typedef DominatorTreeBase<BlockT> DomTreeT;
139 typedef DominatorTreeBase<BasicBlock> DomTreeT;
DLoopInfo.h59 template<class N> class DominatorTreeBase; variable
618 void analyze(const DominatorTreeBase<BlockT> &DomTree);
638 explicit LoopInfo(const DominatorTreeBase<BasicBlock> &DomTree);
DLoopInfoImpl.h348 const DominatorTreeBase<BlockT> &DomTree) { in discoverAndMapSubloop()
471 analyze(const DominatorTreeBase<BlockT> &DomTree) { in analyze()
/external/llvm/include/llvm/CodeGen/
DMachineDominators.h28 inline void DominatorTreeBase<MachineBasicBlock>::addRoot(MachineBasicBlock* MBB) { in addRoot()
33 extern template class DominatorTreeBase<MachineBasicBlock>;
71 DominatorTreeBase<MachineBasicBlock>* DT;
77 DominatorTreeBase<MachineBasicBlock> &getBase() { in getBase()
DMachinePostDominators.h29 DominatorTreeBase<MachineBasicBlock> *DT;
DMachineDominanceFrontier.h23 typedef DominatorTreeBase<MachineBasicBlock> DomTreeT;
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DMachineDominators.cpp22 TEMPLATE_INSTANTIATION(class DominatorTreeBase<MachineBasicBlock>);
46 DT = new DominatorTreeBase<MachineBasicBlock>(false); in MachineDominatorTree()
/external/clang/include/clang/Analysis/Analyses/
DDominators.h41 llvm::DominatorTreeBase<CFGBlock>* DT;
44 DT = new llvm::DominatorTreeBase<CFGBlock>(false); in DominatorTree()
49 llvm::DominatorTreeBase<CFGBlock>& getBase() { return *DT; } in getBase()
/external/llvm/lib/CodeGen/
DMachineDominators.cpp34 template class DominatorTreeBase<MachineBasicBlock>; variable
60 DT = new DominatorTreeBase<MachineBasicBlock>(false); in MachineDominatorTree()
DMachinePostDominators.cpp27 DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate in MachinePostDominatorTree()
/external/llvm/lib/IR/
DDominators.cpp64 template class llvm::DominatorTreeBase<BasicBlock>; member in llvm
67 DominatorTreeBase<GraphTraits<BasicBlock *>::NodeType> &DT, Function &F);
69 DominatorTreeBase<GraphTraits<Inverse<BasicBlock *>>::NodeType> &DT,
/external/swiftshader/third_party/LLVM/lib/VMCore/
DDominators.cpp52 TEMPLATE_INSTANTIATION(class llvm::DominatorTreeBase<BasicBlock>);
/external/llvm/lib/Transforms/IPO/
DSampleProfile.cpp124 DominatorTreeBase<BasicBlock> *DomTree);
161 std::unique_ptr<DominatorTreeBase<BasicBlock>> PDT;
688 DominatorTreeBase<BasicBlock> *DomTree) { in findEquivalencesFor()
1083 PDT.reset(new DominatorTreeBase<BasicBlock>(true)); in computeDominanceAndLoopInfo()
/external/llvm/lib/Analysis/
DLoopInfo.cpp585 LoopInfo::LoopInfo(const DominatorTreeBase<BasicBlock> &DomTree) { in LoopInfo()
/external/llvm/docs/
DProgrammersManual.rst2707 ``LoopInfoBase`` and ``DominatorTreeBase``. When this type of polymorphism