Searched refs:AvahiPrioQueueNode (Results 1 - 8 of 8) sorted by relevance
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/avahi-0.6.25/avahi-core/ |
H A D | prioq.h | 26 typedef struct AvahiPrioQueueNode AvahiPrioQueueNode; typedef in typeref:struct:AvahiPrioQueueNode 31 AvahiPrioQueueNode *root, *last; 36 struct AvahiPrioQueueNode { struct 40 AvahiPrioQueueNode *left, *right, *parent, *next, *prev; 46 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data); 47 void avahi_prio_queue_remove(AvahiPrioQueue *q, AvahiPrioQueueNode *n); 49 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n);
|
H A D | prioq.c | 57 static AvahiPrioQueueNode* get_node_at_xy(AvahiPrioQueue *q, unsigned x, unsigned y) { 59 AvahiPrioQueueNode *n; 80 static void exchange_nodes(AvahiPrioQueue *q, AvahiPrioQueueNode *a, AvahiPrioQueueNode *b) { 81 AvahiPrioQueueNode *l, *r, *p, *ap, *an, *bp, *bn; 164 AvahiPrioQueueNode *apl = NULL, *bpl = NULL; 260 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n) { 271 AvahiPrioQueueNode *min; 292 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data) { 293 AvahiPrioQueueNode * [all...] |
H A D | prioq-test.c | 48 static void rec(AvahiPrioQueueNode *n) { 103 printf("%i\n", POINTER_TO_INT(((AvahiPrioQueueNode*)q2->root->data)->data));
|
H A D | timeeventq.c | 37 AvahiPrioQueueNode *node;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/avahi-0.6.25/avahi-core/ |
H A D | prioq.h | 26 typedef struct AvahiPrioQueueNode AvahiPrioQueueNode; typedef in typeref:struct:AvahiPrioQueueNode 31 AvahiPrioQueueNode *root, *last; 36 struct AvahiPrioQueueNode { struct 40 AvahiPrioQueueNode *left, *right, *parent, *next, *prev; 46 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data); 47 void avahi_prio_queue_remove(AvahiPrioQueue *q, AvahiPrioQueueNode *n); 49 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n);
|
H A D | prioq.c | 57 static AvahiPrioQueueNode* get_node_at_xy(AvahiPrioQueue *q, unsigned x, unsigned y) { 59 AvahiPrioQueueNode *n; 80 static void exchange_nodes(AvahiPrioQueue *q, AvahiPrioQueueNode *a, AvahiPrioQueueNode *b) { 81 AvahiPrioQueueNode *l, *r, *p, *ap, *an, *bp, *bn; 164 AvahiPrioQueueNode *apl = NULL, *bpl = NULL; 260 void avahi_prio_queue_shuffle(AvahiPrioQueue *q, AvahiPrioQueueNode *n) { 271 AvahiPrioQueueNode *min; 292 AvahiPrioQueueNode* avahi_prio_queue_put(AvahiPrioQueue *q, void* data) { 293 AvahiPrioQueueNode * [all...] |
H A D | prioq-test.c | 48 static void rec(AvahiPrioQueueNode *n) { 103 printf("%i\n", POINTER_TO_INT(((AvahiPrioQueueNode*)q2->root->data)->data));
|
H A D | timeeventq.c | 37 AvahiPrioQueueNode *node;
|
Completed in 33 milliseconds