RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-24 03:33:20 +01:00
Code Issues Projects Releases Wiki Activity

Use array_pod_sort. NFC.

Browse Source 
llvm-svn: 251023
This commit is contained in:
Rafael Espindola 2015-10-22 15:15:44 +00:00
parent 971263016a
commit 9177054c04
1 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
lib/MC/StringTableBuilder.cpp
View File

@ -9,12 +9,15 @@
#include "llvm/MC/StringTableBuilder.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/Support/COFF.h"
#include "llvm/Support/Endian.h"
using namespace llvm;
static bool compareBySuffix(StringRef a, StringRef b) {
static int compareBySuffix(const StringRef *AP, const StringRef *BP) {
StringRef a = *AP;
StringRef b = *BP;
size_t sizeA = a.size();
size_t sizeB = b.size();
size_t len = std::min(sizeA, sizeB);
@ -22,9 +25,9 @@ static bool compareBySuffix(StringRef a, StringRef b) {
char ca = a[sizeA - i - 1];
char cb = b[sizeB - i - 1];
if (ca != cb)
return ca > cb;
return cb - ca;
}
return sizeA > sizeB;
return sizeB - sizeA;
}
void StringTableBuilder::finalize(Kind kind) {
@ -34,7 +37,7 @@ void StringTableBuilder::finalize(Kind kind) {
for (auto i = StringIndexMap.begin(), e = StringIndexMap.end(); i != e; ++i)
Strings.push_back(i->getKey());
std::sort(Strings.begin(), Strings.end(), compareBySuffix);
array_pod_sort(Strings.begin(), Strings.end(), compareBySuffix);
switch (kind) {
case ELF: