RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-12-28 23:43:50 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Replace a hand-written suffix compare with std::lexicographical_compare.

Browse Source 
No functionality change.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@218380 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Benjamin Kramer 2014-09-24 13:19:28 +00:00
parent 10cd8098a7
commit 7a27231780
1 changed files with 6 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
lib/MC/StringTableBuilder.cpp
View File

@ -12,25 +12,17 @@
using namespace llvm;
static bool compareBySuffix(StringRef a, StringRef b) {
size_t sizeA = a.size();
size_t sizeB = b.size();
size_t len = std::min(sizeA, sizeB);
for (size_t i = 0; i < len; ++i) {
char ca = a[sizeA - i - 1];
char cb = b[sizeB - i - 1];
if (ca != cb)
return ca > cb;
}
return sizeA > sizeB;
}
void StringTableBuilder::finalize() {
SmallVector<StringRef, 8> Strings;
for (auto i = StringIndexMap.begin(), e = StringIndexMap.end(); i != e; ++i)
Strings.push_back(i->getKey());
std::sort(Strings.begin(), Strings.end(), compareBySuffix);
// Sort the vector so a string is sorted above its suffixes.
std::sort(Strings.begin(), Strings.end(), [](StringRef A, StringRef B) {
typedef std::reverse_iterator<StringRef::iterator> Reverse;
return !std::lexicographical_compare(Reverse(A.end()), Reverse(A.begin()),
Reverse(B.end()), Reverse(B.begin()));
});
// FIXME: Starting with a null byte is ELF specific. Generalize this so we
// can use the class with other object formats.