From: Dan Gohman <gohman@apple.com>
Date: Wed, 6 May 2009 22:54:33 +0000 (+0000)
Subject: Use stable_sort instead of plain sort to avoid the risk of generating
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=0a8eb57c3d57a79f382b8db32059ea3689f7a076;p=oota-llvm.git

Use stable_sort instead of plain sort to avoid the risk of generating
trivially different code on different hosts (due to differing
std::sort implementations).


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@71124 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/lib/Analysis/ScalarEvolution.cpp b/lib/Analysis/ScalarEvolution.cpp
index 1b3aae87895..50cece03657 100644
--- a/lib/Analysis/ScalarEvolution.cpp
+++ b/lib/Analysis/ScalarEvolution.cpp
@@ -472,7 +472,7 @@ static void GroupByComplexity(std::vector<SCEVHandle> &Ops) {
   }
 
   // Do the rough sort by complexity.
-  std::sort(Ops.begin(), Ops.end(), SCEVComplexityCompare());
+  std::stable_sort(Ops.begin(), Ops.end(), SCEVComplexityCompare());
 
   // Now that we are sorted by complexity, group elements of the same
   // complexity.  Note that this is, at worst, N^2, but the vector is likely to