@@ -4025,7 +4025,7 @@ LoopVectorizationCostModel::computeMaxVF(ElementCount UserVF, unsigned UserIC) {
40254025 MaxPowerOf2RuntimeVF = std::nullopt ; // Stick with tail-folding for now.
40264026 }
40274027
4028- auto ScalarEpilogueNeeded = [this , &UserIC](unsigned MaxVF) {
4028+ auto NoScalarEpilogueNeeded = [this , &UserIC](unsigned MaxVF) {
40294029 unsigned MaxVFtimesIC = UserIC ? MaxVF * UserIC : MaxVF;
40304030 ScalarEvolution *SE = PSE.getSE ();
40314031 // Currently only loops with countable exits are vectorized, but calling
@@ -4046,7 +4046,7 @@ LoopVectorizationCostModel::computeMaxVF(ElementCount UserVF, unsigned UserIC) {
40464046 if (MaxPowerOf2RuntimeVF > 0 ) {
40474047 assert ((UserVF.isNonZero () || isPowerOf2_32 (*MaxPowerOf2RuntimeVF)) &&
40484048 " MaxFixedVF must be a power of 2" );
4049- if (ScalarEpilogueNeeded (*MaxPowerOf2RuntimeVF)) {
4049+ if (NoScalarEpilogueNeeded (*MaxPowerOf2RuntimeVF)) {
40504050 // Accept MaxFixedVF if we do not have a tail.
40514051 LLVM_DEBUG (dbgs () << " LV: No tail will remain for any chosen VF.\n " );
40524052 return MaxFactors;
@@ -4060,7 +4060,7 @@ LoopVectorizationCostModel::computeMaxVF(ElementCount UserVF, unsigned UserIC) {
40604060 // the trip count but the scalable factor does not, use the fixed-width
40614061 // factor in preference to allow the generation of a non-predicated loop.
40624062 if (ScalarEpilogueStatus == CM_ScalarEpilogueNotAllowedLowTripLoop &&
4063- ScalarEpilogueNeeded (MaxFactors.FixedVF .getFixedValue ())) {
4063+ NoScalarEpilogueNeeded (MaxFactors.FixedVF .getFixedValue ())) {
40644064 LLVM_DEBUG (dbgs () << " LV: Picking a fixed-width so that no tail will "
40654065 " remain for any chosen VF.\n " );
40664066 MaxFactors.ScalableVF = ElementCount::getScalable (0 );
0 commit comments