[llvm] [LoopAccessAnalysis] Analyze forked pointer dependences per alternative (PR #214216)

[Sahil Kumar via llvm-commits]

================
@@ -2330,8 +2470,9 @@ MemoryDepChecker::isDependent(const MemAccessInfo &A, unsigned AIdx,
 
     if (IsTrueDataDependence && EnableForwardingConflictDetection) {
       if (!ConstDist) {
-        return CheckCompletelyBeforeOrAfter() ? Dependence::NoDep
-                                              : Dependence::Unknown;
+        return areAccessesCompletelyBeforeOrAfter(Src, SrcTy, Sink, SinkTy)
+                   ? Dependence::NoDep
+                   : Dependence::Unknown;
----------------
Samyra312007 wrote:

Done. Restored the CheckCompletelyBeforeOrAfter lambda in isDependent (as upstream had) and added a local lambda in classifyDependence so all the calls inside classifyDependence go through the lambda instead of direct calls. This minimizes the diff in classifyDependence the only addition is the lambda definition itself and the getForkedDepType call in isDependent.

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