1 /* $OpenBSD: if_dl.h,v 1.2 1997/02/24 13:33:58 niklas Exp $ */ 2 /* $NetBSD: if_dl.h,v 1.8 1995/03/26 20:30:13 jtc Exp $ */ 3 4 /* 5 * Copyright (c) 1990, 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. All advertising materials mentioning features or use of this software 17 * must display the following acknowledgement: 18 * This product includes software developed by the University of 19 * California, Berkeley and its contributors. 20 * 4. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)if_dl.h 8.1 (Berkeley) 6/10/93 37 */ 38 39 /* 40 * A Link-Level Sockaddr may specify the interface in one of two 41 * ways: either by means of a system-provided index number (computed 42 * anew and possibly differently on every reboot), or by a human-readable 43 * string such as "il0" (for managerial convenience). 44 * 45 * Census taking actions, such as something akin to SIOCGCONF would return 46 * both the index and the human name. 47 * 48 * High volume transactions (such as giving a link-level ``from'' address 49 * in a recvfrom or recvmsg call) may be likely only to provide the indexed 50 * form, (which requires fewer copy operations and less space). 51 * 52 * The form and interpretation of the link-level address is purely a matter 53 * of convention between the device driver and its consumers; however, it is 54 * expected that all drivers for an interface of a given if_type will agree. 55 */ 56 57 /* 58 * Structure of a Link-Level sockaddr: 59 */ 60 struct sockaddr_dl { 61 u_char sdl_len; /* Total length of sockaddr */ 62 u_char sdl_family; /* AF_DLI */ 63 u_int16_t sdl_index; /* if != 0, system given index for interface */ 64 u_char sdl_type; /* interface type */ 65 u_char sdl_nlen; /* interface name length, no trailing 0 reqd. */ 66 u_char sdl_alen; /* link level address length */ 67 u_char sdl_slen; /* link layer selector length */ 68 char sdl_data[12]; /* minimum work area, can be larger; 69 contains both if name and ll address */ 70 }; 71 72 #define LLADDR(s) ((caddr_t)((s)->sdl_data + (s)->sdl_nlen)) 73 74 #ifndef _KERNEL 75 76 #include <sys/cdefs.h> 77 78 __BEGIN_DECLS 79 void link_addr __P((const char *, struct sockaddr_dl *)); 80 char *link_ntoa __P((const struct sockaddr_dl *)); 81 __END_DECLS 82 83 #endif /* !_KERNEL */ 84