ipf/dist/radix_ipf.c

258 	ipf_rdx_node_t *found;
263 	found = ipf_rx_find_addr(head->root, (u_32_t *)addr);
264 	if (found->root == 1)
273 	if (count != found->maskbitcount && found->dupkey == NULL)
277 	if ((found->addrkey[found->offset] & found->maskkey[found->offset]) !=
278 	    akey[found->offset])
281 	if (found->dupkey != NULL) {
282 		node = found;
287 		found = node;
289 	return found;
534 		 * in the listis found first. This list thus allows for
592 	ipf_rdx_node_t *found;
599 	found = ipf_rx_find_addr(head->root, (u_32_t *)addr);
600 	if (found == NULL)
602 	if (found->root == 1)
605 	parent = found->parent;
606 	if (found->dupkey != NULL) {
607 		node = found;
612 		if (node != found) {
630 			node->parent = found->parent;
631 			node->right = found->right;
632 			node->left = found->left;
633 			found->right->parent = node;
634 			found->left->parent = node;
635 			if (parent->left == found)
641 		if (count != found->maskbitcount)
649 		 * attach in place of "found".
651 		prev = found + 1;
653 		if (parent != found + 1) {
654 			if ((found + 1)->parent->right == found + 1)
655 				(found + 1)->parent->right = parent;
657 				(found + 1)->parent->left = parent;
659 				if (parent->left == found) {
668 				if (parent->right == found) {
677 			parent->left = (found + 1)->left;
678 			if ((found + 1)->right != parent)
679 				parent->right = (found + 1)->right;
682 			parent->parent = (found + 1)->parent;
689 			 * We found an edge node.
693 				if (parent->left == found) {
701 				if (parent->right != found) {
718 		if (cur->maskbitcount <= found->maskbitcount)
720 		if (((cur - 1)->addrkey[found->offset] & found->bitmask) !=
721 		    found->addrkey[found->offset])
731 	KFREE(found->mymask);
740 		if (cur == found)
742 		if (found->addrkey[cur->offset] & cur->lastmask) {
744 		} else if (parent->left != found) {
749 	return (found);
765 /* in the validity of the data found at either the left or right child.     */