2 * Copyright (c) 2004, 2005 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of The DragonFly Project nor the names of its
16 * contributors may be used to endorse or promote products derived
17 * from this software without specific, prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
23 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
25 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
27 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
28 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
29 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * Copyright (c) 1980, 1986, 1991, 1993
35 * The Regents of the University of California. All rights reserved.
37 * Redistribution and use in source and binary forms, with or without
38 * modification, are permitted provided that the following conditions
40 * 1. Redistributions of source code must retain the above copyright
41 * notice, this list of conditions and the following disclaimer.
42 * 2. Redistributions in binary form must reproduce the above copyright
43 * notice, this list of conditions and the following disclaimer in the
44 * documentation and/or other materials provided with the distribution.
45 * 3. All advertising materials mentioning features or use of this software
46 * must display the following acknowledgement:
47 * This product includes software developed by the University of
48 * California, Berkeley and its contributors.
49 * 4. Neither the name of the University nor the names of its contributors
50 * may be used to endorse or promote products derived from this software
51 * without specific prior written permission.
53 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
54 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
55 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
56 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
57 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
58 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
59 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
60 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
61 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
62 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
65 * @(#)route.c 8.3 (Berkeley) 1/9/95
66 * $FreeBSD: src/sys/net/route.c,v 1.59.2.10 2003/01/17 08:04:00 ru Exp $
67 * $DragonFly: src/sys/net/route.c,v 1.41 2008/11/09 10:50:15 sephe Exp $
73 #include <sys/param.h>
74 #include <sys/systm.h>
75 #include <sys/malloc.h>
77 #include <sys/socket.h>
78 #include <sys/domain.h>
79 #include <sys/kernel.h>
80 #include <sys/sysctl.h>
81 #include <sys/globaldata.h>
82 #include <sys/thread.h>
85 #include <net/route.h>
86 #include <net/netisr.h>
88 #include <netinet/in.h>
89 #include <net/ip_mroute/ip_mroute.h>
91 #include <sys/thread2.h>
92 #include <sys/msgport2.h>
93 #include <net/netmsg2.h>
96 #include <netproto/mpls/mpls.h>
99 static struct rtstatistics rtstatistics_percpu
[MAXCPU
];
101 #define rtstat rtstatistics_percpu[mycpuid]
103 #define rtstat rtstatistics_percpu[0]
106 struct radix_node_head
*rt_tables
[MAXCPU
][AF_MAX
+1];
107 struct lwkt_port
*rt_ports
[MAXCPU
];
109 static void rt_maskedcopy (struct sockaddr
*, struct sockaddr
*,
111 static void rtable_init(void);
112 static void rtable_service_loop(void *dummy
);
113 static void rtinit_rtrequest_callback(int, int, struct rt_addrinfo
*,
114 struct rtentry
*, void *);
117 static void rtredirect_msghandler(struct netmsg
*netmsg
);
118 static void rtrequest1_msghandler(struct netmsg
*netmsg
);
121 static int rt_setshims(struct rtentry
*, struct sockaddr
**);
123 SYSCTL_NODE(_net
, OID_AUTO
, route
, CTLFLAG_RW
, 0, "Routing");
126 static int route_debug
= 1;
127 SYSCTL_INT(_net_route
, OID_AUTO
, route_debug
, CTLFLAG_RW
,
128 &route_debug
, 0, "");
131 int route_assert_owner_access
= 0;
132 SYSCTL_INT(_net_route
, OID_AUTO
, assert_owner_access
, CTLFLAG_RW
,
133 &route_assert_owner_access
, 0, "");
134 SYSCTL_INT(_net_route
, OID_AUTO
, remote_free_panic
, CTLFLAG_RW
,
135 &route_assert_owner_access
, 0, ""); /* alias */
136 extern void db_print_backtrace(void);
139 * Initialize the route table(s) for protocol domains and
140 * create a helper thread which will be responsible for updating
141 * route table entries on each cpu.
149 for (cpu
= 0; cpu
< ncpus
; ++cpu
)
150 bzero(&rtstatistics_percpu
[cpu
], sizeof(struct rtstatistics
));
151 rn_init(); /* initialize all zeroes, all ones, mask table */
152 rtable_init(); /* call dom_rtattach() on each cpu */
154 for (cpu
= 0; cpu
< ncpus
; cpu
++) {
155 lwkt_create(rtable_service_loop
, NULL
, &rtd
, NULL
,
156 0, cpu
, "rtable_cpu %d", cpu
);
157 rt_ports
[cpu
] = &rtd
->td_msgport
;
162 rtable_init_oncpu(struct netmsg
*nmsg
)
167 SLIST_FOREACH(dom
, &domains
, dom_next
) {
168 if (dom
->dom_rtattach
) {
170 (void **)&rt_tables
[cpu
][dom
->dom_family
],
174 ifnet_forwardmsg(&nmsg
->nm_lmsg
, cpu
+ 1);
182 netmsg_init(&nmsg
, &curthread
->td_msgport
, 0, rtable_init_oncpu
);
183 ifnet_domsg(&nmsg
.nm_lmsg
, 0);
187 * Our per-cpu table management protocol thread. All route table operations
188 * are sequentially chained through all cpus starting at cpu #0 in order to
189 * maintain duplicate route tables on each cpu. Having a spearate route
190 * table management thread allows the protocol and interrupt threads to
191 * issue route table changes.
194 rtable_service_loop(void *dummy __unused
)
196 struct netmsg
*netmsg
;
197 thread_t td
= curthread
;
199 while ((netmsg
= lwkt_waitport(&td
->td_msgport
, 0)) != NULL
) {
200 netmsg
->nm_dispatch(netmsg
);
205 * Routing statistics.
209 sysctl_rtstatistics(SYSCTL_HANDLER_ARGS
)
213 for (cpu
= 0; cpu
< ncpus
; ++cpu
) {
214 if ((error
= SYSCTL_OUT(req
, &rtstatistics_percpu
[cpu
],
215 sizeof(struct rtstatistics
))))
217 if ((error
= SYSCTL_IN(req
, &rtstatistics_percpu
[cpu
],
218 sizeof(struct rtstatistics
))))
224 SYSCTL_PROC(_net_route
, OID_AUTO
, stats
, (CTLTYPE_OPAQUE
|CTLFLAG_RW
),
225 0, 0, sysctl_rtstatistics
, "S,rtstatistics", "Routing statistics");
227 SYSCTL_STRUCT(_net_route
, OID_AUTO
, stats
, CTLFLAG_RW
, &rtstat
, rtstatistics
,
228 "Routing statistics");
232 * Packet routing routines.
236 * Look up and fill in the "ro_rt" rtentry field in a route structure given
237 * an address in the "ro_dst" field. Always send a report on a miss and
238 * always clone routes.
241 rtalloc(struct route
*ro
)
243 rtalloc_ign(ro
, 0UL);
247 * Look up and fill in the "ro_rt" rtentry field in a route structure given
248 * an address in the "ro_dst" field. Always send a report on a miss and
249 * optionally clone routes when RTF_CLONING or RTF_PRCLONING are not being
253 rtalloc_ign(struct route
*ro
, u_long ignoreflags
)
255 if (ro
->ro_rt
!= NULL
) {
256 if (ro
->ro_rt
->rt_ifp
!= NULL
&& ro
->ro_rt
->rt_flags
& RTF_UP
)
261 ro
->ro_rt
= _rtlookup(&ro
->ro_dst
, RTL_REPORTMSG
, ignoreflags
);
265 * Look up the route that matches the given "dst" address.
267 * Route lookup can have the side-effect of creating and returning
268 * a cloned route instead when "dst" matches a cloning route and the
269 * RTF_CLONING and RTF_PRCLONING flags are not being ignored.
271 * Any route returned has its reference count incremented.
274 _rtlookup(struct sockaddr
*dst
, boolean_t generate_report
, u_long ignore
)
276 struct radix_node_head
*rnh
= rt_tables
[mycpuid
][dst
->sa_family
];
283 * Look up route in the radix tree.
285 rt
= (struct rtentry
*) rnh
->rnh_matchaddr((char *)dst
, rnh
);
290 * Handle cloning routes.
292 if ((rt
->rt_flags
& ~ignore
& (RTF_CLONING
| RTF_PRCLONING
)) != 0) {
293 struct rtentry
*clonedroute
;
296 clonedroute
= rt
; /* copy in/copy out parameter */
297 error
= rtrequest(RTM_RESOLVE
, dst
, NULL
, NULL
, 0,
298 &clonedroute
); /* clone the route */
299 if (error
!= 0) { /* cloning failed */
301 rt_dstmsg(RTM_MISS
, dst
, error
);
303 return (rt
); /* return the uncloned route */
305 if (generate_report
) {
306 if (clonedroute
->rt_flags
& RTF_XRESOLVE
)
307 rt_dstmsg(RTM_RESOLVE
, dst
, 0);
309 rt_rtmsg(RTM_ADD
, clonedroute
,
310 clonedroute
->rt_ifp
, 0);
312 return (clonedroute
); /* return cloned route */
316 * Increment the reference count of the matched route and return.
322 rtstat
.rts_unreach
++;
324 rt_dstmsg(RTM_MISS
, dst
, 0);
329 rtfree(struct rtentry
*rt
)
331 if (rt
->rt_cpuid
== mycpuid
)
334 rtfree_remote(rt
, 1);
338 rtfree_oncpu(struct rtentry
*rt
)
340 KKASSERT(rt
->rt_cpuid
== mycpuid
);
341 KASSERT(rt
->rt_refcnt
> 0, ("rtfree: rt_refcnt %ld", rt
->rt_refcnt
));
344 if (rt
->rt_refcnt
== 0) {
345 struct radix_node_head
*rnh
=
346 rt_tables
[mycpuid
][rt_key(rt
)->sa_family
];
349 rnh
->rnh_close((struct radix_node
*)rt
, rnh
);
350 if (!(rt
->rt_flags
& RTF_UP
)) {
351 /* deallocate route */
352 if (rt
->rt_ifa
!= NULL
)
354 if (rt
->rt_parent
!= NULL
)
355 RTFREE(rt
->rt_parent
); /* recursive call! */
363 rtfree_remote_dispatch(struct netmsg
*nmsg
)
365 struct lwkt_msg
*lmsg
= &nmsg
->nm_lmsg
;
366 struct rtentry
*rt
= lmsg
->u
.ms_resultp
;
369 lwkt_replymsg(lmsg
, 0);
373 rtfree_remote(struct rtentry
*rt
, int allow_panic
)
376 struct lwkt_msg
*lmsg
;
378 KKASSERT(rt
->rt_cpuid
!= mycpuid
);
380 if (route_assert_owner_access
&& allow_panic
) {
381 panic("rt remote free rt_cpuid %d, mycpuid %d\n",
382 rt
->rt_cpuid
, mycpuid
);
384 kprintf("rt remote free rt_cpuid %d, mycpuid %d\n",
385 rt
->rt_cpuid
, mycpuid
);
386 db_print_backtrace();
389 netmsg_init(&nmsg
, &curthread
->td_msgport
, 0, rtfree_remote_dispatch
);
390 lmsg
= &nmsg
.nm_lmsg
;
391 lmsg
->u
.ms_resultp
= rt
;
393 lwkt_domsg(rtable_portfn(rt
->rt_cpuid
), lmsg
, 0);
397 rtredirect_oncpu(struct sockaddr
*dst
, struct sockaddr
*gateway
,
398 struct sockaddr
*netmask
, int flags
, struct sockaddr
*src
)
400 struct rtentry
*rt
= NULL
;
401 struct rt_addrinfo rtinfo
;
406 /* verify the gateway is directly reachable */
407 if ((ifa
= ifa_ifwithnet(gateway
)) == NULL
) {
413 * If the redirect isn't from our current router for this destination,
414 * it's either old or wrong.
416 if (!(flags
& RTF_DONE
) && /* XXX JH */
417 (rt
= rtpurelookup(dst
)) != NULL
&&
418 (!sa_equal(src
, rt
->rt_gateway
) || rt
->rt_ifa
!= ifa
)) {
424 * If it redirects us to ourselves, we have a routing loop,
425 * perhaps as a result of an interface going down recently.
427 if (ifa_ifwithaddr(gateway
)) {
428 error
= EHOSTUNREACH
;
433 * Create a new entry if the lookup failed or if we got back
434 * a wildcard entry for the default route. This is necessary
435 * for hosts which use routing redirects generated by smart
436 * gateways to dynamically build the routing tables.
440 if ((rt_mask(rt
) != NULL
&& rt_mask(rt
)->sa_len
< 2)) {
445 /* Ignore redirects for directly connected hosts. */
446 if (!(rt
->rt_flags
& RTF_GATEWAY
)) {
447 error
= EHOSTUNREACH
;
451 if (!(rt
->rt_flags
& RTF_HOST
) && (flags
& RTF_HOST
)) {
453 * Changing from a network route to a host route.
454 * Create a new host route rather than smashing the
458 flags
|= RTF_GATEWAY
| RTF_DYNAMIC
;
459 bzero(&rtinfo
, sizeof(struct rt_addrinfo
));
460 rtinfo
.rti_info
[RTAX_DST
] = dst
;
461 rtinfo
.rti_info
[RTAX_GATEWAY
] = gateway
;
462 rtinfo
.rti_info
[RTAX_NETMASK
] = netmask
;
463 rtinfo
.rti_flags
= flags
;
464 rtinfo
.rti_ifa
= ifa
;
465 rt
= NULL
; /* copy-in/copy-out parameter */
466 error
= rtrequest1(RTM_ADD
, &rtinfo
, &rt
);
468 flags
= rt
->rt_flags
;
469 stat
= &rtstat
.rts_dynamic
;
472 * Smash the current notion of the gateway to this destination.
473 * Should check about netmask!!!
475 rt
->rt_flags
|= RTF_MODIFIED
;
476 flags
|= RTF_MODIFIED
;
477 rt_setgate(rt
, rt_key(rt
), gateway
);
479 stat
= &rtstat
.rts_newgateway
;
487 rtstat
.rts_badredirect
++;
488 else if (stat
!= NULL
)
496 struct netmsg_rtredirect
{
497 struct netmsg netmsg
;
498 struct sockaddr
*dst
;
499 struct sockaddr
*gateway
;
500 struct sockaddr
*netmask
;
502 struct sockaddr
*src
;
508 * Force a routing table entry to the specified
509 * destination to go through the given gateway.
510 * Normally called as a result of a routing redirect
511 * message from the network layer.
513 * N.B.: must be called at splnet
516 rtredirect(struct sockaddr
*dst
, struct sockaddr
*gateway
,
517 struct sockaddr
*netmask
, int flags
, struct sockaddr
*src
)
519 struct rt_addrinfo rtinfo
;
522 struct netmsg_rtredirect msg
;
524 netmsg_init(&msg
.netmsg
, &curthread
->td_msgport
, 0,
525 rtredirect_msghandler
);
527 msg
.gateway
= gateway
;
528 msg
.netmask
= netmask
;
531 error
= lwkt_domsg(rtable_portfn(0), &msg
.netmsg
.nm_lmsg
, 0);
533 error
= rtredirect_oncpu(dst
, gateway
, netmask
, flags
, src
);
535 bzero(&rtinfo
, sizeof(struct rt_addrinfo
));
536 rtinfo
.rti_info
[RTAX_DST
] = dst
;
537 rtinfo
.rti_info
[RTAX_GATEWAY
] = gateway
;
538 rtinfo
.rti_info
[RTAX_NETMASK
] = netmask
;
539 rtinfo
.rti_info
[RTAX_AUTHOR
] = src
;
540 rt_missmsg(RTM_REDIRECT
, &rtinfo
, flags
, error
);
546 rtredirect_msghandler(struct netmsg
*netmsg
)
548 struct netmsg_rtredirect
*msg
= (void *)netmsg
;
551 rtredirect_oncpu(msg
->dst
, msg
->gateway
, msg
->netmask
,
552 msg
->flags
, msg
->src
);
553 nextcpu
= mycpuid
+ 1;
555 lwkt_forwardmsg(rtable_portfn(nextcpu
), &netmsg
->nm_lmsg
);
557 lwkt_replymsg(&netmsg
->nm_lmsg
, 0);
563 * Routing table ioctl interface.
566 rtioctl(u_long req
, caddr_t data
, struct ucred
*cred
)
569 /* Multicast goop, grrr... */
570 return mrt_ioctl
? mrt_ioctl(req
, data
) : EOPNOTSUPP
;
577 ifa_ifwithroute(int flags
, struct sockaddr
*dst
, struct sockaddr
*gateway
)
581 if (!(flags
& RTF_GATEWAY
)) {
583 * If we are adding a route to an interface,
584 * and the interface is a point-to-point link,
585 * we should search for the destination
586 * as our clue to the interface. Otherwise
587 * we can use the local address.
590 if (flags
& RTF_HOST
) {
591 ifa
= ifa_ifwithdstaddr(dst
);
594 ifa
= ifa_ifwithaddr(gateway
);
597 * If we are adding a route to a remote net
598 * or host, the gateway may still be on the
599 * other end of a pt to pt link.
601 ifa
= ifa_ifwithdstaddr(gateway
);
604 ifa
= ifa_ifwithnet(gateway
);
608 rt
= rtpurelookup(gateway
);
612 if ((ifa
= rt
->rt_ifa
) == NULL
)
615 if (ifa
->ifa_addr
->sa_family
!= dst
->sa_family
) {
616 struct ifaddr
*oldifa
= ifa
;
618 ifa
= ifaof_ifpforaddr(dst
, ifa
->ifa_ifp
);
625 static int rt_fixdelete (struct radix_node
*, void *);
626 static int rt_fixchange (struct radix_node
*, void *);
630 struct radix_node_head
*rnh
;
634 * Set rtinfo->rti_ifa and rtinfo->rti_ifp.
637 rt_getifa(struct rt_addrinfo
*rtinfo
)
639 struct sockaddr
*gateway
= rtinfo
->rti_info
[RTAX_GATEWAY
];
640 struct sockaddr
*dst
= rtinfo
->rti_info
[RTAX_DST
];
641 struct sockaddr
*ifaaddr
= rtinfo
->rti_info
[RTAX_IFA
];
642 int flags
= rtinfo
->rti_flags
;
645 * ifp may be specified by sockaddr_dl
646 * when protocol address is ambiguous.
648 if (rtinfo
->rti_ifp
== NULL
) {
649 struct sockaddr
*ifpaddr
;
651 ifpaddr
= rtinfo
->rti_info
[RTAX_IFP
];
652 if (ifpaddr
!= NULL
&& ifpaddr
->sa_family
== AF_LINK
) {
655 ifa
= ifa_ifwithnet(ifpaddr
);
657 rtinfo
->rti_ifp
= ifa
->ifa_ifp
;
661 if (rtinfo
->rti_ifa
== NULL
&& ifaaddr
!= NULL
)
662 rtinfo
->rti_ifa
= ifa_ifwithaddr(ifaaddr
);
663 if (rtinfo
->rti_ifa
== NULL
) {
666 sa
= ifaaddr
!= NULL
? ifaaddr
:
667 (gateway
!= NULL
? gateway
: dst
);
668 if (sa
!= NULL
&& rtinfo
->rti_ifp
!= NULL
)
669 rtinfo
->rti_ifa
= ifaof_ifpforaddr(sa
, rtinfo
->rti_ifp
);
670 else if (dst
!= NULL
&& gateway
!= NULL
)
671 rtinfo
->rti_ifa
= ifa_ifwithroute(flags
, dst
, gateway
);
673 rtinfo
->rti_ifa
= ifa_ifwithroute(flags
, sa
, sa
);
675 if (rtinfo
->rti_ifa
== NULL
)
676 return (ENETUNREACH
);
678 if (rtinfo
->rti_ifp
== NULL
)
679 rtinfo
->rti_ifp
= rtinfo
->rti_ifa
->ifa_ifp
;
684 * Do appropriate manipulations of a routing tree given
685 * all the bits of info needed
690 struct sockaddr
*dst
,
691 struct sockaddr
*gateway
,
692 struct sockaddr
*netmask
,
694 struct rtentry
**ret_nrt
)
696 struct rt_addrinfo rtinfo
;
698 bzero(&rtinfo
, sizeof(struct rt_addrinfo
));
699 rtinfo
.rti_info
[RTAX_DST
] = dst
;
700 rtinfo
.rti_info
[RTAX_GATEWAY
] = gateway
;
701 rtinfo
.rti_info
[RTAX_NETMASK
] = netmask
;
702 rtinfo
.rti_flags
= flags
;
703 return rtrequest1(req
, &rtinfo
, ret_nrt
);
709 struct sockaddr
*dst
,
710 struct sockaddr
*gateway
,
711 struct sockaddr
*netmask
,
714 struct rt_addrinfo rtinfo
;
716 bzero(&rtinfo
, sizeof(struct rt_addrinfo
));
717 rtinfo
.rti_info
[RTAX_DST
] = dst
;
718 rtinfo
.rti_info
[RTAX_GATEWAY
] = gateway
;
719 rtinfo
.rti_info
[RTAX_NETMASK
] = netmask
;
720 rtinfo
.rti_flags
= flags
;
721 return rtrequest1_global(req
, &rtinfo
, NULL
, NULL
);
727 struct netmsg netmsg
;
729 struct rt_addrinfo
*rtinfo
;
730 rtrequest1_callback_func_t callback
;
737 rtrequest1_global(int req
, struct rt_addrinfo
*rtinfo
,
738 rtrequest1_callback_func_t callback
, void *arg
)
742 struct netmsg_rtq msg
;
744 netmsg_init(&msg
.netmsg
, &curthread
->td_msgport
, 0,
745 rtrequest1_msghandler
);
746 msg
.netmsg
.nm_lmsg
.ms_error
= -1;
749 msg
.callback
= callback
;
751 error
= lwkt_domsg(rtable_portfn(0), &msg
.netmsg
.nm_lmsg
, 0);
753 struct rtentry
*rt
= NULL
;
755 error
= rtrequest1(req
, rtinfo
, &rt
);
759 callback(req
, error
, rtinfo
, rt
, arg
);
765 * Handle a route table request on the current cpu. Since the route table's
766 * are supposed to be identical on each cpu, an error occuring later in the
767 * message chain is considered system-fatal.
772 rtrequest1_msghandler(struct netmsg
*netmsg
)
774 struct netmsg_rtq
*msg
= (void *)netmsg
;
775 struct rtentry
*rt
= NULL
;
779 error
= rtrequest1(msg
->req
, msg
->rtinfo
, &rt
);
783 msg
->callback(msg
->req
, error
, msg
->rtinfo
, rt
, msg
->arg
);
786 * RTM_DELETE's are propogated even if an error occurs, since a
787 * cloned route might be undergoing deletion and cloned routes
788 * are not necessarily replicated. An overall error is returned
789 * only if no cpus have the route in question.
791 if (msg
->netmsg
.nm_lmsg
.ms_error
< 0 || error
== 0)
792 msg
->netmsg
.nm_lmsg
.ms_error
= error
;
794 nextcpu
= mycpuid
+ 1;
795 if (error
&& msg
->req
!= RTM_DELETE
) {
797 panic("rtrequest1_msghandler: rtrequest table "
798 "error was not on cpu #0: %p", msg
->rtinfo
);
800 lwkt_replymsg(&msg
->netmsg
.nm_lmsg
, error
);
801 } else if (nextcpu
< ncpus
) {
802 lwkt_forwardmsg(rtable_portfn(nextcpu
), &msg
->netmsg
.nm_lmsg
);
804 lwkt_replymsg(&msg
->netmsg
.nm_lmsg
,
805 msg
->netmsg
.nm_lmsg
.ms_error
);
812 rtrequest1(int req
, struct rt_addrinfo
*rtinfo
, struct rtentry
**ret_nrt
)
814 struct sockaddr
*dst
= rtinfo
->rti_info
[RTAX_DST
];
816 struct radix_node
*rn
;
817 struct radix_node_head
*rnh
;
819 struct sockaddr
*ndst
;
822 #define gotoerr(x) { error = x ; goto bad; }
826 rt_addrinfo_print(req
, rtinfo
);
831 * Find the correct routing tree to use for this Address Family
833 if ((rnh
= rt_tables
[mycpuid
][dst
->sa_family
]) == NULL
)
834 gotoerr(EAFNOSUPPORT
);
837 * If we are adding a host route then we don't want to put
838 * a netmask in the tree, nor do we want to clone it.
840 if (rtinfo
->rti_flags
& RTF_HOST
) {
841 rtinfo
->rti_info
[RTAX_NETMASK
] = NULL
;
842 rtinfo
->rti_flags
&= ~(RTF_CLONING
| RTF_PRCLONING
);
847 /* Remove the item from the tree. */
848 rn
= rnh
->rnh_deladdr((char *)rtinfo
->rti_info
[RTAX_DST
],
849 (char *)rtinfo
->rti_info
[RTAX_NETMASK
],
853 KASSERT(!(rn
->rn_flags
& (RNF_ACTIVE
| RNF_ROOT
)),
854 ("rnh_deladdr returned flags 0x%x", rn
->rn_flags
));
855 rt
= (struct rtentry
*)rn
;
857 /* ref to prevent a deletion race */
860 /* Free any routes cloned from this one. */
861 if ((rt
->rt_flags
& (RTF_CLONING
| RTF_PRCLONING
)) &&
862 rt_mask(rt
) != NULL
) {
863 rnh
->rnh_walktree_from(rnh
, (char *)rt_key(rt
),
868 if (rt
->rt_gwroute
!= NULL
) {
869 RTFREE(rt
->rt_gwroute
);
870 rt
->rt_gwroute
= NULL
;
874 * NB: RTF_UP must be set during the search above,
875 * because we might delete the last ref, causing
876 * rt to get freed prematurely.
878 rt
->rt_flags
&= ~RTF_UP
;
882 rt_print(rtinfo
, rt
);
885 /* Give the protocol a chance to keep things in sync. */
886 if ((ifa
= rt
->rt_ifa
) && ifa
->ifa_rtrequest
)
887 ifa
->ifa_rtrequest(RTM_DELETE
, rt
, rtinfo
);
890 * If the caller wants it, then it can have it,
891 * but it's up to it to free the rtentry as we won't be
894 KASSERT(rt
->rt_refcnt
>= 0,
895 ("rtrequest1(DELETE): refcnt %ld", rt
->rt_refcnt
));
896 if (ret_nrt
!= NULL
) {
897 /* leave ref intact for return */
900 /* deref / attempt to destroy */
906 if (ret_nrt
== NULL
|| (rt
= *ret_nrt
) == NULL
)
910 rt
->rt_flags
& ~(RTF_CLONING
| RTF_PRCLONING
| RTF_STATIC
);
911 rtinfo
->rti_flags
|= RTF_WASCLONED
;
912 rtinfo
->rti_info
[RTAX_GATEWAY
] = rt
->rt_gateway
;
913 if ((rtinfo
->rti_info
[RTAX_NETMASK
] = rt
->rt_genmask
) == NULL
)
914 rtinfo
->rti_flags
|= RTF_HOST
;
915 rtinfo
->rti_info
[RTAX_MPLS1
] = rt
->rt_shim
[0];
916 rtinfo
->rti_info
[RTAX_MPLS2
] = rt
->rt_shim
[1];
917 rtinfo
->rti_info
[RTAX_MPLS3
] = rt
->rt_shim
[2];
921 KASSERT(!(rtinfo
->rti_flags
& RTF_GATEWAY
) ||
922 rtinfo
->rti_info
[RTAX_GATEWAY
] != NULL
,
923 ("rtrequest: GATEWAY but no gateway"));
925 if (rtinfo
->rti_ifa
== NULL
&& (error
= rt_getifa(rtinfo
)))
927 ifa
= rtinfo
->rti_ifa
;
929 R_Malloc(rt
, struct rtentry
*, sizeof(struct rtentry
));
932 bzero(rt
, sizeof(struct rtentry
));
933 rt
->rt_flags
= RTF_UP
| rtinfo
->rti_flags
;
934 rt
->rt_cpuid
= mycpuid
;
935 error
= rt_setgate(rt
, dst
, rtinfo
->rti_info
[RTAX_GATEWAY
]);
942 if (rtinfo
->rti_info
[RTAX_NETMASK
] != NULL
)
943 rt_maskedcopy(dst
, ndst
,
944 rtinfo
->rti_info
[RTAX_NETMASK
]);
946 bcopy(dst
, ndst
, dst
->sa_len
);
948 if (rtinfo
->rti_info
[RTAX_MPLS1
] != NULL
)
949 rt_setshims(rt
, rtinfo
->rti_info
);
952 * Note that we now have a reference to the ifa.
953 * This moved from below so that rnh->rnh_addaddr() can
954 * examine the ifa and ifa->ifa_ifp if it so desires.
958 rt
->rt_ifp
= ifa
->ifa_ifp
;
959 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
961 rn
= rnh
->rnh_addaddr((char *)ndst
,
962 (char *)rtinfo
->rti_info
[RTAX_NETMASK
],
965 struct rtentry
*oldrt
;
968 * We already have one of these in the tree.
969 * We do a special hack: if the old route was
970 * cloned, then we blow it away and try
971 * re-inserting the new one.
973 oldrt
= rtpurelookup(ndst
);
976 if (oldrt
->rt_flags
& RTF_WASCLONED
) {
977 rtrequest(RTM_DELETE
, rt_key(oldrt
),
980 oldrt
->rt_flags
, NULL
);
981 rn
= rnh
->rnh_addaddr((char *)ndst
,
983 rtinfo
->rti_info
[RTAX_NETMASK
],
990 * If it still failed to go into the tree,
991 * then un-make it (this should be a function).
994 if (rt
->rt_gwroute
!= NULL
)
995 rtfree(rt
->rt_gwroute
);
1003 * If we got here from RESOLVE, then we are cloning
1004 * so clone the rest, and note that we
1005 * are a clone (and increment the parent's references)
1007 if (req
== RTM_RESOLVE
) {
1008 rt
->rt_rmx
= (*ret_nrt
)->rt_rmx
; /* copy metrics */
1009 rt
->rt_rmx
.rmx_pksent
= 0; /* reset packet counter */
1010 if ((*ret_nrt
)->rt_flags
&
1011 (RTF_CLONING
| RTF_PRCLONING
)) {
1012 rt
->rt_parent
= *ret_nrt
;
1013 (*ret_nrt
)->rt_refcnt
++;
1018 * if this protocol has something to add to this then
1019 * allow it to do that as well.
1021 if (ifa
->ifa_rtrequest
!= NULL
)
1022 ifa
->ifa_rtrequest(req
, rt
, rtinfo
);
1025 * We repeat the same procedure from rt_setgate() here because
1026 * it doesn't fire when we call it there because the node
1027 * hasn't been added to the tree yet.
1029 if (req
== RTM_ADD
&& !(rt
->rt_flags
& RTF_HOST
) &&
1030 rt_mask(rt
) != NULL
) {
1031 struct rtfc_arg arg
= { rt
, rnh
};
1033 rnh
->rnh_walktree_from(rnh
, (char *)rt_key(rt
),
1034 (char *)rt_mask(rt
),
1035 rt_fixchange
, &arg
);
1040 rt_print(rtinfo
, rt
);
1043 * Return the resulting rtentry,
1044 * increasing the number of references by one.
1046 if (ret_nrt
!= NULL
) {
1058 kprintf("rti %p failed error %d\n", rtinfo
, error
);
1060 kprintf("rti %p succeeded\n", rtinfo
);
1068 * Called from rtrequest(RTM_DELETE, ...) to fix up the route's ``family''
1069 * (i.e., the routes related to it by the operation of cloning). This
1070 * routine is iterated over all potential former-child-routes by way of
1071 * rnh->rnh_walktree_from() above, and those that actually are children of
1072 * the late parent (passed in as VP here) are themselves deleted.
1075 rt_fixdelete(struct radix_node
*rn
, void *vp
)
1077 struct rtentry
*rt
= (struct rtentry
*)rn
;
1078 struct rtentry
*rt0
= vp
;
1080 if (rt
->rt_parent
== rt0
&&
1081 !(rt
->rt_flags
& (RTF_PINNED
| RTF_CLONING
| RTF_PRCLONING
))) {
1082 return rtrequest(RTM_DELETE
, rt_key(rt
), NULL
, rt_mask(rt
),
1083 rt
->rt_flags
, NULL
);
1089 * This routine is called from rt_setgate() to do the analogous thing for
1090 * adds and changes. There is the added complication in this case of a
1091 * middle insert; i.e., insertion of a new network route between an older
1092 * network route and (cloned) host routes. For this reason, a simple check
1093 * of rt->rt_parent is insufficient; each candidate route must be tested
1094 * against the (mask, value) of the new route (passed as before in vp)
1095 * to see if the new route matches it.
1097 * XXX - it may be possible to do fixdelete() for changes and reserve this
1098 * routine just for adds. I'm not sure why I thought it was necessary to do
1102 static int rtfcdebug
= 0;
1106 rt_fixchange(struct radix_node
*rn
, void *vp
)
1108 struct rtentry
*rt
= (struct rtentry
*)rn
;
1109 struct rtfc_arg
*ap
= vp
;
1110 struct rtentry
*rt0
= ap
->rt0
;
1111 struct radix_node_head
*rnh
= ap
->rnh
;
1112 u_char
*xk1
, *xm1
, *xk2
, *xmp
;
1117 kprintf("rt_fixchange: rt %p, rt0 %p\n", rt
, rt0
);
1120 if (rt
->rt_parent
== NULL
||
1121 (rt
->rt_flags
& (RTF_PINNED
| RTF_CLONING
| RTF_PRCLONING
))) {
1123 if (rtfcdebug
) kprintf("no parent, pinned or cloning\n");
1128 if (rt
->rt_parent
== rt0
) {
1130 if (rtfcdebug
) kprintf("parent match\n");
1132 return rtrequest(RTM_DELETE
, rt_key(rt
), NULL
, rt_mask(rt
),
1133 rt
->rt_flags
, NULL
);
1137 * There probably is a function somewhere which does this...
1138 * if not, there should be.
1140 len
= imin(rt_key(rt0
)->sa_len
, rt_key(rt
)->sa_len
);
1142 xk1
= (u_char
*)rt_key(rt0
);
1143 xm1
= (u_char
*)rt_mask(rt0
);
1144 xk2
= (u_char
*)rt_key(rt
);
1146 /* avoid applying a less specific route */
1147 xmp
= (u_char
*)rt_mask(rt
->rt_parent
);
1148 mlen
= rt_key(rt
->rt_parent
)->sa_len
;
1149 if (mlen
> rt_key(rt0
)->sa_len
) {
1152 kprintf("rt_fixchange: inserting a less "
1153 "specific route\n");
1157 for (i
= rnh
->rnh_treetop
->rn_offset
; i
< mlen
; i
++) {
1158 if ((xmp
[i
] & ~(xmp
[i
] ^ xm1
[i
])) != xmp
[i
]) {
1161 kprintf("rt_fixchange: inserting a less "
1162 "specific route\n");
1168 for (i
= rnh
->rnh_treetop
->rn_offset
; i
< len
; i
++) {
1169 if ((xk2
[i
] & xm1
[i
]) != xk1
[i
]) {
1171 if (rtfcdebug
) kprintf("no match\n");
1178 * OK, this node is a clone, and matches the node currently being
1179 * changed/added under the node's mask. So, get rid of it.
1182 if (rtfcdebug
) kprintf("deleting\n");
1184 return rtrequest(RTM_DELETE
, rt_key(rt
), NULL
, rt_mask(rt
),
1185 rt
->rt_flags
, NULL
);
1188 #define ROUNDUP(a) (a>0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
1191 rt_setgate(struct rtentry
*rt0
, struct sockaddr
*dst
, struct sockaddr
*gate
)
1193 char *space
, *oldspace
;
1194 int dlen
= ROUNDUP(dst
->sa_len
), glen
= ROUNDUP(gate
->sa_len
);
1195 struct rtentry
*rt
= rt0
;
1196 struct radix_node_head
*rnh
= rt_tables
[mycpuid
][dst
->sa_family
];
1199 * A host route with the destination equal to the gateway
1200 * will interfere with keeping LLINFO in the routing
1201 * table, so disallow it.
1203 if (((rt0
->rt_flags
& (RTF_HOST
| RTF_GATEWAY
| RTF_LLINFO
)) ==
1204 (RTF_HOST
| RTF_GATEWAY
)) &&
1205 dst
->sa_len
== gate
->sa_len
&&
1206 sa_equal(dst
, gate
)) {
1208 * The route might already exist if this is an RTM_CHANGE
1209 * or a routing redirect, so try to delete it.
1211 if (rt_key(rt0
) != NULL
)
1212 rtrequest(RTM_DELETE
, rt_key(rt0
), rt0
->rt_gateway
,
1213 rt_mask(rt0
), rt0
->rt_flags
, NULL
);
1214 return EADDRNOTAVAIL
;
1218 * Both dst and gateway are stored in the same malloc'ed chunk
1219 * (If I ever get my hands on....)
1220 * if we need to malloc a new chunk, then keep the old one around
1221 * till we don't need it any more.
1223 if (rt
->rt_gateway
== NULL
|| glen
> ROUNDUP(rt
->rt_gateway
->sa_len
)) {
1224 oldspace
= (char *)rt_key(rt
);
1225 R_Malloc(space
, char *, dlen
+ glen
);
1228 rt
->rt_nodes
->rn_key
= space
;
1230 space
= (char *)rt_key(rt
); /* Just use the old space. */
1234 /* Set the gateway value. */
1235 rt
->rt_gateway
= (struct sockaddr
*)(space
+ dlen
);
1236 bcopy(gate
, rt
->rt_gateway
, glen
);
1238 if (oldspace
!= NULL
) {
1240 * If we allocated a new chunk, preserve the original dst.
1241 * This way, rt_setgate() really just sets the gate
1242 * and leaves the dst field alone.
1244 bcopy(dst
, space
, dlen
);
1249 * If there is already a gwroute, it's now almost definitely wrong
1252 if (rt
->rt_gwroute
!= NULL
) {
1253 RTFREE(rt
->rt_gwroute
);
1254 rt
->rt_gwroute
= NULL
;
1256 if (rt
->rt_flags
& RTF_GATEWAY
) {
1258 * Cloning loop avoidance: In the presence of
1259 * protocol-cloning and bad configuration, it is
1260 * possible to get stuck in bottomless mutual recursion
1261 * (rtrequest rt_setgate rtlookup). We avoid this
1262 * by not allowing protocol-cloning to operate for
1263 * gateways (which is probably the correct choice
1264 * anyway), and avoid the resulting reference loops
1265 * by disallowing any route to run through itself as
1266 * a gateway. This is obviously mandatory when we
1267 * get rt->rt_output().
1269 * This breaks TTCP for hosts outside the gateway! XXX JH
1271 rt
->rt_gwroute
= _rtlookup(gate
, RTL_REPORTMSG
, RTF_PRCLONING
);
1272 if (rt
->rt_gwroute
== rt
) {
1273 rt
->rt_gwroute
= NULL
;
1275 return EDQUOT
; /* failure */
1280 * This isn't going to do anything useful for host routes, so
1281 * don't bother. Also make sure we have a reasonable mask
1282 * (we don't yet have one during adds).
1284 if (!(rt
->rt_flags
& RTF_HOST
) && rt_mask(rt
) != NULL
) {
1285 struct rtfc_arg arg
= { rt
, rnh
};
1287 rnh
->rnh_walktree_from(rnh
, (char *)rt_key(rt
),
1288 (char *)rt_mask(rt
),
1289 rt_fixchange
, &arg
);
1297 struct sockaddr
*src
,
1298 struct sockaddr
*dst
,
1299 struct sockaddr
*netmask
)
1301 u_char
*cp1
= (u_char
*)src
;
1302 u_char
*cp2
= (u_char
*)dst
;
1303 u_char
*cp3
= (u_char
*)netmask
;
1304 u_char
*cplim
= cp2
+ *cp3
;
1305 u_char
*cplim2
= cp2
+ *cp1
;
1307 *cp2
++ = *cp1
++; *cp2
++ = *cp1
++; /* copies sa_len & sa_family */
1312 *cp2
++ = *cp1
++ & *cp3
++;
1314 bzero(cp2
, cplim2
- cp2
);
1318 rt_llroute(struct sockaddr
*dst
, struct rtentry
*rt0
, struct rtentry
**drt
)
1320 struct rtentry
*up_rt
, *rt
;
1322 if (!(rt0
->rt_flags
& RTF_UP
)) {
1323 up_rt
= rtlookup(dst
);
1325 return (EHOSTUNREACH
);
1329 if (up_rt
->rt_flags
& RTF_GATEWAY
) {
1330 if (up_rt
->rt_gwroute
== NULL
) {
1331 up_rt
->rt_gwroute
= rtlookup(up_rt
->rt_gateway
);
1332 if (up_rt
->rt_gwroute
== NULL
)
1333 return (EHOSTUNREACH
);
1334 } else if (!(up_rt
->rt_gwroute
->rt_flags
& RTF_UP
)) {
1335 rtfree(up_rt
->rt_gwroute
);
1336 up_rt
->rt_gwroute
= rtlookup(up_rt
->rt_gateway
);
1337 if (up_rt
->rt_gwroute
== NULL
)
1338 return (EHOSTUNREACH
);
1340 rt
= up_rt
->rt_gwroute
;
1343 if (rt
->rt_flags
& RTF_REJECT
&&
1344 (rt
->rt_rmx
.rmx_expire
== 0 || /* rt doesn't expire */
1345 time_second
< rt
->rt_rmx
.rmx_expire
)) /* rt not expired */
1346 return (rt
->rt_flags
& RTF_HOST
? EHOSTDOWN
: EHOSTUNREACH
);
1352 rt_setshims(struct rtentry
*rt
, struct sockaddr
**rt_shim
){
1355 for (i
=0; i
<3; i
++) {
1356 struct sockaddr
*shim
= rt_shim
[RTAX_MPLS1
+ i
];
1362 shimlen
= ROUNDUP(shim
->sa_len
);
1363 R_Malloc(rt
->rt_shim
[i
], struct sockaddr
*, shimlen
);
1364 bcopy(shim
, rt
->rt_shim
[i
], shimlen
);
1373 * Print out a route table entry
1376 rt_print(struct rt_addrinfo
*rtinfo
, struct rtentry
*rn
)
1378 kprintf("rti %p cpu %d route %p flags %08lx: ",
1379 rtinfo
, mycpuid
, rn
, rn
->rt_flags
);
1380 sockaddr_print(rt_key(rn
));
1382 sockaddr_print(rt_mask(rn
));
1384 sockaddr_print(rn
->rt_gateway
);
1385 kprintf(" ifc \"%s\"", rn
->rt_ifp
? rn
->rt_ifp
->if_dname
: "?");
1386 kprintf(" ifa %p\n", rn
->rt_ifa
);
1390 rt_addrinfo_print(int cmd
, struct rt_addrinfo
*rti
)
1396 if (cmd
== RTM_DELETE
&& route_debug
> 1)
1397 db_print_backtrace();
1411 kprintf("C%02d ", cmd
);
1414 kprintf("rti %p cpu %d ", rti
, mycpuid
);
1415 for (i
= 0; i
< rti
->rti_addrs
; ++i
) {
1416 if (rti
->rti_info
[i
] == NULL
)
1446 kprintf("(?%02d ", i
);
1449 sockaddr_print(rti
->rti_info
[i
]);
1457 sockaddr_print(struct sockaddr
*sa
)
1459 struct sockaddr_in
*sa4
;
1460 struct sockaddr_in6
*sa6
;
1469 len
= sa
->sa_len
- offsetof(struct sockaddr
, sa_data
[0]);
1471 switch(sa
->sa_family
) {
1475 switch(sa
->sa_family
) {
1477 sa4
= (struct sockaddr_in
*)sa
;
1478 kprintf("INET %d %d.%d.%d.%d",
1479 ntohs(sa4
->sin_port
),
1480 (ntohl(sa4
->sin_addr
.s_addr
) >> 24) & 255,
1481 (ntohl(sa4
->sin_addr
.s_addr
) >> 16) & 255,
1482 (ntohl(sa4
->sin_addr
.s_addr
) >> 8) & 255,
1483 (ntohl(sa4
->sin_addr
.s_addr
) >> 0) & 255
1487 sa6
= (struct sockaddr_in6
*)sa
;
1488 kprintf("INET6 %d %04x:%04x%04x:%04x:%04x:%04x:%04x:%04x",
1489 ntohs(sa6
->sin6_port
),
1490 sa6
->sin6_addr
.s6_addr16
[0],
1491 sa6
->sin6_addr
.s6_addr16
[1],
1492 sa6
->sin6_addr
.s6_addr16
[2],
1493 sa6
->sin6_addr
.s6_addr16
[3],
1494 sa6
->sin6_addr
.s6_addr16
[4],
1495 sa6
->sin6_addr
.s6_addr16
[5],
1496 sa6
->sin6_addr
.s6_addr16
[6],
1497 sa6
->sin6_addr
.s6_addr16
[7]
1501 kprintf("AF%d ", sa
->sa_family
);
1502 while (len
> 0 && sa
->sa_data
[len
-1] == 0)
1505 for (i
= 0; i
< len
; ++i
) {
1508 kprintf("%d", (unsigned char)sa
->sa_data
[i
]);
1518 * Set up a routing table entry, normally for an interface.
1521 rtinit(struct ifaddr
*ifa
, int cmd
, int flags
)
1523 struct sockaddr
*dst
, *deldst
, *netmask
;
1524 struct mbuf
*m
= NULL
;
1525 struct radix_node_head
*rnh
;
1526 struct radix_node
*rn
;
1527 struct rt_addrinfo rtinfo
;
1530 if (flags
& RTF_HOST
) {
1531 dst
= ifa
->ifa_dstaddr
;
1534 dst
= ifa
->ifa_addr
;
1535 netmask
= ifa
->ifa_netmask
;
1538 * If it's a delete, check that if it exists, it's on the correct
1539 * interface or we might scrub a route to another ifa which would
1540 * be confusing at best and possibly worse.
1542 if (cmd
== RTM_DELETE
) {
1544 * It's a delete, so it should already exist..
1545 * If it's a net, mask off the host bits
1546 * (Assuming we have a mask)
1548 if (netmask
!= NULL
) {
1549 m
= m_get(MB_DONTWAIT
, MT_SONAME
);
1553 deldst
= mtod(m
, struct sockaddr
*);
1554 rt_maskedcopy(dst
, deldst
, netmask
);
1558 * Look up an rtentry that is in the routing tree and
1559 * contains the correct info.
1561 if ((rnh
= rt_tables
[mycpuid
][dst
->sa_family
]) == NULL
||
1562 (rn
= rnh
->rnh_lookup((char *)dst
,
1563 (char *)netmask
, rnh
)) == NULL
||
1564 ((struct rtentry
*)rn
)->rt_ifa
!= ifa
||
1565 !sa_equal((struct sockaddr
*)rn
->rn_key
, dst
)) {
1568 return (flags
& RTF_HOST
? EHOSTUNREACH
: ENETUNREACH
);
1574 * One would think that as we are deleting, and we know
1575 * it doesn't exist, we could just return at this point
1576 * with an "ELSE" clause, but apparently not..
1578 return (flags
& RTF_HOST
? EHOSTUNREACH
: ENETUNREACH
);
1583 * Do the actual request
1585 bzero(&rtinfo
, sizeof(struct rt_addrinfo
));
1586 rtinfo
.rti_info
[RTAX_DST
] = dst
;
1587 rtinfo
.rti_info
[RTAX_GATEWAY
] = ifa
->ifa_addr
;
1588 rtinfo
.rti_info
[RTAX_NETMASK
] = netmask
;
1589 rtinfo
.rti_flags
= flags
| ifa
->ifa_flags
;
1590 rtinfo
.rti_ifa
= ifa
;
1591 error
= rtrequest1_global(cmd
, &rtinfo
, rtinit_rtrequest_callback
, ifa
);
1598 rtinit_rtrequest_callback(int cmd
, int error
,
1599 struct rt_addrinfo
*rtinfo
, struct rtentry
*rt
,
1602 struct ifaddr
*ifa
= arg
;
1604 if (error
== 0 && rt
) {
1607 rt_newaddrmsg(cmd
, ifa
, error
, rt
);
1610 if (cmd
== RTM_DELETE
) {
1611 if (rt
->rt_refcnt
== 0) {
1619 /* This must be before ip6_init2(), which is now SI_ORDER_MIDDLE */
1620 SYSINIT(route
, SI_SUB_PROTO_DOMAIN
, SI_ORDER_THIRD
, route_init
, 0);