Home
last modified time | relevance | path

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

/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DLoopAccessAnalysis.h29 class LoopAccessInfo; variable
151 Instruction *getSource(const LoopAccessInfo &LAI) const;
153 Instruction *getDestination(const LoopAccessInfo &LAI) const;
562 class LoopAccessInfo {
564 LoopAccessInfo(Loop *L, ScalarEvolution *SE, const TargetLibraryInfo *TLI,
771 DenseMap<Loop *, std::unique_ptr<LoopAccessInfo>> LoopAccessInfoMap;
785 const LoopAccessInfo &getInfo(Loop &L);
841 const LoopAccessInfo &LAI) const { in getSource()
846 const LoopAccessInfo &LAI) const { in getDestination()
H A DVectorUtils.h769 const LoopAccessInfo *LAI) in InterleavedAccessInfo()
841 const LoopAccessInfo *LAI;
914 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT); in isPredicated()
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DLoopVersioning.h27 class LoopAccessInfo; variable
47 LoopVersioning(const LoopAccessInfo &LAI,
141 const LoopAccessInfo &LAI;
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Vectorize/
H A DLoopVectorizationLegality.h365 const LoopAccessInfo *getLAI() const { return LAI; } in getLAI()
490 const LoopAccessInfo *LAI = nullptr;
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp2126 bool LoopAccessInfo::canAnalyzeLoop() { in canAnalyzeLoop()
2160 void LoopAccessInfo::analyzeLoop(AAResults *AA, LoopInfo *LI, in analyzeLoop()
2466 void LoopAccessInfo::emitUnsafeDependenceRemark() { in emitUnsafeDependenceRemark()
2519 bool LoopAccessInfo::blockNeedsPredication(BasicBlock *BB, Loop *TheLoop, in blockNeedsPredication()
2528 OptimizationRemarkAnalysis &LoopAccessInfo::recordAnalysis(StringRef RemarkName, in recordAnalysis()
2548 bool LoopAccessInfo::isUniform(Value *V) const { in isUniform()
2559 void LoopAccessInfo::collectStridedAccess(Value *MemAccess) { in collectStridedAccess()
2618 LoopAccessInfo::LoopAccessInfo(Loop *L, ScalarEvolution *SE, in LoopAccessInfo() function in LoopAccessInfo
2630 void LoopAccessInfo::print(raw_ostream &OS, unsigned Depth) const { in print()
2673 const LoopAccessInfo &LoopAccessInfoManager::getInfo(Loop &L) { in getInfo()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DLoopVersioning.cpp40 LoopVersioning::LoopVersioning(const LoopAccessInfo &LAI, in LoopVersioning()
278 const LoopAccessInfo &LAI = LAIs.getInfo(*L); in runImpl()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DLoopLoadElimination.cpp164 LoadEliminationForLoop(Loop *L, LoopInfo *LI, const LoopAccessInfo &LAI, in LoadEliminationForLoop()
175 findStoreToLoadDependences(const LoopAccessInfo &LAI) { in findStoreToLoadDependences()
615 const LoopAccessInfo &LAI;
H A DLoopDistribute.cpp328 if (!LoopAccessInfo::blockNeedsPredication(Inst->getParent(), L, DT)) in mergeNonIfConvertible()
502 computePartitionSetForPointers(const LoopAccessInfo &LAI) { in computePartitionSetForPointers()
951 const LoopAccessInfo *LAI = nullptr;
H A DLoopVersioningLICM.cpp166 const LoopAccessInfo *LAI = nullptr;
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationLegality.cpp1106 return LoopAccessInfo::blockNeedsPredication(BB, TheLoop, DT); in blockNeedsPredication()
H A DLoopVectorize.cpp1914 void Create(Loop *L, const LoopAccessInfo &LAI, in Create()
7658 const LoopAccessInfo *LAI = ILV.Legal->getLAI(); in executePlan()
/openbsd-src/gnu/llvm/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.cpp2153 const LoopAccessInfo *LAI) { in canTailPredicateLoop()