| /external/clang/lib/Analysis/ |
| Dominators.cpp | 14 void DominatorTree::anchor() { }
|
| /external/llvm/include/llvm/Analysis/ |
| InstructionSimplify.h | 40 class DominatorTree;
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...] |
| ScalarEvolutionNormalization.h | 44 class DominatorTree;
74 DominatorTree &DT);
|
| CFG.h | 24 class DominatorTree;
65 DominatorTree *DT = 0, LoopInfo *LI = 0);
|
| PHITransAddr.h | 21 class DominatorTree;
77 const DominatorTree *DT);
87 const DominatorTree &DT,
98 const DominatorTree *DT);
106 BasicBlock *PredBB, const DominatorTree &DT,
|
| DominanceFrontier.h | 172 DominatorTree &DT = getAnalysis<DominatorTree>();
181 AU.addRequired<DominatorTree>();
184 const DomSetType &calculate(const DominatorTree &DT,
|
| IVUsers.h | 24 class DominatorTree;
123 DominatorTree *DT;
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| PromoteMemToReg.h | 24 class DominatorTree;
44 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
| 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 = 0,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| /external/llvm/tools/opt/ |
| GraphPrinters.cpp | 34 AU.addRequired<DominatorTree>();
39 getAnalysis<DominatorTree>().dump();
|
| /external/llvm/lib/Analysis/ |
| 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 : public DOTGraphTraitsViewer<DominatorTree, false> {
87 DomViewer() : DOTGraphTraitsViewer<DominatorTree, false>("dom", ID){
93 : public DOTGraphTraitsViewer<DominatorTree, true> {
95 DomOnlyViewer() : DOTGraphTraitsViewer<DominatorTree, true>("domonly", ID){
140 : public DOTGraphTraitsPrinter<DominatorTree, false> {
142 DomPrinter() : DOTGraphTraitsPrinter<DominatorTree, false>("dom", ID) {
148 : public DOTGraphTraitsPrinter<DominatorTree, true>
[all...] |
| ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) {
71 DominatorTree &DT;
77 ScalarEvolution &se, DominatorTree &dt):
220 DominatorTree &DT) {
|
| /external/llvm/lib/Transforms/Utils/ |
| Mem2Reg.cpp | 42 AU.addRequired<DominatorTree>();
55 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
66 DominatorTree &DT = getAnalysis<DominatorTree>();
|
| SimplifyInstructions.cpp | 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
|
| LCSSA.cpp | 55 DominatorTree *DT;
71 AU.addRequired<DominatorTree>();
95 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
107 DominatorTree *DT) {
121 DT = &getAnalysis<DominatorTree>();
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 32 class DominatorTree : public ManagedAnalysis {
37 DominatorTree() {
41 ~DominatorTree() {
63 inline bool compare(DominatorTree &Other) const {
166 /// DominatorTree GraphTraits specialization so the DominatorTree can be
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)
[all...] |
| /external/llvm/lib/IR/ |
| Dominators.cpp | 56 // DominatorTree Implementation
59 // Provide public access to DominatorTree information. Implementation details
67 char DominatorTree::ID = 0;
68 INITIALIZE_PASS(DominatorTree, "domtree",
71 bool DominatorTree::runOnFunction(Function &F) {
76 void DominatorTree::verifyAnalysis() const {
81 DominatorTree OtherDT;
84 errs() << "DominatorTree is not up to date!\nComputed:\n";
92 void DominatorTree::print(raw_ostream &OS, const Module *) const {
99 bool DominatorTree::dominates(const Instruction *Def
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 30 // DominatorTree implements an algorithm for finding immediate dominators,
32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { }
65 void DominatorTree::debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
97 void DominatorTree::buildDFS(Graph::Node *node)
109 void DominatorTree::squash(int v)
120 int DominatorTree::eval(int v
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_ssa.cpp | 30 // DominatorTree implements an algorithm for finding immediate dominators,
32 class DominatorTree : public Graph
35 DominatorTree(Graph *cfg);
36 ~DominatorTree() { }
65 void DominatorTree::debugPrint()
76 DominatorTree::DominatorTree(Graph *cfgraph) : cfg(cfgraph),
97 void DominatorTree::buildDFS(Graph::Node *node)
109 void DominatorTree::squash(int v)
120 int DominatorTree::eval(int v
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| LoopDeletion.cpp | 40 AU.addRequired<DominatorTree>();
47 AU.addPreserved<DominatorTree>();
64 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
205 DominatorTree &DT = getAnalysis<DominatorTree>();
|
| Sink.cpp | 34 DominatorTree *DT;
50 AU.addRequired<DominatorTree>();
52 AU.addPreserved<DominatorTree>();
66 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
99 DT = &getAnalysis<DominatorTree>();
|
| LoopInstSimplify.cpp | 57 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
68 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
|
| /external/llvm/unittests/IR/ |
| DominatorTreeTest.cpp | 28 DominatorTree *DT = &getAnalysis<DominatorTree>();
154 AU.addRequired<DominatorTree>();
192 TEST(DominatorTree, Unreachable) {
203 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
|
| /external/llvm/unittests/Analysis/ |
| CFGTest.cpp | 88 AU.addRequired<DominatorTree>();
96 DominatorTree *DT = &getAnalysis<DominatorTree>();
|
| /external/llvm/lib/Transforms/IPO/ |
| LoopExtractor.cpp | 50 AU.addRequired<DominatorTree>();
60 INITIALIZE_PASS_DEPENDENCY(DominatorTree)
90 DominatorTree &DT = getAnalysis<DominatorTree>();
|
