Fix inverted condition noticed by Frits van Bommel.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122331 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Duncan Sands 2010-12-21 14:48:48 +00:00
parent 82fdab3358
commit 75d289ed62

View File

@ -491,7 +491,7 @@ static Value *SimplifyAddInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
return Constant::getAllOnesValue(Op0->getType());
/// i1 add -> xor.
if (!MaxRecurse && Op0->getType()->isIntegerTy(1))
if (MaxRecurse && Op0->getType()->isIntegerTy(1))
return SimplifyXorInst(Op0, Op1, TD, DT, MaxRecurse-1);
// Try some generic simplifications for associative operations.
@ -554,7 +554,7 @@ static Value *SimplifySubInst(Value *Op0, Value *Op1, bool isNSW, bool isNUW,
return X;
/// i1 sub -> xor.
if (!MaxRecurse && Op0->getType()->isIntegerTy(1))
if (MaxRecurse && Op0->getType()->isIntegerTy(1))
return SimplifyXorInst(Op0, Op1, TD, DT, MaxRecurse-1);
// Mul distributes over Sub. Try some generic simplifications based on this.
@ -607,7 +607,7 @@ static Value *SimplifyMulInst(Value *Op0, Value *Op1, const TargetData *TD,
return Op0;
/// i1 mul -> and.
if (!MaxRecurse && Op0->getType()->isIntegerTy(1))
if (MaxRecurse && Op0->getType()->isIntegerTy(1))
return SimplifyAndInst(Op0, Op1, TD, DT, MaxRecurse-1);
// Try some generic simplifications for associative operations.