6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-16 11:30:51 +00:00
Code Issues Projects Releases Wiki Activity

factor a bunch of copy/paste code out into a helper function.

Browse Source 
Eliminate the cases checking for cond?0:-1, since that is already
handled by commutative checking.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@59388 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2008-11-16 04:24:12 +00:00
parent f5b55475b3
commit faaf951fab
1 changed files with 35 additions and 61 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -4205,6 +4205,33 @@ Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
return CallInst::Create(F, V); return CallInst::Create(F, V);
} }
/// MatchSelectFromAndOr - We have an expression of the form (A&C)|(B&D). Check
/// If A is (cond?-1:0) and either B or D is ~(cond?-1,0) or (cond?0,-1), then
/// we can simplify this expression to "cond ? C : D or B".
static Instruction *MatchSelectFromAndOr(Value *A, Value *B,
Value *C, Value *D) {
// If A is not a select of constants, this can't match.
Value *Cond = 0, *Cond2 = 0;
ConstantInt *C1, *C2;
if (!match(A, m_Select(m_Value(Cond), m_ConstantInt(C1), m_ConstantInt(C2))))
return 0;
#define SELECT_MATCH(Val, I1, I2) \
m_Select(m_Value(Val), m_ConstantInt(I1), m_ConstantInt(I2))
// Handle "cond ? -1 : 0".
if (C1->isAllOnesValue() && C2->isZero()) {
// ((cond?-1:0)&C) | (B&(cond?0:-1)) -> cond ? C : B.
if (match(D, m_Not(SELECT_MATCH(Cond2, -1, 0))) && Cond2 == Cond)
return SelectInst::Create(Cond, C, B);
// ((cond?-1:0)&C) | ((cond?0:-1)&D) -> cond ? C : D.
if (match(B, m_Not(SELECT_MATCH(Cond2, -1, 0))) && Cond2 == Cond)
return SelectInst::Create(Cond, C, D);
}
#undef SELECT_MATCH
return 0;
}
Instruction *InstCombiner::visitOr(BinaryOperator &I) { Instruction *InstCombiner::visitOr(BinaryOperator &I) {
bool Changed = SimplifyCommutative(I); bool Changed = SimplifyCommutative(I);
@ -4354,68 +4381,15 @@ Instruction *InstCombiner::visitOr(BinaryOperator &I) {
} }
} }
#define SELECT_MATCH(Val, I1, I2) \
m_Select(m_Value(Val), m_ConstantInt(I1), m_ConstantInt(I2))
// (A & (C0?-1:0)) | (B & ~(C0?-1:0)) -> C0 ? A : B, and commuted variants // (A & (C0?-1:0)) | (B & ~(C0?-1:0)) -> C0 ? A : B, and commuted variants
Value *C0 = 0; if (Instruction *Match = MatchSelectFromAndOr(A, B, C, D))
if (match(A, SELECT_MATCH(C0, -1, 0))) { return Match;
Value *C1 = 0; if (Instruction *Match = MatchSelectFromAndOr(B, A, D, C))
if (match(D, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0) return Match;
return SelectInst::Create(C1, C, B); if (Instruction *Match = MatchSelectFromAndOr(C, B, A, D))
if (match(B, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0) return Match;
return SelectInst::Create(C1, C, D); if (Instruction *Match = MatchSelectFromAndOr(D, A, B, C))
} return Match;
if (match(A, SELECT_MATCH(C0, 0, -1))) {
Value *C1 = 0;
if (match(D, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, B, C);
if (match(B, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, D, C);
}
if (match(B, SELECT_MATCH(C0, -1, 0))) {
Value *C1 = 0;
if (match(C, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0)
return SelectInst::Create(C1, A, D);
if (match(A, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0)
return SelectInst::Create(C1, C, D);
}
if (match(B, SELECT_MATCH(C0, 0, -1))) {
Value *C1 = 0;
if (match(C, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, D, A);
if (match(A, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, D, C);
}
if (match(C, SELECT_MATCH(C0, -1, 0))) {
Value *C1 = 0;
if (match(D, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0)
return SelectInst::Create(C1, A, B);
if (match(B, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0)
return SelectInst::Create(C1, A, D);
}
if (match(C, SELECT_MATCH(C0, 0, -1))) {
Value *C1 = 0;
if (match(D, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, B, A);
if (match(B, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, D, A);
}
if (match(D, SELECT_MATCH(C0, -1, 0))) {
Value *C1 = 0;
if (match(C, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0)
return SelectInst::Create(C1, A, B);
if (match(A, m_Not(SELECT_MATCH(C1, -1, 0))) && C1 == C0)
return SelectInst::Create(C1, C, B);
}
if (match(D, SELECT_MATCH(C0, 0, -1))) {
Value *C1 = 0;
if (match(C, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, B, A);
if (match(A, m_Not(SELECT_MATCH(C1, 0, -1))) && C1 == C0)
return SelectInst::Create(C1, B, C);
}
#undef SELECT_MATCH
} }
// (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts. // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.