Home
last modified time | relevance | path

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

1234

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DStringMap.h153 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
185 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
219 if (Bucket == -1) in find()
226 if (Bucket == -1) in find()
278 if (Bucket && Bucket != getTombstoneVal()) in insert()
283 Bucket = KeyValue; in insert()
332 if (Bucket && Bucket != getTombstoneVal()) in try_emplace()
338 Bucket = in try_emplace()
356 if (Bucket && Bucket != getTombstoneVal()) { in clear()
359 Bucket = nullptr; in clear()
[all …]
H A DSmallPtrSet.h189 if (*Bucket == Ptr) in find_imp()
190 return Bucket; in find_imp()
229 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
238 return Bucket == RHS.Bucket;
241 return Bucket != RHS.Bucket;
249 assert(Bucket <= End); in AdvanceIfNotValid()
253 ++Bucket; in AdvanceIfNotValid()
260 --Bucket; in RetreatIfNotValid()
290 assert(Bucket < End);
297 --Bucket;
[all …]
/llvm-project-15.0.7/llvm/lib/Support/
H A DFoldingSet.cpp282 void *Probe = *Bucket; in FindNodeOrInsertPos()
296 InsertPos = Bucket; in FindNodeOrInsertPos()
319 void *Next = *Bucket; in InsertNode()
329 *Bucket = N; in InsertNode()
360 Ptr = *Bucket; in RemoveNode()
365 *Bucket = NodeNextPtr; in RemoveNode()
393 (!*Bucket || !GetNextPtr(*Bucket))) in FoldingSetIteratorImpl()
394 ++Bucket; in FoldingSetIteratorImpl()
411 ++Bucket; in advance()
413 (!*Bucket || !GetNextPtr(*Bucket))); in advance()
[all …]
H A DSmallPtrSet.cpp52 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()
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()
80 return Array+Bucket; in FindBucketFor()
84 if (Array[Bucket] == getTombstoneMarker() && !Tombstone) 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()
/llvm-project-15.0.7/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()
105 for (; !Bucket.empty(); Bucket.pop_back()) in clear()
106 while (T *Ptr = pop(Bucket.size() - 1)) in clear()
[all …]
/llvm-project-15.0.7/llvm/test/tools/llvm-dwarfdump/X86/
H A Ddebug-names-verify-unhashed-names.s82 .long 2 # Bucket 0
83 .long 3 # Bucket 1
84 .long 193491849 # Hash in no Bucket
85 .long 193487034 # Hash in Bucket 0
86 .long 4086570991 # Hash in Bucket 1
87 .long 193487042 # Hash in no Bucket
88 .long .Lstring_foo # String in no Bucket
89 .long .Lstring_bar # String in Bucket 0
90 .long .Lstring_barfuz # String in Bucket 1
91 .long .Lstring_baz # String in no Bucket
[all …]
H A DDW_AT_object_pointer.s375 .long 0 ## Bucket 0
376 .long 2 ## Bucket 1
377 .long -1 ## Bucket 2
378 .long 3 ## Bucket 3
379 .long 4 ## Bucket 4
380 .long 649621230 ## Hash in Bucket 0
381 .long 1784752350 ## Hash in Bucket 0
433 .long -1 ## Bucket 0
446 .long -1 ## Bucket 0
463 .long 0 ## Bucket 0
[all …]
H A Ddebug-names-find.s109 .long 1 # Bucket 0
110 .long 2 # Bucket 1
112 .long 193491849 # Hash in Bucket 1
113 .long -1257882357 # Hash in Bucket 1
114 .long .Lstring_bar # String in Bucket 1: bar
115 .long .Lstring_foo # String in Bucket 1: foo
117 .long .Lnames0-.Lnames_entries0 # Offset in Bucket 1
118 .long .Lnames1-.Lnames_entries0 # Offset in Bucket 1
119 .long .Lnames2-.Lnames_entries0 # Offset in Bucket 1
160 .long .Lnames3-.Lnames_entries1 # Offset in Bucket 1
[all …]
H A Ddebug-names-verify-wrong-hash.s5 # CHECK: Name Index @ 0x0: Bucket 1 is not empty but points to a mismatched hash value 0xb8860c4 (b…
70 .long 1 # Bucket 0
71 .long 2 # Bucket 1
72 .long 193487034 # Hash in Bucket 1
73 .long 193487044 # Hash in Bucket 1 and 2
74 .long .Lstring_bar # String in Bucket 1: bar
75 .long .Lstring_baz # String in Bucket 1 and 2: baz
76 .long .Lnames0-.Lnames_entries0 # Offset in Bucket 1
77 .long .Lnames1-.Lnames_entries0 # Offset in Bucket 1 and 2
H A Dverify_compatible_tags.s305 .long -1 ## Bucket 0
306 .long 0 ## Bucket 1
307 .long 2 ## Bucket 2
308 .long 5863324 ## Hash in Bucket 1
309 .long 2090499946 ## Hash in Bucket 1
310 .long 5863325 ## Hash in Bucket 2
311 .long LNames1-Lnames_begin ## Offset in Bucket 1
342 .long -1 ## Bucket 0
355 .long -1 ## Bucket 0
372 .long 0 ## Bucket 0
[all …]
H A Dapple_names_verify_form.s31 .long 2 ## Header Bucket Count
38 .long 0 ## Bucket 0
39 .long 1 ## Bucket 1
40 .long 177678 ## Hash in Bucket 0
41 .long 177679 ## Hash in Bucket 1
42 .long LNames0-Lnames_begin ## Offset in Bucket 0
43 .long LNames1-Lnames_begin ## Offset in Bucket 1
H A Dapple_names_verify_num_atoms.s32 .long 2 ## Header Bucket Count
39 .long 0 ## Bucket 0
40 .long 1 ## Bucket 1
41 .long 177678 ## Hash in Bucket 0
42 .long 177679 ## Hash in Bucket 1
43 .long LNames0-Lnames_begin ## Offset in Bucket 0
44 .long LNames1-Lnames_begin ## Offset in Bucket 1
H A Denum.s230 .long 1 ## Header Bucket Count
237 .long 0 ## Bucket 0
238 .long 2090499946 ## Hash in Bucket 0
251 .long 1 ## Header Bucket Count
258 .long -1 ## Bucket 0
264 .long 1 ## Header Bucket Count
271 .long -1 ## Bucket 0
288 .long 0 ## Bucket 0
289 .long 1 ## Bucket 1
290 .long 193495088 ## Hash in Bucket 0
[all …]
H A Dbrief.s158 .long 1 ## Header Bucket Count
165 .long 0 ## Bucket 0
166 .long 2090499946 ## Hash in Bucket 0
167 .long LNames0-Lnames_begin ## Offset in Bucket 0
178 .long 1 ## Header Bucket Count
185 .long -1 ## Bucket 0
191 .long 1 ## Header Bucket Count
198 .long -1 ## Bucket 0
215 .long 0 ## Bucket 0
216 .long 193495088 ## Hash in Bucket 0
[all …]
H A Dcallsite-invalid.s319 .long 1 ## Bucket 0
320 .long 2 ## Bucket 1
321 .long 3 ## Bucket 2
322 .long 4 ## Bucket 3
323 .long 193495088 ## Hash in Bucket 0
324 .long 193491849 ## Hash in Bucket 1
325 .long 2090499946 ## Hash in Bucket 2
326 .long -1257882357 ## Hash in Bucket 3
331 .set Lset9, Lnames3-Lnames_entries0 ## Offset in Bucket 0
333 .set Lset10, Lnames0-Lnames_entries0 ## Offset in Bucket 1
[all …]
H A Ddebug-names-verify-buckets.s4 # CHECK: error: Bucket 0 of Name Index @ 0x0 contains invalid value 2. Valid range is [0, 1].
63 .long 2 # Bucket 0
64 .long 1 # Bucket 1
65 .long 193491849 # Hash in Bucket 1
66 .long .Lstring_foo # String in Bucket 1: foo
67 .long .Lnames0-.Lnames_entries0 # Offset in Bucket 1
H A Dlookup.s219 .long 1 ## Header Bucket Count
226 .long 0 ## Bucket 0
227 .long 193491849 ## Hash in Bucket 0
228 .long LNames0-Lnames_begin ## Offset in Bucket 0
239 .long 1 ## Header Bucket Count
246 .long -1 ## Bucket 0
252 .long 1 ## Header Bucket Count
259 .long -1 ## Bucket 0
276 .long 0 ## Bucket 0
277 .long 193495088 ## Hash in Bucket 0
[all …]
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Ddwarfdump-debug-names.s35 .long 0 # Bucket 0
36 .long 1 # Bucket 1
76 .long 1 # Bucket 0
112 .long 1 # Bucket 0
145 # CHECK-NEXT: Bucket count: 2
159 # CHECK-NEXT: Bucket 0 [
162 # CHECK-NEXT: Bucket 1 [
191 # CHECK-NEXT: Bucket count: 1
205 # CHECK-NEXT: Bucket 0 [
225 # CHECK-NEXT: Bucket count: 1
[all …]
/llvm-project-15.0.7/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp194 struct Bucket { struct
276 rewriteLoadStoresForCommoningChains(Loop *L, Bucket &Bucket,
536 for (auto &Bucket : Buckets) { in chainCommoning() local
548 Loop *L, Bucket &Bucket, SmallSet<BasicBlock *, 16> &BBChanged) { in rewriteLoadStoresForCommoningChains() argument
551 assert(Bucket.Elements.size() == in rewriteLoadStoresForCommoningChains()
552 Bucket.ChainBases.size() * Bucket.ChainSize && in rewriteLoadStoresForCommoningChains()
567 : Bucket.BaseSCEV; in rewriteLoadStoresForCommoningChains()
864 SmallVector<Bucket, 16> Buckets; in collectCandidates()
1097 for (auto &Bucket : Buckets) in updateFormPrep() local
1118 for (auto &Bucket : Buckets) { in dispFormPrep() local
[all …]
/llvm-project-15.0.7/llvm/test/tools/dsymutil/Inputs/
H A Dinvalid.s190 .long 0 ## Bucket 0
191 .long -1 ## Bucket 1
192 .long 177676 ## Hash in Bucket 0
193 .long 2090499946 ## Hash in Bucket 0
194 .long LNames1-Lnames_begin ## Offset in Bucket 0
195 .long LNames0-Lnames_begin ## Offset in Bucket 0
218 .long -1 ## Bucket 0
231 .long -1 ## Bucket 0
248 .long 0 ## Bucket 0
249 .long 193495088 ## Hash in Bucket 0
[all …]
/llvm-project-15.0.7/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()
/llvm-project-15.0.7/llvm/test/tools/dsymutil/Inputs/scattered-reloc/
H A D1.s115 .long 1 @ Header Bucket Count
122 .long 0 @ Bucket 0
123 .long 193487034 @ Hash in Bucket 0
124 .long LNames0-Lnames_begin @ Offset in Bucket 0
135 .long 1 @ Header Bucket Count
142 .long -1 @ Bucket 0
148 .long 1 @ Header Bucket Count
155 .long -1 @ Bucket 0
172 .long 0 @ Bucket 0
173 .long 193495088 @ Hash in Bucket 0
[all …]
/llvm-project-15.0.7/lldb/test/Shell/SymbolFile/DWARF/x86/
H A Dstatic_scope.s237 .long 2 ## Header Bucket Count
244 .long 0 ## Bucket 0
245 .long -1 ## Bucket 1
246 .long 177670 ## Hash in Bucket 0
247 .long 2090499946 ## Hash in Bucket 0
267 .long 1 ## Header Bucket Count
274 .long -1 ## Bucket 0
280 .long 1 ## Header Bucket Count
287 .long -1 ## Bucket 0
304 .long 0 ## Bucket 0
[all …]
/llvm-project-15.0.7/llvm/lib/CodeGen/AsmPrinter/
H A DAccelTable.cpp76 Buckets[Bucket].push_back(&E.second); in finalize()
82 for (auto &Bucket : Buckets) in finalize() local
249 for (const auto &Hash : Bucket) { in emitHashes()
330 for (const auto &Hash : Bucket) { in emitData()
347 if (!Bucket.empty()) in emitData()
395 for (auto *Hash : Bucket) { in getUniqueTags()
432 Index += Bucket.value().size(); in emitBuckets()
439 for (auto *Hash : Bucket.value()) { in emitStringOffsets()
497 for (auto *Hash : Bucket) { in emitData()
670 for (const auto &Bucket : Buckets) in print() local
[all …]

1234