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_mrouting.h"
42 #include "opt_mpath.h"
43 #include "opt_route.h"
45 #include <sys/param.h>
46 #include <sys/systm.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/eventhandler.h>
56 #include <sys/kernel.h>
58 #include <sys/rmlock.h>
61 #include <net/if_var.h>
62 #include <net/if_dl.h>
63 #include <net/route.h>
64 #include <net/route_var.h>
68 #include <net/radix_mpath.h>
71 #include <netinet/in.h>
72 #include <netinet/ip_mroute.h>
76 #define RT_MAXFIBS UINT16_MAX
78 /* Kernel config default option. */
81 #error "ROUTETABLES defined too low"
83 #if ROUTETABLES > RT_MAXFIBS
84 #error "ROUTETABLES defined too big"
86 #define RT_NUMFIBS ROUTETABLES
87 #endif /* ROUTETABLES */
88 /* Initialize to default if not otherwise set. */
93 /* This is read-only.. */
94 u_int rt_numfibs = RT_NUMFIBS;
95 SYSCTL_UINT(_net, OID_AUTO, fibs, CTLFLAG_RDTUN, &rt_numfibs, 0, "");
98 * By default add routes to all fibs for new interfaces.
99 * Once this is set to 0 then only allocate routes on interface
100 * changes for the FIB of the caller when adding a new set of addresses
101 * to an interface. XXX this is a shotgun aproach to a problem that needs
102 * a more fine grained solution.. that will come.
103 * XXX also has the problems getting the FIB from curthread which will not
104 * always work given the fib can be overridden and prefixes can be added
105 * from the network stack context.
107 VNET_DEFINE(u_int, rt_add_addr_allfibs) = 1;
108 SYSCTL_UINT(_net, OID_AUTO, add_addr_allfibs, CTLFLAG_RWTUN | CTLFLAG_VNET,
109 &VNET_NAME(rt_add_addr_allfibs), 0, "");
111 VNET_DEFINE(struct rtstat, rtstat);
112 #define V_rtstat VNET(rtstat)
114 VNET_DEFINE(struct rib_head *, rt_tables);
115 #define V_rt_tables VNET(rt_tables)
117 VNET_DEFINE(int, rttrash); /* routes not in table but not freed */
118 #define V_rttrash VNET(rttrash)
122 * Convert a 'struct radix_node *' to a 'struct rtentry *'.
123 * The operation can be done safely (in this code) because a
124 * 'struct rtentry' starts with two 'struct radix_node''s, the first
125 * one representing leaf nodes in the routing tree, which is
126 * what the code in radix.c passes us as a 'struct radix_node'.
128 * But because there are a lot of assumptions in this conversion,
129 * do not cast explicitly, but always use the macro below.
131 #define RNTORT(p) ((struct rtentry *)(p))
133 VNET_DEFINE_STATIC(uma_zone_t, rtzone); /* Routing table UMA zone. */
134 #define V_rtzone VNET(rtzone)
136 EVENTHANDLER_LIST_DEFINE(rt_addrmsg);
138 static int rtrequest1_fib_change(struct rib_head *, struct rt_addrinfo *,
139 struct rtentry **, u_int);
140 static void rt_setmetrics(const struct rt_addrinfo *, struct rtentry *);
141 static int rt_ifdelroute(const struct rtentry *rt, void *arg);
142 static struct rtentry *rt_unlinkrte(struct rib_head *rnh,
143 struct rt_addrinfo *info, int *perror);
144 static void rt_notifydelete(struct rtentry *rt, struct rt_addrinfo *info);
146 static struct radix_node *rt_mpath_unlink(struct rib_head *rnh,
147 struct rt_addrinfo *info, struct rtentry *rto, int *perror);
149 static int rt_exportinfo(struct rtentry *rt, struct rt_addrinfo *info,
158 static int if_updatemtu_cb(struct radix_node *, void *);
161 * handler for net.my_fibnum
164 sysctl_my_fibnum(SYSCTL_HANDLER_ARGS)
169 fibnum = curthread->td_proc->p_fibnum;
170 error = sysctl_handle_int(oidp, &fibnum, 0, req);
174 SYSCTL_PROC(_net, OID_AUTO, my_fibnum, CTLTYPE_INT|CTLFLAG_RD,
175 NULL, 0, &sysctl_my_fibnum, "I", "default FIB of caller");
177 static __inline struct rib_head **
178 rt_tables_get_rnh_ptr(int table, int fam)
180 struct rib_head **rnh;
182 KASSERT(table >= 0 && table < rt_numfibs, ("%s: table out of bounds.",
184 KASSERT(fam >= 0 && fam < (AF_MAX+1), ("%s: fam out of bounds.",
187 /* rnh is [fib=0][af=0]. */
188 rnh = (struct rib_head **)V_rt_tables;
189 /* Get the offset to the requested table and fam. */
190 rnh += table * (AF_MAX+1) + fam;
196 rt_tables_get_rnh(int table, int fam)
199 return (*rt_tables_get_rnh_ptr(table, fam));
203 rt_tables_get_gen(int table, int fam)
205 struct rib_head *rnh;
207 rnh = *rt_tables_get_rnh_ptr(table, fam);
208 KASSERT(rnh != NULL, ("%s: NULL rib_head pointer table %d fam %d",
209 __func__, table, fam));
210 return (rnh->rnh_gen);
215 * route initialization must occur before ip6_init2(), which happenas at
222 /* whack the tunable ints into line. */
223 if (rt_numfibs > RT_MAXFIBS)
224 rt_numfibs = RT_MAXFIBS;
228 SYSINIT(route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, NULL);
231 rtentry_zinit(void *mem, int size, int how)
233 struct rtentry *rt = mem;
235 rt->rt_pksent = counter_u64_alloc(how);
236 if (rt->rt_pksent == NULL)
245 rtentry_zfini(void *mem, int size)
247 struct rtentry *rt = mem;
250 counter_u64_free(rt->rt_pksent);
254 rtentry_ctor(void *mem, int size, void *arg, int how)
256 struct rtentry *rt = mem;
258 bzero(rt, offsetof(struct rtentry, rt_endzero));
259 counter_u64_zero(rt->rt_pksent);
266 rtentry_dtor(void *mem, int size, void *arg)
268 struct rtentry *rt = mem;
274 vnet_route_init(const void *unused __unused)
277 struct rib_head **rnh;
281 V_rt_tables = malloc(rt_numfibs * (AF_MAX+1) *
282 sizeof(struct rib_head *), M_RTABLE, M_WAITOK|M_ZERO);
284 V_rtzone = uma_zcreate("rtentry", sizeof(struct rtentry),
285 rtentry_ctor, rtentry_dtor,
286 rtentry_zinit, rtentry_zfini, UMA_ALIGN_PTR, 0);
287 for (dom = domains; dom; dom = dom->dom_next) {
288 if (dom->dom_rtattach == NULL)
291 for (table = 0; table < rt_numfibs; table++) {
292 fam = dom->dom_family;
293 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
296 rnh = rt_tables_get_rnh_ptr(table, fam);
298 panic("%s: rnh NULL", __func__);
299 dom->dom_rtattach((void **)rnh, 0);
303 VNET_SYSINIT(vnet_route_init, SI_SUB_PROTO_DOMAIN, SI_ORDER_FOURTH,
308 vnet_route_uninit(const void *unused __unused)
313 struct rib_head **rnh;
315 for (dom = domains; dom; dom = dom->dom_next) {
316 if (dom->dom_rtdetach == NULL)
319 for (table = 0; table < rt_numfibs; table++) {
320 fam = dom->dom_family;
322 if (table != 0 && fam != AF_INET6 && fam != AF_INET)
325 rnh = rt_tables_get_rnh_ptr(table, fam);
327 panic("%s: rnh NULL", __func__);
328 dom->dom_rtdetach((void **)rnh, 0);
332 free(V_rt_tables, M_RTABLE);
333 uma_zdestroy(V_rtzone);
335 VNET_SYSUNINIT(vnet_route_uninit, SI_SUB_PROTO_DOMAIN, SI_ORDER_FIRST,
336 vnet_route_uninit, 0);
340 rt_table_init(int offset)
344 rh = malloc(sizeof(struct rib_head), M_RTABLE, M_WAITOK | M_ZERO);
346 /* TODO: These details should be hidded inside radix.c */
347 /* Init masks tree */
348 rn_inithead_internal(&rh->head, rh->rnh_nodes, offset);
349 rn_inithead_internal(&rh->rmhead.head, rh->rmhead.mask_nodes, 0);
350 rh->head.rnh_masks = &rh->rmhead;
355 /* Finally, set base callbacks */
356 rh->rnh_addaddr = rn_addroute;
357 rh->rnh_deladdr = rn_delete;
358 rh->rnh_matchaddr = rn_match;
359 rh->rnh_lookup = rn_lookup;
360 rh->rnh_walktree = rn_walktree;
361 rh->rnh_walktree_from = rn_walktree_from;
367 rt_freeentry(struct radix_node *rn, void *arg)
369 struct radix_head * const rnh = arg;
370 struct radix_node *x;
372 x = (struct radix_node *)rn_delete(rn + 2, NULL, rnh);
379 rt_table_destroy(struct rib_head *rh)
382 rn_walktree(&rh->rmhead.head, rt_freeentry, &rh->rmhead.head);
384 /* Assume table is already empty */
385 RIB_LOCK_DESTROY(rh);
390 #ifndef _SYS_SYSPROTO_H_
396 sys_setfib(struct thread *td, struct setfib_args *uap)
398 if (uap->fibnum < 0 || uap->fibnum >= rt_numfibs)
400 td->td_proc->p_fibnum = uap->fibnum;
405 * Packet routing routines.
408 rtalloc_ign_fib(struct route *ro, u_long ignore, u_int fibnum)
412 if ((rt = ro->ro_rt) != NULL) {
413 if (rt->rt_ifp != NULL && rt->rt_flags & RTF_UP)
418 ro->ro_rt = rtalloc1_fib(&ro->ro_dst, 1, ignore, fibnum);
420 RT_UNLOCK(ro->ro_rt);
424 * Look up the route that matches the address given
425 * Or, at least try.. Create a cloned route if needed.
427 * The returned route, if any, is locked.
430 rtalloc1(struct sockaddr *dst, int report, u_long ignflags)
433 return (rtalloc1_fib(dst, report, ignflags, RT_DEFAULT_FIB));
437 rtalloc1_fib(struct sockaddr *dst, int report, u_long ignflags,
442 struct radix_node *rn;
443 struct rtentry *newrt;
444 struct rt_addrinfo info;
445 int err = 0, msgtype = RTM_MISS;
447 KASSERT((fibnum < rt_numfibs), ("rtalloc1_fib: bad fibnum"));
448 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
454 * Look up the address in the table for that Address Family
456 if ((ignflags & RTF_RNH_LOCKED) == 0)
462 rn = rh->rnh_matchaddr(dst, &rh->head);
463 if (rn && ((rn->rn_flags & RNF_ROOT) == 0)) {
467 if ((ignflags & RTF_RNH_LOCKED) == 0)
471 } else if ((ignflags & RTF_RNH_LOCKED) == 0)
474 * Either we hit the root or could not find any match,
475 * which basically means: "cannot get there from here".
478 V_rtstat.rts_unreach++;
482 * If required, report the failure to the supervising
484 * For a delete, this is not an error. (report == 0)
486 bzero(&info, sizeof(info));
487 info.rti_info[RTAX_DST] = dst;
488 rt_missmsg_fib(msgtype, &info, 0, err, fibnum);
494 * Remove a reference count from an rtentry.
495 * If the count gets low enough, take it out of the routing table
498 rtfree(struct rtentry *rt)
500 struct rib_head *rnh;
502 KASSERT(rt != NULL,("%s: NULL rt", __func__));
503 rnh = rt_tables_get_rnh(rt->rt_fibnum, rt_key(rt)->sa_family);
504 KASSERT(rnh != NULL,("%s: NULL rnh", __func__));
509 * The callers should use RTFREE_LOCKED() or RTFREE(), so
510 * we should come here exactly with the last reference.
513 if (rt->rt_refcnt > 0) {
514 log(LOG_DEBUG, "%s: %p has %d refs\n", __func__, rt, rt->rt_refcnt);
519 * On last reference give the "close method" a chance
520 * to cleanup private state. This also permits (for
521 * IPv4 and IPv6) a chance to decide if the routing table
522 * entry should be purged immediately or at a later time.
523 * When an immediate purge is to happen the close routine
524 * typically calls rtexpunge which clears the RTF_UP flag
525 * on the entry so that the code below reclaims the storage.
527 if (rt->rt_refcnt == 0 && rnh->rnh_close)
528 rnh->rnh_close((struct radix_node *)rt, &rnh->head);
531 * If we are no longer "up" (and ref == 0)
532 * then we can free the resources associated
535 if ((rt->rt_flags & RTF_UP) == 0) {
536 if (rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT))
539 * the rtentry must have been removed from the routing table
540 * so it is represented in rttrash.. remove that now.
544 if (rt->rt_refcnt < 0) {
545 printf("rtfree: %p not freed (neg refs)\n", rt);
550 * release references on items we hold them on..
551 * e.g other routes and ifaddrs.
554 ifa_free(rt->rt_ifa);
556 * The key is separatly alloc'd so free it (see rt_setgate()).
557 * This also frees the gateway, as they are always malloc'd
563 * and the rtentry itself of course
565 uma_zfree(V_rtzone, rt);
574 * Force a routing table entry to the specified
575 * destination to go through the given gateway.
576 * Normally called as a result of a routing redirect
577 * message from the network layer.
580 rtredirect_fib(struct sockaddr *dst,
581 struct sockaddr *gateway,
582 struct sockaddr *netmask,
584 struct sockaddr *src,
590 struct rt_addrinfo info;
592 struct rib_head *rnh;
597 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
599 error = EAFNOSUPPORT;
602 /* verify the gateway is directly reachable */
603 if ((ifa = ifa_ifwithnet(gateway, 0, fibnum)) == NULL) {
607 rt = rtalloc1_fib(dst, 0, 0UL, fibnum); /* NB: rt is locked */
609 * If the redirect isn't from our current router for this dst,
610 * it's either old or wrong. If it redirects us to ourselves,
611 * we have a routing loop, perhaps as a result of an interface
612 * going down recently.
614 if (!(flags & RTF_DONE) && rt) {
615 if (!sa_equal(src, rt->rt_gateway)) {
619 if (rt->rt_ifa != ifa && ifa->ifa_addr->sa_family != AF_LINK) {
624 if ((flags & RTF_GATEWAY) && ifa_ifwithaddr_check(gateway)) {
625 error = EHOSTUNREACH;
629 * Create a new entry if we just got back a wildcard entry
630 * or the lookup failed. This is necessary for hosts
631 * which use routing redirects generated by smart gateways
632 * to dynamically build the routing tables.
634 if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
637 * Don't listen to the redirect if it's
638 * for a route to an interface.
640 if (rt->rt_flags & RTF_GATEWAY) {
641 if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
643 * Changing from route to net => route to host.
644 * Create new route, rather than smashing route to net.
650 flags |= RTF_DYNAMIC;
651 bzero((caddr_t)&info, sizeof(info));
652 info.rti_info[RTAX_DST] = dst;
653 info.rti_info[RTAX_GATEWAY] = gateway;
654 info.rti_info[RTAX_NETMASK] = netmask;
657 info.rti_flags = flags;
658 error = rtrequest1_fib(RTM_ADD, &info, &rt, fibnum);
661 flags = rt->rt_flags;
664 stat = &V_rtstat.rts_dynamic;
668 * Smash the current notion of the gateway to
669 * this destination. Should check about netmask!!!
671 if ((flags & RTF_GATEWAY) == 0)
672 rt->rt_flags &= ~RTF_GATEWAY;
673 rt->rt_flags |= RTF_MODIFIED;
674 flags |= RTF_MODIFIED;
675 stat = &V_rtstat.rts_newgateway;
677 * add the key and gateway (in one malloc'd chunk).
682 rt_setgate(rt, rt_key(rt), gateway);
686 error = EHOSTUNREACH;
692 V_rtstat.rts_badredirect++;
693 else if (stat != NULL)
695 bzero((caddr_t)&info, sizeof(info));
696 info.rti_info[RTAX_DST] = dst;
697 info.rti_info[RTAX_GATEWAY] = gateway;
698 info.rti_info[RTAX_NETMASK] = netmask;
699 info.rti_info[RTAX_AUTHOR] = src;
700 rt_missmsg_fib(RTM_REDIRECT, &info, flags, error, fibnum);
704 * Routing table ioctl interface.
707 rtioctl_fib(u_long req, caddr_t data, u_int fibnum)
711 * If more ioctl commands are added here, make sure the proper
712 * super-user checks are being performed because it is possible for
713 * prison-root to make it this far if raw sockets have been enabled
717 /* Multicast goop, grrr... */
718 return mrt_ioctl ? mrt_ioctl(req, data, fibnum) : EOPNOTSUPP;
725 ifa_ifwithroute(int flags, const struct sockaddr *dst, struct sockaddr *gateway,
731 MPASS(in_epoch(net_epoch_preempt));
732 if ((flags & RTF_GATEWAY) == 0) {
734 * If we are adding a route to an interface,
735 * and the interface is a pt to pt link
736 * we should search for the destination
737 * as our clue to the interface. Otherwise
738 * we can use the local address.
741 if (flags & RTF_HOST)
742 ifa = ifa_ifwithdstaddr(dst, fibnum);
744 ifa = ifa_ifwithaddr(gateway);
747 * If we are adding a route to a remote net
748 * or host, the gateway may still be on the
749 * other end of a pt to pt link.
751 ifa = ifa_ifwithdstaddr(gateway, fibnum);
754 ifa = ifa_ifwithnet(gateway, 0, fibnum);
758 rt = rtalloc1_fib(gateway, 0, flags, fibnum);
762 * dismiss a gateway that is reachable only
763 * through the default router
765 switch (gateway->sa_family) {
767 if (satosin(rt_key(rt))->sin_addr.s_addr == INADDR_ANY)
771 if (IN6_IS_ADDR_UNSPECIFIED(&satosin6(rt_key(rt))->sin6_addr))
777 if (!not_found && rt->rt_ifa != NULL) {
782 if (not_found || ifa == NULL)
785 if (ifa->ifa_addr->sa_family != dst->sa_family) {
786 struct ifaddr *oifa = ifa;
787 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
796 * Do appropriate manipulations of a routing tree given
797 * all the bits of info needed
800 rtrequest_fib(int req,
801 struct sockaddr *dst,
802 struct sockaddr *gateway,
803 struct sockaddr *netmask,
805 struct rtentry **ret_nrt,
808 struct rt_addrinfo info;
810 if (dst->sa_len == 0)
813 bzero((caddr_t)&info, sizeof(info));
814 info.rti_flags = flags;
815 info.rti_info[RTAX_DST] = dst;
816 info.rti_info[RTAX_GATEWAY] = gateway;
817 info.rti_info[RTAX_NETMASK] = netmask;
818 return rtrequest1_fib(req, &info, ret_nrt, fibnum);
823 * Copy most of @rt data into @info.
825 * If @flags contains NHR_COPY, copies dst,netmask and gw to the
826 * pointers specified by @info structure. Assume such pointers
827 * are zeroed sockaddr-like structures with sa_len field initialized
828 * to reflect size of the provided buffer. if no NHR_COPY is specified,
829 * point dst,netmask and gw @info fields to appropriate @rt values.
831 * if @flags contains NHR_REF, do refcouting on rt_ifp.
833 * Returns 0 on success.
836 rt_exportinfo(struct rtentry *rt, struct rt_addrinfo *info, int flags)
838 struct rt_metrics *rmx;
839 struct sockaddr *src, *dst;
842 if (flags & NHR_COPY) {
843 /* Copy destination if dst is non-zero */
845 dst = info->rti_info[RTAX_DST];
846 sa_len = src->sa_len;
848 if (src->sa_len > dst->sa_len)
850 memcpy(dst, src, src->sa_len);
851 info->rti_addrs |= RTA_DST;
854 /* Copy mask if set && dst is non-zero */
856 dst = info->rti_info[RTAX_NETMASK];
857 if (src != NULL && dst != NULL) {
860 * Radix stores different value in sa_len,
861 * assume rt_mask() to have the same length
864 if (sa_len > dst->sa_len)
866 memcpy(dst, src, src->sa_len);
867 info->rti_addrs |= RTA_NETMASK;
870 /* Copy gateway is set && dst is non-zero */
871 src = rt->rt_gateway;
872 dst = info->rti_info[RTAX_GATEWAY];
873 if ((rt->rt_flags & RTF_GATEWAY) && src != NULL && dst != NULL){
874 if (src->sa_len > dst->sa_len)
876 memcpy(dst, src, src->sa_len);
877 info->rti_addrs |= RTA_GATEWAY;
880 info->rti_info[RTAX_DST] = rt_key(rt);
881 info->rti_addrs |= RTA_DST;
882 if (rt_mask(rt) != NULL) {
883 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
884 info->rti_addrs |= RTA_NETMASK;
886 if (rt->rt_flags & RTF_GATEWAY) {
887 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
888 info->rti_addrs |= RTA_GATEWAY;
894 info->rti_mflags |= RTV_MTU;
895 rmx->rmx_mtu = rt->rt_mtu;
898 info->rti_flags = rt->rt_flags;
899 info->rti_ifp = rt->rt_ifp;
900 info->rti_ifa = rt->rt_ifa;
901 ifa_ref(info->rti_ifa);
902 if (flags & NHR_REF) {
903 /* Do 'traditional' refcouting */
904 if_ref(info->rti_ifp);
911 * Lookups up route entry for @dst in RIB database for fib @fibnum.
912 * Exports entry data to @info using rt_exportinfo().
914 * if @flags contains NHR_REF, refcouting is performed on rt_ifp.
915 * All references can be released later by calling rib_free_info()
917 * Returns 0 on success.
918 * Returns ENOENT for lookup failure, ENOMEM for export failure.
921 rib_lookup_info(uint32_t fibnum, const struct sockaddr *dst, uint32_t flags,
922 uint32_t flowid, struct rt_addrinfo *info)
926 struct radix_node *rn;
930 KASSERT((fibnum < rt_numfibs), ("rib_lookup_rte: bad fibnum"));
931 rh = rt_tables_get_rnh(fibnum, dst->sa_family);
936 rn = rh->rnh_matchaddr(__DECONST(void *, dst), &rh->head);
937 if (rn != NULL && ((rn->rn_flags & RNF_ROOT) == 0)) {
939 /* Ensure route & ifp is UP */
940 if (RT_LINK_IS_UP(rt->rt_ifp)) {
941 flags = (flags & NHR_REF) | NHR_COPY;
942 error = rt_exportinfo(rt, info, flags);
954 * Releases all references acquired by rib_lookup_info() when
955 * called with NHR_REF flags.
958 rib_free_info(struct rt_addrinfo *info)
961 if_rele(info->rti_ifp);
965 * Iterates over all existing fibs in system calling
966 * @setwa_f function prior to traversing each fib.
967 * Calls @wa_f function for each element in current fib.
968 * If af is not AF_UNSPEC, iterates over fibs in particular
972 rt_foreach_fib_walk(int af, rt_setwarg_t *setwa_f, rt_walktree_f_t *wa_f,
975 struct rib_head *rnh;
979 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
980 /* Do we want some specific family? */
981 if (af != AF_UNSPEC) {
982 rnh = rt_tables_get_rnh(fibnum, af);
986 setwa_f(rnh, fibnum, af, arg);
989 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
994 for (i = 1; i <= AF_MAX; i++) {
995 rnh = rt_tables_get_rnh(fibnum, i);
999 setwa_f(rnh, fibnum, i, arg);
1002 rnh->rnh_walktree(&rnh->head, (walktree_f_t *)wa_f,arg);
1010 struct rt_addrinfo info;
1011 struct rib_head *rnh;
1012 struct rtentry *head;
1016 * Conditionally unlinks @rn from radix tree based
1017 * on info data passed in @arg.
1020 rt_checkdelroute(struct radix_node *rn, void *arg)
1022 struct rt_delinfo *di;
1023 struct rt_addrinfo *info;
1027 di = (struct rt_delinfo *)arg;
1028 rt = (struct rtentry *)rn;
1032 info->rti_info[RTAX_DST] = rt_key(rt);
1033 info->rti_info[RTAX_NETMASK] = rt_mask(rt);
1034 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1036 rt = rt_unlinkrte(di->rnh, info, &error);
1038 /* Either not allowed or not matched. Skip entry */
1042 /* Entry was unlinked. Add to the list and return */
1043 rt->rt_chain = di->head;
1050 * Iterates over all existing fibs in system.
1051 * Deletes each element for which @filter_f function returned
1053 * If @af is not AF_UNSPEC, iterates over fibs in particular
1057 rt_foreach_fib_walk_del(int af, rt_filter_f_t *filter_f, void *arg)
1059 struct rib_head *rnh;
1060 struct rt_delinfo di;
1065 bzero(&di, sizeof(di));
1066 di.info.rti_filter = filter_f;
1067 di.info.rti_filterdata = arg;
1069 for (fibnum = 0; fibnum < rt_numfibs; fibnum++) {
1070 /* Do we want some specific family? */
1071 if (af != AF_UNSPEC) {
1079 for (i = start; i <= end; i++) {
1080 rnh = rt_tables_get_rnh(fibnum, i);
1086 rnh->rnh_walktree(&rnh->head, rt_checkdelroute, &di);
1089 if (di.head == NULL)
1092 /* We might have something to reclaim */
1093 while (di.head != NULL) {
1095 di.head = rt->rt_chain;
1096 rt->rt_chain = NULL;
1098 /* TODO std rt -> rt_addrinfo export */
1099 di.info.rti_info[RTAX_DST] = rt_key(rt);
1100 di.info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1102 rt_notifydelete(rt, &di.info);
1111 * Delete Routes for a Network Interface
1113 * Called for each routing entry via the rnh->rnh_walktree() call above
1114 * to delete all route entries referencing a detaching network interface.
1117 * rt pointer to rtentry
1118 * arg argument passed to rnh->rnh_walktree() - detaching interface
1122 * errno failed - reason indicated
1125 rt_ifdelroute(const struct rtentry *rt, void *arg)
1127 struct ifnet *ifp = arg;
1129 if (rt->rt_ifp != ifp)
1133 * Protect (sorta) against walktree recursion problems
1134 * with cloned routes
1136 if ((rt->rt_flags & RTF_UP) == 0)
1143 * Delete all remaining routes using this interface
1144 * Unfortuneatly the only way to do this is to slog through
1145 * the entire routing table looking for routes which point
1146 * to this interface...oh well...
1149 rt_flushifroutes_af(struct ifnet *ifp, int af)
1151 KASSERT((af >= 1 && af <= AF_MAX), ("%s: af %d not >= 1 and <= %d",
1152 __func__, af, AF_MAX));
1154 rt_foreach_fib_walk_del(af, rt_ifdelroute, ifp);
1158 rt_flushifroutes(struct ifnet *ifp)
1161 rt_foreach_fib_walk_del(AF_UNSPEC, rt_ifdelroute, ifp);
1165 * Conditionally unlinks rtentry matching data inside @info from @rnh.
1166 * Returns unlinked, locked and referenced @rtentry on success,
1167 * Returns NULL and sets @perror to:
1168 * ESRCH - if prefix was not found,
1169 * EADDRINUSE - if trying to delete PINNED route without appropriate flag.
1170 * ENOENT - if supplied filter function returned 0 (not matched).
1172 static struct rtentry *
1173 rt_unlinkrte(struct rib_head *rnh, struct rt_addrinfo *info, int *perror)
1175 struct sockaddr *dst, *netmask;
1177 struct radix_node *rn;
1179 dst = info->rti_info[RTAX_DST];
1180 netmask = info->rti_info[RTAX_NETMASK];
1182 rt = (struct rtentry *)rnh->rnh_lookup(dst, netmask, &rnh->head);
1188 if ((info->rti_flags & RTF_PINNED) == 0) {
1189 /* Check if target route can be deleted */
1190 if (rt->rt_flags & RTF_PINNED) {
1191 *perror = EADDRINUSE;
1196 if (info->rti_filter != NULL) {
1197 if (info->rti_filter(rt, info->rti_filterdata) == 0) {
1204 * Filter function requested rte deletion.
1205 * Ease the caller work by filling in remaining info
1206 * from that particular entry.
1208 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1212 * Remove the item from the tree and return it.
1213 * Complain if it is not there and do no more processing.
1217 if (rt_mpath_capable(rnh))
1218 rn = rt_mpath_unlink(rnh, info, rt, perror);
1221 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1225 if (rn->rn_flags & (RNF_ACTIVE | RNF_ROOT))
1226 panic ("rtrequest delete");
1231 rt->rt_flags &= ~RTF_UP;
1239 rt_notifydelete(struct rtentry *rt, struct rt_addrinfo *info)
1244 * give the protocol a chance to keep things in sync.
1247 if (ifa != NULL && ifa->ifa_rtrequest != NULL)
1248 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1251 * One more rtentry floating around that is not
1252 * linked to the routing table. rttrash will be decremented
1253 * when RTFREE(rt) is eventually called.
1260 * These (questionable) definitions of apparent local variables apply
1261 * to the next two functions. XXXXXX!!!
1263 #define dst info->rti_info[RTAX_DST]
1264 #define gateway info->rti_info[RTAX_GATEWAY]
1265 #define netmask info->rti_info[RTAX_NETMASK]
1266 #define ifaaddr info->rti_info[RTAX_IFA]
1267 #define ifpaddr info->rti_info[RTAX_IFP]
1268 #define flags info->rti_flags
1271 * Look up rt_addrinfo for a specific fib. Note that if rti_ifa is defined,
1272 * it will be referenced so the caller must free it.
1274 * Assume basic consistency checks are executed by callers:
1275 * RTAX_DST exists, if RTF_GATEWAY is set, RTAX_GATEWAY exists as well.
1278 rt_getifa_fib(struct rt_addrinfo *info, u_int fibnum)
1280 struct epoch_tracker et;
1284 * ifp may be specified by sockaddr_dl
1285 * when protocol address is ambiguous.
1288 needref = (info->rti_ifa == NULL);
1289 NET_EPOCH_ENTER(et);
1291 /* If we have interface specified by the ifindex in the address, use it */
1292 if (info->rti_ifp == NULL && ifpaddr != NULL &&
1293 ifpaddr->sa_family == AF_LINK) {
1294 const struct sockaddr_dl *sdl = (const struct sockaddr_dl *)ifpaddr;
1295 if (sdl->sdl_index != 0)
1296 info->rti_ifp = ifnet_byindex(sdl->sdl_index);
1299 * If we have source address specified, try to find it
1300 * TODO: avoid enumerating all ifas on all interfaces.
1302 if (info->rti_ifa == NULL && ifaaddr != NULL)
1303 info->rti_ifa = ifa_ifwithaddr(ifaaddr);
1304 if (info->rti_ifa == NULL) {
1305 struct sockaddr *sa;
1308 * Most common use case for the userland-supplied routes.
1310 * Choose sockaddr to select ifa.
1311 * -- if ifp is set --
1312 * Order of preference:
1314 * 2) gateway address
1315 * Note: for interface routes link-level gateway address
1316 * is specified to indicate the interface index without
1317 * specifying RTF_GATEWAY. In this case, ignore gateway
1318 * Note: gateway AF may be different from dst AF. In this case,
1320 * 3) final destination.
1321 * 4) if all of these fails, try to get at least link-level ifa.
1323 * try to lookup gateway or dst in the routing table to get ifa
1325 if (info->rti_info[RTAX_IFA] != NULL)
1326 sa = info->rti_info[RTAX_IFA];
1327 else if ((info->rti_flags & RTF_GATEWAY) != 0 &&
1328 gateway->sa_family == dst->sa_family)
1332 if (info->rti_ifp != NULL) {
1333 info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
1335 if (info->rti_ifa == NULL && gateway != NULL)
1336 info->rti_ifa = ifaof_ifpforaddr(gateway, info->rti_ifp);
1337 } else if (dst != NULL && gateway != NULL)
1338 info->rti_ifa = ifa_ifwithroute(flags, dst, gateway,
1340 else if (sa != NULL)
1341 info->rti_ifa = ifa_ifwithroute(flags, sa, sa,
1344 if (needref && info->rti_ifa != NULL) {
1345 if (info->rti_ifp == NULL)
1346 info->rti_ifp = info->rti_ifa->ifa_ifp;
1347 ifa_ref(info->rti_ifa);
1349 error = ENETUNREACH;
1355 if_updatemtu_cb(struct radix_node *rn, void *arg)
1358 struct if_mtuinfo *ifmtu;
1360 rt = (struct rtentry *)rn;
1361 ifmtu = (struct if_mtuinfo *)arg;
1363 if (rt->rt_ifp != ifmtu->ifp)
1366 if (rt->rt_mtu >= ifmtu->mtu) {
1367 /* We have to decrease mtu regardless of flags */
1368 rt->rt_mtu = ifmtu->mtu;
1373 * New MTU is bigger. Check if are allowed to alter it
1375 if ((rt->rt_flags & (RTF_FIXEDMTU | RTF_GATEWAY | RTF_HOST)) != 0) {
1378 * Skip routes with user-supplied MTU and
1379 * non-interface routes
1384 /* We are safe to update route MTU */
1385 rt->rt_mtu = ifmtu->mtu;
1391 rt_updatemtu(struct ifnet *ifp)
1393 struct if_mtuinfo ifmtu;
1394 struct rib_head *rnh;
1400 * Try to update rt_mtu for all routes using this interface
1401 * Unfortunately the only way to do this is to traverse all
1402 * routing tables in all fibs/domains.
1404 for (i = 1; i <= AF_MAX; i++) {
1405 ifmtu.mtu = if_getmtu_family(ifp, i);
1406 for (j = 0; j < rt_numfibs; j++) {
1407 rnh = rt_tables_get_rnh(j, i);
1411 rnh->rnh_walktree(&rnh->head, if_updatemtu_cb, &ifmtu);
1419 int p_sockaddr(char *buf, int buflen, struct sockaddr *s);
1420 int rt_print(char *buf, int buflen, struct rtentry *rt);
1423 p_sockaddr(char *buf, int buflen, struct sockaddr *s)
1427 switch (s->sa_family) {
1429 paddr = &((struct sockaddr_in *)s)->sin_addr;
1432 paddr = &((struct sockaddr_in6 *)s)->sin6_addr;
1439 if (inet_ntop(s->sa_family, paddr, buf, buflen) == NULL)
1442 return (strlen(buf));
1446 rt_print(char *buf, int buflen, struct rtentry *rt)
1448 struct sockaddr *addr, *mask;
1454 i = p_sockaddr(buf, buflen, addr);
1455 if (!(rt->rt_flags & RTF_HOST)) {
1457 i += p_sockaddr(buf + i, buflen - i, mask);
1460 if (rt->rt_flags & RTF_GATEWAY) {
1462 i += p_sockaddr(buf + i, buflen - i, rt->rt_gateway);
1471 * Deletes key for single-path routes, unlinks rtentry with
1472 * gateway specified in @info from multi-path routes.
1474 * Returnes unlinked entry. In case of failure, returns NULL
1475 * and sets @perror to ESRCH.
1477 static struct radix_node *
1478 rt_mpath_unlink(struct rib_head *rnh, struct rt_addrinfo *info,
1479 struct rtentry *rto, int *perror)
1482 * if we got multipath routes, we require users to specify
1483 * a matching RTAX_GATEWAY.
1485 struct rtentry *rt; // *rto = NULL;
1486 struct radix_node *rn;
1487 struct sockaddr *gw;
1489 gw = info->rti_info[RTAX_GATEWAY];
1490 rt = rt_mpath_matchgate(rto, gw);
1497 * this is the first entry in the chain
1500 rn = rn_mpath_next((struct radix_node *)rt);
1502 * there is another entry, now it's active
1507 rto->rt_flags |= RTF_UP;
1509 } else if (rt->rt_flags & RTF_GATEWAY) {
1511 * For gateway routes, we need to
1512 * make sure that we we are deleting
1513 * the correct gateway.
1514 * rt_mpath_matchgate() does not
1515 * check the case when there is only
1516 * one route in the chain.
1519 (rt->rt_gateway->sa_len != gw->sa_len ||
1520 memcmp(rt->rt_gateway, gw, gw->sa_len))) {
1527 * use the normal delete code to remove
1530 rn = rnh->rnh_deladdr(dst, netmask, &rnh->head);
1536 * if the entry is 2nd and on up
1538 if (rt_mpath_deldup(rto, rt) == 0)
1539 panic ("rtrequest1: rt_mpath_deldup");
1541 rn = (struct radix_node *)rt;
1547 rtrequest1_fib(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt,
1551 struct rtentry *rt, *rt_old;
1552 struct radix_node *rn;
1553 struct rib_head *rnh;
1555 struct sockaddr *ndst;
1556 struct sockaddr_storage mdst;
1558 KASSERT((fibnum < rt_numfibs), ("rtrequest1_fib: bad fibnum"));
1559 KASSERT((flags & RTF_RNH_LOCKED) == 0, ("rtrequest1_fib: locked"));
1560 switch (dst->sa_family) {
1563 /* We support multiple FIBs. */
1566 fibnum = RT_DEFAULT_FIB;
1571 * Find the correct routing tree to use for this Address Family
1573 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
1575 return (EAFNOSUPPORT);
1578 * If we are adding a host route then we don't want to put
1579 * a netmask in the tree, nor do we want to clone it.
1581 if (flags & RTF_HOST)
1587 if (dst->sa_len > sizeof(mdst))
1589 rt_maskedcopy(dst, (struct sockaddr *)&mdst, netmask);
1590 dst = (struct sockaddr *)&mdst;
1594 rt = rt_unlinkrte(rnh, info, &error);
1599 rt_notifydelete(rt, info);
1602 * If the caller wants it, then it can have it,
1603 * but it's up to it to free the rtentry as we won't be
1614 * resolve was only used for route cloning
1619 if ((flags & RTF_GATEWAY) && !gateway)
1621 if (dst && gateway && (dst->sa_family != gateway->sa_family) &&
1622 (gateway->sa_family != AF_UNSPEC) && (gateway->sa_family != AF_LINK))
1625 if (info->rti_ifa == NULL) {
1626 error = rt_getifa_fib(info, fibnum);
1630 rt = uma_zalloc(V_rtzone, M_NOWAIT);
1634 rt->rt_flags = RTF_UP | flags;
1635 rt->rt_fibnum = fibnum;
1637 * Add the gateway. Possibly re-malloc-ing the storage for it.
1639 if ((error = rt_setgate(rt, dst, gateway)) != 0) {
1640 uma_zfree(V_rtzone, rt);
1645 * point to the (possibly newly malloc'd) dest address.
1647 ndst = (struct sockaddr *)rt_key(rt);
1650 * make sure it contains the value we want (masked if needed).
1653 rt_maskedcopy(dst, ndst, netmask);
1655 bcopy(dst, ndst, dst->sa_len);
1658 * We use the ifa reference returned by rt_getifa_fib().
1659 * This moved from below so that rnh->rnh_addaddr() can
1660 * examine the ifa and ifa->ifa_ifp if it so desires.
1662 ifa = info->rti_ifa;
1665 rt->rt_ifp = ifa->ifa_ifp;
1668 rt_setmetrics(info, rt);
1673 /* do not permit exactly the same dst/mask/gw pair */
1674 if (rt_mpath_capable(rnh) &&
1675 rt_mpath_conflict(rnh, rt, netmask)) {
1678 ifa_free(rt->rt_ifa);
1680 uma_zfree(V_rtzone, rt);
1685 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
1686 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head, rt->rt_nodes);
1689 if (rn == NULL && (info->rti_flags & RTF_PINNED) != 0) {
1692 * Force removal and re-try addition
1693 * TODO: better multipath&pinned support
1695 struct sockaddr *info_dst = info->rti_info[RTAX_DST];
1696 info->rti_info[RTAX_DST] = ndst;
1697 /* Do not delete existing PINNED(interface) routes */
1698 info->rti_flags &= ~RTF_PINNED;
1699 rt_old = rt_unlinkrte(rnh, info, &error);
1700 info->rti_flags |= RTF_PINNED;
1701 info->rti_info[RTAX_DST] = info_dst;
1703 rn = rnh->rnh_addaddr(ndst, netmask, &rnh->head,
1712 * If it still failed to go into the tree,
1713 * then un-make it (this should be a function)
1716 ifa_free(rt->rt_ifa);
1718 uma_zfree(V_rtzone, rt);
1722 if (rt_old != NULL) {
1723 rt_notifydelete(rt_old, info);
1728 * If this protocol has something to add to this then
1729 * allow it to do that as well.
1731 if (ifa->ifa_rtrequest)
1732 ifa->ifa_rtrequest(req, rt, info);
1735 * actually return a resultant rtentry and
1736 * give the caller a single reference.
1742 rnh->rnh_gen++; /* Routing table updated */
1747 error = rtrequest1_fib_change(rnh, info, ret_nrt, fibnum);
1765 rtrequest1_fib_change(struct rib_head *rnh, struct rt_addrinfo *info,
1766 struct rtentry **ret_nrt, u_int fibnum)
1768 struct rtentry *rt = NULL;
1772 struct if_mtuinfo ifmtu;
1774 RIB_WLOCK_ASSERT(rnh);
1776 rt = (struct rtentry *)rnh->rnh_lookup(info->rti_info[RTAX_DST],
1777 info->rti_info[RTAX_NETMASK], &rnh->head);
1784 * If we got multipath routes,
1785 * we require users to specify a matching RTAX_GATEWAY.
1787 if (rt_mpath_capable(rnh)) {
1788 rt = rt_mpath_matchgate(rt, info->rti_info[RTAX_GATEWAY]);
1796 rt_setmetrics(info, rt);
1799 * New gateway could require new ifaddr, ifp;
1800 * flags may also be different; ifp may be specified
1801 * by ll sockaddr when protocol address is ambiguous
1803 if (((rt->rt_flags & RTF_GATEWAY) &&
1804 info->rti_info[RTAX_GATEWAY] != NULL) ||
1805 info->rti_info[RTAX_IFP] != NULL ||
1806 (info->rti_info[RTAX_IFA] != NULL &&
1807 !sa_equal(info->rti_info[RTAX_IFA], rt->rt_ifa->ifa_addr))) {
1809 * XXX: Temporarily set RTF_RNH_LOCKED flag in the rti_flags
1810 * to avoid rlock in the ifa_ifwithroute().
1812 info->rti_flags |= RTF_RNH_LOCKED;
1813 error = rt_getifa_fib(info, fibnum);
1814 info->rti_flags &= ~RTF_RNH_LOCKED;
1815 if (info->rti_ifa != NULL)
1822 /* Check if outgoing interface has changed */
1823 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa &&
1824 rt->rt_ifa != NULL) {
1825 if (rt->rt_ifa->ifa_rtrequest != NULL)
1826 rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1827 ifa_free(rt->rt_ifa);
1830 /* Update gateway address */
1831 if (info->rti_info[RTAX_GATEWAY] != NULL) {
1832 error = rt_setgate(rt, rt_key(rt), info->rti_info[RTAX_GATEWAY]);
1836 rt->rt_flags &= ~RTF_GATEWAY;
1837 rt->rt_flags |= (RTF_GATEWAY & info->rti_flags);
1840 if (info->rti_ifa != NULL && info->rti_ifa != rt->rt_ifa) {
1841 ifa_ref(info->rti_ifa);
1842 rt->rt_ifa = info->rti_ifa;
1843 rt->rt_ifp = info->rti_ifp;
1845 /* Allow some flags to be toggled on change. */
1846 rt->rt_flags &= ~RTF_FMASK;
1847 rt->rt_flags |= info->rti_flags & RTF_FMASK;
1849 if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest != NULL)
1850 rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, info);
1852 /* Alter route MTU if necessary */
1853 if (rt->rt_ifp != NULL) {
1854 family = info->rti_info[RTAX_DST]->sa_family;
1855 mtu = if_getmtu_family(rt->rt_ifp, family);
1856 /* Set default MTU */
1857 if (rt->rt_mtu == 0)
1859 if (rt->rt_mtu != mtu) {
1860 /* Check if we really need to update */
1861 ifmtu.ifp = rt->rt_ifp;
1863 if_updatemtu_cb(rt->rt_nodes, &ifmtu);
1868 * This route change may have modified the route's gateway. In that
1869 * case, any inpcbs that have cached this route need to invalidate their
1880 if (free_ifa != 0) {
1881 ifa_free(info->rti_ifa);
1882 info->rti_ifa = NULL;
1888 rt_setmetrics(const struct rt_addrinfo *info, struct rtentry *rt)
1891 if (info->rti_mflags & RTV_MTU) {
1892 if (info->rti_rmx->rmx_mtu != 0) {
1895 * MTU was explicitly provided by user.
1898 rt->rt_flags |= RTF_FIXEDMTU;
1902 * User explicitly sets MTU to 0.
1903 * Assume rollback to default.
1905 rt->rt_flags &= ~RTF_FIXEDMTU;
1907 rt->rt_mtu = info->rti_rmx->rmx_mtu;
1909 if (info->rti_mflags & RTV_WEIGHT)
1910 rt->rt_weight = info->rti_rmx->rmx_weight;
1911 /* Kernel -> userland timebase conversion. */
1912 if (info->rti_mflags & RTV_EXPIRE)
1913 rt->rt_expire = info->rti_rmx->rmx_expire ?
1914 info->rti_rmx->rmx_expire - time_second + time_uptime : 0;
1918 rt_setgate(struct rtentry *rt, struct sockaddr *dst, struct sockaddr *gate)
1920 /* XXX dst may be overwritten, can we move this to below */
1921 int dlen = SA_SIZE(dst), glen = SA_SIZE(gate);
1924 * Prepare to store the gateway in rt->rt_gateway.
1925 * Both dst and gateway are stored one after the other in the same
1926 * malloc'd chunk. If we have room, we can reuse the old buffer,
1927 * rt_gateway already points to the right place.
1928 * Otherwise, malloc a new block and update the 'dst' address.
1930 if (rt->rt_gateway == NULL || glen > SA_SIZE(rt->rt_gateway)) {
1933 R_Malloc(new, caddr_t, dlen + glen);
1937 * XXX note, we copy from *dst and not *rt_key(rt) because
1938 * rt_setgate() can be called to initialize a newly
1939 * allocated route entry, in which case rt_key(rt) == NULL
1940 * (and also rt->rt_gateway == NULL).
1941 * Free()/free() handle a NULL argument just fine.
1943 bcopy(dst, new, dlen);
1944 R_Free(rt_key(rt)); /* free old block, if any */
1945 rt_key(rt) = (struct sockaddr *)new;
1946 rt->rt_gateway = (struct sockaddr *)(new + dlen);
1950 * Copy the new gateway value into the memory chunk.
1952 bcopy(gate, rt->rt_gateway, glen);
1958 rt_maskedcopy(struct sockaddr *src, struct sockaddr *dst, struct sockaddr *netmask)
1960 u_char *cp1 = (u_char *)src;
1961 u_char *cp2 = (u_char *)dst;
1962 u_char *cp3 = (u_char *)netmask;
1963 u_char *cplim = cp2 + *cp3;
1964 u_char *cplim2 = cp2 + *cp1;
1966 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
1971 *cp2++ = *cp1++ & *cp3++;
1973 bzero((caddr_t)cp2, (unsigned)(cplim2 - cp2));
1977 * Set up a routing table entry, normally
1980 #define _SOCKADDR_TMPSIZE 128 /* Not too big.. kernel stack size is limited */
1982 rtinit1(struct ifaddr *ifa, int cmd, int flags, int fibnum)
1985 struct sockaddr *dst;
1986 struct sockaddr *netmask;
1987 struct rtentry *rt = NULL;
1988 struct rt_addrinfo info;
1990 int startfib, endfib;
1991 char tempbuf[_SOCKADDR_TMPSIZE];
1994 struct sockaddr_dl *sdl = NULL;
1995 struct rib_head *rnh;
1997 if (flags & RTF_HOST) {
1998 dst = ifa->ifa_dstaddr;
2001 dst = ifa->ifa_addr;
2002 netmask = ifa->ifa_netmask;
2004 if (dst->sa_len == 0)
2006 switch (dst->sa_family) {
2009 /* We support multiple FIBs. */
2012 fibnum = RT_DEFAULT_FIB;
2015 if (fibnum == RT_ALL_FIBS) {
2016 if (V_rt_add_addr_allfibs == 0 && cmd == (int)RTM_ADD)
2017 startfib = endfib = ifa->ifa_ifp->if_fib;
2020 endfib = rt_numfibs - 1;
2023 KASSERT((fibnum < rt_numfibs), ("rtinit1: bad fibnum"));
2029 * If it's a delete, check that if it exists,
2030 * it's on the correct interface or we might scrub
2031 * a route to another ifa which would
2032 * be confusing at best and possibly worse.
2034 if (cmd == RTM_DELETE) {
2036 * It's a delete, so it should already exist..
2037 * If it's a net, mask off the host bits
2038 * (Assuming we have a mask)
2039 * XXX this is kinda inet specific..
2041 if (netmask != NULL) {
2042 rt_maskedcopy(dst, (struct sockaddr *)tempbuf, netmask);
2043 dst = (struct sockaddr *)tempbuf;
2045 } else if (cmd == RTM_ADD) {
2046 sdl = (struct sockaddr_dl *)tempbuf;
2047 bzero(sdl, sizeof(struct sockaddr_dl));
2048 sdl->sdl_family = AF_LINK;
2049 sdl->sdl_len = sizeof(struct sockaddr_dl);
2050 sdl->sdl_type = ifa->ifa_ifp->if_type;
2051 sdl->sdl_index = ifa->ifa_ifp->if_index;
2054 * Now go through all the requested tables (fibs) and do the
2055 * requested action. Realistically, this will either be fib 0
2056 * for protocols that don't do multiple tables or all the
2057 * tables for those that do.
2059 for ( fibnum = startfib; fibnum <= endfib; fibnum++) {
2060 if (cmd == RTM_DELETE) {
2061 struct radix_node *rn;
2063 * Look up an rtentry that is in the routing tree and
2064 * contains the correct info.
2066 rnh = rt_tables_get_rnh(fibnum, dst->sa_family);
2068 /* this table doesn't exist but others might */
2071 rn = rnh->rnh_lookup(dst, netmask, &rnh->head);
2073 if (rt_mpath_capable(rnh)) {
2080 * for interface route the
2081 * rt->rt_gateway is sockaddr_intf
2082 * for cloning ARP entries, so
2083 * rt_mpath_matchgate must use the
2086 rt = rt_mpath_matchgate(rt,
2093 error = (rn == NULL ||
2094 (rn->rn_flags & RNF_ROOT) ||
2095 RNTORT(rn)->rt_ifa != ifa);
2098 /* this is only an error if bad on ALL tables */
2103 * Do the actual request
2105 bzero((caddr_t)&info, sizeof(info));
2108 info.rti_flags = flags |
2109 (ifa->ifa_flags & ~IFA_RTSELF) | RTF_PINNED;
2110 info.rti_info[RTAX_DST] = dst;
2112 * doing this for compatibility reasons
2115 info.rti_info[RTAX_GATEWAY] = (struct sockaddr *)sdl;
2117 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
2118 info.rti_info[RTAX_NETMASK] = netmask;
2119 error = rtrequest1_fib(cmd, &info, &rt, fibnum);
2121 if (error == 0 && rt != NULL) {
2123 * notify any listening routing agents of the change
2128 * in case address alias finds the first address
2129 * e.g. ifconfig bge0 192.0.2.246/24
2130 * e.g. ifconfig bge0 192.0.2.247/24
2131 * the address set in the route is 192.0.2.246
2132 * so we need to replace it with 192.0.2.247
2134 if (memcmp(rt->rt_ifa->ifa_addr,
2135 ifa->ifa_addr, ifa->ifa_addr->sa_len)) {
2136 ifa_free(rt->rt_ifa);
2138 rt->rt_ifp = ifa->ifa_ifp;
2144 rt_newaddrmsg_fib(cmd, ifa, error, rt, fibnum);
2147 if (cmd == RTM_DELETE) {
2149 * If we are deleting, and we found an entry,
2150 * then it's been removed from the tree..
2151 * now throw it away.
2155 if (cmd == RTM_ADD) {
2157 * We just wanted to add it..
2158 * we don't actually need a reference.
2169 if (cmd == RTM_DELETE) {
2173 /* we only give an error if it wasn't in any table */
2174 error = ((flags & RTF_HOST) ?
2175 EHOSTUNREACH : ENETUNREACH);
2179 /* return an error if any of them failed */
2187 * Set up a routing table entry, normally
2191 rtinit(struct ifaddr *ifa, int cmd, int flags)
2193 struct sockaddr *dst;
2194 int fib = RT_DEFAULT_FIB;
2196 if (flags & RTF_HOST) {
2197 dst = ifa->ifa_dstaddr;
2199 dst = ifa->ifa_addr;
2202 switch (dst->sa_family) {
2205 /* We do support multiple FIBs. */
2209 return (rtinit1(ifa, cmd, flags, fib));
2213 * Announce interface address arrival/withdraw
2214 * Returns 0 on success.
2217 rt_addrmsg(int cmd, struct ifaddr *ifa, int fibnum)
2220 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2221 ("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 EVENTHANDLER_DIRECT_INVOKE(rt_addrmsg, ifa, cmd);
2226 return (rtsock_addrmsg(cmd, ifa, fibnum));
2230 * Announce route addition/removal.
2231 * Users of this function MUST validate input data BEFORE calling.
2232 * However we have to be able to handle invalid data:
2233 * if some userland app sends us "invalid" route message (invalid mask,
2234 * no dst, wrong address families, etc...) we need to pass it back
2235 * to app (and any other rtsock consumers) with rtm_errno field set to
2237 * Returns 0 on success.
2240 rt_routemsg(int cmd, struct ifnet *ifp, int error, struct rtentry *rt,
2244 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2245 ("unexpected cmd %d", cmd));
2247 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2248 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2250 KASSERT(rt_key(rt) != NULL, (":%s: rt_key must be supplied", __func__));
2252 return (rtsock_routemsg(cmd, ifp, error, rt, fibnum));
2256 rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
2259 rt_newaddrmsg_fib(cmd, ifa, error, rt, RT_ALL_FIBS);
2263 * This is called to generate messages from the routing socket
2264 * indicating a network interface has had addresses associated with it.
2267 rt_newaddrmsg_fib(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt,
2271 KASSERT(cmd == RTM_ADD || cmd == RTM_DELETE,
2272 ("unexpected cmd %u", cmd));
2273 KASSERT(fibnum == RT_ALL_FIBS || (fibnum >= 0 && fibnum < rt_numfibs),
2274 ("%s: fib out of range 0 <=%d<%d", __func__, fibnum, rt_numfibs));
2276 if (cmd == RTM_ADD) {
2277 rt_addrmsg(cmd, ifa, fibnum);
2279 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2282 rt_routemsg(cmd, ifa->ifa_ifp, error, rt, fibnum);
2283 rt_addrmsg(cmd, ifa, fibnum);