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