ipf/netinet/radix_ipf.c

139 /* Parameters:  tree(I)  - pointer to first right node in tree to search    */
152 			cur = cur->right;
379 			cur = cur->right;
388 		prev->right = &nodes[1];
393 		nodes[1].right = cur;
395 		nodes[1].right = &nodes[0];
448 	cur = nodes[1].right;
545 				prev->right = &nodes[0];
610 			node->right = found->right;
612 			found->right->parent = node;
617 				parent->right= node;
633 			if ((found + 1)->parent->right == found + 1)
634 				(found + 1)->parent->right = parent;
637 			if (cur->right == parent) {
639 					cur->right = parent->right;
641 					cur->right = parent->left;
643 					cur->right = parent - 1;
645 				cur->right->parent = cur;
647 				if (parent->right == found) {
649 				} else if (parent->right != parent - 1) {
650 					cur->left = parent->right;
657 			if ((found + 1)->right != parent)
658 				parent->right = (found + 1)->right;
660 			parent->right->parent = parent;
673 					cur->left = parent->right;
674 					parent->right->parent = cur;
680 				if (parent->right != found) {
681 					cur->right = parent->right;
682 					parent->right->parent = cur;
684 					cur->right = parent->left;
722 			ipf_rx_attach_mask(parent->right, m);
744 /* in the validity of the data found at either the left or right child.     */
758 		while ((node->parent->right == node) && (node->root == 0))
761 		for (node = node->parent->right; node->index >= 0; )
787 /* right. The context, "softr", is used here to provide a common source of  */
818 	node[1].right = &node[2];
1121 		GNAME(node[1].left), GNAME(node[1].right),
1142 	printf("R %-9.9s ", GNAME(node[1].right));
1191 		GNAME(rnh->nodes[0].left), GNAME(rnh->nodes[0].right));
1195 		GNAME(rnh->nodes[1].left), GNAME(rnh->nodes[1].right));
1199 		GNAME(rnh->nodes[2].left), GNAME(rnh->nodes[2].right));
1421 		if (rn->right->parent != rn)
1425 		if (rn->parent->left != rn && rn->parent->right != rn)