ifq.h revision 123220
155714Skris/* 255714Skris * Copyright (c) 1982, 1986, 1989, 1993 355714Skris * The Regents of the University of California. All rights reserved. 455714Skris * 555714Skris * Redistribution and use in source and binary forms, with or without 655714Skris * modification, are permitted provided that the following conditions 755714Skris * are met: 8296465Sdelphij * 1. Redistributions of source code must retain the above copyright 955714Skris * notice, this list of conditions and the following disclaimer. 1055714Skris * 2. Redistributions in binary form must reproduce the above copyright 1155714Skris * notice, this list of conditions and the following disclaimer in the 1255714Skris * documentation and/or other materials provided with the distribution. 1355714Skris * 3. All advertising materials mentioning features or use of this software 1455714Skris * must display the following acknowledgement: 15296465Sdelphij * This product includes software developed by the University of 1655714Skris * California, Berkeley and its contributors. 1755714Skris * 4. Neither the name of the University nor the names of its contributors 1855714Skris * may be used to endorse or promote products derived from this software 1955714Skris * without specific prior written permission. 2055714Skris * 2155714Skris * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22296465Sdelphij * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 2355714Skris * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 2455714Skris * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 2555714Skris * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 2655714Skris * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 2755714Skris * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 2855714Skris * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 2955714Skris * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 3055714Skris * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 3155714Skris * SUCH DAMAGE. 3255714Skris * 3355714Skris * From: @(#)if.h 8.1 (Berkeley) 6/10/93 3455714Skris * $FreeBSD: head/sys/net/if_var.h 123220 2003-12-07 05:49:21Z imp $ 3555714Skris */ 3655714Skris 37296465Sdelphij#ifndef _NET_IF_VAR_H_ 3855714Skris#define _NET_IF_VAR_H_ 3955714Skris 40296465Sdelphij/* 4155714Skris * Structures defining a network interface, providing a packet 4255714Skris * transport mechanism (ala level 0 of the PUP protocols). 4355714Skris * 4455714Skris * Each interface accepts output datagrams of a specified maximum 4555714Skris * length, and provides higher level routines with input datagrams 4655714Skris * received from its medium. 4755714Skris * 4855714Skris * Output occurs when the routine if_output is called, with three parameters: 4955714Skris * (*ifp->if_output)(ifp, m, dst, rt) 5055714Skris * Here m is the mbuf chain to be sent and dst is the destination address. 5155714Skris * The output routine encapsulates the supplied datagram if necessary, 52296465Sdelphij * and then transmits it on its medium. 5355714Skris * 5455714Skris * On input, each interface unwraps the data received by it, and either 5555714Skris * places it on the input queue of an internetwork datagram routine 5655714Skris * and posts the associated software interrupt, or passes the datagram to a raw 5755714Skris * packet input routine. 5855714Skris * 5955714Skris * Routines exist for locating interfaces by their addresses 6055714Skris * or for locating an interface on a certain network, as well as more general 6155714Skris * routing and gateway routines maintaining information used to locate 62109998Smarkm * interfaces. These routines live in the files if.c and route.c 63296465Sdelphij */ 6455714Skris 6555714Skris#ifdef __STDC__ 6655714Skris/* 6755714Skris * Forward structure declarations for function prototypes [sic]. 6855714Skris */ 6955714Skrisstruct mbuf; 7055714Skrisstruct thread; 71160814Ssimonstruct rtentry; 72296465Sdelphijstruct rt_addrinfo; 73296465Sdelphijstruct socket; 74160814Ssimonstruct ether_header; 7555714Skris#endif 76296465Sdelphij 7755714Skris#include <sys/queue.h> /* get TAILQ macros */ 7855714Skris 79296465Sdelphij#ifdef _KERNEL 80296465Sdelphij#include <sys/mbuf.h> 8155714Skris#endif /* _KERNEL */ 82296465Sdelphij#include <sys/lock.h> /* XXX */ 83296465Sdelphij#include <sys/mutex.h> /* XXX */ 84296465Sdelphij#include <sys/event.h> /* XXX */ 85296465Sdelphij 86296465Sdelphij#define IF_DUNIT_NONE -1 87296465Sdelphij 88109998SmarkmTAILQ_HEAD(ifnethead, ifnet); /* we use TAILQs so that the order of */ 89296465SdelphijTAILQ_HEAD(ifaddrhead, ifaddr); /* instantiation is preserved in the list */ 9055714SkrisTAILQ_HEAD(ifprefixhead, ifprefix); 9155714SkrisTAILQ_HEAD(ifmultihead, ifmultiaddr); 92296465Sdelphij 9355714Skris/* 9455714Skris * Structure defining a queue for a network interface. 95296465Sdelphij */ 96296465Sdelphijstruct ifqueue { 97296465Sdelphij struct mbuf *ifq_head; 9855714Skris struct mbuf *ifq_tail; 9955714Skris int ifq_len; 10055714Skris int ifq_maxlen; 10155714Skris int ifq_drops; 10255714Skris struct mtx ifq_mtx; 103296465Sdelphij}; 104296465Sdelphij 105296465Sdelphij/* 10655714Skris * Structure defining a network interface. 10755714Skris * 108296465Sdelphij * (Would like to call this struct ``if'', but C isn't PL/1.) 10955714Skris */ 11055714Skris 11155714Skris/* 112296465Sdelphij * NB: For FreeBSD, it is assumed that each NIC driver's softc starts with 113296465Sdelphij * one of these structures, typically held within an arpcom structure. 11455714Skris * 11555714Skris * struct <foo>_softc { 11655714Skris * struct arpcom { 117296465Sdelphij * struct ifnet ac_if; 118296465Sdelphij * ... 119296465Sdelphij * } <arpcom> ; 120296465Sdelphij * ... 121296465Sdelphij * }; 12255714Skris * 12355714Skris * The assumption is used in a number of places, including many 12455714Skris * files in sys/net, device drivers, and sys/dev/mii.c:miibus_attach(). 125296465Sdelphij * 126296465Sdelphij * Unfortunately devices' softc are opaque, so we depend on this layout 127296465Sdelphij * to locate the struct ifnet from the softc in the generic code. 128296465Sdelphij * 129296465Sdelphij */ 130296465Sdelphijstruct ifnet { 131296465Sdelphij void *if_softc; /* pointer to driver state */ 13255714Skris TAILQ_ENTRY(ifnet) if_link; /* all struct ifnets are chained */ 13355714Skris char if_xname[IFNAMSIZ]; /* external name (name + unit) */ 134296465Sdelphij const char *if_dname; /* driver name */ 135296465Sdelphij int if_dunit; /* unit or IF_DUNIT_NONE */ 13655714Skris struct ifaddrhead if_addrhead; /* linked list of addresses per if */ 13755714Skris struct klist if_klist; /* events attached to this if */ 138296465Sdelphij int if_pcount; /* number of promiscuous listeners */ 139296465Sdelphij struct bpf_if *if_bpf; /* packet filter structure */ 14055714Skris u_short if_index; /* numeric abbreviation for this if */ 141296465Sdelphij short if_timer; /* time 'til if_watchdog called */ 14255714Skris u_short if_nvlans; /* number of active vlans */ 143296465Sdelphij int if_flags; /* up/down, broadcast, etc. */ 144296465Sdelphij int if_capabilities; /* interface capabilities */ 145296465Sdelphij int if_capenable; /* enabled features */ 146296465Sdelphij int if_ipending; /* interrupts pending */ 147296465Sdelphij void *if_linkmib; /* link-type-specific MIB data */ 148296465Sdelphij size_t if_linkmiblen; /* length of above data */ 149296465Sdelphij struct if_data if_data; 150296465Sdelphij struct ifmultihead if_multiaddrs; /* multicast addresses configured */ 151296465Sdelphij int if_amcount; /* number of all-multicast requests */ 152296465Sdelphij/* procedure handles */ 153296465Sdelphij int (*if_output) /* output routine (enqueue) */ 15455714Skris (struct ifnet *, struct mbuf *, struct sockaddr *, 155296465Sdelphij struct rtentry *); 156296465Sdelphij void (*if_input) /* input routine (from h/w driver) */ 157296465Sdelphij (struct ifnet *, struct mbuf *); 158296465Sdelphij void (*if_start) /* initiate output routine */ 159296465Sdelphij (struct ifnet *); 160296465Sdelphij int (*if_done) /* output complete routine */ 161296465Sdelphij (struct ifnet *); /* (XXX not used; fake prototype) */ 162296465Sdelphij int (*if_ioctl) /* ioctl routine */ 163296465Sdelphij (struct ifnet *, u_long, caddr_t); 16455714Skris void (*if_watchdog) /* timer routine */ 165296465Sdelphij (struct ifnet *); 16655714Skris int (*if_poll_recv) /* polled receive routine */ 16755714Skris (struct ifnet *, int *); 168296465Sdelphij int (*if_poll_xmit) /* polled transmit routine */ 169296465Sdelphij (struct ifnet *, int *); 170296465Sdelphij void (*if_poll_intren) /* polled interrupt reenable routine */ 171296465Sdelphij (struct ifnet *); 172296465Sdelphij void (*if_poll_slowinput) /* input routine for slow devices */ 173296465Sdelphij (struct ifnet *, struct mbuf *); 174296465Sdelphij void (*if_init) /* Init routine */ 175296465Sdelphij (void *); 176296465Sdelphij int (*if_resolvemulti) /* validate/resolve multicast */ 177296465Sdelphij (struct ifnet *, struct sockaddr **, struct sockaddr *); 178296465Sdelphij struct ifqueue if_snd; /* output queue */ 17955714Skris struct ifqueue *if_poll_slowq; /* input queue for slow devices */ 180296465Sdelphij struct ifprefixhead if_prefixhead; /* list of prefixes per if */ 18155714Skris const u_int8_t *if_broadcastaddr; /* linklevel broadcast bytestring */ 18255714Skris struct label *if_label; /* interface MAC label */ 18355714Skris 184296465Sdelphij void *if_afdata[AF_MAX]; 185296465Sdelphij int if_afdata_initialized; 18655714Skris struct mtx if_afdata_mtx; 18755714Skris}; 188296465Sdelphij 189296465Sdelphijtypedef void if_init_f_t(void *); 19055714Skris 19155714Skris#define if_mtu if_data.ifi_mtu 192296465Sdelphij#define if_type if_data.ifi_type 193296465Sdelphij#define if_physical if_data.ifi_physical 194296465Sdelphij#define if_addrlen if_data.ifi_addrlen 195296465Sdelphij#define if_hdrlen if_data.ifi_hdrlen 196296465Sdelphij#define if_metric if_data.ifi_metric 197296465Sdelphij#define if_baudrate if_data.ifi_baudrate 19855714Skris#define if_hwassist if_data.ifi_hwassist 199296465Sdelphij#define if_ipackets if_data.ifi_ipackets 200296465Sdelphij#define if_ierrors if_data.ifi_ierrors 201296465Sdelphij#define if_opackets if_data.ifi_opackets 202296465Sdelphij#define if_oerrors if_data.ifi_oerrors 203296465Sdelphij#define if_collisions if_data.ifi_collisions 204296465Sdelphij#define if_ibytes if_data.ifi_ibytes 205296465Sdelphij#define if_obytes if_data.ifi_obytes 206296465Sdelphij#define if_imcasts if_data.ifi_imcasts 207296465Sdelphij#define if_omcasts if_data.ifi_omcasts 208296465Sdelphij#define if_iqdrops if_data.ifi_iqdrops 209296465Sdelphij#define if_noproto if_data.ifi_noproto 210296465Sdelphij#define if_lastchange if_data.ifi_lastchange 211296465Sdelphij#define if_recvquota if_data.ifi_recvquota 212296465Sdelphij#define if_xmitquota if_data.ifi_xmitquota 21355714Skris#define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)0) 214296465Sdelphij 215296465Sdelphij/* for compatibility with other BSDs */ 216296465Sdelphij#define if_addrlist if_addrhead 217296465Sdelphij#define if_list if_link 218296465Sdelphij 21955714Skris/* 22055714Skris * Bit values in if_ipending 221296465Sdelphij */ 222296465Sdelphij#define IFI_RECV 1 /* I want to receive */ 223296465Sdelphij#define IFI_XMIT 2 /* I want to transmit */ 224296465Sdelphij 225296465Sdelphij/* 226296465Sdelphij * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq) 22755714Skris * are queues of messages stored on ifqueue structures 22855714Skris * (defined above). Entries are added to and deleted from these structures 229296465Sdelphij * by these macros, which should be called with ipl raised to splimp(). 230296465Sdelphij */ 23155714Skris#define IF_LOCK(ifq) mtx_lock(&(ifq)->ifq_mtx) 232296465Sdelphij#define IF_UNLOCK(ifq) mtx_unlock(&(ifq)->ifq_mtx) 23355714Skris#define _IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 234296465Sdelphij#define _IF_DROP(ifq) ((ifq)->ifq_drops++) 235296465Sdelphij#define _IF_QLEN(ifq) ((ifq)->ifq_len) 236296465Sdelphij 23755714Skris#define _IF_ENQUEUE(ifq, m) do { \ 238296465Sdelphij (m)->m_nextpkt = NULL; \ 239296465Sdelphij if ((ifq)->ifq_tail == NULL) \ 240296465Sdelphij (ifq)->ifq_head = m; \ 241296465Sdelphij else \ 242296465Sdelphij (ifq)->ifq_tail->m_nextpkt = m; \ 24355714Skris (ifq)->ifq_tail = m; \ 24455714Skris (ifq)->ifq_len++; \ 245296465Sdelphij} while (0) 246296465Sdelphij 247296465Sdelphij#define IF_ENQUEUE(ifq, m) do { \ 24855714Skris IF_LOCK(ifq); \ 249296465Sdelphij _IF_ENQUEUE(ifq, m); \ 250296465Sdelphij IF_UNLOCK(ifq); \ 25155714Skris} while (0) 252296465Sdelphij 253296465Sdelphij#define _IF_PREPEND(ifq, m) do { \ 254296465Sdelphij (m)->m_nextpkt = (ifq)->ifq_head; \ 255296465Sdelphij if ((ifq)->ifq_tail == NULL) \ 256296465Sdelphij (ifq)->ifq_tail = (m); \ 257296465Sdelphij (ifq)->ifq_head = (m); \ 258296465Sdelphij (ifq)->ifq_len++; \ 25955714Skris} while (0) 26055714Skris 261296465Sdelphij#define IF_PREPEND(ifq, m) do { \ 262296465Sdelphij IF_LOCK(ifq); \ 263296465Sdelphij _IF_PREPEND(ifq, m); \ 26455714Skris IF_UNLOCK(ifq); \ 265296465Sdelphij} while (0) 266296465Sdelphij 26755714Skris#define _IF_DEQUEUE(ifq, m) do { \ 268296465Sdelphij (m) = (ifq)->ifq_head; \ 269296465Sdelphij if (m) { \ 270296465Sdelphij if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \ 271296465Sdelphij (ifq)->ifq_tail = NULL; \ 272296465Sdelphij (m)->m_nextpkt = NULL; \ 273296465Sdelphij (ifq)->ifq_len--; \ 274296465Sdelphij } \ 275296465Sdelphij} while (0) 27655714Skris 27755714Skris#define IF_DEQUEUE(ifq, m) do { \ 278296465Sdelphij IF_LOCK(ifq); \ 279296465Sdelphij _IF_DEQUEUE(ifq, m); \ 28055714Skris IF_UNLOCK(ifq); \ 281296465Sdelphij} while (0) 28255714Skris 283296465Sdelphij#define IF_DRAIN(ifq) do { \ 284296465Sdelphij struct mbuf *m; \ 285296465Sdelphij IF_LOCK(ifq); \ 286296465Sdelphij for (;;) { \ 287296465Sdelphij _IF_DEQUEUE(ifq, m); \ 288296465Sdelphij if (m == NULL) \ 28955714Skris break; \ 290296465Sdelphij m_freem(m); \ 291296465Sdelphij } \ 292296465Sdelphij IF_UNLOCK(ifq); \ 293296465Sdelphij} while (0) 294296465Sdelphij 295296465Sdelphij#ifdef _KERNEL 296109998Smarkm#define IF_AFDATA_LOCK_INIT(ifp) \ 297296465Sdelphij mtx_init(&(ifp)->if_afdata_mtx, "if_afdata", NULL, MTX_DEF) 29855714Skris#define IF_AFDATA_LOCK(ifp) mtx_lock(&(ifp)->if_afdata_mtx) 299296465Sdelphij#define IF_AFDATA_TRYLOCK(ifp) mtx_trylock(&(ifp)->if_afdata_mtx) 300#define IF_AFDATA_UNLOCK(ifp) mtx_unlock(&(ifp)->if_afdata_mtx) 301#define IF_AFDATA_DESTROY(ifp) mtx_destroy(&(ifp)->if_afdata_mtx) 302 303#define IF_HANDOFF(ifq, m, ifp) if_handoff(ifq, m, ifp, 0) 304#define IF_HANDOFF_ADJ(ifq, m, ifp, adj) if_handoff(ifq, m, ifp, adj) 305 306static __inline int 307if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp, int adjust) 308{ 309 int active = 0; 310 311 IF_LOCK(ifq); 312 if (_IF_QFULL(ifq)) { 313 _IF_DROP(ifq); 314 IF_UNLOCK(ifq); 315 m_freem(m); 316 return (0); 317 } 318 if (ifp != NULL) { 319 ifp->if_obytes += m->m_pkthdr.len + adjust; 320 if (m->m_flags & M_MCAST) 321 ifp->if_omcasts++; 322 active = ifp->if_flags & IFF_OACTIVE; 323 } 324 _IF_ENQUEUE(ifq, m); 325 IF_UNLOCK(ifq); 326 if (ifp != NULL && !active) 327 (*ifp->if_start)(ifp); 328 return (1); 329} 330 331/* 332 * 72 was chosen below because it is the size of a TCP/IP 333 * header (40) + the minimum mss (32). 334 */ 335#define IF_MINMTU 72 336#define IF_MAXMTU 65535 337 338#endif /* _KERNEL */ 339 340/* 341 * The ifaddr structure contains information about one address 342 * of an interface. They are maintained by the different address families, 343 * are allocated and attached when an address is set, and are linked 344 * together so all addresses for an interface can be located. 345 */ 346struct ifaddr { 347 struct sockaddr *ifa_addr; /* address of interface */ 348 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ 349#define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ 350 struct sockaddr *ifa_netmask; /* used to determine subnet */ 351 struct if_data if_data; /* not all members are meaningful */ 352 struct ifnet *ifa_ifp; /* back-pointer to interface */ 353 TAILQ_ENTRY(ifaddr) ifa_link; /* queue macro glue */ 354 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */ 355 (int, struct rtentry *, struct rt_addrinfo *); 356 u_short ifa_flags; /* mostly rt_flags for cloning */ 357 u_int ifa_refcnt; /* references to this structure */ 358 int ifa_metric; /* cost of going out this interface */ 359#ifdef notdef 360 struct rtentry *ifa_rt; /* XXXX for ROUTETOIF ????? */ 361#endif 362 int (*ifa_claim_addr) /* check if an addr goes to this if */ 363 (struct ifaddr *, struct sockaddr *); 364 struct mtx ifa_mtx; 365}; 366#define IFA_ROUTE RTF_UP /* route installed */ 367 368/* for compatibility with other BSDs */ 369#define ifa_list ifa_link 370 371#define IFA_LOCK_INIT(ifa) \ 372 mtx_init(&(ifa)->ifa_mtx, "ifaddr", NULL, MTX_DEF) 373#define IFA_LOCK(ifa) mtx_lock(&(ifa)->ifa_mtx) 374#define IFA_UNLOCK(ifa) mtx_unlock(&(ifa)->ifa_mtx) 375#define IFA_DESTROY(ifa) mtx_destroy(&(ifa)->ifa_mtx) 376 377/* 378 * The prefix structure contains information about one prefix 379 * of an interface. They are maintained by the different address families, 380 * are allocated and attached when a prefix or an address is set, 381 * and are linked together so all prefixes for an interface can be located. 382 */ 383struct ifprefix { 384 struct sockaddr *ifpr_prefix; /* prefix of interface */ 385 struct ifnet *ifpr_ifp; /* back-pointer to interface */ 386 TAILQ_ENTRY(ifprefix) ifpr_list; /* queue macro glue */ 387 u_char ifpr_plen; /* prefix length in bits */ 388 u_char ifpr_type; /* protocol dependent prefix type */ 389}; 390 391/* 392 * Multicast address structure. This is analogous to the ifaddr 393 * structure except that it keeps track of multicast addresses. 394 * Also, the reference count here is a count of requests for this 395 * address, not a count of pointers to this structure. 396 */ 397struct ifmultiaddr { 398 TAILQ_ENTRY(ifmultiaddr) ifma_link; /* queue macro glue */ 399 struct sockaddr *ifma_addr; /* address this membership is for */ 400 struct sockaddr *ifma_lladdr; /* link-layer translation, if any */ 401 struct ifnet *ifma_ifp; /* back-pointer to interface */ 402 u_int ifma_refcount; /* reference count */ 403 void *ifma_protospec; /* protocol-specific state, if any */ 404}; 405 406#ifdef _KERNEL 407#define IFAFREE(ifa) \ 408 do { \ 409 IFA_LOCK(ifa); \ 410 KASSERT((ifa)->ifa_refcnt > 0, \ 411 ("ifa %p !(ifa_refcnt > 0)", ifa)); \ 412 if (--(ifa)->ifa_refcnt == 0) { \ 413 IFA_DESTROY(ifa); \ 414 free(ifa, M_IFADDR); \ 415 } else \ 416 IFA_UNLOCK(ifa); \ 417 } while (0) 418 419#define IFAREF(ifa) \ 420 do { \ 421 IFA_LOCK(ifa); \ 422 ++(ifa)->ifa_refcnt; \ 423 IFA_UNLOCK(ifa); \ 424 } while (0) 425 426extern struct mtx ifnet_lock; 427#define IFNET_LOCK_INIT() \ 428 mtx_init(&ifnet_lock, "ifnet", NULL, MTX_DEF | MTX_RECURSE) 429#define IFNET_WLOCK() mtx_lock(&ifnet_lock) 430#define IFNET_WUNLOCK() mtx_unlock(&ifnet_lock) 431#define IFNET_RLOCK() IFNET_WLOCK() 432#define IFNET_RUNLOCK() IFNET_WUNLOCK() 433 434struct ifindex_entry { 435 struct ifnet *ife_ifnet; 436 struct ifaddr *ife_ifnet_addr; 437 dev_t ife_dev; 438}; 439 440#define ifnet_byindex(idx) ifindex_table[(idx)].ife_ifnet 441#define ifaddr_byindex(idx) ifindex_table[(idx)].ife_ifnet_addr 442#define ifdev_byindex(idx) ifindex_table[(idx)].ife_dev 443 444extern struct ifnethead ifnet; 445extern struct ifindex_entry *ifindex_table; 446extern int ifqmaxlen; 447extern struct ifnet *loif; /* first loopback interface */ 448extern int if_index; 449 450int if_addmulti(struct ifnet *, struct sockaddr *, struct ifmultiaddr **); 451int if_allmulti(struct ifnet *, int); 452void if_attach(struct ifnet *); 453int if_delmulti(struct ifnet *, struct sockaddr *); 454void if_detach(struct ifnet *); 455void if_down(struct ifnet *); 456void if_initname(struct ifnet *, const char *, int); 457int if_printf(struct ifnet *, const char *, ...) __printflike(2, 3); 458void if_route(struct ifnet *, int flag, int fam); 459int if_setlladdr(struct ifnet *, const u_char *, int); 460void if_unroute(struct ifnet *, int flag, int fam); 461void if_up(struct ifnet *); 462/*void ifinit(void);*/ /* declared in systm.h for main() */ 463int ifioctl(struct socket *, u_long, caddr_t, struct thread *); 464int ifpromisc(struct ifnet *, int); 465struct ifnet *ifunit(const char *); 466struct ifnet *if_withname(struct sockaddr *); 467 468int if_poll_recv_slow(struct ifnet *ifp, int *quotap); 469void if_poll_xmit_slow(struct ifnet *ifp, int *quotap); 470void if_poll_throttle(void); 471void if_poll_unthrottle(void *); 472void if_poll_init(void); 473void if_poll(void); 474 475struct ifaddr *ifa_ifwithaddr(struct sockaddr *); 476struct ifaddr *ifa_ifwithdstaddr(struct sockaddr *); 477struct ifaddr *ifa_ifwithnet(struct sockaddr *); 478struct ifaddr *ifa_ifwithroute(int, struct sockaddr *, struct sockaddr *); 479struct ifaddr *ifaof_ifpforaddr(struct sockaddr *, struct ifnet *); 480 481struct ifmultiaddr *ifmaof_ifpforaddr(struct sockaddr *, struct ifnet *); 482int if_simloop(struct ifnet *ifp, struct mbuf *m, int af, int hlen); 483 484void if_clone_attach(struct if_clone *); 485void if_clone_detach(struct if_clone *); 486 487int if_clone_create(char *, int); 488int if_clone_destroy(const char *); 489 490#define IF_LLADDR(ifp) \ 491 LLADDR((struct sockaddr_dl *) ifaddr_byindex((ifp)->if_index)->ifa_addr) 492 493#ifdef DEVICE_POLLING 494enum poll_cmd { POLL_ONLY, POLL_AND_CHECK_STATUS, POLL_DEREGISTER }; 495 496typedef void poll_handler_t(struct ifnet *ifp, enum poll_cmd cmd, int count); 497int ether_poll_register(poll_handler_t *h, struct ifnet *ifp); 498int ether_poll_deregister(struct ifnet *ifp); 499#endif /* DEVICE_POLLING */ 500 501#endif /* _KERNEL */ 502 503#endif /* !_NET_IF_VAR_H_ */ 504