[PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count

[Adam Nemet via Phabricator via llvm-commits]

anemet added inline comments.


================
Comment at: ../llvm/lib/Analysis/LoopAccessAnalysis.cpp:1303-1344
+    if (TypeByteSize != DL.getTypeAllocSize(BTy)) {
+      DEBUG(dbgs() << "LAA: Dependence because of non-constant distance\n");
+      ShouldRetryWithRuntimeCheck = true;
+      return Dependence::Unknown;
+    }
+
+    // If we can prove that
----------------
Can this be separated out into its own function?  isDependent is already a largish function.


https://reviews.llvm.org/D28044