RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2025-04-03 16:51:42 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix the variable names to match the LLVM style.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@251143 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Rafael Espindola 2015-10-23 20:15:35 +00:00
parent cf0160bc3b
commit 89cb1b78f9
2 changed files with 30 additions and 30 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
include/llvm/MC/StringTableBuilder.h
View File

@ -24,7 +24,7 @@ class StringTableBuilder {
public: public:
/// \brief Add a string to the builder. Returns a StringRef to the internal /// \brief Add a string to the builder. Returns a StringRef to the internal
/// copy of s. Can only be used before the table is finalized. /// copy of s. Can only be used before the table is finalized.
void add(StringRef s); void add(StringRef S);
enum Kind { enum Kind {
ELF, ELF,
@ -34,7 +34,7 @@ public:
/// \brief Analyze the strings and build the final table. No more strings can /// \brief Analyze the strings and build the final table. No more strings can
/// be added after this point. /// be added after this point.
void finalize(Kind kind); void finalize(Kind K);
/// \brief Retrieve the string table data. Can only be used after the table /// \brief Retrieve the string table data. Can only be used after the table
/// is finalized. /// is finalized.
@ -45,7 +45,7 @@ public:
/// \brief Get the offest of a string in the string table. Can only be used /// \brief Get the offest of a string in the string table. Can only be used
/// after the table is finalized. /// after the table is finalized.
size_t getOffset(StringRef s) const; size_t getOffset(StringRef S) const;
void clear(); void clear();

54
lib/MC/StringTableBuilder.cpp
View File

@ -18,21 +18,21 @@ using namespace llvm;
static int compareBySuffix(std::pair<StringRef, size_t> *const *AP, static int compareBySuffix(std::pair<StringRef, size_t> *const *AP,
std::pair<StringRef, size_t> *const *BP) { std::pair<StringRef, size_t> *const *BP) {
StringRef a = (*AP)->first; StringRef A = (*AP)->first;
StringRef b = (*BP)->first; StringRef B = (*BP)->first;
size_t sizeA = a.size(); size_t SizeA = A.size();
size_t sizeB = b.size(); size_t SizeB = B.size();
size_t len = std::min(sizeA, sizeB); size_t Len = std::min(SizeA, SizeB);
for (size_t i = 0; i < len; ++i) { for (size_t I = 0; I < Len; ++I) {
char ca = a[sizeA - i - 1]; char CA = A[SizeA - I - 1];
char cb = b[sizeB - i - 1]; char CB = B[SizeB - I - 1];
if (ca != cb) if (CA != CB)
return cb - ca; return CB - CA;
} }
return sizeB - sizeA; return SizeB - SizeA;
} }
void StringTableBuilder::finalize(Kind kind) { void StringTableBuilder::finalize(Kind K) {
std::vector<std::pair<StringRef, size_t> *> Strings; std::vector<std::pair<StringRef, size_t> *> Strings;
Strings.reserve(StringIndexMap.size()); Strings.reserve(StringIndexMap.size());
for (std::pair<StringRef, size_t> &P : StringIndexMap) for (std::pair<StringRef, size_t> &P : StringIndexMap)
@ -40,7 +40,7 @@ void StringTableBuilder::finalize(Kind kind) {
array_pod_sort(Strings.begin(), Strings.end(), compareBySuffix); array_pod_sort(Strings.begin(), Strings.end(), compareBySuffix);
switch (kind) { switch (K) {
case ELF: case ELF:
case MachO: case MachO:
// Start the table with a NUL byte. // Start the table with a NUL byte.
@ -54,22 +54,22 @@ void StringTableBuilder::finalize(Kind kind) {
StringRef Previous; StringRef Previous;
for (std::pair<StringRef, size_t> *P : Strings) { for (std::pair<StringRef, size_t> *P : Strings) {
StringRef s = P->first; StringRef S = P->first;
if (kind == WinCOFF) if (K == WinCOFF)
assert(s.size() > COFF::NameSize && "Short string in COFF string table!"); assert(S.size() > COFF::NameSize && "Short string in COFF string table!");
if (Previous.endswith(s)) { if (Previous.endswith(S)) {
P->second = StringTable.size() - 1 - s.size(); P->second = StringTable.size() - 1 - S.size();
continue; continue;
} }
P->second = StringTable.size(); P->second = StringTable.size();
StringTable += s; StringTable += S;
StringTable += '\x00'; StringTable += '\x00';
Previous = s; Previous = S;
} }
switch (kind) { switch (K) {
case ELF: case ELF:
break; break;
case MachO: case MachO:
@ -80,9 +80,9 @@ void StringTableBuilder::finalize(Kind kind) {
case WinCOFF: case WinCOFF:
// Write the table size in the first word. // Write the table size in the first word.
assert(StringTable.size() <= std::numeric_limits<uint32_t>::max()); assert(StringTable.size() <= std::numeric_limits<uint32_t>::max());
uint32_t size = static_cast<uint32_t>(StringTable.size()); uint32_t Size = static_cast<uint32_t>(StringTable.size());
support::endian::write<uint32_t, support::little, support::unaligned>( support::endian::write<uint32_t, support::little, support::unaligned>(
StringTable.data(), size); StringTable.data(), Size);
break; break;
} }
} }
@ -92,14 +92,14 @@ void StringTableBuilder::clear() {
StringIndexMap.clear(); StringIndexMap.clear();
} }
size_t StringTableBuilder::getOffset(StringRef s) const { size_t StringTableBuilder::getOffset(StringRef S) const {
assert(isFinalized()); assert(isFinalized());
auto I = StringIndexMap.find(s); auto I = StringIndexMap.find(S);
assert(I != StringIndexMap.end() && "String is not in table!"); assert(I != StringIndexMap.end() && "String is not in table!");
return I->second; return I->second;
} }
void StringTableBuilder::add(StringRef s) { void StringTableBuilder::add(StringRef S) {
assert(!isFinalized()); assert(!isFinalized());
StringIndexMap.insert(std::make_pair(s, 0)); StringIndexMap.insert(std::make_pair(S, 0));
} }