| /external/llvm/include/llvm/Analysis/ |
| D | InstructionSimplify.h | 41 class DominatorTree; variable
54 const DominatorTree *DT = nullptr,
63 const DominatorTree *DT = nullptr,
72 const DominatorTree *DT = nullptr,
81 const DominatorTree *DT = nullptr,
90 const DominatorTree *DT = nullptr,
98 const DominatorTree *DT = nullptr,
106 const DominatorTree *DT = nullptr,
114 const DominatorTree *DT = nullptr,
123 const DominatorTree *DT = nullptr,
[all …]
|
| D | ValueTracking.h | 28 class DominatorTree; variable
49 const DominatorTree *DT = nullptr);
59 const DominatorTree *DT = nullptr);
67 const DominatorTree *DT = nullptr);
78 const DominatorTree *DT = nullptr);
87 const DominatorTree *DT = nullptr);
93 const DominatorTree *DT = nullptr);
100 const DominatorTree *DT = nullptr);
114 const DominatorTree *DT = nullptr);
127 const DominatorTree *DT = nullptr);
[all …]
|
| D | PHITransAddr.h | 22 class DominatorTree; variable
83 const DominatorTree *DT, bool MustDominate);
93 const DominatorTree &DT,
105 const DominatorTree *DT);
113 BasicBlock *PredBB, const DominatorTree &DT,
|
| D | CFG.h | 24 class DominatorTree; variable
68 const DominatorTree *DT = nullptr,
78 const DominatorTree *DT = nullptr,
90 const DominatorTree *DT = nullptr,
|
| D | BasicAliasAnalysis.h | 31 class DominatorTree; variable
44 DominatorTree *DT;
49 AssumptionCache &AC, DominatorTree *DT = nullptr,
138 DominatorTree *DT, bool &NSW, bool &NUW);
144 AssumptionCache *AC, DominatorTree *DT);
156 AssumptionCache *AC, DominatorTree *DT);
|
| D | ScalarEvolutionNormalization.h | 44 class DominatorTree; variable
74 DominatorTree &DT);
|
| D | CaptureTracking.h | 22 class DominatorTree; variable
49 DominatorTree *DT, bool IncludeI = false,
|
| D | DemandedBits.h | 35 class DominatorTree; variable
61 DominatorTree *DT;
|
| D | LazyValueInfo.h | 24 class DominatorTree; variable
33 DominatorTree *DT;
|
| /external/llvm/include/llvm/IR/ |
| D | Dominators.h | 83 class DominatorTree : public DominatorTreeBase<BasicBlock> {
87 DominatorTree() : DominatorTreeBase<BasicBlock>(false) {} in DominatorTree() function
88 explicit DominatorTree(Function &F) : DominatorTreeBase<BasicBlock>(false) { in DominatorTree() function
92 DominatorTree(DominatorTree &&Arg) in DominatorTree() function
94 DominatorTree &operator=(DominatorTree &&RHS) {
101 inline bool compare(const DominatorTree &Other) const { in compare()
173 template <> struct GraphTraits<DominatorTree*>
175 static NodeType *getEntryNode(DominatorTree *DT) {
179 static nodes_iterator nodes_begin(DominatorTree *N) {
183 static nodes_iterator nodes_end(DominatorTree *N) {
[all …]
|
| /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 static DominatorTree *getGraph(DominatorTreeWrapperPass *DTWP) { in getGraph()
91 DominatorTreeWrapperPass, false, DominatorTree *,
95 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, false, DominatorTree *, in DomViewer()
103 DominatorTreeWrapperPass, true, DominatorTree *,
107 : DOTGraphTraitsViewer<DominatorTreeWrapperPass, true, DominatorTree *, in DomOnlyViewer()
154 DominatorTreeWrapperPass, false, DominatorTree *,
158 : DOTGraphTraitsPrinter<DominatorTreeWrapperPass, false, DominatorTree *, in DomPrinter()
[all …]
|
| D | ScalarEvolutionNormalization.cpp | 30 const Loop *L, DominatorTree *DT) { in IVUseShouldUsePostIncValue()
71 DominatorTree &DT;
77 ScalarEvolution &se, DominatorTree &dt): in PostIncTransform()
251 DominatorTree &DT) { in TransformForPostIncUse()
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | BasicBlockUtils.h | 26 class DominatorTree; variable
54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
83 DominatorTree *DT;
89 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
183 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
191 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
210 DominatorTree *DT = nullptr,
230 DominatorTree *DT = nullptr,
266 DominatorTree *DT = nullptr);
|
| D | SimplifyIndVar.h | 25 class DominatorTree; variable
36 const DominatorTree *DT;
45 const DominatorTree *getDomTree() const { return DT; } in getDomTree()
60 bool simplifyUsersOfIV(PHINode *CurrIV, ScalarEvolution *SE, DominatorTree *DT,
66 bool simplifyLoopIVs(Loop *L, ScalarEvolution *SE, DominatorTree *DT,
|
| D | CodeExtractor.h | 23 class DominatorTree; variable
48 DominatorTree *const DT;
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
76 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false);
82 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| D | LoopUtils.h | 28 class DominatorTree; variable
296 BasicBlock *InsertPreheaderForLoop(Loop *L, DominatorTree *DT, LoopInfo *LI,
304 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, ScalarEvolution *SE,
318 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI,
330 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI,
341 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
352 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
366 DominatorTree *, Loop *, AliasSetTracker *,
|
| D | UnrollLoop.h | 24 class DominatorTree; variable
34 LoopInfo *LI, ScalarEvolution *SE, DominatorTree *DT,
39 ScalarEvolution *SE, DominatorTree *DT,
|
| D | Local.h | 44 class DominatorTree; variable
117 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, DominatorTree *DT = nullptr);
177 const DominatorTree *DT = nullptr);
183 const DominatorTree *DT = nullptr) {
315 unsigned replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT,
319 unsigned replaceDominatedUsesWith(Value *From, Value *To, DominatorTree &DT,
|
| D | PromoteMemToReg.h | 23 class DominatorTree; variable
44 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
| D | LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
109 DominatorTree *DT;
|
| /external/clang/include/clang/Analysis/Analyses/ |
| D | Dominators.h | 38 class DominatorTree : public ManagedAnalysis {
43 DominatorTree() { in DominatorTree() function
47 ~DominatorTree() override { delete DT; } in ~DominatorTree()
67 inline bool compare(DominatorTree &Other) const { in compare()
194 template <> struct GraphTraits< ::clang::DominatorTree* >
196 static NodeType *getEntryNode(::clang::DominatorTree *DT) {
200 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
204 static nodes_iterator nodes_end(::clang::DominatorTree *N) {
|
| /external/llvm/lib/IR/ |
| D | Dominators.cpp | 77 bool DominatorTree::dominates(const Instruction *Def, in dominates()
114 bool DominatorTree::dominates(const Instruction *Def, in dominates()
140 bool DominatorTree::dominates(const BasicBlockEdge &BBE, in dominates()
192 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { in dominates()
216 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const { in dominates()
267 bool DominatorTree::isReachableFromEntry(const Use &U) const { in isReachableFromEntry()
282 void DominatorTree::verifyDomTree() const { in verifyDomTree()
285 DominatorTree OtherDT; in verifyDomTree()
305 DominatorTree DominatorTreeAnalysis::run(Function &F) { in run()
306 DominatorTree DT; in run()
|
| /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/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 64 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, in processInstruction()
209 DominatorTree &DT, in blockDominatesAnExit()
219 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSA()
265 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, in formLCSSARecursively()
285 DominatorTree *DT;
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LICM.cpp | 80 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT,
83 const DominatorTree *DT,
87 const DominatorTree *DT,
100 DominatorTree *DT, TargetLibraryInfo *TLI,
143 DominatorTree *DT; // Dominator Tree for the current Loop.
308 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, in sinkRegion()
366 DominatorTree *DT, TargetLibraryInfo *TLI, Loop *CurLoop, in hoistRegion()
440 bool canSinkOrHoistInst(Instruction &I, AliasAnalysis *AA, DominatorTree *DT, in canSinkOrHoistInst()
603 static bool sink(Instruction &I, const LoopInfo *LI, const DominatorTree *DT, in sink()
689 const DominatorTree *DT, in isSafeToExecuteUnconditionally()
[all …]
|