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