Cross Reference: /bind-9.6-ESV-R11/lib/dns/rbt.c

Lines Matching refs:LEFT
80 #define LEFT(node)              ((node)->left)
443 				child = LEFT(current);
542 				LEFT(new_current)    = LEFT(current);
550 					if (LEFT(parent) == current)
551 						LEFT(parent) = new_current;
555 				if (LEFT(new_current) != NULL)
556 					PARENT(LEFT(new_current)) =
579 				LEFT(current) = NULL;
852 				current = LEFT(current);
1093 						current = LEFT(current);
1346 	 * LEFT(DOWN(parent)) == NULL && RIGHT(DOWN(parent)) == NULL.
1441 	LEFT(node) = NULL;
1601 	RIGHT(node) = LEFT(child);
1602 	if (LEFT(child) != NULL)
1603 		PARENT(LEFT(child)) = node;
1604 	LEFT(child) = node;
1615 		if (LEFT(PARENT(node)) == node)
1616 			LEFT(PARENT(node)) = child;
1631 	child = LEFT(node);
1634 	LEFT(node) = RIGHT(child);
1648 		if (LEFT(PARENT(node)) == node)
1649 			LEFT(PARENT(node)) = child;
1670 	REQUIRE(DNS_RBTNODE_VALID(node) && LEFT(node) == NULL &&
1696 		INSIST(LEFT(current) == NULL);
1697 		LEFT(current) = node;
1718 		if (parent == LEFT(grandparent)) {
1737 			child = LEFT(grandparent);
1744 				if (node == LEFT(parent)) {
1780 		(LEFT(PARENT(delete)) == delete ||
1785 	if (LEFT(delete) == NULL) {
1804 		child = LEFT(delete);
1815 		while (LEFT(successor) != NULL)
1816 			successor = LEFT(successor);
1848 			if (LEFT(PARENT(delete)) == delete)
1849 				LEFT(PARENT(delete)) = successor;
1854 		LEFT(successor)   = LEFT(delete);
1858 		if (LEFT(successor) != NULL)
1859 			PARENT(LEFT(successor)) = successor;
1878 			LEFT(PARENT(tmp)) = delete;
1885 		LEFT(delete)   = NULL;
1894 		if (LEFT(PARENT(delete)) == delete)
1895 			LEFT(PARENT(delete)) = child;
1921 			if (LEFT(parent) == child) {
1933 				if (IS_BLACK(LEFT(sibling)) &&
1941 						MAKE_BLACK(LEFT(sibling));
1961 				sibling = LEFT(parent);
1967 					sibling = LEFT(parent);
1972 				if (IS_BLACK(LEFT(sibling)) &&
1978 					if (IS_BLACK(LEFT(sibling))) {
1982 						sibling = LEFT(parent);
1987 					INSIST(LEFT(sibling) != NULL);
1988 					MAKE_BLACK(LEFT(sibling));
2025 	if (LEFT(node) != NULL) {
2026 		result = dns_rbt_deletetree(rbt, LEFT(node));
2029 		LEFT(node) = NULL;
2075 	if (LEFT(node) != NULL) {
2076 		node = LEFT(node);
2098 		if (LEFT(parent) == node)
2099 			LEFT(parent) = RIGHT(node);
2182 		if (IS_RED(root) && IS_RED(LEFT(root)))
2184 		dns_rbt_printtree(LEFT(root), root, depth);
2279 	if (LEFT(current) != NULL) {
2284 		current = LEFT(current);
2409 		while (LEFT(current) != NULL)
2410 			current = LEFT(current);
2462 			if (LEFT(current) == previous) {
2470 		while (LEFT(current) != NULL)
2471 			current = LEFT(current);
2520 		while (LEFT(current) != NULL)
2521 			current = LEFT(current);
2541 				if (LEFT(current) == previous) {
2567 		while (LEFT(current) != NULL)
2568 			current = LEFT(current);