Searched defs:ht (Results 1 - 25 of 79) sorted by relevance

1234

/external/libhevc/common/x86/
H A Dihevc_padding_ssse3_intr.c68 * @param[in] ht
77 * @param[in] ht
93 WORD32 ht,
105 for(row = 0; row < ht; row++)
139 * @param[in] ht
148 * @param[in] ht
164 WORD32 ht,
176 for(row = 0; row < ht; row++)
211 * @param[in] ht
220 * @param[in] ht
91 ihevc_pad_left_luma_ssse3(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
162 ihevc_pad_left_chroma_ssse3(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
234 ihevc_pad_right_luma_ssse3(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
304 ihevc_pad_right_chroma_ssse3(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
[all...]
H A Dihevc_inter_pred_filters_sse42_intr.c76 * Copies the array of width 'wd' and height 'ht' from the location pointed
95 * @param[in] ht
114 WORD32 ht,
121 ASSERT(ht % 4 == 0); /* checking assumption*/
125 for(row = 0; row < ht; row += 4)
161 for(row = 0; row < ht; row += 4)
204 * Copies the array of width 'wd' and height 'ht' from the location pointed
222 * @param[in] ht
241 WORD32 ht,
248 ASSERT(ht
109 ihevc_inter_pred_luma_copy_w16out_sse42(UWORD8 *pu1_src, WORD16 *pi2_dst, WORD32 src_strd, WORD32 dst_strd, WORD8 *pi1_coeff, WORD32 ht, WORD32 wd) argument
236 ihevc_inter_pred_chroma_copy_sse42(UWORD8 *pu1_src, UWORD8 *pu1_dst, WORD32 src_strd, WORD32 dst_strd, WORD8 *pi1_coeff, WORD32 ht, WORD32 wd) argument
457 ihevc_inter_pred_chroma_copy_w16out_sse42(UWORD8 *pu1_src, WORD16 *pi2_dst, WORD32 src_strd, WORD32 dst_strd, WORD8 *pi1_coeff, WORD32 ht, WORD32 wd) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/glsl/
H A Dir_set_program_inouts.cpp53 this->ht = hash_table_ctor(0,
59 hash_table_dtor(this->ht);
70 struct hash_table *ht; member in class:ir_set_program_inouts_visitor
109 if (hash_table_find(this->ht, ir->var) == NULL)
134 var = (ir_variable *)hash_table_find(this->ht, deref_var->var);
158 hash_table_insert(this->ht, ir, ir);
H A Dir_validate.cpp45 this->ht = hash_table_ctor(0, hash_table_pointer_hash,
51 this->data = ht;
56 hash_table_dtor(this->ht);
79 struct hash_table *ht; member in class:ir_validate
92 if (hash_table_find(ht, ir->var) == NULL) {
510 hash_table_insert(ht, ir, ir);
632 struct hash_table *ht = (struct hash_table *) data; local
634 if (hash_table_find(ht, ir)) {
640 hash_table_insert(ht, ir, ir);
H A Dlink_functions.cpp143 struct hash_table *ht = hash_table_ctor(0, hash_table_pointer_hash, local
150 ir_instruction *copy = original->clone(linked, ht);
159 ir_instruction *copy = original->clone(linked, ht);
164 hash_table_dtor(ht);
H A Dir_clone.cpp31 ir_rvalue::clone(void *mem_ctx, struct hash_table *ht) const
45 ir_variable::clone(void *mem_ctx, struct hash_table *ht) const
78 var->constant_value = this->constant_value->clone(mem_ctx, ht);
82 this->constant_initializer->clone(mem_ctx, ht);
84 if (ht) {
85 hash_table_insert(ht, var, (void *)const_cast<ir_variable *>(this));
92 ir_swizzle::clone(void *mem_ctx, struct hash_table *ht) const
94 return new(mem_ctx) ir_swizzle(this->val->clone(mem_ctx, ht), this->mask);
98 ir_return::clone(void *mem_ctx, struct hash_table *ht) const
103 new_value = this->value->clone(mem_ctx, ht);
391 fixup_ir_call_visitor(struct hash_table *ht) argument
413 struct hash_table *ht; member in class:fixup_ir_call_visitor
418 fixup_function_calls(struct hash_table *ht, exec_list *instructions) argument
428 struct hash_table *ht = local
[all...]
H A Dloop_analysis.h248 hash_table *ht; member in class:loop_state
H A Dlower_if_to_cond_assign.cpp113 struct hash_table *ht)
121 if (hash_table_find(ht, assign) == NULL) {
122 hash_table_insert(ht, assign, assign);
129 hash_table_find(ht, assign->lhs->variable_referenced()) != NULL;
110 move_block_to_cond_assign(void *mem_ctx, ir_if *if_ir, ir_rvalue *cond_expr, exec_list *instructions, struct hash_table *ht) argument
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dhash_table.h73 extern void hash_table_dtor(struct hash_table *ht);
79 * \param ht Table to be cleared of its entries.
81 extern void hash_table_clear(struct hash_table *ht);
87 * \param ht Table to be searched
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,
212 this->ht
284 struct hash_table *ht; member in struct:string_to_uint_map
[all...]
H A Dhash_table.c60 struct hash_table *ht; local
68 ht = malloc(sizeof(*ht) + ((num_buckets - 1)
69 * sizeof(ht->buckets[0])));
70 if (ht != NULL) {
71 ht->hash = hash;
72 ht->compare = compare;
73 ht->num_buckets = num_buckets;
76 make_empty_list(& ht->buckets[i]);
80 return ht;
85 hash_table_dtor(struct hash_table *ht) argument
93 hash_table_clear(struct hash_table *ht) argument
112 get_node(struct hash_table *ht, const void *key) argument
130 hash_table_find(struct hash_table *ht, const void *key) argument
138 hash_table_insert(struct hash_table *ht, void *data, const void *key) argument
153 hash_table_replace(struct hash_table *ht, void *data, const void *key) argument
179 hash_table_remove(struct hash_table *ht, const void *key) argument
190 hash_table_call_foreach(struct hash_table *ht, void (*callback)(const void *key, void *data, void *closure), void *closure) argument
[all...]
H A Dsymbol_table.c102 struct hash_table *ht; member in struct:_mesa_symbol_table
200 return (struct symbol_header *) hash_table_find(table->ht, name);
343 hash_table_insert(table->ht, hdr, hdr->name);
400 hash_table_insert(table->ht, hdr, hdr->name);
461 table->ht = hash_table_ctor(32, hash_table_string_hash,
487 hash_table_dtor(table->ht);
/external/chromium_org/third_party/sqlite/src/src/
H A Dhash.h37 ** Hash.htsize and Hash.ht may be zero. In that case lookup is done
39 ** Hash.ht table is never allocated because if there are few elements
50 } *ht; member in struct:Hash
/external/libhevc/common/
H A Dihevc_padding.c66 * @param[in] ht
75 * @param[in] ht
91 WORD32 ht,
100 memcpy(pu1_src + (ht + row - 1) * src_strd,
101 pu1_src + (ht - 1) * src_strd, wd);
120 * @param[in] ht
129 * @param[in] ht
145 WORD32 ht,
157 for(row = 0; row < ht; row++)
187 * @param[in] ht
89 ihevc_pad_vert(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 wd, WORD32 pad_size) argument
143 ihevc_pad_horz_chroma(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 wd, WORD32 pad_size) argument
210 ihevc_pad_horz_luma(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 wd, WORD32 pad_size) argument
377 ihevc_pad_left_luma(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
433 ihevc_pad_left_chroma(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
498 ihevc_pad_right_luma(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
554 ihevc_pad_right_chroma(UWORD8 *pu1_src, WORD32 src_strd, WORD32 ht, WORD32 pad_size) argument
[all...]
/external/mesa3d/src/glsl/
H A Dir_set_program_inouts.cpp53 this->ht = hash_table_ctor(0,
59 hash_table_dtor(this->ht);
70 struct hash_table *ht; member in class:ir_set_program_inouts_visitor
109 if (hash_table_find(this->ht, ir->var) == NULL)
134 var = (ir_variable *)hash_table_find(this->ht, deref_var->var);
158 hash_table_insert(this->ht, ir, ir);
H A Dir_validate.cpp45 this->ht = hash_table_ctor(0, hash_table_pointer_hash,
51 this->data = ht;
56 hash_table_dtor(this->ht);
79 struct hash_table *ht; member in class:ir_validate
92 if (hash_table_find(ht, ir->var) == NULL) {
510 hash_table_insert(ht, ir, ir);
632 struct hash_table *ht = (struct hash_table *) data; local
634 if (hash_table_find(ht, ir)) {
640 hash_table_insert(ht, ir, ir);
H A Dlink_functions.cpp143 struct hash_table *ht = hash_table_ctor(0, hash_table_pointer_hash, local
150 ir_instruction *copy = original->clone(linked, ht);
159 ir_instruction *copy = original->clone(linked, ht);
164 hash_table_dtor(ht);
/external/mesa3d/src/mesa/program/
H A Dhash_table.h73 extern void hash_table_dtor(struct hash_table *ht);
79 * \param ht Table to be cleared of its entries.
81 extern void hash_table_clear(struct hash_table *ht);
87 * \param ht Table to be searched
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,
212 this->ht
284 struct hash_table *ht; member in struct:string_to_uint_map
[all...]
/external/chromium_org/third_party/mesa/src/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_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...]
/external/chromium_org/third_party/sqlite/src/ext/fts1/
H A Dft_hash.h43 } *ht; member in struct:Hash
H A Dfts1_hash.h43 } *ht; member in struct:fts1Hash
/external/chromium_org/third_party/sqlite/src/ext/fts2/
H A Dfts2_hash.h41 } *ht; member in struct:fts2Hash
/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_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...]
/external/chromium_org/third_party/npapi/npspy/extern/nspr/
H A Dplhash.h111 PL_HashTableDestroy(PLHashTable *ht); variable
115 PL_HashTableAdd(PLHashTable *ht, const void *key, void *value);
118 PL_HashTableRemove(PLHashTable *ht, const void *key);
121 PL_HashTableLookup(PLHashTable *ht, const void *key);
124 PL_HashTableLookupConst(PLHashTable *ht, const void *key);
127 PL_HashTableEnumerateEntries(PLHashTable *ht, PLHashEnumerator f, void *arg);
143 PL_HashTableRawLookup(PLHashTable *ht, PLHashNumber keyHash, const void *key);
146 PL_HashTableRawLookupConst(PLHashTable *ht, PLHashNumber keyHash,
150 PL_HashTableRawAdd(PLHashTable *ht, PLHashEntry **hep, PLHashNumber keyHash,
154 PL_HashTableRawRemove(PLHashTable *ht, PLHashEntr
[all...]

Completed in 2185 milliseconds

1234