[llvm] [LV] Vectorize bounded (i % 2^N) loads in read only loops w/o RT checks. (PR #207279)

[Florian Hahn via llvm-commits]

================
@@ -1708,6 +1708,36 @@ llvm::getPtrStride(PredicatedScalarEvolution &PSE, Type *AccessTy, Value *Ptr,
   return Stride;
 }
 
+uint64_t llvm::getBoundForConsecutiveLoad(const SCEV *PtrSCEV, Type *AccessTy,
+                                          const Loop *L, ScalarEvolution &SE) {
+  if (AccessTy->isScalableTy())
+    return 0;
+
+  // `A[i % 2^N]` is modeled as `Base + ElemSize * zext({0,+,1}<iN>)`by SCEV,
+  // with N being the bitwidth of the induction. For a byte element (ElemSize ==
+  // 1) the multiply folds away.
+  const SCEV *Base, *Start;
+  const APInt *Scale = nullptr;
+  auto Index = m_scev_ZExt(
+      m_scev_AffineAddRec(m_SCEV(Start), m_scev_One(), m_SpecificLoop(L)));
+  if (!match(
+          PtrSCEV,
+          m_scev_Add(m_CombineOr(Index, m_scev_Mul(m_scev_APInt(Scale), Index)),
+                     m_SCEV(Base))))
+    return 0;
----------------
fhahn wrote:

I simplified things a bit. here we are looking for a specific pattern, so I left it for now. I also added a few additional test case. I have a follow-up to generalize to arbitrary strides/steps, I can check if that would benefit from `getStrideFromPointer`

https://github.com/llvm/llvm-project/pull/207279