ipfilter/netinet/radix_ipf.c

143 /* Parameters:  tree(I)  - pointer to first right node in tree to search    */
158 			cur = cur->right;
394 			cur = cur->right;
403 		prev->right = &nodes[1];
408 		nodes[1].right = cur;
410 		nodes[1].right = &nodes[0];
463 	cur = nodes[1].right;
562 				prev->right = &nodes[0];
629 			node->right = found->right;
631 			found->right->parent = node;
636 				parent->right= node;
652 			if ((found + 1)->parent->right == found + 1)
653 				(found + 1)->parent->right = parent;
656 			if (cur->right == parent) {
658 					cur->right = parent->right;
660 					cur->right = parent->left;
662 					cur->right = parent - 1;
664 				cur->right->parent = cur;
666 				if (parent->right == found) {
668 				} else if (parent->right != parent - 1) {
669 					cur->left = parent->right;
676 			if ((found + 1)->right != parent)
677 				parent->right = (found + 1)->right;
679 			parent->right->parent = parent;
692 					cur->left = parent->right;
693 					parent->right->parent = cur;
699 				if (parent->right != found) {
700 					cur->right = parent->right;
701 					parent->right->parent = cur;
703 					cur->right = parent->left;
741 			ipf_rx_attach_mask(parent->right, m);
763 /* in the validity of the data found at either the left or right child.     */
780 		while ((node->parent->right == node) && (node->root == 0))
783 		for (node = node->parent->right; node->index >= 0; )
809 /* right. The context, "softr", is used here to provide a common source of  */
842 	node[1].right = &node[2];
1148 		GNAME(node[1].left), GNAME(node[1].right),
1169 	printf("R %-9.9s ", GNAME(node[1].right));
1218 		GNAME(rnh->nodes[0].left), GNAME(rnh->nodes[0].right));
1222 		GNAME(rnh->nodes[1].left), GNAME(rnh->nodes[1].right));
1226 		GNAME(rnh->nodes[2].left), GNAME(rnh->nodes[2].right));
1448 		if (rn->right->parent != rn)
1452 		if (rn->parent->left != rn && rn->parent->right != rn)