/external/clang/lib/Analysis/ |
H A D | Dominators.cpp | 14 void DominatorTree::anchor() { }
|
/external/llvm/include/llvm/Analysis/ |
H A D | InstructionSimplify.h | 40 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 D | ScalarEvolutionNormalization.h | 44 class DominatorTree; 74 DominatorTree &DT);
|
H A D | PHITransAddr.h | 21 class DominatorTree; 78 const DominatorTree *DT); 88 const DominatorTree &DT, 99 const DominatorTree *DT); 107 BasicBlock *PredBB, const DominatorTree &DT,
|
H A D | CFG.h | 24 class DominatorTree; 68 const DominatorTree *DT = nullptr, 78 const DominatorTree *DT = nullptr,
|
H A D | IVUsers.h | 24 class DominatorTree; 123 DominatorTree *DT;
|
H A D | DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree(); 184 const DomSetType &calculate(const DominatorTree &DT,
|
H A D | RegionInfo.h | 221 DominatorTree *DT; 260 DominatorTree *DT, Region *Parent = nullptr); 610 DominatorTree *DT;
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | PromoteMemToReg.h | 23 class DominatorTree; 43 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
H A D | LoopUtils.h | 21 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 D | CodeExtractor.h | 23 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 D | SimplifyIndVar.h | 25 class DominatorTree; 36 const DominatorTree *DT; 45 const DominatorTree *getDomTree() const { return DT; }
|
/external/llvm/lib/Analysis/ |
H A D | DomPrinter.cpp | 52 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 D | ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) { 71 DominatorTree &DT; 77 ScalarEvolution &se, DominatorTree &dt): 251 DominatorTree &DT) {
|
H A D | CFG.cpp | 131 const DominatorTree *DT, 175 const DominatorTree *DT, const LoopInfo *LI) { 187 const DominatorTree *DT, const LoopInfo *LI) {
|
H A D | PHITransAddr.cpp | 147 const DominatorTree *DT) { 320 const DominatorTree *DT) { 344 const DominatorTree &DT, 368 BasicBlock *PredBB, const DominatorTree &DT,
|
/external/llvm/include/llvm/IR/ |
H A D | Dominators.h | 10 // 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 D | Dominators.h | 38 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 D | Dominators.cpp | 55 // 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 D | LCSSA.cpp | 62 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 D | Mem2Reg.cpp | 65 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
H A D | SimplifyInstructions.cpp | 51 const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_ssa.cpp | 30 // 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 D | nv50_ir_ssa.cpp | 30 // 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 D | StackProtector.h | 61 DominatorTree *DT;
|