diff options
author | Roman Lebedev <lebedev.ri@gmail.com> | 2018-07-14 20:08:09 +0000 |
---|---|---|
committer | Roman Lebedev <lebedev.ri@gmail.com> | 2018-07-14 20:08:09 +0000 |
commit | 62d050d2c47d9275e8d2ed827dbe89149fb440e3 (patch) | |
tree | a3e31248b4f340dd5836d5f0a1442728cf5fe739 | |
parent | 3e65d9a6fab74f83ae952f117abfcaf63e7780f2 (diff) | |
download | bcm5719-llvm-62d050d2c47d9275e8d2ed827dbe89149fb440e3.tar.gz bcm5719-llvm-62d050d2c47d9275e8d2ed827dbe89149fb440e3.zip |
[NFC][InstCombine] Tests for x s> x & (-1 >> y) to x s> (-1 >> y) fold.
https://bugs.llvm.org/show_bug.cgi?id=38123
https://rise4fun.com/Alive/I3O
This pattern is not commutative!
We must make sure not to fold the commuted version!
llvm-svn: 337104
-rw-r--r-- | llvm/test/Transforms/InstCombine/canonicalize-constant-low-bit-mask-and-icmp-sgt-to-icmp-sgt.ll | 222 |
1 files changed, 222 insertions, 0 deletions
diff --git a/llvm/test/Transforms/InstCombine/canonicalize-constant-low-bit-mask-and-icmp-sgt-to-icmp-sgt.ll b/llvm/test/Transforms/InstCombine/canonicalize-constant-low-bit-mask-and-icmp-sgt-to-icmp-sgt.ll new file mode 100644 index 00000000000..fc953ae49c8 --- /dev/null +++ b/llvm/test/Transforms/InstCombine/canonicalize-constant-low-bit-mask-and-icmp-sgt-to-icmp-sgt.ll @@ -0,0 +1,222 @@ +; NOTE: Assertions have been autogenerated by utils/update_test_checks.py +; RUN: opt < %s -instcombine -S | FileCheck %s + +; https://bugs.llvm.org/show_bug.cgi?id=38123 + +; Pattern: +; x s> x & C +; Should be transformed into: +; x s> C +; Iff: isPowerOf2(C + 1) + +; NOTE: this pattern is not commutative! + +declare i8 @gen8() +declare <2 x i8> @gen2x8() +declare <3 x i8> @gen3x8() + +; ============================================================================ ; +; Basic positive tests +; ============================================================================ ; + +define i1 @p0() { +; CHECK-LABEL: @p0( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = and i8 [[X]], 3 +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[X]], [[TMP0]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = and i8 %x, 3 + %ret = icmp sgt i8 %x, %tmp0 + ret i1 %ret +} + +define i1 @pv(i8 %y) { +; CHECK-LABEL: @pv( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = lshr i8 -1, [[Y:%.*]] +; CHECK-NEXT: [[TMP1:%.*]] = and i8 [[TMP0]], [[X]] +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[X]], [[TMP1]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = lshr i8 -1, %y + %tmp1 = and i8 %tmp0, %x + %ret = icmp sgt i8 %x, %tmp1 + ret i1 %ret +} + +; ============================================================================ ; +; Vector tests +; ============================================================================ ; + +define <2 x i1> @p1_vec_splat() { +; CHECK-LABEL: @p1_vec_splat( +; CHECK-NEXT: [[X:%.*]] = call <2 x i8> @gen2x8() +; CHECK-NEXT: [[TMP0:%.*]] = and <2 x i8> [[X]], <i8 3, i8 3> +; CHECK-NEXT: [[RET:%.*]] = icmp sgt <2 x i8> [[X]], [[TMP0]] +; CHECK-NEXT: ret <2 x i1> [[RET]] +; + %x = call <2 x i8> @gen2x8() + %tmp0 = and <2 x i8> %x, <i8 3, i8 3> + %ret = icmp sgt <2 x i8> %x, %tmp0 + ret <2 x i1> %ret +} + +define <2 x i1> @p2_vec_nonsplat() { +; CHECK-LABEL: @p2_vec_nonsplat( +; CHECK-NEXT: [[X:%.*]] = call <2 x i8> @gen2x8() +; CHECK-NEXT: [[TMP0:%.*]] = and <2 x i8> [[X]], <i8 3, i8 15> +; CHECK-NEXT: [[RET:%.*]] = icmp sgt <2 x i8> [[X]], [[TMP0]] +; CHECK-NEXT: ret <2 x i1> [[RET]] +; + %x = call <2 x i8> @gen2x8() + %tmp0 = and <2 x i8> %x, <i8 3, i8 15> ; doesn't have to be splat. + %ret = icmp sgt <2 x i8> %x, %tmp0 + ret <2 x i1> %ret +} + +define <3 x i1> @p3_vec_splat_undef() { +; CHECK-LABEL: @p3_vec_splat_undef( +; CHECK-NEXT: [[X:%.*]] = call <3 x i8> @gen3x8() +; CHECK-NEXT: [[TMP0:%.*]] = and <3 x i8> [[X]], <i8 3, i8 undef, i8 3> +; CHECK-NEXT: [[RET:%.*]] = icmp sgt <3 x i8> [[X]], [[TMP0]] +; CHECK-NEXT: ret <3 x i1> [[RET]] +; + %x = call <3 x i8> @gen3x8() + %tmp0 = and <3 x i8> %x, <i8 3, i8 undef, i8 3> + %ret = icmp sgt <3 x i8> %x, %tmp0 + ret <3 x i1> %ret +} + +; ============================================================================ ; +; One-use tests. We don't care about multi-uses here. +; ============================================================================ ; + +declare void @use8(i8) + +define i1 @oneuse0() { +; CHECK-LABEL: @oneuse0( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = and i8 [[X]], 3 +; CHECK-NEXT: call void @use8(i8 [[TMP0]]) +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[X]], [[TMP0]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = and i8 %x, 3 + call void @use8(i8 %tmp0) + %ret = icmp sgt i8 %x, %tmp0 + ret i1 %ret +} + +; ============================================================================ ; +; Negative tests +; ============================================================================ ; + +; ============================================================================ ; +; Commutativity tests. +; ============================================================================ ; + +define i1 @c0(i8 %x) { +; CHECK-LABEL: @c0( +; CHECK-NEXT: [[TMP0:%.*]] = and i8 [[X:%.*]], 3 +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[TMP0]], [[X]] +; CHECK-NEXT: ret i1 [[RET]] +; + %tmp0 = and i8 %x, 3 + %ret = icmp sgt i8 %tmp0, %x ; swapped order + ret i1 %ret +} + +; ============================================================================ ; +; Commutativity tests with variable +; ============================================================================ ; + +; Ok, this one should fold. We only testing commutativity of 'and'. +define i1 @cv0_GOOD(i8 %y) { +; CHECK-LABEL: @cv0_GOOD( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = lshr i8 -1, [[Y:%.*]] +; CHECK-NEXT: [[TMP1:%.*]] = and i8 [[TMP0]], [[X]] +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[X]], [[TMP1]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = lshr i8 -1, %y + %tmp1 = and i8 %tmp0, %x ; swapped order + %ret = icmp sgt i8 %x, %tmp1 + ret i1 %ret +} + +define i1 @cv1(i8 %y) { +; CHECK-LABEL: @cv1( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = lshr i8 -1, [[Y:%.*]] +; CHECK-NEXT: [[TMP1:%.*]] = and i8 [[X]], [[TMP0]] +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[TMP1]], [[X]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = lshr i8 -1, %y + %tmp1 = and i8 %x, %tmp0 + %ret = icmp sgt i8 %tmp1, %x ; swapped order + ret i1 %ret +} + +define i1 @cv2(i8 %x, i8 %y) { +; CHECK-LABEL: @cv2( +; CHECK-NEXT: [[TMP0:%.*]] = lshr i8 -1, [[Y:%.*]] +; CHECK-NEXT: [[TMP1:%.*]] = and i8 [[TMP0]], [[X:%.*]] +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[TMP1]], [[X]] +; CHECK-NEXT: ret i1 [[RET]] +; + %tmp0 = lshr i8 -1, %y + %tmp1 = and i8 %tmp0, %x ; swapped order + %ret = icmp sgt i8 %tmp1, %x ; swapped order + ret i1 %ret +} + +; ============================================================================ ; +; Normal negative tests +; ============================================================================ ; + +define i1 @n0() { +; CHECK-LABEL: @n0( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = and i8 [[X]], 4 +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[X]], [[TMP0]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = and i8 %x, 4 ; power-of-two, but invalid. + %ret = icmp sgt i8 %x, %tmp0 + ret i1 %ret +} + +define i1 @n1(i8 %y, i8 %notx) { +; CHECK-LABEL: @n1( +; CHECK-NEXT: [[X:%.*]] = call i8 @gen8() +; CHECK-NEXT: [[TMP0:%.*]] = and i8 [[X]], 3 +; CHECK-NEXT: [[RET:%.*]] = icmp sgt i8 [[TMP0]], [[NOTX:%.*]] +; CHECK-NEXT: ret i1 [[RET]] +; + %x = call i8 @gen8() + %tmp0 = and i8 %x, 3 + %ret = icmp sgt i8 %tmp0, %notx ; not %x + ret i1 %ret +} + +define <2 x i1> @n2() { +; CHECK-LABEL: @n2( +; CHECK-NEXT: [[X:%.*]] = call <2 x i8> @gen2x8() +; CHECK-NEXT: [[TMP0:%.*]] = and <2 x i8> [[X]], <i8 3, i8 16> +; CHECK-NEXT: [[RET:%.*]] = icmp sgt <2 x i8> [[X]], [[TMP0]] +; CHECK-NEXT: ret <2 x i1> [[RET]] +; + %x = call <2 x i8> @gen2x8() + %tmp0 = and <2 x i8> %x, <i8 3, i8 16> ; only the first one is valid. + %ret = icmp sgt <2 x i8> %x, %tmp0 + ret <2 x i1> %ret +} |