RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-04-04 09:11:43 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Add new transformation: // (~A | ~B) == (~(A & B))

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@5738 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-03-10 23:13:59 +00:00
parent 0cec701eb2
commit a27231acc0
1 changed files with 19 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
lib/Transforms/Scalar/InstructionCombining.cpp
View File

@ -446,6 +446,7 @@ Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
Instruction *Or = BinaryOperator::create(Instruction::Or, Op0NotVal, Instruction *Or = BinaryOperator::create(Instruction::Or, Op0NotVal,
Op1NotVal,I.getName()+".demorgan", Op1NotVal,I.getName()+".demorgan",
&I); &I);
WorkList.push_back(Or);
return BinaryOperator::createNot(Or); return BinaryOperator::createNot(Or);
} }
@ -470,15 +471,25 @@ Instruction *InstCombiner::visitOr(BinaryOperator &I) {
if (RHS->isAllOnesValue()) if (RHS->isAllOnesValue())
return ReplaceInstUsesWith(I, Op1); return ReplaceInstUsesWith(I, Op1);
if (Value *X = dyn_castNotVal(Op0)) // ~A | A == -1 Value *Op0NotVal = dyn_castNotVal(Op0);
if (X == Op1) Value *Op1NotVal = dyn_castNotVal(Op1);
return ReplaceInstUsesWith(I,
ConstantIntegral::getAllOnesValue(I.getType()));
if (Value *X = dyn_castNotVal(Op1)) // A | ~A == -1 if (Op1 == Op0NotVal) // ~A | A == -1
if (X == Op0) return ReplaceInstUsesWith(I,
return ReplaceInstUsesWith(I, ConstantIntegral::getAllOnesValue(I.getType()));
ConstantIntegral::getAllOnesValue(I.getType()));
if (Op0 == Op1NotVal) // A | ~A == -1
return ReplaceInstUsesWith(I,
ConstantIntegral::getAllOnesValue(I.getType()));
// (~A | ~B) == (~(A & B)) - Demorgan's Law
if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
Instruction *And = BinaryOperator::create(Instruction::And, Op0NotVal,
Op1NotVal,I.getName()+".demorgan",
&I);
WorkList.push_back(And);
return BinaryOperator::createNot(And);
}
return Changed ? &I : 0; return Changed ? &I : 0;
} }