Lines Matching defs:right
120 * step two: walk the tree in a depth-first, left-right-down order, writing
147 uintptr_t right, uintptr_t down, uintptr_t parent,
177 char *adjusted_address = (char *)(node->right);
204 #define RIGHT(node) ((node)->right)
566 uintptr_t right, uintptr_t down, uintptr_t parent,
606 if (temp_node.right != NULL) {
607 temp_node.right = (dns_rbtnode_t *)(right);
650 uintptr_t left = 0, right = 0, down = 0, data = 0;
671 * WARNING: A change in the order (from left, right, down)
677 datawriter, writer_arg, &right, crc));
696 CHECK(serialize_node(file, node, left, right, down, parent, data, crc));
817 CONFIRM(n->right <= (dns_rbtnode_t *) nodemax);
818 n->right = getright(n, rbt->mmap_location);
820 CONFIRM(DNS_RBTNODE_VALID(n->right));
822 CONFIRM(n->right == NULL);
852 /* a change in the order (from left, right, down) will break hashing*/
856 if (n->right != NULL)
857 CHECK(treefix(rbt, base, filesize, n->right, name,
1114 * Go as far right and then down as much as possible,
1174 * right child is NULL). This cannot be determined from the
1584 * that means a left or right pointer was
1652 * the right node, the next call to
1658 * was called and jump to the right place.
2616 * This node has one child, on the right.
2640 * if there is any child, it is on the right.
2777 * Child is parent's right child.
2842 * If there is a left, right or down node, walk into it
2859 * There are no left, right or down nodes, so we
2969 /* Left and right side black node counts must match. */
3024 fprintf(f, "Right: %p\n", n->right);
3091 fprintf(f, "** Red/Red color violation on right\n");
3092 print_text_helper(RIGHT(root), root, depth, "right",
3256 * Moving left one then right as far as possible is the
3269 * the way there the link from parent to child is a right
3292 * Go down and as far right as possible, and repeat
3321 * any right links. Ascend the tree one level; the
3507 * level and look for either a right link off the point of