Lines Matching refs:Table
10 // This file provides a hash table data structure suitable for incremental and
14 // performance, and on reload the merged table will override those from other
35 /// A pointer to an on-disk representation of the hash table.
45 /// \brief A hash table stored on disk.
50 HashTable Table;
56 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
64 typedef llvm::PointerUnion<OnDiskTable*, MergedTable*> Table;
68 /// We manually store the opaque value of the Table because TinyPtrVector
71 /// it is the first table.
81 return Table::getFromOpaqueValue(P).template get<OnDiskTable *>();
98 // If we already have a merged table, it's the first one.
99 return Tables.empty() ? nullptr : Table::getFromOpaqueValue(*Tables.begin())
117 auto *ODT = Table::getFromOpaqueValue(T).template get<OnDiskTable *>();
137 auto &HT = ODT->Table;
156 Tables.push_back(Table(Merged).getOpaqueValue());
159 /// The generator is permitted to read our merged table.
181 /// \brief Add the table \p Data loaded from file \p File.
204 // Register the table.
205 Table NewTable = new OnDiskTable(File, NumBucketsAndEntries.first,
233 auto &HT = ODT->Table;
258 auto &HT = ODT->Table;
274 /// \brief Writer for the on-disk hash table.
318 // Write the table itself.
