[llvm] b28c465 - [NFC] Use CHECK-LABEL in trip-count-unknown-stride.ll

[Eli Friedman via llvm-commits]

Author: Eli Friedman
Date: 2021-07-13T12:21:13-07:00
New Revision: b28c465e4902f579799bc94512197c04a5ad4a29

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

LOG: [NFC] Use CHECK-LABEL in trip-count-unknown-stride.ll

Added: 
    

Modified: 
    llvm/test/Analysis/ScalarEvolution/trip-count-unknown-stride.ll

Removed: 
    


################################################################################
diff  --git a/llvm/test/Analysis/ScalarEvolution/trip-count-unknown-stride.ll b/llvm/test/Analysis/ScalarEvolution/trip-count-unknown-stride.ll
index 05e23d0586d2..97399d7acb56 100644
--- a/llvm/test/Analysis/ScalarEvolution/trip-count-unknown-stride.ll
+++ b/llvm/test/Analysis/ScalarEvolution/trip-count-unknown-stride.ll
@@ -4,7 +4,7 @@
 ; ScalarEvolution should be able to compute trip count of the loop by proving
 ; that this is not an infinite loop with side effects.
 
-; CHECK: Determining loop execution counts for: @foo1
+; CHECK-LABEL: Determining loop execution counts for: @foo1
 ; CHECK: backedge-taken count is ((-1 + %n) /u %s)
 
 ; We should have a conservative estimate for the max backedge taken count for
@@ -34,7 +34,7 @@ for.end:                                          ; preds = %for.body, %entry
 
 
 ; Check that we are able to compute trip count of a loop without an entry guard.
-; CHECK: Determining loop execution counts for: @foo2
+; CHECK-LABEL: Determining loop execution counts for: @foo2
 ; CHECK: backedge-taken count is ((-1 + (%n smax %s)) /u %s)
 
 ; We should have a conservative estimate for the max backedge taken count for
@@ -61,7 +61,7 @@ for.end:                                          ; preds = %for.body, %entry
 
 ; Check that without mustprogress we don't make assumptions about infinite
 ; loops being UB.
-; CHECK: Determining loop execution counts for: @foo3
+; CHECK-LABEL: Determining loop execution counts for: @foo3
 ; CHECK: Loop %for.body: Unpredictable backedge-taken count.
 ; CHECK: Loop %for.body: Unpredictable max backedge-taken count.
 
@@ -84,7 +84,7 @@ for.end:                                          ; preds = %for.body, %entry
 }
 
 ; Same as foo2, but with mustprogress on loop, not function
-; CHECK: Determining loop execution counts for: @foo4
+; CHECK-LABEL: Determining loop execution counts for: @foo4
 ; CHECK: backedge-taken count is ((-1 + (%n smax %s)) /u %s)
 ; CHECK: max backedge-taken count is -1
 
@@ -134,7 +134,7 @@ for.end:                                          ; preds = %for.body, %entry
 
 ; FIXME: Currently we are more conservative for known zero stride than
 ; for unknown but potentially zero stride.
-; CHECK: Determining loop execution counts for: @zero_stride
+; CHECK-LABEL: Determining loop execution counts for: @zero_stride
 ; CHECK: Loop %for.body: Unpredictable backedge-taken count.
 ; CHECK: Loop %for.body: Unpredictable max backedge-taken count.
 ; CHECK: Loop %for.body: Unpredictable predicated backedge-taken count.
@@ -157,7 +157,7 @@ for.end:                                          ; preds = %for.body, %entry
   ret void
 }
 
-; CHECK: Determining loop execution counts for: @zero_stride_ub
+; CHECK-LABEL: Determining loop execution counts for: @zero_stride_ub
 ; CHECK: Loop %for.body: Unpredictable backedge-taken count.
 ; CHECK: Loop %for.body: Unpredictable max backedge-taken count.
 ; CHECK: Loop %for.body: Unpredictable predicated backedge-taken count.