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

1 2 3 4

  /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/mesa/src/src/glsl/
ir_set_program_inouts.cpp 53 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);
ir_validate.cpp 45 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);
link_functions.cpp 143 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/chromium_org/third_party/mesa/src/src/mesa/program/
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/glsl/
ir_set_program_inouts.cpp 53 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);
ir_validate.cpp 45 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);
link_functions.cpp 143 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/
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...]
  /frameworks/av/media/libstagefright/codecs/mp3dec/src/
s_tmp3dec_file.h 97 huffcodetab ht[HUFF_TBL]; member in struct:__anon31557
  /frameworks/base/core/java/android/text/style/
IconMarginSpan.java 59 int ht = mBitmap.getHeight(); local
61 int need = ht - (v + fm.descent - fm.ascent - istartv);
65 need = ht - (v + fm.bottom - fm.top - istartv);
DrawableMarginSpan.java 62 int ht = mDrawable.getIntrinsicHeight(); local
64 int need = ht - (v + fm.descent - fm.ascent - istartv);
68 need = ht - (v + fm.bottom - fm.top - istartv);
  /external/robolectric/src/test/java/com/xtremelabs/robolectric/shadows/
LooperTest.java 69 HandlerThread ht = new HandlerThread("test1"); local
70 ht.start();
71 Looper looper = ht.getLooper();
88 HandlerThread ht = new HandlerThread("test1"); local
89 ht.start();
90 Looper looper = ht.getLooper();
  /external/chromium_org/third_party/sqlite/src/src/
hash.h 37 ** 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/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_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...]
  /external/chromium_org/third_party/sqlite/src/ext/fts1/
ft_hash.h 43 } *ht; member in struct:Hash
  /external/chromium_org/third_party/sqlite/src/ext/fts2/
fts2_hash.h 41 } *ht; member in struct:fts2Hash
  /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_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...]
  /prebuilts/gcc/darwin-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
symtab.h 41 typedef struct ht hash_table;
47 struct ht struct
98 extern void ht_load (hash_table *ht, hashnode *entries,
  /prebuilts/gcc/darwin-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
symtab.h 41 typedef struct ht hash_table;
47 struct ht struct
98 extern void ht_load (hash_table *ht, hashnode *entries,
  /prebuilts/gcc/linux-x86/arm/arm-eabi-4.6/lib/gcc/arm-eabi/4.6.x-google/plugin/include/
symtab.h 41 typedef struct ht hash_table;
47 struct ht struct
98 extern void ht_load (hash_table *ht, hashnode *entries,
  /prebuilts/gcc/linux-x86/arm/arm-linux-androideabi-4.6/lib/gcc/arm-linux-androideabi/4.6.x-google/plugin/include/
symtab.h 41 typedef struct ht hash_table;
47 struct ht struct
98 extern void ht_load (hash_table *ht, hashnode *entries,
  /cts/tests/tests/database/src/android/database/cts/
ContentObserverTest.java 48 HandlerThread ht = new HandlerThread(getClass().getName()); local
49 ht.start();
50 Looper looper = ht.getLooper();
92 HandlerThread ht = new HandlerThread(getClass().getName()); local
93 ht.start();
94 Looper looper = ht.getLooper();

Completed in 770 milliseconds

1 2 3 4