| /freebsd/contrib/bmake/ |
| H A D | hash.h | 90 typedef struct HashTable { struct
95 } HashTable; typedef
99 HashTable *table; /* Table being searched. */
106 HashTable tbl;
123 HashIter_Init(HashIter *hi, HashTable *t) in HashIter_Init()
130 void HashTable_Init(HashTable *);
131 void HashTable_Done(HashTable *);
132 HashEntry *HashTable_FindEntry(HashTable *, const char *) MAKE_ATTR_USE;
133 void *HashTable_FindValue(HashTable *, const char *) MAKE_ATTR_USE;
135 void *HashTable_FindValueBySubstringHash(HashTable *, Substring, unsigned)
[all …]
|
| H A D | hash.c | 114 HashTable_Find(HashTable *t, Substring key, unsigned h) in HashTable_Find()
136 HashTable_Init(HashTable *t) in HashTable_Init()
154 HashTable_Done(HashTable *t) in HashTable_Done()
176 HashTable_FindEntry(HashTable *t, const char *key) in HashTable_FindEntry()
185 HashTable_FindValue(HashTable *t, const char *key) in HashTable_FindValue()
196 HashTable_FindValueBySubstringHash(HashTable *t, Substring key, unsigned h) in HashTable_FindValueBySubstringHash()
203 HashTable_MaxChain(const HashTable *t) in HashTable_MaxChain()
221 HashTable_Enlarge(HashTable *t) in HashTable_Enlarge()
257 HashTable_CreateEntry(HashTable *t, const char *key, bool *out_isNew) in HashTable_CreateEntry()
287 HashTable_Set(HashTable *t, const char *key, void *value) in HashTable_Set()
[all …]
|
| H A D | dir.c | 233 HashTable /* of CachedDirListNode */ table;
265 static HashTable mtimes;
267 static HashTable lmtimes; /* same as mtimes but for lstat */
404 HashTable *tbl = useLstat ? &lmtimes : &mtimes; in cached_stats()
506 FreeCachedTable(HashTable *tbl) in FreeCachedTable()
|
| H A D | str.c | 77 static HashTable interned_strings;
|
| /freebsd/contrib/ofed/libibnetdisc/ |
| H A D | g_hash_table.cpp | 42 class HashTable { class
45 HashTable() { }; in HashTable() function in HashTable
46 ~HashTable() { }; in ~HashTable()
60 return ((GHashTable *)(new HashTable())); in GHashTableNew()
66 delete (HashTable *)ght; in GHashTableDestroy()
72 HashTable *ht = (HashTable *)ght; in GHashTableInsert()
79 HashTable *ht = (HashTable *)ght; in GHashTableLookup()
|
| /freebsd/contrib/llvm-project/libc/src/__support/HashTable/ |
| H A D | table.h | 88 struct HashTable { struct
105 size_t left_align = alignof(HashTable) > alignof(ENTRY) ? alignof(HashTable) in table_alignment() argument
119 size_t header_size = sizeof(HashTable); in offset_to_groups() argument
208 LIBC_INLINE HashTable *grow() const { in grow() argument
213 HashTable *new_table = allocate(hint, state.finish()); in grow()
223 LIBC_INLINE static ENTRY *insert(HashTable *&table, ENTRY item, in insert() argument
235 HashTable *new_table = table->grow(); in insert()
254 LIBC_INLINE static void deallocate(HashTable *table) { in deallocate() argument
262 LIBC_INLINE static HashTable *allocate(size_t capacity, uint64_t randomness) { in allocate() argument
280 HashTable *table = reinterpret_cast<HashTable *>( in allocate()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | StringMap.cpp | 97 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in LookupBucketFor() local
108 HashTable[FirstTombstone] = FullHashValue; in LookupBucketFor()
112 HashTable[BucketNo] = FullHashValue; in LookupBucketFor()
120 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { in LookupBucketFor()
156 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in FindKey() local
167 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { in FindKey()
235 unsigned *HashTable = getHashTable(TheTable, NumBuckets); in RehashTable() local
243 unsigned FullHash = HashTable[I]; in RehashTable()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 34 template <typename ValueT> class HashTable; variable
42 friend HashTable<ValueT>; variable
44 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index, in HashTableIterator()
49 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) { in HashTableIterator()
96 const HashTable<ValueT> *Map;
102 class HashTable {
114 HashTable() { Buckets.resize(8); } in HashTable() function
115 explicit HashTable(uint32_t Capacity) { in HashTable() function
316 HashTable NewMap(NewCapacity); in grow()
|
| H A D | InjectedSourceStream.h | 27 using const_iterator = HashTable<SrcHeaderBlockEntry>::const_iterator;
37 HashTable<SrcHeaderBlockEntry> InjectedSourceTable;
|
| H A D | TpiStream.h | 57 LLVM_ABI HashTable<support::ulittle32_t> &getHashAdjusters();
93 HashTable<support::ulittle32_t> HashAdjusters;
|
| H A D | NamedStreamMap.h | 61 HashTable<support::ulittle32_t> OffsetIndexMap;
|
| H A D | PDBFileBuilder.h | 102 HashTable<SrcHeaderBlockEntry> InjectedSourceTable;
|
| /freebsd/sys/cddl/contrib/opensolaris/common/lz4/ |
| H A D | lz4.c | 478 HTYPE *HashTable = (HTYPE *) (srt->hashTable); in LZ4_compressCtx() local
480 HTYPE HashTable[HASHTABLESIZE] = { 0 }; in LZ4_compressCtx()
503 HashTable[LZ4_HASH_VALUE(ip)] = ip - base; in LZ4_compressCtx()
526 ref = base + HashTable[h]; in LZ4_compressCtx()
527 HashTable[h] = ip - base; in LZ4_compressCtx()
617 HashTable[LZ4_HASH_VALUE(ip - 2)] = ip - 2 - base; in LZ4_compressCtx()
620 ref = base + HashTable[LZ4_HASH_VALUE(ip)]; in LZ4_compressCtx()
621 HashTable[LZ4_HASH_VALUE(ip)] = ip - base; in LZ4_compressCtx()
673 U16 *HashTable = (U16 *) (srt->hashTable); in LZ4_compress64kCtx() local
675 U16 HashTable[HASH64KTABLESIZE] = { 0 }; in LZ4_compress64kCtx()
[all …]
|
| /freebsd/sys/contrib/openzfs/module/zfs/ |
| H A D | lz4_zfs.c | 482 HTYPE *HashTable = (HTYPE *) (srt->hashTable); in LZ4_compressCtx() local
504 HashTable[LZ4_HASH_VALUE(ip)] = ip - base; in LZ4_compressCtx()
527 ref = base + HashTable[h]; in LZ4_compressCtx()
528 HashTable[h] = ip - base; in LZ4_compressCtx()
618 HashTable[LZ4_HASH_VALUE(ip - 2)] = ip - 2 - base; in LZ4_compressCtx()
621 ref = base + HashTable[LZ4_HASH_VALUE(ip)]; in LZ4_compressCtx()
622 HashTable[LZ4_HASH_VALUE(ip)] = ip - base; in LZ4_compressCtx()
672 U16 *HashTable = (U16 *) (srt->hashTable); in LZ4_compress64kCtx() local
715 ref = base + HashTable[h]; in LZ4_compress64kCtx()
716 HashTable[h] = ip - base; in LZ4_compress64kCtx()
[all …]
|
| /freebsd/contrib/bmake/unit-tests/ |
| H A D | opt-debug-hash.exp | 3 HashTable "targets": size=16 entries=0 maxchain=0
4 HashTable "Global variables": size=16 entries=<entries> maxchain=4
|
| /freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | IdentifierTable.h | 667 HashTableTy HashTable; variable
691 return HashTable.getAllocator(); in getAllocator()
697 auto &Entry = *HashTable.try_emplace(Name, nullptr).first; in get()
734 auto &Entry = *HashTable.try_emplace(Name).first; in getOwn()
758 iterator begin() const { return HashTable.begin(); } in begin()
759 iterator end() const { return HashTable.end(); } in end()
760 unsigned size() const { return HashTable.size(); } in size()
762 iterator find(StringRef Name) const { return HashTable.find(Name); } in find()
|
| /freebsd/contrib/llvm-project/clang/lib/Basic/ |
| H A D | IdentifierTable.cpp | 65 : HashTable(8192), // Start with space for 8K identifiers. in IdentifierTable()
513 unsigned NumBuckets = HashTable.getNumBuckets(); in PrintStats()
514 unsigned NumIdentifiers = HashTable.getNumItems(); in PrintStats()
521 I = HashTable.begin(), E = HashTable.end(); I != E; ++I) { in PrintStats()
538 HashTable.getAllocator().PrintStats(); in PrintStats()
|
| /freebsd/contrib/llvm-project/clang/lib/Serialization/ |
| H A D | MultiOnDiskHashTable.h | 61 using HashTable = llvm::OnDiskIterableChainedHashTable<Info>; member
64 HashTable Table;
217 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
| H A D | InstrProfReader.h | 609 std::unique_ptr<HashTableImpl> HashTable;
628 return RecordIterator == HashTable->data_end(); in atEnd()
632 HashTable->getInfoObj().setValueProfDataEndianness(Endianness); in setValueProfDataEndianness()
678 return Symtab.create(HashTable->keys()); in populateSymtab()
|
| /freebsd/contrib/llvm-project/libc/src/__support/HashTable/sse2/ |
| H A D | bitmask_impl.inc | 1 //===-- HashTable BitMasks SSE2 Implementation ------------------*- C++ -*-===//
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-readobj/ |
| H A D | llvm-readobj.cpp | 133 static bool HashTable; variable
270 opts::HashTable = Args.hasArg(OPT_hash_table); in parseOptions()
452 if (opts::HashTable) in dumpObject()
|
| H A D | ELFDumper.cpp | 320 virtual void printHashHistogram(const Elf_Hash &HashTable) const;
389 const Elf_Hash *HashTable = nullptr; member in __anonbcadc77c0111::ELFDumper
623 void printHashTableSymbols(const Elf_Hash &HashTable);
2084 HashTable = reinterpret_cast<const Elf_Hash *>( in parseDynamicTable()
2221 if (HashTable && IsHashTableSupported) { in parseDynamicTable()
2224 else if (HashTable->nchain != DynSymRegion->Size / DynSymRegion->EntSize) in parseDynamicTable()
2226 "hash table nchain (" + Twine(HashTable->nchain) + in parseDynamicTable()
2248 if (HashTable && IsHashTableSupported && DynSymRegion) { in parseDynamicTable()
2251 (uint64_t)HashTable->nchain * DynSymRegion->EntSize; in parseDynamicTable()
2260 DynSymRegion->Size = HashTable->nchain * DynSymRegion->EntSize; in parseDynamicTable()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | StringMap.h | 164 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), in StringMap() local
179 HashTable[I] = RHSHashTable[I]; in StringMap()
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | TpiStream.cpp | 237 HashTable<support::ulittle32_t> &TpiStream::getHashAdjusters() { in getHashAdjusters()
|
| /freebsd/contrib/llvm-project/llvm/lib/ProfileData/ |
| H A D | InstrProfReader.cpp | 1006 auto Iter = HashTable->find(FuncName); in getRecords()
1007 if (Iter == HashTable->end()) in getRecords()
1039 HashTable.reset(HashTableImpl::Create( in InstrProfReaderIndex()
1042 RecordIterator = HashTable->data_begin(); in InstrProfReaderIndex()
1107 for (StringRef Name : Underlying.HashTable->keys()) { in populateRemappings()
|