Home
last modified time | relevance | path

Searched refs:buckets (Results 1 – 25 of 35) sorted by relevance

12

/llvm-project-15.0.7/clang/utils/hmaptool/
H A Dhmaptool68 buckets = [struct.unpack(bucket_fmt,
91 return HeaderMap(num_entries, buckets, strtable)
93 def __init__(self, num_entries, buckets, strtable): argument
95 self.buckets = buckets
107 for key_idx,prefix_idx,suffix_idx in self.buckets:
137 print (' num buckets: %d' % (len(hmap.buckets),))
139 for i,bucket in enumerate(hmap.buckets):
151 i, key, prefix, suffix, (hmap_hash(key) & (len(hmap.buckets) - 1))))
/llvm-project-15.0.7/llvm/docs/PDB/
H A DHashTable.rst51 - **Capacity** - The number of buckets in the hash table. Producers should
55 about which buckets have valid values. If the bucket has a value, the
61 about which buckets have tombstone values. If the entry in this bucket is
64 - **Keys and Values** - A list of ``Capacity`` hash buckets, where the first
/llvm-project-15.0.7/openmp/runtime/src/
H A Dkmp_taskdeps.cpp89 h->buckets = (kmp_dephash_entry **)(h + 1); in __kmp_dephash_extend()
96 h->buckets[i] = NULL; in __kmp_dephash_extend()
102 for (entry = current_dephash->buckets[i]; entry; entry = next) { in __kmp_dephash_extend()
107 entry->next_in_bucket = h->buckets[new_bucket]; in __kmp_dephash_extend()
111 h->buckets[new_bucket] = entry; in __kmp_dephash_extend()
148 h->buckets = (kmp_dephash_entry **)(h + 1); in __kmp_dephash_create()
152 h->buckets[i] = 0; in __kmp_dephash_create()
168 for (entry = h->buckets[bucket]; entry; entry = entry->next_in_bucket) in __kmp_dephash_find()
190 entry->next_in_bucket = h->buckets[bucket]; in __kmp_dephash_find()
191 h->buckets[bucket] = entry; in __kmp_dephash_find()
[all …]
H A Dkmp_taskdeps.h59 if (h->buckets[i]) { in __kmp_dephash_free_entries()
61 for (kmp_dephash_entry_t *entry = h->buckets[i]; entry; entry = next) { in __kmp_dephash_free_entries()
76 h->buckets[i] = 0; in __kmp_dephash_free_entries()
H A Dkmp_itt.h291 kmp_itthash_entry_t *buckets[KMP_MAX_FRAME_DOMAINS]; member
H A Dkmp_itt.inl75 for (entry = h->buckets[bucket]; entry; entry = entry->next_in_bucket)
92 entry->next_in_bucket = h->buckets[bucket];
93 while (!KMP_COMPARE_AND_STORE_PTR(&h->buckets[bucket],
96 entry->next_in_bucket = h->buckets[bucket];
/llvm-project-15.0.7/llvm/test/tools/llvm-readobj/ELF/
H A Dhash-histogram.test15 # HIST: Histogram for bucket list length (total of 3 buckets)
21 # HIST-NEXT: Histogram for `.gnu.hash' bucket list length (total of 3 buckets)
78 # BROKEN: Histogram for bucket list length (total of 2 buckets)
149 ## field that has a value larger than the number of buckets.
155 ## field that has a value larger than the number of buckets.
219 # GNU-HASH: Histogram for `.gnu.hash' bucket list length (total of 3 buckets)
231 ## 0x2 is a no-op: it does not change the number of buckets described by the "Bucket" key
289 ## The number of hash buckets. The value of 1 is no-op.
322 ## Case A: when the buckets array is not empty and has a non-zero value we report a warning.
329 ## Case B: we do not report a warning when the buckets array contains only zero values.
[all …]
H A Dall.test38 # GNU-ALL: Histogram for bucket list length (total of 1 buckets)
H A Dhash-table.test186 ## field that has a value larger than the number of buckets.
196 ## Here we would dump the rest of the file as buckets array because we have a broken nbucket field.
203 ## field that has a value larger than the number of buckets.
H A Dhash-symbols.test404 ## field that has a value larger than the number of buckets.
412 ## field that has a value larger than the number of buckets.
495 ## The number of hash buckets. The value of 3 is no-op.
646 ## In this case we have a broken value in the hash buckets array. Normally it contains an
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.set/
H A Dreserve.pass.cpp39 size_t buckets = c.bucket_count(); in reserve_invariant() local
43 assert(buckets == c.bucket_count()); in reserve_invariant()
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/
H A Dreserve.pass.cpp39 size_t buckets = c.bucket_count(); in reserve_invariant() local
43 assert(buckets == c.bucket_count()); in reserve_invariant()
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.map/
H A Dreserve.pass.cpp40 size_t buckets = c.bucket_count(); in reserve_invariant() local
44 assert(buckets == c.bucket_count()); in reserve_invariant()
/llvm-project-15.0.7/llvm/utils/llvm-locstats/
H A Dllvm-locstats.py115 buckets = range(len(self.variables_coverage_map))
118 plt.bar(buckets, self.variables_coverage_map.values(), align='center',
139 buckets = range(len(self.variables_coverage_map))
147 ax.bar(buckets, self.variables_coverage_map.values(), align='edge',
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multimap/
H A Dreserve.pass.cpp55 size_t buckets = c.bucket_count(); in reserve_invariant() local
59 assert(buckets == c.bucket_count()); in reserve_invariant()
/llvm-project-15.0.7/llvm/test/DebugInfo/
H A Ddwarfdump-accel.test40 Check that empty buckets are handled correctly.
75 VERIFY-NEXT: error: Section too small: cannot read buckets and hashes.
/llvm-project-15.0.7/llvm/test/DebugInfo/X86/
H A Ddebug-cu-index-overlap.s7 # hashes to buckets) - and probably to verify that the section ranges apply to
/llvm-project-15.0.7/llvm/docs/CommandGuide/
H A Dllvm-locstats.rst43 make histogram of location buckets generated (requires
H A Dllvm-pdbutil.rst326 dump additional information about the globals, such as hash buckets and hash
335 dump additional information about the publics, such as hash buckets and hash
/llvm-project-15.0.7/llvm/include/llvm/Object/
H A DELFTypes.h539 ArrayRef<Elf_Word> buckets() const {
563 ArrayRef<Elf_Word> buckets() const {
570 return ArrayRef<Elf_Word>(buckets().end(), DynamicSymCount - symndx);
/llvm-project-15.0.7/llvm/test/tools/obj2yaml/ELF/
H A Dgnu-hash-section.yaml115 ## in the hash buckets is 1, but it is empty.
/llvm-project-15.0.7/llvm/docs/
H A DSourceLevelDebugging.rst1426 Typical hash tables have a header, buckets, and each bucket points to the
1490 differently: a header, buckets, an array of all unique 32 bit hash values,
1513 table with "``n_buckets``" buckets, and "``n_hashes``" unique 32 bit hash
1641 Empty buckets are designated by using an invalid hash index of ``UINT32_MAX``.
1664 uint32_t bucket_count; // The number of buckets in this hash table
1666 …uint32_t header_data_len; // The bytes to skip to get to the hash indexes (buckets) for correct …
1688 ``bucket_count`` is a 32 bit unsigned integer that represents how many buckets
1698 The header is followed by the buckets, hashes, offsets, and hash value data.
1704 …uint32_t buckets[Header.bucket_count]; // An array of hash indexes into the "hashes[]" array below
1709 ``buckets`` is an array of 32 bit indexes into the ``hashes`` array. The
/llvm-project-15.0.7/compiler-rt/lib/asan/tests/
H A DCMakeLists.txt3 # These are broken into two buckets. One set of tests directly interacts with
/llvm-project-15.0.7/llvm/test/tools/yaml2obj/ELF/
H A Dgnu-hash-section.yaml253 ## Test we can override the number of buckets and the number of words in the Bloom filter
/llvm-project-15.0.7/lld/ELF/
H A DSyntheticSections.cpp2421 uint32_t *buckets = reinterpret_cast<uint32_t *>(buf); in writeTo() local
2423 uint32_t *values = buckets + nBuckets; in writeTo()
2437 write32(buckets + i->bucketIdx, in writeTo()
2519 uint32_t *buckets = p; in writeTo() local
2527 chains[i] = buckets[hash]; in writeTo()
2528 write32(buckets + hash, i); in writeTo()

12