2 * Copyright (c) 2004, 2005 The DragonFly Project. All rights reserved.
4 * This code is derived from software contributed to The DragonFly Project
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of The DragonFly Project nor the names of its
16 * contributors may be used to endorse or promote products derived
17 * from this software without specific, prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
22 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
23 * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
24 * INCIDENTAL, SPECIAL, EXEMPLARY OR CONSEQUENTIAL DAMAGES (INCLUDING,
25 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
26 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
27 * AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
28 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
29 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * Copyright (c) 2004, 2005 Jeffrey M. Hsu. All rights reserved.
36 * License terms: all terms for the DragonFly license above plus the following:
38 * 4. All advertising materials mentioning features or use of this software
39 * must display the following acknowledgement:
41 * This product includes software developed by Jeffrey M. Hsu
42 * for the DragonFly Project.
44 * This requirement may be waived with permission from Jeffrey Hsu.
45 * Permission will be granted to any DragonFly user for free.
46 * This requirement will sunset and may be removed on Jan 31, 2006,
47 * after which the standard DragonFly license (as shown above) will
52 * Copyright (c) 1980, 1986, 1991, 1993
53 * The Regents of the University of California. All rights reserved.
55 * Redistribution and use in source and binary forms, with or without
56 * modification, are permitted provided that the following conditions
58 * 1. Redistributions of source code must retain the above copyright
59 * notice, this list of conditions and the following disclaimer.
60 * 2. Redistributions in binary form must reproduce the above copyright
61 * notice, this list of conditions and the following disclaimer in the
62 * documentation and/or other materials provided with the distribution.
63 * 3. All advertising materials mentioning features or use of this software
64 * must display the following acknowledgement:
65 * This product includes software developed by the University of
66 * California, Berkeley and its contributors.
67 * 4. Neither the name of the University nor the names of its contributors
68 * may be used to endorse or promote products derived from this software
69 * without specific prior written permission.
71 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
72 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
73 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
74 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
75 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
76 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
77 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
78 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
79 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
80 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
83 * @(#)route.c 8.3 (Berkeley) 1/9/95
84 * $FreeBSD: src/sys/net/route.c,v 1.59.2.10 2003/01/17 08:04:00 ru Exp $
85 * $DragonFly: src/sys/net/route.c,v 1.14 2005/01/26 23:09:57 hsu Exp $
90 #include <sys/param.h>
91 #include <sys/systm.h>
92 #include <sys/malloc.h>
94 #include <sys/socket.h>
95 #include <sys/domain.h>
96 #include <sys/kernel.h>
99 #include <net/route.h>
101 #include <netinet/in.h>
102 #include <net/ip_mroute/ip_mroute.h>
104 static struct rtstat rtstat;
105 struct radix_node_head *rt_tables[AF_MAX+1];
107 static void rt_maskedcopy (struct sockaddr *, struct sockaddr *,
109 static void rtable_init (void **);
112 rtable_init(void **table)
116 for (dom = domains; dom; dom = dom->dom_next)
117 if (dom->dom_rtattach)
118 dom->dom_rtattach(&table[dom->dom_family],
125 rn_init(); /* initialize all zeroes, all ones, mask table */
126 rtable_init((void **)rt_tables);
130 * Packet routing routines.
134 * Look up and fill in the "ro_rt" rtentry field in a route structure given
135 * an address in the "ro_dst" field. Always send a report on a miss and
136 * always clone routes.
139 rtalloc(struct route *ro)
141 rtalloc_ign(ro, 0UL);
145 * Look up and fill in the "ro_rt" rtentry field in a route structure given
146 * an address in the "ro_dst" field. Always send a report on a miss and
147 * optionally clone routes when RTF_CLONING or RTF_PRCLONING are not being
151 rtalloc_ign(struct route *ro, u_long ignoreflags)
153 if (ro->ro_rt != NULL) {
154 if (ro->ro_rt->rt_ifp != NULL && ro->ro_rt->rt_flags & RTF_UP)
159 ro->ro_rt = _rtlookup(&ro->ro_dst, RTL_REPORTMSG, ignoreflags);
163 * Look up the route that matches the given "dst" address.
165 * Route lookup can have the side-effect of creating and returning
166 * a cloned route instead if "dst" matches a cloning route and the
167 * RTF_CLONING and RTF_PRCLONING flags are not being ignored.
169 * Any route returned has its reference count incremented.
172 _rtlookup(struct sockaddr *dst, boolean_t report, u_long ignore)
174 struct radix_node_head *rnh = rt_tables[dst->sa_family];
181 * Look up route in the radix tree.
183 rt = (struct rtentry *) rnh->rnh_matchaddr((char *)dst, rnh);
188 * Handle cloning routes.
190 if ((rt->rt_flags & ~ignore & (RTF_CLONING | RTF_PRCLONING)) != 0) {
191 struct rtentry *clonedroute;
194 clonedroute = rt; /* copy in/copy out parameter */
195 error = rtrequest(RTM_RESOLVE, dst, NULL, NULL, 0,
196 &clonedroute); /* clone the route */
197 if (error != 0) { /* cloning failed */
199 rt_dstmsg(RTM_MISS, dst, error);
201 return (rt); /* return the uncloned route */
204 if (clonedroute->rt_flags & RTF_XRESOLVE)
205 rt_dstmsg(RTM_RESOLVE, dst, 0);
207 rt_rtmsg(RTM_ADD, clonedroute,
208 clonedroute->rt_ifp, 0);
210 return (clonedroute); /* return cloned route */
214 * Increment the reference count of the matched route and return.
220 rtstat.rts_unreach++;
222 rt_dstmsg(RTM_MISS, dst, 0);
227 rtfree(struct rtentry *rt)
229 struct radix_node_head *rnh = rt_tables[rt_key(rt)->sa_family];
232 if (rnh->rnh_close && rt->rt_refcnt == 0)
233 rnh->rnh_close((struct radix_node *)rt, rnh);
234 if (rt->rt_refcnt <= 0 && !(rt->rt_flags & RTF_UP)) {
235 KASSERT(!(rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT)),
236 ("rtfree: rn_flags 0x%x ", rt->rt_nodes->rn_flags));
237 KASSERT(rt->rt_refcnt == 0,
238 ("rtfree: rt_refcnt %ld", rt->rt_refcnt));
239 if (rt->rt_ifa != NULL)
241 if (rt->rt_parent != NULL)
242 RTFREE(rt->rt_parent);
243 Free(rt_key(rt)); /* Also frees gateway. See rt_setgate(). */
249 * Force a routing table entry to the specified
250 * destination to go through the given gateway.
251 * Normally called as a result of a routing redirect
252 * message from the network layer.
254 * N.B.: must be called at splnet
258 struct sockaddr *dst,
259 struct sockaddr *gateway,
260 struct sockaddr *netmask,
262 struct sockaddr *src,
263 struct rtentry **rtp)
266 struct rt_addrinfo info;
271 /* verify the gateway is directly reachable */
272 if ((ifa = ifa_ifwithnet(gateway)) == NULL) {
278 * If the redirect isn't from our current router for this dst,
279 * it's either old or wrong. If it redirects us to ourselves,
280 * we have a routing loop, perhaps as a result of an interface
281 * going down recently.
283 if (!(flags & RTF_DONE) &&
284 (rt = rtpurelookup(dst)) != NULL &&
285 (!sa_equal(src, rt->rt_gateway) || rt->rt_ifa != ifa)) {
288 } else if (ifa_ifwithaddr(gateway)) {
289 error = EHOSTUNREACH;
294 * Create a new entry if we just got back a wildcard entry
295 * or the the lookup failed. This is necessary for hosts
296 * which use routing redirects generated by smart gateways
297 * to dynamically build the routing tables.
299 if (rt == NULL || (rt_mask(rt) != NULL && rt_mask(rt)->sa_len < 2))
303 * Don't listen to the redirect if it's for a route to an interface.
305 if (rt->rt_flags & RTF_GATEWAY) {
306 if ((!(rt->rt_flags & RTF_HOST)) && (flags & RTF_HOST)) {
308 * Changing from route to net => route to host.
309 * Create new route, rather than smashing route to net.
314 flags |= RTF_GATEWAY | RTF_DYNAMIC;
315 bzero(&info, sizeof info);
316 info.rti_info[RTAX_DST] = dst;
317 info.rti_info[RTAX_GATEWAY] = gateway;
318 info.rti_info[RTAX_NETMASK] = netmask;
320 info.rti_flags = flags;
322 error = rtrequest1(RTM_ADD, &info, &rt);
324 flags = rt->rt_flags;
325 stat = &rtstat.rts_dynamic;
328 * Smash the current notion of the gateway to
329 * this destination. Should check about netmask!!!
331 rt->rt_flags |= RTF_MODIFIED;
332 flags |= RTF_MODIFIED;
333 stat = &rtstat.rts_newgateway;
334 /* Add the key and gateway (in one malloc'ed chunk). */
335 rt_setgate(rt, rt_key(rt), gateway);
339 error = EHOSTUNREACH;
344 if (rtp != NULL && error == 0)
352 rtstat.rts_badredirect++;
353 else if (stat != NULL)
356 bzero(&info, sizeof info);
357 info.rti_info[RTAX_DST] = dst;
358 info.rti_info[RTAX_GATEWAY] = gateway;
359 info.rti_info[RTAX_NETMASK] = netmask;
360 info.rti_info[RTAX_AUTHOR] = src;
361 rt_missmsg(RTM_REDIRECT, &info, flags, error);
365 * Routing table ioctl interface.
368 rtioctl(u_long req, caddr_t data, struct thread *td)
371 /* Multicast goop, grrr... */
372 return mrt_ioctl ? mrt_ioctl(req, data) : EOPNOTSUPP;
379 ifa_ifwithroute(int flags, struct sockaddr *dst, struct sockaddr *gateway)
383 if (!(flags & RTF_GATEWAY)) {
385 * If we are adding a route to an interface,
386 * and the interface is a point-to-point link,
387 * we should search for the destination
388 * as our clue to the interface. Otherwise
389 * we can use the local address.
392 if (flags & RTF_HOST) {
393 ifa = ifa_ifwithdstaddr(dst);
396 ifa = ifa_ifwithaddr(gateway);
399 * If we are adding a route to a remote net
400 * or host, the gateway may still be on the
401 * other end of a pt to pt link.
403 ifa = ifa_ifwithdstaddr(gateway);
406 ifa = ifa_ifwithnet(gateway);
410 rt = rtpurelookup(gateway);
414 if ((ifa = rt->rt_ifa) == NULL)
417 if (ifa->ifa_addr->sa_family != dst->sa_family) {
418 struct ifaddr *oifa = ifa;
420 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
427 static int rt_fixdelete (struct radix_node *, void *);
428 static int rt_fixchange (struct radix_node *, void *);
432 struct radix_node_head *rnh;
436 * Set rtinfo->rti_ifa and rtinfo->rti_ifp.
439 rt_getifa(struct rt_addrinfo *rtinfo)
441 struct sockaddr *gateway = rtinfo->rti_info[RTAX_GATEWAY];
442 struct sockaddr *dst = rtinfo->rti_info[RTAX_DST];
443 struct sockaddr *ifaaddr = rtinfo->rti_info[RTAX_IFA];
444 int flags = rtinfo->rti_flags;
447 * ifp may be specified by sockaddr_dl
448 * when protocol address is ambiguous.
450 if (rtinfo->rti_ifp == NULL) {
451 struct sockaddr *ifpaddr;
453 ifpaddr = rtinfo->rti_info[RTAX_IFP];
454 if (ifpaddr != NULL && ifpaddr->sa_family == AF_LINK) {
457 ifa = ifa_ifwithnet(ifpaddr);
459 rtinfo->rti_ifp = ifa->ifa_ifp;
463 if (rtinfo->rti_ifa == NULL && ifaaddr != NULL)
464 rtinfo->rti_ifa = ifa_ifwithaddr(ifaaddr);
465 if (rtinfo->rti_ifa == NULL) {
468 sa = ifaaddr != NULL ? ifaaddr :
469 (gateway != NULL ? gateway : dst);
470 if (sa != NULL && rtinfo->rti_ifp != NULL)
471 rtinfo->rti_ifa = ifaof_ifpforaddr(sa, rtinfo->rti_ifp);
472 else if (dst != NULL && gateway != NULL)
473 rtinfo->rti_ifa = ifa_ifwithroute(flags, dst, gateway);
475 rtinfo->rti_ifa = ifa_ifwithroute(flags, sa, sa);
477 if (rtinfo->rti_ifa == NULL)
478 return (ENETUNREACH);
480 if (rtinfo->rti_ifp == NULL)
481 rtinfo->rti_ifp = rtinfo->rti_ifa->ifa_ifp;
486 * Do appropriate manipulations of a routing tree given
487 * all the bits of info needed
492 struct sockaddr *dst,
493 struct sockaddr *gateway,
494 struct sockaddr *netmask,
496 struct rtentry **ret_nrt)
498 struct rt_addrinfo info;
500 bzero(&info, sizeof info);
501 info.rti_flags = flags;
502 info.rti_info[RTAX_DST] = dst;
503 info.rti_info[RTAX_GATEWAY] = gateway;
504 info.rti_info[RTAX_NETMASK] = netmask;
505 return rtrequest1(req, &info, ret_nrt);
509 rtrequest1(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt)
511 struct sockaddr *dst = info->rti_info[RTAX_DST];
513 struct radix_node *rn;
514 struct radix_node_head *rnh;
516 struct sockaddr *ndst;
520 #define gotoerr(x) { error = x ; goto bad; }
524 * Find the correct routing tree to use for this Address Family
526 if ((rnh = rt_tables[dst->sa_family]) == NULL)
527 gotoerr(EAFNOSUPPORT);
530 * If we are adding a host route then we don't want to put
531 * a netmask in the tree, nor do we want to clone it.
533 if (info->rti_flags & RTF_HOST) {
534 info->rti_info[RTAX_NETMASK] = NULL;
535 info->rti_flags &= ~(RTF_CLONING | RTF_PRCLONING);
540 /* Remove the item from the tree. */
541 rn = rnh->rnh_deladdr((char *)info->rti_info[RTAX_DST],
542 (char *)info->rti_info[RTAX_NETMASK],
546 KASSERT(!(rn->rn_flags & (RNF_ACTIVE | RNF_ROOT)),
547 ("rnh_deladdr returned flags 0x%x", rn->rn_flags));
548 rt = (struct rtentry *)rn;
550 /* Free any routes cloned from this one. */
551 if ((rt->rt_flags & (RTF_CLONING | RTF_PRCLONING)) &&
552 rt_mask(rt) != NULL) {
553 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
558 if (rt->rt_gwroute != NULL) {
559 RTFREE(rt->rt_gwroute);
560 rt->rt_gwroute = NULL;
564 * NB: RTF_UP must be set during the search above,
565 * because we might delete the last ref, causing
566 * rt to get freed prematurely.
568 rt->rt_flags &= ~RTF_UP;
570 /* Give the protocol a chance to keep things in sync. */
571 if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest)
572 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
575 * If the caller wants it, then it can have it,
576 * but it's up to it to free the rtentry as we won't be
579 if (ret_nrt != NULL) {
581 } else if (rt->rt_refcnt <= 0) {
582 rt->rt_refcnt++; /* refcnt > 0 required for rtfree() */
588 if (ret_nrt == NULL || (rt = *ret_nrt) == NULL)
592 rt->rt_flags & ~(RTF_CLONING | RTF_PRCLONING | RTF_STATIC);
593 info->rti_flags |= RTF_WASCLONED;
594 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
595 if ((info->rti_info[RTAX_NETMASK] = rt->rt_genmask) == NULL)
596 info->rti_flags |= RTF_HOST;
600 KASSERT(!(info->rti_flags & RTF_GATEWAY) ||
601 info->rti_info[RTAX_GATEWAY] != NULL,
602 ("rtrequest: GATEWAY but no gateway"));
604 if (info->rti_ifa == NULL && (error = rt_getifa(info)))
608 R_Malloc(rt, struct rtentry *, sizeof *rt);
611 bzero(rt, sizeof *rt);
612 rt->rt_flags = RTF_UP | info->rti_flags;
613 error = rt_setgate(rt, dst, info->rti_info[RTAX_GATEWAY]);
620 if (info->rti_info[RTAX_NETMASK] != NULL)
621 rt_maskedcopy(dst, ndst, info->rti_info[RTAX_NETMASK]);
623 bcopy(dst, ndst, dst->sa_len);
626 * Note that we now have a reference to the ifa.
627 * This moved from below so that rnh->rnh_addaddr() can
628 * examine the ifa and ifa->ifa_ifp if it so desires.
632 rt->rt_ifp = ifa->ifa_ifp;
633 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
635 rn = rnh->rnh_addaddr((char *)ndst,
636 (char *)info->rti_info[RTAX_NETMASK],
639 struct rtentry *oldrt;
642 * We already have one of these in the tree.
643 * We do a special hack: if the old route was
644 * cloned, then we blow it away and try
645 * re-inserting the new one.
647 oldrt = rtpurelookup(ndst);
650 if (oldrt->rt_flags & RTF_WASCLONED) {
651 rtrequest(RTM_DELETE, rt_key(oldrt),
654 oldrt->rt_flags, NULL);
655 rn = rnh->rnh_addaddr((char *)ndst,
657 info->rti_info[RTAX_NETMASK],
664 * If it still failed to go into the tree,
665 * then un-make it (this should be a function).
668 if (rt->rt_gwroute != NULL)
669 rtfree(rt->rt_gwroute);
677 * If we got here from RESOLVE, then we are cloning
678 * so clone the rest, and note that we
679 * are a clone (and increment the parent's references)
681 if (req == RTM_RESOLVE) {
682 rt->rt_rmx = (*ret_nrt)->rt_rmx; /* copy metrics */
683 rt->rt_rmx.rmx_pksent = 0; /* reset packet counter */
684 if ((*ret_nrt)->rt_flags &
685 (RTF_CLONING | RTF_PRCLONING)) {
686 rt->rt_parent = *ret_nrt;
687 (*ret_nrt)->rt_refcnt++;
692 * if this protocol has something to add to this then
693 * allow it to do that as well.
695 if (ifa->ifa_rtrequest != NULL)
696 ifa->ifa_rtrequest(req, rt, info);
699 * We repeat the same procedure from rt_setgate() here because
700 * it doesn't fire when we call it there because the node
701 * hasn't been added to the tree yet.
703 if (req == RTM_ADD && !(rt->rt_flags & RTF_HOST) &&
704 rt_mask(rt) != NULL) {
705 struct rtfc_arg arg = { rt, rnh };
707 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
713 * Return the resulting rtentry,
714 * increasing the number of references by one.
716 if (ret_nrt != NULL) {
730 * Called from rtrequest(RTM_DELETE, ...) to fix up the route's ``family''
731 * (i.e., the routes related to it by the operation of cloning). This
732 * routine is iterated over all potential former-child-routes by way of
733 * rnh->rnh_walktree_from() above, and those that actually are children of
734 * the late parent (passed in as VP here) are themselves deleted.
737 rt_fixdelete(struct radix_node *rn, void *vp)
739 struct rtentry *rt = (struct rtentry *)rn;
740 struct rtentry *rt0 = vp;
742 if (rt->rt_parent == rt0 &&
743 !(rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
744 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
751 * This routine is called from rt_setgate() to do the analogous thing for
752 * adds and changes. There is the added complication in this case of a
753 * middle insert; i.e., insertion of a new network route between an older
754 * network route and (cloned) host routes. For this reason, a simple check
755 * of rt->rt_parent is insufficient; each candidate route must be tested
756 * against the (mask, value) of the new route (passed as before in vp)
757 * to see if the new route matches it.
759 * XXX - it may be possible to do fixdelete() for changes and reserve this
760 * routine just for adds. I'm not sure why I thought it was necessary to do
764 static int rtfcdebug = 0;
768 rt_fixchange(struct radix_node *rn, void *vp)
770 struct rtentry *rt = (struct rtentry *)rn;
771 struct rtfc_arg *ap = vp;
772 struct rtentry *rt0 = ap->rt0;
773 struct radix_node_head *rnh = ap->rnh;
774 u_char *xk1, *xm1, *xk2, *xmp;
779 printf("rt_fixchange: rt %p, rt0 %p\n", rt, rt0);
782 if (rt->rt_parent == NULL ||
783 (rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
785 if (rtfcdebug) printf("no parent, pinned or cloning\n");
790 if (rt->rt_parent == rt0) {
792 if (rtfcdebug) printf("parent match\n");
794 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
799 * There probably is a function somewhere which does this...
800 * if not, there should be.
802 len = imin(rt_key(rt0)->sa_len, rt_key(rt)->sa_len);
804 xk1 = (u_char *)rt_key(rt0);
805 xm1 = (u_char *)rt_mask(rt0);
806 xk2 = (u_char *)rt_key(rt);
808 /* avoid applying a less specific route */
809 xmp = (u_char *)rt_mask(rt->rt_parent);
810 mlen = rt_key(rt->rt_parent)->sa_len;
811 if (mlen > rt_key(rt0)->sa_len) {
814 printf("rt_fixchange: inserting a less "
819 for (i = rnh->rnh_treetop->rn_offset; i < mlen; i++) {
820 if ((xmp[i] & ~(xmp[i] ^ xm1[i])) != xmp[i]) {
823 printf("rt_fixchange: inserting a less "
830 for (i = rnh->rnh_treetop->rn_offset; i < len; i++) {
831 if ((xk2[i] & xm1[i]) != xk1[i]) {
833 if (rtfcdebug) printf("no match\n");
840 * OK, this node is a clone, and matches the node currently being
841 * changed/added under the node's mask. So, get rid of it.
844 if (rtfcdebug) printf("deleting\n");
846 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
850 #define ROUNDUP(a) (a>0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
853 rt_setgate(struct rtentry *rt0, struct sockaddr *dst, struct sockaddr *gate)
855 char *space, *oldspace;
856 int dlen = ROUNDUP(dst->sa_len), glen = ROUNDUP(gate->sa_len);
857 struct rtentry *rt = rt0;
858 struct radix_node_head *rnh = rt_tables[dst->sa_family];
861 * A host route with the destination equal to the gateway
862 * will interfere with keeping LLINFO in the routing
863 * table, so disallow it.
865 if (((rt0->rt_flags & (RTF_HOST | RTF_GATEWAY | RTF_LLINFO)) ==
866 (RTF_HOST | RTF_GATEWAY)) &&
867 dst->sa_len == gate->sa_len &&
868 sa_equal(dst, gate)) {
870 * The route might already exist if this is an RTM_CHANGE
871 * or a routing redirect, so try to delete it.
873 if (rt_key(rt0) != NULL)
874 rtrequest(RTM_DELETE, rt_key(rt0), rt0->rt_gateway,
875 rt_mask(rt0), rt0->rt_flags, NULL);
876 return EADDRNOTAVAIL;
880 * Both dst and gateway are stored in the same malloc'ed chunk
881 * (If I ever get my hands on....)
882 * if we need to malloc a new chunk, then keep the old one around
883 * till we don't need it any more.
885 if (rt->rt_gateway == NULL || glen > ROUNDUP(rt->rt_gateway->sa_len)) {
886 oldspace = (char *)rt_key(rt);
887 R_Malloc(space, char *, dlen + glen);
890 rt->rt_nodes->rn_key = space;
892 space = (char *)rt_key(rt); /* Just use the old space. */
896 /* Set the gateway value. */
897 rt->rt_gateway = (struct sockaddr *)(space + dlen);
898 bcopy(gate, rt->rt_gateway, glen);
900 if (oldspace != NULL) {
902 * If we allocated a new chunk, preserve the original dst.
903 * This way, rt_setgate() really just sets the gate
904 * and leaves the dst field alone.
906 bcopy(dst, space, dlen);
911 * If there is already a gwroute, it's now almost definitely wrong
914 if (rt->rt_gwroute != NULL) {
915 RTFREE(rt->rt_gwroute);
916 rt->rt_gwroute = NULL;
918 if (rt->rt_flags & RTF_GATEWAY) {
920 * Cloning loop avoidance: In the presence of
921 * protocol-cloning and bad configuration, it is
922 * possible to get stuck in bottomless mutual recursion
923 * (rtrequest rt_setgate rtlookup). We avoid this
924 * by not allowing protocol-cloning to operate for
925 * gateways (which is probably the correct choice
926 * anyway), and avoid the resulting reference loops
927 * by disallowing any route to run through itself as
928 * a gateway. This is obviously mandatory when we
929 * get rt->rt_output().
931 * This breaks TTCP for hosts outside the gateway! XXX JH
933 rt->rt_gwroute = _rtlookup(gate, RTL_REPORTMSG, RTF_PRCLONING);
934 if (rt->rt_gwroute == rt) {
935 rt->rt_gwroute = NULL;
937 return EDQUOT; /* failure */
942 * This isn't going to do anything useful for host routes, so
943 * don't bother. Also make sure we have a reasonable mask
944 * (we don't yet have one during adds).
946 if (!(rt->rt_flags & RTF_HOST) && rt_mask(rt) != NULL) {
947 struct rtfc_arg arg = { rt, rnh };
949 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
959 struct sockaddr *src,
960 struct sockaddr *dst,
961 struct sockaddr *netmask)
963 u_char *cp1 = (u_char *)src;
964 u_char *cp2 = (u_char *)dst;
965 u_char *cp3 = (u_char *)netmask;
966 u_char *cplim = cp2 + *cp3;
967 u_char *cplim2 = cp2 + *cp1;
969 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
974 *cp2++ = *cp1++ & *cp3++;
976 bzero(cp2, cplim2 - cp2);
980 rt_llroute(struct sockaddr *dst, struct rtentry *rt0, struct rtentry **drt)
982 struct rtentry *up_rt, *rt;
984 if (!(rt0->rt_flags & RTF_UP)) {
985 up_rt = rtlookup(dst);
987 return (EHOSTUNREACH);
991 if (up_rt->rt_flags & RTF_GATEWAY) {
992 if (up_rt->rt_gwroute == NULL) {
993 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
994 if (up_rt->rt_gwroute == NULL)
995 return (EHOSTUNREACH);
996 } else if (!(up_rt->rt_gwroute->rt_flags & RTF_UP)) {
997 rtfree(up_rt->rt_gwroute);
998 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
999 if (up_rt->rt_gwroute == NULL)
1000 return (EHOSTUNREACH);
1002 rt = up_rt->rt_gwroute;
1005 if (rt->rt_flags & RTF_REJECT &&
1006 (rt->rt_rmx.rmx_expire == 0 || /* rt doesn't expire */
1007 time_second < rt->rt_rmx.rmx_expire)) /* rt not expired */
1008 return (rt->rt_flags & RTF_HOST ? EHOSTDOWN : EHOSTUNREACH);
1014 * Set up a routing table entry, normally
1018 rtinit(struct ifaddr *ifa, int cmd, int flags)
1020 struct sockaddr *dst, *deldst, *netmask;
1022 struct rtentry *nrt = NULL;
1023 struct mbuf *m = NULL;
1024 struct radix_node_head *rnh;
1025 struct radix_node *rn;
1026 struct rt_addrinfo info;
1029 if (flags & RTF_HOST) {
1030 dst = ifa->ifa_dstaddr;
1033 dst = ifa->ifa_addr;
1034 netmask = ifa->ifa_netmask;
1037 * If it's a delete, check that if it exists, it's on the correct
1038 * interface or we might scrub a route to another ifa which would
1039 * be confusing at best and possibly worse.
1041 if (cmd == RTM_DELETE) {
1043 * It's a delete, so it should already exist..
1044 * If it's a net, mask off the host bits
1045 * (Assuming we have a mask)
1047 if (netmask != NULL) {
1048 m = m_get(MB_DONTWAIT, MT_SONAME);
1051 deldst = mtod(m, struct sockaddr *);
1052 rt_maskedcopy(dst, deldst, netmask);
1056 * Look up an rtentry that is in the routing tree and
1057 * contains the correct info.
1059 if ((rnh = rt_tables[dst->sa_family]) == NULL ||
1060 (rn = rnh->rnh_lookup((char *)dst,
1061 (char *)netmask, rnh)) == NULL ||
1062 ((struct rtentry *)rn)->rt_ifa != ifa ||
1063 !sa_equal((struct sockaddr *)rn->rn_key, dst)) {
1066 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1072 * One would think that as we are deleting, and we know
1073 * it doesn't exist, we could just return at this point
1074 * with an "ELSE" clause, but apparently not..
1076 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1081 * Do the actual request
1083 bzero(&info, sizeof info);
1085 info.rti_flags = flags | ifa->ifa_flags;
1086 info.rti_info[RTAX_DST] = dst;
1087 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1088 info.rti_info[RTAX_NETMASK] = netmask;
1089 error = rtrequest1(cmd, &info, &nrt);
1090 if (error == 0 && (rt = nrt) != NULL) {
1092 * notify any listening routing agents of the change
1094 rt_newaddrmsg(cmd, ifa, error, rt);
1095 if (cmd == RTM_DELETE) {
1097 * If we are deleting, and we found an entry, then
1098 * it's been removed from the tree.. now throw it away.
1100 if (rt->rt_refcnt <= 0) {
1101 rt->rt_refcnt++; /* make a 1->0 transition */
1104 } else if (cmd == RTM_ADD) {
1106 * We just wanted to add it.. we don't actually
1117 /* This must be before ip6_init2(), which is now SI_ORDER_MIDDLE */
1118 SYSINIT(route, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, 0);