2 * Copyright (c) 1980, 1986, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 4. Neither the name of the University nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * @(#)route.c 8.3.1.1 (Berkeley) 2/23/95
32 /************************************************************************
33 * Note: In this file a 'fib' is a "forwarding information base" *
34 * Which is the new name for an in kernel routing (next hop) table. *
35 ***********************************************************************/
38 #include "opt_inet6.h"
39 #include "opt_route.h"
41 #include "opt_mrouting.h"
42 #include "opt_mpath.h"
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/syslog.h>
47 #include <sys/malloc.h>
49 #include <sys/socket.h>
50 #include <sys/sysctl.h>
51 #include <sys/syslog.h>
52 #include <sys/sysproto.h>
54 #include <sys/domain.h>
55 #include <sys/kernel.h>
58 #include <net/if_var.h>
59 #include <net/if_dl.h>
60 #include <net/route.h>
62 #include <net/flowtable.h>
65 #include <net/radix_mpath.h>
68 #include <netinet/in.h>
69 #include <netinet/ip_mroute.h>
73 #define RT_MAXFIBS UINT16_MAX
75 /* Kernel config default option. */
78 #error "ROUTETABLES defined too low"
80 #if ROUTETABLES > RT_MAXFIBS
81 #error "ROUTETABLES defined too big"
83 #define RT_NUMFIBS ROUTETABLES
84 #endif /* ROUTETABLES */
85 /* Initialize to default if not otherwise set. */
90 #if defined(INET) || defined(INET6)
92 extern void sctp_addr_change(struct ifaddr *ifa, int cmd);
97 /* This is read-only.. */
98 u_int rt_numfibs = RT_NUMFIBS;
99 SYSCTL_UINT(_net, OID_AUTO, fibs, CTLFLAG_RDTUN, &rt_numfibs, 0, "");
102 * By default add routes to all fibs for new interfaces.
103 * Once this is set to 0 then only allocate routes on interface
104 * changes for the FIB of the caller when adding a new set of addresses
105 * to an interface. XXX this is a shotgun aproach to a problem that needs
106 * a more fine grained solution.. that will come.
107 * XXX also has the problems getting the FIB from curthread which will not
108 * always work given the fib can be overridden and prefixes can be added
109 * from the network stack context.
111 VNET_DEFINE(u_int, rt_add_addr_allfibs) = 1;
112 SYSCTL_UINT(_net, OID_AUTO, add_addr_allfibs, CTLFLAG_RWTUN | CTLFLAG_VNET,
113 &VNET_NAME(rt_add_addr_allfibs), 0, "");
115 VNET_DEFINE(struct rtstat, rtstat);
116 #define V_rtstat VNET(rtstat)
118 VNET_DEFINE(struct radix_node_head *, rt_tables);
119 #define V_rt_tables VNET(rt_tables)
121 VNET_DEFINE(int, rttrash); /* routes not in table but not freed */
122 #define V_rttrash VNET(rttrash)
126 * Convert a 'struct radix_node *' to a 'struct rtentry *'.
127 * The operation can be done safely (in this code) because a
128 * 'struct rtentry' starts with two 'struct radix_node''s, the first
129 * one representing leaf nodes in the routing tree, which is
130 * what the code in radix.c passes us as a 'struct radix_node'.
132 * But because there are a lot of assumptions in this conversion,
133 * do not cast explicitly, but always use the macro below.
135 #define RNTORT(p) ((struct rtentry *)(p))
137 static VNET_DEFINE(uma_zone_t, rtzone); /* Routing table UMA zone. */
138 #define V_rtzone VNET(rtzone)
140 static int rtrequest1_fib_change(struct radix_node_head *, struct rt_addrinfo *,
141 struct rtentry **, u_int);
142 static void rt_setmetrics(const struct rt_addrinfo *, struct rtentry *);
150 static int if_updatemtu_cb(struct radix_node *, void *);
153 * handler for net.my_fibnum
156 sysctl_my_fibnum(SYSCTL_HANDLER_ARGS)
161 fibnum = curthread->td_proc->p_fibnum;
162 error = sysctl_handle_int(oidp, &fibnum, 0, req);
166 SYSCTL_PROC(_net, OID_AUTO, my_fibnum, CTLTYPE_INT|CTLFLAG_RD,
167 NULL, 0, &sysctl_my_fibnum, "I", "default FIB of caller");
169 static __inline struct radix_node_head **
170 rt_tables_get_rnh_ptr(int table, int fam)
172 struct radix_node_head **rnh;
174 KASSERT(table >= 0 && table < rt_numfibs, ("%s: table out of bounds.",
176 KASSERT(fam >= 0 && fam < (AF_MAX+1), ("%s: fam out of bounds.",
179 /* rnh is [fib=0][af=0]. */
180 rnh = (struct radix_node_head **)V_rt_tables;
181 /* Get the offset to the requested table and fam. */
182 rnh += table * (AF_MAX+1) + fam;
187 struct radix_node_head *
188 rt_tables_get_rnh(int table, int fam)
191 return (*rt_tables_get_rnh_ptr(table, fam));
195 * route initialization must occur before ip6_init2(), which happenas at
202 /* whack the tunable ints into line. */
203 if (rt_numfibs > RT_MAXFIBS)
204 rt_numfibs = RT_MAXFIBS;
208 SYSINIT(route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, 0);
211 rtentry_zinit(void *mem, int size, int how)
213 struct rtentry *rt = mem;
215 rt->rt_pksent = counter_u64_alloc(how);
216 if (rt->rt_pksent == NULL)
225 rtentry_zfini(void *mem, int size)
227 struct rtentry *rt = mem;
230 counter_u64_free(rt->rt_pksent);
234 rtentry_ctor(void *mem, int size, void *arg, int how)
236 struct rtentry *rt = mem;
238 bzero(rt, offsetof(struct rtentry, rt_endzero));
239 counter_u64_zero(rt->rt_pksent);
245 rtentry_dtor(void *mem, int size, void *arg)
247 struct rtentry *rt = mem;
253 vnet_route_init(const void *unused __unused)
256 struct radix_node_head **rnh;
260 V_rt_tables = malloc(rt_numfibs * (AF_MAX+1) *
261 sizeof(struct radix_node_head *), M_RTABLE, M_WAITOK|M_ZERO);
263 V_rtzone = uma_zcreate("rtentry", sizeof(struct rtentry),
264 rtentry_ctor, rtentry_dtor,
265 rtentry_zinit, rtentry_zfini, UMA_ALIGN_PTR, 0);
266 for (dom = domains; dom; dom = dom->dom_next) {
267 if (dom->dom_rtattach == NULL)
270 for (table = 0; table < rt_numfibs; table++) {
271 fam = dom->dom_family;
272 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
275 rnh = rt_tables_get_rnh_ptr(table, fam);
277 panic("%s: rnh NULL", __func__);
278 dom->dom_rtattach((void **)rnh, 0);
282 VNET_SYSINIT(vnet_route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_FOURTH,
287 vnet_route_uninit(const void *unused __unused)
292 struct radix_node_head **rnh;
294 for (dom = domains; dom; dom = dom->dom_next) {
295 if (dom->dom_rtdetach == NULL)
298 for (table = 0; table < rt_numfibs; table++) {
299 fam = dom->dom_family;
301 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
304 rnh = rt_tables_get_rnh_ptr(table, fam);
306 panic("%s: rnh NULL", __func__);
307 dom->dom_rtdetach((void **)rnh, 0);
311 free(V_rt_tables, M_RTABLE);
312 uma_zdestroy(V_rtzone);
314 VNET_SYSUNINIT(vnet_route_uninit, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD,
315 vnet_route_uninit, 0);
318 #ifndef _SYS_SYSPROTO_H_
324 sys_setfib(struct thread *td, struct setfib_args *uap)
326 if (uap->fibnum < 0 || uap->fibnum >= rt_numfibs)
328 td->td_proc->p_fibnum = uap->fibnum;
333 * Packet routing routines.
336 rtalloc(struct route *ro)
339 rtalloc_ign_fib(ro, 0UL, RT_DEFAULT_FIB);
343 rtalloc_fib(struct route *ro, u_int fibnum)
345 rtalloc_ign_fib(ro, 0UL, fibnum);
349 rtalloc_ign(struct route *ro, u_long ignore)
353 if ((rt = ro->ro_rt) != NULL) {
354 if (rt->rt_ifp != NULL && rt->rt_flags & RTF_UP)
359 ro->ro_rt = rtalloc1_fib(&ro->ro_dst, 1, ignore, RT_DEFAULT_FIB);
361 RT_UNLOCK(ro->ro_rt);
365 rtalloc_ign_fib(struct route *ro, u_long ignore, u_int fibnum)
369 if ((rt = ro->ro_rt) != NULL) {
370 if (rt->rt_ifp != NULL && rt->rt_flags & RTF_UP)
375 ro->ro_rt = rtalloc1_fib(&ro->ro_dst, 1, ignore, fibnum);
377 RT_UNLOCK(ro->ro_rt);
381 * Look up the route that matches the address given
382 * Or, at least try.. Create a cloned route if needed.
384 * The returned route, if any, is locked.
387 rtalloc1(struct sockaddr *dst, int report, u_long ignflags)
390 return (rtalloc1_fib(dst, report, ignflags, RT_DEFAULT_FIB));
394 rtalloc1_fib(struct sockaddr *dst, int report, u_long ignflags,
397 struct radix_node_head *rnh;
398 struct radix_node *rn;
399 struct rtentry *newrt;
400 struct rt_addrinfo info;
401 int err = 0, msgtype = RTM_MISS;
404 KASSERT((fibnum < rt_numfibs), ("rtalloc1_fib: bad fibnum"));
405 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
411 * Look up the address in the table for that Address Family
413 needlock = !(ignflags & RTF_RNH_LOCKED);
415 RADIX_NODE_HEAD_RLOCK(rnh);
418 RADIX_NODE_HEAD_LOCK_ASSERT(rnh);
420 rn = rnh->rnh_matchaddr(dst, rnh);
421 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
426 RADIX_NODE_HEAD_RUNLOCK(rnh);
430 RADIX_NODE_HEAD_RUNLOCK(rnh);
433 * Either we hit the root or couldn't find any match,
434 * Which basically means
435 * "caint get there frm here"
438 V_rtstat.rts_unreach++;
442 * If required, report the failure to the supervising
444 * For a delete, this is not an error. (report == 0)
446 bzero(&info, sizeof(info));
447 info.rti_info[RTAX_DST] = dst;
448 rt_missmsg_fib(msgtype, &info, 0, err, fibnum);
452 RT_LOCK_ASSERT(newrt);
457 * Remove a reference count from an rtentry.
458 * If the count gets low enough, take it out of the routing table
461 rtfree(struct rtentry *rt)
463 struct radix_node_head *rnh;
465 KASSERT(rt != NULL,("%s: NULL rt", __func__));
466 rnh = rt_tables_get_rnh(rt->rt_fibnum, rt_key(rt)->sa_family);
467 KASSERT(rnh != NULL,("%s: NULL rnh", __func__));
472 * The callers should use RTFREE_LOCKED() or RTFREE(), so
473 * we should come here exactly with the last reference.
476 if (rt->rt_refcnt > 0) {
477 log(LOG_DEBUG, "%s: %p has %d refs\n", __func__, rt, rt->rt_refcnt);
482 * On last reference give the "close method" a chance
483 * to cleanup private state. This also permits (for
484 * IPv4 and IPv6) a chance to decide if the routing table
485 * entry should be purged immediately or at a later time.
486 * When an immediate purge is to happen the close routine
487 * typically calls rtexpunge which clears the RTF_UP flag
488 * on the entry so that the code below reclaims the storage.
490 if (rt->rt_refcnt == 0 && rnh->rnh_close)
491 rnh->rnh_close((struct radix_node *)rt, rnh);
494 * If we are no longer "up" (and ref == 0)
495 * then we can free the resources associated
498 if ((rt->rt_flags & RTF_UP) == 0) {
499 if (rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT))
502 * the rtentry must have been removed from the routing table
503 * so it is represented in rttrash.. remove that now.
507 if (rt->rt_refcnt < 0) {
508 printf("rtfree: %p not freed (neg refs)\n", rt);
513 * release references on items we hold them on..
514 * e.g other routes and ifaddrs.
517 ifa_free(rt->rt_ifa);
519 * The key is separatly alloc'd so free it (see rt_setgate()).
520 * This also frees the gateway, as they are always malloc'd
526 * and the rtentry itself of course
528 uma_zfree(V_rtzone, rt);
537 * Force a routing table entry to the specified
538 * destination to go through the given gateway.
539 * Normally called as a result of a routing redirect
540 * message from the network layer.
543 rtredirect(struct sockaddr *dst,
544 struct sockaddr *gateway,
545 struct sockaddr *netmask,
547 struct sockaddr *src)
550 rtredirect_fib(dst, gateway, netmask, flags, src, RT_DEFAULT_FIB);
554 rtredirect_fib(struct sockaddr *dst,
555 struct sockaddr *gateway,
556 struct sockaddr *netmask,
558 struct sockaddr *src,
561 struct rtentry *rt, *rt0 = NULL;
564 struct rt_addrinfo info;
566 struct radix_node_head *rnh;
569 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
571 error = EAFNOSUPPORT;
575 /* verify the gateway is directly reachable */
576 if ((ifa = ifa_ifwithnet(gateway, 0, fibnum)) == NULL) {
580 rt = rtalloc1_fib(dst, 0, 0UL, fibnum); /* NB: rt is locked */
582 * If the redirect isn't from our current router for this dst,
583 * it's either old or wrong. If it redirects us to ourselves,
584 * we have a routing loop, perhaps as a result of an interface
585 * going down recently.
587 if (!(flags & RTF_DONE) && rt &&
588 (!sa_equal(src, rt->rt_gateway) || rt->rt_ifa != ifa))
590 else if (ifa_ifwithaddr_check(gateway))
591 error = EHOSTUNREACH;
595 * Create a new entry if we just got back a wildcard entry
596 * or the lookup failed. This is necessary for hosts
597 * which use routing redirects generated by smart gateways
598 * to dynamically build the routing tables.
600 if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
603 * Don't listen to the redirect if it's
604 * for a route to an interface.
606 if (rt->rt_flags & RTF_GATEWAY) {
607 if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
609 * Changing from route to net => route to host.
610 * Create new route, rather than smashing route to net.
616 flags |= RTF_GATEWAY | RTF_DYNAMIC;
617 bzero((caddr_t)&info, sizeof(info));
618 info.rti_info[RTAX_DST] = dst;
619 info.rti_info[RTAX_GATEWAY] = gateway;
620 info.rti_info[RTAX_NETMASK] = netmask;
622 info.rti_flags = flags;
624 RT_UNLOCK(rt0); /* drop lock to avoid LOR with RNH */
625 error = rtrequest1_fib(RTM_ADD, &info, &rt, fibnum);
629 EVENTHANDLER_INVOKE(route_redirect_event, rt0, rt, dst);
630 flags = rt->rt_flags;
635 stat = &V_rtstat.rts_dynamic;
637 struct rtentry *gwrt;
640 * Smash the current notion of the gateway to
641 * this destination. Should check about netmask!!!
643 rt->rt_flags |= RTF_MODIFIED;
644 flags |= RTF_MODIFIED;
645 stat = &V_rtstat.rts_newgateway;
647 * add the key and gateway (in one malloc'd chunk).
650 RADIX_NODE_HEAD_LOCK(rnh);
652 rt_setgate(rt, rt_key(rt), gateway);
653 gwrt = rtalloc1(gateway, 1, RTF_RNH_LOCKED);
654 RADIX_NODE_HEAD_UNLOCK(rnh);
655 EVENTHANDLER_INVOKE(route_redirect_event, rt, gwrt, dst);
659 error = EHOSTUNREACH;
665 V_rtstat.rts_badredirect++;
666 else if (stat != NULL)
668 bzero((caddr_t)&info, sizeof(info));
669 info.rti_info[RTAX_DST] = dst;
670 info.rti_info[RTAX_GATEWAY] = gateway;
671 info.rti_info[RTAX_NETMASK] = netmask;
672 info.rti_info[RTAX_AUTHOR] = src;
673 rt_missmsg_fib(RTM_REDIRECT, &info, flags, error, fibnum);
679 rtioctl(u_long req, caddr_t data)
682 return (rtioctl_fib(req, data, RT_DEFAULT_FIB));
686 * Routing table ioctl interface.
689 rtioctl_fib(u_long req, caddr_t data, u_int fibnum)
693 * If more ioctl commands are added here, make sure the proper
694 * super-user checks are being performed because it is possible for
695 * prison-root to make it this far if raw sockets have been enabled
699 /* Multicast goop, grrr... */
700 return mrt_ioctl ? mrt_ioctl(req, data, fibnum) : EOPNOTSUPP;
707 ifa_ifwithroute(int flags, struct sockaddr *dst, struct sockaddr *gateway,
713 if ((flags & RTF_GATEWAY) == 0) {
715 * If we are adding a route to an interface,
716 * and the interface is a pt to pt link
717 * we should search for the destination
718 * as our clue to the interface. Otherwise
719 * we can use the local address.
722 if (flags & RTF_HOST)
723 ifa = ifa_ifwithdstaddr(dst, fibnum);
725 ifa = ifa_ifwithaddr(gateway);
728 * If we are adding a route to a remote net
729 * or host, the gateway may still be on the
730 * other end of a pt to pt link.
732 ifa = ifa_ifwithdstaddr(gateway, fibnum);
735 ifa = ifa_ifwithnet(gateway, 0, fibnum);
737 struct rtentry *rt = rtalloc1_fib(gateway, 0, RTF_RNH_LOCKED, fibnum);
741 * dismiss a gateway that is reachable only
742 * through the default router
744 switch (gateway->sa_family) {
746 if (satosin(rt_key(rt))->sin_addr.s_addr == INADDR_ANY)
750 if (IN6_IS_ADDR_UNSPECIFIED(&satosin6(rt_key(rt))->sin6_addr))
756 if (!not_found && rt->rt_ifa != NULL) {
762 if (not_found || ifa == NULL)
765 if (ifa->ifa_addr->sa_family != dst->sa_family) {
766 struct ifaddr *oifa = ifa;
767 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
777 * Do appropriate manipulations of a routing tree given
778 * all the bits of info needed
782 struct sockaddr *dst,
783 struct sockaddr *gateway,
784 struct sockaddr *netmask,
786 struct rtentry **ret_nrt)
789 return (rtrequest_fib(req, dst, gateway, netmask, flags, ret_nrt,
794 rtrequest_fib(int req,
795 struct sockaddr *dst,
796 struct sockaddr *gateway,
797 struct sockaddr *netmask,
799 struct rtentry **ret_nrt,
802 struct rt_addrinfo info;
804 if (dst->sa_len == 0)
807 bzero((caddr_t)&info, sizeof(info));
808 info.rti_flags = flags;
809 info.rti_info[RTAX_DST] = dst;
810 info.rti_info[RTAX_GATEWAY] = gateway;
811 info.rti_info[RTAX_NETMASK] = netmask;
812 return rtrequest1_fib(req, &info, ret_nrt, fibnum);
816 * These (questionable) definitions of apparent local variables apply
817 * to the next two functions. XXXXXX!!!
819 #define dst info->rti_info[RTAX_DST]
820 #define gateway info->rti_info[RTAX_GATEWAY]
821 #define netmask info->rti_info[RTAX_NETMASK]
822 #define ifaaddr info->rti_info[RTAX_IFA]
823 #define ifpaddr info->rti_info[RTAX_IFP]
824 #define flags info->rti_flags
827 rt_getifa(struct rt_addrinfo *info)
830 return (rt_getifa_fib(info, RT_DEFAULT_FIB));
834 * Look up rt_addrinfo for a specific fib. Note that if rti_ifa is defined,
835 * it will be referenced so the caller must free it.
838 rt_getifa_fib(struct rt_addrinfo *info, u_int fibnum)
844 * ifp may be specified by sockaddr_dl
845 * when protocol address is ambiguous.
847 if (info->rti_ifp == NULL && ifpaddr != NULL &&
848 ifpaddr->sa_family == AF_LINK &&
849 (ifa = ifa_ifwithnet(ifpaddr, 0, fibnum)) != NULL) {
850 info->rti_ifp = ifa->ifa_ifp;
853 if (info->rti_ifa == NULL && ifaaddr != NULL)
854 info->rti_ifa = ifa_ifwithaddr(ifaaddr);
855 if (info->rti_ifa == NULL) {
858 sa = ifaaddr != NULL ? ifaaddr :
859 (gateway != NULL ? gateway : dst);
860 if (sa != NULL && info->rti_ifp != NULL)
861 info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
862 else if (dst != NULL && gateway != NULL)
863 info->rti_ifa = ifa_ifwithroute(flags, dst, gateway,
866 info->rti_ifa = ifa_ifwithroute(flags, sa, sa,
869 if ((ifa = info->rti_ifa) != NULL) {
870 if (info->rti_ifp == NULL)
871 info->rti_ifp = ifa->ifa_ifp;
878 * Expunges references to a route that's about to be reclaimed.
879 * The route must be locked.
882 rt_expunge(struct radix_node_head *rnh, struct rtentry *rt)
884 #if !defined(RADIX_MPATH)
885 struct radix_node *rn;
887 struct rt_addrinfo info;
895 RADIX_NODE_HEAD_LOCK_ASSERT(rnh);
899 bzero(&info, sizeof(info));
900 info.rti_ifp = rt->rt_ifp;
901 info.rti_flags = RTF_RNH_LOCKED;
902 info.rti_info[RTAX_DST] = rt_key(rt);
903 info.rti_info[RTAX_GATEWAY] = rt->rt_ifa->ifa_addr;
906 error = rtrequest1_fib(RTM_DELETE, &info, &rt0, fib);
908 if (error == 0 && rt0 != NULL) {
911 } else if (error != 0) {
917 * Remove the item from the tree; it should be there,
918 * but when callers invoke us blindly it may not (sigh).
920 rn = rnh->rnh_deladdr(rt_key(rt), rt_mask(rt), rnh);
925 KASSERT((rn->rn_flags & (RNF_ACTIVE | RNF_ROOT)) == 0,
926 ("unexpected flags 0x%x", rn->rn_flags));
927 KASSERT(rt == RNTORT(rn),
928 ("lookup mismatch, rt %p rn %p", rt, rn));
929 #endif /* RADIX_MPATH */
931 rt->rt_flags &= ~RTF_UP;
934 * Give the protocol a chance to keep things in sync.
936 if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest) {
937 struct rt_addrinfo info;
939 bzero((caddr_t)&info, sizeof(info));
940 info.rti_flags = rt->rt_flags;
941 info.rti_info[RTAX_DST] = rt_key(rt);
942 info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
943 info.rti_info[RTAX_NETMASK] = rt_mask(rt);
944 ifa->ifa_rtrequest(RTM_DELETE, rt, &info);
948 * one more rtentry floating around that is not
949 * linked to the routing table.
952 #if !defined(RADIX_MPATH)
959 if_updatemtu_cb(struct radix_node *rn, void *arg)
962 struct if_mtuinfo *ifmtu;
964 rt = (struct rtentry *)rn;
965 ifmtu = (struct if_mtuinfo *)arg;
967 if (rt->rt_ifp != ifmtu->ifp)
970 if (rt->rt_mtu >= ifmtu->mtu) {
971 /* We have to decrease mtu regardless of flags */
972 rt->rt_mtu = ifmtu->mtu;
977 * New MTU is bigger. Check if are allowed to alter it
979 if ((rt->rt_flags & (RTF_FIXEDMTU | RTF_GATEWAY | RTF_HOST)) != 0) {
982 * Skip routes with user-supplied MTU and
983 * non-interface routes
988 /* We are safe to update route MTU */
989 rt->rt_mtu = ifmtu->mtu;
995 rt_updatemtu(struct ifnet *ifp)
997 struct if_mtuinfo ifmtu;
998 struct radix_node_head *rnh;
1004 * Try to update rt_mtu for all routes using this interface
1005 * Unfortunately the only way to do this is to traverse all
1006 * routing tables in all fibs/domains.
1008 for (i = 1; i <= AF_MAX; i++) {
1009 ifmtu.mtu = if_getmtu_family(ifp, i);
1010 for (j = 0; j < rt_numfibs; j++) {
1011 rnh = rt_tables_get_rnh(j, i);
1014 RADIX_NODE_HEAD_LOCK(rnh);
1015 rnh->rnh_walktree(rnh, if_updatemtu_cb, &ifmtu);
1016 RADIX_NODE_HEAD_UNLOCK(rnh);
1023 int p_sockaddr(char *buf, int buflen, struct sockaddr *s);
1024 int rt_print(char *buf, int buflen, struct rtentry *rt);
1027 p_sockaddr(char *buf, int buflen, struct sockaddr *s)
1031 switch (s->sa_family) {
1033 paddr = &((struct sockaddr_in *)s)->sin_addr;
1036 paddr = &((struct sockaddr_in6 *)s)->sin6_addr;
1043 if (inet_ntop(s->sa_family, paddr, buf, buflen) == NULL)
1046 return (strlen(buf));
1050 rt_print(char *buf, int buflen, struct rtentry *rt)
1052 struct sockaddr *addr, *mask;
1058 i = p_sockaddr(buf, buflen, addr);
1059 if (!(rt->rt_flags & RTF_HOST)) {
1061 i += p_sockaddr(buf + i, buflen - i, mask);
1064 if (rt->rt_flags & RTF_GATEWAY) {
1066 i += p_sockaddr(buf + i, buflen - i, rt->rt_gateway);
1075 rn_mpath_update(int req, struct rt_addrinfo *info,
1076 struct radix_node_head *rnh, struct rtentry **ret_nrt)
1079 * if we got multipath routes, we require users to specify
1080 * a matching RTAX_GATEWAY.
1082 struct rtentry *rt, *rto = NULL;
1083 struct radix_node *rn;
1086 rn = rnh->rnh_lookup(dst, netmask, rnh);
1089 rto = rt = RNTORT(rn);
1091 rt = rt_mpath_matchgate(rt, gateway);
1095 * this is the first entry in the chain
1098 rn = rn_mpath_next((struct radix_node *)rt);
1100 * there is another entry, now it's active
1105 rto->rt_flags |= RTF_UP;
1107 } else if (rt->rt_flags & RTF_GATEWAY) {
1109 * For gateway routes, we need to
1110 * make sure that we we are deleting
1111 * the correct gateway.
1112 * rt_mpath_matchgate() does not
1113 * check the case when there is only
1114 * one route in the chain.
1117 (rt->rt_gateway->sa_len != gateway->sa_len ||
1118 memcmp(rt->rt_gateway, gateway, gateway->sa_len)))
1122 * remove from tree before returning it
1125 rn = rnh->rnh_deladdr(dst, netmask, rnh);
1126 KASSERT(rt == RNTORT(rn), ("radix node disappeared"));
1132 * use the normal delete code to remove
1135 if (req != RTM_DELETE)
1143 * if the entry is 2nd and on up
1145 if ((req == RTM_DELETE) && !rt_mpath_deldup(rto, rt))
1146 panic ("rtrequest1: rt_mpath_deldup");
1150 if (req == RTM_DELETE) {
1151 rt->rt_flags &= ~RTF_UP;
1153 * One more rtentry floating around that is not
1154 * linked to the routing table. rttrash will be decremented
1155 * when RTFREE(rt) is eventually called.
1161 if (req != RTM_DELETE)
1162 panic("unrecognized request %d", req);
1166 * If the caller wants it, then it can have it,
1167 * but it's up to it to free the rtentry as we won't be
1181 rtrequest1_fib(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt,
1184 int error = 0, needlock = 0;
1187 struct rtentry *rt0;
1189 struct radix_node *rn;
1190 struct radix_node_head *rnh;
1192 struct sockaddr *ndst;
1193 struct sockaddr_storage mdst;
1194 #define senderr(x) { error = x ; goto bad; }
1196 KASSERT((fibnum < rt_numfibs), ("rtrequest1_fib: bad fibnum"));
1197 switch (dst->sa_family) {
1200 /* We support multiple FIBs. */
1203 fibnum = RT_DEFAULT_FIB;
1208 * Find the correct routing tree to use for this Address Family
1210 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1212 return (EAFNOSUPPORT);
1213 needlock = ((flags & RTF_RNH_LOCKED) == 0);
1214 flags &= ~RTF_RNH_LOCKED;
1216 RADIX_NODE_HEAD_LOCK(rnh);
1218 RADIX_NODE_HEAD_LOCK_ASSERT(rnh);
1220 * If we are adding a host route then we don't want to put
1221 * a netmask in the tree, nor do we want to clone it.
1223 if (flags & RTF_HOST)
1229 rt_maskedcopy(dst, (struct sockaddr *)&mdst, netmask);
1230 dst = (struct sockaddr *)&mdst;
1233 if (rn_mpath_capable(rnh)) {
1234 error = rn_mpath_update(req, info, rnh, ret_nrt);
1236 * "bad" holds true for the success case
1239 if (error != ENOENT)
1244 if ((flags & RTF_PINNED) == 0) {
1245 /* Check if target route can be deleted */
1246 rt = (struct rtentry *)rnh->rnh_lookup(dst,
1248 if ((rt != NULL) && (rt->rt_flags & RTF_PINNED))
1249 senderr(EADDRINUSE);
1253 * Remove the item from the tree and return it.
1254 * Complain if it is not there and do no more processing.
1256 rn = rnh->rnh_deladdr(dst, netmask, rnh);
1259 if (rn->rn_flags & (RNF_ACTIVE | RNF_ROOT))
1260 panic ("rtrequest delete");
1264 rt->rt_flags &= ~RTF_UP;
1267 * give the protocol a chance to keep things in sync.
1269 if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest)
1270 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1273 * One more rtentry floating around that is not
1274 * linked to the routing table. rttrash will be decremented
1275 * when RTFREE(rt) is eventually called.
1280 * If the caller wants it, then it can have it,
1281 * but it's up to it to free the rtentry as we won't be
1292 * resolve was only used for route cloning
1297 if ((flags & RTF_GATEWAY) && !gateway)
1299 if (dst && gateway && (dst->sa_family != gateway->sa_family) &&
1300 (gateway->sa_family != AF_UNSPEC) && (gateway->sa_family != AF_LINK))
1303 if (info->rti_ifa == NULL) {
1304 error = rt_getifa_fib(info, fibnum);
1308 ifa_ref(info->rti_ifa);
1309 ifa = info->rti_ifa;
1310 rt = uma_zalloc(V_rtzone, M_NOWAIT);
1315 rt->rt_flags = RTF_UP | flags;
1316 rt->rt_fibnum = fibnum;
1318 * Add the gateway. Possibly re-malloc-ing the storage for it.
1321 if ((error = rt_setgate(rt, dst, gateway)) != 0) {
1323 uma_zfree(V_rtzone, rt);
1328 * point to the (possibly newly malloc'd) dest address.
1330 ndst = (struct sockaddr *)rt_key(rt);
1333 * make sure it contains the value we want (masked if needed).
1336 rt_maskedcopy(dst, ndst, netmask);
1338 bcopy(dst, ndst, dst->sa_len);
1341 * We use the ifa reference returned by rt_getifa_fib().
1342 * This moved from below so that rnh->rnh_addaddr() can
1343 * examine the ifa and ifa->ifa_ifp if it so desires.
1346 rt->rt_ifp = ifa->ifa_ifp;
1349 rt_setmetrics(info, rt);
1352 /* do not permit exactly the same dst/mask/gw pair */
1353 if (rn_mpath_capable(rnh) &&
1354 rt_mpath_conflict(rnh, rt, netmask)) {
1355 ifa_free(rt->rt_ifa);
1357 uma_zfree(V_rtzone, rt);
1364 /* "flow-table" only supports IPv6 and IPv4 at the moment. */
1365 switch (dst->sa_family) {
1372 #if defined(INET6) || defined(INET)
1373 rn = rnh->rnh_matchaddr(dst, rnh);
1374 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
1375 struct sockaddr *mask;
1380 * compare mask to see if the new route is
1381 * more specific than the existing one
1388 * A host route is already present, so
1389 * leave the flow-table entries as is.
1391 if (rt0->rt_flags & RTF_HOST) {
1394 } else if (!(flags & RTF_HOST) && netmask) {
1395 mask = rt_mask(rt0);
1398 n = (u_char *)netmask;
1405 if (len == 0 || (*n < *m)) {
1411 #endif/* INET6 || INET */
1413 #endif /* FLOWTABLE */
1415 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
1416 rn = rnh->rnh_addaddr(ndst, netmask, rnh, rt->rt_nodes);
1418 * If it still failed to go into the tree,
1419 * then un-make it (this should be a function)
1422 ifa_free(rt->rt_ifa);
1424 uma_zfree(V_rtzone, rt);
1432 else if (rt0 != NULL) {
1433 flowtable_route_flush(dst->sa_family, rt0);
1439 * If this protocol has something to add to this then
1440 * allow it to do that as well.
1442 if (ifa->ifa_rtrequest)
1443 ifa->ifa_rtrequest(req, rt, info);
1446 * actually return a resultant rtentry and
1447 * give the caller a single reference.
1456 error = rtrequest1_fib_change(rnh, info, ret_nrt, fibnum);
1463 RADIX_NODE_HEAD_UNLOCK(rnh);
1476 rtrequest1_fib_change(struct radix_node_head *rnh, struct rt_addrinfo *info,
1477 struct rtentry **ret_nrt, u_int fibnum)
1479 struct rtentry *rt = NULL;
1483 struct if_mtuinfo ifmtu;
1485 rt = (struct rtentry *)rnh->rnh_lookup(info->rti_info[RTAX_DST],
1486 info->rti_info[RTAX_NETMASK], rnh);
1493 * If we got multipath routes,
1494 * we require users to specify a matching RTAX_GATEWAY.
1496 if (rn_mpath_capable(rnh)) {
1497 rt = rt_mpath_matchgate(rt, info->rti_info[RTAX_GATEWAY]);
1505 rt_setmetrics(info, rt);
1508 * New gateway could require new ifaddr, ifp;
1509 * flags may also be different; ifp may be specified
1510 * by ll sockaddr when protocol address is ambiguous
1512 if (((rt->rt_flags & RTF_GATEWAY) &&
1513 info->rti_info[RTAX_GATEWAY] != NULL) ||
1514 info->rti_info[RTAX_IFP] != NULL ||
1515 (info->rti_info[RTAX_IFA] != NULL &&
1516 !sa_equal(info->rti_info[RTAX_IFA], rt->rt_ifa->ifa_addr))) {
1518 error = rt_getifa_fib(info, fibnum);
1519 if (info->rti_ifa != NULL)
1526 /* Check if outgoing interface has changed */
1527 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa &&
1528 rt->rt_ifa != NULL && rt->rt_ifa->ifa_rtrequest != NULL) {
1529 rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1530 ifa_free(rt->rt_ifa);
1532 /* Update gateway address */
1533 if (info->rti_info[RTAX_GATEWAY] != NULL) {
1534 error = rt_setgate(rt, rt_key(rt), info->rti_info[RTAX_GATEWAY]);
1538 rt->rt_flags &= ~RTF_GATEWAY;
1539 rt->rt_flags |= (RTF_GATEWAY & info->rti_flags);
1542 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa) {
1543 ifa_ref(info->rti_ifa);
1544 rt->rt_ifa = info->rti_ifa;
1545 rt->rt_ifp = info->rti_ifp;
1547 /* Allow some flags to be toggled on change. */
1548 rt->rt_flags &= ~RTF_FMASK;
1549 rt->rt_flags |= info->rti_flags & RTF_FMASK;
1551 if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest != NULL)
1552 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, info);
1554 /* Alter route MTU if necessary */
1555 if (rt->rt_ifp != NULL) {
1556 family = info->rti_info[RTAX_DST]->sa_family;
1557 mtu = if_getmtu_family(rt->rt_ifp, family);
1558 /* Set default MTU */
1559 if (rt->rt_mtu == 0)
1561 if (rt->rt_mtu != mtu) {
1562 /* Check if we really need to update */
1563 ifmtu.ifp = rt->rt_ifp;
1565 if_updatemtu_cb(rt->rt_nodes, &ifmtu);
1576 ifa_free(info->rti_ifa);
1581 rt_setmetrics(const struct rt_addrinfo *info, struct rtentry *rt)
1584 if (info->rti_mflags & RTV_MTU) {
1585 if (info->rti_rmx->rmx_mtu != 0) {
1588 * MTU was explicitly provided by user.
1591 rt->rt_flags |= RTF_FIXEDMTU;
1595 * User explicitly sets MTU to 0.
1596 * Assume rollback to default.
1598 rt->rt_flags &= ~RTF_FIXEDMTU;
1600 rt->rt_mtu = info->rti_rmx->rmx_mtu;
1602 if (info->rti_mflags & RTV_WEIGHT)
1603 rt->rt_weight = info->rti_rmx->rmx_weight;
1604 /* Kernel -> userland timebase conversion. */
1605 if (info->rti_mflags & RTV_EXPIRE)
1606 rt->rt_expire = info->rti_rmx->rmx_expire ?
1607 info->rti_rmx->rmx_expire - time_second + time_uptime : 0;
1611 rt_setgate(struct rtentry *rt, struct sockaddr *dst, struct sockaddr *gate)
1613 /* XXX dst may be overwritten, can we move this to below */
1614 int dlen = SA_SIZE(dst), glen = SA_SIZE(gate);
1616 struct radix_node_head *rnh;
1618 rnh = rt_tables_get_rnh(rt->rt_fibnum, dst->sa_family);
1622 RADIX_NODE_HEAD_LOCK_ASSERT(rnh);
1625 * Prepare to store the gateway in rt->rt_gateway.
1626 * Both dst and gateway are stored one after the other in the same
1627 * malloc'd chunk. If we have room, we can reuse the old buffer,
1628 * rt_gateway already points to the right place.
1629 * Otherwise, malloc a new block and update the 'dst' address.
1631 if (rt->rt_gateway == NULL || glen > SA_SIZE(rt->rt_gateway)) {
1634 R_Malloc(new, caddr_t, dlen + glen);
1638 * XXX note, we copy from *dst and not *rt_key(rt) because
1639 * rt_setgate() can be called to initialize a newly
1640 * allocated route entry, in which case rt_key(rt) == NULL
1641 * (and also rt->rt_gateway == NULL).
1642 * Free()/free() handle a NULL argument just fine.
1644 bcopy(dst, new, dlen);
1645 Free(rt_key(rt)); /* free old block, if any */
1646 rt_key(rt) = (struct sockaddr *)new;
1647 rt->rt_gateway = (struct sockaddr *)(new + dlen);
1651 * Copy the new gateway value into the memory chunk.
1653 bcopy(gate, rt->rt_gateway, glen);
1659 rt_maskedcopy(struct sockaddr *src, struct sockaddr *dst, struct sockaddr *netmask)
1661 u_char *cp1 = (u_char *)src;
1662 u_char *cp2 = (u_char *)dst;
1663 u_char *cp3 = (u_char *)netmask;
1664 u_char *cplim = cp2 + *cp3;
1665 u_char *cplim2 = cp2 + *cp1;
1667 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
1672 *cp2++ = *cp1++ & *cp3++;
1674 bzero((caddr_t)cp2, (unsigned)(cplim2 - cp2));
1678 * Set up a routing table entry, normally
1681 #define _SOCKADDR_TMPSIZE 128 /* Not too big.. kernel stack size is limited */
1683 rtinit1(struct ifaddr *ifa, int cmd, int flags, int fibnum)
1685 struct sockaddr *dst;
1686 struct sockaddr *netmask;
1687 struct rtentry *rt = NULL;
1688 struct rt_addrinfo info;
1690 int startfib, endfib;
1691 char tempbuf[_SOCKADDR_TMPSIZE];
1694 static struct sockaddr_dl null_sdl = {sizeof(null_sdl), AF_LINK};
1695 struct radix_node_head *rnh;
1697 if (flags & RTF_HOST) {
1698 dst = ifa->ifa_dstaddr;
1701 dst = ifa->ifa_addr;
1702 netmask = ifa->ifa_netmask;
1704 if (dst->sa_len == 0)
1706 switch (dst->sa_family) {
1709 /* We support multiple FIBs. */
1712 fibnum = RT_DEFAULT_FIB;
1715 if (fibnum == RT_ALL_FIBS) {
1716 if (V_rt_add_addr_allfibs == 0 && cmd == (int)RTM_ADD)
1717 startfib = endfib = ifa->ifa_ifp->if_fib;
1720 endfib = rt_numfibs - 1;
1723 KASSERT((fibnum < rt_numfibs), ("rtinit1: bad fibnum"));
1729 * If it's a delete, check that if it exists,
1730 * it's on the correct interface or we might scrub
1731 * a route to another ifa which would
1732 * be confusing at best and possibly worse.
1734 if (cmd == RTM_DELETE) {
1736 * It's a delete, so it should already exist..
1737 * If it's a net, mask off the host bits
1738 * (Assuming we have a mask)
1739 * XXX this is kinda inet specific..
1741 if (netmask != NULL) {
1742 rt_maskedcopy(dst, (struct sockaddr *)tempbuf, netmask);
1743 dst = (struct sockaddr *)tempbuf;
1747 * Now go through all the requested tables (fibs) and do the
1748 * requested action. Realistically, this will either be fib 0
1749 * for protocols that don't do multiple tables or all the
1750 * tables for those that do.
1752 for ( fibnum = startfib; fibnum <= endfib; fibnum++) {
1753 if (cmd == RTM_DELETE) {
1754 struct radix_node *rn;
1756 * Look up an rtentry that is in the routing tree and
1757 * contains the correct info.
1759 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1761 /* this table doesn't exist but others might */
1763 RADIX_NODE_HEAD_RLOCK(rnh);
1764 rn = rnh->rnh_lookup(dst, netmask, rnh);
1766 if (rn_mpath_capable(rnh)) {
1773 * for interface route the
1774 * rt->rt_gateway is sockaddr_intf
1775 * for cloning ARP entries, so
1776 * rt_mpath_matchgate must use the
1779 rt = rt_mpath_matchgate(rt,
1786 error = (rn == NULL ||
1787 (rn->rn_flags & RNF_ROOT) ||
1788 RNTORT(rn)->rt_ifa != ifa);
1789 RADIX_NODE_HEAD_RUNLOCK(rnh);
1791 /* this is only an error if bad on ALL tables */
1796 * Do the actual request
1798 bzero((caddr_t)&info, sizeof(info));
1800 info.rti_flags = flags |
1801 (ifa->ifa_flags & ~IFA_RTSELF) | RTF_PINNED;
1802 info.rti_info[RTAX_DST] = dst;
1804 * doing this for compatibility reasons
1807 info.rti_info[RTAX_GATEWAY] =
1808 (struct sockaddr *)&null_sdl;
1810 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1811 info.rti_info[RTAX_NETMASK] = netmask;
1812 error = rtrequest1_fib(cmd, &info, &rt, fibnum);
1814 if ((error == EEXIST) && (cmd == RTM_ADD)) {
1816 * Interface route addition failed.
1817 * Atomically delete current prefix generating
1818 * RTM_DELETE message, and retry adding
1821 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1822 RADIX_NODE_HEAD_LOCK(rnh);
1824 /* Delete old prefix */
1825 info.rti_ifa = NULL;
1826 info.rti_flags = RTF_RNH_LOCKED;
1828 error = rtrequest1_fib(RTM_DELETE, &info, NULL, fibnum);
1831 info.rti_flags = flags | RTF_RNH_LOCKED |
1832 (ifa->ifa_flags & ~IFA_RTSELF) | RTF_PINNED;
1833 error = rtrequest1_fib(cmd, &info, &rt, fibnum);
1836 RADIX_NODE_HEAD_UNLOCK(rnh);
1840 if (error == 0 && rt != NULL) {
1842 * notify any listening routing agents of the change
1847 * in case address alias finds the first address
1848 * e.g. ifconfig bge0 192.0.2.246/24
1849 * e.g. ifconfig bge0 192.0.2.247/24
1850 * the address set in the route is 192.0.2.246
1851 * so we need to replace it with 192.0.2.247
1853 if (memcmp(rt->rt_ifa->ifa_addr,
1854 ifa->ifa_addr, ifa->ifa_addr->sa_len)) {
1855 ifa_free(rt->rt_ifa);
1857 rt->rt_ifp = ifa->ifa_ifp;
1862 * doing this for compatibility reasons
1864 if (cmd == RTM_ADD) {
1865 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_type =
1866 rt->rt_ifp->if_type;
1867 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_index =
1868 rt->rt_ifp->if_index;
1872 rt_newaddrmsg_fib(cmd, ifa, error, rt, fibnum);
1875 if (cmd == RTM_DELETE) {
1877 * If we are deleting, and we found an entry,
1878 * then it's been removed from the tree..
1879 * now throw it away.
1883 if (cmd == RTM_ADD) {
1885 * We just wanted to add it..
1886 * we don't actually need a reference.
1897 if (cmd == RTM_DELETE) {
1901 /* we only give an error if it wasn't in any table */
1902 error = ((flags & RTF_HOST) ?
1903 EHOSTUNREACH : ENETUNREACH);
1907 /* return an error if any of them failed */
1915 * Set up a routing table entry, normally
1919 rtinit(struct ifaddr *ifa, int cmd, int flags)
1921 struct sockaddr *dst;
1922 int fib = RT_DEFAULT_FIB;
1924 if (flags & RTF_HOST) {
1925 dst = ifa->ifa_dstaddr;
1927 dst = ifa->ifa_addr;
1930 switch (dst->sa_family) {
1933 /* We do support multiple FIBs. */
1937 return (rtinit1(ifa, cmd, flags, fib));
1941 * Announce interface address arrival/withdraw
1942 * Returns 0 on success.
1945 rt_addrmsg(int cmd, struct ifaddr *ifa, int fibnum)
1948 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
1949 ("unexpected cmd %d", cmd));
1951 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
1952 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
1954 #if defined(INET) || defined(INET6)
1957 * notify the SCTP stack
1958 * this will only get called when an address is added/deleted
1959 * XXX pass the ifaddr struct instead if ifa->ifa_addr...
1961 sctp_addr_change(ifa, cmd);
1964 return (rtsock_addrmsg(cmd, ifa, fibnum));
1968 * Announce route addition/removal.
1969 * Users of this function MUST validate input data BEFORE calling.
1970 * However we have to be able to handle invalid data:
1971 * if some userland app sends us "invalid" route message (invalid mask,
1972 * no dst, wrong address families, etc...) we need to pass it back
1973 * to app (and any other rtsock consumers) with rtm_errno field set to
1975 * Returns 0 on success.
1978 rt_routemsg(int cmd, struct ifnet *ifp, int error, struct rtentry *rt,
1982 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
1983 ("unexpected cmd %d", cmd));
1985 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
1986 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
1988 KASSERT(rt_key(rt) != NULL, (":%s: rt_key must be supplied", __func__));
1990 return (rtsock_routemsg(cmd, ifp, error, rt, fibnum));
1994 rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
1997 rt_newaddrmsg_fib(cmd, ifa, error, rt, RT_ALL_FIBS);
2001 * This is called to generate messages from the routing socket
2002 * indicating a network interface has had addresses associated with it.
2005 rt_newaddrmsg_fib(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt,
2009 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2010 ("unexpected cmd %u", cmd));
2011 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2012 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2014 if (cmd == RTM_ADD) {
2015 rt_addrmsg(cmd, ifa, fibnum);
2017 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2020 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2021 rt_addrmsg(cmd, ifa, fibnum);