[llvm] [DependenceAnalysis] Extending SIV to handle fusable loops (PR #128782)

[Ryotaro Kasuga via llvm-commits]

================
@@ -0,0 +1,345 @@
+; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 5
+; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1 \
+; RUN:   -da-disable-delinearization-checks | FileCheck %s
+
+
+;;  for (long int i = 0; i < n; i++) {
+;;    for (long int j = 0; j < n; j++) {
+;;      for (long int k = 0; k < n; k++) {
+;;        for (long int l = 0; l < n; l++)
+;;          A[i][j][k][l] = i;
+;;      }
+;;      for (long int k = 1; k < n+1; k++) {
+;;        for (long int l = 0; l < n; l++)
+;;          *B++ = A[i + 4][j + 3][k + 2][l + 1];
----------------
kasuga-fj wrote:

I guess this comes from another test, but is `*B++` really needed here? If not, I think it would be better to replace this with a simpler statement like `A[i + 4][j + 3][k + 2][l + 1] = l;`

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