Lines Matching refs:parent
90 if (a->parent == b) {
91 /* B is parent of A */
93 p = b->parent;
94 b->parent = a;
96 if ((a->parent = p)) {
97 if (a->parent->left == b)
98 a->parent->left = a;
100 a->parent->right = a;
106 b->left->parent = b;
111 a->right->parent = a;
113 b->right->parent = b;
117 b->right->parent = b;
122 a->left->parent = a;
124 b->left->parent = b;
126 } else if (b->parent == a) {
127 /* A ist parent of B */
129 p = a->parent;
130 a->parent = b;
132 if ((b->parent = p)) {
133 if (b->parent->left == a)
134 b->parent->left = b;
136 b->parent->right = b;
142 a->left->parent = a;
147 a->right->parent = a;
149 b->right->parent = b;
152 a->right->parent = a;
157 a->left->parent = a;
159 b->left->parent = b;
165 ap = a->parent;
166 bp = b->parent;
173 if ((a->parent = bp)) {
181 if ((b->parent = ap)) {
194 a->left->parent = a;
197 b->left->parent = b;
200 a->right->parent = a;
203 b->right->parent = b;
264 while (n->parent && q->compare(n->parent->data, n->data) > 0)
265 exchange_nodes(q, n, n->parent);
316 n->parent = get_node_at_xy(q, n->x/2, n->y-1);
319 n->parent->right = n;
321 n->parent->left = n;
328 n->prev = n->parent = NULL;
362 assert(n->parent);
364 assert(!n->parent);
366 if (n->parent) {
368 if (n->parent->left == n) {
369 assert(n->parent->right == NULL);
370 n->parent->left = NULL;
372 assert(n->parent->right == n);
373 assert(n->parent->left != NULL);
374 n->parent->right = NULL;
