blob: 34e7e6fdfbbb7069f81125f3dc51e2c57740763a [file] [log] [blame]
Hans Wennborg83e6e1e2014-04-30 16:25:02 +00001//===-- StringTableBuilder.cpp - String table building utility ------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Rafael Espindola97de4742014-07-03 02:01:39 +000010#include "llvm/MC/StringTableBuilder.h"
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000011#include "llvm/ADT/SmallVector.h"
Hans Wennborgf26bfc12014-09-29 22:43:20 +000012#include "llvm/Support/COFF.h"
13#include "llvm/Support/Endian.h"
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000014
15using namespace llvm;
16
Akira Hatanaka8e77dbb2014-09-24 20:37:14 +000017static bool compareBySuffix(StringRef a, StringRef b) {
18 size_t sizeA = a.size();
19 size_t sizeB = b.size();
20 size_t len = std::min(sizeA, sizeB);
21 for (size_t i = 0; i < len; ++i) {
22 char ca = a[sizeA - i - 1];
23 char cb = b[sizeB - i - 1];
24 if (ca != cb)
25 return ca > cb;
26 }
27 return sizeA > sizeB;
28}
29
Hans Wennborgf26bfc12014-09-29 22:43:20 +000030void StringTableBuilder::finalize(Kind kind) {
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000031 SmallVector<StringRef, 8> Strings;
Hans Wennborgf26bfc12014-09-29 22:43:20 +000032 Strings.reserve(StringIndexMap.size());
33
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000034 for (auto i = StringIndexMap.begin(), e = StringIndexMap.end(); i != e; ++i)
35 Strings.push_back(i->getKey());
36
Akira Hatanaka8e77dbb2014-09-24 20:37:14 +000037 std::sort(Strings.begin(), Strings.end(), compareBySuffix);
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000038
Hans Wennborgf26bfc12014-09-29 22:43:20 +000039 if (kind == ELF) {
40 // Start the table with a NUL byte.
41 StringTable += '\x00';
42 } else if (kind == WinCOFF) {
43 // Make room to write the table size later.
44 StringTable.append(4, '\x00');
45 }
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000046
47 StringRef Previous;
48 for (StringRef s : Strings) {
Hans Wennborgf26bfc12014-09-29 22:43:20 +000049 if (kind == WinCOFF)
50 assert(s.size() > COFF::NameSize && "Short string in COFF string table!");
51
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000052 if (Previous.endswith(s)) {
53 StringIndexMap[s] = StringTable.size() - 1 - s.size();
54 continue;
55 }
56
57 StringIndexMap[s] = StringTable.size();
58 StringTable += s;
59 StringTable += '\x00';
60 Previous = s;
61 }
Hans Wennborgf26bfc12014-09-29 22:43:20 +000062
63 if (kind == WinCOFF) {
64 assert(StringTable.size() <= std::numeric_limits<uint32_t>::max());
65 uint32_t size = static_cast<uint32_t>(StringTable.size());
66 support::endian::write<uint32_t, support::little, support::unaligned>(
67 StringTable.data(), size);
68 }
69}
70
71void StringTableBuilder::clear() {
72 StringTable.clear();
73 StringIndexMap.clear();
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000074}