ipf/dist/radix_ipf.c

145 /* Parameters:  tree(I)  - pointer to first right node in tree to search    */
160 			cur = cur->right;
396 			cur = cur->right;
405 		prev->right = &nodes[1];
410 		nodes[1].right = cur;
412 		nodes[1].right = &nodes[0];
465 	cur = nodes[1].right;
564 				prev->right = &nodes[0];
631 			node->right = found->right;
633 			found->right->parent = node;
638 				parent->right= node;
654 			if ((found + 1)->parent->right == found + 1)
655 				(found + 1)->parent->right = parent;
658 			if (cur->right == parent) {
660 					cur->right = parent->right;
662 					cur->right = parent->left;
664 					cur->right = parent - 1;
666 				cur->right->parent = cur;
668 				if (parent->right == found) {
670 				} else if (parent->right != parent - 1) {
671 					cur->left = parent->right;
678 			if ((found + 1)->right != parent)
679 				parent->right = (found + 1)->right;
681 			parent->right->parent = parent;
694 					cur->left = parent->right;
695 					parent->right->parent = cur;
701 				if (parent->right != found) {
702 					cur->right = parent->right;
703 					parent->right->parent = cur;
705 					cur->right = parent->left;
743 			ipf_rx_attach_mask(parent->right, m);
765 /* in the validity of the data found at either the left or right child.     */
782 		while ((node->parent->right == node) && (node->root == 0))
785 		for (node = node->parent->right; node->index >= 0; )
811 /* right. The context, "softr", is used here to provide a common source of  */
844 	node[1].right = &node[2];
1150 		GNAME(node[1].left), GNAME(node[1].right),
1171 	printf("R %-9.9s ", GNAME(node[1].right));
1220 		GNAME(rnh->nodes[0].left), GNAME(rnh->nodes[0].right));
1224 		GNAME(rnh->nodes[1].left), GNAME(rnh->nodes[1].right));
1228 		GNAME(rnh->nodes[2].left), GNAME(rnh->nodes[2].right));
1450 		if (rn->right->parent != rn)
1454 		if (rn->parent->left != rn && rn->parent->right != rn)