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