/bootable/recovery/minzip/ |
Hash.h | 61 typedef struct HashTable { 67 } HashTable; 70 * Create and initialize a HashTable structure, using "initialSize" as 77 HashTable* mzHashTableCreate(size_t initialSize, HashFreeFunc freeFunc); 90 void mzHashTableClear(HashTable* pHashTable); 95 void mzHashTableFree(HashTable* pHashTable); 100 INLINE int mzHashTableNumEntries(HashTable* pHashTable) { 107 INLINE int mzHashTableMemUsage(HashTable* pHashTable) { 108 return sizeof(HashTable) + pHashTable->tableSize * sizeof(HashEntry); 120 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) 145 pNewEntries = (HashEntry*) calloc(newSize, sizeof(HashTable)); 179 void* mzHashTableLookup(HashTable* pHashTable, unsigned int itemHash, void* item [all...] |
Zip.h | 51 HashTable* pHash; // maps file name to ZipEntry
|
/external/giflib/ |
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;
|
/frameworks/compile/mclinker/include/mcld/LD/ |
ObjectReader.h | 12 #include <mcld/ADT/HashTable.h> 28 typedef HashTable<ResolveInfo, hash::StringHash<hash::DJB> > GroupSignatureMap;
|
SectionSymbolSet.h | 12 #include <mcld/ADT/HashTable.h> 67 typedef HashTable<SectHashEntryType,
|
Archive.h | 14 #include <mcld/ADT/HashTable.h> 78 typedef HashTable<ObjectMemberEntryType, 95 typedef HashTable<ArchiveMemberEntryType,
|
NamePool.h | 13 #include <mcld/ADT/HashTable.h> 38 typedef HashTable<ResolveInfo, hash::StringHash<hash::DJB> > Table; 101 // syminfo_iterator - traverse the ResolveInfo in the resolved HashTable
|
BranchIsland.h | 13 #include <mcld/ADT/HashTable.h> 167 typedef HashTable<StubEntryType,
|
/frameworks/compile/mclinker/include/mcld/Support/ |
PathCache.h | 13 #include <mcld/ADT/HashTable.h> 27 typedef HashTable<HashEntryType, hash::StringHash<hash::BKDR>, EntryFactory<HashEntryType> > PathCache;
|
/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); 214 unsigned FullHash = HashTable[I];
|
/frameworks/compile/mclinker/include/mcld/ADT/ |
HashTable.h | 1 //===- HashTable.h ---------------------------------------------------------===// 22 /** \class HashTable 23 * \brief HashTable is a hash table which follows boost::unordered_map, but it 26 * mcld::HashTable is a linear probing hash table. It does not allocate 33 class HashTable : public HashTableImpl<HashEntryTy, HashFunctionTy>, 61 explicit HashTable(size_type pSize=3); 62 ~HashTable(); 117 #include "HashTable.tcc"
|
/frameworks/compile/mclinker/include/mcld/ |
LinkerScript.h | 16 #include <mcld/ADT/HashTable.h> 32 typedef HashTable<StringEntry<llvm::StringRef>, 36 typedef HashTable<StringEntry<uint64_t>,
|
/frameworks/compile/mclinker/unittests/ |
HashTableTest.cpp | 12 #include <mcld/ADT/HashTable.h> 81 typedef HashTable<HashEntryType, PtrHash, EntryFactory<HashEntryType> > HashTableTy; 82 HashTableTy *hashTable = new HashTableTy(0); 87 entry = hashTable->insert(pA, exist); 89 EXPECT_FALSE(hashTable->empty()); 92 iter = hashTable->find(NULL); 93 EXPECT_TRUE(iter==hashTable->end()); 94 delete hashTable; 99 HashTable<HashEntryType, IntHash, EntryFactory<HashEntryType> > hashTable(16) [all...] |
/external/chromium_org/base/ |
id_map.h | 39 typedef base::hash_map<KeyType, T*> HashTable; 83 typename HashTable::iterator i = data_.find(id); 102 for (typename HashTable::iterator i = data_.begin(); 115 typename HashTable::const_iterator i = data_.find(id); 204 typename HashTable::const_iterator iter_; 216 static inline void release_all(HashTable* table) {} 221 static inline void release_all(HashTable* table) { 222 for (typename HashTable::iterator i = table->begin(); 251 HashTable data_;
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
HashTable.h | 93 class HashTable; 108 typedef HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator> HashTableType; 115 friend class HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>; 148 // HashTable and collections that build on it do not support 209 typedef HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator> HashTableType; 216 friend class HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>; 345 class HashTable : public HashTableDestructorBase<HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits, Allocator>, Allocator::isGarbageCollected> { 358 typedef HashTableAddResult<HashTable, ValueType> AddResult; 392 dataLogF("\nWTF::HashTable::Stats dump\n\n") [all...] |
/bionic/libc/bionic/ |
malloc_debug_common.h | 69 struct HashTable { 108 typedef bool (*MallocDebugInit)(HashTable*, const MallocDebug*);
|
malloc_debug_leak.cpp | 66 extern HashTable* g_hash_table; 109 static HashEntry* find_entry(HashTable* table, int slot, 168 // we just added an entry, increase the size of the hashtable 202 // we just removed and entry, decrease the size of the hashtable
|
malloc_debug_check.cpp | 131 __LIBC_HIDDEN__ HashTable* g_hash_table; 640 extern "C" bool malloc_debug_initialize(HashTable* hash_table, const MallocDebug* malloc_dispatch) {
|
/external/clang/include/clang/Basic/ |
IdentifierTable.h | 420 HashTableTy HashTable; 441 return HashTable.getAllocator(); 448 HashTable.GetOrCreateValue(Name); 490 HashTable.GetOrCreateValue(Name); 515 iterator begin() const { return HashTable.begin(); } 516 iterator end() const { return HashTable.end(); } 517 unsigned size() const { return HashTable.size(); }
|
/external/clang/lib/Basic/ |
IdentifierTable.cpp | 77 : HashTable(8192), // Start with space for 8K identifiers. 260 unsigned NumBuckets = HashTable.getNumBuckets(); 261 unsigned NumIdentifiers = HashTable.getNumItems(); 268 I = HashTable.begin(), E = HashTable.end(); I != E; ++I) { 285 HashTable.getAllocator().PrintStats();
|
/frameworks/compile/mclinker/lib/Script/ |
ScriptFile.cpp | 28 #include <mcld/ADT/HashTable.h> 39 typedef HashTable<ParserStrEntry,
|
/hardware/intel/img/libdrm/libdrm/ |
xf86drmHash.c | 110 typedef struct HashTable { 119 } HashTable, *HashTablePtr;
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ddk/ |
ntddk.h | [all...] |