make qsort predicate more conformant by returning 0 for equal values.

llvm-svn: 121838
This commit is contained in:
Chris Lattner 2010-12-15 04:52:41 +00:00
parent 89dcb687bc
commit e893e2601e
1 changed files with 5 additions and 1 deletions

View File

@ -592,7 +592,11 @@ namespace {
static int ConstantIntSortPredicate(const void *P1, const void *P2) {
const ConstantInt *LHS = *(const ConstantInt**)P1;
const ConstantInt *RHS = *(const ConstantInt**)P2;
return LHS->getValue().ult(RHS->getValue()) ? 1 : -1;
if (LHS->getValue().ult(RHS->getValue()))
return 1;
if (LHS->getValue() == RHS->getValue())
return 0;
return -1;
}
/// FoldValueComparisonIntoPredecessors - The specified terminator is a value