/external/clang/lib/Analysis/ |
H A D | Dominators.cpp | 14 void DominatorTree::anchor() { }
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | PromoteMemToReg.h | 23 class DominatorTree; 44 void PromoteMemToReg(ArrayRef<AllocaInst *> Allocas, DominatorTree &DT,
|
H A D | LoopUtils.h | 27 class DominatorTree; 53 bool simplifyLoop(Loop *L, DominatorTree *DT, LoopInfo *LI, Pass *PP, 63 /// LoopInfo and DominatorTree are required and preserved. 68 bool formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, 75 /// LoopInfo and DominatorTree are required and preserved. 80 bool formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, 85 /// reverse depth first order w.r.t the DominatorTree. This allows us to visit 87 /// iteration. Takes DomTreeNode, AliasAnalysis, LoopInfo, DominatorTree, 91 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *, 97 /// first order w.r.t the DominatorTree [all...] |
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; }
|
H A D | BasicBlockUtils.h | 27 class DominatorTree; 55 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr, 84 DominatorTree *DT; 95 CriticalEdgeSplittingOptions(AliasAnalysis *AA, DominatorTree *DT = nullptr, 102 CriticalEdgeSplittingOptions(DominatorTree *DT, LoopInfo *LI) 195 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr); 203 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr); 215 /// This currently updates the LLVM IR, AliasAnalysis, DominatorTree, 224 DominatorTree *DT = nullptr, 235 /// This currently updates the LLVM IR, AliasAnalysis, DominatorTree, [all...] |
H A D | Local.h | 43 class DominatorTree; 116 void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, DominatorTree *DT = nullptr); 176 const DominatorTree *DT = nullptr); 182 const DominatorTree *DT = nullptr) {
|
/external/llvm/include/llvm/IR/ |
H A D | Dominators.h | 10 // This file defines the DominatorTree class, which provides fast and efficient 71 class DominatorTree : public DominatorTreeBase<BasicBlock> { class in namespace:llvm 75 DominatorTree() : DominatorTreeBase<BasicBlock>(false) {} function in class:llvm::DominatorTree 77 DominatorTree(DominatorTree &&Arg) function in class:llvm::DominatorTree 79 DominatorTree &operator=(DominatorTree &&RHS) { 86 inline bool compare(const DominatorTree &Other) const { 126 // DominatorTree GraphTraits specializations so the DominatorTree ca [all...] |
/external/llvm/include/llvm/Analysis/ |
H A D | ScalarEvolutionNormalization.h | 44 class DominatorTree; 74 DominatorTree &DT);
|
H A D | PHITransAddr.h | 22 class DominatorTree; 82 const DominatorTree *DT); 92 const DominatorTree &DT, 103 const DominatorTree *DT); 111 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 | InstructionSimplify.h | 41 class DominatorTree; 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 *D [all...] |
H A D | CaptureTracking.h | 22 class DominatorTree; 37 /// DominatorTree is provided, only captures which happen before the given 47 DominatorTree *DT, bool IncludeI = false);
|
H A D | ValueTracking.h | 29 class DominatorTree; 44 const DominatorTree *DT = nullptr); 56 const DominatorTree *DT = nullptr); 67 const DominatorTree *DT = nullptr); 76 const DominatorTree *DT = nullptr); 90 const DominatorTree *DT = nullptr); 103 const DominatorTree *DT = nullptr); 218 const DominatorTree *DT = nullptr); 225 const DominatorTree *DT); 230 const DominatorTree *D [all...] |
H A D | LazyValueInfo.h | 24 class DominatorTree; 33 DominatorTree *DT;
|
H A D | IVUsers.h | 24 class DominatorTree; 123 DominatorTree *DT;
|
H A D | LoopAccessAnalysis.h | 373 DominatorTree *DT, const ValueToValueMap &Strides); 390 DominatorTree *DT); 469 DominatorTree *DT; 543 DominatorTree *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 | RegionInfo.cpp | 66 DominatorTree *DT, Region *Parent) : 94 void RegionInfo::recalculate(Function &F, DominatorTree *DT_,
|
/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() override { delete DT; } 67 inline bool compare(DominatorTree &Other) const { 165 /// DominatorTree GraphTraits specialization so the DominatorTree can be 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 * [all...] |
/external/llvm/lib/IR/ |
H A D | Dominators.cpp | 56 // DominatorTree Implementation 59 // Provide public access to DominatorTree information. Implementation details 81 bool DominatorTree::dominates(const Instruction *Def, 118 bool DominatorTree::dominates(const Instruction *Def, 144 bool DominatorTree::dominates(const BasicBlockEdge &BBE, 195 bool DominatorTree::dominates(const BasicBlockEdge &BBE, const Use &U) const { 218 bool DominatorTree::dominates(const Instruction *Def, const Use &U) const { 269 bool DominatorTree::isReachableFromEntry(const Use &U) const { 284 void DominatorTree::verifyDomTree() const { 290 DominatorTree OtherD [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/lib/Transforms/Scalar/ |
H A D | NaryReassociate.cpp | 130 DominatorTree *DT; 180 for (auto Node = GraphTraits<DominatorTree *>::nodes_begin(DT); 181 Node != GraphTraits<DominatorTree *>::nodes_end(DT); ++Node) {
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LCSSA.cpp | 62 static bool processInstruction(Loop &L, Instruction &Inst, DominatorTree &DT, 205 DominatorTree &DT, 215 bool llvm::formLCSSA(Loop &L, DominatorTree &DT, LoopInfo *LI, 264 bool llvm::formLCSSARecursively(Loop &L, DominatorTree &DT, LoopInfo *LI, 284 DominatorTree *DT; 332 static void verifyLoop(Loop &L, DominatorTree &DT) {
|
/external/llvm/include/llvm/CodeGen/ |
H A D | StackProtector.h | 61 DominatorTree *DT;
|