Lines Matching defs:MaxVF

1585     unsigned MaxVF = MaxVFOption.getNumOccurrences() ?
1587     return MaxVF ? MaxVF : UINT_MAX;
6988                                     bool Final, unsigned MaxVF) {
6992     if (VectorizeNonPowerOf2 && has_single_bit(MaxVF + 1))
6993       CandidateVFs.push_back(MaxVF);
6995              *TTI, Loads.front()->getType(), MaxVF);
7216             unsigned MaxVF = Slice.size();
7219             if (MaxVF == 2) {
7220               UserMaxVF = MaxVF;
7326                 UserMaxVF = MaxVF;
7328                 MaxVF = std::min<unsigned>(MaxVF, UserMaxVF);
7330             for (unsigned VF = MaxVF; VF >= 2; VF /= 2) {
7354                     VF = 2 * (MaxVF / InterleaveFactor);
18734       unsigned MaxVF =
18746       if (MaxVF < MinVF) {
18747         LLVM_DEBUG(dbgs() << "SLP: Vectorization infeasible as MaxVF (" << MaxVF
18758         unsigned CandVF = std::clamp<unsigned>(Operands.size(), MinVF, MaxVF);
18761           assert(NonPowerOf2VF != MaxVF &&
18762                  "Non-power-of-2 VF should not be equal to MaxVF");
18766       unsigned MaxRegVF = MaxVF;
18767       MaxVF = std::min<unsigned>(MaxVF, bit_floor(Operands.size()));
18768       if (MaxVF < MinVF) {
18769         LLVM_DEBUG(dbgs() << "SLP: Vectorization infeasible as MaxVF (" << MaxVF
18775       unsigned Sz = 1 + Log2_32(MaxVF) - Log2_32(MinVF);
18779         VF = Size > MaxVF ? NonPowerOf2VF : Size;
19158   unsigned MaxVF = std::max<unsigned>(
19160   MaxVF = std::min(R.getMaximumVF(Sz, S.getOpcode()), MaxVF);
19161   if (MaxVF < 2) {
19175   for (unsigned VF = MaxVF; NextInst + 1 < MaxInst && VF >= MinVF;
19189       if (MaxVFOnly && ActualVF < MaxVF)
21431     // pass1 - try to match and vectorize a buildvector sequence for MaxVF only.