bsd/net/route.c

863 	struct radix_node_head *rnh = rt_tables[dst->sa_family];
869 	if (rnh == NULL)
876 	rt = rt_lookup(FALSE, dst, NULL, rnh, ifscope);
976 	struct radix_node_head *rnh;
1030 	 * Note: in the case of igmp packets, there might not be an rnh
1032 	rnh = rt_tables[rt_key(rt)->sa_family];
1042 	if (rnh != NULL && rnh->rnh_close != NULL)
1043 		rnh->rnh_close((struct radix_node *)rt, rnh);
1556 	struct radix_node_head *rnh;
1604 	struct radix_node_head *rnh;
1618 	if ((rnh = rt_tables[af]) == NULL)
1679 		if ((rn = rnh->rnh_deladdr(dst, netmask, rnh)) == NULL)
1718 			rnh->rnh_walktree_from(rnh, dst, rt_mask(rt),
1907 		 * This moved from below so that rnh->rnh_addaddr() can
1915 		rn = rnh->rnh_addaddr((caddr_t)ndst, (caddr_t)netmask,
1916 					rnh, rt->rt_nodes);
1942 				rn = rnh->rnh_addaddr((caddr_t)ndst,
1944 						      rnh, rt->rt_nodes);
2046 			arg.rnh = rnh;
2049 			rnh->rnh_walktree_from(rnh, rt_key(rt), rt_mask(rt),
2095  * rnh->rnh_walktree_from() above, and those that actually are children of
2141 	struct radix_node_head *rnh = ap->rnh;
2180 		for (i = rnh->rnh_treetop->rn_offset; i < mlen; i++) {
2188 	for (i = rnh->rnh_treetop->rn_offset; i < len; i++) {
2231 	struct radix_node_head *rnh = rt_tables[dst->sa_family];
2466 		arg.rnh = rnh;
2469 		rnh->rnh_walktree_from(rnh, rt_key(rt), rt_mask(rt),
2563 	struct radix_node_head *rnh;
2574 	rnh = rt_tables[af];
2589 	rn = rnh->rnh_lookup_args(dst, netmask, rnh, f, w);
2602 	struct radix_node_head *rnh;
2605 	rnh = rt_tables[af];
2607 	return (af == AF_INET ? rnh->rnh_lookup(&sin_def, NULL, rnh) :
2608 	    rnh->rnh_lookup(&sin6_def, NULL, rnh));
2636     struct radix_node_head *rnh, unsigned int ifscope)
2658 		rn = rnh->rnh_matchaddr(dst, rnh);
3079 		struct radix_node_head *rnh = rt_tables[rt_key(rt)->sa_family];
3087 		if (rnh != NULL && rt_mask(rt)) {
3088 			rnh->rnh_walktree_from(rnh, rt_key(rt), rt_mask(rt),