HomeSort by relevance Sort by last modified time
    Searched refs:ht (Results 1 - 25 of 222) sorted by null

1 2 3 4 5 6 7 8 9

  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
u_handle_table.c 64 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;
    [all...]
u_handle_table.h 63 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,
u_hash_table.c 82 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,
    [all...]
u_hash_table.h 64 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/gallium/auxiliary/util/
u_handle_table.c 64 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;
    [all...]
u_handle_table.h 63 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,
u_hash_table.c 82 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,
    [all...]
u_hash_table.h 64 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);
  /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,
46 ht->ht_size = round_up_2 (size);
47 ht->ht_empty_slots = ht->ht_size;
48 ht->ht_vec = (void**) CALLOC (struct token *, ht->ht_size);
49 if (ht->ht_vec == 0)
52 ht->ht_size * sizeof(struct token *));
56 ht->ht_capacity = ht->ht_size - (ht->ht_size / 16); /* 93.75% loading factor *
    [all...]
  /external/chromium_org/third_party/mesa/src/src/mesa/program/
hash_table.c 60 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;
    [all...]
hash_table.h 73 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 = hash_table_ctor(0, hash_table_string_hash
284 struct hash_table *ht; member in struct:string_to_uint_map
    [all...]
  /external/mesa3d/src/mesa/program/
hash_table.c 60 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;
    [all...]
hash_table.h 73 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 = hash_table_ctor(0, hash_table_string_hash
284 struct hash_table *ht; member in struct:string_to_uint_map
    [all...]
  /external/chromium_org/third_party/mesa/src/src/glsl/
ir_clone.cpp 31 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);
413 struct hash_table *ht; member in class:fixup_ir_call_visitor
428 struct hash_table *ht = local
    [all...]
  /external/mesa3d/src/glsl/
ir_clone.cpp 31 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);
413 struct hash_table *ht; member in class:fixup_ir_call_visitor
428 struct hash_table *ht = local
    [all...]
  /cts/tests/tests/os/src/android/os/cts/
HandlerThreadTest.java 36 MockHandlerThread ht = new MockHandlerThread("test"); local
37 assertEquals(-1, ht.getThreadId());
38 ht.start();
41 assertEquals(ht.getMyTid(), ht.getThreadId());
43 assertTrue(ht.isRunCalled());
45 assertTrue(ht.isOnLooperPreparedCalled());
47 assertNotNull(ht.getLooper());
48 Looper looper = ht.getLooper();
50 assertSame(ht.getMyLooper(), looper)
    [all...]
  /external/chromium_org/third_party/npapi/npspy/extern/nspr/
plhash.h 111 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, PLHashEntry **hep, PLHashEntry *he)
    [all...]
  /external/libhevc/common/
ihevc_padding.c 66 * @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
    [all...]
ihevc_sao.c 80 WORD32 ht)
88 for(row = 0; row < ht; row++)
95 pu1_src_top[col] = pu1_src[(ht - 1) * src_strd + col];
108 for(row = 0; row < ht; row++)
134 WORD32 ht)
143 for(row = 0; row < ht; row++)
152 pu1_src_top[col] = pu1_src[(ht - 1) * src_strd + col];
168 for(row = 0; row < ht; row++)
196 WORD32 ht)
212 for(row = 0; row < ht; row++
    [all...]
ihevc_padding.h 44 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...]
ihevc_inter_pred_filters.c 75 * Copies the array of width 'wd' and height 'ht' from the location pointed
93 * @param[in] ht
113 WORD32 ht,
118 for(row = 0; row < ht; row++)
156 * @param[in] ht
175 WORD32 ht,
181 for(row = 0; row < ht; row++)
228 * @param[in] ht
248 WORD32 ht,
254 for(row = 0; row < ht; row++
    [all...]
ihevc_sao.h 60 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/libhevc/common/x86/
ihevc_padding_ssse3_intr.c 68 * @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
    [all...]
  /external/libhevc/decoder/
ihevcd_fmt_conv.h 50 WORD32 ht,
60 WORD32 ht,
72 WORD32 ht,
83 WORD32 ht,
  /frameworks/av/media/libstagefright/codecs/mp3dec/src/
s_tmp3dec_file.h 97 huffcodetab ht[HUFF_TBL]; member in struct:__anon38011

Completed in 1421 milliseconds

1 2 3 4 5 6 7 8 9