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

use 'match' to simplify some code. 

llvm-svn: 92400
This commit is contained in:
Chris Lattner 2010-01-01 22:12:03 +00:00
parent 27da15ba8e
commit 9d4c5414bb
1 changed files with 5 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -2949,12 +2949,11 @@ Instruction *InstCombiner::visitSub(BinaryOperator &I) {
// Optimize pointer differences into the same array into a size. Consider:
// &A[10] - &A[0]: we should compile this to "10".
if (TD) {
if (PtrToIntInst *LHS = dyn_cast<PtrToIntInst>(Op0))
if (PtrToIntInst *RHS = dyn_cast<PtrToIntInst>(Op1))
if (Value *Res = OptimizePointerDifference(LHS->getOperand(0),
RHS->getOperand(0),
I.getType()))
return ReplaceInstUsesWith(I, Res);
Value *LHSOp, *RHSOp;
if (match(Op0, m_Cast<PtrToIntInst>(m_Value(LHSOp))) &&
match(Op1, m_Cast<PtrToIntInst>(m_Value(RHSOp))))
if (Value *Res = OptimizePointerDifference(LHSOp, RHSOp, I.getType()))
return ReplaceInstUsesWith(I, Res);
// trunc(p)-trunc(q) -> trunc(p-q)
if (TruncInst *LHST = dyn_cast<TruncInst>(Op0))