sys/net/radix.c

148 rn_search(void *v_arg, struct radix_node *head)
153 	for (x = head, v = v_arg; x->rn_bit >= 0;) {
167 rn_search_m(void *v_arg, struct radix_node *head, void *m_arg)
170 	caddr_t v = v_arg, m = m_arg;
210  * Assume host bits are cleared in @v_arg if @m_arg is not NULL
215 rn_lookup(void *v_arg, void *m_arg, struct radix_head *head)
230 		x = rn_match(v_arg, head);
241 	if ((x = rn_match(v_arg, head)) == NULL)
245 	if (LEN(x->rn_key) != LEN(v_arg) || bcmp(x->rn_key, v_arg, LEN(v_arg)))
277 rn_match(void *v_arg, struct radix_head *head)
279 	caddr_t v = v_arg;
426 rn_insert(void *v_arg, struct radix_head *head, int *dupentry,
429 	caddr_t v = v_arg;
432 	struct radix_node *t = rn_search(v_arg, top);
468 	t = rn_newpair(v_arg, b, nodes);
598 rn_addroute(void *v_arg, void *n_arg, struct radix_head *head,
601 	caddr_t v = (caddr_t)v_arg, netmask = (caddr_t)n_arg;
772 rn_delete(void *v_arg, void *netmask_arg, struct radix_head *head)
780 	v = v_arg;