2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 1980, 1986, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
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 University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * @(#)route.c 8.3.1.1 (Berkeley) 2/23/95
34 /************************************************************************
35 * Note: In this file a 'fib' is a "forwarding information base" *
36 * Which is the new name for an in kernel routing (next hop) table. *
37 ***********************************************************************/
40 #include "opt_inet6.h"
41 #include "opt_route.h"
43 #include "opt_mrouting.h"
44 #include "opt_mpath.h"
46 #include <sys/param.h>
47 #include <sys/systm.h>
48 #include <sys/malloc.h>
50 #include <sys/socket.h>
51 #include <sys/sysctl.h>
52 #include <sys/syslog.h>
53 #include <sys/sysproto.h>
55 #include <sys/domain.h>
56 #include <sys/kernel.h>
59 #include <net/if_var.h>
60 #include <net/if_dl.h>
61 #include <net/route.h>
62 #include <net/route_var.h>
66 #include <net/radix_mpath.h>
69 #include <netinet/in.h>
70 #include <netinet/ip_mroute.h>
74 #define RT_MAXFIBS UINT16_MAX
76 /* Kernel config default option. */
79 #error "ROUTETABLES defined too low"
81 #if ROUTETABLES > RT_MAXFIBS
82 #error "ROUTETABLES defined too big"
84 #define RT_NUMFIBS ROUTETABLES
85 #endif /* ROUTETABLES */
86 /* Initialize to default if not otherwise set. */
91 #if defined(INET) || defined(INET6)
93 extern void sctp_addr_change(struct ifaddr *ifa, int cmd);
98 /* This is read-only.. */
99 u_int rt_numfibs = RT_NUMFIBS;
100 SYSCTL_UINT(_net, OID_AUTO, fibs, CTLFLAG_RDTUN, &rt_numfibs, 0, "");
103 * By default add routes to all fibs for new interfaces.
104 * Once this is set to 0 then only allocate routes on interface
105 * changes for the FIB of the caller when adding a new set of addresses
106 * to an interface. XXX this is a shotgun aproach to a problem that needs
107 * a more fine grained solution.. that will come.
108 * XXX also has the problems getting the FIB from curthread which will not
109 * always work given the fib can be overridden and prefixes can be added
110 * from the network stack context.
112 VNET_DEFINE(u_int, rt_add_addr_allfibs) = 1;
113 SYSCTL_UINT(_net, OID_AUTO, add_addr_allfibs, CTLFLAG_RWTUN | CTLFLAG_VNET,
114 &VNET_NAME(rt_add_addr_allfibs), 0, "");
116 VNET_DEFINE(struct rtstat, rtstat);
117 #define V_rtstat VNET(rtstat)
119 VNET_DEFINE(struct rib_head *, rt_tables);
120 #define V_rt_tables VNET(rt_tables)
122 VNET_DEFINE(int, rttrash); /* routes not in table but not freed */
123 #define V_rttrash VNET(rttrash)
127 * Convert a 'struct radix_node *' to a 'struct rtentry *'.
128 * The operation can be done safely (in this code) because a
129 * 'struct rtentry' starts with two 'struct radix_node''s, the first
130 * one representing leaf nodes in the routing tree, which is
131 * what the code in radix.c passes us as a 'struct radix_node'.
133 * But because there are a lot of assumptions in this conversion,
134 * do not cast explicitly, but always use the macro below.
136 #define RNTORT(p) ((struct rtentry *)(p))
138 static VNET_DEFINE(uma_zone_t, rtzone); /* Routing table UMA zone. */
139 #define V_rtzone VNET(rtzone)
141 static int rtrequest1_fib_change(struct rib_head *, struct rt_addrinfo *,
142 struct rtentry **, u_int);
143 static void rt_setmetrics(const struct rt_addrinfo *, struct rtentry *);
144 static int rt_ifdelroute(const struct rtentry *rt, void *arg);
145 static struct rtentry *rt_unlinkrte(struct rib_head *rnh,
146 struct rt_addrinfo *info, int *perror);
147 static void rt_notifydelete(struct rtentry *rt, struct rt_addrinfo *info);
149 static struct radix_node *rt_mpath_unlink(struct rib_head *rnh,
150 struct rt_addrinfo *info, struct rtentry *rto, int *perror);
152 static int rt_exportinfo(struct rtentry *rt, struct rt_addrinfo *info,
161 static int if_updatemtu_cb(struct radix_node *, void *);
164 * handler for net.my_fibnum
167 sysctl_my_fibnum(SYSCTL_HANDLER_ARGS)
172 fibnum = curthread->td_proc->p_fibnum;
173 error = sysctl_handle_int(oidp, &fibnum, 0, req);
177 SYSCTL_PROC(_net, OID_AUTO, my_fibnum, CTLTYPE_INT|CTLFLAG_RD,
178 NULL, 0, &sysctl_my_fibnum, "I", "default FIB of caller");
180 static __inline struct rib_head **
181 rt_tables_get_rnh_ptr(int table, int fam)
183 struct rib_head **rnh;
185 KASSERT(table >= 0 && table < rt_numfibs, ("%s: table out of bounds.",
187 KASSERT(fam >= 0 && fam < (AF_MAX+1), ("%s: fam out of bounds.",
190 /* rnh is [fib=0][af=0]. */
191 rnh = (struct rib_head **)V_rt_tables;
192 /* Get the offset to the requested table and fam. */
193 rnh += table * (AF_MAX+1) + fam;
199 rt_tables_get_rnh(int table, int fam)
202 return (*rt_tables_get_rnh_ptr(table, fam));
206 rt_tables_get_gen(int table, int fam)
208 struct rib_head *rnh;
210 rnh = *rt_tables_get_rnh_ptr(table, fam);
211 KASSERT(rnh != NULL, ("%s: NULL rib_head pointer table %d fam %d",
212 __func__, table, fam));
213 return (rnh->rnh_gen);
218 * route initialization must occur before ip6_init2(), which happenas at
225 /* whack the tunable ints into line. */
226 if (rt_numfibs > RT_MAXFIBS)
227 rt_numfibs = RT_MAXFIBS;
231 SYSINIT(route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, NULL);
234 rtentry_zinit(void *mem, int size, int how)
236 struct rtentry *rt = mem;
238 rt->rt_pksent = counter_u64_alloc(how);
239 if (rt->rt_pksent == NULL)
248 rtentry_zfini(void *mem, int size)
250 struct rtentry *rt = mem;
253 counter_u64_free(rt->rt_pksent);
257 rtentry_ctor(void *mem, int size, void *arg, int how)
259 struct rtentry *rt = mem;
261 bzero(rt, offsetof(struct rtentry, rt_endzero));
262 counter_u64_zero(rt->rt_pksent);
269 rtentry_dtor(void *mem, int size, void *arg)
271 struct rtentry *rt = mem;
277 vnet_route_init(const void *unused __unused)
280 struct rib_head **rnh;
284 V_rt_tables = malloc(rt_numfibs * (AF_MAX+1) *
285 sizeof(struct rib_head *), M_RTABLE, M_WAITOK|M_ZERO);
287 V_rtzone = uma_zcreate("rtentry", sizeof(struct rtentry),
288 rtentry_ctor, rtentry_dtor,
289 rtentry_zinit, rtentry_zfini, UMA_ALIGN_PTR, 0);
290 for (dom = domains; dom; dom = dom->dom_next) {
291 if (dom->dom_rtattach == NULL)
294 for (table = 0; table < rt_numfibs; table++) {
295 fam = dom->dom_family;
296 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
299 rnh = rt_tables_get_rnh_ptr(table, fam);
301 panic("%s: rnh NULL", __func__);
302 dom->dom_rtattach((void **)rnh, 0);
306 VNET_SYSINIT(vnet_route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_FOURTH,
311 vnet_route_uninit(const void *unused __unused)
316 struct rib_head **rnh;
318 for (dom = domains; dom; dom = dom->dom_next) {
319 if (dom->dom_rtdetach == NULL)
322 for (table = 0; table < rt_numfibs; table++) {
323 fam = dom->dom_family;
325 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
328 rnh = rt_tables_get_rnh_ptr(table, fam);
330 panic("%s: rnh NULL", __func__);
331 dom->dom_rtdetach((void **)rnh, 0);
335 free(V_rt_tables, M_RTABLE);
336 uma_zdestroy(V_rtzone);
338 VNET_SYSUNINIT(vnet_route_uninit, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST,
339 vnet_route_uninit, 0);
343 rt_table_init(int offset)
347 rh = malloc(sizeof(struct rib_head), M_RTABLE, M_WAITOK | M_ZERO);
349 /* TODO: These details should be hidded inside radix.c */
350 /* Init masks tree */
351 rn_inithead_internal(&rh->head, rh->rnh_nodes, offset);
352 rn_inithead_internal(&rh->rmhead.head, rh->rmhead.mask_nodes, 0);
353 rh->head.rnh_masks = &rh->rmhead;
358 /* Finally, set base callbacks */
359 rh->rnh_addaddr = rn_addroute;
360 rh->rnh_deladdr = rn_delete;
361 rh->rnh_matchaddr = rn_match;
362 rh->rnh_lookup = rn_lookup;
363 rh->rnh_walktree = rn_walktree;
364 rh->rnh_walktree_from = rn_walktree_from;
370 rt_freeentry(struct radix_node *rn, void *arg)
372 struct radix_head * const rnh = arg;
373 struct radix_node *x;
375 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
382 rt_table_destroy(struct rib_head *rh)
385 rn_walktree(&rh->rmhead.head, rt_freeentry, &rh->rmhead.head);
387 /* Assume table is already empty */
388 RIB_LOCK_DESTROY(rh);
393 #ifndef _SYS_SYSPROTO_H_
399 sys_setfib(struct thread *td, struct setfib_args *uap)
401 if (uap->fibnum < 0 || uap->fibnum >= rt_numfibs)
403 td->td_proc->p_fibnum = uap->fibnum;
408 * Packet routing routines.
411 rtalloc_ign_fib(struct route *ro, u_long ignore, u_int fibnum)
415 if ((rt = ro->ro_rt) != NULL) {
416 if (rt->rt_ifp != NULL && rt->rt_flags & RTF_UP)
421 ro->ro_rt = rtalloc1_fib(&ro->ro_dst, 1, ignore, fibnum);
423 RT_UNLOCK(ro->ro_rt);
427 * Look up the route that matches the address given
428 * Or, at least try.. Create a cloned route if needed.
430 * The returned route, if any, is locked.
433 rtalloc1(struct sockaddr *dst, int report, u_long ignflags)
436 return (rtalloc1_fib(dst, report, ignflags, RT_DEFAULT_FIB));
440 rtalloc1_fib(struct sockaddr *dst, int report, u_long ignflags,
444 struct radix_node *rn;
445 struct rtentry *newrt;
446 struct rt_addrinfo info;
447 int err = 0, msgtype = RTM_MISS;
449 KASSERT((fibnum < rt_numfibs), ("rtalloc1_fib: bad fibnum"));
450 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
456 * Look up the address in the table for that Address Family
458 if ((ignflags & RTF_RNH_LOCKED) == 0)
464 rn = rh->rnh_matchaddr(dst, &rh->head);
465 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
469 if ((ignflags & RTF_RNH_LOCKED) == 0)
473 } else if ((ignflags & RTF_RNH_LOCKED) == 0)
476 * Either we hit the root or could not find any match,
477 * which basically means: "cannot get there from here".
480 V_rtstat.rts_unreach++;
484 * If required, report the failure to the supervising
486 * For a delete, this is not an error. (report == 0)
488 bzero(&info, sizeof(info));
489 info.rti_info[RTAX_DST] = dst;
490 rt_missmsg_fib(msgtype, &info, 0, err, fibnum);
496 * Remove a reference count from an rtentry.
497 * If the count gets low enough, take it out of the routing table
500 rtfree(struct rtentry *rt)
502 struct rib_head *rnh;
504 KASSERT(rt != NULL,("%s: NULL rt", __func__));
505 rnh = rt_tables_get_rnh(rt->rt_fibnum, rt_key(rt)->sa_family);
506 KASSERT(rnh != NULL,("%s: NULL rnh", __func__));
511 * The callers should use RTFREE_LOCKED() or RTFREE(), so
512 * we should come here exactly with the last reference.
515 if (rt->rt_refcnt > 0) {
516 log(LOG_DEBUG, "%s: %p has %d refs\n", __func__, rt, rt->rt_refcnt);
521 * On last reference give the "close method" a chance
522 * to cleanup private state. This also permits (for
523 * IPv4 and IPv6) a chance to decide if the routing table
524 * entry should be purged immediately or at a later time.
525 * When an immediate purge is to happen the close routine
526 * typically calls rtexpunge which clears the RTF_UP flag
527 * on the entry so that the code below reclaims the storage.
529 if (rt->rt_refcnt == 0 && rnh->rnh_close)
530 rnh->rnh_close((struct radix_node *)rt, &rnh->head);
533 * If we are no longer "up" (and ref == 0)
534 * then we can free the resources associated
537 if ((rt->rt_flags & RTF_UP) == 0) {
538 if (rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT))
541 * the rtentry must have been removed from the routing table
542 * so it is represented in rttrash.. remove that now.
546 if (rt->rt_refcnt < 0) {
547 printf("rtfree: %p not freed (neg refs)\n", rt);
552 * release references on items we hold them on..
553 * e.g other routes and ifaddrs.
556 ifa_free(rt->rt_ifa);
558 * The key is separatly alloc'd so free it (see rt_setgate()).
559 * This also frees the gateway, as they are always malloc'd
565 * and the rtentry itself of course
567 uma_zfree(V_rtzone, rt);
576 * Force a routing table entry to the specified
577 * destination to go through the given gateway.
578 * Normally called as a result of a routing redirect
579 * message from the network layer.
582 rtredirect_fib(struct sockaddr *dst,
583 struct sockaddr *gateway,
584 struct sockaddr *netmask,
586 struct sockaddr *src,
592 struct rt_addrinfo info;
594 struct rib_head *rnh;
598 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
600 error = EAFNOSUPPORT;
603 /* verify the gateway is directly reachable */
604 if ((ifa = ifa_ifwithnet(gateway, 0, fibnum)) == NULL) {
608 rt = rtalloc1_fib(dst, 0, 0UL, fibnum); /* NB: rt is locked */
610 * If the redirect isn't from our current router for this dst,
611 * it's either old or wrong. If it redirects us to ourselves,
612 * we have a routing loop, perhaps as a result of an interface
613 * going down recently.
615 if (!(flags & RTF_DONE) && rt) {
616 if (!sa_equal(src, rt->rt_gateway)) {
620 if (rt->rt_ifa != ifa && ifa->ifa_addr->sa_family != AF_LINK) {
625 if ((flags & RTF_GATEWAY) && ifa_ifwithaddr_check(gateway)) {
626 error = EHOSTUNREACH;
630 * Create a new entry if we just got back a wildcard entry
631 * or the lookup failed. This is necessary for hosts
632 * which use routing redirects generated by smart gateways
633 * to dynamically build the routing tables.
635 if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
638 * Don't listen to the redirect if it's
639 * for a route to an interface.
641 if (rt->rt_flags & RTF_GATEWAY) {
642 if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
644 * Changing from route to net => route to host.
645 * Create new route, rather than smashing route to net.
651 flags |= RTF_DYNAMIC;
652 bzero((caddr_t)&info, sizeof(info));
653 info.rti_info[RTAX_DST] = dst;
654 info.rti_info[RTAX_GATEWAY] = gateway;
655 info.rti_info[RTAX_NETMASK] = netmask;
658 info.rti_flags = flags;
659 error = rtrequest1_fib(RTM_ADD, &info, &rt, fibnum);
662 flags = rt->rt_flags;
665 stat = &V_rtstat.rts_dynamic;
669 * Smash the current notion of the gateway to
670 * this destination. Should check about netmask!!!
672 if ((flags & RTF_GATEWAY) == 0)
673 rt->rt_flags &= ~RTF_GATEWAY;
674 rt->rt_flags |= RTF_MODIFIED;
675 flags |= RTF_MODIFIED;
676 stat = &V_rtstat.rts_newgateway;
678 * add the key and gateway (in one malloc'd chunk).
683 rt_setgate(rt, rt_key(rt), gateway);
687 error = EHOSTUNREACH;
694 V_rtstat.rts_badredirect++;
695 else if (stat != NULL)
697 bzero((caddr_t)&info, sizeof(info));
698 info.rti_info[RTAX_DST] = dst;
699 info.rti_info[RTAX_GATEWAY] = gateway;
700 info.rti_info[RTAX_NETMASK] = netmask;
701 info.rti_info[RTAX_AUTHOR] = src;
702 rt_missmsg_fib(RTM_REDIRECT, &info, flags, error, fibnum);
706 * Routing table ioctl interface.
709 rtioctl_fib(u_long req, caddr_t data, u_int fibnum)
713 * If more ioctl commands are added here, make sure the proper
714 * super-user checks are being performed because it is possible for
715 * prison-root to make it this far if raw sockets have been enabled
719 /* Multicast goop, grrr... */
720 return mrt_ioctl ? mrt_ioctl(req, data, fibnum) : EOPNOTSUPP;
727 ifa_ifwithroute(int flags, const struct sockaddr *dst, struct sockaddr *gateway,
734 if ((flags & RTF_GATEWAY) == 0) {
736 * If we are adding a route to an interface,
737 * and the interface is a pt to pt link
738 * we should search for the destination
739 * as our clue to the interface. Otherwise
740 * we can use the local address.
743 if (flags & RTF_HOST)
744 ifa = ifa_ifwithdstaddr(dst, fibnum);
746 ifa = ifa_ifwithaddr(gateway);
749 * If we are adding a route to a remote net
750 * or host, the gateway may still be on the
751 * other end of a pt to pt link.
753 ifa = ifa_ifwithdstaddr(gateway, fibnum);
756 ifa = ifa_ifwithnet(gateway, 0, fibnum);
760 rt = rtalloc1_fib(gateway, 0, flags, fibnum);
764 * dismiss a gateway that is reachable only
765 * through the default router
767 switch (gateway->sa_family) {
769 if (satosin(rt_key(rt))->sin_addr.s_addr == INADDR_ANY)
773 if (IN6_IS_ADDR_UNSPECIFIED(&satosin6(rt_key(rt))->sin6_addr))
779 if (!not_found && rt->rt_ifa != NULL) {
784 if (not_found || ifa == NULL)
787 if (ifa->ifa_addr->sa_family != dst->sa_family) {
788 struct ifaddr *oifa = ifa;
789 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
798 * Do appropriate manipulations of a routing tree given
799 * all the bits of info needed
802 rtrequest_fib(int req,
803 struct sockaddr *dst,
804 struct sockaddr *gateway,
805 struct sockaddr *netmask,
807 struct rtentry **ret_nrt,
810 struct rt_addrinfo info;
812 if (dst->sa_len == 0)
815 bzero((caddr_t)&info, sizeof(info));
816 info.rti_flags = flags;
817 info.rti_info[RTAX_DST] = dst;
818 info.rti_info[RTAX_GATEWAY] = gateway;
819 info.rti_info[RTAX_NETMASK] = netmask;
820 return rtrequest1_fib(req, &info, ret_nrt, fibnum);
825 * Copy most of @rt data into @info.
827 * If @flags contains NHR_COPY, copies dst,netmask and gw to the
828 * pointers specified by @info structure. Assume such pointers
829 * are zeroed sockaddr-like structures with sa_len field initialized
830 * to reflect size of the provided buffer. if no NHR_COPY is specified,
831 * point dst,netmask and gw @info fields to appropriate @rt values.
833 * if @flags contains NHR_REF, do refcouting on rt_ifp.
835 * Returns 0 on success.
838 rt_exportinfo(struct rtentry *rt, struct rt_addrinfo *info, int flags)
840 struct rt_metrics *rmx;
841 struct sockaddr *src, *dst;
844 if (flags & NHR_COPY) {
845 /* Copy destination if dst is non-zero */
847 dst = info->rti_info[RTAX_DST];
848 sa_len = src->sa_len;
850 if (src->sa_len > dst->sa_len)
852 memcpy(dst, src, src->sa_len);
853 info->rti_addrs |= RTA_DST;
856 /* Copy mask if set && dst is non-zero */
858 dst = info->rti_info[RTAX_NETMASK];
859 if (src != NULL && dst != NULL) {
862 * Radix stores different value in sa_len,
863 * assume rt_mask() to have the same length
866 if (sa_len > dst->sa_len)
868 memcpy(dst, src, src->sa_len);
869 info->rti_addrs |= RTA_NETMASK;
872 /* Copy gateway is set && dst is non-zero */
873 src = rt->rt_gateway;
874 dst = info->rti_info[RTAX_GATEWAY];
875 if ((rt->rt_flags & RTF_GATEWAY) && src != NULL && dst != NULL){
876 if (src->sa_len > dst->sa_len)
878 memcpy(dst, src, src->sa_len);
879 info->rti_addrs |= RTA_GATEWAY;
882 info->rti_info[RTAX_DST] = rt_key(rt);
883 info->rti_addrs |= RTA_DST;
884 if (rt_mask(rt) != NULL) {
885 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
886 info->rti_addrs |= RTA_NETMASK;
888 if (rt->rt_flags & RTF_GATEWAY) {
889 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
890 info->rti_addrs |= RTA_GATEWAY;
896 info->rti_mflags |= RTV_MTU;
897 rmx->rmx_mtu = rt->rt_mtu;
900 info->rti_flags = rt->rt_flags;
901 info->rti_ifp = rt->rt_ifp;
902 info->rti_ifa = rt->rt_ifa;
903 ifa_ref(info->rti_ifa);
904 if (flags & NHR_REF) {
905 /* Do 'traditional' refcouting */
906 if_ref(info->rti_ifp);
913 * Lookups up route entry for @dst in RIB database for fib @fibnum.
914 * Exports entry data to @info using rt_exportinfo().
916 * if @flags contains NHR_REF, refcouting is performed on rt_ifp.
917 * All references can be released later by calling rib_free_info()
919 * Returns 0 on success.
920 * Returns ENOENT for lookup failure, ENOMEM for export failure.
923 rib_lookup_info(uint32_t fibnum, const struct sockaddr *dst, uint32_t flags,
924 uint32_t flowid, struct rt_addrinfo *info)
927 struct radix_node *rn;
931 KASSERT((fibnum < rt_numfibs), ("rib_lookup_rte: bad fibnum"));
932 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
937 rn = rh->rnh_matchaddr(__DECONST(void *, dst), &rh->head);
938 if (rn != NULL && ((rn->rn_flags & RNF_ROOT) == 0)) {
940 /* Ensure route & ifp is UP */
941 if (RT_LINK_IS_UP(rt->rt_ifp)) {
942 flags = (flags & NHR_REF) | NHR_COPY;
943 error = rt_exportinfo(rt, info, flags);
955 * Releases all references acquired by rib_lookup_info() when
956 * called with NHR_REF flags.
959 rib_free_info(struct rt_addrinfo *info)
962 if_rele(info->rti_ifp);
966 * Iterates over all existing fibs in system calling
967 * @setwa_f function prior to traversing each fib.
968 * Calls @wa_f function for each element in current fib.
969 * If af is not AF_UNSPEC, iterates over fibs in particular
973 rt_foreach_fib_walk(int af, rt_setwarg_t *setwa_f, rt_walktree_f_t *wa_f,
976 struct rib_head *rnh;
980 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
981 /* Do we want some specific family? */
982 if (af != AF_UNSPEC) {
983 rnh = rt_tables_get_rnh(fibnum, af);
987 setwa_f(rnh, fibnum, af, arg);
990 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
995 for (i = 1; i <= AF_MAX; i++) {
996 rnh = rt_tables_get_rnh(fibnum, i);
1000 setwa_f(rnh, fibnum, i, arg);
1003 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
1011 struct rt_addrinfo info;
1012 struct rib_head *rnh;
1013 struct rtentry *head;
1017 * Conditionally unlinks @rn from radix tree based
1018 * on info data passed in @arg.
1021 rt_checkdelroute(struct radix_node *rn, void *arg)
1023 struct rt_delinfo *di;
1024 struct rt_addrinfo *info;
1028 di = (struct rt_delinfo *)arg;
1029 rt = (struct rtentry *)rn;
1033 info->rti_info[RTAX_DST] = rt_key(rt);
1034 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
1035 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1037 rt = rt_unlinkrte(di->rnh, info, &error);
1039 /* Either not allowed or not matched. Skip entry */
1043 /* Entry was unlinked. Add to the list and return */
1044 rt->rt_chain = di->head;
1051 * Iterates over all existing fibs in system.
1052 * Deletes each element for which @filter_f function returned
1054 * If @af is not AF_UNSPEC, iterates over fibs in particular
1058 rt_foreach_fib_walk_del(int af, rt_filter_f_t *filter_f, void *arg)
1060 struct rib_head *rnh;
1061 struct rt_delinfo di;
1066 bzero(&di, sizeof(di));
1067 di.info.rti_filter = filter_f;
1068 di.info.rti_filterdata = arg;
1070 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
1071 /* Do we want some specific family? */
1072 if (af != AF_UNSPEC) {
1080 for (i = start; i <= end; i++) {
1081 rnh = rt_tables_get_rnh(fibnum, i);
1087 rnh->rnh_walktree(&rnh->head, rt_checkdelroute, &di);
1090 if (di.head == NULL)
1093 /* We might have something to reclaim */
1094 while (di.head != NULL) {
1096 di.head = rt->rt_chain;
1097 rt->rt_chain = NULL;
1099 /* TODO std rt -> rt_addrinfo export */
1100 di.info.rti_info[RTAX_DST] = rt_key(rt);
1101 di.info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1103 rt_notifydelete(rt, &di.info);
1112 * Delete Routes for a Network Interface
1114 * Called for each routing entry via the rnh->rnh_walktree() call above
1115 * to delete all route entries referencing a detaching network interface.
1118 * rt pointer to rtentry
1119 * arg argument passed to rnh->rnh_walktree() - detaching interface
1123 * errno failed - reason indicated
1126 rt_ifdelroute(const struct rtentry *rt, void *arg)
1128 struct ifnet *ifp = arg;
1130 if (rt->rt_ifp != ifp)
1134 * Protect (sorta) against walktree recursion problems
1135 * with cloned routes
1137 if ((rt->rt_flags & RTF_UP) == 0)
1144 * Delete all remaining routes using this interface
1145 * Unfortuneatly the only way to do this is to slog through
1146 * the entire routing table looking for routes which point
1147 * to this interface...oh well...
1150 rt_flushifroutes_af(struct ifnet *ifp, int af)
1152 KASSERT((af >= 1 && af <= AF_MAX), ("%s: af %d not >= 1 and <= %d",
1153 __func__, af, AF_MAX));
1155 rt_foreach_fib_walk_del(af, rt_ifdelroute, ifp);
1159 rt_flushifroutes(struct ifnet *ifp)
1162 rt_foreach_fib_walk_del(AF_UNSPEC, rt_ifdelroute, ifp);
1166 * Conditionally unlinks rtentry matching data inside @info from @rnh.
1167 * Returns unlinked, locked and referenced @rtentry on success,
1168 * Returns NULL and sets @perror to:
1169 * ESRCH - if prefix was not found,
1170 * EADDRINUSE - if trying to delete PINNED route without appropriate flag.
1171 * ENOENT - if supplied filter function returned 0 (not matched).
1173 static struct rtentry *
1174 rt_unlinkrte(struct rib_head *rnh, struct rt_addrinfo *info, int *perror)
1176 struct sockaddr *dst, *netmask;
1178 struct radix_node *rn;
1180 dst = info->rti_info[RTAX_DST];
1181 netmask = info->rti_info[RTAX_NETMASK];
1183 rt = (struct rtentry *)rnh->rnh_lookup(dst, netmask, &rnh->head);
1189 if ((info->rti_flags & RTF_PINNED) == 0) {
1190 /* Check if target route can be deleted */
1191 if (rt->rt_flags & RTF_PINNED) {
1192 *perror = EADDRINUSE;
1197 if (info->rti_filter != NULL) {
1198 if (info->rti_filter(rt, info->rti_filterdata) == 0) {
1205 * Filter function requested rte deletion.
1206 * Ease the caller work by filling in remaining info
1207 * from that particular entry.
1209 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1213 * Remove the item from the tree and return it.
1214 * Complain if it is not there and do no more processing.
1218 if (rt_mpath_capable(rnh))
1219 rn = rt_mpath_unlink(rnh, info, rt, perror);
1222 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1226 if (rn->rn_flags & (RNF_ACTIVE | RNF_ROOT))
1227 panic ("rtrequest delete");
1232 rt->rt_flags &= ~RTF_UP;
1240 rt_notifydelete(struct rtentry *rt, struct rt_addrinfo *info)
1245 * give the protocol a chance to keep things in sync.
1248 if (ifa != NULL && ifa->ifa_rtrequest != NULL)
1249 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1252 * One more rtentry floating around that is not
1253 * linked to the routing table. rttrash will be decremented
1254 * when RTFREE(rt) is eventually called.
1261 * These (questionable) definitions of apparent local variables apply
1262 * to the next two functions. XXXXXX!!!
1264 #define dst info->rti_info[RTAX_DST]
1265 #define gateway info->rti_info[RTAX_GATEWAY]
1266 #define netmask info->rti_info[RTAX_NETMASK]
1267 #define ifaaddr info->rti_info[RTAX_IFA]
1268 #define ifpaddr info->rti_info[RTAX_IFP]
1269 #define flags info->rti_flags
1272 * Look up rt_addrinfo for a specific fib. Note that if rti_ifa is defined,
1273 * it will be referenced so the caller must free it.
1276 rt_getifa_fib(struct rt_addrinfo *info, u_int fibnum)
1282 * ifp may be specified by sockaddr_dl
1283 * when protocol address is ambiguous.
1286 needref = (info->rti_ifa == NULL);
1288 if (info->rti_ifp == NULL && ifpaddr != NULL &&
1289 ifpaddr->sa_family == AF_LINK &&
1290 (ifa = ifa_ifwithnet(ifpaddr, 0, fibnum)) != NULL) {
1291 info->rti_ifp = ifa->ifa_ifp;
1293 if (info->rti_ifa == NULL && ifaaddr != NULL)
1294 info->rti_ifa = ifa_ifwithaddr(ifaaddr);
1295 if (info->rti_ifa == NULL) {
1296 struct sockaddr *sa;
1298 sa = ifaaddr != NULL ? ifaaddr :
1299 (gateway != NULL ? gateway : dst);
1300 if (sa != NULL && info->rti_ifp != NULL)
1301 info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
1302 else if (dst != NULL && gateway != NULL)
1303 info->rti_ifa = ifa_ifwithroute(flags, dst, gateway,
1305 else if (sa != NULL)
1306 info->rti_ifa = ifa_ifwithroute(flags, sa, sa,
1309 if (needref && info->rti_ifa != NULL) {
1310 if (info->rti_ifp == NULL)
1311 info->rti_ifp = info->rti_ifa->ifa_ifp;
1312 ifa_ref(info->rti_ifa);
1314 error = ENETUNREACH;
1320 if_updatemtu_cb(struct radix_node *rn, void *arg)
1323 struct if_mtuinfo *ifmtu;
1325 rt = (struct rtentry *)rn;
1326 ifmtu = (struct if_mtuinfo *)arg;
1328 if (rt->rt_ifp != ifmtu->ifp)
1331 if (rt->rt_mtu >= ifmtu->mtu) {
1332 /* We have to decrease mtu regardless of flags */
1333 rt->rt_mtu = ifmtu->mtu;
1338 * New MTU is bigger. Check if are allowed to alter it
1340 if ((rt->rt_flags & (RTF_FIXEDMTU | RTF_GATEWAY | RTF_HOST)) != 0) {
1343 * Skip routes with user-supplied MTU and
1344 * non-interface routes
1349 /* We are safe to update route MTU */
1350 rt->rt_mtu = ifmtu->mtu;
1356 rt_updatemtu(struct ifnet *ifp)
1358 struct if_mtuinfo ifmtu;
1359 struct rib_head *rnh;
1365 * Try to update rt_mtu for all routes using this interface
1366 * Unfortunately the only way to do this is to traverse all
1367 * routing tables in all fibs/domains.
1369 for (i = 1; i <= AF_MAX; i++) {
1370 ifmtu.mtu = if_getmtu_family(ifp, i);
1371 for (j = 0; j < rt_numfibs; j++) {
1372 rnh = rt_tables_get_rnh(j, i);
1376 rnh->rnh_walktree(&rnh->head, if_updatemtu_cb, &ifmtu);
1384 int p_sockaddr(char *buf, int buflen, struct sockaddr *s);
1385 int rt_print(char *buf, int buflen, struct rtentry *rt);
1388 p_sockaddr(char *buf, int buflen, struct sockaddr *s)
1392 switch (s->sa_family) {
1394 paddr = &((struct sockaddr_in *)s)->sin_addr;
1397 paddr = &((struct sockaddr_in6 *)s)->sin6_addr;
1404 if (inet_ntop(s->sa_family, paddr, buf, buflen) == NULL)
1407 return (strlen(buf));
1411 rt_print(char *buf, int buflen, struct rtentry *rt)
1413 struct sockaddr *addr, *mask;
1419 i = p_sockaddr(buf, buflen, addr);
1420 if (!(rt->rt_flags & RTF_HOST)) {
1422 i += p_sockaddr(buf + i, buflen - i, mask);
1425 if (rt->rt_flags & RTF_GATEWAY) {
1427 i += p_sockaddr(buf + i, buflen - i, rt->rt_gateway);
1436 * Deletes key for single-path routes, unlinks rtentry with
1437 * gateway specified in @info from multi-path routes.
1439 * Returnes unlinked entry. In case of failure, returns NULL
1440 * and sets @perror to ESRCH.
1442 static struct radix_node *
1443 rt_mpath_unlink(struct rib_head *rnh, struct rt_addrinfo *info,
1444 struct rtentry *rto, int *perror)
1447 * if we got multipath routes, we require users to specify
1448 * a matching RTAX_GATEWAY.
1450 struct rtentry *rt; // *rto = NULL;
1451 struct radix_node *rn;
1452 struct sockaddr *gw;
1454 gw = info->rti_info[RTAX_GATEWAY];
1455 rt = rt_mpath_matchgate(rto, gw);
1462 * this is the first entry in the chain
1465 rn = rn_mpath_next((struct radix_node *)rt);
1467 * there is another entry, now it's active
1472 rto->rt_flags |= RTF_UP;
1474 } else if (rt->rt_flags & RTF_GATEWAY) {
1476 * For gateway routes, we need to
1477 * make sure that we we are deleting
1478 * the correct gateway.
1479 * rt_mpath_matchgate() does not
1480 * check the case when there is only
1481 * one route in the chain.
1484 (rt->rt_gateway->sa_len != gw->sa_len ||
1485 memcmp(rt->rt_gateway, gw, gw->sa_len))) {
1492 * use the normal delete code to remove
1495 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1501 * if the entry is 2nd and on up
1503 if (rt_mpath_deldup(rto, rt) == 0)
1504 panic ("rtrequest1: rt_mpath_deldup");
1506 rn = (struct radix_node *)rt;
1512 rtrequest1_fib(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt,
1516 struct rtentry *rt, *rt_old;
1517 struct radix_node *rn;
1518 struct rib_head *rnh;
1520 struct sockaddr *ndst;
1521 struct sockaddr_storage mdst;
1523 KASSERT((fibnum < rt_numfibs), ("rtrequest1_fib: bad fibnum"));
1524 KASSERT((flags & RTF_RNH_LOCKED) == 0, ("rtrequest1_fib: locked"));
1525 switch (dst->sa_family) {
1528 /* We support multiple FIBs. */
1531 fibnum = RT_DEFAULT_FIB;
1536 * Find the correct routing tree to use for this Address Family
1538 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1540 return (EAFNOSUPPORT);
1543 * If we are adding a host route then we don't want to put
1544 * a netmask in the tree, nor do we want to clone it.
1546 if (flags & RTF_HOST)
1552 rt_maskedcopy(dst, (struct sockaddr *)&mdst, netmask);
1553 dst = (struct sockaddr *)&mdst;
1557 rt = rt_unlinkrte(rnh, info, &error);
1562 rt_notifydelete(rt, info);
1565 * If the caller wants it, then it can have it,
1566 * but it's up to it to free the rtentry as we won't be
1577 * resolve was only used for route cloning
1582 if ((flags & RTF_GATEWAY) && !gateway)
1584 if (dst && gateway && (dst->sa_family != gateway->sa_family) &&
1585 (gateway->sa_family != AF_UNSPEC) && (gateway->sa_family != AF_LINK))
1588 if (info->rti_ifa == NULL) {
1589 error = rt_getifa_fib(info, fibnum);
1593 rt = uma_zalloc(V_rtzone, M_NOWAIT);
1597 rt->rt_flags = RTF_UP | flags;
1598 rt->rt_fibnum = fibnum;
1600 * Add the gateway. Possibly re-malloc-ing the storage for it.
1602 if ((error = rt_setgate(rt, dst, gateway)) != 0) {
1603 uma_zfree(V_rtzone, rt);
1608 * point to the (possibly newly malloc'd) dest address.
1610 ndst = (struct sockaddr *)rt_key(rt);
1613 * make sure it contains the value we want (masked if needed).
1616 rt_maskedcopy(dst, ndst, netmask);
1618 bcopy(dst, ndst, dst->sa_len);
1621 * We use the ifa reference returned by rt_getifa_fib().
1622 * This moved from below so that rnh->rnh_addaddr() can
1623 * examine the ifa and ifa->ifa_ifp if it so desires.
1625 ifa = info->rti_ifa;
1628 rt->rt_ifp = ifa->ifa_ifp;
1631 rt_setmetrics(info, rt);
1636 /* do not permit exactly the same dst/mask/gw pair */
1637 if (rt_mpath_capable(rnh) &&
1638 rt_mpath_conflict(rnh, rt, netmask)) {
1641 ifa_free(rt->rt_ifa);
1643 uma_zfree(V_rtzone, rt);
1648 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
1649 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head, rt->rt_nodes);
1652 if (rn == NULL && (info->rti_flags & RTF_PINNED) != 0) {
1655 * Force removal and re-try addition
1656 * TODO: better multipath&pinned support
1658 struct sockaddr *info_dst = info->rti_info[RTAX_DST];
1659 info->rti_info[RTAX_DST] = ndst;
1660 /* Do not delete existing PINNED(interface) routes */
1661 info->rti_flags &= ~RTF_PINNED;
1662 rt_old = rt_unlinkrte(rnh, info, &error);
1663 info->rti_flags |= RTF_PINNED;
1664 info->rti_info[RTAX_DST] = info_dst;
1666 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head,
1675 * If it still failed to go into the tree,
1676 * then un-make it (this should be a function)
1679 ifa_free(rt->rt_ifa);
1681 uma_zfree(V_rtzone, rt);
1685 if (rt_old != NULL) {
1686 rt_notifydelete(rt_old, info);
1691 * If this protocol has something to add to this then
1692 * allow it to do that as well.
1694 if (ifa->ifa_rtrequest)
1695 ifa->ifa_rtrequest(req, rt, info);
1698 * actually return a resultant rtentry and
1699 * give the caller a single reference.
1705 rnh->rnh_gen++; /* Routing table updated */
1710 error = rtrequest1_fib_change(rnh, info, ret_nrt, fibnum);
1728 rtrequest1_fib_change(struct rib_head *rnh, struct rt_addrinfo *info,
1729 struct rtentry **ret_nrt, u_int fibnum)
1731 struct rtentry *rt = NULL;
1735 struct if_mtuinfo ifmtu;
1737 RIB_WLOCK_ASSERT(rnh);
1739 rt = (struct rtentry *)rnh->rnh_lookup(info->rti_info[RTAX_DST],
1740 info->rti_info[RTAX_NETMASK], &rnh->head);
1747 * If we got multipath routes,
1748 * we require users to specify a matching RTAX_GATEWAY.
1750 if (rt_mpath_capable(rnh)) {
1751 rt = rt_mpath_matchgate(rt, info->rti_info[RTAX_GATEWAY]);
1759 rt_setmetrics(info, rt);
1762 * New gateway could require new ifaddr, ifp;
1763 * flags may also be different; ifp may be specified
1764 * by ll sockaddr when protocol address is ambiguous
1766 if (((rt->rt_flags & RTF_GATEWAY) &&
1767 info->rti_info[RTAX_GATEWAY] != NULL) ||
1768 info->rti_info[RTAX_IFP] != NULL ||
1769 (info->rti_info[RTAX_IFA] != NULL &&
1770 !sa_equal(info->rti_info[RTAX_IFA], rt->rt_ifa->ifa_addr))) {
1772 * XXX: Temporarily set RTF_RNH_LOCKED flag in the rti_flags
1773 * to avoid rlock in the ifa_ifwithroute().
1775 info->rti_flags |= RTF_RNH_LOCKED;
1776 error = rt_getifa_fib(info, fibnum);
1777 info->rti_flags &= ~RTF_RNH_LOCKED;
1778 if (info->rti_ifa != NULL)
1785 /* Check if outgoing interface has changed */
1786 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa &&
1787 rt->rt_ifa != NULL) {
1788 if (rt->rt_ifa->ifa_rtrequest != NULL)
1789 rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1790 ifa_free(rt->rt_ifa);
1793 /* Update gateway address */
1794 if (info->rti_info[RTAX_GATEWAY] != NULL) {
1795 error = rt_setgate(rt, rt_key(rt), info->rti_info[RTAX_GATEWAY]);
1799 rt->rt_flags &= ~RTF_GATEWAY;
1800 rt->rt_flags |= (RTF_GATEWAY & info->rti_flags);
1803 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa) {
1804 ifa_ref(info->rti_ifa);
1805 rt->rt_ifa = info->rti_ifa;
1806 rt->rt_ifp = info->rti_ifp;
1808 /* Allow some flags to be toggled on change. */
1809 rt->rt_flags &= ~RTF_FMASK;
1810 rt->rt_flags |= info->rti_flags & RTF_FMASK;
1812 if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest != NULL)
1813 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, info);
1815 /* Alter route MTU if necessary */
1816 if (rt->rt_ifp != NULL) {
1817 family = info->rti_info[RTAX_DST]->sa_family;
1818 mtu = if_getmtu_family(rt->rt_ifp, family);
1819 /* Set default MTU */
1820 if (rt->rt_mtu == 0)
1822 if (rt->rt_mtu != mtu) {
1823 /* Check if we really need to update */
1824 ifmtu.ifp = rt->rt_ifp;
1826 if_updatemtu_cb(rt->rt_nodes, &ifmtu);
1831 * This route change may have modified the route's gateway. In that
1832 * case, any inpcbs that have cached this route need to invalidate their
1843 if (free_ifa != 0) {
1844 ifa_free(info->rti_ifa);
1845 info->rti_ifa = NULL;
1851 rt_setmetrics(const struct rt_addrinfo *info, struct rtentry *rt)
1854 if (info->rti_mflags & RTV_MTU) {
1855 if (info->rti_rmx->rmx_mtu != 0) {
1858 * MTU was explicitly provided by user.
1861 rt->rt_flags |= RTF_FIXEDMTU;
1865 * User explicitly sets MTU to 0.
1866 * Assume rollback to default.
1868 rt->rt_flags &= ~RTF_FIXEDMTU;
1870 rt->rt_mtu = info->rti_rmx->rmx_mtu;
1872 if (info->rti_mflags & RTV_WEIGHT)
1873 rt->rt_weight = info->rti_rmx->rmx_weight;
1874 /* Kernel -> userland timebase conversion. */
1875 if (info->rti_mflags & RTV_EXPIRE)
1876 rt->rt_expire = info->rti_rmx->rmx_expire ?
1877 info->rti_rmx->rmx_expire - time_second + time_uptime : 0;
1881 rt_setgate(struct rtentry *rt, struct sockaddr *dst, struct sockaddr *gate)
1883 /* XXX dst may be overwritten, can we move this to below */
1884 int dlen = SA_SIZE(dst), glen = SA_SIZE(gate);
1887 * Prepare to store the gateway in rt->rt_gateway.
1888 * Both dst and gateway are stored one after the other in the same
1889 * malloc'd chunk. If we have room, we can reuse the old buffer,
1890 * rt_gateway already points to the right place.
1891 * Otherwise, malloc a new block and update the 'dst' address.
1893 if (rt->rt_gateway == NULL || glen > SA_SIZE(rt->rt_gateway)) {
1896 R_Malloc(new, caddr_t, dlen + glen);
1900 * XXX note, we copy from *dst and not *rt_key(rt) because
1901 * rt_setgate() can be called to initialize a newly
1902 * allocated route entry, in which case rt_key(rt) == NULL
1903 * (and also rt->rt_gateway == NULL).
1904 * Free()/free() handle a NULL argument just fine.
1906 bcopy(dst, new, dlen);
1907 R_Free(rt_key(rt)); /* free old block, if any */
1908 rt_key(rt) = (struct sockaddr *)new;
1909 rt->rt_gateway = (struct sockaddr *)(new + dlen);
1913 * Copy the new gateway value into the memory chunk.
1915 bcopy(gate, rt->rt_gateway, glen);
1921 rt_maskedcopy(struct sockaddr *src, struct sockaddr *dst, struct sockaddr *netmask)
1923 u_char *cp1 = (u_char *)src;
1924 u_char *cp2 = (u_char *)dst;
1925 u_char *cp3 = (u_char *)netmask;
1926 u_char *cplim = cp2 + *cp3;
1927 u_char *cplim2 = cp2 + *cp1;
1929 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
1934 *cp2++ = *cp1++ & *cp3++;
1936 bzero((caddr_t)cp2, (unsigned)(cplim2 - cp2));
1940 * Set up a routing table entry, normally
1943 #define _SOCKADDR_TMPSIZE 128 /* Not too big.. kernel stack size is limited */
1945 rtinit1(struct ifaddr *ifa, int cmd, int flags, int fibnum)
1947 struct sockaddr *dst;
1948 struct sockaddr *netmask;
1949 struct rtentry *rt = NULL;
1950 struct rt_addrinfo info;
1952 int startfib, endfib;
1953 char tempbuf[_SOCKADDR_TMPSIZE];
1956 static struct sockaddr_dl null_sdl = {sizeof(null_sdl), AF_LINK};
1957 struct rib_head *rnh;
1959 if (flags & RTF_HOST) {
1960 dst = ifa->ifa_dstaddr;
1963 dst = ifa->ifa_addr;
1964 netmask = ifa->ifa_netmask;
1966 if (dst->sa_len == 0)
1968 switch (dst->sa_family) {
1971 /* We support multiple FIBs. */
1974 fibnum = RT_DEFAULT_FIB;
1977 if (fibnum == RT_ALL_FIBS) {
1978 if (V_rt_add_addr_allfibs == 0 && cmd == (int)RTM_ADD)
1979 startfib = endfib = ifa->ifa_ifp->if_fib;
1982 endfib = rt_numfibs - 1;
1985 KASSERT((fibnum < rt_numfibs), ("rtinit1: bad fibnum"));
1991 * If it's a delete, check that if it exists,
1992 * it's on the correct interface or we might scrub
1993 * a route to another ifa which would
1994 * be confusing at best and possibly worse.
1996 if (cmd == RTM_DELETE) {
1998 * It's a delete, so it should already exist..
1999 * If it's a net, mask off the host bits
2000 * (Assuming we have a mask)
2001 * XXX this is kinda inet specific..
2003 if (netmask != NULL) {
2004 rt_maskedcopy(dst, (struct sockaddr *)tempbuf, netmask);
2005 dst = (struct sockaddr *)tempbuf;
2009 * Now go through all the requested tables (fibs) and do the
2010 * requested action. Realistically, this will either be fib 0
2011 * for protocols that don't do multiple tables or all the
2012 * tables for those that do.
2014 for ( fibnum = startfib; fibnum <= endfib; fibnum++) {
2015 if (cmd == RTM_DELETE) {
2016 struct radix_node *rn;
2018 * Look up an rtentry that is in the routing tree and
2019 * contains the correct info.
2021 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
2023 /* this table doesn't exist but others might */
2026 rn = rnh->rnh_lookup(dst, netmask, &rnh->head);
2028 if (rt_mpath_capable(rnh)) {
2035 * for interface route the
2036 * rt->rt_gateway is sockaddr_intf
2037 * for cloning ARP entries, so
2038 * rt_mpath_matchgate must use the
2041 rt = rt_mpath_matchgate(rt,
2048 error = (rn == NULL ||
2049 (rn->rn_flags & RNF_ROOT) ||
2050 RNTORT(rn)->rt_ifa != ifa);
2053 /* this is only an error if bad on ALL tables */
2058 * Do the actual request
2060 bzero((caddr_t)&info, sizeof(info));
2063 info.rti_flags = flags |
2064 (ifa->ifa_flags & ~IFA_RTSELF) | RTF_PINNED;
2065 info.rti_info[RTAX_DST] = dst;
2067 * doing this for compatibility reasons
2070 info.rti_info[RTAX_GATEWAY] =
2071 (struct sockaddr *)&null_sdl;
2073 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
2074 info.rti_info[RTAX_NETMASK] = netmask;
2075 error = rtrequest1_fib(cmd, &info, &rt, fibnum);
2077 if (error == 0 && rt != NULL) {
2079 * notify any listening routing agents of the change
2084 * in case address alias finds the first address
2085 * e.g. ifconfig bge0 192.0.2.246/24
2086 * e.g. ifconfig bge0 192.0.2.247/24
2087 * the address set in the route is 192.0.2.246
2088 * so we need to replace it with 192.0.2.247
2090 if (memcmp(rt->rt_ifa->ifa_addr,
2091 ifa->ifa_addr, ifa->ifa_addr->sa_len)) {
2092 ifa_free(rt->rt_ifa);
2094 rt->rt_ifp = ifa->ifa_ifp;
2099 * doing this for compatibility reasons
2101 if (cmd == RTM_ADD) {
2102 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_type =
2103 rt->rt_ifp->if_type;
2104 ((struct sockaddr_dl *)rt->rt_gateway)->sdl_index =
2105 rt->rt_ifp->if_index;
2109 rt_newaddrmsg_fib(cmd, ifa, error, rt, fibnum);
2112 if (cmd == RTM_DELETE) {
2114 * If we are deleting, and we found an entry,
2115 * then it's been removed from the tree..
2116 * now throw it away.
2120 if (cmd == RTM_ADD) {
2122 * We just wanted to add it..
2123 * we don't actually need a reference.
2134 if (cmd == RTM_DELETE) {
2138 /* we only give an error if it wasn't in any table */
2139 error = ((flags & RTF_HOST) ?
2140 EHOSTUNREACH : ENETUNREACH);
2144 /* return an error if any of them failed */
2152 * Set up a routing table entry, normally
2156 rtinit(struct ifaddr *ifa, int cmd, int flags)
2158 struct sockaddr *dst;
2159 int fib = RT_DEFAULT_FIB;
2161 if (flags & RTF_HOST) {
2162 dst = ifa->ifa_dstaddr;
2164 dst = ifa->ifa_addr;
2167 switch (dst->sa_family) {
2170 /* We do support multiple FIBs. */
2174 return (rtinit1(ifa, cmd, flags, fib));
2178 * Announce interface address arrival/withdraw
2179 * Returns 0 on success.
2182 rt_addrmsg(int cmd, struct ifaddr *ifa, int fibnum)
2185 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2186 ("unexpected cmd %d", cmd));
2188 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2189 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2191 #if defined(INET) || defined(INET6)
2194 * notify the SCTP stack
2195 * this will only get called when an address is added/deleted
2196 * XXX pass the ifaddr struct instead if ifa->ifa_addr...
2198 sctp_addr_change(ifa, cmd);
2201 return (rtsock_addrmsg(cmd, ifa, fibnum));
2205 * Announce route addition/removal.
2206 * Users of this function MUST validate input data BEFORE calling.
2207 * However we have to be able to handle invalid data:
2208 * if some userland app sends us "invalid" route message (invalid mask,
2209 * no dst, wrong address families, etc...) we need to pass it back
2210 * to app (and any other rtsock consumers) with rtm_errno field set to
2212 * Returns 0 on success.
2215 rt_routemsg(int cmd, struct ifnet *ifp, int error, struct rtentry *rt,
2219 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2220 ("unexpected cmd %d", cmd));
2222 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2223 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2225 KASSERT(rt_key(rt) != NULL, (":%s: rt_key must be supplied", __func__));
2227 return (rtsock_routemsg(cmd, ifp, error, rt, fibnum));
2231 rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
2234 rt_newaddrmsg_fib(cmd, ifa, error, rt, RT_ALL_FIBS);
2238 * This is called to generate messages from the routing socket
2239 * indicating a network interface has had addresses associated with it.
2242 rt_newaddrmsg_fib(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt,
2246 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2247 ("unexpected cmd %u", cmd));
2248 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2249 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2251 if (cmd == RTM_ADD) {
2252 rt_addrmsg(cmd, ifa, fibnum);
2254 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2257 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2258 rt_addrmsg(cmd, ifa, fibnum);