6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-06 23:32:27 +00:00
Code Issues Projects Releases Wiki Activity

No need to do an expensive stable sort for a bunch of integers.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@153438 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Benjamin Kramer 2012-03-26 14:17:26 +00:00
parent 5dc8055667
commit be3f051c49
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/CodeGen/AsmPrinter/DwarfAccelTable.cpp
View File

@ -15,6 +15,7 @@
#include "DwarfDebug.h" #include "DwarfDebug.h"
#include "DIE.h" #include "DIE.h"
#include "llvm/ADT/Twine.h" #include "llvm/ADT/Twine.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/CodeGen/AsmPrinter.h" #include "llvm/CodeGen/AsmPrinter.h"
#include "llvm/MC/MCExpr.h" #include "llvm/MC/MCExpr.h"
#include "llvm/MC/MCStreamer.h" #include "llvm/MC/MCStreamer.h"
@ -68,11 +69,10 @@ void DwarfAccelTable::AddName(StringRef Name, DIE* die, char Flags) {
void DwarfAccelTable::ComputeBucketCount(void) { void DwarfAccelTable::ComputeBucketCount(void) {
// First get the number of unique hashes. // First get the number of unique hashes.
std::vector<uint32_t> uniques; std::vector<uint32_t> uniques(Data.size());
uniques.resize(Data.size());
for (size_t i = 0, e = Data.size(); i < e; ++i) for (size_t i = 0, e = Data.size(); i < e; ++i)
uniques[i] = Data[i]->HashValue; uniques[i] = Data[i]->HashValue;
std::stable_sort(uniques.begin(), uniques.end()); array_pod_sort(uniques.begin(), uniques.end());
std::vector<uint32_t>::iterator p = std::vector<uint32_t>::iterator p =
std::unique(uniques.begin(), uniques.end()); std::unique(uniques.begin(), uniques.end());
uint32_t num = std::distance(uniques.begin(), p); uint32_t num = std::distance(uniques.begin(), p);