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.19 2005/03/04 03:34:47 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 SLIST_FOREACH(dom, &domains, 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 when "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 generate_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 */
203 if (generate_report) {
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 KASSERT(rt->rt_refcnt > 0, ("rtfree: rt_refcnt %ld", rt->rt_refcnt));
232 if (rt->rt_refcnt == 0) {
233 struct radix_node_head *rnh = rt_tables[rt_key(rt)->sa_family];
236 rnh->rnh_close((struct radix_node *)rt, rnh);
237 if (!(rt->rt_flags & RTF_UP)) {
238 /* deallocate route */
239 if (rt->rt_ifa != NULL)
241 if (rt->rt_parent != NULL)
242 RTFREE(rt->rt_parent); /* recursive call! */
250 * Force a routing table entry to the specified destination to go through
251 * the given gateway. Normally called as a result of a routing redirect
252 * message from the network layer.
254 * N.B.: must be called at splnet
257 rtredirect(struct sockaddr *dst, struct sockaddr *gateway,
258 struct sockaddr *netmask, int flags, struct sockaddr *src)
260 struct rtentry *rt = NULL;
261 struct rt_addrinfo rtinfo;
266 /* verify the gateway is directly reachable */
267 if ((ifa = ifa_ifwithnet(gateway)) == NULL) {
273 * If the redirect isn't from our current router for this destination,
274 * it's either old or wrong.
276 if (!(flags & RTF_DONE) && /* XXX JH */
277 (rt = rtpurelookup(dst)) != NULL &&
278 (!sa_equal(src, rt->rt_gateway) || rt->rt_ifa != ifa)) {
284 * If it redirects us to ourselves, we have a routing loop,
285 * perhaps as a result of an interface going down recently.
287 if (ifa_ifwithaddr(gateway)) {
288 error = EHOSTUNREACH;
293 * Create a new entry if the lookup failed or if we got back
294 * a wildcard entry for the default route. This is necessary
295 * for hosts which use routing redirects generated by smart
296 * gateways to dynamically build the routing tables.
300 if ((rt_mask(rt) != NULL && rt_mask(rt)->sa_len < 2)) {
305 /* Ignore redirects for directly connected hosts. */
306 if (!(rt->rt_flags & RTF_GATEWAY)) {
307 error = EHOSTUNREACH;
311 if (!(rt->rt_flags & RTF_HOST) && (flags & RTF_HOST)) {
313 * Changing from a network route to a host route.
314 * Create a new host route rather than smashing the
318 flags |= RTF_GATEWAY | RTF_DYNAMIC;
319 bzero(&rtinfo, sizeof(struct rt_addrinfo));
320 rtinfo.rti_info[RTAX_DST] = dst;
321 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
322 rtinfo.rti_info[RTAX_NETMASK] = netmask;
323 rtinfo.rti_flags = flags;
324 rtinfo.rti_ifa = ifa;
325 rt = NULL; /* copy-in/copy-out parameter */
326 error = rtrequest1(RTM_ADD, &rtinfo, &rt);
328 flags = rt->rt_flags;
329 stat = &rtstat.rts_dynamic;
332 * Smash the current notion of the gateway to this destination.
333 * Should check about netmask!!!
335 rt->rt_flags |= RTF_MODIFIED;
336 flags |= RTF_MODIFIED;
337 rt_setgate(rt, rt_key(rt), gateway);
339 stat = &rtstat.rts_newgateway;
347 rtstat.rts_badredirect++;
348 else if (stat != NULL)
351 bzero(&rtinfo, sizeof(struct rt_addrinfo));
352 rtinfo.rti_info[RTAX_DST] = dst;
353 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
354 rtinfo.rti_info[RTAX_NETMASK] = netmask;
355 rtinfo.rti_info[RTAX_AUTHOR] = src;
356 rt_missmsg(RTM_REDIRECT, &rtinfo, flags, error);
360 * Routing table ioctl interface.
363 rtioctl(u_long req, caddr_t data, struct thread *td)
366 /* Multicast goop, grrr... */
367 return mrt_ioctl ? mrt_ioctl(req, data) : EOPNOTSUPP;
374 ifa_ifwithroute(int flags, struct sockaddr *dst, struct sockaddr *gateway)
378 if (!(flags & RTF_GATEWAY)) {
380 * If we are adding a route to an interface,
381 * and the interface is a point-to-point link,
382 * we should search for the destination
383 * as our clue to the interface. Otherwise
384 * we can use the local address.
387 if (flags & RTF_HOST) {
388 ifa = ifa_ifwithdstaddr(dst);
391 ifa = ifa_ifwithaddr(gateway);
394 * If we are adding a route to a remote net
395 * or host, the gateway may still be on the
396 * other end of a pt to pt link.
398 ifa = ifa_ifwithdstaddr(gateway);
401 ifa = ifa_ifwithnet(gateway);
405 rt = rtpurelookup(gateway);
409 if ((ifa = rt->rt_ifa) == NULL)
412 if (ifa->ifa_addr->sa_family != dst->sa_family) {
413 struct ifaddr *oldifa = ifa;
415 ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
422 static int rt_fixdelete (struct radix_node *, void *);
423 static int rt_fixchange (struct radix_node *, void *);
427 struct radix_node_head *rnh;
431 * Set rtinfo->rti_ifa and rtinfo->rti_ifp.
434 rt_getifa(struct rt_addrinfo *rtinfo)
436 struct sockaddr *gateway = rtinfo->rti_info[RTAX_GATEWAY];
437 struct sockaddr *dst = rtinfo->rti_info[RTAX_DST];
438 struct sockaddr *ifaaddr = rtinfo->rti_info[RTAX_IFA];
439 int flags = rtinfo->rti_flags;
442 * ifp may be specified by sockaddr_dl
443 * when protocol address is ambiguous.
445 if (rtinfo->rti_ifp == NULL) {
446 struct sockaddr *ifpaddr;
448 ifpaddr = rtinfo->rti_info[RTAX_IFP];
449 if (ifpaddr != NULL && ifpaddr->sa_family == AF_LINK) {
452 ifa = ifa_ifwithnet(ifpaddr);
454 rtinfo->rti_ifp = ifa->ifa_ifp;
458 if (rtinfo->rti_ifa == NULL && ifaaddr != NULL)
459 rtinfo->rti_ifa = ifa_ifwithaddr(ifaaddr);
460 if (rtinfo->rti_ifa == NULL) {
463 sa = ifaaddr != NULL ? ifaaddr :
464 (gateway != NULL ? gateway : dst);
465 if (sa != NULL && rtinfo->rti_ifp != NULL)
466 rtinfo->rti_ifa = ifaof_ifpforaddr(sa, rtinfo->rti_ifp);
467 else if (dst != NULL && gateway != NULL)
468 rtinfo->rti_ifa = ifa_ifwithroute(flags, dst, gateway);
470 rtinfo->rti_ifa = ifa_ifwithroute(flags, sa, sa);
472 if (rtinfo->rti_ifa == NULL)
473 return (ENETUNREACH);
475 if (rtinfo->rti_ifp == NULL)
476 rtinfo->rti_ifp = rtinfo->rti_ifa->ifa_ifp;
481 * Do appropriate manipulations of a routing tree given
482 * all the bits of info needed
487 struct sockaddr *dst,
488 struct sockaddr *gateway,
489 struct sockaddr *netmask,
491 struct rtentry **ret_nrt)
493 struct rt_addrinfo rtinfo;
495 bzero(&rtinfo, sizeof(struct rt_addrinfo));
496 rtinfo.rti_info[RTAX_DST] = dst;
497 rtinfo.rti_info[RTAX_GATEWAY] = gateway;
498 rtinfo.rti_info[RTAX_NETMASK] = netmask;
499 rtinfo.rti_flags = flags;
500 return rtrequest1(req, &rtinfo, ret_nrt);
504 rtrequest1(int req, struct rt_addrinfo *rtinfo, struct rtentry **ret_nrt)
506 struct sockaddr *dst = rtinfo->rti_info[RTAX_DST];
508 struct radix_node *rn;
509 struct radix_node_head *rnh;
511 struct sockaddr *ndst;
515 #define gotoerr(x) { error = x ; goto bad; }
519 * Find the correct routing tree to use for this Address Family
521 if ((rnh = rt_tables[dst->sa_family]) == NULL)
522 gotoerr(EAFNOSUPPORT);
525 * If we are adding a host route then we don't want to put
526 * a netmask in the tree, nor do we want to clone it.
528 if (rtinfo->rti_flags & RTF_HOST) {
529 rtinfo->rti_info[RTAX_NETMASK] = NULL;
530 rtinfo->rti_flags &= ~(RTF_CLONING | RTF_PRCLONING);
535 /* Remove the item from the tree. */
536 rn = rnh->rnh_deladdr((char *)rtinfo->rti_info[RTAX_DST],
537 (char *)rtinfo->rti_info[RTAX_NETMASK],
541 KASSERT(!(rn->rn_flags & (RNF_ACTIVE | RNF_ROOT)),
542 ("rnh_deladdr returned flags 0x%x", rn->rn_flags));
543 rt = (struct rtentry *)rn;
545 /* Free any routes cloned from this one. */
546 if ((rt->rt_flags & (RTF_CLONING | RTF_PRCLONING)) &&
547 rt_mask(rt) != NULL) {
548 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
553 if (rt->rt_gwroute != NULL) {
554 RTFREE(rt->rt_gwroute);
555 rt->rt_gwroute = NULL;
559 * NB: RTF_UP must be set during the search above,
560 * because we might delete the last ref, causing
561 * rt to get freed prematurely.
563 rt->rt_flags &= ~RTF_UP;
565 /* Give the protocol a chance to keep things in sync. */
566 if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest)
567 ifa->ifa_rtrequest(RTM_DELETE, rt, rtinfo);
570 * If the caller wants it, then it can have it,
571 * but it's up to it to free the rtentry as we won't be
574 KASSERT(rt->rt_refcnt >= 0,
575 ("rtrequest1(DELETE): refcnt %ld", rt->rt_refcnt));
576 if (ret_nrt != NULL) {
578 } else if (rt->rt_refcnt == 0) {
579 rt->rt_refcnt++; /* refcnt > 0 required for rtfree() */
585 if (ret_nrt == NULL || (rt = *ret_nrt) == NULL)
589 rt->rt_flags & ~(RTF_CLONING | RTF_PRCLONING | RTF_STATIC);
590 rtinfo->rti_flags |= RTF_WASCLONED;
591 rtinfo->rti_info[RTAX_GATEWAY] = rt->rt_gateway;
592 if ((rtinfo->rti_info[RTAX_NETMASK] = rt->rt_genmask) == NULL)
593 rtinfo->rti_flags |= RTF_HOST;
597 KASSERT(!(rtinfo->rti_flags & RTF_GATEWAY) ||
598 rtinfo->rti_info[RTAX_GATEWAY] != NULL,
599 ("rtrequest: GATEWAY but no gateway"));
601 if (rtinfo->rti_ifa == NULL && (error = rt_getifa(rtinfo)))
603 ifa = rtinfo->rti_ifa;
605 R_Malloc(rt, struct rtentry *, sizeof(struct rtentry));
608 bzero(rt, sizeof(struct rtentry));
609 rt->rt_flags = RTF_UP | rtinfo->rti_flags;
610 error = rt_setgate(rt, dst, rtinfo->rti_info[RTAX_GATEWAY]);
617 if (rtinfo->rti_info[RTAX_NETMASK] != NULL)
618 rt_maskedcopy(dst, ndst,
619 rtinfo->rti_info[RTAX_NETMASK]);
621 bcopy(dst, ndst, dst->sa_len);
624 * Note that we now have a reference to the ifa.
625 * This moved from below so that rnh->rnh_addaddr() can
626 * examine the ifa and ifa->ifa_ifp if it so desires.
630 rt->rt_ifp = ifa->ifa_ifp;
631 /* XXX mtu manipulation will be done in rnh_addaddr -- itojun */
633 rn = rnh->rnh_addaddr((char *)ndst,
634 (char *)rtinfo->rti_info[RTAX_NETMASK],
637 struct rtentry *oldrt;
640 * We already have one of these in the tree.
641 * We do a special hack: if the old route was
642 * cloned, then we blow it away and try
643 * re-inserting the new one.
645 oldrt = rtpurelookup(ndst);
648 if (oldrt->rt_flags & RTF_WASCLONED) {
649 rtrequest(RTM_DELETE, rt_key(oldrt),
652 oldrt->rt_flags, NULL);
653 rn = rnh->rnh_addaddr((char *)ndst,
655 rtinfo->rti_info[RTAX_NETMASK],
662 * If it still failed to go into the tree,
663 * then un-make it (this should be a function).
666 if (rt->rt_gwroute != NULL)
667 rtfree(rt->rt_gwroute);
675 * If we got here from RESOLVE, then we are cloning
676 * so clone the rest, and note that we
677 * are a clone (and increment the parent's references)
679 if (req == RTM_RESOLVE) {
680 rt->rt_rmx = (*ret_nrt)->rt_rmx; /* copy metrics */
681 rt->rt_rmx.rmx_pksent = 0; /* reset packet counter */
682 if ((*ret_nrt)->rt_flags &
683 (RTF_CLONING | RTF_PRCLONING)) {
684 rt->rt_parent = *ret_nrt;
685 (*ret_nrt)->rt_refcnt++;
690 * if this protocol has something to add to this then
691 * allow it to do that as well.
693 if (ifa->ifa_rtrequest != NULL)
694 ifa->ifa_rtrequest(req, rt, rtinfo);
697 * We repeat the same procedure from rt_setgate() here because
698 * it doesn't fire when we call it there because the node
699 * hasn't been added to the tree yet.
701 if (req == RTM_ADD && !(rt->rt_flags & RTF_HOST) &&
702 rt_mask(rt) != NULL) {
703 struct rtfc_arg arg = { rt, rnh };
705 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
711 * Return the resulting rtentry,
712 * increasing the number of references by one.
714 if (ret_nrt != NULL) {
728 * Called from rtrequest(RTM_DELETE, ...) to fix up the route's ``family''
729 * (i.e., the routes related to it by the operation of cloning). This
730 * routine is iterated over all potential former-child-routes by way of
731 * rnh->rnh_walktree_from() above, and those that actually are children of
732 * the late parent (passed in as VP here) are themselves deleted.
735 rt_fixdelete(struct radix_node *rn, void *vp)
737 struct rtentry *rt = (struct rtentry *)rn;
738 struct rtentry *rt0 = vp;
740 if (rt->rt_parent == rt0 &&
741 !(rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
742 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
749 * This routine is called from rt_setgate() to do the analogous thing for
750 * adds and changes. There is the added complication in this case of a
751 * middle insert; i.e., insertion of a new network route between an older
752 * network route and (cloned) host routes. For this reason, a simple check
753 * of rt->rt_parent is insufficient; each candidate route must be tested
754 * against the (mask, value) of the new route (passed as before in vp)
755 * to see if the new route matches it.
757 * XXX - it may be possible to do fixdelete() for changes and reserve this
758 * routine just for adds. I'm not sure why I thought it was necessary to do
762 static int rtfcdebug = 0;
766 rt_fixchange(struct radix_node *rn, void *vp)
768 struct rtentry *rt = (struct rtentry *)rn;
769 struct rtfc_arg *ap = vp;
770 struct rtentry *rt0 = ap->rt0;
771 struct radix_node_head *rnh = ap->rnh;
772 u_char *xk1, *xm1, *xk2, *xmp;
777 printf("rt_fixchange: rt %p, rt0 %p\n", rt, rt0);
780 if (rt->rt_parent == NULL ||
781 (rt->rt_flags & (RTF_PINNED | RTF_CLONING | RTF_PRCLONING))) {
783 if (rtfcdebug) printf("no parent, pinned or cloning\n");
788 if (rt->rt_parent == rt0) {
790 if (rtfcdebug) printf("parent match\n");
792 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
797 * There probably is a function somewhere which does this...
798 * if not, there should be.
800 len = imin(rt_key(rt0)->sa_len, rt_key(rt)->sa_len);
802 xk1 = (u_char *)rt_key(rt0);
803 xm1 = (u_char *)rt_mask(rt0);
804 xk2 = (u_char *)rt_key(rt);
806 /* avoid applying a less specific route */
807 xmp = (u_char *)rt_mask(rt->rt_parent);
808 mlen = rt_key(rt->rt_parent)->sa_len;
809 if (mlen > rt_key(rt0)->sa_len) {
812 printf("rt_fixchange: inserting a less "
817 for (i = rnh->rnh_treetop->rn_offset; i < mlen; i++) {
818 if ((xmp[i] & ~(xmp[i] ^ xm1[i])) != xmp[i]) {
821 printf("rt_fixchange: inserting a less "
828 for (i = rnh->rnh_treetop->rn_offset; i < len; i++) {
829 if ((xk2[i] & xm1[i]) != xk1[i]) {
831 if (rtfcdebug) printf("no match\n");
838 * OK, this node is a clone, and matches the node currently being
839 * changed/added under the node's mask. So, get rid of it.
842 if (rtfcdebug) printf("deleting\n");
844 return rtrequest(RTM_DELETE, rt_key(rt), NULL, rt_mask(rt),
848 #define ROUNDUP(a) (a>0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
851 rt_setgate(struct rtentry *rt0, struct sockaddr *dst, struct sockaddr *gate)
853 char *space, *oldspace;
854 int dlen = ROUNDUP(dst->sa_len), glen = ROUNDUP(gate->sa_len);
855 struct rtentry *rt = rt0;
856 struct radix_node_head *rnh = rt_tables[dst->sa_family];
859 * A host route with the destination equal to the gateway
860 * will interfere with keeping LLINFO in the routing
861 * table, so disallow it.
863 if (((rt0->rt_flags & (RTF_HOST | RTF_GATEWAY | RTF_LLINFO)) ==
864 (RTF_HOST | RTF_GATEWAY)) &&
865 dst->sa_len == gate->sa_len &&
866 sa_equal(dst, gate)) {
868 * The route might already exist if this is an RTM_CHANGE
869 * or a routing redirect, so try to delete it.
871 if (rt_key(rt0) != NULL)
872 rtrequest(RTM_DELETE, rt_key(rt0), rt0->rt_gateway,
873 rt_mask(rt0), rt0->rt_flags, NULL);
874 return EADDRNOTAVAIL;
878 * Both dst and gateway are stored in the same malloc'ed chunk
879 * (If I ever get my hands on....)
880 * if we need to malloc a new chunk, then keep the old one around
881 * till we don't need it any more.
883 if (rt->rt_gateway == NULL || glen > ROUNDUP(rt->rt_gateway->sa_len)) {
884 oldspace = (char *)rt_key(rt);
885 R_Malloc(space, char *, dlen + glen);
888 rt->rt_nodes->rn_key = space;
890 space = (char *)rt_key(rt); /* Just use the old space. */
894 /* Set the gateway value. */
895 rt->rt_gateway = (struct sockaddr *)(space + dlen);
896 bcopy(gate, rt->rt_gateway, glen);
898 if (oldspace != NULL) {
900 * If we allocated a new chunk, preserve the original dst.
901 * This way, rt_setgate() really just sets the gate
902 * and leaves the dst field alone.
904 bcopy(dst, space, dlen);
909 * If there is already a gwroute, it's now almost definitely wrong
912 if (rt->rt_gwroute != NULL) {
913 RTFREE(rt->rt_gwroute);
914 rt->rt_gwroute = NULL;
916 if (rt->rt_flags & RTF_GATEWAY) {
918 * Cloning loop avoidance: In the presence of
919 * protocol-cloning and bad configuration, it is
920 * possible to get stuck in bottomless mutual recursion
921 * (rtrequest rt_setgate rtlookup). We avoid this
922 * by not allowing protocol-cloning to operate for
923 * gateways (which is probably the correct choice
924 * anyway), and avoid the resulting reference loops
925 * by disallowing any route to run through itself as
926 * a gateway. This is obviously mandatory when we
927 * get rt->rt_output().
929 * This breaks TTCP for hosts outside the gateway! XXX JH
931 rt->rt_gwroute = _rtlookup(gate, RTL_REPORTMSG, RTF_PRCLONING);
932 if (rt->rt_gwroute == rt) {
933 rt->rt_gwroute = NULL;
935 return EDQUOT; /* failure */
940 * This isn't going to do anything useful for host routes, so
941 * don't bother. Also make sure we have a reasonable mask
942 * (we don't yet have one during adds).
944 if (!(rt->rt_flags & RTF_HOST) && rt_mask(rt) != NULL) {
945 struct rtfc_arg arg = { rt, rnh };
947 rnh->rnh_walktree_from(rnh, (char *)rt_key(rt),
957 struct sockaddr *src,
958 struct sockaddr *dst,
959 struct sockaddr *netmask)
961 u_char *cp1 = (u_char *)src;
962 u_char *cp2 = (u_char *)dst;
963 u_char *cp3 = (u_char *)netmask;
964 u_char *cplim = cp2 + *cp3;
965 u_char *cplim2 = cp2 + *cp1;
967 *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
972 *cp2++ = *cp1++ & *cp3++;
974 bzero(cp2, cplim2 - cp2);
978 rt_llroute(struct sockaddr *dst, struct rtentry *rt0, struct rtentry **drt)
980 struct rtentry *up_rt, *rt;
982 if (!(rt0->rt_flags & RTF_UP)) {
983 up_rt = rtlookup(dst);
985 return (EHOSTUNREACH);
989 if (up_rt->rt_flags & RTF_GATEWAY) {
990 if (up_rt->rt_gwroute == NULL) {
991 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
992 if (up_rt->rt_gwroute == NULL)
993 return (EHOSTUNREACH);
994 } else if (!(up_rt->rt_gwroute->rt_flags & RTF_UP)) {
995 rtfree(up_rt->rt_gwroute);
996 up_rt->rt_gwroute = rtlookup(up_rt->rt_gateway);
997 if (up_rt->rt_gwroute == NULL)
998 return (EHOSTUNREACH);
1000 rt = up_rt->rt_gwroute;
1003 if (rt->rt_flags & RTF_REJECT &&
1004 (rt->rt_rmx.rmx_expire == 0 || /* rt doesn't expire */
1005 time_second < rt->rt_rmx.rmx_expire)) /* rt not expired */
1006 return (rt->rt_flags & RTF_HOST ? EHOSTDOWN : EHOSTUNREACH);
1012 * Set up a routing table entry, normally for an interface.
1015 rtinit(struct ifaddr *ifa, int cmd, int flags)
1017 struct sockaddr *dst, *deldst, *netmask;
1019 struct mbuf *m = NULL;
1020 struct radix_node_head *rnh;
1021 struct radix_node *rn;
1022 struct rt_addrinfo rtinfo;
1025 if (flags & RTF_HOST) {
1026 dst = ifa->ifa_dstaddr;
1029 dst = ifa->ifa_addr;
1030 netmask = ifa->ifa_netmask;
1033 * If it's a delete, check that if it exists, it's on the correct
1034 * interface or we might scrub a route to another ifa which would
1035 * be confusing at best and possibly worse.
1037 if (cmd == RTM_DELETE) {
1039 * It's a delete, so it should already exist..
1040 * If it's a net, mask off the host bits
1041 * (Assuming we have a mask)
1043 if (netmask != NULL) {
1044 m = m_get(MB_DONTWAIT, MT_SONAME);
1047 deldst = mtod(m, struct sockaddr *);
1048 rt_maskedcopy(dst, deldst, netmask);
1052 * Look up an rtentry that is in the routing tree and
1053 * contains the correct info.
1055 if ((rnh = rt_tables[dst->sa_family]) == NULL ||
1056 (rn = rnh->rnh_lookup((char *)dst,
1057 (char *)netmask, rnh)) == NULL ||
1058 ((struct rtentry *)rn)->rt_ifa != ifa ||
1059 !sa_equal((struct sockaddr *)rn->rn_key, dst)) {
1062 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1068 * One would think that as we are deleting, and we know
1069 * it doesn't exist, we could just return at this point
1070 * with an "ELSE" clause, but apparently not..
1072 return (flags & RTF_HOST ? EHOSTUNREACH : ENETUNREACH);
1077 * Do the actual request
1079 bzero(&rtinfo, sizeof(struct rt_addrinfo));
1080 rtinfo.rti_info[RTAX_DST] = dst;
1081 rtinfo.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1082 rtinfo.rti_info[RTAX_NETMASK] = netmask;
1083 rtinfo.rti_flags = flags | ifa->ifa_flags;
1084 rtinfo.rti_ifa = ifa;
1085 error = rtrequest1(cmd, &rtinfo, &rt);
1086 if (error == 0 && rt != NULL) {
1088 * notify any listening routing agents of the change
1090 rt_newaddrmsg(cmd, ifa, error, rt);
1091 if (cmd == RTM_DELETE) {
1093 * If we are deleting, and we found an entry, then
1094 * it's been removed from the tree.. now throw it away.
1096 if (rt->rt_refcnt == 0) {
1097 rt->rt_refcnt++; /* make a 1->0 transition */
1100 } else if (cmd == RTM_ADD) {
1102 * We just wanted to add it.. we don't actually
1113 /* This must be before ip6_init2(), which is now SI_ORDER_MIDDLE */
1114 SYSINIT(route, SI_SUB_PROTO_DOMAIN, SI_ORDER_THIRD, route_init, 0);