Home
last modified time | relevance | path

Searched refs:LoopAccessInfo (Results 1 – 12 of 12) sorted by relevance

/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLoopAccessAnalysis.h28 class LoopAccessInfo; variable
163 Instruction *getSource(const LoopAccessInfo &LAI) const;
165 Instruction *getDestination(const LoopAccessInfo &LAI) const;
576 class LoopAccessInfo {
578 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const TargetLibraryInfo *TLI,
781 DenseMap<Loop *, std::unique_ptr<LoopAccessInfo>> LoopAccessInfoMap;
795 const LoopAccessInfo &getInfo(Loop &L);
822 const LoopAccessInfo &LAI) const { in getSource()
827 const LoopAccessInfo &LAI) const { in getDestination()
H A DVectorUtils.h590 const LoopAccessInfo *LAI) in InterleavedAccessInfo()
662 const LoopAccessInfo *LAI;
735 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT); in isPredicated()
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DLoopVersioning.h27 class LoopAccessInfo; variable
47 LoopVersioning(const LoopAccessInfo &LAI,
141 const LoopAccessInfo &LAI;
/freebsd-14.2/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h367 const LoopAccessInfo *getLAI() const { return LAI; } in getLAI()
488 const LoopAccessInfo *LAI = nullptr;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopVersioning.cpp41 LoopVersioning::LoopVersioning(const LoopAccessInfo &LAI, in LoopVersioning()
279 const LoopAccessInfo &LAI = LAIs.getInfo(*L); in runImpl()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp2278 bool LoopAccessInfo::canAnalyzeLoop() { in canAnalyzeLoop()
2312 void LoopAccessInfo::analyzeLoop(AAResults *AA, LoopInfo *LI, in analyzeLoop()
2625 void LoopAccessInfo::emitUnsafeDependenceRemark() { in emitUnsafeDependenceRemark()
2693 bool LoopAccessInfo::blockNeedsPredication(BasicBlock *BB, Loop *TheLoop, in blockNeedsPredication()
2702 OptimizationRemarkAnalysis &LoopAccessInfo::recordAnalysis(StringRef RemarkName, in recordAnalysis()
2722 bool LoopAccessInfo::isInvariant(Value *V) const { in isInvariant()
2872 void LoopAccessInfo::collectStridedAccess(Value *MemAccess) { in collectStridedAccess()
2945 LoopAccessInfo::LoopAccessInfo(Loop *L, ScalarEvolution *SE, in LoopAccessInfo() function in LoopAccessInfo
2957 void LoopAccessInfo::print(raw_ostream &OS, unsigned Depth) const { in print()
3001 const LoopAccessInfo &LoopAccessInfoManager::getInfo(Loop &L) { in getInfo()
[all …]
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp170 LoadEliminationForLoop(Loop *L, LoopInfo *LI, const LoopAccessInfo &LAI, in LoadEliminationForLoop()
181 findStoreToLoadDependences(const LoopAccessInfo &LAI) { in findStoreToLoadDependences()
622 const LoopAccessInfo &LAI;
H A DLoopDistribute.cpp325 if (!LoopAccessInfo::blockNeedsPredication(Inst->getParent(), L, DT)) in mergeNonIfConvertible()
499 computePartitionSetForPointers(const LoopAccessInfo &LAI) { in computePartitionSetForPointers()
948 const LoopAccessInfo *LAI = nullptr;
H A DLoopVersioningLICM.cpp136 const LoopAccessInfo *LAI = nullptr;
/freebsd-14.2/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp1245 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT); in blockNeedsPredication()
H A DLoopVectorize.cpp1974 void Create(Loop *L, const LoopAccessInfo &LAI, in Create()
7585 const LoopAccessInfo *LAI = ILV.Legal->getLAI(); in executePlan()
/freebsd-14.2/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.cpp2278 const LoopAccessInfo *LAI) { in canTailPredicateLoop()