ifq.h revision 145320
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 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * From: @(#)if.h 8.1 (Berkeley) 6/10/93 30 * $FreeBSD: head/sys/net/if_var.h 145320 2005-04-20 09:30:54Z glebius $ 31 */ 32 33#ifndef _NET_IF_VAR_H_ 34#define _NET_IF_VAR_H_ 35 36/* 37 * Structures defining a network interface, providing a packet 38 * transport mechanism (ala level 0 of the PUP protocols). 39 * 40 * Each interface accepts output datagrams of a specified maximum 41 * length, and provides higher level routines with input datagrams 42 * received from its medium. 43 * 44 * Output occurs when the routine if_output is called, with three parameters: 45 * (*ifp->if_output)(ifp, m, dst, rt) 46 * Here m is the mbuf chain to be sent and dst is the destination address. 47 * The output routine encapsulates the supplied datagram if necessary, 48 * and then transmits it on its medium. 49 * 50 * On input, each interface unwraps the data received by it, and either 51 * places it on the input queue of an internetwork datagram routine 52 * and posts the associated software interrupt, or passes the datagram to a raw 53 * packet input routine. 54 * 55 * Routines exist for locating interfaces by their addresses 56 * or for locating an interface on a certain network, as well as more general 57 * routing and gateway routines maintaining information used to locate 58 * interfaces. These routines live in the files if.c and route.c 59 */ 60 61#ifdef __STDC__ 62/* 63 * Forward structure declarations for function prototypes [sic]. 64 */ 65struct mbuf; 66struct thread; 67struct rtentry; 68struct rt_addrinfo; 69struct socket; 70struct ether_header; 71struct carp_if; 72#endif 73 74#include <sys/queue.h> /* get TAILQ macros */ 75 76#ifdef _KERNEL 77#include <sys/mbuf.h> 78#include <sys/eventhandler.h> 79#endif /* _KERNEL */ 80#include <sys/lock.h> /* XXX */ 81#include <sys/mutex.h> /* XXX */ 82#include <sys/event.h> /* XXX */ 83#include <sys/_task.h> 84 85#define IF_DUNIT_NONE -1 86 87#include <altq/if_altq.h> 88 89TAILQ_HEAD(ifnethead, ifnet); /* we use TAILQs so that the order of */ 90TAILQ_HEAD(ifaddrhead, ifaddr); /* instantiation is preserved in the list */ 91TAILQ_HEAD(ifprefixhead, ifprefix); 92TAILQ_HEAD(ifmultihead, ifmultiaddr); 93 94/* 95 * Structure defining a queue for a network interface. 96 */ 97struct ifqueue { 98 struct mbuf *ifq_head; 99 struct mbuf *ifq_tail; 100 int ifq_len; 101 int ifq_maxlen; 102 int ifq_drops; 103 struct mtx ifq_mtx; 104}; 105 106/* 107 * Structure defining a network interface. 108 * 109 * (Would like to call this struct ``if'', but C isn't PL/1.) 110 */ 111 112/* 113 * NB: For FreeBSD, it is assumed that each NIC driver's softc starts with 114 * one of these structures, typically held within an arpcom structure. 115 * 116 * struct <foo>_softc { 117 * struct arpcom { 118 * struct ifnet ac_if; 119 * ... 120 * } <arpcom> ; 121 * ... 122 * }; 123 * 124 * The assumption is used in a number of places, including many 125 * files in sys/net, device drivers, and sys/dev/mii.c:miibus_attach(). 126 * 127 * Unfortunately devices' softc are opaque, so we depend on this layout 128 * to locate the struct ifnet from the softc in the generic code. 129 * 130 */ 131struct ifnet { 132 void *if_softc; /* pointer to driver state */ 133 TAILQ_ENTRY(ifnet) if_link; /* all struct ifnets are chained */ 134 char if_xname[IFNAMSIZ]; /* external name (name + unit) */ 135 const char *if_dname; /* driver name */ 136 int if_dunit; /* unit or IF_DUNIT_NONE */ 137 struct ifaddrhead if_addrhead; /* linked list of addresses per if */ 138 /* 139 * if_addrhead is the list of all addresses associated to 140 * an interface. 141 * Some code in the kernel assumes that first element 142 * of the list has type AF_LINK, and contains sockaddr_dl 143 * addresses which store the link-level address and the name 144 * of the interface. 145 * However, access to the AF_LINK address through this 146 * field is deprecated. Use ifaddr_byindex() instead. 147 */ 148 struct knlist if_klist; /* events attached to this if */ 149 int if_pcount; /* number of promiscuous listeners */ 150 struct carp_if *if_carp; /* carp interface structure */ 151 struct bpf_if *if_bpf; /* packet filter structure */ 152 u_short if_index; /* numeric abbreviation for this if */ 153 short if_timer; /* time 'til if_watchdog called */ 154 u_short if_nvlans; /* number of active vlans */ 155 int if_flags; /* up/down, broadcast, etc. */ 156 int if_capabilities; /* interface capabilities */ 157 int if_capenable; /* enabled features */ 158 void *if_linkmib; /* link-type-specific MIB data */ 159 size_t if_linkmiblen; /* length of above data */ 160 struct if_data if_data; 161 struct ifmultihead if_multiaddrs; /* multicast addresses configured */ 162 int if_amcount; /* number of all-multicast requests */ 163/* procedure handles */ 164 int (*if_output) /* output routine (enqueue) */ 165 (struct ifnet *, struct mbuf *, struct sockaddr *, 166 struct rtentry *); 167 void (*if_input) /* input routine (from h/w driver) */ 168 (struct ifnet *, struct mbuf *); 169 void (*if_start) /* initiate output routine */ 170 (struct ifnet *); 171 int (*if_ioctl) /* ioctl routine */ 172 (struct ifnet *, u_long, caddr_t); 173 void (*if_watchdog) /* timer routine */ 174 (struct ifnet *); 175 void (*if_init) /* Init routine */ 176 (void *); 177 int (*if_resolvemulti) /* validate/resolve multicast */ 178 (struct ifnet *, struct sockaddr **, struct sockaddr *); 179 void *if_spare1; /* spare pointer 1 */ 180 void *if_spare2; /* spare pointer 2 */ 181 void *if_spare3; /* spare pointer 3 */ 182 u_int if_spare_flags1; /* spare flags 1 */ 183 u_int if_spare_flags2; /* spare flags 2 */ 184 struct ifaltq if_snd; /* output queue (includes altq) */ 185 const u_int8_t *if_broadcastaddr; /* linklevel broadcast bytestring */ 186 187 struct lltable *lltables; /* list of L3-L2 resolution tables */ 188 189 struct label *if_label; /* interface MAC label */ 190 191 /* these are only used by IPv6 */ 192 struct ifprefixhead if_prefixhead; /* list of prefixes per if */ 193 void *if_afdata[AF_MAX]; 194 int if_afdata_initialized; 195 struct mtx if_afdata_mtx; 196 struct task if_starttask; /* task for IFF_NEEDSGIANT */ 197 struct task if_linktask; /* task for link change events */ 198}; 199 200typedef void if_init_f_t(void *); 201 202/* 203 * XXX These aliases are terribly dangerous because they could apply 204 * to anything. 205 */ 206#define if_mtu if_data.ifi_mtu 207#define if_type if_data.ifi_type 208#define if_physical if_data.ifi_physical 209#define if_addrlen if_data.ifi_addrlen 210#define if_hdrlen if_data.ifi_hdrlen 211#define if_metric if_data.ifi_metric 212#define if_link_state if_data.ifi_link_state 213#define if_baudrate if_data.ifi_baudrate 214#define if_hwassist if_data.ifi_hwassist 215#define if_ipackets if_data.ifi_ipackets 216#define if_ierrors if_data.ifi_ierrors 217#define if_opackets if_data.ifi_opackets 218#define if_oerrors if_data.ifi_oerrors 219#define if_collisions if_data.ifi_collisions 220#define if_ibytes if_data.ifi_ibytes 221#define if_obytes if_data.ifi_obytes 222#define if_imcasts if_data.ifi_imcasts 223#define if_omcasts if_data.ifi_omcasts 224#define if_iqdrops if_data.ifi_iqdrops 225#define if_noproto if_data.ifi_noproto 226#define if_lastchange if_data.ifi_lastchange 227#define if_recvquota if_data.ifi_recvquota 228#define if_xmitquota if_data.ifi_xmitquota 229#define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)NULL) 230 231/* for compatibility with other BSDs */ 232#define if_addrlist if_addrhead 233#define if_list if_link 234 235/* 236 * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq) 237 * are queues of messages stored on ifqueue structures 238 * (defined above). Entries are added to and deleted from these structures 239 * by these macros, which should be called with ipl raised to splimp(). 240 */ 241#define IF_LOCK(ifq) mtx_lock(&(ifq)->ifq_mtx) 242#define IF_UNLOCK(ifq) mtx_unlock(&(ifq)->ifq_mtx) 243#define IF_LOCK_ASSERT(ifq) mtx_assert(&(ifq)->ifq_mtx, MA_OWNED) 244#define _IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 245#define _IF_DROP(ifq) ((ifq)->ifq_drops++) 246#define _IF_QLEN(ifq) ((ifq)->ifq_len) 247 248#define _IF_ENQUEUE(ifq, m) do { \ 249 (m)->m_nextpkt = NULL; \ 250 if ((ifq)->ifq_tail == NULL) \ 251 (ifq)->ifq_head = m; \ 252 else \ 253 (ifq)->ifq_tail->m_nextpkt = m; \ 254 (ifq)->ifq_tail = m; \ 255 (ifq)->ifq_len++; \ 256} while (0) 257 258#define IF_ENQUEUE(ifq, m) do { \ 259 IF_LOCK(ifq); \ 260 _IF_ENQUEUE(ifq, m); \ 261 IF_UNLOCK(ifq); \ 262} while (0) 263 264#define _IF_PREPEND(ifq, m) do { \ 265 (m)->m_nextpkt = (ifq)->ifq_head; \ 266 if ((ifq)->ifq_tail == NULL) \ 267 (ifq)->ifq_tail = (m); \ 268 (ifq)->ifq_head = (m); \ 269 (ifq)->ifq_len++; \ 270} while (0) 271 272#define IF_PREPEND(ifq, m) do { \ 273 IF_LOCK(ifq); \ 274 _IF_PREPEND(ifq, m); \ 275 IF_UNLOCK(ifq); \ 276} while (0) 277 278#define _IF_DEQUEUE(ifq, m) do { \ 279 (m) = (ifq)->ifq_head; \ 280 if (m) { \ 281 if (((ifq)->ifq_head = (m)->m_nextpkt) == NULL) \ 282 (ifq)->ifq_tail = NULL; \ 283 (m)->m_nextpkt = NULL; \ 284 (ifq)->ifq_len--; \ 285 } \ 286} while (0) 287 288#define IF_DEQUEUE(ifq, m) do { \ 289 IF_LOCK(ifq); \ 290 _IF_DEQUEUE(ifq, m); \ 291 IF_UNLOCK(ifq); \ 292} while (0) 293 294#define _IF_POLL(ifq, m) ((m) = (ifq)->ifq_head) 295#define IF_POLL(ifq, m) _IF_POLL(ifq, m) 296 297#define _IF_DRAIN(ifq) do { \ 298 struct mbuf *m; \ 299 for (;;) { \ 300 _IF_DEQUEUE(ifq, m); \ 301 if (m == NULL) \ 302 break; \ 303 m_freem(m); \ 304 } \ 305} while (0) 306 307#define IF_DRAIN(ifq) do { \ 308 IF_LOCK(ifq); \ 309 _IF_DRAIN(ifq); \ 310 IF_UNLOCK(ifq); \ 311} while(0) 312 313#ifdef _KERNEL 314/* interface address change event */ 315typedef void (*ifaddr_event_handler_t)(void *, struct ifnet *); 316EVENTHANDLER_DECLARE(ifaddr_event, ifaddr_event_handler_t); 317/* new interface arrival event */ 318typedef void (*ifnet_arrival_event_handler_t)(void *, struct ifnet *); 319EVENTHANDLER_DECLARE(ifnet_arrival_event, ifnet_arrival_event_handler_t); 320/* interface departure event */ 321typedef void (*ifnet_departure_event_handler_t)(void *, struct ifnet *); 322EVENTHANDLER_DECLARE(ifnet_departure_event, ifnet_departure_event_handler_t); 323 324#define IF_AFDATA_LOCK_INIT(ifp) \ 325 mtx_init(&(ifp)->if_afdata_mtx, "if_afdata", NULL, MTX_DEF) 326#define IF_AFDATA_LOCK(ifp) mtx_lock(&(ifp)->if_afdata_mtx) 327#define IF_AFDATA_TRYLOCK(ifp) mtx_trylock(&(ifp)->if_afdata_mtx) 328#define IF_AFDATA_UNLOCK(ifp) mtx_unlock(&(ifp)->if_afdata_mtx) 329#define IF_AFDATA_DESTROY(ifp) mtx_destroy(&(ifp)->if_afdata_mtx) 330 331#define IFF_LOCKGIANT(ifp) do { \ 332 if ((ifp)->if_flags & IFF_NEEDSGIANT) \ 333 mtx_lock(&Giant); \ 334} while (0) 335 336#define IFF_UNLOCKGIANT(ifp) do { \ 337 if ((ifp)->if_flags & IFF_NEEDSGIANT) \ 338 mtx_unlock(&Giant); \ 339} while (0) 340 341int if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp, 342 int adjust); 343#define IF_HANDOFF(ifq, m, ifp) \ 344 if_handoff((struct ifqueue *)ifq, m, ifp, 0) 345#define IF_HANDOFF_ADJ(ifq, m, ifp, adj) \ 346 if_handoff((struct ifqueue *)ifq, m, ifp, adj) 347 348void if_start(struct ifnet *); 349 350#define IFQ_ENQUEUE(ifq, m, err) \ 351do { \ 352 IF_LOCK(ifq); \ 353 if (ALTQ_IS_ENABLED(ifq)) \ 354 ALTQ_ENQUEUE(ifq, m, NULL, err); \ 355 else { \ 356 if (_IF_QFULL(ifq)) { \ 357 m_freem(m); \ 358 (err) = ENOBUFS; \ 359 } else { \ 360 _IF_ENQUEUE(ifq, m); \ 361 (err) = 0; \ 362 } \ 363 } \ 364 if (err) \ 365 (ifq)->ifq_drops++; \ 366 IF_UNLOCK(ifq); \ 367} while (0) 368 369#define IFQ_DEQUEUE_NOLOCK(ifq, m) \ 370do { \ 371 if (TBR_IS_ENABLED(ifq)) \ 372 (m) = tbr_dequeue_ptr(ifq, ALTDQ_REMOVE); \ 373 else if (ALTQ_IS_ENABLED(ifq)) \ 374 ALTQ_DEQUEUE(ifq, m); \ 375 else \ 376 _IF_DEQUEUE(ifq, m); \ 377} while (0) 378 379#define IFQ_DEQUEUE(ifq, m) \ 380do { \ 381 IF_LOCK(ifq); \ 382 IFQ_DEQUEUE_NOLOCK(ifq, m); \ 383 IF_UNLOCK(ifq); \ 384} while (0) 385 386#define IFQ_POLL_NOLOCK(ifq, m) \ 387do { \ 388 if (TBR_IS_ENABLED(ifq)) \ 389 (m) = tbr_dequeue_ptr(ifq, ALTDQ_POLL); \ 390 else if (ALTQ_IS_ENABLED(ifq)) \ 391 ALTQ_POLL(ifq, m); \ 392 else \ 393 _IF_POLL(ifq, m); \ 394} while (0) 395 396#define IFQ_POLL(ifq, m) \ 397do { \ 398 IF_LOCK(ifq); \ 399 IFQ_POLL_NOLOCK(ifq, m); \ 400 IF_UNLOCK(ifq); \ 401} while (0) 402 403#define IFQ_PURGE_NOLOCK(ifq) \ 404do { \ 405 if (ALTQ_IS_ENABLED(ifq)) { \ 406 ALTQ_PURGE(ifq); \ 407 } else \ 408 _IF_DRAIN(ifq); \ 409} while (0) 410 411#define IFQ_PURGE(ifq) \ 412do { \ 413 IF_LOCK(ifq); \ 414 IFQ_PURGE_NOLOCK(ifq); \ 415 IF_UNLOCK(ifq); \ 416} while (0) 417 418#define IFQ_SET_READY(ifq) \ 419 do { ((ifq)->altq_flags |= ALTQF_READY); } while (0) 420 421#define IFQ_LOCK(ifq) IF_LOCK(ifq) 422#define IFQ_UNLOCK(ifq) IF_UNLOCK(ifq) 423#define IFQ_LOCK_ASSERT(ifq) IF_LOCK_ASSERT(ifq) 424#define IFQ_IS_EMPTY(ifq) ((ifq)->ifq_len == 0) 425#define IFQ_INC_LEN(ifq) ((ifq)->ifq_len++) 426#define IFQ_DEC_LEN(ifq) (--(ifq)->ifq_len) 427#define IFQ_INC_DROPS(ifq) ((ifq)->ifq_drops++) 428#define IFQ_SET_MAXLEN(ifq, len) ((ifq)->ifq_maxlen = (len)) 429 430#define IFQ_HANDOFF_ADJ(ifp, m, adj, err) \ 431do { \ 432 int len; \ 433 short mflags; \ 434 \ 435 len = (m)->m_pkthdr.len; \ 436 mflags = (m)->m_flags; \ 437 IFQ_ENQUEUE(&(ifp)->if_snd, m, err); \ 438 if ((err) == 0) { \ 439 (ifp)->if_obytes += len + (adj); \ 440 if (mflags & M_MCAST) \ 441 (ifp)->if_omcasts++; \ 442 if (((ifp)->if_flags & IFF_OACTIVE) == 0) \ 443 if_start(ifp); \ 444 } \ 445} while (0) 446 447#define IFQ_HANDOFF(ifp, m, err) \ 448 IFQ_HANDOFF_ADJ(ifp, m, 0, err) 449 450#define IFQ_DRV_DEQUEUE(ifq, m) \ 451do { \ 452 (m) = (ifq)->ifq_drv_head; \ 453 if (m) { \ 454 if (((ifq)->ifq_drv_head = (m)->m_nextpkt) == NULL) \ 455 (ifq)->ifq_drv_tail = NULL; \ 456 (m)->m_nextpkt = NULL; \ 457 (ifq)->ifq_drv_len--; \ 458 } else { \ 459 IFQ_LOCK(ifq); \ 460 IFQ_DEQUEUE_NOLOCK(ifq, m); \ 461 while ((ifq)->ifq_drv_len < (ifq)->ifq_drv_maxlen) { \ 462 struct mbuf *m0; \ 463 IFQ_DEQUEUE_NOLOCK(ifq, m0); \ 464 if (m0 == NULL) \ 465 break; \ 466 m0->m_nextpkt = NULL; \ 467 if ((ifq)->ifq_drv_tail == NULL) \ 468 (ifq)->ifq_drv_head = m0; \ 469 else \ 470 (ifq)->ifq_drv_tail->m_nextpkt = m0; \ 471 (ifq)->ifq_drv_tail = m0; \ 472 (ifq)->ifq_drv_len++; \ 473 } \ 474 IFQ_UNLOCK(ifq); \ 475 } \ 476} while (0) 477 478#define IFQ_DRV_PREPEND(ifq, m) \ 479do { \ 480 (m)->m_nextpkt = (ifq)->ifq_drv_head; \ 481 if ((ifq)->ifq_drv_tail == NULL) \ 482 (ifq)->ifq_drv_tail = (m); \ 483 (ifq)->ifq_drv_head = (m); \ 484 (ifq)->ifq_drv_len++; \ 485} while (0) 486 487#define IFQ_DRV_IS_EMPTY(ifq) \ 488 (((ifq)->ifq_drv_len == 0) && ((ifq)->ifq_len == 0)) 489 490#define IFQ_DRV_PURGE(ifq) \ 491do { \ 492 struct mbuf *m, *n = (ifq)->ifq_drv_head; \ 493 while((m = n) != NULL) { \ 494 n = m->m_nextpkt; \ 495 m_freem(m); \ 496 } \ 497 (ifq)->ifq_drv_head = (ifq)->ifq_drv_tail = NULL; \ 498 (ifq)->ifq_drv_len = 0; \ 499 IFQ_PURGE(ifq); \ 500} while (0) 501 502/* 503 * 72 was chosen below because it is the size of a TCP/IP 504 * header (40) + the minimum mss (32). 505 */ 506#define IF_MINMTU 72 507#define IF_MAXMTU 65535 508 509#endif /* _KERNEL */ 510 511/* 512 * The ifaddr structure contains information about one address 513 * of an interface. They are maintained by the different address families, 514 * are allocated and attached when an address is set, and are linked 515 * together so all addresses for an interface can be located. 516 * 517 * NOTE: a 'struct ifaddr' is always at the beginning of a larger 518 * chunk of malloc'ed memory, where we store the three addresses 519 * (ifa_addr, ifa_dstaddr and ifa_netmask) referenced here. 520 */ 521struct ifaddr { 522 struct sockaddr *ifa_addr; /* address of interface */ 523 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ 524#define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ 525 struct sockaddr *ifa_netmask; /* used to determine subnet */ 526 struct if_data if_data; /* not all members are meaningful */ 527 struct ifnet *ifa_ifp; /* back-pointer to interface */ 528 TAILQ_ENTRY(ifaddr) ifa_link; /* queue macro glue */ 529 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */ 530 (int, struct rtentry *, struct rt_addrinfo *); 531 u_short ifa_flags; /* mostly rt_flags for cloning */ 532 u_int ifa_refcnt; /* references to this structure */ 533 int ifa_metric; /* cost of going out this interface */ 534 int (*ifa_claim_addr) /* check if an addr goes to this if */ 535 (struct ifaddr *, struct sockaddr *); 536 struct mtx ifa_mtx; 537}; 538#define IFA_ROUTE RTF_UP /* route installed */ 539 540/* for compatibility with other BSDs */ 541#define ifa_list ifa_link 542 543#define IFA_LOCK_INIT(ifa) \ 544 mtx_init(&(ifa)->ifa_mtx, "ifaddr", NULL, MTX_DEF) 545#define IFA_LOCK(ifa) mtx_lock(&(ifa)->ifa_mtx) 546#define IFA_UNLOCK(ifa) mtx_unlock(&(ifa)->ifa_mtx) 547#define IFA_DESTROY(ifa) mtx_destroy(&(ifa)->ifa_mtx) 548 549/* 550 * The prefix structure contains information about one prefix 551 * of an interface. They are maintained by the different address families, 552 * are allocated and attached when a prefix or an address is set, 553 * and are linked together so all prefixes for an interface can be located. 554 */ 555struct ifprefix { 556 struct sockaddr *ifpr_prefix; /* prefix of interface */ 557 struct ifnet *ifpr_ifp; /* back-pointer to interface */ 558 TAILQ_ENTRY(ifprefix) ifpr_list; /* queue macro glue */ 559 u_char ifpr_plen; /* prefix length in bits */ 560 u_char ifpr_type; /* protocol dependent prefix type */ 561}; 562 563/* 564 * Multicast address structure. This is analogous to the ifaddr 565 * structure except that it keeps track of multicast addresses. 566 * Also, the reference count here is a count of requests for this 567 * address, not a count of pointers to this structure. 568 */ 569struct ifmultiaddr { 570 TAILQ_ENTRY(ifmultiaddr) ifma_link; /* queue macro glue */ 571 struct sockaddr *ifma_addr; /* address this membership is for */ 572 struct sockaddr *ifma_lladdr; /* link-layer translation, if any */ 573 struct ifnet *ifma_ifp; /* back-pointer to interface */ 574 u_int ifma_refcount; /* reference count */ 575 void *ifma_protospec; /* protocol-specific state, if any */ 576}; 577 578#ifdef _KERNEL 579#define IFAFREE(ifa) \ 580 do { \ 581 IFA_LOCK(ifa); \ 582 KASSERT((ifa)->ifa_refcnt > 0, \ 583 ("ifa %p !(ifa_refcnt > 0)", ifa)); \ 584 if (--(ifa)->ifa_refcnt == 0) { \ 585 IFA_DESTROY(ifa); \ 586 free(ifa, M_IFADDR); \ 587 } else \ 588 IFA_UNLOCK(ifa); \ 589 } while (0) 590 591#define IFAREF(ifa) \ 592 do { \ 593 IFA_LOCK(ifa); \ 594 ++(ifa)->ifa_refcnt; \ 595 IFA_UNLOCK(ifa); \ 596 } while (0) 597 598extern struct mtx ifnet_lock; 599#define IFNET_LOCK_INIT() \ 600 mtx_init(&ifnet_lock, "ifnet", NULL, MTX_DEF | MTX_RECURSE) 601#define IFNET_WLOCK() mtx_lock(&ifnet_lock) 602#define IFNET_WUNLOCK() mtx_unlock(&ifnet_lock) 603#define IFNET_RLOCK() IFNET_WLOCK() 604#define IFNET_RUNLOCK() IFNET_WUNLOCK() 605 606struct ifindex_entry { 607 struct ifnet *ife_ifnet; 608 struct ifaddr *ife_ifnet_addr; 609 struct cdev *ife_dev; 610}; 611 612#define ifnet_byindex(idx) ifindex_table[(idx)].ife_ifnet 613/* 614 * Given the index, ifaddr_byindex() returns the one and only 615 * link-level ifaddr for the interface. You are not supposed to use 616 * it to traverse the list of addresses associated to the interface. 617 */ 618#define ifaddr_byindex(idx) ifindex_table[(idx)].ife_ifnet_addr 619#define ifdev_byindex(idx) ifindex_table[(idx)].ife_dev 620 621extern struct ifnethead ifnet; 622extern struct ifindex_entry *ifindex_table; 623extern int ifqmaxlen; 624extern struct ifnet *loif; /* first loopback interface */ 625extern int if_index; 626 627int if_addmulti(struct ifnet *, struct sockaddr *, struct ifmultiaddr **); 628int if_allmulti(struct ifnet *, int); 629void if_attach(struct ifnet *); 630int if_delmulti(struct ifnet *, struct sockaddr *); 631void if_detach(struct ifnet *); 632void if_down(struct ifnet *); 633void if_initname(struct ifnet *, const char *, int); 634void if_link_state_change(struct ifnet *, int); 635int if_printf(struct ifnet *, const char *, ...) __printflike(2, 3); 636int if_setlladdr(struct ifnet *, const u_char *, int); 637void if_up(struct ifnet *); 638/*void ifinit(void);*/ /* declared in systm.h for main() */ 639int ifioctl(struct socket *, u_long, caddr_t, struct thread *); 640int ifpromisc(struct ifnet *, int); 641struct ifnet *ifunit(const char *); 642 643struct ifaddr *ifa_ifwithaddr(struct sockaddr *); 644struct ifaddr *ifa_ifwithdstaddr(struct sockaddr *); 645struct ifaddr *ifa_ifwithnet(struct sockaddr *); 646struct ifaddr *ifa_ifwithroute(int, struct sockaddr *, struct sockaddr *); 647struct ifaddr *ifaof_ifpforaddr(struct sockaddr *, struct ifnet *); 648 649struct ifmultiaddr *ifmaof_ifpforaddr(struct sockaddr *, struct ifnet *); 650int if_simloop(struct ifnet *ifp, struct mbuf *m, int af, int hlen); 651 652#define IF_LLADDR(ifp) \ 653 LLADDR((struct sockaddr_dl *) ifaddr_byindex((ifp)->if_index)->ifa_addr) 654 655#ifdef DEVICE_POLLING 656enum poll_cmd { POLL_ONLY, POLL_AND_CHECK_STATUS, POLL_DEREGISTER }; 657 658typedef void poll_handler_t(struct ifnet *ifp, enum poll_cmd cmd, int count); 659int ether_poll_register(poll_handler_t *h, struct ifnet *ifp); 660int ether_poll_deregister(struct ifnet *ifp); 661#endif /* DEVICE_POLLING */ 662 663#endif /* _KERNEL */ 664 665#endif /* !_NET_IF_VAR_H_ */ 666