| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket;
41 // Remove an entry from the free list in Bucket[Idx] and return it.
44 if (Idx >= Bucket.size())
46 FreeList *Entry = Bucket[Idx];
50 Bucket[Idx] = Entry->Next;
55 // Add an entry to the free list at Bucket[Idx].
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
62 Bucket[Idx] = Entry
[all...] |
| OnDiskHashTable.h | 78 /// A linked list of values in a particular hash bucket.
79 struct Bucket {
85 Bucket *Buckets;
88 /// Insert an item into the appropriate hash bucket.
89 void insert(Bucket *Buckets, size_t Size, Item *E) {
90 Bucket &B = Buckets[E->Hash & (Size - 1)];
98 Bucket *NewBuckets = static_cast<Bucket *>(
99 safe_calloc(NewSize, sizeof(Bucket)));
155 // Now we're done adding entries, resize the bucket list if it'
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| StringMap.h | 56 /// LookupBucketFor - Look up the bucket that the specified string should end
58 /// specified bucket will be non-null. Otherwise, it will be null. In either
59 /// case, the FullHashValue field of the bucket will be set to the hash value
63 /// FindKey - Look up the bucket that contains the specified key. If it exists
64 /// in the map, return the bucket number of the key. Otherwise return -1.
152 StringMapEntryBase *Bucket = RHS.TheTable[I];
153 if (!Bucket || Bucket == getTombstoneVal()) {
154 TheTable[I] = Bucket;
159 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator
[all...] |
| SmallPtrSet.h | 187 auto *Bucket = FindBucketFor(Ptr);
188 if (*Bucket == Ptr)
189 return Bucket;
223 const void *const *Bucket;
228 : Bucket(BP), End(E) {
237 return Bucket == RHS.Bucket;
240 return Bucket != RHS.Bucket;
244 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucke
[all...] |
| FoldingSet.h | 31 /// it, otherwise return the bucket it should be inserted into.
36 /// node). The last node points back to the bucket to simplify node removal.
107 /// structure is an array of buckets. Each bucket is indexed by the hash of
108 /// the nodes it contains. The bucket itself points to the nodes contained
109 /// in the bucket via a singly linked list. The last node in the list points
110 /// back to the bucket to facilitate node removal.
114 /// Buckets - Array of bucket chains.
131 /// Node - This class is used to maintain the singly linked bucket list in
135 // NextInFoldingSetBucket - next link in the bucket list.
191 /// bucket count
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| FoldingSet.cpp | 189 /// GetNextPtr - In order to save space, each bucket is a
193 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
196 // The low bit is set if this is the pointer back to the bucket.
207 assert((Ptr & 1) && "Not a bucket pointer");
211 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
219 /// AllocateBuckets - Allocated initialized bucket memory.
223 // Set the very last bucket to be a non-null "pointer".
262 // Set all but the last bucket to null pointers.
265 // Set the very last bucket to be a non-null "pointer".
276 assert(isPowerOf2_32(NewBucketCount) && "Bad bucket count!")
[all...] |
| SmallPtrSet.cpp | 50 // Okay, we know we have space. Find a hash bucket.
51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr));
52 if (*Bucket == Ptr)
53 return std::make_pair(Bucket, false); // Already inserted, good.
56 if (*Bucket == getTombstoneMarker())
60 *Bucket = Ptr;
62 return std::make_pair(Bucket, true);
66 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1);
72 // If we found an empty bucket, the pointer doesn't exist in the set.
73 // Return a tombstone if we've seen one so far, or the empty bucket i
[all...] |
| StringMap.cpp | 64 // Allocate one extra bucket, set it to look filled so the iterators stop at
69 /// LookupBucketFor - Look up the bucket that the specified string should end
71 /// specified bucket will be non-null. Otherwise, it will be null. In either
72 /// case, the FullHashValue field of the bucket will be set to the hash value
88 // If we found an empty bucket, this key isn't in the table yet, return it.
91 // empty bucket. This reduces probing.
120 // Okay, we didn't find the item. Probe to the next bucket.
129 /// FindKey - Look up the bucket that contains the specified key. If it exists
130 /// in the map, return the bucket number of the key. Otherwise return -1.
143 // If we found an empty bucket, this key isn't in the table yet, return
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCLoopInstrFormPrep.cpp | 135 struct Bucket {
136 Bucket(const SCEV *B, Instruction *I) : BaseSCEV(B),
194 SmallVector<Bucket, 16>
202 SmallVector<Bucket, 16> &Buckets,
206 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
210 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
219 bool prepareBaseForDispFormChain(Bucket &BucketChain,
227 bool prepareBaseForUpdateFormChain(Bucket &BucketChain);
231 bool rewriteLoadStores(Loop *L, Bucket &BucketChain,
310 SmallVector<Bucket, 16> &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
73 // Compute bucket contents and final ordering.
76 uint32_t Bucket = E.second.HashValue % BucketCount;
77 Buckets[Bucket].push_back(&E.second);
83 for (auto &Bucket : Buckets)
84 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) {
249 for (auto &Bucket : Contents.getBuckets()) {
250 for (auto &Hash : Bucket) {
254 Asm->OutStreamer->AddComment("Hash in Bucket " + Twine(BucketIdx));
271 Asm->OutStreamer->AddComment("Offset in Bucket " + Twine(i))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFAcceleratorTable.cpp | 142 W.printNumber("Bucket count", BucketCount);
230 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) {
233 ListScope BucketScope(W, ("Bucket " + Twine(Bucket)).str());
244 if (Hash % Hdr.BucketCount != Bucket)
333 // Find the bucket.
335 unsigned Bucket = HashValue % Hdr.BucketCount;
340 uint64_t BucketOffset = BucketBase + Bucket * 4
[all...] |
| DWARFVerifier.cpp | 900 error() << format("Bucket[%d] has invalid hash index: %u.\n", BucketIdx,
949 "%s Bucket[%d] Hash[%d] = 0x%08x "
1025 uint32_t Bucket;
1028 constexpr BucketInfo(uint32_t Bucket, uint32_t Index)
1029 : Bucket(Bucket), Index(Index) {}
1040 // Build up a list of (Bucket, Index) pairs. We use this later to verify that
1041 // each Name is reachable from the appropriate bucket.
1044 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket)
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/ubsan/ |
| ubsan_type_hash_itanium.cc | 96 /// Find a bucket to store the given hash value in.
216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash);
217 if (*Bucket == Hash) {
243 *Bucket = Hash;
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_addrhashmap.h | 63 struct Bucket {
88 Bucket *bucket_;
98 // ForEach acquires a lock on each bucket while iterating over
105 Bucket *table_;
115 Bucket *bucket = &table_[n]; local
117 ReadLock lock(&bucket->mtx);
120 Cell *c = &bucket->cells[i];
128 (AddBucket *)atomic_load(&bucket->add, memory_order_acquire)) {
200 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap")
[all...] |
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_addrhashmap.h | 63 struct Bucket {
88 Bucket *bucket_;
98 // ForEach acquires a lock on each bucket while iterating over
105 Bucket *table_;
115 Bucket *bucket = &table_[n]; local
117 ReadLock lock(&bucket->mtx);
120 Cell *c = &bucket->cells[i];
128 (AddBucket *)atomic_load(&bucket->add, memory_order_acquire)) {
200 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap")
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| unordered_dense.h | 137 throw std::overflow_error("ankerl::unordered_dense: reached max bucket size, cannot increase size");
422 uint32_t m_dist_and_fingerprint; // upper 3 byte: distance to original bucket. lower byte: fingerprint from hash
430 uint32_t m_dist_and_fingerprint; // upper 3 byte: distance to original bucket. lower byte: fingerprint from hash
798 class Bucket,
812 typename std::allocator_traits<typename value_container_type::allocator_type>::template rebind_alloc<Bucket>;
832 using bucket_type = Bucket;
835 using value_idx_type = decltype(Bucket::m_value_idx);
836 using dist_and_fingerprint_type = decltype(Bucket::m_dist_and_fingerprint);
838 static_assert(std::is_trivially_destructible_v<Bucket>, "assert there's no need to call destructor / std::destroy");
839 static_assert(std::is_trivially_copyable_v<Bucket>, "assert we can just memset / memcpy")
1100 auto* bucket = &at(m_buckets, bucket_idx); variable
1126 auto* bucket = &at(m_buckets, bucket_idx); variable
1446 auto const& bucket = at(m_buckets, bucket_idx); local
[all...] |
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| unordered_dense.h | 137 throw std::overflow_error("ankerl::unordered_dense: reached max bucket size, cannot increase size");
422 uint32_t m_dist_and_fingerprint; // upper 3 byte: distance to original bucket. lower byte: fingerprint from hash
430 uint32_t m_dist_and_fingerprint; // upper 3 byte: distance to original bucket. lower byte: fingerprint from hash
798 class Bucket,
812 typename std::allocator_traits<typename value_container_type::allocator_type>::template rebind_alloc<Bucket>;
832 using bucket_type = Bucket;
835 using value_idx_type = decltype(Bucket::m_value_idx);
836 using dist_and_fingerprint_type = decltype(Bucket::m_dist_and_fingerprint);
838 static_assert(std::is_trivially_destructible_v<Bucket>, "assert there's no need to call destructor / std::destroy");
839 static_assert(std::is_trivially_copyable_v<Bucket>, "assert we can just memset / memcpy")
1100 auto* bucket = &at(m_buckets, bucket_idx); variable
1126 auto* bucket = &at(m_buckets, bucket_idx); variable
1446 auto const& bucket = at(m_buckets, bucket_idx); local
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 59 struct Bucket {
84 Bucket *bucket_;
95 Bucket *table_;
163 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap");
170 Bucket *b = &table_[hash];
177 // If we want to remove the element, we need exclusive access to the bucket,
299 Bucket *b = h->bucket_;
313 // See if we need to compact the bucket.
|
| /src/external/apache2/llvm/dist/clang/lib/Lex/ |
| HeaderMap.cpp | 125 /// getBucket - Return the specified hash table bucket from the header map,
126 /// bswap'ing its fields as appropriate. If the bucket number is not valid,
127 /// this return a bucket with an empty key (0).
131 "Expected bucket to be in range");
219 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) {
220 HMapBucket B = getBucket(Bucket & (NumBuckets-1));
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| TpiStream.cpp | 164 uint32_t Bucket = hashStringV1(Name) % Header->NumHashBuckets;
165 if (Bucket > HashMap.size())
169 for (TypeIndex TI : HashMap[Bucket]) {
|
| /src/external/gpl3/gcc/dist/libsanitizer/ubsan/ |
| ubsan_type_hash_itanium.cpp | 108 /// Find a bucket to store the given hash value in.
228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash);
229 if (*Bucket == Hash) {
255 *Bucket = Hash;
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/ |
| ubsan_type_hash_itanium.cpp | 96 /// Find a bucket to store the given hash value in.
216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash);
217 if (*Bucket == Hash) {
243 *Bucket = Hash;
|
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| Descriptor.cpp | 273 unsigned Bucket = I / PER_FIELD;
275 if (!(data()[Bucket] & Mask)) {
276 data()[Bucket] |= Mask;
283 unsigned Bucket = I / PER_FIELD;
285 return data()[Bucket] & Mask;
|
| /src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| aaA.d | 71 Bucket[] buckets;
105 inout(Bucket)* findSlotInsert(size_t hash) inout pure nothrow @nogc
116 inout(Bucket)* findSlotLookup(size_t hash, scope const void* pkey, scope const TypeInfo keyti) inout
162 // clear all data, but don't change bucket array length
163 memset(&buckets[firstUsed], 0, (buckets.length - firstUsed) * Bucket.sizeof);
170 // Bucket
173 private struct Bucket
195 Bucket[] allocBuckets(size_t dim) @trusted pure nothrow
198 immutable sz = dim * Bucket.sizeof;
199 return (cast(Bucket*) GC.calloc(sz, attr))[0 .. dim]
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| RDFLiveness.cpp | 229 for (auto &Bucket : Blocks) {
230 TmpBB.push_back(Bucket.first);
231 if (Bucket.second.size() > 2)
232 GetOrder(*Bucket.first);
233 llvm::sort(Bucket.second, Precedes);
242 auto &Bucket = Blocks[MBB];
243 TmpInst.insert(TmpInst.end(), Bucket.rbegin(), Bucket.rend());
|
