Home
last modified time | relevance | path

Searched refs:MaxVF (Results 1 – 4 of 4) sorted by relevance

/freebsd-13.1/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DLoopVectorizationPlanner.h335 void buildVPlans(ElementCount MinVF, ElementCount MaxVF);
352 void buildVPlansWithVPRecipes(ElementCount MinVF, ElementCount MaxVF);
H A DLoopVectorize.cpp1260 selectEpilogueVectorizationFactor(const ElementCount MaxVF,
5719 Result.FixedVF = MaxVF; in computeFeasibleMaxVF()
5723 if (MaxVF.isScalable()) { in computeFeasibleMaxVF()
5724 Result.ScalableVF = MaxVF; in computeFeasibleMaxVF()
5925 ElementCount MaxVF = MaxVectorElementCount; in getMaximizedVFForTarget() local
5953 MaxVF = VFs[i]; in getMaximizedVFForTarget()
5959 if (ElementCount::isKnownLT(MaxVF, MinVF)) { in getMaximizedVFForTarget()
5962 MaxVF = MinVF; in getMaximizedVFForTarget()
5966 return MaxVF; in getMaximizedVFForTarget()
8581 auto MaxVFPlusOne = MaxVF.getWithIncrement(1); in buildVPlans()
[all …]
H A DSLPVectorizer.cpp797 unsigned MaxVF = MaxVFOption.getNumOccurrences() ? in getMaximumVF() local
799 return MaxVF ? MaxVF : UINT_MAX; in getMaximumVF()
7023 unsigned MaxVF = std::min(R.getMaximumVF(EltSize, Instruction::Store), in vectorizeStores() local
7029 for (unsigned Size = MaxVF; Size >= MinVF; Size /= 2) { in vectorizeStores()
7134 unsigned MaxVF = std::max<unsigned>(PowerOf2Floor(VL.size()), MinVF); in tryToVectorizeList() local
7135 MaxVF = std::min(R.getMaximumVF(Sz, S.getOpcode()), MaxVF); in tryToVectorizeList()
7136 if (MaxVF < 2) { in tryToVectorizeList()
7153 for (unsigned VF = MaxVF; NextInst + 1 < MaxInst && VF >= MinVF; VF /= 2) { in tryToVectorizeList()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Analysis/
H A DLoopAccessAnalysis.cpp1657 uint64_t MaxVF = MaxSafeDepDistBytes / (TypeByteSize * Stride); in isDependent() local
1659 << " with max VF = " << MaxVF << '\n'); in isDependent()
1660 uint64_t MaxVFInBits = MaxVF * TypeByteSize * 8; in isDependent()