[InstSimplify] Teach SimplifyAddInst and SimplifySubInst that vectors of i1 can be treated as Xor too.

llvm-svn: 299626
This commit is contained in:
Craig Topper 2017-04-06 05:28:41 +00:00
parent 5dc5a8e5be
commit aa5f524095
2 changed files with 38 additions and 2 deletions

View File

@ -579,7 +579,7 @@ static Value *SimplifyAddInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
return Y;
/// i1 add -> xor.
if (MaxRecurse && Op0->getType()->isIntegerTy(1))
if (MaxRecurse && Op0->getType()->getScalarType()->isIntegerTy(1))
if (Value *V = SimplifyXorInst(Op0, Op1, Q, MaxRecurse-1))
return V;
@ -796,7 +796,7 @@ static Value *SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
return ConstantExpr::getIntegerCast(Result, Op0->getType(), true);
// i1 sub -> xor.
if (MaxRecurse && Op0->getType()->isIntegerTy(1))
if (MaxRecurse && Op0->getType()->getScalarType()->isIntegerTy(1))
if (Value *V = SimplifyXorInst(Op0, Op1, Q, MaxRecurse-1))
return V;

View File

@ -0,0 +1,36 @@
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py
; RUN: opt < %s -instsimplify -S | FileCheck %s
define i1 @test1(i1 %a) {
; CHECK-LABEL: @test1(
; CHECK-NEXT: ret i1 true
;
%b = xor i1 %a, true
%res = sub i1 %a, %b
ret i1 %res
}
define <2 x i1> @test2(<2 x i1> %a) {
; CHECK-LABEL: @test2(
; CHECK-NEXT: ret <2 x i1> <i1 true, i1 true>
;
%b = xor <2 x i1> %a, <i1 true, i1 true>
%res = sub <2 x i1> %a, %b
ret <2 x i1> %res
}
define i1 @test5(i1 %a) {
; CHECK-LABEL: @test5(
; CHECK-NEXT: ret i1 false
;
%res = add i1 %a, %a
ret i1 %res
}
define <2 x i1> @test6(<2 x i1> %a) {
; CHECK-LABEL: @test6(
; CHECK-NEXT: ret <2 x i1> zeroinitializer
;
%res = add <2 x i1> %a, %a
ret <2 x i1> %res
}