1 files changed, 3 insertions, 27 deletions

diff --git a/llvm/lib/Analysis/LoopAccessAnalysis.cpp b/llvm/lib/Analysis/LoopAccessAnalysis.cpp
index 27ccd66541f..d044bb008e9 100644
--- a/llvm/lib/Analysis/LoopAccessAnalysis.cpp
+++ b/llvm/lib/Analysis/LoopAccessAnalysis.cpp
@@ -1072,7 +1072,6 @@ void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) {
 
   // Find pointers with computable bounds. We are going to use this information
   // to place a runtime bound check.
-  unsigned NumComparisons = 0;
   bool CanDoRT = false;
   if (NeedRTCheck)
     CanDoRT = Accesses.canCheckPtrAtRT(PtrRtCheck, NumComparisons, SE, TheLoop,
@@ -1098,17 +1097,6 @@ void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) {
     return;
   }
 
-  if (NumComparisons > RuntimeMemoryCheckThreshold) {
-    emitAnalysis(LoopAccessReport()
-                 << NumComparisons << " exceeds limit of "
-                 << RuntimeMemoryCheckThreshold
-                 << " dependent memory operations checked at runtime");
-    DEBUG(dbgs() << "LAA: Too many memory checks needed.\n");
-    PtrRtCheck.reset();
-    CanVecMem = false;
-    return;
-  }
-
   PtrRtCheck.Need = NeedRTCheck;
 
   CanVecMem = true;
@@ -1140,18 +1128,6 @@ void LoopAccessInfo::analyzeLoop(const ValueToValueMap &Strides) {
         return;
       }
 
-      // Check that we did not collect too many pointers.
-      if (NumComparisons > RuntimeMemoryCheckThreshold) {
-        emitAnalysis(LoopAccessReport()
-                     << NumComparisons << " exceeds limit of "
-                     << RuntimeMemoryCheckThreshold
-                     << " dependent memory operations checked at runtime");
-        DEBUG(dbgs() << "LAA: Can't vectorize with memory checks\n");
-        PtrRtCheck.reset();
-        CanVecMem = false;
-        return;
-      }
-
       CanVecMem = true;
     }
   }
@@ -1283,9 +1259,9 @@ LoopAccessInfo::LoopAccessInfo(Loop *L, ScalarEvolution *SE,
                                const TargetLibraryInfo *TLI, AliasAnalysis *AA,
                                DominatorTree *DT,
                                const ValueToValueMap &Strides)
-    : DepChecker(SE, L), TheLoop(L), SE(SE), DL(DL), TLI(TLI), AA(AA),
-      DT(DT), NumLoads(0), NumStores(0), MaxSafeDepDistBytes(-1U),
-      CanVecMem(false) {
+    : DepChecker(SE, L), NumComparisons(0), TheLoop(L), SE(SE), DL(DL),
+      TLI(TLI), AA(AA), DT(DT), NumLoads(0), NumStores(0),
+      MaxSafeDepDistBytes(-1U), CanVecMem(false) {
   if (canAnalyzeLoop())
     analyzeLoop(Strides);
 }