route.c revision 1.155 1 1.155 ozaki /* $NetBSD: route.c,v 1.155 2016/04/01 02:00:14 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.149 pooka #endif
97 1.90 dyoung
98 1.50 lukem #include <sys/cdefs.h>
99 1.155 ozaki __KERNEL_RCSID(0, "$NetBSD: route.c,v 1.155 2016/04/01 02:00:14 ozaki-r Exp $");
100 1.2 cgd
101 1.5 mycroft #include <sys/param.h>
102 1.140 ozaki #ifdef RTFLUSH_DEBUG
103 1.90 dyoung #include <sys/sysctl.h>
104 1.140 ozaki #endif
105 1.5 mycroft #include <sys/systm.h>
106 1.35 thorpej #include <sys/callout.h>
107 1.5 mycroft #include <sys/proc.h>
108 1.5 mycroft #include <sys/mbuf.h>
109 1.5 mycroft #include <sys/socket.h>
110 1.5 mycroft #include <sys/socketvar.h>
111 1.5 mycroft #include <sys/domain.h>
112 1.5 mycroft #include <sys/protosw.h>
113 1.18 kml #include <sys/kernel.h>
114 1.5 mycroft #include <sys/ioctl.h>
115 1.22 thorpej #include <sys/pool.h>
116 1.119 elad #include <sys/kauth.h>
117 1.1 cgd
118 1.5 mycroft #include <net/if.h>
119 1.114 dyoung #include <net/if_dl.h>
120 1.5 mycroft #include <net/route.h>
121 1.1 cgd
122 1.5 mycroft #include <netinet/in.h>
123 1.5 mycroft #include <netinet/in_var.h>
124 1.1 cgd
125 1.90 dyoung #ifdef RTFLUSH_DEBUG
126 1.90 dyoung #define rtcache_debug() __predict_false(_rtcache_debug)
127 1.90 dyoung #else /* RTFLUSH_DEBUG */
128 1.90 dyoung #define rtcache_debug() 0
129 1.90 dyoung #endif /* RTFLUSH_DEBUG */
130 1.5 mycroft
131 1.155 ozaki struct rtstat rtstat;
132 1.1 cgd
133 1.155 ozaki static int rttrash; /* routes not in table but not freed */
134 1.1 cgd
135 1.155 ozaki static struct pool rtentry_pool;
136 1.155 ozaki static struct pool rttimer_pool;
137 1.22 thorpej
138 1.155 ozaki static struct callout rt_timer_ch; /* callout for rt_timer_timer() */
139 1.35 thorpej
140 1.90 dyoung #ifdef RTFLUSH_DEBUG
141 1.90 dyoung static int _rtcache_debug = 0;
142 1.90 dyoung #endif /* RTFLUSH_DEBUG */
143 1.90 dyoung
144 1.119 elad static kauth_listener_t route_listener;
145 1.119 elad
146 1.60 matt static int rtdeletemsg(struct rtentry *);
147 1.92 dyoung static int rtflushclone1(struct rtentry *, void *);
148 1.92 dyoung static void rtflushclone(sa_family_t family, struct rtentry *);
149 1.144 ozaki static void rtflushall(int);
150 1.40 itojun
151 1.141 ozaki static void rt_maskedcopy(const struct sockaddr *,
152 1.141 ozaki struct sockaddr *, const struct sockaddr *);
153 1.141 ozaki
154 1.144 ozaki static void rtcache_clear(struct route *);
155 1.144 ozaki static void rtcache_invalidate(struct dom_rtlist *);
156 1.144 ozaki
157 1.90 dyoung #ifdef RTFLUSH_DEBUG
158 1.118 pooka static void sysctl_net_rtcache_setup(struct sysctllog **);
159 1.118 pooka static void
160 1.118 pooka sysctl_net_rtcache_setup(struct sysctllog **clog)
161 1.90 dyoung {
162 1.90 dyoung const struct sysctlnode *rnode;
163 1.90 dyoung
164 1.90 dyoung if (sysctl_createv(clog, 0, NULL, &rnode, CTLFLAG_PERMANENT,
165 1.90 dyoung CTLTYPE_NODE,
166 1.90 dyoung "rtcache", SYSCTL_DESCR("Route cache related settings"),
167 1.128 pooka NULL, 0, NULL, 0, CTL_NET, CTL_CREATE, CTL_EOL) != 0)
168 1.90 dyoung return;
169 1.90 dyoung if (sysctl_createv(clog, 0, &rnode, &rnode,
170 1.90 dyoung CTLFLAG_PERMANENT|CTLFLAG_READWRITE, CTLTYPE_INT,
171 1.90 dyoung "debug", SYSCTL_DESCR("Debug route caches"),
172 1.90 dyoung NULL, 0, &_rtcache_debug, 0, CTL_CREATE, CTL_EOL) != 0)
173 1.90 dyoung return;
174 1.90 dyoung }
175 1.90 dyoung #endif /* RTFLUSH_DEBUG */
176 1.90 dyoung
177 1.144 ozaki static inline void
178 1.144 ozaki rt_destroy(struct rtentry *rt)
179 1.144 ozaki {
180 1.144 ozaki if (rt->_rt_key != NULL)
181 1.144 ozaki sockaddr_free(rt->_rt_key);
182 1.144 ozaki if (rt->rt_gateway != NULL)
183 1.144 ozaki sockaddr_free(rt->rt_gateway);
184 1.144 ozaki if (rt_gettag(rt) != NULL)
185 1.144 ozaki sockaddr_free(rt_gettag(rt));
186 1.144 ozaki rt->_rt_key = rt->rt_gateway = rt->rt_tag = NULL;
187 1.144 ozaki }
188 1.144 ozaki
189 1.144 ozaki static inline const struct sockaddr *
190 1.144 ozaki rt_setkey(struct rtentry *rt, const struct sockaddr *key, int flags)
191 1.144 ozaki {
192 1.144 ozaki if (rt->_rt_key == key)
193 1.144 ozaki goto out;
194 1.144 ozaki
195 1.144 ozaki if (rt->_rt_key != NULL)
196 1.144 ozaki sockaddr_free(rt->_rt_key);
197 1.144 ozaki rt->_rt_key = sockaddr_dup(key, flags);
198 1.144 ozaki out:
199 1.144 ozaki rt->rt_nodes->rn_key = (const char *)rt->_rt_key;
200 1.144 ozaki return rt->_rt_key;
201 1.144 ozaki }
202 1.144 ozaki
203 1.81 joerg struct ifaddr *
204 1.81 joerg rt_get_ifa(struct rtentry *rt)
205 1.81 joerg {
206 1.81 joerg struct ifaddr *ifa;
207 1.81 joerg
208 1.81 joerg if ((ifa = rt->rt_ifa) == NULL)
209 1.81 joerg return ifa;
210 1.81 joerg else if (ifa->ifa_getifa == NULL)
211 1.81 joerg return ifa;
212 1.81 joerg #if 0
213 1.81 joerg else if (ifa->ifa_seqno != NULL && *ifa->ifa_seqno == rt->rt_ifa_seqno)
214 1.81 joerg return ifa;
215 1.81 joerg #endif
216 1.81 joerg else {
217 1.94 dyoung ifa = (*ifa->ifa_getifa)(ifa, rt_getkey(rt));
218 1.145 roy if (ifa == NULL)
219 1.145 roy return NULL;
220 1.81 joerg rt_replace_ifa(rt, ifa);
221 1.81 joerg return ifa;
222 1.81 joerg }
223 1.81 joerg }
224 1.81 joerg
225 1.80 joerg static void
226 1.80 joerg rt_set_ifa1(struct rtentry *rt, struct ifaddr *ifa)
227 1.80 joerg {
228 1.80 joerg rt->rt_ifa = ifa;
229 1.80 joerg if (ifa->ifa_seqno != NULL)
230 1.80 joerg rt->rt_ifa_seqno = *ifa->ifa_seqno;
231 1.80 joerg }
232 1.80 joerg
233 1.116 roy /*
234 1.116 roy * Is this route the connected route for the ifa?
235 1.116 roy */
236 1.116 roy static int
237 1.116 roy rt_ifa_connected(const struct rtentry *rt, const struct ifaddr *ifa)
238 1.116 roy {
239 1.116 roy const struct sockaddr *key, *dst, *odst;
240 1.116 roy struct sockaddr_storage maskeddst;
241 1.116 roy
242 1.116 roy key = rt_getkey(rt);
243 1.116 roy dst = rt->rt_flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
244 1.116 roy if (dst == NULL ||
245 1.116 roy dst->sa_family != key->sa_family ||
246 1.116 roy dst->sa_len != key->sa_len)
247 1.116 roy return 0;
248 1.116 roy if ((rt->rt_flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
249 1.116 roy odst = dst;
250 1.116 roy dst = (struct sockaddr *)&maskeddst;
251 1.116 roy rt_maskedcopy(odst, (struct sockaddr *)&maskeddst,
252 1.116 roy ifa->ifa_netmask);
253 1.116 roy }
254 1.116 roy return (memcmp(dst, key, dst->sa_len) == 0);
255 1.116 roy }
256 1.116 roy
257 1.80 joerg void
258 1.80 joerg rt_replace_ifa(struct rtentry *rt, struct ifaddr *ifa)
259 1.80 joerg {
260 1.116 roy if (rt->rt_ifa &&
261 1.116 roy rt->rt_ifa != ifa &&
262 1.116 roy rt->rt_ifa->ifa_flags & IFA_ROUTE &&
263 1.116 roy rt_ifa_connected(rt, rt->rt_ifa))
264 1.116 roy {
265 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
266 1.116 roy "replace deleted IFA_ROUTE\n",
267 1.116 roy (void *)rt->_rt_key, (void *)rt->rt_ifa);
268 1.116 roy rt->rt_ifa->ifa_flags &= ~IFA_ROUTE;
269 1.116 roy if (rt_ifa_connected(rt, ifa)) {
270 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
271 1.116 roy "replace added IFA_ROUTE\n",
272 1.116 roy (void *)rt->_rt_key, (void *)ifa);
273 1.116 roy ifa->ifa_flags |= IFA_ROUTE;
274 1.116 roy }
275 1.116 roy }
276 1.116 roy
277 1.133 rmind ifaref(ifa);
278 1.133 rmind ifafree(rt->rt_ifa);
279 1.80 joerg rt_set_ifa1(rt, ifa);
280 1.80 joerg }
281 1.80 joerg
282 1.80 joerg static void
283 1.80 joerg rt_set_ifa(struct rtentry *rt, struct ifaddr *ifa)
284 1.80 joerg {
285 1.133 rmind ifaref(ifa);
286 1.80 joerg rt_set_ifa1(rt, ifa);
287 1.80 joerg }
288 1.80 joerg
289 1.119 elad static int
290 1.119 elad route_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
291 1.119 elad void *arg0, void *arg1, void *arg2, void *arg3)
292 1.119 elad {
293 1.119 elad struct rt_msghdr *rtm;
294 1.119 elad int result;
295 1.119 elad
296 1.119 elad result = KAUTH_RESULT_DEFER;
297 1.119 elad rtm = arg1;
298 1.119 elad
299 1.120 elad if (action != KAUTH_NETWORK_ROUTE)
300 1.120 elad return result;
301 1.120 elad
302 1.119 elad if (rtm->rtm_type == RTM_GET)
303 1.119 elad result = KAUTH_RESULT_ALLOW;
304 1.119 elad
305 1.119 elad return result;
306 1.119 elad }
307 1.119 elad
308 1.9 mycroft void
309 1.124 matt rt_init(void)
310 1.1 cgd {
311 1.22 thorpej
312 1.118 pooka #ifdef RTFLUSH_DEBUG
313 1.118 pooka sysctl_net_rtcache_setup(NULL);
314 1.118 pooka #endif
315 1.118 pooka
316 1.113 pooka pool_init(&rtentry_pool, sizeof(struct rtentry), 0, 0, 0, "rtentpl",
317 1.113 pooka NULL, IPL_SOFTNET);
318 1.113 pooka pool_init(&rttimer_pool, sizeof(struct rttimer), 0, 0, 0, "rttmrpl",
319 1.113 pooka NULL, IPL_SOFTNET);
320 1.113 pooka
321 1.10 mycroft rn_init(); /* initialize all zeroes, all ones, mask table */
322 1.125 dyoung rtbl_init();
323 1.119 elad
324 1.119 elad route_listener = kauth_listen_scope(KAUTH_SCOPE_NETWORK,
325 1.119 elad route_listener_cb, NULL);
326 1.1 cgd }
327 1.1 cgd
328 1.144 ozaki static void
329 1.82 dyoung rtflushall(int family)
330 1.82 dyoung {
331 1.90 dyoung struct domain *dom;
332 1.90 dyoung
333 1.90 dyoung if (rtcache_debug())
334 1.90 dyoung printf("%s: enter\n", __func__);
335 1.90 dyoung
336 1.90 dyoung if ((dom = pffinddomain(family)) == NULL)
337 1.90 dyoung return;
338 1.82 dyoung
339 1.105 dyoung rtcache_invalidate(&dom->dom_rtcache);
340 1.82 dyoung }
341 1.82 dyoung
342 1.131 rmind static void
343 1.82 dyoung rtcache(struct route *ro)
344 1.82 dyoung {
345 1.90 dyoung struct domain *dom;
346 1.82 dyoung
347 1.114 dyoung rtcache_invariants(ro);
348 1.99 dyoung KASSERT(ro->_ro_rt != NULL);
349 1.105 dyoung KASSERT(ro->ro_invalid == false);
350 1.90 dyoung KASSERT(rtcache_getdst(ro) != NULL);
351 1.82 dyoung
352 1.90 dyoung if ((dom = pffinddomain(rtcache_getdst(ro)->sa_family)) == NULL)
353 1.90 dyoung return;
354 1.90 dyoung
355 1.90 dyoung LIST_INSERT_HEAD(&dom->dom_rtcache, ro, ro_rtcache_next);
356 1.114 dyoung rtcache_invariants(ro);
357 1.82 dyoung }
358 1.82 dyoung
359 1.1 cgd /*
360 1.146 ozaki * Packet routing routines. If success, refcnt of a returned rtentry
361 1.146 ozaki * will be incremented. The caller has to rtfree it by itself.
362 1.1 cgd */
363 1.1 cgd struct rtentry *
364 1.60 matt rtalloc1(const struct sockaddr *dst, int report)
365 1.1 cgd {
366 1.125 dyoung rtbl_t *rtbl = rt_gettable(dst->sa_family);
367 1.36 augustss struct rtentry *rt;
368 1.68 christos struct rtentry *newrt = NULL;
369 1.10 mycroft struct rt_addrinfo info;
370 1.13 mycroft int s = splsoftnet(), err = 0, msgtype = RTM_MISS;
371 1.1 cgd
372 1.125 dyoung if (rtbl != NULL && (rt = rt_matchaddr(rtbl, dst)) != NULL) {
373 1.125 dyoung newrt = rt;
374 1.1 cgd if (report && (rt->rt_flags & RTF_CLONING)) {
375 1.68 christos err = rtrequest(RTM_RESOLVE, dst, NULL, NULL, 0,
376 1.68 christos &newrt);
377 1.8 cgd if (err) {
378 1.8 cgd newrt = rt;
379 1.8 cgd rt->rt_refcnt++;
380 1.8 cgd goto miss;
381 1.8 cgd }
382 1.69 christos KASSERT(newrt != NULL);
383 1.129 maxv rt = newrt;
384 1.129 maxv if (rt->rt_flags & RTF_XRESOLVE) {
385 1.8 cgd msgtype = RTM_RESOLVE;
386 1.8 cgd goto miss;
387 1.8 cgd }
388 1.39 itojun /* Inform listeners of the new route */
389 1.44 thorpej memset(&info, 0, sizeof(info));
390 1.94 dyoung info.rti_info[RTAX_DST] = rt_getkey(rt);
391 1.39 itojun info.rti_info[RTAX_NETMASK] = rt_mask(rt);
392 1.39 itojun info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
393 1.39 itojun if (rt->rt_ifp != NULL) {
394 1.65 perry info.rti_info[RTAX_IFP] =
395 1.99 dyoung rt->rt_ifp->if_dl->ifa_addr;
396 1.39 itojun info.rti_info[RTAX_IFA] = rt->rt_ifa->ifa_addr;
397 1.39 itojun }
398 1.39 itojun rt_missmsg(RTM_ADD, &info, rt->rt_flags, 0);
399 1.1 cgd } else
400 1.1 cgd rt->rt_refcnt++;
401 1.1 cgd } else {
402 1.1 cgd rtstat.rts_unreach++;
403 1.10 mycroft miss: if (report) {
404 1.87 christos memset((void *)&info, 0, sizeof(info));
405 1.10 mycroft info.rti_info[RTAX_DST] = dst;
406 1.10 mycroft rt_missmsg(msgtype, &info, 0, err);
407 1.10 mycroft }
408 1.1 cgd }
409 1.1 cgd splx(s);
410 1.95 dyoung return newrt;
411 1.1 cgd }
412 1.1 cgd
413 1.151 ozaki #ifdef DEBUG
414 1.151 ozaki /*
415 1.151 ozaki * Check the following constraint for each rtcache:
416 1.151 ozaki * if a rtcache holds a rtentry, the rtentry's refcnt is more than zero,
417 1.151 ozaki * i.e., the rtentry should be referenced at least by the rtcache.
418 1.151 ozaki */
419 1.151 ozaki static void
420 1.151 ozaki rtcache_check_rtrefcnt(int family)
421 1.151 ozaki {
422 1.151 ozaki struct domain *dom = pffinddomain(family);
423 1.151 ozaki struct route *ro;
424 1.151 ozaki
425 1.151 ozaki if (dom == NULL)
426 1.151 ozaki return;
427 1.151 ozaki
428 1.151 ozaki LIST_FOREACH(ro, &dom->dom_rtcache, ro_rtcache_next)
429 1.151 ozaki KDASSERT(ro->_ro_rt == NULL || ro->_ro_rt->rt_refcnt > 0);
430 1.151 ozaki }
431 1.151 ozaki #endif
432 1.151 ozaki
433 1.9 mycroft void
434 1.60 matt rtfree(struct rtentry *rt)
435 1.1 cgd {
436 1.36 augustss struct ifaddr *ifa;
437 1.10 mycroft
438 1.132 rmind KASSERT(rt != NULL);
439 1.132 rmind KASSERT(rt->rt_refcnt > 0);
440 1.132 rmind
441 1.1 cgd rt->rt_refcnt--;
442 1.151 ozaki #ifdef DEBUG
443 1.151 ozaki if (rt_getkey(rt) != NULL)
444 1.151 ozaki rtcache_check_rtrefcnt(rt_getkey(rt)->sa_family);
445 1.151 ozaki #endif
446 1.132 rmind if (rt->rt_refcnt == 0 && (rt->rt_flags & RTF_UP) == 0) {
447 1.125 dyoung rt_assert_inactive(rt);
448 1.10 mycroft rttrash--;
449 1.54 itojun rt_timer_remove_all(rt, 0);
450 1.10 mycroft ifa = rt->rt_ifa;
451 1.78 dyoung rt->rt_ifa = NULL;
452 1.133 rmind ifafree(ifa);
453 1.78 dyoung rt->rt_ifp = NULL;
454 1.94 dyoung rt_destroy(rt);
455 1.22 thorpej pool_put(&rtentry_pool, rt);
456 1.1 cgd }
457 1.1 cgd }
458 1.1 cgd
459 1.1 cgd /*
460 1.1 cgd * Force a routing table entry to the specified
461 1.1 cgd * destination to go through the given gateway.
462 1.1 cgd * Normally called as a result of a routing redirect
463 1.1 cgd * message from the network layer.
464 1.1 cgd *
465 1.13 mycroft * N.B.: must be called at splsoftnet
466 1.1 cgd */
467 1.14 christos void
468 1.60 matt rtredirect(const struct sockaddr *dst, const struct sockaddr *gateway,
469 1.60 matt const struct sockaddr *netmask, int flags, const struct sockaddr *src,
470 1.60 matt struct rtentry **rtp)
471 1.1 cgd {
472 1.36 augustss struct rtentry *rt;
473 1.1 cgd int error = 0;
474 1.121 dyoung uint64_t *stat = NULL;
475 1.10 mycroft struct rt_addrinfo info;
476 1.10 mycroft struct ifaddr *ifa;
477 1.1 cgd
478 1.1 cgd /* verify the gateway is directly reachable */
479 1.68 christos if ((ifa = ifa_ifwithnet(gateway)) == NULL) {
480 1.1 cgd error = ENETUNREACH;
481 1.8 cgd goto out;
482 1.1 cgd }
483 1.1 cgd rt = rtalloc1(dst, 0);
484 1.1 cgd /*
485 1.1 cgd * If the redirect isn't from our current router for this dst,
486 1.1 cgd * it's either old or wrong. If it redirects us to ourselves,
487 1.1 cgd * we have a routing loop, perhaps as a result of an interface
488 1.1 cgd * going down recently.
489 1.1 cgd */
490 1.10 mycroft if (!(flags & RTF_DONE) && rt &&
491 1.115 yamt (sockaddr_cmp(src, rt->rt_gateway) != 0 || rt->rt_ifa != ifa))
492 1.1 cgd error = EINVAL;
493 1.1 cgd else if (ifa_ifwithaddr(gateway))
494 1.1 cgd error = EHOSTUNREACH;
495 1.1 cgd if (error)
496 1.1 cgd goto done;
497 1.1 cgd /*
498 1.1 cgd * Create a new entry if we just got back a wildcard entry
499 1.33 soren * or the lookup failed. This is necessary for hosts
500 1.1 cgd * which use routing redirects generated by smart gateways
501 1.1 cgd * to dynamically build the routing tables.
502 1.1 cgd */
503 1.95 dyoung if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
504 1.1 cgd goto create;
505 1.1 cgd /*
506 1.1 cgd * Don't listen to the redirect if it's
507 1.65 perry * for a route to an interface.
508 1.1 cgd */
509 1.1 cgd if (rt->rt_flags & RTF_GATEWAY) {
510 1.1 cgd if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
511 1.1 cgd /*
512 1.1 cgd * Changing from route to net => route to host.
513 1.1 cgd * Create new route, rather than smashing route to net.
514 1.1 cgd */
515 1.1 cgd create:
516 1.95 dyoung if (rt != NULL)
517 1.39 itojun rtfree(rt);
518 1.1 cgd flags |= RTF_GATEWAY | RTF_DYNAMIC;
519 1.122 kefren memset(&info, 0, sizeof(info));
520 1.39 itojun info.rti_info[RTAX_DST] = dst;
521 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
522 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
523 1.39 itojun info.rti_ifa = ifa;
524 1.39 itojun info.rti_flags = flags;
525 1.39 itojun rt = NULL;
526 1.39 itojun error = rtrequest1(RTM_ADD, &info, &rt);
527 1.39 itojun if (rt != NULL)
528 1.39 itojun flags = rt->rt_flags;
529 1.1 cgd stat = &rtstat.rts_dynamic;
530 1.1 cgd } else {
531 1.1 cgd /*
532 1.1 cgd * Smash the current notion of the gateway to
533 1.1 cgd * this destination. Should check about netmask!!!
534 1.1 cgd */
535 1.10 mycroft rt->rt_flags |= RTF_MODIFIED;
536 1.10 mycroft flags |= RTF_MODIFIED;
537 1.10 mycroft stat = &rtstat.rts_newgateway;
538 1.94 dyoung rt_setgate(rt, gateway);
539 1.1 cgd }
540 1.1 cgd } else
541 1.1 cgd error = EHOSTUNREACH;
542 1.1 cgd done:
543 1.1 cgd if (rt) {
544 1.95 dyoung if (rtp != NULL && !error)
545 1.1 cgd *rtp = rt;
546 1.1 cgd else
547 1.1 cgd rtfree(rt);
548 1.1 cgd }
549 1.8 cgd out:
550 1.1 cgd if (error)
551 1.1 cgd rtstat.rts_badredirect++;
552 1.8 cgd else if (stat != NULL)
553 1.8 cgd (*stat)++;
554 1.95 dyoung memset(&info, 0, sizeof(info));
555 1.10 mycroft info.rti_info[RTAX_DST] = dst;
556 1.10 mycroft info.rti_info[RTAX_GATEWAY] = gateway;
557 1.10 mycroft info.rti_info[RTAX_NETMASK] = netmask;
558 1.10 mycroft info.rti_info[RTAX_AUTHOR] = src;
559 1.10 mycroft rt_missmsg(RTM_REDIRECT, &info, flags, error);
560 1.1 cgd }
561 1.1 cgd
562 1.1 cgd /*
563 1.146 ozaki * Delete a route and generate a message.
564 1.146 ozaki * It doesn't free a passed rt.
565 1.40 itojun */
566 1.40 itojun static int
567 1.60 matt rtdeletemsg(struct rtentry *rt)
568 1.40 itojun {
569 1.40 itojun int error;
570 1.40 itojun struct rt_addrinfo info;
571 1.146 ozaki struct rtentry *retrt;
572 1.40 itojun
573 1.40 itojun /*
574 1.40 itojun * Request the new route so that the entry is not actually
575 1.40 itojun * deleted. That will allow the information being reported to
576 1.40 itojun * be accurate (and consistent with route_output()).
577 1.40 itojun */
578 1.95 dyoung memset(&info, 0, sizeof(info));
579 1.94 dyoung info.rti_info[RTAX_DST] = rt_getkey(rt);
580 1.40 itojun info.rti_info[RTAX_NETMASK] = rt_mask(rt);
581 1.40 itojun info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
582 1.40 itojun info.rti_flags = rt->rt_flags;
583 1.146 ozaki error = rtrequest1(RTM_DELETE, &info, &retrt);
584 1.40 itojun
585 1.40 itojun rt_missmsg(RTM_DELETE, &info, info.rti_flags, error);
586 1.40 itojun
587 1.146 ozaki if (error == 0)
588 1.146 ozaki rtfree(retrt);
589 1.95 dyoung return error;
590 1.40 itojun }
591 1.40 itojun
592 1.41 itojun static int
593 1.92 dyoung rtflushclone1(struct rtentry *rt, void *arg)
594 1.41 itojun {
595 1.92 dyoung struct rtentry *parent;
596 1.41 itojun
597 1.41 itojun parent = (struct rtentry *)arg;
598 1.41 itojun if ((rt->rt_flags & RTF_CLONED) != 0 && rt->rt_parent == parent)
599 1.41 itojun rtdeletemsg(rt);
600 1.41 itojun return 0;
601 1.41 itojun }
602 1.41 itojun
603 1.41 itojun static void
604 1.92 dyoung rtflushclone(sa_family_t family, struct rtentry *parent)
605 1.41 itojun {
606 1.41 itojun
607 1.41 itojun #ifdef DIAGNOSTIC
608 1.41 itojun if (!parent || (parent->rt_flags & RTF_CLONING) == 0)
609 1.41 itojun panic("rtflushclone: called with a non-cloning route");
610 1.41 itojun #endif
611 1.92 dyoung rt_walktree(family, rtflushclone1, (void *)parent);
612 1.41 itojun }
613 1.41 itojun
614 1.1 cgd struct ifaddr *
615 1.60 matt ifa_ifwithroute(int flags, const struct sockaddr *dst,
616 1.60 matt const struct sockaddr *gateway)
617 1.1 cgd {
618 1.36 augustss struct ifaddr *ifa;
619 1.1 cgd if ((flags & RTF_GATEWAY) == 0) {
620 1.1 cgd /*
621 1.1 cgd * If we are adding a route to an interface,
622 1.1 cgd * and the interface is a pt to pt link
623 1.1 cgd * we should search for the destination
624 1.1 cgd * as our clue to the interface. Otherwise
625 1.1 cgd * we can use the local address.
626 1.1 cgd */
627 1.68 christos ifa = NULL;
628 1.127 christos if ((flags & RTF_HOST) && gateway->sa_family != AF_LINK)
629 1.1 cgd ifa = ifa_ifwithdstaddr(dst);
630 1.68 christos if (ifa == NULL)
631 1.1 cgd ifa = ifa_ifwithaddr(gateway);
632 1.1 cgd } else {
633 1.1 cgd /*
634 1.1 cgd * If we are adding a route to a remote net
635 1.1 cgd * or host, the gateway may still be on the
636 1.1 cgd * other end of a pt to pt link.
637 1.1 cgd */
638 1.1 cgd ifa = ifa_ifwithdstaddr(gateway);
639 1.1 cgd }
640 1.68 christos if (ifa == NULL)
641 1.1 cgd ifa = ifa_ifwithnet(gateway);
642 1.68 christos if (ifa == NULL) {
643 1.1 cgd struct rtentry *rt = rtalloc1(dst, 0);
644 1.68 christos if (rt == NULL)
645 1.68 christos return NULL;
646 1.146 ozaki ifa = rt->rt_ifa;
647 1.146 ozaki rtfree(rt);
648 1.146 ozaki if (ifa == NULL)
649 1.68 christos return NULL;
650 1.1 cgd }
651 1.1 cgd if (ifa->ifa_addr->sa_family != dst->sa_family) {
652 1.10 mycroft struct ifaddr *oifa = ifa;
653 1.1 cgd ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
654 1.127 christos if (ifa == NULL)
655 1.1 cgd ifa = oifa;
656 1.1 cgd }
657 1.95 dyoung return ifa;
658 1.1 cgd }
659 1.1 cgd
660 1.146 ozaki /*
661 1.146 ozaki * If it suceeds and ret_nrt isn't NULL, refcnt of ret_nrt is incremented.
662 1.146 ozaki * The caller has to rtfree it by itself.
663 1.146 ozaki */
664 1.9 mycroft int
665 1.60 matt rtrequest(int req, const struct sockaddr *dst, const struct sockaddr *gateway,
666 1.60 matt const struct sockaddr *netmask, int flags, struct rtentry **ret_nrt)
667 1.1 cgd {
668 1.39 itojun struct rt_addrinfo info;
669 1.39 itojun
670 1.44 thorpej memset(&info, 0, sizeof(info));
671 1.39 itojun info.rti_flags = flags;
672 1.39 itojun info.rti_info[RTAX_DST] = dst;
673 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
674 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
675 1.39 itojun return rtrequest1(req, &info, ret_nrt);
676 1.39 itojun }
677 1.39 itojun
678 1.146 ozaki /*
679 1.146 ozaki * It's a utility function to add/remove a route to/from the routing table
680 1.146 ozaki * and tell user processes the addition/removal on success.
681 1.146 ozaki */
682 1.146 ozaki int
683 1.146 ozaki rtrequest_newmsg(const int req, const struct sockaddr *dst,
684 1.146 ozaki const struct sockaddr *gateway, const struct sockaddr *netmask,
685 1.146 ozaki const int flags)
686 1.146 ozaki {
687 1.146 ozaki int error;
688 1.146 ozaki struct rtentry *ret_nrt = NULL;
689 1.146 ozaki
690 1.146 ozaki KASSERT(req == RTM_ADD || req == RTM_DELETE);
691 1.146 ozaki
692 1.146 ozaki error = rtrequest(req, dst, gateway, netmask, flags, &ret_nrt);
693 1.146 ozaki if (error != 0)
694 1.146 ozaki return error;
695 1.146 ozaki
696 1.146 ozaki KASSERT(ret_nrt != NULL);
697 1.146 ozaki
698 1.146 ozaki rt_newmsg(req, ret_nrt); /* tell user process */
699 1.146 ozaki rtfree(ret_nrt);
700 1.146 ozaki
701 1.146 ozaki return 0;
702 1.146 ozaki }
703 1.146 ozaki
704 1.39 itojun int
705 1.60 matt rt_getifa(struct rt_addrinfo *info)
706 1.39 itojun {
707 1.39 itojun struct ifaddr *ifa;
708 1.68 christos const struct sockaddr *dst = info->rti_info[RTAX_DST];
709 1.68 christos const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
710 1.68 christos const struct sockaddr *ifaaddr = info->rti_info[RTAX_IFA];
711 1.68 christos const struct sockaddr *ifpaddr = info->rti_info[RTAX_IFP];
712 1.68 christos int flags = info->rti_flags;
713 1.39 itojun
714 1.39 itojun /*
715 1.39 itojun * ifp may be specified by sockaddr_dl when protocol address
716 1.39 itojun * is ambiguous
717 1.39 itojun */
718 1.39 itojun if (info->rti_ifp == NULL && ifpaddr != NULL
719 1.39 itojun && ifpaddr->sa_family == AF_LINK &&
720 1.101 dyoung (ifa = ifa_ifwithnet(ifpaddr)) != NULL)
721 1.39 itojun info->rti_ifp = ifa->ifa_ifp;
722 1.39 itojun if (info->rti_ifa == NULL && ifaaddr != NULL)
723 1.39 itojun info->rti_ifa = ifa_ifwithaddr(ifaaddr);
724 1.39 itojun if (info->rti_ifa == NULL) {
725 1.59 matt const struct sockaddr *sa;
726 1.39 itojun
727 1.39 itojun sa = ifaaddr != NULL ? ifaaddr :
728 1.39 itojun (gateway != NULL ? gateway : dst);
729 1.39 itojun if (sa != NULL && info->rti_ifp != NULL)
730 1.39 itojun info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
731 1.39 itojun else if (dst != NULL && gateway != NULL)
732 1.39 itojun info->rti_ifa = ifa_ifwithroute(flags, dst, gateway);
733 1.39 itojun else if (sa != NULL)
734 1.39 itojun info->rti_ifa = ifa_ifwithroute(flags, sa, sa);
735 1.39 itojun }
736 1.74 dyoung if ((ifa = info->rti_ifa) == NULL)
737 1.74 dyoung return ENETUNREACH;
738 1.145 roy if (ifa->ifa_getifa != NULL) {
739 1.74 dyoung info->rti_ifa = ifa = (*ifa->ifa_getifa)(ifa, dst);
740 1.145 roy if (ifa == NULL)
741 1.145 roy return ENETUNREACH;
742 1.145 roy }
743 1.74 dyoung if (info->rti_ifp == NULL)
744 1.74 dyoung info->rti_ifp = ifa->ifa_ifp;
745 1.74 dyoung return 0;
746 1.39 itojun }
747 1.39 itojun
748 1.146 ozaki /*
749 1.146 ozaki * If it suceeds and ret_nrt isn't NULL, refcnt of ret_nrt is incremented.
750 1.146 ozaki * The caller has to rtfree it by itself.
751 1.146 ozaki */
752 1.39 itojun int
753 1.60 matt rtrequest1(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt)
754 1.39 itojun {
755 1.60 matt int s = splsoftnet();
756 1.125 dyoung int error = 0, rc;
757 1.40 itojun struct rtentry *rt, *crt;
758 1.125 dyoung rtbl_t *rtbl;
759 1.122 kefren struct ifaddr *ifa, *ifa2;
760 1.94 dyoung struct sockaddr_storage maskeddst;
761 1.68 christos const struct sockaddr *dst = info->rti_info[RTAX_DST];
762 1.68 christos const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
763 1.68 christos const struct sockaddr *netmask = info->rti_info[RTAX_NETMASK];
764 1.68 christos int flags = info->rti_flags;
765 1.1 cgd #define senderr(x) { error = x ; goto bad; }
766 1.1 cgd
767 1.125 dyoung if ((rtbl = rt_gettable(dst->sa_family)) == NULL)
768 1.1 cgd senderr(ESRCH);
769 1.1 cgd if (flags & RTF_HOST)
770 1.68 christos netmask = NULL;
771 1.1 cgd switch (req) {
772 1.1 cgd case RTM_DELETE:
773 1.63 christos if (netmask) {
774 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
775 1.94 dyoung netmask);
776 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
777 1.63 christos }
778 1.125 dyoung if ((rt = rt_lookup(rtbl, dst, netmask)) == NULL)
779 1.41 itojun senderr(ESRCH);
780 1.41 itojun if ((rt->rt_flags & RTF_CLONING) != 0) {
781 1.41 itojun /* clean up any cloned children */
782 1.92 dyoung rtflushclone(dst->sa_family, rt);
783 1.41 itojun }
784 1.125 dyoung if ((rt = rt_deladdr(rtbl, dst, netmask)) == NULL)
785 1.1 cgd senderr(ESRCH);
786 1.10 mycroft if (rt->rt_gwroute) {
787 1.131 rmind rtfree(rt->rt_gwroute);
788 1.68 christos rt->rt_gwroute = NULL;
789 1.48 itojun }
790 1.48 itojun if (rt->rt_parent) {
791 1.48 itojun rt->rt_parent->rt_refcnt--;
792 1.48 itojun rt->rt_parent = NULL;
793 1.10 mycroft }
794 1.28 erh rt->rt_flags &= ~RTF_UP;
795 1.116 roy if ((ifa = rt->rt_ifa)) {
796 1.116 roy if (ifa->ifa_flags & IFA_ROUTE &&
797 1.116 roy rt_ifa_connected(rt, ifa)) {
798 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
799 1.116 roy "deleted IFA_ROUTE\n",
800 1.116 roy (void *)rt->_rt_key, (void *)ifa);
801 1.116 roy ifa->ifa_flags &= ~IFA_ROUTE;
802 1.116 roy }
803 1.116 roy if (ifa->ifa_rtrequest)
804 1.116 roy ifa->ifa_rtrequest(RTM_DELETE, rt, info);
805 1.116 roy }
806 1.1 cgd rttrash++;
807 1.146 ozaki if (ret_nrt) {
808 1.10 mycroft *ret_nrt = rt;
809 1.146 ozaki rt->rt_refcnt++;
810 1.146 ozaki } else if (rt->rt_refcnt <= 0) {
811 1.146 ozaki /* Adjust the refcount */
812 1.10 mycroft rt->rt_refcnt++;
813 1.1 cgd rtfree(rt);
814 1.10 mycroft }
815 1.1 cgd break;
816 1.1 cgd
817 1.1 cgd case RTM_RESOLVE:
818 1.68 christos if (ret_nrt == NULL || (rt = *ret_nrt) == NULL)
819 1.1 cgd senderr(EINVAL);
820 1.40 itojun if ((rt->rt_flags & RTF_CLONING) == 0)
821 1.40 itojun senderr(EINVAL);
822 1.1 cgd ifa = rt->rt_ifa;
823 1.40 itojun flags = rt->rt_flags & ~(RTF_CLONING | RTF_STATIC);
824 1.40 itojun flags |= RTF_CLONED;
825 1.1 cgd gateway = rt->rt_gateway;
826 1.94 dyoung flags |= RTF_HOST;
827 1.1 cgd goto makeroute;
828 1.1 cgd
829 1.1 cgd case RTM_ADD:
830 1.68 christos if (info->rti_ifa == NULL && (error = rt_getifa(info)))
831 1.39 itojun senderr(error);
832 1.39 itojun ifa = info->rti_ifa;
833 1.1 cgd makeroute:
834 1.72 tls /* Already at splsoftnet() so pool_get/pool_put are safe */
835 1.22 thorpej rt = pool_get(&rtentry_pool, PR_NOWAIT);
836 1.68 christos if (rt == NULL)
837 1.1 cgd senderr(ENOBUFS);
838 1.109 dyoung memset(rt, 0, sizeof(*rt));
839 1.10 mycroft rt->rt_flags = RTF_UP | flags;
840 1.18 kml LIST_INIT(&rt->rt_timer);
841 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
842 1.96 dyoung if (rt_setkey(rt, dst, M_NOWAIT) == NULL ||
843 1.94 dyoung rt_setgate(rt, gateway) != 0) {
844 1.22 thorpej pool_put(&rtentry_pool, rt);
845 1.10 mycroft senderr(ENOBUFS);
846 1.10 mycroft }
847 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
848 1.1 cgd if (netmask) {
849 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
850 1.94 dyoung netmask);
851 1.96 dyoung rt_setkey(rt, (struct sockaddr *)&maskeddst, M_NOWAIT);
852 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
853 1.94 dyoung } else {
854 1.96 dyoung rt_setkey(rt, dst, M_NOWAIT);
855 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
856 1.94 dyoung }
857 1.74 dyoung rt_set_ifa(rt, ifa);
858 1.123 kefren if (info->rti_info[RTAX_TAG] != NULL)
859 1.123 kefren rt_settag(rt, info->rti_info[RTAX_TAG]);
860 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
861 1.122 kefren if (info->rti_info[RTAX_IFP] != NULL &&
862 1.122 kefren (ifa2 = ifa_ifwithnet(info->rti_info[RTAX_IFP])) != NULL &&
863 1.122 kefren ifa2->ifa_ifp != NULL)
864 1.122 kefren rt->rt_ifp = ifa2->ifa_ifp;
865 1.122 kefren else
866 1.122 kefren rt->rt_ifp = ifa->ifa_ifp;
867 1.27 matt if (req == RTM_RESOLVE) {
868 1.1 cgd rt->rt_rmx = (*ret_nrt)->rt_rmx; /* copy metrics */
869 1.41 itojun rt->rt_parent = *ret_nrt;
870 1.41 itojun rt->rt_parent->rt_refcnt++;
871 1.40 itojun }
872 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
873 1.125 dyoung rc = rt_addaddr(rtbl, rt, netmask);
874 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
875 1.125 dyoung if (rc != 0 && (crt = rtalloc1(rt_getkey(rt), 0)) != NULL) {
876 1.40 itojun /* overwrite cloned route */
877 1.40 itojun if ((crt->rt_flags & RTF_CLONED) != 0) {
878 1.40 itojun rtdeletemsg(crt);
879 1.125 dyoung rc = rt_addaddr(rtbl, rt, netmask);
880 1.40 itojun }
881 1.131 rmind rtfree(crt);
882 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
883 1.40 itojun }
884 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
885 1.125 dyoung if (rc != 0) {
886 1.133 rmind ifafree(ifa);
887 1.41 itojun if ((rt->rt_flags & RTF_CLONED) != 0 && rt->rt_parent)
888 1.41 itojun rtfree(rt->rt_parent);
889 1.40 itojun if (rt->rt_gwroute)
890 1.40 itojun rtfree(rt->rt_gwroute);
891 1.94 dyoung rt_destroy(rt);
892 1.40 itojun pool_put(&rtentry_pool, rt);
893 1.125 dyoung senderr(rc);
894 1.27 matt }
895 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
896 1.1 cgd if (ifa->ifa_rtrequest)
897 1.39 itojun ifa->ifa_rtrequest(req, rt, info);
898 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
899 1.1 cgd if (ret_nrt) {
900 1.1 cgd *ret_nrt = rt;
901 1.1 cgd rt->rt_refcnt++;
902 1.41 itojun }
903 1.41 itojun if ((rt->rt_flags & RTF_CLONING) != 0) {
904 1.41 itojun /* clean up any cloned children */
905 1.92 dyoung rtflushclone(dst->sa_family, rt);
906 1.1 cgd }
907 1.82 dyoung rtflushall(dst->sa_family);
908 1.1 cgd break;
909 1.92 dyoung case RTM_GET:
910 1.94 dyoung if (netmask != NULL) {
911 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
912 1.94 dyoung netmask);
913 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
914 1.94 dyoung }
915 1.125 dyoung if ((rt = rt_lookup(rtbl, dst, netmask)) == NULL)
916 1.92 dyoung senderr(ESRCH);
917 1.92 dyoung if (ret_nrt != NULL) {
918 1.92 dyoung *ret_nrt = rt;
919 1.92 dyoung rt->rt_refcnt++;
920 1.92 dyoung }
921 1.92 dyoung break;
922 1.1 cgd }
923 1.1 cgd bad:
924 1.1 cgd splx(s);
925 1.95 dyoung return error;
926 1.1 cgd }
927 1.1 cgd
928 1.10 mycroft int
929 1.94 dyoung rt_setgate(struct rtentry *rt, const struct sockaddr *gate)
930 1.10 mycroft {
931 1.94 dyoung KASSERT(rt != rt->rt_gwroute);
932 1.94 dyoung
933 1.94 dyoung KASSERT(rt->_rt_key != NULL);
934 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
935 1.94 dyoung
936 1.10 mycroft if (rt->rt_gwroute) {
937 1.131 rmind rtfree(rt->rt_gwroute);
938 1.68 christos rt->rt_gwroute = NULL;
939 1.10 mycroft }
940 1.94 dyoung KASSERT(rt->_rt_key != NULL);
941 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
942 1.94 dyoung if (rt->rt_gateway != NULL)
943 1.94 dyoung sockaddr_free(rt->rt_gateway);
944 1.94 dyoung KASSERT(rt->_rt_key != NULL);
945 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
946 1.134 christos if ((rt->rt_gateway = sockaddr_dup(gate, M_ZERO | M_NOWAIT)) == NULL)
947 1.94 dyoung return ENOMEM;
948 1.94 dyoung KASSERT(rt->_rt_key != NULL);
949 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
950 1.94 dyoung
951 1.10 mycroft if (rt->rt_flags & RTF_GATEWAY) {
952 1.94 dyoung KASSERT(rt->_rt_key != NULL);
953 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
954 1.10 mycroft rt->rt_gwroute = rtalloc1(gate, 1);
955 1.27 matt /*
956 1.27 matt * If we switched gateways, grab the MTU from the new
957 1.47 itojun * gateway route if the current MTU, if the current MTU is
958 1.47 itojun * greater than the MTU of gateway.
959 1.47 itojun * Note that, if the MTU of gateway is 0, we will reset the
960 1.47 itojun * MTU of the route to run PMTUD again from scratch. XXX
961 1.27 matt */
962 1.94 dyoung KASSERT(rt->_rt_key != NULL);
963 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
964 1.27 matt if (rt->rt_gwroute
965 1.27 matt && !(rt->rt_rmx.rmx_locks & RTV_MTU)
966 1.47 itojun && rt->rt_rmx.rmx_mtu
967 1.47 itojun && rt->rt_rmx.rmx_mtu > rt->rt_gwroute->rt_rmx.rmx_mtu) {
968 1.27 matt rt->rt_rmx.rmx_mtu = rt->rt_gwroute->rt_rmx.rmx_mtu;
969 1.27 matt }
970 1.10 mycroft }
971 1.94 dyoung KASSERT(rt->_rt_key != NULL);
972 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
973 1.10 mycroft return 0;
974 1.10 mycroft }
975 1.10 mycroft
976 1.141 ozaki static void
977 1.60 matt rt_maskedcopy(const struct sockaddr *src, struct sockaddr *dst,
978 1.60 matt const struct sockaddr *netmask)
979 1.1 cgd {
980 1.94 dyoung const char *netmaskp = &netmask->sa_data[0],
981 1.94 dyoung *srcp = &src->sa_data[0];
982 1.94 dyoung char *dstp = &dst->sa_data[0];
983 1.126 christos const char *maskend = (char *)dst + MIN(netmask->sa_len, src->sa_len);
984 1.126 christos const char *srcend = (char *)dst + src->sa_len;
985 1.94 dyoung
986 1.94 dyoung dst->sa_len = src->sa_len;
987 1.94 dyoung dst->sa_family = src->sa_family;
988 1.94 dyoung
989 1.94 dyoung while (dstp < maskend)
990 1.94 dyoung *dstp++ = *srcp++ & *netmaskp++;
991 1.94 dyoung if (dstp < srcend)
992 1.94 dyoung memset(dstp, 0, (size_t)(srcend - dstp));
993 1.1 cgd }
994 1.10 mycroft
995 1.1 cgd /*
996 1.135 roy * Inform the routing socket of a route change.
997 1.135 roy */
998 1.135 roy void
999 1.154 ozaki rt_newmsg(const int cmd, const struct rtentry *rt)
1000 1.135 roy {
1001 1.135 roy struct rt_addrinfo info;
1002 1.135 roy
1003 1.135 roy memset((void *)&info, 0, sizeof(info));
1004 1.135 roy info.rti_info[RTAX_DST] = rt_getkey(rt);
1005 1.135 roy info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1006 1.135 roy info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1007 1.135 roy if (rt->rt_ifp) {
1008 1.135 roy info.rti_info[RTAX_IFP] = rt->rt_ifp->if_dl->ifa_addr;
1009 1.135 roy info.rti_info[RTAX_IFA] = rt->rt_ifa->ifa_addr;
1010 1.135 roy }
1011 1.135 roy
1012 1.135 roy rt_missmsg(cmd, &info, rt->rt_flags, 0);
1013 1.135 roy }
1014 1.135 roy
1015 1.135 roy /*
1016 1.29 sommerfe * Set up or tear down a routing table entry, normally
1017 1.1 cgd * for an interface.
1018 1.1 cgd */
1019 1.9 mycroft int
1020 1.60 matt rtinit(struct ifaddr *ifa, int cmd, int flags)
1021 1.1 cgd {
1022 1.36 augustss struct rtentry *rt;
1023 1.36 augustss struct sockaddr *dst, *odst;
1024 1.94 dyoung struct sockaddr_storage maskeddst;
1025 1.68 christos struct rtentry *nrt = NULL;
1026 1.1 cgd int error;
1027 1.39 itojun struct rt_addrinfo info;
1028 1.114 dyoung struct sockaddr_dl *sdl;
1029 1.114 dyoung const struct sockaddr_dl *ifsdl;
1030 1.1 cgd
1031 1.1 cgd dst = flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
1032 1.1 cgd if (cmd == RTM_DELETE) {
1033 1.1 cgd if ((flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
1034 1.29 sommerfe /* Delete subnet route for this interface */
1035 1.29 sommerfe odst = dst;
1036 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
1037 1.29 sommerfe rt_maskedcopy(odst, dst, ifa->ifa_netmask);
1038 1.1 cgd }
1039 1.14 christos if ((rt = rtalloc1(dst, 0)) != NULL) {
1040 1.146 ozaki if (rt->rt_ifa != ifa) {
1041 1.146 ozaki rtfree(rt);
1042 1.85 dyoung return (flags & RTF_HOST) ? EHOSTUNREACH
1043 1.85 dyoung : ENETUNREACH;
1044 1.146 ozaki }
1045 1.146 ozaki rtfree(rt);
1046 1.1 cgd }
1047 1.1 cgd }
1048 1.44 thorpej memset(&info, 0, sizeof(info));
1049 1.39 itojun info.rti_ifa = ifa;
1050 1.39 itojun info.rti_flags = flags | ifa->ifa_flags;
1051 1.39 itojun info.rti_info[RTAX_DST] = dst;
1052 1.39 itojun info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1053 1.39 itojun /*
1054 1.39 itojun * XXX here, it seems that we are assuming that ifa_netmask is NULL
1055 1.39 itojun * for RTF_HOST. bsdi4 passes NULL explicitly (via intermediate
1056 1.39 itojun * variable) when RTF_HOST is 1. still not sure if i can safely
1057 1.39 itojun * change it to meet bsdi4 behavior.
1058 1.39 itojun */
1059 1.114 dyoung if (cmd != RTM_LLINFO_UPD)
1060 1.114 dyoung info.rti_info[RTAX_NETMASK] = ifa->ifa_netmask;
1061 1.114 dyoung error = rtrequest1((cmd == RTM_LLINFO_UPD) ? RTM_GET : cmd, &info,
1062 1.114 dyoung &nrt);
1063 1.153 ozaki if (error != 0)
1064 1.146 ozaki return error;
1065 1.146 ozaki
1066 1.153 ozaki rt = nrt;
1067 1.146 ozaki switch (cmd) {
1068 1.114 dyoung case RTM_DELETE:
1069 1.146 ozaki rt_newmsg(cmd, rt);
1070 1.114 dyoung break;
1071 1.114 dyoung case RTM_LLINFO_UPD:
1072 1.114 dyoung RT_DPRINTF("%s: updating%s\n", __func__,
1073 1.114 dyoung ((rt->rt_flags & RTF_LLINFO) == 0) ? " (no llinfo)" : "");
1074 1.114 dyoung
1075 1.114 dyoung ifsdl = ifa->ifa_ifp->if_sadl;
1076 1.114 dyoung
1077 1.114 dyoung if ((rt->rt_flags & RTF_LLINFO) != 0 &&
1078 1.114 dyoung (sdl = satosdl(rt->rt_gateway)) != NULL &&
1079 1.114 dyoung sdl->sdl_family == AF_LINK &&
1080 1.114 dyoung sockaddr_dl_setaddr(sdl, sdl->sdl_len, CLLADDR(ifsdl),
1081 1.114 dyoung ifa->ifa_ifp->if_addrlen) == NULL) {
1082 1.114 dyoung error = EINVAL;
1083 1.114 dyoung break;
1084 1.114 dyoung }
1085 1.114 dyoung
1086 1.114 dyoung if (cmd == RTM_LLINFO_UPD && ifa->ifa_rtrequest != NULL)
1087 1.114 dyoung ifa->ifa_rtrequest(RTM_LLINFO_UPD, rt, &info);
1088 1.146 ozaki rt_newmsg(RTM_CHANGE, rt);
1089 1.114 dyoung break;
1090 1.114 dyoung case RTM_ADD:
1091 1.10 mycroft if (rt->rt_ifa != ifa) {
1092 1.17 christos printf("rtinit: wrong ifa (%p) was (%p)\n", ifa,
1093 1.17 christos rt->rt_ifa);
1094 1.114 dyoung if (rt->rt_ifa->ifa_rtrequest != NULL) {
1095 1.114 dyoung rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt,
1096 1.114 dyoung &info);
1097 1.114 dyoung }
1098 1.74 dyoung rt_replace_ifa(rt, ifa);
1099 1.10 mycroft rt->rt_ifp = ifa->ifa_ifp;
1100 1.114 dyoung if (ifa->ifa_rtrequest != NULL)
1101 1.114 dyoung ifa->ifa_rtrequest(RTM_ADD, rt, &info);
1102 1.10 mycroft }
1103 1.146 ozaki rt_newmsg(cmd, rt);
1104 1.114 dyoung break;
1105 1.1 cgd }
1106 1.147 ozaki rtfree(rt);
1107 1.85 dyoung return error;
1108 1.18 kml }
1109 1.18 kml
1110 1.136 roy /*
1111 1.136 roy * Create a local route entry for the address.
1112 1.136 roy * Announce the addition of the address and the route to the routing socket.
1113 1.136 roy */
1114 1.136 roy int
1115 1.136 roy rt_ifa_addlocal(struct ifaddr *ifa)
1116 1.136 roy {
1117 1.136 roy struct rtentry *rt;
1118 1.136 roy int e;
1119 1.136 roy
1120 1.136 roy /* If there is no loopback entry, allocate one. */
1121 1.136 roy rt = rtalloc1(ifa->ifa_addr, 0);
1122 1.136 roy if (rt == NULL || (rt->rt_flags & RTF_HOST) == 0 ||
1123 1.136 roy (rt->rt_ifp->if_flags & IFF_LOOPBACK) == 0)
1124 1.152 roy {
1125 1.152 roy struct rt_addrinfo info;
1126 1.152 roy struct rtentry *nrt;
1127 1.152 roy
1128 1.152 roy memset(&info, 0, sizeof(info));
1129 1.152 roy info.rti_flags = RTF_HOST | RTF_LOCAL;
1130 1.152 roy if (!(ifa->ifa_ifp->if_flags & (IFF_LOOPBACK|IFF_POINTOPOINT)))
1131 1.152 roy info.rti_flags |= RTF_LLINFO;
1132 1.152 roy info.rti_info[RTAX_DST] = ifa->ifa_addr;
1133 1.152 roy info.rti_info[RTAX_GATEWAY] =
1134 1.152 roy (const struct sockaddr *)ifa->ifa_ifp->if_sadl;
1135 1.152 roy info.rti_ifa = ifa;
1136 1.152 roy nrt = NULL;
1137 1.152 roy e = rtrequest1(RTM_ADD, &info, &nrt);
1138 1.152 roy if (nrt && ifa != nrt->rt_ifa)
1139 1.152 roy rt_replace_ifa(nrt, ifa);
1140 1.152 roy rt_newaddrmsg(RTM_ADD, ifa, e, nrt);
1141 1.152 roy if (nrt != NULL)
1142 1.152 roy rtfree(nrt);
1143 1.152 roy } else {
1144 1.136 roy e = 0;
1145 1.136 roy rt_newaddrmsg(RTM_NEWADDR, ifa, 0, NULL);
1146 1.136 roy }
1147 1.136 roy if (rt != NULL)
1148 1.146 ozaki rtfree(rt);
1149 1.136 roy return e;
1150 1.136 roy }
1151 1.136 roy
1152 1.136 roy /*
1153 1.136 roy * Remove the local route entry for the address.
1154 1.136 roy * Announce the removal of the address and the route to the routing socket.
1155 1.136 roy */
1156 1.136 roy int
1157 1.136 roy rt_ifa_remlocal(struct ifaddr *ifa, struct ifaddr *alt_ifa)
1158 1.136 roy {
1159 1.136 roy struct rtentry *rt;
1160 1.136 roy int e = 0;
1161 1.136 roy
1162 1.136 roy rt = rtalloc1(ifa->ifa_addr, 0);
1163 1.136 roy
1164 1.136 roy /*
1165 1.136 roy * Before deleting, check if a corresponding loopbacked
1166 1.136 roy * host route surely exists. With this check, we can avoid
1167 1.136 roy * deleting an interface direct route whose destination is
1168 1.136 roy * the same as the address being removed. This can happen
1169 1.136 roy * when removing a subnet-router anycast address on an
1170 1.136 roy * interface attached to a shared medium.
1171 1.136 roy */
1172 1.136 roy if (rt != NULL &&
1173 1.136 roy (rt->rt_flags & RTF_HOST) &&
1174 1.136 roy (rt->rt_ifp->if_flags & IFF_LOOPBACK))
1175 1.136 roy {
1176 1.136 roy /* If we cannot replace the route's ifaddr with the equivalent
1177 1.136 roy * ifaddr of another interface, I believe it is safest to
1178 1.136 roy * delete the route.
1179 1.136 roy */
1180 1.152 roy if (alt_ifa == NULL) {
1181 1.152 roy e = rtdeletemsg(rt);
1182 1.152 roy rt_newaddrmsg(RTM_DELADDR, ifa, 0, NULL);
1183 1.152 roy } else {
1184 1.136 roy rt_replace_ifa(rt, alt_ifa);
1185 1.136 roy rt_newmsg(RTM_CHANGE, rt);
1186 1.136 roy }
1187 1.136 roy } else
1188 1.136 roy rt_newaddrmsg(RTM_DELADDR, ifa, 0, NULL);
1189 1.136 roy if (rt != NULL)
1190 1.146 ozaki rtfree(rt);
1191 1.136 roy return e;
1192 1.136 roy }
1193 1.136 roy
1194 1.18 kml /*
1195 1.18 kml * Route timer routines. These routes allow functions to be called
1196 1.18 kml * for various routes at any time. This is useful in supporting
1197 1.18 kml * path MTU discovery and redirect route deletion.
1198 1.18 kml *
1199 1.18 kml * This is similar to some BSDI internal functions, but it provides
1200 1.18 kml * for multiple queues for efficiency's sake...
1201 1.18 kml */
1202 1.18 kml
1203 1.18 kml LIST_HEAD(, rttimer_queue) rttimer_queue_head;
1204 1.18 kml static int rt_init_done = 0;
1205 1.18 kml
1206 1.60 matt #define RTTIMER_CALLOUT(r) do { \
1207 1.60 matt if (r->rtt_func != NULL) { \
1208 1.60 matt (*r->rtt_func)(r->rtt_rt, r); \
1209 1.60 matt } else { \
1210 1.60 matt rtrequest((int) RTM_DELETE, \
1211 1.94 dyoung rt_getkey(r->rtt_rt), \
1212 1.60 matt 0, 0, 0, 0); \
1213 1.60 matt } \
1214 1.60 matt } while (/*CONSTCOND*/0)
1215 1.18 kml
1216 1.65 perry /*
1217 1.18 kml * Some subtle order problems with domain initialization mean that
1218 1.18 kml * we cannot count on this being run from rt_init before various
1219 1.18 kml * protocol initializations are done. Therefore, we make sure
1220 1.18 kml * that this is run when the first queue is added...
1221 1.18 kml */
1222 1.18 kml
1223 1.65 perry void
1224 1.60 matt rt_timer_init(void)
1225 1.18 kml {
1226 1.18 kml assert(rt_init_done == 0);
1227 1.18 kml
1228 1.18 kml LIST_INIT(&rttimer_queue_head);
1229 1.93 ad callout_init(&rt_timer_ch, 0);
1230 1.35 thorpej callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1231 1.18 kml rt_init_done = 1;
1232 1.18 kml }
1233 1.18 kml
1234 1.18 kml struct rttimer_queue *
1235 1.60 matt rt_timer_queue_create(u_int timeout)
1236 1.18 kml {
1237 1.18 kml struct rttimer_queue *rtq;
1238 1.18 kml
1239 1.18 kml if (rt_init_done == 0)
1240 1.18 kml rt_timer_init();
1241 1.18 kml
1242 1.18 kml R_Malloc(rtq, struct rttimer_queue *, sizeof *rtq);
1243 1.18 kml if (rtq == NULL)
1244 1.85 dyoung return NULL;
1245 1.109 dyoung memset(rtq, 0, sizeof(*rtq));
1246 1.18 kml
1247 1.18 kml rtq->rtq_timeout = timeout;
1248 1.24 thorpej TAILQ_INIT(&rtq->rtq_head);
1249 1.18 kml LIST_INSERT_HEAD(&rttimer_queue_head, rtq, rtq_link);
1250 1.18 kml
1251 1.85 dyoung return rtq;
1252 1.18 kml }
1253 1.18 kml
1254 1.18 kml void
1255 1.60 matt rt_timer_queue_change(struct rttimer_queue *rtq, long timeout)
1256 1.18 kml {
1257 1.24 thorpej
1258 1.18 kml rtq->rtq_timeout = timeout;
1259 1.18 kml }
1260 1.18 kml
1261 1.18 kml void
1262 1.60 matt rt_timer_queue_remove_all(struct rttimer_queue *rtq, int destroy)
1263 1.18 kml {
1264 1.24 thorpej struct rttimer *r;
1265 1.18 kml
1266 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL) {
1267 1.18 kml LIST_REMOVE(r, rtt_link);
1268 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
1269 1.24 thorpej if (destroy)
1270 1.18 kml RTTIMER_CALLOUT(r);
1271 1.150 ozaki rtfree(r->rtt_rt);
1272 1.72 tls /* we are already at splsoftnet */
1273 1.22 thorpej pool_put(&rttimer_pool, r);
1274 1.37 itojun if (rtq->rtq_count > 0)
1275 1.37 itojun rtq->rtq_count--;
1276 1.37 itojun else
1277 1.55 itojun printf("rt_timer_queue_remove_all: "
1278 1.55 itojun "rtq_count reached 0\n");
1279 1.18 kml }
1280 1.55 itojun }
1281 1.55 itojun
1282 1.55 itojun void
1283 1.60 matt rt_timer_queue_destroy(struct rttimer_queue *rtq, int destroy)
1284 1.55 itojun {
1285 1.55 itojun
1286 1.55 itojun rt_timer_queue_remove_all(rtq, destroy);
1287 1.18 kml
1288 1.18 kml LIST_REMOVE(rtq, rtq_link);
1289 1.22 thorpej
1290 1.22 thorpej /*
1291 1.22 thorpej * Caller is responsible for freeing the rttimer_queue structure.
1292 1.22 thorpej */
1293 1.18 kml }
1294 1.18 kml
1295 1.37 itojun unsigned long
1296 1.60 matt rt_timer_count(struct rttimer_queue *rtq)
1297 1.37 itojun {
1298 1.37 itojun return rtq->rtq_count;
1299 1.37 itojun }
1300 1.37 itojun
1301 1.65 perry void
1302 1.60 matt rt_timer_remove_all(struct rtentry *rt, int destroy)
1303 1.18 kml {
1304 1.24 thorpej struct rttimer *r;
1305 1.18 kml
1306 1.24 thorpej while ((r = LIST_FIRST(&rt->rt_timer)) != NULL) {
1307 1.18 kml LIST_REMOVE(r, rtt_link);
1308 1.24 thorpej TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
1309 1.54 itojun if (destroy)
1310 1.54 itojun RTTIMER_CALLOUT(r);
1311 1.37 itojun if (r->rtt_queue->rtq_count > 0)
1312 1.37 itojun r->rtt_queue->rtq_count--;
1313 1.37 itojun else
1314 1.37 itojun printf("rt_timer_remove_all: rtq_count reached 0\n");
1315 1.150 ozaki rtfree(r->rtt_rt);
1316 1.72 tls /* we are already at splsoftnet */
1317 1.38 itojun pool_put(&rttimer_pool, r);
1318 1.18 kml }
1319 1.18 kml }
1320 1.18 kml
1321 1.65 perry int
1322 1.60 matt rt_timer_add(struct rtentry *rt,
1323 1.60 matt void (*func)(struct rtentry *, struct rttimer *),
1324 1.60 matt struct rttimer_queue *queue)
1325 1.18 kml {
1326 1.24 thorpej struct rttimer *r;
1327 1.72 tls int s;
1328 1.18 kml
1329 1.24 thorpej /*
1330 1.24 thorpej * If there's already a timer with this action, destroy it before
1331 1.24 thorpej * we add a new one.
1332 1.24 thorpej */
1333 1.85 dyoung LIST_FOREACH(r, &rt->rt_timer, rtt_link) {
1334 1.85 dyoung if (r->rtt_func == func)
1335 1.85 dyoung break;
1336 1.85 dyoung }
1337 1.85 dyoung if (r != NULL) {
1338 1.85 dyoung LIST_REMOVE(r, rtt_link);
1339 1.85 dyoung TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
1340 1.85 dyoung if (r->rtt_queue->rtq_count > 0)
1341 1.85 dyoung r->rtt_queue->rtq_count--;
1342 1.85 dyoung else
1343 1.85 dyoung printf("rt_timer_add: rtq_count reached 0\n");
1344 1.150 ozaki rtfree(r->rtt_rt);
1345 1.85 dyoung } else {
1346 1.85 dyoung s = splsoftnet();
1347 1.85 dyoung r = pool_get(&rttimer_pool, PR_NOWAIT);
1348 1.85 dyoung splx(s);
1349 1.85 dyoung if (r == NULL)
1350 1.85 dyoung return ENOBUFS;
1351 1.18 kml }
1352 1.18 kml
1353 1.85 dyoung memset(r, 0, sizeof(*r));
1354 1.24 thorpej
1355 1.150 ozaki rt->rt_refcnt++;
1356 1.24 thorpej r->rtt_rt = rt;
1357 1.70 kardel r->rtt_time = time_uptime;
1358 1.24 thorpej r->rtt_func = func;
1359 1.24 thorpej r->rtt_queue = queue;
1360 1.24 thorpej LIST_INSERT_HEAD(&rt->rt_timer, r, rtt_link);
1361 1.24 thorpej TAILQ_INSERT_TAIL(&queue->rtq_head, r, rtt_next);
1362 1.37 itojun r->rtt_queue->rtq_count++;
1363 1.65 perry
1364 1.95 dyoung return 0;
1365 1.18 kml }
1366 1.18 kml
1367 1.18 kml /* ARGSUSED */
1368 1.18 kml void
1369 1.76 christos rt_timer_timer(void *arg)
1370 1.18 kml {
1371 1.24 thorpej struct rttimer_queue *rtq;
1372 1.24 thorpej struct rttimer *r;
1373 1.24 thorpej int s;
1374 1.21 kml
1375 1.24 thorpej s = splsoftnet();
1376 1.85 dyoung LIST_FOREACH(rtq, &rttimer_queue_head, rtq_link) {
1377 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL &&
1378 1.70 kardel (r->rtt_time + rtq->rtq_timeout) < time_uptime) {
1379 1.24 thorpej LIST_REMOVE(r, rtt_link);
1380 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
1381 1.24 thorpej RTTIMER_CALLOUT(r);
1382 1.150 ozaki rtfree(r->rtt_rt);
1383 1.24 thorpej pool_put(&rttimer_pool, r);
1384 1.37 itojun if (rtq->rtq_count > 0)
1385 1.37 itojun rtq->rtq_count--;
1386 1.37 itojun else
1387 1.37 itojun printf("rt_timer_timer: rtq_count reached 0\n");
1388 1.18 kml }
1389 1.18 kml }
1390 1.24 thorpej splx(s);
1391 1.18 kml
1392 1.35 thorpej callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1393 1.1 cgd }
1394 1.83 joerg
1395 1.102 dyoung static struct rtentry *
1396 1.84 joerg _rtcache_init(struct route *ro, int flag)
1397 1.84 joerg {
1398 1.114 dyoung rtcache_invariants(ro);
1399 1.99 dyoung KASSERT(ro->_ro_rt == NULL);
1400 1.84 joerg
1401 1.90 dyoung if (rtcache_getdst(ro) == NULL)
1402 1.102 dyoung return NULL;
1403 1.105 dyoung ro->ro_invalid = false;
1404 1.105 dyoung if ((ro->_ro_rt = rtalloc1(rtcache_getdst(ro), flag)) != NULL)
1405 1.105 dyoung rtcache(ro);
1406 1.103 dyoung
1407 1.114 dyoung rtcache_invariants(ro);
1408 1.102 dyoung return ro->_ro_rt;
1409 1.84 joerg }
1410 1.84 joerg
1411 1.102 dyoung struct rtentry *
1412 1.83 joerg rtcache_init(struct route *ro)
1413 1.83 joerg {
1414 1.102 dyoung return _rtcache_init(ro, 1);
1415 1.83 joerg }
1416 1.83 joerg
1417 1.102 dyoung struct rtentry *
1418 1.83 joerg rtcache_init_noclone(struct route *ro)
1419 1.83 joerg {
1420 1.102 dyoung return _rtcache_init(ro, 0);
1421 1.83 joerg }
1422 1.90 dyoung
1423 1.102 dyoung struct rtentry *
1424 1.90 dyoung rtcache_update(struct route *ro, int clone)
1425 1.90 dyoung {
1426 1.90 dyoung rtcache_clear(ro);
1427 1.102 dyoung return _rtcache_init(ro, clone);
1428 1.90 dyoung }
1429 1.83 joerg
1430 1.83 joerg void
1431 1.90 dyoung rtcache_copy(struct route *new_ro, const struct route *old_ro)
1432 1.83 joerg {
1433 1.103 dyoung struct rtentry *rt;
1434 1.103 dyoung
1435 1.103 dyoung KASSERT(new_ro != old_ro);
1436 1.114 dyoung rtcache_invariants(new_ro);
1437 1.114 dyoung rtcache_invariants(old_ro);
1438 1.103 dyoung
1439 1.104 dyoung if ((rt = rtcache_validate(old_ro)) != NULL)
1440 1.103 dyoung rt->rt_refcnt++;
1441 1.103 dyoung
1442 1.90 dyoung if (rtcache_getdst(old_ro) == NULL ||
1443 1.90 dyoung rtcache_setdst(new_ro, rtcache_getdst(old_ro)) != 0)
1444 1.90 dyoung return;
1445 1.103 dyoung
1446 1.105 dyoung new_ro->ro_invalid = false;
1447 1.103 dyoung if ((new_ro->_ro_rt = rt) != NULL)
1448 1.86 dyoung rtcache(new_ro);
1449 1.114 dyoung rtcache_invariants(new_ro);
1450 1.83 joerg }
1451 1.83 joerg
1452 1.105 dyoung static struct dom_rtlist invalid_routes = LIST_HEAD_INITIALIZER(dom_rtlist);
1453 1.105 dyoung
1454 1.144 ozaki static void
1455 1.105 dyoung rtcache_invalidate(struct dom_rtlist *rtlist)
1456 1.83 joerg {
1457 1.105 dyoung struct route *ro;
1458 1.99 dyoung
1459 1.105 dyoung while ((ro = LIST_FIRST(rtlist)) != NULL) {
1460 1.114 dyoung rtcache_invariants(ro);
1461 1.105 dyoung KASSERT(ro->_ro_rt != NULL);
1462 1.105 dyoung ro->ro_invalid = true;
1463 1.99 dyoung LIST_REMOVE(ro, ro_rtcache_next);
1464 1.105 dyoung LIST_INSERT_HEAD(&invalid_routes, ro, ro_rtcache_next);
1465 1.114 dyoung rtcache_invariants(ro);
1466 1.84 joerg }
1467 1.105 dyoung }
1468 1.105 dyoung
1469 1.144 ozaki static void
1470 1.105 dyoung rtcache_clear(struct route *ro)
1471 1.105 dyoung {
1472 1.114 dyoung rtcache_invariants(ro);
1473 1.105 dyoung if (ro->_ro_rt == NULL)
1474 1.105 dyoung return;
1475 1.105 dyoung
1476 1.105 dyoung LIST_REMOVE(ro, ro_rtcache_next);
1477 1.105 dyoung
1478 1.131 rmind rtfree(ro->_ro_rt);
1479 1.105 dyoung ro->_ro_rt = NULL;
1480 1.114 dyoung ro->ro_invalid = false;
1481 1.114 dyoung rtcache_invariants(ro);
1482 1.83 joerg }
1483 1.83 joerg
1484 1.90 dyoung struct rtentry *
1485 1.91 dyoung rtcache_lookup2(struct route *ro, const struct sockaddr *dst, int clone,
1486 1.91 dyoung int *hitp)
1487 1.90 dyoung {
1488 1.90 dyoung const struct sockaddr *odst;
1489 1.104 dyoung struct rtentry *rt = NULL;
1490 1.90 dyoung
1491 1.90 dyoung odst = rtcache_getdst(ro);
1492 1.138 ozaki if (odst == NULL)
1493 1.138 ozaki goto miss;
1494 1.90 dyoung
1495 1.138 ozaki if (sockaddr_cmp(odst, dst) != 0) {
1496 1.90 dyoung rtcache_free(ro);
1497 1.138 ozaki goto miss;
1498 1.138 ozaki }
1499 1.138 ozaki
1500 1.138 ozaki rt = rtcache_validate(ro);
1501 1.138 ozaki if (rt == NULL) {
1502 1.91 dyoung rtcache_clear(ro);
1503 1.138 ozaki goto miss;
1504 1.138 ozaki }
1505 1.138 ozaki
1506 1.138 ozaki *hitp = 1;
1507 1.138 ozaki rtcache_invariants(ro);
1508 1.90 dyoung
1509 1.138 ozaki return rt;
1510 1.138 ozaki miss:
1511 1.138 ozaki *hitp = 0;
1512 1.138 ozaki if (rtcache_setdst(ro, dst) == 0)
1513 1.138 ozaki rt = _rtcache_init(ro, clone);
1514 1.90 dyoung
1515 1.114 dyoung rtcache_invariants(ro);
1516 1.114 dyoung
1517 1.104 dyoung return rt;
1518 1.90 dyoung }
1519 1.90 dyoung
1520 1.83 joerg void
1521 1.86 dyoung rtcache_free(struct route *ro)
1522 1.86 dyoung {
1523 1.86 dyoung rtcache_clear(ro);
1524 1.86 dyoung if (ro->ro_sa != NULL) {
1525 1.86 dyoung sockaddr_free(ro->ro_sa);
1526 1.86 dyoung ro->ro_sa = NULL;
1527 1.86 dyoung }
1528 1.114 dyoung rtcache_invariants(ro);
1529 1.86 dyoung }
1530 1.86 dyoung
1531 1.90 dyoung int
1532 1.90 dyoung rtcache_setdst(struct route *ro, const struct sockaddr *sa)
1533 1.83 joerg {
1534 1.90 dyoung KASSERT(sa != NULL);
1535 1.90 dyoung
1536 1.114 dyoung rtcache_invariants(ro);
1537 1.142 ozaki if (ro->ro_sa != NULL) {
1538 1.142 ozaki if (ro->ro_sa->sa_family == sa->sa_family) {
1539 1.142 ozaki rtcache_clear(ro);
1540 1.142 ozaki sockaddr_copy(ro->ro_sa, ro->ro_sa->sa_len, sa);
1541 1.143 ozaki rtcache_invariants(ro);
1542 1.143 ozaki return 0;
1543 1.114 dyoung }
1544 1.143 ozaki /* free ro_sa, wrong family */
1545 1.143 ozaki rtcache_free(ro);
1546 1.142 ozaki }
1547 1.90 dyoung
1548 1.107 dyoung KASSERT(ro->_ro_rt == NULL);
1549 1.107 dyoung
1550 1.134 christos if ((ro->ro_sa = sockaddr_dup(sa, M_ZERO | M_NOWAIT)) == NULL) {
1551 1.114 dyoung rtcache_invariants(ro);
1552 1.90 dyoung return ENOMEM;
1553 1.107 dyoung }
1554 1.114 dyoung rtcache_invariants(ro);
1555 1.90 dyoung return 0;
1556 1.83 joerg }
1557 1.92 dyoung
1558 1.123 kefren const struct sockaddr *
1559 1.123 kefren rt_settag(struct rtentry *rt, const struct sockaddr *tag)
1560 1.123 kefren {
1561 1.123 kefren if (rt->rt_tag != tag) {
1562 1.123 kefren if (rt->rt_tag != NULL)
1563 1.123 kefren sockaddr_free(rt->rt_tag);
1564 1.134 christos rt->rt_tag = sockaddr_dup(tag, M_ZERO | M_NOWAIT);
1565 1.123 kefren }
1566 1.123 kefren return rt->rt_tag;
1567 1.123 kefren }
1568 1.123 kefren
1569 1.123 kefren struct sockaddr *
1570 1.123 kefren rt_gettag(struct rtentry *rt)
1571 1.123 kefren {
1572 1.123 kefren return rt->rt_tag;
1573 1.123 kefren }
1574