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 #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 89 TAILQ_HEAD(ifnethead, ifnet); /* we use TAILQs so that the order of */ 90 TAILQ_HEAD(ifaddrhead, ifaddr); /* instantiation is preserved in the list */ 91 TAILQ_HEAD(ifprefixhead, ifprefix); 92 TAILQ_HEAD(ifmultihead, ifmultiaddr); 93 94 /* 95 * Structure defining a queue for a network interface. 96 */ 97 struct 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 struct ifnet { 113 void *if_softc; /* pointer to driver state */ 114 void *if_l2com; /* pointer to protocol bits */ 115 TAILQ_ENTRY(ifnet) if_link; /* all struct ifnets are chained */ 116 char if_xname[IFNAMSIZ]; /* external name (name + unit) */ 117 const char *if_dname; /* driver name */ 118 int if_dunit; /* unit or IF_DUNIT_NONE */ 119 struct ifaddrhead if_addrhead; /* linked list of addresses per if */ 120 /* 121 * if_addrhead is the list of all addresses associated to 122 * an interface. 123 * Some code in the kernel assumes that first element 124 * of the list has type AF_LINK, and contains sockaddr_dl 125 * addresses which store the link-level address and the name 126 * of the interface. 127 * However, access to the AF_LINK address through this 128 * field is deprecated. Use if_addr or ifaddr_byindex() instead. 129 */ 130 struct knlist if_klist; /* events attached to this if */ 131 int if_pcount; /* number of promiscuous listeners */ 132 struct carp_if *if_carp; /* carp interface structure */ 133 struct bpf_if *if_bpf; /* packet filter structure */ 134 u_short if_index; /* numeric abbreviation for this if */ 135 short if_timer; /* time 'til if_watchdog called */ 136 u_short if_nvlans; /* number of active vlans */ 137 int if_flags; /* up/down, broadcast, etc. */ 138 int if_capabilities; /* interface capabilities */ 139 int if_capenable; /* enabled features */ 140 void *if_linkmib; /* link-type-specific MIB data */ 141 size_t if_linkmiblen; /* length of above data */ 142 struct if_data if_data; 143 struct ifmultihead if_multiaddrs; /* multicast addresses configured */ 144 int if_amcount; /* number of all-multicast requests */ 145 /* procedure handles */ 146 int (*if_output) /* output routine (enqueue) */ 147 (struct ifnet *, struct mbuf *, struct sockaddr *, 148 struct rtentry *); 149 void (*if_input) /* input routine (from h/w driver) */ 150 (struct ifnet *, struct mbuf *); 151 void (*if_start) /* initiate output routine */ 152 (struct ifnet *); 153 int (*if_ioctl) /* ioctl routine */ 154 (struct ifnet *, u_long, caddr_t); 155 void (*if_watchdog) /* timer routine */ 156 (struct ifnet *); 157 void (*if_init) /* Init routine */ 158 (void *); 159 int (*if_resolvemulti) /* validate/resolve multicast */ 160 (struct ifnet *, struct sockaddr **, struct sockaddr *); 161 struct ifaddr *if_addr; /* pointer to link-level address */ 162 void *if_spare2; /* spare pointer 2 */ 163 void *if_spare3; /* spare pointer 3 */ 164 int if_drv_flags; /* driver-managed status flags */ 165 u_int if_spare_flags2; /* spare flags 2 */ 166 struct ifaltq if_snd; /* output queue (includes altq) */ 167 const u_int8_t *if_broadcastaddr; /* linklevel broadcast bytestring */ 168 169 void *if_bridge; /* bridge glue */ 170 171 struct lltable *lltables; /* list of L3-L2 resolution tables */ 172 173 struct label *if_label; /* interface MAC label */ 174 175 /* these are only used by IPv6 */ 176 struct ifprefixhead if_prefixhead; /* list of prefixes per if */ 177 void *if_afdata[AF_MAX]; 178 int if_afdata_initialized; 179 struct mtx if_afdata_mtx; 180 struct task if_starttask; /* task for IFF_NEEDSGIANT */ 181 struct task if_linktask; /* task for link change events */ 182 struct mtx if_addr_mtx; /* mutex to protect address lists */ 183 LIST_ENTRY(ifnet) if_clones; /* interfaces of a cloner */ 184 }; 185 186 typedef void if_init_f_t(void *); 187 188 /* 189 * XXX These aliases are terribly dangerous because they could apply 190 * to anything. 191 */ 192 #define if_mtu if_data.ifi_mtu 193 #define if_type if_data.ifi_type 194 #define if_physical if_data.ifi_physical 195 #define if_addrlen if_data.ifi_addrlen 196 #define if_hdrlen if_data.ifi_hdrlen 197 #define if_metric if_data.ifi_metric 198 #define if_link_state if_data.ifi_link_state 199 #define if_baudrate if_data.ifi_baudrate 200 #define if_hwassist if_data.ifi_hwassist 201 #define if_ipackets if_data.ifi_ipackets 202 #define if_ierrors if_data.ifi_ierrors 203 #define if_opackets if_data.ifi_opackets 204 #define if_oerrors if_data.ifi_oerrors 205 #define if_collisions if_data.ifi_collisions 206 #define if_ibytes if_data.ifi_ibytes 207 #define if_obytes if_data.ifi_obytes 208 #define if_imcasts if_data.ifi_imcasts 209 #define if_omcasts if_data.ifi_omcasts 210 #define if_iqdrops if_data.ifi_iqdrops 211 #define if_noproto if_data.ifi_noproto 212 #define if_lastchange if_data.ifi_lastchange 213 #define if_recvquota if_data.ifi_recvquota 214 #define if_xmitquota if_data.ifi_xmitquota 215 #define if_rawoutput(if, m, sa) if_output(if, m, sa, (struct rtentry *)NULL) 216 217 /* for compatibility with other BSDs */ 218 #define if_addrlist if_addrhead 219 #define if_list if_link 220 221 /* 222 * Locks for address lists on the network interface. 223 */ 224 #define IF_ADDR_LOCK_INIT(if) mtx_init(&(if)->if_addr_mtx, \ 225 "if_addr_mtx", NULL, MTX_DEF) 226 #define IF_ADDR_LOCK_DESTROY(if) mtx_destroy(&(if)->if_addr_mtx) 227 #define IF_ADDR_LOCK(if) mtx_lock(&(if)->if_addr_mtx) 228 #define IF_ADDR_UNLOCK(if) mtx_unlock(&(if)->if_addr_mtx) 229 #define IF_ADDR_LOCK_ASSERT(if) mtx_assert(&(if)->if_addr_mtx, MA_OWNED) 230 231 /* 232 * Output queues (ifp->if_snd) and slow device input queues (*ifp->if_slowq) 233 * are queues of messages stored on ifqueue structures 234 * (defined above). Entries are added to and deleted from these structures 235 * by these macros, which should be called with ipl raised to splimp(). 236 */ 237 #define IF_LOCK(ifq) mtx_lock(&(ifq)->ifq_mtx) 238 #define IF_UNLOCK(ifq) mtx_unlock(&(ifq)->ifq_mtx) 239 #define IF_LOCK_ASSERT(ifq) mtx_assert(&(ifq)->ifq_mtx, MA_OWNED) 240 #define _IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 241 #define _IF_DROP(ifq) ((ifq)->ifq_drops++) 242 #define _IF_QLEN(ifq) ((ifq)->ifq_len) 243 244 #define _IF_ENQUEUE(ifq, m) do { \ 245 (m)->m_nextpkt = NULL; \ 246 if ((ifq)->ifq_tail == NULL) \ 247 (ifq)->ifq_head = m; \ 248 else \ 249 (ifq)->ifq_tail->m_nextpkt = m; \ 250 (ifq)->ifq_tail = m; \ 251 (ifq)->ifq_len++; \ 252 } while (0) 253 254 #define IF_ENQUEUE(ifq, m) do { \ 255 IF_LOCK(ifq); \ 256 _IF_ENQUEUE(ifq, m); \ 257 IF_UNLOCK(ifq); \ 258 } while (0) 259 260 #define _IF_PREPEND(ifq, m) do { \ 261 (m)->m_nextpkt = (ifq)->ifq_head; \ 262 if ((ifq)->ifq_tail == NULL) \ 263 (ifq)->ifq_tail = (m); \ 264 (ifq)->ifq_head = (m); \ 265 (ifq)->ifq_len++; \ 266 } while (0) 267 268 #define IF_PREPEND(ifq, m) do { \ 269 IF_LOCK(ifq); \ 270 _IF_PREPEND(ifq, m); \ 271 IF_UNLOCK(ifq); \ 272 } while (0) 273 274 #define _IF_DEQUEUE(ifq, m) do { \ 275 (m) = (ifq)->ifq_head; \ 276 if (m) { \ 277 if (((ifq)->ifq_head = (m)->m_nextpkt) == NULL) \ 278 (ifq)->ifq_tail = NULL; \ 279 (m)->m_nextpkt = NULL; \ 280 (ifq)->ifq_len--; \ 281 } \ 282 } while (0) 283 284 #define IF_DEQUEUE(ifq, m) do { \ 285 IF_LOCK(ifq); \ 286 _IF_DEQUEUE(ifq, m); \ 287 IF_UNLOCK(ifq); \ 288 } while (0) 289 290 #define _IF_POLL(ifq, m) ((m) = (ifq)->ifq_head) 291 #define IF_POLL(ifq, m) _IF_POLL(ifq, m) 292 293 #define _IF_DRAIN(ifq) do { \ 294 struct mbuf *m; \ 295 for (;;) { \ 296 _IF_DEQUEUE(ifq, m); \ 297 if (m == NULL) \ 298 break; \ 299 m_freem(m); \ 300 } \ 301 } while (0) 302 303 #define IF_DRAIN(ifq) do { \ 304 IF_LOCK(ifq); \ 305 _IF_DRAIN(ifq); \ 306 IF_UNLOCK(ifq); \ 307 } while(0) 308 309 #ifdef _KERNEL 310 /* interface address change event */ 311 typedef void (*ifaddr_event_handler_t)(void *, struct ifnet *); 312 EVENTHANDLER_DECLARE(ifaddr_event, ifaddr_event_handler_t); 313 /* new interface arrival event */ 314 typedef void (*ifnet_arrival_event_handler_t)(void *, struct ifnet *); 315 EVENTHANDLER_DECLARE(ifnet_arrival_event, ifnet_arrival_event_handler_t); 316 /* interface departure event */ 317 typedef void (*ifnet_departure_event_handler_t)(void *, struct ifnet *); 318 EVENTHANDLER_DECLARE(ifnet_departure_event, ifnet_departure_event_handler_t); 319 320 #define IF_AFDATA_LOCK_INIT(ifp) \ 321 mtx_init(&(ifp)->if_afdata_mtx, "if_afdata", NULL, MTX_DEF) 322 #define IF_AFDATA_LOCK(ifp) mtx_lock(&(ifp)->if_afdata_mtx) 323 #define IF_AFDATA_TRYLOCK(ifp) mtx_trylock(&(ifp)->if_afdata_mtx) 324 #define IF_AFDATA_UNLOCK(ifp) mtx_unlock(&(ifp)->if_afdata_mtx) 325 #define IF_AFDATA_DESTROY(ifp) mtx_destroy(&(ifp)->if_afdata_mtx) 326 327 #define IFF_LOCKGIANT(ifp) do { \ 328 if ((ifp)->if_flags & IFF_NEEDSGIANT) \ 329 mtx_lock(&Giant); \ 330 } while (0) 331 332 #define IFF_UNLOCKGIANT(ifp) do { \ 333 if ((ifp)->if_flags & IFF_NEEDSGIANT) \ 334 mtx_unlock(&Giant); \ 335 } while (0) 336 337 int if_handoff(struct ifqueue *ifq, struct mbuf *m, struct ifnet *ifp, 338 int adjust); 339 #define IF_HANDOFF(ifq, m, ifp) \ 340 if_handoff((struct ifqueue *)ifq, m, ifp, 0) 341 #define IF_HANDOFF_ADJ(ifq, m, ifp, adj) \ 342 if_handoff((struct ifqueue *)ifq, m, ifp, adj) 343 344 void if_start(struct ifnet *); 345 346 #define IFQ_ENQUEUE(ifq, m, err) \ 347 do { \ 348 IF_LOCK(ifq); \ 349 if (ALTQ_IS_ENABLED(ifq)) \ 350 ALTQ_ENQUEUE(ifq, m, NULL, err); \ 351 else { \ 352 if (_IF_QFULL(ifq)) { \ 353 m_freem(m); \ 354 (err) = ENOBUFS; \ 355 } else { \ 356 _IF_ENQUEUE(ifq, m); \ 357 (err) = 0; \ 358 } \ 359 } \ 360 if (err) \ 361 (ifq)->ifq_drops++; \ 362 IF_UNLOCK(ifq); \ 363 } while (0) 364 365 #define IFQ_DEQUEUE_NOLOCK(ifq, m) \ 366 do { \ 367 if (TBR_IS_ENABLED(ifq)) \ 368 (m) = tbr_dequeue_ptr(ifq, ALTDQ_REMOVE); \ 369 else if (ALTQ_IS_ENABLED(ifq)) \ 370 ALTQ_DEQUEUE(ifq, m); \ 371 else \ 372 _IF_DEQUEUE(ifq, m); \ 373 } while (0) 374 375 #define IFQ_DEQUEUE(ifq, m) \ 376 do { \ 377 IF_LOCK(ifq); \ 378 IFQ_DEQUEUE_NOLOCK(ifq, m); \ 379 IF_UNLOCK(ifq); \ 380 } while (0) 381 382 #define IFQ_POLL_NOLOCK(ifq, m) \ 383 do { \ 384 if (TBR_IS_ENABLED(ifq)) \ 385 (m) = tbr_dequeue_ptr(ifq, ALTDQ_POLL); \ 386 else if (ALTQ_IS_ENABLED(ifq)) \ 387 ALTQ_POLL(ifq, m); \ 388 else \ 389 _IF_POLL(ifq, m); \ 390 } while (0) 391 392 #define IFQ_POLL(ifq, m) \ 393 do { \ 394 IF_LOCK(ifq); \ 395 IFQ_POLL_NOLOCK(ifq, m); \ 396 IF_UNLOCK(ifq); \ 397 } while (0) 398 399 #define IFQ_PURGE_NOLOCK(ifq) \ 400 do { \ 401 if (ALTQ_IS_ENABLED(ifq)) { \ 402 ALTQ_PURGE(ifq); \ 403 } else \ 404 _IF_DRAIN(ifq); \ 405 } while (0) 406 407 #define IFQ_PURGE(ifq) \ 408 do { \ 409 IF_LOCK(ifq); \ 410 IFQ_PURGE_NOLOCK(ifq); \ 411 IF_UNLOCK(ifq); \ 412 } while (0) 413 414 #define IFQ_SET_READY(ifq) \ 415 do { ((ifq)->altq_flags |= ALTQF_READY); } while (0) 416 417 #define IFQ_LOCK(ifq) IF_LOCK(ifq) 418 #define IFQ_UNLOCK(ifq) IF_UNLOCK(ifq) 419 #define IFQ_LOCK_ASSERT(ifq) IF_LOCK_ASSERT(ifq) 420 #define IFQ_IS_EMPTY(ifq) ((ifq)->ifq_len == 0) 421 #define IFQ_INC_LEN(ifq) ((ifq)->ifq_len++) 422 #define IFQ_DEC_LEN(ifq) (--(ifq)->ifq_len) 423 #define IFQ_INC_DROPS(ifq) ((ifq)->ifq_drops++) 424 #define IFQ_SET_MAXLEN(ifq, len) ((ifq)->ifq_maxlen = (len)) 425 426 /* 427 * The IFF_DRV_OACTIVE test should really occur in the device driver, not in 428 * the handoff logic, as that flag is locked by the device driver. 429 */ 430 #define IFQ_HANDOFF_ADJ(ifp, m, adj, err) \ 431 do { \ 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_drv_flags & IFF_DRV_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) \ 451 do { \ 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) \ 479 do { \ 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) \ 491 do { \ 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 */ 521 struct 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 */ 555 struct 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 */ 569 struct 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 598 extern 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 606 struct ifindex_entry { 607 struct ifnet *ife_ifnet; 608 struct cdev *ife_dev; 609 }; 610 611 #define ifnet_byindex(idx) ifindex_table[(idx)].ife_ifnet 612 /* 613 * Given the index, ifaddr_byindex() returns the one and only 614 * link-level ifaddr for the interface. You are not supposed to use 615 * it to traverse the list of addresses associated to the interface. 616 */ 617 #define ifaddr_byindex(idx) ifnet_byindex(idx)->if_addr 618 #define ifdev_byindex(idx) ifindex_table[(idx)].ife_dev 619 620 extern struct ifnethead ifnet; 621 extern struct ifindex_entry *ifindex_table; 622 extern int ifqmaxlen; 623 extern struct ifnet *loif; /* first loopback interface */ 624 extern int if_index; 625 626 int if_addmulti(struct ifnet *, struct sockaddr *, struct ifmultiaddr **); 627 int if_allmulti(struct ifnet *, int); 628 struct ifnet* if_alloc(u_char); 629 void if_attach(struct ifnet *); 630 int if_delmulti(struct ifnet *, struct sockaddr *); 631 void if_detach(struct ifnet *); 632 void if_purgeaddrs(struct ifnet *); 633 void if_down(struct ifnet *); 634 void if_free(struct ifnet *); 635 void if_free_type(struct ifnet *, u_char); 636 void if_initname(struct ifnet *, const char *, int); 637 void if_link_state_change(struct ifnet *, int); 638 int if_printf(struct ifnet *, const char *, ...) __printflike(2, 3); 639 int if_setlladdr(struct ifnet *, const u_char *, int); 640 void if_up(struct ifnet *); 641 /*void ifinit(void);*/ /* declared in systm.h for main() */ 642 int ifioctl(struct socket *, u_long, caddr_t, struct thread *); 643 int ifpromisc(struct ifnet *, int); 644 struct ifnet *ifunit(const char *); 645 646 struct ifaddr *ifa_ifwithaddr(struct sockaddr *); 647 struct ifaddr *ifa_ifwithdstaddr(struct sockaddr *); 648 struct ifaddr *ifa_ifwithnet(struct sockaddr *); 649 struct ifaddr *ifa_ifwithroute(int, struct sockaddr *, struct sockaddr *); 650 struct ifaddr *ifaof_ifpforaddr(struct sockaddr *, struct ifnet *); 651 652 int if_simloop(struct ifnet *ifp, struct mbuf *m, int af, int hlen); 653 654 typedef void *if_com_alloc_t(u_char type, struct ifnet *ifp); 655 typedef void if_com_free_t(void *com, u_char type); 656 void if_register_com_alloc(u_char type, if_com_alloc_t *a, if_com_free_t *f); 657 void if_deregister_com_alloc(u_char type); 658 659 #define IF_LLADDR(ifp) \ 660 LLADDR((struct sockaddr_dl *)((ifp)->if_addr->ifa_addr)) 661 662 #ifdef DEVICE_POLLING 663 enum poll_cmd { POLL_ONLY, POLL_AND_CHECK_STATUS }; 664 665 typedef void poll_handler_t(struct ifnet *ifp, enum poll_cmd cmd, int count); 666 int ether_poll_register(poll_handler_t *h, struct ifnet *ifp); 667 int ether_poll_deregister(struct ifnet *ifp); 668 #endif /* DEVICE_POLLING */ 669 670 #endif /* _KERNEL */ 671 672 #endif /* !_NET_IF_VAR_H_ */ 673