if.h revision 1.60
1 /* $NetBSD: if.h,v 1.60 2000/12/18 20:58:41 thorpej Exp $ */ 2 3 /*- 4 * Copyright (c) 1999, 2000 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by William Studnemund and Jason R. Thorpe. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 /* 40 * Copyright (c) 1982, 1986, 1989, 1993 41 * The Regents of the University of California. All rights reserved. 42 * 43 * Redistribution and use in source and binary forms, with or without 44 * modification, are permitted provided that the following conditions 45 * are met: 46 * 1. Redistributions of source code must retain the above copyright 47 * notice, this list of conditions and the following disclaimer. 48 * 2. Redistributions in binary form must reproduce the above copyright 49 * notice, this list of conditions and the following disclaimer in the 50 * documentation and/or other materials provided with the distribution. 51 * 3. All advertising materials mentioning features or use of this software 52 * must display the following acknowledgement: 53 * This product includes software developed by the University of 54 * California, Berkeley and its contributors. 55 * 4. Neither the name of the University nor the names of its contributors 56 * may be used to endorse or promote products derived from this software 57 * without specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 * SUCH DAMAGE. 70 * 71 * @(#)if.h 8.3 (Berkeley) 2/9/95 72 */ 73 74 #ifndef _NET_IF_H_ 75 #define _NET_IF_H_ 76 77 #if !defined(_XOPEN_SOURCE) 78 79 #include <sys/queue.h> 80 #include <net/dlt.h> 81 82 /* 83 * Always include ALTQ glue here -- we use the ALTQ interface queue 84 * structure even when ALTQ is not configured into the kernel so that 85 * the size of struct ifnet does not changed based on the option. The 86 * ALTQ queue structure is API-compatible with the legacy ifqueue. 87 */ 88 #include <altq/if_altq.h> 89 90 /* 91 * Structures defining a network interface, providing a packet 92 * transport mechanism (ala level 0 of the PUP protocols). 93 * 94 * Each interface accepts output datagrams of a specified maximum 95 * length, and provides higher level routines with input datagrams 96 * received from its medium. 97 * 98 * Output occurs when the routine if_output is called, with four parameters: 99 * (*ifp->if_output)(ifp, m, dst, rt) 100 * Here m is the mbuf chain to be sent and dst is the destination address. 101 * The output routine encapsulates the supplied datagram if necessary, 102 * and then transmits it on its medium. 103 * 104 * On input, each interface unwraps the data received by it, and either 105 * places it on the input queue of a internetwork datagram routine 106 * and posts the associated software interrupt, or passes the datagram to a raw 107 * packet input routine. 108 * 109 * Routines exist for locating interfaces by their addresses 110 * or for locating a interface on a certain network, as well as more general 111 * routing and gateway routines maintaining information used to locate 112 * interfaces. These routines live in the files if.c and route.c 113 */ 114 /* XXX fast fix for SNMP, going away soon */ 115 #include <sys/time.h> 116 117 #if defined(_KERNEL) && !defined(_LKM) 118 #include "opt_compat_netbsd.h" 119 #endif 120 121 struct mbuf; 122 struct proc; 123 struct rtentry; 124 struct socket; 125 struct ether_header; 126 struct ifnet; 127 128 /* 129 * Length of interface external name, including terminating '\0'. 130 * Note: this is the same size as a generic device's external name. 131 */ 132 #define IFNAMSIZ 16 133 #define IF_NAMESIZE IFNAMSIZ 134 135 /* 136 * Structure describing a `cloning' interface. 137 */ 138 struct if_clone { 139 LIST_ENTRY(if_clone) ifc_list; /* on list of cloners */ 140 const char *ifc_name; /* name of device, e.g. `gif' */ 141 size_t ifc_namelen; /* length of name */ 142 143 int (*ifc_create)(struct if_clone *, int); 144 void (*ifc_destroy)(struct ifnet *); 145 }; 146 147 #define IF_CLONE_INITIALIZER(name, create, destroy) \ 148 { { 0 }, name, sizeof(name) - 1, create, destroy } 149 150 /* 151 * Structure used to query names of interface cloners. 152 */ 153 struct if_clonereq { 154 int ifcr_total; /* total cloners (out) */ 155 int ifcr_count; /* room for this many in user buffer */ 156 char *ifcr_buffer; /* buffer for cloner names */ 157 }; 158 159 /* 160 * Structure defining statistics and other data kept regarding a network 161 * interface. 162 */ 163 struct if_data { 164 /* generic interface information */ 165 u_char ifi_type; /* ethernet, tokenring, etc. */ 166 u_char ifi_addrlen; /* media address length */ 167 u_char ifi_hdrlen; /* media header length */ 168 int ifi_link_state; /* current link state */ 169 u_quad_t ifi_mtu; /* maximum transmission unit */ 170 u_quad_t ifi_metric; /* routing metric (external only) */ 171 u_quad_t ifi_baudrate; /* linespeed */ 172 /* volatile statistics */ 173 u_quad_t ifi_ipackets; /* packets received on interface */ 174 u_quad_t ifi_ierrors; /* input errors on interface */ 175 u_quad_t ifi_opackets; /* packets sent on interface */ 176 u_quad_t ifi_oerrors; /* output errors on interface */ 177 u_quad_t ifi_collisions; /* collisions on csma interfaces */ 178 u_quad_t ifi_ibytes; /* total number of octets received */ 179 u_quad_t ifi_obytes; /* total number of octets sent */ 180 u_quad_t ifi_imcasts; /* packets received via multicast */ 181 u_quad_t ifi_omcasts; /* packets sent via multicast */ 182 u_quad_t ifi_iqdrops; /* dropped on input, this interface */ 183 u_quad_t ifi_noproto; /* destined for unsupported protocol */ 184 struct timeval ifi_lastchange; /* last updated */ 185 }; 186 187 /* 188 * Values for if_link_state. 189 */ 190 #define LINK_STATE_UNKNOWN 0 /* link invalid/unknown */ 191 #define LINK_STATE_DOWN 1 /* link is down */ 192 #define LINK_STATE_UP 2 /* link is up */ 193 194 #if defined(_KERNEL) && defined(COMPAT_14) 195 /* Pre-1.5 if_data struct */ 196 struct if_data14 { 197 /* generic interface information */ 198 u_char ifi_type; /* ethernet, tokenring, etc. */ 199 u_char ifi_addrlen; /* media address length */ 200 u_char ifi_hdrlen; /* media header length */ 201 u_long ifi_mtu; /* maximum transmission unit */ 202 u_long ifi_metric; /* routing metric (external only) */ 203 u_long ifi_baudrate; /* linespeed */ 204 /* volatile statistics */ 205 u_long ifi_ipackets; /* packets received on interface */ 206 u_long ifi_ierrors; /* input errors on interface */ 207 u_long ifi_opackets; /* packets sent on interface */ 208 u_long ifi_oerrors; /* output errors on interface */ 209 u_long ifi_collisions; /* collisions on csma interfaces */ 210 u_long ifi_ibytes; /* total number of octets received */ 211 u_long ifi_obytes; /* total number of octets sent */ 212 u_long ifi_imcasts; /* packets received via multicast */ 213 u_long ifi_omcasts; /* packets sent via multicast */ 214 u_long ifi_iqdrops; /* dropped on input, this interface */ 215 u_long ifi_noproto; /* destined for unsupported protocol */ 216 struct timeval ifi_lastchange; /* last updated */ 217 }; 218 #endif /* _KERNEL && COMPAT_14 */ 219 220 /* 221 * Structure defining a queue for a network interface. 222 */ 223 struct ifqueue { 224 struct mbuf *ifq_head; 225 struct mbuf *ifq_tail; 226 int ifq_len; 227 int ifq_maxlen; 228 int ifq_drops; 229 }; 230 231 /* 232 * Structure defining a queue for a network interface. 233 * 234 * (Would like to call this struct ``if'', but C isn't PL/1.) 235 */ 236 TAILQ_HEAD(ifnet_head, ifnet); /* the actual queue head */ 237 238 struct ifnet { /* and the entries */ 239 void *if_softc; /* lower-level data for this if */ 240 TAILQ_ENTRY(ifnet) if_list; /* all struct ifnets are chained */ 241 TAILQ_HEAD(, ifaddr) if_addrlist; /* linked list of addresses per if */ 242 char if_xname[IFNAMSIZ]; /* external name (name + unit) */ 243 int if_pcount; /* number of promiscuous listeners */ 244 caddr_t if_bpf; /* packet filter structure */ 245 u_short if_index; /* numeric abbreviation for this if */ 246 short if_timer; /* time 'til if_watchdog called */ 247 short if_flags; /* up/down, broadcast, etc. */ 248 short if__pad1; /* be nice to m68k ports */ 249 struct if_data if_data; /* statistics and other data about if */ 250 /* 251 * Procedure handles. If you add more of these, don't forget the 252 * corresponding NULL stub in if.c. 253 */ 254 int (*if_output) /* output routine (enqueue) */ 255 __P((struct ifnet *, struct mbuf *, struct sockaddr *, 256 struct rtentry *)); 257 void (*if_input) /* input routine (from h/w driver) */ 258 __P((struct ifnet *, struct mbuf *)); 259 void (*if_start) /* initiate output routine */ 260 __P((struct ifnet *)); 261 int (*if_ioctl) /* ioctl routine */ 262 __P((struct ifnet *, u_long, caddr_t)); 263 int (*if_init) /* init routine */ 264 __P((struct ifnet *)); 265 void (*if_stop) /* stop routine */ 266 __P((struct ifnet *, int)); 267 void (*if_watchdog) /* timer routine */ 268 __P((struct ifnet *)); 269 void (*if_drain) /* routine to release resources */ 270 __P((struct ifnet *)); 271 struct ifaltq if_snd; /* output queue (includes altq) */ 272 struct sockaddr_dl *if_sadl; /* pointer to our sockaddr_dl */ 273 u_int8_t *if_broadcastaddr; /* linklevel broadcast bytestring */ 274 struct ifprefix *if_prefixlist; /* linked list of prefixes per if */ 275 void *if_bridge; /* bridge glue */ 276 int if_dlt; /* data link type (<net/dlt.h>) */ 277 }; 278 #define if_mtu if_data.ifi_mtu 279 #define if_type if_data.ifi_type 280 #define if_addrlen if_data.ifi_addrlen 281 #define if_hdrlen if_data.ifi_hdrlen 282 #define if_metric if_data.ifi_metric 283 #define if_link_state if_data.ifi_link_state 284 #define if_baudrate if_data.ifi_baudrate 285 #define if_ipackets if_data.ifi_ipackets 286 #define if_ierrors if_data.ifi_ierrors 287 #define if_opackets if_data.ifi_opackets 288 #define if_oerrors if_data.ifi_oerrors 289 #define if_collisions if_data.ifi_collisions 290 #define if_ibytes if_data.ifi_ibytes 291 #define if_obytes if_data.ifi_obytes 292 #define if_imcasts if_data.ifi_imcasts 293 #define if_omcasts if_data.ifi_omcasts 294 #define if_iqdrops if_data.ifi_iqdrops 295 #define if_noproto if_data.ifi_noproto 296 #define if_lastchange if_data.ifi_lastchange 297 298 #define IFF_UP 0x1 /* interface is up */ 299 #define IFF_BROADCAST 0x2 /* broadcast address valid */ 300 #define IFF_DEBUG 0x4 /* turn on debugging */ 301 #define IFF_LOOPBACK 0x8 /* is a loopback net */ 302 #define IFF_POINTOPOINT 0x10 /* interface is point-to-point link */ 303 #define IFF_NOTRAILERS 0x20 /* avoid use of trailers */ 304 #define IFF_RUNNING 0x40 /* resources allocated */ 305 #define IFF_NOARP 0x80 /* no address resolution protocol */ 306 #define IFF_PROMISC 0x100 /* receive all packets */ 307 #define IFF_ALLMULTI 0x200 /* receive all multicast packets */ 308 #define IFF_OACTIVE 0x400 /* transmission in progress */ 309 #define IFF_SIMPLEX 0x800 /* can't hear own transmissions */ 310 #define IFF_LINK0 0x1000 /* per link layer defined bit */ 311 #define IFF_LINK1 0x2000 /* per link layer defined bit */ 312 #define IFF_LINK2 0x4000 /* per link layer defined bit */ 313 #define IFF_MULTICAST 0x8000 /* supports multicast */ 314 315 /* flags set internally only: */ 316 #define IFF_CANTCHANGE \ 317 (IFF_BROADCAST|IFF_POINTOPOINT|IFF_RUNNING|IFF_OACTIVE|\ 318 IFF_SIMPLEX|IFF_MULTICAST|IFF_ALLMULTI|IFF_PROMISC) 319 320 /* 321 * Some convenience macros used for setting ifi_baudrate. 322 * XXX 1000 vs. 1024? --thorpej (at) netbsd.org 323 */ 324 #define IF_Kbps(x) ((x) * 1000) /* kilobits/sec. */ 325 #define IF_Mbps(x) (IF_Kbps((x) * 1000)) /* megabits/sec. */ 326 #define IF_Gbps(x) (IF_Mbps((x) * 1000)) /* gigabits/sec. */ 327 328 /* 329 * Output queues (ifp->if_snd) and internetwork datagram level (pup level 1) 330 * input routines have queues of messages stored on ifqueue structures 331 * (defined above). Entries are added to and deleted from these structures 332 * by these macros, which should be called with ipl raised to splimp(). 333 */ 334 #define IF_QFULL(ifq) ((ifq)->ifq_len >= (ifq)->ifq_maxlen) 335 #define IF_DROP(ifq) ((ifq)->ifq_drops++) 336 #define IF_ENQUEUE(ifq, m) { \ 337 (m)->m_nextpkt = 0; \ 338 if ((ifq)->ifq_tail == 0) \ 339 (ifq)->ifq_head = m; \ 340 else \ 341 (ifq)->ifq_tail->m_nextpkt = m; \ 342 (ifq)->ifq_tail = m; \ 343 (ifq)->ifq_len++; \ 344 } 345 #define IF_PREPEND(ifq, m) { \ 346 (m)->m_nextpkt = (ifq)->ifq_head; \ 347 if ((ifq)->ifq_tail == 0) \ 348 (ifq)->ifq_tail = (m); \ 349 (ifq)->ifq_head = (m); \ 350 (ifq)->ifq_len++; \ 351 } 352 #define IF_DEQUEUE(ifq, m) { \ 353 (m) = (ifq)->ifq_head; \ 354 if (m) { \ 355 if (((ifq)->ifq_head = (m)->m_nextpkt) == 0) \ 356 (ifq)->ifq_tail = 0; \ 357 (m)->m_nextpkt = 0; \ 358 (ifq)->ifq_len--; \ 359 } \ 360 } 361 #define IF_POLL(ifq, m) ((m) = (ifq)->ifq_head) 362 #define IF_PURGE(ifq) \ 363 do { \ 364 struct mbuf *__m0; \ 365 \ 366 for (;;) { \ 367 IF_DEQUEUE((ifq), __m0); \ 368 if (__m0 == NULL) \ 369 break; \ 370 else \ 371 m_freem(__m0); \ 372 } \ 373 } while (0) 374 #define IF_IS_EMPTY(ifq) ((ifq)->ifq_len == 0) 375 376 #define IFQ_MAXLEN 50 377 #define IFNET_SLOWHZ 1 /* granularity is 1 second */ 378 379 /* 380 * Structure defining statistics and other data kept regarding an address 381 * on a network interface. 382 */ 383 struct ifaddr_data { 384 int64_t ifad_inbytes; 385 int64_t ifad_outbytes; 386 }; 387 388 /* 389 * The ifaddr structure contains information about one address 390 * of an interface. They are maintained by the different address families, 391 * are allocated and attached when an address is set, and are linked 392 * together so all addresses for an interface can be located. 393 */ 394 struct ifaddr { 395 struct sockaddr *ifa_addr; /* address of interface */ 396 struct sockaddr *ifa_dstaddr; /* other end of p-to-p link */ 397 #define ifa_broadaddr ifa_dstaddr /* broadcast address interface */ 398 struct sockaddr *ifa_netmask; /* used to determine subnet */ 399 struct ifnet *ifa_ifp; /* back-pointer to interface */ 400 TAILQ_ENTRY(ifaddr) ifa_list; /* list of addresses for interface */ 401 struct ifaddr_data ifa_data; /* statistics on the address */ 402 void (*ifa_rtrequest) /* check or clean routes (+ or -)'d */ 403 __P((int, struct rtentry *, struct sockaddr *)); 404 u_int ifa_flags; /* mostly rt_flags for cloning */ 405 int ifa_refcnt; /* count of references */ 406 int ifa_metric; /* cost of going out this interface */ 407 }; 408 #define IFA_ROUTE RTF_UP /* route installed */ 409 410 /* 411 * The prefix structure contains information about one prefix 412 * of an interface. They are maintained by the different address families, 413 * are allocated and attached when an prefix or an address is set, 414 * and are linked together so all prfefixes for an interface can be located. 415 */ 416 struct ifprefix { 417 struct sockaddr *ifpr_prefix; /* prefix of interface */ 418 struct ifnet *ifpr_ifp; /* back-pointer to interface */ 419 struct ifprefix *ifpr_next; 420 u_char ifpr_plen; /* prefix length in bits */ 421 u_char ifpr_type; /* protocol dependent prefix type */ 422 }; 423 424 /* 425 * Message format for use in obtaining information about interfaces 426 * from sysctl and the routing socket. 427 */ 428 struct if_msghdr { 429 u_short ifm_msglen; /* to skip over non-understood messages */ 430 u_char ifm_version; /* future binary compatability */ 431 u_char ifm_type; /* message type */ 432 int ifm_addrs; /* like rtm_addrs */ 433 int ifm_flags; /* value of if_flags */ 434 u_short ifm_index; /* index for associated ifp */ 435 struct if_data ifm_data;/* statistics and other data about if */ 436 }; 437 438 #if defined(_KERNEL) && defined(COMPAT_14) 439 /* pre-1.5 if_msghdr (ifm_data changed) */ 440 struct if_msghdr14 { 441 u_short ifm_msglen; /* to skip over non-understood messages */ 442 u_char ifm_version; /* future binary compatability */ 443 u_char ifm_type; /* message type */ 444 int ifm_addrs; /* like rtm_addrs */ 445 int ifm_flags; /* value of if_flags */ 446 u_short ifm_index; /* index for associated ifp */ 447 struct if_data14 ifm_data; /* statistics and other data about if */ 448 }; 449 #endif /* _KERNEL && COMPAT_14 */ 450 451 /* 452 * Message format for use in obtaining information about interface addresses 453 * from sysctl and the routing socket. 454 */ 455 struct ifa_msghdr { 456 u_short ifam_msglen; /* to skip over non-understood messages */ 457 u_char ifam_version; /* future binary compatability */ 458 u_char ifam_type; /* message type */ 459 int ifam_addrs; /* like rtm_addrs */ 460 int ifam_flags; /* value of ifa_flags */ 461 u_short ifam_index; /* index for associated ifp */ 462 int ifam_metric; /* value of ifa_metric */ 463 }; 464 465 /* 466 * Message format announcing the arrival or departure of a network interface. 467 */ 468 struct if_announcemsghdr { 469 u_short ifan_msglen; /* to skip over non-understood messages */ 470 u_char ifan_version; /* future binary compatibility */ 471 u_char ifan_type; /* message type */ 472 u_short ifan_index; /* index for associated ifp */ 473 char ifan_name[IFNAMSIZ]; /* if name, e.g. "en0" */ 474 u_short ifan_what; /* what type of announcement */ 475 }; 476 477 #define IFAN_ARRIVAL 0 /* interface arrival */ 478 #define IFAN_DEPARTURE 1 /* interface departure */ 479 480 /* 481 * Interface request structure used for socket 482 * ioctl's. All interface ioctl's must have parameter 483 * definitions which begin with ifr_name. The 484 * remainder may be interface specific. 485 */ 486 struct ifreq { 487 char ifr_name[IFNAMSIZ]; /* if name, e.g. "en0" */ 488 union { 489 struct sockaddr ifru_addr; 490 struct sockaddr ifru_dstaddr; 491 struct sockaddr ifru_broadaddr; 492 short ifru_flags; 493 int ifru_metric; 494 int ifru_mtu; 495 u_int ifru_value; 496 caddr_t ifru_data; 497 } ifr_ifru; 498 #define ifr_addr ifr_ifru.ifru_addr /* address */ 499 #define ifr_dstaddr ifr_ifru.ifru_dstaddr /* other end of p-to-p link */ 500 #define ifr_broadaddr ifr_ifru.ifru_broadaddr /* broadcast address */ 501 #define ifr_flags ifr_ifru.ifru_flags /* flags */ 502 #define ifr_metric ifr_ifru.ifru_metric /* metric */ 503 #define ifr_mtu ifr_ifru.ifru_mtu /* mtu */ 504 #define ifr_value ifr_ifru.ifru_value /* generic value */ 505 #define ifr_media ifr_ifru.ifru_metric /* media options (overload) */ 506 #define ifr_data ifr_ifru.ifru_data /* for use by interface */ 507 }; 508 509 struct ifaliasreq { 510 char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */ 511 struct sockaddr ifra_addr; 512 struct sockaddr ifra_dstaddr; 513 #define ifra_broadaddr ifra_dstaddr 514 struct sockaddr ifra_mask; 515 }; 516 517 struct ifmediareq { 518 char ifm_name[IFNAMSIZ]; /* if name, e.g. "en0" */ 519 int ifm_current; /* current media options */ 520 int ifm_mask; /* don't care mask */ 521 int ifm_status; /* media status */ 522 int ifm_active; /* active options */ 523 int ifm_count; /* # entries in ifm_ulist 524 array */ 525 int *ifm_ulist; /* media words */ 526 }; 527 528 529 struct ifdrv { 530 char ifd_name[IFNAMSIZ]; /* if name, e.g. "en0" */ 531 unsigned long ifd_cmd; 532 size_t ifd_len; 533 void *ifd_data; 534 }; 535 536 /* 537 * Structure used in SIOCGIFCONF request. 538 * Used to retrieve interface configuration 539 * for machine (useful for programs which 540 * must know all networks accessible). 541 */ 542 struct ifconf { 543 int ifc_len; /* size of associated buffer */ 544 union { 545 caddr_t ifcu_buf; 546 struct ifreq *ifcu_req; 547 } ifc_ifcu; 548 #define ifc_buf ifc_ifcu.ifcu_buf /* buffer address */ 549 #define ifc_req ifc_ifcu.ifcu_req /* array of structures returned */ 550 }; 551 552 /* 553 * Structure for SIOC[AGD]LIFADDR 554 */ 555 struct if_laddrreq { 556 char iflr_name[IFNAMSIZ]; 557 unsigned int flags; 558 #define IFLR_PREFIX 0x8000 /* in: prefix given out: kernel fills id */ 559 unsigned int prefixlen; /* in/out */ 560 struct sockaddr_storage addr; /* in/out */ 561 struct sockaddr_storage dstaddr; /* out */ 562 }; 563 564 #include <net/if_arp.h> 565 566 #endif /* !_XOPEN_SOURCE */ 567 568 #ifdef _KERNEL 569 #ifdef IFAREF_DEBUG 570 #define IFAREF(ifa) \ 571 do { \ 572 printf("IFAREF: %s:%d %p -> %d\n", __FILE__, __LINE__, \ 573 (ifa), ++(ifa)->ifa_refcnt); \ 574 } while (0) 575 576 #define IFAFREE(ifa) \ 577 do { \ 578 if ((ifa)->ifa_refcnt <= 0) \ 579 panic("%s:%d: %p ifa_refcnt <= 0", __FILE__, \ 580 __LINE__, (ifa)); \ 581 printf("IFAFREE: %s:%d %p -> %d\n", __FILE__, __LINE__, \ 582 (ifa), --(ifa)->ifa_refcnt); \ 583 if ((ifa)->ifa_refcnt == 0) \ 584 ifafree(ifa); \ 585 } while (0) 586 #else 587 #define IFAREF(ifa) (ifa)->ifa_refcnt++ 588 589 #ifdef DIAGNOSTIC 590 #define IFAFREE(ifa) \ 591 do { \ 592 if ((ifa)->ifa_refcnt <= 0) \ 593 panic("%s:%d: %p ifa_refcnt <= 0", __FILE__, \ 594 __LINE__, (ifa)); \ 595 if (--(ifa)->ifa_refcnt == 0) \ 596 ifafree(ifa); \ 597 } while (0) 598 #else 599 #define IFAFREE(ifa) \ 600 do { \ 601 if (--(ifa)->ifa_refcnt == 0) \ 602 ifafree(ifa); \ 603 } while (0) 604 #endif /* DIAGNOSTIC */ 605 #endif /* IFAREF_DEBUG */ 606 607 #ifdef ALTQ 608 #define ALTQ_DECL(x) x 609 610 #define IFQ_ENQUEUE(ifq, m, pattr, err) \ 611 do { \ 612 if (ALTQ_IS_ENABLED((ifq))) \ 613 ALTQ_ENQUEUE((ifq), (m), (pattr), (err)); \ 614 else { \ 615 if (IF_QFULL((ifq))) { \ 616 m_freem((m)); \ 617 (err) = ENOBUFS; \ 618 } else { \ 619 IF_ENQUEUE((ifq), (m)); \ 620 (err) = 0; \ 621 } \ 622 } \ 623 if ((err)) \ 624 (ifq)->ifq_drops++; \ 625 } while (0) 626 627 #define IFQ_DEQUEUE(ifq, m) \ 628 do { \ 629 if (TBR_IS_ENABLED((ifq))) \ 630 (m) = tbr_dequeue((ifq), ALTDQ_REMOVE); \ 631 else if (ALTQ_IS_ENABLED((ifq))) \ 632 ALTQ_DEQUEUE((ifq), (m)); \ 633 else \ 634 IF_POLL((ifq), (m)); \ 635 } while (0) 636 637 #define IFQ_POLL(ifq, m) \ 638 do { \ 639 if (TBR_IS_ENABLED((ifq))) \ 640 (m) = tbr_dequeue((ifq), ALTDQ_POLL); \ 641 else if (ALTQ_IS_ENABLED((ifq))) \ 642 ALTQ_POLL((ifq), (m)); \ 643 else \ 644 IF_POLL((ifq), (m)); \ 645 } while (0) 646 647 #define IFQ_PURGE(ifq) \ 648 do { \ 649 if (ALTQ_IS_ENABLED((ifq))) \ 650 ALTQ_PURGE((ifq)); \ 651 else \ 652 IF_PURGE((ifq)); \ 653 } while (0) 654 655 #define IFQ_SET_READY(ifq) \ 656 do { \ 657 (ifq)->altq_flags |= ALTQF_READY; \ 658 } while (0) 659 660 #define IFQ_CLASSIFY(ifq, m, af, pa) \ 661 do { \ 662 if (ALTQ_IS_ENABLED((ifq))) { \ 663 if (ALTQ_NEEDS_CLASSIFY((ifq))) \ 664 (pa)->pattr_class = (*(ifq)->altq_classify) \ 665 ((ifq)->altq_clfier, (m), (af)); \ 666 (pa)->pattr_af = (af); \ 667 (pa)->pattr_hdr = mtod((m), caddr_t); \ 668 } \ 669 } while (0) 670 #else /* ! ALTQ */ 671 #define ALTQ_DECL(x) /* nothing */ 672 673 #define IFQ_ENQUEUE(ifq, m, pattr, err) \ 674 do { \ 675 if (IF_QFULL((ifq))) { \ 676 m_freem((m)); \ 677 (err) = ENOBUFS; \ 678 } else { \ 679 IF_ENQUEUE((ifq), (m)); \ 680 (err) = 0; \ 681 } \ 682 if ((err)) \ 683 (ifq)->ifq_drops++; \ 684 } while (0) 685 686 #define IFQ_DEQUEUE(ifq, m) IF_DEQUEUE((ifq), (m)) 687 688 #define IFQ_POLL(ifq, m) IF_POLL((ifq), (m)) 689 690 #define IFQ_PURGE(ifq) IF_PURGE((ifq)) 691 692 #define IFQ_SET_READY(ifq) /* nothing */ 693 694 #define IFQ_CLASSIFY(ifq, m, af, pa) /* nothing */ 695 696 #endif /* ALTQ */ 697 698 #define IFQ_IS_EMPTY(ifq) IF_IS_EMPTY((ifq)) 699 #define IFQ_INC_LEN(ifq) ((ifq)->ifq_len++) 700 #define IFQ_DEC_LEN(ifq) (--(ifq)->ifq_len) 701 #define IFQ_INC_DROPS(ifq) ((ifq)->ifq_drops++) 702 #define IFQ_SET_MAXLEN(ifq, len) ((ifq)->ifq_maxlen = (len)) 703 704 struct ifnet_head ifnet; 705 extern struct ifnet **ifindex2ifnet; 706 #if 0 707 struct ifnet loif[]; 708 #endif 709 extern int if_index; 710 711 void ether_ifattach __P((struct ifnet *, const u_int8_t *)); 712 void ether_ifdetach __P((struct ifnet *)); 713 char *ether_sprintf __P((const u_char *)); 714 715 void if_attach __P((struct ifnet *)); 716 void if_deactivate __P((struct ifnet *)); 717 void if_detach __P((struct ifnet *)); 718 void if_down __P((struct ifnet *)); 719 void if_slowtimo __P((void *)); 720 void if_up __P((struct ifnet *)); 721 int ifconf __P((u_long, caddr_t)); 722 void ifinit __P((void)); 723 int ifioctl __P((struct socket *, u_long, caddr_t, struct proc *)); 724 int ifpromisc __P((struct ifnet *, int)); 725 struct ifnet *ifunit __P((const char *)); 726 727 struct ifaddr *ifa_ifwithaddr __P((struct sockaddr *)); 728 struct ifaddr *ifa_ifwithaf __P((int)); 729 struct ifaddr *ifa_ifwithdstaddr __P((struct sockaddr *)); 730 struct ifaddr *ifa_ifwithnet __P((struct sockaddr *)); 731 struct ifaddr *ifa_ifwithladdr __P((struct sockaddr *)); 732 struct ifaddr *ifa_ifwithroute __P((int, struct sockaddr *, 733 struct sockaddr *)); 734 struct ifaddr *ifaof_ifpforaddr __P((struct sockaddr *, struct ifnet *)); 735 void ifafree __P((struct ifaddr *)); 736 void link_rtrequest __P((int, struct rtentry *, struct sockaddr *)); 737 738 void if_clone_attach __P((struct if_clone *)); 739 void if_clone_detach __P((struct if_clone *)); 740 741 int if_clone_create __P((const char *)); 742 int if_clone_destroy __P((const char *)); 743 744 int loioctl __P((struct ifnet *, u_long, caddr_t)); 745 void loopattach __P((int)); 746 int looutput __P((struct ifnet *, 747 struct mbuf *, struct sockaddr *, struct rtentry *)); 748 void lortrequest __P((int, struct rtentry *, struct sockaddr *)); 749 750 /* 751 * These are exported because they're an easy way to tell if 752 * an interface is going away without having to burn a flag. 753 */ 754 int if_nulloutput __P((struct ifnet *, struct mbuf *, 755 struct sockaddr *, struct rtentry *)); 756 void if_nullinput __P((struct ifnet *, struct mbuf *)); 757 void if_nullstart __P((struct ifnet *)); 758 int if_nullioctl __P((struct ifnet *, u_long, caddr_t)); 759 int if_nullinit __P((struct ifnet *)); 760 void if_nullstop __P((struct ifnet *, int)); 761 void if_nullwatchdog __P((struct ifnet *)); 762 void if_nulldrain __P((struct ifnet *)); 763 #else 764 struct if_nameindex { 765 unsigned int if_index; /* 1, 2, ... */ 766 char *if_name; /* null terminated name: "le0", ... */ 767 }; 768 769 #include <sys/cdefs.h> 770 __BEGIN_DECLS 771 unsigned int if_nametoindex __P((const char *)); 772 char * if_indextoname __P((unsigned int, char *)); 773 struct if_nameindex * if_nameindex __P((void)); 774 void if_freenameindex __P((struct if_nameindex *)); 775 __END_DECLS 776 #endif /* _KERNEL */ 777 #endif /* !_NET_IF_H_ */ 778
Indexes created Mon Sep 22 05:09:51 GMT 2025