RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-11-30 07:00:57 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

- instcombine demorgan's law: and (not A), (not B) == not (or A, B)

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3495 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2002-08-23 18:32:43 +00:00
parent 31901f80f8
commit e6f9a91618
1 changed files with 12 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -81,6 +81,8 @@ namespace {
// in the program. Add the new instruction to the worklist.
//
void InsertNewInstBefore(Instruction *New, Instruction &Old) {
assert(New && New->getParent() == 0 &&
"New instruction already inserted into a basic block!");
BasicBlock *BB = Old.getParent();
BB->getInstList().insert(&Old, New); // Insert inst
WorkList.push_back(New); // Add to worklist
@ -292,6 +294,16 @@ Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
if (RHS->isAllOnesValue())
return ReplaceInstUsesWith(I, Op0);
// and (not A), (not B) == not (or A, B)
if (Op0->use_size() == 1 && Op1->use_size() == 1)
if (Value *A = dyn_castNotInst(Op0))
if (Value *B = dyn_castNotInst(Op1)) {
Instruction *Or = BinaryOperator::create(Instruction::Or, A, B,
I.getName()+".demorgan");
InsertNewInstBefore(Or, I);
return BinaryOperator::createNot(Or, I.getName());
}
return Changed ? &I : 0;
}