1 /* $NetBSD: netif.c,v 1.10 1997/09/06 13:57:14 drochner Exp $ */
2 /* $DragonFly: src/lib/libstand/netif.c,v 1.3 2005/12/11 02:27:26 swildner Exp $ */
5 * Copyright (c) 1993 Adam Glass
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by Adam Glass.
19 * 4. The name of the Author may not be used to endorse or promote products
20 * derived from this software without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY Adam Glass ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 #include <sys/param.h>
36 #include <sys/types.h>
37 #include <sys/cdefs.h>
38 #include <sys/mount.h>
41 #include <netinet/in.h>
42 #include <netinet/in_systm.h>
48 struct iodesc sockets[SOPEN_MAX];
56 * initialize the generic network interface layer
62 struct netif_driver *drv;
67 printf("netif_init: called\n");
69 for (d = 0; netif_drivers[d]; d++) {
70 drv = netif_drivers[d];
71 for (i = 0; i < drv->netif_nifs; i++)
72 drv->netif_ifs[i].dif_used = 0;
77 netif_match(struct netif *nif, void *machdep_hint)
79 struct netif_driver *drv = nif->nif_driver;
83 printf("%s%d: netif_match (%d)\n", drv->netif_bname,
84 nif->nif_unit, nif->nif_sel);
86 return drv->netif_match(nif, machdep_hint);
90 netif_select(void *machdep_hint)
92 int d, u, unit_done, s;
93 struct netif_driver *drv;
95 static struct netif best_if;
100 best_if.nif_driver = NULL;
102 for (d = 0; netif_drivers[d] != NULL; d++) {
103 cur_if.nif_driver = netif_drivers[d];
104 drv = cur_if.nif_driver;
106 for (u = 0; u < drv->netif_nifs; u++) {
112 printf("\t%s%d:", drv->netif_bname,
116 for (s = 0; s < drv->netif_ifs[u].dif_nsel; s++) {
119 if (drv->netif_ifs[u].dif_used & (1 << s)) {
122 printf(" [%d used]", s);
127 val = netif_match(&cur_if, machdep_hint);
130 printf(" [%d -> %d]", s, val);
132 if (val > best_val) {
144 if (best_if.nif_driver == NULL)
148 netif_ifs[best_if.nif_unit].dif_used |= (1 << best_if.nif_sel);
152 printf("netif_select: %s%d(%d) wins\n",
153 best_if.nif_driver->netif_bname,
154 best_if.nif_unit, best_if.nif_sel);
160 netif_probe(struct netif *nif, void *machdep_hint)
162 struct netif_driver *drv = nif->nif_driver;
166 printf("%s%d: netif_probe\n", drv->netif_bname, nif->nif_unit);
168 return drv->netif_probe(nif, machdep_hint);
172 netif_attach(struct netif *nif, struct iodesc *desc, void *machdep_hint)
174 struct netif_driver *drv = nif->nif_driver;
178 printf("%s%d: netif_attach\n", drv->netif_bname, nif->nif_unit);
180 desc->io_netif = nif;
182 if (drv->netif_init == NULL)
183 panic("%s%d: no netif_init support\n", drv->netif_bname,
186 drv->netif_init(desc, machdep_hint);
187 bzero(drv->netif_ifs[nif->nif_unit].dif_stats,
188 sizeof(struct netif_stats));
192 netif_detach(struct netif *nif)
194 struct netif_driver *drv = nif->nif_driver;
198 printf("%s%d: netif_detach\n", drv->netif_bname, nif->nif_unit);
201 if (drv->netif_end == NULL)
202 panic("%s%d: no netif_end support\n", drv->netif_bname,
209 netif_get(struct iodesc *desc, void *pkt, size_t len, time_t timo)
212 struct netif *nif = desc->io_netif;
214 struct netif_driver *drv = desc->io_netif->nif_driver;
219 printf("%s%d: netif_get\n", drv->netif_bname, nif->nif_unit);
222 if (drv->netif_get == NULL)
223 panic("%s%d: no netif_get support\n", drv->netif_bname,
226 rv = drv->netif_get(desc, pkt, len, timo);
229 printf("%s%d: netif_get returning %d\n", drv->netif_bname,
230 nif->nif_unit, (int)rv);
236 netif_put(struct iodesc *desc, void *pkt, size_t len)
239 struct netif *nif = desc->io_netif;
241 struct netif_driver *drv = desc->io_netif->nif_driver;
246 printf("%s%d: netif_put\n", drv->netif_bname, nif->nif_unit);
249 if (drv->netif_put == NULL)
250 panic("%s%d: no netif_put support\n", drv->netif_bname,
253 rv = drv->netif_put(desc, pkt, len);
256 printf("%s%d: netif_put returning %d\n", drv->netif_bname,
257 nif->nif_unit, (int)rv);
265 if (sock >= SOPEN_MAX) {
269 return (&sockets[sock]);
273 netif_open(void *machdep_hint)
279 /* find a free socket */
280 for (fd = 0, s = sockets; fd < SOPEN_MAX; fd++, s++)
281 if (s->io_netif == NULL)
287 bzero(s, sizeof(*s));
289 nif = netif_select(machdep_hint);
291 panic("netboot: no interfaces left untried");
292 if (netif_probe(nif, machdep_hint)) {
293 printf("netboot: couldn't probe %s%d\n",
294 nif->nif_driver->netif_bname, nif->nif_unit);
298 netif_attach(nif, s, machdep_hint);
304 netif_close(int sock)
306 if (sock >= SOPEN_MAX) {
310 netif_detach(sockets[sock].io_netif);
311 sockets[sock].io_netif = NULL;