HomeSort by: relevance | last modified time | path
    Searched defs:Buckets (Results 1 - 10 of 10) sorted by relevancy

  /src/external/apache2/llvm/dist/clang/lib/Serialization/
MultiOnDiskHashTable.h 67 storage_type Buckets, storage_type Payload, storage_type Base,
70 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {}
216 storage_type Buckets = Data + BucketOffset;
218 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
223 Buckets, Ptr, Data, std::move(InfoObj));
  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
AccelTable.h 45 /// | BUCKETS |
55 /// the number of buckets, total number of hashes, and room for a special struct
58 /// The buckets contain an index (e.g. 6) into the hashes array. The hashes
63 /// number of buckets giving us our bucket. From there we take the bucket value
170 BucketList Buckets;
178 ArrayRef<HashList> getBuckets() const { return Buckets; }
193 /// consisting of a sequence of buckets, each bucket containint a sequence of
209 assert(Buckets.empty() && "Already finalized!");
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
HashTable.h 74 return Map->Buckets[Index];
83 while (Index < Map->Buckets.size()) {
115 HashTable() { Buckets.resize(8); }
117 Buckets.resize(Capacity);
131 Buckets.resize(H->Capacity);
146 if (auto EC = Stream.readInteger(Buckets[P].first))
151 Buckets[P].second = *Value;
207 Buckets.resize(8);
213 uint32_t capacity() const { return Buckets.size(); }
228 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Support/
FoldingSet.cpp 192 /// The problem with this is that the start of the hash buckets are not
213 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) {
216 return Buckets + BucketNum;
221 void **Buckets = static_cast<void**>(safe_calloc(NumBuckets + 1,
224 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
225 return Buckets;
235 Buckets = AllocateBuckets(NumBuckets);
240 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) {
241 Arg.Buckets = nullptr
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
FoldingSet.h 35 /// "buckets" are actually the nodes themselves (the next pointer is in the
107 /// structure is an array of buckets. Each bucket is indexed by the hash of
114 /// Buckets - Array of bucket chains.
115 void **Buckets;
117 /// NumBuckets - Length of the Buckets array. Always a power of 2.
121 /// is greater than twice the number of buckets.
198 /// reserve - Increase the number of buckets such that adding the
420 iterator begin() { return iterator(Buckets); }
421 iterator end() { return iterator(Buckets+NumBuckets); }
425 const_iterator begin() const { return const_iterator(Buckets); }
    [all...]
DenseMap.h 76 // empty buckets.
346 /// somewhere into the DenseMap's array of buckets (i.e. either to a key or
352 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
378 "# initial buckets must be a power of two!");
384 /// Returns the number of buckets to allocate to ensure that the DenseMap can
570 // the buckets are empty (meaning that many are filled with tombstones),
592 // so that when growing buckets we have self-consistent entry count.
722 BucketT *Buckets;
755 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT));
761 std::swap(Buckets, RHS.Buckets)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
AccelTable.cpp 67 // Figure out how many buckets we need, then compute the bucket contents and
74 Buckets.resize(BucketCount);
77 Buckets[Bucket].push_back(&E.second);
81 // Sort the contents of the buckets by hash value so that hash collisions end
83 for (auto &Bucket : Buckets)
263 const auto &Buckets = Contents.getBuckets();
265 for (size_t i = 0, e = Buckets.size(); i < e; ++i) {
266 for (auto *Hash : Buckets[i]) {
307 const auto &Buckets = Contents.getBuckets();
309 for (size_t i = 0, e = Buckets.size(); i < e; ++i)
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Support/
OnDiskHashTable.h 85 Bucket *Buckets;
89 void insert(Bucket *Buckets, size_t Size, Item *E) {
90 Bucket &B = Buckets[E->Hash & (Size - 1)];
96 /// Resize the hash table, moving the old entries into the new buckets.
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)
158 // 64 buckets.) We aim for an occupancy ratio in [3/8, 3/4)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCLoopInstrFormPrep.cpp 200 /// Add a candidate to candidates \p Buckets.
202 SmallVector<Bucket, 16> &Buckets,
205 /// Prepare all candidates in \p Buckets for update form.
206 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
208 /// Prepare all candidates in \p Buckets for displacement form, now for
210 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
310 SmallVector<Bucket, 16> &Buckets,
316 for (auto &B : Buckets) {
326 if (Buckets.size() == MaxCandidateNum)
328 Buckets.push_back(Bucket(LSCEV, MemI))
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/
ELFDumper.cpp 2449 W.printNumber("Num Buckets", HashTable->nbucket);
2458 W.printList("Buckets", HashTable->buckets());
2480 // and have dummy null values in the Bloom filter and in the buckets
2485 ArrayRef<typename ELFT::Word> Buckets = GnuHashTable->buckets();
2486 if (!llvm::all_of(Buckets, [](typename ELFT::Word V) { return V == 0; }))
2505 W.printNumber("Num Buckets", GnuHashTable->nbuckets);
2519 ArrayRef<Elf_Word> Buckets = GnuHashTable->buckets();
    [all...]

Completed in 40 milliseconds