[llvm] r364227 - [InstCombine] add tests for more variants of isPowerOf2; NFC
Sanjay Patel via llvm-commits
llvm-commits at lists.llvm.org
Mon Jun 24 13:11:40 PDT 2019
Author: spatel
Date: Mon Jun 24 13:11:40 2019
New Revision: 364227
URL: http://llvm.org/viewvc/llvm-project?rev=364227&view=rev
Log:
[InstCombine] add tests for more variants of isPowerOf2; NFC
Modified:
llvm/trunk/test/Transforms/InstCombine/ispow2.ll
Modified: llvm/trunk/test/Transforms/InstCombine/ispow2.ll
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Transforms/InstCombine/ispow2.ll?rev=364227&r1=364226&r2=364227&view=diff
==============================================================================
--- llvm/trunk/test/Transforms/InstCombine/ispow2.ll (original)
+++ llvm/trunk/test/Transforms/InstCombine/ispow2.ll Mon Jun 24 13:11:40 2019
@@ -306,3 +306,262 @@ define i1 @is_pow2_ctpop_wrong_pred2(i32
%r = and i1 %cmp2, %cmp
ret i1 %r
}
+
+; (X == 0) || (ctpop(X) u> 1) --> ctpop(X) != 1
+
+define i1 @isnot_pow2_ctpop(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop(
+; CHECK-NEXT: [[T0:%.*]] = tail call i32 @llvm.ctpop.i32(i32 [[X:%.*]]), !range !0
+; CHECK-NEXT: [[CMP:%.*]] = icmp ugt i32 [[T0]], 1
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i32 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = or i1 [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %t0 = tail call i32 @llvm.ctpop.i32(i32 %x)
+ %cmp = icmp ugt i32 %t0, 1
+ %iszero = icmp eq i32 %x, 0
+ %r = or i1 %iszero, %cmp
+ ret i1 %r
+}
+
+; Extra uses don't change the fold.
+
+define i1 @isnot_pow2_ctpop_extra_uses(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop_extra_uses(
+; CHECK-NEXT: [[T0:%.*]] = tail call i32 @llvm.ctpop.i32(i32 [[X:%.*]]), !range !0
+; CHECK-NEXT: [[CMP:%.*]] = icmp ugt i32 [[T0]], 1
+; CHECK-NEXT: call void @use_i1(i1 [[CMP]])
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i32 [[X]], 0
+; CHECK-NEXT: call void @use_i1(i1 [[ISZERO]])
+; CHECK-NEXT: [[R:%.*]] = or i1 [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %t0 = tail call i32 @llvm.ctpop.i32(i32 %x)
+ %cmp = icmp ugt i32 %t0, 1
+ call void @use_i1(i1 %cmp)
+ %iszero = icmp eq i32 %x, 0
+ call void @use_i1(i1 %iszero)
+ %r = or i1 %iszero, %cmp
+ ret i1 %r
+}
+
+; Test vector type and commuted 'or' operands.
+
+define <2 x i1> @isnot_pow2_ctpop_commute_vec(<2 x i8> %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop_commute_vec(
+; CHECK-NEXT: [[T0:%.*]] = tail call <2 x i8> @llvm.ctpop.v2i8(<2 x i8> [[X:%.*]])
+; CHECK-NEXT: [[CMP:%.*]] = icmp ugt <2 x i8> [[T0]], <i8 1, i8 1>
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq <2 x i8> [[X]], zeroinitializer
+; CHECK-NEXT: [[R:%.*]] = or <2 x i1> [[CMP]], [[ISZERO]]
+; CHECK-NEXT: ret <2 x i1> [[R]]
+;
+ %t0 = tail call <2 x i8> @llvm.ctpop.v2i8(<2 x i8> %x)
+ %cmp = icmp ugt <2 x i8> %t0, <i8 1, i8 1>
+ %iszero = icmp eq <2 x i8> %x, zeroinitializer
+ %r = or <2 x i1> %cmp, %iszero
+ ret <2 x i1> %r
+}
+
+; Negative test - wrong constant.
+
+define i1 @isnot_pow2_ctpop_wrong_cmp_op1(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop_wrong_cmp_op1(
+; CHECK-NEXT: [[T0:%.*]] = tail call i32 @llvm.ctpop.i32(i32 [[X:%.*]]), !range !0
+; CHECK-NEXT: [[CMP:%.*]] = icmp ugt i32 [[T0]], 2
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i32 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = or i1 [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %t0 = tail call i32 @llvm.ctpop.i32(i32 %x)
+ %cmp = icmp ugt i32 %t0, 2
+ %iszero = icmp eq i32 %x, 0
+ %r = or i1 %iszero, %cmp
+ ret i1 %r
+}
+
+; Negative test - wrong constant.
+
+define i1 @isnot_pow2_ctpop_wrong_cmp_op2(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop_wrong_cmp_op2(
+; CHECK-NEXT: [[T0:%.*]] = tail call i32 @llvm.ctpop.i32(i32 [[X:%.*]]), !range !0
+; CHECK-NEXT: [[CMP:%.*]] = icmp ugt i32 [[T0]], 1
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i32 [[X]], 1
+; CHECK-NEXT: [[R:%.*]] = or i1 [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %t0 = tail call i32 @llvm.ctpop.i32(i32 %x)
+ %cmp = icmp ugt i32 %t0, 1
+ %iszero = icmp eq i32 %x, 1
+ %r = or i1 %iszero, %cmp
+ ret i1 %r
+}
+
+; Negative test - wrong predicate (but this could reduce).
+
+define i1 @isnot_pow2_ctpop_wrong_pred1(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop_wrong_pred1(
+; CHECK-NEXT: [[T0:%.*]] = tail call i32 @llvm.ctpop.i32(i32 [[X:%.*]]), !range !0
+; CHECK-NEXT: [[CMP:%.*]] = icmp eq i32 [[T0]], 1
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i32 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = or i1 [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %t0 = tail call i32 @llvm.ctpop.i32(i32 %x)
+ %cmp = icmp eq i32 %t0, 1
+ %iszero = icmp eq i32 %x, 0
+ %r = or i1 %iszero, %cmp
+ ret i1 %r
+}
+
+; Negative test - wrong predicate.
+
+define i1 @isnot_pow2_ctpop_wrong_pred2(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_ctpop_wrong_pred2(
+; CHECK-NEXT: [[T0:%.*]] = tail call i32 @llvm.ctpop.i32(i32 [[X:%.*]]), !range !0
+; CHECK-NEXT: [[CMP:%.*]] = icmp ugt i32 [[T0]], 1
+; CHECK-NEXT: [[CMP2:%.*]] = icmp slt i32 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = or i1 [[CMP2]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %t0 = tail call i32 @llvm.ctpop.i32(i32 %x)
+ %cmp = icmp ugt i32 %t0, 1
+ %cmp2 = icmp slt i32 %x, 0
+ %r = or i1 %cmp2, %cmp
+ ret i1 %r
+}
+
+define i1 @is_pow2_negate_op(i32 %x) {
+; CHECK-LABEL: @is_pow2_negate_op(
+; CHECK-NEXT: [[TMP1:%.*]] = add i32 [[X:%.*]], -1
+; CHECK-NEXT: [[TMP2:%.*]] = and i32 [[TMP1]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp eq i32 [[TMP2]], 0
+; CHECK-NEXT: [[NOTZERO:%.*]] = icmp ne i32 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = and i1 [[NOTZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %neg = sub i32 0, %x
+ %and = and i32 %neg, %x
+ %cmp = icmp eq i32 %and, %x
+ %notzero = icmp ne i32 %x, 0
+ %r = and i1 %notzero, %cmp
+ ret i1 %r
+}
+
+define <2 x i1> @is_pow2_negate_op_vec(<2 x i32> %x) {
+; CHECK-LABEL: @is_pow2_negate_op_vec(
+; CHECK-NEXT: [[TMP1:%.*]] = add <2 x i32> [[X:%.*]], <i32 -1, i32 -1>
+; CHECK-NEXT: [[TMP2:%.*]] = and <2 x i32> [[TMP1]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp eq <2 x i32> [[TMP2]], zeroinitializer
+; CHECK-NEXT: [[NOTZERO:%.*]] = icmp ne <2 x i32> [[X]], zeroinitializer
+; CHECK-NEXT: [[R:%.*]] = and <2 x i1> [[CMP]], [[NOTZERO]]
+; CHECK-NEXT: ret <2 x i1> [[R]]
+;
+ %neg = sub <2 x i32> zeroinitializer, %x
+ %and = and <2 x i32> %neg, %x
+ %cmp = icmp eq <2 x i32> %and, %x
+ %notzero = icmp ne <2 x i32> %x, zeroinitializer
+ %r = and <2 x i1> %cmp, %notzero
+ ret <2 x i1> %r
+}
+
+define i1 @is_pow2_decrement_op(i8 %x) {
+; CHECK-LABEL: @is_pow2_decrement_op(
+; CHECK-NEXT: [[DEC:%.*]] = add i8 [[X:%.*]], -1
+; CHECK-NEXT: [[AND:%.*]] = and i8 [[DEC]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp eq i8 [[AND]], 0
+; CHECK-NEXT: [[NOTZERO:%.*]] = icmp ne i8 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = and i1 [[CMP]], [[NOTZERO]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %dec = add i8 %x, -1
+ %and = and i8 %dec, %x
+ %cmp = icmp eq i8 %and, 0
+ %notzero = icmp ne i8 %x, 0
+ %r = and i1 %cmp, %notzero
+ ret i1 %r
+}
+
+define <2 x i1> @is_pow2_decrement_op_vec(<2 x i8> %x) {
+; CHECK-LABEL: @is_pow2_decrement_op_vec(
+; CHECK-NEXT: [[DEC:%.*]] = add <2 x i8> [[X:%.*]], <i8 -1, i8 -1>
+; CHECK-NEXT: [[AND:%.*]] = and <2 x i8> [[DEC]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp eq <2 x i8> [[AND]], zeroinitializer
+; CHECK-NEXT: [[NOTZERO:%.*]] = icmp ne <2 x i8> [[X]], zeroinitializer
+; CHECK-NEXT: [[R:%.*]] = and <2 x i1> [[NOTZERO]], [[CMP]]
+; CHECK-NEXT: ret <2 x i1> [[R]]
+;
+ %dec = add <2 x i8> %x, <i8 -1, i8 -1>
+ %and = and <2 x i8> %dec, %x
+ %cmp = icmp eq <2 x i8> %and, zeroinitializer
+ %notzero = icmp ne <2 x i8> %x, zeroinitializer
+ %r = and <2 x i1> %notzero, %cmp
+ ret <2 x i1> %r
+}
+
+define i1 @isnot_pow2_negate_op(i32 %x) {
+; CHECK-LABEL: @isnot_pow2_negate_op(
+; CHECK-NEXT: [[TMP1:%.*]] = add i32 [[X:%.*]], -1
+; CHECK-NEXT: [[TMP2:%.*]] = and i32 [[TMP1]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp ne i32 [[TMP2]], 0
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i32 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = or i1 [[CMP]], [[ISZERO]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %neg = sub i32 0, %x
+ %and = and i32 %neg, %x
+ %cmp = icmp ne i32 %and, %x
+ %iszero = icmp eq i32 %x, 0
+ %r = or i1 %cmp, %iszero
+ ret i1 %r
+}
+
+define <2 x i1> @isnot_pow2_negate_op_vec(<2 x i32> %x) {
+; CHECK-LABEL: @isnot_pow2_negate_op_vec(
+; CHECK-NEXT: [[TMP1:%.*]] = add <2 x i32> [[X:%.*]], <i32 -1, i32 -1>
+; CHECK-NEXT: [[TMP2:%.*]] = and <2 x i32> [[TMP1]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp ne <2 x i32> [[TMP2]], zeroinitializer
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq <2 x i32> [[X]], zeroinitializer
+; CHECK-NEXT: [[R:%.*]] = or <2 x i1> [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret <2 x i1> [[R]]
+;
+ %neg = sub <2 x i32> zeroinitializer, %x
+ %and = and <2 x i32> %neg, %x
+ %cmp = icmp ne <2 x i32> %and, %x
+ %iszero = icmp eq <2 x i32> %x, zeroinitializer
+ %r = or <2 x i1> %iszero, %cmp
+ ret <2 x i1> %r
+}
+
+define i1 @isnot_pow2_decrement_op(i8 %x) {
+; CHECK-LABEL: @isnot_pow2_decrement_op(
+; CHECK-NEXT: [[DEC:%.*]] = add i8 [[X:%.*]], -1
+; CHECK-NEXT: [[AND:%.*]] = and i8 [[DEC]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp ne i8 [[AND]], 0
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq i8 [[X]], 0
+; CHECK-NEXT: [[R:%.*]] = or i1 [[ISZERO]], [[CMP]]
+; CHECK-NEXT: ret i1 [[R]]
+;
+ %dec = add i8 %x, -1
+ %and = and i8 %dec, %x
+ %cmp = icmp ne i8 %and, 0
+ %iszero = icmp eq i8 %x, 0
+ %r = or i1 %iszero, %cmp
+ ret i1 %r
+}
+
+define <2 x i1> @isnot_pow2_decrement_op_vec(<2 x i8> %x) {
+; CHECK-LABEL: @isnot_pow2_decrement_op_vec(
+; CHECK-NEXT: [[DEC:%.*]] = add <2 x i8> [[X:%.*]], <i8 -1, i8 -1>
+; CHECK-NEXT: [[AND:%.*]] = and <2 x i8> [[DEC]], [[X]]
+; CHECK-NEXT: [[CMP:%.*]] = icmp ne <2 x i8> [[AND]], zeroinitializer
+; CHECK-NEXT: [[ISZERO:%.*]] = icmp eq <2 x i8> [[X]], zeroinitializer
+; CHECK-NEXT: [[R:%.*]] = or <2 x i1> [[CMP]], [[ISZERO]]
+; CHECK-NEXT: ret <2 x i1> [[R]]
+;
+ %dec = add <2 x i8> %x, <i8 -1, i8 -1>
+ %and = and <2 x i8> %dec, %x
+ %cmp = icmp ne <2 x i8> %and, zeroinitializer
+ %iszero = icmp eq <2 x i8> %x, zeroinitializer
+ %r = or <2 x i1> %cmp, %iszero
+ ret <2 x i1> %r
+}
More information about the llvm-commits
mailing list