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