Limit to at least one loop-invariant accesses.

Author: fhahn

llvm/lib/Analysis/LoopAccessAnalysis.cpp

@@ -1992,6 +1992,7 @@ getDependenceDistanceStrideAndSize(
 
   // Check if we can prove that Sink only accesses memory after Src's end or
   // vice versa.
+  if (SE.isLoopInvariant(Src, InnermostLoop) || SE.isLoopInvariant(Sink, InnermostLoop)) {
   const auto &[SrcStart, SrcEnd] =
       getStartAndEndForAccess(InnermostLoop, Src, ATy, PSE);
   const auto &[SinkStart, SinkEnd] =
@@ -2006,6 +2007,7 @@ getDependenceDistanceStrideAndSize(
     if (SE.isKnownPredicate(CmpInst::ICMP_ULE, SinkEnd, SrcStart))
       return MemoryDepChecker::Dependence::NoDep;
   }
+  }
 
   // Need accesses with constant strides and the same direction. We don't want
   // to vectorize "A[B[i]] += ..." and similar code or pointer arithmetic that