142 rn_search(const void *v_arg, struct radix_node *head)  in rn_search()  argument
147 	for (x = head, v = v_arg; x->rn_bit >= 0;) {  in rn_search()
161 rn_search_m(const void *v_arg, struct radix_node *head, void *m_arg)  in rn_search_m()  argument
164 	c_caddr_t v = v_arg, m = m_arg;  in rn_search_m()
209 rn_lookup(const void *v_arg, const void *m_arg, struct radix_head *head)  in rn_lookup()  argument
224 		x = rn_match(v_arg, head);  in rn_lookup()
235 	if ((x = rn_match(v_arg, head)) == NULL)  in rn_lookup()
239 	if (LEN(x->rn_key) != LEN(v_arg) || bcmp(x->rn_key, v_arg, LEN(v_arg)))  in rn_lookup()
271 rn_match(const void *v_arg, struct radix_head *head)  in rn_match()  argument
273 	c_caddr_t v = v_arg;  in rn_match()
434 rn_insert(void *v_arg, struct radix_head *head, int *dupentry,  in rn_insert()  argument
437 	caddr_t v = v_arg;  in rn_insert()
440 	struct radix_node *t = rn_search(v_arg, top);  in rn_insert()
476 	t = rn_newpair(v_arg, b, nodes);   in rn_insert()
607 rn_addroute(void *v_arg, const void *n_arg, struct radix_head *head,  in rn_addroute()  argument
610 	caddr_t v = (caddr_t)v_arg, netmask = NULL;  in rn_addroute()
764 rn_delete(const void *v_arg, const void *netmask_arg, struct radix_head *head)  in rn_delete()  argument
773 	v = v_arg;  in rn_delete()