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