1c398230bSWarner Losh /*- 2*51369649SPedro F. Giffuni * SPDX-License-Identifier: BSD-3-Clause 3*51369649SPedro F. Giffuni * 4df8bae1dSRodney W. Grimes * Copyright (c) 1990, 1993 5df8bae1dSRodney W. Grimes * The Regents of the University of California. All rights reserved. 6df8bae1dSRodney W. Grimes * 7df8bae1dSRodney W. Grimes * Redistribution and use in source and binary forms, with or without 8df8bae1dSRodney W. Grimes * modification, are permitted provided that the following conditions 9df8bae1dSRodney W. Grimes * are met: 10df8bae1dSRodney W. Grimes * 1. Redistributions of source code must retain the above copyright 11df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer. 12df8bae1dSRodney W. Grimes * 2. Redistributions in binary form must reproduce the above copyright 13df8bae1dSRodney W. Grimes * notice, this list of conditions and the following disclaimer in the 14df8bae1dSRodney W. Grimes * documentation and/or other materials provided with the distribution. 15fbbd9655SWarner Losh * 3. Neither the name of the University nor the names of its contributors 16df8bae1dSRodney W. Grimes * may be used to endorse or promote products derived from this software 17df8bae1dSRodney W. Grimes * without specific prior written permission. 18df8bae1dSRodney W. Grimes * 19df8bae1dSRodney W. Grimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 20df8bae1dSRodney W. Grimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 21df8bae1dSRodney W. Grimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 22df8bae1dSRodney W. Grimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 23df8bae1dSRodney W. Grimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 24df8bae1dSRodney W. Grimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 25df8bae1dSRodney W. Grimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 26df8bae1dSRodney W. Grimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 27df8bae1dSRodney W. Grimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 28df8bae1dSRodney W. Grimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 29df8bae1dSRodney W. Grimes * SUCH DAMAGE. 30df8bae1dSRodney W. Grimes */ 31df8bae1dSRodney W. Grimes 32cea1da3bSPaul Richards #ifndef _NET_IF_DL_H_ 33cea1da3bSPaul Richards #define _NET_IF_DL_H_ 34cea1da3bSPaul Richards 35df8bae1dSRodney W. Grimes /* 36df8bae1dSRodney W. Grimes * A Link-Level Sockaddr may specify the interface in one of two 37df8bae1dSRodney W. Grimes * ways: either by means of a system-provided index number (computed 38df8bae1dSRodney W. Grimes * anew and possibly differently on every reboot), or by a human-readable 39df8bae1dSRodney W. Grimes * string such as "il0" (for managerial convenience). 40df8bae1dSRodney W. Grimes * 41df8bae1dSRodney W. Grimes * Census taking actions, such as something akin to SIOCGCONF would return 42df8bae1dSRodney W. Grimes * both the index and the human name. 43df8bae1dSRodney W. Grimes * 44df8bae1dSRodney W. Grimes * High volume transactions (such as giving a link-level ``from'' address 45df8bae1dSRodney W. Grimes * in a recvfrom or recvmsg call) may be likely only to provide the indexed 46df8bae1dSRodney W. Grimes * form, (which requires fewer copy operations and less space). 47df8bae1dSRodney W. Grimes * 48df8bae1dSRodney W. Grimes * The form and interpretation of the link-level address is purely a matter 49df8bae1dSRodney W. Grimes * of convention between the device driver and its consumers; however, it is 50df8bae1dSRodney W. Grimes * expected that all drivers for an interface of a given if_type will agree. 51df8bae1dSRodney W. Grimes */ 52df8bae1dSRodney W. Grimes 53df8bae1dSRodney W. Grimes /* 54df8bae1dSRodney W. Grimes * Structure of a Link-Level sockaddr: 55df8bae1dSRodney W. Grimes */ 56df8bae1dSRodney W. Grimes struct sockaddr_dl { 57df8bae1dSRodney W. Grimes u_char sdl_len; /* Total length of sockaddr */ 5833d0e2a7SArchie Cobbs u_char sdl_family; /* AF_LINK */ 59df8bae1dSRodney W. Grimes u_short sdl_index; /* if != 0, system given index for interface */ 60df8bae1dSRodney W. Grimes u_char sdl_type; /* interface type */ 61df8bae1dSRodney W. Grimes u_char sdl_nlen; /* interface name length, no trailing 0 reqd. */ 62df8bae1dSRodney W. Grimes u_char sdl_alen; /* link level address length */ 63df8bae1dSRodney W. Grimes u_char sdl_slen; /* link layer selector length */ 6442fdfc12SKelly Yancey char sdl_data[46]; /* minimum work area, can be larger; 65df8bae1dSRodney W. Grimes contains both if name and ll address */ 66df8bae1dSRodney W. Grimes }; 67df8bae1dSRodney W. Grimes 68df8bae1dSRodney W. Grimes #define LLADDR(s) ((caddr_t)((s)->sdl_data + (s)->sdl_nlen)) 69441f9243SAlexander V. Chernikov #define CLLADDR(s) ((c_caddr_t)((s)->sdl_data + (s)->sdl_nlen)) 70cf0d539fSMarcel Moolenaar #define LLINDEX(s) ((s)->sdl_index) 71df8bae1dSRodney W. Grimes 7295fbe4d0SAlexander V. Chernikov struct ifnet; 7395fbe4d0SAlexander V. Chernikov struct sockaddr_dl *link_alloc_sdl(size_t, int); 7495fbe4d0SAlexander V. Chernikov void link_free_sdl(struct sockaddr *sa); 7595fbe4d0SAlexander V. Chernikov struct sockaddr_dl *link_init_sdl(struct ifnet *, struct sockaddr *, u_char); 7695fbe4d0SAlexander V. Chernikov 77664a31e4SPeter Wemm #ifndef _KERNEL 78df8bae1dSRodney W. Grimes 79df8bae1dSRodney W. Grimes #include <sys/cdefs.h> 80df8bae1dSRodney W. Grimes 81df8bae1dSRodney W. Grimes __BEGIN_DECLS 82929ddbbbSAlfred Perlstein void link_addr(const char *, struct sockaddr_dl *); 83929ddbbbSAlfred Perlstein char *link_ntoa(const struct sockaddr_dl *); 84df8bae1dSRodney W. Grimes __END_DECLS 85df8bae1dSRodney W. Grimes 86664a31e4SPeter Wemm #endif /* !_KERNEL */ 87cea1da3bSPaul Richards 88cea1da3bSPaul Richards #endif 89