Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 1 | //===-- 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 Espindola | 97de474 | 2014-07-03 02:01:39 +0000 | [diff] [blame] | 10 | #include "llvm/MC/StringTableBuilder.h" |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 11 | #include "llvm/ADT/SmallVector.h" |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 12 | #include "llvm/Support/COFF.h" |
| 13 | #include "llvm/Support/Endian.h" |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 14 | |
| 15 | using namespace llvm; |
| 16 | |
Akira Hatanaka | 8e77dbb | 2014-09-24 20:37:14 +0000 | [diff] [blame] | 17 | static 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 Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 30 | void StringTableBuilder::finalize(Kind kind) { |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 31 | SmallVector<StringRef, 8> Strings; |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 32 | Strings.reserve(StringIndexMap.size()); |
| 33 | |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 34 | for (auto i = StringIndexMap.begin(), e = StringIndexMap.end(); i != e; ++i) |
| 35 | Strings.push_back(i->getKey()); |
| 36 | |
Akira Hatanaka | 8e77dbb | 2014-09-24 20:37:14 +0000 | [diff] [blame] | 37 | std::sort(Strings.begin(), Strings.end(), compareBySuffix); |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 38 | |
Hans Wennborg | 1b1a399 | 2014-10-06 17:05:19 +0000 | [diff] [blame^] | 39 | switch (kind) { |
| 40 | case ELF: |
| 41 | case MachO: |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 42 | // Start the table with a NUL byte. |
| 43 | StringTable += '\x00'; |
Hans Wennborg | 1b1a399 | 2014-10-06 17:05:19 +0000 | [diff] [blame^] | 44 | break; |
| 45 | case WinCOFF: |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 46 | // Make room to write the table size later. |
| 47 | StringTable.append(4, '\x00'); |
Hans Wennborg | 1b1a399 | 2014-10-06 17:05:19 +0000 | [diff] [blame^] | 48 | break; |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 49 | } |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 50 | |
| 51 | StringRef Previous; |
| 52 | for (StringRef s : Strings) { |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 53 | if (kind == WinCOFF) |
| 54 | assert(s.size() > COFF::NameSize && "Short string in COFF string table!"); |
| 55 | |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 56 | 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 Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 66 | |
Hans Wennborg | 1b1a399 | 2014-10-06 17:05:19 +0000 | [diff] [blame^] | 67 | 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 Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 77 | 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 Wennborg | 1b1a399 | 2014-10-06 17:05:19 +0000 | [diff] [blame^] | 81 | break; |
Hans Wennborg | f26bfc1 | 2014-09-29 22:43:20 +0000 | [diff] [blame] | 82 | } |
| 83 | } |
| 84 | |
| 85 | void StringTableBuilder::clear() { |
| 86 | StringTable.clear(); |
| 87 | StringIndexMap.clear(); |
Hans Wennborg | 83e6e1e | 2014-04-30 16:25:02 +0000 | [diff] [blame] | 88 | } |