route.c revision 1.72 1 1.72 tls /* $NetBSD: route.c,v 1.72 2006/10/05 17:35:19 tls Exp $ */
2 1.18 kml
3 1.18 kml /*-
4 1.18 kml * Copyright (c) 1998 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 * 3. All advertising materials mentioning features or use of this software
20 1.18 kml * must display the following acknowledgement:
21 1.18 kml * This product includes software developed by the NetBSD
22 1.18 kml * Foundation, Inc. and its contributors.
23 1.18 kml * 4. Neither the name of The NetBSD Foundation nor the names of its
24 1.18 kml * contributors may be used to endorse or promote products derived
25 1.18 kml * from this software without specific prior written permission.
26 1.18 kml *
27 1.18 kml * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
28 1.18 kml * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
29 1.18 kml * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
30 1.18 kml * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
31 1.18 kml * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
32 1.18 kml * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
33 1.18 kml * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
34 1.18 kml * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
35 1.18 kml * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
36 1.18 kml * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
37 1.18 kml * POSSIBILITY OF SUCH DAMAGE.
38 1.18 kml */
39 1.11 cgd
40 1.1 cgd /*
41 1.25 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
42 1.25 itojun * All rights reserved.
43 1.65 perry *
44 1.25 itojun * Redistribution and use in source and binary forms, with or without
45 1.25 itojun * modification, are permitted provided that the following conditions
46 1.25 itojun * are met:
47 1.25 itojun * 1. Redistributions of source code must retain the above copyright
48 1.25 itojun * notice, this list of conditions and the following disclaimer.
49 1.25 itojun * 2. Redistributions in binary form must reproduce the above copyright
50 1.25 itojun * notice, this list of conditions and the following disclaimer in the
51 1.25 itojun * documentation and/or other materials provided with the distribution.
52 1.25 itojun * 3. Neither the name of the project nor the names of its contributors
53 1.25 itojun * may be used to endorse or promote products derived from this software
54 1.25 itojun * without specific prior written permission.
55 1.65 perry *
56 1.25 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
57 1.25 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
58 1.25 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
59 1.25 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
60 1.25 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
61 1.25 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
62 1.25 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
63 1.25 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
64 1.25 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
65 1.25 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
66 1.25 itojun * SUCH DAMAGE.
67 1.25 itojun */
68 1.25 itojun
69 1.25 itojun /*
70 1.10 mycroft * Copyright (c) 1980, 1986, 1991, 1993
71 1.10 mycroft * The Regents of the University of California. All rights reserved.
72 1.1 cgd *
73 1.1 cgd * Redistribution and use in source and binary forms, with or without
74 1.1 cgd * modification, are permitted provided that the following conditions
75 1.1 cgd * are met:
76 1.1 cgd * 1. Redistributions of source code must retain the above copyright
77 1.1 cgd * notice, this list of conditions and the following disclaimer.
78 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
79 1.1 cgd * notice, this list of conditions and the following disclaimer in the
80 1.1 cgd * documentation and/or other materials provided with the distribution.
81 1.58 agc * 3. Neither the name of the University nor the names of its contributors
82 1.1 cgd * may be used to endorse or promote products derived from this software
83 1.1 cgd * without specific prior written permission.
84 1.1 cgd *
85 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
86 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
87 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
88 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
89 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
90 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
91 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
92 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
93 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
94 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
95 1.1 cgd * SUCH DAMAGE.
96 1.1 cgd *
97 1.17 christos * @(#)route.c 8.3 (Berkeley) 1/9/95
98 1.1 cgd */
99 1.50 lukem
100 1.50 lukem #include <sys/cdefs.h>
101 1.72 tls __KERNEL_RCSID(0, "$NetBSD: route.c,v 1.72 2006/10/05 17:35:19 tls Exp $");
102 1.19 jonathan
103 1.2 cgd
104 1.5 mycroft #include <sys/param.h>
105 1.5 mycroft #include <sys/systm.h>
106 1.35 thorpej #include <sys/callout.h>
107 1.5 mycroft #include <sys/proc.h>
108 1.5 mycroft #include <sys/mbuf.h>
109 1.5 mycroft #include <sys/socket.h>
110 1.5 mycroft #include <sys/socketvar.h>
111 1.5 mycroft #include <sys/domain.h>
112 1.5 mycroft #include <sys/protosw.h>
113 1.18 kml #include <sys/kernel.h>
114 1.5 mycroft #include <sys/ioctl.h>
115 1.22 thorpej #include <sys/pool.h>
116 1.1 cgd
117 1.5 mycroft #include <net/if.h>
118 1.5 mycroft #include <net/route.h>
119 1.5 mycroft #include <net/raw_cb.h>
120 1.1 cgd
121 1.5 mycroft #include <netinet/in.h>
122 1.5 mycroft #include <netinet/in_var.h>
123 1.1 cgd
124 1.5 mycroft
125 1.52 matt struct route_cb route_cb;
126 1.52 matt struct rtstat rtstat;
127 1.52 matt struct radix_node_head *rt_tables[AF_MAX+1];
128 1.1 cgd
129 1.1 cgd int rttrash; /* routes not in table but not freed */
130 1.1 cgd struct sockaddr wildcard; /* zero valued cookie for wildcard searches */
131 1.1 cgd
132 1.61 simonb POOL_INIT(rtentry_pool, sizeof(struct rtentry), 0, 0, 0, "rtentpl", NULL);
133 1.61 simonb POOL_INIT(rttimer_pool, sizeof(struct rttimer), 0, 0, 0, "rttmrpl", NULL);
134 1.22 thorpej
135 1.35 thorpej struct callout rt_timer_ch; /* callout for rt_timer_timer() */
136 1.35 thorpej
137 1.60 matt static int rtdeletemsg(struct rtentry *);
138 1.60 matt static int rtflushclone1(struct radix_node *, void *);
139 1.60 matt static void rtflushclone(struct radix_node_head *, struct rtentry *);
140 1.40 itojun
141 1.10 mycroft void
142 1.60 matt rtable_init(void **table)
143 1.10 mycroft {
144 1.10 mycroft struct domain *dom;
145 1.64 matt DOMAIN_FOREACH(dom)
146 1.10 mycroft if (dom->dom_rtattach)
147 1.10 mycroft dom->dom_rtattach(&table[dom->dom_family],
148 1.10 mycroft dom->dom_rtoffset);
149 1.10 mycroft }
150 1.1 cgd
151 1.9 mycroft void
152 1.60 matt route_init(void)
153 1.1 cgd {
154 1.22 thorpej
155 1.10 mycroft rn_init(); /* initialize all zeroes, all ones, mask table */
156 1.10 mycroft rtable_init((void **)rt_tables);
157 1.1 cgd }
158 1.1 cgd
159 1.1 cgd /*
160 1.1 cgd * Packet routing routines.
161 1.1 cgd */
162 1.9 mycroft void
163 1.60 matt rtalloc(struct route *ro)
164 1.1 cgd {
165 1.1 cgd if (ro->ro_rt && ro->ro_rt->rt_ifp && (ro->ro_rt->rt_flags & RTF_UP))
166 1.1 cgd return; /* XXX */
167 1.1 cgd ro->ro_rt = rtalloc1(&ro->ro_dst, 1);
168 1.1 cgd }
169 1.25 itojun
170 1.1 cgd struct rtentry *
171 1.60 matt rtalloc1(const struct sockaddr *dst, int report)
172 1.1 cgd {
173 1.36 augustss struct radix_node_head *rnh = rt_tables[dst->sa_family];
174 1.36 augustss struct rtentry *rt;
175 1.36 augustss struct radix_node *rn;
176 1.68 christos struct rtentry *newrt = NULL;
177 1.10 mycroft struct rt_addrinfo info;
178 1.13 mycroft int s = splsoftnet(), err = 0, msgtype = RTM_MISS;
179 1.1 cgd
180 1.66 christos if (rnh && (rn = rnh->rnh_matchaddr(dst, rnh)) &&
181 1.1 cgd ((rn->rn_flags & RNF_ROOT) == 0)) {
182 1.1 cgd newrt = rt = (struct rtentry *)rn;
183 1.1 cgd if (report && (rt->rt_flags & RTF_CLONING)) {
184 1.68 christos err = rtrequest(RTM_RESOLVE, dst, NULL, NULL, 0,
185 1.68 christos &newrt);
186 1.8 cgd if (err) {
187 1.8 cgd newrt = rt;
188 1.8 cgd rt->rt_refcnt++;
189 1.8 cgd goto miss;
190 1.8 cgd }
191 1.69 christos KASSERT(newrt != NULL);
192 1.8 cgd if ((rt = newrt) && (rt->rt_flags & RTF_XRESOLVE)) {
193 1.8 cgd msgtype = RTM_RESOLVE;
194 1.8 cgd goto miss;
195 1.8 cgd }
196 1.39 itojun /* Inform listeners of the new route */
197 1.44 thorpej memset(&info, 0, sizeof(info));
198 1.39 itojun info.rti_info[RTAX_DST] = rt_key(rt);
199 1.39 itojun info.rti_info[RTAX_NETMASK] = rt_mask(rt);
200 1.39 itojun info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
201 1.39 itojun if (rt->rt_ifp != NULL) {
202 1.65 perry info.rti_info[RTAX_IFP] =
203 1.49 matt TAILQ_FIRST(&rt->rt_ifp->if_addrlist)->ifa_addr;
204 1.39 itojun info.rti_info[RTAX_IFA] = rt->rt_ifa->ifa_addr;
205 1.39 itojun }
206 1.39 itojun rt_missmsg(RTM_ADD, &info, rt->rt_flags, 0);
207 1.1 cgd } else
208 1.1 cgd rt->rt_refcnt++;
209 1.1 cgd } else {
210 1.1 cgd rtstat.rts_unreach++;
211 1.10 mycroft miss: if (report) {
212 1.44 thorpej memset((caddr_t)&info, 0, sizeof(info));
213 1.10 mycroft info.rti_info[RTAX_DST] = dst;
214 1.10 mycroft rt_missmsg(msgtype, &info, 0, err);
215 1.10 mycroft }
216 1.1 cgd }
217 1.1 cgd splx(s);
218 1.1 cgd return (newrt);
219 1.1 cgd }
220 1.1 cgd
221 1.9 mycroft void
222 1.60 matt rtfree(struct rtentry *rt)
223 1.1 cgd {
224 1.36 augustss struct ifaddr *ifa;
225 1.10 mycroft
226 1.68 christos if (rt == NULL)
227 1.1 cgd panic("rtfree");
228 1.1 cgd rt->rt_refcnt--;
229 1.1 cgd if (rt->rt_refcnt <= 0 && (rt->rt_flags & RTF_UP) == 0) {
230 1.1 cgd if (rt->rt_nodes->rn_flags & (RNF_ACTIVE | RNF_ROOT))
231 1.1 cgd panic ("rtfree 2");
232 1.10 mycroft rttrash--;
233 1.10 mycroft if (rt->rt_refcnt < 0) {
234 1.16 christos printf("rtfree: %p not freed (neg refs)\n", rt);
235 1.10 mycroft return;
236 1.10 mycroft }
237 1.54 itojun rt_timer_remove_all(rt, 0);
238 1.10 mycroft ifa = rt->rt_ifa;
239 1.10 mycroft IFAFREE(ifa);
240 1.10 mycroft Free(rt_key(rt));
241 1.22 thorpej pool_put(&rtentry_pool, rt);
242 1.1 cgd }
243 1.1 cgd }
244 1.1 cgd
245 1.10 mycroft void
246 1.60 matt ifafree(struct ifaddr *ifa)
247 1.10 mycroft {
248 1.30 thorpej
249 1.30 thorpej #ifdef DIAGNOSTIC
250 1.10 mycroft if (ifa == NULL)
251 1.30 thorpej panic("ifafree: null ifa");
252 1.30 thorpej if (ifa->ifa_refcnt != 0)
253 1.30 thorpej panic("ifafree: ifa_refcnt != 0 (%d)", ifa->ifa_refcnt);
254 1.30 thorpej #endif
255 1.31 thorpej #ifdef IFAREF_DEBUG
256 1.31 thorpej printf("ifafree: freeing ifaddr %p\n", ifa);
257 1.31 thorpej #endif
258 1.30 thorpej free(ifa, M_IFADDR);
259 1.10 mycroft }
260 1.10 mycroft
261 1.1 cgd /*
262 1.1 cgd * Force a routing table entry to the specified
263 1.1 cgd * destination to go through the given gateway.
264 1.1 cgd * Normally called as a result of a routing redirect
265 1.1 cgd * message from the network layer.
266 1.1 cgd *
267 1.13 mycroft * N.B.: must be called at splsoftnet
268 1.1 cgd */
269 1.14 christos void
270 1.60 matt rtredirect(const struct sockaddr *dst, const struct sockaddr *gateway,
271 1.60 matt const struct sockaddr *netmask, int flags, const struct sockaddr *src,
272 1.60 matt struct rtentry **rtp)
273 1.1 cgd {
274 1.36 augustss struct rtentry *rt;
275 1.1 cgd int error = 0;
276 1.68 christos u_quad_t *stat = NULL;
277 1.10 mycroft struct rt_addrinfo info;
278 1.10 mycroft struct ifaddr *ifa;
279 1.1 cgd
280 1.1 cgd /* verify the gateway is directly reachable */
281 1.68 christos if ((ifa = ifa_ifwithnet(gateway)) == NULL) {
282 1.1 cgd error = ENETUNREACH;
283 1.8 cgd goto out;
284 1.1 cgd }
285 1.1 cgd rt = rtalloc1(dst, 0);
286 1.1 cgd /*
287 1.1 cgd * If the redirect isn't from our current router for this dst,
288 1.1 cgd * it's either old or wrong. If it redirects us to ourselves,
289 1.1 cgd * we have a routing loop, perhaps as a result of an interface
290 1.1 cgd * going down recently.
291 1.1 cgd */
292 1.45 itojun #define equal(a1, a2) \
293 1.45 itojun ((a1)->sa_len == (a2)->sa_len && \
294 1.66 christos memcmp((a1), (a2), (a1)->sa_len) == 0)
295 1.10 mycroft if (!(flags & RTF_DONE) && rt &&
296 1.10 mycroft (!equal(src, rt->rt_gateway) || rt->rt_ifa != ifa))
297 1.1 cgd error = EINVAL;
298 1.1 cgd else if (ifa_ifwithaddr(gateway))
299 1.1 cgd error = EHOSTUNREACH;
300 1.1 cgd if (error)
301 1.1 cgd goto done;
302 1.1 cgd /*
303 1.1 cgd * Create a new entry if we just got back a wildcard entry
304 1.33 soren * or the lookup failed. This is necessary for hosts
305 1.1 cgd * which use routing redirects generated by smart gateways
306 1.1 cgd * to dynamically build the routing tables.
307 1.1 cgd */
308 1.68 christos if ((rt == NULL) || (rt_mask(rt) && rt_mask(rt)->sa_len < 2))
309 1.1 cgd goto create;
310 1.1 cgd /*
311 1.1 cgd * Don't listen to the redirect if it's
312 1.65 perry * for a route to an interface.
313 1.1 cgd */
314 1.1 cgd if (rt->rt_flags & RTF_GATEWAY) {
315 1.1 cgd if (((rt->rt_flags & RTF_HOST) == 0) && (flags & RTF_HOST)) {
316 1.1 cgd /*
317 1.1 cgd * Changing from route to net => route to host.
318 1.1 cgd * Create new route, rather than smashing route to net.
319 1.1 cgd */
320 1.1 cgd create:
321 1.39 itojun if (rt)
322 1.39 itojun rtfree(rt);
323 1.1 cgd flags |= RTF_GATEWAY | RTF_DYNAMIC;
324 1.39 itojun info.rti_info[RTAX_DST] = dst;
325 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
326 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
327 1.39 itojun info.rti_ifa = ifa;
328 1.39 itojun info.rti_flags = flags;
329 1.39 itojun rt = NULL;
330 1.39 itojun error = rtrequest1(RTM_ADD, &info, &rt);
331 1.39 itojun if (rt != NULL)
332 1.39 itojun flags = rt->rt_flags;
333 1.1 cgd stat = &rtstat.rts_dynamic;
334 1.1 cgd } else {
335 1.1 cgd /*
336 1.1 cgd * Smash the current notion of the gateway to
337 1.1 cgd * this destination. Should check about netmask!!!
338 1.1 cgd */
339 1.10 mycroft rt->rt_flags |= RTF_MODIFIED;
340 1.10 mycroft flags |= RTF_MODIFIED;
341 1.10 mycroft stat = &rtstat.rts_newgateway;
342 1.10 mycroft rt_setgate(rt, rt_key(rt), gateway);
343 1.1 cgd }
344 1.1 cgd } else
345 1.1 cgd error = EHOSTUNREACH;
346 1.1 cgd done:
347 1.1 cgd if (rt) {
348 1.1 cgd if (rtp && !error)
349 1.1 cgd *rtp = rt;
350 1.1 cgd else
351 1.1 cgd rtfree(rt);
352 1.1 cgd }
353 1.8 cgd out:
354 1.1 cgd if (error)
355 1.1 cgd rtstat.rts_badredirect++;
356 1.8 cgd else if (stat != NULL)
357 1.8 cgd (*stat)++;
358 1.44 thorpej memset((caddr_t)&info, 0, sizeof(info));
359 1.10 mycroft info.rti_info[RTAX_DST] = dst;
360 1.10 mycroft info.rti_info[RTAX_GATEWAY] = gateway;
361 1.10 mycroft info.rti_info[RTAX_NETMASK] = netmask;
362 1.10 mycroft info.rti_info[RTAX_AUTHOR] = src;
363 1.10 mycroft rt_missmsg(RTM_REDIRECT, &info, flags, error);
364 1.1 cgd }
365 1.1 cgd
366 1.1 cgd /*
367 1.40 itojun * Delete a route and generate a message
368 1.40 itojun */
369 1.40 itojun static int
370 1.60 matt rtdeletemsg(struct rtentry *rt)
371 1.40 itojun {
372 1.40 itojun int error;
373 1.40 itojun struct rt_addrinfo info;
374 1.40 itojun
375 1.40 itojun /*
376 1.40 itojun * Request the new route so that the entry is not actually
377 1.40 itojun * deleted. That will allow the information being reported to
378 1.40 itojun * be accurate (and consistent with route_output()).
379 1.40 itojun */
380 1.44 thorpej memset((caddr_t)&info, 0, sizeof(info));
381 1.40 itojun info.rti_info[RTAX_DST] = rt_key(rt);
382 1.40 itojun info.rti_info[RTAX_NETMASK] = rt_mask(rt);
383 1.40 itojun info.rti_info[RTAX_GATEWAY] = rt->rt_gateway;
384 1.40 itojun info.rti_flags = rt->rt_flags;
385 1.40 itojun error = rtrequest1(RTM_DELETE, &info, &rt);
386 1.40 itojun
387 1.40 itojun rt_missmsg(RTM_DELETE, &info, info.rti_flags, error);
388 1.40 itojun
389 1.40 itojun /* Adjust the refcount */
390 1.40 itojun if (error == 0 && rt->rt_refcnt <= 0) {
391 1.40 itojun rt->rt_refcnt++;
392 1.40 itojun rtfree(rt);
393 1.40 itojun }
394 1.40 itojun return (error);
395 1.40 itojun }
396 1.40 itojun
397 1.41 itojun static int
398 1.60 matt rtflushclone1(struct radix_node *rn, void *arg)
399 1.41 itojun {
400 1.41 itojun struct rtentry *rt, *parent;
401 1.41 itojun
402 1.41 itojun rt = (struct rtentry *)rn;
403 1.41 itojun parent = (struct rtentry *)arg;
404 1.41 itojun if ((rt->rt_flags & RTF_CLONED) != 0 && rt->rt_parent == parent)
405 1.41 itojun rtdeletemsg(rt);
406 1.41 itojun return 0;
407 1.41 itojun }
408 1.41 itojun
409 1.41 itojun static void
410 1.60 matt rtflushclone(struct radix_node_head *rnh, struct rtentry *parent)
411 1.41 itojun {
412 1.41 itojun
413 1.41 itojun #ifdef DIAGNOSTIC
414 1.41 itojun if (!parent || (parent->rt_flags & RTF_CLONING) == 0)
415 1.41 itojun panic("rtflushclone: called with a non-cloning route");
416 1.41 itojun if (!rnh->rnh_walktree)
417 1.41 itojun panic("rtflushclone: no rnh_walktree");
418 1.41 itojun #endif
419 1.42 itojun rnh->rnh_walktree(rnh, rtflushclone1, (void *)parent);
420 1.41 itojun }
421 1.41 itojun
422 1.40 itojun /*
423 1.22 thorpej * Routing table ioctl interface.
424 1.22 thorpej */
425 1.9 mycroft int
426 1.67 christos rtioctl(u_long req, caddr_t data, struct lwp *l)
427 1.1 cgd {
428 1.1 cgd return (EOPNOTSUPP);
429 1.1 cgd }
430 1.1 cgd
431 1.1 cgd struct ifaddr *
432 1.60 matt ifa_ifwithroute(int flags, const struct sockaddr *dst,
433 1.60 matt const struct sockaddr *gateway)
434 1.1 cgd {
435 1.36 augustss struct ifaddr *ifa;
436 1.1 cgd if ((flags & RTF_GATEWAY) == 0) {
437 1.1 cgd /*
438 1.1 cgd * If we are adding a route to an interface,
439 1.1 cgd * and the interface is a pt to pt link
440 1.1 cgd * we should search for the destination
441 1.1 cgd * as our clue to the interface. Otherwise
442 1.1 cgd * we can use the local address.
443 1.1 cgd */
444 1.68 christos ifa = NULL;
445 1.65 perry if (flags & RTF_HOST)
446 1.1 cgd ifa = ifa_ifwithdstaddr(dst);
447 1.68 christos if (ifa == NULL)
448 1.1 cgd ifa = ifa_ifwithaddr(gateway);
449 1.1 cgd } else {
450 1.1 cgd /*
451 1.1 cgd * If we are adding a route to a remote net
452 1.1 cgd * or host, the gateway may still be on the
453 1.1 cgd * other end of a pt to pt link.
454 1.1 cgd */
455 1.1 cgd ifa = ifa_ifwithdstaddr(gateway);
456 1.1 cgd }
457 1.68 christos if (ifa == NULL)
458 1.1 cgd ifa = ifa_ifwithnet(gateway);
459 1.68 christos if (ifa == NULL) {
460 1.1 cgd struct rtentry *rt = rtalloc1(dst, 0);
461 1.68 christos if (rt == NULL)
462 1.68 christos return NULL;
463 1.1 cgd rt->rt_refcnt--;
464 1.68 christos if ((ifa = rt->rt_ifa) == NULL)
465 1.68 christos return NULL;
466 1.1 cgd }
467 1.1 cgd if (ifa->ifa_addr->sa_family != dst->sa_family) {
468 1.10 mycroft struct ifaddr *oifa = ifa;
469 1.1 cgd ifa = ifaof_ifpforaddr(dst, ifa->ifa_ifp);
470 1.1 cgd if (ifa == 0)
471 1.1 cgd ifa = oifa;
472 1.1 cgd }
473 1.1 cgd return (ifa);
474 1.1 cgd }
475 1.1 cgd
476 1.1 cgd #define ROUNDUP(a) (a>0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
477 1.1 cgd
478 1.9 mycroft int
479 1.60 matt rtrequest(int req, const struct sockaddr *dst, const struct sockaddr *gateway,
480 1.60 matt const struct sockaddr *netmask, int flags, struct rtentry **ret_nrt)
481 1.1 cgd {
482 1.39 itojun struct rt_addrinfo info;
483 1.39 itojun
484 1.44 thorpej memset(&info, 0, sizeof(info));
485 1.39 itojun info.rti_flags = flags;
486 1.39 itojun info.rti_info[RTAX_DST] = dst;
487 1.39 itojun info.rti_info[RTAX_GATEWAY] = gateway;
488 1.39 itojun info.rti_info[RTAX_NETMASK] = netmask;
489 1.39 itojun return rtrequest1(req, &info, ret_nrt);
490 1.39 itojun }
491 1.39 itojun
492 1.39 itojun int
493 1.60 matt rt_getifa(struct rt_addrinfo *info)
494 1.39 itojun {
495 1.39 itojun struct ifaddr *ifa;
496 1.39 itojun int error = 0;
497 1.68 christos const struct sockaddr *dst = info->rti_info[RTAX_DST];
498 1.68 christos const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
499 1.68 christos const struct sockaddr *ifaaddr = info->rti_info[RTAX_IFA];
500 1.68 christos const struct sockaddr *ifpaddr = info->rti_info[RTAX_IFP];
501 1.68 christos int flags = info->rti_flags;
502 1.39 itojun
503 1.39 itojun /*
504 1.39 itojun * ifp may be specified by sockaddr_dl when protocol address
505 1.39 itojun * is ambiguous
506 1.39 itojun */
507 1.39 itojun if (info->rti_ifp == NULL && ifpaddr != NULL
508 1.39 itojun && ifpaddr->sa_family == AF_LINK &&
509 1.59 matt (ifa = ifa_ifwithnet((const struct sockaddr *)ifpaddr)) != NULL)
510 1.39 itojun info->rti_ifp = ifa->ifa_ifp;
511 1.39 itojun if (info->rti_ifa == NULL && ifaaddr != NULL)
512 1.39 itojun info->rti_ifa = ifa_ifwithaddr(ifaaddr);
513 1.39 itojun if (info->rti_ifa == NULL) {
514 1.59 matt const struct sockaddr *sa;
515 1.39 itojun
516 1.39 itojun sa = ifaaddr != NULL ? ifaaddr :
517 1.39 itojun (gateway != NULL ? gateway : dst);
518 1.39 itojun if (sa != NULL && info->rti_ifp != NULL)
519 1.39 itojun info->rti_ifa = ifaof_ifpforaddr(sa, info->rti_ifp);
520 1.39 itojun else if (dst != NULL && gateway != NULL)
521 1.39 itojun info->rti_ifa = ifa_ifwithroute(flags, dst, gateway);
522 1.39 itojun else if (sa != NULL)
523 1.39 itojun info->rti_ifa = ifa_ifwithroute(flags, sa, sa);
524 1.39 itojun }
525 1.39 itojun if ((ifa = info->rti_ifa) != NULL) {
526 1.39 itojun if (info->rti_ifp == NULL)
527 1.39 itojun info->rti_ifp = ifa->ifa_ifp;
528 1.39 itojun } else
529 1.39 itojun error = ENETUNREACH;
530 1.39 itojun return (error);
531 1.39 itojun }
532 1.39 itojun
533 1.39 itojun int
534 1.60 matt rtrequest1(int req, struct rt_addrinfo *info, struct rtentry **ret_nrt)
535 1.39 itojun {
536 1.60 matt int s = splsoftnet();
537 1.60 matt int error = 0;
538 1.40 itojun struct rtentry *rt, *crt;
539 1.36 augustss struct radix_node *rn;
540 1.36 augustss struct radix_node_head *rnh;
541 1.10 mycroft struct ifaddr *ifa;
542 1.1 cgd struct sockaddr *ndst;
543 1.63 christos struct sockaddr_storage deldst;
544 1.68 christos const struct sockaddr *dst = info->rti_info[RTAX_DST];
545 1.68 christos const struct sockaddr *gateway = info->rti_info[RTAX_GATEWAY];
546 1.68 christos const struct sockaddr *netmask = info->rti_info[RTAX_NETMASK];
547 1.68 christos int flags = info->rti_flags;
548 1.1 cgd #define senderr(x) { error = x ; goto bad; }
549 1.1 cgd
550 1.68 christos if ((rnh = rt_tables[dst->sa_family]) == NULL)
551 1.1 cgd senderr(ESRCH);
552 1.1 cgd if (flags & RTF_HOST)
553 1.68 christos netmask = NULL;
554 1.1 cgd switch (req) {
555 1.1 cgd case RTM_DELETE:
556 1.63 christos if (netmask) {
557 1.63 christos rt_maskedcopy(dst, (struct sockaddr *)&deldst, netmask);
558 1.63 christos dst = (struct sockaddr *)&deldst;
559 1.63 christos }
560 1.68 christos if ((rn = rnh->rnh_lookup(dst, netmask, rnh)) == NULL)
561 1.41 itojun senderr(ESRCH);
562 1.41 itojun rt = (struct rtentry *)rn;
563 1.41 itojun if ((rt->rt_flags & RTF_CLONING) != 0) {
564 1.41 itojun /* clean up any cloned children */
565 1.41 itojun rtflushclone(rnh, rt);
566 1.41 itojun }
567 1.68 christos if ((rn = rnh->rnh_deladdr(dst, netmask, rnh)) == NULL)
568 1.1 cgd senderr(ESRCH);
569 1.1 cgd if (rn->rn_flags & (RNF_ACTIVE | RNF_ROOT))
570 1.1 cgd panic ("rtrequest delete");
571 1.1 cgd rt = (struct rtentry *)rn;
572 1.10 mycroft if (rt->rt_gwroute) {
573 1.68 christos RTFREE(rt->rt_gwroute);
574 1.68 christos rt->rt_gwroute = NULL;
575 1.48 itojun }
576 1.48 itojun if (rt->rt_parent) {
577 1.48 itojun rt->rt_parent->rt_refcnt--;
578 1.48 itojun rt->rt_parent = NULL;
579 1.10 mycroft }
580 1.28 erh rt->rt_flags &= ~RTF_UP;
581 1.1 cgd if ((ifa = rt->rt_ifa) && ifa->ifa_rtrequest)
582 1.39 itojun ifa->ifa_rtrequest(RTM_DELETE, rt, info);
583 1.1 cgd rttrash++;
584 1.10 mycroft if (ret_nrt)
585 1.10 mycroft *ret_nrt = rt;
586 1.10 mycroft else if (rt->rt_refcnt <= 0) {
587 1.10 mycroft rt->rt_refcnt++;
588 1.1 cgd rtfree(rt);
589 1.10 mycroft }
590 1.1 cgd break;
591 1.1 cgd
592 1.1 cgd case RTM_RESOLVE:
593 1.68 christos if (ret_nrt == NULL || (rt = *ret_nrt) == NULL)
594 1.1 cgd senderr(EINVAL);
595 1.40 itojun if ((rt->rt_flags & RTF_CLONING) == 0)
596 1.40 itojun senderr(EINVAL);
597 1.1 cgd ifa = rt->rt_ifa;
598 1.40 itojun flags = rt->rt_flags & ~(RTF_CLONING | RTF_STATIC);
599 1.40 itojun flags |= RTF_CLONED;
600 1.1 cgd gateway = rt->rt_gateway;
601 1.68 christos if ((netmask = rt->rt_genmask) == NULL)
602 1.1 cgd flags |= RTF_HOST;
603 1.1 cgd goto makeroute;
604 1.1 cgd
605 1.1 cgd case RTM_ADD:
606 1.68 christos if (info->rti_ifa == NULL && (error = rt_getifa(info)))
607 1.39 itojun senderr(error);
608 1.39 itojun ifa = info->rti_ifa;
609 1.1 cgd makeroute:
610 1.72 tls /* Already at splsoftnet() so pool_get/pool_put are safe */
611 1.22 thorpej rt = pool_get(&rtentry_pool, PR_NOWAIT);
612 1.68 christos if (rt == NULL)
613 1.1 cgd senderr(ENOBUFS);
614 1.10 mycroft Bzero(rt, sizeof(*rt));
615 1.10 mycroft rt->rt_flags = RTF_UP | flags;
616 1.18 kml LIST_INIT(&rt->rt_timer);
617 1.10 mycroft if (rt_setgate(rt, dst, gateway)) {
618 1.22 thorpej pool_put(&rtentry_pool, rt);
619 1.10 mycroft senderr(ENOBUFS);
620 1.10 mycroft }
621 1.10 mycroft ndst = rt_key(rt);
622 1.1 cgd if (netmask) {
623 1.1 cgd rt_maskedcopy(dst, ndst, netmask);
624 1.1 cgd } else
625 1.1 cgd Bcopy(dst, ndst, dst->sa_len);
626 1.30 thorpej IFAREF(ifa);
627 1.1 cgd rt->rt_ifa = ifa;
628 1.1 cgd rt->rt_ifp = ifa->ifa_ifp;
629 1.27 matt if (req == RTM_RESOLVE) {
630 1.1 cgd rt->rt_rmx = (*ret_nrt)->rt_rmx; /* copy metrics */
631 1.41 itojun rt->rt_parent = *ret_nrt;
632 1.41 itojun rt->rt_parent->rt_refcnt++;
633 1.40 itojun }
634 1.66 christos rn = rnh->rnh_addaddr(ndst, netmask, rnh, rt->rt_nodes);
635 1.40 itojun if (rn == NULL && (crt = rtalloc1(ndst, 0)) != NULL) {
636 1.40 itojun /* overwrite cloned route */
637 1.40 itojun if ((crt->rt_flags & RTF_CLONED) != 0) {
638 1.40 itojun rtdeletemsg(crt);
639 1.66 christos rn = rnh->rnh_addaddr(ndst,
640 1.66 christos netmask, rnh, rt->rt_nodes);
641 1.40 itojun }
642 1.40 itojun RTFREE(crt);
643 1.40 itojun }
644 1.68 christos if (rn == NULL) {
645 1.40 itojun IFAFREE(ifa);
646 1.41 itojun if ((rt->rt_flags & RTF_CLONED) != 0 && rt->rt_parent)
647 1.41 itojun rtfree(rt->rt_parent);
648 1.40 itojun if (rt->rt_gwroute)
649 1.40 itojun rtfree(rt->rt_gwroute);
650 1.40 itojun Free(rt_key(rt));
651 1.40 itojun pool_put(&rtentry_pool, rt);
652 1.40 itojun senderr(EEXIST);
653 1.27 matt }
654 1.1 cgd if (ifa->ifa_rtrequest)
655 1.39 itojun ifa->ifa_rtrequest(req, rt, info);
656 1.1 cgd if (ret_nrt) {
657 1.1 cgd *ret_nrt = rt;
658 1.1 cgd rt->rt_refcnt++;
659 1.41 itojun }
660 1.41 itojun if ((rt->rt_flags & RTF_CLONING) != 0) {
661 1.41 itojun /* clean up any cloned children */
662 1.41 itojun rtflushclone(rnh, rt);
663 1.1 cgd }
664 1.1 cgd break;
665 1.1 cgd }
666 1.1 cgd bad:
667 1.1 cgd splx(s);
668 1.1 cgd return (error);
669 1.1 cgd }
670 1.1 cgd
671 1.10 mycroft int
672 1.60 matt rt_setgate( struct rtentry *rt0, const struct sockaddr *dst,
673 1.60 matt const struct sockaddr *gate)
674 1.10 mycroft {
675 1.59 matt char *new, *old;
676 1.53 thorpej u_int dlen = ROUNDUP(dst->sa_len), glen = ROUNDUP(gate->sa_len);
677 1.36 augustss struct rtentry *rt = rt0;
678 1.10 mycroft
679 1.68 christos if (rt->rt_gateway == NULL || glen > ROUNDUP(rt->rt_gateway->sa_len)) {
680 1.10 mycroft old = (caddr_t)rt_key(rt);
681 1.10 mycroft R_Malloc(new, caddr_t, dlen + glen);
682 1.68 christos if (new == NULL)
683 1.10 mycroft return 1;
684 1.32 itojun Bzero(new, dlen + glen);
685 1.10 mycroft rt->rt_nodes->rn_key = new;
686 1.10 mycroft } else {
687 1.66 christos new = __UNCONST(rt->rt_nodes->rn_key); /*XXXUNCONST*/
688 1.68 christos old = NULL;
689 1.10 mycroft }
690 1.10 mycroft Bcopy(gate, (rt->rt_gateway = (struct sockaddr *)(new + dlen)), glen);
691 1.10 mycroft if (old) {
692 1.10 mycroft Bcopy(dst, new, dlen);
693 1.10 mycroft Free(old);
694 1.10 mycroft }
695 1.10 mycroft if (rt->rt_gwroute) {
696 1.68 christos RTFREE(rt->rt_gwroute);
697 1.68 christos rt->rt_gwroute = NULL;
698 1.10 mycroft }
699 1.10 mycroft if (rt->rt_flags & RTF_GATEWAY) {
700 1.10 mycroft rt->rt_gwroute = rtalloc1(gate, 1);
701 1.27 matt /*
702 1.27 matt * If we switched gateways, grab the MTU from the new
703 1.47 itojun * gateway route if the current MTU, if the current MTU is
704 1.47 itojun * greater than the MTU of gateway.
705 1.47 itojun * Note that, if the MTU of gateway is 0, we will reset the
706 1.47 itojun * MTU of the route to run PMTUD again from scratch. XXX
707 1.27 matt */
708 1.27 matt if (rt->rt_gwroute
709 1.27 matt && !(rt->rt_rmx.rmx_locks & RTV_MTU)
710 1.47 itojun && rt->rt_rmx.rmx_mtu
711 1.47 itojun && rt->rt_rmx.rmx_mtu > rt->rt_gwroute->rt_rmx.rmx_mtu) {
712 1.27 matt rt->rt_rmx.rmx_mtu = rt->rt_gwroute->rt_rmx.rmx_mtu;
713 1.27 matt }
714 1.10 mycroft }
715 1.10 mycroft return 0;
716 1.10 mycroft }
717 1.10 mycroft
718 1.9 mycroft void
719 1.60 matt rt_maskedcopy(const struct sockaddr *src, struct sockaddr *dst,
720 1.60 matt const struct sockaddr *netmask)
721 1.1 cgd {
722 1.66 christos const u_char *cp1 = (const u_char *)src;
723 1.36 augustss u_char *cp2 = (u_char *)dst;
724 1.66 christos const u_char *cp3 = (const u_char *)netmask;
725 1.1 cgd u_char *cplim = cp2 + *cp3;
726 1.1 cgd u_char *cplim2 = cp2 + *cp1;
727 1.1 cgd
728 1.1 cgd *cp2++ = *cp1++; *cp2++ = *cp1++; /* copies sa_len & sa_family */
729 1.1 cgd cp3 += 2;
730 1.1 cgd if (cplim > cplim2)
731 1.1 cgd cplim = cplim2;
732 1.1 cgd while (cp2 < cplim)
733 1.1 cgd *cp2++ = *cp1++ & *cp3++;
734 1.1 cgd if (cp2 < cplim2)
735 1.66 christos memset(cp2, 0, (unsigned)(cplim2 - cp2));
736 1.1 cgd }
737 1.10 mycroft
738 1.1 cgd /*
739 1.29 sommerfe * Set up or tear down a routing table entry, normally
740 1.1 cgd * for an interface.
741 1.1 cgd */
742 1.9 mycroft int
743 1.60 matt rtinit(struct ifaddr *ifa, int cmd, int flags)
744 1.1 cgd {
745 1.36 augustss struct rtentry *rt;
746 1.36 augustss struct sockaddr *dst, *odst;
747 1.29 sommerfe struct sockaddr_storage deldst;
748 1.68 christos struct rtentry *nrt = NULL;
749 1.1 cgd int error;
750 1.39 itojun struct rt_addrinfo info;
751 1.1 cgd
752 1.1 cgd dst = flags & RTF_HOST ? ifa->ifa_dstaddr : ifa->ifa_addr;
753 1.1 cgd if (cmd == RTM_DELETE) {
754 1.1 cgd if ((flags & RTF_HOST) == 0 && ifa->ifa_netmask) {
755 1.29 sommerfe /* Delete subnet route for this interface */
756 1.29 sommerfe odst = dst;
757 1.29 sommerfe dst = (struct sockaddr *)&deldst;
758 1.29 sommerfe rt_maskedcopy(odst, dst, ifa->ifa_netmask);
759 1.1 cgd }
760 1.14 christos if ((rt = rtalloc1(dst, 0)) != NULL) {
761 1.1 cgd rt->rt_refcnt--;
762 1.29 sommerfe if (rt->rt_ifa != ifa)
763 1.1 cgd return (flags & RTF_HOST ? EHOSTUNREACH
764 1.1 cgd : ENETUNREACH);
765 1.1 cgd }
766 1.1 cgd }
767 1.44 thorpej memset(&info, 0, sizeof(info));
768 1.39 itojun info.rti_ifa = ifa;
769 1.39 itojun info.rti_flags = flags | ifa->ifa_flags;
770 1.39 itojun info.rti_info[RTAX_DST] = dst;
771 1.39 itojun info.rti_info[RTAX_GATEWAY] = ifa->ifa_addr;
772 1.39 itojun /*
773 1.39 itojun * XXX here, it seems that we are assuming that ifa_netmask is NULL
774 1.39 itojun * for RTF_HOST. bsdi4 passes NULL explicitly (via intermediate
775 1.39 itojun * variable) when RTF_HOST is 1. still not sure if i can safely
776 1.39 itojun * change it to meet bsdi4 behavior.
777 1.39 itojun */
778 1.39 itojun info.rti_info[RTAX_NETMASK] = ifa->ifa_netmask;
779 1.39 itojun error = rtrequest1(cmd, &info, &nrt);
780 1.10 mycroft if (cmd == RTM_DELETE && error == 0 && (rt = nrt)) {
781 1.10 mycroft rt_newaddrmsg(cmd, ifa, error, nrt);
782 1.10 mycroft if (rt->rt_refcnt <= 0) {
783 1.10 mycroft rt->rt_refcnt++;
784 1.10 mycroft rtfree(rt);
785 1.10 mycroft }
786 1.10 mycroft }
787 1.10 mycroft if (cmd == RTM_ADD && error == 0 && (rt = nrt)) {
788 1.10 mycroft rt->rt_refcnt--;
789 1.10 mycroft if (rt->rt_ifa != ifa) {
790 1.17 christos printf("rtinit: wrong ifa (%p) was (%p)\n", ifa,
791 1.17 christos rt->rt_ifa);
792 1.10 mycroft if (rt->rt_ifa->ifa_rtrequest)
793 1.39 itojun rt->rt_ifa->ifa_rtrequest(RTM_DELETE, rt, NULL);
794 1.10 mycroft IFAFREE(rt->rt_ifa);
795 1.10 mycroft rt->rt_ifa = ifa;
796 1.10 mycroft rt->rt_ifp = ifa->ifa_ifp;
797 1.30 thorpej IFAREF(ifa);
798 1.10 mycroft if (ifa->ifa_rtrequest)
799 1.39 itojun ifa->ifa_rtrequest(RTM_ADD, rt, NULL);
800 1.10 mycroft }
801 1.10 mycroft rt_newaddrmsg(cmd, ifa, error, nrt);
802 1.1 cgd }
803 1.1 cgd return (error);
804 1.18 kml }
805 1.18 kml
806 1.18 kml /*
807 1.18 kml * Route timer routines. These routes allow functions to be called
808 1.18 kml * for various routes at any time. This is useful in supporting
809 1.18 kml * path MTU discovery and redirect route deletion.
810 1.18 kml *
811 1.18 kml * This is similar to some BSDI internal functions, but it provides
812 1.18 kml * for multiple queues for efficiency's sake...
813 1.18 kml */
814 1.18 kml
815 1.18 kml LIST_HEAD(, rttimer_queue) rttimer_queue_head;
816 1.18 kml static int rt_init_done = 0;
817 1.18 kml
818 1.60 matt #define RTTIMER_CALLOUT(r) do { \
819 1.60 matt if (r->rtt_func != NULL) { \
820 1.60 matt (*r->rtt_func)(r->rtt_rt, r); \
821 1.60 matt } else { \
822 1.60 matt rtrequest((int) RTM_DELETE, \
823 1.60 matt (struct sockaddr *)rt_key(r->rtt_rt), \
824 1.60 matt 0, 0, 0, 0); \
825 1.60 matt } \
826 1.60 matt } while (/*CONSTCOND*/0)
827 1.18 kml
828 1.65 perry /*
829 1.18 kml * Some subtle order problems with domain initialization mean that
830 1.18 kml * we cannot count on this being run from rt_init before various
831 1.18 kml * protocol initializations are done. Therefore, we make sure
832 1.18 kml * that this is run when the first queue is added...
833 1.18 kml */
834 1.18 kml
835 1.65 perry void
836 1.60 matt rt_timer_init(void)
837 1.18 kml {
838 1.18 kml assert(rt_init_done == 0);
839 1.18 kml
840 1.18 kml LIST_INIT(&rttimer_queue_head);
841 1.35 thorpej callout_init(&rt_timer_ch);
842 1.35 thorpej callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
843 1.18 kml rt_init_done = 1;
844 1.18 kml }
845 1.18 kml
846 1.18 kml struct rttimer_queue *
847 1.60 matt rt_timer_queue_create(u_int timeout)
848 1.18 kml {
849 1.18 kml struct rttimer_queue *rtq;
850 1.18 kml
851 1.18 kml if (rt_init_done == 0)
852 1.18 kml rt_timer_init();
853 1.18 kml
854 1.18 kml R_Malloc(rtq, struct rttimer_queue *, sizeof *rtq);
855 1.18 kml if (rtq == NULL)
856 1.65 perry return (NULL);
857 1.32 itojun Bzero(rtq, sizeof *rtq);
858 1.18 kml
859 1.18 kml rtq->rtq_timeout = timeout;
860 1.37 itojun rtq->rtq_count = 0;
861 1.24 thorpej TAILQ_INIT(&rtq->rtq_head);
862 1.18 kml LIST_INSERT_HEAD(&rttimer_queue_head, rtq, rtq_link);
863 1.18 kml
864 1.24 thorpej return (rtq);
865 1.18 kml }
866 1.18 kml
867 1.18 kml void
868 1.60 matt rt_timer_queue_change(struct rttimer_queue *rtq, long timeout)
869 1.18 kml {
870 1.24 thorpej
871 1.18 kml rtq->rtq_timeout = timeout;
872 1.18 kml }
873 1.18 kml
874 1.18 kml void
875 1.60 matt rt_timer_queue_remove_all(struct rttimer_queue *rtq, int destroy)
876 1.18 kml {
877 1.24 thorpej struct rttimer *r;
878 1.18 kml
879 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL) {
880 1.18 kml LIST_REMOVE(r, rtt_link);
881 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
882 1.24 thorpej if (destroy)
883 1.18 kml RTTIMER_CALLOUT(r);
884 1.72 tls /* we are already at splsoftnet */
885 1.22 thorpej pool_put(&rttimer_pool, r);
886 1.37 itojun if (rtq->rtq_count > 0)
887 1.37 itojun rtq->rtq_count--;
888 1.37 itojun else
889 1.55 itojun printf("rt_timer_queue_remove_all: "
890 1.55 itojun "rtq_count reached 0\n");
891 1.18 kml }
892 1.55 itojun }
893 1.55 itojun
894 1.55 itojun void
895 1.60 matt rt_timer_queue_destroy(struct rttimer_queue *rtq, int destroy)
896 1.55 itojun {
897 1.55 itojun
898 1.55 itojun rt_timer_queue_remove_all(rtq, destroy);
899 1.18 kml
900 1.18 kml LIST_REMOVE(rtq, rtq_link);
901 1.22 thorpej
902 1.22 thorpej /*
903 1.22 thorpej * Caller is responsible for freeing the rttimer_queue structure.
904 1.22 thorpej */
905 1.18 kml }
906 1.18 kml
907 1.37 itojun unsigned long
908 1.60 matt rt_timer_count(struct rttimer_queue *rtq)
909 1.37 itojun {
910 1.37 itojun return rtq->rtq_count;
911 1.37 itojun }
912 1.37 itojun
913 1.65 perry void
914 1.60 matt rt_timer_remove_all(struct rtentry *rt, int destroy)
915 1.18 kml {
916 1.24 thorpej struct rttimer *r;
917 1.18 kml
918 1.24 thorpej while ((r = LIST_FIRST(&rt->rt_timer)) != NULL) {
919 1.18 kml LIST_REMOVE(r, rtt_link);
920 1.24 thorpej TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
921 1.54 itojun if (destroy)
922 1.54 itojun RTTIMER_CALLOUT(r);
923 1.37 itojun if (r->rtt_queue->rtq_count > 0)
924 1.37 itojun r->rtt_queue->rtq_count--;
925 1.37 itojun else
926 1.37 itojun printf("rt_timer_remove_all: rtq_count reached 0\n");
927 1.72 tls /* we are already at splsoftnet */
928 1.38 itojun pool_put(&rttimer_pool, r);
929 1.18 kml }
930 1.18 kml }
931 1.18 kml
932 1.65 perry int
933 1.60 matt rt_timer_add(struct rtentry *rt,
934 1.60 matt void (*func)(struct rtentry *, struct rttimer *),
935 1.60 matt struct rttimer_queue *queue)
936 1.18 kml {
937 1.24 thorpej struct rttimer *r;
938 1.72 tls int s;
939 1.18 kml
940 1.24 thorpej /*
941 1.24 thorpej * If there's already a timer with this action, destroy it before
942 1.24 thorpej * we add a new one.
943 1.24 thorpej */
944 1.24 thorpej for (r = LIST_FIRST(&rt->rt_timer); r != NULL;
945 1.24 thorpej r = LIST_NEXT(r, rtt_link)) {
946 1.18 kml if (r->rtt_func == func) {
947 1.18 kml LIST_REMOVE(r, rtt_link);
948 1.24 thorpej TAILQ_REMOVE(&r->rtt_queue->rtq_head, r, rtt_next);
949 1.37 itojun if (r->rtt_queue->rtq_count > 0)
950 1.37 itojun r->rtt_queue->rtq_count--;
951 1.37 itojun else
952 1.37 itojun printf("rt_timer_add: rtq_count reached 0\n");
953 1.72 tls s = splsoftnet();
954 1.38 itojun pool_put(&rttimer_pool, r);
955 1.72 tls splx(s);
956 1.18 kml break; /* only one per list, so we can quit... */
957 1.18 kml }
958 1.18 kml }
959 1.18 kml
960 1.72 tls s = splsoftnet();
961 1.24 thorpej r = pool_get(&rttimer_pool, PR_NOWAIT);
962 1.72 tls splx(s);
963 1.24 thorpej if (r == NULL)
964 1.24 thorpej return (ENOBUFS);
965 1.32 itojun Bzero(r, sizeof(*r));
966 1.24 thorpej
967 1.24 thorpej r->rtt_rt = rt;
968 1.70 kardel r->rtt_time = time_uptime;
969 1.24 thorpej r->rtt_func = func;
970 1.24 thorpej r->rtt_queue = queue;
971 1.24 thorpej LIST_INSERT_HEAD(&rt->rt_timer, r, rtt_link);
972 1.24 thorpej TAILQ_INSERT_TAIL(&queue->rtq_head, r, rtt_next);
973 1.37 itojun r->rtt_queue->rtq_count++;
974 1.65 perry
975 1.24 thorpej return (0);
976 1.18 kml }
977 1.18 kml
978 1.18 kml /* ARGSUSED */
979 1.18 kml void
980 1.60 matt rt_timer_timer(void *arg)
981 1.18 kml {
982 1.24 thorpej struct rttimer_queue *rtq;
983 1.24 thorpej struct rttimer *r;
984 1.24 thorpej int s;
985 1.21 kml
986 1.24 thorpej s = splsoftnet();
987 1.65 perry for (rtq = LIST_FIRST(&rttimer_queue_head); rtq != NULL;
988 1.18 kml rtq = LIST_NEXT(rtq, rtq_link)) {
989 1.24 thorpej while ((r = TAILQ_FIRST(&rtq->rtq_head)) != NULL &&
990 1.70 kardel (r->rtt_time + rtq->rtq_timeout) < time_uptime) {
991 1.24 thorpej LIST_REMOVE(r, rtt_link);
992 1.24 thorpej TAILQ_REMOVE(&rtq->rtq_head, r, rtt_next);
993 1.24 thorpej RTTIMER_CALLOUT(r);
994 1.24 thorpej pool_put(&rttimer_pool, r);
995 1.37 itojun if (rtq->rtq_count > 0)
996 1.37 itojun rtq->rtq_count--;
997 1.37 itojun else
998 1.37 itojun printf("rt_timer_timer: rtq_count reached 0\n");
999 1.18 kml }
1000 1.18 kml }
1001 1.24 thorpej splx(s);
1002 1.18 kml
1003 1.35 thorpej callout_reset(&rt_timer_ch, hz, rt_timer_timer, NULL);
1004 1.1 cgd }
1005