Home
last modified time | relevance | path

Searched refs:hashmap_entry (Results 1 – 6 of 6) sorted by relevance

/third_party/libbpf/src/
Dhashmap.c24 static void hashmap_add_entry(struct hashmap_entry **pprev, in hashmap_add_entry()
25 struct hashmap_entry *entry) in hashmap_add_entry()
31 static void hashmap_del_entry(struct hashmap_entry **pprev, in hashmap_del_entry()
32 struct hashmap_entry *entry) in hashmap_del_entry()
65 struct hashmap_entry *cur, *tmp; in hashmap__clear()
103 struct hashmap_entry **new_buckets; in hashmap_grow()
104 struct hashmap_entry *cur, *tmp; in hashmap_grow()
132 struct hashmap_entry ***pprev, in hashmap_find_entry()
133 struct hashmap_entry **entry) in hashmap_find_entry()
135 struct hashmap_entry *cur, **prev_ptr; in hashmap_find_entry()
[all …]
Dhashmap.h60 struct hashmap_entry { struct
69 struct hashmap_entry *next; argument
77 struct hashmap_entry **buckets;
Dbtf.c3858 struct hashmap_entry *hash_entry;
4405 struct hashmap_entry *hash_entry;
4498 struct hashmap_entry *hash_entry;
Dbtf_dump.c226 struct hashmap_entry *cur; in btf_dump_free_names()
Dlibbpf.c6050 struct hashmap_entry *entry;
/third_party/pulseaudio/src/pulsecore/
Dhashmap.c35 struct hashmap_entry { struct
39 struct hashmap_entry *bucket_next, *bucket_previous; argument
40 struct hashmap_entry *iterate_next, *iterate_previous; argument
50 struct hashmap_entry *iterate_list_head, *iterate_list_tail;
54 #define BY_HASH(h) ((struct hashmap_entry**) ((uint8_t*) (h) + PA_ALIGN(sizeof(pa_hashmap))))
61 h = pa_xmalloc0(PA_ALIGN(sizeof(pa_hashmap)) + NBUCKETS*sizeof(struct hashmap_entry*)); in pa_hashmap_new_full()
79 static void remove_entry(pa_hashmap *h, struct hashmap_entry *e) { in remove_entry()
122 static struct hashmap_entry *hash_scan(const pa_hashmap *h, unsigned hash, const void *key) { in hash_scan()
123 struct hashmap_entry *e; in hash_scan()
135 struct hashmap_entry *e; in pa_hashmap_put()
[all …]