From be3f051c49699a86d526833d7dbe95645680a340 Mon Sep 17 00:00:00 2001 From: Benjamin Kramer Date: Mon, 26 Mar 2012 14:17:26 +0000 Subject: [PATCH] No need to do an expensive stable sort for a bunch of integers. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153438 91177308-0d34-0410-b5e6-96231b3b80d8 --- lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp b/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp index 8370f5f0fc7..660684d1bea 100644 --- a/lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp +++ b/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); -- 2.34.1