67             n = n->right;  in get_node_at_xy()
100                 a->parent->right = a;  in exchange_nodes()
109             r = a->right;  in exchange_nodes()
110             if ((a->right = b->right))  in exchange_nodes()
111                 a->right->parent = a;  in exchange_nodes()
112             if ((b->right = r))  in exchange_nodes()
113                 b->right->parent = b;  in exchange_nodes()
116             if ((b->right = a->right))  in exchange_nodes()
117                 b->right->parent = b;  in exchange_nodes()
118             a->right = b;  in exchange_nodes()
136                 b->parent->right = b;  in exchange_nodes()
145             r = a->right;  in exchange_nodes()
146             if ((a->right = b->right))  in exchange_nodes()
147                 a->right->parent = a;  in exchange_nodes()
148             if ((b->right = r))  in exchange_nodes()
149                 b->right->parent = b;  in exchange_nodes()
151             if ((a->right = b->right))  in exchange_nodes()
152                 a->right->parent = a;  in exchange_nodes()
153             b->right = a;  in exchange_nodes()
177                 bp->right = a;  in exchange_nodes()
185                 ap->right = b;  in exchange_nodes()
191         r = a->right;  in exchange_nodes()
199         if ((a->right = b->right))  in exchange_nodes()
200             a->right->parent = a;  in exchange_nodes()
202         if ((b->right = r))  in exchange_nodes()
203             b->right->parent = b;  in exchange_nodes()
273             assert(!n->right);  in avahi_prio_queue_shuffle()
277         if (n->right && q->compare(n->right->data, min->data) < 0)  in avahi_prio_queue_shuffle()
278             min = n->right;  in avahi_prio_queue_shuffle()
319             n->parent->right = n;  in avahi_prio_queue_put()
331     n->next = n->left = n->right = NULL;  in avahi_prio_queue_put()
356     assert(!n->right);  in avahi_prio_queue_remove()
369             assert(n->parent->right == NULL);  in avahi_prio_queue_remove()
372             assert(n->parent->right == n);  in avahi_prio_queue_remove()
374             n->parent->right = NULL;  in avahi_prio_queue_remove()