176 rn_search(v_arg, head)  in rn_search()  argument
177 	void *v_arg;  in rn_search()
183 	for (x = head, v = v_arg; x->rn_bit >= 0; ) {
196 rn_search_m(v_arg, head, m_arg)  in rn_search_m()  argument
198 	void *v_arg, *m_arg;
201 	caddr_t v = v_arg, m = m_arg;
247 rn_lookup(v_arg, m_arg, head)  in rn_lookup()  argument
248 	void *v_arg, *m_arg;  in rn_lookup()
260 	x = rn_match(v_arg, head);
304 rn_match(v_arg, head)  in rn_match()  argument
305 	void *v_arg;  in rn_match()
308 	return (rn_match_args(v_arg, head, NULL, NULL));
312 rn_match_args(v_arg, head, rn_leaf_fn, rn_leaf_arg)  in rn_match_args()  argument
313 	void *v_arg;  in rn_match_args()
318 	caddr_t v = v_arg;
482 rn_insert(v_arg, head, dupentry, nodes)  in rn_insert()  argument
483 	void *v_arg;  in rn_insert()
488 	caddr_t v = v_arg;
492 	struct radix_node *t = rn_search(v_arg, top);
541 	t = rn_newpair(v_arg, b, nodes);
688 rn_addroute(v_arg, n_arg, head, treenodes)  in rn_addroute()  argument
689 	void *v_arg, *n_arg;  in rn_addroute()
693 	caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
884 rn_delete(v_arg, netmask_arg, head)  in rn_delete()  argument
885 	void *v_arg, *netmask_arg;  in rn_delete()
894 	v = v_arg;