HomeSort by relevance Sort by last modified time
    Searched refs:AvahiHashmap (Results 1 - 9 of 9) sorted by null

  /external/avahi/avahi-core/
hashmap.h 27 typedef struct AvahiHashmap AvahiHashmap;
33 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc key_free_func, AvahiFreeFunc value_free_func);
35 void avahi_hashmap_free(AvahiHashmap *m);
36 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key);
37 int avahi_hashmap_insert(AvahiHashmap *m, void *key, void *value);
38 int avahi_hashmap_replace(AvahiHashmap *m, void *key, void *value);
39 void avahi_hashmap_remove(AvahiHashmap *m, const void *key);
43 void avahi_hashmap_foreach(AvahiHashmap *m, AvahiHashmapForeachCallback callback, void *userdata);
hashmap.c 38 AvahiHashmap *hashmap;
46 struct AvahiHashmap {
55 static Entry* entry_get(AvahiHashmap *m, const void *key) {
68 static void entry_free(AvahiHashmap *m, Entry *e, int stolen) {
86 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc key_free_func, AvahiFreeFunc value_free_func) {
87 AvahiHashmap *m;
92 if (!(m = avahi_new0(AvahiHashmap, 1)))
105 void avahi_hashmap_free(AvahiHashmap *m) {
114 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key) {
125 int avahi_hashmap_insert(AvahiHashmap *m, void *key, void *value)
    [all...]
hashmap-test.c 34 AvahiHashmap *m;
cache.h 70 AvahiHashmap *hashmap;
iface.h 63 AvahiHashmap *hashmap;
116 AvahiHashmap *queriers_by_key;
internal.h 109 AvahiHashmap *entries_by_key;
114 AvahiHashmap *record_browser_hashmap;
dns.h 34 AvahiHashmap *name_table; /* for name compression */
multicast-lookup.c 62 AvahiHashmap *lookups_by_key;
wide-area.c 91 AvahiHashmap *cache_by_key;
96 AvahiHashmap *lookups_by_id;
97 AvahiHashmap *lookups_by_key;

Completed in 50 milliseconds