This particular implementation is designed to be fully backwards compatible and to be MFC-able to 7.x (and 6.x) Currently the only protocol that can make use of the multiple tables is IPv4 Similar functionality exists in OpenBSD and Linux. From my notes: ----- One thing where FreeBSD has been falling behind, and which by chance I have some time to work on is "policy based routing", which allows different packet streams to be routed by more than just the destination address. Constraints: ------------ I want to make some form of this available in the 6.x tree (and by extension 7.x) , but FreeBSD in general needs it so I might as well do it in -current and back port the portions I need. One of the ways that this can be done is to have the ability to instantiate multiple kernel routing tables (which I will now refer to as "Forwarding Information Bases" or "FIBs" for political correctness reasons). Which FIB a particular packet uses to make the next hop decision can be decided by a number of mechanisms. The policies these mechanisms implement are the "Policies" referred to in "Policy based routing". One of the constraints I have if I try to back port this work to 6.x is that it must be implemented as a EXTENSION to the existing ABIs in 6.x so that third party applications do not need to be recompiled in timespan of the branch. This first version will not have some of the bells and whistles that will come with later versions. It will, for example, be limited to 16 tables in the first commit. Implementation method, Compatible version. (part 1) ------------------------------- For this reason I have implemented a "sufficient subset" of a multiple routing table solution in Perforce, and back-ported it to 6.x. (also in Perforce though not always caught up with what I have done in -current/P4). The subset allows a number of FIBs to be defined at compile time (8 is sufficient for my purposes in 6.x) and implements the changes needed to allow IPV4 to use them. I have not done the changes for ipv6 simply because I do not need it, and I do not have enough knowledge of ipv6 (e.g. neighbor discovery) needed to do it. Other protocol families are left untouched and should there be users with proprietary protocol families, they should continue to work and be oblivious to the existence of the extra FIBs. To understand how this is done, one must know that the current FIB code starts everything off with a single dimensional array of pointers to FIB head structures (One per protocol family), each of which in turn points to the trie of routes available to that family. The basic change in the ABI compatible version of the change is to extent that array to be a 2 dimensional array, so that instead of protocol family X looking at rt_tables[X] for the table it needs, it looks at rt_tables[Y][X] when for all protocol families except ipv4 Y is always 0. Code that is unaware of the change always just sees the first row of the table, which of course looks just like the one dimensional array that existed before. The entry points rtrequest(), rtalloc(), rtalloc1(), rtalloc_ign() are all maintained, but refer only to the first row of the array, so that existing callers in proprietary protocols can continue to do the "right thing". Some new entry points are added, for the exclusive use of ipv4 code called in_rtrequest(), in_rtalloc(), in_rtalloc1() and in_rtalloc_ign(), which have an extra argument which refers the code to the correct row. In addition, there are some new entry points (currently called rtalloc_fib() and friends) that check the Address family being looked up and call either rtalloc() (and friends) if the protocol is not IPv4 forcing the action to row 0 or to the appropriate row if it IS IPv4 (and that info is available). These are for calling from code that is not specific to any particular protocol. The way these are implemented would change in the non ABI preserving code to be added later. One feature of the first version of the code is that for ipv4, the interface routes show up automatically on all the FIBs, so that no matter what FIB you select you always have the basic direct attached hosts available to you. (rtinit() does this automatically). You CAN delete an interface route from one FIB should you want to but by default it's there. ARP information is also available in each FIB. It's assumed that the same machine would have the same MAC address, regardless of which FIB you are using to get to it. This brings us as to how the correct FIB is selected for an outgoing IPV4 packet. Firstly, all packets have a FIB associated with them. if nothing has been done to change it, it will be FIB 0. The FIB is changed in the following ways. Packets fall into one of a number of classes. 1/ locally generated packets, coming from a socket/PCB. Such packets select a FIB from a number associated with the socket/PCB. This in turn is inherited from the process, but can be changed by a socket option. The process in turn inherits it on fork. I have written a utility call setfib that acts a bit like nice.. setfib -3 ping target.example.com # will use fib 3 for ping. It is an obvious extension to make it a property of a jail but I have not done so. It can be achieved by combining the setfib and jail commands. 2/ packets received on an interface for forwarding. By default these packets would use table 0, (or possibly a number settable in a sysctl(not yet)). but prior to routing the firewall can inspect them (see below). (possibly in the future you may be able to associate a FIB with packets received on an interface.. An ifconfig arg, but not yet.) 3/ packets inspected by a packet classifier, which can arbitrarily associate a fib with it on a packet by packet basis. A fib assigned to a packet by a packet classifier (such as ipfw) would over-ride a fib associated by a more default source. (such as cases 1 or 2). 4/ a tcp listen socket associated with a fib will generate accept sockets that are associated with that same fib. 5/ Packets generated in response to some other packet (e.g. reset or icmp packets). These should use the FIB associated with the packet being reponded to. 6/ Packets generated during encapsulation. gif, tun and other tunnel interfaces will encapsulate using the FIB that was in effect withthe proces that set up the tunnel. thus setfib 1 ifconfig gif0 [tunnel instructions] will set the fib for the tunnel to use to be fib 1. Routing messages would be associated with their process, and thus select one FIB or another. messages from the kernel would be associated with the fib they refer to and would only be received by a routing socket associated with that fib. (not yet implemented) In addition Netstat has been edited to be able to cope with the fact that the array is now 2 dimensional. (It looks in system memory using libkvm (!)). Old versions of netstat see only the first FIB. In addition two sysctls are added to give: a) the number of FIBs compiled in (active) b) the default FIB of the calling process. Early testing experience: ------------------------- Basically our (IronPort's) appliance does this functionality already using ipfw fwd but that method has some drawbacks. For example, It can't fully simulate a routing table because it can't influence the socket's choice of local address when a connect() is done. Testing during the generating of these changes has been remarkably smooth so far. Multiple tables have co-existed with no notable side effects, and packets have been routes accordingly. ipfw has grown 2 new keywords: setfib N ip from anay to any count ip from any to any fib N In pf there seems to be a requirement to be able to give symbolic names to the fibs but I do not have that capacity. I am not sure if it is required. SCTP has interestingly enough built in support for this, called VRFs in Cisco parlance. it will be interesting to see how that handles it when it suddenly actually does something. Where to next: -------------------- After committing the ABI compatible version and MFCing it, I'd like to proceed in a forward direction in -current. this will result in some roto-tilling in the routing code. Firstly: the current code's idea of having a separate tree per protocol family, all of the same format, and pointed to by the 1 dimensional array is a bit silly. Especially when one considers that there is code that makes assumptions about every protocol having the same internal structures there. Some protocols don't WANT that sort of structure. (for example the whole idea of a netmask is foreign to appletalk). This needs to be made opaque to the external code. My suggested first change is to add routing method pointers to the 'domain' structure, along with information pointing the data. instead of having an array of pointers to uniform structures, there would be an array pointing to the 'domain' structures for each protocol address domain (protocol family), and the methods this reached would be called. The methods would have an argument that gives FIB number, but the protocol would be free to ignore it. When the ABI can be changed it raises the possibilty of the addition of a fib entry into the "struct route". Currently, the structure contains the sockaddr of the desination, and the resulting fib entry. To make this work fully, one could add a fib number so that given an address and a fib, one can find the third element, the fib entry. Interaction with the ARP layer/ LL layer would need to be revisited as well. Qing Li has been working on this already. This work was sponsored by Ironport Systems/Cisco Reviewed by: several including rwatson, bz and mlair (parts each) Obtained from: Ironport systems/Cisco
478 lines
14 KiB
C
478 lines
14 KiB
C
/*-
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* $KAME: in6_rmx.c,v 1.11 2001/07/26 06:53:16 jinmei Exp $
|
|
*/
|
|
|
|
/*-
|
|
* Copyright 1994, 1995 Massachusetts Institute of Technology
|
|
*
|
|
* Permission to use, copy, modify, and distribute this software and
|
|
* its documentation for any purpose and without fee is hereby
|
|
* granted, provided that both the above copyright notice and this
|
|
* permission notice appear in all copies, that both the above
|
|
* copyright notice and this permission notice appear in all
|
|
* supporting documentation, and that the name of M.I.T. not be used
|
|
* in advertising or publicity pertaining to distribution of the
|
|
* software without specific, written prior permission. M.I.T. makes
|
|
* no representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied
|
|
* warranty.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''. M.I.T. DISCLAIMS
|
|
* ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE,
|
|
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
|
|
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT
|
|
* SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
|
|
* USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
|
|
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
|
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
|
|
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
*/
|
|
|
|
/*
|
|
* This code does two things necessary for the enhanced TCP metrics to
|
|
* function in a useful manner:
|
|
* 1) It marks all non-host routes as `cloning', thus ensuring that
|
|
* every actual reference to such a route actually gets turned
|
|
* into a reference to a host route to the specific destination
|
|
* requested.
|
|
* 2) When such routes lose all their references, it arranges for them
|
|
* to be deleted in some random collection of circumstances, so that
|
|
* a large quantity of stale routing data is not kept in kernel memory
|
|
* indefinitely. See in6_rtqtimo() below for the exact mechanism.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <sys/param.h>
|
|
#include <sys/systm.h>
|
|
#include <sys/kernel.h>
|
|
#include <sys/sysctl.h>
|
|
#include <sys/queue.h>
|
|
#include <sys/socket.h>
|
|
#include <sys/socketvar.h>
|
|
#include <sys/mbuf.h>
|
|
#include <sys/syslog.h>
|
|
#include <sys/callout.h>
|
|
|
|
#include <net/if.h>
|
|
#include <net/route.h>
|
|
#include <netinet/in.h>
|
|
#include <netinet/ip_var.h>
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/ip6.h>
|
|
#include <netinet6/ip6_var.h>
|
|
|
|
#include <netinet/icmp6.h>
|
|
#include <netinet6/nd6.h>
|
|
|
|
#include <netinet/tcp.h>
|
|
#include <netinet/tcp_seq.h>
|
|
#include <netinet/tcp_timer.h>
|
|
#include <netinet/tcp_var.h>
|
|
|
|
extern int in6_inithead(void **head, int off);
|
|
|
|
#define RTPRF_OURS RTF_PROTO3 /* set on routes we manage */
|
|
|
|
/*
|
|
* Do what we need to do when inserting a route.
|
|
*/
|
|
static struct radix_node *
|
|
in6_addroute(void *v_arg, void *n_arg, struct radix_node_head *head,
|
|
struct radix_node *treenodes)
|
|
{
|
|
struct rtentry *rt = (struct rtentry *)treenodes;
|
|
struct sockaddr_in6 *sin6 = (struct sockaddr_in6 *)rt_key(rt);
|
|
struct radix_node *ret;
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&sin6->sin6_addr))
|
|
rt->rt_flags |= RTF_MULTICAST;
|
|
|
|
/*
|
|
* A little bit of help for both IPv6 output and input:
|
|
* For local addresses, we make sure that RTF_LOCAL is set,
|
|
* with the thought that this might one day be used to speed up
|
|
* ip_input().
|
|
*
|
|
* We also mark routes to multicast addresses as such, because
|
|
* it's easy to do and might be useful (but this is much more
|
|
* dubious since it's so easy to inspect the address). (This
|
|
* is done above.)
|
|
*
|
|
* XXX
|
|
* should elaborate the code.
|
|
*/
|
|
if (rt->rt_flags & RTF_HOST) {
|
|
if (IN6_ARE_ADDR_EQUAL(&satosin6(rt->rt_ifa->ifa_addr)
|
|
->sin6_addr,
|
|
&sin6->sin6_addr)) {
|
|
rt->rt_flags |= RTF_LOCAL;
|
|
}
|
|
}
|
|
|
|
if (!rt->rt_rmx.rmx_mtu && rt->rt_ifp)
|
|
rt->rt_rmx.rmx_mtu = IN6_LINKMTU(rt->rt_ifp);
|
|
|
|
ret = rn_addroute(v_arg, n_arg, head, treenodes);
|
|
if (ret == NULL && rt->rt_flags & RTF_HOST) {
|
|
struct rtentry *rt2;
|
|
/*
|
|
* We are trying to add a host route, but can't.
|
|
* Find out if it is because of an
|
|
* ARP entry and delete it if so.
|
|
*/
|
|
rt2 = rtalloc1((struct sockaddr *)sin6, 0, RTF_CLONING);
|
|
if (rt2) {
|
|
if (rt2->rt_flags & RTF_LLINFO &&
|
|
rt2->rt_flags & RTF_HOST &&
|
|
rt2->rt_gateway &&
|
|
rt2->rt_gateway->sa_family == AF_LINK) {
|
|
rtexpunge(rt2);
|
|
RTFREE_LOCKED(rt2);
|
|
ret = rn_addroute(v_arg, n_arg, head,
|
|
treenodes);
|
|
} else
|
|
RTFREE_LOCKED(rt2);
|
|
}
|
|
} else if (ret == NULL && rt->rt_flags & RTF_CLONING) {
|
|
struct rtentry *rt2;
|
|
/*
|
|
* We are trying to add a net route, but can't.
|
|
* The following case should be allowed, so we'll make a
|
|
* special check for this:
|
|
* Two IPv6 addresses with the same prefix is assigned
|
|
* to a single interrface.
|
|
* # ifconfig if0 inet6 3ffe:0501::1 prefix 64 alias (*1)
|
|
* # ifconfig if0 inet6 3ffe:0501::2 prefix 64 alias (*2)
|
|
* In this case, (*1) and (*2) want to add the same
|
|
* net route entry, 3ffe:0501:: -> if0.
|
|
* This case should not raise an error.
|
|
*/
|
|
rt2 = rtalloc1((struct sockaddr *)sin6, 0, RTF_CLONING);
|
|
if (rt2) {
|
|
if ((rt2->rt_flags & (RTF_CLONING|RTF_HOST|RTF_GATEWAY))
|
|
== RTF_CLONING
|
|
&& rt2->rt_gateway
|
|
&& rt2->rt_gateway->sa_family == AF_LINK
|
|
&& rt2->rt_ifp == rt->rt_ifp) {
|
|
ret = rt2->rt_nodes;
|
|
}
|
|
RTFREE_LOCKED(rt2);
|
|
}
|
|
}
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* This code is the inverse of in6_clsroute: on first reference, if we
|
|
* were managing the route, stop doing so and set the expiration timer
|
|
* back off again.
|
|
*/
|
|
static struct radix_node *
|
|
in6_matroute(void *v_arg, struct radix_node_head *head)
|
|
{
|
|
struct radix_node *rn = rn_match(v_arg, head);
|
|
struct rtentry *rt = (struct rtentry *)rn;
|
|
|
|
if (rt && rt->rt_refcnt == 0) { /* this is first reference */
|
|
if (rt->rt_flags & RTPRF_OURS) {
|
|
rt->rt_flags &= ~RTPRF_OURS;
|
|
rt->rt_rmx.rmx_expire = 0;
|
|
}
|
|
}
|
|
return rn;
|
|
}
|
|
|
|
SYSCTL_DECL(_net_inet6_ip6);
|
|
|
|
static int rtq_reallyold = 60*60;
|
|
/* one hour is ``really old'' */
|
|
SYSCTL_INT(_net_inet6_ip6, IPV6CTL_RTEXPIRE, rtexpire,
|
|
CTLFLAG_RW, &rtq_reallyold , 0, "");
|
|
|
|
static int rtq_minreallyold = 10;
|
|
/* never automatically crank down to less */
|
|
SYSCTL_INT(_net_inet6_ip6, IPV6CTL_RTMINEXPIRE, rtminexpire,
|
|
CTLFLAG_RW, &rtq_minreallyold , 0, "");
|
|
|
|
static int rtq_toomany = 128;
|
|
/* 128 cached routes is ``too many'' */
|
|
SYSCTL_INT(_net_inet6_ip6, IPV6CTL_RTMAXCACHE, rtmaxcache,
|
|
CTLFLAG_RW, &rtq_toomany , 0, "");
|
|
|
|
|
|
/*
|
|
* On last reference drop, mark the route as belong to us so that it can be
|
|
* timed out.
|
|
*/
|
|
static void
|
|
in6_clsroute(struct radix_node *rn, struct radix_node_head *head)
|
|
{
|
|
struct rtentry *rt = (struct rtentry *)rn;
|
|
|
|
RT_LOCK_ASSERT(rt);
|
|
|
|
if (!(rt->rt_flags & RTF_UP))
|
|
return; /* prophylactic measures */
|
|
|
|
if ((rt->rt_flags & (RTF_LLINFO | RTF_HOST)) != RTF_HOST)
|
|
return;
|
|
|
|
if ((rt->rt_flags & (RTF_WASCLONED | RTPRF_OURS)) != RTF_WASCLONED)
|
|
return;
|
|
|
|
/*
|
|
* As requested by David Greenman:
|
|
* If rtq_reallyold is 0, just delete the route without
|
|
* waiting for a timeout cycle to kill it.
|
|
*/
|
|
if (rtq_reallyold != 0) {
|
|
rt->rt_flags |= RTPRF_OURS;
|
|
rt->rt_rmx.rmx_expire = time_uptime + rtq_reallyold;
|
|
} else {
|
|
rtexpunge(rt);
|
|
}
|
|
}
|
|
|
|
struct rtqk_arg {
|
|
struct radix_node_head *rnh;
|
|
int mode;
|
|
int updating;
|
|
int draining;
|
|
int killed;
|
|
int found;
|
|
time_t nextstop;
|
|
};
|
|
|
|
/*
|
|
* Get rid of old routes. When draining, this deletes everything, even when
|
|
* the timeout is not expired yet. When updating, this makes sure that
|
|
* nothing has a timeout longer than the current value of rtq_reallyold.
|
|
*/
|
|
static int
|
|
in6_rtqkill(struct radix_node *rn, void *rock)
|
|
{
|
|
struct rtqk_arg *ap = rock;
|
|
struct rtentry *rt = (struct rtentry *)rn;
|
|
int err;
|
|
|
|
if (rt->rt_flags & RTPRF_OURS) {
|
|
ap->found++;
|
|
|
|
if (ap->draining || rt->rt_rmx.rmx_expire <= time_uptime) {
|
|
if (rt->rt_refcnt > 0)
|
|
panic("rtqkill route really not free");
|
|
|
|
err = rtrequest(RTM_DELETE,
|
|
(struct sockaddr *)rt_key(rt),
|
|
rt->rt_gateway, rt_mask(rt),
|
|
rt->rt_flags, 0);
|
|
if (err) {
|
|
log(LOG_WARNING, "in6_rtqkill: error %d", err);
|
|
} else {
|
|
ap->killed++;
|
|
}
|
|
} else {
|
|
if (ap->updating
|
|
&& (rt->rt_rmx.rmx_expire - time_uptime
|
|
> rtq_reallyold)) {
|
|
rt->rt_rmx.rmx_expire = time_uptime
|
|
+ rtq_reallyold;
|
|
}
|
|
ap->nextstop = lmin(ap->nextstop,
|
|
rt->rt_rmx.rmx_expire);
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
#define RTQ_TIMEOUT 60*10 /* run no less than once every ten minutes */
|
|
static int rtq_timeout = RTQ_TIMEOUT;
|
|
static struct callout rtq_timer;
|
|
|
|
static void
|
|
in6_rtqtimo(void *rock)
|
|
{
|
|
struct radix_node_head *rnh = rock;
|
|
struct rtqk_arg arg;
|
|
struct timeval atv;
|
|
static time_t last_adjusted_timeout = 0;
|
|
|
|
arg.found = arg.killed = 0;
|
|
arg.rnh = rnh;
|
|
arg.nextstop = time_uptime + rtq_timeout;
|
|
arg.draining = arg.updating = 0;
|
|
RADIX_NODE_HEAD_LOCK(rnh);
|
|
rnh->rnh_walktree(rnh, in6_rtqkill, &arg);
|
|
RADIX_NODE_HEAD_UNLOCK(rnh);
|
|
|
|
/*
|
|
* Attempt to be somewhat dynamic about this:
|
|
* If there are ``too many'' routes sitting around taking up space,
|
|
* then crank down the timeout, and see if we can't make some more
|
|
* go away. However, we make sure that we will never adjust more
|
|
* than once in rtq_timeout seconds, to keep from cranking down too
|
|
* hard.
|
|
*/
|
|
if ((arg.found - arg.killed > rtq_toomany)
|
|
&& (time_uptime - last_adjusted_timeout >= rtq_timeout)
|
|
&& rtq_reallyold > rtq_minreallyold) {
|
|
rtq_reallyold = 2*rtq_reallyold / 3;
|
|
if (rtq_reallyold < rtq_minreallyold) {
|
|
rtq_reallyold = rtq_minreallyold;
|
|
}
|
|
|
|
last_adjusted_timeout = time_uptime;
|
|
#ifdef DIAGNOSTIC
|
|
log(LOG_DEBUG, "in6_rtqtimo: adjusted rtq_reallyold to %d",
|
|
rtq_reallyold);
|
|
#endif
|
|
arg.found = arg.killed = 0;
|
|
arg.updating = 1;
|
|
RADIX_NODE_HEAD_LOCK(rnh);
|
|
rnh->rnh_walktree(rnh, in6_rtqkill, &arg);
|
|
RADIX_NODE_HEAD_UNLOCK(rnh);
|
|
}
|
|
|
|
atv.tv_usec = 0;
|
|
atv.tv_sec = arg.nextstop - time_uptime;
|
|
callout_reset(&rtq_timer, tvtohz(&atv), in6_rtqtimo, rock);
|
|
}
|
|
|
|
/*
|
|
* Age old PMTUs.
|
|
*/
|
|
struct mtuex_arg {
|
|
struct radix_node_head *rnh;
|
|
time_t nextstop;
|
|
};
|
|
static struct callout rtq_mtutimer;
|
|
|
|
static int
|
|
in6_mtuexpire(struct radix_node *rn, void *rock)
|
|
{
|
|
struct rtentry *rt = (struct rtentry *)rn;
|
|
struct mtuex_arg *ap = rock;
|
|
|
|
/* sanity */
|
|
if (!rt)
|
|
panic("rt == NULL in in6_mtuexpire");
|
|
|
|
if (rt->rt_rmx.rmx_expire && !(rt->rt_flags & RTF_PROBEMTU)) {
|
|
if (rt->rt_rmx.rmx_expire <= time_uptime) {
|
|
rt->rt_flags |= RTF_PROBEMTU;
|
|
} else {
|
|
ap->nextstop = lmin(ap->nextstop,
|
|
rt->rt_rmx.rmx_expire);
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
#define MTUTIMO_DEFAULT (60*1)
|
|
|
|
static void
|
|
in6_mtutimo(void *rock)
|
|
{
|
|
struct radix_node_head *rnh = rock;
|
|
struct mtuex_arg arg;
|
|
struct timeval atv;
|
|
|
|
arg.rnh = rnh;
|
|
arg.nextstop = time_uptime + MTUTIMO_DEFAULT;
|
|
RADIX_NODE_HEAD_LOCK(rnh);
|
|
rnh->rnh_walktree(rnh, in6_mtuexpire, &arg);
|
|
RADIX_NODE_HEAD_UNLOCK(rnh);
|
|
|
|
atv.tv_usec = 0;
|
|
atv.tv_sec = arg.nextstop - time_uptime;
|
|
if (atv.tv_sec < 0) {
|
|
printf("invalid mtu expiration time on routing table\n");
|
|
arg.nextstop = time_uptime + 30; /* last resort */
|
|
atv.tv_sec = 30;
|
|
}
|
|
callout_reset(&rtq_mtutimer, tvtohz(&atv), in6_mtutimo, rock);
|
|
}
|
|
|
|
#if 0
|
|
void
|
|
in6_rtqdrain(void)
|
|
{
|
|
struct radix_node_head *rnh = rt_tables[AF_INET6];
|
|
struct rtqk_arg arg;
|
|
|
|
arg.found = arg.killed = 0;
|
|
arg.rnh = rnh;
|
|
arg.nextstop = 0;
|
|
arg.draining = 1;
|
|
arg.updating = 0;
|
|
RADIX_NODE_HEAD_LOCK(rnh);
|
|
rnh->rnh_walktree(rnh, in6_rtqkill, &arg);
|
|
RADIX_NODE_HEAD_UNLOCK(rnh);
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* Initialize our routing tree.
|
|
* XXX MRT When off == 0, we are being called from vfs_export.c
|
|
* so just set up their table and leave. (we know what the correct
|
|
* value should be so just use that).. FIX AFTER RELENG_7 is MFC'd
|
|
* see also comments in in_inithead() vfs_export.c and domain.h
|
|
*/
|
|
int
|
|
in6_inithead(void **head, int off)
|
|
{
|
|
struct radix_node_head *rnh;
|
|
|
|
if (!rn_inithead(head, offsetof(struct sockaddr_in6, sin6_addr) << 3))
|
|
return 0; /* See above */
|
|
|
|
if (off == 0) /* See above */
|
|
return 1; /* only do the rest for the real thing */
|
|
|
|
rnh = *head;
|
|
rnh->rnh_addaddr = in6_addroute;
|
|
rnh->rnh_matchaddr = in6_matroute;
|
|
rnh->rnh_close = in6_clsroute;
|
|
callout_init(&rtq_timer, CALLOUT_MPSAFE);
|
|
in6_rtqtimo(rnh); /* kick off timeout first time */
|
|
callout_init(&rtq_mtutimer, CALLOUT_MPSAFE);
|
|
in6_mtutimo(rnh); /* kick off timeout first time */
|
|
return 1;
|
|
}
|