[llvm] r279530 - [InstSimplify] move icmp with constant tests to another file; NFC
Sanjay Patel via llvm-commits
llvm-commits at lists.llvm.org
Tue Aug 23 09:46:53 PDT 2016
Author: spatel
Date: Tue Aug 23 11:46:53 2016
New Revision: 279530
URL: http://llvm.org/viewvc/llvm-project?rev=279530&view=rev
Log:
[InstSimplify] move icmp with constant tests to another file; NFC
...because like the corresponding code, this is just too big to keep adding to.
And the next step is to add a vector version of each of these tests to show
missed folds.
Also, auto-generate CHECK lines and add comments for the tests that correspond to
the source code.
Added:
llvm/trunk/test/Transforms/InstSimplify/icmp-constant.ll
Modified:
llvm/trunk/test/Transforms/InstSimplify/compare.ll
Modified: llvm/trunk/test/Transforms/InstSimplify/compare.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/InstSimplify/compare.ll?rev=279530&r1=279529&r2=279530&view=diff
==============================================================================
--- llvm/trunk/test/Transforms/InstSimplify/compare.ll (original)
+++ llvm/trunk/test/Transforms/InstSimplify/compare.ll Tue Aug 23 11:46:53 2016
@@ -1,4 +1,3 @@
-; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -instsimplify -S | FileCheck %s
target datalayout = "p:32:32"
@@ -370,14 +369,6 @@ define i1 @shl1(i32 %x) {
; CHECK: ret i1 false
}
-define i1 @shl2(i32 %X) {
-; CHECK: @shl2
- %sub = shl nsw i32 -1, %X
- %cmp = icmp eq i32 %sub, 31
- ret i1 %cmp
-; CHECK-NEXT: ret i1 false
-}
-
define i1 @shl3(i32 %X) {
; CHECK: @shl3
%sub = shl nuw i32 4, %X
@@ -386,22 +377,6 @@ define i1 @shl3(i32 %X) {
; CHECK-NEXT: ret i1 false
}
-define i1 @shl4(i32 %X) {
-; CHECK: @shl4
- %sub = shl nsw i32 -1, %X
- %cmp = icmp sle i32 %sub, -1
- ret i1 %cmp
-; CHECK-NEXT: ret i1 true
-}
-
-define i1 @shl5(i32 %X) {
-; CHECK: @shl5
- %sub = shl nuw i32 4, %X
- %cmp = icmp ugt i32 %sub, 3
- ret i1 %cmp
-; CHECK-NEXT: ret i1 true
-}
-
define i1 @lshr1(i32 %x) {
; CHECK-LABEL: @lshr1(
%s = lshr i32 -1, %x
@@ -410,14 +385,6 @@ define i1 @lshr1(i32 %x) {
; CHECK: ret i1 false
}
-define i1 @lshr2(i32 %x) {
-; CHECK-LABEL: @lshr2(
- %s = lshr i32 %x, 30
- %c = icmp ugt i32 %s, 8
- ret i1 %c
-; CHECK: ret i1 false
-}
-
define i1 @lshr3(i32 %x) {
; CHECK-LABEL: @lshr3(
%s = lshr i32 %x, %x
@@ -450,14 +417,6 @@ define i1 @ashr1(i32 %x) {
; CHECK: ret i1 false
}
-define i1 @ashr2(i32 %x) {
-; CHECK-LABEL: @ashr2(
- %s = ashr i32 %x, 30
- %c = icmp slt i32 %s, -5
- ret i1 %c
-; CHECK: ret i1 false
-}
-
define i1 @ashr3(i32 %x) {
; CHECK-LABEL: @ashr3(
%s = ashr i32 %x, %x
@@ -535,14 +494,6 @@ define i1 @urem2(i32 %X, i32 %Y) {
; CHECK: ret i1 false
}
-define i1 @urem3(i32 %X) {
-; CHECK-LABEL: @urem3(
- %A = urem i32 %X, 10
- %B = icmp ult i32 %A, 15
- ret i1 %B
-; CHECK: ret i1 true
-}
-
define i1 @urem4(i32 %X) {
; CHECK-LABEL: @urem4(
%A = urem i32 %X, 15
@@ -576,14 +527,6 @@ define i1 @urem7(i32 %X) {
; CHECK-NOT: ret i1 false
}
-define i1 @srem1(i32 %X) {
-; CHECK-LABEL: @srem1(
- %A = srem i32 %X, -5
- %B = icmp sgt i32 %A, 5
- ret i1 %B
-; CHECK: ret i1 false
-}
-
; PR9343 #15
; CHECK-LABEL: @srem2(
; CHECK: ret i1 false
@@ -606,14 +549,6 @@ define i1 @srem3(i16 %X, i32 %Y) {
ret i1 %E
}
-define i1 @udiv1(i32 %X) {
-; CHECK-LABEL: @udiv1(
- %A = udiv i32 %X, 1000000
- %B = icmp ult i32 %A, 5000
- ret i1 %B
-; CHECK: ret i1 true
-}
-
define i1 @udiv2(i32 %X, i32 %Y, i32 %Z) {
; CHECK-LABEL: @udiv2(
%A = udiv exact i32 10, %Z
@@ -639,14 +574,6 @@ define i1 @udiv4(i32 %X, i32 %Y) {
; CHECK: ret i1 true
}
-define i1 @udiv5(i32 %X) {
-; CHECK-LABEL: @udiv5(
- %A = udiv i32 123, %X
- %C = icmp ugt i32 %A, 124
- ret i1 %C
-; CHECK: ret i1 false
-}
-
; PR11340
define i1 @udiv6(i32 %X) nounwind {
; CHECK-LABEL: @udiv6(
@@ -656,31 +583,6 @@ define i1 @udiv6(i32 %X) nounwind {
; CHECK: ret i1 %C
}
-
-define i1 @sdiv1(i32 %X) {
-; CHECK-LABEL: @sdiv1(
- %A = sdiv i32 %X, 1000000
- %B = icmp slt i32 %A, 3000
- ret i1 %B
-; CHECK: ret i1 true
-}
-
-define i1 @or1(i32 %X) {
-; CHECK-LABEL: @or1(
- %A = or i32 %X, 62
- %B = icmp ult i32 %A, 50
- ret i1 %B
-; CHECK: ret i1 false
-}
-
-define i1 @and1(i32 %X) {
-; CHECK-LABEL: @and1(
- %A = and i32 %X, 62
- %B = icmp ugt i32 %A, 70
- ret i1 %B
-; CHECK: ret i1 false
-}
-
define i1 @mul1(i32 %X) {
; CHECK-LABEL: @mul1(
; Square of a non-zero number is non-zero if there is no overflow.
@@ -895,15 +797,6 @@ define i1 @compare_always_false_ne(i16 %
; CHECK-NEXT: ret i1 true
}
-define i1 @compare_dividend(i32 %a) {
- %div = sdiv i32 2, %a
- %cmp = icmp eq i32 %div, 3
- ret i1 %cmp
-
-; CHECK-LABEL: @compare_dividend
-; CHECK-NEXT: ret i1 false
-}
-
define i1 @lshr_ugt_false(i32 %a) {
%shr = lshr i32 1, %a
%cmp = icmp ugt i32 %shr, 1
@@ -912,38 +805,6 @@ define i1 @lshr_ugt_false(i32 %a) {
; CHECK-NEXT: ret i1 false
}
-define i1 @exact_lshr_ugt_false(i32 %a) {
- %shr = lshr exact i32 30, %a
- %cmp = icmp ult i32 %shr, 15
- ret i1 %cmp
-; CHECK-LABEL: @exact_lshr_ugt_false
-; CHECK-NEXT: ret i1 false
-}
-
-define i1 @lshr_sgt_false(i32 %a) {
- %shr = lshr i32 1, %a
- %cmp = icmp sgt i32 %shr, 1
- ret i1 %cmp
-; CHECK-LABEL: @lshr_sgt_false
-; CHECK-NEXT: ret i1 false
-}
-
-define i1 @ashr_sgt_false(i32 %a) {
- %shr = ashr i32 -30, %a
- %cmp = icmp sgt i32 %shr, -1
- ret i1 %cmp
-; CHECK-LABEL: @ashr_sgt_false
-; CHECK-NEXT: ret i1 false
-}
-
-define i1 @exact_ashr_sgt_false(i32 %a) {
- %shr = ashr exact i32 -30, %a
- %cmp = icmp sgt i32 %shr, -15
- ret i1 %cmp
-; CHECK-LABEL: @exact_ashr_sgt_false
-; CHECK-NEXT: ret i1 false
-}
-
define i1 @nonnull_arg(i32* nonnull %i) {
%cmp = icmp eq i32* %i, null
ret i1 %cmp
@@ -1110,24 +971,6 @@ define i1 @icmp_shl_nuw_1(i64 %a) {
; CHECK-NEXT: ret i1 true
}
-define i1 @icmp_shl_nsw_neg1(i64 %a) {
- %shl = shl nsw i64 -1, %a
- %cmp = icmp sge i64 %shl, 3
- ret i1 %cmp
-
-; CHECK-LABEL: @icmp_shl_nsw_neg1
-; CHECK-NEXT: ret i1 false
-}
-
-define i1 @icmp_shl_nsw_1(i64 %a) {
- %shl = shl nsw i64 1, %a
- %cmp = icmp sge i64 %shl, 0
- ret i1 %cmp
-
-; CHECK-LABEL: @icmp_shl_nsw_1
-; CHECK-NEXT: ret i1 true
-}
-
define i1 @icmp_shl_1_V_ugt_2147483648(i32 %V) {
%shl = shl i32 1, %V
%cmp = icmp ugt i32 %shl, 2147483648
@@ -1228,14 +1071,6 @@ define i1 @tautological8(i32 %A, i32 %B)
; CHECK: ret i1 false
}
-define i1 @tautological9(i32 %x) {
- %add = add nuw i32 %x, 13
- %cmp = icmp ne i32 %add, 12
- ret i1 %cmp
-; CHECK-LABEL: @tautological9(
-; CHECK: ret i1 true
-}
-
declare void @helper_i1(i1)
; Series of tests for icmp s[lt|ge] (or A, B), A and icmp s[gt|le] A, (or A, B)
define void @icmp_slt_sge_or(i32 %Ax, i32 %Bx) {
Added: llvm/trunk/test/Transforms/InstSimplify/icmp-constant.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/InstSimplify/icmp-constant.ll?rev=279530&view=auto
==============================================================================
--- llvm/trunk/test/Transforms/InstSimplify/icmp-constant.ll (added)
+++ llvm/trunk/test/Transforms/InstSimplify/icmp-constant.ll Tue Aug 23 11:46:53 2016
@@ -0,0 +1,222 @@
+; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
+; RUN: opt < %s -instsimplify -S | FileCheck %s
+
+; Fold icmp with a constant operand.
+
+define i1 @tautological_ule(i8 %x) {
+; CHECK-LABEL: @tautological_ule(
+; CHECK-NEXT: ret i1 true
+;
+ %cmp = icmp ule i8 %x, 255
+ ret i1 %cmp
+}
+
+define i1 @tautological_ugt(i8 %x) {
+; CHECK-LABEL: @tautological_ugt(
+; CHECK-NEXT: ret i1 false
+;
+ %cmp = icmp ugt i8 %x, 255
+ ret i1 %cmp
+}
+
+; 'urem x, C2' produces [0, C2)
+define i1 @urem3(i32 %X) {
+; CHECK-LABEL: @urem3(
+; CHECK-NEXT: ret i1 true
+;
+ %A = urem i32 %X, 10
+ %B = icmp ult i32 %A, 15
+ ret i1 %B
+}
+
+;'srem x, C2' produces (-|C2|, |C2|)
+define i1 @srem1(i32 %X) {
+; CHECK-LABEL: @srem1(
+; CHECK-NEXT: ret i1 false
+;
+ %A = srem i32 %X, -5
+ %B = icmp sgt i32 %A, 5
+ ret i1 %B
+}
+
+;'udiv C2, x' produces [0, C2]
+define i1 @udiv5(i32 %X) {
+; CHECK-LABEL: @udiv5(
+; CHECK-NEXT: ret i1 false
+;
+ %A = udiv i32 123, %X
+ %C = icmp ugt i32 %A, 124
+ ret i1 %C
+}
+
+; 'udiv x, C2' produces [0, UINT_MAX / C2]
+define i1 @udiv1(i32 %X) {
+; CHECK-LABEL: @udiv1(
+; CHECK-NEXT: ret i1 true
+;
+ %A = udiv i32 %X, 1000000
+ %B = icmp ult i32 %A, 5000
+ ret i1 %B
+}
+
+; 'sdiv C2, x' produces [-|C2|, |C2|]
+define i1 @compare_dividend(i32 %a) {
+; CHECK-LABEL: @compare_dividend(
+; CHECK-NEXT: ret i1 false
+;
+ %div = sdiv i32 2, %a
+ %cmp = icmp eq i32 %div, 3
+ ret i1 %cmp
+}
+
+; 'sdiv x, C2' produces [INT_MIN / C2, INT_MAX / C2]
+; where C2 != -1 and C2 != 0 and C2 != 1
+define i1 @sdiv1(i32 %X) {
+; CHECK-LABEL: @sdiv1(
+; CHECK-NEXT: ret i1 true
+;
+ %A = sdiv i32 %X, 1000000
+ %B = icmp slt i32 %A, 3000
+ ret i1 %B
+}
+
+; 'shl nuw C2, x' produces [C2, C2 << CLZ(C2)]
+define i1 @shl5(i32 %X) {
+; CHECK-LABEL: @shl5(
+; CHECK-NEXT: ret i1 true
+;
+ %sub = shl nuw i32 4, %X
+ %cmp = icmp ugt i32 %sub, 3
+ ret i1 %cmp
+}
+
+; 'shl nsw C2, x' produces [C2 << CLO(C2)-1, C2]
+define i1 @shl2(i32 %X) {
+; CHECK-LABEL: @shl2(
+; CHECK-NEXT: ret i1 false
+;
+ %sub = shl nsw i32 -1, %X
+ %cmp = icmp eq i32 %sub, 31
+ ret i1 %cmp
+}
+
+; 'shl nsw C2, x' produces [C2 << CLO(C2)-1, C2]
+define i1 @shl4(i32 %X) {
+; CHECK-LABEL: @shl4(
+; CHECK-NEXT: ret i1 true
+;
+ %sub = shl nsw i32 -1, %X
+ %cmp = icmp sle i32 %sub, -1
+ ret i1 %cmp
+}
+
+; 'shl nsw C2, x' produces [C2, C2 << CLZ(C2)-1]
+define i1 @icmp_shl_nsw_1(i64 %a) {
+; CHECK-LABEL: @icmp_shl_nsw_1(
+; CHECK-NEXT: ret i1 true
+;
+ %shl = shl nsw i64 1, %a
+ %cmp = icmp sge i64 %shl, 0
+ ret i1 %cmp
+}
+
+; 'shl nsw C2, x' produces [C2 << CLO(C2)-1, C2]
+define i1 @icmp_shl_nsw_neg1(i64 %a) {
+; CHECK-LABEL: @icmp_shl_nsw_neg1(
+; CHECK-NEXT: ret i1 false
+;
+ %shl = shl nsw i64 -1, %a
+ %cmp = icmp sge i64 %shl, 3
+ ret i1 %cmp
+}
+
+; 'lshr x, C2' produces [0, UINT_MAX >> C2]
+define i1 @lshr2(i32 %x) {
+; CHECK-LABEL: @lshr2(
+; CHECK-NEXT: ret i1 false
+;
+ %s = lshr i32 %x, 30
+ %c = icmp ugt i32 %s, 8
+ ret i1 %c
+}
+
+; 'lshr C2, x' produces [C2 >> (Width-1), C2]
+define i1 @exact_lshr_ugt_false(i32 %a) {
+; CHECK-LABEL: @exact_lshr_ugt_false(
+; CHECK-NEXT: ret i1 false
+;
+ %shr = lshr exact i32 30, %a
+ %cmp = icmp ult i32 %shr, 15
+ ret i1 %cmp
+}
+
+; 'lshr C2, x' produces [C2 >> (Width-1), C2]
+define i1 @lshr_sgt_false(i32 %a) {
+; CHECK-LABEL: @lshr_sgt_false(
+; CHECK-NEXT: ret i1 false
+;
+ %shr = lshr i32 1, %a
+ %cmp = icmp sgt i32 %shr, 1
+ ret i1 %cmp
+}
+
+; 'ashr x, C2' produces [INT_MIN >> C2, INT_MAX >> C2]
+define i1 @ashr2(i32 %x) {
+; CHECK-LABEL: @ashr2(
+; CHECK-NEXT: ret i1 false
+;
+ %s = ashr i32 %x, 30
+ %c = icmp slt i32 %s, -5
+ ret i1 %c
+}
+
+; 'ashr C2, x' produces [C2, C2 >> (Width-1)]
+define i1 @ashr_sgt_false(i32 %a) {
+; CHECK-LABEL: @ashr_sgt_false(
+; CHECK-NEXT: ret i1 false
+;
+ %shr = ashr i32 -30, %a
+ %cmp = icmp sgt i32 %shr, -1
+ ret i1 %cmp
+}
+
+; 'ashr C2, x' produces [C2, C2 >> (Width-1)]
+define i1 @exact_ashr_sgt_false(i32 %a) {
+; CHECK-LABEL: @exact_ashr_sgt_false(
+; CHECK-NEXT: ret i1 false
+;
+ %shr = ashr exact i32 -30, %a
+ %cmp = icmp sgt i32 %shr, -15
+ ret i1 %cmp
+}
+
+; 'or x, C2' produces [C2, UINT_MAX]
+define i1 @or1(i32 %X) {
+; CHECK-LABEL: @or1(
+; CHECK-NEXT: ret i1 false
+;
+ %A = or i32 %X, 62
+ %B = icmp ult i32 %A, 50
+ ret i1 %B
+}
+
+; 'and x, C2' produces [0, C2]
+define i1 @and1(i32 %X) {
+; CHECK-LABEL: @and1(
+; CHECK-NEXT: ret i1 false
+;
+ %A = and i32 %X, 62
+ %B = icmp ugt i32 %A, 70
+ ret i1 %B
+}
+
+; 'add nuw x, C2' produces [C2, UINT_MAX]
+define i1 @tautological9(i32 %x) {
+; CHECK-LABEL: @tautological9(
+; CHECK-NEXT: ret i1 true
+;
+ %add = add nuw i32 %x, 13
+ %cmp = icmp ne i32 %add, 12
+ ret i1 %cmp
+}
+
More information about the llvm-commits
mailing list