Lines Matching defs:Buckets

86   Bucket *Buckets;
90 void insert(Bucket *Buckets, size_t Size, Item *E) {
91 Bucket &B = Buckets[E->Hash & (Size - 1)];
102 for (Item *E = Buckets[I].Head; E;) {
109 free(Buckets);
111 Buckets = NewBuckets;
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj));
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next)
173 Bucket &B = Buckets[I];
220 LE.write<offset_type>(Buckets[I].Off);
230 Buckets = (Bucket *)std::calloc(NumBuckets, sizeof(Bucket));
233 ~OnDiskChainedHashTableGenerator() { std::free(Buckets); }
277 const unsigned char *const Buckets;
290 const unsigned char *Buckets,
293 : NumBuckets(NumBuckets), NumEntries(NumEntries), Buckets(Buckets),
295 assert((reinterpret_cast<uintptr_t>(Buckets) & 0x3) == 0 &&
300 /// produced by OnDiskHashTableGenerator::Emit, and advance the Buckets
303 readNumBucketsAndEntries(const unsigned char *&Buckets) {
304 assert((reinterpret_cast<uintptr_t>(Buckets) & 0x3) == 0 &&
308 endian::readNext<offset_type, little, aligned>(Buckets);
310 endian::readNext<offset_type, little, aligned>(Buckets);
317 const unsigned char *getBuckets() const { return Buckets; }
359 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx;
409 /// \param Buckets is the beginning of the hash table itself, which follows
416 static OnDiskChainedHashTable *Create(const unsigned char *Buckets,
419 assert(Buckets > Base);
420 auto NumBucketsAndEntries = readNumBucketsAndEntries(Buckets);
423 Buckets, Base, InfoObj);
493 const unsigned char *Buckets,
497 : base_type(NumBuckets, NumEntries, Buckets, Base, InfoObj),
591 /// \param Buckets is the beginning of the hash table itself, which follows
603 Create(const unsigned char *Buckets, const unsigned char *const Payload,
605 assert(Buckets > Base);
607 OnDiskIterableChainedHashTable<Info>::readNumBucketsAndEntries(Buckets);
610 Buckets, Payload, Base, InfoObj);