Searched refs:MinVF (Results 1 – 3 of 3) sorted by relevance
272 void buildVPlans(unsigned MinVF, unsigned MaxVF);290 void buildVPlansWithVPRecipes(unsigned MinVF, unsigned MaxVF);
5068 if (unsigned MinVF = TTI.getMinimumVF(SmallestType)) { in computeFeasibleMaxVF() local5069 if (MaxVF < MinVF) { in computeFeasibleMaxVF()5071 << ") with target's minimum: " << MinVF << '\n'); in computeFeasibleMaxVF()5072 MaxVF = MinVF; in computeFeasibleMaxVF()6695 void LoopVectorizationPlanner::buildVPlans(unsigned MinVF, unsigned MaxVF) { in buildVPlans() argument6696 for (unsigned VF = MinVF; VF < MaxVF + 1;) { in buildVPlans()7083 void LoopVectorizationPlanner::buildVPlansWithVPRecipes(unsigned MinVF, in buildVPlansWithVPRecipes() argument7126 for (unsigned VF = MinVF; VF < MaxVF + 1;) { in buildVPlansWithVPRecipes()
5685 const unsigned MinVF = R.getMinVecRegSize() / Sz; in vectorizeStoreChain() local5688 if (!isPowerOf2_32(Sz) || !isPowerOf2_32(VF) || VF < 2 || VF < MinVF) in vectorizeStoreChain()5879 unsigned MinVF = std::max(2U, R.getMinVecRegSize() / Sz); in tryToVectorizeList() local5880 unsigned MaxVF = std::max<unsigned>(PowerOf2Floor(VL.size()), MinVF); in tryToVectorizeList()5912 for (unsigned VF = MaxVF; NextInst + 1 < MaxInst && VF >= MinVF; VF /= 2) { in tryToVectorizeList()