route.c revision 1.235 1 1.235 knakahar /* $NetBSD: route.c,v 1.235 2022/11/25 08:39:32 knakahara Exp $ */
2 1.18 kml
3 1.18 kml /*-
4 1.106 ad * Copyright (c) 1998, 2008 The NetBSD Foundation, Inc.
5 1.18 kml * All rights reserved.
6 1.18 kml *
7 1.18 kml * This code is derived from software contributed to The NetBSD Foundation
8 1.18 kml * by Kevin M. Lahey of the Numerical Aerospace Simulation Facility,
9 1.18 kml * NASA Ames Research Center.
10 1.18 kml *
11 1.18 kml * Redistribution and use in source and binary forms, with or without
12 1.18 kml * modification, are permitted provided that the following conditions
13 1.18 kml * are met:
14 1.18 kml * 1. Redistributions of source code must retain the above copyright
15 1.18 kml * notice, this list of conditions and the following disclaimer.
16 1.18 kml * 2. Redistributions in binary form must reproduce the above copyright
17 1.18 kml * notice, this list of conditions and the following disclaimer in the
18 1.18 kml * documentation and/or other materials provided with the distribution.
19 1.18 kml *
20 1.18 kml * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
21 1.18 kml * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
22 1.18 kml * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
23 1.18 kml * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
24 1.18 kml * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
25 1.18 kml * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
26 1.18 kml * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
27 1.18 kml * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
28 1.18 kml * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
29 1.18 kml * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
30 1.18 kml * POSSIBILITY OF SUCH DAMAGE.
31 1.18 kml */
32 1.11 cgd
33 1.1 cgd /*
34 1.25 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
35 1.25 itojun * All rights reserved.
36 1.65 perry *
37 1.25 itojun * Redistribution and use in source and binary forms, with or without
38 1.25 itojun * modification, are permitted provided that the following conditions
39 1.25 itojun * are met:
40 1.25 itojun * 1. Redistributions of source code must retain the above copyright
41 1.25 itojun * notice, this list of conditions and the following disclaimer.
42 1.25 itojun * 2. Redistributions in binary form must reproduce the above copyright
43 1.25 itojun * notice, this list of conditions and the following disclaimer in the
44 1.25 itojun * documentation and/or other materials provided with the distribution.
45 1.25 itojun * 3. Neither the name of the project nor the names of its contributors
46 1.25 itojun * may be used to endorse or promote products derived from this software
47 1.25 itojun * without specific prior written permission.
48 1.65 perry *
49 1.25 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
50 1.25 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
51 1.25 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
52 1.25 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
53 1.25 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
54 1.25 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
55 1.25 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
56 1.25 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
57 1.25 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
58 1.25 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
59 1.25 itojun * SUCH DAMAGE.
60 1.25 itojun */
61 1.25 itojun
62 1.25 itojun /*
63 1.10 mycroft * Copyright (c) 1980, 1986, 1991, 1993
64 1.10 mycroft * The Regents of the University of California. All rights reserved.
65 1.1 cgd *
66 1.1 cgd * Redistribution and use in source and binary forms, with or without
67 1.1 cgd * modification, are permitted provided that the following conditions
68 1.1 cgd * are met:
69 1.1 cgd * 1. Redistributions of source code must retain the above copyright
70 1.1 cgd * notice, this list of conditions and the following disclaimer.
71 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
72 1.1 cgd * notice, this list of conditions and the following disclaimer in the
73 1.1 cgd * documentation and/or other materials provided with the distribution.
74 1.58 agc * 3. Neither the name of the University nor the names of its contributors
75 1.1 cgd * may be used to endorse or promote products derived from this software
76 1.1 cgd * without specific prior written permission.
77 1.1 cgd *
78 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
79 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
80 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
81 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
82 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
83 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
84 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
85 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
86 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
87 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
88 1.1 cgd * SUCH DAMAGE.
89 1.1 cgd *
90 1.17 christos * @(#)route.c 8.3 (Berkeley) 1/9/95
91 1.1 cgd */
92 1.50 lukem
93 1.149 pooka #ifdef _KERNEL_OPT
94 1.136 roy #include "opt_inet.h"
95 1.90 dyoung #include "opt_route.h"
96 1.175 ozaki #include "opt_net_mpsafe.h"
97 1.149 pooka #endif
98 1.90 dyoung
99 1.50 lukem #include <sys/cdefs.h>
100 1.235 knakahar __KERNEL_RCSID(0, "$NetBSD: route.c,v 1.235 2022/11/25 08:39:32 knakahara Exp $");
101 1.2 cgd
102 1.5 mycroft #include <sys/param.h>
103 1.140 ozaki #ifdef RTFLUSH_DEBUG
104 1.90 dyoung #include <sys/sysctl.h>
105 1.140 ozaki #endif
106 1.5 mycroft #include <sys/systm.h>
107 1.35 thorpej #include <sys/callout.h>
108 1.5 mycroft #include <sys/proc.h>
109 1.5 mycroft #include <sys/mbuf.h>
110 1.5 mycroft #include <sys/socket.h>
111 1.5 mycroft #include <sys/socketvar.h>
112 1.5 mycroft #include <sys/domain.h>
113 1.18 kml #include <sys/kernel.h>
114 1.5 mycroft #include <sys/ioctl.h>
115 1.22 thorpej #include <sys/pool.h>
116 1.119 elad #include <sys/kauth.h>
117 1.170 ozaki #include <sys/workqueue.h>
118 1.182 ozaki #include <sys/syslog.h>
119 1.183 ozaki #include <sys/rwlock.h>
120 1.183 ozaki #include <sys/mutex.h>
121 1.183 ozaki #include <sys/cpu.h>
122 1.221 ozaki #include <sys/kmem.h>
123 1.1 cgd
124 1.5 mycroft #include <net/if.h>
125 1.114 dyoung #include <net/if_dl.h>
126 1.5 mycroft #include <net/route.h>
127 1.196 ozaki #if defined(INET) || defined(INET6)
128 1.196 ozaki #include <net/if_llatbl.h>
129 1.196 ozaki #endif
130 1.1 cgd
131 1.5 mycroft #include <netinet/in.h>
132 1.5 mycroft #include <netinet/in_var.h>
133 1.1 cgd
134 1.209 ozaki #define PRESERVED_RTF (RTF_UP | RTF_GATEWAY | RTF_HOST | RTF_DONE | RTF_MASK)
135 1.209 ozaki
136 1.90 dyoung #ifdef RTFLUSH_DEBUG
137 1.90 dyoung #define rtcache_debug() __predict_false(_rtcache_debug)
138 1.90 dyoung #else /* RTFLUSH_DEBUG */
139 1.90 dyoung #define rtcache_debug() 0
140 1.90 dyoung #endif /* RTFLUSH_DEBUG */
141 1.5 mycroft
142 1.183 ozaki #ifdef RT_DEBUG
143 1.183 ozaki #define RT_REFCNT_TRACE(rt) printf("%s:%d: rt=%p refcnt=%d\n", \
144 1.183 ozaki __func__, __LINE__, (rt), (rt)->rt_refcnt)
145 1.183 ozaki #else
146 1.183 ozaki #define RT_REFCNT_TRACE(rt) do {} while (0)
147 1.183 ozaki #endif
148 1.183 ozaki
149 1.204 ozaki #ifdef RT_DEBUG
150 1.183 ozaki #define dlog(level, fmt, args...) log(level, fmt, ##args)
151 1.183 ozaki #else
152 1.183 ozaki #define dlog(level, fmt, args...) do {} while (0)
153 1.183 ozaki #endif
154 1.183 ozaki
155 1.155 ozaki struct rtstat rtstat;
156 1.1 cgd
157 1.155 ozaki static int rttrash; /* routes not in table but not freed */
158 1.1 cgd
159 1.155 ozaki static struct pool rtentry_pool;
160 1.155 ozaki static struct pool rttimer_pool;
161 1.22 thorpej
162 1.155 ozaki static struct callout rt_timer_ch; /* callout for rt_timer_timer() */
163 1.177 ozaki static struct workqueue *rt_timer_wq;
164 1.177 ozaki static struct work rt_timer_wk;
165 1.177 ozaki
166 1.177 ozaki static void rt_timer_init(void);
167 1.181 ozaki static void rt_timer_queue_remove_all(struct rttimer_queue *);
168 1.178 ozaki static void rt_timer_remove_all(struct rtentry *);
169 1.177 ozaki static void rt_timer_timer(void *);
170 1.35 thorpej
171 1.183 ozaki /*
172 1.183 ozaki * Locking notes:
173 1.183 ozaki * - The routing table is protected by a global rwlock
174 1.183 ozaki * - API: RT_RLOCK and friends
175 1.200 ozaki * - rtcaches are NOT protected by the framework
176 1.200 ozaki * - Callers must guarantee a rtcache isn't accessed simultaneously
177 1.230 msaitoh * - How the constraint is guaranteed in the wild
178 1.200 ozaki * - Protect a rtcache by a mutex (e.g., inp_route)
179 1.200 ozaki * - Make rtcache per-CPU and allow only accesses from softint
180 1.200 ozaki * (e.g., ipforward_rt_percpu)
181 1.183 ozaki * - References to a rtentry is managed by reference counting and psref
182 1.229 knakahar * - Reference counting is used for temporal reference when a rtentry
183 1.183 ozaki * is fetched from the routing table
184 1.183 ozaki * - psref is used for temporal reference when a rtentry is fetched
185 1.183 ozaki * from a rtcache
186 1.183 ozaki * - struct route (rtcache) has struct psref, so we cannot obtain
187 1.183 ozaki * a reference twice on the same struct route
188 1.228 knakahar * - Before destroying or updating a rtentry, we have to wait for
189 1.183 ozaki * all references left (see below for details)
190 1.183 ozaki * - APIs
191 1.183 ozaki * - An obtained rtentry via rtalloc1 or rtrequest* must be
192 1.183 ozaki * unreferenced by rt_unref
193 1.183 ozaki * - An obtained rtentry via rtcache_* must be unreferenced by
194 1.183 ozaki * rtcache_unref
195 1.183 ozaki * - TODO: once we get a lockless routing table, we should use only
196 1.183 ozaki * psref for rtentries
197 1.183 ozaki * - rtentry destruction
198 1.183 ozaki * - A rtentry is destroyed (freed) only when we call rtrequest(RTM_DELETE)
199 1.183 ozaki * - If a caller of rtrequest grabs a reference of a rtentry, the caller
200 1.183 ozaki * has a responsibility to destroy the rtentry by itself by calling
201 1.183 ozaki * rt_free
202 1.183 ozaki * - If not, rtrequest itself does that
203 1.183 ozaki * - If rt_free is called in softint, the actual destruction routine is
204 1.183 ozaki * deferred to a workqueue
205 1.183 ozaki * - rtentry update
206 1.183 ozaki * - When updating a rtentry, RTF_UPDATING flag is set
207 1.183 ozaki * - If a rtentry is set RTF_UPDATING, fetching the rtentry from
208 1.183 ozaki * the routing table or a rtcache results in either of the following
209 1.183 ozaki * cases:
210 1.183 ozaki * - if the caller runs in softint, the caller fails to fetch
211 1.183 ozaki * - otherwise, the caller waits for the update completed and retries
212 1.183 ozaki * to fetch (probably succeed to fetch for the second time)
213 1.199 ozaki * - rtcache invalidation
214 1.199 ozaki * - There is a global generation counter that is incremented when
215 1.199 ozaki * any routes have been added or deleted
216 1.199 ozaki * - When a rtcache caches a rtentry into itself, it also stores
217 1.199 ozaki * a snapshot of the generation counter
218 1.199 ozaki * - If the snapshot equals to the global counter, the cache is valid,
219 1.199 ozaki * otherwise the cache is invalidated
220 1.183 ozaki */
221 1.183 ozaki
222 1.183 ozaki /*
223 1.200 ozaki * Global lock for the routing table.
224 1.183 ozaki */
225 1.183 ozaki static krwlock_t rt_lock __cacheline_aligned;
226 1.183 ozaki #ifdef NET_MPSAFE
227 1.183 ozaki #define RT_RLOCK() rw_enter(&rt_lock, RW_READER)
228 1.183 ozaki #define RT_WLOCK() rw_enter(&rt_lock, RW_WRITER)
229 1.183 ozaki #define RT_UNLOCK() rw_exit(&rt_lock)
230 1.209 ozaki #define RT_WLOCKED() rw_write_held(&rt_lock)
231 1.183 ozaki #define RT_ASSERT_WLOCK() KASSERT(rw_write_held(&rt_lock))
232 1.183 ozaki #else
233 1.183 ozaki #define RT_RLOCK() do {} while (0)
234 1.183 ozaki #define RT_WLOCK() do {} while (0)
235 1.183 ozaki #define RT_UNLOCK() do {} while (0)
236 1.209 ozaki #define RT_WLOCKED() true
237 1.183 ozaki #define RT_ASSERT_WLOCK() do {} while (0)
238 1.183 ozaki #endif
239 1.183 ozaki
240 1.199 ozaki static uint64_t rtcache_generation;
241 1.199 ozaki
242 1.183 ozaki /*
243 1.183 ozaki * mutex and cv that are used to wait for references to a rtentry left
244 1.183 ozaki * before updating the rtentry.
245 1.183 ozaki */
246 1.183 ozaki static struct {
247 1.183 ozaki kmutex_t lock;
248 1.183 ozaki kcondvar_t cv;
249 1.183 ozaki bool ongoing;
250 1.183 ozaki const struct lwp *lwp;
251 1.183 ozaki } rt_update_global __cacheline_aligned;
252 1.183 ozaki
253 1.183 ozaki /*
254 1.183 ozaki * A workqueue and stuff that are used to defer the destruction routine
255 1.183 ozaki * of rtentries.
256 1.183 ozaki */
257 1.183 ozaki static struct {
258 1.183 ozaki struct workqueue *wq;
259 1.183 ozaki struct work wk;
260 1.183 ozaki kmutex_t lock;
261 1.203 christos SLIST_HEAD(, rtentry) queue;
262 1.206 ozaki bool enqueued;
263 1.183 ozaki } rt_free_global __cacheline_aligned;
264 1.183 ozaki
265 1.183 ozaki /* psref for rtentry */
266 1.183 ozaki static struct psref_class *rt_psref_class __read_mostly;
267 1.183 ozaki
268 1.90 dyoung #ifdef RTFLUSH_DEBUG
269 1.90 dyoung static int _rtcache_debug = 0;
270 1.90 dyoung #endif /* RTFLUSH_DEBUG */
271 1.90 dyoung
272 1.119 elad static kauth_listener_t route_listener;
273 1.119 elad
274 1.60 matt static int rtdeletemsg(struct rtentry *);
275 1.40 itojun
276 1.141 ozaki static void rt_maskedcopy(const struct sockaddr *,
277 1.141 ozaki struct sockaddr *, const struct sockaddr *);
278 1.141 ozaki
279 1.199 ozaki static void rtcache_invalidate(void);
280 1.144 ozaki
281 1.183 ozaki static void rt_ref(struct rtentry *);
282 1.183 ozaki
283 1.183 ozaki static struct rtentry *
284 1.195 ozaki rtalloc1_locked(const struct sockaddr *, int, bool, bool);
285 1.183 ozaki
286 1.209 ozaki static struct ifaddr *rt_getifa(struct rt_addrinfo *, struct psref *);
287 1.209 ozaki static struct ifnet *rt_getifp(struct rt_addrinfo *, struct psref *);
288 1.209 ozaki static struct ifaddr *ifa_ifwithroute_psref(int, const struct sockaddr *,
289 1.209 ozaki const struct sockaddr *, struct psref *);
290 1.209 ozaki
291 1.183 ozaki static void rtcache_ref(struct rtentry *, struct route *);
292 1.183 ozaki
293 1.188 ozaki #ifdef NET_MPSAFE
294 1.183 ozaki static void rt_update_wait(void);
295 1.188 ozaki #endif
296 1.183 ozaki
297 1.183 ozaki static bool rt_wait_ok(void);
298 1.183 ozaki static void rt_wait_refcnt(const char *, struct rtentry *, int);
299 1.183 ozaki static void rt_wait_psref(struct rtentry *);
300 1.183 ozaki
301 1.162 ozaki #ifdef DDB
302 1.162 ozaki static void db_print_sa(const struct sockaddr *);
303 1.162 ozaki static void db_print_ifa(struct ifaddr *);
304 1.162 ozaki static int db_show_rtentry(struct rtentry *, void *);
305 1.162 ozaki #endif
306 1.162 ozaki
307 1.90 dyoung #ifdef RTFLUSH_DEBUG
308 1.118 pooka static void sysctl_net_rtcache_setup(struct sysctllog **);
309 1.118 pooka static void
310 1.118 pooka sysctl_net_rtcache_setup(struct sysctllog **clog)
311 1.90 dyoung {
312 1.90 dyoung const struct sysctlnode *rnode;
313 1.90 dyoung
314 1.90 dyoung if (sysctl_createv(clog, 0, NULL, &rnode, CTLFLAG_PERMANENT,
315 1.90 dyoung CTLTYPE_NODE,
316 1.90 dyoung "rtcache", SYSCTL_DESCR("Route cache related settings"),
317 1.128 pooka NULL, 0, NULL, 0, CTL_NET, CTL_CREATE, CTL_EOL) != 0)
318 1.90 dyoung return;
319 1.90 dyoung if (sysctl_createv(clog, 0, &rnode, &rnode,
320 1.90 dyoung CTLFLAG_PERMANENT|CTLFLAG_READWRITE, CTLTYPE_INT,
321 1.90 dyoung "debug", SYSCTL_DESCR("Debug route caches"),
322 1.90 dyoung NULL, 0, &_rtcache_debug, 0, CTL_CREATE, CTL_EOL) != 0)
323 1.90 dyoung return;
324 1.90 dyoung }
325 1.90 dyoung #endif /* RTFLUSH_DEBUG */
326 1.90 dyoung
327 1.144 ozaki static inline void
328 1.144 ozaki rt_destroy(struct rtentry *rt)
329 1.144 ozaki {
330 1.144 ozaki if (rt->_rt_key != NULL)
331 1.144 ozaki sockaddr_free(rt->_rt_key);
332 1.144 ozaki if (rt->rt_gateway != NULL)
333 1.144 ozaki sockaddr_free(rt->rt_gateway);
334 1.144 ozaki if (rt_gettag(rt) != NULL)
335 1.144 ozaki sockaddr_free(rt_gettag(rt));
336 1.144 ozaki rt->_rt_key = rt->rt_gateway = rt->rt_tag = NULL;
337 1.144 ozaki }
338 1.144 ozaki
339 1.144 ozaki static inline const struct sockaddr *
340 1.144 ozaki rt_setkey(struct rtentry *rt, const struct sockaddr *key, int flags)
341 1.144 ozaki {
342 1.144 ozaki if (rt->_rt_key == key)
343 1.144 ozaki goto out;
344 1.144 ozaki
345 1.144 ozaki if (rt->_rt_key != NULL)
346 1.144 ozaki sockaddr_free(rt->_rt_key);
347 1.144 ozaki rt->_rt_key = sockaddr_dup(key, flags);
348 1.144 ozaki out:
349 1.144 ozaki rt->rt_nodes->rn_key = (const char *)rt->_rt_key;
350 1.144 ozaki return rt->_rt_key;
351 1.144 ozaki }
352 1.144 ozaki
353 1.81 joerg struct ifaddr *
354 1.81 joerg rt_get_ifa(struct rtentry *rt)
355 1.81 joerg {
356 1.81 joerg struct ifaddr *ifa;
357 1.81 joerg
358 1.226 ozaki ifa = rt->rt_ifa;
359 1.226 ozaki if (ifa->ifa_getifa == NULL)
360 1.81 joerg return ifa;
361 1.81 joerg #if 0
362 1.81 joerg else if (ifa->ifa_seqno != NULL && *ifa->ifa_seqno == rt->rt_ifa_seqno)
363 1.81 joerg return ifa;
364 1.81 joerg #endif
365 1.81 joerg else {
366 1.94 dyoung ifa = (*ifa->ifa_getifa)(ifa, rt_getkey(rt));
367 1.145 roy if (ifa == NULL)
368 1.145 roy return NULL;
369 1.81 joerg rt_replace_ifa(rt, ifa);
370 1.81 joerg return ifa;
371 1.81 joerg }
372 1.81 joerg }
373 1.81 joerg
374 1.80 joerg static void
375 1.80 joerg rt_set_ifa1(struct rtentry *rt, struct ifaddr *ifa)
376 1.80 joerg {
377 1.80 joerg rt->rt_ifa = ifa;
378 1.80 joerg if (ifa->ifa_seqno != NULL)
379 1.80 joerg rt->rt_ifa_seqno = *ifa->ifa_seqno;
380 1.80 joerg }
381 1.80 joerg
382 1.116 roy /*
383 1.116 roy * Is this route the connected route for the ifa?
384 1.116 roy */
385 1.116 roy static int
386 1.116 roy rt_ifa_connected(const struct rtentry *rt, const struct ifaddr *ifa)
387 1.116 roy {
388 1.116 roy const struct sockaddr *key, *dst, *odst;
389 1.116 roy struct sockaddr_storage maskeddst;
390 1.116 roy
391 1.116 roy key = rt_getkey(rt);
392 1.116 roy dst = rt->rt_flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
393 1.116 roy if (dst == NULL ||
394 1.116 roy dst->sa_family != key->sa_family ||
395 1.116 roy dst->sa_len != key->sa_len)
396 1.116 roy return 0;
397 1.116 roy if ((rt->rt_flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
398 1.116 roy odst = dst;
399 1.116 roy dst = (struct sockaddr *)&maskeddst;
400 1.116 roy rt_maskedcopy(odst, (struct sockaddr *)&maskeddst,
401 1.116 roy ifa->ifa_netmask);
402 1.116 roy }
403 1.116 roy return (memcmp(dst, key, dst->sa_len) == 0);
404 1.116 roy }
405 1.116 roy
406 1.80 joerg void
407 1.80 joerg rt_replace_ifa(struct rtentry *rt, struct ifaddr *ifa)
408 1.80 joerg {
409 1.214 ozaki struct ifaddr *old;
410 1.214 ozaki
411 1.214 ozaki if (rt->rt_ifa == ifa)
412 1.214 ozaki return;
413 1.214 ozaki
414 1.226 ozaki if (rt->rt_ifa != ifa &&
415 1.116 roy rt->rt_ifa->ifa_flags & IFA_ROUTE &&
416 1.116 roy rt_ifa_connected(rt, rt->rt_ifa))
417 1.116 roy {
418 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
419 1.116 roy "replace deleted IFA_ROUTE\n",
420 1.116 roy (void *)rt->_rt_key, (void *)rt->rt_ifa);
421 1.116 roy rt->rt_ifa->ifa_flags &= ~IFA_ROUTE;
422 1.116 roy if (rt_ifa_connected(rt, ifa)) {
423 1.116 roy RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
424 1.116 roy "replace added IFA_ROUTE\n",
425 1.116 roy (void *)rt->_rt_key, (void *)ifa);
426 1.116 roy ifa->ifa_flags |= IFA_ROUTE;
427 1.116 roy }
428 1.116 roy }
429 1.116 roy
430 1.133 rmind ifaref(ifa);
431 1.214 ozaki old = rt->rt_ifa;
432 1.80 joerg rt_set_ifa1(rt, ifa);
433 1.214 ozaki ifafree(old);
434 1.80 joerg }
435 1.80 joerg
436 1.80 joerg static void
437 1.80 joerg rt_set_ifa(struct rtentry *rt, struct ifaddr *ifa)
438 1.80 joerg {
439 1.133 rmind ifaref(ifa);
440 1.80 joerg rt_set_ifa1(rt, ifa);
441 1.80 joerg }
442 1.80 joerg
443 1.119 elad static int
444 1.119 elad route_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
445 1.119 elad void *arg0, void *arg1, void *arg2, void *arg3)
446 1.119 elad {
447 1.119 elad struct rt_msghdr *rtm;
448 1.119 elad int result;
449 1.119 elad
450 1.119 elad result = KAUTH_RESULT_DEFER;
451 1.119 elad rtm = arg1;
452 1.119 elad
453 1.120 elad if (action != KAUTH_NETWORK_ROUTE)
454 1.120 elad return result;
455 1.120 elad
456 1.119 elad if (rtm->rtm_type == RTM_GET)
457 1.119 elad result = KAUTH_RESULT_ALLOW;
458 1.119 elad
459 1.119 elad return result;
460 1.119 elad }
461 1.119 elad
462 1.183 ozaki static void rt_free_work(struct work *, void *);
463 1.183 ozaki
464 1.9 mycroft void
465 1.124 matt rt_init(void)
466 1.1 cgd {
467 1.183 ozaki int error;
468 1.22 thorpej
469 1.118 pooka #ifdef RTFLUSH_DEBUG
470 1.118 pooka sysctl_net_rtcache_setup(NULL);
471 1.118 pooka #endif
472 1.118 pooka
473 1.183 ozaki mutex_init(&rt_free_global.lock, MUTEX_DEFAULT, IPL_SOFTNET);
474 1.203 christos SLIST_INIT(&rt_free_global.queue);
475 1.206 ozaki rt_free_global.enqueued = false;
476 1.203 christos
477 1.183 ozaki rt_psref_class = psref_class_create("rtentry", IPL_SOFTNET);
478 1.183 ozaki
479 1.183 ozaki error = workqueue_create(&rt_free_global.wq, "rt_free",
480 1.183 ozaki rt_free_work, NULL, PRI_SOFTNET, IPL_SOFTNET, WQ_MPSAFE);
481 1.183 ozaki if (error)
482 1.183 ozaki panic("%s: workqueue_create failed (%d)\n", __func__, error);
483 1.183 ozaki
484 1.183 ozaki mutex_init(&rt_update_global.lock, MUTEX_DEFAULT, IPL_SOFTNET);
485 1.183 ozaki cv_init(&rt_update_global.cv, "rt_update");
486 1.183 ozaki
487 1.113 pooka pool_init(&rtentry_pool, sizeof(struct rtentry), 0, 0, 0, "rtentpl",
488 1.113 pooka NULL, IPL_SOFTNET);
489 1.113 pooka pool_init(&rttimer_pool, sizeof(struct rttimer), 0, 0, 0, "rttmrpl",
490 1.113 pooka NULL, IPL_SOFTNET);
491 1.113 pooka
492 1.10 mycroft rn_init(); /* initialize all zeroes, all ones, mask table */
493 1.125 dyoung rtbl_init();
494 1.119 elad
495 1.119 elad route_listener = kauth_listen_scope(KAUTH_SCOPE_NETWORK,
496 1.119 elad route_listener_cb, NULL);
497 1.1 cgd }
498 1.1 cgd
499 1.144 ozaki static void
500 1.199 ozaki rtcache_invalidate(void)
501 1.82 dyoung {
502 1.90 dyoung
503 1.201 ozaki RT_ASSERT_WLOCK();
504 1.201 ozaki
505 1.90 dyoung if (rtcache_debug())
506 1.90 dyoung printf("%s: enter\n", __func__);
507 1.90 dyoung
508 1.199 ozaki rtcache_generation++;
509 1.82 dyoung }
510 1.82 dyoung
511 1.158 ozaki #ifdef RT_DEBUG
512 1.158 ozaki static void
513 1.158 ozaki dump_rt(const struct rtentry *rt)
514 1.158 ozaki {
515 1.158 ozaki char buf[512];
516 1.158 ozaki
517 1.211 ozaki log(LOG_DEBUG, "rt: ");
518 1.211 ozaki log(LOG_DEBUG, "p=%p ", rt);
519 1.158 ozaki if (rt->_rt_key == NULL) {
520 1.211 ozaki log(LOG_DEBUG, "dst=(NULL) ");
521 1.158 ozaki } else {
522 1.158 ozaki sockaddr_format(rt->_rt_key, buf, sizeof(buf));
523 1.211 ozaki log(LOG_DEBUG, "dst=%s ", buf);
524 1.158 ozaki }
525 1.158 ozaki if (rt->rt_gateway == NULL) {
526 1.211 ozaki log(LOG_DEBUG, "gw=(NULL) ");
527 1.158 ozaki } else {
528 1.158 ozaki sockaddr_format(rt->_rt_key, buf, sizeof(buf));
529 1.211 ozaki log(LOG_DEBUG, "gw=%s ", buf);
530 1.158 ozaki }
531 1.211 ozaki log(LOG_DEBUG, "flags=%x ", rt->rt_flags);
532 1.158 ozaki if (rt->rt_ifp == NULL) {
533 1.211 ozaki log(LOG_DEBUG, "if=(NULL) ");
534 1.158 ozaki } else {
535 1.211 ozaki log(LOG_DEBUG, "if=%s ", rt->rt_ifp->if_xname);
536 1.158 ozaki }
537 1.211 ozaki log(LOG_DEBUG, "\n");
538 1.158 ozaki }
539 1.158 ozaki #endif /* RT_DEBUG */
540 1.158 ozaki
541 1.1 cgd /*
542 1.146 ozaki * Packet routing routines. If success, refcnt of a returned rtentry
543 1.146 ozaki * will be incremented. The caller has to rtfree it by itself.
544 1.1 cgd */
545 1.1 cgd struct rtentry *
546 1.195 ozaki rtalloc1_locked(const struct sockaddr *dst, int report, bool wait_ok,
547 1.195 ozaki bool wlock)
548 1.1 cgd {
549 1.158 ozaki rtbl_t *rtbl;
550 1.36 augustss struct rtentry *rt;
551 1.159 christos int s;
552 1.1 cgd
553 1.188 ozaki #ifdef NET_MPSAFE
554 1.183 ozaki retry:
555 1.188 ozaki #endif
556 1.159 christos s = splsoftnet();
557 1.158 ozaki rtbl = rt_gettable(dst->sa_family);
558 1.159 christos if (rtbl == NULL)
559 1.158 ozaki goto miss;
560 1.158 ozaki
561 1.158 ozaki rt = rt_matchaddr(rtbl, dst);
562 1.159 christos if (rt == NULL)
563 1.158 ozaki goto miss;
564 1.159 christos
565 1.183 ozaki if (!ISSET(rt->rt_flags, RTF_UP))
566 1.183 ozaki goto miss;
567 1.183 ozaki
568 1.188 ozaki #ifdef NET_MPSAFE
569 1.183 ozaki if (ISSET(rt->rt_flags, RTF_UPDATING) &&
570 1.183 ozaki /* XXX updater should be always able to acquire */
571 1.183 ozaki curlwp != rt_update_global.lwp) {
572 1.183 ozaki if (!wait_ok || !rt_wait_ok())
573 1.183 ozaki goto miss;
574 1.183 ozaki RT_UNLOCK();
575 1.183 ozaki splx(s);
576 1.183 ozaki
577 1.183 ozaki /* We can wait until the update is complete */
578 1.183 ozaki rt_update_wait();
579 1.183 ozaki
580 1.195 ozaki if (wlock)
581 1.195 ozaki RT_WLOCK();
582 1.195 ozaki else
583 1.195 ozaki RT_RLOCK();
584 1.183 ozaki goto retry;
585 1.183 ozaki }
586 1.188 ozaki #endif /* NET_MPSAFE */
587 1.183 ozaki
588 1.183 ozaki rt_ref(rt);
589 1.183 ozaki RT_REFCNT_TRACE(rt);
590 1.158 ozaki
591 1.159 christos splx(s);
592 1.159 christos return rt;
593 1.158 ozaki miss:
594 1.159 christos rtstat.rts_unreach++;
595 1.158 ozaki if (report) {
596 1.159 christos struct rt_addrinfo info;
597 1.159 christos
598 1.160 christos memset(&info, 0, sizeof(info));
599 1.158 ozaki info.rti_info[RTAX_DST] = dst;
600 1.159 christos rt_missmsg(RTM_MISS, &info, 0, 0);
601 1.1 cgd }
602 1.1 cgd splx(s);
603 1.159 christos return NULL;
604 1.1 cgd }
605 1.1 cgd
606 1.183 ozaki struct rtentry *
607 1.183 ozaki rtalloc1(const struct sockaddr *dst, int report)
608 1.183 ozaki {
609 1.183 ozaki struct rtentry *rt;
610 1.183 ozaki
611 1.183 ozaki RT_RLOCK();
612 1.195 ozaki rt = rtalloc1_locked(dst, report, true, false);
613 1.183 ozaki RT_UNLOCK();
614 1.183 ozaki
615 1.183 ozaki return rt;
616 1.183 ozaki }
617 1.183 ozaki
618 1.151 ozaki static void
619 1.183 ozaki rt_ref(struct rtentry *rt)
620 1.183 ozaki {
621 1.183 ozaki
622 1.223 ozaki KASSERTMSG(rt->rt_refcnt >= 0, "rt_refcnt=%d", rt->rt_refcnt);
623 1.183 ozaki atomic_inc_uint(&rt->rt_refcnt);
624 1.183 ozaki }
625 1.183 ozaki
626 1.183 ozaki void
627 1.183 ozaki rt_unref(struct rtentry *rt)
628 1.183 ozaki {
629 1.183 ozaki
630 1.183 ozaki KASSERT(rt != NULL);
631 1.183 ozaki KASSERTMSG(rt->rt_refcnt > 0, "refcnt=%d", rt->rt_refcnt);
632 1.183 ozaki
633 1.183 ozaki atomic_dec_uint(&rt->rt_refcnt);
634 1.183 ozaki if (!ISSET(rt->rt_flags, RTF_UP) || ISSET(rt->rt_flags, RTF_UPDATING)) {
635 1.183 ozaki mutex_enter(&rt_free_global.lock);
636 1.183 ozaki cv_broadcast(&rt->rt_cv);
637 1.183 ozaki mutex_exit(&rt_free_global.lock);
638 1.183 ozaki }
639 1.183 ozaki }
640 1.183 ozaki
641 1.183 ozaki static bool
642 1.183 ozaki rt_wait_ok(void)
643 1.151 ozaki {
644 1.151 ozaki
645 1.183 ozaki KASSERT(!cpu_intr_p());
646 1.183 ozaki return !cpu_softintr_p();
647 1.183 ozaki }
648 1.151 ozaki
649 1.183 ozaki void
650 1.183 ozaki rt_wait_refcnt(const char *title, struct rtentry *rt, int cnt)
651 1.183 ozaki {
652 1.183 ozaki mutex_enter(&rt_free_global.lock);
653 1.183 ozaki while (rt->rt_refcnt > cnt) {
654 1.183 ozaki dlog(LOG_DEBUG, "%s: %s waiting (refcnt=%d)\n",
655 1.183 ozaki __func__, title, rt->rt_refcnt);
656 1.183 ozaki cv_wait(&rt->rt_cv, &rt_free_global.lock);
657 1.183 ozaki dlog(LOG_DEBUG, "%s: %s waited (refcnt=%d)\n",
658 1.183 ozaki __func__, title, rt->rt_refcnt);
659 1.183 ozaki }
660 1.183 ozaki mutex_exit(&rt_free_global.lock);
661 1.151 ozaki }
662 1.151 ozaki
663 1.9 mycroft void
664 1.183 ozaki rt_wait_psref(struct rtentry *rt)
665 1.183 ozaki {
666 1.183 ozaki
667 1.183 ozaki psref_target_destroy(&rt->rt_psref, rt_psref_class);
668 1.183 ozaki psref_target_init(&rt->rt_psref, rt_psref_class);
669 1.183 ozaki }
670 1.183 ozaki
671 1.183 ozaki static void
672 1.183 ozaki _rt_free(struct rtentry *rt)
673 1.1 cgd {
674 1.36 augustss struct ifaddr *ifa;
675 1.10 mycroft
676 1.183 ozaki /*
677 1.183 ozaki * Need to avoid a deadlock on rt_wait_refcnt of update
678 1.183 ozaki * and a conflict on psref_target_destroy of update.
679 1.183 ozaki */
680 1.188 ozaki #ifdef NET_MPSAFE
681 1.183 ozaki rt_update_wait();
682 1.188 ozaki #endif
683 1.183 ozaki
684 1.183 ozaki RT_REFCNT_TRACE(rt);
685 1.183 ozaki KASSERTMSG(rt->rt_refcnt >= 0, "refcnt=%d", rt->rt_refcnt);
686 1.183 ozaki rt_wait_refcnt("free", rt, 0);
687 1.185 ozaki #ifdef NET_MPSAFE
688 1.183 ozaki psref_target_destroy(&rt->rt_psref, rt_psref_class);
689 1.185 ozaki #endif
690 1.183 ozaki
691 1.183 ozaki rt_assert_inactive(rt);
692 1.183 ozaki rttrash--;
693 1.183 ozaki ifa = rt->rt_ifa;
694 1.183 ozaki rt->rt_ifa = NULL;
695 1.183 ozaki ifafree(ifa);
696 1.183 ozaki rt->rt_ifp = NULL;
697 1.183 ozaki cv_destroy(&rt->rt_cv);
698 1.183 ozaki rt_destroy(rt);
699 1.183 ozaki pool_put(&rtentry_pool, rt);
700 1.183 ozaki }
701 1.183 ozaki
702 1.183 ozaki static void
703 1.183 ozaki rt_free_work(struct work *wk, void *arg)
704 1.183 ozaki {
705 1.183 ozaki
706 1.203 christos for (;;) {
707 1.203 christos struct rtentry *rt;
708 1.203 christos
709 1.203 christos mutex_enter(&rt_free_global.lock);
710 1.203 christos if ((rt = SLIST_FIRST(&rt_free_global.queue)) == NULL) {
711 1.213 ozaki rt_free_global.enqueued = false;
712 1.203 christos mutex_exit(&rt_free_global.lock);
713 1.203 christos return;
714 1.203 christos }
715 1.203 christos SLIST_REMOVE_HEAD(&rt_free_global.queue, rt_free);
716 1.183 ozaki mutex_exit(&rt_free_global.lock);
717 1.183 ozaki atomic_dec_uint(&rt->rt_refcnt);
718 1.183 ozaki _rt_free(rt);
719 1.183 ozaki }
720 1.183 ozaki }
721 1.183 ozaki
722 1.183 ozaki void
723 1.183 ozaki rt_free(struct rtentry *rt)
724 1.183 ozaki {
725 1.183 ozaki
726 1.223 ozaki KASSERTMSG(rt->rt_refcnt > 0, "rt_refcnt=%d", rt->rt_refcnt);
727 1.202 christos if (rt_wait_ok()) {
728 1.183 ozaki atomic_dec_uint(&rt->rt_refcnt);
729 1.183 ozaki _rt_free(rt);
730 1.202 christos return;
731 1.183 ozaki }
732 1.202 christos
733 1.202 christos mutex_enter(&rt_free_global.lock);
734 1.212 ozaki /* No need to add a reference here. */
735 1.203 christos SLIST_INSERT_HEAD(&rt_free_global.queue, rt, rt_free);
736 1.206 ozaki if (!rt_free_global.enqueued) {
737 1.206 ozaki workqueue_enqueue(rt_free_global.wq, &rt_free_global.wk, NULL);
738 1.206 ozaki rt_free_global.enqueued = true;
739 1.206 ozaki }
740 1.202 christos mutex_exit(&rt_free_global.lock);
741 1.183 ozaki }
742 1.183 ozaki
743 1.188 ozaki #ifdef NET_MPSAFE
744 1.183 ozaki static void
745 1.183 ozaki rt_update_wait(void)
746 1.183 ozaki {
747 1.132 rmind
748 1.183 ozaki mutex_enter(&rt_update_global.lock);
749 1.183 ozaki while (rt_update_global.ongoing) {
750 1.183 ozaki dlog(LOG_DEBUG, "%s: waiting lwp=%p\n", __func__, curlwp);
751 1.183 ozaki cv_wait(&rt_update_global.cv, &rt_update_global.lock);
752 1.183 ozaki dlog(LOG_DEBUG, "%s: waited lwp=%p\n", __func__, curlwp);
753 1.1 cgd }
754 1.183 ozaki mutex_exit(&rt_update_global.lock);
755 1.183 ozaki }
756 1.188 ozaki #endif
757 1.183 ozaki
758 1.183 ozaki int
759 1.183 ozaki rt_update_prepare(struct rtentry *rt)
760 1.183 ozaki {
761 1.183 ozaki
762 1.183 ozaki dlog(LOG_DEBUG, "%s: updating rt=%p lwp=%p\n", __func__, rt, curlwp);
763 1.183 ozaki
764 1.183 ozaki RT_WLOCK();
765 1.183 ozaki /* If the entry is being destroyed, don't proceed the update. */
766 1.183 ozaki if (!ISSET(rt->rt_flags, RTF_UP)) {
767 1.183 ozaki RT_UNLOCK();
768 1.205 ozaki return ESRCH;
769 1.183 ozaki }
770 1.183 ozaki rt->rt_flags |= RTF_UPDATING;
771 1.183 ozaki RT_UNLOCK();
772 1.183 ozaki
773 1.183 ozaki mutex_enter(&rt_update_global.lock);
774 1.183 ozaki while (rt_update_global.ongoing) {
775 1.183 ozaki dlog(LOG_DEBUG, "%s: waiting ongoing updating rt=%p lwp=%p\n",
776 1.183 ozaki __func__, rt, curlwp);
777 1.183 ozaki cv_wait(&rt_update_global.cv, &rt_update_global.lock);
778 1.183 ozaki dlog(LOG_DEBUG, "%s: waited ongoing updating rt=%p lwp=%p\n",
779 1.183 ozaki __func__, rt, curlwp);
780 1.183 ozaki }
781 1.183 ozaki rt_update_global.ongoing = true;
782 1.183 ozaki /* XXX need it to avoid rt_update_wait by updater itself. */
783 1.183 ozaki rt_update_global.lwp = curlwp;
784 1.183 ozaki mutex_exit(&rt_update_global.lock);
785 1.183 ozaki
786 1.183 ozaki rt_wait_refcnt("update", rt, 1);
787 1.183 ozaki rt_wait_psref(rt);
788 1.183 ozaki
789 1.183 ozaki return 0;
790 1.183 ozaki }
791 1.183 ozaki
792 1.183 ozaki void
793 1.183 ozaki rt_update_finish(struct rtentry *rt)
794 1.183 ozaki {
795 1.183 ozaki
796 1.183 ozaki RT_WLOCK();
797 1.183 ozaki rt->rt_flags &= ~RTF_UPDATING;
798 1.183 ozaki RT_UNLOCK();
799 1.183 ozaki
800 1.183 ozaki mutex_enter(&rt_update_global.lock);
801 1.183 ozaki rt_update_global.ongoing = false;
802 1.183 ozaki rt_update_global.lwp = NULL;
803 1.183 ozaki cv_broadcast(&rt_update_global.cv);
804 1.183 ozaki mutex_exit(&rt_update_global.lock);
805 1.183 ozaki
806 1.183 ozaki dlog(LOG_DEBUG, "%s: updated rt=%p lwp=%p\n", __func__, rt, curlwp);
807 1.1 cgd }
808 1.1 cgd
809 1.1 cgd /*
810 1.1 cgd * Force a routing table entry to the specified
811 1.1 cgd * destination to go through the given gateway.
812 1.1 cgd * Normally called as a result of a routing redirect
813 1.1 cgd * message from the network layer.
814 1.1 cgd *
815 1.13 mycroft * N.B.: must be called at splsoftnet
816 1.1 cgd */
817 1.14 christos void
818 1.60 matt rtredirect(const struct sockaddr *dst, const struct sockaddr *gateway,
819 1.60 matt const struct sockaddr *netmask, int flags, const struct sockaddr *src,
820 1.60 matt struct rtentry **rtp)
821 1.1 cgd {
822 1.36 augustss struct rtentry *rt;
823 1.1 cgd int error = 0;
824 1.121 dyoung uint64_t *stat = NULL;
825 1.10 mycroft struct rt_addrinfo info;
826 1.10 mycroft struct ifaddr *ifa;
827 1.173 ozaki struct psref psref;
828 1.1 cgd
829 1.1 cgd /* verify the gateway is directly reachable */
830 1.173 ozaki if ((ifa = ifa_ifwithnet_psref(gateway, &psref)) == NULL) {
831 1.1 cgd error = ENETUNREACH;
832 1.8 cgd goto out;
833 1.1 cgd }
834 1.1 cgd rt = rtalloc1(dst, 0);
835 1.1 cgd /*
836 1.1 cgd * If the redirect isn't from our current router for this dst,
837 1.1 cgd * it's either old or wrong. If it redirects us to ourselves,
838 1.1 cgd * we have a routing loop, perhaps as a result of an interface
839 1.1 cgd * going down recently.
840 1.1 cgd */
841 1.10 mycroft if (!(flags & RTF_DONE) && rt &&
842 1.115 yamt (sockaddr_cmp(src, rt->rt_gateway) != 0 || rt->rt_ifa != ifa))
843 1.1 cgd error = EINVAL;
844 1.173 ozaki else {
845 1.173 ozaki int s = pserialize_read_enter();
846 1.173 ozaki struct ifaddr *_ifa;
847 1.173 ozaki
848 1.173 ozaki _ifa = ifa_ifwithaddr(gateway);
849 1.173 ozaki if (_ifa != NULL)
850 1.173 ozaki error = EHOSTUNREACH;
851 1.173 ozaki pserialize_read_exit(s);
852 1.173 ozaki }
853 1.1 cgd if (error)
854 1.1 cgd goto done;
855 1.1 cgd /*
856 1.1 cgd * Create a new entry if we just got back a wildcard entry
857 1.33 soren * or the lookup failed. This is necessary for hosts
858 1.1 cgd * which use routing redirects generated by smart gateways
859 1.1 cgd * to dynamically build the routing tables.
860 1.1 cgd */
861 1.95 dyoung if (rt == NULL || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
862 1.1 cgd goto create;
863 1.1 cgd /*
864 1.1 cgd * Don't listen to the redirect if it's
865 1.65 perry * for a route to an interface.
866 1.1 cgd */
867 1.1 cgd if (rt->rt_flags & RTF_GATEWAY) {
868 1.1 cgd if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
869 1.1 cgd /*
870 1.1 cgd * Changing from route to net => route to host.
871 1.1 cgd * Create new route, rather than smashing route to net.
872 1.1 cgd */
873 1.1 cgd create:
874 1.95 dyoung if (rt != NULL)
875 1.183 ozaki rt_unref(rt);
876 1.1 cgd flags |= RTF_GATEWAY | RTF_DYNAMIC;
877 1.122 kefren memset(&info, 0, sizeof(info));
878 1.39 itojun info.rti_info[RTAX_DST] = dst;
879 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
880 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
881 1.39 itojun info.rti_ifa = ifa;
882 1.39 itojun info.rti_flags = flags;
883 1.39 itojun rt = NULL;
884 1.39 itojun error = rtrequest1(RTM_ADD, &info, &rt);
885 1.39 itojun if (rt != NULL)
886 1.39 itojun flags = rt->rt_flags;
887 1.232 knakahar if (error == 0)
888 1.232 knakahar rt_newmsg_dynamic(RTM_ADD, rt);
889 1.1 cgd stat = &rtstat.rts_dynamic;
890 1.1 cgd } else {
891 1.1 cgd /*
892 1.1 cgd * Smash the current notion of the gateway to
893 1.1 cgd * this destination. Should check about netmask!!!
894 1.1 cgd */
895 1.190 ozaki #ifdef NET_MPSAFE
896 1.190 ozaki KASSERT(!cpu_softintr_p());
897 1.190 ozaki
898 1.190 ozaki error = rt_update_prepare(rt);
899 1.164 ozaki if (error == 0) {
900 1.190 ozaki #endif
901 1.209 ozaki RT_WLOCK();
902 1.190 ozaki error = rt_setgate(rt, gateway);
903 1.190 ozaki if (error == 0) {
904 1.190 ozaki rt->rt_flags |= RTF_MODIFIED;
905 1.190 ozaki flags |= RTF_MODIFIED;
906 1.190 ozaki }
907 1.209 ozaki RT_UNLOCK();
908 1.190 ozaki #ifdef NET_MPSAFE
909 1.190 ozaki rt_update_finish(rt);
910 1.190 ozaki } else {
911 1.190 ozaki /*
912 1.190 ozaki * If error != 0, the rtentry is being
913 1.190 ozaki * destroyed, so doing nothing doesn't
914 1.190 ozaki * matter.
915 1.190 ozaki */
916 1.164 ozaki }
917 1.190 ozaki #endif
918 1.10 mycroft stat = &rtstat.rts_newgateway;
919 1.1 cgd }
920 1.1 cgd } else
921 1.1 cgd error = EHOSTUNREACH;
922 1.1 cgd done:
923 1.1 cgd if (rt) {
924 1.95 dyoung if (rtp != NULL && !error)
925 1.1 cgd *rtp = rt;
926 1.1 cgd else
927 1.183 ozaki rt_unref(rt);
928 1.1 cgd }
929 1.8 cgd out:
930 1.1 cgd if (error)
931 1.1 cgd rtstat.rts_badredirect++;
932 1.8 cgd else if (stat != NULL)
933 1.8 cgd (*stat)++;
934 1.95 dyoung memset(&info, 0, sizeof(info));
935 1.10 mycroft info.rti_info[RTAX_DST] = dst;
936 1.10 mycroft info.rti_info[RTAX_GATEWAY] = gateway;
937 1.10 mycroft info.rti_info[RTAX_NETMASK] = netmask;
938 1.10 mycroft info.rti_info[RTAX_AUTHOR] = src;
939 1.10 mycroft rt_missmsg(RTM_REDIRECT, &info, flags, error);
940 1.173 ozaki ifa_release(ifa, &psref);
941 1.1 cgd }
942 1.1 cgd
943 1.1 cgd /*
944 1.146 ozaki * Delete a route and generate a message.
945 1.146 ozaki * It doesn't free a passed rt.
946 1.40 itojun */
947 1.40 itojun static int
948 1.60 matt rtdeletemsg(struct rtentry *rt)
949 1.40 itojun {
950 1.40 itojun int error;
951 1.40 itojun struct rt_addrinfo info;
952 1.180 ozaki struct rtentry *retrt;
953 1.40 itojun
954 1.40 itojun /*
955 1.40 itojun * Request the new route so that the entry is not actually
956 1.40 itojun * deleted. That will allow the information being reported to
957 1.40 itojun * be accurate (and consistent with route_output()).
958 1.40 itojun */
959 1.95 dyoung memset(&info, 0, sizeof(info));
960 1.94 dyoung info.rti_info[RTAX_DST] = rt_getkey(rt);
961 1.40 itojun info.rti_info[RTAX_NETMASK] = rt_mask(rt);
962 1.40 itojun info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
963 1.40 itojun info.rti_flags = rt->rt_flags;
964 1.180 ozaki error = rtrequest1(RTM_DELETE, &info, &retrt);
965 1.40 itojun
966 1.40 itojun rt_missmsg(RTM_DELETE, &info, info.rti_flags, error);
967 1.40 itojun
968 1.95 dyoung return error;
969 1.40 itojun }
970 1.40 itojun
971 1.209 ozaki static struct ifaddr *
972 1.173 ozaki ifa_ifwithroute_psref(int flags, const struct sockaddr *dst,
973 1.209 ozaki const struct sockaddr *gateway, struct psref *psref)
974 1.1 cgd {
975 1.173 ozaki struct ifaddr *ifa = NULL;
976 1.173 ozaki
977 1.1 cgd if ((flags & RTF_GATEWAY) == 0) {
978 1.1 cgd /*
979 1.1 cgd * If we are adding a route to an interface,
980 1.1 cgd * and the interface is a pt to pt link
981 1.1 cgd * we should search for the destination
982 1.1 cgd * as our clue to the interface. Otherwise
983 1.1 cgd * we can use the local address.
984 1.1 cgd */
985 1.127 christos if ((flags & RTF_HOST) && gateway->sa_family != AF_LINK)
986 1.173 ozaki ifa = ifa_ifwithdstaddr_psref(dst, psref);
987 1.68 christos if (ifa == NULL)
988 1.173 ozaki ifa = ifa_ifwithaddr_psref(gateway, psref);
989 1.1 cgd } else {
990 1.1 cgd /*
991 1.1 cgd * If we are adding a route to a remote net
992 1.1 cgd * or host, the gateway may still be on the
993 1.1 cgd * other end of a pt to pt link.
994 1.1 cgd */
995 1.173 ozaki ifa = ifa_ifwithdstaddr_psref(gateway, psref);
996 1.1 cgd }
997 1.68 christos if (ifa == NULL)
998 1.173 ozaki ifa = ifa_ifwithnet_psref(gateway, psref);
999 1.68 christos if (ifa == NULL) {
1000 1.173 ozaki int s;
1001 1.173 ozaki struct rtentry *rt;
1002 1.173 ozaki
1003 1.209 ozaki rt = rtalloc1_locked(gateway, 0, true, true);
1004 1.68 christos if (rt == NULL)
1005 1.68 christos return NULL;
1006 1.194 ozaki if (rt->rt_flags & RTF_GATEWAY) {
1007 1.194 ozaki rt_unref(rt);
1008 1.194 ozaki return NULL;
1009 1.194 ozaki }
1010 1.173 ozaki /*
1011 1.173 ozaki * Just in case. May not need to do this workaround.
1012 1.173 ozaki * Revisit when working on rtentry MP-ification.
1013 1.173 ozaki */
1014 1.173 ozaki s = pserialize_read_enter();
1015 1.173 ozaki IFADDR_READER_FOREACH(ifa, rt->rt_ifp) {
1016 1.173 ozaki if (ifa == rt->rt_ifa)
1017 1.173 ozaki break;
1018 1.173 ozaki }
1019 1.173 ozaki if (ifa != NULL)
1020 1.173 ozaki ifa_acquire(ifa, psref);
1021 1.173 ozaki pserialize_read_exit(s);
1022 1.183 ozaki rt_unref(rt);
1023 1.146 ozaki if (ifa == NULL)
1024 1.68 christos return NULL;
1025 1.1 cgd }
1026 1.1 cgd if (ifa->ifa_addr->sa_family != dst->sa_family) {
1027 1.173 ozaki struct ifaddr *nifa;
1028 1.173 ozaki int s;
1029 1.173 ozaki
1030 1.173 ozaki s = pserialize_read_enter();
1031 1.173 ozaki nifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
1032 1.173 ozaki if (nifa != NULL) {
1033 1.173 ozaki ifa_release(ifa, psref);
1034 1.173 ozaki ifa_acquire(nifa, psref);
1035 1.173 ozaki ifa = nifa;
1036 1.173 ozaki }
1037 1.173 ozaki pserialize_read_exit(s);
1038 1.1 cgd }
1039 1.95 dyoung return ifa;
1040 1.1 cgd }
1041 1.1 cgd
1042 1.146 ozaki /*
1043 1.146 ozaki * If it suceeds and ret_nrt isn't NULL, refcnt of ret_nrt is incremented.
1044 1.146 ozaki * The caller has to rtfree it by itself.
1045 1.146 ozaki */
1046 1.9 mycroft int
1047 1.60 matt rtrequest(int req, const struct sockaddr *dst, const struct sockaddr *gateway,
1048 1.60 matt const struct sockaddr *netmask, int flags, struct rtentry **ret_nrt)
1049 1.1 cgd {
1050 1.39 itojun struct rt_addrinfo info;
1051 1.39 itojun
1052 1.44 thorpej memset(&info, 0, sizeof(info));
1053 1.39 itojun info.rti_flags = flags;
1054 1.39 itojun info.rti_info[RTAX_DST] = dst;
1055 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
1056 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
1057 1.39 itojun return rtrequest1(req, &info, ret_nrt);
1058 1.39 itojun }
1059 1.39 itojun
1060 1.209 ozaki static struct ifnet *
1061 1.173 ozaki rt_getifp(struct rt_addrinfo *info, struct psref *psref)
1062 1.39 itojun {
1063 1.68 christos const struct sockaddr *ifpaddr = info->rti_info[RTAX_IFP];
1064 1.39 itojun
1065 1.173 ozaki if (info->rti_ifp != NULL)
1066 1.173 ozaki return NULL;
1067 1.39 itojun /*
1068 1.39 itojun * ifp may be specified by sockaddr_dl when protocol address
1069 1.39 itojun * is ambiguous
1070 1.39 itojun */
1071 1.173 ozaki if (ifpaddr != NULL && ifpaddr->sa_family == AF_LINK) {
1072 1.173 ozaki struct ifaddr *ifa;
1073 1.173 ozaki int s = pserialize_read_enter();
1074 1.173 ozaki
1075 1.173 ozaki ifa = ifa_ifwithnet(ifpaddr);
1076 1.173 ozaki if (ifa != NULL)
1077 1.173 ozaki info->rti_ifp = if_get_byindex(ifa->ifa_ifp->if_index,
1078 1.173 ozaki psref);
1079 1.173 ozaki pserialize_read_exit(s);
1080 1.39 itojun }
1081 1.173 ozaki
1082 1.173 ozaki return info->rti_ifp;
1083 1.173 ozaki }
1084 1.173 ozaki
1085 1.209 ozaki static struct ifaddr *
1086 1.173 ozaki rt_getifa(struct rt_addrinfo *info, struct psref *psref)
1087 1.173 ozaki {
1088 1.174 ozaki struct ifaddr *ifa = NULL;
1089 1.173 ozaki const struct sockaddr *dst = info->rti_info[RTAX_DST];
1090 1.173 ozaki const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
1091 1.173 ozaki const struct sockaddr *ifaaddr = info->rti_info[RTAX_IFA];
1092 1.173 ozaki int flags = info->rti_flags;
1093 1.173 ozaki const struct sockaddr *sa;
1094 1.173 ozaki
1095 1.173 ozaki if (info->rti_ifa == NULL && ifaaddr != NULL) {
1096 1.173 ozaki ifa = ifa_ifwithaddr_psref(ifaaddr, psref);
1097 1.173 ozaki if (ifa != NULL)
1098 1.173 ozaki goto got;
1099 1.173 ozaki }
1100 1.173 ozaki
1101 1.173 ozaki sa = ifaaddr != NULL ? ifaaddr :
1102 1.173 ozaki (gateway != NULL ? gateway : dst);
1103 1.173 ozaki if (sa != NULL && info->rti_ifp != NULL)
1104 1.173 ozaki ifa = ifaof_ifpforaddr_psref(sa, info->rti_ifp, psref);
1105 1.173 ozaki else if (dst != NULL && gateway != NULL)
1106 1.173 ozaki ifa = ifa_ifwithroute_psref(flags, dst, gateway, psref);
1107 1.173 ozaki else if (sa != NULL)
1108 1.173 ozaki ifa = ifa_ifwithroute_psref(flags, sa, sa, psref);
1109 1.173 ozaki if (ifa == NULL)
1110 1.173 ozaki return NULL;
1111 1.173 ozaki got:
1112 1.145 roy if (ifa->ifa_getifa != NULL) {
1113 1.191 ozaki /* FIXME ifa_getifa is NOMPSAFE */
1114 1.173 ozaki ifa = (*ifa->ifa_getifa)(ifa, dst);
1115 1.145 roy if (ifa == NULL)
1116 1.173 ozaki return NULL;
1117 1.173 ozaki ifa_acquire(ifa, psref);
1118 1.145 roy }
1119 1.173 ozaki info->rti_ifa = ifa;
1120 1.74 dyoung if (info->rti_ifp == NULL)
1121 1.74 dyoung info->rti_ifp = ifa->ifa_ifp;
1122 1.173 ozaki return ifa;
1123 1.39 itojun }
1124 1.39 itojun
1125 1.146 ozaki /*
1126 1.146 ozaki * If it suceeds and ret_nrt isn't NULL, refcnt of ret_nrt is incremented.
1127 1.146 ozaki * The caller has to rtfree it by itself.
1128 1.146 ozaki */
1129 1.39 itojun int
1130 1.60 matt rtrequest1(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt)
1131 1.39 itojun {
1132 1.173 ozaki int s = splsoftnet(), ss;
1133 1.125 dyoung int error = 0, rc;
1134 1.158 ozaki struct rtentry *rt;
1135 1.125 dyoung rtbl_t *rtbl;
1136 1.193 ozaki struct ifaddr *ifa = NULL;
1137 1.94 dyoung struct sockaddr_storage maskeddst;
1138 1.68 christos const struct sockaddr *dst = info->rti_info[RTAX_DST];
1139 1.68 christos const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
1140 1.68 christos const struct sockaddr *netmask = info->rti_info[RTAX_NETMASK];
1141 1.68 christos int flags = info->rti_flags;
1142 1.173 ozaki struct psref psref_ifp, psref_ifa;
1143 1.173 ozaki int bound = 0;
1144 1.173 ozaki struct ifnet *ifp = NULL;
1145 1.173 ozaki bool need_to_release_ifa = true;
1146 1.183 ozaki bool need_unlock = true;
1147 1.1 cgd #define senderr(x) { error = x ; goto bad; }
1148 1.1 cgd
1149 1.183 ozaki RT_WLOCK();
1150 1.183 ozaki
1151 1.173 ozaki bound = curlwp_bind();
1152 1.125 dyoung if ((rtbl = rt_gettable(dst->sa_family)) == NULL)
1153 1.1 cgd senderr(ESRCH);
1154 1.1 cgd if (flags & RTF_HOST)
1155 1.68 christos netmask = NULL;
1156 1.1 cgd switch (req) {
1157 1.1 cgd case RTM_DELETE:
1158 1.63 christos if (netmask) {
1159 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
1160 1.94 dyoung netmask);
1161 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
1162 1.63 christos }
1163 1.125 dyoung if ((rt = rt_lookup(rtbl, dst, netmask)) == NULL)
1164 1.41 itojun senderr(ESRCH);
1165 1.125 dyoung if ((rt = rt_deladdr(rtbl, dst, netmask)) == NULL)
1166 1.1 cgd senderr(ESRCH);
1167 1.28 erh rt->rt_flags &= ~RTF_UP;
1168 1.226 ozaki ifa = rt->rt_ifa;
1169 1.226 ozaki if (ifa->ifa_flags & IFA_ROUTE &&
1170 1.226 ozaki rt_ifa_connected(rt, ifa)) {
1171 1.226 ozaki RT_DPRINTF("rt->_rt_key = %p, ifa = %p, "
1172 1.226 ozaki "deleted IFA_ROUTE\n",
1173 1.226 ozaki (void *)rt->_rt_key, (void *)ifa);
1174 1.226 ozaki ifa->ifa_flags &= ~IFA_ROUTE;
1175 1.116 roy }
1176 1.226 ozaki if (ifa->ifa_rtrequest)
1177 1.226 ozaki ifa->ifa_rtrequest(RTM_DELETE, rt, info);
1178 1.226 ozaki ifa = NULL;
1179 1.1 cgd rttrash++;
1180 1.146 ozaki if (ret_nrt) {
1181 1.10 mycroft *ret_nrt = rt;
1182 1.183 ozaki rt_ref(rt);
1183 1.183 ozaki RT_REFCNT_TRACE(rt);
1184 1.183 ozaki }
1185 1.201 ozaki rtcache_invalidate();
1186 1.183 ozaki RT_UNLOCK();
1187 1.183 ozaki need_unlock = false;
1188 1.183 ozaki rt_timer_remove_all(rt);
1189 1.196 ozaki #if defined(INET) || defined(INET6)
1190 1.196 ozaki if (netmask != NULL)
1191 1.196 ozaki lltable_prefix_free(dst->sa_family, dst, netmask, 0);
1192 1.196 ozaki #endif
1193 1.183 ozaki if (ret_nrt == NULL) {
1194 1.146 ozaki /* Adjust the refcount */
1195 1.183 ozaki rt_ref(rt);
1196 1.183 ozaki RT_REFCNT_TRACE(rt);
1197 1.183 ozaki rt_free(rt);
1198 1.10 mycroft }
1199 1.1 cgd break;
1200 1.1 cgd
1201 1.1 cgd case RTM_ADD:
1202 1.173 ozaki if (info->rti_ifa == NULL) {
1203 1.173 ozaki ifp = rt_getifp(info, &psref_ifp);
1204 1.173 ozaki ifa = rt_getifa(info, &psref_ifa);
1205 1.173 ozaki if (ifa == NULL)
1206 1.173 ozaki senderr(ENETUNREACH);
1207 1.173 ozaki } else {
1208 1.173 ozaki /* Caller should have a reference of ifa */
1209 1.173 ozaki ifa = info->rti_ifa;
1210 1.173 ozaki need_to_release_ifa = false;
1211 1.173 ozaki }
1212 1.22 thorpej rt = pool_get(&rtentry_pool, PR_NOWAIT);
1213 1.68 christos if (rt == NULL)
1214 1.1 cgd senderr(ENOBUFS);
1215 1.109 dyoung memset(rt, 0, sizeof(*rt));
1216 1.215 ozaki rt->rt_flags = RTF_UP | (flags & ~RTF_DONTCHANGEIFA);
1217 1.18 kml LIST_INIT(&rt->rt_timer);
1218 1.163 ozaki
1219 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1220 1.1 cgd if (netmask) {
1221 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
1222 1.94 dyoung netmask);
1223 1.96 dyoung rt_setkey(rt, (struct sockaddr *)&maskeddst, M_NOWAIT);
1224 1.94 dyoung } else {
1225 1.96 dyoung rt_setkey(rt, dst, M_NOWAIT);
1226 1.94 dyoung }
1227 1.163 ozaki RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1228 1.163 ozaki if (rt_getkey(rt) == NULL ||
1229 1.163 ozaki rt_setgate(rt, gateway) != 0) {
1230 1.163 ozaki pool_put(&rtentry_pool, rt);
1231 1.163 ozaki senderr(ENOBUFS);
1232 1.163 ozaki }
1233 1.163 ozaki
1234 1.74 dyoung rt_set_ifa(rt, ifa);
1235 1.164 ozaki if (info->rti_info[RTAX_TAG] != NULL) {
1236 1.164 ozaki const struct sockaddr *tag;
1237 1.164 ozaki tag = rt_settag(rt, info->rti_info[RTAX_TAG]);
1238 1.164 ozaki if (tag == NULL)
1239 1.164 ozaki senderr(ENOBUFS);
1240 1.164 ozaki }
1241 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1242 1.173 ozaki
1243 1.173 ozaki ss = pserialize_read_enter();
1244 1.173 ozaki if (info->rti_info[RTAX_IFP] != NULL) {
1245 1.193 ozaki struct ifaddr *ifa2;
1246 1.173 ozaki ifa2 = ifa_ifwithnet(info->rti_info[RTAX_IFP]);
1247 1.173 ozaki if (ifa2 != NULL)
1248 1.173 ozaki rt->rt_ifp = ifa2->ifa_ifp;
1249 1.173 ozaki else
1250 1.173 ozaki rt->rt_ifp = ifa->ifa_ifp;
1251 1.173 ozaki } else
1252 1.122 kefren rt->rt_ifp = ifa->ifa_ifp;
1253 1.173 ozaki pserialize_read_exit(ss);
1254 1.183 ozaki cv_init(&rt->rt_cv, "rtentry");
1255 1.183 ozaki psref_target_init(&rt->rt_psref, rt_psref_class);
1256 1.173 ozaki
1257 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1258 1.125 dyoung rc = rt_addaddr(rtbl, rt, netmask);
1259 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1260 1.125 dyoung if (rc != 0) {
1261 1.173 ozaki ifafree(ifa); /* for rt_set_ifa above */
1262 1.183 ozaki cv_destroy(&rt->rt_cv);
1263 1.94 dyoung rt_destroy(rt);
1264 1.40 itojun pool_put(&rtentry_pool, rt);
1265 1.125 dyoung senderr(rc);
1266 1.27 matt }
1267 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1268 1.1 cgd if (ifa->ifa_rtrequest)
1269 1.39 itojun ifa->ifa_rtrequest(req, rt, info);
1270 1.173 ozaki if (need_to_release_ifa)
1271 1.173 ozaki ifa_release(ifa, &psref_ifa);
1272 1.173 ozaki ifa = NULL;
1273 1.173 ozaki if_put(ifp, &psref_ifp);
1274 1.173 ozaki ifp = NULL;
1275 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1276 1.1 cgd if (ret_nrt) {
1277 1.1 cgd *ret_nrt = rt;
1278 1.183 ozaki rt_ref(rt);
1279 1.183 ozaki RT_REFCNT_TRACE(rt);
1280 1.41 itojun }
1281 1.201 ozaki rtcache_invalidate();
1282 1.183 ozaki RT_UNLOCK();
1283 1.183 ozaki need_unlock = false;
1284 1.1 cgd break;
1285 1.92 dyoung case RTM_GET:
1286 1.94 dyoung if (netmask != NULL) {
1287 1.94 dyoung rt_maskedcopy(dst, (struct sockaddr *)&maskeddst,
1288 1.94 dyoung netmask);
1289 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
1290 1.94 dyoung }
1291 1.125 dyoung if ((rt = rt_lookup(rtbl, dst, netmask)) == NULL)
1292 1.92 dyoung senderr(ESRCH);
1293 1.92 dyoung if (ret_nrt != NULL) {
1294 1.92 dyoung *ret_nrt = rt;
1295 1.183 ozaki rt_ref(rt);
1296 1.183 ozaki RT_REFCNT_TRACE(rt);
1297 1.92 dyoung }
1298 1.92 dyoung break;
1299 1.1 cgd }
1300 1.1 cgd bad:
1301 1.173 ozaki if (need_to_release_ifa)
1302 1.173 ozaki ifa_release(ifa, &psref_ifa);
1303 1.173 ozaki if_put(ifp, &psref_ifp);
1304 1.173 ozaki curlwp_bindx(bound);
1305 1.183 ozaki if (need_unlock)
1306 1.183 ozaki RT_UNLOCK();
1307 1.1 cgd splx(s);
1308 1.95 dyoung return error;
1309 1.1 cgd }
1310 1.1 cgd
1311 1.10 mycroft int
1312 1.94 dyoung rt_setgate(struct rtentry *rt, const struct sockaddr *gate)
1313 1.10 mycroft {
1314 1.176 ozaki struct sockaddr *new, *old;
1315 1.94 dyoung
1316 1.209 ozaki KASSERT(RT_WLOCKED());
1317 1.94 dyoung KASSERT(rt->_rt_key != NULL);
1318 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1319 1.94 dyoung
1320 1.176 ozaki new = sockaddr_dup(gate, M_ZERO | M_NOWAIT);
1321 1.176 ozaki if (new == NULL)
1322 1.94 dyoung return ENOMEM;
1323 1.176 ozaki
1324 1.176 ozaki old = rt->rt_gateway;
1325 1.176 ozaki rt->rt_gateway = new;
1326 1.176 ozaki if (old != NULL)
1327 1.176 ozaki sockaddr_free(old);
1328 1.176 ozaki
1329 1.94 dyoung KASSERT(rt->_rt_key != NULL);
1330 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1331 1.94 dyoung
1332 1.10 mycroft if (rt->rt_flags & RTF_GATEWAY) {
1333 1.183 ozaki struct rtentry *gwrt;
1334 1.183 ozaki
1335 1.209 ozaki gwrt = rtalloc1_locked(gate, 1, false, true);
1336 1.27 matt /*
1337 1.27 matt * If we switched gateways, grab the MTU from the new
1338 1.47 itojun * gateway route if the current MTU, if the current MTU is
1339 1.47 itojun * greater than the MTU of gateway.
1340 1.47 itojun * Note that, if the MTU of gateway is 0, we will reset the
1341 1.47 itojun * MTU of the route to run PMTUD again from scratch. XXX
1342 1.27 matt */
1343 1.166 ozaki if (gwrt != NULL) {
1344 1.166 ozaki KASSERT(gwrt->_rt_key != NULL);
1345 1.166 ozaki RT_DPRINTF("gwrt->_rt_key = %p\n", gwrt->_rt_key);
1346 1.166 ozaki if ((rt->rt_rmx.rmx_locks & RTV_MTU) == 0 &&
1347 1.166 ozaki rt->rt_rmx.rmx_mtu &&
1348 1.166 ozaki rt->rt_rmx.rmx_mtu > gwrt->rt_rmx.rmx_mtu) {
1349 1.166 ozaki rt->rt_rmx.rmx_mtu = gwrt->rt_rmx.rmx_mtu;
1350 1.166 ozaki }
1351 1.183 ozaki rt_unref(gwrt);
1352 1.27 matt }
1353 1.10 mycroft }
1354 1.94 dyoung KASSERT(rt->_rt_key != NULL);
1355 1.110 dyoung RT_DPRINTF("rt->_rt_key = %p\n", (void *)rt->_rt_key);
1356 1.10 mycroft return 0;
1357 1.10 mycroft }
1358 1.10 mycroft
1359 1.209 ozaki static struct ifaddr *
1360 1.222 rin rt_update_get_ifa(const struct rt_addrinfo *info, const struct rtentry *rt,
1361 1.209 ozaki struct ifnet **ifp, struct psref *psref_ifp, struct psref *psref)
1362 1.209 ozaki {
1363 1.209 ozaki struct ifaddr *ifa = NULL;
1364 1.209 ozaki
1365 1.209 ozaki *ifp = NULL;
1366 1.222 rin if (info->rti_info[RTAX_IFP] != NULL) {
1367 1.222 rin ifa = ifa_ifwithnet_psref(info->rti_info[RTAX_IFP], psref);
1368 1.209 ozaki if (ifa == NULL)
1369 1.209 ozaki goto next;
1370 1.235 knakahar if (ifa->ifa_ifp->if_flags & IFF_UNNUMBERED) {
1371 1.235 knakahar ifa_release(ifa, psref);
1372 1.235 knakahar ifa = NULL;
1373 1.235 knakahar goto next;
1374 1.235 knakahar }
1375 1.209 ozaki *ifp = ifa->ifa_ifp;
1376 1.209 ozaki if_acquire(*ifp, psref_ifp);
1377 1.222 rin if (info->rti_info[RTAX_IFA] == NULL &&
1378 1.225 knakahar info->rti_info[RTAX_GATEWAY] == NULL)
1379 1.225 knakahar goto out;
1380 1.209 ozaki ifa_release(ifa, psref);
1381 1.222 rin if (info->rti_info[RTAX_IFA] == NULL) {
1382 1.209 ozaki /* route change <dst> <gw> -ifp <if> */
1383 1.222 rin ifa = ifaof_ifpforaddr_psref(
1384 1.222 rin info->rti_info[RTAX_GATEWAY], *ifp, psref);
1385 1.209 ozaki } else {
1386 1.209 ozaki /* route change <dst> -ifp <if> -ifa <addr> */
1387 1.222 rin ifa = ifa_ifwithaddr_psref(info->rti_info[RTAX_IFA],
1388 1.222 rin psref);
1389 1.209 ozaki if (ifa != NULL)
1390 1.209 ozaki goto out;
1391 1.222 rin ifa = ifaof_ifpforaddr_psref(info->rti_info[RTAX_IFA],
1392 1.209 ozaki *ifp, psref);
1393 1.209 ozaki }
1394 1.209 ozaki goto out;
1395 1.209 ozaki }
1396 1.209 ozaki next:
1397 1.222 rin if (info->rti_info[RTAX_IFA] != NULL) {
1398 1.209 ozaki /* route change <dst> <gw> -ifa <addr> */
1399 1.222 rin ifa = ifa_ifwithaddr_psref(info->rti_info[RTAX_IFA], psref);
1400 1.209 ozaki if (ifa != NULL)
1401 1.209 ozaki goto out;
1402 1.209 ozaki }
1403 1.222 rin if (info->rti_info[RTAX_GATEWAY] != NULL) {
1404 1.209 ozaki /* route change <dst> <gw> */
1405 1.209 ozaki ifa = ifa_ifwithroute_psref(rt->rt_flags, rt_getkey(rt),
1406 1.222 rin info->rti_info[RTAX_GATEWAY], psref);
1407 1.209 ozaki }
1408 1.209 ozaki out:
1409 1.209 ozaki if (ifa != NULL && *ifp == NULL) {
1410 1.209 ozaki *ifp = ifa->ifa_ifp;
1411 1.209 ozaki if_acquire(*ifp, psref_ifp);
1412 1.209 ozaki }
1413 1.209 ozaki if (ifa == NULL && *ifp != NULL) {
1414 1.209 ozaki if_put(*ifp, psref_ifp);
1415 1.209 ozaki *ifp = NULL;
1416 1.209 ozaki }
1417 1.209 ozaki return ifa;
1418 1.209 ozaki }
1419 1.209 ozaki
1420 1.209 ozaki int
1421 1.209 ozaki rt_update(struct rtentry *rt, struct rt_addrinfo *info, void *rtm)
1422 1.209 ozaki {
1423 1.209 ozaki int error = 0;
1424 1.209 ozaki struct ifnet *ifp = NULL, *new_ifp = NULL;
1425 1.209 ozaki struct ifaddr *ifa = NULL, *new_ifa;
1426 1.209 ozaki struct psref psref_ifa, psref_new_ifa, psref_ifp, psref_new_ifp;
1427 1.209 ozaki bool newgw, ifp_changed = false;
1428 1.209 ozaki
1429 1.209 ozaki RT_WLOCK();
1430 1.209 ozaki /*
1431 1.209 ozaki * New gateway could require new ifaddr, ifp;
1432 1.209 ozaki * flags may also be different; ifp may be specified
1433 1.209 ozaki * by ll sockaddr when protocol address is ambiguous
1434 1.209 ozaki */
1435 1.209 ozaki newgw = info->rti_info[RTAX_GATEWAY] != NULL &&
1436 1.209 ozaki sockaddr_cmp(info->rti_info[RTAX_GATEWAY], rt->rt_gateway) != 0;
1437 1.209 ozaki
1438 1.209 ozaki if (newgw || info->rti_info[RTAX_IFP] != NULL ||
1439 1.209 ozaki info->rti_info[RTAX_IFA] != NULL) {
1440 1.209 ozaki ifp = rt_getifp(info, &psref_ifp);
1441 1.209 ozaki /* info refers ifp so we need to keep a reference */
1442 1.209 ozaki ifa = rt_getifa(info, &psref_ifa);
1443 1.209 ozaki if (ifa == NULL) {
1444 1.209 ozaki error = ENETUNREACH;
1445 1.209 ozaki goto out;
1446 1.209 ozaki }
1447 1.209 ozaki }
1448 1.209 ozaki if (newgw) {
1449 1.209 ozaki error = rt_setgate(rt, info->rti_info[RTAX_GATEWAY]);
1450 1.209 ozaki if (error != 0)
1451 1.209 ozaki goto out;
1452 1.209 ozaki }
1453 1.209 ozaki if (info->rti_info[RTAX_TAG]) {
1454 1.209 ozaki const struct sockaddr *tag;
1455 1.209 ozaki tag = rt_settag(rt, info->rti_info[RTAX_TAG]);
1456 1.209 ozaki if (tag == NULL) {
1457 1.209 ozaki error = ENOBUFS;
1458 1.209 ozaki goto out;
1459 1.209 ozaki }
1460 1.209 ozaki }
1461 1.209 ozaki /*
1462 1.209 ozaki * New gateway could require new ifaddr, ifp;
1463 1.209 ozaki * flags may also be different; ifp may be specified
1464 1.209 ozaki * by ll sockaddr when protocol address is ambiguous
1465 1.209 ozaki */
1466 1.222 rin new_ifa = rt_update_get_ifa(info, rt, &new_ifp, &psref_new_ifp,
1467 1.209 ozaki &psref_new_ifa);
1468 1.209 ozaki if (new_ifa != NULL) {
1469 1.209 ozaki ifa_release(ifa, &psref_ifa);
1470 1.209 ozaki ifa = new_ifa;
1471 1.209 ozaki }
1472 1.209 ozaki if (ifa) {
1473 1.209 ozaki struct ifaddr *oifa = rt->rt_ifa;
1474 1.209 ozaki if (oifa != ifa && !ifa_is_destroying(ifa) &&
1475 1.209 ozaki new_ifp != NULL && !if_is_deactivated(new_ifp)) {
1476 1.209 ozaki if (oifa && oifa->ifa_rtrequest)
1477 1.209 ozaki oifa->ifa_rtrequest(RTM_DELETE, rt, info);
1478 1.209 ozaki rt_replace_ifa(rt, ifa);
1479 1.209 ozaki rt->rt_ifp = new_ifp;
1480 1.209 ozaki ifp_changed = true;
1481 1.209 ozaki }
1482 1.209 ozaki if (new_ifa == NULL)
1483 1.209 ozaki ifa_release(ifa, &psref_ifa);
1484 1.217 ozaki /* To avoid ifa_release below */
1485 1.217 ozaki ifa = NULL;
1486 1.209 ozaki }
1487 1.209 ozaki ifa_release(new_ifa, &psref_new_ifa);
1488 1.209 ozaki if (new_ifp && rt->rt_ifp != new_ifp && !if_is_deactivated(new_ifp)) {
1489 1.209 ozaki rt->rt_ifp = new_ifp;
1490 1.209 ozaki ifp_changed = true;
1491 1.209 ozaki }
1492 1.209 ozaki rt_setmetrics(rtm, rt);
1493 1.209 ozaki if (rt->rt_flags != info->rti_flags) {
1494 1.209 ozaki rt->rt_flags = (info->rti_flags & ~PRESERVED_RTF) |
1495 1.209 ozaki (rt->rt_flags & PRESERVED_RTF);
1496 1.209 ozaki }
1497 1.226 ozaki if (rt->rt_ifa->ifa_rtrequest)
1498 1.209 ozaki rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, info);
1499 1.209 ozaki #if defined(INET) || defined(INET6)
1500 1.209 ozaki if (ifp_changed && rt_mask(rt) != NULL)
1501 1.209 ozaki lltable_prefix_free(rt_getkey(rt)->sa_family, rt_getkey(rt),
1502 1.209 ozaki rt_mask(rt), 0);
1503 1.209 ozaki #else
1504 1.209 ozaki (void)ifp_changed; /* XXX gcc */
1505 1.209 ozaki #endif
1506 1.209 ozaki out:
1507 1.217 ozaki ifa_release(ifa, &psref_ifa);
1508 1.209 ozaki if_put(new_ifp, &psref_new_ifp);
1509 1.209 ozaki if_put(ifp, &psref_ifp);
1510 1.209 ozaki
1511 1.209 ozaki RT_UNLOCK();
1512 1.209 ozaki
1513 1.209 ozaki return error;
1514 1.209 ozaki }
1515 1.209 ozaki
1516 1.141 ozaki static void
1517 1.60 matt rt_maskedcopy(const struct sockaddr *src, struct sockaddr *dst,
1518 1.60 matt const struct sockaddr *netmask)
1519 1.1 cgd {
1520 1.94 dyoung const char *netmaskp = &netmask->sa_data[0],
1521 1.94 dyoung *srcp = &src->sa_data[0];
1522 1.94 dyoung char *dstp = &dst->sa_data[0];
1523 1.126 christos const char *maskend = (char *)dst + MIN(netmask->sa_len, src->sa_len);
1524 1.126 christos const char *srcend = (char *)dst + src->sa_len;
1525 1.94 dyoung
1526 1.94 dyoung dst->sa_len = src->sa_len;
1527 1.94 dyoung dst->sa_family = src->sa_family;
1528 1.94 dyoung
1529 1.94 dyoung while (dstp < maskend)
1530 1.94 dyoung *dstp++ = *srcp++ & *netmaskp++;
1531 1.94 dyoung if (dstp < srcend)
1532 1.94 dyoung memset(dstp, 0, (size_t)(srcend - dstp));
1533 1.1 cgd }
1534 1.10 mycroft
1535 1.1 cgd /*
1536 1.135 roy * Inform the routing socket of a route change.
1537 1.135 roy */
1538 1.135 roy void
1539 1.154 ozaki rt_newmsg(const int cmd, const struct rtentry *rt)
1540 1.135 roy {
1541 1.135 roy struct rt_addrinfo info;
1542 1.135 roy
1543 1.135 roy memset((void *)&info, 0, sizeof(info));
1544 1.135 roy info.rti_info[RTAX_DST] = rt_getkey(rt);
1545 1.135 roy info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
1546 1.135 roy info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1547 1.135 roy if (rt->rt_ifp) {
1548 1.135 roy info.rti_info[RTAX_IFP] = rt->rt_ifp->if_dl->ifa_addr;
1549 1.135 roy info.rti_info[RTAX_IFA] = rt->rt_ifa->ifa_addr;
1550 1.135 roy }
1551 1.135 roy
1552 1.135 roy rt_missmsg(cmd, &info, rt->rt_flags, 0);
1553 1.135 roy }
1554 1.135 roy
1555 1.135 roy /*
1556 1.232 knakahar * Inform the routing socket of a route change for RTF_DYNAMIC.
1557 1.232 knakahar */
1558 1.232 knakahar void
1559 1.232 knakahar rt_newmsg_dynamic(const int cmd, const struct rtentry *rt)
1560 1.232 knakahar {
1561 1.232 knakahar struct rt_addrinfo info;
1562 1.232 knakahar struct sockaddr *gateway = rt->rt_gateway;
1563 1.232 knakahar
1564 1.232 knakahar if (gateway == NULL)
1565 1.232 knakahar return;
1566 1.232 knakahar
1567 1.233 knakahar switch(gateway->sa_family) {
1568 1.233 knakahar #ifdef INET
1569 1.233 knakahar case AF_INET: {
1570 1.233 knakahar extern bool icmp_dynamic_rt_msg;
1571 1.232 knakahar if (!icmp_dynamic_rt_msg)
1572 1.232 knakahar return;
1573 1.232 knakahar break;
1574 1.233 knakahar }
1575 1.233 knakahar #endif
1576 1.233 knakahar #ifdef INET6
1577 1.233 knakahar case AF_INET6: {
1578 1.233 knakahar extern bool icmp6_dynamic_rt_msg;
1579 1.232 knakahar if (!icmp6_dynamic_rt_msg)
1580 1.232 knakahar return;
1581 1.232 knakahar break;
1582 1.233 knakahar }
1583 1.233 knakahar #endif
1584 1.232 knakahar default:
1585 1.232 knakahar return;
1586 1.232 knakahar }
1587 1.232 knakahar
1588 1.232 knakahar memset((void *)&info, 0, sizeof(info));
1589 1.232 knakahar info.rti_info[RTAX_DST] = rt_getkey(rt);
1590 1.232 knakahar info.rti_info[RTAX_GATEWAY] = gateway;
1591 1.232 knakahar info.rti_info[RTAX_NETMASK] = rt_mask(rt);
1592 1.232 knakahar if (rt->rt_ifp) {
1593 1.232 knakahar info.rti_info[RTAX_IFP] = rt->rt_ifp->if_dl->ifa_addr;
1594 1.232 knakahar info.rti_info[RTAX_IFA] = rt->rt_ifa->ifa_addr;
1595 1.232 knakahar }
1596 1.232 knakahar
1597 1.232 knakahar rt_missmsg(cmd, &info, rt->rt_flags, 0);
1598 1.232 knakahar }
1599 1.232 knakahar
1600 1.232 knakahar /*
1601 1.29 sommerfe * Set up or tear down a routing table entry, normally
1602 1.1 cgd * for an interface.
1603 1.1 cgd */
1604 1.9 mycroft int
1605 1.60 matt rtinit(struct ifaddr *ifa, int cmd, int flags)
1606 1.1 cgd {
1607 1.36 augustss struct rtentry *rt;
1608 1.36 augustss struct sockaddr *dst, *odst;
1609 1.94 dyoung struct sockaddr_storage maskeddst;
1610 1.68 christos struct rtentry *nrt = NULL;
1611 1.1 cgd int error;
1612 1.39 itojun struct rt_addrinfo info;
1613 1.1 cgd
1614 1.1 cgd dst = flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
1615 1.1 cgd if (cmd == RTM_DELETE) {
1616 1.1 cgd if ((flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
1617 1.29 sommerfe /* Delete subnet route for this interface */
1618 1.29 sommerfe odst = dst;
1619 1.94 dyoung dst = (struct sockaddr *)&maskeddst;
1620 1.29 sommerfe rt_maskedcopy(odst, dst, ifa->ifa_netmask);
1621 1.1 cgd }
1622 1.14 christos if ((rt = rtalloc1(dst, 0)) != NULL) {
1623 1.146 ozaki if (rt->rt_ifa != ifa) {
1624 1.183 ozaki rt_unref(rt);
1625 1.85 dyoung return (flags & RTF_HOST) ? EHOSTUNREACH
1626 1.85 dyoung : ENETUNREACH;
1627 1.146 ozaki }
1628 1.183 ozaki rt_unref(rt);
1629 1.1 cgd }
1630 1.1 cgd }
1631 1.44 thorpej memset(&info, 0, sizeof(info));
1632 1.39 itojun info.rti_ifa = ifa;
1633 1.215 ozaki info.rti_flags = flags | ifa->ifa_flags | RTF_DONTCHANGEIFA;
1634 1.39 itojun info.rti_info[RTAX_DST] = dst;
1635 1.39 itojun info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
1636 1.158 ozaki
1637 1.39 itojun /*
1638 1.39 itojun * XXX here, it seems that we are assuming that ifa_netmask is NULL
1639 1.39 itojun * for RTF_HOST. bsdi4 passes NULL explicitly (via intermediate
1640 1.39 itojun * variable) when RTF_HOST is 1. still not sure if i can safely
1641 1.39 itojun * change it to meet bsdi4 behavior.
1642 1.39 itojun */
1643 1.114 dyoung if (cmd != RTM_LLINFO_UPD)
1644 1.114 dyoung info.rti_info[RTAX_NETMASK] = ifa->ifa_netmask;
1645 1.114 dyoung error = rtrequest1((cmd == RTM_LLINFO_UPD) ? RTM_GET : cmd, &info,
1646 1.114 dyoung &nrt);
1647 1.153 ozaki if (error != 0)
1648 1.146 ozaki return error;
1649 1.146 ozaki
1650 1.153 ozaki rt = nrt;
1651 1.183 ozaki RT_REFCNT_TRACE(rt);
1652 1.146 ozaki switch (cmd) {
1653 1.114 dyoung case RTM_DELETE:
1654 1.146 ozaki rt_newmsg(cmd, rt);
1655 1.183 ozaki rt_free(rt);
1656 1.114 dyoung break;
1657 1.114 dyoung case RTM_LLINFO_UPD:
1658 1.114 dyoung if (cmd == RTM_LLINFO_UPD && ifa->ifa_rtrequest != NULL)
1659 1.114 dyoung ifa->ifa_rtrequest(RTM_LLINFO_UPD, rt, &info);
1660 1.146 ozaki rt_newmsg(RTM_CHANGE, rt);
1661 1.183 ozaki rt_unref(rt);
1662 1.114 dyoung break;
1663 1.114 dyoung case RTM_ADD:
1664 1.215 ozaki KASSERT(rt->rt_ifa == ifa);
1665 1.146 ozaki rt_newmsg(cmd, rt);
1666 1.183 ozaki rt_unref(rt);
1667 1.183 ozaki RT_REFCNT_TRACE(rt);
1668 1.114 dyoung break;
1669 1.1 cgd }
1670 1.85 dyoung return error;
1671 1.18 kml }
1672 1.18 kml
1673 1.136 roy /*
1674 1.136 roy * Create a local route entry for the address.
1675 1.136 roy * Announce the addition of the address and the route to the routing socket.
1676 1.136 roy */
1677 1.136 roy int
1678 1.136 roy rt_ifa_addlocal(struct ifaddr *ifa)
1679 1.136 roy {
1680 1.136 roy struct rtentry *rt;
1681 1.136 roy int e;
1682 1.136 roy
1683 1.136 roy /* If there is no loopback entry, allocate one. */
1684 1.136 roy rt = rtalloc1(ifa->ifa_addr, 0);
1685 1.158 ozaki #ifdef RT_DEBUG
1686 1.158 ozaki if (rt != NULL)
1687 1.158 ozaki dump_rt(rt);
1688 1.158 ozaki #endif
1689 1.136 roy if (rt == NULL || (rt->rt_flags & RTF_HOST) == 0 ||
1690 1.136 roy (rt->rt_ifp->if_flags & IFF_LOOPBACK) == 0)
1691 1.152 roy {
1692 1.152 roy struct rt_addrinfo info;
1693 1.152 roy struct rtentry *nrt;
1694 1.152 roy
1695 1.152 roy memset(&info, 0, sizeof(info));
1696 1.215 ozaki info.rti_flags = RTF_HOST | RTF_LOCAL | RTF_DONTCHANGEIFA;
1697 1.152 roy info.rti_info[RTAX_DST] = ifa->ifa_addr;
1698 1.152 roy info.rti_info[RTAX_GATEWAY] =
1699 1.152 roy (const struct sockaddr *)ifa->ifa_ifp->if_sadl;
1700 1.152 roy info.rti_ifa = ifa;
1701 1.152 roy nrt = NULL;
1702 1.152 roy e = rtrequest1(RTM_ADD, &info, &nrt);
1703 1.218 roy rt_addrmsg_rt(RTM_ADD, ifa, e, nrt);
1704 1.158 ozaki if (nrt != NULL) {
1705 1.215 ozaki KASSERT(nrt->rt_ifa == ifa);
1706 1.158 ozaki #ifdef RT_DEBUG
1707 1.158 ozaki dump_rt(nrt);
1708 1.158 ozaki #endif
1709 1.183 ozaki rt_unref(nrt);
1710 1.183 ozaki RT_REFCNT_TRACE(nrt);
1711 1.158 ozaki }
1712 1.152 roy } else {
1713 1.136 roy e = 0;
1714 1.218 roy rt_addrmsg(RTM_NEWADDR, ifa);
1715 1.136 roy }
1716 1.136 roy if (rt != NULL)
1717 1.183 ozaki rt_unref(rt);
1718 1.136 roy return e;
1719 1.136 roy }
1720 1.136 roy
1721 1.136 roy /*
1722 1.136 roy * Remove the local route entry for the address.
1723 1.136 roy * Announce the removal of the address and the route to the routing socket.
1724 1.136 roy */
1725 1.136 roy int
1726 1.136 roy rt_ifa_remlocal(struct ifaddr *ifa, struct ifaddr *alt_ifa)
1727 1.136 roy {
1728 1.136 roy struct rtentry *rt;
1729 1.136 roy int e = 0;
1730 1.136 roy
1731 1.136 roy rt = rtalloc1(ifa->ifa_addr, 0);
1732 1.136 roy
1733 1.136 roy /*
1734 1.136 roy * Before deleting, check if a corresponding loopbacked
1735 1.136 roy * host route surely exists. With this check, we can avoid
1736 1.136 roy * deleting an interface direct route whose destination is
1737 1.136 roy * the same as the address being removed. This can happen
1738 1.136 roy * when removing a subnet-router anycast address on an
1739 1.136 roy * interface attached to a shared medium.
1740 1.136 roy */
1741 1.136 roy if (rt != NULL &&
1742 1.136 roy (rt->rt_flags & RTF_HOST) &&
1743 1.136 roy (rt->rt_ifp->if_flags & IFF_LOOPBACK))
1744 1.136 roy {
1745 1.136 roy /* If we cannot replace the route's ifaddr with the equivalent
1746 1.136 roy * ifaddr of another interface, I believe it is safest to
1747 1.136 roy * delete the route.
1748 1.136 roy */
1749 1.152 roy if (alt_ifa == NULL) {
1750 1.152 roy e = rtdeletemsg(rt);
1751 1.183 ozaki if (e == 0) {
1752 1.183 ozaki rt_unref(rt);
1753 1.183 ozaki rt_free(rt);
1754 1.183 ozaki rt = NULL;
1755 1.183 ozaki }
1756 1.218 roy rt_addrmsg(RTM_DELADDR, ifa);
1757 1.152 roy } else {
1758 1.216 ozaki #ifdef NET_MPSAFE
1759 1.216 ozaki int error = rt_update_prepare(rt);
1760 1.216 ozaki if (error == 0) {
1761 1.216 ozaki rt_replace_ifa(rt, alt_ifa);
1762 1.216 ozaki rt_update_finish(rt);
1763 1.216 ozaki } else {
1764 1.216 ozaki /*
1765 1.216 ozaki * If error != 0, the rtentry is being
1766 1.216 ozaki * destroyed, so doing nothing doesn't
1767 1.216 ozaki * matter.
1768 1.216 ozaki */
1769 1.216 ozaki }
1770 1.216 ozaki #else
1771 1.136 roy rt_replace_ifa(rt, alt_ifa);
1772 1.216 ozaki #endif
1773 1.136 roy rt_newmsg(RTM_CHANGE, rt);
1774 1.136 roy }
1775 1.136 roy } else
1776 1.218 roy rt_addrmsg(RTM_DELADDR, ifa);
1777 1.136 roy if (rt != NULL)
1778 1.183 ozaki rt_unref(rt);
1779 1.136 roy return e;
1780 1.136 roy }
1781 1.136 roy
1782 1.18 kml /*
1783 1.18 kml * Route timer routines. These routes allow functions to be called
1784 1.18 kml * for various routes at any time. This is useful in supporting
1785 1.18 kml * path MTU discovery and redirect route deletion.
1786 1.18 kml *
1787 1.18 kml * This is similar to some BSDI internal functions, but it provides
1788 1.18 kml * for multiple queues for efficiency's sake...
1789 1.18 kml */
1790 1.18 kml
1791 1.18 kml LIST_HEAD(, rttimer_queue) rttimer_queue_head;
1792 1.18 kml static int rt_init_done = 0;
1793 1.18 kml
1794 1.65 perry /*
1795 1.18 kml * Some subtle order problems with domain initialization mean that
1796 1.18 kml * we cannot count on this being run from rt_init before various
1797 1.18 kml * protocol initializations are done. Therefore, we make sure
1798 1.18 kml * that this is run when the first queue is added...
1799 1.18 kml */
1800 1.18 kml
1801 1.170 ozaki static void rt_timer_work(struct work *, void *);
1802 1.170 ozaki
1803 1.177 ozaki static void
1804 1.60 matt rt_timer_init(void)
1805 1.18 kml {
1806 1.170 ozaki int error;
1807 1.170 ozaki
1808 1.18 kml assert(rt_init_done == 0);
1809 1.18 kml
1810 1.183 ozaki /* XXX should be in rt_init */
1811 1.183 ozaki rw_init(&rt_lock);
1812 1.183 ozaki
1813 1.18 kml LIST_INIT(&rttimer_queue_head);
1814 1.172 martin callout_init(&rt_timer_ch, CALLOUT_MPSAFE);
1815 1.170 ozaki error = workqueue_create(&rt_timer_wq, "rt_timer",
1816 1.170 ozaki rt_timer_work, NULL, PRI_SOFTNET, IPL_SOFTNET, WQ_MPSAFE);
1817 1.170 ozaki if (error)
1818 1.170 ozaki panic("%s: workqueue_create failed (%d)\n", __func__, error);
1819 1.172 martin callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1820 1.18 kml rt_init_done = 1;
1821 1.18 kml }
1822 1.18 kml
1823 1.18 kml struct rttimer_queue *
1824 1.60 matt rt_timer_queue_create(u_int timeout)
1825 1.18 kml {
1826 1.18 kml struct rttimer_queue *rtq;
1827 1.18 kml
1828 1.18 kml if (rt_init_done == 0)
1829 1.18 kml rt_timer_init();
1830 1.18 kml
1831 1.18 kml R_Malloc(rtq, struct rttimer_queue *, sizeof *rtq);
1832 1.18 kml if (rtq == NULL)
1833 1.85 dyoung return NULL;
1834 1.109 dyoung memset(rtq, 0, sizeof(*rtq));
1835 1.18 kml
1836 1.18 kml rtq->rtq_timeout = timeout;
1837 1.24 thorpej TAILQ_INIT(&rtq->rtq_head);
1838 1.183 ozaki RT_WLOCK();
1839 1.18 kml LIST_INSERT_HEAD(&rttimer_queue_head, rtq, rtq_link);
1840 1.183 ozaki RT_UNLOCK();
1841 1.18 kml
1842 1.85 dyoung return rtq;
1843 1.18 kml }
1844 1.18 kml
1845 1.18 kml void
1846 1.60 matt rt_timer_queue_change(struct rttimer_queue *rtq, long timeout)
1847 1.18 kml {
1848 1.24 thorpej
1849 1.18 kml rtq->rtq_timeout = timeout;
1850 1.18 kml }
1851 1.18 kml
1852 1.177 ozaki static void
1853 1.181 ozaki rt_timer_queue_remove_all(struct rttimer_queue *rtq)
1854 1.18 kml {
1855 1.24 thorpej struct rttimer *r;
1856 1.18 kml
1857 1.183 ozaki RT_ASSERT_WLOCK();
1858 1.183 ozaki
1859 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL) {
1860 1.18 kml LIST_REMOVE(r, rtt_link);
1861 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
1862 1.183 ozaki rt_ref(r->rtt_rt); /* XXX */
1863 1.183 ozaki RT_REFCNT_TRACE(r->rtt_rt);
1864 1.183 ozaki RT_UNLOCK();
1865 1.181 ozaki (*r->rtt_func)(r->rtt_rt, r);
1866 1.22 thorpej pool_put(&rttimer_pool, r);
1867 1.183 ozaki RT_WLOCK();
1868 1.37 itojun if (rtq->rtq_count > 0)
1869 1.37 itojun rtq->rtq_count--;
1870 1.37 itojun else
1871 1.55 itojun printf("rt_timer_queue_remove_all: "
1872 1.55 itojun "rtq_count reached 0\n");
1873 1.18 kml }
1874 1.55 itojun }
1875 1.55 itojun
1876 1.55 itojun void
1877 1.181 ozaki rt_timer_queue_destroy(struct rttimer_queue *rtq)
1878 1.55 itojun {
1879 1.55 itojun
1880 1.183 ozaki RT_WLOCK();
1881 1.181 ozaki rt_timer_queue_remove_all(rtq);
1882 1.18 kml LIST_REMOVE(rtq, rtq_link);
1883 1.183 ozaki RT_UNLOCK();
1884 1.22 thorpej
1885 1.22 thorpej /*
1886 1.22 thorpej * Caller is responsible for freeing the rttimer_queue structure.
1887 1.22 thorpej */
1888 1.18 kml }
1889 1.18 kml
1890 1.37 itojun unsigned long
1891 1.60 matt rt_timer_count(struct rttimer_queue *rtq)
1892 1.37 itojun {
1893 1.37 itojun return rtq->rtq_count;
1894 1.37 itojun }
1895 1.37 itojun
1896 1.177 ozaki static void
1897 1.178 ozaki rt_timer_remove_all(struct rtentry *rt)
1898 1.18 kml {
1899 1.24 thorpej struct rttimer *r;
1900 1.18 kml
1901 1.183 ozaki RT_WLOCK();
1902 1.24 thorpej while ((r = LIST_FIRST(&rt->rt_timer)) != NULL) {
1903 1.18 kml LIST_REMOVE(r, rtt_link);
1904 1.24 thorpej TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
1905 1.37 itojun if (r->rtt_queue->rtq_count > 0)
1906 1.37 itojun r->rtt_queue->rtq_count--;
1907 1.37 itojun else
1908 1.37 itojun printf("rt_timer_remove_all: rtq_count reached 0\n");
1909 1.38 itojun pool_put(&rttimer_pool, r);
1910 1.18 kml }
1911 1.183 ozaki RT_UNLOCK();
1912 1.18 kml }
1913 1.18 kml
1914 1.65 perry int
1915 1.60 matt rt_timer_add(struct rtentry *rt,
1916 1.60 matt void (*func)(struct rtentry *, struct rttimer *),
1917 1.60 matt struct rttimer_queue *queue)
1918 1.18 kml {
1919 1.24 thorpej struct rttimer *r;
1920 1.18 kml
1921 1.156 ozaki KASSERT(func != NULL);
1922 1.183 ozaki RT_WLOCK();
1923 1.24 thorpej /*
1924 1.24 thorpej * If there's already a timer with this action, destroy it before
1925 1.24 thorpej * we add a new one.
1926 1.24 thorpej */
1927 1.85 dyoung LIST_FOREACH(r, &rt->rt_timer, rtt_link) {
1928 1.85 dyoung if (r->rtt_func == func)
1929 1.85 dyoung break;
1930 1.85 dyoung }
1931 1.85 dyoung if (r != NULL) {
1932 1.85 dyoung LIST_REMOVE(r, rtt_link);
1933 1.85 dyoung TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
1934 1.85 dyoung if (r->rtt_queue->rtq_count > 0)
1935 1.85 dyoung r->rtt_queue->rtq_count--;
1936 1.85 dyoung else
1937 1.85 dyoung printf("rt_timer_add: rtq_count reached 0\n");
1938 1.85 dyoung } else {
1939 1.85 dyoung r = pool_get(&rttimer_pool, PR_NOWAIT);
1940 1.183 ozaki if (r == NULL) {
1941 1.183 ozaki RT_UNLOCK();
1942 1.85 dyoung return ENOBUFS;
1943 1.183 ozaki }
1944 1.18 kml }
1945 1.18 kml
1946 1.85 dyoung memset(r, 0, sizeof(*r));
1947 1.24 thorpej
1948 1.24 thorpej r->rtt_rt = rt;
1949 1.70 kardel r->rtt_time = time_uptime;
1950 1.24 thorpej r->rtt_func = func;
1951 1.24 thorpej r->rtt_queue = queue;
1952 1.24 thorpej LIST_INSERT_HEAD(&rt->rt_timer, r, rtt_link);
1953 1.24 thorpej TAILQ_INSERT_TAIL(&queue->rtq_head, r, rtt_next);
1954 1.37 itojun r->rtt_queue->rtq_count++;
1955 1.65 perry
1956 1.183 ozaki RT_UNLOCK();
1957 1.183 ozaki
1958 1.95 dyoung return 0;
1959 1.18 kml }
1960 1.18 kml
1961 1.170 ozaki static void
1962 1.170 ozaki rt_timer_work(struct work *wk, void *arg)
1963 1.18 kml {
1964 1.24 thorpej struct rttimer_queue *rtq;
1965 1.24 thorpej struct rttimer *r;
1966 1.21 kml
1967 1.183 ozaki RT_WLOCK();
1968 1.85 dyoung LIST_FOREACH(rtq, &rttimer_queue_head, rtq_link) {
1969 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL &&
1970 1.70 kardel (r->rtt_time + rtq->rtq_timeout) < time_uptime) {
1971 1.24 thorpej LIST_REMOVE(r, rtt_link);
1972 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
1973 1.210 ozaki /*
1974 1.210 ozaki * Take a reference to avoid the rtentry is freed
1975 1.210 ozaki * accidentally after RT_UNLOCK. The callback
1976 1.210 ozaki * (rtt_func) must rt_unref it by itself.
1977 1.210 ozaki */
1978 1.210 ozaki rt_ref(r->rtt_rt);
1979 1.183 ozaki RT_REFCNT_TRACE(r->rtt_rt);
1980 1.183 ozaki RT_UNLOCK();
1981 1.156 ozaki (*r->rtt_func)(r->rtt_rt, r);
1982 1.24 thorpej pool_put(&rttimer_pool, r);
1983 1.183 ozaki RT_WLOCK();
1984 1.37 itojun if (rtq->rtq_count > 0)
1985 1.37 itojun rtq->rtq_count--;
1986 1.37 itojun else
1987 1.37 itojun printf("rt_timer_timer: rtq_count reached 0\n");
1988 1.18 kml }
1989 1.18 kml }
1990 1.183 ozaki RT_UNLOCK();
1991 1.18 kml
1992 1.35 thorpej callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1993 1.1 cgd }
1994 1.83 joerg
1995 1.177 ozaki static void
1996 1.170 ozaki rt_timer_timer(void *arg)
1997 1.170 ozaki {
1998 1.170 ozaki
1999 1.170 ozaki workqueue_enqueue(rt_timer_wq, &rt_timer_wk, NULL);
2000 1.170 ozaki }
2001 1.170 ozaki
2002 1.102 dyoung static struct rtentry *
2003 1.84 joerg _rtcache_init(struct route *ro, int flag)
2004 1.84 joerg {
2005 1.183 ozaki struct rtentry *rt;
2006 1.183 ozaki
2007 1.114 dyoung rtcache_invariants(ro);
2008 1.99 dyoung KASSERT(ro->_ro_rt == NULL);
2009 1.84 joerg
2010 1.90 dyoung if (rtcache_getdst(ro) == NULL)
2011 1.102 dyoung return NULL;
2012 1.183 ozaki rt = rtalloc1(rtcache_getdst(ro), flag);
2013 1.200 ozaki if (rt != NULL) {
2014 1.200 ozaki RT_RLOCK();
2015 1.200 ozaki if (ISSET(rt->rt_flags, RTF_UP)) {
2016 1.200 ozaki ro->_ro_rt = rt;
2017 1.200 ozaki ro->ro_rtcache_generation = rtcache_generation;
2018 1.200 ozaki rtcache_ref(rt, ro);
2019 1.200 ozaki }
2020 1.200 ozaki RT_UNLOCK();
2021 1.183 ozaki rt_unref(rt);
2022 1.200 ozaki }
2023 1.103 dyoung
2024 1.114 dyoung rtcache_invariants(ro);
2025 1.102 dyoung return ro->_ro_rt;
2026 1.84 joerg }
2027 1.84 joerg
2028 1.102 dyoung struct rtentry *
2029 1.83 joerg rtcache_init(struct route *ro)
2030 1.83 joerg {
2031 1.200 ozaki
2032 1.200 ozaki return _rtcache_init(ro, 1);
2033 1.83 joerg }
2034 1.83 joerg
2035 1.102 dyoung struct rtentry *
2036 1.83 joerg rtcache_init_noclone(struct route *ro)
2037 1.83 joerg {
2038 1.200 ozaki
2039 1.200 ozaki return _rtcache_init(ro, 0);
2040 1.83 joerg }
2041 1.90 dyoung
2042 1.102 dyoung struct rtentry *
2043 1.90 dyoung rtcache_update(struct route *ro, int clone)
2044 1.90 dyoung {
2045 1.200 ozaki
2046 1.199 ozaki ro->_ro_rt = NULL;
2047 1.200 ozaki return _rtcache_init(ro, clone);
2048 1.90 dyoung }
2049 1.83 joerg
2050 1.83 joerg void
2051 1.183 ozaki rtcache_copy(struct route *new_ro, struct route *old_ro)
2052 1.83 joerg {
2053 1.103 dyoung struct rtentry *rt;
2054 1.183 ozaki int ret;
2055 1.103 dyoung
2056 1.103 dyoung KASSERT(new_ro != old_ro);
2057 1.114 dyoung rtcache_invariants(new_ro);
2058 1.114 dyoung rtcache_invariants(old_ro);
2059 1.103 dyoung
2060 1.183 ozaki rt = rtcache_validate(old_ro);
2061 1.103 dyoung
2062 1.183 ozaki if (rtcache_getdst(old_ro) == NULL)
2063 1.183 ozaki goto out;
2064 1.183 ozaki ret = rtcache_setdst(new_ro, rtcache_getdst(old_ro));
2065 1.183 ozaki if (ret != 0)
2066 1.183 ozaki goto out;
2067 1.103 dyoung
2068 1.201 ozaki RT_RLOCK();
2069 1.199 ozaki new_ro->_ro_rt = rt;
2070 1.199 ozaki new_ro->ro_rtcache_generation = rtcache_generation;
2071 1.201 ozaki RT_UNLOCK();
2072 1.114 dyoung rtcache_invariants(new_ro);
2073 1.183 ozaki out:
2074 1.183 ozaki rtcache_unref(rt, old_ro);
2075 1.183 ozaki return;
2076 1.83 joerg }
2077 1.83 joerg
2078 1.184 ozaki #if defined(RT_DEBUG) && defined(NET_MPSAFE)
2079 1.183 ozaki static void
2080 1.183 ozaki rtcache_trace(const char *func, struct rtentry *rt, struct route *ro)
2081 1.183 ozaki {
2082 1.183 ozaki char dst[64];
2083 1.183 ozaki
2084 1.183 ozaki sockaddr_format(ro->ro_sa, dst, 64);
2085 1.183 ozaki printf("trace: %s:\tdst=%s cpu=%d lwp=%p psref=%p target=%p\n", func, dst,
2086 1.183 ozaki cpu_index(curcpu()), curlwp, &ro->ro_psref, &rt->rt_psref);
2087 1.183 ozaki }
2088 1.183 ozaki #define RTCACHE_PSREF_TRACE(rt, ro) rtcache_trace(__func__, (rt), (ro))
2089 1.183 ozaki #else
2090 1.183 ozaki #define RTCACHE_PSREF_TRACE(rt, ro) do {} while (0)
2091 1.183 ozaki #endif
2092 1.183 ozaki
2093 1.183 ozaki static void
2094 1.183 ozaki rtcache_ref(struct rtentry *rt, struct route *ro)
2095 1.183 ozaki {
2096 1.183 ozaki
2097 1.183 ozaki KASSERT(rt != NULL);
2098 1.183 ozaki
2099 1.183 ozaki #ifdef NET_MPSAFE
2100 1.183 ozaki RTCACHE_PSREF_TRACE(rt, ro);
2101 1.183 ozaki ro->ro_bound = curlwp_bind();
2102 1.219 ozaki /* XXX Use a real caller's address */
2103 1.219 ozaki PSREF_DEBUG_FILL_RETURN_ADDRESS(&ro->ro_psref);
2104 1.183 ozaki psref_acquire(&ro->ro_psref, &rt->rt_psref, rt_psref_class);
2105 1.183 ozaki #endif
2106 1.183 ozaki }
2107 1.183 ozaki
2108 1.183 ozaki void
2109 1.183 ozaki rtcache_unref(struct rtentry *rt, struct route *ro)
2110 1.183 ozaki {
2111 1.183 ozaki
2112 1.183 ozaki if (rt == NULL)
2113 1.183 ozaki return;
2114 1.183 ozaki
2115 1.183 ozaki #ifdef NET_MPSAFE
2116 1.183 ozaki psref_release(&ro->ro_psref, &rt->rt_psref, rt_psref_class);
2117 1.183 ozaki curlwp_bindx(ro->ro_bound);
2118 1.183 ozaki RTCACHE_PSREF_TRACE(rt, ro);
2119 1.183 ozaki #endif
2120 1.183 ozaki }
2121 1.183 ozaki
2122 1.200 ozaki struct rtentry *
2123 1.200 ozaki rtcache_validate(struct route *ro)
2124 1.183 ozaki {
2125 1.183 ozaki struct rtentry *rt = NULL;
2126 1.183 ozaki
2127 1.188 ozaki #ifdef NET_MPSAFE
2128 1.183 ozaki retry:
2129 1.188 ozaki #endif
2130 1.183 ozaki rtcache_invariants(ro);
2131 1.201 ozaki RT_RLOCK();
2132 1.199 ozaki if (ro->ro_rtcache_generation != rtcache_generation) {
2133 1.199 ozaki /* The cache is invalidated */
2134 1.201 ozaki rt = NULL;
2135 1.201 ozaki goto out;
2136 1.200 ozaki }
2137 1.200 ozaki
2138 1.200 ozaki rt = ro->_ro_rt;
2139 1.200 ozaki if (rt == NULL)
2140 1.201 ozaki goto out;
2141 1.200 ozaki
2142 1.200 ozaki if ((rt->rt_flags & RTF_UP) == 0) {
2143 1.183 ozaki rt = NULL;
2144 1.183 ozaki goto out;
2145 1.183 ozaki }
2146 1.200 ozaki #ifdef NET_MPSAFE
2147 1.200 ozaki if (ISSET(rt->rt_flags, RTF_UPDATING)) {
2148 1.200 ozaki if (rt_wait_ok()) {
2149 1.200 ozaki RT_UNLOCK();
2150 1.183 ozaki
2151 1.200 ozaki /* We can wait until the update is complete */
2152 1.200 ozaki rt_update_wait();
2153 1.200 ozaki goto retry;
2154 1.200 ozaki } else {
2155 1.200 ozaki rt = NULL;
2156 1.200 ozaki }
2157 1.200 ozaki } else
2158 1.188 ozaki #endif
2159 1.200 ozaki rtcache_ref(rt, ro);
2160 1.200 ozaki out:
2161 1.183 ozaki RT_UNLOCK();
2162 1.183 ozaki return rt;
2163 1.183 ozaki }
2164 1.183 ozaki
2165 1.90 dyoung struct rtentry *
2166 1.183 ozaki rtcache_lookup2(struct route *ro, const struct sockaddr *dst,
2167 1.183 ozaki int clone, int *hitp)
2168 1.90 dyoung {
2169 1.90 dyoung const struct sockaddr *odst;
2170 1.104 dyoung struct rtentry *rt = NULL;
2171 1.90 dyoung
2172 1.90 dyoung odst = rtcache_getdst(ro);
2173 1.200 ozaki if (odst == NULL)
2174 1.138 ozaki goto miss;
2175 1.90 dyoung
2176 1.138 ozaki if (sockaddr_cmp(odst, dst) != 0) {
2177 1.200 ozaki rtcache_free(ro);
2178 1.138 ozaki goto miss;
2179 1.138 ozaki }
2180 1.138 ozaki
2181 1.200 ozaki rt = rtcache_validate(ro);
2182 1.138 ozaki if (rt == NULL) {
2183 1.199 ozaki ro->_ro_rt = NULL;
2184 1.138 ozaki goto miss;
2185 1.138 ozaki }
2186 1.138 ozaki
2187 1.138 ozaki rtcache_invariants(ro);
2188 1.90 dyoung
2189 1.183 ozaki if (hitp != NULL)
2190 1.183 ozaki *hitp = 1;
2191 1.138 ozaki return rt;
2192 1.138 ozaki miss:
2193 1.183 ozaki if (hitp != NULL)
2194 1.183 ozaki *hitp = 0;
2195 1.200 ozaki if (rtcache_setdst(ro, dst) == 0)
2196 1.138 ozaki rt = _rtcache_init(ro, clone);
2197 1.90 dyoung
2198 1.114 dyoung rtcache_invariants(ro);
2199 1.114 dyoung
2200 1.104 dyoung return rt;
2201 1.90 dyoung }
2202 1.90 dyoung
2203 1.200 ozaki void
2204 1.200 ozaki rtcache_free(struct route *ro)
2205 1.86 dyoung {
2206 1.183 ozaki
2207 1.199 ozaki ro->_ro_rt = NULL;
2208 1.86 dyoung if (ro->ro_sa != NULL) {
2209 1.86 dyoung sockaddr_free(ro->ro_sa);
2210 1.86 dyoung ro->ro_sa = NULL;
2211 1.86 dyoung }
2212 1.114 dyoung rtcache_invariants(ro);
2213 1.86 dyoung }
2214 1.86 dyoung
2215 1.200 ozaki int
2216 1.200 ozaki rtcache_setdst(struct route *ro, const struct sockaddr *sa)
2217 1.83 joerg {
2218 1.90 dyoung KASSERT(sa != NULL);
2219 1.90 dyoung
2220 1.114 dyoung rtcache_invariants(ro);
2221 1.142 ozaki if (ro->ro_sa != NULL) {
2222 1.142 ozaki if (ro->ro_sa->sa_family == sa->sa_family) {
2223 1.199 ozaki ro->_ro_rt = NULL;
2224 1.142 ozaki sockaddr_copy(ro->ro_sa, ro->ro_sa->sa_len, sa);
2225 1.143 ozaki rtcache_invariants(ro);
2226 1.143 ozaki return 0;
2227 1.114 dyoung }
2228 1.143 ozaki /* free ro_sa, wrong family */
2229 1.200 ozaki rtcache_free(ro);
2230 1.142 ozaki }
2231 1.90 dyoung
2232 1.107 dyoung KASSERT(ro->_ro_rt == NULL);
2233 1.107 dyoung
2234 1.134 christos if ((ro->ro_sa = sockaddr_dup(sa, M_ZERO | M_NOWAIT)) == NULL) {
2235 1.114 dyoung rtcache_invariants(ro);
2236 1.90 dyoung return ENOMEM;
2237 1.107 dyoung }
2238 1.114 dyoung rtcache_invariants(ro);
2239 1.90 dyoung return 0;
2240 1.83 joerg }
2241 1.92 dyoung
2242 1.220 ozaki static void
2243 1.220 ozaki rtcache_percpu_init_cpu(void *p, void *arg __unused, struct cpu_info *ci __unused)
2244 1.220 ozaki {
2245 1.220 ozaki struct route **rop = p;
2246 1.220 ozaki
2247 1.220 ozaki /*
2248 1.220 ozaki * We can't have struct route as percpu data because it can be destroyed
2249 1.220 ozaki * over a memory enlargement processing of percpu.
2250 1.220 ozaki */
2251 1.220 ozaki *rop = kmem_zalloc(sizeof(**rop), KM_SLEEP);
2252 1.220 ozaki }
2253 1.220 ozaki
2254 1.220 ozaki percpu_t *
2255 1.220 ozaki rtcache_percpu_alloc(void)
2256 1.220 ozaki {
2257 1.220 ozaki
2258 1.227 riastrad return percpu_create(sizeof(struct route *),
2259 1.227 riastrad rtcache_percpu_init_cpu, NULL, NULL);
2260 1.220 ozaki }
2261 1.220 ozaki
2262 1.123 kefren const struct sockaddr *
2263 1.123 kefren rt_settag(struct rtentry *rt, const struct sockaddr *tag)
2264 1.123 kefren {
2265 1.123 kefren if (rt->rt_tag != tag) {
2266 1.123 kefren if (rt->rt_tag != NULL)
2267 1.123 kefren sockaddr_free(rt->rt_tag);
2268 1.134 christos rt->rt_tag = sockaddr_dup(tag, M_ZERO | M_NOWAIT);
2269 1.123 kefren }
2270 1.169 msaitoh return rt->rt_tag;
2271 1.123 kefren }
2272 1.123 kefren
2273 1.123 kefren struct sockaddr *
2274 1.167 ozaki rt_gettag(const struct rtentry *rt)
2275 1.123 kefren {
2276 1.123 kefren return rt->rt_tag;
2277 1.123 kefren }
2278 1.162 ozaki
2279 1.165 ozaki int
2280 1.167 ozaki rt_check_reject_route(const struct rtentry *rt, const struct ifnet *ifp)
2281 1.165 ozaki {
2282 1.165 ozaki
2283 1.165 ozaki if ((rt->rt_flags & RTF_REJECT) != 0) {
2284 1.165 ozaki /* Mimic looutput */
2285 1.165 ozaki if (ifp->if_flags & IFF_LOOPBACK)
2286 1.165 ozaki return (rt->rt_flags & RTF_HOST) ?
2287 1.165 ozaki EHOSTUNREACH : ENETUNREACH;
2288 1.165 ozaki else if (rt->rt_rmx.rmx_expire == 0 ||
2289 1.165 ozaki time_uptime < rt->rt_rmx.rmx_expire)
2290 1.165 ozaki return (rt->rt_flags & RTF_GATEWAY) ?
2291 1.165 ozaki EHOSTUNREACH : EHOSTDOWN;
2292 1.165 ozaki }
2293 1.165 ozaki
2294 1.165 ozaki return 0;
2295 1.165 ozaki }
2296 1.165 ozaki
2297 1.182 ozaki void
2298 1.182 ozaki rt_delete_matched_entries(sa_family_t family, int (*f)(struct rtentry *, void *),
2299 1.234 knakahar void *v, bool notify)
2300 1.182 ozaki {
2301 1.182 ozaki
2302 1.182 ozaki for (;;) {
2303 1.182 ozaki int s;
2304 1.182 ozaki int error;
2305 1.182 ozaki struct rtentry *rt, *retrt = NULL;
2306 1.182 ozaki
2307 1.183 ozaki RT_RLOCK();
2308 1.182 ozaki s = splsoftnet();
2309 1.182 ozaki rt = rtbl_search_matched_entry(family, f, v);
2310 1.182 ozaki if (rt == NULL) {
2311 1.182 ozaki splx(s);
2312 1.183 ozaki RT_UNLOCK();
2313 1.182 ozaki return;
2314 1.182 ozaki }
2315 1.208 ozaki rt_ref(rt);
2316 1.234 knakahar RT_REFCNT_TRACE(rt);
2317 1.182 ozaki splx(s);
2318 1.183 ozaki RT_UNLOCK();
2319 1.182 ozaki
2320 1.182 ozaki error = rtrequest(RTM_DELETE, rt_getkey(rt), rt->rt_gateway,
2321 1.182 ozaki rt_mask(rt), rt->rt_flags, &retrt);
2322 1.182 ozaki if (error == 0) {
2323 1.182 ozaki KASSERT(retrt == rt);
2324 1.182 ozaki KASSERT((retrt->rt_flags & RTF_UP) == 0);
2325 1.234 knakahar if (notify)
2326 1.234 knakahar rt_newmsg(RTM_DELETE, retrt);
2327 1.182 ozaki retrt->rt_ifp = NULL;
2328 1.183 ozaki rt_unref(rt);
2329 1.234 knakahar RT_REFCNT_TRACE(rt);
2330 1.183 ozaki rt_free(retrt);
2331 1.182 ozaki } else if (error == ESRCH) {
2332 1.182 ozaki /* Someone deleted the entry already. */
2333 1.183 ozaki rt_unref(rt);
2334 1.234 knakahar RT_REFCNT_TRACE(rt);
2335 1.182 ozaki } else {
2336 1.182 ozaki log(LOG_ERR, "%s: unable to delete rtentry @ %p, "
2337 1.182 ozaki "error = %d\n", rt->rt_ifp->if_xname, rt, error);
2338 1.182 ozaki /* XXX how to treat this case? */
2339 1.182 ozaki }
2340 1.182 ozaki }
2341 1.182 ozaki }
2342 1.182 ozaki
2343 1.207 ozaki static int
2344 1.207 ozaki rt_walktree_locked(sa_family_t family, int (*f)(struct rtentry *, void *),
2345 1.207 ozaki void *v)
2346 1.207 ozaki {
2347 1.207 ozaki
2348 1.207 ozaki return rtbl_walktree(family, f, v);
2349 1.207 ozaki }
2350 1.207 ozaki
2351 1.234 knakahar void
2352 1.234 knakahar rt_replace_ifa_matched_entries(sa_family_t family,
2353 1.234 knakahar int (*f)(struct rtentry *, void *), void *v, struct ifaddr *ifa)
2354 1.234 knakahar {
2355 1.234 knakahar
2356 1.234 knakahar for (;;) {
2357 1.234 knakahar int s;
2358 1.234 knakahar #ifdef NET_MPSAFE
2359 1.234 knakahar int error;
2360 1.234 knakahar #endif
2361 1.234 knakahar struct rtentry *rt;
2362 1.234 knakahar
2363 1.234 knakahar RT_RLOCK();
2364 1.234 knakahar s = splsoftnet();
2365 1.234 knakahar rt = rtbl_search_matched_entry(family, f, v);
2366 1.234 knakahar if (rt == NULL) {
2367 1.234 knakahar splx(s);
2368 1.234 knakahar RT_UNLOCK();
2369 1.234 knakahar return;
2370 1.234 knakahar }
2371 1.234 knakahar rt_ref(rt);
2372 1.234 knakahar RT_REFCNT_TRACE(rt);
2373 1.234 knakahar splx(s);
2374 1.234 knakahar RT_UNLOCK();
2375 1.234 knakahar
2376 1.234 knakahar #ifdef NET_MPSAFE
2377 1.234 knakahar error = rt_update_prepare(rt);
2378 1.234 knakahar if (error == 0) {
2379 1.234 knakahar rt_replace_ifa(rt, ifa);
2380 1.234 knakahar rt_update_finish(rt);
2381 1.234 knakahar rt_newmsg(RTM_CHANGE, rt);
2382 1.234 knakahar } else {
2383 1.234 knakahar /*
2384 1.234 knakahar * If error != 0, the rtentry is being
2385 1.234 knakahar * destroyed, so doing nothing doesn't
2386 1.234 knakahar * matter.
2387 1.234 knakahar */
2388 1.234 knakahar }
2389 1.234 knakahar #else
2390 1.234 knakahar rt_replace_ifa(rt, ifa);
2391 1.234 knakahar rt_newmsg(RTM_CHANGE, rt);
2392 1.234 knakahar #endif
2393 1.234 knakahar rt_unref(rt);
2394 1.234 knakahar RT_REFCNT_TRACE(rt);
2395 1.234 knakahar }
2396 1.234 knakahar }
2397 1.234 knakahar
2398 1.183 ozaki int
2399 1.183 ozaki rt_walktree(sa_family_t family, int (*f)(struct rtentry *, void *), void *v)
2400 1.183 ozaki {
2401 1.183 ozaki int error;
2402 1.183 ozaki
2403 1.183 ozaki RT_RLOCK();
2404 1.207 ozaki error = rt_walktree_locked(family, f, v);
2405 1.183 ozaki RT_UNLOCK();
2406 1.183 ozaki
2407 1.183 ozaki return error;
2408 1.183 ozaki }
2409 1.183 ozaki
2410 1.162 ozaki #ifdef DDB
2411 1.162 ozaki
2412 1.162 ozaki #include <machine/db_machdep.h>
2413 1.162 ozaki #include <ddb/db_interface.h>
2414 1.162 ozaki #include <ddb/db_output.h>
2415 1.162 ozaki
2416 1.162 ozaki #define rt_expire rt_rmx.rmx_expire
2417 1.162 ozaki
2418 1.162 ozaki static void
2419 1.162 ozaki db_print_sa(const struct sockaddr *sa)
2420 1.162 ozaki {
2421 1.162 ozaki int len;
2422 1.162 ozaki const u_char *p;
2423 1.162 ozaki
2424 1.162 ozaki if (sa == NULL) {
2425 1.162 ozaki db_printf("[NULL]");
2426 1.162 ozaki return;
2427 1.162 ozaki }
2428 1.162 ozaki
2429 1.162 ozaki p = (const u_char *)sa;
2430 1.162 ozaki len = sa->sa_len;
2431 1.162 ozaki db_printf("[");
2432 1.162 ozaki while (len > 0) {
2433 1.162 ozaki db_printf("%d", *p);
2434 1.162 ozaki p++; len--;
2435 1.162 ozaki if (len) db_printf(",");
2436 1.162 ozaki }
2437 1.162 ozaki db_printf("]\n");
2438 1.162 ozaki }
2439 1.162 ozaki
2440 1.162 ozaki static void
2441 1.162 ozaki db_print_ifa(struct ifaddr *ifa)
2442 1.162 ozaki {
2443 1.162 ozaki if (ifa == NULL)
2444 1.162 ozaki return;
2445 1.162 ozaki db_printf(" ifa_addr=");
2446 1.162 ozaki db_print_sa(ifa->ifa_addr);
2447 1.162 ozaki db_printf(" ifa_dsta=");
2448 1.162 ozaki db_print_sa(ifa->ifa_dstaddr);
2449 1.162 ozaki db_printf(" ifa_mask=");
2450 1.162 ozaki db_print_sa(ifa->ifa_netmask);
2451 1.162 ozaki db_printf(" flags=0x%x,refcnt=%d,metric=%d\n",
2452 1.162 ozaki ifa->ifa_flags,
2453 1.162 ozaki ifa->ifa_refcnt,
2454 1.162 ozaki ifa->ifa_metric);
2455 1.162 ozaki }
2456 1.162 ozaki
2457 1.162 ozaki /*
2458 1.162 ozaki * Function to pass to rt_walktree().
2459 1.162 ozaki * Return non-zero error to abort walk.
2460 1.162 ozaki */
2461 1.162 ozaki static int
2462 1.162 ozaki db_show_rtentry(struct rtentry *rt, void *w)
2463 1.162 ozaki {
2464 1.162 ozaki db_printf("rtentry=%p", rt);
2465 1.162 ozaki
2466 1.162 ozaki db_printf(" flags=0x%x refcnt=%d use=%"PRId64" expire=%"PRId64"\n",
2467 1.162 ozaki rt->rt_flags, rt->rt_refcnt,
2468 1.162 ozaki rt->rt_use, (uint64_t)rt->rt_expire);
2469 1.162 ozaki
2470 1.162 ozaki db_printf(" key="); db_print_sa(rt_getkey(rt));
2471 1.162 ozaki db_printf(" mask="); db_print_sa(rt_mask(rt));
2472 1.162 ozaki db_printf(" gw="); db_print_sa(rt->rt_gateway);
2473 1.162 ozaki
2474 1.162 ozaki db_printf(" ifp=%p ", rt->rt_ifp);
2475 1.162 ozaki if (rt->rt_ifp)
2476 1.162 ozaki db_printf("(%s)", rt->rt_ifp->if_xname);
2477 1.162 ozaki else
2478 1.162 ozaki db_printf("(NULL)");
2479 1.162 ozaki
2480 1.162 ozaki db_printf(" ifa=%p\n", rt->rt_ifa);
2481 1.162 ozaki db_print_ifa(rt->rt_ifa);
2482 1.162 ozaki
2483 1.162 ozaki db_printf(" gwroute=%p llinfo=%p\n",
2484 1.162 ozaki rt->rt_gwroute, rt->rt_llinfo);
2485 1.162 ozaki
2486 1.162 ozaki return 0;
2487 1.162 ozaki }
2488 1.162 ozaki
2489 1.162 ozaki /*
2490 1.162 ozaki * Function to print all the route trees.
2491 1.162 ozaki * Use this from ddb: "show routes"
2492 1.162 ozaki */
2493 1.162 ozaki void
2494 1.162 ozaki db_show_routes(db_expr_t addr, bool have_addr,
2495 1.162 ozaki db_expr_t count, const char *modif)
2496 1.162 ozaki {
2497 1.207 ozaki
2498 1.207 ozaki /* Taking RT_LOCK will fail if LOCKDEBUG is enabled. */
2499 1.207 ozaki rt_walktree_locked(AF_INET, db_show_rtentry, NULL);
2500 1.162 ozaki }
2501 1.162 ozaki #endif
2502