replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

simplify these patterns using m_Specific. No need to grep for 

xor in testcase (or is a substring).

llvm-svn: 60328
This commit is contained in:
Chris Lattner 2008-12-01 05:16:26 +00:00
parent 88a1f0213d
commit 9e6b243428
2 changed files with 7 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -3980,22 +3980,12 @@ Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
}
// (A&((~A)|B)) -> A&B
if (match(Op0, m_Or(m_Not(m_Value(A)), m_Value(B)))) {
if (A == Op1)
return BinaryOperator::CreateAnd(A, B);
}
if (match(Op0, m_Or(m_Value(A), m_Not(m_Value(B))))) {
if (B == Op1)
return BinaryOperator::CreateAnd(A, B);
}
if (match(Op1, m_Or(m_Not(m_Value(A)), m_Value(B)))) {
if (A == Op0)
return BinaryOperator::CreateAnd(A, B);
}
if (match(Op1, m_Or(m_Value(A), m_Not(m_Value(B))))) {
if (B == Op0)
return BinaryOperator::CreateAnd(A, B);
}
if (match(Op0, m_Or(m_Not(m_Specific(Op1)), m_Value(A))) ||
match(Op0, m_Or(m_Value(A), m_Not(m_Specific(Op1)))))
return BinaryOperator::CreateAnd(A, Op1);
if (match(Op1, m_Or(m_Not(m_Specific(Op0)), m_Value(A))) ||
match(Op1, m_Or(m_Value(A), m_Not(m_Specific(Op0)))))
return BinaryOperator::CreateAnd(A, Op0);
}
if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1)) {

4
llvm/test/Transforms/InstCombine/and-not-or.ll
View File

@ -1,6 +1,4 @@
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {and i32 %y, %x} | count 2
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {and i32 %x, %y} | count 2
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep {xor}
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | grep {and i32 %x, %y} | count 4
; RUN: llvm-as < %s | opt -instcombine | llvm-dis | not grep {or}
define i32 @func1(i32 %x, i32 %y) nounwind {