| /bootable/recovery/minzip/ |
| Hash.h | 65 typedef struct HashTable {
71 } HashTable;
74 * Create and initialize a HashTable structure, using "initialSize" as
81 HashTable* mzHashTableCreate(size_t initialSize, HashFreeFunc freeFunc);
94 void mzHashTableClear(HashTable* pHashTable);
99 void mzHashTableFree(HashTable* pHashTable);
104 INLINE int mzHashTableNumEntries(HashTable* pHashTable) {
111 INLINE int mzHashTableMemUsage(HashTable* pHashTable) {
112 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry);
124 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item
[all...] |
| Hash.c | 51 HashTable* mzHashTableCreate(size_t initialSize, HashFreeFunc freeFunc)
53 HashTable* pHashTable;
57 pHashTable = (HashTable*) malloc(sizeof(*pHashTable));
65 (HashEntry*) calloc((size_t)pHashTable->tableSize, sizeof(HashTable));
77 void mzHashTableClear(HashTable* pHashTable)
102 void mzHashTableFree(HashTable* pHashTable)
115 static int countTombStones(HashTable* pHashTable)
137 static bool resizeHash(HashTable* pHashTable, int newSize)
144 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable));
178 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item
[all...] |
| Zip.h | 51 HashTable* pHash; // maps file name to ZipEntry
|
| /external/giflib/ |
| gif_hash.c | 35 Initialize HashTable - allocate the memory needed and clear it. *
39 GifHashTableType *HashTable;
41 if ((HashTable = (GifHashTableType *) malloc(sizeof(GifHashTableType)))
45 _ClearHashTable(HashTable);
47 return HashTable;
51 Routine to clear the HashTable to an empty state. *
54 void _ClearHashTable(GifHashTableType *HashTable)
56 memset(HashTable -> HTable, 0xFF, HT_SIZE * sizeof(uint32_t));
60 Routine to insert a new Item into the HashTable. The data is assumed to be *
63 void _InsertHashTable(GifHashTableType *HashTable, uint32_t Key, int Code
[all...] |
| gif_hash.h | 33 void _ClearHashTable(GifHashTableType *HashTable);
34 void _InsertHashTable(GifHashTableType *HashTable, uint32_t Key, int Code);
35 int _ExistsHashTable(GifHashTableType *HashTable, uint32_t Key);
|
| gif_lib_private.h | 53 GifHashTableType *HashTable;
|
| egif_lib.c | 108 if ((Private->HashTable = _InitHashTable()) == NULL) {
162 Private->HashTable = _InitHashTable();
163 if (Private->HashTable == NULL) {
791 if (Private->HashTable) {
792 free((char *) Private->HashTable);
861 _ClearHashTable(Private->HashTable);
884 GifHashTableType *HashTable;
887 HashTable = Private->HashTable;
900 if ((NewCode = _ExistsHashTable(HashTable, NewKey)) >= 0)
[all...] |
| /external/libdrm/ |
| xf86drmHash.h | 38 typedef struct HashTable {
47 } HashTable, *HashTablePtr;
|
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashTable.h | 1 //===- HashTable.h --------------------------------------------------------===//
23 /** \class HashTable
24 * \brief HashTable is a hash table which follows boost::unordered_map, but it
27 * mcld::HashTable is a linear probing hash table. It does not allocate
34 class HashTable : public HashTableImpl<HashEntryTy, HashFunctionTy> {
60 explicit HashTable(size_type pSize = 3);
61 ~HashTable();
114 DISALLOW_COPY_AND_ASSIGN(HashTable);
117 #include "HashTable.tcc"
|
| /frameworks/compile/mclinker/include/mcld/Support/ |
| PathCache.h | 13 #include "mcld/ADT/HashTable.h"
25 typedef HashTable<HashEntryType,
|
| /external/llvm/lib/Support/ |
| StringMap.cpp | 66 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
77 HashTable[FirstTombstone] = FullHashValue;
81 HashTable[BucketNo] = FullHashValue;
88 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) {
121 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
132 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) {
183 /// the appropriate mod-of-hashtable-size.
186 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1);
215 unsigned FullHash = HashTable[I];
|
| /frameworks/compile/mclinker/include/mcld/LD/ |
| ObjectReader.h | 11 #include "mcld/ADT/HashTable.h"
27 typedef HashTable<ResolveInfo, hash::StringHash<hash::DJB> >
|
| SectionSymbolSet.h | 12 #include "mcld/ADT/HashTable.h"
63 typedef HashTable<SectHashEntryType,
|
| Archive.h | 14 #include "mcld/ADT/HashTable.h"
72 typedef HashTable<ObjectMemberEntryType,
89 typedef HashTable<ArchiveMemberEntryType,
|
| NamePool.h | 12 #include "mcld/ADT/HashTable.h"
33 typedef HashTable<ResolveInfo, hash::StringHash<hash::DJB> > Table;
95 // syminfo_iterator - traverse the ResolveInfo in the resolved HashTable
|
| BranchIsland.h | 13 #include "mcld/ADT/HashTable.h"
159 typedef HashTable<StubEntryType, Key::Hash, EntryFactory<StubEntryType> >
|
| /external/libchrome/base/ |
| id_map.h | 43 typedef base::hash_map<KeyType, T*> HashTable;
90 typename HashTable::iterator i = data_.find(id);
112 typename HashTable::iterator i = data_.find(id);
128 for (typename HashTable::iterator i = data_.begin();
141 typename HashTable::const_iterator i = data_.find(id);
230 typename HashTable::const_iterator iter_;
242 static inline void release_all(HashTable* table) {}
247 static inline void release_all(HashTable* table) {
248 for (typename HashTable::iterator i = table->begin();
275 HashTable data_
[all...] |
| /frameworks/compile/mclinker/unittests/ |
| HashTableTest.cpp | 12 #include "mcld/ADT/HashTable.h"
65 typedef HashTable<HashEntryType, PtrHash, EntryFactory<HashEntryType> >
67 HashTableTy* hashTable = new HashTableTy(0);
70 hashTable->insert(pA, exist);
72 EXPECT_FALSE(hashTable->empty());
75 iter = hashTable->find(NULL);
76 EXPECT_TRUE(iter == hashTable->end());
77 delete hashTable;
82 HashTable<HashEntryType, IntHash, EntryFactory<HashEntryType> > hashTable(16)
[all...] |
| /frameworks/compile/mclinker/include/mcld/ |
| LinkerScript.h | 12 #include "mcld/ADT/HashTable.h"
35 typedef HashTable<StringEntry<llvm::StringRef>,
39 typedef HashTable<StringEntry<uint64_t>,
|
| /external/clang/include/clang/Basic/ |
| IdentifierTable.h | 435 HashTableTy HashTable;
456 return HashTable.getAllocator();
462 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
499 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first;
523 iterator begin() const { return HashTable.begin(); }
524 iterator end() const { return HashTable.end(); }
525 unsigned size() const { return HashTable.size(); }
|
| /external/llvm/include/llvm/ProfileData/ |
| InstrProfReader.h | 305 std::unique_ptr<HashTableImpl> HashTable;
320 return RecordIterator == HashTable->data_end();
323 HashTable->getInfoObj().setValueProfDataEndianness(Endianness);
328 Symtab.create(HashTable->keys());
|
| /external/clang/lib/Basic/ |
| IdentifierTable.cpp | 76 : HashTable(8192), // Start with space for 8K identifiers.
312 unsigned NumBuckets = HashTable.getNumBuckets();
313 unsigned NumIdentifiers = HashTable.getNumItems();
320 I = HashTable.begin(), E = HashTable.end(); I != E; ++I) {
337 HashTable.getAllocator().PrintStats();
|
| /external/clang/lib/Serialization/ |
| MultiOnDiskHashTable.h | 47 typedef llvm::OnDiskIterableChainedHashTable<Info> HashTable;
50 HashTable Table;
202 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
|
| /external/lz4/lib/ |
| lz4hc.c | 88 U32 hashTable[HASHTABLESIZE];
117 MEM_INIT((void*)hc4->hashTable, 0, sizeof(hc4->hashTable));
133 U32* HashTable = hc4->hashTable;
141 size_t delta = idx - HashTable[h];
144 HashTable[h] = idx;
158 U32* const HashTable = hc4->hashTable;
170 matchIndex = HashTable[LZ4HC_hashPtr(ip)]
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
| ntddk.h | [all...] |
