Home
last modified time | relevance | path

Searched refs:userp (Results 1 – 4 of 4) sorted by relevance

/openbmc/qemu/include/qemu/
H A Dqht.h45 typedef bool (*qht_lookup_func_t)(const void *obj, const void *userp);
107 void *qht_lookup_custom(const struct qht *ht, const void *userp, uint32_t hash,
118 void *qht_lookup(const struct qht *ht, const void *userp, uint32_t hash);
187 void qht_iter(struct qht *ht, qht_iter_func_t func, void *userp);
201 void qht_iter_remove(struct qht *ht, qht_iter_bool_func_t func, void *userp);
/openbmc/qemu/util/
H A Dqht.c556 const void *userp, uint32_t hash) in qht_do_lookup() argument
570 if (likely(p) && likely(func(p, userp))) { in qht_do_lookup()
583 const void *userp, uint32_t hash) in qht_lookup__slowpath() argument
590 ret = qht_do_lookup(b, func, userp, hash); in qht_lookup__slowpath()
595 void *qht_lookup_custom(const struct qht *ht, const void *userp, uint32_t hash, in qht_lookup_custom() argument
607 ret = qht_do_lookup(b, func, userp, hash); in qht_lookup_custom()
615 return qht_lookup__slowpath(b, func, userp, hash); in qht_lookup_custom()
618 void *qht_lookup(const struct qht *ht, const void *userp, uint32_t hash) in qht_lookup() argument
620 return qht_lookup_custom(ht, userp, hash, ht->cmp); in qht_lookup()
823 const struct qht_iter *iter, void *userp) in qht_bucket_iter() argument
[all …]
H A Dqsp.c520 static void qsp_sort(void *p, uint32_t h, void *userp) in qsp_sort() argument
523 GTree *tree = userp; in qsp_sort()
/openbmc/qemu/tests/unit/
H A Dtest-qht.c101 static void count_func(void *p, uint32_t hash, void *userp) in count_func() argument
103 unsigned int *curr = userp; in count_func()
125 static void sum_func(void *p, uint32_t hash, void *userp) in sum_func() argument
127 uint32_t *sum = userp; in sum_func()
141 static bool rm_mod_func(void *p, uint32_t hash, void *userp) in rm_mod_func() argument
144 unsigned int mod = *(unsigned int *)userp; in rm_mod_func()