OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:avahi_hashmap_lookup
(Results
1 - 12
of
12
) sorted by null
/external/avahi/avahi-core/
hashmap-test.c
48
printf("%s\n", (const char*)
avahi_hashmap_lookup
(m, "bla"));
52
printf("%s\n", (const char*)
avahi_hashmap_lookup
(m, "bla"));
56
t = (const char*)
avahi_hashmap_lookup
(m, "bla");
hashmap.h
36
void*
avahi_hashmap_lookup
(AvahiHashmap *m, const void *key);
querier.c
105
if ((q =
avahi_hashmap_lookup
(i->queriers_by_key, key))) {
151
if (!(q =
avahi_hashmap_lookup
(i->queriers_by_key, key)) || q->n_used <= 0)
233
if (!(q =
avahi_hashmap_lookup
(i->queriers_by_key, key)))
multicast-lookup.c
108
t =
avahi_hashmap_lookup
(e->lookups_by_key, l->key);
148
t =
avahi_hashmap_lookup
(l->engine->lookups_by_key, l->key);
297
for (l =
avahi_hashmap_lookup
(e->lookups_by_key, record->key); l; l = l->by_key_next) {
wide-area.c
112
if (!(l =
avahi_hashmap_lookup
(e->lookups_by_id, &i)))
263
t =
avahi_hashmap_lookup
(e->lookups_by_key, l->key);
278
t =
avahi_hashmap_lookup
(l->engine->lookups_by_key, l->key);
335
t =
avahi_hashmap_lookup
(c->engine->cache_by_key, c->record->key);
363
for (c =
avahi_hashmap_lookup
(e->cache_by_key, r->key); c; c = c->by_key_next)
376
for (l =
avahi_hashmap_lookup
(e->lookups_by_key, r->key); l; l = l->by_key_next) {
431
t =
avahi_hashmap_lookup
(e->cache_by_key, r->key);
698
for (c =
avahi_hashmap_lookup
(e->cache_by_key, key); c; c = c->by_key_next) {
705
for (c =
avahi_hashmap_lookup
(e->cache_by_key, cname_key); c; c = c->by_key_next) {
cache.c
44
t =
avahi_hashmap_lookup
(c->hashmap, e->record->key);
111
return
avahi_hashmap_lookup
(c->hashmap, k);
hashmap.c
114
void*
avahi_hashmap_lookup
(AvahiHashmap *m, const void *key) {
function
server.c
77
for (e =
avahi_hashmap_lookup
(s->entries_by_key, k); e; e = e->by_key_next)
134
for (e =
avahi_hashmap_lookup
(s->entries_by_key, k); e; e = e->by_key_next)
192
for (e =
avahi_hashmap_lookup
(s->entries_by_key, key); e; e = e->by_key_next)
206
for (e =
avahi_hashmap_lookup
(s->entries_by_key, record->key); e; e = n) {
251
for (e =
avahi_hashmap_lookup
(s->entries_by_key, record->key); e; e = n) {
[
all
...]
entry.c
84
t =
avahi_hashmap_lookup
(s->entries_by_key, e->record->key);
157
for (e =
avahi_hashmap_lookup
(s->entries_by_key, r->key); e; e = e->by_key_next) {
239
for (e =
avahi_hashmap_lookup
(s->entries_by_key, r->key); e; e = e->by_key_next) {
302
t =
avahi_hashmap_lookup
(s->entries_by_key, e->record->key);
[
all
...]
announce.c
375
for (i =
avahi_hashmap_lookup
(s->entries_by_key, e->record->key); i; i = i->by_key_next) {
dns.c
184
if (p->name_table && (prev =
avahi_hashmap_lookup
(p->name_table, name))) {
iface.c
551
return
avahi_hashmap_lookup
(m->hashmap, &idx);
Completed in 75 milliseconds