2 * Copyright 1994, 1995 Massachusetts Institute of Technology
4 * Permission to use, copy, modify, and distribute this software and
5 * its documentation for any purpose and without fee is hereby
6 * granted, provided that both the above copyright notice and this
7 * permission notice appear in all copies, that both the above
8 * copyright notice and this permission notice appear in all
9 * supporting documentation, and that the name of M.I.T. not be used
10 * in advertising or publicity pertaining to distribution of the
11 * software without specific, written prior permission. M.I.T. makes
12 * no representations about the suitability of this software for any
13 * purpose. It is provided "as is" without express or implied
16 * THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''. M.I.T. DISCLAIMS
17 * ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE,
18 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
19 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT
20 * SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
23 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
24 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
25 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
26 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * $FreeBSD: src/sys/netinet/in_rmx.c,v 1.37.2.3 2002/08/09 14:49:23 ru Exp $
30 * $DragonFly: src/sys/netinet/in_rmx.c,v 1.14 2006/04/11 06:59:34 dillon Exp $
34 * This code does two things necessary for the enhanced TCP metrics to
35 * function in a useful manner:
36 * 1) It marks all non-host routes as `cloning', thus ensuring that
37 * every actual reference to such a route actually gets turned
38 * into a reference to a host route to the specific destination
40 * 2) When such routes lose all their references, it arranges for them
41 * to be deleted in some random collection of circumstances, so that
42 * a large quantity of stale routing data is not kept in kernel memory
43 * indefinitely. See in_rtqtimo() below for the exact mechanism.
48 #include <sys/param.h>
49 #include <sys/systm.h>
50 #include <sys/kernel.h>
51 #include <sys/sysctl.h>
52 #include <sys/socket.h>
54 #include <sys/syslog.h>
55 #include <sys/globaldata.h>
56 #include <sys/thread2.h>
59 #include <net/route.h>
60 #include <net/if_var.h>
62 #include <net/if_types.h>
64 #include <net/netmsg2.h>
65 #include <net/netisr2.h>
66 #include <netinet/in.h>
67 #include <netinet/in_var.h>
68 #include <netinet/ip_var.h>
69 #include <netinet/ip_flow.h>
71 #define RTPRF_EXPIRING RTF_PROTO3 /* set on routes we manage */
73 static struct callout in_rtqtimo_ch[MAXCPU];
76 * Do what we need to do when inserting a route.
78 static struct radix_node *
79 in_addroute(char *key, char *mask, struct radix_node_head *head,
80 struct radix_node *treenodes)
82 struct rtentry *rt = (struct rtentry *)treenodes;
83 struct sockaddr_in *sin = (struct sockaddr_in *)rt_key(rt);
84 struct radix_node *ret;
85 struct in_ifaddr_container *iac;
89 * For IP, mark routes to multicast addresses as such, because
90 * it's easy to do and might be useful (but this is much more
91 * dubious since it's so easy to inspect the address).
93 * For IP, all unicast non-host routes are automatically cloning.
95 if (IN_MULTICAST(ntohl(sin->sin_addr.s_addr)))
96 rt->rt_flags |= RTF_MULTICAST;
98 if (!(rt->rt_flags & (RTF_HOST | RTF_CLONING | RTF_MULTICAST)))
99 rt->rt_flags |= RTF_PRCLONING;
102 * For host routes, we make sure that RTF_BROADCAST
103 * is set for anything that looks like a broadcast address.
104 * This way, we can avoid an expensive call to in_broadcast()
105 * in ip_output() most of the time (because the route passed
106 * to ip_output() is almost always a host route).
108 * For local routes we set RTF_LOCAL allowing various shortcuts.
110 * A cloned network route will point to one of several possible
111 * addresses if an interface has aliases and must be repointed
112 * back to the correct address or arp_rtrequest() will not properly
113 * detect the local ip.
115 if (rt->rt_flags & RTF_HOST) {
116 if (in_broadcast(sin->sin_addr, rt->rt_ifp)) {
117 rt->rt_flags |= RTF_BROADCAST;
118 } else if (satosin(rt->rt_ifa->ifa_addr)->sin_addr.s_addr ==
119 sin->sin_addr.s_addr) {
120 rt->rt_flags |= RTF_LOCAL;
122 LIST_FOREACH(iac, INADDR_HASH(sin->sin_addr.s_addr),
125 if (sin->sin_addr.s_addr ==
126 ia->ia_addr.sin_addr.s_addr) {
127 rt->rt_flags |= RTF_LOCAL;
130 rt->rt_ifa = &ia->ia_ifa;
131 rt->rt_ifp = rt->rt_ifa->ifa_ifp;
138 if (rt->rt_rmx.rmx_mtu != 0 && !(rt->rt_rmx.rmx_locks & RTV_MTU) &&
140 rt->rt_rmx.rmx_mtu = rt->rt_ifp->if_mtu;
142 ret = rn_addroute(key, mask, head, treenodes);
143 if (ret == NULL && (rt->rt_flags & RTF_HOST)) {
144 struct rtentry *oldrt;
147 * We are trying to add a host route, but can't.
148 * Find out if it is because of an ARP entry and
151 oldrt = rtpurelookup((struct sockaddr *)sin);
154 if ((oldrt->rt_flags & RTF_LLINFO) &&
155 (oldrt->rt_flags & RTF_HOST) &&
157 oldrt->rt_gateway->sa_family == AF_LINK) {
158 rtrequest(RTM_DELETE, rt_key(oldrt),
159 oldrt->rt_gateway, rt_mask(oldrt),
160 oldrt->rt_flags, NULL);
161 ret = rn_addroute(key, mask, head, treenodes);
167 * If the new route has been created successfully, and it is
168 * not a multicast/broadcast or cloned route, then we will
169 * have to flush the ipflow. Otherwise, we may end up using
174 (RTF_MULTICAST | RTF_BROADCAST | RTF_WASCLONED)) == 0) {
175 ipflow_flush_oncpu();
181 * This code is the inverse of in_closeroute: on first reference, if we
182 * were managing the route, stop doing so and set the expiration timer
185 static struct radix_node *
186 in_matchroute(char *key, struct radix_node_head *head)
188 struct radix_node *rn = rn_match(key, head);
189 struct rtentry *rt = (struct rtentry *)rn;
191 if (rt != NULL && rt->rt_refcnt == 0) { /* this is first reference */
192 if (rt->rt_flags & RTPRF_EXPIRING) {
193 rt->rt_flags &= ~RTPRF_EXPIRING;
194 rt->rt_rmx.rmx_expire = 0;
200 static int rtq_reallyold = 60*60; /* one hour is ``really old'' */
201 SYSCTL_INT(_net_inet_ip, IPCTL_RTEXPIRE, rtexpire, CTLFLAG_RW,
203 "Default expiration time on cloned routes");
205 static int rtq_minreallyold = 10; /* never automatically crank down to less */
206 SYSCTL_INT(_net_inet_ip, IPCTL_RTMINEXPIRE, rtminexpire, CTLFLAG_RW,
207 &rtq_minreallyold , 0,
208 "Minimum time to attempt to hold onto cloned routes");
210 static int rtq_toomany = 128; /* 128 cached routes is ``too many'' */
211 SYSCTL_INT(_net_inet_ip, IPCTL_RTMAXCACHE, rtmaxcache, CTLFLAG_RW,
212 &rtq_toomany , 0, "Upper limit on cloned routes");
215 * On last reference drop, mark the route as belong to us so that it can be
219 in_closeroute(struct radix_node *rn, struct radix_node_head *head)
221 struct rtentry *rt = (struct rtentry *)rn;
223 if (!(rt->rt_flags & RTF_UP))
224 return; /* prophylactic measures */
226 if ((rt->rt_flags & (RTF_LLINFO | RTF_HOST)) != RTF_HOST)
229 if ((rt->rt_flags & (RTF_WASCLONED | RTPRF_EXPIRING)) != RTF_WASCLONED)
233 * As requested by David Greenman:
234 * If rtq_reallyold is 0, just delete the route without
235 * waiting for a timeout cycle to kill it.
237 if (rtq_reallyold != 0) {
238 rt->rt_flags |= RTPRF_EXPIRING;
239 rt->rt_rmx.rmx_expire = time_second + rtq_reallyold;
242 * Remove route from the radix tree, but defer deallocation
243 * until we return to rtfree().
245 rtrequest(RTM_DELETE, rt_key(rt), rt->rt_gateway, rt_mask(rt),
251 struct radix_node_head *rnh;
260 * Get rid of old routes. When draining, this deletes everything, even when
261 * the timeout is not expired yet. When updating, this makes sure that
262 * nothing has a timeout longer than the current value of rtq_reallyold.
265 in_rtqkill(struct radix_node *rn, void *rock)
267 struct rtqk_arg *ap = rock;
268 struct rtentry *rt = (struct rtentry *)rn;
271 if (rt->rt_flags & RTPRF_EXPIRING) {
273 if (ap->draining || rt->rt_rmx.rmx_expire <= time_second) {
274 if (rt->rt_refcnt > 0)
275 panic("rtqkill route really not free");
277 err = rtrequest(RTM_DELETE, rt_key(rt), rt->rt_gateway,
278 rt_mask(rt), rt->rt_flags, NULL);
280 log(LOG_WARNING, "in_rtqkill: error %d\n", err);
285 (rt->rt_rmx.rmx_expire - time_second >
287 rt->rt_rmx.rmx_expire = time_second +
290 ap->nextstop = lmin(ap->nextstop,
291 rt->rt_rmx.rmx_expire);
298 #define RTQ_TIMEOUT 60*10 /* run no less than once every ten minutes */
299 static int rtq_timeout = RTQ_TIMEOUT;
302 in_rtqtimo(void *rock)
304 struct radix_node_head *rnh = rock;
307 static time_t last_adjusted_timeout = 0;
309 arg.found = arg.killed = 0;
311 arg.nextstop = time_second + rtq_timeout;
312 arg.draining = arg.updating = 0;
314 rnh->rnh_walktree(rnh, in_rtqkill, &arg);
318 * Attempt to be somewhat dynamic about this:
319 * If there are ``too many'' routes sitting around taking up space,
320 * then crank down the timeout, and see if we can't make some more
321 * go away. However, we make sure that we will never adjust more
322 * than once in rtq_timeout seconds, to keep from cranking down too
325 if ((arg.found - arg.killed > rtq_toomany) &&
326 (time_second - last_adjusted_timeout >= rtq_timeout) &&
327 rtq_reallyold > rtq_minreallyold) {
328 rtq_reallyold = 2*rtq_reallyold / 3;
329 if (rtq_reallyold < rtq_minreallyold) {
330 rtq_reallyold = rtq_minreallyold;
333 last_adjusted_timeout = time_second;
335 log(LOG_DEBUG, "in_rtqtimo: adjusted rtq_reallyold to %d\n",
338 arg.found = arg.killed = 0;
341 rnh->rnh_walktree(rnh, in_rtqkill, &arg);
346 atv.tv_sec = arg.nextstop - time_second;
347 callout_reset(&in_rtqtimo_ch[mycpuid], tvtohz_high(&atv), in_rtqtimo,
354 struct radix_node_head *rnh = rt_tables[mycpuid][AF_INET];
357 arg.found = arg.killed = 0;
363 rnh->rnh_walktree(rnh, in_rtqkill, &arg);
368 * Initialize our routing tree.
371 in_inithead(void **head, int off)
373 struct radix_node_head *rnh;
375 if (!rn_inithead(head, rn_cpumaskhead(mycpuid), off))
378 if (head != (void **)&rt_tables[mycpuid][AF_INET]) /* BOGUS! */
379 return 1; /* only do this for the real routing table */
382 rnh->rnh_addaddr = in_addroute;
383 rnh->rnh_matchaddr = in_matchroute;
384 rnh->rnh_close = in_closeroute;
385 callout_init(&in_rtqtimo_ch[mycpuid]);
386 in_rtqtimo(rnh); /* kick off timeout first time */
391 * This zaps old routes when the interface goes down or interface
392 * address is deleted. In the latter case, it deletes static routes
393 * that point to this address. If we don't do this, we may end up
394 * using the old address in the future. The ones we always want to
395 * get rid of are things like ARP entries, since the user might down
396 * the interface, walk over to a completely different network, and
399 * in_ifadown() is typically called when an interface is being brought
400 * down. We must iterate through all per-cpu route tables and clean
403 struct in_ifadown_arg {
404 struct radix_node_head *rnh;
410 in_ifadownkill(struct radix_node *rn, void *xap)
412 struct in_ifadown_arg *ap = xap;
413 struct rtentry *rt = (struct rtentry *)rn;
416 if (rt->rt_ifa == ap->ifa &&
417 (ap->del || !(rt->rt_flags & RTF_STATIC))) {
419 * We need to disable the automatic prune that happens
420 * in this case in rtrequest() because it will blow
421 * away the pointers that rn_walktree() needs in order
422 * continue our descent. We will end up deleting all
423 * the routes that rtrequest() would have in any case,
424 * so that behavior is not needed there.
426 rt->rt_flags &= ~(RTF_CLONING | RTF_PRCLONING);
427 err = rtrequest(RTM_DELETE, rt_key(rt), rt->rt_gateway,
428 rt_mask(rt), rt->rt_flags, NULL);
430 log(LOG_WARNING, "in_ifadownkill: error %d\n", err);
435 struct netmsg_ifadown {
436 struct netmsg_base base;
442 in_ifadown_dispatch(netmsg_t msg)
444 struct netmsg_ifadown *rmsg = (void *)msg;
445 struct radix_node_head *rnh;
446 struct ifaddr *ifa = rmsg->ifa;
447 struct in_ifadown_arg arg;
452 arg.rnh = rnh = rt_tables[cpu][AF_INET];
455 rnh->rnh_walktree(rnh, in_ifadownkill, &arg);
456 ifa->ifa_flags &= ~IFA_ROUTE;
460 lwkt_forwardmsg(netisr_cpuport(nextcpu), &rmsg->base.lmsg);
462 lwkt_replymsg(&rmsg->base.lmsg, 0);
466 in_ifadown_force(struct ifaddr *ifa, int delete)
468 struct netmsg_ifadown msg;
470 if (ifa->ifa_addr->sa_family != AF_INET)
474 * XXX individual requests are not independantly chained,
475 * which means that the per-cpu route tables will not be
476 * consistent in the middle of the operation. If routes
477 * related to the interface are manipulated while we are
478 * doing this the inconsistancy could trigger a panic.
480 netmsg_init(&msg.base, NULL, &curthread->td_msgport, 0,
481 in_ifadown_dispatch);
484 rt_domsg_global(&msg.base);
490 in_ifadown(struct ifaddr *ifa, int delete)
493 if (ifa->ifa_ifp->if_type == IFT_CARP)
496 return in_ifadown_force(ifa, delete);