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