Home
last modified time | relevance | path

Searched refs:AvahiHashmap (Results 1 – 9 of 9) sorted by relevance

/external/avahi/avahi-core/
Dhashmap.h27 typedef struct AvahiHashmap AvahiHashmap; typedef
33 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc k…
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);
Dhashmap.c38 AvahiHashmap *hashmap;
46 struct AvahiHashmap { struct
55 static Entry* entry_get(AvahiHashmap *m, const void *key) { in entry_get() argument
68 static void entry_free(AvahiHashmap *m, Entry *e, int stolen) { in entry_free()
86 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc k… in avahi_hashmap_new()
87 AvahiHashmap *m; in avahi_hashmap_new()
92 if (!(m = avahi_new0(AvahiHashmap, 1))) in avahi_hashmap_new()
105 void avahi_hashmap_free(AvahiHashmap *m) { in avahi_hashmap_free()
114 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key) { in avahi_hashmap_lookup()
125 int avahi_hashmap_insert(AvahiHashmap *m, void *key, void *value) { in avahi_hashmap_insert()
[all …]
Diface.h63 AvahiHashmap *hashmap;
116 AvahiHashmap *queriers_by_key;
Dinternal.h109 AvahiHashmap *entries_by_key;
114 AvahiHashmap *record_browser_hashmap;
Dhashmap-test.c34 AvahiHashmap *m; in main()
Dcache.h70 AvahiHashmap *hashmap;
Ddns.h34 AvahiHashmap *name_table; /* for name compression */
Dwide-area.c91 AvahiHashmap *cache_by_key;
96 AvahiHashmap *lookups_by_id;
97 AvahiHashmap *lookups_by_key;
Dmulticast-lookup.c62 AvahiHashmap *lookups_by_key;