From 0a8eb57c3d57a79f382b8db32059ea3689f7a076 Mon Sep 17 00:00:00 2001 From: Dan Gohman Date: Wed, 6 May 2009 22:54:33 +0000 Subject: [PATCH] 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 --- lib/Analysis/ScalarEvolution.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) 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 &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 -- 2.34.1