| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| PostDominators.h | 62 PostDominatorTree DT;
68 PostDominatorTree &getPostDomTree() { return DT; }
69 const PostDominatorTree &getPostDomTree() const { return DT; }
78 DT.releaseMemory();
88 static NodeRef getEntryNode(PostDominatorTree *DT) {
89 return DT->getRootNode();
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
147 DominatorTree *DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Transforms/Vectorize/ |
| LoopVectorize.h | 81 DominatorTree *DT;
|
| SLPVectorizer.h | 52 DominatorTree *DT = nullptr;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| DemandedBits.h | 43 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) :
44 F(F), AC(AC), DT(DT) {}
63 DominatorTree &DT;
|
| LazyValueInfo.h | 37 DominatorTree *DT = nullptr;
46 : AC(AC_), DL(DL_), TLI(TLI_), DT(DT_) {}
48 : AC(Arg.AC), DL(Arg.DL), TLI(Arg.TLI), DT(Arg.DT), PImpl(Arg.PImpl) {
56 DT = Arg.DT;
112 /// we can solve/print for, in the LVIPrinter. The DT is optional
|
| LoopAnalysisManager.h | 56 DominatorTree &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
147 DominatorTree *DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| DemandedBits.h | 43 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) :
44 F(F), AC(AC), DT(DT) {}
63 DominatorTree &DT;
|
| LazyValueInfo.h | 37 DominatorTree *DT = nullptr;
46 : AC(AC_), DL(DL_), TLI(TLI_), DT(DT_) {}
48 : AC(Arg.AC), DL(Arg.DL), TLI(Arg.TLI), DT(Arg.DT), PImpl(Arg.PImpl) {
56 DT = Arg.DT;
112 /// we can solve/print for, in the LVIPrinter. The DT is optional
|
| LoopAnalysisManager.h | 56 DominatorTree &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
147 DominatorTree *DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| DemandedBits.h | 43 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) :
44 F(F), AC(AC), DT(DT) {}
63 DominatorTree &DT;
|
| LazyValueInfo.h | 37 DominatorTree *DT = nullptr;
46 : AC(AC_), DL(DL_), TLI(TLI_), DT(DT_) {}
48 : AC(Arg.AC), DL(Arg.DL), TLI(Arg.TLI), DT(Arg.DT), PImpl(Arg.PImpl) {
56 DT = Arg.DT;
112 /// we can solve/print for, in the LVIPrinter. The DT is optional
|
| LoopAnalysisManager.h | 56 DominatorTree &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
147 DominatorTree *DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| DemandedBits.h | 43 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) :
44 F(F), AC(AC), DT(DT) {}
63 DominatorTree &DT;
|
| LazyValueInfo.h | 37 DominatorTree *DT = nullptr;
46 : AC(AC_), DL(DL_), TLI(TLI_), DT(DT_) {}
48 : AC(Arg.AC), DL(Arg.DL), TLI(Arg.TLI), DT(Arg.DT), PImpl(Arg.PImpl) {
56 DT = Arg.DT;
112 /// we can solve/print for, in the LVIPrinter. The DT is optional
|
| LoopAnalysisManager.h | 56 DominatorTree &DT;
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
147 DominatorTree *DT;
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| DemandedBits.h | 41 DemandedBits(Function &F, AssumptionCache &AC, DominatorTree &DT) :
42 F(F), AC(AC), DT(DT), Analyzed(false) {}
55 DominatorTree &DT;
|
| LazyValueInfo.h | 37 DominatorTree *DT = nullptr;
46 : AC(AC_), DL(DL_), TLI(TLI_), DT(DT_) {}
48 : AC(Arg.AC), DL(Arg.DL), TLI(Arg.TLI), DT(Arg.DT), PImpl(Arg.PImpl) {
56 DT = Arg.DT;
|
| LoopAnalysisManager.h | 56 DominatorTree &DT;
|
| PostDominators.h | 62 PostDominatorTree DT;
68 PostDominatorTree &getPostDomTree() { return DT; }
69 const PostDominatorTree &getPostDomTree() const { return DT; }
78 DT.releaseMemory();
88 static NodeRef getEntryNode(PostDominatorTree *DT) {
89 return DT->getRootNode();
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| LoopVersioning.h | 43 DominatorTree *DT, ScalarEvolution *SE,
147 DominatorTree *DT;
|
