lib/dns/rbt.c

232 #define LEFT(node)	   ((node)->left)
377 	fixup_uppernodes_helper(LEFT(node), uppernode);
1298 				child = LEFT(current);
1392 				LEFT(new_current) = LEFT(current);
1400 					if (LEFT(parent) == current) {
1401 						LEFT(parent) = new_current;
1406 				if (LEFT(new_current) != NULL) {
1407 					PARENT(LEFT(new_current)) = new_current;
1436 				LEFT(current) = NULL;
1973 						current = LEFT(current);
2298 	LEFT(node) = NULL;
2490 	RIGHT(node) = LEFT(child);
2491 	if (LEFT(child) != NULL) {
2492 		PARENT(LEFT(child)) = node;
2494 	LEFT(child) = node;
2503 		if (LEFT(PARENT(node)) == node) {
2504 			LEFT(PARENT(node)) = child;
2520 	child = LEFT(node);
2523 	LEFT(node) = RIGHT(child);
2536 		if (LEFT(PARENT(node)) == node) {
2537 			LEFT(PARENT(node)) = child;
2558 	REQUIRE(DNS_RBTNODE_VALID(node) && LEFT(node) == NULL &&
2584 		INSIST(LEFT(current) == NULL);
2585 		LEFT(current) = node;
2606 		if (parent == LEFT(grandparent)) {
2625 			child = LEFT(grandparent);
2632 				if (node == LEFT(parent)) {
2668 		(LEFT(PARENT(item)) == item || RIGHT(PARENT(item)) == item)));
2672 	if (LEFT(item) == NULL) {
2691 		child = LEFT(item);
2703 		while (LEFT(successor) != NULL) {
2704 			successor = LEFT(successor);
2738 		} else if (LEFT(PARENT(item)) == item) {
2739 			LEFT(PARENT(item)) = successor;
2745 		LEFT(successor) = LEFT(item);
2749 		if (LEFT(successor) != NULL) {
2750 			PARENT(LEFT(successor)) = successor;
2769 			LEFT(saved_parent) = item;
2776 		LEFT(item) = NULL;
2785 		if (LEFT(PARENT(item)) == item) {
2786 			LEFT(PARENT(item)) = child;
2815 			if (LEFT(parent) == child) {
2829 				if (IS_BLACK(LEFT(sibling)) &&
2836 						MAKE_BLACK(LEFT(sibling));
2855 				sibling = LEFT(parent);
2861 					sibling = LEFT(parent);
2868 				if (IS_BLACK(LEFT(sibling)) &&
2874 					if (IS_BLACK(LEFT(sibling))) {
2878 						sibling = LEFT(parent);
2883 					INSIST(LEFT(sibling) != NULL);
2884 					MAKE_BLACK(LEFT(sibling));
2921 		if (LEFT(root) != NULL) {
2923 			root = LEFT(root);
2924 			LEFT(node) = NULL;
2973 	dl = getheight_helper(LEFT(node));
3000 		if (IS_RED(LEFT(node)) || IS_RED(RIGHT(node))) {
3030 	return (check_properties_helper(LEFT(node)) &&
3045 	if (!check_black_distance_helper(LEFT(node), &dl)) {
3192 		if (COLOR(root) == RED && IS_RED(LEFT(root))) {
3195 		print_text_helper(LEFT(root), root, depth, "left", data_printer,
3231 	l = print_dot_helper(LEFT(node), nodecount, show_pointers, f);
3266 	if (LEFT(node) != NULL) {
3371 	if (LEFT(current) != NULL) {
3376 		current = LEFT(current);
3504 		while (LEFT(current) != NULL) {
3505 			current = LEFT(current);
3561 			if (LEFT(current) == previous) {
3569 		while (LEFT(current) != NULL) {
3570 			current = LEFT(current);
3621 		while (LEFT(current) != NULL) {
3622 			current = LEFT(current);
3642 				if (LEFT(current) == previous) {
3683 		while (LEFT(current) != NULL) {
3684 			current = LEFT(current);