180 rn_search(void *v_arg, struct radix_node *head)  in rn_search()  argument
185 	for (x = head, v = v_arg; x->rn_bit >= 0;) {  in rn_search()
200 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()  argument
203 	register caddr_t v = v_arg, m = m_arg;  in rn_search_m()
272 rn_insert(void *v_arg, struct radix_node_head *head, int *dupentry,  in rn_insert()  argument
275 	uint8 *v = v_arg;  in rn_insert()
278 	register struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
314 		t = rn_newpair(v_arg, b, nodes);   in rn_insert()
487 rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)  in rn_lookup()  argument
498 	x = rn_match(v_arg, head);  in rn_lookup()
508 rn_match(void *v_arg, struct radix_node_head *head)  in rn_match()  argument
510 	caddr_t v = v_arg;  in rn_match()
694 rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,  in rn_addroute()  argument
697 	uint8 *v = (uint8 *)v_arg, *netmask = (uint8 *)n_arg;  in rn_addroute()
846 rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head)  in rn_delete()  argument
854 	v = v_arg;  in rn_delete()