22         Hashmap *names;  member
72         if (hashmap_size(track->names) > 0)  in bus_track_add_to_queue()
103         i = hashmap_remove(track->names, name);  in bus_track_remove_name_fully()
155         track->names = hashmap_free(track->names);  in track_free()
191         i = hashmap_get(track->names, name);  in sd_bus_track_add_name()
210         r = hashmap_ensure_allocated(&track->names, &track_item_hash_ops);  in sd_bus_track_add_name()
237         r = hashmap_put(track->names, n->name, n);  in sd_bus_track_add_name()
248                 hashmap_remove(track->names, name);  in sd_bus_track_add_name()
269         i = hashmap_get(track->names, name);  in sd_bus_track_remove_name()
291         return hashmap_size(track->names);  in sd_bus_track_count()
300         return hashmap_contains(track->names, name) ? name : NULL;  in sd_bus_track_contains()
312         (void) hashmap_iterate(track->names, &track->iterator, NULL, (const void**) &n);  in sd_bus_track_first()
325         (void) hashmap_iterate(track->names, &track->iterator, NULL, (const void**) &n);  in sd_bus_track_next()
402         if (hashmap_isempty(track->names))  in bus_track_close()
406         hashmap_clear(track->names);  in bus_track_close()
452         if (!hashmap_isempty(track->names))  in sd_bus_track_set_recursive()
491         i = hashmap_get(track->names, name);  in sd_bus_track_count_name()