| /system/core/libziparchive/ |
| zip_archive_private.h | 110 ZipString* hash_table; member in struct:ZipArchive
120 hash_table(nullptr) {}
130 hash_table(nullptr) {}
137 free(hash_table);
|
| zip_archive.cc | 175 static int64_t EntryToIndex(const ZipString* hash_table,
182 while (hash_table[ent].name != NULL) {
183 if (hash_table[ent] == name) {
197 static int32_t AddToHash(ZipString *hash_table, const uint64_t hash_table_size,
206 while (hash_table[ent].name != NULL) {
207 if (hash_table[ent] == name) {
215 hash_table[ent].name = name.name;
216 hash_table[ent].name_length = name.name_length;
374 archive->hash_table = reinterpret_cast<ZipString*>(calloc(archive->hash_table_size,
376 if (archive->hash_table == nullptr)
745 const ZipString* hash_table = archive->hash_table; local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 25 * \file hash_table.c
33 #include "hash_table.h"
40 struct hash_table { struct
56 struct hash_table *
60 struct hash_table *ht;
85 hash_table_dtor(struct hash_table *ht)
93 hash_table_clear(struct hash_table *ht)
112 get_node(struct hash_table *ht, const void *key)
130 hash_table_find(struct hash_table *ht, const void *key)
138 hash_table_insert(struct hash_table *ht, void *data, const void *key
[all...] |
| /frameworks/compile/mclinker/include/mcld/ADT/ |
| HashIterator.h | 22 typedef HashTableImplTy hash_table; typedef in class:mcld::ChainIteratorBase
155 typedef HashTableImplTy hash_table; typedef in class:mcld::EntryIteratorBase
266 HashIterator(typename IteratorBase::hash_table* pTable, unsigned int pIndex)
270 explicit HashIterator(typename IteratorBase::hash_table* pTable,
|
| /external/e2fsprogs/debugfs/ |
| revoke.c | 119 struct list_head *hash_table; member in struct:jbd2_revoke_table_s
158 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
180 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
243 table->hash_table =
245 if (!table->hash_table) {
252 INIT_LIST_HEAD(&table->hash_table[tmp]);
264 hash_list = &table->hash_table[i];
268 kfree(table->hash_table);
495 hash_list = &revoke->hash_table[i];
526 INIT_LIST_HEAD(&journal->j_revoke->hash_table[i])
[all...] |
| /external/e2fsprogs/e2fsck/ |
| revoke.c | 119 struct list_head *hash_table; member in struct:jbd2_revoke_table_s
158 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
180 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)];
243 table->hash_table =
245 if (!table->hash_table) {
252 INIT_LIST_HEAD(&table->hash_table[tmp]);
264 hash_list = &table->hash_table[i];
268 kfree(table->hash_table);
495 hash_list = &revoke->hash_table[i];
526 INIT_LIST_HEAD(&journal->j_revoke->hash_table[i])
[all...] |
| /external/squashfs-tools/squashfs-tools/ |
| caches-queues-lists.h | 62 entry->LINK##_next = container->hash_table[hash]; \
63 container->hash_table[hash] = entry; \
76 container->hash_table[HASH_FUNCTION(entry->FIELD)] = \
149 struct file_buffer *hash_table[HASH_SIZE]; member in struct:seq_queue
171 struct file_buffer *hash_table[HASH_SIZE]; member in struct:cache
|
| read_xattrs.c | 56 } *hash_table[65536]; variable in typeref:struct:hash_entry
88 hash_entry->next = hash_table[hash];
89 hash_table[hash] = hash_entry;
100 struct hash_entry *hash_entry = hash_table[hash];
|
| unsquashfs.h | 138 struct cache_entry *hash_table[65536]; member in struct:cache
|
| /external/syslinux/com32/include/sys/ |
| module.h | 104 Elf_Word *hash_table; // The symbol hash table member in struct:elf_module
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| elf32-sh-symbian.c | 442 struct elf_link_hash_table * hash_table; local
450 hash_table = elf_hash_table (info);
463 ptr->current_hash = elf_link_hash_lookup (hash_table, ptr->current_name, FALSE, FALSE, TRUE);
472 new_hash = elf_link_hash_lookup (hash_table, ptr->new_name,
|
| archive.c | 306 htab_t hash_table = bfd_ardata (arch_bfd)->cache;
311 if (hash_table)
313 struct ar_cache *entry = (struct ar_cache *) htab_find (hash_table, &m);
354 htab_t hash_table = bfd_ardata (arch_bfd)->cache;
357 if (hash_table == NULL)
359 hash_table = htab_create_alloc (16, hash_file_ptr, eq_file_ptr,
361 if (hash_table == NULL)
363 bfd_ardata (arch_bfd)->cache = hash_table;
370 *htab_find_slot (hash_table, (const void *) cache, INSERT) = cache;
373 arch_eltdata (new_elt)->parent_cache = hash_table;
304 htab_t hash_table = bfd_ardata (arch_bfd)->cache; local
352 htab_t hash_table = bfd_ardata (arch_bfd)->cache; local
[all...] |
| elf-m10300.c | 2658 struct elf32_mn10300_link_hash_table *hash_table; local
[all...] |
| dwarf2.c | 427 struct info_hash_table *hash_table; local
429 hash_table = ((struct info_hash_table *)
431 if (!hash_table)
432 return hash_table;
434 if (!bfd_hash_table_init (&hash_table->base, info_hash_table_newfunc,
437 bfd_release (abfd, hash_table);
441 return hash_table;
450 insert_info_hash_table (struct info_hash_table *hash_table,
458 entry = (struct info_hash_entry*) bfd_hash_lookup (&hash_table->base,
463 node = (struct info_list_node *) bfd_hash_allocate (&hash_table->base
[all...] |
| elf64-ia64-vms.c | 2603 struct elf_link_hash_table *hash_table; local
[all...] |
| som.c | 5869 unsigned char *hash_table; local
5950 unsigned char *hash_table; local
6301 unsigned char *hash_table = NULL; local
[all...] |
| elf32-arm.c | 5596 struct elf32_arm_link_hash_table *hash_table; local
5632 struct elf32_arm_link_hash_table *hash_table; local
5958 struct elf32_arm_link_hash_table *hash_table; local
[all...] |
| elflink.c | 162 struct elf_link_hash_table *hash_table;
164 hash_table = elf_hash_table (info);
165 if (hash_table->dynobj == NULL)
166 hash_table->dynobj = abfd;
168 if (hash_table->dynstr == NULL)
170 hash_table->dynstr = _bfd_elf_strtab_init ();
171 if (hash_table->dynstr == NULL)
161 struct elf_link_hash_table *hash_table; local
2715 struct elf_link_hash_table *hash_table; local
2786 struct elf_link_hash_table *hash_table; local
2994 struct elf_link_hash_table *hash_table; local
3034 struct elf_link_hash_table *hash_table; local
3138 struct elf_link_hash_table *hash_table = elf_hash_table (info); local
[all...] |
| /external/bison/lib/ |
| hash.c | 52 struct hash_table struct
150 hash_get_n_buckets (const Hash_table *table)
158 hash_get_n_buckets_used (const Hash_table *table)
166 hash_get_n_entries (const Hash_table *table)
174 hash_get_max_bucket_length (const Hash_table *table)
201 hash_table_ok (const Hash_table *table)
230 hash_print_statistics (const Hash_table *table, FILE *stream)
249 safe_hasher (const Hash_table *table, const void *key)
261 hash_lookup (const Hash_table *table, const void *entry)
288 hash_get_first (const Hash_table *table
[all...] |
| /external/dnsmasq/src/ |
| cache.c | 19 static struct crec *cache_head = NULL, *cache_tail = NULL, **hash_table = NULL; variable in typeref:struct:
99 /* In most cases, we create the hash table once here by calling this with (hash_table == NULL)
112 if (!hash_table)
120 old = hash_table;
122 hash_table = new;
151 return hash_table + ((val ^ (val >> 16)) & (hash_size - 1));
308 for (crecp = hash_table[i], up = &hash_table[i];
601 for (crecp = hash_table[i], up = &hash_table[i];
[all...] |
| /external/syslinux/gpxe/src/drivers/net/ |
| dmfe.c | 583 u16 i, hash_table[4]; local
604 hash_table[i] = 0x0;
607 hash_table[3] = 0x8000;
612 hash_table[hash_val / 16] |= (u16) 1 << (hash_val % 16);
617 outw(hash_table[i], ioaddr);
|
| /toolchain/binutils/binutils-2.25/gold/ |
| dwp.cc | 541 hash_table(unsigned int slot) const function in class:gold::Dwp_output_file::Dwp_index
[all...] |
