if.c revision 1.66 1 1.66 onoe /* $NetBSD: if.c,v 1.66 2000/07/19 06:00:39 onoe Exp $ */
2 1.53 thorpej
3 1.53 thorpej /*-
4 1.53 thorpej * Copyright (c) 1999, 2000 The NetBSD Foundation, Inc.
5 1.53 thorpej * All rights reserved.
6 1.53 thorpej *
7 1.53 thorpej * This code is derived from software contributed to The NetBSD Foundation
8 1.53 thorpej * by William Studnemund and Jason R. Thorpe.
9 1.53 thorpej *
10 1.53 thorpej * Redistribution and use in source and binary forms, with or without
11 1.53 thorpej * modification, are permitted provided that the following conditions
12 1.53 thorpej * are met:
13 1.53 thorpej * 1. Redistributions of source code must retain the above copyright
14 1.53 thorpej * notice, this list of conditions and the following disclaimer.
15 1.53 thorpej * 2. Redistributions in binary form must reproduce the above copyright
16 1.53 thorpej * notice, this list of conditions and the following disclaimer in the
17 1.53 thorpej * documentation and/or other materials provided with the distribution.
18 1.53 thorpej * 3. All advertising materials mentioning features or use of this software
19 1.53 thorpej * must display the following acknowledgement:
20 1.53 thorpej * This product includes software developed by the NetBSD
21 1.53 thorpej * Foundation, Inc. and its contributors.
22 1.53 thorpej * 4. Neither the name of The NetBSD Foundation nor the names of its
23 1.53 thorpej * contributors may be used to endorse or promote products derived
24 1.53 thorpej * from this software without specific prior written permission.
25 1.53 thorpej *
26 1.53 thorpej * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
27 1.53 thorpej * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
28 1.53 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
29 1.53 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
30 1.53 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31 1.53 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32 1.53 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33 1.53 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34 1.53 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35 1.53 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36 1.53 thorpej * POSSIBILITY OF SUCH DAMAGE.
37 1.53 thorpej */
38 1.49 itojun
39 1.49 itojun /*
40 1.49 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
41 1.49 itojun * All rights reserved.
42 1.49 itojun *
43 1.49 itojun * Redistribution and use in source and binary forms, with or without
44 1.49 itojun * modification, are permitted provided that the following conditions
45 1.49 itojun * are met:
46 1.49 itojun * 1. Redistributions of source code must retain the above copyright
47 1.49 itojun * notice, this list of conditions and the following disclaimer.
48 1.49 itojun * 2. Redistributions in binary form must reproduce the above copyright
49 1.49 itojun * notice, this list of conditions and the following disclaimer in the
50 1.49 itojun * documentation and/or other materials provided with the distribution.
51 1.49 itojun * 3. Neither the name of the project nor the names of its contributors
52 1.49 itojun * may be used to endorse or promote products derived from this software
53 1.49 itojun * without specific prior written permission.
54 1.49 itojun *
55 1.49 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
56 1.49 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
57 1.49 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
58 1.49 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
59 1.49 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
60 1.49 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
61 1.49 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
62 1.49 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
63 1.49 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
64 1.49 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
65 1.49 itojun * SUCH DAMAGE.
66 1.49 itojun */
67 1.16 cgd
68 1.1 cgd /*
69 1.15 mycroft * Copyright (c) 1980, 1986, 1993
70 1.15 mycroft * The Regents of the University of California. All rights reserved.
71 1.1 cgd *
72 1.1 cgd * Redistribution and use in source and binary forms, with or without
73 1.1 cgd * modification, are permitted provided that the following conditions
74 1.1 cgd * are met:
75 1.1 cgd * 1. Redistributions of source code must retain the above copyright
76 1.1 cgd * notice, this list of conditions and the following disclaimer.
77 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
78 1.1 cgd * notice, this list of conditions and the following disclaimer in the
79 1.1 cgd * documentation and/or other materials provided with the distribution.
80 1.1 cgd * 3. All advertising materials mentioning features or use of this software
81 1.1 cgd * must display the following acknowledgement:
82 1.1 cgd * This product includes software developed by the University of
83 1.1 cgd * California, Berkeley and its contributors.
84 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
85 1.1 cgd * may be used to endorse or promote products derived from this software
86 1.1 cgd * without specific prior written permission.
87 1.1 cgd *
88 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
89 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
90 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
91 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
92 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
93 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
94 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
95 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
96 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
97 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
98 1.1 cgd * SUCH DAMAGE.
99 1.1 cgd *
100 1.44 fvdl * @(#)if.c 8.5 (Berkeley) 1/9/95
101 1.1 cgd */
102 1.50 thorpej
103 1.50 thorpej #include "opt_inet.h"
104 1.46 thorpej
105 1.46 thorpej #include "opt_compat_linux.h"
106 1.47 thorpej #include "opt_compat_svr4.h"
107 1.48 christos #include "opt_compat_43.h"
108 1.51 bouyer #include "opt_atalk.h"
109 1.1 cgd
110 1.8 mycroft #include <sys/param.h>
111 1.8 mycroft #include <sys/mbuf.h>
112 1.8 mycroft #include <sys/systm.h>
113 1.59 thorpej #include <sys/callout.h>
114 1.15 mycroft #include <sys/proc.h>
115 1.8 mycroft #include <sys/socket.h>
116 1.8 mycroft #include <sys/socketvar.h>
117 1.56 thorpej #include <sys/domain.h>
118 1.8 mycroft #include <sys/protosw.h>
119 1.8 mycroft #include <sys/kernel.h>
120 1.8 mycroft #include <sys/ioctl.h>
121 1.1 cgd
122 1.8 mycroft #include <net/if.h>
123 1.8 mycroft #include <net/if_dl.h>
124 1.66 onoe #include <net/if_ether.h>
125 1.66 onoe #include <net/if_ieee80211.h>
126 1.8 mycroft #include <net/if_types.h>
127 1.24 christos #include <net/radix.h>
128 1.53 thorpej #include <net/route.h>
129 1.51 bouyer #ifdef NETATALK
130 1.51 bouyer #include <netatalk/at_extern.h>
131 1.51 bouyer #include <netatalk/at.h>
132 1.51 bouyer #endif
133 1.1 cgd
134 1.49 itojun #ifdef INET6
135 1.49 itojun /*XXX*/
136 1.49 itojun #include <netinet/in.h>
137 1.49 itojun #endif
138 1.49 itojun
139 1.1 cgd int ifqmaxlen = IFQ_MAXLEN;
140 1.59 thorpej struct callout if_slowtimo_ch;
141 1.59 thorpej
142 1.49 itojun #ifdef INET6
143 1.49 itojun /*
144 1.49 itojun * XXX: declare here to avoid to include many inet6 related files..
145 1.49 itojun * should be more generalized?
146 1.49 itojun */
147 1.49 itojun extern void nd6_setmtu __P((struct ifnet *));
148 1.49 itojun #endif
149 1.49 itojun
150 1.53 thorpej int if_rt_walktree __P((struct radix_node *, void *));
151 1.53 thorpej
152 1.63 thorpej struct if_clone *if_clone_lookup __P((const char *, int *));
153 1.63 thorpej
154 1.63 thorpej LIST_HEAD(, if_clone) if_cloners = LIST_HEAD_INITIALIZER(if_cloners);
155 1.63 thorpej
156 1.1 cgd /*
157 1.1 cgd * Network interface utility routines.
158 1.1 cgd *
159 1.1 cgd * Routines with ifa_ifwith* names take sockaddr *'s as
160 1.1 cgd * parameters.
161 1.1 cgd */
162 1.4 andrew void
163 1.1 cgd ifinit()
164 1.1 cgd {
165 1.1 cgd
166 1.59 thorpej callout_init(&if_slowtimo_ch);
167 1.4 andrew if_slowtimo(NULL);
168 1.1 cgd }
169 1.1 cgd
170 1.53 thorpej /*
171 1.53 thorpej * Null routines used while an interface is going away. These routines
172 1.53 thorpej * just return an error.
173 1.53 thorpej */
174 1.53 thorpej
175 1.53 thorpej int
176 1.53 thorpej if_nulloutput(ifp, m, so, rt)
177 1.53 thorpej struct ifnet *ifp;
178 1.53 thorpej struct mbuf *m;
179 1.53 thorpej struct sockaddr *so;
180 1.53 thorpej struct rtentry *rt;
181 1.53 thorpej {
182 1.53 thorpej
183 1.53 thorpej return (ENXIO);
184 1.53 thorpej }
185 1.53 thorpej
186 1.53 thorpej void
187 1.53 thorpej if_nullinput(ifp, m)
188 1.53 thorpej struct ifnet *ifp;
189 1.53 thorpej struct mbuf *m;
190 1.53 thorpej {
191 1.53 thorpej
192 1.53 thorpej /* Nothing. */
193 1.53 thorpej }
194 1.53 thorpej
195 1.53 thorpej void
196 1.53 thorpej if_nullstart(ifp)
197 1.53 thorpej struct ifnet *ifp;
198 1.53 thorpej {
199 1.53 thorpej
200 1.53 thorpej /* Nothing. */
201 1.53 thorpej }
202 1.53 thorpej
203 1.53 thorpej int
204 1.53 thorpej if_nullioctl(ifp, cmd, data)
205 1.53 thorpej struct ifnet *ifp;
206 1.53 thorpej u_long cmd;
207 1.53 thorpej caddr_t data;
208 1.53 thorpej {
209 1.53 thorpej
210 1.53 thorpej return (ENXIO);
211 1.53 thorpej }
212 1.53 thorpej
213 1.53 thorpej int
214 1.53 thorpej if_nullreset(ifp)
215 1.53 thorpej struct ifnet *ifp;
216 1.53 thorpej {
217 1.53 thorpej
218 1.53 thorpej return (ENXIO);
219 1.53 thorpej }
220 1.53 thorpej
221 1.53 thorpej void
222 1.53 thorpej if_nullwatchdog(ifp)
223 1.53 thorpej struct ifnet *ifp;
224 1.53 thorpej {
225 1.53 thorpej
226 1.53 thorpej /* Nothing. */
227 1.53 thorpej }
228 1.53 thorpej
229 1.53 thorpej void
230 1.53 thorpej if_nulldrain(ifp)
231 1.53 thorpej struct ifnet *ifp;
232 1.53 thorpej {
233 1.53 thorpej
234 1.53 thorpej /* Nothing. */
235 1.53 thorpej }
236 1.53 thorpej
237 1.1 cgd int if_index = 0;
238 1.49 itojun struct ifaddr **ifnet_addrs = NULL;
239 1.49 itojun struct ifnet **ifindex2ifnet = NULL;
240 1.1 cgd
241 1.1 cgd /*
242 1.1 cgd * Attach an interface to the
243 1.1 cgd * list of "active" interfaces.
244 1.1 cgd */
245 1.15 mycroft void
246 1.1 cgd if_attach(ifp)
247 1.1 cgd struct ifnet *ifp;
248 1.1 cgd {
249 1.1 cgd unsigned socksize, ifasize;
250 1.34 thorpej int namelen, masklen;
251 1.61 augustss struct sockaddr_dl *sdl;
252 1.61 augustss struct ifaddr *ifa;
253 1.49 itojun static size_t if_indexlim = 8;
254 1.1 cgd
255 1.22 mycroft if (if_index == 0)
256 1.22 mycroft TAILQ_INIT(&ifnet);
257 1.22 mycroft TAILQ_INIT(&ifp->if_addrlist);
258 1.21 mycroft TAILQ_INSERT_TAIL(&ifnet, ifp, if_list);
259 1.1 cgd ifp->if_index = ++if_index;
260 1.49 itojun
261 1.49 itojun /*
262 1.49 itojun * We have some arrays that should be indexed by if_index.
263 1.49 itojun * since if_index will grow dynamically, they should grow too.
264 1.49 itojun * struct ifadd **ifnet_addrs
265 1.49 itojun * struct ifnet **ifindex2ifnet
266 1.49 itojun */
267 1.53 thorpej if (ifnet_addrs == 0 || ifindex2ifnet == 0 ||
268 1.53 thorpej ifp->if_index >= if_indexlim) {
269 1.49 itojun size_t n;
270 1.49 itojun caddr_t q;
271 1.49 itojun
272 1.53 thorpej while (ifp->if_index >= if_indexlim)
273 1.49 itojun if_indexlim <<= 1;
274 1.49 itojun
275 1.49 itojun /* grow ifnet_addrs */
276 1.49 itojun n = if_indexlim * sizeof(ifa);
277 1.49 itojun q = (caddr_t)malloc(n, M_IFADDR, M_WAITOK);
278 1.49 itojun bzero(q, n);
279 1.1 cgd if (ifnet_addrs) {
280 1.49 itojun bcopy((caddr_t)ifnet_addrs, q, n/2);
281 1.1 cgd free((caddr_t)ifnet_addrs, M_IFADDR);
282 1.1 cgd }
283 1.49 itojun ifnet_addrs = (struct ifaddr **)q;
284 1.49 itojun
285 1.49 itojun /* grow ifindex2ifnet */
286 1.49 itojun n = if_indexlim * sizeof(struct ifnet *);
287 1.49 itojun q = (caddr_t)malloc(n, M_IFADDR, M_WAITOK);
288 1.49 itojun bzero(q, n);
289 1.49 itojun if (ifindex2ifnet) {
290 1.49 itojun bcopy((caddr_t)ifindex2ifnet, q, n/2);
291 1.49 itojun free((caddr_t)ifindex2ifnet, M_IFADDR);
292 1.49 itojun }
293 1.49 itojun ifindex2ifnet = (struct ifnet **)q;
294 1.1 cgd }
295 1.49 itojun
296 1.53 thorpej ifindex2ifnet[ifp->if_index] = ifp;
297 1.49 itojun
298 1.1 cgd /*
299 1.1 cgd * create a Link Level name for this device
300 1.1 cgd */
301 1.34 thorpej namelen = strlen(ifp->if_xname);
302 1.43 thorpej masklen = offsetof(struct sockaddr_dl, sdl_data[0]) + namelen;
303 1.15 mycroft socksize = masklen + ifp->if_addrlen;
304 1.1 cgd #define ROUNDUP(a) (1 + (((a) - 1) | (sizeof(long) - 1)))
305 1.1 cgd if (socksize < sizeof(*sdl))
306 1.1 cgd socksize = sizeof(*sdl);
307 1.20 cgd socksize = ROUNDUP(socksize);
308 1.1 cgd ifasize = sizeof(*ifa) + 2 * socksize;
309 1.1 cgd ifa = (struct ifaddr *)malloc(ifasize, M_IFADDR, M_WAITOK);
310 1.1 cgd bzero((caddr_t)ifa, ifasize);
311 1.1 cgd sdl = (struct sockaddr_dl *)(ifa + 1);
312 1.1 cgd sdl->sdl_len = socksize;
313 1.1 cgd sdl->sdl_family = AF_LINK;
314 1.34 thorpej bcopy(ifp->if_xname, sdl->sdl_data, namelen);
315 1.34 thorpej sdl->sdl_nlen = namelen;
316 1.1 cgd sdl->sdl_index = ifp->if_index;
317 1.15 mycroft sdl->sdl_type = ifp->if_type;
318 1.53 thorpej ifnet_addrs[ifp->if_index] = ifa;
319 1.53 thorpej IFAREF(ifa);
320 1.15 mycroft ifa->ifa_ifp = ifp;
321 1.15 mycroft ifa->ifa_rtrequest = link_rtrequest;
322 1.21 mycroft TAILQ_INSERT_HEAD(&ifp->if_addrlist, ifa, ifa_list);
323 1.53 thorpej IFAREF(ifa);
324 1.15 mycroft ifa->ifa_addr = (struct sockaddr *)sdl;
325 1.38 is ifp->if_sadl = sdl;
326 1.1 cgd sdl = (struct sockaddr_dl *)(socksize + (caddr_t)sdl);
327 1.1 cgd ifa->ifa_netmask = (struct sockaddr *)sdl;
328 1.15 mycroft sdl->sdl_len = masklen;
329 1.1 cgd while (namelen != 0)
330 1.1 cgd sdl->sdl_data[--namelen] = 0xff;
331 1.40 thorpej if (ifp->if_snd.ifq_maxlen == 0)
332 1.40 thorpej ifp->if_snd.ifq_maxlen = ifqmaxlen;
333 1.42 is ifp->if_broadcastaddr = 0; /* reliably crash if used uninitialized */
334 1.57 thorpej
335 1.57 thorpej ifp->if_link_state = LINK_STATE_UNKNOWN;
336 1.57 thorpej
337 1.57 thorpej /* Announce the interface. */
338 1.57 thorpej rt_ifannouncemsg(ifp, IFAN_ARRIVAL);
339 1.1 cgd }
340 1.53 thorpej
341 1.53 thorpej /*
342 1.53 thorpej * Deactivate an interface. This points all of the procedure
343 1.53 thorpej * handles at error stubs. May be called from interrupt context.
344 1.53 thorpej */
345 1.53 thorpej void
346 1.53 thorpej if_deactivate(ifp)
347 1.53 thorpej struct ifnet *ifp;
348 1.53 thorpej {
349 1.53 thorpej int s;
350 1.53 thorpej
351 1.53 thorpej s = splimp();
352 1.53 thorpej
353 1.53 thorpej ifp->if_output = if_nulloutput;
354 1.53 thorpej ifp->if_input = if_nullinput;
355 1.53 thorpej ifp->if_start = if_nullstart;
356 1.53 thorpej ifp->if_ioctl = if_nullioctl;
357 1.53 thorpej ifp->if_reset = if_nullreset;
358 1.53 thorpej ifp->if_watchdog = if_nullwatchdog;
359 1.53 thorpej ifp->if_drain = if_nulldrain;
360 1.53 thorpej
361 1.53 thorpej /* No more packets may be enqueued. */
362 1.53 thorpej ifp->if_snd.ifq_maxlen = 0;
363 1.53 thorpej
364 1.53 thorpej splx(s);
365 1.53 thorpej }
366 1.53 thorpej
367 1.53 thorpej /*
368 1.53 thorpej * Detach an interface from the list of "active" interfaces,
369 1.53 thorpej * freeing any resources as we go along.
370 1.53 thorpej *
371 1.53 thorpej * NOTE: This routine must be called with a valid thread context,
372 1.53 thorpej * as it may block.
373 1.53 thorpej */
374 1.53 thorpej void
375 1.53 thorpej if_detach(ifp)
376 1.53 thorpej struct ifnet *ifp;
377 1.53 thorpej {
378 1.56 thorpej struct socket so;
379 1.53 thorpej struct ifaddr *ifa;
380 1.53 thorpej #ifdef IFAREF_DEBUG
381 1.53 thorpej struct ifaddr *last_ifa = NULL;
382 1.53 thorpej #endif
383 1.56 thorpej struct domain *dp;
384 1.53 thorpej struct protosw *pr;
385 1.53 thorpej struct radix_node_head *rnh;
386 1.56 thorpej int s, i, family, purged;
387 1.53 thorpej
388 1.56 thorpej /*
389 1.56 thorpej * XXX It's kind of lame that we have to have the
390 1.56 thorpej * XXX socket structure...
391 1.56 thorpej */
392 1.56 thorpej memset(&so, 0, sizeof(so));
393 1.53 thorpej
394 1.53 thorpej s = splimp();
395 1.53 thorpej
396 1.53 thorpej /*
397 1.53 thorpej * Do an if_down() to give protocols a chance to do something.
398 1.53 thorpej */
399 1.53 thorpej if_down(ifp);
400 1.53 thorpej
401 1.53 thorpej /*
402 1.53 thorpej * Rip all the addresses off the interface. This should make
403 1.53 thorpej * all of the routes go away.
404 1.53 thorpej */
405 1.53 thorpej while ((ifa = TAILQ_FIRST(&ifp->if_addrlist)) != NULL) {
406 1.56 thorpej family = ifa->ifa_addr->sa_family;
407 1.53 thorpej #ifdef IFAREF_DEBUG
408 1.53 thorpej printf("if_detach: ifaddr %p, family %d, refcnt %d\n",
409 1.56 thorpej ifa, family, ifa->ifa_refcnt);
410 1.53 thorpej if (last_ifa != NULL && ifa == last_ifa)
411 1.56 thorpej panic("if_detach: loop detected");
412 1.53 thorpej last_ifa = ifa;
413 1.53 thorpej #endif
414 1.56 thorpej if (family == AF_LINK) {
415 1.53 thorpej rtinit(ifa, RTM_DELETE, 0);
416 1.53 thorpej TAILQ_REMOVE(&ifp->if_addrlist, ifa, ifa_list);
417 1.53 thorpej IFAFREE(ifa);
418 1.53 thorpej } else {
419 1.56 thorpej dp = pffinddomain(family);
420 1.56 thorpej #ifdef DIAGNOSTIC
421 1.56 thorpej if (dp == NULL)
422 1.56 thorpej panic("if_detach: no domain for AF %d\n",
423 1.56 thorpej family);
424 1.56 thorpej #endif
425 1.56 thorpej purged = 0;
426 1.56 thorpej for (pr = dp->dom_protosw;
427 1.56 thorpej pr < dp->dom_protoswNPROTOSW; pr++) {
428 1.56 thorpej so.so_proto = pr;
429 1.56 thorpej if (pr->pr_usrreq != NULL) {
430 1.56 thorpej (void) (*pr->pr_usrreq)(&so,
431 1.56 thorpej PRU_PURGEIF, NULL, NULL,
432 1.56 thorpej (struct mbuf *) ifp, curproc);
433 1.56 thorpej purged = 1;
434 1.56 thorpej }
435 1.56 thorpej }
436 1.56 thorpej if (purged == 0) {
437 1.56 thorpej /*
438 1.56 thorpej * XXX What's really the best thing to do
439 1.56 thorpej * XXX here? --thorpej (at) netbsd.org
440 1.56 thorpej */
441 1.56 thorpej printf("if_detach: WARNING: AF %d not purged\n",
442 1.56 thorpej family);
443 1.53 thorpej }
444 1.53 thorpej }
445 1.53 thorpej }
446 1.53 thorpej
447 1.53 thorpej /* Walk the routing table looking for straglers. */
448 1.54 thorpej for (i = 0; i <= AF_MAX; i++) {
449 1.54 thorpej if ((rnh = rt_tables[i]) != NULL)
450 1.54 thorpej (void) (*rnh->rnh_walktree)(rnh, if_rt_walktree, ifp);
451 1.53 thorpej }
452 1.53 thorpej
453 1.53 thorpej IFAFREE(ifnet_addrs[ifp->if_index]);
454 1.53 thorpej ifnet_addrs[ifp->if_index] = NULL;
455 1.57 thorpej
456 1.57 thorpej /* Announce that the interface is gone. */
457 1.57 thorpej rt_ifannouncemsg(ifp, IFAN_DEPARTURE);
458 1.53 thorpej
459 1.53 thorpej TAILQ_REMOVE(&ifnet, ifp, if_list);
460 1.53 thorpej
461 1.53 thorpej splx(s);
462 1.53 thorpej }
463 1.53 thorpej
464 1.53 thorpej /*
465 1.53 thorpej * Callback for a radix tree walk to delete all references to an
466 1.53 thorpej * ifnet.
467 1.53 thorpej */
468 1.53 thorpej int
469 1.53 thorpej if_rt_walktree(rn, v)
470 1.53 thorpej struct radix_node *rn;
471 1.53 thorpej void *v;
472 1.53 thorpej {
473 1.55 itojun struct ifnet *ifp = (struct ifnet *)v;
474 1.53 thorpej struct rtentry *rt = (struct rtentry *)rn;
475 1.53 thorpej int error;
476 1.53 thorpej
477 1.53 thorpej if (rt->rt_ifp == ifp) {
478 1.53 thorpej /* Delete the entry. */
479 1.53 thorpej error = rtrequest(RTM_DELETE, rt_key(rt), rt->rt_gateway,
480 1.53 thorpej rt_mask(rt), rt->rt_flags, NULL);
481 1.53 thorpej if (error)
482 1.53 thorpej printf("%s: warning: unable to delete rtentry @ %p, "
483 1.53 thorpej "error = %d\n", ifp->if_xname, rt, error);
484 1.53 thorpej }
485 1.53 thorpej return (0);
486 1.53 thorpej }
487 1.53 thorpej
488 1.1 cgd /*
489 1.63 thorpej * Create a clone network interface.
490 1.63 thorpej */
491 1.63 thorpej int
492 1.63 thorpej if_clone_create(name)
493 1.63 thorpej const char *name;
494 1.63 thorpej {
495 1.63 thorpej struct if_clone *ifc;
496 1.63 thorpej int unit;
497 1.63 thorpej
498 1.63 thorpej ifc = if_clone_lookup(name, &unit);
499 1.63 thorpej if (ifc == NULL)
500 1.63 thorpej return (EINVAL);
501 1.63 thorpej
502 1.63 thorpej if (ifunit(name) != NULL)
503 1.63 thorpej return (EEXIST);
504 1.63 thorpej
505 1.63 thorpej return ((*ifc->ifc_create)(ifc, unit));
506 1.63 thorpej }
507 1.63 thorpej
508 1.63 thorpej /*
509 1.63 thorpej * Destroy a clone network interface.
510 1.63 thorpej */
511 1.63 thorpej int
512 1.63 thorpej if_clone_destroy(name)
513 1.63 thorpej const char *name;
514 1.63 thorpej {
515 1.63 thorpej struct if_clone *ifc;
516 1.63 thorpej struct ifnet *ifp;
517 1.63 thorpej
518 1.63 thorpej ifc = if_clone_lookup(name, NULL);
519 1.63 thorpej if (ifc == NULL)
520 1.63 thorpej return (EINVAL);
521 1.63 thorpej
522 1.63 thorpej ifp = ifunit(name);
523 1.63 thorpej if (ifp == NULL)
524 1.63 thorpej return (ENXIO);
525 1.63 thorpej
526 1.63 thorpej if (ifc->ifc_destroy == NULL)
527 1.63 thorpej return (EOPNOTSUPP);
528 1.63 thorpej
529 1.63 thorpej (*ifc->ifc_destroy)(ifp);
530 1.63 thorpej return (0);
531 1.63 thorpej }
532 1.63 thorpej
533 1.63 thorpej /*
534 1.63 thorpej * Look up a network interface cloner.
535 1.63 thorpej */
536 1.63 thorpej struct if_clone *
537 1.63 thorpej if_clone_lookup(name, unitp)
538 1.63 thorpej const char *name;
539 1.63 thorpej int *unitp;
540 1.63 thorpej {
541 1.63 thorpej struct if_clone *ifc;
542 1.63 thorpej const char *cp;
543 1.63 thorpej int i;
544 1.63 thorpej
545 1.63 thorpej for (ifc = LIST_FIRST(&if_cloners); ifc != NULL;) {
546 1.63 thorpej for (cp = name, i = 0; i < ifc->ifc_namelen; i++, cp++) {
547 1.63 thorpej if (ifc->ifc_name[i] != *cp)
548 1.63 thorpej goto next_ifc;
549 1.63 thorpej }
550 1.63 thorpej goto found_name;
551 1.63 thorpej next_ifc:
552 1.63 thorpej ifc = LIST_NEXT(ifc, ifc_list);
553 1.63 thorpej }
554 1.63 thorpej
555 1.63 thorpej /* No match. */
556 1.63 thorpej return (NULL);
557 1.63 thorpej
558 1.63 thorpej found_name:
559 1.63 thorpej for (i = 0; *cp != '\0'; cp++) {
560 1.63 thorpej if (*cp < '0' || *cp > '9') {
561 1.63 thorpej /* Bogus unit number. */
562 1.63 thorpej return (NULL);
563 1.63 thorpej }
564 1.63 thorpej i = (i * 10) + (*cp - '0');
565 1.63 thorpej }
566 1.63 thorpej
567 1.63 thorpej if (unitp != NULL)
568 1.63 thorpej *unitp = i;
569 1.63 thorpej return (ifc);
570 1.63 thorpej }
571 1.63 thorpej
572 1.63 thorpej /*
573 1.63 thorpej * Register a network interface cloner.
574 1.63 thorpej */
575 1.63 thorpej void
576 1.63 thorpej if_clone_attach(ifc)
577 1.63 thorpej struct if_clone *ifc;
578 1.63 thorpej {
579 1.63 thorpej
580 1.63 thorpej LIST_INSERT_HEAD(&if_cloners, ifc, ifc_list);
581 1.63 thorpej }
582 1.63 thorpej
583 1.63 thorpej /*
584 1.63 thorpej * Unregister a network interface cloner.
585 1.63 thorpej */
586 1.63 thorpej void
587 1.63 thorpej if_clone_detach(ifc)
588 1.63 thorpej struct if_clone *ifc;
589 1.63 thorpej {
590 1.63 thorpej
591 1.63 thorpej LIST_REMOVE(ifc, ifc_list);
592 1.63 thorpej }
593 1.63 thorpej
594 1.63 thorpej /*
595 1.1 cgd * Locate an interface based on a complete address.
596 1.1 cgd */
597 1.1 cgd /*ARGSUSED*/
598 1.1 cgd struct ifaddr *
599 1.1 cgd ifa_ifwithaddr(addr)
600 1.61 augustss struct sockaddr *addr;
601 1.1 cgd {
602 1.61 augustss struct ifnet *ifp;
603 1.61 augustss struct ifaddr *ifa;
604 1.1 cgd
605 1.1 cgd #define equal(a1, a2) \
606 1.1 cgd (bcmp((caddr_t)(a1), (caddr_t)(a2), ((struct sockaddr *)(a1))->sa_len) == 0)
607 1.53 thorpej
608 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
609 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
610 1.53 thorpej if (ifp->if_output == if_nulloutput)
611 1.1 cgd continue;
612 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
613 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list)) {
614 1.53 thorpej if (ifa->ifa_addr->sa_family != addr->sa_family)
615 1.53 thorpej continue;
616 1.53 thorpej if (equal(addr, ifa->ifa_addr))
617 1.53 thorpej return (ifa);
618 1.53 thorpej if ((ifp->if_flags & IFF_BROADCAST) &&
619 1.53 thorpej ifa->ifa_broadaddr &&
620 1.53 thorpej /* IP6 doesn't have broadcast */
621 1.53 thorpej ifa->ifa_broadaddr->sa_len != 0 &&
622 1.53 thorpej equal(ifa->ifa_broadaddr, addr))
623 1.53 thorpej return (ifa);
624 1.53 thorpej }
625 1.1 cgd }
626 1.53 thorpej return (NULL);
627 1.1 cgd }
628 1.49 itojun
629 1.1 cgd /*
630 1.1 cgd * Locate the point to point interface with a given destination address.
631 1.1 cgd */
632 1.1 cgd /*ARGSUSED*/
633 1.1 cgd struct ifaddr *
634 1.1 cgd ifa_ifwithdstaddr(addr)
635 1.61 augustss struct sockaddr *addr;
636 1.1 cgd {
637 1.61 augustss struct ifnet *ifp;
638 1.61 augustss struct ifaddr *ifa;
639 1.1 cgd
640 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
641 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
642 1.53 thorpej if (ifp->if_output == if_nulloutput)
643 1.53 thorpej continue;
644 1.53 thorpej if (ifp->if_flags & IFF_POINTOPOINT) {
645 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
646 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list)) {
647 1.53 thorpej if (ifa->ifa_addr->sa_family !=
648 1.53 thorpej addr->sa_family ||
649 1.53 thorpej ifa->ifa_dstaddr == NULL)
650 1.53 thorpej continue;
651 1.53 thorpej if (equal(addr, ifa->ifa_dstaddr))
652 1.53 thorpej return (ifa);
653 1.53 thorpej }
654 1.53 thorpej }
655 1.1 cgd }
656 1.53 thorpej return (NULL);
657 1.1 cgd }
658 1.1 cgd
659 1.1 cgd /*
660 1.1 cgd * Find an interface on a specific network. If many, choice
661 1.15 mycroft * is most specific found.
662 1.1 cgd */
663 1.1 cgd struct ifaddr *
664 1.1 cgd ifa_ifwithnet(addr)
665 1.1 cgd struct sockaddr *addr;
666 1.1 cgd {
667 1.61 augustss struct ifnet *ifp;
668 1.61 augustss struct ifaddr *ifa;
669 1.61 augustss struct sockaddr_dl *sdl;
670 1.15 mycroft struct ifaddr *ifa_maybe = 0;
671 1.1 cgd u_int af = addr->sa_family;
672 1.15 mycroft char *addr_data = addr->sa_data, *cplim;
673 1.1 cgd
674 1.1 cgd if (af == AF_LINK) {
675 1.53 thorpej sdl = (struct sockaddr_dl *)addr;
676 1.53 thorpej if (sdl->sdl_index && sdl->sdl_index <= if_index &&
677 1.53 thorpej ifindex2ifnet[sdl->sdl_index]->if_output != if_nulloutput)
678 1.53 thorpej return (ifnet_addrs[sdl->sdl_index]);
679 1.1 cgd }
680 1.51 bouyer #ifdef NETATALK
681 1.51 bouyer if (af == AF_APPLETALK) {
682 1.62 bouyer struct sockaddr_at *sat, *sat2;
683 1.62 bouyer sat = (struct sockaddr_at *)addr;
684 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
685 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
686 1.53 thorpej if (ifp->if_output == if_nulloutput)
687 1.53 thorpej continue;
688 1.51 bouyer ifa = at_ifawithnet((struct sockaddr_at *)addr, ifp);
689 1.62 bouyer if (ifa == NULL)
690 1.62 bouyer continue;
691 1.62 bouyer sat2 = (struct sockaddr_at *)ifa->ifa_addr;
692 1.62 bouyer if (sat2->sat_addr.s_net == sat->sat_addr.s_net)
693 1.62 bouyer return (ifa); /* exact match */
694 1.62 bouyer if (ifa_maybe == NULL) {
695 1.62 bouyer /* else keep the if with the rigth range */
696 1.62 bouyer ifa_maybe = ifa;
697 1.62 bouyer }
698 1.51 bouyer }
699 1.62 bouyer return (ifa_maybe);
700 1.51 bouyer }
701 1.51 bouyer #endif
702 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
703 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
704 1.53 thorpej if (ifp->if_output == if_nulloutput)
705 1.53 thorpej continue;
706 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
707 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list)) {
708 1.61 augustss char *cp, *cp2, *cp3;
709 1.15 mycroft
710 1.15 mycroft if (ifa->ifa_addr->sa_family != af ||
711 1.15 mycroft ifa->ifa_netmask == 0)
712 1.53 thorpej next: continue;
713 1.15 mycroft cp = addr_data;
714 1.15 mycroft cp2 = ifa->ifa_addr->sa_data;
715 1.15 mycroft cp3 = ifa->ifa_netmask->sa_data;
716 1.15 mycroft cplim = (char *)ifa->ifa_netmask +
717 1.53 thorpej ifa->ifa_netmask->sa_len;
718 1.53 thorpej while (cp3 < cplim) {
719 1.53 thorpej if ((*cp++ ^ *cp2++) & *cp3++) {
720 1.53 thorpej /* want to continue for() loop */
721 1.32 mrg goto next;
722 1.53 thorpej }
723 1.53 thorpej }
724 1.15 mycroft if (ifa_maybe == 0 ||
725 1.15 mycroft rn_refines((caddr_t)ifa->ifa_netmask,
726 1.15 mycroft (caddr_t)ifa_maybe->ifa_netmask))
727 1.15 mycroft ifa_maybe = ifa;
728 1.15 mycroft }
729 1.53 thorpej }
730 1.15 mycroft return (ifa_maybe);
731 1.26 mrg }
732 1.53 thorpej
733 1.26 mrg /*
734 1.26 mrg * Find the interface of the addresss.
735 1.26 mrg */
736 1.26 mrg struct ifaddr *
737 1.26 mrg ifa_ifwithladdr(addr)
738 1.26 mrg struct sockaddr *addr;
739 1.26 mrg {
740 1.26 mrg struct ifaddr *ia;
741 1.26 mrg
742 1.53 thorpej if ((ia = ifa_ifwithaddr(addr)) || (ia = ifa_ifwithdstaddr(addr)) ||
743 1.53 thorpej (ia = ifa_ifwithnet(addr)))
744 1.26 mrg return (ia);
745 1.26 mrg return (NULL);
746 1.1 cgd }
747 1.1 cgd
748 1.1 cgd /*
749 1.1 cgd * Find an interface using a specific address family
750 1.1 cgd */
751 1.1 cgd struct ifaddr *
752 1.1 cgd ifa_ifwithaf(af)
753 1.61 augustss int af;
754 1.1 cgd {
755 1.61 augustss struct ifnet *ifp;
756 1.61 augustss struct ifaddr *ifa;
757 1.1 cgd
758 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
759 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
760 1.53 thorpej if (ifp->if_output == if_nulloutput)
761 1.53 thorpej continue;
762 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
763 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list)) {
764 1.21 mycroft if (ifa->ifa_addr->sa_family == af)
765 1.21 mycroft return (ifa);
766 1.53 thorpej }
767 1.53 thorpej }
768 1.53 thorpej return (NULL);
769 1.1 cgd }
770 1.1 cgd
771 1.1 cgd /*
772 1.1 cgd * Find an interface address specific to an interface best matching
773 1.1 cgd * a given address.
774 1.1 cgd */
775 1.1 cgd struct ifaddr *
776 1.1 cgd ifaof_ifpforaddr(addr, ifp)
777 1.1 cgd struct sockaddr *addr;
778 1.61 augustss struct ifnet *ifp;
779 1.1 cgd {
780 1.61 augustss struct ifaddr *ifa;
781 1.61 augustss char *cp, *cp2, *cp3;
782 1.61 augustss char *cplim;
783 1.1 cgd struct ifaddr *ifa_maybe = 0;
784 1.1 cgd u_int af = addr->sa_family;
785 1.1 cgd
786 1.53 thorpej if (ifp->if_output == if_nulloutput)
787 1.53 thorpej return (NULL);
788 1.53 thorpej
789 1.1 cgd if (af >= AF_MAX)
790 1.53 thorpej return (NULL);
791 1.53 thorpej
792 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
793 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list)) {
794 1.1 cgd if (ifa->ifa_addr->sa_family != af)
795 1.1 cgd continue;
796 1.1 cgd ifa_maybe = ifa;
797 1.1 cgd if (ifa->ifa_netmask == 0) {
798 1.1 cgd if (equal(addr, ifa->ifa_addr) ||
799 1.53 thorpej (ifa->ifa_dstaddr &&
800 1.53 thorpej equal(addr, ifa->ifa_dstaddr)))
801 1.1 cgd return (ifa);
802 1.1 cgd continue;
803 1.1 cgd }
804 1.1 cgd cp = addr->sa_data;
805 1.1 cgd cp2 = ifa->ifa_addr->sa_data;
806 1.1 cgd cp3 = ifa->ifa_netmask->sa_data;
807 1.1 cgd cplim = ifa->ifa_netmask->sa_len + (char *)ifa->ifa_netmask;
808 1.53 thorpej for (; cp3 < cplim; cp3++) {
809 1.1 cgd if ((*cp++ ^ *cp2++) & *cp3)
810 1.1 cgd break;
811 1.53 thorpej }
812 1.1 cgd if (cp3 == cplim)
813 1.1 cgd return (ifa);
814 1.1 cgd }
815 1.1 cgd return (ifa_maybe);
816 1.1 cgd }
817 1.9 mycroft
818 1.1 cgd /*
819 1.1 cgd * Default action when installing a route with a Link Level gateway.
820 1.1 cgd * Lookup an appropriate real ifa to point to.
821 1.1 cgd * This should be moved to /sys/net/link.c eventually.
822 1.1 cgd */
823 1.15 mycroft void
824 1.1 cgd link_rtrequest(cmd, rt, sa)
825 1.15 mycroft int cmd;
826 1.61 augustss struct rtentry *rt;
827 1.15 mycroft struct sockaddr *sa;
828 1.1 cgd {
829 1.61 augustss struct ifaddr *ifa;
830 1.1 cgd struct sockaddr *dst;
831 1.15 mycroft struct ifnet *ifp;
832 1.1 cgd
833 1.1 cgd if (cmd != RTM_ADD || ((ifa = rt->rt_ifa) == 0) ||
834 1.1 cgd ((ifp = ifa->ifa_ifp) == 0) || ((dst = rt_key(rt)) == 0))
835 1.1 cgd return;
836 1.24 christos if ((ifa = ifaof_ifpforaddr(dst, ifp)) != NULL) {
837 1.15 mycroft IFAFREE(rt->rt_ifa);
838 1.1 cgd rt->rt_ifa = ifa;
839 1.53 thorpej IFAREF(ifa);
840 1.1 cgd if (ifa->ifa_rtrequest && ifa->ifa_rtrequest != link_rtrequest)
841 1.1 cgd ifa->ifa_rtrequest(cmd, rt, sa);
842 1.1 cgd }
843 1.1 cgd }
844 1.1 cgd
845 1.1 cgd /*
846 1.1 cgd * Mark an interface down and notify protocols of
847 1.1 cgd * the transition.
848 1.23 mycroft * NOTE: must be called at splsoftnet or equivalent.
849 1.1 cgd */
850 1.15 mycroft void
851 1.1 cgd if_down(ifp)
852 1.61 augustss struct ifnet *ifp;
853 1.1 cgd {
854 1.61 augustss struct ifaddr *ifa;
855 1.1 cgd
856 1.1 cgd ifp->if_flags &= ~IFF_UP;
857 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
858 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list))
859 1.1 cgd pfctlinput(PRC_IFDOWN, ifa->ifa_addr);
860 1.1 cgd if_qflush(&ifp->if_snd);
861 1.15 mycroft rt_ifmsg(ifp);
862 1.15 mycroft }
863 1.15 mycroft
864 1.15 mycroft /*
865 1.15 mycroft * Mark an interface up and notify protocols of
866 1.15 mycroft * the transition.
867 1.23 mycroft * NOTE: must be called at splsoftnet or equivalent.
868 1.15 mycroft */
869 1.15 mycroft void
870 1.15 mycroft if_up(ifp)
871 1.61 augustss struct ifnet *ifp;
872 1.15 mycroft {
873 1.24 christos #ifdef notyet
874 1.61 augustss struct ifaddr *ifa;
875 1.24 christos #endif
876 1.15 mycroft
877 1.15 mycroft ifp->if_flags |= IFF_UP;
878 1.15 mycroft #ifdef notyet
879 1.15 mycroft /* this has no effect on IP, and will kill all ISO connections XXX */
880 1.53 thorpej for (ifa = TAILQ_FIRST(&ifp->if_addrlist); ifa != NULL;
881 1.53 thorpej ifa = TAILQ_NEXT(ifa, ifa_list))
882 1.15 mycroft pfctlinput(PRC_IFUP, ifa->ifa_addr);
883 1.15 mycroft #endif
884 1.15 mycroft rt_ifmsg(ifp);
885 1.49 itojun #ifdef INET6
886 1.49 itojun in6_if_up(ifp);
887 1.49 itojun #endif
888 1.1 cgd }
889 1.1 cgd
890 1.1 cgd /*
891 1.1 cgd * Flush an interface queue.
892 1.1 cgd */
893 1.15 mycroft void
894 1.1 cgd if_qflush(ifq)
895 1.61 augustss struct ifqueue *ifq;
896 1.1 cgd {
897 1.61 augustss struct mbuf *m, *n;
898 1.1 cgd
899 1.1 cgd n = ifq->ifq_head;
900 1.24 christos while ((m = n) != NULL) {
901 1.1 cgd n = m->m_act;
902 1.1 cgd m_freem(m);
903 1.1 cgd }
904 1.1 cgd ifq->ifq_head = 0;
905 1.1 cgd ifq->ifq_tail = 0;
906 1.1 cgd ifq->ifq_len = 0;
907 1.1 cgd }
908 1.1 cgd
909 1.1 cgd /*
910 1.1 cgd * Handle interface watchdog timer routines. Called
911 1.1 cgd * from softclock, we decrement timers (if set) and
912 1.1 cgd * call the appropriate interface routine on expiration.
913 1.1 cgd */
914 1.4 andrew void
915 1.13 cgd if_slowtimo(arg)
916 1.13 cgd void *arg;
917 1.1 cgd {
918 1.61 augustss struct ifnet *ifp;
919 1.1 cgd int s = splimp();
920 1.1 cgd
921 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
922 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
923 1.1 cgd if (ifp->if_timer == 0 || --ifp->if_timer)
924 1.1 cgd continue;
925 1.1 cgd if (ifp->if_watchdog)
926 1.34 thorpej (*ifp->if_watchdog)(ifp);
927 1.1 cgd }
928 1.1 cgd splx(s);
929 1.59 thorpej callout_reset(&if_slowtimo_ch, hz / IFNET_SLOWHZ,
930 1.59 thorpej if_slowtimo, NULL);
931 1.65 thorpej }
932 1.65 thorpej
933 1.65 thorpej /*
934 1.65 thorpej * Set/clear promiscuous mode on interface ifp based on the truth value
935 1.65 thorpej * of pswitch. The calls are reference counted so that only the first
936 1.65 thorpej * "on" request actually has an effect, as does the final "off" request.
937 1.65 thorpej * Results are undefined if the "off" and "on" requests are not matched.
938 1.65 thorpej */
939 1.65 thorpej int
940 1.65 thorpej ifpromisc(ifp, pswitch)
941 1.65 thorpej struct ifnet *ifp;
942 1.65 thorpej int pswitch;
943 1.65 thorpej {
944 1.65 thorpej int pcount, ret;
945 1.65 thorpej short flags;
946 1.65 thorpej struct ifreq ifr;
947 1.65 thorpej
948 1.65 thorpej pcount = ifp->if_pcount;
949 1.65 thorpej flags = ifp->if_flags;
950 1.65 thorpej if (pswitch) {
951 1.65 thorpej /*
952 1.65 thorpej * If the device is not configured up, we cannot put it in
953 1.65 thorpej * promiscuous mode.
954 1.65 thorpej */
955 1.65 thorpej if ((ifp->if_flags & IFF_UP) == 0)
956 1.65 thorpej return (ENETDOWN);
957 1.65 thorpej if (ifp->if_pcount != 0)
958 1.65 thorpej return (0);
959 1.65 thorpej ifp->if_flags |= IFF_PROMISC;
960 1.65 thorpej } else {
961 1.65 thorpej if (--ifp->if_pcount > 0)
962 1.65 thorpej return (0);
963 1.65 thorpej ifp->if_flags &= ~IFF_PROMISC;
964 1.65 thorpej /*
965 1.65 thorpej * If the device is not configured up, we should not need to
966 1.65 thorpej * turn off promiscuous mode (device should have turned it
967 1.65 thorpej * off when interface went down; and will look at IFF_PROMISC
968 1.65 thorpej * again next time interface comes up).
969 1.65 thorpej */
970 1.65 thorpej if ((ifp->if_flags & IFF_UP) == 0)
971 1.65 thorpej return (0);
972 1.65 thorpej }
973 1.65 thorpej memset(&ifr, 0, sizeof(ifr));
974 1.65 thorpej ifr.ifr_flags = ifp->if_flags;
975 1.65 thorpej ret = (*ifp->if_ioctl)(ifp, SIOCSIFFLAGS, (caddr_t) &ifr);
976 1.65 thorpej /* Restore interface state if not successful. */
977 1.65 thorpej if (ret != 0) {
978 1.65 thorpej ifp->if_pcount = pcount;
979 1.65 thorpej ifp->if_flags = flags;
980 1.65 thorpej }
981 1.65 thorpej return (ret);
982 1.1 cgd }
983 1.1 cgd
984 1.1 cgd /*
985 1.1 cgd * Map interface name to
986 1.1 cgd * interface structure pointer.
987 1.1 cgd */
988 1.1 cgd struct ifnet *
989 1.1 cgd ifunit(name)
990 1.52 thorpej const char *name;
991 1.1 cgd {
992 1.61 augustss struct ifnet *ifp;
993 1.34 thorpej
994 1.53 thorpej for (ifp = TAILQ_FIRST(&ifnet); ifp != NULL;
995 1.53 thorpej ifp = TAILQ_NEXT(ifp, if_list)) {
996 1.53 thorpej if (ifp->if_output == if_nulloutput)
997 1.53 thorpej continue;
998 1.53 thorpej if (strcmp(ifp->if_xname, name) == 0)
999 1.34 thorpej return (ifp);
1000 1.53 thorpej }
1001 1.34 thorpej return (NULL);
1002 1.1 cgd }
1003 1.49 itojun
1004 1.1 cgd /*
1005 1.1 cgd * Interface ioctls.
1006 1.1 cgd */
1007 1.15 mycroft int
1008 1.1 cgd ifioctl(so, cmd, data, p)
1009 1.1 cgd struct socket *so;
1010 1.18 cgd u_long cmd;
1011 1.1 cgd caddr_t data;
1012 1.1 cgd struct proc *p;
1013 1.1 cgd {
1014 1.61 augustss struct ifnet *ifp;
1015 1.61 augustss struct ifreq *ifr;
1016 1.49 itojun int error = 0;
1017 1.49 itojun short oif_flags;
1018 1.1 cgd
1019 1.1 cgd switch (cmd) {
1020 1.1 cgd
1021 1.1 cgd case SIOCGIFCONF:
1022 1.1 cgd case OSIOCGIFCONF:
1023 1.1 cgd return (ifconf(cmd, data));
1024 1.1 cgd }
1025 1.1 cgd ifr = (struct ifreq *)data;
1026 1.63 thorpej
1027 1.63 thorpej switch (cmd) {
1028 1.63 thorpej case SIOCIFCREATE:
1029 1.63 thorpej case SIOCIFDESTROY:
1030 1.64 thorpej if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
1031 1.64 thorpej return (error);
1032 1.64 thorpej return ((cmd == SIOCIFCREATE) ?
1033 1.64 thorpej if_clone_create(ifr->ifr_name) :
1034 1.64 thorpej if_clone_destroy(ifr->ifr_name));
1035 1.63 thorpej }
1036 1.63 thorpej
1037 1.1 cgd ifp = ifunit(ifr->ifr_name);
1038 1.1 cgd if (ifp == 0)
1039 1.1 cgd return (ENXIO);
1040 1.49 itojun oif_flags = ifp->if_flags;
1041 1.1 cgd switch (cmd) {
1042 1.1 cgd
1043 1.1 cgd case SIOCGIFFLAGS:
1044 1.1 cgd ifr->ifr_flags = ifp->if_flags;
1045 1.1 cgd break;
1046 1.1 cgd
1047 1.1 cgd case SIOCGIFMETRIC:
1048 1.1 cgd ifr->ifr_metric = ifp->if_metric;
1049 1.1 cgd break;
1050 1.7 hpeyerl
1051 1.36 mycroft case SIOCGIFMTU:
1052 1.37 cgd ifr->ifr_mtu = ifp->if_mtu;
1053 1.37 cgd break;
1054 1.36 mycroft
1055 1.1 cgd case SIOCSIFFLAGS:
1056 1.24 christos if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
1057 1.1 cgd return (error);
1058 1.1 cgd if (ifp->if_flags & IFF_UP && (ifr->ifr_flags & IFF_UP) == 0) {
1059 1.1 cgd int s = splimp();
1060 1.1 cgd if_down(ifp);
1061 1.1 cgd splx(s);
1062 1.1 cgd }
1063 1.15 mycroft if (ifr->ifr_flags & IFF_UP && (ifp->if_flags & IFF_UP) == 0) {
1064 1.15 mycroft int s = splimp();
1065 1.15 mycroft if_up(ifp);
1066 1.15 mycroft splx(s);
1067 1.15 mycroft }
1068 1.1 cgd ifp->if_flags = (ifp->if_flags & IFF_CANTCHANGE) |
1069 1.1 cgd (ifr->ifr_flags &~ IFF_CANTCHANGE);
1070 1.1 cgd if (ifp->if_ioctl)
1071 1.1 cgd (void) (*ifp->if_ioctl)(ifp, cmd, data);
1072 1.1 cgd break;
1073 1.1 cgd
1074 1.1 cgd case SIOCSIFMETRIC:
1075 1.24 christos if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
1076 1.1 cgd return (error);
1077 1.1 cgd ifp->if_metric = ifr->ifr_metric;
1078 1.5 deraadt break;
1079 1.5 deraadt
1080 1.36 mycroft case SIOCSIFMTU:
1081 1.49 itojun {
1082 1.49 itojun u_long oldmtu = ifp->if_mtu;
1083 1.49 itojun
1084 1.49 itojun error = suser(p->p_ucred, &p->p_acflag);
1085 1.49 itojun if (error)
1086 1.49 itojun return (error);
1087 1.49 itojun if (ifp->if_ioctl == NULL)
1088 1.49 itojun return (EOPNOTSUPP);
1089 1.49 itojun error = (*ifp->if_ioctl)(ifp, cmd, data);
1090 1.49 itojun
1091 1.49 itojun /*
1092 1.49 itojun * If the link MTU changed, do network layer specific procedure.
1093 1.49 itojun */
1094 1.49 itojun if (ifp->if_mtu != oldmtu) {
1095 1.49 itojun #ifdef INET6
1096 1.49 itojun nd6_setmtu(ifp);
1097 1.49 itojun #endif
1098 1.49 itojun }
1099 1.49 itojun break;
1100 1.49 itojun }
1101 1.15 mycroft case SIOCADDMULTI:
1102 1.15 mycroft case SIOCDELMULTI:
1103 1.39 thorpej case SIOCSIFMEDIA:
1104 1.24 christos if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
1105 1.15 mycroft return (error);
1106 1.39 thorpej /* FALLTHROUGH */
1107 1.39 thorpej case SIOCGIFMEDIA:
1108 1.15 mycroft if (ifp->if_ioctl == 0)
1109 1.5 deraadt return (EOPNOTSUPP);
1110 1.49 itojun error = (*ifp->if_ioctl)(ifp, cmd, data);
1111 1.49 itojun break;
1112 1.1 cgd
1113 1.45 kml case SIOCSDRVSPEC:
1114 1.66 onoe case SIOCS80211NWID:
1115 1.45 kml /* XXX: need to pass proc pointer through to driver... */
1116 1.45 kml if ((error = suser(p->p_ucred, &p->p_acflag)) != 0)
1117 1.45 kml return (error);
1118 1.45 kml /* FALLTHROUGH */
1119 1.1 cgd default:
1120 1.1 cgd if (so->so_proto == 0)
1121 1.1 cgd return (EOPNOTSUPP);
1122 1.33 christos #if !defined(COMPAT_43) && !defined(COMPAT_LINUX) && !defined(COMPAT_SVR4)
1123 1.49 itojun error = ((*so->so_proto->pr_usrreq)(so, PRU_CONTROL,
1124 1.36 mycroft (struct mbuf *)cmd, (struct mbuf *)data,
1125 1.36 mycroft (struct mbuf *)ifp, p));
1126 1.1 cgd #else
1127 1.1 cgd {
1128 1.1 cgd int ocmd = cmd;
1129 1.1 cgd
1130 1.1 cgd switch (cmd) {
1131 1.1 cgd
1132 1.28 mycroft case SIOCSIFADDR:
1133 1.1 cgd case SIOCSIFDSTADDR:
1134 1.1 cgd case SIOCSIFBRDADDR:
1135 1.1 cgd case SIOCSIFNETMASK:
1136 1.1 cgd #if BYTE_ORDER != BIG_ENDIAN
1137 1.1 cgd if (ifr->ifr_addr.sa_family == 0 &&
1138 1.1 cgd ifr->ifr_addr.sa_len < 16) {
1139 1.1 cgd ifr->ifr_addr.sa_family = ifr->ifr_addr.sa_len;
1140 1.1 cgd ifr->ifr_addr.sa_len = 16;
1141 1.1 cgd }
1142 1.1 cgd #else
1143 1.1 cgd if (ifr->ifr_addr.sa_len == 0)
1144 1.1 cgd ifr->ifr_addr.sa_len = 16;
1145 1.1 cgd #endif
1146 1.1 cgd break;
1147 1.1 cgd
1148 1.1 cgd case OSIOCGIFADDR:
1149 1.1 cgd cmd = SIOCGIFADDR;
1150 1.1 cgd break;
1151 1.1 cgd
1152 1.1 cgd case OSIOCGIFDSTADDR:
1153 1.1 cgd cmd = SIOCGIFDSTADDR;
1154 1.1 cgd break;
1155 1.1 cgd
1156 1.1 cgd case OSIOCGIFBRDADDR:
1157 1.1 cgd cmd = SIOCGIFBRDADDR;
1158 1.1 cgd break;
1159 1.1 cgd
1160 1.1 cgd case OSIOCGIFNETMASK:
1161 1.1 cgd cmd = SIOCGIFNETMASK;
1162 1.1 cgd }
1163 1.49 itojun
1164 1.24 christos error = ((*so->so_proto->pr_usrreq)(so, PRU_CONTROL,
1165 1.36 mycroft (struct mbuf *)cmd, (struct mbuf *)data,
1166 1.36 mycroft (struct mbuf *)ifp, p));
1167 1.49 itojun
1168 1.1 cgd switch (ocmd) {
1169 1.1 cgd case OSIOCGIFADDR:
1170 1.1 cgd case OSIOCGIFDSTADDR:
1171 1.1 cgd case OSIOCGIFBRDADDR:
1172 1.1 cgd case OSIOCGIFNETMASK:
1173 1.20 cgd *(u_int16_t *)&ifr->ifr_addr = ifr->ifr_addr.sa_family;
1174 1.1 cgd }
1175 1.49 itojun }
1176 1.49 itojun #endif /* COMPAT_43 */
1177 1.49 itojun break;
1178 1.49 itojun }
1179 1.1 cgd
1180 1.49 itojun if (((oif_flags ^ ifp->if_flags) & IFF_UP) != 0) {
1181 1.49 itojun #ifdef INET6
1182 1.49 itojun if ((ifp->if_flags & IFF_UP) != 0) {
1183 1.49 itojun int s = splimp();
1184 1.49 itojun in6_if_up(ifp);
1185 1.49 itojun splx(s);
1186 1.49 itojun }
1187 1.1 cgd #endif
1188 1.1 cgd }
1189 1.49 itojun
1190 1.49 itojun return (error);
1191 1.1 cgd }
1192 1.1 cgd
1193 1.1 cgd /*
1194 1.1 cgd * Return interface configuration
1195 1.1 cgd * of system. List may be used
1196 1.1 cgd * in later ioctl's (above) to get
1197 1.1 cgd * other information.
1198 1.1 cgd */
1199 1.1 cgd /*ARGSUSED*/
1200 1.15 mycroft int
1201 1.1 cgd ifconf(cmd, data)
1202 1.19 mycroft u_long cmd;
1203 1.1 cgd caddr_t data;
1204 1.1 cgd {
1205 1.61 augustss struct ifconf *ifc = (struct ifconf *)data;
1206 1.61 augustss struct ifnet *ifp;
1207 1.61 augustss struct ifaddr *ifa;
1208 1.1 cgd struct ifreq ifr, *ifrp;
1209 1.1 cgd int space = ifc->ifc_len, error = 0;
1210 1.1 cgd
1211 1.1 cgd ifrp = ifc->ifc_req;
1212 1.21 mycroft for (ifp = ifnet.tqh_first;
1213 1.33 christos space >= sizeof (ifr) && ifp != 0; ifp = ifp->if_list.tqe_next) {
1214 1.34 thorpej bcopy(ifp->if_xname, ifr.ifr_name, IFNAMSIZ);
1215 1.21 mycroft if ((ifa = ifp->if_addrlist.tqh_first) == 0) {
1216 1.1 cgd bzero((caddr_t)&ifr.ifr_addr, sizeof(ifr.ifr_addr));
1217 1.15 mycroft error = copyout((caddr_t)&ifr, (caddr_t)ifrp,
1218 1.15 mycroft sizeof(ifr));
1219 1.1 cgd if (error)
1220 1.1 cgd break;
1221 1.1 cgd space -= sizeof (ifr), ifrp++;
1222 1.1 cgd } else
1223 1.33 christos for (; space >= sizeof (ifr) && ifa != 0; ifa = ifa->ifa_list.tqe_next) {
1224 1.61 augustss struct sockaddr *sa = ifa->ifa_addr;
1225 1.33 christos #if defined(COMPAT_43) || defined(COMPAT_LINUX) || defined(COMPAT_SVR4)
1226 1.1 cgd if (cmd == OSIOCGIFCONF) {
1227 1.1 cgd struct osockaddr *osa =
1228 1.1 cgd (struct osockaddr *)&ifr.ifr_addr;
1229 1.1 cgd ifr.ifr_addr = *sa;
1230 1.1 cgd osa->sa_family = sa->sa_family;
1231 1.1 cgd error = copyout((caddr_t)&ifr, (caddr_t)ifrp,
1232 1.1 cgd sizeof (ifr));
1233 1.1 cgd ifrp++;
1234 1.1 cgd } else
1235 1.1 cgd #endif
1236 1.1 cgd if (sa->sa_len <= sizeof(*sa)) {
1237 1.1 cgd ifr.ifr_addr = *sa;
1238 1.1 cgd error = copyout((caddr_t)&ifr, (caddr_t)ifrp,
1239 1.1 cgd sizeof (ifr));
1240 1.1 cgd ifrp++;
1241 1.1 cgd } else {
1242 1.1 cgd space -= sa->sa_len - sizeof(*sa);
1243 1.1 cgd if (space < sizeof (ifr))
1244 1.1 cgd break;
1245 1.1 cgd error = copyout((caddr_t)&ifr, (caddr_t)ifrp,
1246 1.1 cgd sizeof (ifr.ifr_name));
1247 1.1 cgd if (error == 0)
1248 1.1 cgd error = copyout((caddr_t)sa,
1249 1.1 cgd (caddr_t)&ifrp->ifr_addr, sa->sa_len);
1250 1.1 cgd ifrp = (struct ifreq *)
1251 1.1 cgd (sa->sa_len + (caddr_t)&ifrp->ifr_addr);
1252 1.1 cgd }
1253 1.1 cgd if (error)
1254 1.1 cgd break;
1255 1.1 cgd space -= sizeof (ifr);
1256 1.1 cgd }
1257 1.1 cgd }
1258 1.1 cgd ifc->ifc_len -= space;
1259 1.1 cgd return (error);
1260 1.1 cgd }
1261