145 rn_search(void *v_arg, struct radix_node *head)  in rn_search()  argument
150 	for (x = head, v = v_arg; x->rn_bit >= 0;) {  in rn_search()
161 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()  argument
164 	caddr_t v = v_arg, m = m_arg;  in rn_search_m()
212 rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)  in rn_lookup()  argument
214 	return rn_lookup_args(v_arg, m_arg, head, NULL, NULL);  in rn_lookup()
218 rn_lookup_args(void *v_arg, void *m_arg, struct radix_node_head *head,  in rn_lookup_args()  argument
231 	x = rn_match_args(v_arg, head, f, w);  in rn_lookup_args()
271 rn_match(void *v_arg, struct radix_node_head *head)  in rn_match()  argument
273 	return rn_match_args(v_arg, head, NULL, NULL);  in rn_match()
277 rn_match_args(void *v_arg, struct radix_node_head *head,  in rn_match_args()  argument
280 	caddr_t v = v_arg;  in rn_match_args()
437 rn_insert(void *v_arg, struct radix_node_head *head, int *dupentry,  in rn_insert()  argument
440 	caddr_t v = v_arg;  in rn_insert()
443 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
486 		t = rn_newpair(v_arg, b, nodes);  in rn_insert()
631 rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,  in rn_addroute()  argument
634 	caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;  in rn_addroute()
801 rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head)  in rn_delete()  argument
809 	v = v_arg;  in rn_delete()