Searched refs:ht (Results 1 - 25 of 295) sorted by relevance

1234567891011>>

/external/mesa3d/src/gallium/auxiliary/util/
H A Du_handle_table.c64 struct handle_table *ht; local
66 ht = MALLOC_STRUCT(handle_table);
67 if (!ht)
70 ht->objects = (void **)CALLOC(HANDLE_TABLE_INITIAL_SIZE, sizeof(void *));
71 if(!ht->objects) {
72 FREE(ht);
76 ht->size = HANDLE_TABLE_INITIAL_SIZE;
77 ht->filled = 0;
79 ht->destroy = NULL;
81 return ht;
86 handle_table_set_destroy(struct handle_table *ht, void (*destroy)(void *object)) argument
100 handle_table_resize(struct handle_table *ht, unsigned minimum_size) argument
130 handle_table_clear(struct handle_table *ht, unsigned index) argument
152 handle_table_add(struct handle_table *ht, void *object) argument
190 handle_table_set(struct handle_table *ht, unsigned handle, void *object) argument
220 handle_table_get(struct handle_table *ht, unsigned handle) argument
237 handle_table_remove(struct handle_table *ht, unsigned handle) argument
261 handle_table_get_next_handle(struct handle_table *ht, unsigned handle) argument
276 handle_table_get_first_handle(struct handle_table *ht) argument
283 handle_table_destroy(struct handle_table *ht) argument
[all...]
H A Du_handle_table.h63 handle_table_set_destroy(struct handle_table *ht,
73 handle_table_add(struct handle_table *ht,
80 handle_table_set(struct handle_table *ht,
90 handle_table_get(struct handle_table *ht,
95 handle_table_remove(struct handle_table *ht,
100 handle_table_destroy(struct handle_table *ht);
104 handle_table_get_first_handle(struct handle_table *ht);
108 handle_table_get_next_handle(struct handle_table *ht,
H A Du_hash_table.c82 struct util_hash_table *ht; local
84 ht = MALLOC_STRUCT(util_hash_table);
85 if (!ht)
88 ht->cso = cso_hash_create();
89 if(!ht->cso) {
90 FREE(ht);
94 ht->hash = hash;
95 ht->compare = compare;
97 return ht;
102 util_hash_table_find_iter(struct util_hash_table *ht, argument
122 util_hash_table_find_item(struct util_hash_table *ht, void *key, unsigned key_hash) argument
142 util_hash_table_set(struct util_hash_table *ht, void *key, void *value) argument
181 util_hash_table_get(struct util_hash_table *ht, void *key) argument
202 util_hash_table_remove(struct util_hash_table *ht, void *key) argument
228 util_hash_table_clear(struct util_hash_table *ht) argument
247 util_hash_table_foreach(struct util_hash_table *ht, enum pipe_error (*callback) (void *key, void *value, void *data), void *data) argument
274 util_hash_table_destroy(struct util_hash_table *ht) argument
[all...]
H A Du_hash_table.h64 util_hash_table_set(struct util_hash_table *ht,
69 util_hash_table_get(struct util_hash_table *ht,
74 util_hash_table_remove(struct util_hash_table *ht,
79 util_hash_table_clear(struct util_hash_table *ht);
83 util_hash_table_foreach(struct util_hash_table *ht,
89 util_hash_table_destroy(struct util_hash_table *ht);
/external/mesa3d/src/util/
H A Dhash_table.c101 entry_is_deleted(const struct hash_table *ht, struct hash_entry *entry) argument
103 return entry->key == ht->deleted_key;
107 entry_is_present(const struct hash_table *ht, struct hash_entry *entry) argument
109 return entry->key != NULL && entry->key != ht->deleted_key;
118 struct hash_table *ht; local
120 ht = ralloc(mem_ctx, struct hash_table);
121 if (ht == NULL)
124 ht->size_index = 0;
125 ht->size = hash_sizes[ht
150 _mesa_hash_table_destroy(struct hash_table *ht, void (*delete_function)(struct hash_entry *entry)) argument
173 _mesa_hash_table_clear(struct hash_table *ht, void (*delete_function)(struct hash_entry *entry)) argument
203 _mesa_hash_table_set_deleted_key(struct hash_table *ht, const void *deleted_key) argument
209 hash_table_search(struct hash_table *ht, uint32_t hash, const void *key) argument
242 _mesa_hash_table_search(struct hash_table *ht, const void *key) argument
249 _mesa_hash_table_search_pre_hashed(struct hash_table *ht, uint32_t hash, const void *key) argument
261 _mesa_hash_table_rehash(struct hash_table *ht, unsigned new_size_index) argument
292 hash_table_insert(struct hash_table *ht, uint32_t hash, const void *key, void *data) argument
368 _mesa_hash_table_insert(struct hash_table *ht, const void *key, void *data) argument
375 _mesa_hash_table_insert_pre_hashed(struct hash_table *ht, uint32_t hash, const void *key, void *data) argument
389 _mesa_hash_table_remove(struct hash_table *ht, struct hash_entry *entry) argument
407 _mesa_hash_table_next_entry(struct hash_table *ht, struct hash_entry *entry) argument
433 _mesa_hash_table_random_entry(struct hash_table *ht, bool (*predicate)(struct hash_entry *entry)) argument
[all...]
H A Dset.c111 struct set *ht; local
113 ht = ralloc(mem_ctx, struct set);
114 if (ht == NULL)
117 ht->size_index = 0;
118 ht->size = hash_sizes[ht->size_index].size;
119 ht->rehash = hash_sizes[ht->size_index].rehash;
120 ht->max_entries = hash_sizes[ht
142 _mesa_set_destroy(struct set *ht, void (*delete_function)(struct set_entry *entry)) argument
164 set_search(const struct set *ht, uint32_t hash, const void *key) argument
210 set_rehash(struct set *ht, unsigned new_size_index) argument
251 set_add(struct set *ht, uint32_t hash, const void *key) argument
334 _mesa_set_remove(struct set *ht, struct set_entry *entry) argument
351 _mesa_set_next_entry(const struct set *ht, struct set_entry *entry) argument
368 _mesa_set_random_entry(struct set *ht, int (*predicate)(struct set_entry *entry)) argument
[all...]
H A Dhash_table.h65 void _mesa_hash_table_destroy(struct hash_table *ht,
67 void _mesa_hash_table_clear(struct hash_table *ht,
69 void _mesa_hash_table_set_deleted_key(struct hash_table *ht,
72 static inline uint32_t _mesa_hash_table_num_entries(struct hash_table *ht) argument
74 return ht->entries;
78 _mesa_hash_table_insert(struct hash_table *ht, const void *key, void *data);
80 _mesa_hash_table_insert_pre_hashed(struct hash_table *ht, uint32_t hash,
83 _mesa_hash_table_search(struct hash_table *ht, const void *key);
85 _mesa_hash_table_search_pre_hashed(struct hash_table *ht, uint32_t hash,
87 void _mesa_hash_table_remove(struct hash_table *ht,
143 hash_table_call_foreach(struct hash_table *ht, void (*callback)(const void *key, void *data, void *closure), void *closure) argument
[all...]
H A Dstring_to_uint_map.h64 this->ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string,
70 hash_table_call_foreach(this->ht, delete_key, NULL);
71 _mesa_hash_table_destroy(this->ht, NULL);
79 hash_table_call_foreach(this->ht, delete_key, NULL);
80 _mesa_hash_table_clear(this->ht, NULL);
98 hash_table_call_foreach(this->ht, subtract_one_wrapper, wrapper);
114 hash_entry *entry = _mesa_hash_table_search(this->ht,
141 struct hash_entry *entry = _mesa_hash_table_search(this->ht, dup_key);
145 _mesa_hash_table_insert(this->ht, dup_key,
173 struct hash_table *ht; member in struct:string_to_uint_map
[all...]
/external/libdrm/amdgpu/
H A Dutil_hash_table.c79 struct util_hash_table *ht; local
81 ht = malloc(sizeof(struct util_hash_table));
82 if(!ht)
85 ht->head = util_hash_create();
86 if(!ht->head) {
87 free(ht);
91 ht->make_hash = hash;
92 ht->compare = compare;
94 return ht;
98 util_hash_table_find_iter(struct util_hash_table *ht, argument
116 util_hash_table_find_item(struct util_hash_table *ht, void *key, unsigned key_hash) argument
134 util_hash_table_set(struct util_hash_table *ht, void *key, void *value) argument
167 util_hash_table_get(struct util_hash_table *ht, void *key) argument
185 util_hash_table_remove(struct util_hash_table *ht, void *key) argument
208 util_hash_table_clear(struct util_hash_table *ht) argument
225 util_hash_table_foreach(struct util_hash_table *ht, void (*callback)(void *key, void *value, void *data), void *data) argument
244 util_hash_table_destroy(struct util_hash_table *ht) argument
[all...]
H A Dutil_hash_table.h59 util_hash_table_set(struct util_hash_table *ht, void *key, void *value);
61 drm_private void *util_hash_table_get(struct util_hash_table *ht, void *key);
63 drm_private void util_hash_table_remove(struct util_hash_table *ht, void *key);
65 drm_private void util_hash_table_clear(struct util_hash_table *ht);
67 drm_private void util_hash_table_foreach(struct util_hash_table *ht,
71 drm_private void util_hash_table_destroy(struct util_hash_table *ht);
/external/libnl/lib/
H A Dhashtable.c31 nl_hash_table_t *ht; local
33 ht = calloc(1, sizeof (*ht));
34 if (!ht)
37 ht->nodes = calloc(size, sizeof (*ht->nodes));
38 if (!ht->nodes) {
39 free(ht);
43 ht->size = size;
45 return ht;
56 nl_hash_table_free(nl_hash_table_t *ht) argument
86 nl_hash_table_lookup(nl_hash_table_t *ht, struct nl_object *obj) argument
117 nl_hash_table_add(nl_hash_table_t *ht, struct nl_object *obj) argument
161 nl_hash_table_del(nl_hash_table_t *ht, struct nl_object *obj) argument
[all...]
/external/python/cpython3/Modules/
H A Dhashtable.c79 static void hashtable_rehash(_Py_hashtable_t *ht);
108 _Py_hashtable_hash_ptr(struct _Py_hashtable_t *ht, const void *pkey) argument
112 _Py_HASHTABLE_READ_KEY(ht, pkey, key);
118 _Py_hashtable_compare_direct(_Py_hashtable_t *ht, const void *pkey, argument
122 return (memcmp(pkey, pkey2, ht->key_size) == 0);
147 _Py_hashtable_t *ht; local
158 ht = (_Py_hashtable_t *)alloc.malloc(sizeof(_Py_hashtable_t));
159 if (ht == NULL)
160 return ht;
162 ht
195 _Py_hashtable_size(_Py_hashtable_t *ht) argument
213 _Py_hashtable_print_stats(_Py_hashtable_t *ht) argument
253 _Py_hashtable_get_entry(_Py_hashtable_t *ht, size_t key_size, const void *pkey) argument
275 _Py_hashtable_pop_entry(_Py_hashtable_t *ht, size_t key_size, const void *pkey, void *data, size_t data_size) argument
312 _Py_hashtable_set(_Py_hashtable_t *ht, size_t key_size, const void *pkey, size_t data_size, const void *data) argument
354 _Py_hashtable_get(_Py_hashtable_t *ht, size_t key_size,const void *pkey, size_t data_size, void *data) argument
370 _Py_hashtable_pop(_Py_hashtable_t *ht, size_t key_size, const void *pkey, size_t data_size, void *data) argument
394 _Py_hashtable_foreach(_Py_hashtable_t *ht, _Py_hashtable_foreach_func func, void *arg) argument
413 hashtable_rehash(_Py_hashtable_t *ht) argument
457 _Py_hashtable_clear(_Py_hashtable_t *ht) argument
475 _Py_hashtable_destroy(_Py_hashtable_t *ht) argument
[all...]
/external/mesa3d/src/util/tests/hash_table/
H A Dremove_null.c36 struct hash_table *ht; local
38 ht = _mesa_hash_table_create(NULL, NULL, _mesa_key_string_equal);
40 _mesa_hash_table_remove(ht, NULL);
42 _mesa_hash_table_destroy(ht, NULL);
H A Dinsert_and_lookup.c36 struct hash_table *ht; local
44 ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string,
47 _mesa_hash_table_insert(ht, str1, NULL);
48 _mesa_hash_table_insert(ht, str2, NULL);
50 entry = _mesa_hash_table_search(ht, str1);
53 entry = _mesa_hash_table_search(ht, str2);
56 _mesa_hash_table_destroy(ht, NULL);
H A Ddelete_and_lookup.c46 struct hash_table *ht; local
54 ht = _mesa_hash_table_create(NULL, badhash, _mesa_key_string_equal);
56 _mesa_hash_table_insert(ht, str1, NULL);
57 _mesa_hash_table_insert(ht, str2, NULL);
59 entry = _mesa_hash_table_search(ht, str2);
62 entry = _mesa_hash_table_search(ht, str1);
65 _mesa_hash_table_remove(ht, entry);
67 entry = _mesa_hash_table_search(ht, str1);
70 entry = _mesa_hash_table_search(ht, str2);
73 _mesa_hash_table_destroy(ht, NUL
[all...]
H A Dcollision.c36 struct hash_table *ht; local
47 ht = _mesa_hash_table_create(NULL, NULL, _mesa_key_string_equal);
52 _mesa_hash_table_insert_pre_hashed(ht, bad_hash, str1, NULL);
53 _mesa_hash_table_insert_pre_hashed(ht, bad_hash, str2, NULL);
54 _mesa_hash_table_insert_pre_hashed(ht, bad_hash, str3, NULL);
56 entry1 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str1);
59 entry2 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str2);
63 entry1 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str1);
67 _mesa_hash_table_remove(ht, entry1);
68 entry2 = _mesa_hash_table_search_pre_hashed(ht, bad_has
[all...]
H A Dreplacement.c36 struct hash_table *ht; local
46 ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string,
49 _mesa_hash_table_insert(ht, str1, str1);
50 _mesa_hash_table_insert(ht, str2, str2);
52 entry = _mesa_hash_table_search(ht, str1);
56 _mesa_hash_table_remove(ht, entry);
58 entry = _mesa_hash_table_search(ht, str1);
61 _mesa_hash_table_destroy(ht, NULL);
H A Ddestroy_callback.c52 struct hash_table *ht; local
57 ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string,
60 _mesa_hash_table_insert(ht, str1, NULL);
61 _mesa_hash_table_insert(ht, str2, NULL);
63 _mesa_hash_table_destroy(ht, delete_callback);
H A Ddelete_management.c48 struct hash_table *ht; local
57 ht = _mesa_hash_table_create(NULL, key_value, uint32_t_key_equals);
62 _mesa_hash_table_insert(ht, keys + i, NULL);
66 entry = _mesa_hash_table_search(ht, &delete_value);
67 _mesa_hash_table_remove(ht, entry);
73 entry = _mesa_hash_table_search(ht, keys + i);
79 for (entry = _mesa_hash_table_next_entry(ht, NULL);
81 entry = _mesa_hash_table_next_entry(ht, entry)) {
85 assert(ht->entries == 100);
87 _mesa_hash_table_destroy(ht, NUL
[all...]
H A Dinsert_many.c48 struct hash_table *ht; local
57 ht = _mesa_hash_table_create(NULL, key_value, uint32_t_key_equals);
62 _mesa_hash_table_insert(ht, keys + i, NULL);
66 entry = _mesa_hash_table_search(ht, keys + i);
70 assert(ht->entries == size);
72 _mesa_hash_table_destroy(ht, NULL);
H A Dclear.c55 struct hash_table *ht; local
61 ht = _mesa_hash_table_create(NULL, key_hash, key_equal);
65 _mesa_hash_table_insert(ht, make_key(i), &flags[i]);
68 _mesa_hash_table_clear(ht, delete_function);
69 assert(_mesa_hash_table_next_entry(ht, NULL) == NULL);
76 _mesa_hash_table_insert(ht, make_key(i), &flags[i]);
81 assert(_mesa_hash_table_search(ht, make_key(i)));
84 hash_table_foreach(ht, entry) {
88 _mesa_hash_table_destroy(ht, NULL);
/external/mesa3d/src/compiler/glsl/
H A Dir_clone.cpp41 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const
63 var->constant_value = this->constant_value->clone(mem_ctx, ht);
67 this->constant_initializer->clone(mem_ctx, ht);
71 if (ht)
72 _mesa_hash_table_insert(ht, (void *)const_cast<ir_variable *>(this), var);
78 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
80 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
84 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
89 new_value = this->value->clone(mem_ctx, ht);
95 ir_discard::clone(void *mem_ctx, struct hash_table *ht) cons
386 fixup_ir_call_visitor(struct hash_table *ht) argument
411 struct hash_table *ht; member in class:fixup_ir_call_visitor
416 fixup_function_calls(struct hash_table *ht, exec_list *instructions) argument
426 struct hash_table *ht = local
[all...]
H A Dlink_uniform_block_active_visitor.h55 link_uniform_block_active_visitor(void *mem_ctx, struct hash_table *ht, argument
57 : success(true), prog(prog), ht(ht), mem_ctx(mem_ctx)
70 struct hash_table *ht; member in class:link_uniform_block_active_visitor
/external/libnl/include/netlink/
H A Dhashtable.h36 extern void nl_hash_table_free(nl_hash_table_t *ht);
38 extern int nl_hash_table_add(nl_hash_table_t *ht,
40 extern int nl_hash_table_del(nl_hash_table_t *ht,
43 extern struct nl_object * nl_hash_table_lookup(nl_hash_table_t *ht,
/external/libmpeg2/common/
H A Dicv_variance.h41 typedef WORD32 icv_variance_8x4_t(UWORD8 *pu1_src, WORD32 src_strd, WORD32 wd, WORD32 ht);

Completed in 412 milliseconds

1234567891011>>