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. Neither the name of the University nor the names of its contributors
46 * may be used to endorse or promote products derived from this software
47 * without specific prior written permission.
49 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
50 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
53 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61 * @(#)route.c 8.3 (Berkeley) 1/9/95
62 * $FreeBSD: src/sys/net/route.c,v 1.59.2.10 2003/01/17 08:04:00 ru Exp $
68 #include <sys/param.h>
69 #include <sys/systm.h>
70 #include <sys/malloc.h>
72 #include <sys/socket.h>
73 #include <sys/domain.h>
74 #include <sys/kernel.h>
75 #include <sys/sysctl.h>
76 #include <sys/globaldata.h>
77 #include <sys/thread.h>
80 #include <net/route.h>
81 #include <net/netisr.h>
83 #include <netinet/in.h>
84 #include <net/ip_mroute/ip_mroute.h>
86 #include <sys/thread2.h>
87 #include <sys/msgport2.h>
88 #include <net/netmsg2.h>
89 #include <net/netisr2.h>
92 #include <netproto/mpls/mpls.h>
95 static struct rtstatistics rtstatistics_percpu[MAXCPU];
96 #define rtstat rtstatistics_percpu[mycpuid]
98 struct radix_node_head *rt_tables[MAXCPU][AF_MAX+1];
100 static void rt_maskedcopy (struct sockaddr *, struct sockaddr *,
102 static void rtable_init(void);
103 static void rtinit_rtrequest_callback(int, int, struct rt_addrinfo *,
104 struct rtentry *, void *);
106 static void rtredirect_msghandler(netmsg_t msg);
107 static void rtrequest1_msghandler(netmsg_t msg);
108 static void rtsearch_msghandler(netmsg_t msg);
109 static void rtmask_add_msghandler(netmsg_t msg);
111 static int rt_setshims(struct rtentry *, struct sockaddr **);
113 SYSCTL_NODE(_net, OID_AUTO, route, CTLFLAG_RW, 0, "Routing");
116 static int route_debug = 1;
117 SYSCTL_INT(_net_route, OID_AUTO, route_debug, CTLFLAG_RW,
118 &route_debug, 0, "");
121 int route_assert_owner_access = 1;
122 SYSCTL_INT(_net_route, OID_AUTO, assert_owner_access, CTLFLAG_RW,
123 &route_assert_owner_access, 0, "");
125 u_long route_kmalloc_limit = 0;
126 TUNABLE_ULONG("net.route.kmalloc_limit", &route_kmalloc_limit);
129 * Initialize the route table(s) for protocol domains and
130 * create a helper thread which will be responsible for updating
131 * route table entries on each cpu.
138 for (cpu = 0; cpu < ncpus; ++cpu)
139 bzero(&rtstatistics_percpu[cpu], sizeof(struct rtstatistics));
140 rn_init(); /* initialize all zeroes, all ones, mask table */
141 rtable_init(); /* call dom_rtattach() on each cpu */
143 if (route_kmalloc_limit)
144 kmalloc_raise_limit(M_RTABLE, route_kmalloc_limit);
148 rtable_init_oncpu(netmsg_t msg)
151 int nextcpu = mycpuid + 1;
153 SLIST_FOREACH(dom, &domains, dom_next) {
154 if (dom->dom_rtattach) {
156 (void **)&rt_tables[mycpuid][dom->dom_family],
161 lwkt_forwardmsg(netisr_cpuport(nextcpu), &msg->lmsg);
163 lwkt_replymsg(&msg->lmsg, 0);
169 struct netmsg_base msg;
171 netmsg_init(&msg, NULL, &curthread->td_msgport, 0, rtable_init_oncpu);
172 rt_domsg_global(&msg);
176 * Routing statistics.
179 sysctl_rtstatistics(SYSCTL_HANDLER_ARGS)
183 for (cpu = 0; cpu < ncpus; ++cpu) {
184 if ((error = SYSCTL_OUT(req, &rtstatistics_percpu[cpu],
185 sizeof(struct rtstatistics))))
187 if ((error = SYSCTL_IN(req, &rtstatistics_percpu[cpu],
188 sizeof(struct rtstatistics))))
194 SYSCTL_PROC(_net_route, OID_AUTO, stats, (CTLTYPE_OPAQUE|CTLFLAG_RW),
195 0, 0, sysctl_rtstatistics, "S,rtstatistics", "Routing statistics");
198 * Packet routing routines.
202 * Look up and fill in the "ro_rt" rtentry field in a route structure given
203 * an address in the "ro_dst" field. Always send a report on a miss and
204 * always clone routes.
207 rtalloc(struct route *ro)
209 rtalloc_ign(ro, 0UL);
213 * Look up and fill in the "ro_rt" rtentry field in a route structure given
214 * an address in the "ro_dst" field. Always send a report on a miss and
215 * optionally clone routes when RTF_CLONING or RTF_PRCLONING are not being
219 rtalloc_ign(struct route *ro, u_long ignoreflags)
221 if (ro->ro_rt != NULL) {
222 if (ro->ro_rt->rt_ifp != NULL && ro->ro_rt->rt_flags & RTF_UP)
227 ro->ro_rt = _rtlookup(&ro->ro_dst, RTL_REPORTMSG, ignoreflags);
231 * Look up the route that matches the given "dst" address.
233 * Route lookup can have the side-effect of creating and returning
234 * a cloned route instead when "dst" matches a cloning route and the
235 * RTF_CLONING and RTF_PRCLONING flags are not being ignored.
237 * Any route returned has its reference count incremented.
240 _rtlookup(struct sockaddr *dst, boolean_t generate_report, u_long ignore)
242 struct radix_node_head *rnh = rt_tables[mycpuid][dst->sa_family];
249 * Look up route in the radix tree.
251 rt = (struct rtentry *) rnh->rnh_matchaddr((char *)dst, rnh);
256 * Handle cloning routes.
258 if ((rt->rt_flags & ~ignore & (RTF_CLONING | RTF_PRCLONING)) != 0) {
259 struct rtentry *clonedroute;
262 clonedroute = rt; /* copy in/copy out parameter */
263 error = rtrequest(RTM_RESOLVE, dst, NULL, NULL, 0,
264 &clonedroute); /* clone the route */
265 if (error != 0) { /* cloning failed */
267 rt_dstmsg(RTM_MISS, dst, error);
269 return (rt); /* return the uncloned route */
271 if (generate_report) {
272 if (clonedroute->rt_flags & RTF_XRESOLVE)
273 rt_dstmsg(RTM_RESOLVE, dst, 0);
275 rt_rtmsg(RTM_ADD, clonedroute,
276 clonedroute->rt_ifp, 0);
278 return (clonedroute); /* return cloned route */
282 * Increment the reference count of the matched route and return.
288 rtstat.rts_unreach++;
290 rt_dstmsg(RTM_MISS, dst, 0);
295 rtfree(struct rtentry *rt)
297 if (rt->rt_cpuid == mycpuid)
304 rtfree_oncpu(struct rtentry *rt)
306 KKASSERT(rt->rt_cpuid == mycpuid);
307 KASSERT(rt->rt_refcnt > 0, ("rtfree: rt_refcnt %ld", rt->rt_refcnt));
310 if (rt->rt_refcnt == 0) {
311 struct radix_node_head *rnh =
312 rt_tables[mycpuid][rt_key(rt)->sa_family];
315 rnh->rnh_close((struct radix_node *)rt, rnh);
316 if (!(rt->rt_flags & RTF_UP)) {
317 /* deallocate route */
318 if (rt->rt_ifa != NULL)
320 if (rt->rt_parent != NULL)
321 RTFREE(rt->rt_parent); /* recursive call! */
329 rtfree_remote_dispatch(netmsg_t msg)
331 struct lwkt_msg *lmsg = &msg->lmsg;
332 struct rtentry *rt = lmsg->u.ms_resultp;
335 lwkt_replymsg(lmsg, 0);
339 rtfree_remote(struct rtentry *rt)
341 struct netmsg_base *msg;
342 struct lwkt_msg *lmsg;
344 KKASSERT(rt->rt_cpuid != mycpuid);
346 if (route_assert_owner_access) {
347 panic("rt remote free rt_cpuid %d, mycpuid %d",
348 rt->rt_cpuid, mycpuid);
350 kprintf("rt remote free rt_cpuid %d, mycpuid %d\n",
351 rt->rt_cpuid, mycpuid);
355 msg = kmalloc(sizeof(*msg), M_LWKTMSG, M_INTWAIT);
356 netmsg_init(msg, NULL, &netisr_afree_rport, 0, rtfree_remote_dispatch);
358 lmsg->u.ms_resultp = rt;
360 lwkt_sendmsg(netisr_cpuport(rt->rt_cpuid), lmsg);
364 rtredirect_oncpu(struct sockaddr *dst, struct sockaddr *gateway,
365 struct sockaddr *netmask, int flags, struct sockaddr *src)
367 struct rtentry *rt = NULL;
368 struct rt_addrinfo rtinfo;
373 /* verify the gateway is directly reachable */
374 if ((ifa = ifa_ifwithnet(gateway)) == NULL) {
380 * If the redirect isn't from our current router for this destination,
381 * it's either old or wrong.
383 if (!(flags & RTF_DONE) && /* XXX JH */
384 (rt = rtpurelookup(dst)) != NULL &&
385 (!sa_equal(src, rt->rt_gateway) || rt->rt_ifa != ifa)) {
391 * If it redirects us to ourselves, we have a routing loop,
392 * perhaps as a result of an interface going down recently.
394 if (ifa_ifwithaddr(gateway)) {
395 error = EHOSTUNREACH;
400 * Create a new entry if the lookup failed or if we got back
401 * a wildcard entry for the default route. This is necessary
402 * for hosts which use routing redirects generated by smart
403 * gateways to dynamically build the routing tables.
407 if ((rt_mask(rt) != NULL && rt_mask(rt)->sa_len < 2)) {
412 /* Ignore redirects for directly connected hosts. */
413 if (!(rt->rt_flags & RTF_GATEWAY)) {
414 error = EHOSTUNREACH;
418 if (!(rt->rt_flags & RTF_HOST) && (flags & RTF_HOST)) {
420 * Changing from a network route to a host route.
421 * Create a new host route rather than smashing the
425 flags |= RTF_GATEWAY | RTF_DYNAMIC;
426 bzero(&rtinfo, sizeof(struct rt_addrinfo));
427 rtinfo.rti_info[RTAX_DST] = dst;
428 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
429 rtinfo.rti_info[RTAX_NETMASK] = netmask;
430 rtinfo.rti_flags = flags;
431 rtinfo.rti_ifa = ifa;
432 rt = NULL; /* copy-in/copy-out parameter */
433 error = rtrequest1(RTM_ADD, &rtinfo, &rt);
435 flags = rt->rt_flags;
436 stat = &rtstat.rts_dynamic;
439 * Smash the current notion of the gateway to this destination.
440 * Should check about netmask!!!
442 rt->rt_flags |= RTF_MODIFIED;
443 flags |= RTF_MODIFIED;
445 /* We only need to report rtmsg on CPU0 */
446 rt_setgate(rt, rt_key(rt), gateway,
447 mycpuid == 0 ? RTL_REPORTMSG : RTL_DONTREPORT);
449 stat = &rtstat.rts_newgateway;
457 rtstat.rts_badredirect++;
458 else if (stat != NULL)
464 struct netmsg_rtredirect {
465 struct netmsg_base base;
466 struct sockaddr *dst;
467 struct sockaddr *gateway;
468 struct sockaddr *netmask;
470 struct sockaddr *src;
474 * Force a routing table entry to the specified
475 * destination to go through the given gateway.
476 * Normally called as a result of a routing redirect
477 * message from the network layer.
479 * N.B.: must be called at splnet
482 rtredirect(struct sockaddr *dst, struct sockaddr *gateway,
483 struct sockaddr *netmask, int flags, struct sockaddr *src)
485 struct rt_addrinfo rtinfo;
487 struct netmsg_rtredirect msg;
489 netmsg_init(&msg.base, NULL, &curthread->td_msgport,
490 0, rtredirect_msghandler);
492 msg.gateway = gateway;
493 msg.netmask = netmask;
496 error = rt_domsg_global(&msg.base);
497 bzero(&rtinfo, sizeof(struct rt_addrinfo));
498 rtinfo.rti_info[RTAX_DST] = dst;
499 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
500 rtinfo.rti_info[RTAX_NETMASK] = netmask;
501 rtinfo.rti_info[RTAX_AUTHOR] = src;
502 rt_missmsg(RTM_REDIRECT, &rtinfo, flags, error);
506 rtredirect_msghandler(netmsg_t msg)
508 struct netmsg_rtredirect *rmsg = (void *)msg;
511 rtredirect_oncpu(rmsg->dst, rmsg->gateway, rmsg->netmask,
512 rmsg->flags, rmsg->src);
513 nextcpu = mycpuid + 1;
515 lwkt_forwardmsg(netisr_cpuport(nextcpu), &msg->lmsg);
517 lwkt_replymsg(&msg->lmsg, 0);
521 * Routing table ioctl interface.
524 rtioctl(u_long req, caddr_t data, struct ucred *cred)
527 /* Multicast goop, grrr... */
528 return mrt_ioctl ? mrt_ioctl(req, data) : EOPNOTSUPP;
535 ifa_ifwithroute(int flags, struct sockaddr *dst, struct sockaddr *gateway)
539 if (!(flags & RTF_GATEWAY)) {
541 * If we are adding a route to an interface,
542 * and the interface is a point-to-point link,
543 * we should search for the destination
544 * as our clue to the interface. Otherwise
545 * we can use the local address.
548 if (flags & RTF_HOST) {
549 ifa = ifa_ifwithdstaddr(dst);
552 ifa = ifa_ifwithaddr(gateway);
555 * If we are adding a route to a remote net
556 * or host, the gateway may still be on the
557 * other end of a pt to pt link.
559 ifa = ifa_ifwithdstaddr(gateway);
562 ifa = ifa_ifwithnet(gateway);
566 rt = rtpurelookup(gateway);
570 if ((ifa = rt->rt_ifa) == NULL)
573 if (ifa->ifa_addr->sa_family != dst->sa_family) {
574 struct ifaddr *oldifa = ifa;
576 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
583 static int rt_fixdelete (struct radix_node *, void *);
584 static int rt_fixchange (struct radix_node *, void *);
588 struct radix_node_head *rnh;
592 * Set rtinfo->rti_ifa and rtinfo->rti_ifp.
595 rt_getifa(struct rt_addrinfo *rtinfo)
597 struct sockaddr *gateway = rtinfo->rti_info[RTAX_GATEWAY];
598 struct sockaddr *dst = rtinfo->rti_info[RTAX_DST];
599 struct sockaddr *ifaaddr = rtinfo->rti_info[RTAX_IFA];
600 int flags = rtinfo->rti_flags;
603 * ifp may be specified by sockaddr_dl
604 * when protocol address is ambiguous.
606 if (rtinfo->rti_ifp == NULL) {
607 struct sockaddr *ifpaddr;
609 ifpaddr = rtinfo->rti_info[RTAX_IFP];
610 if (ifpaddr != NULL && ifpaddr->sa_family == AF_LINK) {
613 ifa = ifa_ifwithnet(ifpaddr);
615 rtinfo->rti_ifp = ifa->ifa_ifp;
619 if (rtinfo->rti_ifa == NULL && ifaaddr != NULL)
620 rtinfo->rti_ifa = ifa_ifwithaddr(ifaaddr);
621 if (rtinfo->rti_ifa == NULL) {
624 sa = ifaaddr != NULL ? ifaaddr :
625 (gateway != NULL ? gateway : dst);
626 if (sa != NULL && rtinfo->rti_ifp != NULL)
627 rtinfo->rti_ifa = ifaof_ifpforaddr(sa, rtinfo->rti_ifp);
628 else if (dst != NULL && gateway != NULL)
629 rtinfo->rti_ifa = ifa_ifwithroute(flags, dst, gateway);
631 rtinfo->rti_ifa = ifa_ifwithroute(flags, sa, sa);
633 if (rtinfo->rti_ifa == NULL)
634 return (ENETUNREACH);
636 if (rtinfo->rti_ifp == NULL)
637 rtinfo->rti_ifp = rtinfo->rti_ifa->ifa_ifp;
642 * Do appropriate manipulations of a routing tree given
643 * all the bits of info needed
648 struct sockaddr *dst,
649 struct sockaddr *gateway,
650 struct sockaddr *netmask,
652 struct rtentry **ret_nrt)
654 struct rt_addrinfo rtinfo;
656 bzero(&rtinfo, sizeof(struct rt_addrinfo));
657 rtinfo.rti_info[RTAX_DST] = dst;
658 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
659 rtinfo.rti_info[RTAX_NETMASK] = netmask;
660 rtinfo.rti_flags = flags;
661 return rtrequest1(req, &rtinfo, ret_nrt);
667 struct sockaddr *dst,
668 struct sockaddr *gateway,
669 struct sockaddr *netmask,
672 struct rt_addrinfo rtinfo;
674 bzero(&rtinfo, sizeof(struct rt_addrinfo));
675 rtinfo.rti_info[RTAX_DST] = dst;
676 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
677 rtinfo.rti_info[RTAX_NETMASK] = netmask;
678 rtinfo.rti_flags = flags;
679 return rtrequest1_global(req, &rtinfo, NULL, NULL, RTREQ_PRIO_NORM);
683 struct netmsg_base base;
685 struct rt_addrinfo *rtinfo;
686 rtrequest1_callback_func_t callback;
691 rtrequest1_global(int req, struct rt_addrinfo *rtinfo,
692 rtrequest1_callback_func_t callback, void *arg, boolean_t req_prio)
694 int error, flags = 0;
695 struct netmsg_rtq msg;
698 flags = MSGF_PRIORITY;
699 netmsg_init(&msg.base, NULL, &curthread->td_msgport, flags,
700 rtrequest1_msghandler);
701 msg.base.lmsg.ms_error = -1;
704 msg.callback = callback;
706 error = rt_domsg_global(&msg.base);
711 * Handle a route table request on the current cpu. Since the route table's
712 * are supposed to be identical on each cpu, an error occuring later in the
713 * message chain is considered system-fatal.
716 rtrequest1_msghandler(netmsg_t msg)
718 struct netmsg_rtq *rmsg = (void *)msg;
719 struct rt_addrinfo rtinfo;
720 struct rtentry *rt = NULL;
725 * Copy the rtinfo. We need to make sure that the original
726 * rtinfo, which is setup by the caller, in the netmsg will
727 * _not_ be changed; else the next CPU on the netmsg forwarding
728 * path will see a different rtinfo than what this CPU has seen.
730 rtinfo = *rmsg->rtinfo;
732 error = rtrequest1(rmsg->req, &rtinfo, &rt);
736 rmsg->callback(rmsg->req, error, &rtinfo, rt, rmsg->arg);
739 * RTM_DELETE's are propogated even if an error occurs, since a
740 * cloned route might be undergoing deletion and cloned routes
741 * are not necessarily replicated. An overall error is returned
742 * only if no cpus have the route in question.
744 if (rmsg->base.lmsg.ms_error < 0 || error == 0)
745 rmsg->base.lmsg.ms_error = error;
747 nextcpu = mycpuid + 1;
748 if (error && rmsg->req != RTM_DELETE) {
750 panic("rtrequest1_msghandler: rtrequest table req %d, "
751 "failed on cpu%d, error %d\n",
752 rmsg->req, mycpuid, error);
754 lwkt_replymsg(&rmsg->base.lmsg, error);
755 } else if (nextcpu < ncpus) {
756 lwkt_forwardmsg(netisr_cpuport(nextcpu), &rmsg->base.lmsg);
758 lwkt_replymsg(&rmsg->base.lmsg, rmsg->base.lmsg.ms_error);
763 rtrequest1(int req, struct rt_addrinfo *rtinfo, struct rtentry **ret_nrt)
765 struct sockaddr *dst = rtinfo->rti_info[RTAX_DST];
767 struct radix_node *rn;
768 struct radix_node_head *rnh;
770 struct sockaddr *ndst;
774 #define gotoerr(x) { error = x ; goto bad; }
778 rt_addrinfo_print(req, rtinfo);
783 * Find the correct routing tree to use for this Address Family
785 if ((rnh = rt_tables[mycpuid][dst->sa_family]) == NULL)
786 gotoerr(EAFNOSUPPORT);
789 * If we are adding a host route then we don't want to put
790 * a netmask in the tree, nor do we want to clone it.
792 if (rtinfo->rti_flags & RTF_HOST) {
793 rtinfo->rti_info[RTAX_NETMASK] = NULL;
794 rtinfo->rti_flags &= ~(RTF_CLONING | RTF_PRCLONING);
799 /* Remove the item from the tree. */
800 rn = rnh->rnh_deladdr((char *)rtinfo->rti_info[RTAX_DST],
801 (char *)rtinfo->rti_info[RTAX_NETMASK],
805 KASSERT(!(rn->rn_flags & (RNF_ACTIVE | RNF_ROOT)),
806 ("rnh_deladdr returned flags 0x%x", rn->rn_flags));
807 rt = (struct rtentry *)rn;
809 /* ref to prevent a deletion race */
812 /* Free any routes cloned from this one. */
813 if ((rt->rt_flags & (RTF_CLONING | RTF_PRCLONING)) &&
814 rt_mask(rt) != NULL) {
815 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
820 if (rt->rt_gwroute != NULL) {
821 RTFREE(rt->rt_gwroute);
822 rt->rt_gwroute = NULL;
826 * NB: RTF_UP must be set during the search above,
827 * because we might delete the last ref, causing
828 * rt to get freed prematurely.
830 rt->rt_flags &= ~RTF_UP;
834 rt_print(rtinfo, rt);
837 /* Give the protocol a chance to keep things in sync. */
838 if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest)
839 ifa->ifa_rtrequest(RTM_DELETE, rt);
842 * If the caller wants it, then it can have it,
843 * but it's up to it to free the rtentry as we won't be
846 KASSERT(rt->rt_refcnt >= 0,
847 ("rtrequest1(DELETE): refcnt %ld", rt->rt_refcnt));
848 if (ret_nrt != NULL) {
849 /* leave ref intact for return */
852 /* deref / attempt to destroy */
858 if (ret_nrt == NULL || (rt = *ret_nrt) == NULL)
861 KASSERT(rt->rt_cpuid == mycpuid,
862 ("rt resolve rt_cpuid %d, mycpuid %d",
863 rt->rt_cpuid, mycpuid));
867 rt->rt_flags & ~(RTF_CLONING | RTF_PRCLONING | RTF_STATIC);
868 rtinfo->rti_flags |= RTF_WASCLONED;
869 rtinfo->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
870 if ((rtinfo->rti_info[RTAX_NETMASK] = rt->rt_genmask) == NULL)
871 rtinfo->rti_flags |= RTF_HOST;
872 rtinfo->rti_info[RTAX_MPLS1] = rt->rt_shim[0];
873 rtinfo->rti_info[RTAX_MPLS2] = rt->rt_shim[1];
874 rtinfo->rti_info[RTAX_MPLS3] = rt->rt_shim[2];
878 KASSERT(!(rtinfo->rti_flags & RTF_GATEWAY) ||
879 rtinfo->rti_info[RTAX_GATEWAY] != NULL,
880 ("rtrequest: GATEWAY but no gateway"));
882 if (rtinfo->rti_ifa == NULL && (error = rt_getifa(rtinfo)))
884 ifa = rtinfo->rti_ifa;
886 R_Malloc(rt, struct rtentry *, sizeof(struct rtentry));
888 if (req == RTM_ADD) {
889 kprintf("rtrequest1: alloc rtentry failed on "
894 bzero(rt, sizeof(struct rtentry));
895 rt->rt_flags = RTF_UP | rtinfo->rti_flags;
896 rt->rt_cpuid = mycpuid;
898 if (mycpuid != 0 && req == RTM_ADD) {
899 /* For RTM_ADD, we have already sent rtmsg on CPU0. */
900 reportmsg = RTL_DONTREPORT;
903 * For RTM_ADD, we only send rtmsg on CPU0.
904 * For RTM_RESOLVE, we always send rtmsg. XXX
906 reportmsg = RTL_REPORTMSG;
908 error = rt_setgate(rt, dst, rtinfo->rti_info[RTAX_GATEWAY],
916 if (rtinfo->rti_info[RTAX_NETMASK] != NULL)
917 rt_maskedcopy(dst, ndst,
918 rtinfo->rti_info[RTAX_NETMASK]);
920 bcopy(dst, ndst, dst->sa_len);
922 if (rtinfo->rti_info[RTAX_MPLS1] != NULL)
923 rt_setshims(rt, rtinfo->rti_info);
926 * Note that we now have a reference to the ifa.
927 * This moved from below so that rnh->rnh_addaddr() can
928 * examine the ifa and ifa->ifa_ifp if it so desires.
932 rt->rt_ifp = ifa->ifa_ifp;
933 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
935 rn = rnh->rnh_addaddr((char *)ndst,
936 (char *)rtinfo->rti_info[RTAX_NETMASK],
939 struct rtentry *oldrt;
942 * We already have one of these in the tree.
943 * We do a special hack: if the old route was
944 * cloned, then we blow it away and try
945 * re-inserting the new one.
947 oldrt = rtpurelookup(ndst);
950 if (oldrt->rt_flags & RTF_WASCLONED) {
951 rtrequest(RTM_DELETE, rt_key(oldrt),
954 oldrt->rt_flags, NULL);
955 rn = rnh->rnh_addaddr((char *)ndst,
957 rtinfo->rti_info[RTAX_NETMASK],
962 /* NOTE: rt_ifa may have been changed */
966 * If it still failed to go into the tree,
967 * then un-make it (this should be a function).
970 if (rt->rt_gwroute != NULL)
971 rtfree(rt->rt_gwroute);
979 * If we got here from RESOLVE, then we are cloning
980 * so clone the rest, and note that we
981 * are a clone (and increment the parent's references)
983 if (req == RTM_RESOLVE) {
984 rt->rt_rmx = (*ret_nrt)->rt_rmx; /* copy metrics */
985 rt->rt_rmx.rmx_pksent = 0; /* reset packet counter */
986 if ((*ret_nrt)->rt_flags &
987 (RTF_CLONING | RTF_PRCLONING)) {
988 rt->rt_parent = *ret_nrt;
989 (*ret_nrt)->rt_refcnt++;
994 * if this protocol has something to add to this then
995 * allow it to do that as well.
997 if (ifa->ifa_rtrequest != NULL)
998 ifa->ifa_rtrequest(req, rt);
1001 * We repeat the same procedure from rt_setgate() here because
1002 * it doesn't fire when we call it there because the node
1003 * hasn't been added to the tree yet.
1005 if (req == RTM_ADD && !(rt->rt_flags & RTF_HOST) &&
1006 rt_mask(rt) != NULL) {
1007 struct rtfc_arg arg = { rt, rnh };
1009 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
1010 (char *)rt_mask(rt),
1011 rt_fixchange, &arg);
1016 rt_print(rtinfo, rt);
1019 * Return the resulting rtentry,
1020 * increasing the number of references by one.
1022 if (ret_nrt != NULL) {
1034 kprintf("rti %p failed error %d\n", rtinfo, error);
1036 kprintf("rti %p succeeded\n", rtinfo);
1044 * Called from rtrequest(RTM_DELETE, ...) to fix up the route's ``family''
1045 * (i.e., the routes related to it by the operation of cloning). This
1046 * routine is iterated over all potential former-child-routes by way of
1047 * rnh->rnh_walktree_from() above, and those that actually are children of
1048 * the late parent (passed in as VP here) are themselves deleted.
1051 rt_fixdelete(struct radix_node *rn, void *vp)
1053 struct rtentry *rt = (struct rtentry *)rn;
1054 struct rtentry *rt0 = vp;
1056 if (rt->rt_parent == rt0 &&
1057 !(rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
1058 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
1059 rt->rt_flags, NULL);
1065 * This routine is called from rt_setgate() to do the analogous thing for
1066 * adds and changes. There is the added complication in this case of a
1067 * middle insert; i.e., insertion of a new network route between an older
1068 * network route and (cloned) host routes. For this reason, a simple check
1069 * of rt->rt_parent is insufficient; each candidate route must be tested
1070 * against the (mask, value) of the new route (passed as before in vp)
1071 * to see if the new route matches it.
1073 * XXX - it may be possible to do fixdelete() for changes and reserve this
1074 * routine just for adds. I'm not sure why I thought it was necessary to do
1078 static int rtfcdebug = 0;
1082 rt_fixchange(struct radix_node *rn, void *vp)
1084 struct rtentry *rt = (struct rtentry *)rn;
1085 struct rtfc_arg *ap = vp;
1086 struct rtentry *rt0 = ap->rt0;
1087 struct radix_node_head *rnh = ap->rnh;
1088 u_char *xk1, *xm1, *xk2, *xmp;
1093 kprintf("rt_fixchange: rt %p, rt0 %p\n", rt, rt0);
1096 if (rt->rt_parent == NULL ||
1097 (rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
1099 if (rtfcdebug) kprintf("no parent, pinned or cloning\n");
1104 if (rt->rt_parent == rt0) {
1106 if (rtfcdebug) kprintf("parent match\n");
1108 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
1109 rt->rt_flags, NULL);
1113 * There probably is a function somewhere which does this...
1114 * if not, there should be.
1116 len = imin(rt_key(rt0)->sa_len, rt_key(rt)->sa_len);
1118 xk1 = (u_char *)rt_key(rt0);
1119 xm1 = (u_char *)rt_mask(rt0);
1120 xk2 = (u_char *)rt_key(rt);
1122 /* avoid applying a less specific route */
1123 xmp = (u_char *)rt_mask(rt->rt_parent);
1124 mlen = rt_key(rt->rt_parent)->sa_len;
1125 if (mlen > rt_key(rt0)->sa_len) {
1128 kprintf("rt_fixchange: inserting a less "
1129 "specific route\n");
1133 for (i = rnh->rnh_treetop->rn_offset; i < mlen; i++) {
1134 if ((xmp[i] & ~(xmp[i] ^ xm1[i])) != xmp[i]) {
1137 kprintf("rt_fixchange: inserting a less "
1138 "specific route\n");
1144 for (i = rnh->rnh_treetop->rn_offset; i < len; i++) {
1145 if ((xk2[i] & xm1[i]) != xk1[i]) {
1147 if (rtfcdebug) kprintf("no match\n");
1154 * OK, this node is a clone, and matches the node currently being
1155 * changed/added under the node's mask. So, get rid of it.
1158 if (rtfcdebug) kprintf("deleting\n");
1160 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
1161 rt->rt_flags, NULL);
1165 rt_setgate(struct rtentry *rt0, struct sockaddr *dst, struct sockaddr *gate,
1166 boolean_t generate_report)
1168 char *space, *oldspace;
1169 int dlen = RT_ROUNDUP(dst->sa_len), glen = RT_ROUNDUP(gate->sa_len);
1170 struct rtentry *rt = rt0;
1171 struct radix_node_head *rnh = rt_tables[mycpuid][dst->sa_family];
1174 * A host route with the destination equal to the gateway
1175 * will interfere with keeping LLINFO in the routing
1176 * table, so disallow it.
1178 if (((rt0->rt_flags & (RTF_HOST | RTF_GATEWAY | RTF_LLINFO)) ==
1179 (RTF_HOST | RTF_GATEWAY)) &&
1180 dst->sa_len == gate->sa_len &&
1181 sa_equal(dst, gate)) {
1183 * The route might already exist if this is an RTM_CHANGE
1184 * or a routing redirect, so try to delete it.
1186 if (rt_key(rt0) != NULL)
1187 rtrequest(RTM_DELETE, rt_key(rt0), rt0->rt_gateway,
1188 rt_mask(rt0), rt0->rt_flags, NULL);
1189 return EADDRNOTAVAIL;
1193 * Both dst and gateway are stored in the same malloc'ed chunk
1194 * (If I ever get my hands on....)
1195 * if we need to malloc a new chunk, then keep the old one around
1196 * till we don't need it any more.
1198 if (rt->rt_gateway == NULL ||
1199 glen > RT_ROUNDUP(rt->rt_gateway->sa_len)) {
1200 oldspace = (char *)rt_key(rt);
1201 R_Malloc(space, char *, dlen + glen);
1204 rt->rt_nodes->rn_key = space;
1206 space = (char *)rt_key(rt); /* Just use the old space. */
1210 /* Set the gateway value. */
1211 rt->rt_gateway = (struct sockaddr *)(space + dlen);
1212 bcopy(gate, rt->rt_gateway, glen);
1214 if (oldspace != NULL) {
1216 * If we allocated a new chunk, preserve the original dst.
1217 * This way, rt_setgate() really just sets the gate
1218 * and leaves the dst field alone.
1220 bcopy(dst, space, dlen);
1225 * If there is already a gwroute, it's now almost definitely wrong
1228 if (rt->rt_gwroute != NULL) {
1229 RTFREE(rt->rt_gwroute);
1230 rt->rt_gwroute = NULL;
1232 if (rt->rt_flags & RTF_GATEWAY) {
1234 * Cloning loop avoidance: In the presence of
1235 * protocol-cloning and bad configuration, it is
1236 * possible to get stuck in bottomless mutual recursion
1237 * (rtrequest rt_setgate rtlookup). We avoid this
1238 * by not allowing protocol-cloning to operate for
1239 * gateways (which is probably the correct choice
1240 * anyway), and avoid the resulting reference loops
1241 * by disallowing any route to run through itself as
1242 * a gateway. This is obviously mandatory when we
1243 * get rt->rt_output().
1245 * This breaks TTCP for hosts outside the gateway! XXX JH
1247 rt->rt_gwroute = _rtlookup(gate, generate_report,
1249 if (rt->rt_gwroute == rt) {
1250 rt->rt_gwroute = NULL;
1252 return EDQUOT; /* failure */
1257 * This isn't going to do anything useful for host routes, so
1258 * don't bother. Also make sure we have a reasonable mask
1259 * (we don't yet have one during adds).
1261 if (!(rt->rt_flags & RTF_HOST) && rt_mask(rt) != NULL) {
1262 struct rtfc_arg arg = { rt, rnh };
1264 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
1265 (char *)rt_mask(rt),
1266 rt_fixchange, &arg);
1274 struct sockaddr *src,
1275 struct sockaddr *dst,
1276 struct sockaddr *netmask)
1278 u_char *cp1 = (u_char *)src;
1279 u_char *cp2 = (u_char *)dst;
1280 u_char *cp3 = (u_char *)netmask;
1281 u_char *cplim = cp2 + *cp3;
1282 u_char *cplim2 = cp2 + *cp1;
1284 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
1289 *cp2++ = *cp1++ & *cp3++;
1291 bzero(cp2, cplim2 - cp2);
1295 rt_llroute(struct sockaddr *dst, struct rtentry *rt0, struct rtentry **drt)
1297 struct rtentry *up_rt, *rt;
1299 if (!(rt0->rt_flags & RTF_UP)) {
1300 up_rt = rtlookup(dst);
1302 return (EHOSTUNREACH);
1306 if (up_rt->rt_flags & RTF_GATEWAY) {
1307 if (up_rt->rt_gwroute == NULL) {
1308 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
1309 if (up_rt->rt_gwroute == NULL)
1310 return (EHOSTUNREACH);
1311 } else if (!(up_rt->rt_gwroute->rt_flags & RTF_UP)) {
1312 rtfree(up_rt->rt_gwroute);
1313 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
1314 if (up_rt->rt_gwroute == NULL)
1315 return (EHOSTUNREACH);
1317 rt = up_rt->rt_gwroute;
1320 if (rt->rt_flags & RTF_REJECT &&
1321 (rt->rt_rmx.rmx_expire == 0 || /* rt doesn't expire */
1322 time_uptime < rt->rt_rmx.rmx_expire)) /* rt not expired */
1323 return (rt->rt_flags & RTF_HOST ? EHOSTDOWN : EHOSTUNREACH);
1329 rt_setshims(struct rtentry *rt, struct sockaddr **rt_shim){
1332 for (i=0; i<3; i++) {
1333 struct sockaddr *shim = rt_shim[RTAX_MPLS1 + i];
1339 shimlen = RT_ROUNDUP(shim->sa_len);
1340 R_Malloc(rt->rt_shim[i], struct sockaddr *, shimlen);
1341 bcopy(shim, rt->rt_shim[i], shimlen);
1350 * Print out a route table entry
1353 rt_print(struct rt_addrinfo *rtinfo, struct rtentry *rn)
1355 kprintf("rti %p cpu %d route %p flags %08lx: ",
1356 rtinfo, mycpuid, rn, rn->rt_flags);
1357 sockaddr_print(rt_key(rn));
1359 sockaddr_print(rt_mask(rn));
1361 sockaddr_print(rn->rt_gateway);
1362 kprintf(" ifc \"%s\"", rn->rt_ifp ? rn->rt_ifp->if_dname : "?");
1363 kprintf(" ifa %p\n", rn->rt_ifa);
1367 rt_addrinfo_print(int cmd, struct rt_addrinfo *rti)
1373 if (cmd == RTM_DELETE && route_debug > 1)
1374 print_backtrace(-1);
1388 kprintf("C%02d ", cmd);
1391 kprintf("rti %p cpu %d ", rti, mycpuid);
1392 for (i = 0; i < rti->rti_addrs; ++i) {
1393 if (rti->rti_info[i] == NULL)
1423 kprintf("(?%02d ", i);
1426 sockaddr_print(rti->rti_info[i]);
1434 sockaddr_print(struct sockaddr *sa)
1436 struct sockaddr_in *sa4;
1437 struct sockaddr_in6 *sa6;
1446 len = sa->sa_len - offsetof(struct sockaddr, sa_data[0]);
1448 switch(sa->sa_family) {
1452 switch(sa->sa_family) {
1454 sa4 = (struct sockaddr_in *)sa;
1455 kprintf("INET %d %d.%d.%d.%d",
1456 ntohs(sa4->sin_port),
1457 (ntohl(sa4->sin_addr.s_addr) >> 24) & 255,
1458 (ntohl(sa4->sin_addr.s_addr) >> 16) & 255,
1459 (ntohl(sa4->sin_addr.s_addr) >> 8) & 255,
1460 (ntohl(sa4->sin_addr.s_addr) >> 0) & 255
1464 sa6 = (struct sockaddr_in6 *)sa;
1465 kprintf("INET6 %d %04x:%04x%04x:%04x:%04x:%04x:%04x:%04x",
1466 ntohs(sa6->sin6_port),
1467 sa6->sin6_addr.s6_addr16[0],
1468 sa6->sin6_addr.s6_addr16[1],
1469 sa6->sin6_addr.s6_addr16[2],
1470 sa6->sin6_addr.s6_addr16[3],
1471 sa6->sin6_addr.s6_addr16[4],
1472 sa6->sin6_addr.s6_addr16[5],
1473 sa6->sin6_addr.s6_addr16[6],
1474 sa6->sin6_addr.s6_addr16[7]
1478 kprintf("AF%d ", sa->sa_family);
1479 while (len > 0 && sa->sa_data[len-1] == 0)
1482 for (i = 0; i < len; ++i) {
1485 kprintf("%d", (unsigned char)sa->sa_data[i]);
1495 * Set up a routing table entry, normally for an interface.
1498 rtinit(struct ifaddr *ifa, int cmd, int flags)
1500 struct sockaddr *dst, *deldst, *netmask;
1501 struct mbuf *m = NULL;
1502 struct radix_node_head *rnh;
1503 struct radix_node *rn;
1504 struct rt_addrinfo rtinfo;
1507 if (flags & RTF_HOST) {
1508 dst = ifa->ifa_dstaddr;
1511 dst = ifa->ifa_addr;
1512 netmask = ifa->ifa_netmask;
1515 * If it's a delete, check that if it exists, it's on the correct
1516 * interface or we might scrub a route to another ifa which would
1517 * be confusing at best and possibly worse.
1519 if (cmd == RTM_DELETE) {
1521 * It's a delete, so it should already exist..
1522 * If it's a net, mask off the host bits
1523 * (Assuming we have a mask)
1525 if (netmask != NULL) {
1526 m = m_get(M_NOWAIT, MT_SONAME);
1530 deldst = mtod(m, struct sockaddr *);
1531 rt_maskedcopy(dst, deldst, netmask);
1535 * Look up an rtentry that is in the routing tree and
1536 * contains the correct info.
1538 if ((rnh = rt_tables[mycpuid][dst->sa_family]) == NULL ||
1539 (rn = rnh->rnh_lookup((char *)dst,
1540 (char *)netmask, rnh)) == NULL ||
1541 ((struct rtentry *)rn)->rt_ifa != ifa ||
1542 !sa_equal((struct sockaddr *)rn->rn_key, dst)) {
1545 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1551 * One would think that as we are deleting, and we know
1552 * it doesn't exist, we could just return at this point
1553 * with an "ELSE" clause, but apparently not..
1555 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1560 * Do the actual request
1562 bzero(&rtinfo, sizeof(struct rt_addrinfo));
1563 rtinfo.rti_info[RTAX_DST] = dst;
1564 rtinfo.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1565 rtinfo.rti_info[RTAX_NETMASK] = netmask;
1566 rtinfo.rti_flags = flags | ifa->ifa_flags;
1567 rtinfo.rti_ifa = ifa;
1568 error = rtrequest1_global(cmd, &rtinfo, rtinit_rtrequest_callback, ifa,
1576 rtinit_rtrequest_callback(int cmd, int error,
1577 struct rt_addrinfo *rtinfo, struct rtentry *rt,
1580 struct ifaddr *ifa = arg;
1582 if (error == 0 && rt) {
1585 rt_newaddrmsg(cmd, ifa, error, rt);
1588 if (cmd == RTM_DELETE) {
1589 if (rt->rt_refcnt == 0) {
1598 struct netmsg_base base;
1600 struct rt_addrinfo *rtinfo;
1601 rtsearch_callback_func_t callback;
1603 boolean_t exact_match;
1608 rtsearch_global(int req, struct rt_addrinfo *rtinfo,
1609 rtsearch_callback_func_t callback, void *arg, boolean_t exact_match,
1612 struct netmsg_rts msg;
1616 flags = MSGF_PRIORITY;
1617 netmsg_init(&msg.base, NULL, &curthread->td_msgport, flags,
1618 rtsearch_msghandler);
1620 msg.rtinfo = rtinfo;
1621 msg.callback = callback;
1623 msg.exact_match = exact_match;
1625 return rt_domsg_global(&msg.base);
1629 rtsearch_msghandler(netmsg_t msg)
1631 struct netmsg_rts *rmsg = (void *)msg;
1632 struct rt_addrinfo rtinfo;
1633 struct radix_node_head *rnh;
1638 * Copy the rtinfo. We need to make sure that the original
1639 * rtinfo, which is setup by the caller, in the netmsg will
1640 * _not_ be changed; else the next CPU on the netmsg forwarding
1641 * path will see a different rtinfo than what this CPU has seen.
1643 rtinfo = *rmsg->rtinfo;
1646 * Find the correct routing tree to use for this Address Family
1648 if ((rnh = rt_tables[mycpuid][rtinfo.rti_dst->sa_family]) == NULL) {
1650 panic("partially initialized routing tables");
1651 lwkt_replymsg(&rmsg->base.lmsg, EAFNOSUPPORT);
1656 * Correct rtinfo for the host route searching.
1658 if (rtinfo.rti_flags & RTF_HOST) {
1659 rtinfo.rti_netmask = NULL;
1660 rtinfo.rti_flags &= ~(RTF_CLONING | RTF_PRCLONING);
1663 rt = (struct rtentry *)
1664 rnh->rnh_lookup((char *)rtinfo.rti_dst,
1665 (char *)rtinfo.rti_netmask, rnh);
1668 * If we are asked to do the "exact match", we need to make sure
1669 * that host route searching got a host route while a network
1670 * route searching got a network route.
1672 if (rt != NULL && rmsg->exact_match &&
1673 ((rt->rt_flags ^ rtinfo.rti_flags) & RTF_HOST))
1678 * No matching routes have been found, don't count this
1679 * as a critical error (here, we set 'error' to 0), just
1680 * keep moving on, since at least prcloned routes are not
1681 * duplicated onto each CPU.
1688 error = rmsg->callback(rmsg->req, &rtinfo, rt, rmsg->arg,
1692 if (error == EJUSTRETURN) {
1693 lwkt_replymsg(&rmsg->base.lmsg, 0);
1698 nextcpu = mycpuid + 1;
1700 KKASSERT(rmsg->found_cnt > 0);
1703 * Under following cases, unrecoverable error has
1705 * o Request is RTM_GET
1706 * o The first time that we find the route, but the
1707 * modification fails.
1709 if (rmsg->req != RTM_GET && rmsg->found_cnt > 1) {
1710 panic("rtsearch_msghandler: unrecoverable error "
1713 lwkt_replymsg(&rmsg->base.lmsg, error);
1714 } else if (nextcpu < ncpus) {
1715 lwkt_forwardmsg(netisr_cpuport(nextcpu), &rmsg->base.lmsg);
1717 if (rmsg->found_cnt == 0) {
1718 /* The requested route was never seen ... */
1721 lwkt_replymsg(&rmsg->base.lmsg, error);
1726 rtmask_add_global(struct sockaddr *mask, boolean_t req_prio)
1728 struct netmsg_base msg;
1732 flags = MSGF_PRIORITY;
1733 netmsg_init(&msg, NULL, &curthread->td_msgport, flags,
1734 rtmask_add_msghandler);
1735 msg.lmsg.u.ms_resultp = mask;
1737 return rt_domsg_global(&msg);
1741 _rtmask_lookup(struct sockaddr *mask, boolean_t search)
1743 struct radix_node *n;
1745 #define clen(s) (*(u_char *)(s))
1746 n = rn_addmask((char *)mask, search, 1, rn_cpumaskhead(mycpuid));
1748 mask->sa_len >= clen(n->rn_key) &&
1749 bcmp((char *)mask + 1,
1750 (char *)n->rn_key + 1, clen(n->rn_key) - 1) == 0) {
1751 return (struct sockaddr *)n->rn_key;
1759 rtmask_add_msghandler(netmsg_t msg)
1761 struct lwkt_msg *lmsg = &msg->lmsg;
1762 struct sockaddr *mask = lmsg->u.ms_resultp;
1763 int error = 0, nextcpu;
1765 if (rtmask_lookup(mask) == NULL)
1768 nextcpu = mycpuid + 1;
1769 if (!error && nextcpu < ncpus)
1770 lwkt_forwardmsg(netisr_cpuport(nextcpu), lmsg);
1772 lwkt_replymsg(lmsg, error);
1775 /* This must be before ip6_init2(), which is now SI_ORDER_MIDDLE */
1776 SYSINIT(route, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, 0);
1778 struct rtchange_arg {
1779 struct ifaddr *old_ifa;
1780 struct ifaddr *new_ifa;
1786 rtchange_ifa(struct rtentry *rt, struct rtchange_arg *ap)
1788 if (rt->rt_ifa->ifa_rtrequest != NULL)
1789 rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt);
1790 IFAFREE(rt->rt_ifa);
1792 IFAREF(ap->new_ifa);
1793 rt->rt_ifa = ap->new_ifa;
1794 rt->rt_ifp = ap->new_ifa->ifa_ifp;
1795 if (rt->rt_ifa->ifa_rtrequest != NULL)
1796 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt);
1802 rtchange_callback(struct radix_node *rn, void *xap)
1804 struct rtchange_arg *ap = xap;
1805 struct rtentry *rt = (struct rtentry *)rn;
1807 if (rt->rt_ifa == ap->old_ifa) {
1808 if (rt->rt_flags & (RTF_CLONING | RTF_PRCLONING)) {
1810 * We could saw the branch off when we are
1811 * still sitting on it, if the ifa_rtrequest
1812 * DEL/ADD are called directly from here.
1817 rtchange_ifa(rt, ap);
1822 struct netmsg_rtchange {
1823 struct netmsg_base base;
1824 struct ifaddr *old_ifa;
1825 struct ifaddr *new_ifa;
1830 rtchange_dispatch(netmsg_t msg)
1832 struct netmsg_rtchange *rmsg = (void *)msg;
1833 struct radix_node_head *rnh;
1834 struct rtchange_arg arg;
1839 memset(&arg, 0, sizeof(arg));
1840 arg.old_ifa = rmsg->old_ifa;
1841 arg.new_ifa = rmsg->new_ifa;
1843 rnh = rt_tables[cpu][AF_INET];
1847 KKASSERT(arg.rt == NULL);
1848 error = rnh->rnh_walktree(rnh, rtchange_callback, &arg);
1849 if (arg.rt != NULL) {
1854 rtchange_ifa(rt, &arg);
1863 if (nextcpu < ncpus)
1864 lwkt_forwardmsg(netisr_cpuport(nextcpu), &rmsg->base.lmsg);
1866 lwkt_replymsg(&rmsg->base.lmsg, 0);
1870 rtchange(struct ifaddr *old_ifa, struct ifaddr *new_ifa)
1872 struct netmsg_rtchange msg;
1875 * XXX individual requests are not independantly chained,
1876 * which means that the per-cpu route tables will not be
1877 * consistent in the middle of the operation. If routes
1878 * related to the interface are manipulated while we are
1879 * doing this the inconsistancy could trigger a panic.
1881 netmsg_init(&msg.base, NULL, &curthread->td_msgport, MSGF_PRIORITY,
1883 msg.old_ifa = old_ifa;
1884 msg.new_ifa = new_ifa;
1886 rt_domsg_global(&msg.base);
1889 old_ifa->ifa_flags &= ~IFA_ROUTE;
1890 new_ifa->ifa_flags |= IFA_ROUTE;
1898 rt_domsg_global(struct netmsg_base *nmsg)
1900 ASSERT_CANDOMSG_NETISR0(curthread);
1901 return lwkt_domsg(netisr_cpuport(0), &nmsg->lmsg, 0);