2 * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. Neither the name of the project nor the names of its contributors
14 * may be used to endorse or promote products derived from this software
15 * without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * $KAME: in6_rmx.c,v 1.11 2001/07/26 06:53:16 jinmei Exp $
33 * Copyright 1994, 1995 Massachusetts Institute of Technology
35 * Permission to use, copy, modify, and distribute this software and
36 * its documentation for any purpose and without fee is hereby
37 * granted, provided that both the above copyright notice and this
38 * permission notice appear in all copies, that both the above
39 * copyright notice and this permission notice appear in all
40 * supporting documentation, and that the name of M.I.T. not be used
41 * in advertising or publicity pertaining to distribution of the
42 * software without specific, written prior permission. M.I.T. makes
43 * no representations about the suitability of this software for any
44 * purpose. It is provided "as is" without express or implied
47 * THIS SOFTWARE IS PROVIDED BY M.I.T. ``AS IS''. M.I.T. DISCLAIMS
48 * ALL EXPRESS OR IMPLIED WARRANTIES WITH REGARD TO THIS SOFTWARE,
49 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
50 * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT
51 * SHALL M.I.T. BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
52 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
53 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
54 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
55 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
56 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
57 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
62 #include <sys/cdefs.h>
63 __FBSDID("$FreeBSD$");
65 #include <sys/param.h>
66 #include <sys/systm.h>
67 #include <sys/kernel.h>
69 #include <sys/queue.h>
70 #include <sys/socket.h>
71 #include <sys/socketvar.h>
73 #include <sys/rwlock.h>
74 #include <sys/syslog.h>
75 #include <sys/callout.h>
78 #include <net/if_var.h>
79 #include <net/route.h>
80 #include <net/route_var.h>
82 #include <netinet/in.h>
83 #include <netinet/ip_var.h>
84 #include <netinet/in_var.h>
86 #include <netinet/ip6.h>
87 #include <netinet6/ip6_var.h>
89 #include <netinet/icmp6.h>
90 #include <netinet6/nd6.h>
92 #include <netinet/tcp.h>
93 #include <netinet/tcp_seq.h>
94 #include <netinet/tcp_timer.h>
95 #include <netinet/tcp_var.h>
97 extern int in6_inithead(void **head, int off);
99 extern int in6_detachhead(void **head, int off);
103 * Do what we need to do when inserting a route.
105 static struct radix_node *
106 in6_addroute(void *v_arg, void *n_arg, struct radix_head *head,
107 struct radix_node *treenodes)
109 struct rtentry *rt = (struct rtentry *)treenodes;
110 struct sockaddr_in6 *sin6 = (struct sockaddr_in6 *)rt_key(rt);
112 if (IN6_IS_ADDR_MULTICAST(&sin6->sin6_addr))
113 rt->rt_flags |= RTF_MULTICAST;
116 * A little bit of help for both IPv6 output and input:
117 * For local addresses, we make sure that RTF_LOCAL is set,
118 * with the thought that this might one day be used to speed up
121 * We also mark routes to multicast addresses as such, because
122 * it's easy to do and might be useful (but this is much more
123 * dubious since it's so easy to inspect the address). (This
127 * should elaborate the code.
129 if (rt->rt_flags & RTF_HOST) {
130 if (IN6_ARE_ADDR_EQUAL(&satosin6(rt->rt_ifa->ifa_addr)
133 rt->rt_flags |= RTF_LOCAL;
137 if (rt->rt_ifp != NULL) {
141 * inherit interface MTU if not set or
142 * check if MTU is too large.
144 if (rt->rt_mtu == 0) {
145 rt->rt_mtu = IN6_LINKMTU(rt->rt_ifp);
146 } else if (rt->rt_mtu > IN6_LINKMTU(rt->rt_ifp))
147 rt->rt_mtu = IN6_LINKMTU(rt->rt_ifp);
150 return (rn_addroute(v_arg, n_arg, head, treenodes));
157 struct rib_head *rnh;
160 static VNET_DEFINE(struct callout, rtq_mtutimer);
161 #define V_rtq_mtutimer VNET(rtq_mtutimer)
164 in6_mtuexpire(struct rtentry *rt, void *rock)
166 struct mtuex_arg *ap = rock;
168 if (rt->rt_expire && !(rt->rt_flags & RTF_PROBEMTU)) {
169 if (rt->rt_expire <= time_uptime) {
170 rt->rt_flags |= RTF_PROBEMTU;
172 ap->nextstop = lmin(ap->nextstop, rt->rt_expire);
179 #define MTUTIMO_DEFAULT (60*1)
182 in6_mtutimo_setwa(struct rib_head *rnh, uint32_t fibum, int af,
185 struct mtuex_arg *arg;
187 arg = (struct mtuex_arg *)_arg;
193 in6_mtutimo(void *rock)
195 CURVNET_SET_QUIET((struct vnet *) rock);
197 struct mtuex_arg arg;
199 rt_foreach_fib_walk(AF_INET6, in6_mtutimo_setwa, in6_mtuexpire, &arg);
201 atv.tv_sec = MTUTIMO_DEFAULT;
203 callout_reset(&V_rtq_mtutimer, tvtohz(&atv), in6_mtutimo, rock);
208 * Initialize our routing tree.
210 static VNET_DEFINE(int, _in6_rt_was_here);
211 #define V__in6_rt_was_here VNET(_in6_rt_was_here)
214 in6_inithead(void **head, int off)
218 rh = rt_table_init(offsetof(struct sockaddr_in6, sin6_addr) << 3);
222 rh->rnh_addaddr = in6_addroute;
225 if (V__in6_rt_was_here == 0) {
226 callout_init(&V_rtq_mtutimer, 1);
227 in6_mtutimo(curvnet); /* kick off timeout first time */
228 V__in6_rt_was_here = 1;
236 in6_detachhead(void **head, int off)
239 callout_drain(&V_rtq_mtutimer);
240 rt_table_destroy((struct rib_head *)(*head));
247 * Extended API for IPv6 FIB support.
250 in6_rtredirect(struct sockaddr *dst, struct sockaddr *gw, struct sockaddr *nm,
251 int flags, struct sockaddr *src, u_int fibnum)
254 rtredirect_fib(dst, gw, nm, flags, src, fibnum);
258 in6_rtrequest(int req, struct sockaddr *dst, struct sockaddr *gw,
259 struct sockaddr *mask, int flags, struct rtentry **ret_nrt, u_int fibnum)
262 return (rtrequest_fib(req, dst, gw, mask, flags, ret_nrt, fibnum));
266 in6_rtalloc(struct route_in6 *ro, u_int fibnum)
269 rtalloc_ign_fib((struct route *)ro, 0ul, fibnum);
273 in6_rtalloc_ign(struct route_in6 *ro, u_long ignflags, u_int fibnum)
276 rtalloc_ign_fib((struct route *)ro, ignflags, fibnum);
280 in6_rtalloc1(struct sockaddr *dst, int report, u_long ignflags, u_int fibnum)
283 return (rtalloc1_fib(dst, report, ignflags, fibnum));