Lines Matching defs:parent
58 * XXXDCL Since parent pointers were added in again, I could remove all of the
147 uintptr_t right, uintptr_t down, uintptr_t parent,
151 serialize_nodes(FILE *file, dns_rbtnode_t *node, uintptr_t parent,
161 char *adjusted_address = (char *)(node->parent);
202 #define PARENT(node) ((node)->parent)
260 * being wholly handled by parent pointers (which didn't exist, because
349 * Upper node is the parent of the root of the passed node's
390 /* Upper node is the parent of the root of the passed node's
566 uintptr_t right, uintptr_t down, uintptr_t parent,
598 if (temp_node.parent != NULL) {
599 temp_node.parent = (dns_rbtnode_t *)(parent);
646 serialize_nodes(FILE *file, dns_rbtnode_t *node, uintptr_t parent,
696 CHECK(serialize_node(file, node, left, right, down, parent, data, crc));
834 CONFIRM(n->parent <= (dns_rbtnode_t *) nodemax);
835 n->parent = getparent(n, rbt->mmap_location);
837 CONFIRM(n->parent < (dns_rbtnode_t *) n);
838 CONFIRM(DNS_RBTNODE_VALID(n->parent));
840 CONFIRM(n->parent == NULL);
1141 dns_rbtnode_t **root, *parent, *child, *current, *new_current;
1219 parent = NULL;
1245 parent = current;
1249 parent = current;
1287 parent = NULL;
1347 if (parent != NULL) {
1348 if (LEFT(parent) == current)
1349 LEFT(parent) = new_current;
1351 RIGHT(parent) = new_current;
1597 * its parent is the same as its "up" pointer.
2093 * back up to its parent level. But what happens when "a" then gets deleted?
2114 dns_rbtnode_t *parent;
2145 * top level, parent will be set to NULL.
2147 parent = get_upper_node(node);
2153 deletefromlevel(node, parent == NULL ? &rbt->root : &DOWN(parent));
2485 dns_rbtnode_t *child, *root, *parent, *grandparent;
2530 * XXXDCL could do away with separate parent and grandparent
2531 * variables. They are vestiges of the days before parent
2535 parent = PARENT(node);
2536 grandparent = PARENT(parent);
2538 if (parent == LEFT(grandparent)) {
2541 MAKE_BLACK(parent);
2546 if (node == RIGHT(parent)) {
2547 rotate_left(parent, &root);
2548 node = parent;
2549 parent = PARENT(node);
2550 grandparent = PARENT(parent);
2552 MAKE_BLACK(parent);
2559 MAKE_BLACK(parent);
2564 if (node == LEFT(parent)) {
2565 rotate_right(parent, &root);
2566 node = parent;
2567 parent = PARENT(node);
2568 grandparent = PARENT(parent);
2570 MAKE_BLACK(parent);
2590 dns_rbtnode_t *child, *sibling, *parent;
2596 * Verify that the parent history is (apparently) correct.
2686 * is the successor's original parent.
2692 * Node being deleted was successor's parent.
2711 * Remove the node by removing the links from its parent.
2736 parent = PARENT(item);
2741 if (LEFT(parent) == child) {
2742 sibling = RIGHT(parent);
2746 MAKE_RED(parent);
2747 rotate_left(parent, rootp);
2748 sibling = RIGHT(parent);
2756 child = parent;
2764 sibling = RIGHT(parent);
2767 COLOR(sibling) = COLOR(parent);
2768 MAKE_BLACK(parent);
2771 rotate_left(parent, rootp);
2777 * Child is parent's right child.
2781 sibling = LEFT(parent);
2785 MAKE_RED(parent);
2786 rotate_right(parent, rootp);
2787 sibling = LEFT(parent);
2795 child = parent;
2802 sibling = LEFT(parent);
2805 COLOR(sibling) = COLOR(parent);
2806 MAKE_BLACK(parent);
2809 rotate_right(parent, rootp);
2814 parent = PARENT(child);
2860 * can free this one and go back to its parent.
2935 /* If node is assigned to the down_ pointer of its parent, it is
3023 fprintf(f, "Parent: %p\n", n->parent);
3052 print_text_helper(dns_rbtnode_t *root, dns_rbtnode_t *parent,
3063 if ((! IS_ROOT(root) && PARENT(root) != parent) ||
3067 fprintf(f, " (BAD parent pointer! -> ");
3269 * the way there the link from parent to child is a right
3270 * link, then the parent is the previous node, at least
3535 * has a parent. If that happens,