[llvm] a6893f9 - [DA] Regenerate test checks (NFC) (#166736)

[via llvm-commits]

Author: Ryotaro Kasuga
Date: 2025-11-06T23:53:33+09:00
New Revision: a6893f9a113a796a7fd46e9b0708634b62cf73e9

URL: https://github.com/llvm/llvm-project/commit/a6893f9a113a796a7fd46e9b0708634b62cf73e9
DIFF: https://github.com/llvm/llvm-project/commit/a6893f9a113a796a7fd46e9b0708634b62cf73e9.diff

LOG: [DA] Regenerate test checks (NFC) (#166736)

To avoid noise by other changes.

Added: 
    

Modified: 
    llvm/test/Analysis/DependenceAnalysis/same-sd-for-diff-becount-type-loops.ll
    llvm/test/Analysis/DependenceAnalysis/symbolic-rdiv-overflow.ll

Removed: 
    


################################################################################
diff  --git a/llvm/test/Analysis/DependenceAnalysis/same-sd-for-
diff -becount-type-loops.ll b/llvm/test/Analysis/DependenceAnalysis/same-sd-for-
diff -becount-type-loops.ll
index 66880b5a553ec..f7f869ddbbe82 100644
--- a/llvm/test/Analysis/DependenceAnalysis/same-sd-for-
diff -becount-type-loops.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/same-sd-for-
diff -becount-type-loops.ll
@@ -1,12 +1,13 @@
+; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py UTC_ARGS: --version 6
 ; RUN: opt < %s -disable-output "-passes=print<da>" -aa-pipeline=basic-aa 2>&1 | FileCheck %s
 
 define void @f1() {
 ; CHECK-LABEL: 'f1'
-; CHECK-NEXT:  Src:  store i32 0, ptr null, align 4 --> Dst:  store i32 0, ptr null, align 4
+; CHECK-NEXT:  Src: store i32 0, ptr null, align 4 --> Dst: store i32 0, ptr null, align 4
 ; CHECK-NEXT:    da analyze - consistent output [S]!
-; CHECK-NEXT:  Src:  store i32 0, ptr null, align 4 --> Dst:  %2 = load i32, ptr null, align 4
+; CHECK-NEXT:  Src: store i32 0, ptr null, align 4 --> Dst: %2 = load i32, ptr null, align 4
 ; CHECK-NEXT:    da analyze - consistent flow [|<]!
-; CHECK-NEXT:  Src:  %2 = load i32, ptr null, align 4 --> Dst:  %2 = load i32, ptr null, align 4
+; CHECK-NEXT:  Src: %2 = load i32, ptr null, align 4 --> Dst: %2 = load i32, ptr null, align 4
 ; CHECK-NEXT:    da analyze - consistent input [S]!
 ;
 entry:
@@ -34,11 +35,11 @@ exit:                                             ; preds = %for.2.body
 
 define void @f2() {
 ; CHECK-LABEL: 'f2'
-; CHECK-NEXT:  Src:  store i32 0, ptr null, align 4 --> Dst:  store i32 0, ptr null, align 4
+; CHECK-NEXT:  Src: store i32 0, ptr null, align 4 --> Dst: store i32 0, ptr null, align 4
 ; CHECK-NEXT:    da analyze - consistent output [S]!
-; CHECK-NEXT:  Src:  store i32 0, ptr null, align 4 --> Dst:  %3 = load i32, ptr null, align 4
-; CHECK-NEXT:    da analyze - flow [|<] / assuming 1 loop level(s) fused:  [S|<]!
-; CHECK-NEXT:  Src:  %3 = load i32, ptr null, align 4 --> Dst:  %3 = load i32, ptr null, align 4
+; CHECK-NEXT:  Src: store i32 0, ptr null, align 4 --> Dst: %3 = load i32, ptr null, align 4
+; CHECK-NEXT:    da analyze - flow [|<] / assuming 1 loop level(s) fused: [S|<]!
+; CHECK-NEXT:  Src: %3 = load i32, ptr null, align 4 --> Dst: %3 = load i32, ptr null, align 4
 ; CHECK-NEXT:    da analyze - consistent input [S]!
 ;
 entry:

diff  --git a/llvm/test/Analysis/DependenceAnalysis/symbolic-rdiv-overflow.ll b/llvm/test/Analysis/DependenceAnalysis/symbolic-rdiv-overflow.ll
index c5ff9884a0c62..75be96380f078 100644
--- a/llvm/test/Analysis/DependenceAnalysis/symbolic-rdiv-overflow.ll
+++ b/llvm/test/Analysis/DependenceAnalysis/symbolic-rdiv-overflow.ll
@@ -13,7 +13,7 @@
 ; FIXME: DependenceAnalysis currently detects no dependency between the two
 ; stores, but it does exist. For example, each store will access A[0] when i
 ; is 1 and 0 respectively.
-; The root cause is that the product of the BTC and the coefficient 
+; The root cause is that the product of the BTC and the coefficient
 ; ((1LL << 62) - 1 and 2) overflows in a signed sense.
 define void @symbolicrdiv_prod_ovfl(ptr %A) {
 ; CHECK-ALL-LABEL: 'symbolicrdiv_prod_ovfl'
@@ -75,10 +75,10 @@ exit:
 ; FIXME: DependenceAnalysis currently detects no dependency between the two
 ; stores, but it does exist. For example,
 ;
-;  memory access           | i == 2^61 | i == 2^61 + 2^59 | i == 2^61 + 2^60  
+;  memory access           | i == 2^61 | i == 2^61 + 2^59 | i == 2^61 + 2^60
 ; -------------------------|-----------|------------------|-------------------
-;  A[2*i - 2^62] (offset0) |           | A[2^60]          | A[2^61]           
-;  A[-i + 2^62]  (offset1) | A[2^61]   |                  | A[2^60]           
+;  A[2*i - 2^62] (offset0) |           | A[2^60]          | A[2^61]
+;  A[-i + 2^62]  (offset1) | A[2^61]   |                  | A[2^60]
 ;
 ; The root cause is that the calculation of the 
diff erenct between the two
 ; constants (-2^62 and 2^62) overflows in a signed sense.