route.c revision 1.178 1 1.178 ozaki /* $NetBSD: route.c,v 1.178 2016/10/21 10:52:47 ozaki-r Exp $ */
2 1.18 kml
3 1.18 kml /*-
4 1.106 ad * Copyright (c) 1998, 2008 The NetBSD Foundation, Inc.
5 1.18 kml * All rights reserved.
6 1.18 kml *
7 1.18 kml * This code is derived from software contributed to The NetBSD Foundation
8 1.18 kml * by Kevin M. Lahey of the Numerical Aerospace Simulation Facility,
9 1.18 kml * NASA Ames Research Center.
10 1.18 kml *
11 1.18 kml * Redistribution and use in source and binary forms, with or without
12 1.18 kml * modification, are permitted provided that the following conditions
13 1.18 kml * are met:
14 1.18 kml * 1. Redistributions of source code must retain the above copyright
15 1.18 kml * notice, this list of conditions and the following disclaimer.
16 1.18 kml * 2. Redistributions in binary form must reproduce the above copyright
17 1.18 kml * notice, this list of conditions and the following disclaimer in the
18 1.18 kml * documentation and/or other materials provided with the distribution.
19 1.18 kml *
20 1.18 kml * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21 1.18 kml * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22 1.18 kml * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 1.18 kml * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24 1.18 kml * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 1.18 kml * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 1.18 kml * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 1.18 kml * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 1.18 kml * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 1.18 kml * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 1.18 kml * POSSIBILITY OF SUCH DAMAGE.
31 1.18 kml */
32 1.11 cgd
33 1.1 cgd /*
34 1.25 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
35 1.25 itojun * All rights reserved.
36 1.65 perry *
37 1.25 itojun * Redistribution and use in source and binary forms, with or without
38 1.25 itojun * modification, are permitted provided that the following conditions
39 1.25 itojun * are met:
40 1.25 itojun * 1. Redistributions of source code must retain the above copyright
41 1.25 itojun * notice, this list of conditions and the following disclaimer.
42 1.25 itojun * 2. Redistributions in binary form must reproduce the above copyright
43 1.25 itojun * notice, this list of conditions and the following disclaimer in the
44 1.25 itojun * documentation and/or other materials provided with the distribution.
45 1.25 itojun * 3. Neither the name of the project nor the names of its contributors
46 1.25 itojun * may be used to endorse or promote products derived from this software
47 1.25 itojun * without specific prior written permission.
48 1.65 perry *
49 1.25 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
50 1.25 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 1.25 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 1.25 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
53 1.25 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 1.25 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 1.25 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 1.25 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 1.25 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 1.25 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 1.25 itojun * SUCH DAMAGE.
60 1.25 itojun */
61 1.25 itojun
62 1.25 itojun /*
63 1.10 mycroft * Copyright (c) 1980, 1986, 1991, 1993
64 1.10 mycroft * The Regents of the University of California. All rights reserved.
65 1.1 cgd *
66 1.1 cgd * Redistribution and use in source and binary forms, with or without
67 1.1 cgd * modification, are permitted provided that the following conditions
68 1.1 cgd * are met:
69 1.1 cgd * 1. Redistributions of source code must retain the above copyright
70 1.1 cgd * notice, this list of conditions and the following disclaimer.
71 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
72 1.1 cgd * notice, this list of conditions and the following disclaimer in the
73 1.1 cgd * documentation and/or other materials provided with the distribution.
74 1.58 agc * 3. Neither the name of the University nor the names of its contributors
75 1.1 cgd * may be used to endorse or promote products derived from this software
76 1.1 cgd * without specific prior written permission.
77 1.1 cgd *
78 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
79 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
80 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
81 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
82 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
83 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
84 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
85 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
86 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
87 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
88 1.1 cgd * SUCH DAMAGE.
89 1.1 cgd *
90 1.17 christos * @(#)route.c 8.3 (Berkeley) 1/9/95
91 1.1 cgd */
92 1.50 lukem
93 1.149 pooka #ifdef _KERNEL_OPT
94 1.136 roy #include "opt_inet.h"
95 1.90 dyoung #include "opt_route.h"
96 1.175 ozaki #include "opt_net_mpsafe.h"
97 1.149 pooka #endif
98 1.90 dyoung
99 1.50 lukem #include <sys/cdefs.h>
100 1.178 ozaki __KERNEL_RCSID(0, "$NetBSD: route.c,v 1.178 2016/10/21 10:52:47 ozaki-r Exp $");
101 1.2 cgd
102 1.5 mycroft #include <sys/param.h>
103 1.140 ozaki #ifdef RTFLUSH_DEBUG
104 1.90 dyoung #include <sys/sysctl.h>
105 1.140 ozaki #endif
106 1.5 mycroft #include <sys/systm.h>
107 1.35 thorpej #include <sys/callout.h>
108 1.5 mycroft #include <sys/proc.h>
109 1.5 mycroft #include <sys/mbuf.h>
110 1.5 mycroft #include <sys/socket.h>
111 1.5 mycroft #include <sys/socketvar.h>
112 1.5 mycroft #include <sys/domain.h>
113 1.5 mycroft #include <sys/protosw.h>
114 1.18 kml #include <sys/kernel.h>
115 1.5 mycroft #include <sys/ioctl.h>
116 1.22 thorpej #include <sys/pool.h>
117 1.119 elad #include <sys/kauth.h>
118 1.170 ozaki #include <sys/workqueue.h>
119 1.1 cgd
120 1.5 mycroft #include <net/if.h>
121 1.114 dyoung #include <net/if_dl.h>
122 1.5 mycroft #include <net/route.h>
123 1.1 cgd
124 1.5 mycroft #include <netinet/in.h>
125 1.5 mycroft #include <netinet/in_var.h>
126 1.1 cgd
127 1.90 dyoung #ifdef RTFLUSH_DEBUG
128 1.90 dyoung #define rtcache_debug() __predict_false(_rtcache_debug)
129 1.90 dyoung #else /* RTFLUSH_DEBUG */
130 1.90 dyoung #define rtcache_debug() 0
131 1.90 dyoung #endif /* RTFLUSH_DEBUG */
132 1.5 mycroft
133 1.155 ozaki struct rtstat rtstat;
134 1.1 cgd
135 1.155 ozaki static int rttrash; /* routes not in table but not freed */
136 1.1 cgd
137 1.155 ozaki static struct pool rtentry_pool;
138 1.155 ozaki static struct pool rttimer_pool;
139 1.22 thorpej
140 1.155 ozaki static struct callout rt_timer_ch; /* callout for rt_timer_timer() */
141 1.177 ozaki static struct workqueue *rt_timer_wq;
142 1.177 ozaki static struct work rt_timer_wk;
143 1.177 ozaki
144 1.177 ozaki static void rt_timer_init(void);
145 1.177 ozaki static void rt_timer_queue_remove_all(struct rttimer_queue *, int);
146 1.178 ozaki static void rt_timer_remove_all(struct rtentry *);
147 1.177 ozaki static void rt_timer_timer(void *);
148 1.35 thorpej
149 1.90 dyoung #ifdef RTFLUSH_DEBUG
150 1.90 dyoung static int _rtcache_debug = 0;
151 1.90 dyoung #endif /* RTFLUSH_DEBUG */
152 1.90 dyoung
153 1.119 elad static kauth_listener_t route_listener;
154 1.119 elad
155 1.60 matt static int rtdeletemsg(struct rtentry *);
156 1.144 ozaki static void rtflushall(int);
157 1.40 itojun
158 1.141 ozaki static void rt_maskedcopy(const struct sockaddr *,
159 1.141 ozaki struct sockaddr *, const struct sockaddr *);
160 1.141 ozaki
161 1.144 ozaki static void rtcache_clear(struct route *);
162 1.168 ozaki static void rtcache_clear_rtentry(int, struct rtentry *);
163 1.144 ozaki static void rtcache_invalidate(struct dom_rtlist *);
164 1.144 ozaki
165 1.162 ozaki #ifdef DDB
166 1.162 ozaki static void db_print_sa(const struct sockaddr *);
167 1.162 ozaki static void db_print_ifa(struct ifaddr *);
168 1.162 ozaki static int db_show_rtentry(struct rtentry *, void *);
169 1.162 ozaki #endif
170 1.162 ozaki
171 1.90 dyoung #ifdef RTFLUSH_DEBUG
172 1.118 pooka static void sysctl_net_rtcache_setup(struct sysctllog **);
173 1.118 pooka static void
174 1.118 pooka sysctl_net_rtcache_setup(struct sysctllog **clog)
175 1.90 dyoung {
176 1.90 dyoung const struct sysctlnode *rnode;
177 1.90 dyoung
178 1.90 dyoung if (sysctl_createv(clog, 0, NULL, &rnode, CTLFLAG_PERMANENT,
179 1.90 dyoung CTLTYPE_NODE,
180 1.90 dyoung "rtcache", SYSCTL_DESCR("Route cache related settings"),
181 1.128 pooka NULL, 0, NULL, 0, CTL_NET, CTL_CREATE, CTL_EOL) != 0)
182 1.90 dyoung return;
183 1.90 dyoung if (sysctl_createv(clog, 0, &rnode, &rnode,
184 1.90 dyoung CTLFLAG_PERMANENT|CTLFLAG_READWRITE, CTLTYPE_INT,
185 1.90 dyoung "debug", SYSCTL_DESCR("Debug route caches"),
186 1.90 dyoung NULL, 0, &_rtcache_debug, 0, CTL_CREATE, CTL_EOL) != 0)
187 1.90 dyoung return;
188 1.90 dyoung }
189 1.90 dyoung #endif /* RTFLUSH_DEBUG */
190 1.90 dyoung
191 1.144 ozaki static inline void
192 1.144 ozaki rt_destroy(struct rtentry *rt)
193 1.144 ozaki {
194 1.144 ozaki if (rt->_rt_key != NULL)
195 1.144 ozaki sockaddr_free(rt->_rt_key);
196 1.144 ozaki if (rt->rt_gateway != NULL)
197 1.144 ozaki sockaddr_free(rt->rt_gateway);
198 1.144 ozaki if (rt_gettag(rt) != NULL)
199 1.144 ozaki sockaddr_free(rt_gettag(rt));
200 1.144 ozaki rt->_rt_key = rt->rt_gateway = rt->rt_tag = NULL;
201 1.144 ozaki }
202 1.144 ozaki
203 1.144 ozaki static inline const struct sockaddr *
204 1.144 ozaki rt_setkey(struct rtentry *rt, const struct sockaddr *key, int flags)
205 1.144 ozaki {
206 1.144 ozaki if (rt->_rt_key == key)
207 1.144 ozaki goto out;
208 1.144 ozaki
209 1.144 ozaki if (rt->_rt_key != NULL)
210 1.144 ozaki sockaddr_free(rt->_rt_key);
211 1.144 ozaki rt->_rt_key = sockaddr_dup(key, flags);
212 1.144 ozaki out:
213 1.144 ozaki rt->rt_nodes->rn_key = (const char *)rt->_rt_key;
214 1.144 ozaki return rt->_rt_key;
215 1.144 ozaki }
216 1.144 ozaki
217 1.81 joerg struct ifaddr *
218 1.81 joerg rt_get_ifa(struct rtentry *rt)
219 1.81 joerg {
220 1.81 joerg struct ifaddr *ifa;
221 1.81 joerg
222 1.81 joerg if ((ifa = rt->rt_ifa) == NULL)
223 1.81 joerg return ifa;
224 1.81 joerg else if (ifa->ifa_getifa == NULL)
225 1.81 joerg return ifa;
226 1.81 joerg #if 0
227 1.81 joerg else if (ifa->ifa_seqno != NULL && *ifa->ifa_seqno == rt->rt_ifa_seqno)
228 1.81 joerg return ifa;
229 1.81 joerg #endif
230 1.81 joerg else {
231 1.94 dyoung ifa = (*ifa->ifa_getifa)(ifa, rt_getkey(rt));
232 1.145 roy if (ifa == NULL)
233 1.145 roy return NULL;
234 1.81 joerg rt_replace_ifa(rt, ifa);
235 1.81 joerg return ifa;
236 1.81 joerg }
237 1.81 joerg }
238 1.81 joerg
239 1.80 joerg static void
240 1.80 joerg rt_set_ifa1(struct rtentry *rt, struct ifaddr *ifa)
241 1.80 joerg {
242 1.80 joerg rt->rt_ifa = ifa;
243 1.80 joerg if (ifa->ifa_seqno != NULL)
244 1.80 joerg rt->rt_ifa_seqno = *ifa->ifa_seqno;
245 1.80 joerg }
246 1.80 joerg
247 1.116 roy /*
248 1.116 roy * Is this route the connected route for the ifa?
249 1.116 roy */
250 1.116 roy static int
251 1.116 roy rt_ifa_connected(const struct rtentry *rt, const struct ifaddr *ifa)
252 1.116 roy {
253 1.116 roy const struct sockaddr *key, *dst, *odst;
254 1.116 roy struct sockaddr_storage maskeddst;
255 1.116 roy
256 1.116 roy key = rt_getkey(rt);
257 1.116 roy dst = rt->rt_flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
258 1.116 roy if (dst == NULL ||
259 1.116 roy dst->sa_family != key->sa_family ||
260 1.116 roy dst->sa_len != key->sa_len)
261 1.116 roy return 0;
262 1.116 roy if ((rt->rt_flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
263 1.116 roy odst = dst;
264 1.116 roy dst = (struct sockaddr *)&maskeddst;
265 1.116 roy rt_maskedcopy(odst, (struct sockaddr *)&maskeddst,
266 1.116 roy ifa->ifa_netmask);
267 1.116 roy }
268 1.116 roy return (memcmp(dst, key, dst->sa_len) == 0);
269 1.116 roy }
270 1.116 roy
271 1.80 joerg void
272 1.80 joerg rt_replace_ifa(struct rtentry *rt, struct ifaddr *ifa)
273 1.80 joerg {
274 1.116 roy if (rt->rt_ifa &&
275 1.116 roy rt->rt_ifa != ifa &&
276 1.116 roy rt->rt_ifa->ifa_flags & IFA_ROUTE &&
277 1.116 roy rt_ifa_connected(rt, rt->rt_ifa))
278 1.116 roy {
279 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
280 1.116 roy "replace deleted IFA_ROUTE\n",
281 1.116 roy (void *)rt->_rt_key, (void *)rt->rt_ifa);
282 1.116 roy rt->rt_ifa->ifa_flags &= ~IFA_ROUTE;
283 1.116 roy if (rt_ifa_connected(rt, ifa)) {
284 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
285 1.116 roy "replace added IFA_ROUTE\n",
286 1.116 roy (void *)rt->_rt_key, (void *)ifa);
287 1.116 roy ifa->ifa_flags |= IFA_ROUTE;
288 1.116 roy }
289 1.116 roy }
290 1.116 roy
291 1.133 rmind ifaref(ifa);
292 1.133 rmind ifafree(rt->rt_ifa);
293 1.80 joerg rt_set_ifa1(rt, ifa);
294 1.80 joerg }
295 1.80 joerg
296 1.80 joerg static void
297 1.80 joerg rt_set_ifa(struct rtentry *rt, struct ifaddr *ifa)
298 1.80 joerg {
299 1.133 rmind ifaref(ifa);
300 1.80 joerg rt_set_ifa1(rt, ifa);
301 1.80 joerg }
302 1.80 joerg
303 1.119 elad static int
304 1.119 elad route_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
305 1.119 elad void *arg0, void *arg1, void *arg2, void *arg3)
306 1.119 elad {
307 1.119 elad struct rt_msghdr *rtm;
308 1.119 elad int result;
309 1.119 elad
310 1.119 elad result = KAUTH_RESULT_DEFER;
311 1.119 elad rtm = arg1;
312 1.119 elad
313 1.120 elad if (action != KAUTH_NETWORK_ROUTE)
314 1.120 elad return result;
315 1.120 elad
316 1.119 elad if (rtm->rtm_type == RTM_GET)
317 1.119 elad result = KAUTH_RESULT_ALLOW;
318 1.119 elad
319 1.119 elad return result;
320 1.119 elad }
321 1.119 elad
322 1.9 mycroft void
323 1.124 matt rt_init(void)
324 1.1 cgd {
325 1.22 thorpej
326 1.118 pooka #ifdef RTFLUSH_DEBUG
327 1.118 pooka sysctl_net_rtcache_setup(NULL);
328 1.118 pooka #endif
329 1.118 pooka
330 1.113 pooka pool_init(&rtentry_pool, sizeof(struct rtentry), 0, 0, 0, "rtentpl",
331 1.113 pooka NULL, IPL_SOFTNET);
332 1.113 pooka pool_init(&rttimer_pool, sizeof(struct rttimer), 0, 0, 0, "rttmrpl",
333 1.113 pooka NULL, IPL_SOFTNET);
334 1.113 pooka
335 1.10 mycroft rn_init(); /* initialize all zeroes, all ones, mask table */
336 1.125 dyoung rtbl_init();
337 1.119 elad
338 1.119 elad route_listener = kauth_listen_scope(KAUTH_SCOPE_NETWORK,
339 1.119 elad route_listener_cb, NULL);
340 1.1 cgd }
341 1.1 cgd
342 1.144 ozaki static void
343 1.82 dyoung rtflushall(int family)
344 1.82 dyoung {
345 1.90 dyoung struct domain *dom;
346 1.90 dyoung
347 1.90 dyoung if (rtcache_debug())
348 1.90 dyoung printf("%s: enter\n", __func__);
349 1.90 dyoung
350 1.90 dyoung if ((dom = pffinddomain(family)) == NULL)
351 1.90 dyoung return;
352 1.82 dyoung
353 1.105 dyoung rtcache_invalidate(&dom->dom_rtcache);
354 1.82 dyoung }
355 1.82 dyoung
356 1.131 rmind static void
357 1.82 dyoung rtcache(struct route *ro)
358 1.82 dyoung {
359 1.90 dyoung struct domain *dom;
360 1.82 dyoung
361 1.114 dyoung rtcache_invariants(ro);
362 1.99 dyoung KASSERT(ro->_ro_rt != NULL);
363 1.105 dyoung KASSERT(ro->ro_invalid == false);
364 1.90 dyoung KASSERT(rtcache_getdst(ro) != NULL);
365 1.82 dyoung
366 1.90 dyoung if ((dom = pffinddomain(rtcache_getdst(ro)->sa_family)) == NULL)
367 1.90 dyoung return;
368 1.90 dyoung
369 1.90 dyoung LIST_INSERT_HEAD(&dom->dom_rtcache, ro, ro_rtcache_next);
370 1.114 dyoung rtcache_invariants(ro);
371 1.82 dyoung }
372 1.82 dyoung
373 1.158 ozaki #ifdef RT_DEBUG
374 1.158 ozaki static void
375 1.158 ozaki dump_rt(const struct rtentry *rt)
376 1.158 ozaki {
377 1.158 ozaki char buf[512];
378 1.158 ozaki
379 1.158 ozaki aprint_normal("rt: ");
380 1.158 ozaki aprint_normal("p=%p ", rt);
381 1.158 ozaki if (rt->_rt_key == NULL) {
382 1.158 ozaki aprint_normal("dst=(NULL) ");
383 1.158 ozaki } else {
384 1.158 ozaki sockaddr_format(rt->_rt_key, buf, sizeof(buf));
385 1.158 ozaki aprint_normal("dst=%s ", buf);
386 1.158 ozaki }
387 1.158 ozaki if (rt->rt_gateway == NULL) {
388 1.158 ozaki aprint_normal("gw=(NULL) ");
389 1.158 ozaki } else {
390 1.158 ozaki sockaddr_format(rt->_rt_key, buf, sizeof(buf));
391 1.158 ozaki aprint_normal("gw=%s ", buf);
392 1.158 ozaki }
393 1.158 ozaki aprint_normal("flags=%x ", rt->rt_flags);
394 1.158 ozaki if (rt->rt_ifp == NULL) {
395 1.158 ozaki aprint_normal("if=(NULL) ");
396 1.158 ozaki } else {
397 1.158 ozaki aprint_normal("if=%s ", rt->rt_ifp->if_xname);
398 1.158 ozaki }
399 1.158 ozaki aprint_normal("\n");
400 1.158 ozaki }
401 1.158 ozaki #endif /* RT_DEBUG */
402 1.158 ozaki
403 1.1 cgd /*
404 1.146 ozaki * Packet routing routines. If success, refcnt of a returned rtentry
405 1.146 ozaki * will be incremented. The caller has to rtfree it by itself.
406 1.1 cgd */
407 1.1 cgd struct rtentry *
408 1.60 matt rtalloc1(const struct sockaddr *dst, int report)
409 1.1 cgd {
410 1.158 ozaki rtbl_t *rtbl;
411 1.36 augustss struct rtentry *rt;
412 1.159 christos int s;
413 1.1 cgd
414 1.159 christos s = splsoftnet();
415 1.158 ozaki rtbl = rt_gettable(dst->sa_family);
416 1.159 christos if (rtbl == NULL)
417 1.158 ozaki goto miss;
418 1.158 ozaki
419 1.158 ozaki rt = rt_matchaddr(rtbl, dst);
420 1.159 christos if (rt == NULL)
421 1.158 ozaki goto miss;
422 1.159 christos
423 1.158 ozaki rt->rt_refcnt++;
424 1.158 ozaki
425 1.159 christos splx(s);
426 1.159 christos return rt;
427 1.158 ozaki miss:
428 1.159 christos rtstat.rts_unreach++;
429 1.158 ozaki if (report) {
430 1.159 christos struct rt_addrinfo info;
431 1.159 christos
432 1.160 christos memset(&info, 0, sizeof(info));
433 1.158 ozaki info.rti_info[RTAX_DST] = dst;
434 1.159 christos rt_missmsg(RTM_MISS, &info, 0, 0);
435 1.1 cgd }
436 1.1 cgd splx(s);
437 1.159 christos return NULL;
438 1.1 cgd }
439 1.1 cgd
440 1.175 ozaki #if defined(DEBUG) && !defined(NET_MPSAFE)
441 1.151 ozaki /*
442 1.151 ozaki * Check the following constraint for each rtcache:
443 1.151 ozaki * if a rtcache holds a rtentry, the rtentry's refcnt is more than zero,
444 1.151 ozaki * i.e., the rtentry should be referenced at least by the rtcache.
445 1.151 ozaki */
446 1.151 ozaki static void
447 1.151 ozaki rtcache_check_rtrefcnt(int family)
448 1.151 ozaki {
449 1.151 ozaki struct domain *dom = pffinddomain(family);
450 1.151 ozaki struct route *ro;
451 1.151 ozaki
452 1.151 ozaki if (dom == NULL)
453 1.151 ozaki return;
454 1.151 ozaki
455 1.151 ozaki LIST_FOREACH(ro, &dom->dom_rtcache, ro_rtcache_next)
456 1.151 ozaki KDASSERT(ro->_ro_rt == NULL || ro->_ro_rt->rt_refcnt > 0);
457 1.151 ozaki }
458 1.151 ozaki #endif
459 1.151 ozaki
460 1.9 mycroft void
461 1.60 matt rtfree(struct rtentry *rt)
462 1.1 cgd {
463 1.36 augustss struct ifaddr *ifa;
464 1.10 mycroft
465 1.132 rmind KASSERT(rt != NULL);
466 1.132 rmind KASSERT(rt->rt_refcnt > 0);
467 1.132 rmind
468 1.1 cgd rt->rt_refcnt--;
469 1.175 ozaki #if defined(DEBUG) && !defined(NET_MPSAFE)
470 1.151 ozaki if (rt_getkey(rt) != NULL)
471 1.151 ozaki rtcache_check_rtrefcnt(rt_getkey(rt)->sa_family);
472 1.151 ozaki #endif
473 1.132 rmind if (rt->rt_refcnt == 0 && (rt->rt_flags & RTF_UP) == 0) {
474 1.125 dyoung rt_assert_inactive(rt);
475 1.10 mycroft rttrash--;
476 1.178 ozaki rt_timer_remove_all(rt);
477 1.10 mycroft ifa = rt->rt_ifa;
478 1.78 dyoung rt->rt_ifa = NULL;
479 1.133 rmind ifafree(ifa);
480 1.78 dyoung rt->rt_ifp = NULL;
481 1.94 dyoung rt_destroy(rt);
482 1.22 thorpej pool_put(&rtentry_pool, rt);
483 1.1 cgd }
484 1.1 cgd }
485 1.1 cgd
486 1.1 cgd /*
487 1.1 cgd * Force a routing table entry to the specified
488 1.1 cgd * destination to go through the given gateway.
489 1.1 cgd * Normally called as a result of a routing redirect
490 1.1 cgd * message from the network layer.
491 1.1 cgd *
492 1.13 mycroft * N.B.: must be called at splsoftnet
493 1.1 cgd */
494 1.14 christos void
495 1.60 matt rtredirect(const struct sockaddr *dst, const struct sockaddr *gateway,
496 1.60 matt const struct sockaddr *netmask, int flags, const struct sockaddr *src,
497 1.60 matt struct rtentry **rtp)
498 1.1 cgd {
499 1.36 augustss struct rtentry *rt;
500 1.1 cgd int error = 0;
501 1.121 dyoung uint64_t *stat = NULL;
502 1.10 mycroft struct rt_addrinfo info;
503 1.10 mycroft struct ifaddr *ifa;
504 1.173 ozaki struct psref psref;
505 1.1 cgd
506 1.1 cgd /* verify the gateway is directly reachable */
507 1.173 ozaki if ((ifa = ifa_ifwithnet_psref(gateway, &psref)) == NULL) {
508 1.1 cgd error = ENETUNREACH;
509 1.8 cgd goto out;
510 1.1 cgd }
511 1.1 cgd rt = rtalloc1(dst, 0);
512 1.1 cgd /*
513 1.1 cgd * If the redirect isn't from our current router for this dst,
514 1.1 cgd * it's either old or wrong. If it redirects us to ourselves,
515 1.1 cgd * we have a routing loop, perhaps as a result of an interface
516 1.1 cgd * going down recently.
517 1.1 cgd */
518 1.10 mycroft if (!(flags & RTF_DONE) && rt &&
519 1.115 yamt (sockaddr_cmp(src, rt->rt_gateway) != 0 || rt->rt_ifa != ifa))
520 1.1 cgd error = EINVAL;
521 1.173 ozaki else {
522 1.173 ozaki int s = pserialize_read_enter();
523 1.173 ozaki struct ifaddr *_ifa;
524 1.173 ozaki
525 1.173 ozaki _ifa = ifa_ifwithaddr(gateway);
526 1.173 ozaki if (_ifa != NULL)
527 1.173 ozaki error = EHOSTUNREACH;
528 1.173 ozaki pserialize_read_exit(s);
529 1.173 ozaki }
530 1.1 cgd if (error)
531 1.1 cgd goto done;
532 1.1 cgd /*
533 1.1 cgd * Create a new entry if we just got back a wildcard entry
534 1.33 soren * or the lookup failed. This is necessary for hosts
535 1.1 cgd * which use routing redirects generated by smart gateways
536 1.1 cgd * to dynamically build the routing tables.
537 1.1 cgd */
538 1.95 dyoung if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
539 1.1 cgd goto create;
540 1.1 cgd /*
541 1.1 cgd * Don't listen to the redirect if it's
542 1.65 perry * for a route to an interface.
543 1.1 cgd */
544 1.1 cgd if (rt->rt_flags & RTF_GATEWAY) {
545 1.1 cgd if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
546 1.1 cgd /*
547 1.1 cgd * Changing from route to net => route to host.
548 1.1 cgd * Create new route, rather than smashing route to net.
549 1.1 cgd */
550 1.1 cgd create:
551 1.95 dyoung if (rt != NULL)
552 1.39 itojun rtfree(rt);
553 1.1 cgd flags |= RTF_GATEWAY | RTF_DYNAMIC;
554 1.122 kefren memset(&info, 0, sizeof(info));
555 1.39 itojun info.rti_info[RTAX_DST] = dst;
556 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
557 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
558 1.39 itojun info.rti_ifa = ifa;
559 1.39 itojun info.rti_flags = flags;
560 1.39 itojun rt = NULL;
561 1.39 itojun error = rtrequest1(RTM_ADD, &info, &rt);
562 1.39 itojun if (rt != NULL)
563 1.39 itojun flags = rt->rt_flags;
564 1.1 cgd stat = &rtstat.rts_dynamic;
565 1.1 cgd } else {
566 1.1 cgd /*
567 1.1 cgd * Smash the current notion of the gateway to
568 1.1 cgd * this destination. Should check about netmask!!!
569 1.1 cgd */
570 1.164 ozaki error = rt_setgate(rt, gateway);
571 1.164 ozaki if (error == 0) {
572 1.164 ozaki rt->rt_flags |= RTF_MODIFIED;
573 1.164 ozaki flags |= RTF_MODIFIED;
574 1.164 ozaki }
575 1.10 mycroft stat = &rtstat.rts_newgateway;
576 1.1 cgd }
577 1.1 cgd } else
578 1.1 cgd error = EHOSTUNREACH;
579 1.1 cgd done:
580 1.1 cgd if (rt) {
581 1.95 dyoung if (rtp != NULL && !error)
582 1.1 cgd *rtp = rt;
583 1.1 cgd else
584 1.1 cgd rtfree(rt);
585 1.1 cgd }
586 1.8 cgd out:
587 1.1 cgd if (error)
588 1.1 cgd rtstat.rts_badredirect++;
589 1.8 cgd else if (stat != NULL)
590 1.8 cgd (*stat)++;
591 1.95 dyoung memset(&info, 0, sizeof(info));
592 1.10 mycroft info.rti_info[RTAX_DST] = dst;
593 1.10 mycroft info.rti_info[RTAX_GATEWAY] = gateway;
594 1.10 mycroft info.rti_info[RTAX_NETMASK] = netmask;
595 1.10 mycroft info.rti_info[RTAX_AUTHOR] = src;
596 1.10 mycroft rt_missmsg(RTM_REDIRECT, &info, flags, error);
597 1.173 ozaki ifa_release(ifa, &psref);
598 1.1 cgd }
599 1.1 cgd
600 1.1 cgd /*
601 1.146 ozaki * Delete a route and generate a message.
602 1.146 ozaki * It doesn't free a passed rt.
603 1.40 itojun */
604 1.40 itojun static int
605 1.60 matt rtdeletemsg(struct rtentry *rt)
606 1.40 itojun {
607 1.40 itojun int error;
608 1.40 itojun struct rt_addrinfo info;
609 1.40 itojun
610 1.40 itojun /*
611 1.40 itojun * Request the new route so that the entry is not actually
612 1.40 itojun * deleted. That will allow the information being reported to
613 1.40 itojun * be accurate (and consistent with route_output()).
614 1.40 itojun */
615 1.95 dyoung memset(&info, 0, sizeof(info));
616 1.94 dyoung info.rti_info[RTAX_DST] = rt_getkey(rt);
617 1.40 itojun info.rti_info[RTAX_NETMASK] = rt_mask(rt);
618 1.40 itojun info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
619 1.40 itojun info.rti_flags = rt->rt_flags;
620 1.157 ozaki error = rtrequest1(RTM_DELETE, &info, NULL);
621 1.40 itojun
622 1.40 itojun rt_missmsg(RTM_DELETE, &info, info.rti_flags, error);
623 1.40 itojun
624 1.95 dyoung return error;
625 1.40 itojun }
626 1.40 itojun
627 1.1 cgd struct ifaddr *
628 1.173 ozaki ifa_ifwithroute_psref(int flags, const struct sockaddr *dst,
629 1.173 ozaki const struct sockaddr *gateway, struct psref *psref)
630 1.1 cgd {
631 1.173 ozaki struct ifaddr *ifa = NULL;
632 1.173 ozaki
633 1.1 cgd if ((flags & RTF_GATEWAY) == 0) {
634 1.1 cgd /*
635 1.1 cgd * If we are adding a route to an interface,
636 1.1 cgd * and the interface is a pt to pt link
637 1.1 cgd * we should search for the destination
638 1.1 cgd * as our clue to the interface. Otherwise
639 1.1 cgd * we can use the local address.
640 1.1 cgd */
641 1.127 christos if ((flags & RTF_HOST) && gateway->sa_family != AF_LINK)
642 1.173 ozaki ifa = ifa_ifwithdstaddr_psref(dst, psref);
643 1.68 christos if (ifa == NULL)
644 1.173 ozaki ifa = ifa_ifwithaddr_psref(gateway, psref);
645 1.1 cgd } else {
646 1.1 cgd /*
647 1.1 cgd * If we are adding a route to a remote net
648 1.1 cgd * or host, the gateway may still be on the
649 1.1 cgd * other end of a pt to pt link.
650 1.1 cgd */
651 1.173 ozaki ifa = ifa_ifwithdstaddr_psref(gateway, psref);
652 1.1 cgd }
653 1.68 christos if (ifa == NULL)
654 1.173 ozaki ifa = ifa_ifwithnet_psref(gateway, psref);
655 1.68 christos if (ifa == NULL) {
656 1.173 ozaki int s;
657 1.173 ozaki struct rtentry *rt;
658 1.173 ozaki
659 1.173 ozaki rt = rtalloc1(dst, 0);
660 1.68 christos if (rt == NULL)
661 1.68 christos return NULL;
662 1.173 ozaki /*
663 1.173 ozaki * Just in case. May not need to do this workaround.
664 1.173 ozaki * Revisit when working on rtentry MP-ification.
665 1.173 ozaki */
666 1.173 ozaki s = pserialize_read_enter();
667 1.173 ozaki IFADDR_READER_FOREACH(ifa, rt->rt_ifp) {
668 1.173 ozaki if (ifa == rt->rt_ifa)
669 1.173 ozaki break;
670 1.173 ozaki }
671 1.173 ozaki if (ifa != NULL)
672 1.173 ozaki ifa_acquire(ifa, psref);
673 1.173 ozaki pserialize_read_exit(s);
674 1.146 ozaki rtfree(rt);
675 1.146 ozaki if (ifa == NULL)
676 1.68 christos return NULL;
677 1.1 cgd }
678 1.1 cgd if (ifa->ifa_addr->sa_family != dst->sa_family) {
679 1.173 ozaki struct ifaddr *nifa;
680 1.173 ozaki int s;
681 1.173 ozaki
682 1.173 ozaki s = pserialize_read_enter();
683 1.173 ozaki nifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
684 1.173 ozaki if (nifa != NULL) {
685 1.173 ozaki ifa_release(ifa, psref);
686 1.173 ozaki ifa_acquire(nifa, psref);
687 1.173 ozaki ifa = nifa;
688 1.173 ozaki }
689 1.173 ozaki pserialize_read_exit(s);
690 1.1 cgd }
691 1.95 dyoung return ifa;
692 1.1 cgd }
693 1.1 cgd
694 1.146 ozaki /*
695 1.146 ozaki * If it suceeds and ret_nrt isn't NULL, refcnt of ret_nrt is incremented.
696 1.146 ozaki * The caller has to rtfree it by itself.
697 1.146 ozaki */
698 1.9 mycroft int
699 1.60 matt rtrequest(int req, const struct sockaddr *dst, const struct sockaddr *gateway,
700 1.60 matt const struct sockaddr *netmask, int flags, struct rtentry **ret_nrt)
701 1.1 cgd {
702 1.39 itojun struct rt_addrinfo info;
703 1.39 itojun
704 1.44 thorpej memset(&info, 0, sizeof(info));
705 1.39 itojun info.rti_flags = flags;
706 1.39 itojun info.rti_info[RTAX_DST] = dst;
707 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
708 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
709 1.39 itojun return rtrequest1(req, &info, ret_nrt);
710 1.39 itojun }
711 1.39 itojun
712 1.146 ozaki /*
713 1.146 ozaki * It's a utility function to add/remove a route to/from the routing table
714 1.146 ozaki * and tell user processes the addition/removal on success.
715 1.146 ozaki */
716 1.146 ozaki int
717 1.146 ozaki rtrequest_newmsg(const int req, const struct sockaddr *dst,
718 1.146 ozaki const struct sockaddr *gateway, const struct sockaddr *netmask,
719 1.146 ozaki const int flags)
720 1.146 ozaki {
721 1.146 ozaki int error;
722 1.146 ozaki struct rtentry *ret_nrt = NULL;
723 1.146 ozaki
724 1.146 ozaki KASSERT(req == RTM_ADD || req == RTM_DELETE);
725 1.146 ozaki
726 1.146 ozaki error = rtrequest(req, dst, gateway, netmask, flags, &ret_nrt);
727 1.146 ozaki if (error != 0)
728 1.146 ozaki return error;
729 1.146 ozaki
730 1.146 ozaki KASSERT(ret_nrt != NULL);
731 1.146 ozaki
732 1.146 ozaki rt_newmsg(req, ret_nrt); /* tell user process */
733 1.146 ozaki rtfree(ret_nrt);
734 1.146 ozaki
735 1.146 ozaki return 0;
736 1.146 ozaki }
737 1.146 ozaki
738 1.173 ozaki struct ifnet *
739 1.173 ozaki rt_getifp(struct rt_addrinfo *info, struct psref *psref)
740 1.39 itojun {
741 1.68 christos const struct sockaddr *ifpaddr = info->rti_info[RTAX_IFP];
742 1.39 itojun
743 1.173 ozaki if (info->rti_ifp != NULL)
744 1.173 ozaki return NULL;
745 1.39 itojun /*
746 1.39 itojun * ifp may be specified by sockaddr_dl when protocol address
747 1.39 itojun * is ambiguous
748 1.39 itojun */
749 1.173 ozaki if (ifpaddr != NULL && ifpaddr->sa_family == AF_LINK) {
750 1.173 ozaki struct ifaddr *ifa;
751 1.173 ozaki int s = pserialize_read_enter();
752 1.173 ozaki
753 1.173 ozaki ifa = ifa_ifwithnet(ifpaddr);
754 1.173 ozaki if (ifa != NULL)
755 1.173 ozaki info->rti_ifp = if_get_byindex(ifa->ifa_ifp->if_index,
756 1.173 ozaki psref);
757 1.173 ozaki pserialize_read_exit(s);
758 1.39 itojun }
759 1.173 ozaki
760 1.173 ozaki return info->rti_ifp;
761 1.173 ozaki }
762 1.173 ozaki
763 1.173 ozaki struct ifaddr *
764 1.173 ozaki rt_getifa(struct rt_addrinfo *info, struct psref *psref)
765 1.173 ozaki {
766 1.174 ozaki struct ifaddr *ifa = NULL;
767 1.173 ozaki const struct sockaddr *dst = info->rti_info[RTAX_DST];
768 1.173 ozaki const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
769 1.173 ozaki const struct sockaddr *ifaaddr = info->rti_info[RTAX_IFA];
770 1.173 ozaki int flags = info->rti_flags;
771 1.173 ozaki const struct sockaddr *sa;
772 1.173 ozaki
773 1.173 ozaki if (info->rti_ifa == NULL && ifaaddr != NULL) {
774 1.173 ozaki ifa = ifa_ifwithaddr_psref(ifaaddr, psref);
775 1.173 ozaki if (ifa != NULL)
776 1.173 ozaki goto got;
777 1.173 ozaki }
778 1.173 ozaki
779 1.173 ozaki sa = ifaaddr != NULL ? ifaaddr :
780 1.173 ozaki (gateway != NULL ? gateway : dst);
781 1.173 ozaki if (sa != NULL && info->rti_ifp != NULL)
782 1.173 ozaki ifa = ifaof_ifpforaddr_psref(sa, info->rti_ifp, psref);
783 1.173 ozaki else if (dst != NULL && gateway != NULL)
784 1.173 ozaki ifa = ifa_ifwithroute_psref(flags, dst, gateway, psref);
785 1.173 ozaki else if (sa != NULL)
786 1.173 ozaki ifa = ifa_ifwithroute_psref(flags, sa, sa, psref);
787 1.173 ozaki if (ifa == NULL)
788 1.173 ozaki return NULL;
789 1.173 ozaki got:
790 1.145 roy if (ifa->ifa_getifa != NULL) {
791 1.173 ozaki /* FIXME NOMPSAFE */
792 1.173 ozaki ifa = (*ifa->ifa_getifa)(ifa, dst);
793 1.145 roy if (ifa == NULL)
794 1.173 ozaki return NULL;
795 1.173 ozaki ifa_acquire(ifa, psref);
796 1.145 roy }
797 1.173 ozaki info->rti_ifa = ifa;
798 1.74 dyoung if (info->rti_ifp == NULL)
799 1.74 dyoung info->rti_ifp = ifa->ifa_ifp;
800 1.173 ozaki return ifa;
801 1.39 itojun }
802 1.39 itojun
803 1.146 ozaki /*
804 1.146 ozaki * If it suceeds and ret_nrt isn't NULL, refcnt of ret_nrt is incremented.
805 1.146 ozaki * The caller has to rtfree it by itself.
806 1.146 ozaki */
807 1.39 itojun int
808 1.60 matt rtrequest1(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt)
809 1.39 itojun {
810 1.173 ozaki int s = splsoftnet(), ss;
811 1.125 dyoung int error = 0, rc;
812 1.158 ozaki struct rtentry *rt;
813 1.125 dyoung rtbl_t *rtbl;
814 1.173 ozaki struct ifaddr *ifa = NULL, *ifa2 = NULL;
815 1.94 dyoung struct sockaddr_storage maskeddst;
816 1.68 christos const struct sockaddr *dst = info->rti_info[RTAX_DST];
817 1.68 christos const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
818 1.68 christos const struct sockaddr *netmask = info->rti_info[RTAX_NETMASK];
819 1.68 christos int flags = info->rti_flags;
820 1.173 ozaki struct psref psref_ifp, psref_ifa;
821 1.173 ozaki int bound = 0;
822 1.173 ozaki struct ifnet *ifp = NULL;
823 1.173 ozaki bool need_to_release_ifa = true;
824 1.1 cgd #define senderr(x) { error = x ; goto bad; }
825 1.1 cgd
826 1.173 ozaki bound = curlwp_bind();
827 1.125 dyoung if ((rtbl = rt_gettable(dst->sa_family)) == NULL)
828 1.1 cgd senderr(ESRCH);
829 1.1 cgd if (flags & RTF_HOST)
830 1.68 christos netmask = NULL;
831 1.1 cgd switch (req) {
832 1.1 cgd case RTM_DELETE:
833 1.63 christos if (netmask) {
834 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
835 1.94 dyoung netmask);
836 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
837 1.63 christos }
838 1.125 dyoung if ((rt = rt_lookup(rtbl, dst, netmask)) == NULL)
839 1.41 itojun senderr(ESRCH);
840 1.125 dyoung if ((rt = rt_deladdr(rtbl, dst, netmask)) == NULL)
841 1.1 cgd senderr(ESRCH);
842 1.28 erh rt->rt_flags &= ~RTF_UP;
843 1.116 roy if ((ifa = rt->rt_ifa)) {
844 1.116 roy if (ifa->ifa_flags & IFA_ROUTE &&
845 1.116 roy rt_ifa_connected(rt, ifa)) {
846 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
847 1.116 roy "deleted IFA_ROUTE\n",
848 1.116 roy (void *)rt->_rt_key, (void *)ifa);
849 1.116 roy ifa->ifa_flags &= ~IFA_ROUTE;
850 1.116 roy }
851 1.116 roy if (ifa->ifa_rtrequest)
852 1.116 roy ifa->ifa_rtrequest(RTM_DELETE, rt, info);
853 1.173 ozaki ifa = NULL;
854 1.116 roy }
855 1.1 cgd rttrash++;
856 1.146 ozaki if (ret_nrt) {
857 1.10 mycroft *ret_nrt = rt;
858 1.146 ozaki rt->rt_refcnt++;
859 1.146 ozaki } else if (rt->rt_refcnt <= 0) {
860 1.146 ozaki /* Adjust the refcount */
861 1.10 mycroft rt->rt_refcnt++;
862 1.1 cgd rtfree(rt);
863 1.10 mycroft }
864 1.168 ozaki rtcache_clear_rtentry(dst->sa_family, rt);
865 1.1 cgd break;
866 1.1 cgd
867 1.1 cgd case RTM_ADD:
868 1.173 ozaki if (info->rti_ifa == NULL) {
869 1.173 ozaki ifp = rt_getifp(info, &psref_ifp);
870 1.173 ozaki ifa = rt_getifa(info, &psref_ifa);
871 1.173 ozaki if (ifa == NULL)
872 1.173 ozaki senderr(ENETUNREACH);
873 1.173 ozaki } else {
874 1.173 ozaki /* Caller should have a reference of ifa */
875 1.173 ozaki ifa = info->rti_ifa;
876 1.173 ozaki need_to_release_ifa = false;
877 1.173 ozaki }
878 1.22 thorpej rt = pool_get(&rtentry_pool, PR_NOWAIT);
879 1.68 christos if (rt == NULL)
880 1.1 cgd senderr(ENOBUFS);
881 1.109 dyoung memset(rt, 0, sizeof(*rt));
882 1.10 mycroft rt->rt_flags = RTF_UP | flags;
883 1.18 kml LIST_INIT(&rt->rt_timer);
884 1.163 ozaki
885 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
886 1.1 cgd if (netmask) {
887 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
888 1.94 dyoung netmask);
889 1.96 dyoung rt_setkey(rt, (struct sockaddr *)&maskeddst, M_NOWAIT);
890 1.94 dyoung } else {
891 1.96 dyoung rt_setkey(rt, dst, M_NOWAIT);
892 1.94 dyoung }
893 1.163 ozaki RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
894 1.163 ozaki if (rt_getkey(rt) == NULL ||
895 1.163 ozaki rt_setgate(rt, gateway) != 0) {
896 1.163 ozaki pool_put(&rtentry_pool, rt);
897 1.163 ozaki senderr(ENOBUFS);
898 1.163 ozaki }
899 1.163 ozaki
900 1.74 dyoung rt_set_ifa(rt, ifa);
901 1.164 ozaki if (info->rti_info[RTAX_TAG] != NULL) {
902 1.164 ozaki const struct sockaddr *tag;
903 1.164 ozaki tag = rt_settag(rt, info->rti_info[RTAX_TAG]);
904 1.164 ozaki if (tag == NULL)
905 1.164 ozaki senderr(ENOBUFS);
906 1.164 ozaki }
907 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
908 1.173 ozaki
909 1.173 ozaki ss = pserialize_read_enter();
910 1.173 ozaki if (info->rti_info[RTAX_IFP] != NULL) {
911 1.173 ozaki ifa2 = ifa_ifwithnet(info->rti_info[RTAX_IFP]);
912 1.173 ozaki if (ifa2 != NULL)
913 1.173 ozaki rt->rt_ifp = ifa2->ifa_ifp;
914 1.173 ozaki else
915 1.173 ozaki rt->rt_ifp = ifa->ifa_ifp;
916 1.173 ozaki } else
917 1.122 kefren rt->rt_ifp = ifa->ifa_ifp;
918 1.173 ozaki pserialize_read_exit(ss);
919 1.173 ozaki
920 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
921 1.125 dyoung rc = rt_addaddr(rtbl, rt, netmask);
922 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
923 1.125 dyoung if (rc != 0) {
924 1.173 ozaki ifafree(ifa); /* for rt_set_ifa above */
925 1.94 dyoung rt_destroy(rt);
926 1.40 itojun pool_put(&rtentry_pool, rt);
927 1.125 dyoung senderr(rc);
928 1.27 matt }
929 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
930 1.1 cgd if (ifa->ifa_rtrequest)
931 1.39 itojun ifa->ifa_rtrequest(req, rt, info);
932 1.173 ozaki if (need_to_release_ifa)
933 1.173 ozaki ifa_release(ifa, &psref_ifa);
934 1.173 ozaki ifa = NULL;
935 1.173 ozaki if_put(ifp, &psref_ifp);
936 1.173 ozaki ifp = NULL;
937 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
938 1.1 cgd if (ret_nrt) {
939 1.1 cgd *ret_nrt = rt;
940 1.1 cgd rt->rt_refcnt++;
941 1.41 itojun }
942 1.82 dyoung rtflushall(dst->sa_family);
943 1.1 cgd break;
944 1.92 dyoung case RTM_GET:
945 1.94 dyoung if (netmask != NULL) {
946 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
947 1.94 dyoung netmask);
948 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
949 1.94 dyoung }
950 1.125 dyoung if ((rt = rt_lookup(rtbl, dst, netmask)) == NULL)
951 1.92 dyoung senderr(ESRCH);
952 1.92 dyoung if (ret_nrt != NULL) {
953 1.92 dyoung *ret_nrt = rt;
954 1.92 dyoung rt->rt_refcnt++;
955 1.92 dyoung }
956 1.92 dyoung break;
957 1.1 cgd }
958 1.1 cgd bad:
959 1.173 ozaki if (need_to_release_ifa)
960 1.173 ozaki ifa_release(ifa, &psref_ifa);
961 1.173 ozaki if_put(ifp, &psref_ifp);
962 1.173 ozaki curlwp_bindx(bound);
963 1.1 cgd splx(s);
964 1.95 dyoung return error;
965 1.1 cgd }
966 1.1 cgd
967 1.10 mycroft int
968 1.94 dyoung rt_setgate(struct rtentry *rt, const struct sockaddr *gate)
969 1.10 mycroft {
970 1.176 ozaki struct sockaddr *new, *old;
971 1.94 dyoung
972 1.94 dyoung KASSERT(rt->_rt_key != NULL);
973 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
974 1.94 dyoung
975 1.176 ozaki new = sockaddr_dup(gate, M_ZERO | M_NOWAIT);
976 1.176 ozaki if (new == NULL)
977 1.94 dyoung return ENOMEM;
978 1.176 ozaki
979 1.176 ozaki old = rt->rt_gateway;
980 1.176 ozaki rt->rt_gateway = new;
981 1.176 ozaki if (old != NULL)
982 1.176 ozaki sockaddr_free(old);
983 1.176 ozaki
984 1.94 dyoung KASSERT(rt->_rt_key != NULL);
985 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
986 1.94 dyoung
987 1.10 mycroft if (rt->rt_flags & RTF_GATEWAY) {
988 1.166 ozaki struct rtentry *gwrt = rtalloc1(gate, 1);
989 1.27 matt /*
990 1.27 matt * If we switched gateways, grab the MTU from the new
991 1.47 itojun * gateway route if the current MTU, if the current MTU is
992 1.47 itojun * greater than the MTU of gateway.
993 1.47 itojun * Note that, if the MTU of gateway is 0, we will reset the
994 1.47 itojun * MTU of the route to run PMTUD again from scratch. XXX
995 1.27 matt */
996 1.166 ozaki if (gwrt != NULL) {
997 1.166 ozaki KASSERT(gwrt->_rt_key != NULL);
998 1.166 ozaki RT_DPRINTF("gwrt->_rt_key = %p\n", gwrt->_rt_key);
999 1.166 ozaki if ((rt->rt_rmx.rmx_locks & RTV_MTU) == 0 &&
1000 1.166 ozaki rt->rt_rmx.rmx_mtu &&
1001 1.166 ozaki rt->rt_rmx.rmx_mtu > gwrt->rt_rmx.rmx_mtu) {
1002 1.166 ozaki rt->rt_rmx.rmx_mtu = gwrt->rt_rmx.rmx_mtu;
1003 1.166 ozaki }
1004 1.166 ozaki rtfree(gwrt);
1005 1.27 matt }
1006 1.10 mycroft }
1007 1.94 dyoung KASSERT(rt->_rt_key != NULL);
1008 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1009 1.10 mycroft return 0;
1010 1.10 mycroft }
1011 1.10 mycroft
1012 1.141 ozaki static void
1013 1.60 matt rt_maskedcopy(const struct sockaddr *src, struct sockaddr *dst,
1014 1.60 matt const struct sockaddr *netmask)
1015 1.1 cgd {
1016 1.94 dyoung const char *netmaskp = &netmask->sa_data[0],
1017 1.94 dyoung *srcp = &src->sa_data[0];
1018 1.94 dyoung char *dstp = &dst->sa_data[0];
1019 1.126 christos const char *maskend = (char *)dst + MIN(netmask->sa_len, src->sa_len);
1020 1.126 christos const char *srcend = (char *)dst + src->sa_len;
1021 1.94 dyoung
1022 1.94 dyoung dst->sa_len = src->sa_len;
1023 1.94 dyoung dst->sa_family = src->sa_family;
1024 1.94 dyoung
1025 1.94 dyoung while (dstp < maskend)
1026 1.94 dyoung *dstp++ = *srcp++ & *netmaskp++;
1027 1.94 dyoung if (dstp < srcend)
1028 1.94 dyoung memset(dstp, 0, (size_t)(srcend - dstp));
1029 1.1 cgd }
1030 1.10 mycroft
1031 1.1 cgd /*
1032 1.135 roy * Inform the routing socket of a route change.
1033 1.135 roy */
1034 1.135 roy void
1035 1.154 ozaki rt_newmsg(const int cmd, const struct rtentry *rt)
1036 1.135 roy {
1037 1.135 roy struct rt_addrinfo info;
1038 1.135 roy
1039 1.135 roy memset((void *)&info, 0, sizeof(info));
1040 1.135 roy info.rti_info[RTAX_DST] = rt_getkey(rt);
1041 1.135 roy info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1042 1.135 roy info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1043 1.135 roy if (rt->rt_ifp) {
1044 1.135 roy info.rti_info[RTAX_IFP] = rt->rt_ifp->if_dl->ifa_addr;
1045 1.135 roy info.rti_info[RTAX_IFA] = rt->rt_ifa->ifa_addr;
1046 1.135 roy }
1047 1.135 roy
1048 1.135 roy rt_missmsg(cmd, &info, rt->rt_flags, 0);
1049 1.135 roy }
1050 1.135 roy
1051 1.135 roy /*
1052 1.29 sommerfe * Set up or tear down a routing table entry, normally
1053 1.1 cgd * for an interface.
1054 1.1 cgd */
1055 1.9 mycroft int
1056 1.60 matt rtinit(struct ifaddr *ifa, int cmd, int flags)
1057 1.1 cgd {
1058 1.36 augustss struct rtentry *rt;
1059 1.36 augustss struct sockaddr *dst, *odst;
1060 1.94 dyoung struct sockaddr_storage maskeddst;
1061 1.68 christos struct rtentry *nrt = NULL;
1062 1.1 cgd int error;
1063 1.39 itojun struct rt_addrinfo info;
1064 1.1 cgd
1065 1.1 cgd dst = flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
1066 1.1 cgd if (cmd == RTM_DELETE) {
1067 1.1 cgd if ((flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
1068 1.29 sommerfe /* Delete subnet route for this interface */
1069 1.29 sommerfe odst = dst;
1070 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
1071 1.29 sommerfe rt_maskedcopy(odst, dst, ifa->ifa_netmask);
1072 1.1 cgd }
1073 1.14 christos if ((rt = rtalloc1(dst, 0)) != NULL) {
1074 1.146 ozaki if (rt->rt_ifa != ifa) {
1075 1.146 ozaki rtfree(rt);
1076 1.85 dyoung return (flags & RTF_HOST) ? EHOSTUNREACH
1077 1.85 dyoung : ENETUNREACH;
1078 1.146 ozaki }
1079 1.146 ozaki rtfree(rt);
1080 1.1 cgd }
1081 1.1 cgd }
1082 1.44 thorpej memset(&info, 0, sizeof(info));
1083 1.39 itojun info.rti_ifa = ifa;
1084 1.39 itojun info.rti_flags = flags | ifa->ifa_flags;
1085 1.39 itojun info.rti_info[RTAX_DST] = dst;
1086 1.39 itojun info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1087 1.158 ozaki
1088 1.39 itojun /*
1089 1.39 itojun * XXX here, it seems that we are assuming that ifa_netmask is NULL
1090 1.39 itojun * for RTF_HOST. bsdi4 passes NULL explicitly (via intermediate
1091 1.39 itojun * variable) when RTF_HOST is 1. still not sure if i can safely
1092 1.39 itojun * change it to meet bsdi4 behavior.
1093 1.39 itojun */
1094 1.114 dyoung if (cmd != RTM_LLINFO_UPD)
1095 1.114 dyoung info.rti_info[RTAX_NETMASK] = ifa->ifa_netmask;
1096 1.114 dyoung error = rtrequest1((cmd == RTM_LLINFO_UPD) ? RTM_GET : cmd, &info,
1097 1.114 dyoung &nrt);
1098 1.153 ozaki if (error != 0)
1099 1.146 ozaki return error;
1100 1.146 ozaki
1101 1.153 ozaki rt = nrt;
1102 1.146 ozaki switch (cmd) {
1103 1.114 dyoung case RTM_DELETE:
1104 1.146 ozaki rt_newmsg(cmd, rt);
1105 1.114 dyoung break;
1106 1.114 dyoung case RTM_LLINFO_UPD:
1107 1.114 dyoung if (cmd == RTM_LLINFO_UPD && ifa->ifa_rtrequest != NULL)
1108 1.114 dyoung ifa->ifa_rtrequest(RTM_LLINFO_UPD, rt, &info);
1109 1.146 ozaki rt_newmsg(RTM_CHANGE, rt);
1110 1.114 dyoung break;
1111 1.114 dyoung case RTM_ADD:
1112 1.10 mycroft if (rt->rt_ifa != ifa) {
1113 1.17 christos printf("rtinit: wrong ifa (%p) was (%p)\n", ifa,
1114 1.17 christos rt->rt_ifa);
1115 1.114 dyoung if (rt->rt_ifa->ifa_rtrequest != NULL) {
1116 1.114 dyoung rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt,
1117 1.114 dyoung &info);
1118 1.114 dyoung }
1119 1.74 dyoung rt_replace_ifa(rt, ifa);
1120 1.10 mycroft rt->rt_ifp = ifa->ifa_ifp;
1121 1.114 dyoung if (ifa->ifa_rtrequest != NULL)
1122 1.114 dyoung ifa->ifa_rtrequest(RTM_ADD, rt, &info);
1123 1.10 mycroft }
1124 1.146 ozaki rt_newmsg(cmd, rt);
1125 1.114 dyoung break;
1126 1.1 cgd }
1127 1.147 ozaki rtfree(rt);
1128 1.85 dyoung return error;
1129 1.18 kml }
1130 1.18 kml
1131 1.136 roy /*
1132 1.136 roy * Create a local route entry for the address.
1133 1.136 roy * Announce the addition of the address and the route to the routing socket.
1134 1.136 roy */
1135 1.136 roy int
1136 1.136 roy rt_ifa_addlocal(struct ifaddr *ifa)
1137 1.136 roy {
1138 1.136 roy struct rtentry *rt;
1139 1.136 roy int e;
1140 1.136 roy
1141 1.136 roy /* If there is no loopback entry, allocate one. */
1142 1.136 roy rt = rtalloc1(ifa->ifa_addr, 0);
1143 1.158 ozaki #ifdef RT_DEBUG
1144 1.158 ozaki if (rt != NULL)
1145 1.158 ozaki dump_rt(rt);
1146 1.158 ozaki #endif
1147 1.136 roy if (rt == NULL || (rt->rt_flags & RTF_HOST) == 0 ||
1148 1.136 roy (rt->rt_ifp->if_flags & IFF_LOOPBACK) == 0)
1149 1.152 roy {
1150 1.152 roy struct rt_addrinfo info;
1151 1.152 roy struct rtentry *nrt;
1152 1.152 roy
1153 1.152 roy memset(&info, 0, sizeof(info));
1154 1.152 roy info.rti_flags = RTF_HOST | RTF_LOCAL;
1155 1.152 roy if (!(ifa->ifa_ifp->if_flags & (IFF_LOOPBACK|IFF_POINTOPOINT)))
1156 1.158 ozaki info.rti_flags |= RTF_LLDATA;
1157 1.152 roy info.rti_info[RTAX_DST] = ifa->ifa_addr;
1158 1.152 roy info.rti_info[RTAX_GATEWAY] =
1159 1.152 roy (const struct sockaddr *)ifa->ifa_ifp->if_sadl;
1160 1.152 roy info.rti_ifa = ifa;
1161 1.152 roy nrt = NULL;
1162 1.152 roy e = rtrequest1(RTM_ADD, &info, &nrt);
1163 1.152 roy if (nrt && ifa != nrt->rt_ifa)
1164 1.152 roy rt_replace_ifa(nrt, ifa);
1165 1.152 roy rt_newaddrmsg(RTM_ADD, ifa, e, nrt);
1166 1.158 ozaki if (nrt != NULL) {
1167 1.158 ozaki #ifdef RT_DEBUG
1168 1.158 ozaki dump_rt(nrt);
1169 1.158 ozaki #endif
1170 1.152 roy rtfree(nrt);
1171 1.158 ozaki }
1172 1.152 roy } else {
1173 1.136 roy e = 0;
1174 1.136 roy rt_newaddrmsg(RTM_NEWADDR, ifa, 0, NULL);
1175 1.136 roy }
1176 1.136 roy if (rt != NULL)
1177 1.146 ozaki rtfree(rt);
1178 1.136 roy return e;
1179 1.136 roy }
1180 1.136 roy
1181 1.136 roy /*
1182 1.136 roy * Remove the local route entry for the address.
1183 1.136 roy * Announce the removal of the address and the route to the routing socket.
1184 1.136 roy */
1185 1.136 roy int
1186 1.136 roy rt_ifa_remlocal(struct ifaddr *ifa, struct ifaddr *alt_ifa)
1187 1.136 roy {
1188 1.136 roy struct rtentry *rt;
1189 1.136 roy int e = 0;
1190 1.136 roy
1191 1.136 roy rt = rtalloc1(ifa->ifa_addr, 0);
1192 1.136 roy
1193 1.136 roy /*
1194 1.136 roy * Before deleting, check if a corresponding loopbacked
1195 1.136 roy * host route surely exists. With this check, we can avoid
1196 1.136 roy * deleting an interface direct route whose destination is
1197 1.136 roy * the same as the address being removed. This can happen
1198 1.136 roy * when removing a subnet-router anycast address on an
1199 1.136 roy * interface attached to a shared medium.
1200 1.136 roy */
1201 1.136 roy if (rt != NULL &&
1202 1.136 roy (rt->rt_flags & RTF_HOST) &&
1203 1.136 roy (rt->rt_ifp->if_flags & IFF_LOOPBACK))
1204 1.136 roy {
1205 1.136 roy /* If we cannot replace the route's ifaddr with the equivalent
1206 1.136 roy * ifaddr of another interface, I believe it is safest to
1207 1.136 roy * delete the route.
1208 1.136 roy */
1209 1.152 roy if (alt_ifa == NULL) {
1210 1.152 roy e = rtdeletemsg(rt);
1211 1.152 roy rt_newaddrmsg(RTM_DELADDR, ifa, 0, NULL);
1212 1.152 roy } else {
1213 1.136 roy rt_replace_ifa(rt, alt_ifa);
1214 1.136 roy rt_newmsg(RTM_CHANGE, rt);
1215 1.136 roy }
1216 1.136 roy } else
1217 1.136 roy rt_newaddrmsg(RTM_DELADDR, ifa, 0, NULL);
1218 1.136 roy if (rt != NULL)
1219 1.146 ozaki rtfree(rt);
1220 1.136 roy return e;
1221 1.136 roy }
1222 1.136 roy
1223 1.18 kml /*
1224 1.18 kml * Route timer routines. These routes allow functions to be called
1225 1.18 kml * for various routes at any time. This is useful in supporting
1226 1.18 kml * path MTU discovery and redirect route deletion.
1227 1.18 kml *
1228 1.18 kml * This is similar to some BSDI internal functions, but it provides
1229 1.18 kml * for multiple queues for efficiency's sake...
1230 1.18 kml */
1231 1.18 kml
1232 1.18 kml LIST_HEAD(, rttimer_queue) rttimer_queue_head;
1233 1.18 kml static int rt_init_done = 0;
1234 1.18 kml
1235 1.65 perry /*
1236 1.18 kml * Some subtle order problems with domain initialization mean that
1237 1.18 kml * we cannot count on this being run from rt_init before various
1238 1.18 kml * protocol initializations are done. Therefore, we make sure
1239 1.18 kml * that this is run when the first queue is added...
1240 1.18 kml */
1241 1.18 kml
1242 1.170 ozaki static void rt_timer_work(struct work *, void *);
1243 1.170 ozaki
1244 1.177 ozaki static void
1245 1.60 matt rt_timer_init(void)
1246 1.18 kml {
1247 1.170 ozaki int error;
1248 1.170 ozaki
1249 1.18 kml assert(rt_init_done == 0);
1250 1.18 kml
1251 1.18 kml LIST_INIT(&rttimer_queue_head);
1252 1.172 martin callout_init(&rt_timer_ch, CALLOUT_MPSAFE);
1253 1.170 ozaki error = workqueue_create(&rt_timer_wq, "rt_timer",
1254 1.170 ozaki rt_timer_work, NULL, PRI_SOFTNET, IPL_SOFTNET, WQ_MPSAFE);
1255 1.170 ozaki if (error)
1256 1.170 ozaki panic("%s: workqueue_create failed (%d)\n", __func__, error);
1257 1.172 martin callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1258 1.18 kml rt_init_done = 1;
1259 1.18 kml }
1260 1.18 kml
1261 1.18 kml struct rttimer_queue *
1262 1.60 matt rt_timer_queue_create(u_int timeout)
1263 1.18 kml {
1264 1.18 kml struct rttimer_queue *rtq;
1265 1.18 kml
1266 1.18 kml if (rt_init_done == 0)
1267 1.18 kml rt_timer_init();
1268 1.18 kml
1269 1.18 kml R_Malloc(rtq, struct rttimer_queue *, sizeof *rtq);
1270 1.18 kml if (rtq == NULL)
1271 1.85 dyoung return NULL;
1272 1.109 dyoung memset(rtq, 0, sizeof(*rtq));
1273 1.18 kml
1274 1.18 kml rtq->rtq_timeout = timeout;
1275 1.24 thorpej TAILQ_INIT(&rtq->rtq_head);
1276 1.18 kml LIST_INSERT_HEAD(&rttimer_queue_head, rtq, rtq_link);
1277 1.18 kml
1278 1.85 dyoung return rtq;
1279 1.18 kml }
1280 1.18 kml
1281 1.18 kml void
1282 1.60 matt rt_timer_queue_change(struct rttimer_queue *rtq, long timeout)
1283 1.18 kml {
1284 1.24 thorpej
1285 1.18 kml rtq->rtq_timeout = timeout;
1286 1.18 kml }
1287 1.18 kml
1288 1.177 ozaki static void
1289 1.60 matt rt_timer_queue_remove_all(struct rttimer_queue *rtq, int destroy)
1290 1.18 kml {
1291 1.24 thorpej struct rttimer *r;
1292 1.18 kml
1293 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL) {
1294 1.18 kml LIST_REMOVE(r, rtt_link);
1295 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
1296 1.24 thorpej if (destroy)
1297 1.156 ozaki (*r->rtt_func)(r->rtt_rt, r);
1298 1.150 ozaki rtfree(r->rtt_rt);
1299 1.22 thorpej pool_put(&rttimer_pool, r);
1300 1.37 itojun if (rtq->rtq_count > 0)
1301 1.37 itojun rtq->rtq_count--;
1302 1.37 itojun else
1303 1.55 itojun printf("rt_timer_queue_remove_all: "
1304 1.55 itojun "rtq_count reached 0\n");
1305 1.18 kml }
1306 1.55 itojun }
1307 1.55 itojun
1308 1.55 itojun void
1309 1.60 matt rt_timer_queue_destroy(struct rttimer_queue *rtq, int destroy)
1310 1.55 itojun {
1311 1.55 itojun
1312 1.55 itojun rt_timer_queue_remove_all(rtq, destroy);
1313 1.18 kml
1314 1.18 kml LIST_REMOVE(rtq, rtq_link);
1315 1.22 thorpej
1316 1.22 thorpej /*
1317 1.22 thorpej * Caller is responsible for freeing the rttimer_queue structure.
1318 1.22 thorpej */
1319 1.18 kml }
1320 1.18 kml
1321 1.37 itojun unsigned long
1322 1.60 matt rt_timer_count(struct rttimer_queue *rtq)
1323 1.37 itojun {
1324 1.37 itojun return rtq->rtq_count;
1325 1.37 itojun }
1326 1.37 itojun
1327 1.177 ozaki static void
1328 1.178 ozaki rt_timer_remove_all(struct rtentry *rt)
1329 1.18 kml {
1330 1.24 thorpej struct rttimer *r;
1331 1.18 kml
1332 1.24 thorpej while ((r = LIST_FIRST(&rt->rt_timer)) != NULL) {
1333 1.18 kml LIST_REMOVE(r, rtt_link);
1334 1.24 thorpej TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
1335 1.37 itojun if (r->rtt_queue->rtq_count > 0)
1336 1.37 itojun r->rtt_queue->rtq_count--;
1337 1.37 itojun else
1338 1.37 itojun printf("rt_timer_remove_all: rtq_count reached 0\n");
1339 1.150 ozaki rtfree(r->rtt_rt);
1340 1.38 itojun pool_put(&rttimer_pool, r);
1341 1.18 kml }
1342 1.18 kml }
1343 1.18 kml
1344 1.65 perry int
1345 1.60 matt rt_timer_add(struct rtentry *rt,
1346 1.60 matt void (*func)(struct rtentry *, struct rttimer *),
1347 1.60 matt struct rttimer_queue *queue)
1348 1.18 kml {
1349 1.24 thorpej struct rttimer *r;
1350 1.18 kml
1351 1.156 ozaki KASSERT(func != NULL);
1352 1.24 thorpej /*
1353 1.24 thorpej * If there's already a timer with this action, destroy it before
1354 1.24 thorpej * we add a new one.
1355 1.24 thorpej */
1356 1.85 dyoung LIST_FOREACH(r, &rt->rt_timer, rtt_link) {
1357 1.85 dyoung if (r->rtt_func == func)
1358 1.85 dyoung break;
1359 1.85 dyoung }
1360 1.85 dyoung if (r != NULL) {
1361 1.85 dyoung LIST_REMOVE(r, rtt_link);
1362 1.85 dyoung TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
1363 1.85 dyoung if (r->rtt_queue->rtq_count > 0)
1364 1.85 dyoung r->rtt_queue->rtq_count--;
1365 1.85 dyoung else
1366 1.85 dyoung printf("rt_timer_add: rtq_count reached 0\n");
1367 1.150 ozaki rtfree(r->rtt_rt);
1368 1.85 dyoung } else {
1369 1.85 dyoung r = pool_get(&rttimer_pool, PR_NOWAIT);
1370 1.85 dyoung if (r == NULL)
1371 1.85 dyoung return ENOBUFS;
1372 1.18 kml }
1373 1.18 kml
1374 1.85 dyoung memset(r, 0, sizeof(*r));
1375 1.24 thorpej
1376 1.150 ozaki rt->rt_refcnt++;
1377 1.24 thorpej r->rtt_rt = rt;
1378 1.70 kardel r->rtt_time = time_uptime;
1379 1.24 thorpej r->rtt_func = func;
1380 1.24 thorpej r->rtt_queue = queue;
1381 1.24 thorpej LIST_INSERT_HEAD(&rt->rt_timer, r, rtt_link);
1382 1.24 thorpej TAILQ_INSERT_TAIL(&queue->rtq_head, r, rtt_next);
1383 1.37 itojun r->rtt_queue->rtq_count++;
1384 1.65 perry
1385 1.95 dyoung return 0;
1386 1.18 kml }
1387 1.18 kml
1388 1.170 ozaki static void
1389 1.170 ozaki rt_timer_work(struct work *wk, void *arg)
1390 1.18 kml {
1391 1.24 thorpej struct rttimer_queue *rtq;
1392 1.24 thorpej struct rttimer *r;
1393 1.24 thorpej int s;
1394 1.21 kml
1395 1.24 thorpej s = splsoftnet();
1396 1.85 dyoung LIST_FOREACH(rtq, &rttimer_queue_head, rtq_link) {
1397 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL &&
1398 1.70 kardel (r->rtt_time + rtq->rtq_timeout) < time_uptime) {
1399 1.24 thorpej LIST_REMOVE(r, rtt_link);
1400 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
1401 1.156 ozaki (*r->rtt_func)(r->rtt_rt, r);
1402 1.150 ozaki rtfree(r->rtt_rt);
1403 1.24 thorpej pool_put(&rttimer_pool, r);
1404 1.37 itojun if (rtq->rtq_count > 0)
1405 1.37 itojun rtq->rtq_count--;
1406 1.37 itojun else
1407 1.37 itojun printf("rt_timer_timer: rtq_count reached 0\n");
1408 1.18 kml }
1409 1.18 kml }
1410 1.24 thorpej splx(s);
1411 1.18 kml
1412 1.35 thorpej callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1413 1.1 cgd }
1414 1.83 joerg
1415 1.177 ozaki static void
1416 1.170 ozaki rt_timer_timer(void *arg)
1417 1.170 ozaki {
1418 1.170 ozaki
1419 1.170 ozaki workqueue_enqueue(rt_timer_wq, &rt_timer_wk, NULL);
1420 1.170 ozaki }
1421 1.170 ozaki
1422 1.102 dyoung static struct rtentry *
1423 1.84 joerg _rtcache_init(struct route *ro, int flag)
1424 1.84 joerg {
1425 1.114 dyoung rtcache_invariants(ro);
1426 1.99 dyoung KASSERT(ro->_ro_rt == NULL);
1427 1.84 joerg
1428 1.90 dyoung if (rtcache_getdst(ro) == NULL)
1429 1.102 dyoung return NULL;
1430 1.105 dyoung ro->ro_invalid = false;
1431 1.105 dyoung if ((ro->_ro_rt = rtalloc1(rtcache_getdst(ro), flag)) != NULL)
1432 1.105 dyoung rtcache(ro);
1433 1.103 dyoung
1434 1.114 dyoung rtcache_invariants(ro);
1435 1.102 dyoung return ro->_ro_rt;
1436 1.84 joerg }
1437 1.84 joerg
1438 1.102 dyoung struct rtentry *
1439 1.83 joerg rtcache_init(struct route *ro)
1440 1.83 joerg {
1441 1.102 dyoung return _rtcache_init(ro, 1);
1442 1.83 joerg }
1443 1.83 joerg
1444 1.102 dyoung struct rtentry *
1445 1.83 joerg rtcache_init_noclone(struct route *ro)
1446 1.83 joerg {
1447 1.102 dyoung return _rtcache_init(ro, 0);
1448 1.83 joerg }
1449 1.90 dyoung
1450 1.102 dyoung struct rtentry *
1451 1.90 dyoung rtcache_update(struct route *ro, int clone)
1452 1.90 dyoung {
1453 1.90 dyoung rtcache_clear(ro);
1454 1.102 dyoung return _rtcache_init(ro, clone);
1455 1.90 dyoung }
1456 1.83 joerg
1457 1.83 joerg void
1458 1.90 dyoung rtcache_copy(struct route *new_ro, const struct route *old_ro)
1459 1.83 joerg {
1460 1.103 dyoung struct rtentry *rt;
1461 1.103 dyoung
1462 1.103 dyoung KASSERT(new_ro != old_ro);
1463 1.114 dyoung rtcache_invariants(new_ro);
1464 1.114 dyoung rtcache_invariants(old_ro);
1465 1.103 dyoung
1466 1.104 dyoung if ((rt = rtcache_validate(old_ro)) != NULL)
1467 1.103 dyoung rt->rt_refcnt++;
1468 1.103 dyoung
1469 1.90 dyoung if (rtcache_getdst(old_ro) == NULL ||
1470 1.90 dyoung rtcache_setdst(new_ro, rtcache_getdst(old_ro)) != 0)
1471 1.90 dyoung return;
1472 1.103 dyoung
1473 1.105 dyoung new_ro->ro_invalid = false;
1474 1.103 dyoung if ((new_ro->_ro_rt = rt) != NULL)
1475 1.86 dyoung rtcache(new_ro);
1476 1.114 dyoung rtcache_invariants(new_ro);
1477 1.83 joerg }
1478 1.83 joerg
1479 1.105 dyoung static struct dom_rtlist invalid_routes = LIST_HEAD_INITIALIZER(dom_rtlist);
1480 1.105 dyoung
1481 1.144 ozaki static void
1482 1.105 dyoung rtcache_invalidate(struct dom_rtlist *rtlist)
1483 1.83 joerg {
1484 1.105 dyoung struct route *ro;
1485 1.99 dyoung
1486 1.105 dyoung while ((ro = LIST_FIRST(rtlist)) != NULL) {
1487 1.114 dyoung rtcache_invariants(ro);
1488 1.105 dyoung KASSERT(ro->_ro_rt != NULL);
1489 1.105 dyoung ro->ro_invalid = true;
1490 1.99 dyoung LIST_REMOVE(ro, ro_rtcache_next);
1491 1.105 dyoung LIST_INSERT_HEAD(&invalid_routes, ro, ro_rtcache_next);
1492 1.114 dyoung rtcache_invariants(ro);
1493 1.84 joerg }
1494 1.105 dyoung }
1495 1.105 dyoung
1496 1.144 ozaki static void
1497 1.168 ozaki rtcache_clear_rtentry(int family, struct rtentry *rt)
1498 1.168 ozaki {
1499 1.168 ozaki struct domain *dom;
1500 1.171 hannken struct route *ro, *nro;
1501 1.168 ozaki
1502 1.168 ozaki if ((dom = pffinddomain(family)) == NULL)
1503 1.168 ozaki return;
1504 1.168 ozaki
1505 1.171 hannken LIST_FOREACH_SAFE(ro, &dom->dom_rtcache, ro_rtcache_next, nro) {
1506 1.168 ozaki if (ro->_ro_rt == rt)
1507 1.168 ozaki rtcache_clear(ro);
1508 1.168 ozaki }
1509 1.168 ozaki }
1510 1.168 ozaki
1511 1.168 ozaki static void
1512 1.105 dyoung rtcache_clear(struct route *ro)
1513 1.105 dyoung {
1514 1.114 dyoung rtcache_invariants(ro);
1515 1.105 dyoung if (ro->_ro_rt == NULL)
1516 1.105 dyoung return;
1517 1.105 dyoung
1518 1.105 dyoung LIST_REMOVE(ro, ro_rtcache_next);
1519 1.105 dyoung
1520 1.131 rmind rtfree(ro->_ro_rt);
1521 1.105 dyoung ro->_ro_rt = NULL;
1522 1.114 dyoung ro->ro_invalid = false;
1523 1.114 dyoung rtcache_invariants(ro);
1524 1.83 joerg }
1525 1.83 joerg
1526 1.90 dyoung struct rtentry *
1527 1.91 dyoung rtcache_lookup2(struct route *ro, const struct sockaddr *dst, int clone,
1528 1.91 dyoung int *hitp)
1529 1.90 dyoung {
1530 1.90 dyoung const struct sockaddr *odst;
1531 1.104 dyoung struct rtentry *rt = NULL;
1532 1.90 dyoung
1533 1.90 dyoung odst = rtcache_getdst(ro);
1534 1.138 ozaki if (odst == NULL)
1535 1.138 ozaki goto miss;
1536 1.90 dyoung
1537 1.138 ozaki if (sockaddr_cmp(odst, dst) != 0) {
1538 1.90 dyoung rtcache_free(ro);
1539 1.138 ozaki goto miss;
1540 1.138 ozaki }
1541 1.138 ozaki
1542 1.138 ozaki rt = rtcache_validate(ro);
1543 1.138 ozaki if (rt == NULL) {
1544 1.91 dyoung rtcache_clear(ro);
1545 1.138 ozaki goto miss;
1546 1.138 ozaki }
1547 1.138 ozaki
1548 1.138 ozaki *hitp = 1;
1549 1.138 ozaki rtcache_invariants(ro);
1550 1.90 dyoung
1551 1.138 ozaki return rt;
1552 1.138 ozaki miss:
1553 1.138 ozaki *hitp = 0;
1554 1.138 ozaki if (rtcache_setdst(ro, dst) == 0)
1555 1.138 ozaki rt = _rtcache_init(ro, clone);
1556 1.90 dyoung
1557 1.114 dyoung rtcache_invariants(ro);
1558 1.114 dyoung
1559 1.104 dyoung return rt;
1560 1.90 dyoung }
1561 1.90 dyoung
1562 1.83 joerg void
1563 1.86 dyoung rtcache_free(struct route *ro)
1564 1.86 dyoung {
1565 1.86 dyoung rtcache_clear(ro);
1566 1.86 dyoung if (ro->ro_sa != NULL) {
1567 1.86 dyoung sockaddr_free(ro->ro_sa);
1568 1.86 dyoung ro->ro_sa = NULL;
1569 1.86 dyoung }
1570 1.114 dyoung rtcache_invariants(ro);
1571 1.86 dyoung }
1572 1.86 dyoung
1573 1.90 dyoung int
1574 1.90 dyoung rtcache_setdst(struct route *ro, const struct sockaddr *sa)
1575 1.83 joerg {
1576 1.90 dyoung KASSERT(sa != NULL);
1577 1.90 dyoung
1578 1.114 dyoung rtcache_invariants(ro);
1579 1.142 ozaki if (ro->ro_sa != NULL) {
1580 1.142 ozaki if (ro->ro_sa->sa_family == sa->sa_family) {
1581 1.142 ozaki rtcache_clear(ro);
1582 1.142 ozaki sockaddr_copy(ro->ro_sa, ro->ro_sa->sa_len, sa);
1583 1.143 ozaki rtcache_invariants(ro);
1584 1.143 ozaki return 0;
1585 1.114 dyoung }
1586 1.143 ozaki /* free ro_sa, wrong family */
1587 1.143 ozaki rtcache_free(ro);
1588 1.142 ozaki }
1589 1.90 dyoung
1590 1.107 dyoung KASSERT(ro->_ro_rt == NULL);
1591 1.107 dyoung
1592 1.134 christos if ((ro->ro_sa = sockaddr_dup(sa, M_ZERO | M_NOWAIT)) == NULL) {
1593 1.114 dyoung rtcache_invariants(ro);
1594 1.90 dyoung return ENOMEM;
1595 1.107 dyoung }
1596 1.114 dyoung rtcache_invariants(ro);
1597 1.90 dyoung return 0;
1598 1.83 joerg }
1599 1.92 dyoung
1600 1.123 kefren const struct sockaddr *
1601 1.123 kefren rt_settag(struct rtentry *rt, const struct sockaddr *tag)
1602 1.123 kefren {
1603 1.123 kefren if (rt->rt_tag != tag) {
1604 1.123 kefren if (rt->rt_tag != NULL)
1605 1.123 kefren sockaddr_free(rt->rt_tag);
1606 1.134 christos rt->rt_tag = sockaddr_dup(tag, M_ZERO | M_NOWAIT);
1607 1.123 kefren }
1608 1.169 msaitoh return rt->rt_tag;
1609 1.123 kefren }
1610 1.123 kefren
1611 1.123 kefren struct sockaddr *
1612 1.167 ozaki rt_gettag(const struct rtentry *rt)
1613 1.123 kefren {
1614 1.123 kefren return rt->rt_tag;
1615 1.123 kefren }
1616 1.162 ozaki
1617 1.165 ozaki int
1618 1.167 ozaki rt_check_reject_route(const struct rtentry *rt, const struct ifnet *ifp)
1619 1.165 ozaki {
1620 1.165 ozaki
1621 1.165 ozaki if ((rt->rt_flags & RTF_REJECT) != 0) {
1622 1.165 ozaki /* Mimic looutput */
1623 1.165 ozaki if (ifp->if_flags & IFF_LOOPBACK)
1624 1.165 ozaki return (rt->rt_flags & RTF_HOST) ?
1625 1.165 ozaki EHOSTUNREACH : ENETUNREACH;
1626 1.165 ozaki else if (rt->rt_rmx.rmx_expire == 0 ||
1627 1.165 ozaki time_uptime < rt->rt_rmx.rmx_expire)
1628 1.165 ozaki return (rt->rt_flags & RTF_GATEWAY) ?
1629 1.165 ozaki EHOSTUNREACH : EHOSTDOWN;
1630 1.165 ozaki }
1631 1.165 ozaki
1632 1.165 ozaki return 0;
1633 1.165 ozaki }
1634 1.165 ozaki
1635 1.162 ozaki #ifdef DDB
1636 1.162 ozaki
1637 1.162 ozaki #include <machine/db_machdep.h>
1638 1.162 ozaki #include <ddb/db_interface.h>
1639 1.162 ozaki #include <ddb/db_output.h>
1640 1.162 ozaki
1641 1.162 ozaki #define rt_expire rt_rmx.rmx_expire
1642 1.162 ozaki
1643 1.162 ozaki static void
1644 1.162 ozaki db_print_sa(const struct sockaddr *sa)
1645 1.162 ozaki {
1646 1.162 ozaki int len;
1647 1.162 ozaki const u_char *p;
1648 1.162 ozaki
1649 1.162 ozaki if (sa == NULL) {
1650 1.162 ozaki db_printf("[NULL]");
1651 1.162 ozaki return;
1652 1.162 ozaki }
1653 1.162 ozaki
1654 1.162 ozaki p = (const u_char *)sa;
1655 1.162 ozaki len = sa->sa_len;
1656 1.162 ozaki db_printf("[");
1657 1.162 ozaki while (len > 0) {
1658 1.162 ozaki db_printf("%d", *p);
1659 1.162 ozaki p++; len--;
1660 1.162 ozaki if (len) db_printf(",");
1661 1.162 ozaki }
1662 1.162 ozaki db_printf("]\n");
1663 1.162 ozaki }
1664 1.162 ozaki
1665 1.162 ozaki static void
1666 1.162 ozaki db_print_ifa(struct ifaddr *ifa)
1667 1.162 ozaki {
1668 1.162 ozaki if (ifa == NULL)
1669 1.162 ozaki return;
1670 1.162 ozaki db_printf(" ifa_addr=");
1671 1.162 ozaki db_print_sa(ifa->ifa_addr);
1672 1.162 ozaki db_printf(" ifa_dsta=");
1673 1.162 ozaki db_print_sa(ifa->ifa_dstaddr);
1674 1.162 ozaki db_printf(" ifa_mask=");
1675 1.162 ozaki db_print_sa(ifa->ifa_netmask);
1676 1.162 ozaki db_printf(" flags=0x%x,refcnt=%d,metric=%d\n",
1677 1.162 ozaki ifa->ifa_flags,
1678 1.162 ozaki ifa->ifa_refcnt,
1679 1.162 ozaki ifa->ifa_metric);
1680 1.162 ozaki }
1681 1.162 ozaki
1682 1.162 ozaki /*
1683 1.162 ozaki * Function to pass to rt_walktree().
1684 1.162 ozaki * Return non-zero error to abort walk.
1685 1.162 ozaki */
1686 1.162 ozaki static int
1687 1.162 ozaki db_show_rtentry(struct rtentry *rt, void *w)
1688 1.162 ozaki {
1689 1.162 ozaki db_printf("rtentry=%p", rt);
1690 1.162 ozaki
1691 1.162 ozaki db_printf(" flags=0x%x refcnt=%d use=%"PRId64" expire=%"PRId64"\n",
1692 1.162 ozaki rt->rt_flags, rt->rt_refcnt,
1693 1.162 ozaki rt->rt_use, (uint64_t)rt->rt_expire);
1694 1.162 ozaki
1695 1.162 ozaki db_printf(" key="); db_print_sa(rt_getkey(rt));
1696 1.162 ozaki db_printf(" mask="); db_print_sa(rt_mask(rt));
1697 1.162 ozaki db_printf(" gw="); db_print_sa(rt->rt_gateway);
1698 1.162 ozaki
1699 1.162 ozaki db_printf(" ifp=%p ", rt->rt_ifp);
1700 1.162 ozaki if (rt->rt_ifp)
1701 1.162 ozaki db_printf("(%s)", rt->rt_ifp->if_xname);
1702 1.162 ozaki else
1703 1.162 ozaki db_printf("(NULL)");
1704 1.162 ozaki
1705 1.162 ozaki db_printf(" ifa=%p\n", rt->rt_ifa);
1706 1.162 ozaki db_print_ifa(rt->rt_ifa);
1707 1.162 ozaki
1708 1.162 ozaki db_printf(" gwroute=%p llinfo=%p\n",
1709 1.162 ozaki rt->rt_gwroute, rt->rt_llinfo);
1710 1.162 ozaki
1711 1.162 ozaki return 0;
1712 1.162 ozaki }
1713 1.162 ozaki
1714 1.162 ozaki /*
1715 1.162 ozaki * Function to print all the route trees.
1716 1.162 ozaki * Use this from ddb: "show routes"
1717 1.162 ozaki */
1718 1.162 ozaki void
1719 1.162 ozaki db_show_routes(db_expr_t addr, bool have_addr,
1720 1.162 ozaki db_expr_t count, const char *modif)
1721 1.162 ozaki {
1722 1.162 ozaki rt_walktree(AF_INET, db_show_rtentry, NULL);
1723 1.162 ozaki }
1724 1.162 ozaki #endif
1725