maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[InstSimplify] improve function name; NFC 

llvm-svn: 289332
This commit is contained in:
Sanjay Patel 2016-12-10 17:40:47 +00:00
parent edd7a7bb40
commit 35289c62a8
1 changed files with 6 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
llvm/lib/Analysis/InstructionSimplify.cpp
View File

@ -2804,9 +2804,11 @@ static Value *simplifyICmpWithBinOp(CmpInst::Predicate Pred, Value *LHS,
return nullptr; return nullptr;
} }
/// Simplify comparisons corresponding to integer min/max idioms. /// Simplify integer comparisons where at least one operand of the compare
static Value *simplifyMinMax(CmpInst::Predicate Pred, Value *LHS, Value *RHS, /// matches an integer min/max idiom.
const Query &Q, unsigned MaxRecurse) { static Value *simplifyICmpWithMinMax(CmpInst::Predicate Pred, Value *LHS,
Value *RHS, const Query &Q,
unsigned MaxRecurse) {
Type *ITy = GetCompareTy(LHS); // The return type. Type *ITy = GetCompareTy(LHS); // The return type.
Value *A, *B; Value *A, *B;
CmpInst::Predicate P = CmpInst::BAD_ICMP_PREDICATE; CmpInst::Predicate P = CmpInst::BAD_ICMP_PREDICATE;
@ -3233,7 +3235,7 @@ static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS,
if (Value *V = simplifyICmpWithBinOp(Pred, LHS, RHS, Q, MaxRecurse)) if (Value *V = simplifyICmpWithBinOp(Pred, LHS, RHS, Q, MaxRecurse))
return V; return V;
if (Value *V = simplifyMinMax(Pred, LHS, RHS, Q, MaxRecurse)) if (Value *V = simplifyICmpWithMinMax(Pred, LHS, RHS, Q, MaxRecurse))
return V; return V;
// Simplify comparisons of related pointers using a powerful, recursive // Simplify comparisons of related pointers using a powerful, recursive