From 3e6719c133f87f1c3d8d9085181fed85d33fd93d Mon Sep 17 00:00:00 2001 From: Benjamin Kramer Date: Mon, 26 Mar 2012 14:17:26 +0000 Subject: No need to do an expensive stable sort for a bunch of integers. llvm-svn: 153438 --- llvm/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'llvm/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp') diff --git a/llvm/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp b/llvm/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp index 8370f5f0fc7..660684d1bea 100644 --- a/llvm/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp +++ b/llvm/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp @@ -15,6 +15,7 @@ #include "DwarfDebug.h" #include "DIE.h" #include "llvm/ADT/Twine.h" +#include "llvm/ADT/STLExtras.h" #include "llvm/CodeGen/AsmPrinter.h" #include "llvm/MC/MCExpr.h" #include "llvm/MC/MCStreamer.h" @@ -68,11 +69,10 @@ void DwarfAccelTable::AddName(StringRef Name, DIE* die, char Flags) { void DwarfAccelTable::ComputeBucketCount(void) { // First get the number of unique hashes. - std::vector uniques; - uniques.resize(Data.size()); + std::vector uniques(Data.size()); for (size_t i = 0, e = Data.size(); i < e; ++i) uniques[i] = Data[i]->HashValue; - std::stable_sort(uniques.begin(), uniques.end()); + array_pod_sort(uniques.begin(), uniques.end()); std::vector::iterator p = std::unique(uniques.begin(), uniques.end()); uint32_t num = std::distance(uniques.begin(), p); -- cgit v1.2.3