| /external/llvm/include/llvm/Analysis/ |
| D | InstructionSimplify.h | 40 class DominatorTree; variable
53 const DominatorTree *DT = 0);
60 const DominatorTree *DT = 0);
67 const DominatorTree *DT = 0);
74 const DominatorTree *DT = 0);
82 const DominatorTree *DT = 0);
88 const DominatorTree *DT = 0);
94 const DominatorTree *DT = 0);
100 const DominatorTree *DT = 0);
106 const DominatorTree *DT = 0);
[all …]
|
| D | PHITransAddr.h | 21 class DominatorTree; variable
77 const DominatorTree *DT);
87 const DominatorTree &DT,
98 const DominatorTree *DT);
106 BasicBlock *PredBB, const DominatorTree &DT,
|
| D | ScalarEvolutionNormalization.h | 44 class DominatorTree; variable
74 DominatorTree &DT);
|
| D | DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTree>(); in runOnFunction()
181 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
184 const DomSetType &calculate(const DominatorTree &DT,
|
| D | CFG.h | 24 class DominatorTree; variable
65 DominatorTree *DT = 0, LoopInfo *LI = 0);
|
| /external/llvm/lib/Analysis/ |
| D | DomPrinter.cpp | 52 struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<DomTreeNode*> {
57 static std::string getGraphName(DominatorTree *DT) { in getGraphName()
61 std::string getNodeLabel(DomTreeNode *Node, DominatorTree *G) { in getNodeLabel()
85 : public DOTGraphTraitsViewer<DominatorTree, false> {
87 DomViewer() : DOTGraphTraitsViewer<DominatorTree, false>("dom", ID){ in DomViewer()
93 : public DOTGraphTraitsViewer<DominatorTree, true> {
95 DomOnlyViewer() : DOTGraphTraitsViewer<DominatorTree, true>("domonly", ID){ in DomOnlyViewer()
140 : public DOTGraphTraitsPrinter<DominatorTree, false> {
142 DomPrinter() : DOTGraphTraitsPrinter<DominatorTree, false>("dom", ID) { in DomPrinter()
148 : public DOTGraphTraitsPrinter<DominatorTree, true> {
[all …]
|
| D | ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) { in IVUseShouldUsePostIncValue()
71 DominatorTree &DT;
77 ScalarEvolution &se, DominatorTree &dt): in PostIncTransform()
220 DominatorTree &DT) { in TransformForPostIncUse()
|
| D | IVUsers.cpp | 37 INITIALIZE_PASS_DEPENDENCY(DominatorTree) in INITIALIZE_PASS_DEPENDENCY()
85 static bool isSimplifiedLoopNest(BasicBlock *BB, const DominatorTree *DT, in isSimplifiedLoopNest()
227 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
236 DT = &getAnalysis<DominatorTree>(); in runOnLoop()
|
| /external/llvm/lib/IR/ |
| D | Dominators.cpp | 67 char DominatorTree::ID = 0;
68 INITIALIZE_PASS(DominatorTree, "domtree",
71 bool DominatorTree::runOnFunction(Function &F) { in runOnFunction()
76 void DominatorTree::verifyAnalysis() const { in verifyAnalysis()
81 DominatorTree OtherDT; in verifyAnalysis()
92 void DominatorTree::print(raw_ostream &OS, const Module *) const { in print()
99 bool DominatorTree::dominates(const Instruction *Def, in dominates()
136 bool DominatorTree::dominates(const Instruction *Def, in dominates()
162 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates()
213 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates()
[all …]
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 32 class DominatorTree : public ManagedAnalysis {
37 DominatorTree() { in DominatorTree() function
41 ~DominatorTree() { in ~DominatorTree()
63 inline bool compare(DominatorTree &Other) const { in compare()
195 template <> struct GraphTraits< ::clang::DominatorTree* >
197 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
201 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
205 static nodes_iterator nodes_end(::clang::DominatorTree *N) {
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | CodeExtractor.h | 23 class DominatorTree; variable
48 DominatorTree *const DT;
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = 0,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| D | PromoteMemToReg.h | 24 class DominatorTree; variable
44 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
| /external/llvm/lib/Transforms/Utils/ |
| D | Mem2Reg.cpp | 42 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
55 INITIALIZE_PASS_DEPENDENCY(DominatorTree) in INITIALIZE_PASS_DEPENDENCY() argument
66 DominatorTree &DT = getAnalysis<DominatorTree>(); in INITIALIZE_PASS_DEPENDENCY()
|
| D | LCSSA.cpp | 55 DominatorTree *DT;
71 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
95 INITIALIZE_PASS_DEPENDENCY(DominatorTree) in INITIALIZE_PASS_DEPENDENCY() argument
107 DominatorTree *DT) { in BlockDominatesAnExit()
121 DT = &getAnalysis<DominatorTree>(); in runOnLoop()
|
| D | SimplifyInstructions.cpp | 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); in runOnFunction()
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_ssa.cpp | 32 class DominatorTree : public Graph class
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { } in ~DominatorTree()
65 void DominatorTree::debugPrint() in debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph), in DominatorTree() function in nv50_ir::DominatorTree
97 void DominatorTree::buildDFS(Graph::Node *node) in buildDFS()
109 void DominatorTree::squash(int v) in squash()
120 int DominatorTree::eval(int v) in eval()
128 void DominatorTree::link(int v, int w) in link()
133 void DominatorTree::build() in build()
[all …]
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| D | nv50_ir_ssa.cpp | 32 class DominatorTree : public Graph class
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { } in ~DominatorTree()
65 void DominatorTree::debugPrint() in debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph), in DominatorTree() function in nv50_ir::DominatorTree
97 void DominatorTree::buildDFS(Graph::Node *node) in buildDFS()
109 void DominatorTree::squash(int v) in squash()
120 int DominatorTree::eval(int v) in eval()
128 void DominatorTree::link(int v, int w) in link()
133 void DominatorTree::build() in build()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | Sink.cpp | 34 DominatorTree *DT;
50 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
52 AU.addPreserved<DominatorTree>(); in getAnalysisUsage()
66 INITIALIZE_PASS_DEPENDENCY(DominatorTree) in INITIALIZE_PASS_DEPENDENCY()
99 DT = &getAnalysis<DominatorTree>(); in runOnFunction()
|
| D | LoopDeletion.cpp | 40 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
47 AU.addPreserved<DominatorTree>(); in getAnalysisUsage()
64 INITIALIZE_PASS_DEPENDENCY(DominatorTree) in INITIALIZE_PASS_DEPENDENCY() argument
205 DominatorTree &DT = getAnalysis<DominatorTree>(); in runOnLoop()
|
| D | LoopRotation.cpp | 47 AU.addPreserved<DominatorTree>(); in getAnalysisUsage()
254 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) in simplifyLoopLatch()
436 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) { in rotateLoop()
474 if (DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>()) { in rotateLoop()
|
| D | LoopInstSimplify.cpp | 57 INITIALIZE_PASS_DEPENDENCY(DominatorTree) in INITIALIZE_PASS_DEPENDENCY()
68 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); in runOnLoop()
|
| /external/llvm/tools/opt/ |
| D | GraphPrinters.cpp | 34 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
39 getAnalysis<DominatorTree>().dump(); in runOnFunction()
|
| /external/llvm/unittests/IR/ |
| D | DominatorTreeTest.cpp | 28 DominatorTree *DT = &getAnalysis<DominatorTree>(); in runOnFunction()
154 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
192 TEST(DominatorTree, Unreachable) { in TEST() argument
203 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
|
| /external/llvm/unittests/Analysis/ |
| D | CFGTest.cpp | 88 AU.addRequired<DominatorTree>(); in ExpectPath()
96 DominatorTree *DT = &getAnalysis<DominatorTree>(); in ExpectPath()
|
| /external/llvm/lib/Transforms/IPO/ |
| D | LoopExtractor.cpp | 50 AU.addRequired<DominatorTree>(); in getAnalysisUsage()
60 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
90 DominatorTree &DT = getAnalysis<DominatorTree>(); in runOnLoop()
|