Lines Matching defs:UF
490 MinProfitableTripCount(MinProfitableTripCount), UF(UnrollFactor),
630 unsigned UF;
655 /// Trip count of the widened loop (TripCount - TripCount % (VF*UF))
718 "A high UF for the epilogue loop is likely not beneficial.");
1511 // second-to-last iteration might not be VF*UF.
2316 /// For the given VF and UF and maximum trip count computed for the loop, return
2322 ElementCount VF, std::optional<unsigned> UF = std::nullopt) {
2324 unsigned MaxUF = UF ? *UF : Cost->TTI.getMaxInterleaveFactor(VF);
2330 // is known and (max) trip-count + (VF * UF) does not overflow in the type of
2427 Value *Step = createStepForVF(Builder, Ty, VF, UF);
2438 assert(isPowerOf2_32(VF.getKnownMinValue() * UF) &&
2439 "VF*UF must be a power of 2 when folding tail by masking");
2489 // Generate code to check if the loop's trip count is less than VF * UF, or
2501 // Create step with max(MinProTripCount, UF * VF).
2502 if (UF * VF.getKnownMinValue() >= MinProfitableTripCount.getKnownMinValue())
2503 return createStepForVF(Builder, CountTy, VF, UF);
2510 Intrinsic::umax, MinProfTC, createStepForVF(Builder, CountTy, VF, UF));
2523 // UF, w/o tail folding.
2532 !isIndvarOverflowCheckKnownFalse(Cost, VF, UF) &&
2543 // Don't execute the vector loop if (UMax - n) < (VF * UF).
2944 VF.getKnownMinValue() * UF);
7656 "Trying to execute plan with unsupported UF");
7850 << ", Main Loop UF:" << EPI.MainLoopUF
7852 << ", Epilogue Loop UF:" << EPI.EpilogueUF << "\n";
7868 unsigned UFactor = ForEpilogue ? EPI.EpilogueUF : UF;
7875 // Generate code to check if the loop's trip count is less than VF * UF of the
8014 // Generate code to check if the loop's trip count is less than VF * UF of the
8029 unsigned MainLoopStep = UF * VF.getKnownMinValue();
8060 << ", Epilogue Loop UF:" << EPI.EpilogueUF << "\n";
8951 // Add a VPInstruction to increment the scalar canonical IV by VF * UF.
9247 // Don't use getDecisionAndClampRange here, because we don't know the UF