v_arg             108 net/radix.c    rn_search(void *v_arg, struct radix_node *head)
v_arg             113 net/radix.c    	for (x = head, v = v_arg; x->rn_b >= 0;) {
v_arg             123 net/radix.c    rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
v_arg             126 net/radix.c    	caddr_t v = v_arg, m = m_arg;
v_arg             165 net/radix.c    rn_lookup(void *v_arg, void *m_arg, struct radix_node_head *head)
v_arg             175 net/radix.c    	x = rn_match(v_arg, head);
v_arg             202 net/radix.c    rn_match(void *v_arg, struct radix_node_head *head)
v_arg             204 net/radix.c    	caddr_t v = v_arg;
v_arg             331 net/radix.c    rn_insert(void *v_arg, struct radix_node_head *head,
v_arg             334 net/radix.c    	caddr_t v = v_arg;
v_arg             337 net/radix.c    	struct radix_node *t = rn_search(v_arg, top);
v_arg             374 net/radix.c    	t = rn_newpair(v_arg, b, nodes);
v_arg             505 net/radix.c    rn_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
v_arg             508 net/radix.c    	caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
v_arg             685 net/radix.c    rn_delete(void *v_arg, void *netmask_arg, struct radix_node_head *head,
v_arg             697 net/radix.c    	v = v_arg;