/external/giflib/ |
H A D | gif_hash.c | 35 Initialize HashTable - allocate the memory needed and clear it. * 39 GifHashTableType *HashTable; local 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) argument 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_ argument 86 _ExistsHashTable(GifHashTableType *HashTable, uint32_t Key) argument [all...] |
H A D | 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);
|
H A D | gif_lib_private.h | 53 GifHashTableType *HashTable; member in struct:GifFilePrivateType
|
H A D | egif_lib.c | 109 if ((Private->HashTable = _InitHashTable()) == NULL) { 166 Private->HashTable = _InitHashTable(); 167 if (Private->HashTable == NULL) { 795 if (Private->HashTable) { 796 free((char *) Private->HashTable); 865 _ClearHashTable(Private->HashTable); 888 GifHashTableType *HashTable; local 891 HashTable = Private->HashTable; 904 if ((NewCode = _ExistsHashTable(HashTable, NewKe [all...] |
/external/libdrm/ |
H A D | xf86drmHash.h | 38 typedef struct HashTable { struct 47 } HashTable, *HashTablePtr; typedef in typeref:struct:HashTable
|
/external/llvm/lib/Support/ |
H A D | StringMap.cpp | 80 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); local 91 HashTable[FirstTombstone] = FullHashValue; 95 HashTable[BucketNo] = FullHashValue; 102 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { 135 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); local 146 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { 200 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); local 229 unsigned FullHash = HashTable[I];
|
/external/swiftshader/third_party/llvm-subzero/lib/Support/ |
H A D | StringMap.cpp | 81 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); local 92 HashTable[FirstTombstone] = FullHashValue; 96 HashTable[BucketNo] = FullHashValue; 103 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { 135 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); local 146 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { 198 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); local 227 unsigned FullHash = HashTable[I];
|
/external/libchrome/base/ |
H A D | id_map.h | 43 typedef base::hash_map<KeyType, T*> HashTable; typedef in class:IDMap 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...] |
/external/clang/include/clang/Basic/ |
H A D | IdentifierTable.h | 450 HashTableTy HashTable; member in class:clang::IdentifierTable 471 return HashTable.getAllocator(); 477 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first; 514 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first; 538 iterator begin() const { return HashTable.begin(); } 539 iterator end() const { return HashTable.end(); } 540 unsigned size() const { return HashTable.size(); }
|
/external/v8/src/heap/ |
H A D | object-stats.h | 160 template <class HashTable> 161 void RecordHashTableHelper(HeapObject* parent, HashTable* array, int subtype);
|
H A D | object-stats.cc | 374 template <class HashTable> 376 HashTable* array, 378 int used = array->NumberOfElements() * HashTable::kEntrySize * kPointerSize; 381 HashTable::kElementsStartIndex * kPointerSize - 430 // The JS versions use a different HashTable implementation that cannot use
|
/external/clang/lib/Basic/ |
H A D | IdentifierTable.cpp | 77 : HashTable(8192), // Start with space for 8K identifiers. 313 unsigned NumBuckets = HashTable.getNumBuckets(); 314 unsigned NumIdentifiers = HashTable.getNumItems(); 321 I = HashTable.begin(), E = HashTable.end(); I != E; ++I) { 338 HashTable.getAllocator().PrintStats();
|
/external/clang/lib/Serialization/ |
H A D | MultiOnDiskHashTable.h | 47 typedef llvm::OnDiskIterableChainedHashTable<Info> HashTable; typedef in struct:clang::serialization::MultiOnDiskHashTable::OnDiskTable 50 HashTable Table; 202 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
|
/external/llvm/include/llvm/ProfileData/ |
H A D | InstrProfReader.h | 329 std::unique_ptr<HashTableImpl> HashTable; member in class:llvm::IndexedInstrProf::InstrProfReaderIndex 344 return RecordIterator == HashTable->data_end(); 347 HashTable->getInfoObj().setValueProfDataEndianness(Endianness); 355 Symtab.create(HashTable->keys());
|
/external/protobuf/php/ext/google/protobuf/ |
H A D | protobuf.h | 43 HashTable upb_def_to_php_obj_map; 67 HashTable* pending_list;
|
/external/llvm/include/llvm/ADT/ |
H A D | StringMap.h | 259 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), local 274 HashTable[I] = RHSHashTable[I];
|
/external/llvm/tools/llvm-readobj/ |
H A D | llvm-readobj.cpp | 133 cl::opt<bool> HashTable("hash-table", 377 if (opts::HashTable)
|
H A D | ELFDumper.cpp | 188 const Elf_Hash *HashTable = nullptr; member in class:__anon13649::ELFDumper 242 const Elf_Hash *getHashTable() const { return HashTable; } 1386 HashTable = 1810 DictScope D(W, "HashTable"); 1811 if (!HashTable) 1813 W.printNumber("Num Buckets", HashTable->nbucket); 1814 W.printNumber("Num Chains", HashTable->nchain); 1815 W.printList("Buckets", HashTable->buckets()); 1816 W.printList("Chains", HashTable->chains()); 3065 const Elf_Hash *HashTable local [all...] |
/external/lz4/lib/ |
H A D | lz4opt.h | 89 U32* const HashTable = ctx->hashTable; local 106 HashPos = &HashTable[LZ4HC_hashPtr(ip)];
|
H A D | lz4hc.c | 138 U32* const HashTable = hc4->hashTable; local 149 matchIndex = HashTable[LZ4HC_hashPtr(ip)]; 191 U32* const HashTable = hc4->hashTable; local 204 matchIndex = HashTable[LZ4HC_hashPtr(ip)];
|
/external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
H A D | StringMap.h | 265 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1), local 280 HashTable[I] = RHSHashTable[I];
|
/external/llvm/lib/ProfileData/ |
H A D | InstrProfReader.cpp | 529 auto Iter = HashTable->find(FuncName); 530 if (Iter == HashTable->end()) 560 HashTable.reset(HashTableImpl::Create( 563 RecordIterator = HashTable->data_begin();
|
/external/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfoImpl.cpp | 159 typedef DenseMap<BlockNode::IndexType, Weight> HashTable; 160 HashTable Combined(NextPowerOf2(2 * Weights.size()));
|
/external/v8/src/ |
H A D | objects.h | 84 // - HashTable 1062 V(HashTable) \ 3236 // HashTable is a subclass of FixedArray that implements a hash table 3308 // number of elements. May be more than HashTable::kMaxCapacity. 3357 class HashTable : public HashTableBase { class in class:v8::internal::KeyCollectionMode 3378 // Returns a new HashTable object. 3384 DECLARE_CAST(HashTable) 3409 // Maximal capacity of HashTable. Based on maximal length of underlying 3508 class StringTable: public HashTable<StringTable, 3556 class StringSet : public HashTable<StringSe [all...] |
H A D | objects-inl.h | 3152 int HashTable<Derived, Shape, Key>::FindEntry(Key key) { 3158 int HashTable<Derived, Shape, Key>::FindEntry(Isolate* isolate, Key key) { 3159 return FindEntry(isolate, key, HashTable::Hash(key)); 3164 int HashTable<Derived, Shape, Key>::FindEntry(Isolate* isolate, Key key, 3184 bool HashTable<Derived, Shape, Key>::Has(Key key) { 3189 bool HashTable<Derived, Shape, Key>::Has(Isolate* isolate, Key key) { 3406 HashTable<Derived, Shape, Key>* 3407 HashTable<Derived, Shape, Key>::cast(Object* obj) { 3409 return reinterpret_cast<HashTable*>(obj); 3414 const HashTable<Derive [all...] |