69             n = n->left;  in get_node_at_xy()
97             if (a->parent->left == b)  in exchange_nodes()
98                 a->parent->left = a;  in exchange_nodes()
104         if (b->left == a) {  in exchange_nodes()
105             if ((b->left = a->left))  in exchange_nodes()
106                 b->left->parent = b;  in exchange_nodes()
107             a->left = b;  in exchange_nodes()
120             l = a->left;  in exchange_nodes()
121             if ((a->left = b->left))  in exchange_nodes()
122                 a->left->parent = a;  in exchange_nodes()
123             if ((b->left = l))  in exchange_nodes()
124                 b->left->parent = b;  in exchange_nodes()
133             if (b->parent->left == a)  in exchange_nodes()
134                 b->parent->left = b;  in exchange_nodes()
140         if (a->left == b) {  in exchange_nodes()
141             if ((a->left = b->left))  in exchange_nodes()
142                 a->left->parent = a;  in exchange_nodes()
143             b->left = a;  in exchange_nodes()
155             l = a->left;  in exchange_nodes()
156             if ((a->left = b->left))  in exchange_nodes()
157                 a->left->parent = a;  in exchange_nodes()
158             if ((b->left = l))  in exchange_nodes()
159                 b->left->parent = b;  in exchange_nodes()
169             apl = ap->left;  in exchange_nodes()
171             bpl = bp->left;  in exchange_nodes()
175                 bp->left = a;  in exchange_nodes()
183                 ap->left = b;  in exchange_nodes()
190         l = a->left;  in exchange_nodes()
193         if ((a->left = b->left))  in exchange_nodes()
194             a->left->parent = a;  in exchange_nodes()
196         if ((b->left = l))  in exchange_nodes()
197             b->left->parent = b;  in exchange_nodes()
271         if (!(min = n->left)) {  in avahi_prio_queue_shuffle()
321             n->parent->left = n;  in avahi_prio_queue_put()
331     n->next = n->left = n->right = NULL;  in avahi_prio_queue_put()
355     assert(!n->left);  in avahi_prio_queue_remove()
368         if (n->parent->left == n) {  in avahi_prio_queue_remove()
370             n->parent->left = NULL;  in avahi_prio_queue_remove()
373             assert(n->parent->left != NULL);  in avahi_prio_queue_remove()