| /external/mesa3d/src/util/ |
| hash_table.h | 41 struct hash_entry { struct
48 struct hash_entry *table;
66 void (*delete_function)(struct hash_entry *entry));
68 void (*delete_function)(struct hash_entry *entry));
77 struct hash_entry *
79 struct hash_entry *
82 struct hash_entry *
84 struct hash_entry *
88 struct hash_entry *entry);
90 struct hash_entry *_mesa_hash_table_next_entry(struct hash_table *ht
[all...] |
| hash_table.c | 95 entry_is_free(const struct hash_entry *entry)
101 entry_is_deleted(const struct hash_table *ht, struct hash_entry *entry)
107 entry_is_present(const struct hash_table *ht, struct hash_entry *entry)
130 ht->table = rzalloc_array(ht, struct hash_entry, ht->size);
151 void (*delete_function)(struct hash_entry *entry))
157 struct hash_entry *entry;
174 void (*delete_function)(struct hash_entry *entry))
176 struct hash_entry *entry;
208 static struct hash_entry *
217 struct hash_entry *entry = ht->table + hash_address
[all...] |
| string_to_uint_map.h | 114 hash_entry *entry = _mesa_hash_table_search(this->ht,
141 struct hash_entry *entry = _mesa_hash_table_search(this->ht, dup_key);
|
| /external/squashfs-tools/squashfs-tools/ |
| read_xattrs.c | 52 static struct hash_entry { struct
55 struct hash_entry *next;
78 struct hash_entry *hash_entry = malloc(sizeof(*hash_entry)); local
83 if(hash_entry == NULL)
86 hash_entry->start = start;
87 hash_entry->offset = offset;
88 hash_entry->next = hash_table[hash];
89 hash_table[hash] = hash_entry;
100 struct hash_entry *hash_entry = hash_table[hash]; local
[all...] |
| /external/bison/lib/ |
| hash.c | 46 struct hash_entry struct
49 struct hash_entry *next;
57 struct hash_entry *bucket;
58 struct hash_entry const *bucket_limit;
75 /* A linked list of freed struct hash_entry structs. */
76 struct hash_entry *free_entry_list;
176 struct hash_entry const *bucket;
183 struct hash_entry const *cursor = bucket;
203 struct hash_entry const *bucket;
211 struct hash_entry const *cursor = bucket
[all...] |
| /external/kmod/shared/ |
| hash.c | 28 struct hash_entry { struct
34 struct hash_entry *entries;
78 struct hash_entry *entry, *entry_end;
152 struct hash_entry *entry, *entry_end;
156 size_t size = new_total * sizeof(struct hash_entry);
157 struct hash_entry *tmp = realloc(bucket->entries, size);
176 (entry_end - entry) * sizeof(struct hash_entry));
195 struct hash_entry *entry, *entry_end;
199 size_t size = new_total * sizeof(struct hash_entry);
200 struct hash_entry *tmp = realloc(bucket->entries, size)
[all...] |
| /toolchain/binutils/binutils-2.25/gas/ |
| hash.c | 36 struct hash_entry { struct
38 struct hash_entry *next;
52 struct hash_entry **table;
92 alloc = size * sizeof (struct hash_entry *);
93 ret->table = (struct hash_entry **) obstack_alloc (&ret->memory, alloc);
125 hash_entry, or NULL if the string is not in the table. If PLIST is
133 static struct hash_entry *
135 struct hash_entry ***plist, unsigned long *phash)
141 struct hash_entry **list;
142 struct hash_entry *p
[all...] |
| /external/mesa3d/src/util/tests/hash_table/ |
| destroy_callback.c | 39 delete_callback(struct hash_entry *entry)
|
| insert_and_lookup.c | 39 struct hash_entry *entry;
|
| clear.c | 46 static void delete_function(struct hash_entry *entry)
56 struct hash_entry *entry;
|
| random_entry.c | 46 uint32_t_key_is_even(struct hash_entry *entry)
55 struct hash_entry *entry;
|
| delete_and_lookup.c | 49 struct hash_entry *entry;
|
| insert_many.c | 49 struct hash_entry *entry;
|
| replacement.c | 39 struct hash_entry *entry;
|
| delete_management.c | 49 struct hash_entry *entry;
|
| /external/mesa3d/src/compiler/nir/ |
| nir_lower_global_vars_to_local.c | 51 struct hash_entry *entry =
86 struct hash_entry *entry;
|
| /external/mesa3d/src/compiler/glsl/ |
| ir_variable_refcount.cpp | 46 free_entry(struct hash_entry *entry)
82 struct hash_entry *e = _mesa_hash_table_search(this->ht, var);
|
| ir_builder_print_visitor.cpp | 258 const struct hash_entry *const he =
267 const struct hash_entry *const he =
427 const struct hash_entry *const he =
498 const struct hash_entry *const he_lhs =
512 const struct hash_entry *const he_lhs =
515 const struct hash_entry *const he_rhs =
571 const struct hash_entry *const he =
618 const struct hash_entry *const he =
668 const struct hash_entry *const he =
687 const struct hash_entry *const he
[all...] |
| opt_copy_propagation.cpp | 165 struct hash_entry *entry = _mesa_hash_table_search(acp, ir->var);
234 struct hash_entry *entry;
283 struct hash_entry *entry;
331 struct hash_entry *entry = _mesa_hash_table_search(acp, var);
|
| ir_array_refcount.cpp | 45 free_entry(struct hash_entry *entry)
132 struct hash_entry *e = _mesa_hash_table_search(this->ht, var);
|
| ir_function_detect_recursion.cpp | 175 hash_entry *entry = _mesa_hash_table_search(this->function_hash, sig);
266 hash_entry *entry = _mesa_hash_table_search(visitor->function_hash, key);
|
| opt_constant_variable.cpp | 65 struct hash_entry *hte = _mesa_hash_table_search(ht, var);
193 struct hash_entry *hte;
|
| /external/e2fsprogs/e2fsck/ |
| rehash.c | 82 struct hash_entry *harray;
90 struct hash_entry { struct
112 struct hash_entry *new_array, *ent;
172 sizeof(struct hash_entry) * (fd->max_array+500));
202 const struct hash_entry *he_a = (const struct hash_entry *) a;
203 const struct hash_entry *he_b = (const struct hash_entry *) b;
211 const struct hash_entry *he_a = (const struct hash_entry *) a
[all...] |
| /external/mesa3d/src/mesa/main/ |
| hash.c | 178 const struct hash_entry *entry;
266 struct hash_entry *entry;
335 struct hash_entry *entry;
384 struct hash_entry *entry;
417 struct hash_entry *entry;
|
| /external/mesa3d/src/gallium/drivers/vc4/ |
| vc4_qir_lower_uniforms.c | 50 struct hash_entry *entry;
64 struct hash_entry *entry;
139 struct hash_entry *entry;
|
