Cross Reference: /bind-9.11.3/lib/dns/rbt.c

Lines Matching defs:down
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,
185 	char *adjusted_address = (char *)(node->down);
205 #define DOWN(node)              ((node)->down)
566 	       uintptr_t right, uintptr_t down, uintptr_t parent,
610 	if (temp_node.down != NULL) {
611 		temp_node.down = (dns_rbtnode_t *)(down);
650 	uintptr_t left = 0, right = 0, down = 0, data = 0;
671 	 * WARNING: A change in the order (from left, right, down)
679 			      datawriter, writer_arg, &down, crc));
696 	CHECK(serialize_node(file, node, left, right, down, parent, data, crc));
825 		CONFIRM(n->down <= (dns_rbtnode_t *) nodemax);
826 		n->down = getdown(n, rbt->mmap_location);
828 		CONFIRM(n->down > (dns_rbtnode_t *) n);
829 		CONFIRM(DNS_RBTNODE_VALID(n->down));
831 		CONFIRM(n->down == NULL);
852 	/* a change in the order (from left, right, down) will break hashing*/
859 	if (n->down != NULL)
860 		CHECK(treefix(rbt, base, filesize, n->down, fullname,
1114 		 * Go as far right and then down as much as possible,
1115 		 * as long as the rightmost node has a down pointer.
1261 			 * the down pointer to this tree should point
1279 				 * Follow the down pointer (possibly NULL).
1297 				 * to have just the common suffix, and a down
1398 					 * the not-in-common parts down to
1699 			 * down pointer and search in the new tree.
1756 						 * had no down pointer.
1877 				 * Attempted to follow a down pointer that was
1947 				 * node has a down pointer, then the real
1950 				 * Move down levels until the rightmost node
1951 				 * does not have a down pointer.
2132 			 * complete.  The down node from this node might be all
2150 	 * This node now has no down pointer, so now it needs
2842 		 * If there is a left, right or down node, walk into it
2859 			 * There are no left, right or down nodes, so we
3026 	fprintf(f, "Down: %p\n", n->down);
3095 		print_text_helper(DOWN(root), NULL, depth, "down",
3291 			 * The predecessor is really down at least one level.
3292 			 * Go down and as far right as possible, and repeat
3293 			 * as long as the rightmost node has a down pointer.
3298 				 * here. See whether to go down, and if so
3398 		 * in the megatree is a successor to that node, down at
3576 		 * in the megatree is a successor to that node, down at