ipf/netinet/radix_ipf.c

246 	ipf_rdx_node_t *found;
251 	found = ipf_rx_find_addr(head->root, (u_32_t *)addr);
252 	if (found->root == 1)
261 	if (count != found->maskbitcount && found->dupkey == NULL)
265 	if ((found->addrkey[found->offset] & found->maskkey[found->offset]) !=
266 	    akey[found->offset])
269 	if (found->dupkey != NULL) {
270 		node = found;
275 		found = node;
277 	return found;
515 		 * in the listis found first. This list thus allows for
571 	ipf_rdx_node_t *found;
578 	found = ipf_rx_find_addr(head->root, (u_32_t *)addr);
579 	if (found == NULL)
581 	if (found->root == 1)
584 	parent = found->parent;
585 	if (found->dupkey != NULL) {
586 		node = found;
591 		if (node != found) {
609 			node->parent = found->parent;
610 			node->right = found->right;
611 			node->left = found->left;
612 			found->right->parent = node;
613 			found->left->parent = node;
614 			if (parent->left == found)
620 		if (count != found->maskbitcount)
628 		 * attach in place of "found".
630 		prev = found + 1;
632 		if (parent != found + 1) {
633 			if ((found + 1)->parent->right == found + 1)
634 				(found + 1)->parent->right = parent;
636 				(found + 1)->parent->left = parent;
638 				if (parent->left == found) {
647 				if (parent->right == found) {
656 			parent->left = (found + 1)->left;
657 			if ((found + 1)->right != parent)
658 				parent->right = (found + 1)->right;
661 			parent->parent = (found + 1)->parent;
668 			 * We found an edge node.
672 				if (parent->left == found) {
680 				if (parent->right != found) {
697 		if (cur->maskbitcount <= found->maskbitcount)
699 		if (((cur - 1)->addrkey[found->offset] & found->bitmask) !=
700 		    found->addrkey[found->offset])
710 	KFREE(found->mymask);
719 		if (cur == found)
721 		if (found->addrkey[cur->offset] & cur->lastmask) {
723 		} else if (parent->left != found) {
728 	return (found);
744 /* in the validity of the data found at either the left or right child.     */