rtsock.c revision 1.99 1 1.99 ad /* $NetBSD: rtsock.c,v 1.99 2008/03/26 14:53:14 ad Exp $ */
2 1.30 itojun
3 1.30 itojun /*
4 1.30 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
5 1.30 itojun * All rights reserved.
6 1.75 perry *
7 1.30 itojun * Redistribution and use in source and binary forms, with or without
8 1.30 itojun * modification, are permitted provided that the following conditions
9 1.30 itojun * are met:
10 1.30 itojun * 1. Redistributions of source code must retain the above copyright
11 1.30 itojun * notice, this list of conditions and the following disclaimer.
12 1.30 itojun * 2. Redistributions in binary form must reproduce the above copyright
13 1.30 itojun * notice, this list of conditions and the following disclaimer in the
14 1.30 itojun * documentation and/or other materials provided with the distribution.
15 1.30 itojun * 3. Neither the name of the project nor the names of its contributors
16 1.30 itojun * may be used to endorse or promote products derived from this software
17 1.30 itojun * without specific prior written permission.
18 1.75 perry *
19 1.30 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
20 1.30 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.30 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.30 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
23 1.30 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.30 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.30 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.30 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.30 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.30 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.30 itojun * SUCH DAMAGE.
30 1.30 itojun */
31 1.11 cgd
32 1.1 cgd /*
33 1.10 mycroft * Copyright (c) 1988, 1991, 1993
34 1.10 mycroft * The Regents of the University of California. All rights reserved.
35 1.1 cgd *
36 1.1 cgd * Redistribution and use in source and binary forms, with or without
37 1.1 cgd * modification, are permitted provided that the following conditions
38 1.1 cgd * are met:
39 1.1 cgd * 1. Redistributions of source code must retain the above copyright
40 1.1 cgd * notice, this list of conditions and the following disclaimer.
41 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
42 1.1 cgd * notice, this list of conditions and the following disclaimer in the
43 1.1 cgd * documentation and/or other materials provided with the distribution.
44 1.64 agc * 3. Neither the name of the University nor the names of its contributors
45 1.1 cgd * may be used to endorse or promote products derived from this software
46 1.1 cgd * without specific prior written permission.
47 1.1 cgd *
48 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
58 1.1 cgd * SUCH DAMAGE.
59 1.1 cgd *
60 1.26 fvdl * @(#)rtsock.c 8.7 (Berkeley) 10/12/95
61 1.1 cgd */
62 1.54 lukem
63 1.54 lukem #include <sys/cdefs.h>
64 1.99 ad __KERNEL_RCSID(0, "$NetBSD: rtsock.c,v 1.99 2008/03/26 14:53:14 ad Exp $");
65 1.31 thorpej
66 1.31 thorpej #include "opt_inet.h"
67 1.1 cgd
68 1.5 mycroft #include <sys/param.h>
69 1.5 mycroft #include <sys/systm.h>
70 1.10 mycroft #include <sys/proc.h>
71 1.5 mycroft #include <sys/mbuf.h>
72 1.5 mycroft #include <sys/socket.h>
73 1.5 mycroft #include <sys/socketvar.h>
74 1.5 mycroft #include <sys/domain.h>
75 1.5 mycroft #include <sys/protosw.h>
76 1.17 christos #include <sys/sysctl.h>
77 1.84 elad #include <sys/kauth.h>
78 1.99 ad #include <sys/intr.h>
79 1.91 dyoung #ifdef RTSOCK_DEBUG
80 1.91 dyoung #include <netinet/in.h>
81 1.91 dyoung #endif /* RTSOCK_DEBUG */
82 1.17 christos
83 1.5 mycroft #include <net/if.h>
84 1.5 mycroft #include <net/route.h>
85 1.5 mycroft #include <net/raw_cb.h>
86 1.1 cgd
87 1.17 christos #include <machine/stdarg.h>
88 1.17 christos
89 1.73 matt DOMAIN_DEFINE(routedomain); /* forward declare and add to link set */
90 1.58 matt
91 1.87 christos struct sockaddr route_dst = { .sa_len = 2, .sa_family = PF_ROUTE, };
92 1.87 christos struct sockaddr route_src = { .sa_len = 2, .sa_family = PF_ROUTE, };
93 1.99 ad
94 1.99 ad int route_maxqlen = IFQ_MAXLEN;
95 1.99 ad static struct ifqueue route_intrq;
96 1.99 ad static void *route_sih;
97 1.10 mycroft
98 1.10 mycroft struct walkarg {
99 1.29 chopps int w_op;
100 1.29 chopps int w_arg;
101 1.29 chopps int w_given;
102 1.29 chopps int w_needed;
103 1.93 christos void * w_where;
104 1.29 chopps int w_tmemsize;
105 1.29 chopps int w_tmemneeded;
106 1.93 christos void * w_tmem;
107 1.10 mycroft };
108 1.1 cgd
109 1.93 christos static struct mbuf *rt_msg1(int, struct rt_addrinfo *, void *, int);
110 1.93 christos static int rt_msg2(int, struct rt_addrinfo *, void *, struct walkarg *, int *);
111 1.72 christos static int rt_xaddrs(u_char, const char *, const char *, struct rt_addrinfo *);
112 1.78 dyoung static struct mbuf *rt_makeifannouncemsg(struct ifnet *, int, int,
113 1.78 dyoung struct rt_addrinfo *);
114 1.94 dyoung static int sysctl_dumpentry(struct rtentry *, void *);
115 1.69 matt static int sysctl_iflist(int, struct walkarg *, int);
116 1.69 matt static int sysctl_rtable(SYSCTLFN_PROTO);
117 1.80 perry static inline void rt_adjustcount(int, int);
118 1.99 ad static void route_enqueue(struct mbuf *, int);
119 1.10 mycroft
120 1.10 mycroft /* Sleazy use of local variables throughout file, warning!!!! */
121 1.10 mycroft #define dst info.rti_info[RTAX_DST]
122 1.10 mycroft #define gate info.rti_info[RTAX_GATEWAY]
123 1.10 mycroft #define netmask info.rti_info[RTAX_NETMASK]
124 1.10 mycroft #define ifpaddr info.rti_info[RTAX_IFP]
125 1.10 mycroft #define ifaaddr info.rti_info[RTAX_IFA]
126 1.10 mycroft #define brdaddr info.rti_info[RTAX_BRD]
127 1.1 cgd
128 1.80 perry static inline void
129 1.69 matt rt_adjustcount(int af, int cnt)
130 1.27 christos {
131 1.28 christos route_cb.any_count += cnt;
132 1.27 christos switch (af) {
133 1.27 christos case AF_INET:
134 1.27 christos route_cb.ip_count += cnt;
135 1.27 christos return;
136 1.30 itojun #ifdef INET6
137 1.30 itojun case AF_INET6:
138 1.30 itojun route_cb.ip6_count += cnt;
139 1.30 itojun return;
140 1.30 itojun #endif
141 1.27 christos case AF_IPX:
142 1.27 christos route_cb.ipx_count += cnt;
143 1.27 christos return;
144 1.27 christos case AF_NS:
145 1.27 christos route_cb.ns_count += cnt;
146 1.27 christos return;
147 1.27 christos case AF_ISO:
148 1.27 christos route_cb.iso_count += cnt;
149 1.27 christos return;
150 1.27 christos }
151 1.27 christos }
152 1.27 christos
153 1.1 cgd /*ARGSUSED*/
154 1.9 mycroft int
155 1.69 matt route_usrreq(struct socket *so, int req, struct mbuf *m, struct mbuf *nam,
156 1.79 christos struct mbuf *control, struct lwp *l)
157 1.1 cgd {
158 1.39 augustss int error = 0;
159 1.39 augustss struct rawcb *rp = sotorawcb(so);
160 1.1 cgd int s;
161 1.10 mycroft
162 1.1 cgd if (req == PRU_ATTACH) {
163 1.1 cgd MALLOC(rp, struct rawcb *, sizeof(*rp), M_PCB, M_WAITOK);
164 1.17 christos if ((so->so_pcb = rp) != NULL)
165 1.48 thorpej memset(so->so_pcb, 0, sizeof(*rp));
166 1.1 cgd
167 1.1 cgd }
168 1.27 christos if (req == PRU_DETACH && rp)
169 1.27 christos rt_adjustcount(rp->rcb_proto.sp_protocol, -1);
170 1.14 mycroft s = splsoftnet();
171 1.23 thorpej
172 1.23 thorpej /*
173 1.23 thorpej * Don't call raw_usrreq() in the attach case, because
174 1.23 thorpej * we want to allow non-privileged processes to listen on
175 1.23 thorpej * and send "safe" commands to the routing socket.
176 1.23 thorpej */
177 1.23 thorpej if (req == PRU_ATTACH) {
178 1.95 dyoung if (l == NULL)
179 1.23 thorpej error = EACCES;
180 1.23 thorpej else
181 1.23 thorpej error = raw_attach(so, (int)(long)nam);
182 1.23 thorpej } else
183 1.79 christos error = raw_usrreq(so, req, m, nam, control, l);
184 1.23 thorpej
185 1.1 cgd rp = sotorawcb(so);
186 1.1 cgd if (req == PRU_ATTACH && rp) {
187 1.1 cgd if (error) {
188 1.93 christos free((void *)rp, M_PCB);
189 1.1 cgd splx(s);
190 1.95 dyoung return error;
191 1.1 cgd }
192 1.27 christos rt_adjustcount(rp->rcb_proto.sp_protocol, 1);
193 1.20 mycroft rp->rcb_laddr = &route_src;
194 1.20 mycroft rp->rcb_faddr = &route_dst;
195 1.1 cgd soisconnected(so);
196 1.1 cgd so->so_options |= SO_USELOOPBACK;
197 1.1 cgd }
198 1.1 cgd splx(s);
199 1.95 dyoung return error;
200 1.95 dyoung }
201 1.95 dyoung
202 1.95 dyoung static const struct sockaddr *
203 1.95 dyoung intern_netmask(const struct sockaddr *mask)
204 1.95 dyoung {
205 1.95 dyoung struct radix_node *rn;
206 1.95 dyoung extern struct radix_node_head *mask_rnhead;
207 1.95 dyoung
208 1.95 dyoung if (mask != NULL &&
209 1.95 dyoung (rn = rn_search(mask, mask_rnhead->rnh_treetop)))
210 1.95 dyoung mask = (const struct sockaddr *)rn->rn_key;
211 1.95 dyoung
212 1.95 dyoung return mask;
213 1.1 cgd }
214 1.1 cgd
215 1.1 cgd /*ARGSUSED*/
216 1.9 mycroft int
217 1.17 christos route_output(struct mbuf *m, ...)
218 1.1 cgd {
219 1.99 ad struct sockproto proto = { .sp_family = PF_ROUTE, };
220 1.95 dyoung struct rt_msghdr *rtm = NULL;
221 1.95 dyoung struct rtentry *rt = NULL;
222 1.95 dyoung struct rtentry *saved_nrt = NULL;
223 1.10 mycroft struct rt_addrinfo info;
224 1.1 cgd int len, error = 0;
225 1.95 dyoung struct ifnet *ifp = NULL;
226 1.95 dyoung struct ifaddr *ifa = NULL;
227 1.17 christos struct socket *so;
228 1.17 christos va_list ap;
229 1.55 christos sa_family_t family;
230 1.17 christos
231 1.17 christos va_start(ap, m);
232 1.17 christos so = va_arg(ap, struct socket *);
233 1.17 christos va_end(ap);
234 1.17 christos
235 1.56 perry #define senderr(e) do { error = e; goto flush;} while (/*CONSTCOND*/ 0)
236 1.95 dyoung if (m == NULL || ((m->m_len < sizeof(int32_t)) &&
237 1.95 dyoung (m = m_pullup(m, sizeof(int32_t))) == NULL))
238 1.95 dyoung return ENOBUFS;
239 1.1 cgd if ((m->m_flags & M_PKTHDR) == 0)
240 1.1 cgd panic("route_output");
241 1.1 cgd len = m->m_pkthdr.len;
242 1.1 cgd if (len < sizeof(*rtm) ||
243 1.10 mycroft len != mtod(m, struct rt_msghdr *)->rtm_msglen) {
244 1.95 dyoung dst = NULL;
245 1.1 cgd senderr(EINVAL);
246 1.10 mycroft }
247 1.1 cgd R_Malloc(rtm, struct rt_msghdr *, len);
248 1.95 dyoung if (rtm == NULL) {
249 1.95 dyoung dst = NULL;
250 1.1 cgd senderr(ENOBUFS);
251 1.10 mycroft }
252 1.93 christos m_copydata(m, 0, len, (void *)rtm);
253 1.10 mycroft if (rtm->rtm_version != RTM_VERSION) {
254 1.95 dyoung dst = NULL;
255 1.1 cgd senderr(EPROTONOSUPPORT);
256 1.10 mycroft }
257 1.1 cgd rtm->rtm_pid = curproc->p_pid;
258 1.48 thorpej memset(&info, 0, sizeof(info));
259 1.10 mycroft info.rti_addrs = rtm->rtm_addrs;
260 1.93 christos if (rt_xaddrs(rtm->rtm_type, (void *)(rtm + 1), len + (char *)rtm, &info))
261 1.42 erh senderr(EINVAL);
262 1.45 itojun info.rti_flags = rtm->rtm_flags;
263 1.91 dyoung #ifdef RTSOCK_DEBUG
264 1.91 dyoung if (dst->sa_family == AF_INET) {
265 1.91 dyoung printf("%s: extracted dst %s\n", __func__,
266 1.91 dyoung inet_ntoa(((const struct sockaddr_in *)dst)->sin_addr));
267 1.91 dyoung }
268 1.91 dyoung #endif /* RTSOCK_DEBUG */
269 1.95 dyoung if (dst == NULL || (dst->sa_family >= AF_MAX))
270 1.26 fvdl senderr(EINVAL);
271 1.95 dyoung if (gate != NULL && (gate->sa_family >= AF_MAX))
272 1.1 cgd senderr(EINVAL);
273 1.23 thorpej
274 1.23 thorpej /*
275 1.23 thorpej * Verify that the caller has the appropriate privilege; RTM_GET
276 1.23 thorpej * is the only operation the non-superuser is allowed.
277 1.23 thorpej */
278 1.88 elad if (kauth_authorize_network(curlwp->l_cred, KAUTH_NETWORK_ROUTE,
279 1.89 elad 0, rtm, NULL, NULL) != 0)
280 1.23 thorpej senderr(EACCES);
281 1.23 thorpej
282 1.1 cgd switch (rtm->rtm_type) {
283 1.10 mycroft
284 1.1 cgd case RTM_ADD:
285 1.95 dyoung if (gate == NULL)
286 1.1 cgd senderr(EINVAL);
287 1.45 itojun error = rtrequest1(rtm->rtm_type, &info, &saved_nrt);
288 1.1 cgd if (error == 0 && saved_nrt) {
289 1.1 cgd rt_setmetrics(rtm->rtm_inits,
290 1.21 christos &rtm->rtm_rmx, &saved_nrt->rt_rmx);
291 1.1 cgd saved_nrt->rt_refcnt--;
292 1.1 cgd }
293 1.1 cgd break;
294 1.1 cgd
295 1.1 cgd case RTM_DELETE:
296 1.45 itojun error = rtrequest1(rtm->rtm_type, &info, &saved_nrt);
297 1.16 cgd if (error == 0) {
298 1.16 cgd (rt = saved_nrt)->rt_refcnt++;
299 1.16 cgd goto report;
300 1.16 cgd }
301 1.1 cgd break;
302 1.1 cgd
303 1.1 cgd case RTM_GET:
304 1.1 cgd case RTM_CHANGE:
305 1.1 cgd case RTM_LOCK:
306 1.95 dyoung /* XXX This will mask dst with netmask before
307 1.95 dyoung * searching. It did not used to do that. --dyoung
308 1.95 dyoung */
309 1.95 dyoung error = rtrequest(RTM_GET, dst, gate, netmask, 0, &rt);
310 1.95 dyoung if (error != 0)
311 1.95 dyoung senderr(error);
312 1.61 itojun if (rtm->rtm_type != RTM_GET) {/* XXX: too grotty */
313 1.95 dyoung struct radix_node *rn;
314 1.61 itojun
315 1.95 dyoung if (memcmp(dst, rt_getkey(rt), dst->sa_len) != 0)
316 1.61 itojun senderr(ESRCH);
317 1.95 dyoung netmask = intern_netmask(netmask);
318 1.95 dyoung for (rn = rt->rt_nodes; rn; rn = rn->rn_dupedkey)
319 1.95 dyoung if (netmask == (const struct sockaddr *)rn->rn_mask)
320 1.61 itojun break;
321 1.95 dyoung if (rn == NULL)
322 1.61 itojun senderr(ETOOMANYREFS);
323 1.95 dyoung rt = (struct rtentry *)rn;
324 1.61 itojun }
325 1.37 itojun
326 1.59 itojun switch (rtm->rtm_type) {
327 1.1 cgd case RTM_GET:
328 1.16 cgd report:
329 1.95 dyoung dst = rt_getkey(rt);
330 1.10 mycroft gate = rt->rt_gateway;
331 1.10 mycroft netmask = rt_mask(rt);
332 1.91 dyoung if ((rtm->rtm_addrs & (RTA_IFP | RTA_IFA)) == 0)
333 1.91 dyoung ;
334 1.91 dyoung else if ((ifp = rt->rt_ifp) != NULL) {
335 1.91 dyoung const struct ifaddr *rtifa;
336 1.97 dyoung ifpaddr = ifp->if_dl->ifa_addr;
337 1.91 dyoung /* rtifa used to be simply rt->rt_ifa.
338 1.91 dyoung * If rt->rt_ifa != NULL, then
339 1.91 dyoung * rt_get_ifa() != NULL. So this
340 1.91 dyoung * ought to still be safe. --dyoung
341 1.91 dyoung */
342 1.91 dyoung rtifa = rt_get_ifa(rt);
343 1.91 dyoung ifaaddr = rtifa->ifa_addr;
344 1.91 dyoung #ifdef RTSOCK_DEBUG
345 1.91 dyoung if (ifaaddr->sa_family == AF_INET) {
346 1.91 dyoung printf("%s: copying out RTAX_IFA %s ",
347 1.91 dyoung __func__,
348 1.91 dyoung inet_ntoa(((const struct sockaddr_in *)ifaaddr)->sin_addr));
349 1.91 dyoung printf("for dst %s ifa_getifa %p ifa_seqno %p\n",
350 1.91 dyoung inet_ntoa(((const struct sockaddr_in *)dst)->sin_addr),
351 1.91 dyoung (void *)rtifa->ifa_getifa, rtifa->ifa_seqno);
352 1.37 itojun }
353 1.91 dyoung #endif /* RTSOCK_DEBUG */
354 1.91 dyoung if (ifp->if_flags & IFF_POINTOPOINT)
355 1.91 dyoung brdaddr = rtifa->ifa_dstaddr;
356 1.91 dyoung else
357 1.95 dyoung brdaddr = NULL;
358 1.91 dyoung rtm->rtm_index = ifp->if_index;
359 1.91 dyoung } else {
360 1.95 dyoung ifpaddr = NULL;
361 1.95 dyoung ifaaddr = NULL;
362 1.1 cgd }
363 1.95 dyoung (void)rt_msg2(rtm->rtm_type, &info, NULL, NULL, &len);
364 1.1 cgd if (len > rtm->rtm_msglen) {
365 1.1 cgd struct rt_msghdr *new_rtm;
366 1.1 cgd R_Malloc(new_rtm, struct rt_msghdr *, len);
367 1.95 dyoung if (new_rtm == NULL)
368 1.1 cgd senderr(ENOBUFS);
369 1.1 cgd Bcopy(rtm, new_rtm, rtm->rtm_msglen);
370 1.1 cgd Free(rtm); rtm = new_rtm;
371 1.1 cgd }
372 1.93 christos (void)rt_msg2(rtm->rtm_type, &info, (void *)rtm,
373 1.95 dyoung NULL, 0);
374 1.1 cgd rtm->rtm_flags = rt->rt_flags;
375 1.1 cgd rtm->rtm_rmx = rt->rt_rmx;
376 1.10 mycroft rtm->rtm_addrs = info.rti_addrs;
377 1.1 cgd break;
378 1.1 cgd
379 1.1 cgd case RTM_CHANGE:
380 1.45 itojun /*
381 1.45 itojun * new gateway could require new ifaddr, ifp;
382 1.45 itojun * flags may also be different; ifp may be specified
383 1.45 itojun * by ll sockaddr when protocol address is ambiguous
384 1.45 itojun */
385 1.45 itojun if ((error = rt_getifa(&info)) != 0)
386 1.45 itojun senderr(error);
387 1.95 dyoung if (gate && rt_setgate(rt, gate))
388 1.1 cgd senderr(EDQUOT);
389 1.35 itojun /* new gateway could require new ifaddr, ifp;
390 1.35 itojun flags may also be different; ifp may be specified
391 1.35 itojun by ll sockaddr when protocol address is ambiguous */
392 1.35 itojun if (ifpaddr && (ifa = ifa_ifwithnet(ifpaddr)) &&
393 1.35 itojun (ifp = ifa->ifa_ifp) && (ifaaddr || gate))
394 1.35 itojun ifa = ifaof_ifpforaddr(ifaaddr ? ifaaddr : gate,
395 1.35 itojun ifp);
396 1.35 itojun else if ((ifaaddr && (ifa = ifa_ifwithaddr(ifaaddr))) ||
397 1.35 itojun (gate && (ifa = ifa_ifwithroute(rt->rt_flags,
398 1.95 dyoung rt_getkey(rt), gate))))
399 1.35 itojun ifp = ifa->ifa_ifp;
400 1.35 itojun if (ifa) {
401 1.39 augustss struct ifaddr *oifa = rt->rt_ifa;
402 1.35 itojun if (oifa != ifa) {
403 1.90 dyoung if (oifa && oifa->ifa_rtrequest) {
404 1.90 dyoung oifa->ifa_rtrequest(RTM_DELETE,
405 1.90 dyoung rt, &info);
406 1.90 dyoung }
407 1.90 dyoung rt_replace_ifa(rt, ifa);
408 1.90 dyoung rt->rt_ifp = ifp;
409 1.35 itojun }
410 1.35 itojun }
411 1.1 cgd rt_setmetrics(rtm->rtm_inits, &rtm->rtm_rmx,
412 1.21 christos &rt->rt_rmx);
413 1.35 itojun if (rt->rt_ifa && rt->rt_ifa->ifa_rtrequest)
414 1.45 itojun rt->rt_ifa->ifa_rtrequest(RTM_ADD, rt, &info);
415 1.1 cgd /*
416 1.1 cgd * Fall into
417 1.1 cgd */
418 1.1 cgd case RTM_LOCK:
419 1.10 mycroft rt->rt_rmx.rmx_locks &= ~(rtm->rtm_inits);
420 1.1 cgd rt->rt_rmx.rmx_locks |=
421 1.21 christos (rtm->rtm_inits & rtm->rtm_rmx.rmx_locks);
422 1.1 cgd break;
423 1.1 cgd }
424 1.10 mycroft break;
425 1.1 cgd
426 1.1 cgd default:
427 1.1 cgd senderr(EOPNOTSUPP);
428 1.1 cgd }
429 1.1 cgd
430 1.1 cgd flush:
431 1.1 cgd if (rtm) {
432 1.1 cgd if (error)
433 1.1 cgd rtm->rtm_errno = error;
434 1.75 perry else
435 1.1 cgd rtm->rtm_flags |= RTF_DONE;
436 1.1 cgd }
437 1.55 christos family = dst ? dst->sa_family : 0;
438 1.1 cgd if (rt)
439 1.1 cgd rtfree(rt);
440 1.1 cgd {
441 1.95 dyoung struct rawcb *rp = NULL;
442 1.1 cgd /*
443 1.1 cgd * Check to see if we don't want our own messages.
444 1.1 cgd */
445 1.1 cgd if ((so->so_options & SO_USELOOPBACK) == 0) {
446 1.1 cgd if (route_cb.any_count <= 1) {
447 1.1 cgd if (rtm)
448 1.1 cgd Free(rtm);
449 1.1 cgd m_freem(m);
450 1.95 dyoung return error;
451 1.1 cgd }
452 1.1 cgd /* There is another listener, so construct message */
453 1.1 cgd rp = sotorawcb(so);
454 1.1 cgd }
455 1.1 cgd if (rtm) {
456 1.93 christos m_copyback(m, 0, rtm->rtm_msglen, (void *)rtm);
457 1.47 itojun if (m->m_pkthdr.len < rtm->rtm_msglen) {
458 1.46 itojun m_freem(m);
459 1.46 itojun m = NULL;
460 1.47 itojun } else if (m->m_pkthdr.len > rtm->rtm_msglen)
461 1.46 itojun m_adj(m, rtm->rtm_msglen - m->m_pkthdr.len);
462 1.1 cgd Free(rtm);
463 1.1 cgd }
464 1.1 cgd if (rp)
465 1.1 cgd rp->rcb_proto.sp_family = 0; /* Avoid us */
466 1.55 christos if (family)
467 1.99 ad proto.sp_protocol = family;
468 1.46 itojun if (m)
469 1.99 ad raw_input(m, &proto, &route_src, &route_dst);
470 1.1 cgd if (rp)
471 1.1 cgd rp->rcb_proto.sp_family = PF_ROUTE;
472 1.1 cgd }
473 1.95 dyoung return error;
474 1.1 cgd }
475 1.1 cgd
476 1.9 mycroft void
477 1.69 matt rt_setmetrics(u_long which, const struct rt_metrics *in, struct rt_metrics *out)
478 1.1 cgd {
479 1.1 cgd #define metric(f, e) if (which & (f)) out->e = in->e;
480 1.1 cgd metric(RTV_RPIPE, rmx_recvpipe);
481 1.1 cgd metric(RTV_SPIPE, rmx_sendpipe);
482 1.1 cgd metric(RTV_SSTHRESH, rmx_ssthresh);
483 1.1 cgd metric(RTV_RTT, rmx_rtt);
484 1.1 cgd metric(RTV_RTTVAR, rmx_rttvar);
485 1.1 cgd metric(RTV_HOPCOUNT, rmx_hopcount);
486 1.1 cgd metric(RTV_MTU, rmx_mtu);
487 1.1 cgd metric(RTV_EXPIRE, rmx_expire);
488 1.1 cgd #undef metric
489 1.1 cgd }
490 1.1 cgd
491 1.10 mycroft #define ROUNDUP(a) \
492 1.18 cgd ((a) > 0 ? (1 + (((a) - 1) | (sizeof(long) - 1))) : sizeof(long))
493 1.10 mycroft #define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
494 1.10 mycroft
495 1.42 erh static int
496 1.72 christos rt_xaddrs(u_char rtmtype, const char *cp, const char *cplim, struct rt_addrinfo *rtinfo)
497 1.10 mycroft {
498 1.69 matt const struct sockaddr *sa = NULL; /* Quell compiler warning */
499 1.39 augustss int i;
500 1.10 mycroft
501 1.10 mycroft for (i = 0; (i < RTAX_MAX) && (cp < cplim); i++) {
502 1.10 mycroft if ((rtinfo->rti_addrs & (1 << i)) == 0)
503 1.10 mycroft continue;
504 1.76 christos rtinfo->rti_info[i] = sa = (const struct sockaddr *)cp;
505 1.10 mycroft ADVANCE(cp, sa);
506 1.10 mycroft }
507 1.44 enami
508 1.72 christos /* Check for extra addresses specified, except RTM_GET asking for interface info. */
509 1.72 christos if (rtmtype == RTM_GET) {
510 1.72 christos if (((rtinfo->rti_addrs & (~((1 << RTAX_IFP) | (1 << RTAX_IFA)))) & (~0 << i)) != 0)
511 1.95 dyoung return 1;
512 1.72 christos } else {
513 1.72 christos if ((rtinfo->rti_addrs & (~0 << i)) != 0)
514 1.95 dyoung return 1;
515 1.72 christos }
516 1.44 enami /* Check for bad data length. */
517 1.44 enami if (cp != cplim) {
518 1.82 christos if (i == RTAX_NETMASK + 1 && sa &&
519 1.44 enami cp - ROUNDUP(sa->sa_len) + sa->sa_len == cplim)
520 1.44 enami /*
521 1.44 enami * The last sockaddr was netmask.
522 1.44 enami * We accept this for now for the sake of old
523 1.44 enami * binaries or third party softwares.
524 1.44 enami */
525 1.44 enami ;
526 1.44 enami else
527 1.95 dyoung return 1;
528 1.44 enami }
529 1.95 dyoung return 0;
530 1.1 cgd }
531 1.1 cgd
532 1.10 mycroft static struct mbuf *
533 1.93 christos rt_msg1(int type, struct rt_addrinfo *rtinfo, void *data, int datalen)
534 1.1 cgd {
535 1.39 augustss struct rt_msghdr *rtm;
536 1.39 augustss struct mbuf *m;
537 1.39 augustss int i;
538 1.68 matt const struct sockaddr *sa;
539 1.47 itojun int len, dlen;
540 1.1 cgd
541 1.47 itojun m = m_gethdr(M_DONTWAIT, MT_DATA);
542 1.95 dyoung if (m == NULL)
543 1.95 dyoung return m;
544 1.58 matt MCLAIM(m, &routedomain.dom_mowner);
545 1.10 mycroft switch (type) {
546 1.47 itojun
547 1.10 mycroft case RTM_DELADDR:
548 1.10 mycroft case RTM_NEWADDR:
549 1.47 itojun len = sizeof(struct ifa_msghdr);
550 1.10 mycroft break;
551 1.10 mycroft
552 1.32 bouyer #ifdef COMPAT_14
553 1.32 bouyer case RTM_OIFINFO:
554 1.47 itojun len = sizeof(struct if_msghdr14);
555 1.32 bouyer break;
556 1.32 bouyer #endif
557 1.32 bouyer
558 1.10 mycroft case RTM_IFINFO:
559 1.47 itojun len = sizeof(struct if_msghdr);
560 1.10 mycroft break;
561 1.10 mycroft
562 1.36 thorpej case RTM_IFANNOUNCE:
563 1.78 dyoung case RTM_IEEE80211:
564 1.47 itojun len = sizeof(struct if_announcemsghdr);
565 1.36 thorpej break;
566 1.36 thorpej
567 1.10 mycroft default:
568 1.47 itojun len = sizeof(struct rt_msghdr);
569 1.46 itojun }
570 1.47 itojun if (len > MHLEN + MLEN)
571 1.34 itojun panic("rt_msg1: message too long");
572 1.47 itojun else if (len > MHLEN) {
573 1.32 bouyer m->m_next = m_get(M_DONTWAIT, MT_DATA);
574 1.47 itojun if (m->m_next == NULL) {
575 1.32 bouyer m_freem(m);
576 1.95 dyoung return NULL;
577 1.32 bouyer }
578 1.58 matt MCLAIM(m->m_next, m->m_owner);
579 1.47 itojun m->m_pkthdr.len = len;
580 1.47 itojun m->m_len = MHLEN;
581 1.47 itojun m->m_next->m_len = len - MHLEN;
582 1.47 itojun } else {
583 1.47 itojun m->m_pkthdr.len = m->m_len = len;
584 1.32 bouyer }
585 1.95 dyoung m->m_pkthdr.rcvif = NULL;
586 1.32 bouyer m_copyback(m, 0, datalen, data);
587 1.1 cgd rtm = mtod(m, struct rt_msghdr *);
588 1.10 mycroft for (i = 0; i < RTAX_MAX; i++) {
589 1.10 mycroft if ((sa = rtinfo->rti_info[i]) == NULL)
590 1.10 mycroft continue;
591 1.10 mycroft rtinfo->rti_addrs |= (1 << i);
592 1.10 mycroft dlen = ROUNDUP(sa->sa_len);
593 1.76 christos m_copyback(m, len, dlen, sa);
594 1.10 mycroft len += dlen;
595 1.47 itojun }
596 1.47 itojun if (m->m_pkthdr.len != len) {
597 1.47 itojun m_freem(m);
598 1.95 dyoung return NULL;
599 1.10 mycroft }
600 1.1 cgd rtm->rtm_msglen = len;
601 1.1 cgd rtm->rtm_version = RTM_VERSION;
602 1.1 cgd rtm->rtm_type = type;
603 1.95 dyoung return m;
604 1.10 mycroft }
605 1.10 mycroft
606 1.29 chopps /*
607 1.29 chopps * rt_msg2
608 1.29 chopps *
609 1.29 chopps * fills 'cp' or 'w'.w_tmem with the routing socket message and
610 1.29 chopps * returns the length of the message in 'lenp'.
611 1.29 chopps *
612 1.29 chopps * if walkarg is 0, cp is expected to be 0 or a buffer large enough to hold
613 1.29 chopps * the message
614 1.29 chopps * otherwise walkarg's w_needed is updated and if the user buffer is
615 1.29 chopps * specified and w_needed indicates space exists the information is copied
616 1.29 chopps * into the temp space (w_tmem). w_tmem is [re]allocated if necessary,
617 1.29 chopps * if the allocation fails ENOBUFS is returned.
618 1.29 chopps */
619 1.10 mycroft static int
620 1.93 christos rt_msg2(int type, struct rt_addrinfo *rtinfo, void *cpv, struct walkarg *w,
621 1.69 matt int *lenp)
622 1.10 mycroft {
623 1.39 augustss int i;
624 1.10 mycroft int len, dlen, second_time = 0;
625 1.93 christos char *cp0, *cp = cpv;
626 1.10 mycroft
627 1.10 mycroft rtinfo->rti_addrs = 0;
628 1.10 mycroft again:
629 1.10 mycroft switch (type) {
630 1.10 mycroft
631 1.10 mycroft case RTM_DELADDR:
632 1.10 mycroft case RTM_NEWADDR:
633 1.10 mycroft len = sizeof(struct ifa_msghdr);
634 1.10 mycroft break;
635 1.32 bouyer #ifdef COMPAT_14
636 1.32 bouyer case RTM_OIFINFO:
637 1.32 bouyer len = sizeof(struct if_msghdr14);
638 1.32 bouyer break;
639 1.32 bouyer #endif
640 1.10 mycroft
641 1.10 mycroft case RTM_IFINFO:
642 1.10 mycroft len = sizeof(struct if_msghdr);
643 1.10 mycroft break;
644 1.10 mycroft
645 1.10 mycroft default:
646 1.10 mycroft len = sizeof(struct rt_msghdr);
647 1.10 mycroft }
648 1.17 christos if ((cp0 = cp) != NULL)
649 1.10 mycroft cp += len;
650 1.10 mycroft for (i = 0; i < RTAX_MAX; i++) {
651 1.68 matt const struct sockaddr *sa;
652 1.10 mycroft
653 1.95 dyoung if ((sa = rtinfo->rti_info[i]) == NULL)
654 1.10 mycroft continue;
655 1.10 mycroft rtinfo->rti_addrs |= (1 << i);
656 1.10 mycroft dlen = ROUNDUP(sa->sa_len);
657 1.10 mycroft if (cp) {
658 1.21 christos bcopy(sa, cp, (unsigned)dlen);
659 1.10 mycroft cp += dlen;
660 1.10 mycroft }
661 1.1 cgd len += dlen;
662 1.1 cgd }
663 1.95 dyoung if (cp == NULL && w != NULL && !second_time) {
664 1.39 augustss struct walkarg *rw = w;
665 1.10 mycroft
666 1.10 mycroft rw->w_needed += len;
667 1.10 mycroft if (rw->w_needed <= 0 && rw->w_where) {
668 1.10 mycroft if (rw->w_tmemsize < len) {
669 1.10 mycroft if (rw->w_tmem)
670 1.10 mycroft free(rw->w_tmem, M_RTABLE);
671 1.93 christos rw->w_tmem = (void *) malloc(len, M_RTABLE,
672 1.21 christos M_NOWAIT);
673 1.17 christos if (rw->w_tmem)
674 1.10 mycroft rw->w_tmemsize = len;
675 1.10 mycroft }
676 1.10 mycroft if (rw->w_tmem) {
677 1.10 mycroft cp = rw->w_tmem;
678 1.10 mycroft second_time = 1;
679 1.10 mycroft goto again;
680 1.29 chopps } else {
681 1.29 chopps rw->w_tmemneeded = len;
682 1.95 dyoung return ENOBUFS;
683 1.29 chopps }
684 1.10 mycroft }
685 1.1 cgd }
686 1.10 mycroft if (cp) {
687 1.39 augustss struct rt_msghdr *rtm = (struct rt_msghdr *)cp0;
688 1.10 mycroft
689 1.10 mycroft rtm->rtm_version = RTM_VERSION;
690 1.10 mycroft rtm->rtm_type = type;
691 1.10 mycroft rtm->rtm_msglen = len;
692 1.1 cgd }
693 1.29 chopps if (lenp)
694 1.29 chopps *lenp = len;
695 1.95 dyoung return 0;
696 1.10 mycroft }
697 1.10 mycroft
698 1.10 mycroft /*
699 1.10 mycroft * This routine is called to generate a message from the routing
700 1.51 wiz * socket indicating that a redirect has occurred, a routing lookup
701 1.10 mycroft * has failed, or that a protocol has detected timeouts to a particular
702 1.10 mycroft * destination.
703 1.10 mycroft */
704 1.10 mycroft void
705 1.69 matt rt_missmsg(int type, struct rt_addrinfo *rtinfo, int flags, int error)
706 1.10 mycroft {
707 1.32 bouyer struct rt_msghdr rtm;
708 1.39 augustss struct mbuf *m;
709 1.68 matt const struct sockaddr *sa = rtinfo->rti_info[RTAX_DST];
710 1.10 mycroft
711 1.10 mycroft if (route_cb.any_count == 0)
712 1.10 mycroft return;
713 1.48 thorpej memset(&rtm, 0, sizeof(rtm));
714 1.32 bouyer rtm.rtm_flags = RTF_DONE | flags;
715 1.32 bouyer rtm.rtm_errno = error;
716 1.93 christos m = rt_msg1(type, rtinfo, (void *)&rtm, sizeof(rtm));
717 1.95 dyoung if (m == NULL)
718 1.1 cgd return;
719 1.32 bouyer mtod(m, struct rt_msghdr *)->rtm_addrs = rtinfo->rti_addrs;
720 1.99 ad route_enqueue(m, sa ? sa->sa_family : 0);
721 1.10 mycroft }
722 1.10 mycroft
723 1.10 mycroft /*
724 1.10 mycroft * This routine is called to generate a message from the routing
725 1.10 mycroft * socket indicating that the status of a network interface has changed.
726 1.10 mycroft */
727 1.10 mycroft void
728 1.69 matt rt_ifmsg(struct ifnet *ifp)
729 1.10 mycroft {
730 1.32 bouyer struct if_msghdr ifm;
731 1.32 bouyer #ifdef COMPAT_14
732 1.32 bouyer struct if_msghdr14 oifm;
733 1.32 bouyer #endif
734 1.10 mycroft struct mbuf *m;
735 1.10 mycroft struct rt_addrinfo info;
736 1.10 mycroft
737 1.10 mycroft if (route_cb.any_count == 0)
738 1.10 mycroft return;
739 1.48 thorpej memset(&info, 0, sizeof(info));
740 1.48 thorpej memset(&ifm, 0, sizeof(ifm));
741 1.32 bouyer ifm.ifm_index = ifp->if_index;
742 1.32 bouyer ifm.ifm_flags = ifp->if_flags;
743 1.32 bouyer ifm.ifm_data = ifp->if_data;
744 1.32 bouyer ifm.ifm_addrs = 0;
745 1.93 christos m = rt_msg1(RTM_IFINFO, &info, (void *)&ifm, sizeof(ifm));
746 1.95 dyoung if (m == NULL)
747 1.32 bouyer return;
748 1.99 ad route_enqueue(m, 0);
749 1.32 bouyer #ifdef COMPAT_14
750 1.48 thorpej memset(&info, 0, sizeof(info));
751 1.48 thorpej memset(&oifm, 0, sizeof(oifm));
752 1.32 bouyer oifm.ifm_index = ifp->if_index;
753 1.32 bouyer oifm.ifm_flags = ifp->if_flags;
754 1.32 bouyer oifm.ifm_data.ifi_type = ifp->if_data.ifi_type;
755 1.32 bouyer oifm.ifm_data.ifi_addrlen = ifp->if_data.ifi_addrlen;
756 1.32 bouyer oifm.ifm_data.ifi_hdrlen = ifp->if_data.ifi_hdrlen;
757 1.32 bouyer oifm.ifm_data.ifi_mtu = ifp->if_data.ifi_mtu;
758 1.32 bouyer oifm.ifm_data.ifi_metric = ifp->if_data.ifi_metric;
759 1.32 bouyer oifm.ifm_data.ifi_baudrate = ifp->if_data.ifi_baudrate;
760 1.32 bouyer oifm.ifm_data.ifi_ipackets = ifp->if_data.ifi_ipackets;
761 1.32 bouyer oifm.ifm_data.ifi_ierrors = ifp->if_data.ifi_ierrors;
762 1.32 bouyer oifm.ifm_data.ifi_opackets = ifp->if_data.ifi_opackets;
763 1.32 bouyer oifm.ifm_data.ifi_oerrors = ifp->if_data.ifi_oerrors;
764 1.32 bouyer oifm.ifm_data.ifi_collisions = ifp->if_data.ifi_collisions;
765 1.32 bouyer oifm.ifm_data.ifi_ibytes = ifp->if_data.ifi_ibytes;
766 1.32 bouyer oifm.ifm_data.ifi_obytes = ifp->if_data.ifi_obytes;
767 1.32 bouyer oifm.ifm_data.ifi_imcasts = ifp->if_data.ifi_imcasts;
768 1.32 bouyer oifm.ifm_data.ifi_omcasts = ifp->if_data.ifi_omcasts;
769 1.32 bouyer oifm.ifm_data.ifi_iqdrops = ifp->if_data.ifi_iqdrops;
770 1.32 bouyer oifm.ifm_data.ifi_noproto = ifp->if_data.ifi_noproto;
771 1.32 bouyer oifm.ifm_data.ifi_lastchange = ifp->if_data.ifi_lastchange;
772 1.32 bouyer oifm.ifm_addrs = 0;
773 1.93 christos m = rt_msg1(RTM_OIFINFO, &info, (void *)&oifm, sizeof(oifm));
774 1.95 dyoung if (m == NULL)
775 1.10 mycroft return;
776 1.99 ad route_enqueue(m, 0);
777 1.32 bouyer #endif
778 1.1 cgd }
779 1.1 cgd
780 1.1 cgd /*
781 1.10 mycroft * This is called to generate messages from the routing socket
782 1.10 mycroft * indicating a network interface has had addresses associated with it.
783 1.10 mycroft * if we ever reverse the logic and replace messages TO the routing
784 1.10 mycroft * socket indicate a request to configure interfaces, then it will
785 1.10 mycroft * be unnecessary as the routing socket will automatically generate
786 1.10 mycroft * copies of it.
787 1.10 mycroft */
788 1.10 mycroft void
789 1.69 matt rt_newaddrmsg(int cmd, struct ifaddr *ifa, int error, struct rtentry *rt)
790 1.10 mycroft {
791 1.10 mycroft struct rt_addrinfo info;
792 1.95 dyoung const struct sockaddr *sa = NULL;
793 1.10 mycroft int pass;
794 1.17 christos struct mbuf *m = NULL;
795 1.10 mycroft struct ifnet *ifp = ifa->ifa_ifp;
796 1.10 mycroft
797 1.10 mycroft if (route_cb.any_count == 0)
798 1.10 mycroft return;
799 1.10 mycroft for (pass = 1; pass < 3; pass++) {
800 1.48 thorpej memset(&info, 0, sizeof(info));
801 1.10 mycroft if ((cmd == RTM_ADD && pass == 1) ||
802 1.10 mycroft (cmd == RTM_DELETE && pass == 2)) {
803 1.32 bouyer struct ifa_msghdr ifam;
804 1.10 mycroft int ncmd = cmd == RTM_ADD ? RTM_NEWADDR : RTM_DELADDR;
805 1.10 mycroft
806 1.10 mycroft ifaaddr = sa = ifa->ifa_addr;
807 1.97 dyoung ifpaddr = ifp->if_dl->ifa_addr;
808 1.10 mycroft netmask = ifa->ifa_netmask;
809 1.10 mycroft brdaddr = ifa->ifa_dstaddr;
810 1.48 thorpej memset(&ifam, 0, sizeof(ifam));
811 1.32 bouyer ifam.ifam_index = ifp->if_index;
812 1.32 bouyer ifam.ifam_metric = ifa->ifa_metric;
813 1.32 bouyer ifam.ifam_flags = ifa->ifa_flags;
814 1.93 christos m = rt_msg1(ncmd, &info, (void *)&ifam, sizeof(ifam));
815 1.32 bouyer if (m == NULL)
816 1.10 mycroft continue;
817 1.32 bouyer mtod(m, struct ifa_msghdr *)->ifam_addrs =
818 1.32 bouyer info.rti_addrs;
819 1.10 mycroft }
820 1.10 mycroft if ((cmd == RTM_ADD && pass == 2) ||
821 1.10 mycroft (cmd == RTM_DELETE && pass == 1)) {
822 1.32 bouyer struct rt_msghdr rtm;
823 1.75 perry
824 1.95 dyoung if (rt == NULL)
825 1.10 mycroft continue;
826 1.10 mycroft netmask = rt_mask(rt);
827 1.95 dyoung dst = sa = rt_getkey(rt);
828 1.10 mycroft gate = rt->rt_gateway;
829 1.48 thorpej memset(&rtm, 0, sizeof(rtm));
830 1.32 bouyer rtm.rtm_index = ifp->if_index;
831 1.32 bouyer rtm.rtm_flags |= rt->rt_flags;
832 1.32 bouyer rtm.rtm_errno = error;
833 1.93 christos m = rt_msg1(cmd, &info, (void *)&rtm, sizeof(rtm));
834 1.32 bouyer if (m == NULL)
835 1.10 mycroft continue;
836 1.32 bouyer mtod(m, struct rt_msghdr *)->rtm_addrs = info.rti_addrs;
837 1.10 mycroft }
838 1.99 ad route_enqueue(m, sa ? sa->sa_family : 0);
839 1.10 mycroft }
840 1.36 thorpej }
841 1.36 thorpej
842 1.78 dyoung static struct mbuf *
843 1.78 dyoung rt_makeifannouncemsg(struct ifnet *ifp, int type, int what,
844 1.78 dyoung struct rt_addrinfo *info)
845 1.78 dyoung {
846 1.78 dyoung struct if_announcemsghdr ifan;
847 1.78 dyoung
848 1.78 dyoung memset(info, 0, sizeof(*info));
849 1.78 dyoung memset(&ifan, 0, sizeof(ifan));
850 1.78 dyoung ifan.ifan_index = ifp->if_index;
851 1.78 dyoung strlcpy(ifan.ifan_name, ifp->if_xname, sizeof(ifan.ifan_name));
852 1.78 dyoung ifan.ifan_what = what;
853 1.93 christos return rt_msg1(type, info, (void *)&ifan, sizeof(ifan));
854 1.78 dyoung }
855 1.78 dyoung
856 1.36 thorpej /*
857 1.36 thorpej * This is called to generate routing socket messages indicating
858 1.36 thorpej * network interface arrival and departure.
859 1.36 thorpej */
860 1.36 thorpej void
861 1.69 matt rt_ifannouncemsg(struct ifnet *ifp, int what)
862 1.36 thorpej {
863 1.36 thorpej struct mbuf *m;
864 1.36 thorpej struct rt_addrinfo info;
865 1.36 thorpej
866 1.36 thorpej if (route_cb.any_count == 0)
867 1.36 thorpej return;
868 1.78 dyoung m = rt_makeifannouncemsg(ifp, RTM_IFANNOUNCE, what, &info);
869 1.78 dyoung if (m == NULL)
870 1.78 dyoung return;
871 1.99 ad route_enqueue(m, 0);
872 1.78 dyoung }
873 1.78 dyoung
874 1.78 dyoung /*
875 1.78 dyoung * This is called to generate routing socket messages indicating
876 1.78 dyoung * IEEE80211 wireless events.
877 1.78 dyoung * XXX we piggyback on the RTM_IFANNOUNCE msg format in a clumsy way.
878 1.78 dyoung */
879 1.78 dyoung void
880 1.78 dyoung rt_ieee80211msg(struct ifnet *ifp, int what, void *data, size_t data_len)
881 1.78 dyoung {
882 1.78 dyoung struct mbuf *m;
883 1.78 dyoung struct rt_addrinfo info;
884 1.78 dyoung
885 1.78 dyoung if (route_cb.any_count == 0)
886 1.78 dyoung return;
887 1.78 dyoung m = rt_makeifannouncemsg(ifp, RTM_IEEE80211, what, &info);
888 1.78 dyoung if (m == NULL)
889 1.36 thorpej return;
890 1.78 dyoung /*
891 1.78 dyoung * Append the ieee80211 data. Try to stick it in the
892 1.78 dyoung * mbuf containing the ifannounce msg; otherwise allocate
893 1.78 dyoung * a new mbuf and append.
894 1.78 dyoung *
895 1.78 dyoung * NB: we assume m is a single mbuf.
896 1.78 dyoung */
897 1.78 dyoung if (data_len > M_TRAILINGSPACE(m)) {
898 1.78 dyoung struct mbuf *n = m_get(M_NOWAIT, MT_DATA);
899 1.78 dyoung if (n == NULL) {
900 1.78 dyoung m_freem(m);
901 1.78 dyoung return;
902 1.78 dyoung }
903 1.78 dyoung (void)memcpy(mtod(n, void *), data, data_len);
904 1.78 dyoung n->m_len = data_len;
905 1.78 dyoung m->m_next = n;
906 1.78 dyoung } else if (data_len > 0) {
907 1.98 matt (void)memcpy(mtod(m, uint8_t *) + m->m_len, data, data_len);
908 1.78 dyoung m->m_len += data_len;
909 1.78 dyoung }
910 1.78 dyoung if (m->m_flags & M_PKTHDR)
911 1.78 dyoung m->m_pkthdr.len += data_len;
912 1.78 dyoung mtod(m, struct if_announcemsghdr *)->ifan_msglen += data_len;
913 1.99 ad route_enqueue(m, 0);
914 1.10 mycroft }
915 1.10 mycroft
916 1.10 mycroft /*
917 1.10 mycroft * This is used in dumping the kernel table via sysctl().
918 1.1 cgd */
919 1.40 simonb static int
920 1.94 dyoung sysctl_dumpentry(struct rtentry *rt, void *v)
921 1.1 cgd {
922 1.39 augustss struct walkarg *w = v;
923 1.10 mycroft int error = 0, size;
924 1.10 mycroft struct rt_addrinfo info;
925 1.1 cgd
926 1.10 mycroft if (w->w_op == NET_RT_FLAGS && !(rt->rt_flags & w->w_arg))
927 1.10 mycroft return 0;
928 1.48 thorpej memset(&info, 0, sizeof(info));
929 1.95 dyoung dst = rt_getkey(rt);
930 1.10 mycroft gate = rt->rt_gateway;
931 1.10 mycroft netmask = rt_mask(rt);
932 1.16 cgd if (rt->rt_ifp) {
933 1.91 dyoung const struct ifaddr *rtifa;
934 1.97 dyoung ifpaddr = rt->rt_ifp->if_dl->ifa_addr;
935 1.91 dyoung /* rtifa used to be simply rt->rt_ifa. If rt->rt_ifa != NULL,
936 1.91 dyoung * then rt_get_ifa() != NULL. So this ought to still be safe.
937 1.91 dyoung * --dyoung
938 1.91 dyoung */
939 1.91 dyoung rtifa = rt_get_ifa(rt);
940 1.91 dyoung ifaaddr = rtifa->ifa_addr;
941 1.16 cgd if (rt->rt_ifp->if_flags & IFF_POINTOPOINT)
942 1.91 dyoung brdaddr = rtifa->ifa_dstaddr;
943 1.16 cgd }
944 1.29 chopps if ((error = rt_msg2(RTM_GET, &info, 0, w, &size)))
945 1.95 dyoung return error;
946 1.29 chopps if (w->w_where && w->w_tmem && w->w_needed <= 0) {
947 1.39 augustss struct rt_msghdr *rtm = (struct rt_msghdr *)w->w_tmem;
948 1.10 mycroft
949 1.10 mycroft rtm->rtm_flags = rt->rt_flags;
950 1.10 mycroft rtm->rtm_use = rt->rt_use;
951 1.10 mycroft rtm->rtm_rmx = rt->rt_rmx;
952 1.83 christos KASSERT(rt->rt_ifp != NULL);
953 1.10 mycroft rtm->rtm_index = rt->rt_ifp->if_index;
954 1.10 mycroft rtm->rtm_errno = rtm->rtm_pid = rtm->rtm_seq = 0;
955 1.10 mycroft rtm->rtm_addrs = info.rti_addrs;
956 1.21 christos if ((error = copyout(rtm, w->w_where, size)) != 0)
957 1.10 mycroft w->w_where = NULL;
958 1.10 mycroft else
959 1.93 christos w->w_where = (char *)w->w_where + size;
960 1.10 mycroft }
961 1.95 dyoung return error;
962 1.10 mycroft }
963 1.1 cgd
964 1.40 simonb static int
965 1.69 matt sysctl_iflist(int af, struct walkarg *w, int type)
966 1.10 mycroft {
967 1.39 augustss struct ifnet *ifp;
968 1.39 augustss struct ifaddr *ifa;
969 1.10 mycroft struct rt_addrinfo info;
970 1.10 mycroft int len, error = 0;
971 1.10 mycroft
972 1.48 thorpej memset(&info, 0, sizeof(info));
973 1.74 matt IFNET_FOREACH(ifp) {
974 1.10 mycroft if (w->w_arg && w->w_arg != ifp->if_index)
975 1.10 mycroft continue;
976 1.97 dyoung if (IFADDR_EMPTY(ifp))
977 1.81 rpaulo continue;
978 1.97 dyoung ifpaddr = ifp->if_dl->ifa_addr;
979 1.59 itojun switch (type) {
980 1.32 bouyer case NET_RT_IFLIST:
981 1.32 bouyer error =
982 1.95 dyoung rt_msg2(RTM_IFINFO, &info, NULL, w, &len);
983 1.32 bouyer break;
984 1.32 bouyer #ifdef COMPAT_14
985 1.32 bouyer case NET_RT_OIFLIST:
986 1.32 bouyer error =
987 1.95 dyoung rt_msg2(RTM_OIFINFO, &info, NULL, w, &len);
988 1.32 bouyer break;
989 1.32 bouyer #endif
990 1.32 bouyer default:
991 1.32 bouyer panic("sysctl_iflist(1)");
992 1.32 bouyer }
993 1.32 bouyer if (error)
994 1.95 dyoung return error;
995 1.95 dyoung ifpaddr = NULL;
996 1.29 chopps if (w->w_where && w->w_tmem && w->w_needed <= 0) {
997 1.59 itojun switch (type) {
998 1.32 bouyer case NET_RT_IFLIST: {
999 1.39 augustss struct if_msghdr *ifm;
1000 1.32 bouyer
1001 1.32 bouyer ifm = (struct if_msghdr *)w->w_tmem;
1002 1.32 bouyer ifm->ifm_index = ifp->if_index;
1003 1.32 bouyer ifm->ifm_flags = ifp->if_flags;
1004 1.32 bouyer ifm->ifm_data = ifp->if_data;
1005 1.32 bouyer ifm->ifm_addrs = info.rti_addrs;
1006 1.32 bouyer error = copyout(ifm, w->w_where, len);
1007 1.32 bouyer if (error)
1008 1.95 dyoung return error;
1009 1.93 christos w->w_where = (char *)w->w_where + len;
1010 1.32 bouyer break;
1011 1.32 bouyer }
1012 1.10 mycroft
1013 1.32 bouyer #ifdef COMPAT_14
1014 1.32 bouyer case NET_RT_OIFLIST: {
1015 1.39 augustss struct if_msghdr14 *ifm;
1016 1.32 bouyer
1017 1.32 bouyer ifm = (struct if_msghdr14 *)w->w_tmem;
1018 1.32 bouyer ifm->ifm_index = ifp->if_index;
1019 1.32 bouyer ifm->ifm_flags = ifp->if_flags;
1020 1.32 bouyer ifm->ifm_data.ifi_type = ifp->if_data.ifi_type;
1021 1.32 bouyer ifm->ifm_data.ifi_addrlen =
1022 1.32 bouyer ifp->if_data.ifi_addrlen;
1023 1.32 bouyer ifm->ifm_data.ifi_hdrlen =
1024 1.32 bouyer ifp->if_data.ifi_hdrlen;
1025 1.32 bouyer ifm->ifm_data.ifi_mtu = ifp->if_data.ifi_mtu;
1026 1.32 bouyer ifm->ifm_data.ifi_metric =
1027 1.32 bouyer ifp->if_data.ifi_metric;
1028 1.32 bouyer ifm->ifm_data.ifi_baudrate =
1029 1.32 bouyer ifp->if_data.ifi_baudrate;
1030 1.32 bouyer ifm->ifm_data.ifi_ipackets =
1031 1.32 bouyer ifp->if_data.ifi_ipackets;
1032 1.32 bouyer ifm->ifm_data.ifi_ierrors =
1033 1.32 bouyer ifp->if_data.ifi_ierrors;
1034 1.32 bouyer ifm->ifm_data.ifi_opackets =
1035 1.32 bouyer ifp->if_data.ifi_opackets;
1036 1.32 bouyer ifm->ifm_data.ifi_oerrors =
1037 1.32 bouyer ifp->if_data.ifi_oerrors;
1038 1.32 bouyer ifm->ifm_data.ifi_collisions =
1039 1.32 bouyer ifp->if_data.ifi_collisions;
1040 1.32 bouyer ifm->ifm_data.ifi_ibytes =
1041 1.32 bouyer ifp->if_data.ifi_ibytes;
1042 1.32 bouyer ifm->ifm_data.ifi_obytes =
1043 1.32 bouyer ifp->if_data.ifi_obytes;
1044 1.32 bouyer ifm->ifm_data.ifi_imcasts =
1045 1.32 bouyer ifp->if_data.ifi_imcasts;
1046 1.32 bouyer ifm->ifm_data.ifi_omcasts =
1047 1.32 bouyer ifp->if_data.ifi_omcasts;
1048 1.32 bouyer ifm->ifm_data.ifi_iqdrops =
1049 1.32 bouyer ifp->if_data.ifi_iqdrops;
1050 1.32 bouyer ifm->ifm_data.ifi_noproto =
1051 1.32 bouyer ifp->if_data.ifi_noproto;
1052 1.32 bouyer ifm->ifm_data.ifi_lastchange =
1053 1.32 bouyer ifp->if_data.ifi_lastchange;
1054 1.32 bouyer ifm->ifm_addrs = info.rti_addrs;
1055 1.32 bouyer error = copyout(ifm, w->w_where, len);
1056 1.32 bouyer if (error)
1057 1.95 dyoung return error;
1058 1.93 christos w->w_where = (char *)w->w_where + len;
1059 1.32 bouyer break;
1060 1.32 bouyer }
1061 1.32 bouyer #endif
1062 1.32 bouyer default:
1063 1.32 bouyer panic("sysctl_iflist(2)");
1064 1.32 bouyer }
1065 1.10 mycroft }
1066 1.97 dyoung IFADDR_FOREACH(ifa, ifp) {
1067 1.10 mycroft if (af && af != ifa->ifa_addr->sa_family)
1068 1.10 mycroft continue;
1069 1.10 mycroft ifaaddr = ifa->ifa_addr;
1070 1.10 mycroft netmask = ifa->ifa_netmask;
1071 1.10 mycroft brdaddr = ifa->ifa_dstaddr;
1072 1.29 chopps if ((error = rt_msg2(RTM_NEWADDR, &info, 0, w, &len)))
1073 1.95 dyoung return error;
1074 1.29 chopps if (w->w_where && w->w_tmem && w->w_needed <= 0) {
1075 1.39 augustss struct ifa_msghdr *ifam;
1076 1.10 mycroft
1077 1.10 mycroft ifam = (struct ifa_msghdr *)w->w_tmem;
1078 1.10 mycroft ifam->ifam_index = ifa->ifa_ifp->if_index;
1079 1.10 mycroft ifam->ifam_flags = ifa->ifa_flags;
1080 1.10 mycroft ifam->ifam_metric = ifa->ifa_metric;
1081 1.10 mycroft ifam->ifam_addrs = info.rti_addrs;
1082 1.17 christos error = copyout(w->w_tmem, w->w_where, len);
1083 1.17 christos if (error)
1084 1.95 dyoung return error;
1085 1.93 christos w->w_where = (char *)w->w_where + len;
1086 1.10 mycroft }
1087 1.10 mycroft }
1088 1.95 dyoung ifaaddr = netmask = brdaddr = NULL;
1089 1.10 mycroft }
1090 1.95 dyoung return 0;
1091 1.1 cgd }
1092 1.1 cgd
1093 1.40 simonb static int
1094 1.65 atatat sysctl_rtable(SYSCTLFN_ARGS)
1095 1.1 cgd {
1096 1.65 atatat void *where = oldp;
1097 1.65 atatat size_t *given = oldlenp;
1098 1.65 atatat const void *new = newp;
1099 1.10 mycroft int i, s, error = EINVAL;
1100 1.10 mycroft u_char af;
1101 1.1 cgd struct walkarg w;
1102 1.1 cgd
1103 1.66 atatat if (namelen == 1 && name[0] == CTL_QUERY)
1104 1.95 dyoung return sysctl_query(SYSCTLFN_CALL(rnode));
1105 1.66 atatat
1106 1.10 mycroft if (new)
1107 1.95 dyoung return EPERM;
1108 1.10 mycroft if (namelen != 3)
1109 1.95 dyoung return EINVAL;
1110 1.10 mycroft af = name[0];
1111 1.29 chopps w.w_tmemneeded = 0;
1112 1.29 chopps w.w_tmemsize = 0;
1113 1.29 chopps w.w_tmem = NULL;
1114 1.29 chopps again:
1115 1.29 chopps /* we may return here if a later [re]alloc of the t_mem buffer fails */
1116 1.29 chopps if (w.w_tmemneeded) {
1117 1.93 christos w.w_tmem = (void *) malloc(w.w_tmemneeded, M_RTABLE, M_WAITOK);
1118 1.29 chopps w.w_tmemsize = w.w_tmemneeded;
1119 1.29 chopps w.w_tmemneeded = 0;
1120 1.29 chopps }
1121 1.29 chopps w.w_op = name[1];
1122 1.29 chopps w.w_arg = name[2];
1123 1.10 mycroft w.w_given = *given;
1124 1.1 cgd w.w_needed = 0 - w.w_given;
1125 1.29 chopps w.w_where = where;
1126 1.1 cgd
1127 1.14 mycroft s = splsoftnet();
1128 1.10 mycroft switch (w.w_op) {
1129 1.10 mycroft
1130 1.10 mycroft case NET_RT_DUMP:
1131 1.10 mycroft case NET_RT_FLAGS:
1132 1.10 mycroft for (i = 1; i <= AF_MAX; i++)
1133 1.94 dyoung if ((af == 0 || af == i) &&
1134 1.94 dyoung (error = rt_walktree(i, sysctl_dumpentry, &w)))
1135 1.10 mycroft break;
1136 1.10 mycroft break;
1137 1.10 mycroft
1138 1.32 bouyer #ifdef COMPAT_14
1139 1.32 bouyer case NET_RT_OIFLIST:
1140 1.32 bouyer error = sysctl_iflist(af, &w, w.w_op);
1141 1.32 bouyer break;
1142 1.32 bouyer #endif
1143 1.32 bouyer
1144 1.10 mycroft case NET_RT_IFLIST:
1145 1.32 bouyer error = sysctl_iflist(af, &w, w.w_op);
1146 1.1 cgd }
1147 1.10 mycroft splx(s);
1148 1.29 chopps
1149 1.29 chopps /* check to see if we couldn't allocate memory with NOWAIT */
1150 1.29 chopps if (error == ENOBUFS && w.w_tmem == 0 && w.w_tmemneeded)
1151 1.29 chopps goto again;
1152 1.29 chopps
1153 1.10 mycroft if (w.w_tmem)
1154 1.10 mycroft free(w.w_tmem, M_RTABLE);
1155 1.1 cgd w.w_needed += w.w_given;
1156 1.10 mycroft if (where) {
1157 1.93 christos *given = (char *)w.w_where - (char *)where;
1158 1.10 mycroft if (*given < w.w_needed)
1159 1.95 dyoung return ENOMEM;
1160 1.10 mycroft } else {
1161 1.10 mycroft *given = (11 * w.w_needed) / 10;
1162 1.10 mycroft }
1163 1.95 dyoung return error;
1164 1.1 cgd }
1165 1.1 cgd
1166 1.1 cgd /*
1167 1.99 ad * Routing message software interrupt routine
1168 1.99 ad */
1169 1.99 ad static void
1170 1.99 ad route_intr(void *cookie)
1171 1.99 ad {
1172 1.99 ad struct sockproto proto = { .sp_family = PF_ROUTE, };
1173 1.99 ad struct mbuf *m;
1174 1.99 ad int s;
1175 1.99 ad
1176 1.99 ad while (!IF_IS_EMPTY(&route_intrq)) {
1177 1.99 ad s = splnet();
1178 1.99 ad IF_DEQUEUE(&route_intrq, m);
1179 1.99 ad splx(s);
1180 1.99 ad if (m == NULL)
1181 1.99 ad break;
1182 1.99 ad proto.sp_family = M_GETCTX(m, uintptr_t);
1183 1.99 ad raw_input(m, &proto, &route_src, &route_dst);
1184 1.99 ad }
1185 1.99 ad }
1186 1.99 ad
1187 1.99 ad /*
1188 1.99 ad * Enqueue a message to the software interrupt routine.
1189 1.99 ad */
1190 1.99 ad static void
1191 1.99 ad route_enqueue(struct mbuf *m, int family)
1192 1.99 ad {
1193 1.99 ad int s, wasempty;
1194 1.99 ad
1195 1.99 ad s = splnet();
1196 1.99 ad if (IF_QFULL(&route_intrq)) {
1197 1.99 ad IF_DROP(&route_intrq);
1198 1.99 ad m_freem(m);
1199 1.99 ad } else {
1200 1.99 ad wasempty = IF_IS_EMPTY(&route_intrq);
1201 1.99 ad M_SETCTX(m, (uintptr_t)family);
1202 1.99 ad IF_ENQUEUE(&route_intrq, m);
1203 1.99 ad if (wasempty)
1204 1.99 ad softint_schedule(route_sih);
1205 1.99 ad }
1206 1.99 ad splx(s);
1207 1.99 ad }
1208 1.99 ad
1209 1.99 ad void
1210 1.99 ad rt_init(void)
1211 1.99 ad {
1212 1.99 ad
1213 1.99 ad route_intrq.ifq_maxlen = route_maxqlen;
1214 1.99 ad route_sih = softint_establish(SOFTINT_NET, route_intr, NULL);
1215 1.99 ad }
1216 1.99 ad
1217 1.99 ad /*
1218 1.1 cgd * Definitions of protocols supported in the ROUTE domain.
1219 1.1 cgd */
1220 1.1 cgd
1221 1.70 matt const struct protosw routesw[] = {
1222 1.92 matt {
1223 1.92 matt .pr_type = SOCK_RAW,
1224 1.92 matt .pr_domain = &routedomain,
1225 1.92 matt .pr_flags = PR_ATOMIC|PR_ADDR,
1226 1.92 matt .pr_input = raw_input,
1227 1.92 matt .pr_output = route_output,
1228 1.92 matt .pr_ctlinput = raw_ctlinput,
1229 1.92 matt .pr_usrreq = route_usrreq,
1230 1.92 matt .pr_init = raw_init,
1231 1.92 matt },
1232 1.92 matt };
1233 1.69 matt
1234 1.69 matt struct domain routedomain = {
1235 1.87 christos .dom_family = PF_ROUTE,
1236 1.87 christos .dom_name = "route",
1237 1.87 christos .dom_init = route_init,
1238 1.87 christos .dom_protosw = routesw,
1239 1.95 dyoung .dom_protoswNPROTOSW = &routesw[__arraycount(routesw)],
1240 1.1 cgd };
1241 1.1 cgd
1242 1.65 atatat SYSCTL_SETUP(sysctl_net_route_setup, "sysctl net.route subtree setup")
1243 1.65 atatat {
1244 1.85 elad const struct sysctlnode *rnode = NULL;
1245 1.85 elad
1246 1.67 atatat sysctl_createv(clog, 0, NULL, NULL,
1247 1.67 atatat CTLFLAG_PERMANENT,
1248 1.65 atatat CTLTYPE_NODE, "net", NULL,
1249 1.65 atatat NULL, 0, NULL, 0,
1250 1.65 atatat CTL_NET, CTL_EOL);
1251 1.65 atatat
1252 1.85 elad sysctl_createv(clog, 0, NULL, &rnode,
1253 1.67 atatat CTLFLAG_PERMANENT,
1254 1.71 atatat CTLTYPE_NODE, "route",
1255 1.71 atatat SYSCTL_DESCR("PF_ROUTE information"),
1256 1.65 atatat NULL, 0, NULL, 0,
1257 1.65 atatat CTL_NET, PF_ROUTE, CTL_EOL);
1258 1.67 atatat sysctl_createv(clog, 0, NULL, NULL,
1259 1.67 atatat CTLFLAG_PERMANENT,
1260 1.71 atatat CTLTYPE_NODE, "rtable",
1261 1.71 atatat SYSCTL_DESCR("Routing table information"),
1262 1.65 atatat sysctl_rtable, 0, NULL, 0,
1263 1.65 atatat CTL_NET, PF_ROUTE, 0 /* any protocol */, CTL_EOL);
1264 1.85 elad sysctl_createv(clog, 0, &rnode, NULL,
1265 1.85 elad CTLFLAG_PERMANENT,
1266 1.85 elad CTLTYPE_STRUCT, "stats",
1267 1.85 elad SYSCTL_DESCR("Routing statistics"),
1268 1.85 elad NULL, 0, &rtstat, sizeof(rtstat),
1269 1.85 elad CTL_CREATE, CTL_EOL);
1270 1.65 atatat }
1271