/external/mesa3d/src/mesa/program/ |
hash_table.h | 25 * \file hash_table.h 47 struct hash_table; 63 extern struct hash_table *hash_table_ctor(unsigned num_buckets, 73 extern void hash_table_dtor(struct hash_table *ht); 81 extern void hash_table_clear(struct hash_table *ht); 95 extern void *hash_table_find(struct hash_table *ht, const void *key); 112 extern void hash_table_insert(struct hash_table *ht, void *data, 129 extern bool hash_table_replace(struct hash_table *ht, void *data, 135 extern void hash_table_remove(struct hash_table *ht, const void *key); 185 hash_table_call_foreach(struct hash_table *ht [all...] |
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...] |
/system/core/libziparchive/ |
zip_archive_private.h | 44 ZipString* hash_table; member in struct:ZipArchive 52 hash_table(NULL) {} 59 free(hash_table);
|
zip_archive.cc | 172 static int64_t EntryToIndex(const ZipString* hash_table, 179 while (hash_table[ent].name != NULL) { 180 if (hash_table[ent] == name) { 194 static int32_t AddToHash(ZipString *hash_table, const uint64_t hash_table_size, 203 while (hash_table[ent].name != NULL) { 204 if (hash_table[ent] == name) { 212 hash_table[ent].name = name.name; 213 hash_table[ent].name_length = name.name_length; 374 archive->hash_table = reinterpret_cast<ZipString*>(calloc(archive->hash_table_size, 417 const int add_result = AddToHash(archive->hash_table, 735 const ZipString* hash_table = archive->hash_table; local [all...] |
/ndk/sources/host-tools/make-3.81/ |
hash.c | 27 static void hash_rehash __P((struct hash_table* ht)); 43 hash_init (struct hash_table *ht, unsigned long size, 69 hash_load (struct hash_table *ht, void *item_table, 86 hash_find_slot (struct hash_table *ht, const void *key) 121 hash_find_item (struct hash_table *ht, const void *key) 128 hash_insert (struct hash_table *ht, const void *item) 137 hash_insert_at (struct hash_table *ht, const void *item, const void *slot) 158 hash_delete (struct hash_table *ht, const void *item) 165 hash_delete_at (struct hash_table *ht, const void *slot) 179 hash_free_items (struct hash_table *ht [all...] |
hash.h | 43 struct hash_table struct 60 void hash_init __P((struct hash_table *ht, unsigned long size, 62 void hash_load __P((struct hash_table *ht, void *item_table, 64 void **hash_find_slot __P((struct hash_table *ht, void const *key)); 65 void *hash_find_item __P((struct hash_table *ht, void const *key)); 66 void *hash_insert __P((struct hash_table *ht, const void *item)); 67 void *hash_insert_at __P((struct hash_table *ht, const void *item, void const *slot)); 68 void *hash_delete __P((struct hash_table *ht, void const *item)); 69 void *hash_delete_at __P((struct hash_table *ht, void const *slot)); 70 void hash_delete_items __P((struct hash_table *ht)) [all...] |
/external/mesa3d/src/glsl/ |
ir.h | 108 struct hash_table *ht) const = 0; 150 virtual ir_rvalue *clone(void *mem_ctx, struct hash_table *) const; 159 virtual ir_constant *constant_expression_value(struct hash_table *variable_context = NULL); 310 virtual ir_variable *clone(void *mem_ctx, struct hash_table *ht) const; 531 struct hash_table *ht) const; 533 struct hash_table *ht) const; 547 ir_constant *constant_expression_value(exec_list *actual_parameters, struct hash_table *variable_context); 630 struct hash_table *variable_context, 644 virtual ir_function *clone(void *mem_ctx, struct hash_table *ht) const; 723 virtual ir_if *clone(void *mem_ctx, struct hash_table *ht) const [all...] |
ir_clone.cpp | 28 #include "program/hash_table.h" 31 ir_rvalue::clone(void *mem_ctx, struct hash_table *ht) const 45 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const 92 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const 98 ir_return::clone(void *mem_ctx, struct hash_table *ht) const 109 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const 120 ir_loop_jump::clone(void *mem_ctx, struct hash_table *ht) const 128 ir_if::clone(void *mem_ctx, struct hash_table *ht) const 146 ir_loop::clone(void *mem_ctx, struct hash_table *ht) const 168 ir_call::clone(void *mem_ctx, struct hash_table *ht) cons [all...] |
loop_analysis.h | 30 #include "program/hash_table.h" 109 hash_table *var_hash; 248 hash_table *ht;
|
ir_print_visitor.h | 87 hash_table *printable_names;
|
loop_analysis.cpp | 31 hash_table *); 33 static ir_rvalue *get_basic_induction_increment(ir_assignment *, hash_table *); 405 examine_rhs(hash_table *loop_variables) 426 hash_table *loop_variables; 432 all_expression_operands_are_loop_constant(ir_rvalue *ir, hash_table *variables) 443 get_basic_induction_increment(ir_assignment *ir, hash_table *var_hash)
|
link_functions.cpp | 29 #include "program/hash_table.h" 143 struct hash_table *ht = hash_table_ctor(0, hash_table_pointer_hash, 241 hash_table *locals;
|
lower_if_to_cond_assign.cpp | 50 #include "program/hash_table.h" 76 struct hash_table *condition_variables; 113 struct hash_table *ht)
|
ir_constant_expression.cpp | 41 #include "program/hash_table.h" 98 ir_rvalue::constant_expression_value(struct hash_table *variable_context) 105 ir_expression::constant_expression_value(struct hash_table *variable_context) 943 ir_texture::constant_expression_value(struct hash_table *variable_context) 951 ir_swizzle::constant_expression_value(struct hash_table *variable_context) 980 ir_dereference_variable::constant_referenced(struct hash_table *variable_context, 993 ir_dereference_variable::constant_expression_value(struct hash_table *variable_context) 1020 ir_dereference_array::constant_referenced(struct hash_table *variable_context, 1074 ir_dereference_array::constant_expression_value(struct hash_table *variable_context) 1129 ir_dereference_record::constant_referenced(struct hash_table *variable_context [all...] |
lower_output_reads.cpp | 26 #include "program/hash_table.h" 46 hash_table *replacements;
|
/external/bison/lib/ |
hash.h | 67 struct hash_table; 69 typedef struct hash_table Hash_table; 72 size_t hash_get_n_buckets (const Hash_table *) _GL_ATTRIBUTE_PURE; 73 size_t hash_get_n_buckets_used (const Hash_table *) _GL_ATTRIBUTE_PURE; 74 size_t hash_get_n_entries (const Hash_table *) _GL_ATTRIBUTE_PURE; 75 size_t hash_get_max_bucket_length (const Hash_table *) _GL_ATTRIBUTE_PURE; 76 bool hash_table_ok (const Hash_table *) _GL_ATTRIBUTE_PURE; 77 void hash_print_statistics (const Hash_table *, FILE *); 78 void *hash_lookup (const Hash_table *, const void *) [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];
|
caches-queues-lists.c | 201 for(entry = queue->hash_table[hash]; entry; 241 queue->hash_table[i] = NULL; 322 memset(cache->hash_table, 0, sizeof(struct file_buffer *) * 65536); 341 for(entry = cache->hash_table[hash]; entry; entry = entry->hash_next) 581 for(entry = cache->hash_table[hash]; entry; entry = entry->hash_next)
|
/external/e2fsprogs/e2fsck/ |
revoke.c | 96 struct list_head *hash_table; member in struct:jbd_revoke_table_s 135 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)]; 160 hash_list = &journal->j_revoke->hash_table[hash(journal, blocknr)]; 221 journal->j_revoke->hash_table = 223 if (!journal->j_revoke->hash_table) { 230 INIT_LIST_HEAD(&journal->j_revoke->hash_table[tmp]); 248 hash_list = &table->hash_table[i]; 252 kfree(table->hash_table); 452 hash_list = &revoke->hash_table[i]; 632 hash_list = &revoke->hash_table[i] [all...] |
/external/bison/src/ |
uniqstr.c | 37 static struct hash_table *uniqstrs_table = NULL;
|
/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/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/mesa3d/src/mesa/ |
Android.mk | 130 program/hash_table.c \ 145 program/hash_table.c \
|
/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,
|