[InstSimplify] regenerate checks using a script
I didn't notice any significant changes in the actual checks here;
all of these tests already used FileCheck, so a script can batch
update them in one shot.
This commit is just to show the value of automating this process:
We have uniform formatting as opposed to a mish-mash of check
structure that changes based on individual prefs and the current
fashion. This makes it simpler to update when we find a bug or
make an enhancement.
llvm-svn: 264457
diff --git a/llvm/test/Transforms/InstSimplify/implies.ll b/llvm/test/Transforms/InstSimplify/implies.ll
index 2e3c959..2375965 100644
--- a/llvm/test/Transforms/InstSimplify/implies.ll
+++ b/llvm/test/Transforms/InstSimplify/implies.ll
@@ -1,9 +1,11 @@
+; NOTE: Assertions have been autogenerated by update_test_checks.py
; RUN: opt -S %s -instsimplify | FileCheck %s
; A ==> A -> true
define i1 @test(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test
-; CHECK: ret i1 true
+; CHECK-LABEL: @test(
+; CHECK: ret i1 true
+;
%var29 = icmp slt i32 %i, %length.i
%res = icmp uge i1 %var29, %var29
ret i1 %res
@@ -11,8 +13,9 @@
; i +_{nsw} C_{>0} <s L ==> i <s L -> true
define i1 @test2(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test2
-; CHECK: ret i1 true
+; CHECK-LABEL: @test2(
+; CHECK: ret i1 true
+;
%iplus1 = add nsw i32 %i, 1
%var29 = icmp slt i32 %i, %length.i
%var30 = icmp slt i32 %iplus1, %length.i
@@ -22,8 +25,13 @@
; i + C_{>0} <s L ==> i <s L -> unknown without the nsw
define i1 @test2_neg(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test2_neg
-; CHECK: ret i1 %res
+; CHECK-LABEL: @test2_neg(
+; CHECK: [[IPLUS1:%.*]] = add i32 %i, 1
+; CHECK-NEXT: [[VAR29:%.*]] = icmp slt i32 %i, %length.i
+; CHECK-NEXT: [[VAR30:%.*]] = icmp slt i32 [[IPLUS1]], %length.i
+; CHECK-NEXT: [[RES:%.*]] = icmp ule i1 [[VAR30]], [[VAR29]]
+; CHECK-NEXT: ret i1 [[RES]]
+;
%iplus1 = add i32 %i, 1
%var29 = icmp slt i32 %i, %length.i
%var30 = icmp slt i32 %iplus1, %length.i
@@ -33,8 +41,13 @@
; sle is not implication
define i1 @test2_neg2(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test2_neg2
-; CHECK: ret i1 %res
+; CHECK-LABEL: @test2_neg2(
+; CHECK: [[IPLUS1:%.*]] = add i32 %i, 1
+; CHECK-NEXT: [[VAR29:%.*]] = icmp slt i32 %i, %length.i
+; CHECK-NEXT: [[VAR30:%.*]] = icmp slt i32 [[IPLUS1]], %length.i
+; CHECK-NEXT: [[RES:%.*]] = icmp sle i1 [[VAR30]], [[VAR29]]
+; CHECK-NEXT: ret i1 [[RES]]
+;
%iplus1 = add i32 %i, 1
%var29 = icmp slt i32 %i, %length.i
%var30 = icmp slt i32 %iplus1, %length.i
@@ -44,8 +57,13 @@
; The binary operator has to be an add
define i1 @test2_neg3(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test2_neg3
-; CHECK: ret i1 %res
+; CHECK-LABEL: @test2_neg3(
+; CHECK: [[IPLUS1:%.*]] = sub nsw i32 %i, 1
+; CHECK-NEXT: [[VAR29:%.*]] = icmp slt i32 %i, %length.i
+; CHECK-NEXT: [[VAR30:%.*]] = icmp slt i32 [[IPLUS1]], %length.i
+; CHECK-NEXT: [[RES:%.*]] = icmp ule i1 [[VAR30]], [[VAR29]]
+; CHECK-NEXT: ret i1 [[RES]]
+;
%iplus1 = sub nsw i32 %i, 1
%var29 = icmp slt i32 %i, %length.i
%var30 = icmp slt i32 %iplus1, %length.i
@@ -56,8 +74,9 @@
; i +_{nsw} C_{>0} <s L ==> i <s L -> true
; With an inverted conditional (ule B A rather than canonical ugt A B
define i1 @test3(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test3
-; CHECK: ret i1 true
+; CHECK-LABEL: @test3(
+; CHECK: ret i1 true
+;
%iplus1 = add nsw i32 %i, 1
%var29 = icmp slt i32 %i, %length.i
%var30 = icmp slt i32 %iplus1, %length.i
@@ -67,8 +86,9 @@
; i +_{nuw} C <u L ==> i <u L
define i1 @test4(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test4
-; CHECK: ret i1 true
+; CHECK-LABEL: @test4(
+; CHECK: ret i1 true
+;
%iplus1 = add nuw i32 %i, 1
%var29 = icmp ult i32 %i, %length.i
%var30 = icmp ult i32 %iplus1, %length.i
@@ -78,16 +98,19 @@
; A ==> A for vectors
define <4 x i1> @test5(<4 x i1> %vec) {
-; CHECK-LABEL: @test5
-; CHECK: ret <4 x i1> <i1 true, i1 true, i1 true, i1 true>
+; CHECK-LABEL: @test5(
+; CHECK: ret <4 x i1> <i1 true, i1 true, i1 true, i1 true>
+;
%res = icmp ule <4 x i1> %vec, %vec
ret <4 x i1> %res
}
; Don't crash on vector inputs - pr25040
define <4 x i1> @test6(<4 x i1> %a, <4 x i1> %b) {
-; CHECK-LABEL: @test6
-; CHECK: ret <4 x i1> %res
+; CHECK-LABEL: @test6(
+; CHECK: [[RES:%.*]] = icmp ule <4 x i1> %a, %b
+; CHECK-NEXT: ret <4 x i1> [[RES]]
+;
%res = icmp ule <4 x i1> %a, %b
ret <4 x i1> %res
}
@@ -95,7 +118,8 @@
; i +_{nsw} 1 <s L ==> i < L +_{nsw} 1
define i1 @test7(i32 %length.i, i32 %i) {
; CHECK-LABEL: @test7(
-; CHECK: ret i1 true
+; CHECK: ret i1 true
+;
%iplus1 = add nsw i32 %i, 1
%len.plus.one = add nsw i32 %length.i, 1
%var29 = icmp slt i32 %i, %len.plus.one
@@ -107,7 +131,8 @@
; i +_{nuw} 1 <s L ==> i < L +_{nuw} 1
define i1 @test8(i32 %length.i, i32 %i) {
; CHECK-LABEL: @test8(
-; CHECK: ret i1 true
+; CHECK: ret i1 true
+;
%iplus1 = add nuw i32 %i, 1
%len.plus.one = add nuw i32 %length.i, 1
%var29 = icmp ult i32 %i, %len.plus.one
@@ -119,7 +144,8 @@
; i +_{nuw} C <s L ==> i < L, even if C is negative
define i1 @test9(i32 %length.i, i32 %i) {
; CHECK-LABEL: @test9(
-; CHECK: ret i1 true
+; CHECK: ret i1 true
+;
%iplus1 = add nuw i32 %i, -100
%var29 = icmp ult i32 %i, %length.i
%var30 = icmp ult i32 %iplus1, %length.i
@@ -129,8 +155,8 @@
define i1 @test10(i32 %length.i, i32 %x.full) {
; CHECK-LABEL: @test10(
-; CHECK: ret i1 true
-
+; CHECK: ret i1 true
+;
%x = and i32 %x.full, 4294901760 ;; 4294901760 == 0xffff0000
%large = or i32 %x, 100
%small = or i32 %x, 90
@@ -142,9 +168,13 @@
define i1 @test11(i32 %length.i, i32 %x) {
; CHECK-LABEL: @test11(
-; CHECK: %res = icmp ule i1 %known, %to.prove
-; CHECK: ret i1 %res
-
+; CHECK: [[LARGE:%.*]] = or i32 %x, 100
+; CHECK-NEXT: [[SMALL:%.*]] = or i32 %x, 90
+; CHECK-NEXT: [[KNOWN:%.*]] = icmp ult i32 [[LARGE]], %length.i
+; CHECK-NEXT: [[TO_PROVE:%.*]] = icmp ult i32 [[SMALL]], %length.i
+; CHECK-NEXT: [[RES:%.*]] = icmp ule i1 [[KNOWN]], [[TO_PROVE]]
+; CHECK-NEXT: ret i1 [[RES]]
+;
%large = or i32 %x, 100
%small = or i32 %x, 90
%known = icmp ult i32 %large, %length.i
@@ -155,9 +185,14 @@
define i1 @test12(i32 %length.i, i32 %x.full) {
; CHECK-LABEL: @test12(
-; CHECK: %res = icmp ule i1 %known, %to.prove
-; CHECK: ret i1 %res
-
+; CHECK: [[X:%.*]] = and i32 [[X:%.*]].full, -65536
+; CHECK-NEXT: [[LARGE:%.*]] = or i32 [[X]], 65536
+; CHECK-NEXT: [[SMALL:%.*]] = or i32 [[X]], 90
+; CHECK-NEXT: [[KNOWN:%.*]] = icmp ult i32 [[LARGE]], %length.i
+; CHECK-NEXT: [[TO_PROVE:%.*]] = icmp ult i32 [[SMALL]], %length.i
+; CHECK-NEXT: [[RES:%.*]] = icmp ule i1 [[KNOWN]], [[TO_PROVE]]
+; CHECK-NEXT: ret i1 [[RES]]
+;
%x = and i32 %x.full, 4294901760 ;; 4294901760 == 0xffff0000
%large = or i32 %x, 65536 ;; 65536 == 0x00010000
%small = or i32 %x, 90
@@ -169,8 +204,8 @@
define i1 @test13(i32 %length.i, i32 %x) {
; CHECK-LABEL: @test13(
-; CHECK: ret i1 true
-
+; CHECK: ret i1 true
+;
%large = add nuw i32 %x, 100
%small = add nuw i32 %x, 90
%known = icmp ult i32 %large, %length.i
@@ -181,8 +216,8 @@
define i1 @test14(i32 %length.i, i32 %x.full) {
; CHECK-LABEL: @test14(
-; CHECK: ret i1 true
-
+; CHECK: ret i1 true
+;
%x = and i32 %x.full, 4294905615 ;; 4294905615 == 0xffff0f0f
%large = or i32 %x, 8224 ;; == 0x2020
%small = or i32 %x, 4112 ;; == 0x1010
@@ -194,9 +229,13 @@
define i1 @test15(i32 %length.i, i32 %x) {
; CHECK-LABEL: @test15(
-; CHECK: %res = icmp ule i1 %known, %to.prove
-; CHECK: ret i1 %res
-
+; CHECK: [[LARGE:%.*]] = add nuw i32 %x, 100
+; CHECK-NEXT: [[SMALL:%.*]] = add nuw i32 %x, 110
+; CHECK-NEXT: [[KNOWN:%.*]] = icmp ult i32 [[LARGE]], %length.i
+; CHECK-NEXT: [[TO_PROVE:%.*]] = icmp ult i32 [[SMALL]], %length.i
+; CHECK-NEXT: [[RES:%.*]] = icmp ule i1 [[KNOWN]], [[TO_PROVE]]
+; CHECK-NEXT: ret i1 [[RES]]
+;
%large = add nuw i32 %x, 100
%small = add nuw i32 %x, 110
%known = icmp ult i32 %large, %length.i
@@ -207,8 +246,9 @@
; X >=(s) Y == X ==> Y (i1 1 becomes -1 for reasoning)
define i1 @test_sge(i32 %length.i, i32 %i) {
-; CHECK-LABEL: @test_sge
-; CHECK: ret i1 true
+; CHECK-LABEL: @test_sge(
+; CHECK: ret i1 true
+;
%iplus1 = add nsw nuw i32 %i, 1
%var29 = icmp ult i32 %i, %length.i
%var30 = icmp ult i32 %iplus1, %length.i