Searched refs:AvahiHashmap (Results 1 - 18 of 18) sorted by relevance

/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/avahi-0.6.25/avahi-core/
H A Dhashmap.h29 typedef struct AvahiHashmap AvahiHashmap; typedef in typeref:struct:AvahiHashmap
35 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc key_free_func, AvahiFreeFunc value_free_func);
37 void avahi_hashmap_free(AvahiHashmap *m);
38 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key);
39 int avahi_hashmap_insert(AvahiHashmap *m, void *key, void *value);
40 int avahi_hashmap_replace(AvahiHashmap *m, void *key, void *value);
41 void avahi_hashmap_remove(AvahiHashmap *m, const void *key);
45 void avahi_hashmap_foreach(AvahiHashmap *m, AvahiHashmapForeachCallback callback, void *userdata);
H A Dhashmap.c40 AvahiHashmap *hashmap;
48 struct AvahiHashmap { struct
57 static Entry* entry_get(AvahiHashmap *m, const void *key) {
70 static void entry_free(AvahiHashmap *m, Entry *e, int stolen) {
88 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc key_free_func, AvahiFreeFunc value_free_func) {
89 AvahiHashmap *m;
94 if (!(m = avahi_new0(AvahiHashmap, 1)))
107 void avahi_hashmap_free(AvahiHashmap *m) {
116 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key) {
127 int avahi_hashmap_insert(AvahiHashmap *
[all...]
H A Dhashmap-test.c36 AvahiHashmap *m;
H A Dcache.h72 AvahiHashmap *hashmap;
H A Diface.h65 AvahiHashmap *hashmap;
114 AvahiHashmap *queriers_by_key;
H A Dinternal.h110 AvahiHashmap *entries_by_key;
115 AvahiHashmap *record_browser_hashmap;
H A Ddns.h36 AvahiHashmap *name_table; /* for name compression */
H A Dmulticast-lookup.c64 AvahiHashmap *lookups_by_key;
H A Dwide-area.c93 AvahiHashmap *cache_by_key;
98 AvahiHashmap *lookups_by_id;
99 AvahiHashmap *lookups_by_key;
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/avahi-0.6.25/avahi-core/
H A Dhashmap.h29 typedef struct AvahiHashmap AvahiHashmap; typedef in typeref:struct:AvahiHashmap
35 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc key_free_func, AvahiFreeFunc value_free_func);
37 void avahi_hashmap_free(AvahiHashmap *m);
38 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key);
39 int avahi_hashmap_insert(AvahiHashmap *m, void *key, void *value);
40 int avahi_hashmap_replace(AvahiHashmap *m, void *key, void *value);
41 void avahi_hashmap_remove(AvahiHashmap *m, const void *key);
45 void avahi_hashmap_foreach(AvahiHashmap *m, AvahiHashmapForeachCallback callback, void *userdata);
H A Dhashmap.c40 AvahiHashmap *hashmap;
48 struct AvahiHashmap { struct
57 static Entry* entry_get(AvahiHashmap *m, const void *key) {
70 static void entry_free(AvahiHashmap *m, Entry *e, int stolen) {
88 AvahiHashmap* avahi_hashmap_new(AvahiHashFunc hash_func, AvahiEqualFunc equal_func, AvahiFreeFunc key_free_func, AvahiFreeFunc value_free_func) {
89 AvahiHashmap *m;
94 if (!(m = avahi_new0(AvahiHashmap, 1)))
107 void avahi_hashmap_free(AvahiHashmap *m) {
116 void* avahi_hashmap_lookup(AvahiHashmap *m, const void *key) {
127 int avahi_hashmap_insert(AvahiHashmap *
[all...]
H A Dhashmap-test.c36 AvahiHashmap *m;
H A Dcache.h72 AvahiHashmap *hashmap;
H A Diface.h65 AvahiHashmap *hashmap;
114 AvahiHashmap *queriers_by_key;
H A Dinternal.h110 AvahiHashmap *entries_by_key;
115 AvahiHashmap *record_browser_hashmap;
H A Ddns.h36 AvahiHashmap *name_table; /* for name compression */
H A Dmulticast-lookup.c64 AvahiHashmap *lookups_by_key;
H A Dwide-area.c93 AvahiHashmap *cache_by_key;
98 AvahiHashmap *lookups_by_id;
99 AvahiHashmap *lookups_by_key;

Completed in 181 milliseconds