Searched refs:AvahiPrioQueueNode (Results 1 – 4 of 4) sorted by relevance
| /external/avahi/avahi-core/ |
| D | prioq.h | 24 typedef struct AvahiPrioQueueNode AvahiPrioQueueNode; typedef
29 AvahiPrioQueueNode *root, *last;
34 struct AvahiPrioQueueNode { struct
38 AvahiPrioQueueNode *left, *right, *parent, *next, *prev; argument
44 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data);
45 void avahi_prio_queue_remove(AvahiPrioQueue *q, AvahiPrioQueueNode *n);
47 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n);
|
| D | prioq.c | 55 static AvahiPrioQueueNode* get_node_at_xy(AvahiPrioQueue *q, unsigned x, unsigned y) { in get_node_at_xy()
57 AvahiPrioQueueNode *n; in get_node_at_xy()
78 static void exchange_nodes(AvahiPrioQueue *q, AvahiPrioQueueNode *a, AvahiPrioQueueNode *b) { in exchange_nodes()
79 AvahiPrioQueueNode *l, *r, *p, *ap, *an, *bp, *bn; in exchange_nodes()
162 AvahiPrioQueueNode *apl = NULL, *bpl = NULL; in exchange_nodes()
258 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n) { in avahi_prio_queue_shuffle()
269 AvahiPrioQueueNode *min; in avahi_prio_queue_shuffle()
290 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data) { in avahi_prio_queue_put()
291 AvahiPrioQueueNode *n; in avahi_prio_queue_put()
294 if (!(n = avahi_new(AvahiPrioQueueNode, 1))) in avahi_prio_queue_put()
[all …]
|
| D | prioq-test.c | 46 static void rec(AvahiPrioQueueNode *n) { in rec()
101 printf("%i\n", POINTER_TO_INT(((AvahiPrioQueueNode*)q2->root->data)->data)); in main()
|
| D | timeeventq.c | 35 AvahiPrioQueueNode *node;
|