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