diff options
author | Duncan Sands <baldrick@free.fr> | 2011-02-07 09:36:32 +0000 |
---|---|---|
committer | Duncan Sands <baldrick@free.fr> | 2011-02-07 09:36:32 +0000 |
commit | 163a84bbce69947aa314760e6068c704fc0df7a0 (patch) | |
tree | 4c45912de2fe18eee154b43593182969e3479ce7 | |
parent | 1dbf0df996bba398a70abccc714b1a9652330014 (diff) |
Add an m_Div pattern for matching either a udiv or an sdiv and use it
to simplify the "(X/Y)*Y->X when the division is exact" transform.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@125004 91177308-0d34-0410-b5e6-96231b3b80d8
-rw-r--r-- | include/llvm/Support/PatternMatch.h | 34 | ||||
-rw-r--r-- | lib/Analysis/InstructionSimplify.cpp | 6 |
2 files changed, 36 insertions, 4 deletions
diff --git a/include/llvm/Support/PatternMatch.h b/include/llvm/Support/PatternMatch.h index cb94fe5f6e..2d5ca8e3cf 100644 --- a/include/llvm/Support/PatternMatch.h +++ b/include/llvm/Support/PatternMatch.h @@ -347,6 +347,40 @@ inline Shr_match<LHS, RHS> m_Shr(const LHS &L, const RHS &R) { } //===----------------------------------------------------------------------===// +// Matchers for either SDiv or UDiv .. for convenience +// +template<typename LHS_t, typename RHS_t, typename ConcreteTy = BinaryOperator> +struct Div_match { + LHS_t L; + RHS_t R; + + Div_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} + + template<typename OpTy> + bool match(OpTy *V) { + if (V->getValueID() == Value::InstructionVal + Instruction::SDiv || + V->getValueID() == Value::InstructionVal + Instruction::UDiv) { + ConcreteTy *I = cast<ConcreteTy>(V); + return (I->getOpcode() == Instruction::UDiv || + I->getOpcode() == Instruction::SDiv) && + L.match(I->getOperand(0)) && + R.match(I->getOperand(1)); + } + if (ConstantExpr *CE = dyn_cast<ConstantExpr>(V)) + return (CE->getOpcode() == Instruction::SDiv || + CE->getOpcode() == Instruction::UDiv) && + L.match(CE->getOperand(0)) && + R.match(CE->getOperand(1)); + return false; + } +}; + +template<typename LHS, typename RHS> +inline Div_match<LHS, RHS> m_Div(const LHS &L, const RHS &R) { + return Div_match<LHS, RHS>(L, R); +} + +//===----------------------------------------------------------------------===// // Matchers for binary classes // diff --git a/lib/Analysis/InstructionSimplify.cpp b/lib/Analysis/InstructionSimplify.cpp index 7bb8f69992..2b217e1446 100644 --- a/lib/Analysis/InstructionSimplify.cpp +++ b/lib/Analysis/InstructionSimplify.cpp @@ -734,10 +734,8 @@ static Value *SimplifyMulInst(Value *Op0, Value *Op1, const TargetData *TD, // (X / Y) * Y -> X if the division is exact. Value *X = 0, *Y = 0; - if ((match(Op0, m_SDiv(m_Value(X), m_Value(Y))) && Y == Op1) || // (X / Y) * Y - (match(Op0, m_UDiv(m_Value(X), m_Value(Y))) && Y == Op1) || - (match(Op1, m_SDiv(m_Value(X), m_Value(Y))) && Y == Op0) || // Y * (X / Y) - (match(Op1, m_UDiv(m_Value(X), m_Value(Y))) && Y == Op0)) { + if ((match(Op0, m_Div(m_Value(X), m_Value(Y))) && Y == Op1) || // (X / Y) * Y + (match(Op1, m_Div(m_Value(X), m_Value(Y))) && Y == Op0)) { // Y * (X / Y) BinaryOperator *Div = cast<BinaryOperator>(Y == Op1 ? Op0 : Op1); if (Div->isExact()) return X; |