Address review comment

Author: david-arm

llvm/lib/Transforms/Vectorize/LoopVectorize.cpp

@@ -7553,7 +7553,9 @@ VectorizationFactor LoopVectorizationPlanner::computeBestVF() {
                         CM.CostKind);
   precomputeCosts(BestPlan, BestFactor.Width, CostCtx);
   assert((BestFactor.Width == LegacyVF.Width ||
-          BestPlan.hasRegionWithEarlyExit() ||
+          (BestPlan.getVectorLoopRegion() &&
+           BestPlan.getVectorLoopRegion()->getSingleSuccessor() !=
+               BestPlan.getMiddleBlock()) ||
           planContainsAdditionalSimplifications(getPlanFor(BestFactor.Width),
                                                 CostCtx, OrigLoop) ||
           planContainsAdditionalSimplifications(getPlanFor(LegacyVF.Width),

llvm/lib/Transforms/Vectorize/VPlan.h

@@ -3623,15 +3623,6 @@ class VPlan {
   /// of VPBlockShallowTraversalWrapper.
   auto getExitBlocks();
 
-  /// Returns true if the plan has a region containing an early exit, i.e. the
-  /// loop exits due to a condition other than testing the canonical induction
-  /// variable against the trip count.
-  bool hasRegionWithEarlyExit() {
-    auto *VectorRegion = getVectorLoopRegion();
-    return VectorRegion &&
-           VectorRegion->getSingleSuccessor() != getMiddleBlock();
-  }
-
   /// Returns true if \p VPBB is an exit block.
   bool isExitBlock(VPBlockBase *VPBB);