if.c revision 1.342 1 1.342 ozaki /* $NetBSD: if.c,v 1.342 2016/06/20 06:41:30 ozaki-r Exp $ */
2 1.53 thorpej
3 1.53 thorpej /*-
4 1.219 ad * Copyright (c) 1999, 2000, 2001, 2008 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.150 peter * by William Studenmund 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 *
19 1.53 thorpej * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.53 thorpej * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.53 thorpej * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.53 thorpej * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.53 thorpej * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.53 thorpej * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.53 thorpej * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.53 thorpej * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.53 thorpej * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.53 thorpej * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.53 thorpej * POSSIBILITY OF SUCH DAMAGE.
30 1.53 thorpej */
31 1.49 itojun
32 1.49 itojun /*
33 1.49 itojun * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
34 1.49 itojun * All rights reserved.
35 1.154 perry *
36 1.49 itojun * Redistribution and use in source and binary forms, with or without
37 1.49 itojun * modification, are permitted provided that the following conditions
38 1.49 itojun * are met:
39 1.49 itojun * 1. Redistributions of source code must retain the above copyright
40 1.49 itojun * notice, this list of conditions and the following disclaimer.
41 1.49 itojun * 2. Redistributions in binary form must reproduce the above copyright
42 1.49 itojun * notice, this list of conditions and the following disclaimer in the
43 1.49 itojun * documentation and/or other materials provided with the distribution.
44 1.49 itojun * 3. Neither the name of the project nor the names of its contributors
45 1.49 itojun * may be used to endorse or promote products derived from this software
46 1.49 itojun * without specific prior written permission.
47 1.154 perry *
48 1.49 itojun * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
49 1.49 itojun * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 1.49 itojun * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 1.49 itojun * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
52 1.49 itojun * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 1.49 itojun * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 1.49 itojun * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 1.49 itojun * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 1.49 itojun * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 1.49 itojun * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
58 1.49 itojun * SUCH DAMAGE.
59 1.49 itojun */
60 1.16 cgd
61 1.1 cgd /*
62 1.15 mycroft * Copyright (c) 1980, 1986, 1993
63 1.15 mycroft * The Regents of the University of California. All rights reserved.
64 1.1 cgd *
65 1.1 cgd * Redistribution and use in source and binary forms, with or without
66 1.1 cgd * modification, are permitted provided that the following conditions
67 1.1 cgd * are met:
68 1.1 cgd * 1. Redistributions of source code must retain the above copyright
69 1.1 cgd * notice, this list of conditions and the following disclaimer.
70 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
71 1.1 cgd * notice, this list of conditions and the following disclaimer in the
72 1.1 cgd * documentation and/or other materials provided with the distribution.
73 1.126 agc * 3. Neither the name of the University nor the names of its contributors
74 1.1 cgd * may be used to endorse or promote products derived from this software
75 1.1 cgd * without specific prior written permission.
76 1.1 cgd *
77 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
78 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
79 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
80 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
81 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
82 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
83 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
84 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
85 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
86 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
87 1.1 cgd * SUCH DAMAGE.
88 1.1 cgd *
89 1.44 fvdl * @(#)if.c 8.5 (Berkeley) 1/9/95
90 1.1 cgd */
91 1.99 lukem
92 1.99 lukem #include <sys/cdefs.h>
93 1.342 ozaki __KERNEL_RCSID(0, "$NetBSD: if.c,v 1.342 2016/06/20 06:41:30 ozaki-r Exp $");
94 1.50 thorpej
95 1.308 ozaki #if defined(_KERNEL_OPT)
96 1.50 thorpej #include "opt_inet.h"
97 1.46 thorpej
98 1.51 bouyer #include "opt_atalk.h"
99 1.120 martin #include "opt_natm.h"
100 1.288 ozaki #include "opt_wlan.h"
101 1.308 ozaki #include "opt_net_mpsafe.h"
102 1.308 ozaki #endif
103 1.1 cgd
104 1.8 mycroft #include <sys/param.h>
105 1.8 mycroft #include <sys/mbuf.h>
106 1.8 mycroft #include <sys/systm.h>
107 1.59 thorpej #include <sys/callout.h>
108 1.15 mycroft #include <sys/proc.h>
109 1.8 mycroft #include <sys/socket.h>
110 1.8 mycroft #include <sys/socketvar.h>
111 1.56 thorpej #include <sys/domain.h>
112 1.8 mycroft #include <sys/protosw.h>
113 1.8 mycroft #include <sys/kernel.h>
114 1.8 mycroft #include <sys/ioctl.h>
115 1.133 jonathan #include <sys/sysctl.h>
116 1.159 dyoung #include <sys/syslog.h>
117 1.165 elad #include <sys/kauth.h>
118 1.254 dyoung #include <sys/kmem.h>
119 1.276 rmind #include <sys/xcall.h>
120 1.323 ozaki #include <sys/cpu.h>
121 1.323 ozaki #include <sys/intr.h>
122 1.1 cgd
123 1.8 mycroft #include <net/if.h>
124 1.8 mycroft #include <net/if_dl.h>
125 1.66 onoe #include <net/if_ether.h>
126 1.124 dyoung #include <net/if_media.h>
127 1.132 dyoung #include <net80211/ieee80211.h>
128 1.132 dyoung #include <net80211/ieee80211_ioctl.h>
129 1.8 mycroft #include <net/if_types.h>
130 1.53 thorpej #include <net/route.h>
131 1.95 itojun #include <net/netisr.h>
132 1.262 christos #include <sys/module.h>
133 1.51 bouyer #ifdef NETATALK
134 1.51 bouyer #include <netatalk/at_extern.h>
135 1.51 bouyer #include <netatalk/at.h>
136 1.51 bouyer #endif
137 1.143 itojun #include <net/pfil.h>
138 1.278 he #include <netinet/in.h>
139 1.276 rmind #include <netinet/in_var.h>
140 1.1 cgd
141 1.49 itojun #ifdef INET6
142 1.72 thorpej #include <netinet6/in6_var.h>
143 1.108 itojun #include <netinet6/nd6.h>
144 1.49 itojun #endif
145 1.117 thorpej
146 1.288 ozaki #include "ether.h"
147 1.288 ozaki #include "fddi.h"
148 1.288 ozaki #include "token.h"
149 1.288 ozaki
150 1.166 liamjfoy #include "carp.h"
151 1.166 liamjfoy #if NCARP > 0
152 1.166 liamjfoy #include <netinet/ip_carp.h>
153 1.166 liamjfoy #endif
154 1.166 liamjfoy
155 1.186 christos #include <compat/sys/sockio.h>
156 1.161 christos #include <compat/sys/socket.h>
157 1.161 christos
158 1.117 thorpej MALLOC_DEFINE(M_IFADDR, "ifaddr", "interface address");
159 1.117 thorpej MALLOC_DEFINE(M_IFMADDR, "ether_multi", "link-level multicast address");
160 1.49 itojun
161 1.274 rmind /*
162 1.274 rmind * Global list of interfaces.
163 1.274 rmind */
164 1.334 ozaki /* DEPRECATED. Remove it once kvm(3) users disappeared */
165 1.274 rmind struct ifnet_head ifnet_list;
166 1.334 ozaki
167 1.334 ozaki struct pslist_head ifnet_pslist;
168 1.274 rmind static ifnet_t ** ifindex2ifnet = NULL;
169 1.274 rmind static u_int if_index = 1;
170 1.274 rmind static size_t if_indexlim = 0;
171 1.274 rmind static uint64_t index_gen;
172 1.334 ozaki /* Mutex to protect the above objects. */
173 1.334 ozaki kmutex_t ifnet_mtx __cacheline_aligned;
174 1.334 ozaki struct psref_class *ifnet_psref_class __read_mostly;
175 1.334 ozaki static pserialize_t ifnet_psz;
176 1.334 ozaki
177 1.292 christos static kmutex_t if_clone_mtx;
178 1.274 rmind
179 1.274 rmind struct ifnet *lo0ifp;
180 1.1 cgd int ifqmaxlen = IFQ_MAXLEN;
181 1.104 matt
182 1.192 dyoung static int if_rt_walktree(struct rtentry *, void *);
183 1.53 thorpej
184 1.163 thorpej static struct if_clone *if_clone_lookup(const char *, int *);
185 1.63 thorpej
186 1.163 thorpej static LIST_HEAD(, if_clone) if_cloners = LIST_HEAD_INITIALIZER(if_cloners);
187 1.163 thorpej static int if_cloners_count;
188 1.63 thorpej
189 1.265 rmind /* Packet filtering hook for interfaces. */
190 1.265 rmind pfil_head_t * if_pfil;
191 1.143 itojun
192 1.239 elad static kauth_listener_t if_listener;
193 1.239 elad
194 1.273 pooka static int doifioctl(struct socket *, u_long, void *, struct lwp *);
195 1.163 thorpej static void if_detach_queues(struct ifnet *, struct ifqueue *);
196 1.234 dyoung static void sysctl_sndq_setup(struct sysctllog **, const char *,
197 1.234 dyoung struct ifaltq *);
198 1.294 ozaki static void if_slowtimo(void *);
199 1.300 ozaki static void if_free_sadl(struct ifnet *);
200 1.302 ozaki static void if_attachdomain1(struct ifnet *);
201 1.302 ozaki static int ifconf(u_long, void *);
202 1.302 ozaki static int if_clone_create(const char *);
203 1.302 ozaki static int if_clone_destroy(const char *);
204 1.324 ozaki static void if_link_state_change_si(void *);
205 1.95 itojun
206 1.323 ozaki struct if_percpuq {
207 1.323 ozaki struct ifnet *ipq_ifp;
208 1.323 ozaki void *ipq_si;
209 1.323 ozaki struct percpu *ipq_ifqs; /* struct ifqueue */
210 1.323 ozaki };
211 1.323 ozaki
212 1.323 ozaki static struct mbuf *if_percpuq_dequeue(struct if_percpuq *);
213 1.323 ozaki
214 1.327 knakahar static void if_percpuq_drops(void *, void *, struct cpu_info *);
215 1.327 knakahar static int sysctl_percpuq_drops_handler(SYSCTLFN_PROTO);
216 1.327 knakahar static void sysctl_percpuq_setup(struct sysctllog **, const char *,
217 1.327 knakahar struct if_percpuq *);
218 1.327 knakahar
219 1.240 cegger #if defined(INET) || defined(INET6)
220 1.276 rmind static void sysctl_net_pktq_setup(struct sysctllog **, int);
221 1.240 cegger #endif
222 1.237 pooka
223 1.239 elad static int
224 1.239 elad if_listener_cb(kauth_cred_t cred, kauth_action_t action, void *cookie,
225 1.239 elad void *arg0, void *arg1, void *arg2, void *arg3)
226 1.239 elad {
227 1.239 elad int result;
228 1.239 elad enum kauth_network_req req;
229 1.239 elad
230 1.239 elad result = KAUTH_RESULT_DEFER;
231 1.239 elad req = (enum kauth_network_req)arg1;
232 1.239 elad
233 1.239 elad if (action != KAUTH_NETWORK_INTERFACE)
234 1.239 elad return result;
235 1.239 elad
236 1.239 elad if ((req == KAUTH_REQ_NETWORK_INTERFACE_GET) ||
237 1.239 elad (req == KAUTH_REQ_NETWORK_INTERFACE_SET))
238 1.239 elad result = KAUTH_RESULT_ALLOW;
239 1.239 elad
240 1.239 elad return result;
241 1.239 elad }
242 1.239 elad
243 1.1 cgd /*
244 1.1 cgd * Network interface utility routines.
245 1.1 cgd *
246 1.1 cgd * Routines with ifa_ifwith* names take sockaddr *'s as
247 1.1 cgd * parameters.
248 1.1 cgd */
249 1.4 andrew void
250 1.163 thorpej ifinit(void)
251 1.1 cgd {
252 1.276 rmind #if defined(INET)
253 1.276 rmind sysctl_net_pktq_setup(NULL, PF_INET);
254 1.276 rmind #endif
255 1.237 pooka #ifdef INET6
256 1.311 pooka if (in6_present)
257 1.311 pooka sysctl_net_pktq_setup(NULL, PF_INET6);
258 1.276 rmind #endif
259 1.1 cgd
260 1.239 elad if_listener = kauth_listen_scope(KAUTH_SCOPE_NETWORK,
261 1.239 elad if_listener_cb, NULL);
262 1.273 pooka
263 1.273 pooka /* interfaces are available, inform socket code */
264 1.273 pooka ifioctl = doifioctl;
265 1.227 yamt }
266 1.227 yamt
267 1.227 yamt /*
268 1.227 yamt * XXX Initialization before configure().
269 1.227 yamt * XXX hack to get pfil_add_hook working in autoconf.
270 1.227 yamt */
271 1.227 yamt void
272 1.227 yamt ifinit1(void)
273 1.227 yamt {
274 1.292 christos mutex_init(&if_clone_mtx, MUTEX_DEFAULT, IPL_NONE);
275 1.274 rmind TAILQ_INIT(&ifnet_list);
276 1.334 ozaki mutex_init(&ifnet_mtx, MUTEX_DEFAULT, IPL_NONE);
277 1.334 ozaki ifnet_psz = pserialize_create();
278 1.334 ozaki ifnet_psref_class = psref_class_create("ifnet", IPL_SOFTNET);
279 1.334 ozaki PSLIST_INIT(&ifnet_pslist);
280 1.274 rmind if_indexlim = 8;
281 1.274 rmind
282 1.265 rmind if_pfil = pfil_head_create(PFIL_TYPE_IFNET, NULL);
283 1.265 rmind KASSERT(if_pfil != NULL);
284 1.286 ozaki
285 1.288 ozaki #if NETHER > 0 || NFDDI > 0 || defined(NETATALK) || NTOKEN > 0 || defined(WLAN)
286 1.286 ozaki etherinit();
287 1.288 ozaki #endif
288 1.1 cgd }
289 1.1 cgd
290 1.274 rmind ifnet_t *
291 1.226 christos if_alloc(u_char type)
292 1.226 christos {
293 1.274 rmind return kmem_zalloc(sizeof(ifnet_t), KM_SLEEP);
294 1.226 christos }
295 1.226 christos
296 1.226 christos void
297 1.274 rmind if_free(ifnet_t *ifp)
298 1.251 dyoung {
299 1.274 rmind kmem_free(ifp, sizeof(ifnet_t));
300 1.251 dyoung }
301 1.251 dyoung
302 1.251 dyoung void
303 1.226 christos if_initname(struct ifnet *ifp, const char *name, int unit)
304 1.226 christos {
305 1.226 christos (void)snprintf(ifp->if_xname, sizeof(ifp->if_xname),
306 1.226 christos "%s%d", name, unit);
307 1.226 christos }
308 1.226 christos
309 1.53 thorpej /*
310 1.53 thorpej * Null routines used while an interface is going away. These routines
311 1.53 thorpej * just return an error.
312 1.53 thorpej */
313 1.53 thorpej
314 1.53 thorpej int
315 1.177 christos if_nulloutput(struct ifnet *ifp, struct mbuf *m,
316 1.331 ozaki const struct sockaddr *so, const struct rtentry *rt)
317 1.53 thorpej {
318 1.53 thorpej
319 1.185 dyoung return ENXIO;
320 1.53 thorpej }
321 1.53 thorpej
322 1.53 thorpej void
323 1.177 christos if_nullinput(struct ifnet *ifp, struct mbuf *m)
324 1.53 thorpej {
325 1.53 thorpej
326 1.53 thorpej /* Nothing. */
327 1.53 thorpej }
328 1.53 thorpej
329 1.53 thorpej void
330 1.177 christos if_nullstart(struct ifnet *ifp)
331 1.53 thorpej {
332 1.53 thorpej
333 1.53 thorpej /* Nothing. */
334 1.53 thorpej }
335 1.53 thorpej
336 1.53 thorpej int
337 1.332 knakahar if_nulltransmit(struct ifnet *ifp, struct mbuf *m)
338 1.332 knakahar {
339 1.332 knakahar
340 1.332 knakahar return ENXIO;
341 1.332 knakahar }
342 1.332 knakahar
343 1.332 knakahar int
344 1.183 christos if_nullioctl(struct ifnet *ifp, u_long cmd, void *data)
345 1.53 thorpej {
346 1.53 thorpej
347 1.185 dyoung return ENXIO;
348 1.53 thorpej }
349 1.53 thorpej
350 1.53 thorpej int
351 1.177 christos if_nullinit(struct ifnet *ifp)
352 1.53 thorpej {
353 1.53 thorpej
354 1.185 dyoung return ENXIO;
355 1.53 thorpej }
356 1.53 thorpej
357 1.53 thorpej void
358 1.177 christos if_nullstop(struct ifnet *ifp, int disable)
359 1.75 thorpej {
360 1.75 thorpej
361 1.75 thorpej /* Nothing. */
362 1.75 thorpej }
363 1.75 thorpej
364 1.75 thorpej void
365 1.295 ozaki if_nullslowtimo(struct ifnet *ifp)
366 1.53 thorpej {
367 1.53 thorpej
368 1.53 thorpej /* Nothing. */
369 1.53 thorpej }
370 1.53 thorpej
371 1.53 thorpej void
372 1.177 christos if_nulldrain(struct ifnet *ifp)
373 1.53 thorpej {
374 1.53 thorpej
375 1.53 thorpej /* Nothing. */
376 1.53 thorpej }
377 1.53 thorpej
378 1.210 dyoung void
379 1.231 dyoung if_set_sadl(struct ifnet *ifp, const void *lla, u_char addrlen, bool factory)
380 1.210 dyoung {
381 1.210 dyoung struct ifaddr *ifa;
382 1.210 dyoung struct sockaddr_dl *sdl;
383 1.210 dyoung
384 1.210 dyoung ifp->if_addrlen = addrlen;
385 1.210 dyoung if_alloc_sadl(ifp);
386 1.210 dyoung ifa = ifp->if_dl;
387 1.210 dyoung sdl = satosdl(ifa->ifa_addr);
388 1.210 dyoung
389 1.210 dyoung (void)sockaddr_dl_setaddr(sdl, sdl->sdl_len, lla, ifp->if_addrlen);
390 1.231 dyoung if (factory) {
391 1.231 dyoung ifp->if_hwdl = ifp->if_dl;
392 1.291 rmind ifaref(ifp->if_hwdl);
393 1.231 dyoung }
394 1.223 dyoung /* TBD routing socket */
395 1.210 dyoung }
396 1.210 dyoung
397 1.211 dyoung struct ifaddr *
398 1.211 dyoung if_dl_create(const struct ifnet *ifp, const struct sockaddr_dl **sdlp)
399 1.211 dyoung {
400 1.211 dyoung unsigned socksize, ifasize;
401 1.211 dyoung int addrlen, namelen;
402 1.211 dyoung struct sockaddr_dl *mask, *sdl;
403 1.211 dyoung struct ifaddr *ifa;
404 1.211 dyoung
405 1.211 dyoung namelen = strlen(ifp->if_xname);
406 1.211 dyoung addrlen = ifp->if_addrlen;
407 1.211 dyoung socksize = roundup(sockaddr_dl_measure(namelen, addrlen), sizeof(long));
408 1.211 dyoung ifasize = sizeof(*ifa) + 2 * socksize;
409 1.211 dyoung ifa = (struct ifaddr *)malloc(ifasize, M_IFADDR, M_WAITOK|M_ZERO);
410 1.211 dyoung
411 1.211 dyoung sdl = (struct sockaddr_dl *)(ifa + 1);
412 1.211 dyoung mask = (struct sockaddr_dl *)(socksize + (char *)sdl);
413 1.211 dyoung
414 1.211 dyoung sockaddr_dl_init(sdl, socksize, ifp->if_index, ifp->if_type,
415 1.211 dyoung ifp->if_xname, namelen, NULL, addrlen);
416 1.211 dyoung mask->sdl_len = sockaddr_dl_measure(namelen, 0);
417 1.211 dyoung memset(&mask->sdl_data[0], 0xff, namelen);
418 1.211 dyoung ifa->ifa_rtrequest = link_rtrequest;
419 1.211 dyoung ifa->ifa_addr = (struct sockaddr *)sdl;
420 1.211 dyoung ifa->ifa_netmask = (struct sockaddr *)mask;
421 1.211 dyoung
422 1.211 dyoung *sdlp = sdl;
423 1.211 dyoung
424 1.211 dyoung return ifa;
425 1.211 dyoung }
426 1.211 dyoung
427 1.223 dyoung static void
428 1.223 dyoung if_sadl_setrefs(struct ifnet *ifp, struct ifaddr *ifa)
429 1.223 dyoung {
430 1.223 dyoung const struct sockaddr_dl *sdl;
431 1.316 ozaki
432 1.223 dyoung ifp->if_dl = ifa;
433 1.291 rmind ifaref(ifa);
434 1.223 dyoung sdl = satosdl(ifa->ifa_addr);
435 1.223 dyoung ifp->if_sadl = sdl;
436 1.223 dyoung }
437 1.223 dyoung
438 1.1 cgd /*
439 1.81 thorpej * Allocate the link level name for the specified interface. This
440 1.81 thorpej * is an attachment helper. It must be called after ifp->if_addrlen
441 1.81 thorpej * is initialized, which may not be the case when if_attach() is
442 1.81 thorpej * called.
443 1.81 thorpej */
444 1.81 thorpej void
445 1.81 thorpej if_alloc_sadl(struct ifnet *ifp)
446 1.81 thorpej {
447 1.81 thorpej struct ifaddr *ifa;
448 1.211 dyoung const struct sockaddr_dl *sdl;
449 1.84 thorpej
450 1.84 thorpej /*
451 1.84 thorpej * If the interface already has a link name, release it
452 1.84 thorpej * now. This is useful for interfaces that can change
453 1.84 thorpej * link types, and thus switch link names often.
454 1.84 thorpej */
455 1.84 thorpej if (ifp->if_sadl != NULL)
456 1.84 thorpej if_free_sadl(ifp);
457 1.81 thorpej
458 1.211 dyoung ifa = if_dl_create(ifp, &sdl);
459 1.195 dyoung
460 1.207 dyoung ifa_insert(ifp, ifa);
461 1.223 dyoung if_sadl_setrefs(ifp, ifa);
462 1.223 dyoung }
463 1.223 dyoung
464 1.223 dyoung static void
465 1.223 dyoung if_deactivate_sadl(struct ifnet *ifp)
466 1.223 dyoung {
467 1.223 dyoung struct ifaddr *ifa;
468 1.223 dyoung
469 1.223 dyoung KASSERT(ifp->if_dl != NULL);
470 1.223 dyoung
471 1.223 dyoung ifa = ifp->if_dl;
472 1.223 dyoung
473 1.223 dyoung ifp->if_sadl = NULL;
474 1.223 dyoung
475 1.223 dyoung ifp->if_dl = NULL;
476 1.291 rmind ifafree(ifa);
477 1.223 dyoung }
478 1.223 dyoung
479 1.224 dyoung void
480 1.223 dyoung if_activate_sadl(struct ifnet *ifp, struct ifaddr *ifa,
481 1.223 dyoung const struct sockaddr_dl *sdl)
482 1.223 dyoung {
483 1.223 dyoung int s;
484 1.223 dyoung
485 1.223 dyoung s = splnet();
486 1.223 dyoung
487 1.223 dyoung if_deactivate_sadl(ifp);
488 1.223 dyoung
489 1.223 dyoung if_sadl_setrefs(ifp, ifa);
490 1.231 dyoung IFADDR_FOREACH(ifa, ifp)
491 1.231 dyoung rtinit(ifa, RTM_LLINFO_UPD, 0);
492 1.223 dyoung splx(s);
493 1.81 thorpej }
494 1.81 thorpej
495 1.81 thorpej /*
496 1.81 thorpej * Free the link level name for the specified interface. This is
497 1.300 ozaki * a detach helper. This is called from if_detach().
498 1.81 thorpej */
499 1.300 ozaki static void
500 1.81 thorpej if_free_sadl(struct ifnet *ifp)
501 1.81 thorpej {
502 1.81 thorpej struct ifaddr *ifa;
503 1.81 thorpej int s;
504 1.81 thorpej
505 1.316 ozaki ifa = ifp->if_dl;
506 1.81 thorpej if (ifa == NULL) {
507 1.81 thorpej KASSERT(ifp->if_sadl == NULL);
508 1.81 thorpej return;
509 1.81 thorpej }
510 1.81 thorpej
511 1.81 thorpej KASSERT(ifp->if_sadl != NULL);
512 1.81 thorpej
513 1.88 thorpej s = splnet();
514 1.81 thorpej rtinit(ifa, RTM_DELETE, 0);
515 1.207 dyoung ifa_remove(ifp, ifa);
516 1.223 dyoung if_deactivate_sadl(ifp);
517 1.231 dyoung if (ifp->if_hwdl == ifa) {
518 1.291 rmind ifafree(ifa);
519 1.231 dyoung ifp->if_hwdl = NULL;
520 1.231 dyoung }
521 1.81 thorpej splx(s);
522 1.81 thorpej }
523 1.81 thorpej
524 1.274 rmind static void
525 1.274 rmind if_getindex(ifnet_t *ifp)
526 1.1 cgd {
527 1.274 rmind bool hitlimit = false;
528 1.231 dyoung
529 1.234 dyoung ifp->if_index_gen = index_gen++;
530 1.234 dyoung
531 1.102 atatat ifp->if_index = if_index;
532 1.274 rmind if (ifindex2ifnet == NULL) {
533 1.102 atatat if_index++;
534 1.274 rmind goto skip;
535 1.274 rmind }
536 1.274 rmind while (if_byindex(ifp->if_index)) {
537 1.274 rmind /*
538 1.274 rmind * If we hit USHRT_MAX, we skip back to 0 since
539 1.274 rmind * there are a number of places where the value
540 1.274 rmind * of if_index or if_index itself is compared
541 1.274 rmind * to or stored in an unsigned short. By
542 1.274 rmind * jumping back, we won't botch those assignments
543 1.274 rmind * or comparisons.
544 1.274 rmind */
545 1.274 rmind if (++if_index == 0) {
546 1.274 rmind if_index = 1;
547 1.274 rmind } else if (if_index == USHRT_MAX) {
548 1.102 atatat /*
549 1.274 rmind * However, if we have to jump back to
550 1.274 rmind * zero *twice* without finding an empty
551 1.274 rmind * slot in ifindex2ifnet[], then there
552 1.274 rmind * there are too many (>65535) interfaces.
553 1.102 atatat */
554 1.274 rmind if (hitlimit) {
555 1.274 rmind panic("too many interfaces");
556 1.102 atatat }
557 1.274 rmind hitlimit = true;
558 1.274 rmind if_index = 1;
559 1.102 atatat }
560 1.274 rmind ifp->if_index = if_index;
561 1.274 rmind }
562 1.274 rmind skip:
563 1.49 itojun /*
564 1.316 ozaki * ifindex2ifnet is indexed by if_index. Since if_index will
565 1.316 ozaki * grow dynamically, it should grow too.
566 1.49 itojun */
567 1.316 ozaki if (ifindex2ifnet == NULL || ifp->if_index >= if_indexlim) {
568 1.131 itojun size_t m, n, oldlim;
569 1.183 christos void *q;
570 1.154 perry
571 1.131 itojun oldlim = if_indexlim;
572 1.53 thorpej while (ifp->if_index >= if_indexlim)
573 1.49 itojun if_indexlim <<= 1;
574 1.49 itojun
575 1.49 itojun /* grow ifindex2ifnet */
576 1.131 itojun m = oldlim * sizeof(struct ifnet *);
577 1.49 itojun n = if_indexlim * sizeof(struct ifnet *);
578 1.230 dyoung q = malloc(n, M_IFADDR, M_WAITOK|M_ZERO);
579 1.185 dyoung if (ifindex2ifnet != NULL) {
580 1.230 dyoung memcpy(q, ifindex2ifnet, m);
581 1.230 dyoung free(ifindex2ifnet, M_IFADDR);
582 1.49 itojun }
583 1.49 itojun ifindex2ifnet = (struct ifnet **)q;
584 1.1 cgd }
585 1.274 rmind ifindex2ifnet[ifp->if_index] = ifp;
586 1.274 rmind }
587 1.274 rmind
588 1.274 rmind /*
589 1.307 ozaki * Initialize an interface and assign an index for it.
590 1.307 ozaki *
591 1.307 ozaki * It must be called prior to a device specific attach routine
592 1.307 ozaki * (e.g., ether_ifattach and ieee80211_ifattach) or if_alloc_sadl,
593 1.307 ozaki * and be followed by if_register:
594 1.307 ozaki *
595 1.307 ozaki * if_initialize(ifp);
596 1.307 ozaki * ether_ifattach(ifp, enaddr);
597 1.307 ozaki * if_register(ifp);
598 1.274 rmind */
599 1.274 rmind void
600 1.307 ozaki if_initialize(ifnet_t *ifp)
601 1.274 rmind {
602 1.274 rmind KASSERT(if_indexlim > 0);
603 1.274 rmind TAILQ_INIT(&ifp->if_addrlist);
604 1.49 itojun
605 1.1 cgd /*
606 1.81 thorpej * Link level name is allocated later by a separate call to
607 1.81 thorpej * if_alloc_sadl().
608 1.1 cgd */
609 1.81 thorpej
610 1.40 thorpej if (ifp->if_snd.ifq_maxlen == 0)
611 1.94 itojun ifp->if_snd.ifq_maxlen = ifqmaxlen;
612 1.234 dyoung
613 1.42 is ifp->if_broadcastaddr = 0; /* reliably crash if used uninitialized */
614 1.57 thorpej
615 1.57 thorpej ifp->if_link_state = LINK_STATE_UNKNOWN;
616 1.325 roy ifp->if_link_queue = -1; /* all bits set, see link_state_change() */
617 1.57 thorpej
618 1.89 thorpej ifp->if_capenable = 0;
619 1.97 thorpej ifp->if_csum_flags_tx = 0;
620 1.97 thorpej ifp->if_csum_flags_rx = 0;
621 1.89 thorpej
622 1.86 thorpej #ifdef ALTQ
623 1.86 thorpej ifp->if_snd.altq_type = 0;
624 1.86 thorpej ifp->if_snd.altq_disc = NULL;
625 1.86 thorpej ifp->if_snd.altq_flags &= ALTQF_CANTCHANGE;
626 1.86 thorpej ifp->if_snd.altq_tbr = NULL;
627 1.86 thorpej ifp->if_snd.altq_ifp = ifp;
628 1.86 thorpej #endif
629 1.86 thorpej
630 1.285 ozaki #ifdef NET_MPSAFE
631 1.285 ozaki ifp->if_snd.ifq_lock = mutex_obj_alloc(MUTEX_DEFAULT, IPL_NET);
632 1.285 ozaki #else
633 1.285 ozaki ifp->if_snd.ifq_lock = NULL;
634 1.285 ozaki #endif
635 1.285 ozaki
636 1.265 rmind ifp->if_pfil = pfil_head_create(PFIL_TYPE_IFNET, ifp);
637 1.265 rmind (void)pfil_run_hooks(if_pfil,
638 1.144 yamt (struct mbuf **)PFIL_IFNET_ATTACH, ifp, PFIL_IFNET);
639 1.87 thorpej
640 1.318 ozaki IF_AFDATA_LOCK_INIT(ifp);
641 1.318 ozaki
642 1.324 ozaki ifp->if_link_si = softint_establish(SOFTINT_NET, if_link_state_change_si, ifp);
643 1.324 ozaki if (ifp->if_link_si == NULL)
644 1.324 ozaki panic("%s: softint_establish() failed", __func__);
645 1.324 ozaki
646 1.334 ozaki PSLIST_ENTRY_INIT(ifp, if_pslist_entry);
647 1.334 ozaki psref_target_init(&ifp->if_psref, ifnet_psref_class);
648 1.336 ozaki ifp->if_ioctl_lock = mutex_obj_alloc(MUTEX_DEFAULT, IPL_NONE);
649 1.334 ozaki
650 1.334 ozaki IFNET_LOCK();
651 1.307 ozaki if_getindex(ifp);
652 1.334 ozaki IFNET_UNLOCK();
653 1.307 ozaki }
654 1.307 ozaki
655 1.307 ozaki /*
656 1.307 ozaki * Register an interface to the list of "active" interfaces.
657 1.307 ozaki */
658 1.307 ozaki void
659 1.307 ozaki if_register(ifnet_t *ifp)
660 1.307 ozaki {
661 1.336 ozaki /*
662 1.336 ozaki * If the driver has not supplied its own if_ioctl, then
663 1.336 ozaki * supply the default.
664 1.336 ozaki */
665 1.336 ozaki if (ifp->if_ioctl == NULL)
666 1.336 ozaki ifp->if_ioctl = ifioctl_common;
667 1.307 ozaki
668 1.307 ozaki sysctl_sndq_setup(&ifp->if_sysctl_log, ifp->if_xname, &ifp->if_snd);
669 1.307 ozaki
670 1.152 matt if (!STAILQ_EMPTY(&domains))
671 1.147 tron if_attachdomain1(ifp);
672 1.147 tron
673 1.107 itojun /* Announce the interface. */
674 1.107 itojun rt_ifannouncemsg(ifp, IFAN_ARRIVAL);
675 1.296 ozaki
676 1.296 ozaki if (ifp->if_slowtimo != NULL) {
677 1.297 ozaki ifp->if_slowtimo_ch =
678 1.297 ozaki kmem_zalloc(sizeof(*ifp->if_slowtimo_ch), KM_SLEEP);
679 1.297 ozaki callout_init(ifp->if_slowtimo_ch, 0);
680 1.297 ozaki callout_setfunc(ifp->if_slowtimo_ch, if_slowtimo, ifp);
681 1.296 ozaki if_slowtimo(ifp);
682 1.296 ozaki }
683 1.307 ozaki
684 1.332 knakahar if (ifp->if_transmit == NULL || ifp->if_transmit == if_nulltransmit)
685 1.332 knakahar ifp->if_transmit = if_transmit;
686 1.332 knakahar
687 1.334 ozaki IFNET_LOCK();
688 1.307 ozaki TAILQ_INSERT_TAIL(&ifnet_list, ifp, if_list);
689 1.334 ozaki IFNET_WRITER_INSERT_TAIL(ifp);
690 1.334 ozaki IFNET_UNLOCK();
691 1.307 ozaki }
692 1.307 ozaki
693 1.307 ozaki /*
694 1.323 ozaki * The if_percpuq framework
695 1.323 ozaki *
696 1.323 ozaki * It allows network device drivers to execute the network stack
697 1.323 ozaki * in softint (so called softint-based if_input). It utilizes
698 1.323 ozaki * softint and percpu ifqueue. It doesn't distribute any packets
699 1.323 ozaki * between CPUs, unlike pktqueue(9).
700 1.323 ozaki *
701 1.323 ozaki * Currently we support two options for device drivers to apply the framework:
702 1.323 ozaki * - Use it implicitly with less changes
703 1.323 ozaki * - If you use if_attach in driver's _attach function and if_input in
704 1.323 ozaki * driver's Rx interrupt handler, a packet is queued and a softint handles
705 1.323 ozaki * the packet implicitly
706 1.323 ozaki * - Use it explicitly in each driver (recommended)
707 1.323 ozaki * - You can use if_percpuq_* directly in your driver
708 1.323 ozaki * - In this case, you need to allocate struct if_percpuq in driver's softc
709 1.323 ozaki * - See wm(4) as a reference implementation
710 1.323 ozaki */
711 1.323 ozaki
712 1.323 ozaki static void
713 1.323 ozaki if_percpuq_softint(void *arg)
714 1.323 ozaki {
715 1.323 ozaki struct if_percpuq *ipq = arg;
716 1.323 ozaki struct ifnet *ifp = ipq->ipq_ifp;
717 1.323 ozaki struct mbuf *m;
718 1.323 ozaki
719 1.323 ozaki while ((m = if_percpuq_dequeue(ipq)) != NULL)
720 1.323 ozaki ifp->_if_input(ifp, m);
721 1.323 ozaki }
722 1.323 ozaki
723 1.323 ozaki static void
724 1.323 ozaki if_percpuq_init_ifq(void *p, void *arg __unused, struct cpu_info *ci __unused)
725 1.323 ozaki {
726 1.323 ozaki struct ifqueue *const ifq = p;
727 1.323 ozaki
728 1.323 ozaki memset(ifq, 0, sizeof(*ifq));
729 1.323 ozaki ifq->ifq_maxlen = IFQ_MAXLEN;
730 1.323 ozaki }
731 1.323 ozaki
732 1.323 ozaki struct if_percpuq *
733 1.323 ozaki if_percpuq_create(struct ifnet *ifp)
734 1.323 ozaki {
735 1.323 ozaki struct if_percpuq *ipq;
736 1.323 ozaki
737 1.323 ozaki ipq = kmem_zalloc(sizeof(*ipq), KM_SLEEP);
738 1.323 ozaki if (ipq == NULL)
739 1.323 ozaki panic("kmem_zalloc failed");
740 1.323 ozaki
741 1.323 ozaki ipq->ipq_ifp = ifp;
742 1.323 ozaki ipq->ipq_si = softint_establish(SOFTINT_NET|SOFTINT_MPSAFE,
743 1.323 ozaki if_percpuq_softint, ipq);
744 1.323 ozaki ipq->ipq_ifqs = percpu_alloc(sizeof(struct ifqueue));
745 1.323 ozaki percpu_foreach(ipq->ipq_ifqs, &if_percpuq_init_ifq, NULL);
746 1.323 ozaki
747 1.327 knakahar sysctl_percpuq_setup(&ifp->if_sysctl_log, ifp->if_xname, ipq);
748 1.327 knakahar
749 1.323 ozaki return ipq;
750 1.323 ozaki }
751 1.323 ozaki
752 1.323 ozaki static struct mbuf *
753 1.323 ozaki if_percpuq_dequeue(struct if_percpuq *ipq)
754 1.323 ozaki {
755 1.323 ozaki struct mbuf *m;
756 1.323 ozaki struct ifqueue *ifq;
757 1.323 ozaki int s;
758 1.323 ozaki
759 1.323 ozaki s = splnet();
760 1.323 ozaki ifq = percpu_getref(ipq->ipq_ifqs);
761 1.323 ozaki IF_DEQUEUE(ifq, m);
762 1.323 ozaki percpu_putref(ipq->ipq_ifqs);
763 1.323 ozaki splx(s);
764 1.323 ozaki
765 1.323 ozaki return m;
766 1.323 ozaki }
767 1.323 ozaki
768 1.323 ozaki static void
769 1.323 ozaki if_percpuq_purge_ifq(void *p, void *arg __unused, struct cpu_info *ci __unused)
770 1.323 ozaki {
771 1.323 ozaki struct ifqueue *const ifq = p;
772 1.323 ozaki
773 1.323 ozaki IF_PURGE(ifq);
774 1.323 ozaki }
775 1.323 ozaki
776 1.323 ozaki void
777 1.323 ozaki if_percpuq_destroy(struct if_percpuq *ipq)
778 1.323 ozaki {
779 1.323 ozaki
780 1.323 ozaki /* if_detach may already destroy it */
781 1.323 ozaki if (ipq == NULL)
782 1.323 ozaki return;
783 1.323 ozaki
784 1.323 ozaki softint_disestablish(ipq->ipq_si);
785 1.323 ozaki percpu_foreach(ipq->ipq_ifqs, &if_percpuq_purge_ifq, NULL);
786 1.323 ozaki percpu_free(ipq->ipq_ifqs, sizeof(struct ifqueue));
787 1.323 ozaki }
788 1.323 ozaki
789 1.323 ozaki void
790 1.323 ozaki if_percpuq_enqueue(struct if_percpuq *ipq, struct mbuf *m)
791 1.323 ozaki {
792 1.323 ozaki struct ifqueue *ifq;
793 1.323 ozaki int s;
794 1.323 ozaki
795 1.323 ozaki KASSERT(ipq != NULL);
796 1.323 ozaki
797 1.323 ozaki s = splnet();
798 1.323 ozaki ifq = percpu_getref(ipq->ipq_ifqs);
799 1.323 ozaki if (IF_QFULL(ifq)) {
800 1.323 ozaki IF_DROP(ifq);
801 1.326 ozaki percpu_putref(ipq->ipq_ifqs);
802 1.323 ozaki m_freem(m);
803 1.323 ozaki goto out;
804 1.323 ozaki }
805 1.323 ozaki IF_ENQUEUE(ifq, m);
806 1.323 ozaki percpu_putref(ipq->ipq_ifqs);
807 1.323 ozaki
808 1.323 ozaki softint_schedule(ipq->ipq_si);
809 1.323 ozaki out:
810 1.323 ozaki splx(s);
811 1.323 ozaki }
812 1.323 ozaki
813 1.327 knakahar static void
814 1.327 knakahar if_percpuq_drops(void *p, void *arg, struct cpu_info *ci __unused)
815 1.327 knakahar {
816 1.327 knakahar struct ifqueue *const ifq = p;
817 1.327 knakahar int *sum = arg;
818 1.327 knakahar
819 1.327 knakahar *sum += ifq->ifq_drops;
820 1.327 knakahar }
821 1.327 knakahar
822 1.327 knakahar static int
823 1.327 knakahar sysctl_percpuq_drops_handler(SYSCTLFN_ARGS)
824 1.327 knakahar {
825 1.327 knakahar struct sysctlnode node;
826 1.327 knakahar struct if_percpuq *ipq;
827 1.327 knakahar int sum = 0;
828 1.327 knakahar int error;
829 1.327 knakahar
830 1.327 knakahar node = *rnode;
831 1.327 knakahar ipq = node.sysctl_data;
832 1.327 knakahar
833 1.327 knakahar percpu_foreach(ipq->ipq_ifqs, if_percpuq_drops, &sum);
834 1.327 knakahar
835 1.327 knakahar node.sysctl_data = ∑
836 1.327 knakahar error = sysctl_lookup(SYSCTLFN_CALL(&node));
837 1.327 knakahar if (error != 0 || newp == NULL)
838 1.327 knakahar return error;
839 1.327 knakahar
840 1.327 knakahar return 0;
841 1.327 knakahar }
842 1.327 knakahar
843 1.327 knakahar static void
844 1.327 knakahar sysctl_percpuq_setup(struct sysctllog **clog, const char* ifname,
845 1.327 knakahar struct if_percpuq *ipq)
846 1.327 knakahar {
847 1.327 knakahar const struct sysctlnode *cnode, *rnode;
848 1.327 knakahar
849 1.327 knakahar if (sysctl_createv(clog, 0, NULL, &rnode,
850 1.327 knakahar CTLFLAG_PERMANENT,
851 1.327 knakahar CTLTYPE_NODE, "interfaces",
852 1.327 knakahar SYSCTL_DESCR("Per-interface controls"),
853 1.327 knakahar NULL, 0, NULL, 0,
854 1.327 knakahar CTL_NET, CTL_CREATE, CTL_EOL) != 0)
855 1.327 knakahar goto bad;
856 1.327 knakahar
857 1.327 knakahar if (sysctl_createv(clog, 0, &rnode, &rnode,
858 1.327 knakahar CTLFLAG_PERMANENT,
859 1.327 knakahar CTLTYPE_NODE, ifname,
860 1.327 knakahar SYSCTL_DESCR("Interface controls"),
861 1.327 knakahar NULL, 0, NULL, 0,
862 1.327 knakahar CTL_CREATE, CTL_EOL) != 0)
863 1.327 knakahar goto bad;
864 1.327 knakahar
865 1.327 knakahar if (sysctl_createv(clog, 0, &rnode, &rnode,
866 1.327 knakahar CTLFLAG_PERMANENT,
867 1.327 knakahar CTLTYPE_NODE, "rcvq",
868 1.327 knakahar SYSCTL_DESCR("Interface input queue controls"),
869 1.327 knakahar NULL, 0, NULL, 0,
870 1.327 knakahar CTL_CREATE, CTL_EOL) != 0)
871 1.327 knakahar goto bad;
872 1.327 knakahar
873 1.327 knakahar #ifdef NOTYET
874 1.327 knakahar /* XXX Should show each per-CPU queue length? */
875 1.327 knakahar if (sysctl_createv(clog, 0, &rnode, &rnode,
876 1.327 knakahar CTLFLAG_PERMANENT,
877 1.327 knakahar CTLTYPE_INT, "len",
878 1.327 knakahar SYSCTL_DESCR("Current input queue length"),
879 1.327 knakahar sysctl_percpuq_len, 0, NULL, 0,
880 1.327 knakahar CTL_CREATE, CTL_EOL) != 0)
881 1.327 knakahar goto bad;
882 1.327 knakahar
883 1.327 knakahar if (sysctl_createv(clog, 0, &rnode, &cnode,
884 1.327 knakahar CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
885 1.327 knakahar CTLTYPE_INT, "maxlen",
886 1.327 knakahar SYSCTL_DESCR("Maximum allowed input queue length"),
887 1.327 knakahar sysctl_percpuq_maxlen_handler, 0, (void *)ipq, 0,
888 1.327 knakahar CTL_CREATE, CTL_EOL) != 0)
889 1.327 knakahar goto bad;
890 1.327 knakahar #endif
891 1.327 knakahar
892 1.327 knakahar if (sysctl_createv(clog, 0, &rnode, &cnode,
893 1.327 knakahar CTLFLAG_PERMANENT,
894 1.327 knakahar CTLTYPE_INT, "drops",
895 1.327 knakahar SYSCTL_DESCR("Total packets dropped due to full input queue"),
896 1.327 knakahar sysctl_percpuq_drops_handler, 0, (void *)ipq, 0,
897 1.327 knakahar CTL_CREATE, CTL_EOL) != 0)
898 1.327 knakahar goto bad;
899 1.327 knakahar
900 1.327 knakahar return;
901 1.327 knakahar bad:
902 1.327 knakahar printf("%s: could not attach sysctl nodes\n", ifname);
903 1.327 knakahar return;
904 1.327 knakahar }
905 1.327 knakahar
906 1.327 knakahar
907 1.323 ozaki /*
908 1.323 ozaki * The common interface input routine that is called by device drivers,
909 1.323 ozaki * which should be used only when the driver's rx handler already runs
910 1.323 ozaki * in softint.
911 1.323 ozaki */
912 1.323 ozaki void
913 1.323 ozaki if_input(struct ifnet *ifp, struct mbuf *m)
914 1.323 ozaki {
915 1.323 ozaki
916 1.323 ozaki KASSERT(ifp->if_percpuq == NULL);
917 1.323 ozaki KASSERT(!cpu_intr_p());
918 1.323 ozaki
919 1.323 ozaki ifp->_if_input(ifp, m);
920 1.323 ozaki }
921 1.323 ozaki
922 1.323 ozaki /*
923 1.323 ozaki * DEPRECATED. Use if_initialize and if_register instead.
924 1.307 ozaki * See the above comment of if_initialize.
925 1.323 ozaki *
926 1.323 ozaki * Note that it implicitly enables if_percpuq to make drivers easy to
927 1.333 skrll * migrate softint-based if_input without much changes. If you don't
928 1.323 ozaki * want to enable it, use if_initialize instead.
929 1.307 ozaki */
930 1.307 ozaki void
931 1.307 ozaki if_attach(ifnet_t *ifp)
932 1.307 ozaki {
933 1.323 ozaki
934 1.307 ozaki if_initialize(ifp);
935 1.323 ozaki ifp->if_percpuq = if_percpuq_create(ifp);
936 1.307 ozaki if_register(ifp);
937 1.107 itojun }
938 1.107 itojun
939 1.107 itojun void
940 1.163 thorpej if_attachdomain(void)
941 1.107 itojun {
942 1.107 itojun struct ifnet *ifp;
943 1.110 itojun int s;
944 1.339 ozaki int bound = curlwp_bind();
945 1.107 itojun
946 1.334 ozaki s = pserialize_read_enter();
947 1.334 ozaki IFNET_READER_FOREACH(ifp) {
948 1.334 ozaki struct psref psref;
949 1.334 ozaki psref_acquire(&psref, &ifp->if_psref, ifnet_psref_class);
950 1.334 ozaki pserialize_read_exit(s);
951 1.107 itojun if_attachdomain1(ifp);
952 1.334 ozaki s = pserialize_read_enter();
953 1.334 ozaki psref_release(&psref, &ifp->if_psref, ifnet_psref_class);
954 1.334 ozaki }
955 1.334 ozaki pserialize_read_exit(s);
956 1.339 ozaki curlwp_bindx(bound);
957 1.107 itojun }
958 1.107 itojun
959 1.302 ozaki static void
960 1.163 thorpej if_attachdomain1(struct ifnet *ifp)
961 1.107 itojun {
962 1.107 itojun struct domain *dp;
963 1.109 itojun int s;
964 1.109 itojun
965 1.109 itojun s = splnet();
966 1.107 itojun
967 1.106 itojun /* address family dependent data region */
968 1.106 itojun memset(ifp->if_afdata, 0, sizeof(ifp->if_afdata));
969 1.152 matt DOMAIN_FOREACH(dp) {
970 1.185 dyoung if (dp->dom_ifattach != NULL)
971 1.106 itojun ifp->if_afdata[dp->dom_family] =
972 1.106 itojun (*dp->dom_ifattach)(ifp);
973 1.106 itojun }
974 1.109 itojun
975 1.109 itojun splx(s);
976 1.1 cgd }
977 1.53 thorpej
978 1.53 thorpej /*
979 1.53 thorpej * Deactivate an interface. This points all of the procedure
980 1.53 thorpej * handles at error stubs. May be called from interrupt context.
981 1.53 thorpej */
982 1.53 thorpej void
983 1.163 thorpej if_deactivate(struct ifnet *ifp)
984 1.53 thorpej {
985 1.53 thorpej int s;
986 1.53 thorpej
987 1.88 thorpej s = splnet();
988 1.53 thorpej
989 1.53 thorpej ifp->if_output = if_nulloutput;
990 1.323 ozaki ifp->_if_input = if_nullinput;
991 1.53 thorpej ifp->if_start = if_nullstart;
992 1.332 knakahar ifp->if_transmit = if_nulltransmit;
993 1.53 thorpej ifp->if_ioctl = if_nullioctl;
994 1.75 thorpej ifp->if_init = if_nullinit;
995 1.75 thorpej ifp->if_stop = if_nullstop;
996 1.295 ozaki ifp->if_slowtimo = if_nullslowtimo;
997 1.53 thorpej ifp->if_drain = if_nulldrain;
998 1.53 thorpej
999 1.53 thorpej /* No more packets may be enqueued. */
1000 1.53 thorpej ifp->if_snd.ifq_maxlen = 0;
1001 1.53 thorpej
1002 1.53 thorpej splx(s);
1003 1.53 thorpej }
1004 1.53 thorpej
1005 1.206 dyoung void
1006 1.218 dyoung if_purgeaddrs(struct ifnet *ifp, int family, void (*purgeaddr)(struct ifaddr *))
1007 1.206 dyoung {
1008 1.289 ozaki struct ifaddr *ifa, *nifa;
1009 1.206 dyoung
1010 1.289 ozaki IFADDR_FOREACH_SAFE(ifa, ifp, nifa) {
1011 1.206 dyoung if (ifa->ifa_addr->sa_family != family)
1012 1.206 dyoung continue;
1013 1.206 dyoung (*purgeaddr)(ifa);
1014 1.206 dyoung }
1015 1.206 dyoung }
1016 1.206 dyoung
1017 1.53 thorpej /*
1018 1.53 thorpej * Detach an interface from the list of "active" interfaces,
1019 1.53 thorpej * freeing any resources as we go along.
1020 1.53 thorpej *
1021 1.53 thorpej * NOTE: This routine must be called with a valid thread context,
1022 1.53 thorpej * as it may block.
1023 1.53 thorpej */
1024 1.53 thorpej void
1025 1.163 thorpej if_detach(struct ifnet *ifp)
1026 1.53 thorpej {
1027 1.56 thorpej struct socket so;
1028 1.178 dyoung struct ifaddr *ifa;
1029 1.53 thorpej #ifdef IFAREF_DEBUG
1030 1.53 thorpej struct ifaddr *last_ifa = NULL;
1031 1.53 thorpej #endif
1032 1.56 thorpej struct domain *dp;
1033 1.141 matt const struct protosw *pr;
1034 1.322 riastrad int s, i, family, purged;
1035 1.276 rmind uint64_t xc;
1036 1.53 thorpej
1037 1.56 thorpej /*
1038 1.56 thorpej * XXX It's kind of lame that we have to have the
1039 1.56 thorpej * XXX socket structure...
1040 1.56 thorpej */
1041 1.56 thorpej memset(&so, 0, sizeof(so));
1042 1.53 thorpej
1043 1.88 thorpej s = splnet();
1044 1.53 thorpej
1045 1.334 ozaki sysctl_teardown(&ifp->if_sysctl_log);
1046 1.336 ozaki mutex_enter(ifp->if_ioctl_lock);
1047 1.336 ozaki ifp->if_ioctl = if_nullioctl;
1048 1.336 ozaki mutex_exit(ifp->if_ioctl_lock);
1049 1.334 ozaki
1050 1.334 ozaki IFNET_LOCK();
1051 1.319 ozaki ifindex2ifnet[ifp->if_index] = NULL;
1052 1.319 ozaki TAILQ_REMOVE(&ifnet_list, ifp, if_list);
1053 1.334 ozaki IFNET_WRITER_REMOVE(ifp);
1054 1.334 ozaki pserialize_perform(ifnet_psz);
1055 1.334 ozaki IFNET_UNLOCK();
1056 1.334 ozaki
1057 1.336 ozaki mutex_obj_free(ifp->if_ioctl_lock);
1058 1.336 ozaki ifp->if_ioctl_lock = NULL;
1059 1.336 ozaki
1060 1.296 ozaki if (ifp->if_slowtimo != NULL) {
1061 1.305 martin ifp->if_slowtimo = NULL;
1062 1.297 ozaki callout_halt(ifp->if_slowtimo_ch, NULL);
1063 1.297 ozaki callout_destroy(ifp->if_slowtimo_ch);
1064 1.297 ozaki kmem_free(ifp->if_slowtimo_ch, sizeof(*ifp->if_slowtimo_ch));
1065 1.296 ozaki }
1066 1.296 ozaki
1067 1.53 thorpej /*
1068 1.53 thorpej * Do an if_down() to give protocols a chance to do something.
1069 1.53 thorpej */
1070 1.53 thorpej if_down(ifp);
1071 1.86 thorpej
1072 1.86 thorpej #ifdef ALTQ
1073 1.86 thorpej if (ALTQ_IS_ENABLED(&ifp->if_snd))
1074 1.86 thorpej altq_disable(&ifp->if_snd);
1075 1.86 thorpej if (ALTQ_IS_ATTACHED(&ifp->if_snd))
1076 1.86 thorpej altq_detach(&ifp->if_snd);
1077 1.87 thorpej #endif
1078 1.87 thorpej
1079 1.285 ozaki if (ifp->if_snd.ifq_lock)
1080 1.285 ozaki mutex_obj_free(ifp->if_snd.ifq_lock);
1081 1.285 ozaki
1082 1.166 liamjfoy #if NCARP > 0
1083 1.166 liamjfoy /* Remove the interface from any carp group it is a part of. */
1084 1.185 dyoung if (ifp->if_carp != NULL && ifp->if_type != IFT_CARP)
1085 1.166 liamjfoy carp_ifdetach(ifp);
1086 1.166 liamjfoy #endif
1087 1.166 liamjfoy
1088 1.53 thorpej /*
1089 1.53 thorpej * Rip all the addresses off the interface. This should make
1090 1.53 thorpej * all of the routes go away.
1091 1.178 dyoung *
1092 1.178 dyoung * pr_usrreq calls can remove an arbitrary number of ifaddrs
1093 1.178 dyoung * from the list, including our "cursor", ifa. For safety,
1094 1.178 dyoung * and to honor the TAILQ abstraction, I just restart the
1095 1.178 dyoung * loop after each removal. Note that the loop will exit
1096 1.178 dyoung * when all of the remaining ifaddrs belong to the AF_LINK
1097 1.178 dyoung * family. I am counting on the historical fact that at
1098 1.178 dyoung * least one pr_usrreq in each address domain removes at
1099 1.178 dyoung * least one ifaddr.
1100 1.53 thorpej */
1101 1.178 dyoung again:
1102 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
1103 1.56 thorpej family = ifa->ifa_addr->sa_family;
1104 1.53 thorpej #ifdef IFAREF_DEBUG
1105 1.53 thorpej printf("if_detach: ifaddr %p, family %d, refcnt %d\n",
1106 1.56 thorpej ifa, family, ifa->ifa_refcnt);
1107 1.53 thorpej if (last_ifa != NULL && ifa == last_ifa)
1108 1.56 thorpej panic("if_detach: loop detected");
1109 1.53 thorpej last_ifa = ifa;
1110 1.53 thorpej #endif
1111 1.178 dyoung if (family == AF_LINK)
1112 1.118 itojun continue;
1113 1.118 itojun dp = pffinddomain(family);
1114 1.56 thorpej #ifdef DIAGNOSTIC
1115 1.118 itojun if (dp == NULL)
1116 1.118 itojun panic("if_detach: no domain for AF %d",
1117 1.118 itojun family);
1118 1.56 thorpej #endif
1119 1.160 gdt /*
1120 1.160 gdt * XXX These PURGEIF calls are redundant with the
1121 1.160 gdt * purge-all-families calls below, but are left in for
1122 1.160 gdt * now both to make a smaller change, and to avoid
1123 1.160 gdt * unplanned interactions with clearing of
1124 1.160 gdt * ifp->if_addrlist.
1125 1.160 gdt */
1126 1.118 itojun purged = 0;
1127 1.322 riastrad for (pr = dp->dom_protosw;
1128 1.322 riastrad pr < dp->dom_protoswNPROTOSW; pr++) {
1129 1.118 itojun so.so_proto = pr;
1130 1.275 rmind if (pr->pr_usrreqs) {
1131 1.290 rtr (void) (*pr->pr_usrreqs->pr_purgeif)(&so, ifp);
1132 1.118 itojun purged = 1;
1133 1.53 thorpej }
1134 1.118 itojun }
1135 1.118 itojun if (purged == 0) {
1136 1.118 itojun /*
1137 1.118 itojun * XXX What's really the best thing to do
1138 1.135 keihan * XXX here? --thorpej (at) NetBSD.org
1139 1.118 itojun */
1140 1.118 itojun printf("if_detach: WARNING: AF %d not purged\n",
1141 1.118 itojun family);
1142 1.207 dyoung ifa_remove(ifp, ifa);
1143 1.53 thorpej }
1144 1.178 dyoung goto again;
1145 1.53 thorpej }
1146 1.118 itojun
1147 1.118 itojun if_free_sadl(ifp);
1148 1.53 thorpej
1149 1.180 dyoung /* Walk the routing table looking for stragglers. */
1150 1.243 dyoung for (i = 0; i <= AF_MAX; i++) {
1151 1.243 dyoung while (rt_walktree(i, if_rt_walktree, ifp) == ERESTART)
1152 1.260 christos continue;
1153 1.243 dyoung }
1154 1.106 itojun
1155 1.152 matt DOMAIN_FOREACH(dp) {
1156 1.185 dyoung if (dp->dom_ifdetach != NULL && ifp->if_afdata[dp->dom_family])
1157 1.260 christos {
1158 1.260 christos void *p = ifp->if_afdata[dp->dom_family];
1159 1.260 christos if (p) {
1160 1.260 christos ifp->if_afdata[dp->dom_family] = NULL;
1161 1.260 christos (*dp->dom_ifdetach)(ifp, p);
1162 1.260 christos }
1163 1.260 christos }
1164 1.160 gdt
1165 1.160 gdt /*
1166 1.160 gdt * One would expect multicast memberships (INET and
1167 1.160 gdt * INET6) on UDP sockets to be purged by the PURGEIF
1168 1.160 gdt * calls above, but if all addresses were removed from
1169 1.160 gdt * the interface prior to destruction, the calls will
1170 1.160 gdt * not be made (e.g. ppp, for which pppd(8) generally
1171 1.160 gdt * removes addresses before destroying the interface).
1172 1.160 gdt * Because there is no invariant that multicast
1173 1.160 gdt * memberships only exist for interfaces with IPv4
1174 1.160 gdt * addresses, we must call PURGEIF regardless of
1175 1.160 gdt * addresses. (Protocols which might store ifnet
1176 1.160 gdt * pointers are marked with PR_PURGEIF.)
1177 1.160 gdt */
1178 1.185 dyoung for (pr = dp->dom_protosw; pr < dp->dom_protoswNPROTOSW; pr++) {
1179 1.160 gdt so.so_proto = pr;
1180 1.275 rmind if (pr->pr_usrreqs && pr->pr_flags & PR_PURGEIF)
1181 1.290 rtr (void)(*pr->pr_usrreqs->pr_purgeif)(&so, ifp);
1182 1.160 gdt }
1183 1.53 thorpej }
1184 1.57 thorpej
1185 1.265 rmind (void)pfil_run_hooks(if_pfil,
1186 1.184 dyoung (struct mbuf **)PFIL_IFNET_DETACH, ifp, PFIL_IFNET);
1187 1.265 rmind (void)pfil_head_destroy(ifp->if_pfil);
1188 1.184 dyoung
1189 1.57 thorpej /* Announce that the interface is gone. */
1190 1.57 thorpej rt_ifannouncemsg(ifp, IFAN_DEPARTURE);
1191 1.93 itojun
1192 1.320 ozaki IF_AFDATA_LOCK_DESTROY(ifp);
1193 1.320 ozaki
1194 1.324 ozaki softint_disestablish(ifp->if_link_si);
1195 1.324 ozaki ifp->if_link_si = NULL;
1196 1.324 ozaki
1197 1.95 itojun /*
1198 1.168 matt * remove packets that came from ifp, from software interrupt queues.
1199 1.95 itojun */
1200 1.168 matt DOMAIN_FOREACH(dp) {
1201 1.168 matt for (i = 0; i < __arraycount(dp->dom_ifqueues); i++) {
1202 1.260 christos struct ifqueue *iq = dp->dom_ifqueues[i];
1203 1.260 christos if (iq == NULL)
1204 1.168 matt break;
1205 1.260 christos dp->dom_ifqueues[i] = NULL;
1206 1.260 christos if_detach_queues(ifp, iq);
1207 1.168 matt }
1208 1.168 matt }
1209 1.95 itojun
1210 1.276 rmind /*
1211 1.276 rmind * IP queues have to be processed separately: net-queue barrier
1212 1.276 rmind * ensures that the packets are dequeued while a cross-call will
1213 1.276 rmind * ensure that the interrupts have completed. FIXME: not quite..
1214 1.276 rmind */
1215 1.278 he #ifdef INET
1216 1.276 rmind pktq_barrier(ip_pktq);
1217 1.278 he #endif
1218 1.281 rmind #ifdef INET6
1219 1.293 pooka if (in6_present)
1220 1.293 pooka pktq_barrier(ip6_pktq);
1221 1.281 rmind #endif
1222 1.276 rmind xc = xc_broadcast(0, (xcfunc_t)nullop, NULL, NULL);
1223 1.276 rmind xc_wait(xc);
1224 1.276 rmind
1225 1.342 ozaki /* Wait for all readers to drain before freeing. */
1226 1.342 ozaki psref_target_destroy(&ifp->if_psref, ifnet_psref_class);
1227 1.342 ozaki PSLIST_ENTRY_DESTROY(ifp, if_pslist_entry);
1228 1.342 ozaki
1229 1.323 ozaki if (ifp->if_percpuq != NULL) {
1230 1.323 ozaki if_percpuq_destroy(ifp->if_percpuq);
1231 1.323 ozaki ifp->if_percpuq = NULL;
1232 1.323 ozaki }
1233 1.323 ozaki
1234 1.53 thorpej splx(s);
1235 1.95 itojun }
1236 1.95 itojun
1237 1.95 itojun static void
1238 1.163 thorpej if_detach_queues(struct ifnet *ifp, struct ifqueue *q)
1239 1.95 itojun {
1240 1.95 itojun struct mbuf *m, *prev, *next;
1241 1.95 itojun
1242 1.95 itojun prev = NULL;
1243 1.185 dyoung for (m = q->ifq_head; m != NULL; m = next) {
1244 1.274 rmind KASSERT((m->m_flags & M_PKTHDR) != 0);
1245 1.274 rmind
1246 1.95 itojun next = m->m_nextpkt;
1247 1.338 ozaki if (m->m_pkthdr.rcvif_index != ifp->if_index) {
1248 1.96 itojun prev = m;
1249 1.95 itojun continue;
1250 1.96 itojun }
1251 1.95 itojun
1252 1.185 dyoung if (prev != NULL)
1253 1.95 itojun prev->m_nextpkt = m->m_nextpkt;
1254 1.95 itojun else
1255 1.95 itojun q->ifq_head = m->m_nextpkt;
1256 1.95 itojun if (q->ifq_tail == m)
1257 1.95 itojun q->ifq_tail = prev;
1258 1.95 itojun q->ifq_len--;
1259 1.95 itojun
1260 1.95 itojun m->m_nextpkt = NULL;
1261 1.95 itojun m_freem(m);
1262 1.95 itojun IF_DROP(q);
1263 1.95 itojun }
1264 1.53 thorpej }
1265 1.53 thorpej
1266 1.53 thorpej /*
1267 1.53 thorpej * Callback for a radix tree walk to delete all references to an
1268 1.53 thorpej * ifnet.
1269 1.53 thorpej */
1270 1.163 thorpej static int
1271 1.192 dyoung if_rt_walktree(struct rtentry *rt, void *v)
1272 1.53 thorpej {
1273 1.55 itojun struct ifnet *ifp = (struct ifnet *)v;
1274 1.53 thorpej int error;
1275 1.317 ozaki struct rtentry *retrt;
1276 1.53 thorpej
1277 1.185 dyoung if (rt->rt_ifp != ifp)
1278 1.185 dyoung return 0;
1279 1.185 dyoung
1280 1.185 dyoung /* Delete the entry. */
1281 1.194 dyoung error = rtrequest(RTM_DELETE, rt_getkey(rt), rt->rt_gateway,
1282 1.317 ozaki rt_mask(rt), rt->rt_flags, &retrt);
1283 1.317 ozaki if (error == 0) {
1284 1.317 ozaki KASSERT(retrt == rt);
1285 1.317 ozaki KASSERT((retrt->rt_flags & RTF_UP) == 0);
1286 1.317 ozaki retrt->rt_ifp = NULL;
1287 1.317 ozaki rtfree(retrt);
1288 1.317 ozaki } else {
1289 1.185 dyoung printf("%s: warning: unable to delete rtentry @ %p, "
1290 1.185 dyoung "error = %d\n", ifp->if_xname, rt, error);
1291 1.317 ozaki }
1292 1.243 dyoung return ERESTART;
1293 1.53 thorpej }
1294 1.53 thorpej
1295 1.1 cgd /*
1296 1.63 thorpej * Create a clone network interface.
1297 1.63 thorpej */
1298 1.302 ozaki static int
1299 1.163 thorpej if_clone_create(const char *name)
1300 1.63 thorpej {
1301 1.63 thorpej struct if_clone *ifc;
1302 1.63 thorpej int unit;
1303 1.336 ozaki struct ifnet *ifp;
1304 1.336 ozaki struct psref psref;
1305 1.63 thorpej
1306 1.63 thorpej ifc = if_clone_lookup(name, &unit);
1307 1.63 thorpej if (ifc == NULL)
1308 1.185 dyoung return EINVAL;
1309 1.63 thorpej
1310 1.336 ozaki ifp = if_get(name, &psref);
1311 1.336 ozaki if (ifp != NULL) {
1312 1.336 ozaki if_put(ifp, &psref);
1313 1.185 dyoung return EEXIST;
1314 1.336 ozaki }
1315 1.63 thorpej
1316 1.185 dyoung return (*ifc->ifc_create)(ifc, unit);
1317 1.63 thorpej }
1318 1.63 thorpej
1319 1.63 thorpej /*
1320 1.63 thorpej * Destroy a clone network interface.
1321 1.63 thorpej */
1322 1.302 ozaki static int
1323 1.163 thorpej if_clone_destroy(const char *name)
1324 1.63 thorpej {
1325 1.63 thorpej struct if_clone *ifc;
1326 1.63 thorpej struct ifnet *ifp;
1327 1.336 ozaki struct psref psref;
1328 1.63 thorpej
1329 1.63 thorpej ifc = if_clone_lookup(name, NULL);
1330 1.63 thorpej if (ifc == NULL)
1331 1.185 dyoung return EINVAL;
1332 1.63 thorpej
1333 1.336 ozaki if (ifc->ifc_destroy == NULL)
1334 1.336 ozaki return EOPNOTSUPP;
1335 1.336 ozaki
1336 1.336 ozaki ifp = if_get(name, &psref);
1337 1.63 thorpej if (ifp == NULL)
1338 1.185 dyoung return ENXIO;
1339 1.63 thorpej
1340 1.336 ozaki /* We have to disable ioctls here */
1341 1.336 ozaki mutex_enter(ifp->if_ioctl_lock);
1342 1.336 ozaki ifp->if_ioctl = if_nullioctl;
1343 1.336 ozaki mutex_exit(ifp->if_ioctl_lock);
1344 1.336 ozaki
1345 1.336 ozaki /*
1346 1.336 ozaki * We cannot call ifc_destroy with holding ifp.
1347 1.336 ozaki * Releasing ifp here is safe thanks to if_clone_mtx.
1348 1.336 ozaki */
1349 1.336 ozaki if_put(ifp, &psref);
1350 1.63 thorpej
1351 1.185 dyoung return (*ifc->ifc_destroy)(ifp);
1352 1.63 thorpej }
1353 1.63 thorpej
1354 1.63 thorpej /*
1355 1.63 thorpej * Look up a network interface cloner.
1356 1.63 thorpej */
1357 1.163 thorpej static struct if_clone *
1358 1.163 thorpej if_clone_lookup(const char *name, int *unitp)
1359 1.63 thorpej {
1360 1.63 thorpej struct if_clone *ifc;
1361 1.63 thorpej const char *cp;
1362 1.262 christos char *dp, ifname[IFNAMSIZ + 3];
1363 1.128 itojun int unit;
1364 1.63 thorpej
1365 1.262 christos strcpy(ifname, "if_");
1366 1.128 itojun /* separate interface name from unit */
1367 1.262 christos for (dp = ifname + 3, cp = name; cp - name < IFNAMSIZ &&
1368 1.262 christos *cp && (*cp < '0' || *cp > '9');)
1369 1.262 christos *dp++ = *cp++;
1370 1.128 itojun
1371 1.128 itojun if (cp == name || cp - name == IFNAMSIZ || !*cp)
1372 1.185 dyoung return NULL; /* No name or unit number */
1373 1.262 christos *dp++ = '\0';
1374 1.128 itojun
1375 1.262 christos again:
1376 1.128 itojun LIST_FOREACH(ifc, &if_cloners, ifc_list) {
1377 1.262 christos if (strcmp(ifname + 3, ifc->ifc_name) == 0)
1378 1.128 itojun break;
1379 1.63 thorpej }
1380 1.63 thorpej
1381 1.262 christos if (ifc == NULL) {
1382 1.262 christos if (*ifname == '\0' ||
1383 1.267 christos module_autoload(ifname, MODULE_CLASS_DRIVER))
1384 1.262 christos return NULL;
1385 1.262 christos *ifname = '\0';
1386 1.262 christos goto again;
1387 1.262 christos }
1388 1.63 thorpej
1389 1.128 itojun unit = 0;
1390 1.129 itojun while (cp - name < IFNAMSIZ && *cp) {
1391 1.245 christos if (*cp < '0' || *cp > '9' || unit >= INT_MAX / 10) {
1392 1.63 thorpej /* Bogus unit number. */
1393 1.185 dyoung return NULL;
1394 1.63 thorpej }
1395 1.128 itojun unit = (unit * 10) + (*cp++ - '0');
1396 1.63 thorpej }
1397 1.63 thorpej
1398 1.63 thorpej if (unitp != NULL)
1399 1.128 itojun *unitp = unit;
1400 1.185 dyoung return ifc;
1401 1.63 thorpej }
1402 1.63 thorpej
1403 1.63 thorpej /*
1404 1.63 thorpej * Register a network interface cloner.
1405 1.63 thorpej */
1406 1.63 thorpej void
1407 1.163 thorpej if_clone_attach(struct if_clone *ifc)
1408 1.63 thorpej {
1409 1.63 thorpej
1410 1.63 thorpej LIST_INSERT_HEAD(&if_cloners, ifc, ifc_list);
1411 1.67 thorpej if_cloners_count++;
1412 1.63 thorpej }
1413 1.63 thorpej
1414 1.63 thorpej /*
1415 1.63 thorpej * Unregister a network interface cloner.
1416 1.63 thorpej */
1417 1.63 thorpej void
1418 1.163 thorpej if_clone_detach(struct if_clone *ifc)
1419 1.63 thorpej {
1420 1.63 thorpej
1421 1.63 thorpej LIST_REMOVE(ifc, ifc_list);
1422 1.67 thorpej if_cloners_count--;
1423 1.67 thorpej }
1424 1.67 thorpej
1425 1.67 thorpej /*
1426 1.67 thorpej * Provide list of interface cloners to userspace.
1427 1.67 thorpej */
1428 1.315 martin int
1429 1.315 martin if_clone_list(int buf_count, char *buffer, int *total)
1430 1.67 thorpej {
1431 1.67 thorpej char outbuf[IFNAMSIZ], *dst;
1432 1.67 thorpej struct if_clone *ifc;
1433 1.67 thorpej int count, error = 0;
1434 1.67 thorpej
1435 1.315 martin *total = if_cloners_count;
1436 1.315 martin if ((dst = buffer) == NULL) {
1437 1.67 thorpej /* Just asking how many there are. */
1438 1.185 dyoung return 0;
1439 1.67 thorpej }
1440 1.67 thorpej
1441 1.315 martin if (buf_count < 0)
1442 1.185 dyoung return EINVAL;
1443 1.67 thorpej
1444 1.315 martin count = (if_cloners_count < buf_count) ?
1445 1.315 martin if_cloners_count : buf_count;
1446 1.67 thorpej
1447 1.67 thorpej for (ifc = LIST_FIRST(&if_cloners); ifc != NULL && count != 0;
1448 1.67 thorpej ifc = LIST_NEXT(ifc, ifc_list), count--, dst += IFNAMSIZ) {
1449 1.175 christos (void)strncpy(outbuf, ifc->ifc_name, sizeof(outbuf));
1450 1.175 christos if (outbuf[sizeof(outbuf) - 1] != '\0')
1451 1.175 christos return ENAMETOOLONG;
1452 1.172 christos error = copyout(outbuf, dst, sizeof(outbuf));
1453 1.185 dyoung if (error != 0)
1454 1.67 thorpej break;
1455 1.67 thorpej }
1456 1.67 thorpej
1457 1.185 dyoung return error;
1458 1.63 thorpej }
1459 1.63 thorpej
1460 1.207 dyoung void
1461 1.291 rmind ifaref(struct ifaddr *ifa)
1462 1.291 rmind {
1463 1.291 rmind ifa->ifa_refcnt++;
1464 1.291 rmind }
1465 1.291 rmind
1466 1.291 rmind void
1467 1.291 rmind ifafree(struct ifaddr *ifa)
1468 1.291 rmind {
1469 1.291 rmind KASSERT(ifa != NULL);
1470 1.291 rmind KASSERT(ifa->ifa_refcnt > 0);
1471 1.291 rmind
1472 1.291 rmind if (--ifa->ifa_refcnt == 0) {
1473 1.291 rmind free(ifa, M_IFADDR);
1474 1.291 rmind }
1475 1.291 rmind }
1476 1.291 rmind
1477 1.291 rmind void
1478 1.207 dyoung ifa_insert(struct ifnet *ifp, struct ifaddr *ifa)
1479 1.207 dyoung {
1480 1.207 dyoung ifa->ifa_ifp = ifp;
1481 1.208 dyoung TAILQ_INSERT_TAIL(&ifp->if_addrlist, ifa, ifa_list);
1482 1.291 rmind ifaref(ifa);
1483 1.207 dyoung }
1484 1.207 dyoung
1485 1.207 dyoung void
1486 1.207 dyoung ifa_remove(struct ifnet *ifp, struct ifaddr *ifa)
1487 1.207 dyoung {
1488 1.207 dyoung KASSERT(ifa->ifa_ifp == ifp);
1489 1.207 dyoung TAILQ_REMOVE(&ifp->if_addrlist, ifa, ifa_list);
1490 1.291 rmind ifafree(ifa);
1491 1.207 dyoung }
1492 1.207 dyoung
1493 1.194 dyoung static inline int
1494 1.194 dyoung equal(const struct sockaddr *sa1, const struct sockaddr *sa2)
1495 1.194 dyoung {
1496 1.194 dyoung return sockaddr_cmp(sa1, sa2) == 0;
1497 1.194 dyoung }
1498 1.194 dyoung
1499 1.63 thorpej /*
1500 1.1 cgd * Locate an interface based on a complete address.
1501 1.1 cgd */
1502 1.1 cgd /*ARGSUSED*/
1503 1.1 cgd struct ifaddr *
1504 1.163 thorpej ifa_ifwithaddr(const struct sockaddr *addr)
1505 1.1 cgd {
1506 1.61 augustss struct ifnet *ifp;
1507 1.61 augustss struct ifaddr *ifa;
1508 1.334 ozaki int s;
1509 1.1 cgd
1510 1.334 ozaki s = pserialize_read_enter();
1511 1.334 ozaki IFNET_READER_FOREACH(ifp) {
1512 1.53 thorpej if (ifp->if_output == if_nulloutput)
1513 1.1 cgd continue;
1514 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
1515 1.53 thorpej if (ifa->ifa_addr->sa_family != addr->sa_family)
1516 1.53 thorpej continue;
1517 1.53 thorpej if (equal(addr, ifa->ifa_addr))
1518 1.185 dyoung return ifa;
1519 1.53 thorpej if ((ifp->if_flags & IFF_BROADCAST) &&
1520 1.53 thorpej ifa->ifa_broadaddr &&
1521 1.53 thorpej /* IP6 doesn't have broadcast */
1522 1.53 thorpej ifa->ifa_broadaddr->sa_len != 0 &&
1523 1.53 thorpej equal(ifa->ifa_broadaddr, addr))
1524 1.185 dyoung return ifa;
1525 1.53 thorpej }
1526 1.1 cgd }
1527 1.334 ozaki pserialize_read_exit(s);
1528 1.185 dyoung return NULL;
1529 1.1 cgd }
1530 1.49 itojun
1531 1.1 cgd /*
1532 1.1 cgd * Locate the point to point interface with a given destination address.
1533 1.1 cgd */
1534 1.1 cgd /*ARGSUSED*/
1535 1.1 cgd struct ifaddr *
1536 1.163 thorpej ifa_ifwithdstaddr(const struct sockaddr *addr)
1537 1.1 cgd {
1538 1.61 augustss struct ifnet *ifp;
1539 1.61 augustss struct ifaddr *ifa;
1540 1.334 ozaki int s;
1541 1.1 cgd
1542 1.334 ozaki s = pserialize_read_enter();
1543 1.334 ozaki IFNET_READER_FOREACH(ifp) {
1544 1.53 thorpej if (ifp->if_output == if_nulloutput)
1545 1.53 thorpej continue;
1546 1.185 dyoung if ((ifp->if_flags & IFF_POINTOPOINT) == 0)
1547 1.185 dyoung continue;
1548 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
1549 1.185 dyoung if (ifa->ifa_addr->sa_family != addr->sa_family ||
1550 1.185 dyoung ifa->ifa_dstaddr == NULL)
1551 1.185 dyoung continue;
1552 1.185 dyoung if (equal(addr, ifa->ifa_dstaddr))
1553 1.185 dyoung return ifa;
1554 1.53 thorpej }
1555 1.1 cgd }
1556 1.334 ozaki pserialize_read_exit(s);
1557 1.185 dyoung return NULL;
1558 1.1 cgd }
1559 1.1 cgd
1560 1.1 cgd /*
1561 1.1 cgd * Find an interface on a specific network. If many, choice
1562 1.15 mycroft * is most specific found.
1563 1.1 cgd */
1564 1.1 cgd struct ifaddr *
1565 1.163 thorpej ifa_ifwithnet(const struct sockaddr *addr)
1566 1.1 cgd {
1567 1.61 augustss struct ifnet *ifp;
1568 1.61 augustss struct ifaddr *ifa;
1569 1.140 matt const struct sockaddr_dl *sdl;
1570 1.15 mycroft struct ifaddr *ifa_maybe = 0;
1571 1.1 cgd u_int af = addr->sa_family;
1572 1.171 pooka const char *addr_data = addr->sa_data, *cplim;
1573 1.334 ozaki int s;
1574 1.1 cgd
1575 1.1 cgd if (af == AF_LINK) {
1576 1.195 dyoung sdl = satocsdl(addr);
1577 1.137 itojun if (sdl->sdl_index && sdl->sdl_index < if_indexlim &&
1578 1.137 itojun ifindex2ifnet[sdl->sdl_index] &&
1579 1.316 ozaki ifindex2ifnet[sdl->sdl_index]->if_output != if_nulloutput) {
1580 1.316 ozaki return ifindex2ifnet[sdl->sdl_index]->if_dl;
1581 1.316 ozaki }
1582 1.1 cgd }
1583 1.51 bouyer #ifdef NETATALK
1584 1.51 bouyer if (af == AF_APPLETALK) {
1585 1.140 matt const struct sockaddr_at *sat, *sat2;
1586 1.158 christos sat = (const struct sockaddr_at *)addr;
1587 1.334 ozaki s = pserialize_read_enter();
1588 1.334 ozaki IFNET_READER_FOREACH(ifp) {
1589 1.53 thorpej if (ifp->if_output == if_nulloutput)
1590 1.53 thorpej continue;
1591 1.158 christos ifa = at_ifawithnet((const struct sockaddr_at *)addr, ifp);
1592 1.62 bouyer if (ifa == NULL)
1593 1.62 bouyer continue;
1594 1.62 bouyer sat2 = (struct sockaddr_at *)ifa->ifa_addr;
1595 1.62 bouyer if (sat2->sat_addr.s_net == sat->sat_addr.s_net)
1596 1.185 dyoung return ifa; /* exact match */
1597 1.62 bouyer if (ifa_maybe == NULL) {
1598 1.112 wiz /* else keep the if with the right range */
1599 1.62 bouyer ifa_maybe = ifa;
1600 1.62 bouyer }
1601 1.51 bouyer }
1602 1.334 ozaki pserialize_read_exit(s);
1603 1.185 dyoung return ifa_maybe;
1604 1.51 bouyer }
1605 1.51 bouyer #endif
1606 1.334 ozaki s = pserialize_read_enter();
1607 1.334 ozaki IFNET_READER_FOREACH(ifp) {
1608 1.53 thorpej if (ifp->if_output == if_nulloutput)
1609 1.53 thorpej continue;
1610 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
1611 1.171 pooka const char *cp, *cp2, *cp3;
1612 1.15 mycroft
1613 1.15 mycroft if (ifa->ifa_addr->sa_family != af ||
1614 1.185 dyoung ifa->ifa_netmask == NULL)
1615 1.53 thorpej next: continue;
1616 1.15 mycroft cp = addr_data;
1617 1.15 mycroft cp2 = ifa->ifa_addr->sa_data;
1618 1.15 mycroft cp3 = ifa->ifa_netmask->sa_data;
1619 1.171 pooka cplim = (const char *)ifa->ifa_netmask +
1620 1.53 thorpej ifa->ifa_netmask->sa_len;
1621 1.53 thorpej while (cp3 < cplim) {
1622 1.53 thorpej if ((*cp++ ^ *cp2++) & *cp3++) {
1623 1.53 thorpej /* want to continue for() loop */
1624 1.32 mrg goto next;
1625 1.53 thorpej }
1626 1.53 thorpej }
1627 1.185 dyoung if (ifa_maybe == NULL ||
1628 1.329 ozaki rt_refines(ifa->ifa_netmask,
1629 1.329 ozaki ifa_maybe->ifa_netmask))
1630 1.15 mycroft ifa_maybe = ifa;
1631 1.15 mycroft }
1632 1.53 thorpej }
1633 1.334 ozaki pserialize_read_exit(s);
1634 1.185 dyoung return ifa_maybe;
1635 1.26 mrg }
1636 1.53 thorpej
1637 1.26 mrg /*
1638 1.26 mrg * Find the interface of the addresss.
1639 1.26 mrg */
1640 1.26 mrg struct ifaddr *
1641 1.163 thorpej ifa_ifwithladdr(const struct sockaddr *addr)
1642 1.26 mrg {
1643 1.26 mrg struct ifaddr *ia;
1644 1.26 mrg
1645 1.53 thorpej if ((ia = ifa_ifwithaddr(addr)) || (ia = ifa_ifwithdstaddr(addr)) ||
1646 1.53 thorpej (ia = ifa_ifwithnet(addr)))
1647 1.185 dyoung return ia;
1648 1.185 dyoung return NULL;
1649 1.1 cgd }
1650 1.1 cgd
1651 1.1 cgd /*
1652 1.1 cgd * Find an interface using a specific address family
1653 1.1 cgd */
1654 1.1 cgd struct ifaddr *
1655 1.163 thorpej ifa_ifwithaf(int af)
1656 1.1 cgd {
1657 1.61 augustss struct ifnet *ifp;
1658 1.334 ozaki struct ifaddr *ifa = NULL;
1659 1.334 ozaki int s;
1660 1.1 cgd
1661 1.334 ozaki s = pserialize_read_enter();
1662 1.334 ozaki IFNET_READER_FOREACH(ifp) {
1663 1.53 thorpej if (ifp->if_output == if_nulloutput)
1664 1.53 thorpej continue;
1665 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
1666 1.21 mycroft if (ifa->ifa_addr->sa_family == af)
1667 1.334 ozaki goto out;
1668 1.53 thorpej }
1669 1.53 thorpej }
1670 1.334 ozaki out:
1671 1.334 ozaki pserialize_read_exit(s);
1672 1.334 ozaki return ifa;
1673 1.1 cgd }
1674 1.1 cgd
1675 1.1 cgd /*
1676 1.1 cgd * Find an interface address specific to an interface best matching
1677 1.1 cgd * a given address.
1678 1.1 cgd */
1679 1.1 cgd struct ifaddr *
1680 1.163 thorpej ifaof_ifpforaddr(const struct sockaddr *addr, struct ifnet *ifp)
1681 1.1 cgd {
1682 1.61 augustss struct ifaddr *ifa;
1683 1.140 matt const char *cp, *cp2, *cp3;
1684 1.140 matt const char *cplim;
1685 1.1 cgd struct ifaddr *ifa_maybe = 0;
1686 1.1 cgd u_int af = addr->sa_family;
1687 1.1 cgd
1688 1.53 thorpej if (ifp->if_output == if_nulloutput)
1689 1.185 dyoung return NULL;
1690 1.53 thorpej
1691 1.1 cgd if (af >= AF_MAX)
1692 1.185 dyoung return NULL;
1693 1.53 thorpej
1694 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
1695 1.1 cgd if (ifa->ifa_addr->sa_family != af)
1696 1.1 cgd continue;
1697 1.1 cgd ifa_maybe = ifa;
1698 1.185 dyoung if (ifa->ifa_netmask == NULL) {
1699 1.1 cgd if (equal(addr, ifa->ifa_addr) ||
1700 1.53 thorpej (ifa->ifa_dstaddr &&
1701 1.53 thorpej equal(addr, ifa->ifa_dstaddr)))
1702 1.185 dyoung return ifa;
1703 1.1 cgd continue;
1704 1.1 cgd }
1705 1.1 cgd cp = addr->sa_data;
1706 1.1 cgd cp2 = ifa->ifa_addr->sa_data;
1707 1.1 cgd cp3 = ifa->ifa_netmask->sa_data;
1708 1.1 cgd cplim = ifa->ifa_netmask->sa_len + (char *)ifa->ifa_netmask;
1709 1.53 thorpej for (; cp3 < cplim; cp3++) {
1710 1.1 cgd if ((*cp++ ^ *cp2++) & *cp3)
1711 1.1 cgd break;
1712 1.53 thorpej }
1713 1.1 cgd if (cp3 == cplim)
1714 1.185 dyoung return ifa;
1715 1.1 cgd }
1716 1.185 dyoung return ifa_maybe;
1717 1.1 cgd }
1718 1.9 mycroft
1719 1.1 cgd /*
1720 1.1 cgd * Default action when installing a route with a Link Level gateway.
1721 1.1 cgd * Lookup an appropriate real ifa to point to.
1722 1.1 cgd * This should be moved to /sys/net/link.c eventually.
1723 1.1 cgd */
1724 1.15 mycroft void
1725 1.228 dyoung link_rtrequest(int cmd, struct rtentry *rt, const struct rt_addrinfo *info)
1726 1.1 cgd {
1727 1.61 augustss struct ifaddr *ifa;
1728 1.194 dyoung const struct sockaddr *dst;
1729 1.15 mycroft struct ifnet *ifp;
1730 1.1 cgd
1731 1.225 dyoung if (cmd != RTM_ADD || (ifa = rt->rt_ifa) == NULL ||
1732 1.225 dyoung (ifp = ifa->ifa_ifp) == NULL || (dst = rt_getkey(rt)) == NULL)
1733 1.1 cgd return;
1734 1.24 christos if ((ifa = ifaof_ifpforaddr(dst, ifp)) != NULL) {
1735 1.176 dyoung rt_replace_ifa(rt, ifa);
1736 1.1 cgd if (ifa->ifa_rtrequest && ifa->ifa_rtrequest != link_rtrequest)
1737 1.82 itojun ifa->ifa_rtrequest(cmd, rt, info);
1738 1.1 cgd }
1739 1.1 cgd }
1740 1.1 cgd
1741 1.1 cgd /*
1742 1.325 roy * bitmask macros to manage a densely packed link_state change queue.
1743 1.325 roy * Because we need to store LINK_STATE_UNKNOWN(0), LINK_STATE_DOWN(1) and
1744 1.325 roy * LINK_STATE_UP(2) we need 2 bits for each state change.
1745 1.325 roy * As a state change to store is 0, treat all bits set as an unset item.
1746 1.325 roy */
1747 1.325 roy #define LQ_ITEM_BITS 2
1748 1.325 roy #define LQ_ITEM_MASK ((1 << LQ_ITEM_BITS) - 1)
1749 1.325 roy #define LQ_MASK(i) (LQ_ITEM_MASK << (i) * LQ_ITEM_BITS)
1750 1.325 roy #define LINK_STATE_UNSET LQ_ITEM_MASK
1751 1.325 roy #define LQ_ITEM(q, i) (((q) & LQ_MASK((i))) >> (i) * LQ_ITEM_BITS)
1752 1.325 roy #define LQ_STORE(q, i, v) \
1753 1.325 roy do { \
1754 1.325 roy (q) &= ~LQ_MASK((i)); \
1755 1.325 roy (q) |= (v) << (i) * LQ_ITEM_BITS; \
1756 1.325 roy } while (0 /* CONSTCOND */)
1757 1.325 roy #define LQ_MAX(q) ((sizeof((q)) * NBBY) / LQ_ITEM_BITS)
1758 1.325 roy #define LQ_POP(q, v) \
1759 1.325 roy do { \
1760 1.325 roy (v) = LQ_ITEM((q), 0); \
1761 1.325 roy (q) >>= LQ_ITEM_BITS; \
1762 1.325 roy (q) |= LINK_STATE_UNSET << (LQ_MAX((q)) - 1) * LQ_ITEM_BITS; \
1763 1.325 roy } while (0 /* CONSTCOND */)
1764 1.325 roy #define LQ_PUSH(q, v) \
1765 1.325 roy do { \
1766 1.325 roy (q) >>= LQ_ITEM_BITS; \
1767 1.325 roy (q) |= (v) << (LQ_MAX((q)) - 1) * LQ_ITEM_BITS; \
1768 1.325 roy } while (0 /* CONSTCOND */)
1769 1.325 roy #define LQ_FIND_UNSET(q, i) \
1770 1.325 roy for ((i) = 0; i < LQ_MAX((q)); (i)++) { \
1771 1.325 roy if (LQ_ITEM((q), (i)) == LINK_STATE_UNSET) \
1772 1.325 roy break; \
1773 1.325 roy }
1774 1.325 roy /*
1775 1.325 roy * Handle a change in the interface link state and
1776 1.325 roy * queue notifications.
1777 1.159 dyoung */
1778 1.159 dyoung void
1779 1.159 dyoung if_link_state_change(struct ifnet *ifp, int link_state)
1780 1.159 dyoung {
1781 1.325 roy int s, idx;
1782 1.263 roy
1783 1.325 roy /* Ensure change is to a valid state */
1784 1.325 roy switch (link_state) {
1785 1.325 roy case LINK_STATE_UNKNOWN: /* FALLTHROUGH */
1786 1.325 roy case LINK_STATE_DOWN: /* FALLTHROUGH */
1787 1.325 roy case LINK_STATE_UP:
1788 1.325 roy break;
1789 1.325 roy default:
1790 1.325 roy #ifdef DEBUG
1791 1.325 roy printf("%s: invalid link state %d\n",
1792 1.325 roy ifp->if_xname, link_state);
1793 1.325 roy #endif
1794 1.185 dyoung return;
1795 1.264 roy }
1796 1.263 roy
1797 1.325 roy s = splnet();
1798 1.325 roy
1799 1.325 roy /* Find the last unset event in the queue. */
1800 1.325 roy LQ_FIND_UNSET(ifp->if_link_queue, idx);
1801 1.325 roy
1802 1.325 roy /*
1803 1.325 roy * Ensure link_state doesn't match the last event in the queue.
1804 1.325 roy * ifp->if_link_state is not checked and set here because
1805 1.325 roy * that would present an inconsistent picture to the system.
1806 1.325 roy */
1807 1.325 roy if (idx != 0 &&
1808 1.325 roy LQ_ITEM(ifp->if_link_queue, idx - 1) == (uint8_t)link_state)
1809 1.325 roy goto out;
1810 1.325 roy
1811 1.325 roy /* Handle queue overflow. */
1812 1.325 roy if (idx == LQ_MAX(ifp->if_link_queue)) {
1813 1.325 roy uint8_t lost;
1814 1.325 roy
1815 1.325 roy /*
1816 1.325 roy * The DOWN state must be protected from being pushed off
1817 1.325 roy * the queue to ensure that userland will always be
1818 1.325 roy * in a sane state.
1819 1.325 roy * Because DOWN is protected, there is no need to protect
1820 1.325 roy * UNKNOWN.
1821 1.325 roy * It should be invalid to change from any other state to
1822 1.325 roy * UNKNOWN anyway ...
1823 1.325 roy */
1824 1.325 roy lost = LQ_ITEM(ifp->if_link_queue, 0);
1825 1.325 roy LQ_PUSH(ifp->if_link_queue, (uint8_t)link_state);
1826 1.325 roy if (lost == LINK_STATE_DOWN) {
1827 1.325 roy lost = LQ_ITEM(ifp->if_link_queue, 0);
1828 1.325 roy LQ_STORE(ifp->if_link_queue, 0, LINK_STATE_DOWN);
1829 1.325 roy }
1830 1.325 roy printf("%s: lost link state change %s\n",
1831 1.325 roy ifp->if_xname,
1832 1.325 roy lost == LINK_STATE_UP ? "UP" :
1833 1.325 roy lost == LINK_STATE_DOWN ? "DOWN" :
1834 1.325 roy "UNKNOWN");
1835 1.325 roy } else
1836 1.325 roy LQ_STORE(ifp->if_link_queue, idx, (uint8_t)link_state);
1837 1.325 roy
1838 1.324 ozaki softint_schedule(ifp->if_link_si);
1839 1.324 ozaki
1840 1.325 roy out:
1841 1.324 ozaki splx(s);
1842 1.324 ozaki }
1843 1.324 ozaki
1844 1.325 roy /*
1845 1.325 roy * Handle interface link state change notifications.
1846 1.325 roy * Must be called at splnet().
1847 1.325 roy */
1848 1.324 ozaki static void
1849 1.325 roy if_link_state_change0(struct ifnet *ifp, int link_state)
1850 1.324 ozaki {
1851 1.324 ozaki struct domain *dp;
1852 1.324 ozaki
1853 1.325 roy /* Ensure the change is still valid. */
1854 1.325 roy if (ifp->if_link_state == link_state)
1855 1.325 roy return;
1856 1.324 ozaki
1857 1.263 roy #ifdef DEBUG
1858 1.263 roy log(LOG_DEBUG, "%s: link state %s (was %s)\n", ifp->if_xname,
1859 1.263 roy link_state == LINK_STATE_UP ? "UP" :
1860 1.263 roy link_state == LINK_STATE_DOWN ? "DOWN" :
1861 1.263 roy "UNKNOWN",
1862 1.325 roy ifp->if_link_state == LINK_STATE_UP ? "UP" :
1863 1.325 roy ifp->if_link_state == LINK_STATE_DOWN ? "DOWN" :
1864 1.263 roy "UNKNOWN");
1865 1.263 roy #endif
1866 1.263 roy
1867 1.263 roy /*
1868 1.263 roy * When going from UNKNOWN to UP, we need to mark existing
1869 1.314 roy * addresses as tentative and restart DAD as we may have
1870 1.263 roy * erroneously not found a duplicate.
1871 1.263 roy *
1872 1.263 roy * This needs to happen before rt_ifmsg to avoid a race where
1873 1.263 roy * listeners would have an address and expect it to work right
1874 1.263 roy * away.
1875 1.263 roy */
1876 1.312 roy if (link_state == LINK_STATE_UP &&
1877 1.325 roy ifp->if_link_state == LINK_STATE_UNKNOWN)
1878 1.312 roy {
1879 1.312 roy DOMAIN_FOREACH(dp) {
1880 1.312 roy if (dp->dom_if_link_state_change != NULL)
1881 1.312 roy dp->dom_if_link_state_change(ifp,
1882 1.312 roy LINK_STATE_DOWN);
1883 1.312 roy }
1884 1.312 roy }
1885 1.263 roy
1886 1.325 roy ifp->if_link_state = link_state;
1887 1.325 roy
1888 1.159 dyoung /* Notify that the link state has changed. */
1889 1.185 dyoung rt_ifmsg(ifp);
1890 1.263 roy
1891 1.166 liamjfoy #if NCARP > 0
1892 1.185 dyoung if (ifp->if_carp)
1893 1.185 dyoung carp_carpdev_state(ifp);
1894 1.166 liamjfoy #endif
1895 1.263 roy
1896 1.312 roy DOMAIN_FOREACH(dp) {
1897 1.312 roy if (dp->dom_if_link_state_change != NULL)
1898 1.312 roy dp->dom_if_link_state_change(ifp, link_state);
1899 1.270 pooka }
1900 1.325 roy }
1901 1.325 roy
1902 1.325 roy /*
1903 1.325 roy * Process the interface link state change queue.
1904 1.325 roy */
1905 1.325 roy static void
1906 1.325 roy if_link_state_change_si(void *arg)
1907 1.325 roy {
1908 1.325 roy struct ifnet *ifp = arg;
1909 1.325 roy int s;
1910 1.325 roy uint8_t state;
1911 1.325 roy
1912 1.325 roy s = splnet();
1913 1.325 roy
1914 1.325 roy /* Pop a link state change from the queue and process it. */
1915 1.325 roy LQ_POP(ifp->if_link_queue, state);
1916 1.325 roy if_link_state_change0(ifp, state);
1917 1.325 roy
1918 1.325 roy /* If there is a link state change to come, schedule it. */
1919 1.325 roy if (LQ_ITEM(ifp->if_link_queue, 0) != LINK_STATE_UNSET)
1920 1.325 roy softint_schedule(ifp->if_link_si);
1921 1.264 roy
1922 1.264 roy splx(s);
1923 1.159 dyoung }
1924 1.159 dyoung
1925 1.159 dyoung /*
1926 1.310 roy * Default action when installing a local route on a point-to-point
1927 1.310 roy * interface.
1928 1.310 roy */
1929 1.310 roy void
1930 1.310 roy p2p_rtrequest(int req, struct rtentry *rt,
1931 1.310 roy __unused const struct rt_addrinfo *info)
1932 1.310 roy {
1933 1.310 roy struct ifnet *ifp = rt->rt_ifp;
1934 1.310 roy struct ifaddr *ifa, *lo0ifa;
1935 1.310 roy
1936 1.310 roy switch (req) {
1937 1.310 roy case RTM_ADD:
1938 1.310 roy if ((rt->rt_flags & RTF_LOCAL) == 0)
1939 1.310 roy break;
1940 1.310 roy
1941 1.310 roy IFADDR_FOREACH(ifa, ifp) {
1942 1.310 roy if (equal(rt_getkey(rt), ifa->ifa_addr))
1943 1.310 roy break;
1944 1.310 roy }
1945 1.310 roy if (ifa == NULL)
1946 1.310 roy break;
1947 1.310 roy
1948 1.310 roy /*
1949 1.310 roy * Ensure lo0 has an address of the same family.
1950 1.310 roy */
1951 1.310 roy IFADDR_FOREACH(lo0ifa, lo0ifp) {
1952 1.310 roy if (lo0ifa->ifa_addr->sa_family ==
1953 1.310 roy ifa->ifa_addr->sa_family)
1954 1.310 roy break;
1955 1.310 roy }
1956 1.310 roy if (lo0ifa == NULL)
1957 1.310 roy break;
1958 1.310 roy
1959 1.310 roy rt->rt_ifp = lo0ifp;
1960 1.310 roy
1961 1.310 roy /*
1962 1.310 roy * Make sure to set rt->rt_ifa to the interface
1963 1.310 roy * address we are using, otherwise we will have trouble
1964 1.310 roy * with source address selection.
1965 1.310 roy */
1966 1.310 roy if (ifa != rt->rt_ifa)
1967 1.310 roy rt_replace_ifa(rt, ifa);
1968 1.310 roy break;
1969 1.310 roy case RTM_DELETE:
1970 1.310 roy default:
1971 1.310 roy break;
1972 1.310 roy }
1973 1.310 roy }
1974 1.310 roy
1975 1.310 roy /*
1976 1.1 cgd * Mark an interface down and notify protocols of
1977 1.1 cgd * the transition.
1978 1.23 mycroft * NOTE: must be called at splsoftnet or equivalent.
1979 1.1 cgd */
1980 1.15 mycroft void
1981 1.163 thorpej if_down(struct ifnet *ifp)
1982 1.1 cgd {
1983 1.61 augustss struct ifaddr *ifa;
1984 1.312 roy struct domain *dp;
1985 1.1 cgd
1986 1.1 cgd ifp->if_flags &= ~IFF_UP;
1987 1.232 christos nanotime(&ifp->if_lastchange);
1988 1.204 dyoung IFADDR_FOREACH(ifa, ifp)
1989 1.1 cgd pfctlinput(PRC_IFDOWN, ifa->ifa_addr);
1990 1.78 thorpej IFQ_PURGE(&ifp->if_snd);
1991 1.166 liamjfoy #if NCARP > 0
1992 1.166 liamjfoy if (ifp->if_carp)
1993 1.166 liamjfoy carp_carpdev_state(ifp);
1994 1.166 liamjfoy #endif
1995 1.15 mycroft rt_ifmsg(ifp);
1996 1.312 roy DOMAIN_FOREACH(dp) {
1997 1.312 roy if (dp->dom_if_down)
1998 1.312 roy dp->dom_if_down(ifp);
1999 1.312 roy }
2000 1.15 mycroft }
2001 1.15 mycroft
2002 1.15 mycroft /*
2003 1.15 mycroft * Mark an interface up and notify protocols of
2004 1.15 mycroft * the transition.
2005 1.23 mycroft * NOTE: must be called at splsoftnet or equivalent.
2006 1.15 mycroft */
2007 1.15 mycroft void
2008 1.163 thorpej if_up(struct ifnet *ifp)
2009 1.15 mycroft {
2010 1.24 christos #ifdef notyet
2011 1.61 augustss struct ifaddr *ifa;
2012 1.24 christos #endif
2013 1.312 roy struct domain *dp;
2014 1.15 mycroft
2015 1.15 mycroft ifp->if_flags |= IFF_UP;
2016 1.232 christos nanotime(&ifp->if_lastchange);
2017 1.15 mycroft #ifdef notyet
2018 1.15 mycroft /* this has no effect on IP, and will kill all ISO connections XXX */
2019 1.204 dyoung IFADDR_FOREACH(ifa, ifp)
2020 1.15 mycroft pfctlinput(PRC_IFUP, ifa->ifa_addr);
2021 1.15 mycroft #endif
2022 1.166 liamjfoy #if NCARP > 0
2023 1.166 liamjfoy if (ifp->if_carp)
2024 1.166 liamjfoy carp_carpdev_state(ifp);
2025 1.166 liamjfoy #endif
2026 1.15 mycroft rt_ifmsg(ifp);
2027 1.312 roy DOMAIN_FOREACH(dp) {
2028 1.313 roy if (dp->dom_if_up)
2029 1.313 roy dp->dom_if_up(ifp);
2030 1.312 roy }
2031 1.1 cgd }
2032 1.1 cgd
2033 1.1 cgd /*
2034 1.296 ozaki * Handle interface slowtimo timer routine. Called
2035 1.296 ozaki * from softclock, we decrement timer (if set) and
2036 1.1 cgd * call the appropriate interface routine on expiration.
2037 1.1 cgd */
2038 1.294 ozaki static void
2039 1.177 christos if_slowtimo(void *arg)
2040 1.1 cgd {
2041 1.306 martin void (*slowtimo)(struct ifnet *);
2042 1.296 ozaki struct ifnet *ifp = arg;
2043 1.305 martin int s;
2044 1.1 cgd
2045 1.306 martin slowtimo = ifp->if_slowtimo;
2046 1.306 martin if (__predict_false(slowtimo == NULL))
2047 1.305 martin return;
2048 1.296 ozaki
2049 1.305 martin s = splnet();
2050 1.296 ozaki if (ifp->if_timer != 0 && --ifp->if_timer == 0)
2051 1.306 martin (*slowtimo)(ifp);
2052 1.296 ozaki
2053 1.1 cgd splx(s);
2054 1.305 martin
2055 1.305 martin if (__predict_true(ifp->if_slowtimo != NULL))
2056 1.305 martin callout_schedule(ifp->if_slowtimo_ch, hz / IFNET_SLOWHZ);
2057 1.65 thorpej }
2058 1.65 thorpej
2059 1.65 thorpej /*
2060 1.65 thorpej * Set/clear promiscuous mode on interface ifp based on the truth value
2061 1.65 thorpej * of pswitch. The calls are reference counted so that only the first
2062 1.65 thorpej * "on" request actually has an effect, as does the final "off" request.
2063 1.65 thorpej * Results are undefined if the "off" and "on" requests are not matched.
2064 1.65 thorpej */
2065 1.65 thorpej int
2066 1.163 thorpej ifpromisc(struct ifnet *ifp, int pswitch)
2067 1.65 thorpej {
2068 1.65 thorpej int pcount, ret;
2069 1.259 dyoung short nflags;
2070 1.65 thorpej
2071 1.65 thorpej pcount = ifp->if_pcount;
2072 1.65 thorpej if (pswitch) {
2073 1.65 thorpej /*
2074 1.71 thorpej * Allow the device to be "placed" into promiscuous
2075 1.71 thorpej * mode even if it is not configured up. It will
2076 1.242 mbalmer * consult IFF_PROMISC when it is brought up.
2077 1.65 thorpej */
2078 1.68 pk if (ifp->if_pcount++ != 0)
2079 1.185 dyoung return 0;
2080 1.252 dyoung nflags = ifp->if_flags | IFF_PROMISC;
2081 1.65 thorpej } else {
2082 1.65 thorpej if (--ifp->if_pcount > 0)
2083 1.185 dyoung return 0;
2084 1.252 dyoung nflags = ifp->if_flags & ~IFF_PROMISC;
2085 1.65 thorpej }
2086 1.252 dyoung ret = if_flags_set(ifp, nflags);
2087 1.65 thorpej /* Restore interface state if not successful. */
2088 1.65 thorpej if (ret != 0) {
2089 1.65 thorpej ifp->if_pcount = pcount;
2090 1.65 thorpej }
2091 1.185 dyoung return ret;
2092 1.1 cgd }
2093 1.1 cgd
2094 1.1 cgd /*
2095 1.1 cgd * Map interface name to
2096 1.1 cgd * interface structure pointer.
2097 1.1 cgd */
2098 1.1 cgd struct ifnet *
2099 1.163 thorpej ifunit(const char *name)
2100 1.1 cgd {
2101 1.61 augustss struct ifnet *ifp;
2102 1.105 matt const char *cp = name;
2103 1.105 matt u_int unit = 0;
2104 1.105 matt u_int i;
2105 1.334 ozaki int s;
2106 1.105 matt
2107 1.105 matt /*
2108 1.105 matt * If the entire name is a number, treat it as an ifindex.
2109 1.105 matt */
2110 1.105 matt for (i = 0; i < IFNAMSIZ && *cp >= '0' && *cp <= '9'; i++, cp++) {
2111 1.105 matt unit = unit * 10 + (*cp - '0');
2112 1.105 matt }
2113 1.105 matt
2114 1.105 matt /*
2115 1.105 matt * If the number took all of the name, then it's a valid ifindex.
2116 1.105 matt */
2117 1.105 matt if (i == IFNAMSIZ || (cp != name && *cp == '\0')) {
2118 1.137 itojun if (unit >= if_indexlim)
2119 1.185 dyoung return NULL;
2120 1.105 matt ifp = ifindex2ifnet[unit];
2121 1.105 matt if (ifp == NULL || ifp->if_output == if_nulloutput)
2122 1.185 dyoung return NULL;
2123 1.185 dyoung return ifp;
2124 1.105 matt }
2125 1.34 thorpej
2126 1.334 ozaki ifp = NULL;
2127 1.334 ozaki s = pserialize_read_enter();
2128 1.334 ozaki IFNET_READER_FOREACH(ifp) {
2129 1.53 thorpej if (ifp->if_output == if_nulloutput)
2130 1.53 thorpej continue;
2131 1.53 thorpej if (strcmp(ifp->if_xname, name) == 0)
2132 1.334 ozaki goto out;
2133 1.53 thorpej }
2134 1.334 ozaki out:
2135 1.334 ozaki pserialize_read_exit(s);
2136 1.334 ozaki return ifp;
2137 1.1 cgd }
2138 1.49 itojun
2139 1.335 ozaki /*
2140 1.335 ozaki * Get a reference of an ifnet object by an interface name.
2141 1.335 ozaki * The returned reference is protected by psref(9). The caller
2142 1.335 ozaki * must release a returned reference by if_put after use.
2143 1.335 ozaki */
2144 1.335 ozaki struct ifnet *
2145 1.335 ozaki if_get(const char *name, struct psref *psref)
2146 1.335 ozaki {
2147 1.335 ozaki struct ifnet *ifp;
2148 1.335 ozaki const char *cp = name;
2149 1.335 ozaki u_int unit = 0;
2150 1.335 ozaki u_int i;
2151 1.335 ozaki int s;
2152 1.335 ozaki
2153 1.335 ozaki /*
2154 1.335 ozaki * If the entire name is a number, treat it as an ifindex.
2155 1.335 ozaki */
2156 1.335 ozaki for (i = 0; i < IFNAMSIZ && *cp >= '0' && *cp <= '9'; i++, cp++) {
2157 1.335 ozaki unit = unit * 10 + (*cp - '0');
2158 1.335 ozaki }
2159 1.335 ozaki
2160 1.335 ozaki /*
2161 1.335 ozaki * If the number took all of the name, then it's a valid ifindex.
2162 1.335 ozaki */
2163 1.335 ozaki if (i == IFNAMSIZ || (cp != name && *cp == '\0')) {
2164 1.335 ozaki if (unit >= if_indexlim)
2165 1.335 ozaki return NULL;
2166 1.335 ozaki ifp = ifindex2ifnet[unit];
2167 1.335 ozaki if (ifp == NULL || ifp->if_output == if_nulloutput)
2168 1.335 ozaki return NULL;
2169 1.335 ozaki return ifp;
2170 1.335 ozaki }
2171 1.335 ozaki
2172 1.335 ozaki ifp = NULL;
2173 1.335 ozaki s = pserialize_read_enter();
2174 1.335 ozaki IFNET_READER_FOREACH(ifp) {
2175 1.335 ozaki if (ifp->if_output == if_nulloutput)
2176 1.335 ozaki continue;
2177 1.335 ozaki if (strcmp(ifp->if_xname, name) == 0) {
2178 1.335 ozaki psref_acquire(psref, &ifp->if_psref,
2179 1.335 ozaki ifnet_psref_class);
2180 1.335 ozaki goto out;
2181 1.335 ozaki }
2182 1.335 ozaki }
2183 1.335 ozaki out:
2184 1.335 ozaki pserialize_read_exit(s);
2185 1.335 ozaki return ifp;
2186 1.335 ozaki }
2187 1.335 ozaki
2188 1.335 ozaki /*
2189 1.335 ozaki * Release a reference of an ifnet object given by if_get or
2190 1.335 ozaki * if_get_byindex.
2191 1.335 ozaki */
2192 1.335 ozaki void
2193 1.335 ozaki if_put(const struct ifnet *ifp, struct psref *psref)
2194 1.335 ozaki {
2195 1.335 ozaki
2196 1.335 ozaki psref_release(psref, &ifp->if_psref, ifnet_psref_class);
2197 1.335 ozaki }
2198 1.335 ozaki
2199 1.250 rmind ifnet_t *
2200 1.250 rmind if_byindex(u_int idx)
2201 1.250 rmind {
2202 1.250 rmind return (idx < if_indexlim) ? ifindex2ifnet[idx] : NULL;
2203 1.250 rmind }
2204 1.250 rmind
2205 1.335 ozaki /*
2206 1.335 ozaki * Get a reference of an ifnet object by an interface index.
2207 1.335 ozaki * The returned reference is protected by psref(9). The caller
2208 1.335 ozaki * must release a returned reference by if_put after use.
2209 1.335 ozaki */
2210 1.335 ozaki ifnet_t *
2211 1.335 ozaki if_get_byindex(u_int idx, struct psref *psref)
2212 1.335 ozaki {
2213 1.335 ozaki ifnet_t *ifp;
2214 1.335 ozaki int s;
2215 1.335 ozaki
2216 1.335 ozaki s = pserialize_read_enter();
2217 1.337 ozaki ifp = (__predict_true(idx < if_indexlim)) ? ifindex2ifnet[idx] : NULL;
2218 1.337 ozaki if (__predict_true(ifp != NULL))
2219 1.335 ozaki psref_acquire(psref, &ifp->if_psref, ifnet_psref_class);
2220 1.335 ozaki pserialize_read_exit(s);
2221 1.335 ozaki
2222 1.335 ozaki return ifp;
2223 1.335 ozaki }
2224 1.335 ozaki
2225 1.338 ozaki /*
2226 1.338 ozaki * XXX unsafe
2227 1.338 ozaki */
2228 1.338 ozaki void
2229 1.338 ozaki if_acquire_unsafe(struct ifnet *ifp, struct psref *psref)
2230 1.338 ozaki {
2231 1.338 ozaki
2232 1.338 ozaki KASSERT(ifp->if_index != 0);
2233 1.338 ozaki KASSERT(if_byindex(ifp->if_index) != NULL);
2234 1.338 ozaki psref_acquire(psref, &ifp->if_psref, ifnet_psref_class);
2235 1.338 ozaki }
2236 1.338 ozaki
2237 1.338 ozaki bool
2238 1.338 ozaki if_held(struct ifnet *ifp)
2239 1.338 ozaki {
2240 1.338 ozaki
2241 1.338 ozaki return psref_held(&ifp->if_psref, ifnet_psref_class);
2242 1.338 ozaki }
2243 1.338 ozaki
2244 1.338 ozaki
2245 1.211 dyoung /* common */
2246 1.215 dyoung int
2247 1.215 dyoung ifioctl_common(struct ifnet *ifp, u_long cmd, void *data)
2248 1.211 dyoung {
2249 1.224 dyoung int s;
2250 1.215 dyoung struct ifreq *ifr;
2251 1.215 dyoung struct ifcapreq *ifcr;
2252 1.215 dyoung struct ifdatareq *ifdr;
2253 1.211 dyoung
2254 1.211 dyoung switch (cmd) {
2255 1.211 dyoung case SIOCSIFCAP:
2256 1.215 dyoung ifcr = data;
2257 1.211 dyoung if ((ifcr->ifcr_capenable & ~ifp->if_capabilities) != 0)
2258 1.211 dyoung return EINVAL;
2259 1.211 dyoung
2260 1.213 dyoung if (ifcr->ifcr_capenable == ifp->if_capenable)
2261 1.213 dyoung return 0;
2262 1.211 dyoung
2263 1.213 dyoung ifp->if_capenable = ifcr->ifcr_capenable;
2264 1.211 dyoung
2265 1.213 dyoung /* Pre-compute the checksum flags mask. */
2266 1.213 dyoung ifp->if_csum_flags_tx = 0;
2267 1.213 dyoung ifp->if_csum_flags_rx = 0;
2268 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_IPv4_Tx) {
2269 1.213 dyoung ifp->if_csum_flags_tx |= M_CSUM_IPv4;
2270 1.213 dyoung }
2271 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_IPv4_Rx) {
2272 1.213 dyoung ifp->if_csum_flags_rx |= M_CSUM_IPv4;
2273 1.213 dyoung }
2274 1.211 dyoung
2275 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_TCPv4_Tx) {
2276 1.213 dyoung ifp->if_csum_flags_tx |= M_CSUM_TCPv4;
2277 1.213 dyoung }
2278 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_TCPv4_Rx) {
2279 1.213 dyoung ifp->if_csum_flags_rx |= M_CSUM_TCPv4;
2280 1.213 dyoung }
2281 1.211 dyoung
2282 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_UDPv4_Tx) {
2283 1.213 dyoung ifp->if_csum_flags_tx |= M_CSUM_UDPv4;
2284 1.213 dyoung }
2285 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_UDPv4_Rx) {
2286 1.213 dyoung ifp->if_csum_flags_rx |= M_CSUM_UDPv4;
2287 1.213 dyoung }
2288 1.211 dyoung
2289 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_TCPv6_Tx) {
2290 1.213 dyoung ifp->if_csum_flags_tx |= M_CSUM_TCPv6;
2291 1.213 dyoung }
2292 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_TCPv6_Rx) {
2293 1.213 dyoung ifp->if_csum_flags_rx |= M_CSUM_TCPv6;
2294 1.213 dyoung }
2295 1.211 dyoung
2296 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_UDPv6_Tx) {
2297 1.213 dyoung ifp->if_csum_flags_tx |= M_CSUM_UDPv6;
2298 1.211 dyoung }
2299 1.213 dyoung if (ifp->if_capenable & IFCAP_CSUM_UDPv6_Rx) {
2300 1.213 dyoung ifp->if_csum_flags_rx |= M_CSUM_UDPv6;
2301 1.213 dyoung }
2302 1.215 dyoung if (ifp->if_flags & IFF_UP)
2303 1.215 dyoung return ENETRESET;
2304 1.215 dyoung return 0;
2305 1.211 dyoung case SIOCSIFFLAGS:
2306 1.215 dyoung ifr = data;
2307 1.211 dyoung if (ifp->if_flags & IFF_UP && (ifr->ifr_flags & IFF_UP) == 0) {
2308 1.211 dyoung s = splnet();
2309 1.211 dyoung if_down(ifp);
2310 1.211 dyoung splx(s);
2311 1.211 dyoung }
2312 1.211 dyoung if (ifr->ifr_flags & IFF_UP && (ifp->if_flags & IFF_UP) == 0) {
2313 1.211 dyoung s = splnet();
2314 1.211 dyoung if_up(ifp);
2315 1.211 dyoung splx(s);
2316 1.211 dyoung }
2317 1.211 dyoung ifp->if_flags = (ifp->if_flags & IFF_CANTCHANGE) |
2318 1.211 dyoung (ifr->ifr_flags &~ IFF_CANTCHANGE);
2319 1.211 dyoung break;
2320 1.211 dyoung case SIOCGIFFLAGS:
2321 1.215 dyoung ifr = data;
2322 1.211 dyoung ifr->ifr_flags = ifp->if_flags;
2323 1.211 dyoung break;
2324 1.211 dyoung
2325 1.211 dyoung case SIOCGIFMETRIC:
2326 1.215 dyoung ifr = data;
2327 1.211 dyoung ifr->ifr_metric = ifp->if_metric;
2328 1.211 dyoung break;
2329 1.211 dyoung
2330 1.211 dyoung case SIOCGIFMTU:
2331 1.215 dyoung ifr = data;
2332 1.211 dyoung ifr->ifr_mtu = ifp->if_mtu;
2333 1.211 dyoung break;
2334 1.211 dyoung
2335 1.211 dyoung case SIOCGIFDLT:
2336 1.215 dyoung ifr = data;
2337 1.211 dyoung ifr->ifr_dlt = ifp->if_dlt;
2338 1.211 dyoung break;
2339 1.211 dyoung
2340 1.211 dyoung case SIOCGIFCAP:
2341 1.215 dyoung ifcr = data;
2342 1.211 dyoung ifcr->ifcr_capabilities = ifp->if_capabilities;
2343 1.211 dyoung ifcr->ifcr_capenable = ifp->if_capenable;
2344 1.211 dyoung break;
2345 1.211 dyoung
2346 1.211 dyoung case SIOCSIFMETRIC:
2347 1.215 dyoung ifr = data;
2348 1.211 dyoung ifp->if_metric = ifr->ifr_metric;
2349 1.211 dyoung break;
2350 1.211 dyoung
2351 1.211 dyoung case SIOCGIFDATA:
2352 1.215 dyoung ifdr = data;
2353 1.211 dyoung ifdr->ifdr_data = ifp->if_data;
2354 1.211 dyoung break;
2355 1.211 dyoung
2356 1.266 christos case SIOCGIFINDEX:
2357 1.266 christos ifr = data;
2358 1.266 christos ifr->ifr_index = ifp->if_index;
2359 1.266 christos break;
2360 1.266 christos
2361 1.211 dyoung case SIOCZIFDATA:
2362 1.215 dyoung ifdr = data;
2363 1.211 dyoung ifdr->ifdr_data = ifp->if_data;
2364 1.211 dyoung /*
2365 1.211 dyoung * Assumes that the volatile counters that can be
2366 1.211 dyoung * zero'ed are at the end of if_data.
2367 1.211 dyoung */
2368 1.211 dyoung memset(&ifp->if_data.ifi_ipackets, 0, sizeof(ifp->if_data) -
2369 1.211 dyoung offsetof(struct if_data, ifi_ipackets));
2370 1.261 msaitoh /*
2371 1.261 msaitoh * The memset() clears to the bottm of if_data. In the area,
2372 1.261 msaitoh * if_lastchange is included. Please be careful if new entry
2373 1.261 msaitoh * will be added into if_data or rewite this.
2374 1.261 msaitoh *
2375 1.261 msaitoh * And also, update if_lastchnage.
2376 1.261 msaitoh */
2377 1.261 msaitoh getnanotime(&ifp->if_lastchange);
2378 1.211 dyoung break;
2379 1.215 dyoung case SIOCSIFMTU:
2380 1.215 dyoung ifr = data;
2381 1.215 dyoung if (ifp->if_mtu == ifr->ifr_mtu)
2382 1.215 dyoung break;
2383 1.215 dyoung ifp->if_mtu = ifr->ifr_mtu;
2384 1.215 dyoung /*
2385 1.215 dyoung * If the link MTU changed, do network layer specific procedure.
2386 1.215 dyoung */
2387 1.215 dyoung #ifdef INET6
2388 1.271 pooka if (in6_present)
2389 1.271 pooka nd6_setmtu(ifp);
2390 1.215 dyoung #endif
2391 1.215 dyoung return ENETRESET;
2392 1.211 dyoung default:
2393 1.223 dyoung return ENOTTY;
2394 1.211 dyoung }
2395 1.211 dyoung return 0;
2396 1.211 dyoung }
2397 1.211 dyoung
2398 1.235 dyoung int
2399 1.284 rtr ifaddrpref_ioctl(struct socket *so, u_long cmd, void *data, struct ifnet *ifp)
2400 1.235 dyoung {
2401 1.235 dyoung struct if_addrprefreq *ifap = (struct if_addrprefreq *)data;
2402 1.235 dyoung struct ifaddr *ifa;
2403 1.235 dyoung const struct sockaddr *any, *sa;
2404 1.235 dyoung union {
2405 1.235 dyoung struct sockaddr sa;
2406 1.235 dyoung struct sockaddr_storage ss;
2407 1.236 jakllsch } u, v;
2408 1.235 dyoung
2409 1.235 dyoung switch (cmd) {
2410 1.235 dyoung case SIOCSIFADDRPREF:
2411 1.284 rtr if (kauth_authorize_network(curlwp->l_cred, KAUTH_NETWORK_INTERFACE,
2412 1.235 dyoung KAUTH_REQ_NETWORK_INTERFACE_SETPRIV, ifp, (void *)cmd,
2413 1.235 dyoung NULL) != 0)
2414 1.235 dyoung return EPERM;
2415 1.235 dyoung case SIOCGIFADDRPREF:
2416 1.235 dyoung break;
2417 1.235 dyoung default:
2418 1.235 dyoung return EOPNOTSUPP;
2419 1.235 dyoung }
2420 1.235 dyoung
2421 1.235 dyoung /* sanity checks */
2422 1.235 dyoung if (data == NULL || ifp == NULL) {
2423 1.235 dyoung panic("invalid argument to %s", __func__);
2424 1.235 dyoung /*NOTREACHED*/
2425 1.235 dyoung }
2426 1.235 dyoung
2427 1.235 dyoung /* address must be specified on ADD and DELETE */
2428 1.235 dyoung sa = sstocsa(&ifap->ifap_addr);
2429 1.235 dyoung if (sa->sa_family != sofamily(so))
2430 1.235 dyoung return EINVAL;
2431 1.235 dyoung if ((any = sockaddr_any(sa)) == NULL || sa->sa_len != any->sa_len)
2432 1.235 dyoung return EINVAL;
2433 1.235 dyoung
2434 1.236 jakllsch sockaddr_externalize(&v.sa, sizeof(v.ss), sa);
2435 1.236 jakllsch
2436 1.235 dyoung IFADDR_FOREACH(ifa, ifp) {
2437 1.235 dyoung if (ifa->ifa_addr->sa_family != sa->sa_family)
2438 1.235 dyoung continue;
2439 1.235 dyoung sockaddr_externalize(&u.sa, sizeof(u.ss), ifa->ifa_addr);
2440 1.236 jakllsch if (sockaddr_cmp(&u.sa, &v.sa) == 0)
2441 1.235 dyoung break;
2442 1.235 dyoung }
2443 1.235 dyoung if (ifa == NULL)
2444 1.235 dyoung return EADDRNOTAVAIL;
2445 1.235 dyoung
2446 1.235 dyoung switch (cmd) {
2447 1.235 dyoung case SIOCSIFADDRPREF:
2448 1.235 dyoung ifa->ifa_preference = ifap->ifap_preference;
2449 1.235 dyoung return 0;
2450 1.235 dyoung case SIOCGIFADDRPREF:
2451 1.235 dyoung /* fill in the if_laddrreq structure */
2452 1.235 dyoung (void)sockaddr_copy(sstosa(&ifap->ifap_addr),
2453 1.235 dyoung sizeof(ifap->ifap_addr), ifa->ifa_addr);
2454 1.235 dyoung ifap->ifap_preference = ifa->ifa_preference;
2455 1.235 dyoung return 0;
2456 1.235 dyoung default:
2457 1.235 dyoung return EOPNOTSUPP;
2458 1.235 dyoung }
2459 1.235 dyoung }
2460 1.235 dyoung
2461 1.1 cgd /*
2462 1.1 cgd * Interface ioctls.
2463 1.1 cgd */
2464 1.273 pooka static int
2465 1.273 pooka doifioctl(struct socket *so, u_long cmd, void *data, struct lwp *l)
2466 1.1 cgd {
2467 1.61 augustss struct ifnet *ifp;
2468 1.61 augustss struct ifreq *ifr;
2469 1.217 martin int error = 0;
2470 1.191 christos #if defined(COMPAT_OSOCK) || defined(COMPAT_OIFREQ)
2471 1.191 christos u_long ocmd = cmd;
2472 1.191 christos #endif
2473 1.49 itojun short oif_flags;
2474 1.186 christos #ifdef COMPAT_OIFREQ
2475 1.186 christos struct ifreq ifrb;
2476 1.187 xtraeme struct oifreq *oifr = NULL;
2477 1.186 christos #endif
2478 1.292 christos int r;
2479 1.336 ozaki struct psref psref;
2480 1.339 ozaki int bound;
2481 1.1 cgd
2482 1.1 cgd switch (cmd) {
2483 1.186 christos #ifdef COMPAT_OIFREQ
2484 1.186 christos case OSIOCGIFCONF:
2485 1.186 christos case OOSIOCGIFCONF:
2486 1.186 christos return compat_ifconf(cmd, data);
2487 1.186 christos #endif
2488 1.232 christos #ifdef COMPAT_OIFDATA
2489 1.232 christos case OSIOCGIFDATA:
2490 1.232 christos case OSIOCZIFDATA:
2491 1.232 christos return compat_ifdatareq(l, cmd, data);
2492 1.232 christos #endif
2493 1.1 cgd case SIOCGIFCONF:
2494 1.185 dyoung return ifconf(cmd, data);
2495 1.231 dyoung case SIOCINITIFADDR:
2496 1.231 dyoung return EPERM;
2497 1.1 cgd }
2498 1.191 christos
2499 1.186 christos #ifdef COMPAT_OIFREQ
2500 1.196 skd cmd = compat_cvtcmd(cmd);
2501 1.186 christos if (cmd != ocmd) {
2502 1.186 christos oifr = data;
2503 1.186 christos data = ifr = &ifrb;
2504 1.186 christos ifreqo2n(oifr, ifr);
2505 1.186 christos } else
2506 1.186 christos #endif
2507 1.186 christos ifr = data;
2508 1.63 thorpej
2509 1.63 thorpej switch (cmd) {
2510 1.63 thorpej case SIOCIFCREATE:
2511 1.63 thorpej case SIOCIFDESTROY:
2512 1.339 ozaki bound = curlwp_bind();
2513 1.185 dyoung if (l != NULL) {
2514 1.336 ozaki ifp = if_get(ifr->ifr_name, &psref);
2515 1.174 elad error = kauth_authorize_network(l->l_cred,
2516 1.174 elad KAUTH_NETWORK_INTERFACE,
2517 1.174 elad KAUTH_REQ_NETWORK_INTERFACE_SETPRIV, ifp,
2518 1.174 elad (void *)cmd, NULL);
2519 1.336 ozaki if (ifp != NULL)
2520 1.336 ozaki if_put(ifp, &psref);
2521 1.336 ozaki if (error != 0) {
2522 1.339 ozaki curlwp_bindx(bound);
2523 1.151 yamt return error;
2524 1.336 ozaki }
2525 1.151 yamt }
2526 1.292 christos mutex_enter(&if_clone_mtx);
2527 1.292 christos r = (cmd == SIOCIFCREATE) ?
2528 1.64 thorpej if_clone_create(ifr->ifr_name) :
2529 1.185 dyoung if_clone_destroy(ifr->ifr_name);
2530 1.292 christos mutex_exit(&if_clone_mtx);
2531 1.339 ozaki curlwp_bindx(bound);
2532 1.292 christos return r;
2533 1.67 thorpej
2534 1.67 thorpej case SIOCIFGCLONERS:
2535 1.315 martin {
2536 1.315 martin struct if_clonereq *req = (struct if_clonereq *)data;
2537 1.315 martin return if_clone_list(req->ifcr_count, req->ifcr_buffer,
2538 1.315 martin &req->ifcr_total);
2539 1.315 martin }
2540 1.63 thorpej }
2541 1.63 thorpej
2542 1.339 ozaki bound = curlwp_bind();
2543 1.336 ozaki ifp = if_get(ifr->ifr_name, &psref);
2544 1.336 ozaki if (ifp == NULL) {
2545 1.339 ozaki curlwp_bindx(bound);
2546 1.185 dyoung return ENXIO;
2547 1.336 ozaki }
2548 1.151 yamt
2549 1.151 yamt switch (cmd) {
2550 1.233 christos case SIOCALIFADDR:
2551 1.233 christos case SIOCDLIFADDR:
2552 1.233 christos case SIOCSIFADDRPREF:
2553 1.151 yamt case SIOCSIFFLAGS:
2554 1.151 yamt case SIOCSIFCAP:
2555 1.151 yamt case SIOCSIFMETRIC:
2556 1.151 yamt case SIOCZIFDATA:
2557 1.151 yamt case SIOCSIFMTU:
2558 1.151 yamt case SIOCSIFPHYADDR:
2559 1.151 yamt case SIOCDIFPHYADDR:
2560 1.151 yamt #ifdef INET6
2561 1.151 yamt case SIOCSIFPHYADDR_IN6:
2562 1.151 yamt #endif
2563 1.151 yamt case SIOCSLIFPHYADDR:
2564 1.151 yamt case SIOCADDMULTI:
2565 1.151 yamt case SIOCDELMULTI:
2566 1.151 yamt case SIOCSIFMEDIA:
2567 1.154 perry case SIOCSDRVSPEC:
2568 1.196 skd case SIOCG80211:
2569 1.196 skd case SIOCS80211:
2570 1.151 yamt case SIOCS80211NWID:
2571 1.151 yamt case SIOCS80211NWKEY:
2572 1.151 yamt case SIOCS80211POWER:
2573 1.151 yamt case SIOCS80211BSSID:
2574 1.151 yamt case SIOCS80211CHANNEL:
2575 1.249 pooka case SIOCSLINKSTR:
2576 1.185 dyoung if (l != NULL) {
2577 1.174 elad error = kauth_authorize_network(l->l_cred,
2578 1.174 elad KAUTH_NETWORK_INTERFACE,
2579 1.174 elad KAUTH_REQ_NETWORK_INTERFACE_SETPRIV, ifp,
2580 1.174 elad (void *)cmd, NULL);
2581 1.185 dyoung if (error != 0)
2582 1.336 ozaki goto out;
2583 1.151 yamt }
2584 1.151 yamt }
2585 1.151 yamt
2586 1.49 itojun oif_flags = ifp->if_flags;
2587 1.1 cgd
2588 1.336 ozaki mutex_enter(ifp->if_ioctl_lock);
2589 1.336 ozaki
2590 1.231 dyoung error = (*ifp->if_ioctl)(ifp, cmd, data);
2591 1.231 dyoung if (error != ENOTTY)
2592 1.231 dyoung ;
2593 1.231 dyoung else if (so->so_proto == NULL)
2594 1.252 dyoung error = EOPNOTSUPP;
2595 1.231 dyoung else {
2596 1.161 christos #ifdef COMPAT_OSOCK
2597 1.186 christos error = compat_ifioctl(so, ocmd, cmd, data, l);
2598 1.161 christos #else
2599 1.283 rtr error = (*so->so_proto->pr_usrreqs->pr_ioctl)(so,
2600 1.284 rtr cmd, data, ifp);
2601 1.1 cgd #endif
2602 1.49 itojun }
2603 1.1 cgd
2604 1.49 itojun if (((oif_flags ^ ifp->if_flags) & IFF_UP) != 0) {
2605 1.312 roy if ((ifp->if_flags & IFF_UP) != 0) {
2606 1.217 martin int s = splnet();
2607 1.312 roy if_up(ifp);
2608 1.49 itojun splx(s);
2609 1.49 itojun }
2610 1.1 cgd }
2611 1.186 christos #ifdef COMPAT_OIFREQ
2612 1.186 christos if (cmd != ocmd)
2613 1.246 christos ifreqn2o(oifr, ifr);
2614 1.186 christos #endif
2615 1.49 itojun
2616 1.336 ozaki mutex_exit(ifp->if_ioctl_lock);
2617 1.336 ozaki out:
2618 1.336 ozaki if_put(ifp, &psref);
2619 1.339 ozaki curlwp_bindx(bound);
2620 1.185 dyoung return error;
2621 1.1 cgd }
2622 1.1 cgd
2623 1.1 cgd /*
2624 1.1 cgd * Return interface configuration
2625 1.1 cgd * of system. List may be used
2626 1.1 cgd * in later ioctl's (above) to get
2627 1.1 cgd * other information.
2628 1.200 gdt *
2629 1.200 gdt * Each record is a struct ifreq. Before the addition of
2630 1.200 gdt * sockaddr_storage, the API rule was that sockaddr flavors that did
2631 1.200 gdt * not fit would extend beyond the struct ifreq, with the next struct
2632 1.200 gdt * ifreq starting sa_len beyond the struct sockaddr. Because the
2633 1.200 gdt * union in struct ifreq includes struct sockaddr_storage, every kind
2634 1.200 gdt * of sockaddr must fit. Thus, there are no longer any overlength
2635 1.200 gdt * records.
2636 1.200 gdt *
2637 1.200 gdt * Records are added to the user buffer if they fit, and ifc_len is
2638 1.200 gdt * adjusted to the length that was written. Thus, the user is only
2639 1.200 gdt * assured of getting the complete list if ifc_len on return is at
2640 1.200 gdt * least sizeof(struct ifreq) less than it was on entry.
2641 1.200 gdt *
2642 1.200 gdt * If the user buffer pointer is NULL, this routine copies no data and
2643 1.200 gdt * returns the amount of space that would be needed.
2644 1.200 gdt *
2645 1.200 gdt * Invariants:
2646 1.200 gdt * ifrp points to the next part of the user's buffer to be used. If
2647 1.200 gdt * ifrp != NULL, space holds the number of bytes remaining that we may
2648 1.200 gdt * write at ifrp. Otherwise, space holds the number of bytes that
2649 1.200 gdt * would have been written had there been adequate space.
2650 1.1 cgd */
2651 1.1 cgd /*ARGSUSED*/
2652 1.302 ozaki static int
2653 1.183 christos ifconf(u_long cmd, void *data)
2654 1.1 cgd {
2655 1.61 augustss struct ifconf *ifc = (struct ifconf *)data;
2656 1.61 augustss struct ifnet *ifp;
2657 1.61 augustss struct ifaddr *ifa;
2658 1.304 ozaki struct ifreq ifr, *ifrp = NULL;
2659 1.304 ozaki int space = 0, error = 0;
2660 1.200 gdt const int sz = (int)sizeof(struct ifreq);
2661 1.304 ozaki const bool docopy = ifc->ifc_req != NULL;
2662 1.334 ozaki int s;
2663 1.339 ozaki int bound;
2664 1.334 ozaki struct psref psref;
2665 1.1 cgd
2666 1.304 ozaki if (docopy) {
2667 1.190 enami space = ifc->ifc_len;
2668 1.304 ozaki ifrp = ifc->ifc_req;
2669 1.304 ozaki }
2670 1.304 ozaki
2671 1.339 ozaki bound = curlwp_bind();
2672 1.334 ozaki s = pserialize_read_enter();
2673 1.334 ozaki IFNET_READER_FOREACH(ifp) {
2674 1.334 ozaki psref_acquire(&psref, &ifp->if_psref, ifnet_psref_class);
2675 1.334 ozaki pserialize_read_exit(s);
2676 1.334 ozaki
2677 1.175 christos (void)strncpy(ifr.ifr_name, ifp->if_xname,
2678 1.173 christos sizeof(ifr.ifr_name));
2679 1.334 ozaki if (ifr.ifr_name[sizeof(ifr.ifr_name) - 1] != '\0') {
2680 1.334 ozaki error = ENAMETOOLONG;
2681 1.334 ozaki goto release_exit;
2682 1.334 ozaki }
2683 1.205 dyoung if (IFADDR_EMPTY(ifp)) {
2684 1.200 gdt /* Interface with no addresses - send zero sockaddr. */
2685 1.127 christos memset(&ifr.ifr_addr, 0, sizeof(ifr.ifr_addr));
2686 1.304 ozaki if (!docopy) {
2687 1.218 dyoung space += sz;
2688 1.218 dyoung continue;
2689 1.218 dyoung }
2690 1.218 dyoung if (space >= sz) {
2691 1.218 dyoung error = copyout(&ifr, ifrp, sz);
2692 1.218 dyoung if (error != 0)
2693 1.334 ozaki goto release_exit;
2694 1.218 dyoung ifrp++;
2695 1.218 dyoung space -= sz;
2696 1.70 mellon }
2697 1.127 christos }
2698 1.127 christos
2699 1.204 dyoung IFADDR_FOREACH(ifa, ifp) {
2700 1.61 augustss struct sockaddr *sa = ifa->ifa_addr;
2701 1.200 gdt /* all sockaddrs must fit in sockaddr_storage */
2702 1.200 gdt KASSERT(sa->sa_len <= sizeof(ifr.ifr_ifru));
2703 1.200 gdt
2704 1.304 ozaki if (!docopy) {
2705 1.218 dyoung space += sz;
2706 1.218 dyoung continue;
2707 1.218 dyoung }
2708 1.218 dyoung memcpy(&ifr.ifr_space, sa, sa->sa_len);
2709 1.218 dyoung if (space >= sz) {
2710 1.218 dyoung error = copyout(&ifr, ifrp, sz);
2711 1.218 dyoung if (error != 0)
2712 1.334 ozaki goto release_exit;
2713 1.218 dyoung ifrp++; space -= sz;
2714 1.1 cgd }
2715 1.1 cgd }
2716 1.334 ozaki
2717 1.334 ozaki s = pserialize_read_enter();
2718 1.334 ozaki psref_release(&psref, &ifp->if_psref, ifnet_psref_class);
2719 1.1 cgd }
2720 1.334 ozaki pserialize_read_exit(s);
2721 1.339 ozaki curlwp_bindx(bound);
2722 1.334 ozaki
2723 1.304 ozaki if (docopy) {
2724 1.200 gdt KASSERT(0 <= space && space <= ifc->ifc_len);
2725 1.127 christos ifc->ifc_len -= space;
2726 1.218 dyoung } else {
2727 1.200 gdt KASSERT(space >= 0);
2728 1.200 gdt ifc->ifc_len = space;
2729 1.200 gdt }
2730 1.190 enami return (0);
2731 1.334 ozaki
2732 1.334 ozaki release_exit:
2733 1.334 ozaki psref_release(&psref, &ifp->if_psref, ifnet_psref_class);
2734 1.339 ozaki curlwp_bindx(bound);
2735 1.334 ozaki return error;
2736 1.1 cgd }
2737 1.133 jonathan
2738 1.198 dyoung int
2739 1.247 christos ifreq_setaddr(u_long cmd, struct ifreq *ifr, const struct sockaddr *sa)
2740 1.198 dyoung {
2741 1.198 dyoung uint8_t len;
2742 1.247 christos #ifdef COMPAT_OIFREQ
2743 1.247 christos struct ifreq ifrb;
2744 1.247 christos struct oifreq *oifr = NULL;
2745 1.247 christos u_long ocmd = cmd;
2746 1.247 christos cmd = compat_cvtcmd(cmd);
2747 1.247 christos if (cmd != ocmd) {
2748 1.247 christos oifr = (struct oifreq *)(void *)ifr;
2749 1.247 christos ifr = &ifrb;
2750 1.247 christos ifreqo2n(oifr, ifr);
2751 1.247 christos len = sizeof(oifr->ifr_addr);
2752 1.247 christos } else
2753 1.247 christos #endif
2754 1.247 christos len = sizeof(ifr->ifr_ifru.ifru_space);
2755 1.198 dyoung
2756 1.198 dyoung if (len < sa->sa_len)
2757 1.198 dyoung return EFBIG;
2758 1.247 christos
2759 1.241 joerg memset(&ifr->ifr_addr, 0, len);
2760 1.202 dyoung sockaddr_copy(&ifr->ifr_addr, len, sa);
2761 1.247 christos
2762 1.247 christos #ifdef COMPAT_OIFREQ
2763 1.247 christos if (cmd != ocmd)
2764 1.247 christos ifreqn2o(oifr, ifr);
2765 1.247 christos #endif
2766 1.198 dyoung return 0;
2767 1.198 dyoung }
2768 1.198 dyoung
2769 1.155 christos /*
2770 1.332 knakahar * wrapper function for the drivers which doesn't have if_transmit().
2771 1.155 christos */
2772 1.155 christos int
2773 1.332 knakahar if_transmit(struct ifnet *ifp, struct mbuf *m)
2774 1.155 christos {
2775 1.332 knakahar int s, error;
2776 1.332 knakahar
2777 1.332 knakahar s = splnet();
2778 1.155 christos
2779 1.330 knakahar IFQ_ENQUEUE(&ifp->if_snd, m, error);
2780 1.332 knakahar if (error != 0) {
2781 1.332 knakahar /* mbuf is already freed */
2782 1.185 dyoung goto out;
2783 1.332 knakahar }
2784 1.332 knakahar
2785 1.332 knakahar ifp->if_obytes += m->m_pkthdr.len;;
2786 1.332 knakahar if (m->m_flags & M_MCAST)
2787 1.155 christos ifp->if_omcasts++;
2788 1.332 knakahar
2789 1.155 christos if ((ifp->if_flags & IFF_OACTIVE) == 0)
2790 1.155 christos (*ifp->if_start)(ifp);
2791 1.185 dyoung out:
2792 1.155 christos splx(s);
2793 1.332 knakahar
2794 1.155 christos return error;
2795 1.155 christos }
2796 1.155 christos
2797 1.155 christos /*
2798 1.332 knakahar * Queue message on interface, and start output if interface
2799 1.332 knakahar * not yet active.
2800 1.332 knakahar */
2801 1.332 knakahar int
2802 1.332 knakahar ifq_enqueue(struct ifnet *ifp, struct mbuf *m)
2803 1.332 knakahar {
2804 1.332 knakahar
2805 1.332 knakahar return (*ifp->if_transmit)(ifp, m);
2806 1.332 knakahar }
2807 1.332 knakahar
2808 1.332 knakahar /*
2809 1.155 christos * Queue message on interface, possibly using a second fast queue
2810 1.155 christos */
2811 1.155 christos int
2812 1.330 knakahar ifq_enqueue2(struct ifnet *ifp, struct ifqueue *ifq, struct mbuf *m)
2813 1.155 christos {
2814 1.155 christos int error = 0;
2815 1.155 christos
2816 1.155 christos if (ifq != NULL
2817 1.155 christos #ifdef ALTQ
2818 1.155 christos && ALTQ_IS_ENABLED(&ifp->if_snd) == 0
2819 1.155 christos #endif
2820 1.155 christos ) {
2821 1.155 christos if (IF_QFULL(ifq)) {
2822 1.155 christos IF_DROP(&ifp->if_snd);
2823 1.155 christos m_freem(m);
2824 1.155 christos if (error == 0)
2825 1.155 christos error = ENOBUFS;
2826 1.185 dyoung } else
2827 1.155 christos IF_ENQUEUE(ifq, m);
2828 1.155 christos } else
2829 1.330 knakahar IFQ_ENQUEUE(&ifp->if_snd, m, error);
2830 1.155 christos if (error != 0) {
2831 1.155 christos ++ifp->if_oerrors;
2832 1.155 christos return error;
2833 1.155 christos }
2834 1.155 christos return 0;
2835 1.155 christos }
2836 1.155 christos
2837 1.252 dyoung int
2838 1.252 dyoung if_addr_init(ifnet_t *ifp, struct ifaddr *ifa, const bool src)
2839 1.252 dyoung {
2840 1.252 dyoung int rc;
2841 1.252 dyoung
2842 1.252 dyoung if (ifp->if_initaddr != NULL)
2843 1.252 dyoung rc = (*ifp->if_initaddr)(ifp, ifa, src);
2844 1.252 dyoung else if (src ||
2845 1.336 ozaki /* FIXME: may not hold if_ioctl_lock */
2846 1.252 dyoung (rc = (*ifp->if_ioctl)(ifp, SIOCSIFDSTADDR, ifa)) == ENOTTY)
2847 1.252 dyoung rc = (*ifp->if_ioctl)(ifp, SIOCINITIFADDR, ifa);
2848 1.252 dyoung
2849 1.252 dyoung return rc;
2850 1.252 dyoung }
2851 1.252 dyoung
2852 1.252 dyoung int
2853 1.309 roy if_do_dad(struct ifnet *ifp)
2854 1.309 roy {
2855 1.309 roy if ((ifp->if_flags & IFF_LOOPBACK) != 0)
2856 1.309 roy return 0;
2857 1.309 roy
2858 1.309 roy switch (ifp->if_type) {
2859 1.309 roy case IFT_FAITH:
2860 1.309 roy /*
2861 1.309 roy * These interfaces do not have the IFF_LOOPBACK flag,
2862 1.309 roy * but loop packets back. We do not have to do DAD on such
2863 1.309 roy * interfaces. We should even omit it, because loop-backed
2864 1.309 roy * responses would confuse the DAD procedure.
2865 1.309 roy */
2866 1.309 roy return 0;
2867 1.309 roy default:
2868 1.309 roy /*
2869 1.309 roy * Our DAD routine requires the interface up and running.
2870 1.309 roy * However, some interfaces can be up before the RUNNING
2871 1.309 roy * status. Additionaly, users may try to assign addresses
2872 1.309 roy * before the interface becomes up (or running).
2873 1.309 roy * We simply skip DAD in such a case as a work around.
2874 1.309 roy * XXX: we should rather mark "tentative" on such addresses,
2875 1.309 roy * and do DAD after the interface becomes ready.
2876 1.309 roy */
2877 1.309 roy if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) !=
2878 1.309 roy (IFF_UP|IFF_RUNNING))
2879 1.309 roy return 0;
2880 1.309 roy
2881 1.309 roy return 1;
2882 1.309 roy }
2883 1.309 roy }
2884 1.309 roy
2885 1.309 roy int
2886 1.252 dyoung if_flags_set(ifnet_t *ifp, const short flags)
2887 1.252 dyoung {
2888 1.252 dyoung int rc;
2889 1.252 dyoung
2890 1.252 dyoung if (ifp->if_setflags != NULL)
2891 1.252 dyoung rc = (*ifp->if_setflags)(ifp, flags);
2892 1.252 dyoung else {
2893 1.259 dyoung short cantflags, chgdflags;
2894 1.256 dyoung struct ifreq ifr;
2895 1.256 dyoung
2896 1.259 dyoung chgdflags = ifp->if_flags ^ flags;
2897 1.259 dyoung cantflags = chgdflags & IFF_CANTCHANGE;
2898 1.256 dyoung
2899 1.256 dyoung if (cantflags != 0)
2900 1.256 dyoung ifp->if_flags ^= cantflags;
2901 1.256 dyoung
2902 1.259 dyoung /* Traditionally, we do not call if_ioctl after
2903 1.259 dyoung * setting/clearing only IFF_PROMISC if the interface
2904 1.259 dyoung * isn't IFF_UP. Uphold that tradition.
2905 1.259 dyoung */
2906 1.259 dyoung if (chgdflags == IFF_PROMISC && (ifp->if_flags & IFF_UP) == 0)
2907 1.259 dyoung return 0;
2908 1.259 dyoung
2909 1.259 dyoung memset(&ifr, 0, sizeof(ifr));
2910 1.259 dyoung
2911 1.256 dyoung ifr.ifr_flags = flags & ~IFF_CANTCHANGE;
2912 1.336 ozaki /* FIXME: may not hold if_ioctl_lock */
2913 1.252 dyoung rc = (*ifp->if_ioctl)(ifp, SIOCSIFFLAGS, &ifr);
2914 1.256 dyoung
2915 1.256 dyoung if (rc != 0 && cantflags != 0)
2916 1.256 dyoung ifp->if_flags ^= cantflags;
2917 1.252 dyoung }
2918 1.252 dyoung
2919 1.252 dyoung return rc;
2920 1.252 dyoung }
2921 1.252 dyoung
2922 1.252 dyoung int
2923 1.252 dyoung if_mcast_op(ifnet_t *ifp, const unsigned long cmd, const struct sockaddr *sa)
2924 1.252 dyoung {
2925 1.252 dyoung int rc;
2926 1.252 dyoung struct ifreq ifr;
2927 1.252 dyoung
2928 1.252 dyoung if (ifp->if_mcastop != NULL)
2929 1.252 dyoung rc = (*ifp->if_mcastop)(ifp, cmd, sa);
2930 1.252 dyoung else {
2931 1.252 dyoung ifreq_setaddr(cmd, &ifr, sa);
2932 1.252 dyoung rc = (*ifp->if_ioctl)(ifp, cmd, &ifr);
2933 1.252 dyoung }
2934 1.252 dyoung
2935 1.252 dyoung return rc;
2936 1.252 dyoung }
2937 1.155 christos
2938 1.234 dyoung static void
2939 1.234 dyoung sysctl_sndq_setup(struct sysctllog **clog, const char *ifname,
2940 1.234 dyoung struct ifaltq *ifq)
2941 1.234 dyoung {
2942 1.234 dyoung const struct sysctlnode *cnode, *rnode;
2943 1.234 dyoung
2944 1.234 dyoung if (sysctl_createv(clog, 0, NULL, &rnode,
2945 1.234 dyoung CTLFLAG_PERMANENT,
2946 1.234 dyoung CTLTYPE_NODE, "interfaces",
2947 1.234 dyoung SYSCTL_DESCR("Per-interface controls"),
2948 1.234 dyoung NULL, 0, NULL, 0,
2949 1.272 pooka CTL_NET, CTL_CREATE, CTL_EOL) != 0)
2950 1.234 dyoung goto bad;
2951 1.234 dyoung
2952 1.234 dyoung if (sysctl_createv(clog, 0, &rnode, &rnode,
2953 1.234 dyoung CTLFLAG_PERMANENT,
2954 1.234 dyoung CTLTYPE_NODE, ifname,
2955 1.234 dyoung SYSCTL_DESCR("Interface controls"),
2956 1.234 dyoung NULL, 0, NULL, 0,
2957 1.234 dyoung CTL_CREATE, CTL_EOL) != 0)
2958 1.234 dyoung goto bad;
2959 1.234 dyoung
2960 1.234 dyoung if (sysctl_createv(clog, 0, &rnode, &rnode,
2961 1.234 dyoung CTLFLAG_PERMANENT,
2962 1.234 dyoung CTLTYPE_NODE, "sndq",
2963 1.234 dyoung SYSCTL_DESCR("Interface output queue controls"),
2964 1.234 dyoung NULL, 0, NULL, 0,
2965 1.234 dyoung CTL_CREATE, CTL_EOL) != 0)
2966 1.234 dyoung goto bad;
2967 1.234 dyoung
2968 1.234 dyoung if (sysctl_createv(clog, 0, &rnode, &cnode,
2969 1.234 dyoung CTLFLAG_PERMANENT,
2970 1.234 dyoung CTLTYPE_INT, "len",
2971 1.234 dyoung SYSCTL_DESCR("Current output queue length"),
2972 1.234 dyoung NULL, 0, &ifq->ifq_len, 0,
2973 1.234 dyoung CTL_CREATE, CTL_EOL) != 0)
2974 1.234 dyoung goto bad;
2975 1.234 dyoung
2976 1.234 dyoung if (sysctl_createv(clog, 0, &rnode, &cnode,
2977 1.234 dyoung CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
2978 1.234 dyoung CTLTYPE_INT, "maxlen",
2979 1.234 dyoung SYSCTL_DESCR("Maximum allowed output queue length"),
2980 1.234 dyoung NULL, 0, &ifq->ifq_maxlen, 0,
2981 1.234 dyoung CTL_CREATE, CTL_EOL) != 0)
2982 1.234 dyoung goto bad;
2983 1.234 dyoung
2984 1.234 dyoung if (sysctl_createv(clog, 0, &rnode, &cnode,
2985 1.234 dyoung CTLFLAG_PERMANENT,
2986 1.234 dyoung CTLTYPE_INT, "drops",
2987 1.234 dyoung SYSCTL_DESCR("Packets dropped due to full output queue"),
2988 1.234 dyoung NULL, 0, &ifq->ifq_drops, 0,
2989 1.234 dyoung CTL_CREATE, CTL_EOL) != 0)
2990 1.234 dyoung goto bad;
2991 1.234 dyoung
2992 1.234 dyoung return;
2993 1.234 dyoung bad:
2994 1.234 dyoung printf("%s: could not attach sysctl nodes\n", ifname);
2995 1.234 dyoung return;
2996 1.234 dyoung }
2997 1.234 dyoung
2998 1.138 drochner #if defined(INET) || defined(INET6)
2999 1.276 rmind
3000 1.276 rmind #define SYSCTL_NET_PKTQ(q, cn, c) \
3001 1.276 rmind static int \
3002 1.276 rmind sysctl_net_##q##_##cn(SYSCTLFN_ARGS) \
3003 1.276 rmind { \
3004 1.276 rmind return sysctl_pktq_count(SYSCTLFN_CALL(rnode), q, c); \
3005 1.276 rmind }
3006 1.276 rmind
3007 1.276 rmind #if defined(INET)
3008 1.279 rmind static int
3009 1.279 rmind sysctl_net_ip_pktq_maxlen(SYSCTLFN_ARGS)
3010 1.279 rmind {
3011 1.279 rmind return sysctl_pktq_maxlen(SYSCTLFN_CALL(rnode), ip_pktq);
3012 1.279 rmind }
3013 1.276 rmind SYSCTL_NET_PKTQ(ip_pktq, items, PKTQ_NITEMS)
3014 1.276 rmind SYSCTL_NET_PKTQ(ip_pktq, drops, PKTQ_DROPS)
3015 1.276 rmind #endif
3016 1.279 rmind
3017 1.276 rmind #if defined(INET6)
3018 1.279 rmind static int
3019 1.279 rmind sysctl_net_ip6_pktq_maxlen(SYSCTLFN_ARGS)
3020 1.279 rmind {
3021 1.279 rmind return sysctl_pktq_maxlen(SYSCTLFN_CALL(rnode), ip6_pktq);
3022 1.279 rmind }
3023 1.276 rmind SYSCTL_NET_PKTQ(ip6_pktq, items, PKTQ_NITEMS)
3024 1.276 rmind SYSCTL_NET_PKTQ(ip6_pktq, drops, PKTQ_DROPS)
3025 1.276 rmind #endif
3026 1.276 rmind
3027 1.136 atatat static void
3028 1.276 rmind sysctl_net_pktq_setup(struct sysctllog **clog, int pf)
3029 1.136 atatat {
3030 1.276 rmind sysctlfn len_func = NULL, maxlen_func = NULL, drops_func = NULL;
3031 1.276 rmind const char *pfname = NULL, *ipname = NULL;
3032 1.276 rmind int ipn = 0, qid = 0;
3033 1.276 rmind
3034 1.276 rmind switch (pf) {
3035 1.276 rmind #if defined(INET)
3036 1.276 rmind case PF_INET:
3037 1.276 rmind len_func = sysctl_net_ip_pktq_items;
3038 1.276 rmind maxlen_func = sysctl_net_ip_pktq_maxlen;
3039 1.276 rmind drops_func = sysctl_net_ip_pktq_drops;
3040 1.276 rmind pfname = "inet", ipn = IPPROTO_IP;
3041 1.276 rmind ipname = "ip", qid = IPCTL_IFQ;
3042 1.276 rmind break;
3043 1.276 rmind #endif
3044 1.276 rmind #if defined(INET6)
3045 1.276 rmind case PF_INET6:
3046 1.276 rmind len_func = sysctl_net_ip6_pktq_items;
3047 1.276 rmind maxlen_func = sysctl_net_ip6_pktq_maxlen;
3048 1.276 rmind drops_func = sysctl_net_ip6_pktq_drops;
3049 1.276 rmind pfname = "inet6", ipn = IPPROTO_IPV6;
3050 1.276 rmind ipname = "ip6", qid = IPV6CTL_IFQ;
3051 1.276 rmind break;
3052 1.276 rmind #endif
3053 1.276 rmind default:
3054 1.276 rmind KASSERT(false);
3055 1.276 rmind }
3056 1.136 atatat
3057 1.139 atatat sysctl_createv(clog, 0, NULL, NULL,
3058 1.139 atatat CTLFLAG_PERMANENT,
3059 1.136 atatat CTLTYPE_NODE, pfname, NULL,
3060 1.136 atatat NULL, 0, NULL, 0,
3061 1.136 atatat CTL_NET, pf, CTL_EOL);
3062 1.139 atatat sysctl_createv(clog, 0, NULL, NULL,
3063 1.139 atatat CTLFLAG_PERMANENT,
3064 1.136 atatat CTLTYPE_NODE, ipname, NULL,
3065 1.136 atatat NULL, 0, NULL, 0,
3066 1.136 atatat CTL_NET, pf, ipn, CTL_EOL);
3067 1.139 atatat sysctl_createv(clog, 0, NULL, NULL,
3068 1.139 atatat CTLFLAG_PERMANENT,
3069 1.142 atatat CTLTYPE_NODE, "ifq",
3070 1.142 atatat SYSCTL_DESCR("Protocol input queue controls"),
3071 1.139 atatat NULL, 0, NULL, 0,
3072 1.139 atatat CTL_NET, pf, ipn, qid, CTL_EOL);
3073 1.136 atatat
3074 1.139 atatat sysctl_createv(clog, 0, NULL, NULL,
3075 1.139 atatat CTLFLAG_PERMANENT,
3076 1.142 atatat CTLTYPE_INT, "len",
3077 1.142 atatat SYSCTL_DESCR("Current input queue length"),
3078 1.276 rmind len_func, 0, NULL, 0,
3079 1.136 atatat CTL_NET, pf, ipn, qid, IFQCTL_LEN, CTL_EOL);
3080 1.139 atatat sysctl_createv(clog, 0, NULL, NULL,
3081 1.139 atatat CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
3082 1.142 atatat CTLTYPE_INT, "maxlen",
3083 1.142 atatat SYSCTL_DESCR("Maximum allowed input queue length"),
3084 1.276 rmind maxlen_func, 0, NULL, 0,
3085 1.136 atatat CTL_NET, pf, ipn, qid, IFQCTL_MAXLEN, CTL_EOL);
3086 1.139 atatat sysctl_createv(clog, 0, NULL, NULL,
3087 1.139 atatat CTLFLAG_PERMANENT,
3088 1.142 atatat CTLTYPE_INT, "drops",
3089 1.142 atatat SYSCTL_DESCR("Packets dropped due to full input queue"),
3090 1.276 rmind drops_func, 0, NULL, 0,
3091 1.136 atatat CTL_NET, pf, ipn, qid, IFQCTL_DROPS, CTL_EOL);
3092 1.136 atatat }
3093 1.138 drochner #endif /* INET || INET6 */
3094 1.280 joerg
3095 1.280 joerg static int
3096 1.280 joerg if_sdl_sysctl(SYSCTLFN_ARGS)
3097 1.280 joerg {
3098 1.280 joerg struct ifnet *ifp;
3099 1.280 joerg const struct sockaddr_dl *sdl;
3100 1.340 ozaki struct psref psref;
3101 1.340 ozaki int error = 0;
3102 1.340 ozaki int bound;
3103 1.280 joerg
3104 1.280 joerg if (namelen != 1)
3105 1.280 joerg return EINVAL;
3106 1.280 joerg
3107 1.340 ozaki bound = curlwp_bind();
3108 1.340 ozaki ifp = if_get_byindex(name[0], &psref);
3109 1.340 ozaki if (ifp == NULL) {
3110 1.340 ozaki error = ENODEV;
3111 1.341 riastrad goto out0;
3112 1.340 ozaki }
3113 1.280 joerg
3114 1.280 joerg sdl = ifp->if_sadl;
3115 1.280 joerg if (sdl == NULL) {
3116 1.280 joerg *oldlenp = 0;
3117 1.341 riastrad goto out1;
3118 1.280 joerg }
3119 1.280 joerg
3120 1.280 joerg if (oldp == NULL) {
3121 1.280 joerg *oldlenp = sdl->sdl_alen;
3122 1.341 riastrad goto out1;
3123 1.280 joerg }
3124 1.280 joerg
3125 1.280 joerg if (*oldlenp >= sdl->sdl_alen)
3126 1.280 joerg *oldlenp = sdl->sdl_alen;
3127 1.340 ozaki error = sysctl_copyout(l, &sdl->sdl_data[sdl->sdl_nlen], oldp, *oldlenp);
3128 1.341 riastrad out1:
3129 1.340 ozaki if_put(ifp, &psref);
3130 1.341 riastrad out0:
3131 1.340 ozaki curlwp_bindx(bound);
3132 1.340 ozaki return error;
3133 1.280 joerg }
3134 1.280 joerg
3135 1.280 joerg SYSCTL_SETUP(sysctl_net_sdl_setup, "sysctl net.sdl subtree setup")
3136 1.280 joerg {
3137 1.280 joerg const struct sysctlnode *rnode = NULL;
3138 1.280 joerg
3139 1.280 joerg sysctl_createv(clog, 0, NULL, &rnode,
3140 1.280 joerg CTLFLAG_PERMANENT,
3141 1.280 joerg CTLTYPE_NODE, "sdl",
3142 1.280 joerg SYSCTL_DESCR("Get active link-layer address"),
3143 1.280 joerg if_sdl_sysctl, 0, NULL, 0,
3144 1.280 joerg CTL_NET, CTL_CREATE, CTL_EOL);
3145 1.280 joerg }
3146