1 /* 2 * Copyright (c) 1982, 1986, 1989, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * From: @(#)if.h 8.1 (Berkeley) 6/10/93 34 * $FreeBSD: src/sys/net/if_var.h,v 1.18.2.16 2003/04/15 18:11:19 fjoe Exp $ 35 * $DragonFly: src/sys/net/if_var.h,v 1.21 2005/01/23 13:47:24 joerg Exp $ 36 */ 37 38 #ifndef _NET_IF_VAR_H_ 39 #define _NET_IF_VAR_H_ 40 41 /* 42 * Structures defining a network interface, providing a packet 43 * transport mechanism (ala level 0 of the PUP protocols). 44 * 45 * Each interface accepts output datagrams of a specified maximum 46 * length, and provides higher level routines with input datagrams 47 * received from its medium. 48 * 49 * Output occurs when the routine if_output is called, with three parameters: 50 * (*ifp->if_output)(ifp, m, dst, rt) 51 * Here m is the mbuf chain to be sent and dst is the destination address. 52 * The output routine encapsulates the supplied datagram if necessary, 53 * and then transmits it on its medium. 54 * 55 * On input, each interface unwraps the data received by it, and either 56 * places it on the input queue of a internetwork datagram routine 57 * and posts the associated software interrupt, or passes the datagram to 58 * the routine if_input. It is called with the mbuf chain as parameter: 59 * (*ifp->if_input)(ifp, m) 60 * The input routine removes the protocol dependent header if necessary. 61 * 62 * Routines exist for locating interfaces by their addresses 63 * or for locating a interface on a certain network, as well as more general 64 * routing and gateway routines maintaining information used to locate 65 * interfaces. These routines live in the files if.c and route.c 66 */ 67 68 #ifdef __STDC__ 69 /* 70 * Forward structure declarations for function prototypes [sic]. 71 */ 72 struct mbuf; 73 struct proc; 74 struct rtentry; 75 struct rt_addrinfo; 76 struct socket; 77 struct ether_header; 78 struct ucred; 79 #endif 80 81 #include <sys/queue.h> /* get TAILQ macros */ 82 83 #ifdef _KERNEL 84 #include <sys/eventhandler.h> 85 #include <sys/mbuf.h> 86 #include <sys/systm.h> /* XXX */ 87 #endif /* _KERNEL */ 88 89 #define IF_DUNIT_NONE -1 90 91 TAILQ_HEAD(ifnethead, ifnet); /* we use TAILQs so that the order of */ 92 TAILQ_HEAD(ifaddrhead, ifaddr); /* instantiation is preserved in the list */ 93 TAILQ_HEAD(ifprefixhead, ifprefix); 94 LIST_HEAD(ifmultihead, ifmultiaddr); 95 96 /* 97 * Structure defining a queue for a network interface. 98 */ 99 struct ifqueue { 100 struct mbuf *ifq_head; 101 struct mbuf *ifq_tail; 102 int ifq_len; 103 int ifq_maxlen; 104 int ifq_drops; 105 }; 106 107 /* 108 * Structure defining a network interface. 109 * 110 * (Would like to call this struct ``if'', but C isn't PL/1.) 111 */ 112 113 /* 114 * NB: For FreeBSD, it is assumed that each NIC driver's softc starts with 115 * one of these structures, typically held within an arpcom structure. 116 * 117 * struct <foo>_softc { 118 * struct arpcom { 119 * struct ifnet ac_if; 120 * ... 121 * } <arpcom> ; 122 * ... 123 * }; 124 * 125 * The assumption is used in a number of places, including many 126 * files in sys/net, device drivers, and sys/dev/mii.c:miibus_attach(). 127 * 128 * Unfortunately devices' softc are opaque, so we depend on this layout 129 * to locate the struct ifnet from the softc in the generic code. 130 * 131 * Note that not all fields are used by drivers in the FreeBSD source 132 * tree. However, who knows what third party software does with fields 133 * marked as "unused", such as if_ipending, if_done, and if_poll*, 134 * so any attemt to redefine their meaning might end up in binary 135 * compatibility problems, even if the size of struct ifnet, and 136 * the size and position of its fields do not change. 137 * We just have to live with that. 138 */ 139 struct ifnet { 140 void *if_softc; /* pointer to driver state */ 141 TAILQ_ENTRY(ifnet) if_link; /* all struct ifnets are chained */ 142 char if_xname[IFNAMSIZ]; /* external name (name + unit) */ 143 const char *if_dname; /* driver name */ 144 int if_dunit; /* unit or IF_DUNIT_NONE */ 145 struct ifaddrhead if_addrhead; /* linked list of addresses per if */ 146 int if_pcount; /* number of promiscuous listeners */ 147 struct bpf_if *if_bpf; /* packet filter structure */ 148 u_short if_index; /* numeric abbreviation for this if */ 149 short if_timer; /* time 'til if_watchdog called */ 150 int if_flags; /* up/down, broadcast, etc. */ 151 int if_capabilities; /* interface capabilities */ 152 int if_capenable; /* enabled features */ 153 void *if_linkmib; /* link-type-specific MIB data */ 154 size_t if_linkmiblen; /* length of above data */ 155 struct if_data if_data; 156 struct ifmultihead if_multiaddrs; /* multicast addresses configured */ 157 int if_amcount; /* number of all-multicast requests */ 158 /* procedure handles */ 159 int (*if_output) /* output routine (enqueue) */ 160 (struct ifnet *, struct mbuf *, struct sockaddr *, 161 struct rtentry *); 162 void (*if_input) /* input routine from hardware driver */ 163 (struct ifnet *, struct mbuf *); 164 void (*if_start) /* initiate output routine */ 165 (struct ifnet *); 166 int (*if_ioctl) /* ioctl routine */ 167 (struct ifnet *, u_long, caddr_t, struct ucred *); 168 void (*if_watchdog) /* timer routine */ 169 (struct ifnet *); 170 void (*if_init) /* Init routine */ 171 (void *); 172 int (*if_resolvemulti) /* validate/resolve multicast */ 173 (struct ifnet *, struct sockaddr **, struct sockaddr *); 174 struct ifqueue if_snd; /* output queue */ 175 struct ifprefixhead if_prefixhead; /* list of prefixes per if */ 176 const uint8_t *if_broadcastaddr; 177 }; 178 typedef void if_init_f_t (void *); 179 180 #define if_mtu if_data.ifi_mtu 181 #define if_type if_data.ifi_type 182 #define if_physical if_data.ifi_physical 183 #define if_addrlen if_data.ifi_addrlen 184 #define if_hdrlen if_data.ifi_hdrlen 185 #define if_metric if_data.ifi_metric 186 #define if_baudrate if_data.ifi_baudrate 187 #define if_hwassist if_data.ifi_hwassist 188 #define if_ipackets if_data.ifi_ipackets 189 #define if_ierrors if_data.ifi_ierrors 190 #define if_opackets if_data.ifi_opackets 191 #define if_oerrors if_data.ifi_oerrors 192 #define if_collisions if_data.ifi_collisions 193 #define if_ibytes if_data.ifi_ibytes 194 #define if_obytes if_data.ifi_obytes 195 #define if_imcasts if_data.ifi_imcasts 196 #define if_omcasts if_data.ifi_omcasts 197 #define if_iqdrops if_data.ifi_iqdrops 198 #define if_noproto if_data.ifi_noproto 199 #define if_lastchange if_data.ifi_lastchange 200 #define if_recvquota if_data.ifi_recvquota 201 #define if_xmitquota if_data.ifi_xmitquota 202 #define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)0) 203 204 /* for compatibility with other BSDs */ 205 #define if_addrlist if_addrhead 206 #define if_list if_link 207 208 /* 209 * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq) 210 * are queues of messages stored on ifqueue structures 211 * (defined above). Entries are added to and deleted from these structures 212 * by these macros, which should be called with ipl raised to splimp(). 213 */ 214 #define IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 215 #define IF_DROP(ifq) ((ifq)->ifq_drops++) 216 #define IF_QLEN(ifq) ((ifq)->ifq_len) 217 #define IF_QEMPTY(ifq) (IF_QLEN(ifq) == 0) 218 #define IF_ENQUEUE(ifq, m) { \ 219 (m)->m_nextpkt = 0; \ 220 if ((ifq)->ifq_tail == 0) \ 221 (ifq)->ifq_head = m; \ 222 else \ 223 (ifq)->ifq_tail->m_nextpkt = m; \ 224 (ifq)->ifq_tail = m; \ 225 (ifq)->ifq_len++; \ 226 } 227 #define IF_PREPEND(ifq, m) { \ 228 (m)->m_nextpkt = (ifq)->ifq_head; \ 229 if ((ifq)->ifq_tail == 0) \ 230 (ifq)->ifq_tail = (m); \ 231 (ifq)->ifq_head = (m); \ 232 (ifq)->ifq_len++; \ 233 } 234 #define IF_DEQUEUE(ifq, m) { \ 235 (m) = (ifq)->ifq_head; \ 236 if (m) { \ 237 if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \ 238 (ifq)->ifq_tail = 0; \ 239 (m)->m_nextpkt = 0; \ 240 (ifq)->ifq_len--; \ 241 } \ 242 } 243 244 #define IF_POLL(ifq, m) ((m) = (ifq)->ifq_head) 245 246 #define IF_DRAIN(ifq) do { \ 247 struct mbuf *m; \ 248 while (1) { \ 249 IF_DEQUEUE(ifq, m); \ 250 if (m == NULL) \ 251 break; \ 252 m_freem(m); \ 253 } \ 254 } while (0) 255 256 #ifdef _KERNEL 257 258 #define IF_HANDOFF(ifq, m, ifp) if_handoff(ifq, m, ifp, 0) 259 #define IF_HANDOFF_ADJ(ifq, m, ifp, adj) if_handoff(ifq, m, ifp, adj) 260 261 static __inline int 262 if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp, int adjust) 263 { 264 int need_if_start = 0; 265 int s = splimp(); 266 267 if (IF_QFULL(ifq)) { 268 IF_DROP(ifq); 269 splx(s); 270 m_freem(m); 271 return (0); 272 } 273 if (ifp != NULL) { 274 ifp->if_obytes += m->m_pkthdr.len + adjust; 275 if (m->m_flags & M_MCAST) 276 ifp->if_omcasts++; 277 need_if_start = !(ifp->if_flags & IFF_OACTIVE); 278 } 279 IF_ENQUEUE(ifq, m); 280 if (need_if_start) 281 (*ifp->if_start)(ifp); 282 splx(s); 283 return (1); 284 } 285 286 #define IFQ_ENQUEUE(ifq, m, err) \ 287 do { \ 288 if (IF_QFULL(ifq)) { \ 289 m_freem(m); \ 290 (err) = ENOBUFS; \ 291 } else { \ 292 IF_ENQUEUE(ifq, m); \ 293 (err) = 0; \ 294 } \ 295 if (err) \ 296 (ifq)->ifq_drops++; \ 297 } while (0) 298 299 #define IFQ_DEQUEUE(ifq, m) IF_DEQUEUE(ifq, m) 300 #define IFQ_POLL(ifq, m) IF_POLL(ifq, m) 301 #define IFQ_PURGE(ifq) IF_DRAIN(ifq) 302 303 #define IFQ_SET_READY(ifq) /* nothing */ 304 305 #define IFQ_IS_EMPTY(ifq) ((ifq)->ifq_len == 0) 306 #define IFQ_INC_LEN(ifq) ((ifq)->ifq_len++) 307 #define IFQ_DEC_LEN(ifq) (--(ifq)->ifq_len) 308 #define IFQ_INC_DROPS(ifq) ((ifq)->ifq_drops++) 309 #define IFQ_SET_MAXLEN(ifq, len) ((ifq)->ifq_maxlen = (len)) 310 311 #define IFQ_HANDOFF_ADJ(ifp, m, adj, err) \ 312 do { \ 313 int len; \ 314 short mflags; \ 315 \ 316 len = (m)->m_pkthdr.len; \ 317 mflags = (m)->m_flags; \ 318 IFQ_ENQUEUE(&(ifp)->if_snd, m, err); \ 319 if ((err) == 0) { \ 320 (ifp)->if_obytes += len + (adj); \ 321 if (mflags & M_MCAST) \ 322 (ifp)->if_omcasts++; \ 323 if (((ifp)->if_flags & IFF_OACTIVE) == 0) \ 324 (*(ifp)->if_start)(ifp); \ 325 } \ 326 } while (0) 327 328 #define IFQ_HANDOFF(ifp, m, err) \ 329 IFQ_HANDOFF_ADJ(ifp, m, 0, err) 330 331 #define IFQ_DRV_DEQUEUE(ifq, m) \ 332 do { \ 333 (m) = (ifq)->ifq_drv_head; \ 334 if (m) { \ 335 if (((ifq)->ifq_drv_head = (m)->m_nextpkt) == NULL) \ 336 (ifq)->ifq_drv_tail = NULL; \ 337 (m)->m_nextpkt = NULL; \ 338 (ifq)->ifq_drv_len--; \ 339 } else { \ 340 IFQ_DEQUEUE(ifq, m); \ 341 while ((ifq)->ifq_drv_len < (ifq)->ifq_drv_maxlen) { \ 342 struct mbuf *m0; \ 343 IFQ_DEQUEUE(ifq, m0); \ 344 if (m0 == NULL) \ 345 break; \ 346 m0->m_nextpkt = NULL; \ 347 if ((ifq)->ifq_drv_tail == NULL) \ 348 (ifq)->ifq_drv_head = m0; \ 349 else \ 350 (ifq)->ifq_drv_tail->m_nextpkt = m0; \ 351 (ifq)->ifq_drv_tail = m0; \ 352 (ifq)->ifq_drv_len++; \ 353 } \ 354 } \ 355 } while (0) 356 357 #define IFQ_DRV_PREPEND(ifq, m) \ 358 do { \ 359 (m)->m_nextpkt = (ifq)->ifq_drv_head; \ 360 if ((ifq)->ifq_tail == NULL) \ 361 (ifq)->ifq_tail = (m); \ 362 (ifq)->ifq_drv_head = (m); \ 363 (ifq)->ifq_drv_len++; \ 364 } while (0) 365 366 #define IFQ_DRV_IS_EMPTY(ifq) \ 367 (((ifq)->ifq_drv_len == 0) && ((ifq)->ifq_len == 0)) 368 369 #define IFQ_DRV_PURGE(ifq) \ 370 do { \ 371 struct mbuf *m = (ifq)->ifq_drv_head; \ 372 while(m != NULL) { \ 373 m = m->m_nextpkt; \ 374 m_freem(m); \ 375 } \ 376 (ifq)->ifq_drv_head = (ifq)->ifq_drv_tail = NULL; \ 377 (ifq)->ifq_drv_len = 0; \ 378 IFQ_PURGE(ifq); \ 379 } while (0) 380 381 /* 382 * 72 was chosen below because it is the size of a TCP/IP 383 * header (40) + the minimum mss (32). 384 */ 385 #define IF_MINMTU 72 386 #define IF_MAXMTU 65535 387 388 #endif /* _KERNEL */ 389 390 /* 391 * The ifaddr structure contains information about one address 392 * of an interface. They are maintained by the different address families, 393 * are allocated and attached when an address is set, and are linked 394 * together so all addresses for an interface can be located. 395 */ 396 struct ifaddr { 397 struct sockaddr *ifa_addr; /* address of interface */ 398 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ 399 #define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ 400 struct sockaddr *ifa_netmask; /* used to determine subnet */ 401 struct if_data if_data; /* not all members are meaningful */ 402 struct ifnet *ifa_ifp; /* back-pointer to interface */ 403 TAILQ_ENTRY(ifaddr) ifa_link; /* queue macro glue */ 404 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */ 405 (int, struct rtentry *, struct rt_addrinfo *); 406 u_short ifa_flags; /* mostly rt_flags for cloning */ 407 u_int ifa_refcnt; /* references to this structure */ 408 int ifa_metric; /* cost of going out this interface */ 409 #ifdef notdef 410 struct rtentry *ifa_rt; /* XXXX for ROUTETOIF ????? */ 411 #endif 412 int (*ifa_claim_addr) /* check if an addr goes to this if */ 413 (struct ifaddr *, struct sockaddr *); 414 415 }; 416 #define IFA_ROUTE RTF_UP /* route installed */ 417 418 /* for compatibility with other BSDs */ 419 #define ifa_list ifa_link 420 421 /* 422 * The prefix structure contains information about one prefix 423 * of an interface. They are maintained by the different address families, 424 * are allocated and attached when an prefix or an address is set, 425 * and are linked together so all prefixes for an interface can be located. 426 */ 427 struct ifprefix { 428 struct sockaddr *ifpr_prefix; /* prefix of interface */ 429 struct ifnet *ifpr_ifp; /* back-pointer to interface */ 430 TAILQ_ENTRY(ifprefix) ifpr_list; /* queue macro glue */ 431 u_char ifpr_plen; /* prefix length in bits */ 432 u_char ifpr_type; /* protocol dependent prefix type */ 433 }; 434 435 /* 436 * Multicast address structure. This is analogous to the ifaddr 437 * structure except that it keeps track of multicast addresses. 438 * Also, the reference count here is a count of requests for this 439 * address, not a count of pointers to this structure. 440 */ 441 struct ifmultiaddr { 442 LIST_ENTRY(ifmultiaddr) ifma_link; /* queue macro glue */ 443 struct sockaddr *ifma_addr; /* address this membership is for */ 444 struct sockaddr *ifma_lladdr; /* link-layer translation, if any */ 445 struct ifnet *ifma_ifp; /* back-pointer to interface */ 446 u_int ifma_refcount; /* reference count */ 447 void *ifma_protospec; /* protocol-specific state, if any */ 448 }; 449 450 #ifdef _KERNEL 451 /* interface address change event */ 452 typedef void (*ifaddr_event_handler_t)(void *, struct ifnet *); 453 EVENTHANDLER_DECLARE(ifaddr_event, ifaddr_event_handler_t); 454 /* new interface attach event */ 455 typedef void (*ifnet_attach_event_handler_t)(void *, struct ifnet *); 456 EVENTHANDLER_DECLARE(ifnet_attach_event, ifnet_attach_event_handler_t); 457 /* interface detach event */ 458 typedef void (*ifnet_detach_event_handler_t)(void *, struct ifnet *); 459 EVENTHANDLER_DECLARE(ifnet_detach_event, ifnet_detach_event_handler_t); 460 /* interface clone event */ 461 typedef void (*if_clone_event_handler_t)(void *, struct if_clone *); 462 EVENTHANDLER_DECLARE(if_clone_event, if_clone_event_handler_t); 463 464 static __inline void 465 IFAREF(struct ifaddr *ifa) 466 { 467 ++ifa->ifa_refcnt; 468 } 469 470 #include <sys/malloc.h> 471 472 MALLOC_DECLARE(M_IFADDR); 473 MALLOC_DECLARE(M_IFMADDR); 474 475 static __inline void 476 IFAFREE(struct ifaddr *ifa) 477 { 478 if (ifa->ifa_refcnt <= 0) 479 free(ifa, M_IFADDR); 480 else 481 ifa->ifa_refcnt--; 482 } 483 484 extern struct ifnethead ifnet; 485 extern struct ifnet **ifindex2ifnet; 486 extern int ifqmaxlen; 487 extern struct ifnet loif[]; 488 extern int if_index; 489 extern struct ifaddr **ifnet_addrs; 490 491 void ether_ifattach(struct ifnet *, uint8_t *); 492 void ether_ifattach_bpf(struct ifnet *, uint8_t *, u_int, u_int); 493 void ether_ifdetach(struct ifnet *); 494 void ether_input(struct ifnet *, struct ether_header *, struct mbuf *); 495 void ether_demux(struct ifnet *, struct ether_header *, struct mbuf *); 496 int ether_output_frame(struct ifnet *, struct mbuf *); 497 int ether_ioctl(struct ifnet *, int, caddr_t); 498 uint32_t ether_crc32_le(const uint8_t *, size_t); 499 uint32_t ether_crc32_be(const uint8_t *, size_t); 500 501 int if_addmulti(struct ifnet *, struct sockaddr *, struct ifmultiaddr **); 502 int if_allmulti(struct ifnet *, int); 503 void if_attach(struct ifnet *); 504 int if_delmulti(struct ifnet *, struct sockaddr *); 505 void if_detach(struct ifnet *); 506 void if_down(struct ifnet *); 507 void if_initname(struct ifnet *, const char *, int); 508 int if_printf(struct ifnet *, const char *, ...) __printflike(2, 3); 509 void if_route(struct ifnet *, int flag, int fam); 510 int if_setlladdr(struct ifnet *, const u_char *, int); 511 void if_unroute(struct ifnet *, int flag, int fam); 512 void if_up(struct ifnet *); 513 /*void ifinit(void);*/ /* declared in systm.h for main() */ 514 int ifioctl(struct socket *, u_long, caddr_t, struct thread *); 515 int ifpromisc(struct ifnet *, int); 516 struct ifnet *ifunit(const char *); 517 struct ifnet *if_withname(struct sockaddr *); 518 519 struct ifaddr *ifa_ifwithaddr(struct sockaddr *); 520 struct ifaddr *ifa_ifwithdstaddr(struct sockaddr *); 521 struct ifaddr *ifa_ifwithnet(struct sockaddr *); 522 struct ifaddr *ifa_ifwithroute(int, struct sockaddr *, struct sockaddr *); 523 struct ifaddr *ifaof_ifpforaddr(struct sockaddr *, struct ifnet *); 524 525 struct ifmultiaddr *ifmaof_ifpforaddr(struct sockaddr *, struct ifnet *); 526 int if_simloop(struct ifnet *ifp, struct mbuf *m, int af, int hlen); 527 528 void if_clone_attach(struct if_clone *); 529 void if_clone_detach(struct if_clone *); 530 531 int if_clone_create(char *, int); 532 int if_clone_destroy(const char *); 533 534 #define IF_LLADDR(ifp) \ 535 LLADDR((struct sockaddr_dl *) ifnet_addrs[ifp->if_index - 1]->ifa_addr) 536 537 #ifdef DEVICE_POLLING 538 enum poll_cmd { POLL_ONLY, POLL_AND_CHECK_STATUS, POLL_DEREGISTER }; 539 540 typedef void poll_handler_t (struct ifnet *ifp, 541 enum poll_cmd cmd, int count); 542 int ether_poll_register(poll_handler_t *h, struct ifnet *ifp); 543 int ether_poll_deregister(struct ifnet *ifp); 544 void emergency_poll_enable(const char *name); 545 #endif /* DEVICE_POLLING */ 546 #endif /* _KERNEL */ 547 548 #endif /* !_NET_IF_VAR_H_ */ 549