ifq.h revision 121161
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: head/sys/net/if_var.h 121161 2003-10-17 15:46:31Z ume $ 35 */ 36 37#ifndef _NET_IF_VAR_H_ 38#define _NET_IF_VAR_H_ 39 40/* 41 * Structures defining a network interface, providing a packet 42 * transport mechanism (ala level 0 of the PUP protocols). 43 * 44 * Each interface accepts output datagrams of a specified maximum 45 * length, and provides higher level routines with input datagrams 46 * received from its medium. 47 * 48 * Output occurs when the routine if_output is called, with three parameters: 49 * (*ifp->if_output)(ifp, m, dst, rt) 50 * Here m is the mbuf chain to be sent and dst is the destination address. 51 * The output routine encapsulates the supplied datagram if necessary, 52 * and then transmits it on its medium. 53 * 54 * On input, each interface unwraps the data received by it, and either 55 * places it on the input queue of an internetwork datagram routine 56 * and posts the associated software interrupt, or passes the datagram to a raw 57 * packet input routine. 58 * 59 * Routines exist for locating interfaces by their addresses 60 * or for locating an interface on a certain network, as well as more general 61 * routing and gateway routines maintaining information used to locate 62 * interfaces. These routines live in the files if.c and route.c 63 */ 64 65#ifdef __STDC__ 66/* 67 * Forward structure declarations for function prototypes [sic]. 68 */ 69struct mbuf; 70struct thread; 71struct rtentry; 72struct rt_addrinfo; 73struct socket; 74struct ether_header; 75#endif 76 77#include <sys/_label.h> /* struct label */ 78#include <sys/queue.h> /* get TAILQ macros */ 79 80#ifdef _KERNEL 81#include <sys/mbuf.h> 82#endif /* _KERNEL */ 83#include <sys/lock.h> /* XXX */ 84#include <sys/mutex.h> /* XXX */ 85#include <sys/event.h> /* XXX */ 86 87TAILQ_HEAD(ifnethead, ifnet); /* we use TAILQs so that the order of */ 88TAILQ_HEAD(ifaddrhead, ifaddr); /* instantiation is preserved in the list */ 89TAILQ_HEAD(ifprefixhead, ifprefix); 90TAILQ_HEAD(ifmultihead, ifmultiaddr); 91 92/* 93 * Structure defining a queue for a network interface. 94 */ 95struct ifqueue { 96 struct mbuf *ifq_head; 97 struct mbuf *ifq_tail; 98 int ifq_len; 99 int ifq_maxlen; 100 int ifq_drops; 101 struct mtx ifq_mtx; 102}; 103 104/* 105 * Structure defining a network interface. 106 * 107 * (Would like to call this struct ``if'', but C isn't PL/1.) 108 */ 109 110/* 111 * NB: For FreeBSD, it is assumed that each NIC driver's softc starts with 112 * one of these structures, typically held within an arpcom structure. 113 * 114 * struct <foo>_softc { 115 * struct arpcom { 116 * struct ifnet ac_if; 117 * ... 118 * } <arpcom> ; 119 * ... 120 * }; 121 * 122 * The assumption is used in a number of places, including many 123 * files in sys/net, device drivers, and sys/dev/mii.c:miibus_attach(). 124 * 125 * Unfortunately devices' softc are opaque, so we depend on this layout 126 * to locate the struct ifnet from the softc in the generic code. 127 * 128 */ 129struct ifnet { 130 void *if_softc; /* pointer to driver state */ 131 char *if_name; /* name, e.g. ``en'' or ``lo'' */ 132 TAILQ_ENTRY(ifnet) if_link; /* all struct ifnets are chained */ 133 struct ifaddrhead if_addrhead; /* linked list of addresses per if */ 134 struct klist if_klist; /* events attached to this if */ 135 int if_pcount; /* number of promiscuous listeners */ 136 struct bpf_if *if_bpf; /* packet filter structure */ 137 u_short if_index; /* numeric abbreviation for this if */ 138 short if_unit; /* sub-unit for lower level driver */ 139 short if_timer; /* time 'til if_watchdog called */ 140 u_short if_nvlans; /* number of active vlans */ 141 int if_flags; /* up/down, broadcast, etc. */ 142 int if_capabilities; /* interface capabilities */ 143 int if_capenable; /* enabled features */ 144 int if_ipending; /* interrupts pending */ 145 void *if_linkmib; /* link-type-specific MIB data */ 146 size_t if_linkmiblen; /* length of above data */ 147 struct if_data if_data; 148 struct ifmultihead if_multiaddrs; /* multicast addresses configured */ 149 int if_amcount; /* number of all-multicast requests */ 150/* procedure handles */ 151 int (*if_output) /* output routine (enqueue) */ 152 (struct ifnet *, struct mbuf *, struct sockaddr *, 153 struct rtentry *); 154 void (*if_input) /* input routine (from h/w driver) */ 155 (struct ifnet *, struct mbuf *); 156 void (*if_start) /* initiate output routine */ 157 (struct ifnet *); 158 int (*if_done) /* output complete routine */ 159 (struct ifnet *); /* (XXX not used; fake prototype) */ 160 int (*if_ioctl) /* ioctl routine */ 161 (struct ifnet *, u_long, caddr_t); 162 void (*if_watchdog) /* timer routine */ 163 (struct ifnet *); 164 int (*if_poll_recv) /* polled receive routine */ 165 (struct ifnet *, int *); 166 int (*if_poll_xmit) /* polled transmit routine */ 167 (struct ifnet *, int *); 168 void (*if_poll_intren) /* polled interrupt reenable routine */ 169 (struct ifnet *); 170 void (*if_poll_slowinput) /* input routine for slow devices */ 171 (struct ifnet *, struct mbuf *); 172 void (*if_init) /* Init routine */ 173 (void *); 174 int (*if_resolvemulti) /* validate/resolve multicast */ 175 (struct ifnet *, struct sockaddr **, struct sockaddr *); 176 struct ifqueue if_snd; /* output queue */ 177 struct ifqueue *if_poll_slowq; /* input queue for slow devices */ 178 struct ifprefixhead if_prefixhead; /* list of prefixes per if */ 179 u_int8_t *if_broadcastaddr; /* linklevel broadcast bytestring */ 180 struct label if_label; /* interface MAC label */ 181 182 void *if_afdata[AF_MAX]; 183}; 184 185typedef void if_init_f_t(void *); 186 187#define if_mtu if_data.ifi_mtu 188#define if_type if_data.ifi_type 189#define if_physical if_data.ifi_physical 190#define if_addrlen if_data.ifi_addrlen 191#define if_hdrlen if_data.ifi_hdrlen 192#define if_metric if_data.ifi_metric 193#define if_baudrate if_data.ifi_baudrate 194#define if_hwassist if_data.ifi_hwassist 195#define if_ipackets if_data.ifi_ipackets 196#define if_ierrors if_data.ifi_ierrors 197#define if_opackets if_data.ifi_opackets 198#define if_oerrors if_data.ifi_oerrors 199#define if_collisions if_data.ifi_collisions 200#define if_ibytes if_data.ifi_ibytes 201#define if_obytes if_data.ifi_obytes 202#define if_imcasts if_data.ifi_imcasts 203#define if_omcasts if_data.ifi_omcasts 204#define if_iqdrops if_data.ifi_iqdrops 205#define if_noproto if_data.ifi_noproto 206#define if_lastchange if_data.ifi_lastchange 207#define if_recvquota if_data.ifi_recvquota 208#define if_xmitquota if_data.ifi_xmitquota 209#define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)0) 210 211/* for compatibility with other BSDs */ 212#define if_addrlist if_addrhead 213#define if_list if_link 214 215/* 216 * Bit values in if_ipending 217 */ 218#define IFI_RECV 1 /* I want to receive */ 219#define IFI_XMIT 2 /* I want to transmit */ 220 221/* 222 * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq) 223 * are queues of messages stored on ifqueue structures 224 * (defined above). Entries are added to and deleted from these structures 225 * by these macros, which should be called with ipl raised to splimp(). 226 */ 227#define IF_LOCK(ifq) mtx_lock(&(ifq)->ifq_mtx) 228#define IF_UNLOCK(ifq) mtx_unlock(&(ifq)->ifq_mtx) 229#define _IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 230#define _IF_DROP(ifq) ((ifq)->ifq_drops++) 231#define _IF_QLEN(ifq) ((ifq)->ifq_len) 232 233#define _IF_ENQUEUE(ifq, m) do { \ 234 (m)->m_nextpkt = NULL; \ 235 if ((ifq)->ifq_tail == NULL) \ 236 (ifq)->ifq_head = m; \ 237 else \ 238 (ifq)->ifq_tail->m_nextpkt = m; \ 239 (ifq)->ifq_tail = m; \ 240 (ifq)->ifq_len++; \ 241} while (0) 242 243#define IF_ENQUEUE(ifq, m) do { \ 244 IF_LOCK(ifq); \ 245 _IF_ENQUEUE(ifq, m); \ 246 IF_UNLOCK(ifq); \ 247} while (0) 248 249#define _IF_PREPEND(ifq, m) do { \ 250 (m)->m_nextpkt = (ifq)->ifq_head; \ 251 if ((ifq)->ifq_tail == NULL) \ 252 (ifq)->ifq_tail = (m); \ 253 (ifq)->ifq_head = (m); \ 254 (ifq)->ifq_len++; \ 255} while (0) 256 257#define IF_PREPEND(ifq, m) do { \ 258 IF_LOCK(ifq); \ 259 _IF_PREPEND(ifq, m); \ 260 IF_UNLOCK(ifq); \ 261} while (0) 262 263#define _IF_DEQUEUE(ifq, m) do { \ 264 (m) = (ifq)->ifq_head; \ 265 if (m) { \ 266 if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \ 267 (ifq)->ifq_tail = NULL; \ 268 (m)->m_nextpkt = NULL; \ 269 (ifq)->ifq_len--; \ 270 } \ 271} while (0) 272 273#define IF_DEQUEUE(ifq, m) do { \ 274 IF_LOCK(ifq); \ 275 _IF_DEQUEUE(ifq, m); \ 276 IF_UNLOCK(ifq); \ 277} while (0) 278 279#define IF_DRAIN(ifq) do { \ 280 struct mbuf *m; \ 281 IF_LOCK(ifq); \ 282 for (;;) { \ 283 _IF_DEQUEUE(ifq, m); \ 284 if (m == NULL) \ 285 break; \ 286 m_freem(m); \ 287 } \ 288 IF_UNLOCK(ifq); \ 289} while (0) 290 291#ifdef _KERNEL 292#define IF_HANDOFF(ifq, m, ifp) if_handoff(ifq, m, ifp, 0) 293#define IF_HANDOFF_ADJ(ifq, m, ifp, adj) if_handoff(ifq, m, ifp, adj) 294 295static __inline int 296if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp, int adjust) 297{ 298 int active = 0; 299 300 IF_LOCK(ifq); 301 if (_IF_QFULL(ifq)) { 302 _IF_DROP(ifq); 303 IF_UNLOCK(ifq); 304 m_freem(m); 305 return (0); 306 } 307 if (ifp != NULL) { 308 ifp->if_obytes += m->m_pkthdr.len + adjust; 309 if (m->m_flags & M_MCAST) 310 ifp->if_omcasts++; 311 active = ifp->if_flags & IFF_OACTIVE; 312 } 313 _IF_ENQUEUE(ifq, m); 314 IF_UNLOCK(ifq); 315 if (ifp != NULL && !active) 316 (*ifp->if_start)(ifp); 317 return (1); 318} 319 320/* 321 * 72 was chosen below because it is the size of a TCP/IP 322 * header (40) + the minimum mss (32). 323 */ 324#define IF_MINMTU 72 325#define IF_MAXMTU 65535 326 327#endif /* _KERNEL */ 328 329/* 330 * The ifaddr structure contains information about one address 331 * of an interface. They are maintained by the different address families, 332 * are allocated and attached when an address is set, and are linked 333 * together so all addresses for an interface can be located. 334 */ 335struct ifaddr { 336 struct sockaddr *ifa_addr; /* address of interface */ 337 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ 338#define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ 339 struct sockaddr *ifa_netmask; /* used to determine subnet */ 340 struct if_data if_data; /* not all members are meaningful */ 341 struct ifnet *ifa_ifp; /* back-pointer to interface */ 342 TAILQ_ENTRY(ifaddr) ifa_link; /* queue macro glue */ 343 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */ 344 (int, struct rtentry *, struct rt_addrinfo *); 345 u_short ifa_flags; /* mostly rt_flags for cloning */ 346 u_int ifa_refcnt; /* references to this structure */ 347 int ifa_metric; /* cost of going out this interface */ 348#ifdef notdef 349 struct rtentry *ifa_rt; /* XXXX for ROUTETOIF ????? */ 350#endif 351 int (*ifa_claim_addr) /* check if an addr goes to this if */ 352 (struct ifaddr *, struct sockaddr *); 353 struct mtx ifa_mtx; 354}; 355#define IFA_ROUTE RTF_UP /* route installed */ 356 357/* for compatibility with other BSDs */ 358#define ifa_list ifa_link 359 360#define IFA_LOCK_INIT(ifa) \ 361 mtx_init(&(ifa)->ifa_mtx, "ifaddr", NULL, MTX_DEF) 362#define IFA_LOCK(ifa) mtx_lock(&(ifa)->ifa_mtx) 363#define IFA_UNLOCK(ifa) mtx_unlock(&(ifa)->ifa_mtx) 364#define IFA_DESTROY(ifa) mtx_destroy(&(ifa)->ifa_mtx) 365 366/* 367 * The prefix structure contains information about one prefix 368 * of an interface. They are maintained by the different address families, 369 * are allocated and attached when a prefix or an address is set, 370 * and are linked together so all prefixes for an interface can be located. 371 */ 372struct ifprefix { 373 struct sockaddr *ifpr_prefix; /* prefix of interface */ 374 struct ifnet *ifpr_ifp; /* back-pointer to interface */ 375 TAILQ_ENTRY(ifprefix) ifpr_list; /* queue macro glue */ 376 u_char ifpr_plen; /* prefix length in bits */ 377 u_char ifpr_type; /* protocol dependent prefix type */ 378}; 379 380/* 381 * Multicast address structure. This is analogous to the ifaddr 382 * structure except that it keeps track of multicast addresses. 383 * Also, the reference count here is a count of requests for this 384 * address, not a count of pointers to this structure. 385 */ 386struct ifmultiaddr { 387 TAILQ_ENTRY(ifmultiaddr) ifma_link; /* queue macro glue */ 388 struct sockaddr *ifma_addr; /* address this membership is for */ 389 struct sockaddr *ifma_lladdr; /* link-layer translation, if any */ 390 struct ifnet *ifma_ifp; /* back-pointer to interface */ 391 u_int ifma_refcount; /* reference count */ 392 void *ifma_protospec; /* protocol-specific state, if any */ 393}; 394 395#ifdef _KERNEL 396#define IFAFREE(ifa) \ 397 do { \ 398 IFA_LOCK(ifa); \ 399 KASSERT((ifa)->ifa_refcnt > 0, \ 400 ("ifa %p !(ifa_refcnt > 0)", ifa)); \ 401 if (--(ifa)->ifa_refcnt == 0) { \ 402 IFA_DESTROY(ifa); \ 403 free(ifa, M_IFADDR); \ 404 } else \ 405 IFA_UNLOCK(ifa); \ 406 } while (0) 407 408#define IFAREF(ifa) \ 409 do { \ 410 IFA_LOCK(ifa); \ 411 ++(ifa)->ifa_refcnt; \ 412 IFA_UNLOCK(ifa); \ 413 } while (0) 414 415extern struct mtx ifnet_lock; 416#define IFNET_LOCK_INIT() \ 417 mtx_init(&ifnet_lock, "ifnet", NULL, MTX_DEF | MTX_RECURSE) 418#define IFNET_WLOCK() mtx_lock(&ifnet_lock) 419#define IFNET_WUNLOCK() mtx_unlock(&ifnet_lock) 420#define IFNET_RLOCK() IFNET_WLOCK() 421#define IFNET_RUNLOCK() IFNET_WUNLOCK() 422 423struct ifindex_entry { 424 struct ifnet *ife_ifnet; 425 struct ifaddr *ife_ifnet_addr; 426 dev_t ife_dev; 427}; 428 429#define ifnet_byindex(idx) ifindex_table[(idx)].ife_ifnet 430#define ifaddr_byindex(idx) ifindex_table[(idx)].ife_ifnet_addr 431#define ifdev_byindex(idx) ifindex_table[(idx)].ife_dev 432 433extern struct ifnethead ifnet; 434extern struct ifindex_entry *ifindex_table; 435extern int ifqmaxlen; 436extern struct ifnet *loif; /* first loopback interface */ 437extern int if_index; 438 439int if_addmulti(struct ifnet *, struct sockaddr *, struct ifmultiaddr **); 440int if_allmulti(struct ifnet *, int); 441void if_attach(struct ifnet *); 442int if_delmulti(struct ifnet *, struct sockaddr *); 443void if_detach(struct ifnet *); 444void if_down(struct ifnet *); 445int if_printf(struct ifnet *, const char *, ...) __printflike(2, 3); 446void if_route(struct ifnet *, int flag, int fam); 447int if_setlladdr(struct ifnet *, const u_char *, int); 448void if_unroute(struct ifnet *, int flag, int fam); 449void if_up(struct ifnet *); 450/*void ifinit(void);*/ /* declared in systm.h for main() */ 451int ifioctl(struct socket *, u_long, caddr_t, struct thread *); 452int ifpromisc(struct ifnet *, int); 453struct ifnet *ifunit(const char *); 454struct ifnet *if_withname(struct sockaddr *); 455 456int if_poll_recv_slow(struct ifnet *ifp, int *quotap); 457void if_poll_xmit_slow(struct ifnet *ifp, int *quotap); 458void if_poll_throttle(void); 459void if_poll_unthrottle(void *); 460void if_poll_init(void); 461void if_poll(void); 462 463struct ifaddr *ifa_ifwithaddr(struct sockaddr *); 464struct ifaddr *ifa_ifwithdstaddr(struct sockaddr *); 465struct ifaddr *ifa_ifwithnet(struct sockaddr *); 466struct ifaddr *ifa_ifwithroute(int, struct sockaddr *, struct sockaddr *); 467struct ifaddr *ifaof_ifpforaddr(struct sockaddr *, struct ifnet *); 468 469struct ifmultiaddr *ifmaof_ifpforaddr(struct sockaddr *, struct ifnet *); 470int if_simloop(struct ifnet *ifp, struct mbuf *m, int af, int hlen); 471 472void if_clone_attach(struct if_clone *); 473void if_clone_detach(struct if_clone *); 474 475int if_clone_create(char *, int); 476int if_clone_destroy(const char *); 477 478#define IF_LLADDR(ifp) \ 479 LLADDR((struct sockaddr_dl *) ifaddr_byindex((ifp)->if_index)->ifa_addr) 480 481#ifdef DEVICE_POLLING 482enum poll_cmd { POLL_ONLY, POLL_AND_CHECK_STATUS, POLL_DEREGISTER }; 483 484typedef void poll_handler_t(struct ifnet *ifp, enum poll_cmd cmd, int count); 485int ether_poll_register(poll_handler_t *h, struct ifnet *ifp); 486int ether_poll_deregister(struct ifnet *ifp); 487#endif /* DEVICE_POLLING */ 488 489#endif /* _KERNEL */ 490 491#endif /* !_NET_IF_VAR_H_ */ 492