Home
last modified time | relevance | path

Searched full:bucket (Results 1 – 25 of 252) sorted by relevance

1234567891011

/llvm-project/llvm/include/llvm/ADT/
H A DConcurrentHashtable.h44 /// [ StartEntryIndex ][ Bucket Index ]
47 /// first probe the bucket.
49 /// bucket entries
52 /// buckets might be extended to contain more entries. Each bucket can be
54 /// Different buckets may have different sizes. If the single bucket is full
55 /// then the bucket is resized.
57 /// BucketsArray keeps all buckets. Each bucket keeps an array of Entries
63 /// [Bucket 0].Hashes -> [uint32_t][uint32_t]
64 /// [Bucket 0].Entries -> [KeyDataTy*][KeyDataTy*]
66 /// [Bucket
276 struct Bucket { global() struct
298 GuardBucket RehashBucket() argument
[all...]
H A DStringMap.h59 /// LookupBucketFor - Look up the bucket that the specified string should end
61 /// specified bucket will be non-null. Otherwise, it will be null. In either
62 /// case, the FullHashValue field of the bucket will be set to the hash value
71 /// FindKey - Look up the bucket that contains the specified key. If it exists
72 /// in the map, return the bucket number of the key. Otherwise return -1.
169 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
170 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
171 TheTable[I] = Bucket; in StringMap()
176 static_cast<MapEntryTy *>(Bucket)->getKey(), getAllocator(), in StringMap()
177 static_cast<MapEntryTy *>(Bucket)->getValue()); in StringMap()
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.multiset/
H A Dlocal_iterators.pass.cpp45 C::size_type b = c.bucket(0); in main()
50 b = c.bucket(1); in main()
58 b = c.bucket(2); in main()
66 b = c.bucket(3); in main()
72 b = c.bucket(4); in main()
78 b = c.bucket(5); in main()
83 b = c.bucket(6); in main()
103 C::size_type b = c.bucket(0); in main()
108 b = c.bucket(1); in main()
116 b = c.bucket(2); in main()
[all …]
H A Dlocal_iterators.compile.fail.cpp44 C::size_type b = c.bucket(0); in main()
49 b = c.bucket(1); in main()
58 b = c.bucket(2); in main()
66 b = c.bucket(3); in main()
72 b = c.bucket(4); in main()
78 b = c.bucket(5); in main()
83 b = c.bucket(6); in main()
103 C::size_type b = c.bucket(0); in main()
108 b = c.bucket(1); in main()
116 b = c.bucket(2); in main()
[all …]
/llvm-project/llvm/lib/Support/
H A DFoldingSet.cpp141 /// GetNextPtr - In order to save space, each bucket is a
145 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null:
148 // The low bit is set if this is the pointer back to the bucket. in GetNextPtr()
159 assert((Ptr & 1) && "Not a bucket pointer"); in GetBucketPtr()
163 /// GetBucketFor - Hash the specified node ID and return the hash bucket for
171 /// AllocateBuckets - Allocated initialized bucket memory.
175 // Set the very last bucket to be a non-null "pointer". in AllocateBuckets()
214 // Set all but the last bucket to null pointers. in clear()
217 // Set the very last bucket to be a non-null "pointer". in clear()
228 assert(isPowerOf2_32(NewBucketCount) && "Bad bucket count!"); in GrowBucketCount()
[all …]
/llvm-project/lld/test/ELF/
H A Ddebug-names-parent-idx.s54 # DWARF-NEXT: Bucket count: 9
87 # DWARF: Bucket 0 [
90 # DWARF-NEXT: Bucket 1 [
114 # DWARF-NEXT: Bucket 2 [
134 # DWARF-NEXT: Bucket 3 [
179 # DWARF-NEXT: Bucket 4 [
182 # DWARF-NEXT: Bucket 5 [
185 # DWARF-NEXT: Bucket 6 [
188 # DWARF-NEXT: Bucket 7 [
201 # DWARF-NEXT: Bucket 8 [
[all …]
H A Dppc32-debug-names.s40 # DWARF-NEXT: Bucket count: 5
63 # DWARF: Bucket 0 [
66 # DWARF-NEXT: Bucket 1 [
108 # DWARF-NEXT: Bucket 2 [
111 # DWARF-NEXT: Bucket 3 [
124 # DWARF-NEXT: Bucket 4 [
205 .long 3 # Header: bucket count
211 .long 0 # Bucket 0
212 .long 1 # Bucket 1
213 .long 3 # Bucket 2
[all …]
H A Ddebug-names.s54 # DWARF-NEXT: Bucket count: 5
77 # DWARF: Bucket 0 [
80 # DWARF-NEXT: Bucket 1 [
122 # DWARF-NEXT: Bucket 2 [
125 # DWARF-NEXT: Bucket 3 [
138 # DWARF-NEXT: Bucket 4 [
217 .long 3 # Header: bucket count
223 .long 0 # Bucket 0
224 .long 1 # Bucket 1
225 .long 3 # Bucket
[all...]
H A Ddebug-names-multi-cus.s342 .long 6 # Header: bucket count
350 .long 1 # Bucket 0
351 .long 2 # Bucket 1
352 .long 3 # Bucket 2
353 .long 0 # Bucket 3
354 .long 4 # Bucket 4
355 .long 6 # Bucket 5
356 .long 5863902 # Hash in Bucket 0
357 .long 5863903 # Hash in Bucket 1
358 .long 193495088 # Hash in Bucket 2
[all …]
/llvm-project/llvm/test/tools/yaml2obj/ELF/
H A Dhash-section.yaml46 ## Check we can describe a SHT_HASH section using "Bucket" and "Chain" tags.
49 # RUN: llvm-readobj --sections --section-data %t2 | FileCheck %s --check-prefix=BUCKET-CHAIN
51 # BUCKET-CHAIN: Name: .hash
52 # BUCKET-CHAIN: Size:
53 # BUCKET-CHAIN-SAME: 28
54 # BUCKET-CHAIN: Link:
55 # BUCKET-CHAIN-SAME: 0
56 # BUCKET-CHAIN: SectionData (
57 # BUCKET-CHAIN-NEXT: 0000: 02000000 03000000 01000000 02000000 |
58 # BUCKET-CHAIN-NEXT: 0010: 03000000 04000000 05000000 |
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.set/
H A Dlocal_iterators.pass.cpp45 C::size_type b = c.bucket(0); in main()
50 b = c.bucket(1); in main()
56 b = c.bucket(2); in main()
62 b = c.bucket(3); in main()
68 b = c.bucket(4); in main()
89 C::size_type b = c.bucket(0); in main()
94 b = c.bucket(1); in main()
100 b = c.bucket(2); in main()
106 b = c.bucket(3); in main()
112 b = c.bucket(4); in main()
[all …]
H A Dlocal_iterators.compile.fail.cpp42 C::size_type b = c.bucket(0); in main()
47 b = c.bucket(1); in main()
56 b = c.bucket(2); in main()
64 b = c.bucket(3); in main()
70 b = c.bucket(4); in main()
76 b = c.bucket(5); in main()
81 b = c.bucket(6); in main()
101 C::size_type b = c.bucket(0); in main()
106 b = c.bucket(1); in main()
114 b = c.bucket(2); in main()
[all …]
/llvm-project/bolt/test/X86/Inputs/
H A Ddwarf5-debug-names-main.s538 .long 11 # Header: bucket count
544 .long 1 # Bucket 0
545 .long 3 # Bucket 1
546 .long 5 # Bucket 2
547 .long 0 # Bucket 3
548 .long 0 # Bucket 4
549 .long 6 # Bucket 5
550 .long 8 # Bucket 6
551 .long 9 # Bucket 7
552 .long 11 # Bucket 8
[all …]
H A Ddwarf5-debug-names-helper.s370 .long 7 # Header: bucket count
376 .long 1 # Bucket 0
377 .long 0 # Bucket 1
378 .long 2 # Bucket 2
379 .long 3 # Bucket 3
380 .long 0 # Bucket 4
381 .long 5 # Bucket 5
382 .long 7 # Bucket 6
383 .long -1257882357 # Hash in Bucket 0
384 .long -1168750522 # Hash in Bucket 2
[all …]
/llvm-project/llvm/test/DebugInfo/X86/
H A Ddwarfdump-debug-names.s30 .long 2 # Header: bucket count
35 .long 0 # Bucket 0
36 .long 1 # Bucket 1
37 .long 193491849 # Hash in Bucket 1
38 .long -1257882357 # Hash in Bucket 1
39 .long .Linfo_string0 # String in Bucket 1: foo
40 .long .Linfo_string1 # String in Bucket 1: _Z3foov
41 .long .Lnames0-.Lnames_entries0 # Offset in Bucket 1
42 .long .Lnames1-.Lnames_entries0 # Offset in Bucket 1
71 .long 1 # Header: bucket count
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.multimap/
H A Dlocal_iterators.pass.cpp47 C::size_type b = c.bucket(0); in main()
52 b = c.bucket(1); in main()
69 b = c.bucket(2); in main()
86 b = c.bucket(3); in main()
93 b = c.bucket(4); in main()
100 b = c.bucket(5); in main()
105 b = c.bucket(6); in main()
125 C::size_type b = c.bucket(0); in main()
130 b = c.bucket(1); in main()
147 b = c.bucket(2); in main()
[all …]
H A Dlocal_iterators.compile.fail.cpp45 C::size_type b = c.bucket(0); in main()
50 b = c.bucket(1); in main()
61 b = c.bucket(2); in main()
71 b = c.bucket(3); in main()
78 b = c.bucket(4); in main()
85 b = c.bucket(5); in main()
90 b = c.bucket(6); in main()
110 C::size_type b = c.bucket(0); in main()
115 b = c.bucket(1); in main()
125 b = c.bucket(2); in main()
[all …]
/llvm-project/bolt/test/X86/
H A Ddwarf5-debug-names-dw-at-specification.s18 # BOLT-NEXT: Bucket count: 9
48 # BOLT-NEXT: Bucket 0 [
70 # BOLT-NEXT: Bucket 1 [
82 # BOLT-NEXT: Bucket 2 [
94 # BOLT-NEXT: Bucket 3 [
97 # BOLT-NEXT: Bucket 4 [
100 # BOLT-NEXT: Bucket 5 [
103 # BOLT-NEXT: Bucket 6 [
106 # BOLT-NEXT: Bucket 7 [
128 # BOLT-NEXT: Bucket 8 [
[all …]
H A Ddwarf5-debug-names-skip-forward-decl.s11 # POSTCHECK: Bucket 0 [
23 # POSTCHECK-NEXT: Bucket 1 [
26 # POSTCHECK-NEXT: Bucket 2 [
48 # POSTCHECK-NEXT: Bucket 3 [
51 # POSTCHECK-NEXT: Bucket 4 [
54 # POSTCHECK-NEXT: Bucket 5 [
76 # POSTCHECK-NEXT: Bucket 6 [
113 # POSTCHECK-NEXT: Bucket 7 [
522 .long 8 # Header: bucket count
530 .long 1 # Bucket 0
[all …]
/llvm-project/libcxx/test/std/containers/unord/unord.map/
H A Dlocal_iterators.pass.cpp46 C::size_type b = c.bucket(0); in main()
51 b = c.bucket(1); in main()
58 b = c.bucket(2); in main()
65 b = c.bucket(3); in main()
72 b = c.bucket(4); in main()
94 C::size_type b = c.bucket(0); in main()
99 b = c.bucket(1); in main()
106 b = c.bucket(2); in main()
113 b = c.bucket(3); in main()
120 b = c.bucket(4); in main()
[all …]
/llvm-project/llvm/test/tools/llvm-dwarfdump/X86/
H A Ddebug-names-verify-unhashed-names.s77 .long 2 # Header: bucket count
82 .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
[all …]
H A Ddebug-names-find.s104 .long 2 # Header: bucket count
109 .long 1 # Bucket 0
110 .long 2 # Bucket 1
111 .long 193487034 # Hash in Bucket 0
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
116 .long .Lstring_foo_mangled # String in Bucket 1: _Z3foov
117 .long .Lnames0-.Lnames_entries0 # Offset in Bucket 1
[all …]
H A Dapple_names_verify_data.s6 # CHECK-NEXT: error: Bucket[0] has invalid hash index: 4294967294.
8 # CHECK-NEXT: error: .apple_names Bucket[1] Hash[1] = 0x0002b60f Str[0] = 0x0000005a DIE[0] = 0x000…
12 # an invalid hash index for bucket[0] in the .apple_names section,
37 .long 2 ## Header Bucket Count
43 ….short 25 ## DW_FORM_data4 -- error: .apple_names Bucket[1] Hash[1] = 0x0002…
44 .long -2 ## Bucket 0 -- error: Bucket[0] has invalid hash index: 4294967294.
45 .long 1 ## Bucket 1
46 .long 177678 ## Hash in Bucket 0
47 .long 177679 ## Hash in Bucket 1
48 ….long Lsection_line ## Offset in Bucket 0 -- error: Hash[0] has invalid HashData offset: 0x0000…
[all …]
/llvm-project/clang/lib/AST/
H A DRandstruct.cpp36 // The Bucket class holds the struct fields we're trying to fill to a
38 class Bucket {
43 virtual ~Bucket() = default;
54 void Bucket::addField(FieldDecl *Field, int FieldSize) {
59 struct BitfieldRunBucket : public Bucket { in addField()
68 SmallVector<std::unique_ptr<Bucket>, 16> Buckets; in randomizeStructureLayoutImpl()
70 // The current bucket of fields that we are trying to fill to a cache-line. in randomizeStructureLayoutImpl()
71 std::unique_ptr<Bucket> CurrentBucket; in randomizeStructureLayoutImpl()
73 // The current bucket containing the run of adjacent bitfields to ensure they in randomizeStructureLayoutImpl()
77 // Tracks the number of fields that we failed to fit to the current bucket, in randomizeStructureLayoutImpl()
40 class Bucket { global() class
[all...]
/llvm-project/llvm/test/tools/obj2yaml/ELF/
H A Dhash-section.yaml3 ## Check that obj2yaml uses "Bucket" and "Chain" tags to describe
8 # RUN: obj2yaml %t1 | FileCheck %s --check-prefix=CHAIN-BUCKET
10 # CHAIN-BUCKET: - Name: .hash1
11 # CHAIN-BUCKET-NEXT: Type: SHT_HASH
12 # CHAIN-BUCKET-NEXT: Bucket: [ 3 ]
13 # CHAIN-BUCKET-NEXT: Chain: [ 4, 5 ]
14 # CHAIN-BUCKET: - Name: .hash2
15 # CHAIN-BUCKET-NEXT: Type: SHT_HASH
16 # CHAIN-BUCKET-NEXT: Bucket: [ ]
17 # CHAIN-BUCKET-NEXT: Chain: [ ]
[all …]

1234567891011