if_ether.h revision 1.5 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1982, 1986 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd *
33 1.3 cgd * from: @(#)if_ether.h 7.5 (Berkeley) 6/28/90
34 1.5 hpeyerl * $Id: if_ether.h,v 1.5 1993/12/13 15:10:40 hpeyerl Exp $
35 1.1 cgd */
36 1.1 cgd
37 1.2 mycroft #ifndef _NETINET_IF_ETHER_H_
38 1.2 mycroft #define _NETINET_IF_ETHER_H_
39 1.2 mycroft
40 1.1 cgd /*
41 1.1 cgd * Structure of a 10Mb/s Ethernet header.
42 1.1 cgd */
43 1.1 cgd struct ether_header {
44 1.1 cgd u_char ether_dhost[6];
45 1.1 cgd u_char ether_shost[6];
46 1.1 cgd u_short ether_type;
47 1.1 cgd };
48 1.1 cgd
49 1.4 cassidy #define ETHERTYPE_PUP 0x0200 /* PUP protocol */
50 1.4 cassidy #define ETHERTYPE_IP 0x0800 /* IP protocol */
51 1.4 cassidy #define ETHERTYPE_ARP 0x0806 /* address resolution protocol */
52 1.4 cassidy #define ETHERTYPE_REVARP 0x8035 /* reverse addr resolution protocol */
53 1.1 cgd
54 1.1 cgd /*
55 1.1 cgd * The ETHERTYPE_NTRAILER packet types starting at ETHERTYPE_TRAIL have
56 1.1 cgd * (type-ETHERTYPE_TRAIL)*512 bytes of data followed
57 1.1 cgd * by an ETHER type (as given above) and then the (variable-length) header.
58 1.1 cgd */
59 1.1 cgd #define ETHERTYPE_TRAIL 0x1000 /* Trailer packet */
60 1.1 cgd #define ETHERTYPE_NTRAILER 16
61 1.1 cgd
62 1.1 cgd #define ETHERMTU 1500
63 1.1 cgd #define ETHERMIN (60-14)
64 1.1 cgd
65 1.5 hpeyerl #ifdef KERNEL
66 1.5 hpeyerl /*
67 1.5 hpeyerl * Macro to map an IP multicast address to an Ethernet multicast address.
68 1.5 hpeyerl * The high-order 25 bits of the Ethernet address are statically assigned,
69 1.5 hpeyerl * and the low-order 23 bits are taken from the low end of the IP address.
70 1.5 hpeyerl */
71 1.5 hpeyerl #define ETHER_MAP_IP_MULTICAST(ipaddr, enaddr) \
72 1.5 hpeyerl /* struct in_addr *ipaddr; */ \
73 1.5 hpeyerl /* u_char enaddr[6]; */ \
74 1.5 hpeyerl { \
75 1.5 hpeyerl (enaddr)[0] = 0x01; \
76 1.5 hpeyerl (enaddr)[1] = 0x00; \
77 1.5 hpeyerl (enaddr)[2] = 0x5e; \
78 1.5 hpeyerl (enaddr)[3] = ((u_char *)ipaddr)[1] & 0x7f; \
79 1.5 hpeyerl (enaddr)[4] = ((u_char *)ipaddr)[2]; \
80 1.5 hpeyerl (enaddr)[5] = ((u_char *)ipaddr)[3]; \
81 1.5 hpeyerl }
82 1.5 hpeyerl #endif
83 1.5 hpeyerl
84 1.5 hpeyerl
85 1.1 cgd /*
86 1.1 cgd * Ethernet Address Resolution Protocol.
87 1.1 cgd *
88 1.1 cgd * See RFC 826 for protocol description. Structure below is adapted
89 1.1 cgd * to resolving internet addresses. Field names used correspond to
90 1.1 cgd * RFC 826.
91 1.1 cgd */
92 1.1 cgd struct ether_arp {
93 1.1 cgd struct arphdr ea_hdr; /* fixed-size header */
94 1.1 cgd u_char arp_sha[6]; /* sender hardware address */
95 1.1 cgd u_char arp_spa[4]; /* sender protocol address */
96 1.1 cgd u_char arp_tha[6]; /* target hardware address */
97 1.1 cgd u_char arp_tpa[4]; /* target protocol address */
98 1.1 cgd };
99 1.1 cgd #define arp_hrd ea_hdr.ar_hrd
100 1.1 cgd #define arp_pro ea_hdr.ar_pro
101 1.1 cgd #define arp_hln ea_hdr.ar_hln
102 1.1 cgd #define arp_pln ea_hdr.ar_pln
103 1.1 cgd #define arp_op ea_hdr.ar_op
104 1.1 cgd
105 1.1 cgd
106 1.1 cgd /*
107 1.1 cgd * Structure shared between the ethernet driver modules and
108 1.1 cgd * the address resolution code. For example, each ec_softc or il_softc
109 1.1 cgd * begins with this structure.
110 1.1 cgd */
111 1.1 cgd struct arpcom {
112 1.1 cgd struct ifnet ac_if; /* network-visible interface */
113 1.1 cgd u_char ac_enaddr[6]; /* ethernet hardware address */
114 1.1 cgd struct in_addr ac_ipaddr; /* copy of ip address- XXX */
115 1.5 hpeyerl #ifdef MULTICAST
116 1.5 hpeyerl struct ether_multi *ac_multiaddrs; /* list of ether multicast addrs */
117 1.5 hpeyerl int ac_multicnt; /* length of ac_multiaddrs list */
118 1.5 hpeyerl #endif
119 1.1 cgd };
120 1.1 cgd
121 1.1 cgd /*
122 1.1 cgd * Internet to ethernet address resolution table.
123 1.1 cgd */
124 1.1 cgd struct arptab {
125 1.1 cgd struct in_addr at_iaddr; /* internet address */
126 1.1 cgd u_char at_enaddr[6]; /* ethernet address */
127 1.1 cgd u_char at_timer; /* minutes since last reference */
128 1.1 cgd u_char at_flags; /* flags */
129 1.1 cgd struct mbuf *at_hold; /* last packet until resolved/timeout */
130 1.1 cgd };
131 1.1 cgd
132 1.1 cgd #ifdef KERNEL
133 1.1 cgd u_char etherbroadcastaddr[6];
134 1.5 hpeyerl #if defined(ISO) && !defined(MULTICAST)
135 1.5 hpeyerl #define MULTICAST 1
136 1.5 hpeyerl #endif
137 1.5 hpeyerl #ifdef MULTICAST
138 1.5 hpeyerl u_char ether_ipmulticast_min[6];
139 1.5 hpeyerl u_char ether_ipmulticast_max[6];
140 1.5 hpeyerl #endif
141 1.1 cgd struct arptab *arptnew();
142 1.1 cgd int ether_output(), ether_input();
143 1.1 cgd char *ether_sprintf();
144 1.5 hpeyerl
145 1.5 hpeyerl #ifdef MULTICAST
146 1.5 hpeyerl /*
147 1.5 hpeyerl * Ethernet multicast address structure. There is one of these for each
148 1.5 hpeyerl * multicast address or range of multicast addresses that we are supposed
149 1.5 hpeyerl * to listen to on a particular interface. They are kept in a linked list,
150 1.5 hpeyerl * rooted in the interface's arpcom structure. (This really has nothing to
151 1.5 hpeyerl * do with ARP, or with the Internet address family, but this appears to be
152 1.5 hpeyerl * the minimally-disrupting place to put it.)
153 1.5 hpeyerl */
154 1.5 hpeyerl struct ether_multi {
155 1.5 hpeyerl u_char enm_addrlo[6]; /* low or only address of range */
156 1.5 hpeyerl u_char enm_addrhi[6]; /* high or only address of range */
157 1.5 hpeyerl struct arpcom *enm_ac; /* back pointer to arpcom */
158 1.5 hpeyerl u_int enm_refcount; /* no. claims to this addr/range */
159 1.5 hpeyerl struct ether_multi *enm_next; /* ptr to next ether_multi */
160 1.5 hpeyerl };
161 1.5 hpeyerl
162 1.5 hpeyerl /*
163 1.5 hpeyerl * Structure used by macros below to remember position when stepping through
164 1.5 hpeyerl * all of the ether_multi records.
165 1.5 hpeyerl */
166 1.5 hpeyerl struct ether_multistep {
167 1.5 hpeyerl struct ether_multi *e_enm;
168 1.5 hpeyerl };
169 1.5 hpeyerl
170 1.5 hpeyerl /*
171 1.5 hpeyerl * Macro for looking up the ether_multi record for a given range of Ethernet
172 1.5 hpeyerl * multicast addresses connected to a given arpcom structure. If no matching
173 1.5 hpeyerl * record is found, "enm" returns NULL.
174 1.5 hpeyerl */
175 1.5 hpeyerl #define ETHER_LOOKUP_MULTI(addrlo, addrhi, ac, enm) \
176 1.5 hpeyerl /* u_char addrlo[6]; */ \
177 1.5 hpeyerl /* u_char addrhi[6]; */ \
178 1.5 hpeyerl /* struct arpcom *ac; */ \
179 1.5 hpeyerl /* struct ether_multi *enm; */ \
180 1.5 hpeyerl { \
181 1.5 hpeyerl for ((enm) = (ac)->ac_multiaddrs; \
182 1.5 hpeyerl (enm) != NULL && \
183 1.5 hpeyerl (bcmp((enm)->enm_addrlo, (addrlo), 6) != 0 || \
184 1.5 hpeyerl bcmp((enm)->enm_addrhi, (addrhi), 6) != 0); \
185 1.5 hpeyerl (enm) = (enm)->enm_next); \
186 1.5 hpeyerl }
187 1.5 hpeyerl
188 1.5 hpeyerl /*
189 1.5 hpeyerl * Macro to step through all of the ether_multi records, one at a time.
190 1.5 hpeyerl * The current position is remembered in "step", which the caller must
191 1.5 hpeyerl * provide. ETHER_FIRST_MULTI(), below, must be called to initialize "step"
192 1.5 hpeyerl * and get the first record. Both macros return a NULL "enm" when there
193 1.5 hpeyerl * are no remaining records.
194 1.5 hpeyerl */
195 1.5 hpeyerl #define ETHER_NEXT_MULTI(step, enm) \
196 1.5 hpeyerl /* struct ether_multistep step; */ \
197 1.5 hpeyerl /* struct ether_multi *enm; */ \
198 1.5 hpeyerl { \
199 1.5 hpeyerl if (((enm) = (step).e_enm) != NULL) \
200 1.5 hpeyerl (step).e_enm = (enm)->enm_next; \
201 1.5 hpeyerl }
202 1.5 hpeyerl
203 1.5 hpeyerl #define ETHER_FIRST_MULTI(step, ac, enm) \
204 1.5 hpeyerl /* struct ether_multistep step; */ \
205 1.5 hpeyerl /* struct arpcom *ac; */ \
206 1.5 hpeyerl /* struct ether_multi *enm; */ \
207 1.5 hpeyerl { \
208 1.5 hpeyerl (step).e_enm = (ac)->ac_multiaddrs; \
209 1.5 hpeyerl ETHER_NEXT_MULTI((step), (enm)); \
210 1.5 hpeyerl }
211 1.5 hpeyerl #endif
212 1.1 cgd #endif
213 1.2 mycroft
214 1.2 mycroft #endif /* !_NETINET_IF_ETHER_H_ */
215