2011-02-20 13:23:43 +00:00
|
|
|
; RUN: opt -S -instcombine < %s | FileCheck %s
|
|
|
|
|
|
|
|
define i32 @test1(i32 %x, i32 %y) nounwind {
|
|
|
|
%or = or i32 %x, %y
|
|
|
|
%not = xor i32 %or, -1
|
|
|
|
%z = or i32 %x, %not
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test1(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %y.not = xor i32 %y, -1
|
|
|
|
; CHECK-NEXT: %z = or i32 %y.not, %x
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test2(i32 %x, i32 %y) nounwind {
|
|
|
|
%or = or i32 %x, %y
|
|
|
|
%not = xor i32 %or, -1
|
|
|
|
%z = or i32 %y, %not
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test2(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %x.not = xor i32 %x, -1
|
|
|
|
; CHECK-NEXT: %z = or i32 %x.not, %y
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test3(i32 %x, i32 %y) nounwind {
|
|
|
|
%xor = xor i32 %x, %y
|
|
|
|
%not = xor i32 %xor, -1
|
|
|
|
%z = or i32 %x, %not
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test3(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %y.not = xor i32 %y, -1
|
|
|
|
; CHECK-NEXT: %z = or i32 %y.not, %x
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test4(i32 %x, i32 %y) nounwind {
|
|
|
|
%xor = xor i32 %x, %y
|
|
|
|
%not = xor i32 %xor, -1
|
|
|
|
%z = or i32 %y, %not
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test4(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %x.not = xor i32 %x, -1
|
|
|
|
; CHECK-NEXT: %z = or i32 %x.not, %y
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test5(i32 %x, i32 %y) nounwind {
|
|
|
|
%and = and i32 %x, %y
|
|
|
|
%not = xor i32 %and, -1
|
|
|
|
%z = or i32 %x, %not
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test5(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: ret i32 -1
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test6(i32 %x, i32 %y) nounwind {
|
|
|
|
%and = and i32 %x, %y
|
|
|
|
%not = xor i32 %and, -1
|
|
|
|
%z = or i32 %y, %not
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test6(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: ret i32 -1
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test7(i32 %x, i32 %y) nounwind {
|
|
|
|
%xor = xor i32 %x, %y
|
|
|
|
%z = or i32 %y, %xor
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test7(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %z = or i32 %x, %y
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test8(i32 %x, i32 %y) nounwind {
|
|
|
|
%not = xor i32 %y, -1
|
|
|
|
%xor = xor i32 %x, %not
|
|
|
|
%z = or i32 %y, %xor
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test8(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %x.not = xor i32 %x, -1
|
|
|
|
; CHECK-NEXT: %z = or i32 %x.not, %y
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test9(i32 %x, i32 %y) nounwind {
|
|
|
|
%not = xor i32 %x, -1
|
|
|
|
%xor = xor i32 %not, %y
|
|
|
|
%z = or i32 %x, %xor
|
|
|
|
ret i32 %z
|
2013-07-14 01:42:54 +00:00
|
|
|
; CHECK-LABEL: @test9(
|
2011-02-20 13:23:43 +00:00
|
|
|
; CHECK-NEXT: %y.not = xor i32 %y, -1
|
|
|
|
; CHECK-NEXT: %z = or i32 %y.not, %x
|
|
|
|
; CHECK-NEXT: ret i32 %z
|
|
|
|
}
|
InstCombine: Simplify (A ^ B) or/and (A ^ B ^ C)
While we can already transform A | (A ^ B) into A | B, things get bad
once we have (A ^ B) | (A ^ B ^ Cst) because reassociation will morph
this into (A ^ B) | ((A ^ Cst) ^ B). Our existing patterns fail once
this happens.
To fix this, we add a new pattern which looks through the tree of xor
binary operators to see that, in fact, there exists a redundant xor
operation.
What follows bellow is a correctness proof of the transform using CVC3.
$ cat t.cvc
A, B, C : BITVECTOR(64);
QUERY BVXOR(A, B) | BVXOR(BVXOR(B, C), A) = BVXOR(A, B) | C;
QUERY BVXOR(BVXOR(A, C), B) | BVXOR(A, B) = BVXOR(A, B) | C;
QUERY BVXOR(A, B) & BVXOR(BVXOR(B, C), A) = BVXOR(A, B) & ~C;
QUERY BVXOR(BVXOR(A, C), B) & BVXOR(A, B) = BVXOR(A, B) & ~C;
$ cvc3 < t.cvc
Valid.
Valid.
Valid.
Valid.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@214342 91177308-0d34-0410-b5e6-96231b3b80d8
2014-07-30 21:26:37 +00:00
|
|
|
|
|
|
|
define i32 @test10(i32 %A, i32 %B) {
|
|
|
|
%xor1 = xor i32 %B, %A
|
|
|
|
%not = xor i32 %A, -1
|
|
|
|
%xor2 = xor i32 %not, %B
|
|
|
|
%or = or i32 %xor1, %xor2
|
|
|
|
ret i32 %or
|
|
|
|
; CHECK-LABEL: @test10(
|
|
|
|
; CHECK-NEXT: ret i32 -1
|
|
|
|
}
|
|
|
|
|
|
|
|
define i32 @test11(i32 %A, i32 %B) {
|
|
|
|
%xor1 = xor i32 %B, %A
|
|
|
|
%not = xor i32 %A, -1
|
|
|
|
%xor2 = xor i32 %not, %B
|
|
|
|
%or = or i32 %xor1, %xor2
|
|
|
|
ret i32 %or
|
|
|
|
; CHECK-LABEL: @test11(
|
|
|
|
; CHECK-NEXT: ret i32 -1
|
|
|
|
}
|
2014-08-01 04:59:26 +00:00
|
|
|
|
|
|
|
; (x | y) & ((~x) ^ y) -> (x & y)
|
|
|
|
define i32 @test12(i32 %x, i32 %y) {
|
|
|
|
%or = or i32 %x, %y
|
|
|
|
%neg = xor i32 %x, -1
|
|
|
|
%xor = xor i32 %neg, %y
|
|
|
|
%and = and i32 %or, %xor
|
|
|
|
ret i32 %and
|
|
|
|
; CHECK-LABEL: @test12(
|
|
|
|
; CHECK-NEXT: %and = and i32 %x, %y
|
|
|
|
; CHECK-NEXT: ret i32 %and
|
|
|
|
}
|
|
|
|
|
|
|
|
; ((~x) ^ y) & (x | y) -> (x & y)
|
|
|
|
define i32 @test13(i32 %x, i32 %y) {
|
|
|
|
%neg = xor i32 %x, -1
|
|
|
|
%xor = xor i32 %neg, %y
|
|
|
|
%or = or i32 %x, %y
|
|
|
|
%and = and i32 %xor, %or
|
|
|
|
ret i32 %and
|
|
|
|
; CHECK-LABEL: @test13(
|
|
|
|
; CHECK-NEXT: %and = and i32 %x, %y
|
|
|
|
; CHECK-NEXT: ret i32 %and
|
|
|
|
}
|
2014-08-13 05:13:14 +00:00
|
|
|
|
|
|
|
; ((x | y) ^ (x ^ y)) -> (x & y)
|
|
|
|
define i32 @test15(i32 %x, i32 %y) {
|
|
|
|
%1 = xor i32 %y, %x
|
|
|
|
%2 = or i32 %y, %x
|
|
|
|
%3 = xor i32 %2, %1
|
|
|
|
ret i32 %3
|
|
|
|
; CHECK-LABEL: @test15(
|
|
|
|
; CHECK-NEXT: %1 = and i32 %y, %x
|
|
|
|
; CHECK-NEXT: ret i32 %1
|
|
|
|
}
|
2014-08-14 06:46:25 +00:00
|
|
|
|
|
|
|
; ((x | ~y) ^ (~x | y)) -> x ^ y
|
|
|
|
define i32 @test16(i32 %x, i32 %y) {
|
|
|
|
%noty = xor i32 %y, -1
|
|
|
|
%notx = xor i32 %x, -1
|
|
|
|
%or1 = or i32 %x, %noty
|
|
|
|
%or2 = or i32 %notx, %y
|
|
|
|
%xor = xor i32 %or1, %or2
|
|
|
|
ret i32 %xor
|
|
|
|
; CHECK-LABEL: @test16(
|
|
|
|
; CHECK-NEXT: %xor = xor i32 %x, %y
|
|
|
|
; CHECK-NEXT: ret i32 %xor
|
|
|
|
}
|
2014-08-19 08:19:19 +00:00
|
|
|
|
|
|
|
; ((x & ~y) ^ (~x & y)) -> x ^ y
|
|
|
|
define i32 @test17(i32 %x, i32 %y) {
|
|
|
|
%noty = xor i32 %y, -1
|
|
|
|
%notx = xor i32 %x, -1
|
|
|
|
%and1 = and i32 %x, %noty
|
|
|
|
%and2 = and i32 %notx, %y
|
|
|
|
%xor = xor i32 %and1, %and2
|
|
|
|
ret i32 %xor
|
|
|
|
; CHECK-LABEL: @test17(
|
|
|
|
; CHECK-NEXT: %xor = xor i32 %x, %y
|
|
|
|
; CHECK-NEXT: ret i32 %xor
|
|
|
|
}
|
2014-08-21 05:14:48 +00:00
|
|
|
|
|
|
|
define i32 @test18(i32 %a, i32 %b) {
|
|
|
|
%or = xor i32 %a, %b
|
|
|
|
%and1 = and i32 %or, 1
|
|
|
|
%and2 = and i32 %b, -2
|
|
|
|
%xor = or i32 %and1, %and2
|
|
|
|
ret i32 %xor
|
|
|
|
}
|