[llvm] 0623f52 - Autogen a test for ease of update

Philip Reames via llvm-commits llvm-commits at lists.llvm.org
Wed Nov 17 17:23:58 PST 2021


Author: Philip Reames
Date: 2021-11-17T17:20:57-08:00
New Revision: 0623f52a46cf5af3a6d77238a7ad91b37b812fe1

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

LOG: Autogen a test for ease of update

Added: 
    

Modified: 
    llvm/test/Analysis/ScalarEvolution/ne-overflow.ll

Removed: 
    


################################################################################
diff  --git a/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll b/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
index 02a8485e76b35..48835b36ac18e 100644
--- a/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
+++ b/llvm/test/Analysis/ScalarEvolution/ne-overflow.ll
@@ -1,3 +1,4 @@
+; NOTE: Assertions have been autogenerated by utils/update_analyze_test_checks.py
 
 ; RUN: opt %s -passes='print<scalar-evolution>' -scalar-evolution-classify-expressions=0 2>&1 | FileCheck %s
 
@@ -7,28 +8,13 @@ target triple = "x86_64-unknown-linux-gnu"
 ; A collection of tests focused on exercising logic to prove no-unsigned wrap
 ; from mustprogress semantics of loops.
 
-; CHECK: Determining loop execution counts for: @test
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_preinc
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_well_defined_infinite_st
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_well_defined_infinite_ld
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_no_mustprogress
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_1024
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_uneven_divide
-; CHECK: Loop %for.body: backedge-taken count is (-1 + (-1431655765 * %N))
-; CHECK: Determining loop execution counts for: @test_non_invariant_rhs
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_abnormal_exit
-; CHECK: Loop %for.body: Unpredictable backedge-taken count.
-; CHECK: Determining loop execution counts for: @test_other_exit
-; CHECK: Loop %for.body: <multiple exits> Unpredictable backedge-taken count.
-
 define void @test(i32 %N) mustprogress {
+; CHECK-LABEL: 'test'
+; CHECK-NEXT:  Determining loop execution counts for: @test
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -43,6 +29,12 @@ for.cond.cleanup:
 }
 
 define void @test_preinc(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_preinc'
+; CHECK-NEXT:  Determining loop execution counts for: @test_preinc
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -60,6 +52,12 @@ for.cond.cleanup:
 @G = external global i32
 
 define void @test_well_defined_infinite_st(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_well_defined_infinite_st'
+; CHECK-NEXT:  Determining loop execution counts for: @test_well_defined_infinite_st
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -75,6 +73,12 @@ for.cond.cleanup:
 }
 
 define void @test_well_defined_infinite_ld(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_well_defined_infinite_ld'
+; CHECK-NEXT:  Determining loop execution counts for: @test_well_defined_infinite_ld
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -90,6 +94,12 @@ for.cond.cleanup:
 }
 
 define void @test_no_mustprogress(i32 %N) {
+; CHECK-LABEL: 'test_no_mustprogress'
+; CHECK-NEXT:  Determining loop execution counts for: @test_no_mustprogress
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -106,6 +116,12 @@ for.cond.cleanup:
 
 
 define void @test_1024(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_1024'
+; CHECK-NEXT:  Determining loop execution counts for: @test_1024
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -120,6 +136,14 @@ for.cond.cleanup:
 }
 
 define void @test_uneven_divide(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_uneven_divide'
+; CHECK-NEXT:  Determining loop execution counts for: @test_uneven_divide
+; CHECK-NEXT:  Loop %for.body: backedge-taken count is (-1 + (-1431655765 * %N))
+; CHECK-NEXT:  Loop %for.body: max backedge-taken count is -1
+; CHECK-NEXT:  Loop %for.body: Predicated backedge-taken count is (-1 + (-1431655765 * %N))
+; CHECK-NEXT:   Predicates:
+; CHECK:       Loop %for.body: Trip multiple is 1
+;
 entry:
   br label %for.body
 
@@ -134,6 +158,12 @@ for.cond.cleanup:
 }
 
 define void @test_non_invariant_rhs() mustprogress {
+; CHECK-LABEL: 'test_non_invariant_rhs'
+; CHECK-NEXT:  Determining loop execution counts for: @test_non_invariant_rhs
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -151,6 +181,12 @@ for.cond.cleanup:
 declare void @mayexit()
 
 define void @test_abnormal_exit(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_abnormal_exit'
+; CHECK-NEXT:  Determining loop execution counts for: @test_abnormal_exit
+; CHECK-NEXT:  Loop %for.body: Unpredictable backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable max backedge-taken count.
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 
@@ -167,6 +203,14 @@ for.cond.cleanup:
 
 
 define void @test_other_exit(i32 %N) mustprogress {
+; CHECK-LABEL: 'test_other_exit'
+; CHECK-NEXT:  Determining loop execution counts for: @test_other_exit
+; CHECK-NEXT:  Loop %for.body: <multiple exits> Unpredictable backedge-taken count.
+; CHECK-NEXT:    exit count for for.body: 9
+; CHECK-NEXT:    exit count for for.latch: ***COULDNOTCOMPUTE***
+; CHECK-NEXT:  Loop %for.body: max backedge-taken count is 9
+; CHECK-NEXT:  Loop %for.body: Unpredictable predicated backedge-taken count.
+;
 entry:
   br label %for.body
 


        


More information about the llvm-commits mailing list