/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 hash_table_find(struct hash_table *ht, const void *key) 131 hash_table_insert(struct hash_table *ht, void *data, const void *key) 146 hash_table_remove(struct hash_table *ht, const void *key [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/ |
symtab.h | 40 typedef struct ht hash_table; typedef in typeref:struct:ht 53 hashnode (*alloc_node) (hash_table *); 73 extern hash_table *ht_create (unsigned int order); 76 extern void ht_destroy (hash_table *); 78 extern hashnode ht_lookup (hash_table *, const unsigned char *, 80 extern hashnode ht_lookup_with_hash (hash_table *, const unsigned char *, 90 extern void ht_forall (hash_table *, ht_cb, const void *); 94 extern void ht_purge (hash_table *, ht_cb, const void *); 97 extern void ht_load (hash_table *ht, hashnode *entries, 101 extern void ht_dump_statistics (hash_table *); [all...] |
/prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/ |
symtab.h | 40 typedef struct ht hash_table; typedef in typeref:struct:ht 53 hashnode (*alloc_node) (hash_table *); 73 extern hash_table *ht_create (unsigned int order); 76 extern void ht_destroy (hash_table *); 78 extern hashnode ht_lookup (hash_table *, const unsigned char *, 80 extern hashnode ht_lookup_with_hash (hash_table *, const unsigned char *, 90 extern void ht_forall (hash_table *, ht_cb, const void *); 94 extern void ht_purge (hash_table *, ht_cb, const void *); 97 extern void ht_load (hash_table *ht, hashnode *entries, 101 extern void ht_dump_statistics (hash_table *); [all...] |
/prebuilt/linux-x86/toolchain/arm-linux-androideabi-4.4.x/lib/gcc/arm-linux-androideabi/4.4.3/plugin/include/ |
symtab.h | 40 typedef struct ht hash_table; typedef in typeref:struct:ht 53 hashnode (*alloc_node) (hash_table *); 73 extern hash_table *ht_create (unsigned int order); 76 extern void ht_destroy (hash_table *); 78 extern hashnode ht_lookup (hash_table *, const unsigned char *, 80 extern hashnode ht_lookup_with_hash (hash_table *, const unsigned char *, 90 extern void ht_forall (hash_table *, ht_cb, const void *); 94 extern void ht_purge (hash_table *, ht_cb, const void *); 97 extern void ht_load (hash_table *ht, hashnode *entries, 101 extern void ht_dump_statistics (hash_table *); [all...] |
/external/bluetooth/glib/gobject/ |
gboxed.c | 241 GHashTable *hash_table = boxed; local 242 return g_hash_table_ref (hash_table); 248 GHashTable *hash_table = boxed; local 249 g_hash_table_unref (hash_table);
|
gparam.c | 853 GHashTable *hash_table; member in struct:_GParamSpecPool 901 pool->hash_table = g_hash_table_new (param_spec_pool_hash, param_spec_pool_equals); 936 g_hash_table_insert (pool->hash_table, pspec, pspec); 962 if (g_hash_table_remove (pool->hash_table, pspec)) 976 param_spec_ht_lookup (GHashTable *hash_table, 988 pspec = g_hash_table_lookup (hash_table, &key); 995 pspec = g_hash_table_lookup (hash_table, &key); 1007 pspec = g_hash_table_lookup (hash_table, &key); 1017 pspec = g_hash_table_lookup (hash_table, &key); 1058 pspec = param_spec_ht_lookup (pool->hash_table, param_name, owner_type, walk_ancestors) [all...] |
/external/bluetooth/glib/tests/ |
hash-test.c | 48 fill_hash_table_and_array (GHashTable *hash_table) 55 g_hash_table_insert (hash_table, &array[i], &array[i]); 386 GHashTable *hash_table; local 396 hash_table = g_hash_table_new (my_hash, my_hash_equal); 397 fill_hash_table_and_array (hash_table); 398 pvalue = g_hash_table_find (hash_table, find_first, &value); 402 keys = g_hash_table_get_keys (hash_table); 406 values = g_hash_table_get_values (hash_table); 412 if (values_len != keys_len && keys_len != g_hash_table_size (hash_table)) 419 g_hash_table_iter_init (&iter, hash_table); [all...] |
testglib.c | 1031 GHashTable *hash_table; local 1037 hash_table = g_hash_table_new (my_hash, my_hash_equal); 1041 g_hash_table_insert (hash_table, &array[i], &array[i]); 1043 pvalue = g_hash_table_find (hash_table, find_first_that, &value); 1046 g_hash_table_foreach (hash_table, my_hash_callback, NULL); 1051 g_hash_table_remove (hash_table, &array[i]); 1055 g_hash_table_insert (hash_table, &array[i], &array[i]); 1057 if (g_hash_table_foreach_remove (hash_table, my_hash_callback_remove, NULL) != 5000 || 1058 g_hash_table_size (hash_table) != 5000) 1060 g_hash_table_foreach (hash_table, my_hash_callback_remove_test, NULL) [all...] |
/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...] |
/ndk/sources/host-tools/make-3.81/ |
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/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) 250 hash_lookup (const Hash_table *table, const void *entry) 279 hash_get_first (const Hash_table *table) 298 hash_get_next (const Hash_table *table, const void *entry [all...] |
/external/bluetooth/glib/glib/ |
ghash.c | 78 GHashTable *hash_table; member in struct:__anon2056 127 g_hash_table_set_shift (GHashTable *hash_table, gint shift) 132 hash_table->size = 1 << shift; 133 hash_table->mod = prime_mod [shift]; 141 hash_table->mask = mask; 156 g_hash_table_set_shift_from_size (GHashTable *hash_table, gint size) 163 g_hash_table_set_shift (hash_table, shift); 168 * @hash_table: our #GHashTable 184 g_hash_table_lookup_node (GHashTable *hash_table, 195 hash_value = (* hash_table->hash_func) (key) 509 GHashTable *hash_table; local [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/webkit/Tools/android/flex-2.5.4a/ |
flexdef.h | 331 typedef struct hash_entry **hash_table; typedef in typeref:struct:hash_entry [all...] |