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