Home
last modified time | relevance | path

Searched refs:Bucket (Results 1 – 25 of 40) sorted by relevance

12

/openbsd-src/gnu/llvm/llvm/include/llvm/ADT/
H A DStringMap.h152 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(), getAllocator(), 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(getAllocator()); in ~StringMap()
218 int Bucket = FindKey(Key); in find() local
219 if (Bucket == -1) in find()
[all …]
H A DSmallPtrSet.h188 auto *Bucket = FindBucketFor(Ptr); in find_imp() local
189 if (*Bucket == Ptr) in find_imp()
190 return Bucket; in find_imp()
224 const void *const *Bucket;
229 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
238 return Bucket == RHS.Bucket;
241 return Bucket != RHS.Bucket;
249 assert(Bucket <= End); in AdvanceIfNotValid()
250 while (Bucket != End && in AdvanceIfNotValid()
251 (*Bucket == SmallPtrSetImplBase::getEmptyMarker() || in AdvanceIfNotValid()
[all …]
H A DFoldingSet.h696 FoldingSetIteratorImpl(void **Bucket);
711 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
738 explicit FoldingSetBucketIteratorImpl(void **Bucket);
740 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl() argument
760 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
761 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
763 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
764 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
H A DDenseMap.h55 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
1192 template <typename KeyT, typename ValueT, typename KeyInfoT, typename Bucket,
1195 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1196 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, false>;
1200 using value_type = std::conditional_t<IsConst, const Bucket, Bucket>;
1231 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
/openbsd-src/gnu/llvm/llvm/lib/Support/
H A DFoldingSet.cpp281 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); in FindNodeOrInsertPos() local
282 void *Probe = *Bucket; in FindNodeOrInsertPos()
296 InsertPos = Bucket; in FindNodeOrInsertPos()
317 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
319 void *Next = *Bucket; in InsertNode()
325 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); in InsertNode()
329 *Bucket = N; in InsertNode()
359 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
360 Ptr = *Bucket; in RemoveNode()
365 *Bucket = NodeNextPtr; in RemoveNode()
[all …]
H A DSmallPtrSet.cpp51 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 DStringMap.cpp191 int Bucket = FindKey(Key); in RemoveKey() local
192 if (Bucket == -1) in RemoveKey()
195 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
196 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
228 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
229 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
241 NewTableArray[NewBucket] = Bucket; in RehashTable()
/openbsd-src/gnu/llvm/llvm/include/llvm/Support/
H A DArrayRecycler.h39 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 DOnDiskHashTable.h78 struct Bucket { struct
84 Bucket *Buckets; argument
88 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert()
89 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
97 Bucket *NewBuckets = static_cast<Bucket *>( in resize()
98 safe_calloc(NewSize, sizeof(Bucket))); in resize()
172 Bucket &B = Buckets[I]; in Emit()
229 Buckets = static_cast<Bucket *>(safe_calloc(NumBuckets, sizeof(Bucket))); in OnDiskChainedHashTableGenerator()
358 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; variable
360 offset_type Offset = endian::readNext<offset_type, little, aligned>(Bucket);
H A DGenericDomTreeConstruction.h642 Bucket; member
772 II.Bucket.push(To); in InsertReachable()
775 while (!II.Bucket.empty()) { in InsertReachable()
776 TreeNodePtr TN = II.Bucket.top(); in InsertReachable()
777 II.Bucket.pop(); in InsertReachable()
828 II.Bucket.push(SuccTN); in InsertReachable()
/openbsd-src/gnu/llvm/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp195 struct Bucket { struct
196 Bucket(const SCEV *B, Instruction *I) in Bucket() argument
270 bool chainCommoning(Loop *L, SmallVector<Bucket, 16> &Buckets);
273 bool prepareBasesForCommoningChains(Bucket &BucketChain);
277 rewriteLoadStoresForCommoningChains(Loop *L, Bucket &Bucket,
282 SmallVector<Bucket, 16> collectCandidates(
292 SmallVector<Bucket, 16> &Buckets,
297 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
301 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets, PrepForm Form);
309 bool prepareBaseForDispFormChain(Bucket &BucketChain, PrepForm Form);
[all …]
/openbsd-src/gnu/llvm/clang/lib/AST/
H A DRandstruct.cpp40 class Bucket { class
45 virtual ~Bucket() = default;
56 void Bucket::addField(FieldDecl *Field, int FieldSize) { in addField()
61 struct BitfieldRunBucket : public Bucket {
70 SmallVector<std::unique_ptr<Bucket>, 16> Buckets; in randomizeStructureLayoutImpl()
73 std::unique_ptr<Bucket> CurrentBucket; in randomizeStructureLayoutImpl()
115 CurrentBucket = std::make_unique<Bucket>(); in randomizeStructureLayoutImpl()
119 std::unique_ptr<Bucket> OverSized = std::make_unique<Bucket>(); in randomizeStructureLayoutImpl()
159 for (const std::unique_ptr<Bucket> &B : Buckets) { in randomizeStructureLayoutImpl()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/AsmPrinter/
H A DAccelTable.cpp75 uint32_t Bucket = E.second.HashValue % BucketCount; in finalize() local
76 Buckets[Bucket].push_back(&E.second); in finalize()
82 for (auto &Bucket : Buckets) in finalize() local
83 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) { in finalize()
248 for (const auto &Bucket : Contents.getBuckets()) { in emitHashes() local
249 for (const auto &Hash : Bucket) { in emitHashes()
328 for (const AccelTableBase::HashList &Bucket : Buckets) { in emitData() local
330 for (const auto &Hash : Bucket) { in emitData()
347 if (!Bucket.empty()) in emitData()
394 for (auto &Bucket : Contents.getBuckets()) { in getUniqueTags() local
[all …]
/openbsd-src/gnu/llvm/clang/include/clang/Lex/
H A DHeaderMap.h48 for (unsigned Bucket = 0; Bucket < NumBuckets; ++Bucket) { in forEachKey() local
49 HMapBucket B = getBucket(Bucket); in forEachKey()
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.cpp229 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
232 ListScope BucketScope(W, ("Bucket " + Twine(Bucket)).str()); in dump()
243 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 DDWARFVerifier.cpp1126 uint32_t Bucket; in verifyNameIndexBuckets() member
1129 constexpr BucketInfo(uint32_t Bucket, uint32_t Index) in verifyNameIndexBuckets()
1130 : Bucket(Bucket), Index(Index) {} in verifyNameIndexBuckets()
1145 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
1146 uint32_t Index = NI.getBucketArrayEntry(Bucket); in verifyNameIndexBuckets()
1150 Bucket, NI.getUnitOffset(), Index, NI.getNameCount()); in verifyNameIndexBuckets()
1155 BucketStarts.emplace_back(Bucket, Index); in verifyNameIndexBuckets()
1191 if (B.Bucket == NI.getBucketCount()) in verifyNameIndexBuckets()
1200 if (FirstHash % NI.getBucketCount() != B.Bucket) { in verifyNameIndexBuckets()
1204 NI.getUnitOffset(), B.Bucket, FirstHash, in verifyNameIndexBuckets()
[all …]
/openbsd-src/gnu/llvm/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h63 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()
208 Bucket *b = &table_[hash]; in acquire()
338 Bucket *b = h->bucket_; in release()
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/LogicalView/Readers/
H A DLVBinaryReader.cpp776 for (LVBucket &Bucket : Buckets) { in processLines()
777 dbgs() << "Begin: " << format_decimal(std::get<0>(Bucket), 5) << ", " in processLines()
778 << "End: " << format_decimal(std::get<1>(Bucket), 5) << ", " in processLines()
779 << "Address: " << hexValue(std::get<2>(Bucket)) << "\n"; in processLines()
798 for (LVBucket &Bucket : Buckets) { in processLines()
799 if (std::get<3>(Bucket)) in processLines()
802 if (Size == std::get<2>(Bucket)) { in processLines()
805 LVLines::iterator IterStart = DebugLines->begin() + std::get<0>(Bucket); in processLines()
807 DebugLines->begin() + std::get<1>(Bucket) + 1; in processLines()
811 std::get<3>(Bucket) = true; in processLines()
/openbsd-src/gnu/llvm/compiler-rt/lib/ubsan/
H A Dubsan_type_hash_itanium.cpp228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
229 if (*Bucket == Hash) { in checkDynamicType()
255 *Bucket = Hash; in checkDynamicType()
/openbsd-src/gnu/llvm/clang/lib/AST/Interp/
H A DDescriptor.cpp291 unsigned Bucket = I / PER_FIELD; in initialize() local
293 if (!(data()[Bucket] & Mask)) { in initialize()
294 data()[Bucket] |= Mask; in initialize()
301 unsigned Bucket = I / PER_FIELD; in isInitialized() local
302 return data()[Bucket] & (T(1) << (I % PER_FIELD)); in isInitialized()
/openbsd-src/gnu/llvm/clang/lib/Lex/
H A DHeaderMap.cpp207 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
208 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in lookupFilename()
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/PDB/Native/
H A DTpiStream.cpp164 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()
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DRDFLiveness.cpp228 for (auto &Bucket : Blocks) { in getAllReachingDefs() local
229 TmpBB.push_back(Bucket.first); in getAllReachingDefs()
230 if (Bucket.second.size() > 2) in getAllReachingDefs()
231 GetOrder(*Bucket.first); in getAllReachingDefs()
232 llvm::sort(Bucket.second, Precedes); in getAllReachingDefs()
241 auto &Bucket = Blocks[MBB]; in getAllReachingDefs() local
242 TmpInst.insert(TmpInst.end(), Bucket.rbegin(), Bucket.rend()); in getAllReachingDefs()
/openbsd-src/gnu/llvm/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp431 for (const auto &Bucket : Buckets) { in buildMatchers() local
433 DynTypedMatcher::VO_AnyOf, Bucket.first, in buildMatchers()
434 taggedMatchers("Tag", Bucket.second, TK_AsIs)); in buildMatchers()
/openbsd-src/gnu/llvm/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp982 TimeBucketRegion() : Bucket(nullptr) {} in TimeBucketRegion()
994 if (Bucket != NewBucket) { in setBucket()
996 if (Bucket) in setBucket()
997 *Bucket += Now; in setBucket()
1000 Bucket = NewBucket; in setBucket()
1005 llvm::TimeRecord *Bucket; member in clang::ast_matchers::internal::__anonab4d286c0111::MatchASTVisitor::TimeBucketRegion

12