source: rtems/cpukit/libnetworking/netinet/if_ether.h @ ef1f80e

4.104.114.84.9
Last change on this file since ef1f80e was ef1f80e, checked in by Ralf Corsepius <ralf.corsepius@…>, on Apr 14, 2005 at 3:09:06 PM

Partial updates from FreeBSD.

  • Property mode set to 100644
File size: 6.1 KB
Line 
1/*
2 * Copyright (c) 1982, 1986, 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 * 4. Neither the name of the University nor the names of its contributors
14 *    may be used to endorse or promote products derived from this software
15 *    without specific prior written permission.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 *
29 *      @(#)if_ether.h  8.3 (Berkeley) 5/2/95
30 * $FreeBSD: src/sys/netinet/if_ether.h,v 1.32 2005/02/22 13:04:03 glebius Exp $
31 */
32
33/*
34 *      $Id$
35 */
36
37#ifndef _NETINET_IF_ETHER_H_
38#define _NETINET_IF_ETHER_H_
39
40#include <net/ethernet.h>
41#include <net/if_arp.h>
42
43#ifdef _KERNEL
44/*
45 * Macro to map an IP multicast address to an Ethernet multicast address.
46 * The high-order 25 bits of the Ethernet address are statically assigned,
47 * and the low-order 23 bits are taken from the low end of the IP address.
48 */
49#define ETHER_MAP_IP_MULTICAST(ipaddr, enaddr) \
50        /* struct in_addr *ipaddr; */ \
51        /* u_char enaddr[ETHER_ADDR_LEN];          */ \
52{ \
53        (enaddr)[0] = 0x01; \
54        (enaddr)[1] = 0x00; \
55        (enaddr)[2] = 0x5e; \
56        (enaddr)[3] = ((u_char *)ipaddr)[1] & 0x7f; \
57        (enaddr)[4] = ((u_char *)ipaddr)[2]; \
58        (enaddr)[5] = ((u_char *)ipaddr)[3]; \
59}
60#endif
61
62/*
63 * Ethernet Address Resolution Protocol.
64 *
65 * See RFC 826 for protocol description.  Structure below is adapted
66 * to resolving internet addresses.  Field names used correspond to
67 * RFC 826.
68 */
69struct  ether_arp {
70        struct  arphdr ea_hdr BYTE_PACK;        /* fixed-size header */
71        u_char  arp_sha[ETHER_ADDR_LEN];        /* sender hardware address */
72        u_char  arp_spa[4];     /* sender protocol address */
73        u_char  arp_tha[ETHER_ADDR_LEN];        /* target hardware address */
74        u_char  arp_tpa[4];     /* target protocol address */
75};
76#define arp_hrd ea_hdr.ar_hrd
77#define arp_pro ea_hdr.ar_pro
78#define arp_hln ea_hdr.ar_hln
79#define arp_pln ea_hdr.ar_pln
80#define arp_op  ea_hdr.ar_op
81
82
83struct sockaddr_inarp {
84        u_char  sin_len;
85        u_char  sin_family;
86        u_short sin_port;
87        struct  in_addr sin_addr;
88        struct  in_addr sin_srcaddr;
89        u_short sin_tos;
90        u_short sin_other;
91#define SIN_PROXY 1
92};
93/*
94 * IP and ethernet specific routing flags
95 */
96#define RTF_USETRAILERS RTF_PROTO1      /* use trailers */
97#define RTF_ANNOUNCE    RTF_PROTO2      /* announce new arp entry */
98
99#ifdef  _KERNEL
100extern u_char   etherbroadcastaddr[ETHER_ADDR_LEN];
101extern u_char   ether_ipmulticast_min[ETHER_ADDR_LEN];
102extern u_char   ether_ipmulticast_max[ETHER_ADDR_LEN];
103extern struct   ifqueue arpintrq;
104
105int     arpresolve __P((struct arpcom *, struct rtentry *, struct mbuf *,
106                        struct sockaddr *, u_char *, struct rtentry *));
107void    arp_ifinit __P((struct arpcom *, struct ifaddr *));
108int     ether_addmulti __P((struct ifreq *, struct arpcom *));
109int     ether_delmulti __P((struct ifreq *, struct arpcom *));
110
111/*
112 * Ethernet multicast address structure.  There is one of these for each
113 * multicast address or range of multicast addresses that we are supposed
114 * to listen to on a particular interface.  They are kept in a linked list,
115 * rooted in the interface's arpcom structure.  (This really has nothing to
116 * do with ARP, or with the Internet address family, but this appears to be
117 * the minimally-disrupting place to put it.)
118 */
119struct ether_multi {
120        u_char  enm_addrlo[ETHER_ADDR_LEN];             /* low  or only address of range */
121        u_char  enm_addrhi[ETHER_ADDR_LEN];             /* high or only address of range */
122        struct  arpcom *enm_ac;         /* back pointer to arpcom */
123        u_int   enm_refcount;           /* no. claims to this addr/range */
124        struct  ether_multi *enm_next;  /* ptr to next ether_multi */
125};
126
127/*
128 * Structure used by macros below to remember position when stepping through
129 * all of the ether_multi records.
130 */
131struct ether_multistep {
132        struct ether_multi  *e_enm;
133};
134
135/*
136 * Macro for looking up the ether_multi record for a given range of Ethernet
137 * multicast addresses connected to a given arpcom structure.  If no matching
138 * record is found, "enm" returns NULL.
139 */
140#define ETHER_LOOKUP_MULTI(addrlo, addrhi, ac, enm) \
141        /* u_char addrlo[ETHER_ADDR_LEN]; */ \
142        /* u_char addrhi[ETHER_ADDR_LEN]; */ \
143        /* struct arpcom *ac; */ \
144        /* struct ether_multi *enm; */ \
145{ \
146        for ((enm) = (ac)->ac_multiaddrs; \
147            (enm) != NULL && \
148            (bcmp((enm)->enm_addrlo, (addrlo), ETHER_ADDR_LEN) != 0 || \
149             bcmp((enm)->enm_addrhi, (addrhi), ETHER_ADDR_LEN) != 0); \
150                (enm) = (enm)->enm_next); \
151}
152
153/*
154 * Macro to step through all of the ether_multi records, one at a time.
155 * The current position is remembered in "step", which the caller must
156 * provide.  ETHER_FIRST_MULTI(), below, must be called to initialize "step"
157 * and get the first record.  Both macros return a NULL "enm" when there
158 * are no remaining records.
159 */
160#define ETHER_NEXT_MULTI(step, enm) \
161        /* struct ether_multistep step; */  \
162        /* struct ether_multi *enm; */  \
163{ \
164        if (((enm) = (step).e_enm) != NULL) \
165                (step).e_enm = (enm)->enm_next; \
166}
167
168#define ETHER_FIRST_MULTI(step, ac, enm) \
169        /* struct ether_multistep step; */ \
170        /* struct arpcom *ac; */ \
171        /* struct ether_multi *enm; */ \
172{ \
173        (step).e_enm = (ac)->ac_multiaddrs; \
174        ETHER_NEXT_MULTI((step), (enm)); \
175}
176
177#endif
178
179#endif
Note: See TracBrowser for help on using the repository browser.