| /external/llvm-project/polly/include/polly/ |
| D | DependenceInfo.h | 38 struct Dependences { struct
148 ~Dependences() { releaseMemory(); } in ~Dependences() argument
152 explicit Dependences(const std::shared_ptr<isl_ctx> &IslCtx, in Dependences() argument
196 std::unique_ptr<Dependences> D[Dependences::NumAnalysisLevels]; argument
204 const Dependences &getDependences(Dependences::AnalysisLevel Level);
207 const Dependences &recomputeDependences(Dependences::AnalysisLevel Level);
236 const Dependences &getDependences(Dependences::AnalysisLevel Level);
239 const Dependences &recomputeDependences(Dependences::AnalysisLevel Level);
260 std::unique_ptr<Dependences> D[Dependences::NumAnalysisLevels];
278 const Dependences &getDependences(Scop *S, Dependences::AnalysisLevel Level);
[all …]
|
| D | ScheduleOptimizer.h | 43 struct Dependences;
53 const Dependences *D;
301 const polly::Dependences *D,
|
| /external/llvm-project/polly/lib/Analysis/ |
| D | DependenceInfo.cpp | 71 static cl::opt<Dependences::AnalysisLevel> OptAnalysisLevel(
74 cl::values(clEnumValN(Dependences::AL_Statement, "statement-wise",
76 clEnumValN(Dependences::AL_Reference, "reference-wise",
79 clEnumValN(Dependences::AL_Access, "access-wise",
82 cl::Hidden, cl::init(Dependences::AL_Statement), cl::ZeroOrMore,
102 Dependences::AnalysisLevel TagLevel) { in tag()
103 if (TagLevel == Dependences::AL_Reference) in tag()
106 if (TagLevel == Dependences::AL_Access) in tag()
118 Dependences::AnalysisLevel Level) { in collectInfo()
157 if (Level > Dependences::AL_Statement) { in collectInfo()
[all …]
|
| D | PolyhedralInfo.cpp | 78 const Dependences &D = in checkParallel()
79 DI->getDependences(const_cast<Scop *>(S), Dependences::AL_Access); in checkParallel()
85 D.getDependences(Dependences::TYPE_RAW | Dependences::TYPE_WAW | in checkParallel()
86 Dependences::TYPE_WAR | Dependences::TYPE_RED) in checkParallel()
|
| /external/llvm-project/polly/lib/Transform/ |
| D | MaximalStaticExpansion.cpp | 76 const isl::union_map &Dependences);
103 const isl::union_map &Dependences, ScopArrayInfo *ExpandedSAI,
112 const isl::union_map &Dependences);
133 Scop &S, const isl::union_map &Dependences, MemoryAccess *MA) { in filterDependences() argument
141 for (isl::map Map : Dependences.get_map_list()) { in filterDependences()
173 const isl::union_map &Dependences) { in isExpandable() argument
190 auto MapDeps = filterDependences(S, Dependences, Write); in isExpandable()
268 auto MapDependences = filterDependences(S, Dependences.reverse(), MA); in isExpandable()
316 const isl::union_map &Dependences, in mapAccess() argument
329 filterDependences(S, Reverse ? Dependences.reverse() : Dependences, MA); in mapAccess()
[all …]
|
| D | DeadCodeElimination.cpp | 115 const Dependences &D = DI.getDependences(Dependences::AL_Statement); in eliminateDeadCode()
122 D.getDependences(Dependences::TYPE_RAW | Dependences::TYPE_RED); in eliminateDeadCode()
155 DI.recomputeDependences(Dependences::AL_Statement); in eliminateDeadCode()
|
| D | ScheduleOptimizer.cpp | 725 static bool containsOnlyMatMulDep(isl::map Schedule, const Dependences *D, in containsOnlyMatMulDep()
727 isl::union_map Dep = D->getDependences(Dependences::TYPE_RAW); in containsOnlyMatMulDep()
728 isl::union_map Red = D->getDependences(Dependences::TYPE_RED); in containsOnlyMatMulDep()
769 static bool containsMatrMult(isl::map PartialSchedule, const Dependences *D, in containsMatrMult()
1311 const Dependences *D, in isMatrMultPattern()
1483 const Dependences &D = in runOnScop()
1484 getAnalysis<DependenceInfo>().getDependences(Dependences::AL_Statement); in runOnScop()
1499 Dependences::TYPE_RAW | Dependences::TYPE_WAR | Dependences::TYPE_WAW; in runOnScop()
1504 Dependences::TYPE_RAW | Dependences::TYPE_WAR | Dependences::TYPE_WAW; in runOnScop()
1506 ProximityKinds = Dependences::TYPE_RAW; in runOnScop()
[all …]
|
| /external/llvm-project/polly/lib/CodeGen/ |
| D | IslAst.cpp | 109 const Dependences *Deps = nullptr;
207 const Dependences *D, in astScheduleDimIsParallel()
214 D->getDependences(Dependences::TYPE_RAW | Dependences::TYPE_WAW | in astScheduleDimIsParallel()
215 Dependences::TYPE_WAR) in astScheduleDimIsParallel()
220 D->getDependences(Dependences::TYPE_RAW | Dependences::TYPE_WAW | in astScheduleDimIsParallel()
221 Dependences::TYPE_WAR | Dependences::TYPE_TC_RED) in astScheduleDimIsParallel()
232 D->getDependences(Dependences::TYPE_TC_RED).release(); in astScheduleDimIsParallel()
521 void IslAst::init(const Dependences &D) { in init()
574 IslAst IslAst::create(Scop &Scop, const Dependences &D) { in create()
669 Dependences::AL_Statement)}; in run()
[all …]
|
| /external/llvm-project/polly/include/polly/CodeGen/ |
| D | IslAst.h | 31 struct Dependences;
41 static IslAst create(Scop &Scop, const Dependences &D);
70 void init(const Dependences &D);
116 IslAstInfo(Scop &S, const Dependences &D) : S(S), Ast(IslAst::create(S, D)) {} in IslAstInfo()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonVectorLoopCarriedReuse.cpp | 289 SetVector<DepChain *> Dependences; member in __anonaa29b5980111::HexagonVectorLoopCarriedReuse
451 for (auto *D : Dependences) { in findValueToReuse()
668 Dependences.clear(); in doVLCR()
678 llvm::for_each(Dependences, std::default_delete<DepChain>()); in doVLCR()
722 for (auto *D : Dependences) { in getDepChainBtwn()
739 Dependences.insert(D); in findLoopCarriedDeps()
743 LLVM_DEBUG(dbgs() << "Found " << Dependences.size() << " dependences\n"); in findLoopCarriedDeps()
744 LLVM_DEBUG(for (size_t i = 0; i < Dependences.size(); in findLoopCarriedDeps()
745 ++i) { dbgs() << *Dependences[i] << "\n"; }); in findLoopCarriedDeps()
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonVectorLoopCarriedReuse.cpp | 194 SetVector<DepChain *> Dependences; member in __anonc1c02e840111::HexagonVectorLoopCarriedReuse
372 for (auto *D : Dependences) { in findValueToReuse()
589 Dependences.clear(); in doVLCR()
599 llvm::for_each(Dependences, std::default_delete<DepChain>()); in doVLCR()
643 for (auto *D : Dependences) { in getDepChainBtwn()
660 Dependences.insert(D); in findLoopCarriedDeps()
664 LLVM_DEBUG(dbgs() << "Found " << Dependences.size() << " dependences\n"); in findLoopCarriedDeps()
665 LLVM_DEBUG(for (size_t i = 0; i < Dependences.size(); in findLoopCarriedDeps()
666 ++i) { dbgs() << *Dependences[i] << "\n"; }); in findLoopCarriedDeps()
|
| /external/llvm-project/polly/test/DependenceInfo/ |
| D | reduction_simple_iv_debug_wrapped_dependences.ll | 9 ; CHECK: Wrapped Dependences:
19 ; CHECK: Final Wrapped Dependences:
29 ; CHECK: Zipped Dependences:
39 ; CHECK: Unwrapped Dependences:
|
| /external/llvm-project/llvm/test/Analysis/LoopAccessAnalysis/ |
| D | stride-access-dependence.ll | 17 ; CHECK-NEXT: Dependences:
53 ; CHECK-NEXT: Dependences:
88 ; CHECK-NEXT: Dependences:
122 ; CHECK-NEXT: Dependences:
161 ; CHECK-NEXT: Dependences:
197 ; CHECK-NEXT: Dependences:
234 ; CHECK-NEXT: Dependences:
273 ; CHECK-NEXT: Dependences:
311 ; CHECK-NEXT: Dependences:
350 ; CHECK-NEXT: Dependences:
[all …]
|
| D | pointer-with-unknown-bounds.ll | 16 ; CHECK: Dependences:
|
| /external/llvm/test/Analysis/LoopAccessAnalysis/ |
| D | stride-access-dependence.ll | 17 ; CHECK-NEXT: Dependences:
53 ; CHECK-NEXT: Dependences:
88 ; CHECK-NEXT: Dependences:
122 ; CHECK-NEXT: Dependences:
161 ; CHECK-NEXT: Dependences:
197 ; CHECK-NEXT: Dependences:
234 ; CHECK-NEXT: Dependences:
273 ; CHECK-NEXT: Dependences:
311 ; CHECK-NEXT: Dependences:
350 ; CHECK-NEXT: Dependences:
[all …]
|
| D | pointer-with-unknown-bounds.ll | 16 ; CHECK: Dependences:
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
| D | VectorUtils.h | 641 DenseMap<Instruction *, SmallPtrSet<Instruction *, 2>> Dependences; variable
753 return Dependences.find(Src) == Dependences.end() || in canReorderMemAccessesForInterleavedGroups()
754 !Dependences.lookup(Src).count(Sink); in canReorderMemAccessesForInterleavedGroups()
766 Dependences[Dep.getSource(*LAI)].insert(Dep.getDestination(*LAI)); in collectDependences()
|
| D | LoopAccessAnalysis.h | 231 return RecordDependences ? &Dependences : nullptr; in getDependences()
234 void clearDependences() { Dependences.clear(); } in clearDependences()
301 SmallVector<Dependence, 8> Dependences; variable
|
| /external/llvm-project/polly/lib/Exchange/ |
| D | JSONExporter.cpp | 201 typedef Dependences::StatementToIslMapTy StatementToIslMapTy;
264 const Dependences &D) { in importSchedule()
695 static bool importScop(Scop &S, const Dependences &D, const DataLayout &DL, in importScop()
777 const Dependences &D = in runOnScop()
778 getAnalysis<DependenceInfo>().getDependences(Dependences::AL_Statement); in runOnScop()
800 const Dependences &D = in run()
802 Dependences::AL_Statement); in run()
|
| /external/llvm-project/llvm/include/llvm/Analysis/ |
| D | VectorUtils.h | 823 DenseMap<Instruction *, SmallPtrSet<Instruction *, 2>> Dependences; variable
935 return Dependences.find(Src) == Dependences.end() || in canReorderMemAccessesForInterleavedGroups()
936 !Dependences.lookup(Src).count(Sink); in canReorderMemAccessesForInterleavedGroups()
948 Dependences[Dep.getSource(*LAI)].insert(Dep.getDestination(*LAI)); in collectDependences()
|
| D | LoopAccessAnalysis.h | 229 return RecordDependences ? &Dependences : nullptr; in getDependences()
232 void clearDependences() { Dependences.clear(); } in clearDependences()
299 SmallVector<Dependence, 8> Dependences; variable
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | LoopDistribute.cpp | 568 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences() argument
572 for (auto &Dep : Dependences) in MemoryInstructionDependences()
618 auto *Dependences = LAI->getDepChecker().getDependences(); in processLoop() local
619 if (!Dependences || Dependences->empty()) in processLoop()
645 *Dependences); in processLoop()
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | LoopDistribute.cpp | 636 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences() argument
640 for (auto &Dep : Dependences) in MemoryInstructionDependences()
690 auto *Dependences = LAI->getDepChecker().getDependences(); in processLoop() local
691 if (!Dependences || Dependences->empty()) in processLoop()
717 *Dependences); in processLoop()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | LoopDistribute.cpp | 636 const SmallVectorImpl<Dependence> &Dependences) { in MemoryInstructionDependences() argument
640 for (auto &Dep : Dependences) in MemoryInstructionDependences()
690 auto *Dependences = LAI->getDepChecker().getDependences(); in processLoop() local
691 if (!Dependences || Dependences->empty()) in processLoop()
717 *Dependences); in processLoop()
|
| /external/llvm/include/llvm/Analysis/ |
| D | LoopAccessAnalysis.h | 241 return RecordDependences ? &Dependences : nullptr; in getDependences()
244 void clearDependences() { Dependences.clear(); } in clearDependences()
304 SmallVector<Dependence, 8> Dependences; variable
|