AccelTable.cpp 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677
  1. //===- llvm/CodeGen/AsmPrinter/AccelTable.cpp - Accelerator Tables --------===//
  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. //
  10. // This file contains support for writing accelerator tables.
  11. //
  12. //===----------------------------------------------------------------------===//
  13. #include "llvm/CodeGen/AccelTable.h"
  14. #include "DwarfCompileUnit.h"
  15. #include "llvm/ADT/STLExtras.h"
  16. #include "llvm/ADT/StringMap.h"
  17. #include "llvm/ADT/Twine.h"
  18. #include "llvm/BinaryFormat/Dwarf.h"
  19. #include "llvm/CodeGen/AsmPrinter.h"
  20. #include "llvm/CodeGen/DIE.h"
  21. #include "llvm/MC/MCExpr.h"
  22. #include "llvm/MC/MCStreamer.h"
  23. #include "llvm/Support/raw_ostream.h"
  24. #include <algorithm>
  25. #include <cstddef>
  26. #include <cstdint>
  27. #include <limits>
  28. #include <vector>
  29. using namespace llvm;
  30. void AccelTableBase::computeBucketCount() {
  31. // First get the number of unique hashes.
  32. std::vector<uint32_t> Uniques;
  33. Uniques.reserve(Entries.size());
  34. for (const auto &E : Entries)
  35. Uniques.push_back(E.second.HashValue);
  36. array_pod_sort(Uniques.begin(), Uniques.end());
  37. std::vector<uint32_t>::iterator P =
  38. std::unique(Uniques.begin(), Uniques.end());
  39. UniqueHashCount = std::distance(Uniques.begin(), P);
  40. if (UniqueHashCount > 1024)
  41. BucketCount = UniqueHashCount / 4;
  42. else if (UniqueHashCount > 16)
  43. BucketCount = UniqueHashCount / 2;
  44. else
  45. BucketCount = std::max<uint32_t>(UniqueHashCount, 1);
  46. }
  47. void AccelTableBase::finalize(AsmPrinter *Asm, StringRef Prefix) {
  48. // Create the individual hash data outputs.
  49. for (auto &E : Entries) {
  50. // Unique the entries.
  51. std::stable_sort(E.second.Values.begin(), E.second.Values.end(),
  52. [](const AccelTableData *A, const AccelTableData *B) {
  53. return *A < *B;
  54. });
  55. E.second.Values.erase(
  56. std::unique(E.second.Values.begin(), E.second.Values.end()),
  57. E.second.Values.end());
  58. }
  59. // Figure out how many buckets we need, then compute the bucket contents and
  60. // the final ordering. The hashes and offsets can be emitted by walking these
  61. // data structures. We add temporary symbols to the data so they can be
  62. // referenced when emitting the offsets.
  63. computeBucketCount();
  64. // Compute bucket contents and final ordering.
  65. Buckets.resize(BucketCount);
  66. for (auto &E : Entries) {
  67. uint32_t Bucket = E.second.HashValue % BucketCount;
  68. Buckets[Bucket].push_back(&E.second);
  69. E.second.Sym = Asm->createTempSymbol(Prefix);
  70. }
  71. // Sort the contents of the buckets by hash value so that hash collisions end
  72. // up together. Stable sort makes testing easier and doesn't cost much more.
  73. for (auto &Bucket : Buckets)
  74. std::stable_sort(Bucket.begin(), Bucket.end(),
  75. [](HashData *LHS, HashData *RHS) {
  76. return LHS->HashValue < RHS->HashValue;
  77. });
  78. }
  79. namespace {
  80. /// Base class for writing out Accelerator tables. It holds the common
  81. /// functionality for the two Accelerator table types.
  82. class AccelTableEmitter {
  83. protected:
  84. AsmPrinter *const Asm; ///< Destination.
  85. const AccelTableBase &Contents; ///< Data to emit.
  86. /// Controls whether to emit duplicate hash and offset table entries for names
  87. /// with identical hashes. Apple tables don't emit duplicate entries, DWARF v5
  88. /// tables do.
  89. const bool SkipIdenticalHashes;
  90. void emitHashes() const;
  91. /// Emit offsets to lists of entries with identical names. The offsets are
  92. /// relative to the Base argument.
  93. void emitOffsets(const MCSymbol *Base) const;
  94. public:
  95. AccelTableEmitter(AsmPrinter *Asm, const AccelTableBase &Contents,
  96. bool SkipIdenticalHashes)
  97. : Asm(Asm), Contents(Contents), SkipIdenticalHashes(SkipIdenticalHashes) {
  98. }
  99. };
  100. class AppleAccelTableEmitter : public AccelTableEmitter {
  101. using Atom = AppleAccelTableData::Atom;
  102. /// The fixed header of an Apple Accelerator Table.
  103. struct Header {
  104. uint32_t Magic = MagicHash;
  105. uint16_t Version = 1;
  106. uint16_t HashFunction = dwarf::DW_hash_function_djb;
  107. uint32_t BucketCount;
  108. uint32_t HashCount;
  109. uint32_t HeaderDataLength;
  110. /// 'HASH' magic value to detect endianness.
  111. static const uint32_t MagicHash = 0x48415348;
  112. Header(uint32_t BucketCount, uint32_t UniqueHashCount, uint32_t DataLength)
  113. : BucketCount(BucketCount), HashCount(UniqueHashCount),
  114. HeaderDataLength(DataLength) {}
  115. void emit(AsmPrinter *Asm) const;
  116. #ifndef NDEBUG
  117. void print(raw_ostream &OS) const;
  118. void dump() const { print(dbgs()); }
  119. #endif
  120. };
  121. /// The HeaderData describes the structure of an Apple accelerator table
  122. /// through a list of Atoms.
  123. struct HeaderData {
  124. /// In the case of data that is referenced via DW_FORM_ref_* the offset
  125. /// base is used to describe the offset for all forms in the list of atoms.
  126. uint32_t DieOffsetBase;
  127. const SmallVector<Atom, 4> Atoms;
  128. HeaderData(ArrayRef<Atom> AtomList, uint32_t Offset = 0)
  129. : DieOffsetBase(Offset), Atoms(AtomList.begin(), AtomList.end()) {}
  130. void emit(AsmPrinter *Asm) const;
  131. #ifndef NDEBUG
  132. void print(raw_ostream &OS) const;
  133. void dump() const { print(dbgs()); }
  134. #endif
  135. };
  136. Header Header;
  137. HeaderData HeaderData;
  138. const MCSymbol *SecBegin;
  139. void emitBuckets() const;
  140. void emitData() const;
  141. public:
  142. AppleAccelTableEmitter(AsmPrinter *Asm, const AccelTableBase &Contents,
  143. ArrayRef<Atom> Atoms, const MCSymbol *SecBegin)
  144. : AccelTableEmitter(Asm, Contents, true),
  145. Header(Contents.getBucketCount(), Contents.getUniqueHashCount(),
  146. 8 + (Atoms.size() * 4)),
  147. HeaderData(Atoms), SecBegin(SecBegin) {}
  148. void emit() const;
  149. #ifndef NDEBUG
  150. void print(raw_ostream &OS) const;
  151. void dump() const { print(dbgs()); }
  152. #endif
  153. };
  154. /// Class responsible for emitting a DWARF v5 Accelerator Table. The only public
  155. /// function is emit(), which performs the actual emission.
  156. class Dwarf5AccelTableEmitter : public AccelTableEmitter {
  157. struct Header {
  158. uint32_t UnitLength = 0;
  159. uint16_t Version = 5;
  160. uint16_t Padding = 0;
  161. uint32_t CompUnitCount;
  162. uint32_t LocalTypeUnitCount = 0;
  163. uint32_t ForeignTypeUnitCount = 0;
  164. uint32_t BucketCount;
  165. uint32_t NameCount;
  166. uint32_t AbbrevTableSize = 0;
  167. uint32_t AugmentationStringSize = sizeof(AugmentationString);
  168. char AugmentationString[8] = {'L', 'L', 'V', 'M', '0', '7', '0', '0'};
  169. Header(uint32_t CompUnitCount, uint32_t BucketCount, uint32_t NameCount)
  170. : CompUnitCount(CompUnitCount), BucketCount(BucketCount),
  171. NameCount(NameCount) {}
  172. void emit(const Dwarf5AccelTableEmitter &Ctx) const;
  173. };
  174. struct AttributeEncoding {
  175. dwarf::Index Index;
  176. dwarf::Form Form;
  177. };
  178. Header Header;
  179. DenseMap<uint32_t, SmallVector<AttributeEncoding, 2>> Abbreviations;
  180. const DwarfDebug &DD;
  181. ArrayRef<std::unique_ptr<DwarfCompileUnit>> CompUnits;
  182. MCSymbol *ContributionStart = Asm->createTempSymbol("names_start");
  183. MCSymbol *ContributionEnd = Asm->createTempSymbol("names_end");
  184. MCSymbol *AbbrevStart = Asm->createTempSymbol("names_abbrev_start");
  185. MCSymbol *AbbrevEnd = Asm->createTempSymbol("names_abbrev_end");
  186. MCSymbol *EntryPool = Asm->createTempSymbol("names_entries");
  187. DenseSet<uint32_t> getUniqueTags() const;
  188. // Right now, we emit uniform attributes for all tags.
  189. SmallVector<AttributeEncoding, 2> getUniformAttributes() const;
  190. void emitCUList() const;
  191. void emitBuckets() const;
  192. void emitStringOffsets() const;
  193. void emitAbbrevs() const;
  194. void emitEntry(const DWARF5AccelTableData &Data) const;
  195. void emitData() const;
  196. public:
  197. Dwarf5AccelTableEmitter(
  198. AsmPrinter *Asm, const AccelTableBase &Contents, const DwarfDebug &DD,
  199. ArrayRef<std::unique_ptr<DwarfCompileUnit>> CompUnits);
  200. void emit() const;
  201. };
  202. } // namespace
  203. void AccelTableEmitter::emitHashes() const {
  204. uint64_t PrevHash = std::numeric_limits<uint64_t>::max();
  205. unsigned BucketIdx = 0;
  206. for (auto &Bucket : Contents.getBuckets()) {
  207. for (auto &Hash : Bucket) {
  208. uint32_t HashValue = Hash->HashValue;
  209. if (SkipIdenticalHashes && PrevHash == HashValue)
  210. continue;
  211. Asm->OutStreamer->AddComment("Hash in Bucket " + Twine(BucketIdx));
  212. Asm->emitInt32(HashValue);
  213. PrevHash = HashValue;
  214. }
  215. BucketIdx++;
  216. }
  217. }
  218. void AccelTableEmitter::emitOffsets(const MCSymbol *Base) const {
  219. const auto &Buckets = Contents.getBuckets();
  220. uint64_t PrevHash = std::numeric_limits<uint64_t>::max();
  221. for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
  222. for (auto *Hash : Buckets[i]) {
  223. uint32_t HashValue = Hash->HashValue;
  224. if (SkipIdenticalHashes && PrevHash == HashValue)
  225. continue;
  226. PrevHash = HashValue;
  227. Asm->OutStreamer->AddComment("Offset in Bucket " + Twine(i));
  228. Asm->EmitLabelDifference(Hash->Sym, Base, sizeof(uint32_t));
  229. }
  230. }
  231. }
  232. void AppleAccelTableEmitter::Header::emit(AsmPrinter *Asm) const {
  233. Asm->OutStreamer->AddComment("Header Magic");
  234. Asm->emitInt32(Magic);
  235. Asm->OutStreamer->AddComment("Header Version");
  236. Asm->emitInt16(Version);
  237. Asm->OutStreamer->AddComment("Header Hash Function");
  238. Asm->emitInt16(HashFunction);
  239. Asm->OutStreamer->AddComment("Header Bucket Count");
  240. Asm->emitInt32(BucketCount);
  241. Asm->OutStreamer->AddComment("Header Hash Count");
  242. Asm->emitInt32(HashCount);
  243. Asm->OutStreamer->AddComment("Header Data Length");
  244. Asm->emitInt32(HeaderDataLength);
  245. }
  246. void AppleAccelTableEmitter::HeaderData::emit(AsmPrinter *Asm) const {
  247. Asm->OutStreamer->AddComment("HeaderData Die Offset Base");
  248. Asm->emitInt32(DieOffsetBase);
  249. Asm->OutStreamer->AddComment("HeaderData Atom Count");
  250. Asm->emitInt32(Atoms.size());
  251. for (const Atom &A : Atoms) {
  252. Asm->OutStreamer->AddComment(dwarf::AtomTypeString(A.Type));
  253. Asm->emitInt16(A.Type);
  254. Asm->OutStreamer->AddComment(dwarf::FormEncodingString(A.Form));
  255. Asm->emitInt16(A.Form);
  256. }
  257. }
  258. void AppleAccelTableEmitter::emitBuckets() const {
  259. const auto &Buckets = Contents.getBuckets();
  260. unsigned index = 0;
  261. for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
  262. Asm->OutStreamer->AddComment("Bucket " + Twine(i));
  263. if (!Buckets[i].empty())
  264. Asm->emitInt32(index);
  265. else
  266. Asm->emitInt32(std::numeric_limits<uint32_t>::max());
  267. // Buckets point in the list of hashes, not to the data. Do not increment
  268. // the index multiple times in case of hash collisions.
  269. uint64_t PrevHash = std::numeric_limits<uint64_t>::max();
  270. for (auto *HD : Buckets[i]) {
  271. uint32_t HashValue = HD->HashValue;
  272. if (PrevHash != HashValue)
  273. ++index;
  274. PrevHash = HashValue;
  275. }
  276. }
  277. }
  278. void AppleAccelTableEmitter::emitData() const {
  279. const auto &Buckets = Contents.getBuckets();
  280. for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
  281. uint64_t PrevHash = std::numeric_limits<uint64_t>::max();
  282. for (auto &Hash : Buckets[i]) {
  283. // Terminate the previous entry if there is no hash collision with the
  284. // current one.
  285. if (PrevHash != std::numeric_limits<uint64_t>::max() &&
  286. PrevHash != Hash->HashValue)
  287. Asm->emitInt32(0);
  288. // Remember to emit the label for our offset.
  289. Asm->OutStreamer->EmitLabel(Hash->Sym);
  290. Asm->OutStreamer->AddComment(Hash->Name.getString());
  291. Asm->emitDwarfStringOffset(Hash->Name);
  292. Asm->OutStreamer->AddComment("Num DIEs");
  293. Asm->emitInt32(Hash->Values.size());
  294. for (const auto *V : Hash->Values)
  295. static_cast<const AppleAccelTableData *>(V)->emit(Asm);
  296. PrevHash = Hash->HashValue;
  297. }
  298. // Emit the final end marker for the bucket.
  299. if (!Buckets[i].empty())
  300. Asm->emitInt32(0);
  301. }
  302. }
  303. void AppleAccelTableEmitter::emit() const {
  304. Header.emit(Asm);
  305. HeaderData.emit(Asm);
  306. emitBuckets();
  307. emitHashes();
  308. emitOffsets(SecBegin);
  309. emitData();
  310. }
  311. void Dwarf5AccelTableEmitter::Header::emit(
  312. const Dwarf5AccelTableEmitter &Ctx) const {
  313. assert(CompUnitCount > 0 && "Index must have at least one CU.");
  314. AsmPrinter *Asm = Ctx.Asm;
  315. Asm->OutStreamer->AddComment("Header: unit length");
  316. Asm->EmitLabelDifference(Ctx.ContributionEnd, Ctx.ContributionStart,
  317. sizeof(uint32_t));
  318. Asm->OutStreamer->EmitLabel(Ctx.ContributionStart);
  319. Asm->OutStreamer->AddComment("Header: version");
  320. Asm->emitInt16(Version);
  321. Asm->OutStreamer->AddComment("Header: padding");
  322. Asm->emitInt16(Padding);
  323. Asm->OutStreamer->AddComment("Header: compilation unit count");
  324. Asm->emitInt32(CompUnitCount);
  325. Asm->OutStreamer->AddComment("Header: local type unit count");
  326. Asm->emitInt32(LocalTypeUnitCount);
  327. Asm->OutStreamer->AddComment("Header: foreign type unit count");
  328. Asm->emitInt32(ForeignTypeUnitCount);
  329. Asm->OutStreamer->AddComment("Header: bucket count");
  330. Asm->emitInt32(BucketCount);
  331. Asm->OutStreamer->AddComment("Header: name count");
  332. Asm->emitInt32(NameCount);
  333. Asm->OutStreamer->AddComment("Header: abbreviation table size");
  334. Asm->EmitLabelDifference(Ctx.AbbrevEnd, Ctx.AbbrevStart, sizeof(uint32_t));
  335. Asm->OutStreamer->AddComment("Header: augmentation string size");
  336. assert(AugmentationStringSize % 4 == 0);
  337. Asm->emitInt32(AugmentationStringSize);
  338. Asm->OutStreamer->AddComment("Header: augmentation string");
  339. Asm->OutStreamer->EmitBytes({AugmentationString, AugmentationStringSize});
  340. }
  341. DenseSet<uint32_t> Dwarf5AccelTableEmitter::getUniqueTags() const {
  342. DenseSet<uint32_t> UniqueTags;
  343. for (auto &Bucket : Contents.getBuckets()) {
  344. for (auto *Hash : Bucket) {
  345. for (auto *Value : Hash->Values) {
  346. const DIE &Die =
  347. static_cast<const DWARF5AccelTableData *>(Value)->getDie();
  348. UniqueTags.insert(Die.getTag());
  349. }
  350. }
  351. }
  352. return UniqueTags;
  353. }
  354. SmallVector<Dwarf5AccelTableEmitter::AttributeEncoding, 2>
  355. Dwarf5AccelTableEmitter::getUniformAttributes() const {
  356. SmallVector<AttributeEncoding, 2> UA;
  357. if (CompUnits.size() > 1) {
  358. size_t LargestCUIndex = CompUnits.size() - 1;
  359. dwarf::Form Form = DIEInteger::BestForm(/*IsSigned*/ false, LargestCUIndex);
  360. UA.push_back({dwarf::DW_IDX_compile_unit, Form});
  361. }
  362. UA.push_back({dwarf::DW_IDX_die_offset, dwarf::DW_FORM_ref4});
  363. return UA;
  364. }
  365. void Dwarf5AccelTableEmitter::emitCUList() const {
  366. for (const auto &CU : enumerate(CompUnits)) {
  367. assert(CU.index() == CU.value()->getUniqueID());
  368. Asm->OutStreamer->AddComment("Compilation unit " + Twine(CU.index()));
  369. Asm->emitDwarfSymbolReference(CU.value()->getLabelBegin());
  370. }
  371. }
  372. void Dwarf5AccelTableEmitter::emitBuckets() const {
  373. uint32_t Index = 1;
  374. for (const auto &Bucket : enumerate(Contents.getBuckets())) {
  375. Asm->OutStreamer->AddComment("Bucket " + Twine(Bucket.index()));
  376. Asm->emitInt32(Bucket.value().empty() ? 0 : Index);
  377. Index += Bucket.value().size();
  378. }
  379. }
  380. void Dwarf5AccelTableEmitter::emitStringOffsets() const {
  381. for (const auto &Bucket : enumerate(Contents.getBuckets())) {
  382. for (auto *Hash : Bucket.value()) {
  383. DwarfStringPoolEntryRef String = Hash->Name;
  384. Asm->OutStreamer->AddComment("String in Bucket " + Twine(Bucket.index()) +
  385. ": " + String.getString());
  386. Asm->emitDwarfStringOffset(String);
  387. }
  388. }
  389. }
  390. void Dwarf5AccelTableEmitter::emitAbbrevs() const {
  391. Asm->OutStreamer->EmitLabel(AbbrevStart);
  392. for (const auto &Abbrev : Abbreviations) {
  393. Asm->OutStreamer->AddComment("Abbrev code");
  394. assert(Abbrev.first != 0);
  395. Asm->EmitULEB128(Abbrev.first);
  396. Asm->OutStreamer->AddComment(dwarf::TagString(Abbrev.first));
  397. Asm->EmitULEB128(Abbrev.first);
  398. for (const auto &AttrEnc : Abbrev.second) {
  399. Asm->EmitULEB128(AttrEnc.Index, dwarf::IndexString(AttrEnc.Index).data());
  400. Asm->EmitULEB128(AttrEnc.Form,
  401. dwarf::FormEncodingString(AttrEnc.Form).data());
  402. }
  403. Asm->EmitULEB128(0, "End of abbrev");
  404. Asm->EmitULEB128(0, "End of abbrev");
  405. }
  406. Asm->EmitULEB128(0, "End of abbrev list");
  407. Asm->OutStreamer->EmitLabel(AbbrevEnd);
  408. }
  409. void Dwarf5AccelTableEmitter::emitEntry(
  410. const DWARF5AccelTableData &Entry) const {
  411. auto AbbrevIt = Abbreviations.find(Entry.getDie().getTag());
  412. assert(AbbrevIt != Abbreviations.end() &&
  413. "Why wasn't this abbrev generated?");
  414. Asm->EmitULEB128(AbbrevIt->first, "Abbreviation code");
  415. for (const auto &AttrEnc : AbbrevIt->second) {
  416. Asm->OutStreamer->AddComment(dwarf::IndexString(AttrEnc.Index));
  417. switch (AttrEnc.Index) {
  418. case dwarf::DW_IDX_compile_unit: {
  419. const DIE *CUDie = Entry.getDie().getUnitDie();
  420. DIEInteger ID(DD.lookupCU(CUDie)->getUniqueID());
  421. ID.EmitValue(Asm, AttrEnc.Form);
  422. break;
  423. }
  424. case dwarf::DW_IDX_die_offset:
  425. assert(AttrEnc.Form == dwarf::DW_FORM_ref4);
  426. Asm->emitInt32(Entry.getDie().getOffset());
  427. break;
  428. default:
  429. llvm_unreachable("Unexpected index attribute!");
  430. }
  431. }
  432. }
  433. void Dwarf5AccelTableEmitter::emitData() const {
  434. Asm->OutStreamer->EmitLabel(EntryPool);
  435. for (auto &Bucket : Contents.getBuckets()) {
  436. for (auto *Hash : Bucket) {
  437. // Remember to emit the label for our offset.
  438. Asm->OutStreamer->EmitLabel(Hash->Sym);
  439. for (const auto *Value : Hash->Values)
  440. emitEntry(*static_cast<const DWARF5AccelTableData *>(Value));
  441. Asm->OutStreamer->AddComment("End of list: " + Hash->Name.getString());
  442. Asm->emitInt32(0);
  443. }
  444. }
  445. }
  446. Dwarf5AccelTableEmitter::Dwarf5AccelTableEmitter(
  447. AsmPrinter *Asm, const AccelTableBase &Contents, const DwarfDebug &DD,
  448. ArrayRef<std::unique_ptr<DwarfCompileUnit>> CompUnits)
  449. : AccelTableEmitter(Asm, Contents, false),
  450. Header(CompUnits.size(), Contents.getBucketCount(),
  451. Contents.getUniqueNameCount()),
  452. DD(DD), CompUnits(CompUnits) {
  453. DenseSet<uint32_t> UniqueTags = getUniqueTags();
  454. SmallVector<AttributeEncoding, 2> UniformAttributes = getUniformAttributes();
  455. Abbreviations.reserve(UniqueTags.size());
  456. for (uint32_t Tag : UniqueTags)
  457. Abbreviations.try_emplace(Tag, UniformAttributes);
  458. }
  459. void Dwarf5AccelTableEmitter::emit() const {
  460. Header.emit(*this);
  461. emitCUList();
  462. emitBuckets();
  463. emitHashes();
  464. emitStringOffsets();
  465. emitOffsets(EntryPool);
  466. emitAbbrevs();
  467. emitData();
  468. Asm->OutStreamer->EmitValueToAlignment(4, 0);
  469. Asm->OutStreamer->EmitLabel(ContributionEnd);
  470. }
  471. void llvm::emitAppleAccelTableImpl(AsmPrinter *Asm, AccelTableBase &Contents,
  472. StringRef Prefix, const MCSymbol *SecBegin,
  473. ArrayRef<AppleAccelTableData::Atom> Atoms) {
  474. Contents.finalize(Asm, Prefix);
  475. AppleAccelTableEmitter(Asm, Contents, Atoms, SecBegin).emit();
  476. }
  477. void llvm::emitDWARF5AccelTable(
  478. AsmPrinter *Asm, AccelTable<DWARF5AccelTableData> &Contents,
  479. const DwarfDebug &DD, ArrayRef<std::unique_ptr<DwarfCompileUnit>> CUs) {
  480. Contents.finalize(Asm, "names");
  481. Dwarf5AccelTableEmitter(Asm, Contents, DD, CUs).emit();
  482. }
  483. void AppleAccelTableOffsetData::emit(AsmPrinter *Asm) const {
  484. Asm->emitInt32(Die->getDebugSectionOffset());
  485. }
  486. void AppleAccelTableTypeData::emit(AsmPrinter *Asm) const {
  487. Asm->emitInt32(Die->getDebugSectionOffset());
  488. Asm->emitInt16(Die->getTag());
  489. Asm->emitInt8(0);
  490. }
  491. void AppleAccelTableStaticOffsetData::emit(AsmPrinter *Asm) const {
  492. Asm->emitInt32(Offset);
  493. }
  494. void AppleAccelTableStaticTypeData::emit(AsmPrinter *Asm) const {
  495. Asm->emitInt32(Offset);
  496. Asm->emitInt16(Tag);
  497. Asm->emitInt8(ObjCClassIsImplementation ? dwarf::DW_FLAG_type_implementation
  498. : 0);
  499. Asm->emitInt32(QualifiedNameHash);
  500. }
  501. #ifndef _MSC_VER
  502. // The lines below are rejected by older versions (TBD) of MSVC.
  503. constexpr AppleAccelTableData::Atom AppleAccelTableTypeData::Atoms[];
  504. constexpr AppleAccelTableData::Atom AppleAccelTableOffsetData::Atoms[];
  505. constexpr AppleAccelTableData::Atom AppleAccelTableStaticOffsetData::Atoms[];
  506. constexpr AppleAccelTableData::Atom AppleAccelTableStaticTypeData::Atoms[];
  507. #else
  508. // FIXME: Erase this path once the minimum MSCV version has been bumped.
  509. const SmallVector<AppleAccelTableData::Atom, 4>
  510. AppleAccelTableOffsetData::Atoms = {
  511. Atom(dwarf::DW_ATOM_die_offset, dwarf::DW_FORM_data4)};
  512. const SmallVector<AppleAccelTableData::Atom, 4> AppleAccelTableTypeData::Atoms =
  513. {Atom(dwarf::DW_ATOM_die_offset, dwarf::DW_FORM_data4),
  514. Atom(dwarf::DW_ATOM_die_tag, dwarf::DW_FORM_data2),
  515. Atom(dwarf::DW_ATOM_type_flags, dwarf::DW_FORM_data1)};
  516. const SmallVector<AppleAccelTableData::Atom, 4>
  517. AppleAccelTableStaticOffsetData::Atoms = {
  518. Atom(dwarf::DW_ATOM_die_offset, dwarf::DW_FORM_data4)};
  519. const SmallVector<AppleAccelTableData::Atom, 4>
  520. AppleAccelTableStaticTypeData::Atoms = {
  521. Atom(dwarf::DW_ATOM_die_offset, dwarf::DW_FORM_data4),
  522. Atom(dwarf::DW_ATOM_die_tag, dwarf::DW_FORM_data2),
  523. Atom(5, dwarf::DW_FORM_data1), Atom(6, dwarf::DW_FORM_data4)};
  524. #endif
  525. #ifndef NDEBUG
  526. void AppleAccelTableEmitter::Header::print(raw_ostream &OS) const {
  527. OS << "Magic: " << format("0x%x", Magic) << "\n"
  528. << "Version: " << Version << "\n"
  529. << "Hash Function: " << HashFunction << "\n"
  530. << "Bucket Count: " << BucketCount << "\n"
  531. << "Header Data Length: " << HeaderDataLength << "\n";
  532. }
  533. void AppleAccelTableData::Atom::print(raw_ostream &OS) const {
  534. OS << "Type: " << dwarf::AtomTypeString(Type) << "\n"
  535. << "Form: " << dwarf::FormEncodingString(Form) << "\n";
  536. }
  537. void AppleAccelTableEmitter::HeaderData::print(raw_ostream &OS) const {
  538. OS << "DIE Offset Base: " << DieOffsetBase << "\n";
  539. for (auto Atom : Atoms)
  540. Atom.print(OS);
  541. }
  542. void AppleAccelTableEmitter::print(raw_ostream &OS) const {
  543. Header.print(OS);
  544. HeaderData.print(OS);
  545. Contents.print(OS);
  546. SecBegin->print(OS, nullptr);
  547. }
  548. void AccelTableBase::HashData::print(raw_ostream &OS) const {
  549. OS << "Name: " << Name.getString() << "\n";
  550. OS << " Hash Value: " << format("0x%x", HashValue) << "\n";
  551. OS << " Symbol: ";
  552. if (Sym)
  553. OS << *Sym;
  554. else
  555. OS << "<none>";
  556. OS << "\n";
  557. for (auto *Value : Values)
  558. Value->print(OS);
  559. }
  560. void AccelTableBase::print(raw_ostream &OS) const {
  561. // Print Content.
  562. OS << "Entries: \n";
  563. for (const auto &Entry : Entries) {
  564. OS << "Name: " << Entry.first() << "\n";
  565. for (auto *V : Entry.second.Values)
  566. V->print(OS);
  567. }
  568. OS << "Buckets and Hashes: \n";
  569. for (auto &Bucket : Buckets)
  570. for (auto &Hash : Bucket)
  571. Hash->print(OS);
  572. OS << "Data: \n";
  573. for (auto &E : Entries)
  574. E.second.print(OS);
  575. }
  576. void DWARF5AccelTableData::print(raw_ostream &OS) const {
  577. OS << " Offset: " << Die.getOffset() << "\n";
  578. OS << " Tag: " << dwarf::TagString(Die.getTag()) << "\n";
  579. }
  580. void AppleAccelTableOffsetData::print(raw_ostream &OS) const {
  581. OS << " Offset: " << Die->getOffset() << "\n";
  582. }
  583. void AppleAccelTableTypeData::print(raw_ostream &OS) const {
  584. OS << " Offset: " << Die->getOffset() << "\n";
  585. OS << " Tag: " << dwarf::TagString(Die->getTag()) << "\n";
  586. }
  587. void AppleAccelTableStaticOffsetData::print(raw_ostream &OS) const {
  588. OS << " Static Offset: " << Offset << "\n";
  589. }
  590. void AppleAccelTableStaticTypeData::print(raw_ostream &OS) const {
  591. OS << " Static Offset: " << Offset << "\n";
  592. OS << " QualifiedNameHash: " << format("%x\n", QualifiedNameHash) << "\n";
  593. OS << " Tag: " << dwarf::TagString(Tag) << "\n";
  594. OS << " ObjCClassIsImplementation: "
  595. << (ObjCClassIsImplementation ? "true" : "false");
  596. OS << "\n";
  597. }
  598. #endif