Home
last modified time | relevance | path

Searched refs:ht (Results 1 – 25 of 429) sorted by relevance

12345678910>>...18

/external/mesa3d/src/gallium/auxiliary/util/
Du_handle_table.c64 struct handle_table *ht; in handle_table_create() local
66 ht = MALLOC_STRUCT(handle_table); in handle_table_create()
67 if (!ht) in handle_table_create()
70 ht->objects = (void **)CALLOC(HANDLE_TABLE_INITIAL_SIZE, sizeof(void *)); in handle_table_create()
71 if(!ht->objects) { in handle_table_create()
72 FREE(ht); in handle_table_create()
76 ht->size = HANDLE_TABLE_INITIAL_SIZE; in handle_table_create()
77 ht->filled = 0; in handle_table_create()
79 ht->destroy = NULL; in handle_table_create()
81 return ht; in handle_table_create()
[all …]
Du_hash_table.c82 struct util_hash_table *ht; in util_hash_table_create() local
84 ht = MALLOC_STRUCT(util_hash_table); in util_hash_table_create()
85 if (!ht) in util_hash_table_create()
88 ht->cso = cso_hash_create(); in util_hash_table_create()
89 if(!ht->cso) { in util_hash_table_create()
90 FREE(ht); in util_hash_table_create()
94 ht->hash = hash; in util_hash_table_create()
95 ht->compare = compare; in util_hash_table_create()
97 return ht; in util_hash_table_create()
102 util_hash_table_find_iter(struct util_hash_table *ht, in util_hash_table_find_iter() argument
[all …]
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,
/external/mesa3d/src/util/
Dhash_table.c101 entry_is_deleted(const struct hash_table *ht, struct hash_entry *entry) in entry_is_deleted() argument
103 return entry->key == ht->deleted_key; in entry_is_deleted()
107 entry_is_present(const struct hash_table *ht, struct hash_entry *entry) in entry_is_present() argument
109 return entry->key != NULL && entry->key != ht->deleted_key; in entry_is_present()
118 struct hash_table *ht; in _mesa_hash_table_create() local
120 ht = ralloc(mem_ctx, struct hash_table); in _mesa_hash_table_create()
121 if (ht == NULL) in _mesa_hash_table_create()
124 ht->size_index = 0; in _mesa_hash_table_create()
125 ht->size = hash_sizes[ht->size_index].size; in _mesa_hash_table_create()
126 ht->rehash = hash_sizes[ht->size_index].rehash; in _mesa_hash_table_create()
[all …]
Dset.c111 struct set *ht; in _mesa_set_create() local
113 ht = ralloc(mem_ctx, struct set); in _mesa_set_create()
114 if (ht == NULL) in _mesa_set_create()
117 ht->size_index = 0; in _mesa_set_create()
118 ht->size = hash_sizes[ht->size_index].size; in _mesa_set_create()
119 ht->rehash = hash_sizes[ht->size_index].rehash; in _mesa_set_create()
120 ht->max_entries = hash_sizes[ht->size_index].max_entries; in _mesa_set_create()
121 ht->key_hash_function = key_hash_function; in _mesa_set_create()
122 ht->key_equals_function = key_equals_function; in _mesa_set_create()
123 ht->table = rzalloc_array(ht, struct set_entry, ht->size); in _mesa_set_create()
[all …]
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) in _mesa_hash_table_num_entries() argument
74 return ht->entries; in _mesa_hash_table_num_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,
[all …]
Dstring_to_uint_map.h64 this->ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string, in string_to_uint_map()
70 hash_table_call_foreach(this->ht, delete_key, NULL); in ~string_to_uint_map()
71 _mesa_hash_table_destroy(this->ht, NULL); in ~string_to_uint_map()
79 hash_table_call_foreach(this->ht, delete_key, NULL); in clear()
80 _mesa_hash_table_clear(this->ht, NULL); in clear()
98 hash_table_call_foreach(this->ht, subtract_one_wrapper, wrapper); in iterate()
114 hash_entry *entry = _mesa_hash_table_search(this->ht, in get()
141 struct hash_entry *entry = _mesa_hash_table_search(this->ht, dup_key); in put()
145 _mesa_hash_table_insert(this->ht, dup_key, in put()
173 struct hash_table *ht; member
/external/libdrm/amdgpu/
Dutil_hash_table.c79 struct util_hash_table *ht; in util_hash_table_create() local
81 ht = malloc(sizeof(struct util_hash_table)); in util_hash_table_create()
82 if(!ht) in util_hash_table_create()
85 ht->head = util_hash_create(); in util_hash_table_create()
86 if(!ht->head) { in util_hash_table_create()
87 free(ht); in util_hash_table_create()
91 ht->make_hash = hash; in util_hash_table_create()
92 ht->compare = compare; in util_hash_table_create()
94 return ht; in util_hash_table_create()
98 util_hash_table_find_iter(struct util_hash_table *ht, in util_hash_table_find_iter() argument
[all …]
/external/mesa3d/src/compiler/glsl/
Dir_clone.cpp41 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const in clone()
63 var->constant_value = this->constant_value->clone(mem_ctx, ht); in clone()
67 this->constant_initializer->clone(mem_ctx, ht); in clone()
71 if (ht) in clone()
72 _mesa_hash_table_insert(ht, (void *)const_cast<ir_variable *>(this), var); in clone()
78 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const in clone()
80 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask); in clone()
84 ir_return::clone(void *mem_ctx, struct hash_table *ht) const in clone()
89 new_value = this->value->clone(mem_ctx, ht); in clone()
95 ir_discard::clone(void *mem_ctx, struct hash_table *ht) const in clone()
[all …]
Dopt_constant_variable.cpp57 struct hash_table *ht; member in __anone566b3f00111::ir_constant_variable_visitor
63 get_assignment_entry(ir_variable *var, struct hash_table *ht) in get_assignment_entry() argument
65 struct hash_entry *hte = _mesa_hash_table_search(ht, var); in get_assignment_entry()
73 _mesa_hash_table_insert(ht, var, entry); in get_assignment_entry()
82 struct assignment_entry *entry = get_assignment_entry(ir, this->ht); in visit()
101 entry = get_assignment_entry(ir->lhs->variable_referenced(), this->ht); in visit_enter()
162 entry = get_assignment_entry(var, this->ht); in visit_enter()
173 entry = get_assignment_entry(var, this->ht); in visit_enter()
189 v.ht = _mesa_hash_table_create(NULL, _mesa_hash_pointer, in do_constant_variable()
194 hash_table_foreach(v.ht, hte) { in do_constant_variable()
[all …]
/external/libnl/lib/
Dhashtable.c31 nl_hash_table_t *ht; in nl_hash_table_alloc() local
33 ht = calloc(1, sizeof (*ht)); in nl_hash_table_alloc()
34 if (!ht) in nl_hash_table_alloc()
37 ht->nodes = calloc(size, sizeof (*ht->nodes)); in nl_hash_table_alloc()
38 if (!ht->nodes) { in nl_hash_table_alloc()
39 free(ht); in nl_hash_table_alloc()
43 ht->size = size; in nl_hash_table_alloc()
45 return ht; in nl_hash_table_alloc()
56 void nl_hash_table_free(nl_hash_table_t *ht) in nl_hash_table_free() argument
60 for(i = 0; i < ht->size; i++) { in nl_hash_table_free()
[all …]
/external/libhevc/common/
Dihevc_sao.c80 WORD32 ht) in ihevc_sao_band_offset_luma() argument
88 for(row = 0; row < ht; row++) in ihevc_sao_band_offset_luma()
95 pu1_src_top[col] = pu1_src[(ht - 1) * src_strd + col]; in ihevc_sao_band_offset_luma()
108 for(row = 0; row < ht; row++) in ihevc_sao_band_offset_luma()
134 WORD32 ht) in ihevc_sao_band_offset_chroma() argument
143 for(row = 0; row < ht; row++) in ihevc_sao_band_offset_chroma()
152 pu1_src_top[col] = pu1_src[(ht - 1) * src_strd + col]; in ihevc_sao_band_offset_chroma()
168 for(row = 0; row < ht; row++) in ihevc_sao_band_offset_chroma()
196 WORD32 ht) in ihevc_sao_edge_offset_class0() argument
212 for(row = 0; row < ht; row++) in ihevc_sao_edge_offset_class0()
[all …]
Dihevc_inter_pred_filters.c113 WORD32 ht, in ihevc_inter_pred_luma_copy() argument
118 for(row = 0; row < ht; row++) in ihevc_inter_pred_luma_copy()
175 WORD32 ht, in ihevc_inter_pred_luma_horz() argument
181 for(row = 0; row < ht; row++) in ihevc_inter_pred_luma_horz()
248 WORD32 ht, in ihevc_inter_pred_luma_vert() argument
254 for(row = 0; row < ht; row++) in ihevc_inter_pred_luma_vert()
321 WORD32 ht, in ihevc_inter_pred_luma_copy_w16out() argument
326 for(row = 0; row < ht; row++) in ihevc_inter_pred_luma_copy_w16out()
387 WORD32 ht, in ihevc_inter_pred_luma_horz_w16out() argument
393 for(row = 0; row < ht; row++) in ihevc_inter_pred_luma_horz_w16out()
[all …]
Dihevc_padding.c91 WORD32 ht, in ihevc_pad_vert() argument
100 memcpy(pu1_src + (ht + row - 1) * src_strd, in ihevc_pad_vert()
101 pu1_src + (ht - 1) * src_strd, wd); in ihevc_pad_vert()
145 WORD32 ht, in ihevc_pad_horz_chroma() argument
157 for(row = 0; row < ht; row++) in ihevc_pad_horz_chroma()
212 WORD32 ht, in ihevc_pad_horz_luma() argument
218 for(row = 0; row < ht; row++) in ihevc_pad_horz_luma()
379 WORD32 ht, in ihevc_pad_left_luma() argument
384 for(row = 0; row < ht; row++) in ihevc_pad_left_luma()
435 WORD32 ht, in ihevc_pad_left_chroma() argument
[all …]
Dihevc_padding.h44 WORD32 ht,
51 WORD32 ht,
58 WORD32 ht,
65 WORD32 ht,
72 WORD32 ht,
79 WORD32 ht,
105 WORD32 ht,
110 WORD32 ht,
115 WORD32 ht,
120 WORD32 ht,
[all …]
Dihevc_sao.h60 WORD32 ht);
70 WORD32 ht,
83 WORD32 ht);
95 WORD32 ht,
108 WORD32 ht);
120 WORD32 ht,
134 WORD32 ht);
147 WORD32 ht,
160 WORD32 ht);
172 WORD32 ht,
[all …]
/external/mesa3d/src/util/tests/hash_table/
Dcollision.c36 struct hash_table *ht; in main() local
47 ht = _mesa_hash_table_create(NULL, NULL, _mesa_key_string_equal); in main()
52 _mesa_hash_table_insert_pre_hashed(ht, bad_hash, str1, NULL); in main()
53 _mesa_hash_table_insert_pre_hashed(ht, bad_hash, str2, NULL); in main()
54 _mesa_hash_table_insert_pre_hashed(ht, bad_hash, str3, NULL); in main()
56 entry1 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str1); in main()
59 entry2 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str2); in main()
63 entry1 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str1); in main()
67 _mesa_hash_table_remove(ht, entry1); in main()
68 entry2 = _mesa_hash_table_search_pre_hashed(ht, bad_hash, str2); in main()
[all …]
Ddelete_and_lookup.c46 struct hash_table *ht; in main() local
54 ht = _mesa_hash_table_create(NULL, badhash, _mesa_key_string_equal); in main()
56 _mesa_hash_table_insert(ht, str1, NULL); in main()
57 _mesa_hash_table_insert(ht, str2, NULL); in main()
59 entry = _mesa_hash_table_search(ht, str2); in main()
62 entry = _mesa_hash_table_search(ht, str1); in main()
65 _mesa_hash_table_remove(ht, entry); in main()
67 entry = _mesa_hash_table_search(ht, str1); in main()
70 entry = _mesa_hash_table_search(ht, str2); in main()
73 _mesa_hash_table_destroy(ht, NULL); in main()
Ddelete_management.c48 struct hash_table *ht; in main() local
57 ht = _mesa_hash_table_create(NULL, key_value, uint32_t_key_equals); in main()
62 _mesa_hash_table_insert(ht, keys + i, NULL); in main()
66 entry = _mesa_hash_table_search(ht, &delete_value); in main()
67 _mesa_hash_table_remove(ht, entry); in main()
73 entry = _mesa_hash_table_search(ht, keys + i); in main()
79 for (entry = _mesa_hash_table_next_entry(ht, NULL); in main()
81 entry = _mesa_hash_table_next_entry(ht, entry)) { in main()
85 assert(ht->entries == 100); in main()
87 _mesa_hash_table_destroy(ht, NULL); in main()
Dreplacement.c36 struct hash_table *ht; in main() local
46 ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string, in main()
49 _mesa_hash_table_insert(ht, str1, str1); in main()
50 _mesa_hash_table_insert(ht, str2, str2); in main()
52 entry = _mesa_hash_table_search(ht, str1); in main()
56 _mesa_hash_table_remove(ht, entry); in main()
58 entry = _mesa_hash_table_search(ht, str1); in main()
61 _mesa_hash_table_destroy(ht, NULL); in main()
Dclear.c55 struct hash_table *ht; in main() local
61 ht = _mesa_hash_table_create(NULL, key_hash, key_equal); in main()
65 _mesa_hash_table_insert(ht, make_key(i), &flags[i]); in main()
68 _mesa_hash_table_clear(ht, delete_function); in main()
69 assert(_mesa_hash_table_next_entry(ht, NULL) == NULL); in main()
76 _mesa_hash_table_insert(ht, make_key(i), &flags[i]); in main()
81 assert(_mesa_hash_table_search(ht, make_key(i))); in main()
84 hash_table_foreach(ht, entry) { in main()
88 _mesa_hash_table_destroy(ht, NULL); in main()
Dinsert_and_lookup.c36 struct hash_table *ht; in main() local
44 ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string, in main()
47 _mesa_hash_table_insert(ht, str1, NULL); in main()
48 _mesa_hash_table_insert(ht, str2, NULL); in main()
50 entry = _mesa_hash_table_search(ht, str1); in main()
53 entry = _mesa_hash_table_search(ht, str2); in main()
56 _mesa_hash_table_destroy(ht, NULL); in main()
/external/mesa3d/src/gallium/drivers/vc4/
Dvc4_qir_lower_uniforms.c48 add_uniform(struct hash_table *ht, struct qreg reg) in add_uniform() argument
53 entry = _mesa_hash_table_search(ht, key); in add_uniform()
57 _mesa_hash_table_insert(ht, key, (void *)(uintptr_t)1); in add_uniform()
62 remove_uniform(struct hash_table *ht, struct qreg reg) in remove_uniform() argument
67 entry = _mesa_hash_table_search(ht, key); in remove_uniform()
71 _mesa_hash_table_remove(ht, entry); in remove_uniform()
114 struct hash_table *ht = in qir_lower_uniforms() local
129 add_uniform(ht, inst->src[i]); in qir_lower_uniforms()
133 while (ht->entries) { in qir_lower_uniforms()
140 hash_table_foreach(ht, entry) { in qir_lower_uniforms()
[all …]
/external/libavc/common/
Dih264_inter_pred_filters.c114 WORD32 ht, in ih264_inter_pred_luma_copy() argument
122 for(row = 0; row < ht; row++) in ih264_inter_pred_luma_copy()
174 WORD32 ht, in ih264_interleave_copy() argument
180 for(row = 0; row < ht; row++) in ih264_interleave_copy()
231 WORD32 ht, in ih264_inter_pred_luma_horz() argument
241 for(row = 0; row < ht; row++) in ih264_inter_pred_luma_horz()
301 WORD32 ht, in ih264_inter_pred_luma_vert() argument
311 for(row = 0; row < ht; row++) in ih264_inter_pred_luma_vert()
370 WORD32 ht, in ih264_inter_pred_luma_horz_hpel_vert_hpel() argument
383 for(row = 0; row < ht; row++) in ih264_inter_pred_luma_horz_hpel_vert_hpel()
[all …]
/external/mesa3d/src/mesa/main/
Dhash.c59 struct hash_table *ht; member
122 table->ht = _mesa_hash_table_create(NULL, uint_key_hash, in _mesa_NewHashTable()
124 if (table->ht == NULL) { in _mesa_NewHashTable()
130 _mesa_hash_table_set_deleted_key(table->ht, uint_key(DELETED_KEY_VALUE)); in _mesa_NewHashTable()
159 if (_mesa_hash_table_next_entry(table->ht, NULL) != NULL) { in _mesa_DeleteHashTable()
163 _mesa_hash_table_destroy(table->ht, NULL); in _mesa_DeleteHashTable()
186 entry = _mesa_hash_table_search(table->ht, uint_key(key)); in _mesa_HashLookup_unlocked()
277 entry = _mesa_hash_table_search_pre_hashed(table->ht, hash, uint_key(key)); in _mesa_HashInsert_unlocked()
281 _mesa_hash_table_insert_pre_hashed(table->ht, hash, uint_key(key), data); in _mesa_HashInsert_unlocked()
350 entry = _mesa_hash_table_search(table->ht, uint_key(key)); in _mesa_HashRemove_unlocked()
[all …]

12345678910>>...18