maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Handle a special case xor undef, undef -> 0. Technically this should be transformed to undef. But this is such a common idiom (misuse) we are going to handle it. 

llvm-svn: 48791
This commit is contained in:
Evan Cheng 2008-03-25 20:07:13 +00:00
parent 4c1559f54e
commit 2b72c05992
2 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
llvm/lib/Transforms/Scalar/InstructionCombining.cpp
View File

@ -4425,8 +4425,13 @@ Instruction *InstCombiner::visitXor(BinaryOperator &I) {
bool Changed = SimplifyCommutative(I);
Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
if (isa<UndefValue>(Op1))
if (isa<UndefValue>(Op1)) {
if (isa<UndefValue>(Op0))
// Handle undef ^ undef -> 0 special case. This is a common
// idiom (misuse).
return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
return ReplaceInstUsesWith(I, Op1); // X ^ undef -> undef
}
// xor X, X = 0, even if X is nested in a sequence of Xor's.
if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) {

6
llvm/test/Transforms/InstCombine/xor-undef.ll Normal file
View File

@ -0,0 +1,6 @@
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep zeroinitializer
define <2 x i64> @f() {
%tmp = xor <2 x i64> undef, undef
ret <2 x i64> %tmp
}