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.13 2005/01/06 17:59:32 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];
175 struct radix_node *rn;
182 * Look up route in the radix tree.
184 rn = rnh->rnh_matchaddr((char *)dst, rnh);
188 rt = (struct rtentry *)rn;
191 * Handle cloning routes.
193 if ((rt->rt_flags & ~ignore & (RTF_CLONING | RTF_PRCLONING)) != 0) {
194 struct rtentry *clonedroute;
197 clonedroute = rt; /* copy in/copy out parameter */
198 error = rtrequest(RTM_RESOLVE, dst, NULL, NULL, 0,
199 &clonedroute); /* clone the route */
200 if (error != 0) { /* cloning failed */
202 rt_dstmsg(RTM_MISS, dst, error);
204 return (rt); /* return the uncloned route */
207 if (clonedroute->rt_flags & RTF_XRESOLVE)
208 rt_dstmsg(RTM_RESOLVE, dst, 0);
210 rt_rtmsg(RTM_ADD, clonedroute,
211 clonedroute->rt_ifp, 0);
213 return (clonedroute); /* return cloned route */
217 * Increment the reference count of the matched route and return.
223 rtstat.rts_unreach++;
225 rt_dstmsg(RTM_MISS, dst, 0);
230 rtfree(struct rtentry *rt)
232 struct radix_node_head *rnh = rt_tables[rt_key(rt)->sa_family];
235 if (rnh->rnh_close && rt->rt_refcnt == 0)
236 rnh->rnh_close((struct radix_node *)rt, rnh);
237 if (rt->rt_refcnt <= 0 && !(rt->rt_flags & RTF_UP)) {
238 KASSERT(!(rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT)),
239 ("rtfree: rn_flags 0x%x ", rt->rt_nodes->rn_flags));
240 KASSERT(rt->rt_refcnt == 0,
241 ("rtfree: rt_refcnt %ld", rt->rt_refcnt));
242 if (rt->rt_ifa != NULL)
244 if (rt->rt_parent != NULL)
245 RTFREE(rt->rt_parent);
246 Free(rt_key(rt)); /* Also frees gateway. See rt_setgate(). */
252 * Force a routing table entry to the specified
253 * destination to go through the given gateway.
254 * Normally called as a result of a routing redirect
255 * message from the network layer.
257 * N.B.: must be called at splnet
261 struct sockaddr *dst,
262 struct sockaddr *gateway,
263 struct sockaddr *netmask,
265 struct sockaddr *src,
266 struct rtentry **rtp)
269 struct rt_addrinfo info;
274 /* verify the gateway is directly reachable */
275 if ((ifa = ifa_ifwithnet(gateway)) == NULL) {
281 * If the redirect isn't from our current router for this dst,
282 * it's either old or wrong. If it redirects us to ourselves,
283 * we have a routing loop, perhaps as a result of an interface
284 * going down recently.
286 if (!(flags & RTF_DONE) &&
287 (rt = rtpurelookup(dst)) != NULL &&
288 (!sa_equal(src, rt->rt_gateway) || rt->rt_ifa != ifa)) {
291 } else if (ifa_ifwithaddr(gateway)) {
292 error = EHOSTUNREACH;
297 * Create a new entry if we just got back a wildcard entry
298 * or the the lookup failed. This is necessary for hosts
299 * which use routing redirects generated by smart gateways
300 * to dynamically build the routing tables.
302 if (rt == NULL || (rt_mask(rt) != NULL && rt_mask(rt)->sa_len < 2))
306 * Don't listen to the redirect if it's for a route to an interface.
308 if (rt->rt_flags & RTF_GATEWAY) {
309 if ((!(rt->rt_flags & RTF_HOST)) && (flags & RTF_HOST)) {
311 * Changing from route to net => route to host.
312 * Create new route, rather than smashing route to net.
317 flags |= RTF_GATEWAY | RTF_DYNAMIC;
318 bzero(&info, sizeof info);
319 info.rti_info[RTAX_DST] = dst;
320 info.rti_info[RTAX_GATEWAY] = gateway;
321 info.rti_info[RTAX_NETMASK] = netmask;
323 info.rti_flags = flags;
325 error = rtrequest1(RTM_ADD, &info, &rt);
327 flags = rt->rt_flags;
328 stat = &rtstat.rts_dynamic;
331 * Smash the current notion of the gateway to
332 * this destination. Should check about netmask!!!
334 rt->rt_flags |= RTF_MODIFIED;
335 flags |= RTF_MODIFIED;
336 stat = &rtstat.rts_newgateway;
337 /* Add the key and gateway (in one malloc'ed chunk). */
338 rt_setgate(rt, rt_key(rt), gateway);
342 error = EHOSTUNREACH;
347 if (rtp != NULL && error == 0)
355 rtstat.rts_badredirect++;
356 else if (stat != NULL)
359 bzero(&info, sizeof info);
360 info.rti_info[RTAX_DST] = dst;
361 info.rti_info[RTAX_GATEWAY] = gateway;
362 info.rti_info[RTAX_NETMASK] = netmask;
363 info.rti_info[RTAX_AUTHOR] = src;
364 rt_missmsg(RTM_REDIRECT, &info, flags, error);
368 * Routing table ioctl interface.
371 rtioctl(u_long req, caddr_t data, struct thread *td)
374 /* Multicast goop, grrr... */
375 return mrt_ioctl ? mrt_ioctl(req, data) : EOPNOTSUPP;
382 ifa_ifwithroute(int flags, struct sockaddr *dst, struct sockaddr *gateway)
386 if (!(flags & RTF_GATEWAY)) {
388 * If we are adding a route to an interface,
389 * and the interface is a point-to-point link,
390 * we should search for the destination
391 * as our clue to the interface. Otherwise
392 * we can use the local address.
395 if (flags & RTF_HOST) {
396 ifa = ifa_ifwithdstaddr(dst);
399 ifa = ifa_ifwithaddr(gateway);
402 * If we are adding a route to a remote net
403 * or host, the gateway may still be on the
404 * other end of a pt to pt link.
406 ifa = ifa_ifwithdstaddr(gateway);
409 ifa = ifa_ifwithnet(gateway);
411 struct rtentry *rt = rtpurelookup(gateway);
416 if ((ifa = rt->rt_ifa) == NULL)
419 if (ifa->ifa_addr->sa_family != dst->sa_family) {
420 struct ifaddr *oifa = ifa;
422 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
429 static int rt_fixdelete (struct radix_node *, void *);
430 static int rt_fixchange (struct radix_node *, void *);
434 struct radix_node_head *rnh;
438 rt_getifa(struct rt_addrinfo *info)
440 struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
441 struct sockaddr *dst = info->rti_info[RTAX_DST];
442 struct sockaddr *ifaaddr = info->rti_info[RTAX_IFA];
443 struct sockaddr *ifpaddr = info->rti_info[RTAX_IFP];
444 int flags = info->rti_flags;
449 * ifp may be specified by sockaddr_dl
450 * when protocol address is ambiguous.
452 if (info->rti_ifp == NULL && ifpaddr != NULL &&
453 ifpaddr->sa_family == AF_LINK &&
454 (ifa = ifa_ifwithnet(ifpaddr)) != NULL)
455 info->rti_ifp = ifa->ifa_ifp;
456 if (info->rti_ifa == NULL && ifaaddr != NULL)
457 info->rti_ifa = ifa_ifwithaddr(ifaaddr);
458 if (info->rti_ifa == NULL) {
461 sa = ifaaddr != NULL ? ifaaddr :
462 (gateway != NULL ? gateway : dst);
463 if (sa != NULL && info->rti_ifp != NULL)
464 info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
465 else if (dst != NULL && gateway != NULL)
466 info->rti_ifa = ifa_ifwithroute(flags, dst, gateway);
468 info->rti_ifa = ifa_ifwithroute(flags, sa, sa);
470 if ((ifa = info->rti_ifa) != NULL) {
471 if (info->rti_ifp == NULL)
472 info->rti_ifp = ifa->ifa_ifp;
479 * Do appropriate manipulations of a routing tree given
480 * all the bits of info needed
485 struct sockaddr *dst,
486 struct sockaddr *gateway,
487 struct sockaddr *netmask,
489 struct rtentry **ret_nrt)
491 struct rt_addrinfo info;
493 bzero(&info, sizeof info);
494 info.rti_flags = flags;
495 info.rti_info[RTAX_DST] = dst;
496 info.rti_info[RTAX_GATEWAY] = gateway;
497 info.rti_info[RTAX_NETMASK] = netmask;
498 return rtrequest1(req, &info, ret_nrt);
502 rtrequest1(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt)
504 struct sockaddr *dst = info->rti_info[RTAX_DST];
506 struct radix_node *rn;
507 struct radix_node_head *rnh;
509 struct sockaddr *ndst;
513 #define gotoerr(x) { error = x ; goto bad; }
517 * Find the correct routing tree to use for this Address Family
519 if ((rnh = rt_tables[dst->sa_family]) == NULL)
520 gotoerr(EAFNOSUPPORT);
523 * If we are adding a host route then we don't want to put
524 * a netmask in the tree, nor do we want to clone it.
526 if (info->rti_flags & RTF_HOST) {
527 info->rti_info[RTAX_NETMASK] = NULL;
528 info->rti_flags &= ~(RTF_CLONING | RTF_PRCLONING);
533 /* Remove the item from the tree. */
534 rn = rnh->rnh_deladdr((char *)info->rti_info[RTAX_DST],
535 (char *)info->rti_info[RTAX_NETMASK],
539 KASSERT(!(rn->rn_flags & (RNF_ACTIVE | RNF_ROOT)),
540 ("rnh_deladdr returned flags 0x%x", rn->rn_flags));
541 rt = (struct rtentry *)rn;
543 /* Free any routes cloned from this one. */
544 if ((rt->rt_flags & (RTF_CLONING | RTF_PRCLONING)) &&
545 rt_mask(rt) != NULL) {
546 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
551 if (rt->rt_gwroute != NULL) {
552 RTFREE(rt->rt_gwroute);
553 rt->rt_gwroute = NULL;
557 * NB: RTF_UP must be set during the search above,
558 * because we might delete the last ref, causing
559 * rt to get freed prematurely.
561 rt->rt_flags &= ~RTF_UP;
563 /* Give the protocol a chance to keep things in sync. */
564 if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest)
565 ifa->ifa_rtrequest(RTM_DELETE, rt, info);
568 * If the caller wants it, then it can have it,
569 * but it's up to it to free the rtentry as we won't be
572 if (ret_nrt != NULL) {
574 } else if (rt->rt_refcnt <= 0) {
575 rt->rt_refcnt++; /* refcnt > 0 required for rtfree() */
581 if (ret_nrt == NULL || (rt = *ret_nrt) == NULL)
584 info->rti_flags = rt->rt_flags &
585 ~(RTF_CLONING | RTF_PRCLONING | RTF_STATIC);
586 info->rti_flags |= RTF_WASCLONED;
587 info->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
588 if ((info->rti_info[RTAX_NETMASK] = rt->rt_genmask) == NULL)
589 info->rti_flags |= RTF_HOST;
593 KASSERT(!(info->rti_flags & RTF_GATEWAY) ||
594 info->rti_info[RTAX_GATEWAY] != NULL,
595 ("rtrequest: GATEWAY but no gateway"));
597 if (info->rti_ifa == NULL && (error = rt_getifa(info)))
601 R_Malloc(rt, struct rtentry *, sizeof *rt);
604 bzero(rt, sizeof *rt);
605 rt->rt_flags = RTF_UP | info->rti_flags;
606 error = rt_setgate(rt, dst, info->rti_info[RTAX_GATEWAY]);
613 if (info->rti_info[RTAX_NETMASK] != NULL)
614 rt_maskedcopy(dst, ndst, info->rti_info[RTAX_NETMASK]);
616 bcopy(dst, ndst, dst->sa_len);
619 * Note that we now have a reference to the ifa.
620 * This moved from below so that rnh->rnh_addaddr() can
621 * examine the ifa and ifa->ifa_ifp if it so desires.
625 rt->rt_ifp = ifa->ifa_ifp;
626 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
628 rn = rnh->rnh_addaddr((char *)ndst,
629 (char *)info->rti_info[RTAX_NETMASK],
632 struct rtentry *oldrt;
635 * We already have one of these in the tree.
636 * We do a special hack: if the old route was
637 * cloned, then we blow it away and try
638 * re-inserting the new one.
640 oldrt = rtpurelookup(ndst);
643 if (oldrt->rt_flags & RTF_WASCLONED) {
644 rtrequest(RTM_DELETE, rt_key(oldrt),
647 oldrt->rt_flags, NULL);
648 rn = rnh->rnh_addaddr((char *)ndst,
650 info->rti_info[RTAX_NETMASK],
657 * If it still failed to go into the tree,
658 * then un-make it (this should be a function).
661 if (rt->rt_gwroute != NULL)
662 rtfree(rt->rt_gwroute);
670 * If we got here from RESOLVE, then we are cloning
671 * so clone the rest, and note that we
672 * are a clone (and increment the parent's references)
674 if (req == RTM_RESOLVE) {
675 rt->rt_rmx = (*ret_nrt)->rt_rmx; /* copy metrics */
676 rt->rt_rmx.rmx_pksent = 0; /* reset packet counter */
677 if ((*ret_nrt)->rt_flags &
678 (RTF_CLONING | RTF_PRCLONING)) {
679 rt->rt_parent = *ret_nrt;
680 (*ret_nrt)->rt_refcnt++;
685 * if this protocol has something to add to this then
686 * allow it to do that as well.
688 if (ifa->ifa_rtrequest != NULL)
689 ifa->ifa_rtrequest(req, rt, info);
692 * We repeat the same procedure from rt_setgate() here because
693 * it doesn't fire when we call it there because the node
694 * hasn't been added to the tree yet.
696 if (req == RTM_ADD && !(rt->rt_flags & RTF_HOST) &&
697 rt_mask(rt) != NULL) {
698 struct rtfc_arg arg = { rt, rnh };
700 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
706 * Return the resulting rtentry,
707 * increasing the number of references by one.
709 if (ret_nrt != NULL) {
723 * Called from rtrequest(RTM_DELETE, ...) to fix up the route's ``family''
724 * (i.e., the routes related to it by the operation of cloning). This
725 * routine is iterated over all potential former-child-routes by way of
726 * rnh->rnh_walktree_from() above, and those that actually are children of
727 * the late parent (passed in as VP here) are themselves deleted.
730 rt_fixdelete(struct radix_node *rn, void *vp)
732 struct rtentry *rt = (struct rtentry *)rn;
733 struct rtentry *rt0 = vp;
735 if (rt->rt_parent == rt0 &&
736 !(rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
737 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
744 * This routine is called from rt_setgate() to do the analogous thing for
745 * adds and changes. There is the added complication in this case of a
746 * middle insert; i.e., insertion of a new network route between an older
747 * network route and (cloned) host routes. For this reason, a simple check
748 * of rt->rt_parent is insufficient; each candidate route must be tested
749 * against the (mask, value) of the new route (passed as before in vp)
750 * to see if the new route matches it.
752 * XXX - it may be possible to do fixdelete() for changes and reserve this
753 * routine just for adds. I'm not sure why I thought it was necessary to do
757 static int rtfcdebug = 0;
761 rt_fixchange(struct radix_node *rn, void *vp)
763 struct rtentry *rt = (struct rtentry *)rn;
764 struct rtfc_arg *ap = vp;
765 struct rtentry *rt0 = ap->rt0;
766 struct radix_node_head *rnh = ap->rnh;
767 u_char *xk1, *xm1, *xk2, *xmp;
772 printf("rt_fixchange: rt %p, rt0 %p\n", rt, rt0);
775 if (rt->rt_parent == NULL ||
776 (rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
778 if (rtfcdebug) printf("no parent, pinned or cloning\n");
783 if (rt->rt_parent == rt0) {
785 if (rtfcdebug) printf("parent match\n");
787 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
792 * There probably is a function somewhere which does this...
793 * if not, there should be.
795 len = imin(rt_key(rt0)->sa_len, rt_key(rt)->sa_len);
797 xk1 = (u_char *)rt_key(rt0);
798 xm1 = (u_char *)rt_mask(rt0);
799 xk2 = (u_char *)rt_key(rt);
801 /* avoid applying a less specific route */
802 xmp = (u_char *)rt_mask(rt->rt_parent);
803 mlen = rt_key(rt->rt_parent)->sa_len;
804 if (mlen > rt_key(rt0)->sa_len) {
807 printf("rt_fixchange: inserting a less "
812 for (i = rnh->rnh_treetop->rn_offset; i < mlen; i++) {
813 if ((xmp[i] & ~(xmp[i] ^ xm1[i])) != xmp[i]) {
816 printf("rt_fixchange: inserting a less "
823 for (i = rnh->rnh_treetop->rn_offset; i < len; i++) {
824 if ((xk2[i] & xm1[i]) != xk1[i]) {
826 if (rtfcdebug) printf("no match\n");
833 * OK, this node is a clone, and matches the node currently being
834 * changed/added under the node's mask. So, get rid of it.
837 if (rtfcdebug) printf("deleting\n");
839 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
843 #define ROUNDUP(a) (a>0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
846 rt_setgate(struct rtentry *rt0, struct sockaddr *dst, struct sockaddr *gate)
848 char *space, *oldspace;
849 int dlen = ROUNDUP(dst->sa_len), glen = ROUNDUP(gate->sa_len);
850 struct rtentry *rt = rt0;
851 struct radix_node_head *rnh = rt_tables[dst->sa_family];
854 * A host route with the destination equal to the gateway
855 * will interfere with keeping LLINFO in the routing
856 * table, so disallow it.
858 if (((rt0->rt_flags & (RTF_HOST | RTF_GATEWAY | RTF_LLINFO)) ==
859 (RTF_HOST | RTF_GATEWAY)) &&
860 dst->sa_len == gate->sa_len &&
861 sa_equal(dst, gate)) {
863 * The route might already exist if this is an RTM_CHANGE
864 * or a routing redirect, so try to delete it.
866 if (rt_key(rt0) != NULL)
867 rtrequest(RTM_DELETE, rt_key(rt0), rt0->rt_gateway,
868 rt_mask(rt0), rt0->rt_flags, NULL);
869 return EADDRNOTAVAIL;
873 * Both dst and gateway are stored in the same malloc'ed chunk
874 * (If I ever get my hands on....)
875 * if we need to malloc a new chunk, then keep the old one around
876 * till we don't need it any more.
878 if (rt->rt_gateway == NULL || glen > ROUNDUP(rt->rt_gateway->sa_len)) {
879 oldspace = (char *)rt_key(rt);
880 R_Malloc(space, char *, dlen + glen);
883 rt->rt_nodes->rn_key = space;
885 space = (char *)rt_key(rt); /* Just use the old space. */
889 /* Set the gateway value. */
890 rt->rt_gateway = (struct sockaddr *)(space + dlen);
891 bcopy(gate, rt->rt_gateway, glen);
893 if (oldspace != NULL) {
895 * If we allocated a new chunk, preserve the original dst.
896 * This way, rt_setgate() really just sets the gate
897 * and leaves the dst field alone.
899 bcopy(dst, space, dlen);
904 * If there is already a gwroute, it's now almost definitely wrong
907 if (rt->rt_gwroute != NULL) {
908 RTFREE(rt->rt_gwroute);
909 rt->rt_gwroute = NULL;
911 if (rt->rt_flags & RTF_GATEWAY) {
913 * Cloning loop avoidance: In the presence of
914 * protocol-cloning and bad configuration, it is
915 * possible to get stuck in bottomless mutual recursion
916 * (rtrequest rt_setgate rtlookup). We avoid this
917 * by not allowing protocol-cloning to operate for
918 * gateways (which is probably the correct choice
919 * anyway), and avoid the resulting reference loops
920 * by disallowing any route to run through itself as
921 * a gateway. This is obviously mandatory when we
922 * get rt->rt_output().
924 * This breaks TTCP for hosts outside the gateway! XXX JH
926 rt->rt_gwroute = _rtlookup(gate, RTL_REPORTMSG, RTF_PRCLONING);
927 if (rt->rt_gwroute == rt) {
928 rt->rt_gwroute = NULL;
930 return EDQUOT; /* failure */
935 * This isn't going to do anything useful for host routes, so
936 * don't bother. Also make sure we have a reasonable mask
937 * (we don't yet have one during adds).
939 if (!(rt->rt_flags & RTF_HOST) && rt_mask(rt) != NULL) {
940 struct rtfc_arg arg = { rt, rnh };
942 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
952 struct sockaddr *src,
953 struct sockaddr *dst,
954 struct sockaddr *netmask)
956 u_char *cp1 = (u_char *)src;
957 u_char *cp2 = (u_char *)dst;
958 u_char *cp3 = (u_char *)netmask;
959 u_char *cplim = cp2 + *cp3;
960 u_char *cplim2 = cp2 + *cp1;
962 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
967 *cp2++ = *cp1++ & *cp3++;
969 bzero(cp2, cplim2 - cp2);
973 rt_llroute(struct sockaddr *dst, struct rtentry *rt0, struct rtentry **drt)
975 struct rtentry *up_rt, *rt;
977 if (!(rt0->rt_flags & RTF_UP)) {
978 up_rt = rtlookup(dst);
980 return (EHOSTUNREACH);
984 if (up_rt->rt_flags & RTF_GATEWAY) {
985 if (up_rt->rt_gwroute == NULL) {
986 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
987 if (up_rt->rt_gwroute == NULL)
988 return (EHOSTUNREACH);
989 } else if (!(up_rt->rt_gwroute->rt_flags & RTF_UP)) {
990 rtfree(up_rt->rt_gwroute);
991 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
992 if (up_rt->rt_gwroute == NULL)
993 return (EHOSTUNREACH);
995 rt = up_rt->rt_gwroute;
998 if (rt->rt_flags & RTF_REJECT &&
999 (rt->rt_rmx.rmx_expire == 0 || /* rt doesn't expire */
1000 time_second < rt->rt_rmx.rmx_expire)) /* rt not expired */
1001 return (rt->rt_flags & RTF_HOST ? EHOSTDOWN : EHOSTUNREACH);
1007 * Set up a routing table entry, normally
1011 rtinit(struct ifaddr *ifa, int cmd, int flags)
1013 struct sockaddr *dst, *deldst, *netmask;
1015 struct rtentry *nrt = NULL;
1016 struct mbuf *m = NULL;
1017 struct radix_node_head *rnh;
1018 struct radix_node *rn;
1019 struct rt_addrinfo info;
1022 if (flags & RTF_HOST) {
1023 dst = ifa->ifa_dstaddr;
1026 dst = ifa->ifa_addr;
1027 netmask = ifa->ifa_netmask;
1030 * If it's a delete, check that if it exists, it's on the correct
1031 * interface or we might scrub a route to another ifa which would
1032 * be confusing at best and possibly worse.
1034 if (cmd == RTM_DELETE) {
1036 * It's a delete, so it should already exist..
1037 * If it's a net, mask off the host bits
1038 * (Assuming we have a mask)
1040 if (netmask != NULL) {
1041 m = m_get(MB_DONTWAIT, MT_SONAME);
1044 deldst = mtod(m, struct sockaddr *);
1045 rt_maskedcopy(dst, deldst, netmask);
1049 * Look up an rtentry that is in the routing tree and
1050 * contains the correct info.
1052 if ((rnh = rt_tables[dst->sa_family]) == NULL ||
1053 (rn = rnh->rnh_lookup((char *)dst,
1054 (char *)netmask, rnh)) == NULL ||
1055 ((struct rtentry *)rn)->rt_ifa != ifa ||
1056 !sa_equal((struct sockaddr *)rn->rn_key, dst)) {
1059 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1065 * One would think that as we are deleting, and we know
1066 * it doesn't exist, we could just return at this point
1067 * with an "ELSE" clause, but apparently not..
1069 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1074 * Do the actual request
1076 bzero(&info, sizeof info);
1078 info.rti_flags = flags | ifa->ifa_flags;
1079 info.rti_info[RTAX_DST] = dst;
1080 info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1081 info.rti_info[RTAX_NETMASK] = netmask;
1082 error = rtrequest1(cmd, &info, &nrt);
1083 if (error == 0 && (rt = nrt) != NULL) {
1085 * notify any listening routing agents of the change
1087 rt_newaddrmsg(cmd, ifa, error, rt);
1088 if (cmd == RTM_DELETE) {
1090 * If we are deleting, and we found an entry, then
1091 * it's been removed from the tree.. now throw it away.
1093 if (rt->rt_refcnt <= 0) {
1094 rt->rt_refcnt++; /* make a 1->0 transition */
1097 } else if (cmd == RTM_ADD) {
1099 * We just wanted to add it.. we don't actually
1110 /* This must be before ip6_init2(), which is now SI_ORDER_MIDDLE */
1111 SYSINIT(route, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, 0);