Searched refs:DominatorTree (Results 1 - 25 of 82) sorted by relevance

1234

/external/clang/lib/Analysis/
H A DDominators.cpp14 void DominatorTree::anchor() { }
/external/llvm/include/llvm/Analysis/
H A DInstructionSimplify.h40 class DominatorTree;
53 const DominatorTree *DT = nullptr);
60 const DominatorTree *DT = nullptr);
67 const DominatorTree *DT = nullptr);
74 const DominatorTree *DT = nullptr);
82 const DominatorTree *DT = nullptr);
88 const DominatorTree *DT = nullptr);
95 const DominatorTree *DT = nullptr);
102 const DominatorTree *DT = nullptr);
109 const DominatorTree *D
[all...]
H A DScalarEvolutionNormalization.h44 class DominatorTree;
74 DominatorTree &DT);
H A DPHITransAddr.h21 class DominatorTree;
78 const DominatorTree *DT);
88 const DominatorTree &DT,
99 const DominatorTree *DT);
107 BasicBlock *PredBB, const DominatorTree &DT,
H A DCFG.h24 class DominatorTree;
68 const DominatorTree *DT = nullptr,
78 const DominatorTree *DT = nullptr,
H A DIVUsers.h24 class DominatorTree;
123 DominatorTree *DT;
H A DDominanceFrontier.h172 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
184 const DomSetType &calculate(const DominatorTree &DT,
H A DRegionInfo.h221 DominatorTree *DT;
260 DominatorTree *DT, Region *Parent = nullptr);
610 DominatorTree *DT;
/external/llvm/include/llvm/Transforms/Utils/
H A DPromoteMemToReg.h23 class DominatorTree;
43 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
H A DLoopUtils.h21 class DominatorTree;
35 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, Pass *PP,
45 /// LoopInfo and DominatorTree are required and preserved.
50 bool formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE = nullptr);
56 /// LoopInfo and DominatorTree are required and preserved.
61 bool formLCSSARecursively(Loop &L, DominatorTree &DT,
H A DCodeExtractor.h23 class DominatorTree;
48 DominatorTree *const DT;
67 /// sequence out into its new function. When a DominatorTree is also given,
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
H A DSimplifyIndVar.h25 class DominatorTree;
36 const DominatorTree *DT;
45 const DominatorTree *getDomTree() const { return DT; }
/external/llvm/lib/Analysis/
H A DDomPrinter.cpp52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
57 static std::string getGraphName(DominatorTree *DT) {
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) {
85 static DominatorTree *getGraph(DominatorTreeWrapperPass *DTWP) {
91 DominatorTreeWrapperPass, false, DominatorTree *,
95 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, false, DominatorTree *,
103 DominatorTreeWrapperPass, true, DominatorTree *,
107 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, true, DominatorTree *,
154 DominatorTreeWrapperPass, false, DominatorTree *,
158 : DOTGraphTraitsPrinter<DominatorTreeWrapperPass, false, DominatorTree *,
[all...]
H A DScalarEvolutionNormalization.cpp30 const Loop *L, DominatorTree *DT) {
71 DominatorTree &DT;
77 ScalarEvolution &se, DominatorTree &dt):
251 DominatorTree &DT) {
H A DCFG.cpp131 const DominatorTree *DT,
175 const DominatorTree *DT, const LoopInfo *LI) {
187 const DominatorTree *DT, const LoopInfo *LI) {
H A DPHITransAddr.cpp147 const DominatorTree *DT) {
320 const DominatorTree *DT) {
344 const DominatorTree &DT,
368 BasicBlock *PredBB, const DominatorTree &DT,
/external/llvm/include/llvm/IR/
H A DDominators.h10 // This file defines the DominatorTree class, which provides fast and efficient
66 class DominatorTree : public DominatorTreeBase<BasicBlock> { class in namespace:llvm
70 DominatorTree() : DominatorTreeBase<BasicBlock>(false) {} function in class:llvm::DominatorTree
74 inline bool compare(const DominatorTree &Other) const {
114 // DominatorTree GraphTraits specializations so the DominatorTree can be
142 template <> struct GraphTraits<DominatorTree*>
144 static NodeType *getEntryNode(DominatorTree *DT) {
148 static nodes_iterator nodes_begin(DominatorTree *N) {
152 static nodes_iterator nodes_end(DominatorTree *
[all...]
/external/clang/include/clang/Analysis/Analyses/
H A DDominators.h38 class DominatorTree : public ManagedAnalysis { class in namespace:clang
43 DominatorTree() { function in class:clang::DominatorTree
47 ~DominatorTree() {
69 inline bool compare(DominatorTree &Other) const {
167 /// DominatorTree GraphTraits specialization so the DominatorTree can be
196 template <> struct GraphTraits< ::clang::DominatorTree* >
198 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
202 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
206 static nodes_iterator nodes_end(::clang::DominatorTree *
[all...]
/external/llvm/lib/IR/
H A DDominators.cpp55 // DominatorTree Implementation
58 // Provide public access to DominatorTree information. Implementation details
80 bool DominatorTree::dominates(const Instruction *Def,
117 bool DominatorTree::dominates(const Instruction *Def,
143 bool DominatorTree::dominates(const BasicBlockEdge &BBE,
194 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const {
217 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const {
268 bool DominatorTree::isReachableFromEntry(const Use &U) const {
283 void DominatorTree::verifyDomTree() const {
289 DominatorTree OtherD
[all...]
/external/llvm/lib/Transforms/Utils/
H A DLCSSA.cpp62 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT,
173 DominatorTree &DT,
183 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE) {
231 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT,
251 DominatorTree *DT;
299 static void verifyLoop(Loop &L, DominatorTree &DT) {
H A DMem2Reg.cpp65 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
H A DSimplifyInstructions.cpp51 const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_ssa.cpp30 // DominatorTree implements an algorithm for finding immediate dominators,
32 class DominatorTree : public Graph class in namespace:nv50_ir
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { }
65 void DominatorTree::debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph), function in class:nv50_ir::DominatorTree
97 void DominatorTree::buildDFS(Graph::Node *node)
109 void DominatorTree::squash(int v)
120 int DominatorTree
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_ssa.cpp30 // DominatorTree implements an algorithm for finding immediate dominators,
32 class DominatorTree : public Graph class in namespace:nv50_ir
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { }
65 void DominatorTree::debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph), function in class:nv50_ir::DominatorTree
97 void DominatorTree::buildDFS(Graph::Node *node)
109 void DominatorTree::squash(int v)
120 int DominatorTree
[all...]
/external/llvm/include/llvm/CodeGen/
H A DStackProtector.h61 DominatorTree *DT;

Completed in 1029 milliseconds

1234