| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | StringMap.h | 152 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
153 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
154 TheTable[I] = Bucket; in StringMap()
159 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, in StringMap()
160 static_cast<MapEntryTy *>(Bucket)->getValue()); in StringMap()
184 StringMapEntryBase *Bucket = TheTable[I]; in ~StringMap() local
185 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
186 static_cast<MapEntryTy *>(Bucket)->Destroy(Allocator); in ~StringMap()
219 int Bucket = FindKey(Key); in find() local
220 if (Bucket == -1) in find()
[all …]
|
| H A D | SmallPtrSet.h | 187 auto *Bucket = FindBucketFor(Ptr); in find_imp() local
188 if (*Bucket == Ptr) in find_imp()
189 return Bucket; in find_imp()
223 const void *const *Bucket;
228 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
237 return Bucket == RHS.Bucket;
240 return Bucket != RHS.Bucket;
248 assert(Bucket <= End); in AdvanceIfNotValid()
249 while (Bucket != End && in AdvanceIfNotValid()
250 (*Bucket == SmallPtrSetImplBase::getEmptyMarker() || in AdvanceIfNotValid()
[all …]
|
| H A D | FoldingSet.h | 669 FoldingSetIteratorImpl(void **Bucket);
684 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
711 explicit FoldingSetBucketIteratorImpl(void **Bucket);
713 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl() argument
733 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
734 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
736 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
737 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
|
| H A D | DenseMap.h | 54 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
1187 template <typename KeyT, typename ValueT, typename KeyInfoT, typename Bucket,
1190 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1191 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, false>;
1196 typename std::conditional<IsConst, const Bucket, Bucket>::type;
1227 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/ |
| H A D | FoldingSet.cpp | 329 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); in FindNodeOrInsertPos() local
330 void *Probe = *Bucket; in FindNodeOrInsertPos()
344 InsertPos = Bucket; in FindNodeOrInsertPos()
365 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
367 void *Next = *Bucket; in InsertNode()
373 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); in InsertNode()
377 *Bucket = N; in InsertNode()
407 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
408 Ptr = *Bucket; in RemoveNode()
413 *Bucket = NodeNextPtr; in RemoveNode()
[all …]
|
| H A D | SmallPtrSet.cpp | 51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp_big() local
52 if (*Bucket == Ptr) in insert_imp_big()
53 return std::make_pair(Bucket, false); // Already inserted, good. in insert_imp_big()
56 if (*Bucket == getTombstoneMarker()) in insert_imp_big()
60 *Bucket = Ptr; in insert_imp_big()
62 return std::make_pair(Bucket, true); in insert_imp_big()
66 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local
75 if (LLVM_LIKELY(Array[Bucket] == getEmptyMarker())) in FindBucketFor()
76 return Tombstone ? Tombstone : Array+Bucket; in FindBucketFor()
79 if (LLVM_LIKELY(Array[Bucket] == Ptr)) in FindBucketFor()
[all …]
|
| H A D | StringMap.cpp | 185 int Bucket = FindKey(Key); in RemoveKey() local
186 if (Bucket == -1) in RemoveKey()
189 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
190 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
228 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
229 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
234 NewTableArray[FullHash & (NewSize - 1)] = Bucket; in RehashTable()
248 NewTableArray[NewBucket] = Bucket; in RehashTable()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| H A D | ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket; variable
44 if (Idx >= Bucket.size()) in pop()
46 FreeList *Entry = Bucket[Idx]; in pop()
50 Bucket[Idx] = Entry->Next; in pop()
59 if (Idx >= Bucket.size()) in push()
60 Bucket.resize(size_t(Idx) + 1); in push()
61 Entry->Next = Bucket[Idx]; in push()
62 Bucket[Idx] = Entry; in push()
98 assert(Bucket.empty() && "Non-empty ArrayRecycler deleted!"); in ~ArrayRecycler()
105 for (; !Bucket.empty(); Bucket.pop_back()) in clear()
[all …]
|
| H A D | OnDiskHashTable.h | 79 struct Bucket { struct
85 Bucket *Buckets; argument
89 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert()
90 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
98 Bucket *NewBuckets = static_cast<Bucket *>( in resize()
99 safe_calloc(NewSize, sizeof(Bucket))); in resize()
173 Bucket &B = Buckets[I]; in Emit()
230 Buckets = static_cast<Bucket *>(safe_calloc(NumBuckets, sizeof(Bucket))); in OnDiskChainedHashTableGenerator()
359 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; variable
361 offset_type Offset = endian::readNext<offset_type, little, aligned>(Bucket);
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 135 struct Bucket { struct
136 Bucket(const SCEV *B, Instruction *I) : BaseSCEV(B), in Bucket() argument
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, in addOneCandidate() argument
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 76 uint32_t Bucket = E.second.HashValue % BucketCount; in finalize() local
77 Buckets[Bucket].push_back(&E.second); in finalize()
83 for (auto &Bucket : Buckets) in finalize() local
84 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) { in finalize()
249 for (auto &Bucket : Contents.getBuckets()) { in emitHashes() local
250 for (auto &Hash : Bucket) { in emitHashes()
329 for (const AccelTableBase::HashList &Bucket : Buckets) { in emitData() local
331 for (auto &Hash : Bucket) { in emitData()
348 if (!Bucket.empty()) in emitData()
395 for (auto &Bucket : Contents.getBuckets()) { in getUniqueTags() local
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFAcceleratorTable.cpp | 230 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
233 ListScope BucketScope(W, ("Bucket " + Twine(Bucket)).str()); in dump()
244 if (Hash % Hdr.BucketCount != Bucket) in dump()
335 unsigned Bucket = HashValue % Hdr.BucketCount; in equal_range() local
340 uint64_t BucketOffset = BucketBase + Bucket * 4; in equal_range()
349 if (Hash % Hdr.BucketCount != Bucket) in equal_range()
654 DWARFDebugNames::NameIndex::getBucketArrayEntry(uint32_t Bucket) const { in getBucketArrayEntry()
655 assert(Bucket < Hdr.BucketCount); in getBucketArrayEntry()
656 uint64_t BucketOffset = BucketsBase + 4 * Bucket; in getBucketArrayEntry()
734 uint32_t Bucket) const { in dumpBucket()
[all …]
|
| H A D | DWARFVerifier.cpp | 1025 uint32_t Bucket; in verifyNameIndexBuckets() member
1028 constexpr BucketInfo(uint32_t Bucket, uint32_t Index) in verifyNameIndexBuckets()
1029 : Bucket(Bucket), Index(Index) {} in verifyNameIndexBuckets()
1044 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
1045 uint32_t Index = NI.getBucketArrayEntry(Bucket); in verifyNameIndexBuckets()
1049 Bucket, NI.getUnitOffset(), Index, NI.getNameCount()); in verifyNameIndexBuckets()
1054 BucketStarts.emplace_back(Bucket, Index); in verifyNameIndexBuckets()
1090 if (B.Bucket == NI.getBucketCount()) in verifyNameIndexBuckets()
1099 if (FirstHash % NI.getBucketCount() != B.Bucket) { in verifyNameIndexBuckets()
1103 NI.getUnitOffset(), B.Bucket, FirstHash, in verifyNameIndexBuckets()
[all …]
|
| /netbsd-src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_addrhashmap.h | 63 struct Bucket { struct
88 Bucket *bucket_; argument
105 Bucket *table_;
115 Bucket *bucket = &table_[n]; in ForEach()
200 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap"); in AddrHashMap()
207 Bucket *b = &table_[hash]; in acquire()
336 Bucket *b = h->bucket_; in release()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_addrhashmap.h | 57 struct Bucket { struct
82 Bucket *bucket_; argument
93 Bucket *table_;
161 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap"); in AddrHashMap()
168 Bucket *b = &table_[hash]; in acquire()
297 Bucket *b = h->bucket_; in release()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| H A D | sanitizer_addrhashmap.h | 59 struct Bucket { struct
84 Bucket *bucket_; argument
95 Bucket *table_;
163 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap"); in AddrHashMap()
170 Bucket *b = &table_[hash]; in acquire()
299 Bucket *b = h->bucket_; in release()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/ubsan/ |
| H A D | ubsan_type_hash_itanium.cc | 215 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
216 if (*Bucket == Hash) { in checkDynamicType()
242 *Bucket = Hash; in checkDynamicType()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/ubsan/ |
| H A D | ubsan_type_hash_itanium.cc | 216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
217 if (*Bucket == Hash) { in checkDynamicType()
243 *Bucket = Hash; in checkDynamicType()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/libdruntime/rt/ |
| H A D | aaA.d | 68 Bucket[] buckets;
102 inout(Bucket)* findSlotInsert(size_t hash) inout pure nothrow @nogc in inout() argument
113 inout(Bucket)* findSlotLookup(size_t hash, in void* pkey, in TypeInfo keyti) inout in inout() argument
160 memset(&buckets[firstUsed], 0, (buckets.length - firstUsed) * Bucket.sizeof); in clear()
170 private struct Bucket struct
192 Bucket[] allocBuckets(size_t dim) @trusted pure nothrow in allocBuckets() argument
195 immutable sz = dim * Bucket.sizeof; in allocBuckets()
196 return (cast(Bucket*) GC.calloc(sz, attr))[0 .. dim]; in allocBuckets()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Lex/ |
| H A D | HeaderMap.cpp | 219 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
220 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in lookupFilename()
|
| /netbsd-src/external/gpl3/gcc/dist/libsanitizer/ubsan/ |
| H A D | ubsan_type_hash_itanium.cpp | 216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
217 if (*Bucket == Hash) { in checkDynamicType()
243 *Bucket = Hash; in checkDynamicType()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| H A D | Descriptor.cpp | 273 unsigned Bucket = I / PER_FIELD; in initialize() local
275 if (!(data()[Bucket] & Mask)) { in initialize()
276 data()[Bucket] |= Mask; in initialize()
283 unsigned Bucket = I / PER_FIELD; in isInitialized() local
285 return data()[Bucket] & Mask; in isInitialized()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | TpiStream.cpp | 164 uint32_t Bucket = hashStringV1(Name) % Header->NumHashBuckets; in findRecordsByName() local
165 if (Bucket > HashMap.size()) in findRecordsByName()
169 for (TypeIndex TI : HashMap[Bucket]) { in findRecordsByName()
|
| /netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/rt/ |
| H A D | aaA.d | 71 Bucket[] buckets;
105 inout(Bucket)* findSlotInsert(size_t hash) inout pure nothrow @nogc in inout() argument
116 …inout(Bucket)* findSlotLookup(size_t hash, scope const void* pkey, scope const TypeInfo keyti) ino… in inout() argument
163 memset(&buckets[firstUsed], 0, (buckets.length - firstUsed) * Bucket.sizeof); in clear()
173 private struct Bucket struct
195 Bucket[] allocBuckets(size_t dim) @trusted pure nothrow in allocBuckets() argument
198 immutable sz = dim * Bucket.sizeof; in allocBuckets()
199 return (cast(Bucket*) GC.calloc(sz, attr))[0 .. dim]; in allocBuckets()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 229 for (auto &Bucket : Blocks) { in getAllReachingDefs() local
230 TmpBB.push_back(Bucket.first); in getAllReachingDefs()
231 if (Bucket.second.size() > 2) in getAllReachingDefs()
232 GetOrder(*Bucket.first); in getAllReachingDefs()
233 llvm::sort(Bucket.second, Precedes); in getAllReachingDefs()
242 auto &Bucket = Blocks[MBB]; in getAllReachingDefs() local
243 TmpInst.insert(TmpInst.end(), Bucket.rbegin(), Bucket.rend()); in getAllReachingDefs()
|