blob: 9de9363611e67ee3510f427d3bd6492ae375a12f [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 Wennborg1b1a3992014-10-06 17:05:19 +000039 switch (kind) {
40 case ELF:
41 case MachO:
Hans Wennborgf26bfc12014-09-29 22:43:20 +000042 // Start the table with a NUL byte.
43 StringTable += '\x00';
Hans Wennborg1b1a3992014-10-06 17:05:19 +000044 break;
45 case WinCOFF:
Hans Wennborgf26bfc12014-09-29 22:43:20 +000046 // Make room to write the table size later.
47 StringTable.append(4, '\x00');
Hans Wennborg1b1a3992014-10-06 17:05:19 +000048 break;
Hans Wennborgf26bfc12014-09-29 22:43:20 +000049 }
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000050
51 StringRef Previous;
52 for (StringRef s : Strings) {
Hans Wennborgf26bfc12014-09-29 22:43:20 +000053 if (kind == WinCOFF)
54 assert(s.size() > COFF::NameSize && "Short string in COFF string table!");
55
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000056 if (Previous.endswith(s)) {
57 StringIndexMap[s] = StringTable.size() - 1 - s.size();
58 continue;
59 }
60
61 StringIndexMap[s] = StringTable.size();
62 StringTable += s;
63 StringTable += '\x00';
64 Previous = s;
65 }
Hans Wennborgf26bfc12014-09-29 22:43:20 +000066
Hans Wennborg1b1a3992014-10-06 17:05:19 +000067 switch (kind) {
68 case ELF:
69 break;
70 case MachO:
71 // Pad to multiple of 4.
72 while (StringTable.size() % 4)
73 StringTable += '\x00';
74 break;
75 case WinCOFF:
76 // Write the table size in the first word.
Hans Wennborgf26bfc12014-09-29 22:43:20 +000077 assert(StringTable.size() <= std::numeric_limits<uint32_t>::max());
78 uint32_t size = static_cast<uint32_t>(StringTable.size());
79 support::endian::write<uint32_t, support::little, support::unaligned>(
80 StringTable.data(), size);
Hans Wennborg1b1a3992014-10-06 17:05:19 +000081 break;
Hans Wennborgf26bfc12014-09-29 22:43:20 +000082 }
83}
84
85void StringTableBuilder::clear() {
86 StringTable.clear();
87 StringIndexMap.clear();
Hans Wennborg83e6e1e2014-04-30 16:25:02 +000088}