aboutsummaryrefslogtreecommitdiff
path: root/llvm/lib/MC/StringTableBuilder.cpp
diff options
context:
space:
mode:
authorRafael Espindola <rafael.espindola@gmail.com>2015-10-23 21:48:05 +0000
committerRafael Espindola <rafael.espindola@gmail.com>2015-10-23 21:48:05 +0000
commit21956e4007c21fd737c3548f7812a2c47adaf588 (patch)
tree616d874a12844107ae8d5edd12bff7638404b955 /llvm/lib/MC/StringTableBuilder.cpp
parent803195ed6df7b7d983d800233d77afe0767ba69b (diff)
downloadllvm-21956e4007c21fd737c3548f7812a2c47adaf588.zip
llvm-21956e4007c21fd737c3548f7812a2c47adaf588.tar.gz
llvm-21956e4007c21fd737c3548f7812a2c47adaf588.tar.bz2
Add a RAW mode to StringTableBuilder.
In this mode it just tries to tail merge the strings without imposing any other format constrains. It will not, for example, add a null byte between them. Also add support for keeping a tentative size and offset if we decide to not optimize after all. This will be used shortly in lld for merging SHF_STRINGS sections. llvm-svn: 251153
Diffstat (limited to 'llvm/lib/MC/StringTableBuilder.cpp')
-rw-r--r--llvm/lib/MC/StringTableBuilder.cpp21
1 files changed, 16 insertions, 5 deletions
diff --git a/llvm/lib/MC/StringTableBuilder.cpp b/llvm/lib/MC/StringTableBuilder.cpp
index fc6c3bc..6210238 100644
--- a/llvm/lib/MC/StringTableBuilder.cpp
+++ b/llvm/lib/MC/StringTableBuilder.cpp
@@ -16,6 +16,8 @@
using namespace llvm;
+StringTableBuilder::StringTableBuilder(Kind K) : K(K) {}
+
static int compareBySuffix(std::pair<StringRef, size_t> *const *AP,
std::pair<StringRef, size_t> *const *BP) {
StringRef A = (*AP)->first;
@@ -32,7 +34,7 @@ static int compareBySuffix(std::pair<StringRef, size_t> *const *AP,
return SizeB - SizeA;
}
-void StringTableBuilder::finalize(Kind K) {
+void StringTableBuilder::finalize() {
std::vector<std::pair<StringRef, size_t> *> Strings;
Strings.reserve(StringIndexMap.size());
for (std::pair<StringRef, size_t> &P : StringIndexMap)
@@ -41,6 +43,8 @@ void StringTableBuilder::finalize(Kind K) {
array_pod_sort(Strings.begin(), Strings.end(), compareBySuffix);
switch (K) {
+ case RAW:
+ break;
case ELF:
case MachO:
// Start the table with a NUL byte.
@@ -59,17 +63,19 @@ void StringTableBuilder::finalize(Kind K) {
assert(S.size() > COFF::NameSize && "Short string in COFF string table!");
if (Previous.endswith(S)) {
- P->second = StringTable.size() - 1 - S.size();
+ P->second = StringTable.size() - S.size() - (K != RAW);
continue;
}
P->second = StringTable.size();
StringTable += S;
- StringTable += '\x00';
+ if (K != RAW)
+ StringTable += '\x00';
Previous = S;
}
switch (K) {
+ case RAW:
case ELF:
break;
case MachO:
@@ -85,6 +91,8 @@ void StringTableBuilder::finalize(Kind K) {
StringTable.data(), Size);
break;
}
+
+ Size = StringTable.size();
}
void StringTableBuilder::clear() {
@@ -99,7 +107,10 @@ size_t StringTableBuilder::getOffset(StringRef S) const {
return I->second;
}
-void StringTableBuilder::add(StringRef S) {
+size_t StringTableBuilder::add(StringRef S) {
assert(!isFinalized());
- StringIndexMap.insert(std::make_pair(S, 0));
+ auto P = StringIndexMap.insert(std::make_pair(S, Size));
+ if (P.second)
+ Size += S.size() + (K != RAW);
+ return P.first->second;
}