Lines Matching full:contents

55   // Figure out how many buckets we need, then compute the bucket contents and
61 // Compute bucket contents and final ordering.
69 // Sort the contents of the buckets by hash value so that hash collisions end
83 const AccelTableBase &Contents; ///< Data to emit.
97 AccelTableWriter(AsmPrinter *Asm, const AccelTableBase &Contents,
99 : Asm(Asm), Contents(Contents), SkipIdenticalHashes(SkipIdenticalHashes) {
156 AppleAccelTableWriter(AsmPrinter *Asm, const AccelTableBase &Contents,
158 : AccelTableWriter(Asm, Contents, true),
159 Header(Contents.getBucketCount(), Contents.getUniqueHashCount(),
235 AsmPrinter *Asm, const AccelTableBase &Contents,
253 for (const auto &Bucket : Contents.getBuckets()) {
267 const auto &Buckets = Contents.getBuckets();
311 const auto &Buckets = Contents.getBuckets();
332 const auto &Buckets = Contents.getBuckets();
431 for (auto &Bucket : Contents.getBuckets()) {
487 for (const auto &Bucket : enumerate(Contents.getBuckets())) {
495 for (const auto &Bucket : enumerate(Contents.getBuckets())) {
586 for (auto &Bucket : Contents.getBuckets()) {
599 AsmPrinter *Asm, const AccelTableBase &Contents,
606 : AccelTableWriter(Asm, Contents, false),
608 IsSplitDwarf ? TypeUnits.size() : 0, Contents.getBucketCount(),
609 Contents.getUniqueNameCount()),
614 for (auto &Bucket : Contents.getBuckets())
636 void llvm::emitAppleAccelTableImpl(AsmPrinter *Asm, AccelTableBase &Contents,
639 Contents.finalize(Asm, Prefix);
640 AppleAccelTableWriter(Asm, Contents, Atoms, SecBegin).emit();
644 AsmPrinter *Asm, DWARF5AccelTable &Contents, const DwarfDebug &DD,
646 TUVectorTy TUSymbols = Contents.getTypeUnitsSymbols();
682 Contents.finalize(Asm, "names");
688 Asm, Contents, CompUnits, TypeUnits,
712 AsmPrinter *Asm, DWARF5AccelTable &Contents,
718 Contents.finalize(Asm, "names");
719 Dwarf5AccelTableWriter(Asm, Contents, CUs, TypeUnits, getIndexForEntry, false)
777 Contents.print(OS);