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).

llvm-svn: 71124

1 files changed, 1 insertions, 1 deletions

diff --git a/llvm/lib/Analysis/ScalarEvolution.cpp b/llvm/lib/Analysis/ScalarEvolution.cpp
index 1b3aae87895..50cece03657 100644
--- a/llvm/lib/Analysis/ScalarEvolution.cpp
+++ b/llvm/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