We don't need to sort the added vector as unhandled intervals are

stored in a binary heap.

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

diff --git a/lib/CodeGen/RegAllocLinearScan.cpp b/lib/CodeGen/RegAllocLinearScan.cpp
index 8736a236755083b91d3aa18c9a9919e6506a5fd9..0204494fd65b918c0e07a1f5a306ca823e7e3694 100644 (file)
--- a/lib/CodeGen/RegAllocLinearScan.cpp
+++ b/lib/CodeGen/RegAllocLinearScan.cpp
@@ -515,7 +515,6 @@ void RA::assignRegOrStackSlotAtInterval(LiveInterval* cur)
     }
   }
 
-  std::sort(added.begin(), added.end(), less_ptr<LiveInterval>());
   // merge added with unhandled
   for (unsigned i = 0, e = added.size(); i != e; ++i)
     unhandled_.push(added[i]);