HomeSort by: relevance | last modified time | path
    Searched refs:HashTable (Results 1 - 25 of 30) sorted by relevancy

1 2

  /src/usr.bin/make/
hash.h 90 typedef struct HashTable {
95 } HashTable;
99 HashTable *table; /* Table being searched. */
106 HashTable tbl;
123 HashIter_Init(HashIter *hi, HashTable *t)
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...]
hash.c 114 HashTable_Find(HashTable *t, Substring key, unsigned h)
136 HashTable_Init(HashTable *t)
154 HashTable_Done(HashTable *t)
176 HashTable_FindEntry(HashTable *t, const char *key)
185 HashTable_FindValue(HashTable *t, const char *key)
196 HashTable_FindValueBySubstringHash(HashTable *t, Substring key, unsigned h)
203 HashTable_MaxChain(const HashTable *t)
221 HashTable_Enlarge(HashTable *t)
257 HashTable_CreateEntry(HashTable *t, const char *key, bool *out_isNew)
287 HashTable_Set(HashTable *t, const char *key, void *value
    [all...]
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;
506 FreeCachedTable(HashTable *tbl)
str.c 77 static HashTable interned_strings;
targ.c 117 static HashTable allTargetsByName;
  /src/usr.bin/make/unit-tests/
opt-debug-hash.exp 3 HashTable "targets": size=16 entries=0 maxchain=0
4 HashTable "Global variables": size=16 entries=<entries> maxchain=4
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
InjectedSourceStream.h 12 #include "llvm/DebugInfo/PDB/Native/HashTable.h"
28 using const_iterator = HashTable<SrcHeaderBlockEntry>::const_iterator;
38 HashTable<SrcHeaderBlockEntry> InjectedSourceTable;
HashTable.h 1 //===- HashTable.h - PDB Hash Table -----------------------------*- C++ -*-===//
34 template <typename ValueT> class HashTable;
41 friend HashTable<ValueT>;
43 HashTableIterator(const HashTable<ValueT> &Map, uint32_t Index,
48 HashTableIterator(const HashTable<ValueT> &Map) : Map(&Map) {
97 const HashTable<ValueT> *Map;
103 class HashTable {
115 HashTable() { Buckets.resize(8); }
116 explicit HashTable(uint32_t Capacity) {
317 HashTable NewMap(NewCapacity)
    [all...]
TpiStream.h 13 #include "llvm/DebugInfo/PDB/Native/HashTable.h"
53 HashTable<support::ulittle32_t> &getHashAdjusters();
88 HashTable<support::ulittle32_t> HashAdjusters;
NamedStreamMap.h 16 #include "llvm/DebugInfo/PDB/Native/HashTable.h"
62 HashTable<support::ulittle32_t> OffsetIndexMap;
PDBFileBuilder.h 97 HashTable<SrcHeaderBlockEntry> InjectedSourceTable;
  /src/external/apache2/llvm/dist/llvm/lib/Support/
StringMap.cpp 82 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
93 HashTable[FirstTombstone] = FullHashValue;
97 HashTable[BucketNo] = FullHashValue;
105 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) {
138 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
149 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) {
199 /// the appropriate mod-of-hashtable-size.
202 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
231 unsigned FullHash = HashTable[I];
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
lz4.c 360 HTYPE hashTable[HASHTABLESIZE];
470 HTYPE *HashTable = (HTYPE *) (srt->hashTable);
472 HTYPE HashTable[HASHTABLESIZE] = { 0 };
495 HashTable[LZ4_HASH_VALUE(ip)] = ip - base;
518 ref = base + HashTable[h];
519 HashTable[h] = ip - base;
609 HashTable[LZ4_HASH_VALUE(ip - 2)] = ip - 2 - base;
612 ref = base + HashTable[LZ4_HASH_VALUE(ip)];
613 HashTable[LZ4_HASH_VALUE(ip)] = ip - base
    [all...]
  /src/external/apache2/llvm/dist/clang/include/clang/Basic/
IdentifierTable.h 500 HashTableTy HashTable;
524 return HashTable.getAllocator();
530 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
567 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
591 iterator begin() const { return HashTable.begin(); }
592 iterator end() const { return HashTable.end(); }
593 unsigned size() const { return HashTable.size(); }
595 iterator find(StringRef Name) const { return HashTable.find(Name); }
  /src/external/apache2/llvm/dist/clang/lib/Basic/
IdentifierTable.cpp 67 : HashTable(8192), // Start with space for 8K identifiers.
367 unsigned NumBuckets = HashTable.getNumBuckets();
368 unsigned NumIdentifiers = HashTable.getNumItems();
375 I = HashTable.begin(), E = HashTable.end(); I != E; ++I) {
392 HashTable.getAllocator().PrintStats();
  /src/external/apache2/llvm/dist/clang/lib/Serialization/
MultiOnDiskHashTable.h 61 using HashTable = llvm::OnDiskIterableChainedHashTable<Info>;
64 HashTable Table;
218 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/
InstrProfReader.h 396 std::unique_ptr<HashTableImpl> HashTable;
415 return RecordIterator == HashTable->data_end();
419 HashTable->getInfoObj().setValueProfDataEndianness(Endianness);
437 return Symtab.create(HashTable->keys());
  /src/external/apache2/llvm/lib/libLLVMDebugInfoPDB/
Makefile 62 HashTable.cpp \
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/
InstrProfReader.cpp 588 auto Iter = HashTable->find(FuncName);
589 if (Iter == HashTable->end())
619 HashTable.reset(HashTableImpl::Create(
622 RecordIterator = HashTable->data_begin();
681 for (StringRef Name : Underlying.HashTable->keys()) {
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
StringMap.h 146 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1),
161 HashTable[I] = RHSHashTable[I];
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
TpiStream.cpp 238 HashTable<support::ulittle32_t> &TpiStream::getHashAdjusters() {
  /src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/
ELFDumper.cpp 348 const Elf_Hash *HashTable = nullptr;
560 void printHashHistogram(const Elf_Hash &HashTable);
562 void printHashTableSymbols(const Elf_Hash &HashTable);
1866 HashTable = reinterpret_cast<const Elf_Hash *>(
1995 if (HashTable && IsHashTableSupported) {
1998 else if (HashTable->nchain != DynSymRegion->Size / DynSymRegion->EntSize)
2000 "hash table nchain (" + Twine(HashTable->nchain) +
2022 if (HashTable && IsHashTableSupported && DynSymRegion) {
2025 (uint64_t)HashTable->nchain * DynSymRegion->EntSize;
2034 DynSymRegion->Size = HashTable->nchain * DynSymRegion->EntSize
    [all...]
llvm-readobj.cpp 217 cl::opt<bool> HashTable("hash-table",
531 if (opts::HashTable)
  /src/tests/usr.bin/indent/
fmt_decl.c 608 HashTable /* of CachedDirListNode */ table;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 187 using HashTable = DenseMap<BlockNode::IndexType, Weight>;
189 HashTable Combined(NextPowerOf2(2 * Weights.size()));

Completed in 53 milliseconds

1 2