| /external/llvm/lib/Target/AArch64/ |
| AArch64CleanupLocalDynamicTLSPass.cpp | 51 MachineDominatorTree *DT = &getAnalysis<MachineDominatorTree>();
52 return VisitNode(DT->getRootNode(), 0);
|
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyOptimizeReturned.cpp | 40 DominatorTree *DT;
44 OptimizeReturned() : FunctionPass(ID), DT(nullptr) {}
66 if (DT->dominates(Inst, U))
73 DT = &getAnalysis<DominatorTreeWrapperPass>().getDomTree();
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopSimplifyCFG.cpp | 39 static bool simplifyLoopCFG(Loop &L, DominatorTree &DT, LoopInfo &LI) {
60 MergeBasicBlockIntoOnlyPred(Succ, &DT);
73 auto *DT = FAM.getCachedResult<DominatorTreeAnalysis>(*F);
74 assert((LI && DT) && "Analyses for LoopSimplifyCFG not available");
76 if (!simplifyLoopCFG(L, *DT, *LI))
93 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
95 return simplifyLoopCFG(*L, DT, LI);
|
| /external/llvm/lib/Transforms/Utils/ |
| Mem2Reg.cpp | 30 static bool promoteMemoryToRegister(Function &F, DominatorTree &DT,
49 PromoteMemToReg(Allocas, DT, nullptr, &AC);
57 auto &DT = AM.getResult<DominatorTreeAnalysis>(F);
59 if (!promoteMemoryToRegister(F, DT, AC))
80 DominatorTree &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
83 return promoteMemoryToRegister(F, DT, AC);
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/Utils/ |
| SimplifyInstructions.cpp | 46 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
63 if (Value *V = SimplifyInstruction(I, TD, DT)) {
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 49 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {}
87 DominatorTreeBase<BasicBlock> &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Scalar/ |
| SROA.h | 60 DominatorTree *DT = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
79 DominatorTree *DT;
85 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
87 : DT(DT), LI(LI) {}
174 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
181 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
200 DominatorTree *DT = nullptr,
220 DominatorTree *DT = nullptr,
250 /// Updates DT and LI if given
[all...] |
| CodeExtractor.h | 51 DominatorTree *const DT;
82 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
90 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false,
98 CodeExtractor(DominatorTree &DT, const RegionNode &RN,
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 49 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {}
87 DominatorTreeBase<BasicBlock> &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Scalar/ |
| SROA.h | 60 DominatorTree *DT = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
79 DominatorTree *DT;
85 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
87 : DT(DT), LI(LI) {}
174 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
181 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
200 DominatorTree *DT = nullptr,
220 DominatorTree *DT = nullptr,
250 /// Updates DT and LI if given
[all...] |
| CodeExtractor.h | 52 DominatorTree *const DT;
75 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
83 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false,
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 49 IDFCalculator(DominatorTreeBase<BasicBlock> &DT) : DT(DT), useLiveIn(false) {}
87 DominatorTreeBase<BasicBlock> &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 DominatorTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Scalar/ |
| SROA.h | 60 DominatorTree *DT = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
79 DominatorTree *DT;
85 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
87 : DT(DT), LI(LI) {}
174 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
181 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
200 DominatorTree *DT = nullptr,
220 DominatorTree *DT = nullptr,
250 /// Updates DT and LI if given
[all...] |
| CodeExtractor.h | 52 DominatorTree *const DT;
75 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
83 CodeExtractor(DominatorTree &DT, Loop &L, bool AggregateArgs = false,
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| IteratedDominanceFrontier.h | 48 IDFCalculator(DominatorTreeBase<BasicBlock, IsPostDom> &DT)
49 : DT(DT), useLiveIn(false) {}
87 DominatorTreeBase<BasicBlock, IsPostDom> &DT;
|
| PostDominators.h | 67 PostDominatorTree DT;
73 PostDominatorTree &getPostDomTree() { return DT; }
74 const PostDominatorTree &getPostDomTree() const { return DT; }
83 DT.releaseMemory();
93 static NodeRef getEntryNode(PostDominatorTree *DT) {
94 return DT->getRootNode();
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/ |
| MachinePostDominators.h | 29 PostDomTreeBase<MachineBasicBlock> *DT;
41 return DT->getRoots();
45 return DT->getRootNode();
49 return DT->getNode(BB);
53 return DT->getNode(BB);
58 return DT->dominates(A, B);
62 return DT->dominates(A, B);
67 return DT->properlyDominates(A, B);
72 return DT->properlyDominates(A, B);
77 return DT->findNearestCommonDominator(A, B)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Scalar/ |
| SROA.h | 68 DominatorTree *DT = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 54 bool MergeBlockIntoPredecessor(BasicBlock *BB, DominatorTree *DT = nullptr,
79 DominatorTree *DT;
85 CriticalEdgeSplittingOptions(DominatorTree *DT = nullptr,
87 : DT(DT), LI(LI) {}
174 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
181 DominatorTree *DT = nullptr, LoopInfo *LI = nullptr);
200 DominatorTree *DT = nullptr,
220 DominatorTree *DT = nullptr,
250 /// Updates DT and LI if given
[all...] |
