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$ 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 */ 65 struct mbuf; 66 struct thread; 67 struct rtentry; 68 struct rt_addrinfo; 69 struct socket; 70 struct ether_header; 71 struct carp_if; 72 struct ifvlantrunk; 73 struct route; 74 struct vnet; 75 #endif 76 77 #include <sys/queue.h> /* get TAILQ macros */ 78 79 #ifdef _KERNEL 80 #include <sys/mbuf.h> 81 #include <sys/eventhandler.h> 82 #include <sys/buf_ring.h> 83 #include <net/vnet.h> 84 #endif /* _KERNEL */ 85 #include <sys/lock.h> /* XXX */ 86 #include <sys/mutex.h> /* XXX */ 87 #include <sys/rwlock.h> /* XXX */ 88 #include <sys/sx.h> /* XXX */ 89 #include <sys/event.h> /* XXX */ 90 #include <sys/_task.h> 91 92 #define IF_DUNIT_NONE -1 93 94 #include <altq/if_altq.h> 95 96 TAILQ_HEAD(ifnethead, ifnet); /* we use TAILQs so that the order of */ 97 TAILQ_HEAD(ifaddrhead, ifaddr); /* instantiation is preserved in the list */ 98 TAILQ_HEAD(ifprefixhead, ifprefix); 99 TAILQ_HEAD(ifmultihead, ifmultiaddr); 100 TAILQ_HEAD(ifgrouphead, ifg_group); 101 102 /* 103 * Structure defining a queue for a network interface. 104 */ 105 struct ifqueue { 106 struct mbuf *ifq_head; 107 struct mbuf *ifq_tail; 108 int ifq_len; 109 int ifq_maxlen; 110 int ifq_drops; 111 struct mtx ifq_mtx; 112 }; 113 114 /* 115 * Structure defining a network interface. 116 * 117 * (Would like to call this struct ``if'', but C isn't PL/1.) 118 */ 119 120 struct ifnet { 121 void *if_softc; /* pointer to driver state */ 122 void *if_l2com; /* pointer to protocol bits */ 123 struct vnet *if_vnet; /* pointer to network stack instance */ 124 TAILQ_ENTRY(ifnet) if_link; /* all struct ifnets are chained */ 125 char if_xname[IFNAMSIZ]; /* external name (name + unit) */ 126 const char *if_dname; /* driver name */ 127 int if_dunit; /* unit or IF_DUNIT_NONE */ 128 u_int if_refcount; /* reference count */ 129 struct ifaddrhead if_addrhead; /* linked list of addresses per if */ 130 /* 131 * if_addrhead is the list of all addresses associated to 132 * an interface. 133 * Some code in the kernel assumes that first element 134 * of the list has type AF_LINK, and contains sockaddr_dl 135 * addresses which store the link-level address and the name 136 * of the interface. 137 * However, access to the AF_LINK address through this 138 * field is deprecated. Use if_addr or ifaddr_byindex() instead. 139 */ 140 int if_pcount; /* number of promiscuous listeners */ 141 struct carp_if *if_carp; /* carp interface structure */ 142 struct bpf_if *if_bpf; /* packet filter structure */ 143 u_short if_index; /* numeric abbreviation for this if */ 144 short if_index_reserved; /* spare space to grow if_index */ 145 struct ifvlantrunk *if_vlantrunk; /* pointer to 802.1q data */ 146 int if_flags; /* up/down, broadcast, etc. */ 147 int if_capabilities; /* interface features & capabilities */ 148 int if_capenable; /* enabled features & capabilities */ 149 void *if_linkmib; /* link-type-specific MIB data */ 150 size_t if_linkmiblen; /* length of above data */ 151 struct if_data if_data; 152 struct ifmultihead if_multiaddrs; /* multicast addresses configured */ 153 int if_amcount; /* number of all-multicast requests */ 154 /* procedure handles */ 155 int (*if_output) /* output routine (enqueue) */ 156 (struct ifnet *, struct mbuf *, struct sockaddr *, 157 struct route *); 158 void (*if_input) /* input routine (from h/w driver) */ 159 (struct ifnet *, struct mbuf *); 160 void (*if_start) /* initiate output routine */ 161 (struct ifnet *); 162 int (*if_ioctl) /* ioctl routine */ 163 (struct ifnet *, u_long, caddr_t); 164 void (*if_init) /* Init routine */ 165 (void *); 166 int (*if_resolvemulti) /* validate/resolve multicast */ 167 (struct ifnet *, struct sockaddr **, struct sockaddr *); 168 void (*if_qflush) /* flush any queues */ 169 (struct ifnet *); 170 int (*if_transmit) /* initiate output routine */ 171 (struct ifnet *, struct mbuf *); 172 void (*if_reassign) /* reassign to vnet routine */ 173 (struct ifnet *, struct vnet *, char *); 174 struct vnet *if_home_vnet; /* where this ifnet originates from */ 175 struct ifaddr *if_addr; /* pointer to link-level address */ 176 void *if_llsoftc; /* link layer softc */ 177 int if_drv_flags; /* driver-managed status flags */ 178 struct ifaltq if_snd; /* output queue (includes altq) */ 179 const u_int8_t *if_broadcastaddr; /* linklevel broadcast bytestring */ 180 181 void *if_bridge; /* bridge glue */ 182 183 struct label *if_label; /* interface MAC label */ 184 185 /* these are only used by IPv6 */ 186 struct ifprefixhead if_prefixhead; /* list of prefixes per if */ 187 void *if_afdata[AF_MAX]; 188 int if_afdata_initialized; 189 struct rwlock if_afdata_lock; 190 struct task if_linktask; /* task for link change events */ 191 struct mtx if_addr_mtx; /* mutex to protect address lists */ 192 193 LIST_ENTRY(ifnet) if_clones; /* interfaces of a cloner */ 194 TAILQ_HEAD(, ifg_list) if_groups; /* linked list of groups per if */ 195 /* protected by if_addr_mtx */ 196 void *if_pf_kif; 197 void *if_lagg; /* lagg glue */ 198 u_char if_alloctype; /* if_type at time of allocation */ 199 200 /* 201 * Spare fields are added so that we can modify sensitive data 202 * structures without changing the kernel binary interface, and must 203 * be used with care where binary compatibility is required. 204 */ 205 char if_cspare[3]; 206 char *if_description; /* interface description */ 207 void *if_pspare[7]; 208 int if_ispare[4]; 209 }; 210 211 typedef void if_init_f_t(void *); 212 213 /* 214 * XXX These aliases are terribly dangerous because they could apply 215 * to anything. 216 */ 217 #define if_mtu if_data.ifi_mtu 218 #define if_type if_data.ifi_type 219 #define if_physical if_data.ifi_physical 220 #define if_addrlen if_data.ifi_addrlen 221 #define if_hdrlen if_data.ifi_hdrlen 222 #define if_metric if_data.ifi_metric 223 #define if_link_state if_data.ifi_link_state 224 #define if_baudrate if_data.ifi_baudrate 225 #define if_hwassist if_data.ifi_hwassist 226 #define if_ipackets if_data.ifi_ipackets 227 #define if_ierrors if_data.ifi_ierrors 228 #define if_opackets if_data.ifi_opackets 229 #define if_oerrors if_data.ifi_oerrors 230 #define if_collisions if_data.ifi_collisions 231 #define if_ibytes if_data.ifi_ibytes 232 #define if_obytes if_data.ifi_obytes 233 #define if_imcasts if_data.ifi_imcasts 234 #define if_omcasts if_data.ifi_omcasts 235 #define if_iqdrops if_data.ifi_iqdrops 236 #define if_noproto if_data.ifi_noproto 237 #define if_lastchange if_data.ifi_lastchange 238 239 /* for compatibility with other BSDs */ 240 #define if_addrlist if_addrhead 241 #define if_list if_link 242 #define if_name(ifp) ((ifp)->if_xname) 243 244 /* 245 * Locks for address lists on the network interface. 246 */ 247 #define IF_ADDR_LOCK_INIT(if) mtx_init(&(if)->if_addr_mtx, \ 248 "if_addr_mtx", NULL, MTX_DEF) 249 #define IF_ADDR_LOCK_DESTROY(if) mtx_destroy(&(if)->if_addr_mtx) 250 #define IF_ADDR_LOCK(if) mtx_lock(&(if)->if_addr_mtx) 251 #define IF_ADDR_UNLOCK(if) mtx_unlock(&(if)->if_addr_mtx) 252 #define IF_ADDR_LOCK_ASSERT(if) mtx_assert(&(if)->if_addr_mtx, MA_OWNED) 253 254 /* 255 * Function variations on locking macros intended to be used by loadable 256 * kernel modules in order to divorce them from the internals of address list 257 * locking. 258 */ 259 void if_addr_rlock(struct ifnet *ifp); /* if_addrhead */ 260 void if_addr_runlock(struct ifnet *ifp); /* if_addrhead */ 261 void if_maddr_rlock(struct ifnet *ifp); /* if_multiaddrs */ 262 void if_maddr_runlock(struct ifnet *ifp); /* if_multiaddrs */ 263 264 /* 265 * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq) 266 * are queues of messages stored on ifqueue structures 267 * (defined above). Entries are added to and deleted from these structures 268 * by these macros, which should be called with ipl raised to splimp(). 269 */ 270 #define IF_LOCK(ifq) mtx_lock(&(ifq)->ifq_mtx) 271 #define IF_UNLOCK(ifq) mtx_unlock(&(ifq)->ifq_mtx) 272 #define IF_LOCK_ASSERT(ifq) mtx_assert(&(ifq)->ifq_mtx, MA_OWNED) 273 #define _IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 274 #define _IF_DROP(ifq) ((ifq)->ifq_drops++) 275 #define _IF_QLEN(ifq) ((ifq)->ifq_len) 276 277 #define _IF_ENQUEUE(ifq, m) do { \ 278 (m)->m_nextpkt = NULL; \ 279 if ((ifq)->ifq_tail == NULL) \ 280 (ifq)->ifq_head = m; \ 281 else \ 282 (ifq)->ifq_tail->m_nextpkt = m; \ 283 (ifq)->ifq_tail = m; \ 284 (ifq)->ifq_len++; \ 285 } while (0) 286 287 #define IF_ENQUEUE(ifq, m) do { \ 288 IF_LOCK(ifq); \ 289 _IF_ENQUEUE(ifq, m); \ 290 IF_UNLOCK(ifq); \ 291 } while (0) 292 293 #define _IF_PREPEND(ifq, m) do { \ 294 (m)->m_nextpkt = (ifq)->ifq_head; \ 295 if ((ifq)->ifq_tail == NULL) \ 296 (ifq)->ifq_tail = (m); \ 297 (ifq)->ifq_head = (m); \ 298 (ifq)->ifq_len++; \ 299 } while (0) 300 301 #define IF_PREPEND(ifq, m) do { \ 302 IF_LOCK(ifq); \ 303 _IF_PREPEND(ifq, m); \ 304 IF_UNLOCK(ifq); \ 305 } while (0) 306 307 #define _IF_DEQUEUE(ifq, m) do { \ 308 (m) = (ifq)->ifq_head; \ 309 if (m) { \ 310 if (((ifq)->ifq_head = (m)->m_nextpkt) == NULL) \ 311 (ifq)->ifq_tail = NULL; \ 312 (m)->m_nextpkt = NULL; \ 313 (ifq)->ifq_len--; \ 314 } \ 315 } while (0) 316 317 #define IF_DEQUEUE(ifq, m) do { \ 318 IF_LOCK(ifq); \ 319 _IF_DEQUEUE(ifq, m); \ 320 IF_UNLOCK(ifq); \ 321 } while (0) 322 323 #define _IF_POLL(ifq, m) ((m) = (ifq)->ifq_head) 324 #define IF_POLL(ifq, m) _IF_POLL(ifq, m) 325 326 #define _IF_DRAIN(ifq) do { \ 327 struct mbuf *m; \ 328 for (;;) { \ 329 _IF_DEQUEUE(ifq, m); \ 330 if (m == NULL) \ 331 break; \ 332 m_freem(m); \ 333 } \ 334 } while (0) 335 336 #define IF_DRAIN(ifq) do { \ 337 IF_LOCK(ifq); \ 338 _IF_DRAIN(ifq); \ 339 IF_UNLOCK(ifq); \ 340 } while(0) 341 342 #ifdef _KERNEL 343 /* interface link layer address change event */ 344 typedef void (*iflladdr_event_handler_t)(void *, struct ifnet *); 345 EVENTHANDLER_DECLARE(iflladdr_event, iflladdr_event_handler_t); 346 /* interface address change event */ 347 typedef void (*ifaddr_event_handler_t)(void *, struct ifnet *); 348 EVENTHANDLER_DECLARE(ifaddr_event, ifaddr_event_handler_t); 349 /* new interface arrival event */ 350 typedef void (*ifnet_arrival_event_handler_t)(void *, struct ifnet *); 351 EVENTHANDLER_DECLARE(ifnet_arrival_event, ifnet_arrival_event_handler_t); 352 /* interface departure event */ 353 typedef void (*ifnet_departure_event_handler_t)(void *, struct ifnet *); 354 EVENTHANDLER_DECLARE(ifnet_departure_event, ifnet_departure_event_handler_t); 355 /* Interface link state change event */ 356 typedef void (*ifnet_link_event_handler_t)(void *, struct ifnet *, int); 357 EVENTHANDLER_DECLARE(ifnet_link_event, ifnet_link_event_handler_t); 358 359 /* 360 * interface groups 361 */ 362 struct ifg_group { 363 char ifg_group[IFNAMSIZ]; 364 u_int ifg_refcnt; 365 void *ifg_pf_kif; 366 TAILQ_HEAD(, ifg_member) ifg_members; 367 TAILQ_ENTRY(ifg_group) ifg_next; 368 }; 369 370 struct ifg_member { 371 TAILQ_ENTRY(ifg_member) ifgm_next; 372 struct ifnet *ifgm_ifp; 373 }; 374 375 struct ifg_list { 376 struct ifg_group *ifgl_group; 377 TAILQ_ENTRY(ifg_list) ifgl_next; 378 }; 379 380 /* group attach event */ 381 typedef void (*group_attach_event_handler_t)(void *, struct ifg_group *); 382 EVENTHANDLER_DECLARE(group_attach_event, group_attach_event_handler_t); 383 /* group detach event */ 384 typedef void (*group_detach_event_handler_t)(void *, struct ifg_group *); 385 EVENTHANDLER_DECLARE(group_detach_event, group_detach_event_handler_t); 386 /* group change event */ 387 typedef void (*group_change_event_handler_t)(void *, const char *); 388 EVENTHANDLER_DECLARE(group_change_event, group_change_event_handler_t); 389 390 #define IF_AFDATA_LOCK_INIT(ifp) \ 391 rw_init(&(ifp)->if_afdata_lock, "if_afdata") 392 393 #define IF_AFDATA_WLOCK(ifp) rw_wlock(&(ifp)->if_afdata_lock) 394 #define IF_AFDATA_RLOCK(ifp) rw_rlock(&(ifp)->if_afdata_lock) 395 #define IF_AFDATA_WUNLOCK(ifp) rw_wunlock(&(ifp)->if_afdata_lock) 396 #define IF_AFDATA_RUNLOCK(ifp) rw_runlock(&(ifp)->if_afdata_lock) 397 #define IF_AFDATA_LOCK(ifp) IF_AFDATA_WLOCK(ifp) 398 #define IF_AFDATA_UNLOCK(ifp) IF_AFDATA_WUNLOCK(ifp) 399 #define IF_AFDATA_TRYLOCK(ifp) rw_try_wlock(&(ifp)->if_afdata_lock) 400 #define IF_AFDATA_DESTROY(ifp) rw_destroy(&(ifp)->if_afdata_lock) 401 402 #define IF_AFDATA_LOCK_ASSERT(ifp) rw_assert(&(ifp)->if_afdata_lock, RA_LOCKED) 403 #define IF_AFDATA_UNLOCK_ASSERT(ifp) rw_assert(&(ifp)->if_afdata_lock, RA_UNLOCKED) 404 405 int if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp, 406 int adjust); 407 #define IF_HANDOFF(ifq, m, ifp) \ 408 if_handoff((struct ifqueue *)ifq, m, ifp, 0) 409 #define IF_HANDOFF_ADJ(ifq, m, ifp, adj) \ 410 if_handoff((struct ifqueue *)ifq, m, ifp, adj) 411 412 void if_start(struct ifnet *); 413 414 #define IFQ_ENQUEUE(ifq, m, err) \ 415 do { \ 416 IF_LOCK(ifq); \ 417 if (ALTQ_IS_ENABLED(ifq)) \ 418 ALTQ_ENQUEUE(ifq, m, NULL, err); \ 419 else { \ 420 if (_IF_QFULL(ifq)) { \ 421 m_freem(m); \ 422 (err) = ENOBUFS; \ 423 } else { \ 424 _IF_ENQUEUE(ifq, m); \ 425 (err) = 0; \ 426 } \ 427 } \ 428 if (err) \ 429 (ifq)->ifq_drops++; \ 430 IF_UNLOCK(ifq); \ 431 } while (0) 432 433 #define IFQ_DEQUEUE_NOLOCK(ifq, m) \ 434 do { \ 435 if (TBR_IS_ENABLED(ifq)) \ 436 (m) = tbr_dequeue_ptr(ifq, ALTDQ_REMOVE); \ 437 else if (ALTQ_IS_ENABLED(ifq)) \ 438 ALTQ_DEQUEUE(ifq, m); \ 439 else \ 440 _IF_DEQUEUE(ifq, m); \ 441 } while (0) 442 443 #define IFQ_DEQUEUE(ifq, m) \ 444 do { \ 445 IF_LOCK(ifq); \ 446 IFQ_DEQUEUE_NOLOCK(ifq, m); \ 447 IF_UNLOCK(ifq); \ 448 } while (0) 449 450 #define IFQ_POLL_NOLOCK(ifq, m) \ 451 do { \ 452 if (TBR_IS_ENABLED(ifq)) \ 453 (m) = tbr_dequeue_ptr(ifq, ALTDQ_POLL); \ 454 else if (ALTQ_IS_ENABLED(ifq)) \ 455 ALTQ_POLL(ifq, m); \ 456 else \ 457 _IF_POLL(ifq, m); \ 458 } while (0) 459 460 #define IFQ_POLL(ifq, m) \ 461 do { \ 462 IF_LOCK(ifq); \ 463 IFQ_POLL_NOLOCK(ifq, m); \ 464 IF_UNLOCK(ifq); \ 465 } while (0) 466 467 #define IFQ_PURGE_NOLOCK(ifq) \ 468 do { \ 469 if (ALTQ_IS_ENABLED(ifq)) { \ 470 ALTQ_PURGE(ifq); \ 471 } else \ 472 _IF_DRAIN(ifq); \ 473 } while (0) 474 475 #define IFQ_PURGE(ifq) \ 476 do { \ 477 IF_LOCK(ifq); \ 478 IFQ_PURGE_NOLOCK(ifq); \ 479 IF_UNLOCK(ifq); \ 480 } while (0) 481 482 #define IFQ_SET_READY(ifq) \ 483 do { ((ifq)->altq_flags |= ALTQF_READY); } while (0) 484 485 #define IFQ_LOCK(ifq) IF_LOCK(ifq) 486 #define IFQ_UNLOCK(ifq) IF_UNLOCK(ifq) 487 #define IFQ_LOCK_ASSERT(ifq) IF_LOCK_ASSERT(ifq) 488 #define IFQ_IS_EMPTY(ifq) ((ifq)->ifq_len == 0) 489 #define IFQ_INC_LEN(ifq) ((ifq)->ifq_len++) 490 #define IFQ_DEC_LEN(ifq) (--(ifq)->ifq_len) 491 #define IFQ_INC_DROPS(ifq) ((ifq)->ifq_drops++) 492 #define IFQ_SET_MAXLEN(ifq, len) ((ifq)->ifq_maxlen = (len)) 493 494 /* 495 * The IFF_DRV_OACTIVE test should really occur in the device driver, not in 496 * the handoff logic, as that flag is locked by the device driver. 497 */ 498 #define IFQ_HANDOFF_ADJ(ifp, m, adj, err) \ 499 do { \ 500 int len; \ 501 short mflags; \ 502 \ 503 len = (m)->m_pkthdr.len; \ 504 mflags = (m)->m_flags; \ 505 IFQ_ENQUEUE(&(ifp)->if_snd, m, err); \ 506 if ((err) == 0) { \ 507 (ifp)->if_obytes += len + (adj); \ 508 if (mflags & M_MCAST) \ 509 (ifp)->if_omcasts++; \ 510 if (((ifp)->if_drv_flags & IFF_DRV_OACTIVE) == 0) \ 511 if_start(ifp); \ 512 } \ 513 } while (0) 514 515 #define IFQ_HANDOFF(ifp, m, err) \ 516 IFQ_HANDOFF_ADJ(ifp, m, 0, err) 517 518 #define IFQ_DRV_DEQUEUE(ifq, m) \ 519 do { \ 520 (m) = (ifq)->ifq_drv_head; \ 521 if (m) { \ 522 if (((ifq)->ifq_drv_head = (m)->m_nextpkt) == NULL) \ 523 (ifq)->ifq_drv_tail = NULL; \ 524 (m)->m_nextpkt = NULL; \ 525 (ifq)->ifq_drv_len--; \ 526 } else { \ 527 IFQ_LOCK(ifq); \ 528 IFQ_DEQUEUE_NOLOCK(ifq, m); \ 529 while ((ifq)->ifq_drv_len < (ifq)->ifq_drv_maxlen) { \ 530 struct mbuf *m0; \ 531 IFQ_DEQUEUE_NOLOCK(ifq, m0); \ 532 if (m0 == NULL) \ 533 break; \ 534 m0->m_nextpkt = NULL; \ 535 if ((ifq)->ifq_drv_tail == NULL) \ 536 (ifq)->ifq_drv_head = m0; \ 537 else \ 538 (ifq)->ifq_drv_tail->m_nextpkt = m0; \ 539 (ifq)->ifq_drv_tail = m0; \ 540 (ifq)->ifq_drv_len++; \ 541 } \ 542 IFQ_UNLOCK(ifq); \ 543 } \ 544 } while (0) 545 546 #define IFQ_DRV_PREPEND(ifq, m) \ 547 do { \ 548 (m)->m_nextpkt = (ifq)->ifq_drv_head; \ 549 if ((ifq)->ifq_drv_tail == NULL) \ 550 (ifq)->ifq_drv_tail = (m); \ 551 (ifq)->ifq_drv_head = (m); \ 552 (ifq)->ifq_drv_len++; \ 553 } while (0) 554 555 #define IFQ_DRV_IS_EMPTY(ifq) \ 556 (((ifq)->ifq_drv_len == 0) && ((ifq)->ifq_len == 0)) 557 558 #define IFQ_DRV_PURGE(ifq) \ 559 do { \ 560 struct mbuf *m, *n = (ifq)->ifq_drv_head; \ 561 while((m = n) != NULL) { \ 562 n = m->m_nextpkt; \ 563 m_freem(m); \ 564 } \ 565 (ifq)->ifq_drv_head = (ifq)->ifq_drv_tail = NULL; \ 566 (ifq)->ifq_drv_len = 0; \ 567 IFQ_PURGE(ifq); \ 568 } while (0) 569 570 #ifdef _KERNEL 571 static __inline void 572 drbr_stats_update(struct ifnet *ifp, int len, int mflags) 573 { 574 #ifndef NO_SLOW_STATS 575 ifp->if_obytes += len; 576 if (mflags & M_MCAST) 577 ifp->if_omcasts++; 578 #endif 579 } 580 581 static __inline int 582 drbr_enqueue(struct ifnet *ifp, struct buf_ring *br, struct mbuf *m) 583 { 584 int error = 0; 585 int len = m->m_pkthdr.len; 586 int mflags = m->m_flags; 587 588 #ifdef ALTQ 589 if (ALTQ_IS_ENABLED(&ifp->if_snd)) { 590 IFQ_ENQUEUE(&ifp->if_snd, m, error); 591 return (error); 592 } 593 #endif 594 if ((error = buf_ring_enqueue_bytes(br, m, len)) == ENOBUFS) { 595 br->br_drops++; 596 m_freem(m); 597 } else 598 drbr_stats_update(ifp, len, mflags); 599 600 return (error); 601 } 602 603 static __inline void 604 drbr_flush(struct ifnet *ifp, struct buf_ring *br) 605 { 606 struct mbuf *m; 607 608 #ifdef ALTQ 609 if (ifp != NULL && ALTQ_IS_ENABLED(&ifp->if_snd)) 610 IFQ_PURGE(&ifp->if_snd); 611 #endif 612 while ((m = buf_ring_dequeue_sc(br)) != NULL) 613 m_freem(m); 614 } 615 616 static __inline void 617 drbr_free(struct buf_ring *br, struct malloc_type *type) 618 { 619 620 drbr_flush(NULL, br); 621 buf_ring_free(br, type); 622 } 623 624 static __inline struct mbuf * 625 drbr_dequeue(struct ifnet *ifp, struct buf_ring *br) 626 { 627 #ifdef ALTQ 628 struct mbuf *m; 629 630 if (ALTQ_IS_ENABLED(&ifp->if_snd)) { 631 IFQ_DEQUEUE(&ifp->if_snd, m); 632 return (m); 633 } 634 #endif 635 return (buf_ring_dequeue_sc(br)); 636 } 637 638 static __inline struct mbuf * 639 drbr_dequeue_cond(struct ifnet *ifp, struct buf_ring *br, 640 int (*func) (struct mbuf *, void *), void *arg) 641 { 642 struct mbuf *m; 643 #ifdef ALTQ 644 if (ALTQ_IS_ENABLED(&ifp->if_snd)) { 645 IFQ_LOCK(&ifp->if_snd); 646 IFQ_POLL_NOLOCK(&ifp->if_snd, m); 647 if (m != NULL && func(m, arg) == 0) { 648 IFQ_UNLOCK(&ifp->if_snd); 649 return (NULL); 650 } 651 IFQ_DEQUEUE_NOLOCK(&ifp->if_snd, m); 652 IFQ_UNLOCK(&ifp->if_snd); 653 return (m); 654 } 655 #endif 656 m = buf_ring_peek(br); 657 if (m == NULL || func(m, arg) == 0) 658 return (NULL); 659 660 return (buf_ring_dequeue_sc(br)); 661 } 662 663 static __inline int 664 drbr_empty(struct ifnet *ifp, struct buf_ring *br) 665 { 666 #ifdef ALTQ 667 if (ALTQ_IS_ENABLED(&ifp->if_snd)) 668 return (IFQ_IS_EMPTY(&ifp->if_snd)); 669 #endif 670 return (buf_ring_empty(br)); 671 } 672 673 static __inline int 674 drbr_needs_enqueue(struct ifnet *ifp, struct buf_ring *br) 675 { 676 #ifdef ALTQ 677 if (ALTQ_IS_ENABLED(&ifp->if_snd)) 678 return (1); 679 #endif 680 return (!buf_ring_empty(br)); 681 } 682 683 static __inline int 684 drbr_inuse(struct ifnet *ifp, struct buf_ring *br) 685 { 686 #ifdef ALTQ 687 if (ALTQ_IS_ENABLED(&ifp->if_snd)) 688 return (ifp->if_snd.ifq_len); 689 #endif 690 return (buf_ring_count(br)); 691 } 692 #endif 693 /* 694 * 72 was chosen below because it is the size of a TCP/IP 695 * header (40) + the minimum mss (32). 696 */ 697 #define IF_MINMTU 72 698 #define IF_MAXMTU 65535 699 700 #endif /* _KERNEL */ 701 702 /* 703 * The ifaddr structure contains information about one address 704 * of an interface. They are maintained by the different address families, 705 * are allocated and attached when an address is set, and are linked 706 * together so all addresses for an interface can be located. 707 * 708 * NOTE: a 'struct ifaddr' is always at the beginning of a larger 709 * chunk of malloc'ed memory, where we store the three addresses 710 * (ifa_addr, ifa_dstaddr and ifa_netmask) referenced here. 711 */ 712 struct ifaddr { 713 struct sockaddr *ifa_addr; /* address of interface */ 714 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ 715 #define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ 716 struct sockaddr *ifa_netmask; /* used to determine subnet */ 717 struct if_data if_data; /* not all members are meaningful */ 718 struct ifnet *ifa_ifp; /* back-pointer to interface */ 719 TAILQ_ENTRY(ifaddr) ifa_link; /* queue macro glue */ 720 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */ 721 (int, struct rtentry *, struct rt_addrinfo *); 722 u_short ifa_flags; /* mostly rt_flags for cloning */ 723 u_int ifa_refcnt; /* references to this structure */ 724 int ifa_metric; /* cost of going out this interface */ 725 int (*ifa_claim_addr) /* check if an addr goes to this if */ 726 (struct ifaddr *, struct sockaddr *); 727 struct mtx ifa_mtx; 728 }; 729 #define IFA_ROUTE RTF_UP /* route installed */ 730 #define IFA_RTSELF RTF_HOST /* loopback route to self installed */ 731 732 /* for compatibility with other BSDs */ 733 #define ifa_list ifa_link 734 735 #ifdef _KERNEL 736 #define IFA_LOCK(ifa) mtx_lock(&(ifa)->ifa_mtx) 737 #define IFA_UNLOCK(ifa) mtx_unlock(&(ifa)->ifa_mtx) 738 739 void ifa_free(struct ifaddr *ifa); 740 void ifa_init(struct ifaddr *ifa); 741 void ifa_ref(struct ifaddr *ifa); 742 #endif 743 744 /* 745 * The prefix structure contains information about one prefix 746 * of an interface. They are maintained by the different address families, 747 * are allocated and attached when a prefix or an address is set, 748 * and are linked together so all prefixes for an interface can be located. 749 */ 750 struct ifprefix { 751 struct sockaddr *ifpr_prefix; /* prefix of interface */ 752 struct ifnet *ifpr_ifp; /* back-pointer to interface */ 753 TAILQ_ENTRY(ifprefix) ifpr_list; /* queue macro glue */ 754 u_char ifpr_plen; /* prefix length in bits */ 755 u_char ifpr_type; /* protocol dependent prefix type */ 756 }; 757 758 /* 759 * Multicast address structure. This is analogous to the ifaddr 760 * structure except that it keeps track of multicast addresses. 761 */ 762 struct ifmultiaddr { 763 TAILQ_ENTRY(ifmultiaddr) ifma_link; /* queue macro glue */ 764 struct sockaddr *ifma_addr; /* address this membership is for */ 765 struct sockaddr *ifma_lladdr; /* link-layer translation, if any */ 766 struct ifnet *ifma_ifp; /* back-pointer to interface */ 767 u_int ifma_refcount; /* reference count */ 768 void *ifma_protospec; /* protocol-specific state, if any */ 769 struct ifmultiaddr *ifma_llifma; /* pointer to ifma for ifma_lladdr */ 770 }; 771 772 #ifdef _KERNEL 773 774 extern struct rwlock ifnet_rwlock; 775 extern struct sx ifnet_sxlock; 776 777 #define IFNET_LOCK_INIT() do { \ 778 rw_init_flags(&ifnet_rwlock, "ifnet_rw", RW_RECURSE); \ 779 sx_init_flags(&ifnet_sxlock, "ifnet_sx", SX_RECURSE); \ 780 } while(0) 781 782 #define IFNET_WLOCK() do { \ 783 sx_xlock(&ifnet_sxlock); \ 784 rw_wlock(&ifnet_rwlock); \ 785 } while (0) 786 787 #define IFNET_WUNLOCK() do { \ 788 rw_wunlock(&ifnet_rwlock); \ 789 sx_xunlock(&ifnet_sxlock); \ 790 } while (0) 791 792 /* 793 * To assert the ifnet lock, you must know not only whether it's for read or 794 * write, but also whether it was acquired with sleep support or not. 795 */ 796 #define IFNET_RLOCK_ASSERT() sx_assert(&ifnet_sxlock, SA_SLOCKED) 797 #define IFNET_RLOCK_NOSLEEP_ASSERT() rw_assert(&ifnet_rwlock, RA_RLOCKED) 798 #define IFNET_WLOCK_ASSERT() do { \ 799 sx_assert(&ifnet_sxlock, SA_XLOCKED); \ 800 rw_assert(&ifnet_rwlock, RA_WLOCKED); \ 801 } while (0) 802 803 #define IFNET_RLOCK() sx_slock(&ifnet_sxlock) 804 #define IFNET_RLOCK_NOSLEEP() rw_rlock(&ifnet_rwlock) 805 #define IFNET_RUNLOCK() sx_sunlock(&ifnet_sxlock) 806 #define IFNET_RUNLOCK_NOSLEEP() rw_runlock(&ifnet_rwlock) 807 808 /* 809 * Look up an ifnet given its index; the _ref variant also acquires a 810 * reference that must be freed using if_rele(). It is almost always a bug 811 * to call ifnet_byindex() instead if ifnet_byindex_ref(). 812 */ 813 struct ifnet *ifnet_byindex(u_short idx); 814 struct ifnet *ifnet_byindex_locked(u_short idx); 815 struct ifnet *ifnet_byindex_ref(u_short idx); 816 817 /* 818 * Given the index, ifaddr_byindex() returns the one and only 819 * link-level ifaddr for the interface. You are not supposed to use 820 * it to traverse the list of addresses associated to the interface. 821 */ 822 struct ifaddr *ifaddr_byindex(u_short idx); 823 824 VNET_DECLARE(struct ifnethead, ifnet); 825 VNET_DECLARE(struct ifgrouphead, ifg_head); 826 VNET_DECLARE(int, if_index); 827 VNET_DECLARE(struct ifnet *, loif); /* first loopback interface */ 828 VNET_DECLARE(int, useloopback); 829 830 #define V_ifnet VNET(ifnet) 831 #define V_ifg_head VNET(ifg_head) 832 #define V_if_index VNET(if_index) 833 #define V_loif VNET(loif) 834 #define V_useloopback VNET(useloopback) 835 836 extern int ifqmaxlen; 837 838 int if_addgroup(struct ifnet *, const char *); 839 int if_delgroup(struct ifnet *, const char *); 840 int if_addmulti(struct ifnet *, struct sockaddr *, struct ifmultiaddr **); 841 int if_allmulti(struct ifnet *, int); 842 struct ifnet* if_alloc(u_char); 843 void if_attach(struct ifnet *); 844 void if_dead(struct ifnet *); 845 int if_delmulti(struct ifnet *, struct sockaddr *); 846 void if_delmulti_ifma(struct ifmultiaddr *); 847 void if_detach(struct ifnet *); 848 void if_vmove(struct ifnet *, struct vnet *); 849 void if_purgeaddrs(struct ifnet *); 850 void if_delallmulti(struct ifnet *); 851 void if_down(struct ifnet *); 852 struct ifmultiaddr * 853 if_findmulti(struct ifnet *, struct sockaddr *); 854 void if_free(struct ifnet *); 855 void if_free_type(struct ifnet *, u_char); 856 void if_initname(struct ifnet *, const char *, int); 857 void if_link_state_change(struct ifnet *, int); 858 int if_printf(struct ifnet *, const char *, ...) __printflike(2, 3); 859 void if_qflush(struct ifnet *); 860 void if_ref(struct ifnet *); 861 void if_rele(struct ifnet *); 862 int if_setlladdr(struct ifnet *, const u_char *, int); 863 void if_up(struct ifnet *); 864 int ifioctl(struct socket *, u_long, caddr_t, struct thread *); 865 int ifpromisc(struct ifnet *, int); 866 struct ifnet *ifunit(const char *); 867 struct ifnet *ifunit_ref(const char *); 868 869 void ifq_init(struct ifaltq *, struct ifnet *ifp); 870 void ifq_delete(struct ifaltq *); 871 872 int ifa_add_loopback_route(struct ifaddr *, struct sockaddr *); 873 int ifa_del_loopback_route(struct ifaddr *, struct sockaddr *); 874 875 struct ifaddr *ifa_ifwithaddr(struct sockaddr *); 876 int ifa_ifwithaddr_check(struct sockaddr *); 877 struct ifaddr *ifa_ifwithbroadaddr(struct sockaddr *); 878 struct ifaddr *ifa_ifwithdstaddr(struct sockaddr *); 879 struct ifaddr *ifa_ifwithnet(struct sockaddr *, int); 880 struct ifaddr *ifa_ifwithroute(int, struct sockaddr *, struct sockaddr *); 881 struct ifaddr *ifa_ifwithroute_fib(int, struct sockaddr *, struct sockaddr *, u_int); 882 883 struct ifaddr *ifaof_ifpforaddr(struct sockaddr *, struct ifnet *); 884 885 int if_simloop(struct ifnet *ifp, struct mbuf *m, int af, int hlen); 886 887 typedef void *if_com_alloc_t(u_char type, struct ifnet *ifp); 888 typedef void if_com_free_t(void *com, u_char type); 889 void if_register_com_alloc(u_char type, if_com_alloc_t *a, if_com_free_t *f); 890 void if_deregister_com_alloc(u_char type); 891 892 #define IF_LLADDR(ifp) \ 893 LLADDR((struct sockaddr_dl *)((ifp)->if_addr->ifa_addr)) 894 895 #ifdef DEVICE_POLLING 896 enum poll_cmd { POLL_ONLY, POLL_AND_CHECK_STATUS }; 897 898 typedef int poll_handler_t(struct ifnet *ifp, enum poll_cmd cmd, int count); 899 int ether_poll_register(poll_handler_t *h, struct ifnet *ifp); 900 int ether_poll_deregister(struct ifnet *ifp); 901 #endif /* DEVICE_POLLING */ 902 903 #endif /* _KERNEL */ 904 905 #endif /* !_NET_IF_VAR_H_ */ 906