Lines Matching refs:left
120 * step two: walk the tree in a depth-first, left-right-down order, writing
146 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left,
169 char *adjusted_address = (char *)(node->left);
203 #define LEFT(node) ((node)->left)
565 serialize_node(FILE *file, dns_rbtnode_t *node, uintptr_t left,
602 if (temp_node.left != NULL) {
603 temp_node.left = (dns_rbtnode_t *)(left);
650 uintptr_t left = 0, right = 0, down = 0, data = 0;
671 * WARNING: A change in the order (from left, right, down)
675 datawriter, writer_arg, &left, crc));
696 CHECK(serialize_node(file, node, left, right, down, parent, data, crc));
809 CONFIRM(n->left <= (dns_rbtnode_t *) nodemax);
810 n->left = getleft(n, rbt->mmap_location);
812 CONFIRM(DNS_RBTNODE_VALID(n->left));
814 CONFIRM(n->left == NULL);
852 /* a change in the order (from left, right, down) will break hashing*/
853 if (n->left != NULL)
854 CHECK(treefix(rbt, base, filesize, n->left, name,
1173 * lookup terminated (i.e., at the insertion point where left or
1584 * that means a left or right pointer was
2094 * "b.c" is left hanging around without data or children. This condition
2104 * in the CVS history, but comments have been left behind that point to it just
2622 * This node has one child, on the left.
2639 * The successor cannot possibly have a left child;
2703 * Original location of successor node has no left.
2842 * If there is a left, right or down node, walk into it
2859 * There are no left, right or down nodes, so we
3025 fprintf(f, "Left: %p\n", n->left);
3086 fprintf(f, "** Red/Red color violation on left\n");
3087 print_text_helper(LEFT(root), root, depth, "left",
3256 * Moving left one then right as far as possible is the
3268 * No left links, so move toward the root. If at any point on
3504 * that was via a left link; the successor is the node that has
3505 * that left link. In the event the root of the level is
3506 * reached without having traversed any left links, ascend one
3508 * ascent, or search for a left link upward again, repeating
3525 * any left pointers, so this level is done.