source: rtems/cpukit/libnetworking/netinet/if_ether.h @ 954e959

4.104.114.84.95
Last change on this file since 954e959 was 954e959, checked in by Ralf Corsepius <ralf.corsepius@…>, on 05/12/05 at 03:42:44

Define BYTE_PACK.

  • Property mode set to 100644
File size: 6.2 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#ifndef BYTE_PACK
44#define BYTE_PACK __attribute__((packed))
45#endif
46
47#ifdef _KERNEL
48/*
49 * Macro to map an IP multicast address to an Ethernet multicast address.
50 * The high-order 25 bits of the Ethernet address are statically assigned,
51 * and the low-order 23 bits are taken from the low end of the IP address.
52 */
53#define ETHER_MAP_IP_MULTICAST(ipaddr, enaddr) \
54        /* struct in_addr *ipaddr; */ \
55        /* u_char enaddr[ETHER_ADDR_LEN];          */ \
56{ \
57        (enaddr)[0] = 0x01; \
58        (enaddr)[1] = 0x00; \
59        (enaddr)[2] = 0x5e; \
60        (enaddr)[3] = ((u_char *)ipaddr)[1] & 0x7f; \
61        (enaddr)[4] = ((u_char *)ipaddr)[2]; \
62        (enaddr)[5] = ((u_char *)ipaddr)[3]; \
63}
64#endif
65
66/*
67 * Ethernet Address Resolution Protocol.
68 *
69 * See RFC 826 for protocol description.  Structure below is adapted
70 * to resolving internet addresses.  Field names used correspond to
71 * RFC 826.
72 */
73struct  ether_arp {
74        struct  arphdr ea_hdr BYTE_PACK;        /* fixed-size header */
75        u_char  arp_sha[ETHER_ADDR_LEN];        /* sender hardware address */
76        u_char  arp_spa[4];     /* sender protocol address */
77        u_char  arp_tha[ETHER_ADDR_LEN];        /* target hardware address */
78        u_char  arp_tpa[4];     /* target protocol address */
79};
80#define arp_hrd ea_hdr.ar_hrd
81#define arp_pro ea_hdr.ar_pro
82#define arp_hln ea_hdr.ar_hln
83#define arp_pln ea_hdr.ar_pln
84#define arp_op  ea_hdr.ar_op
85
86
87struct sockaddr_inarp {
88        u_char  sin_len;
89        u_char  sin_family;
90        u_short sin_port;
91        struct  in_addr sin_addr;
92        struct  in_addr sin_srcaddr;
93        u_short sin_tos;
94        u_short sin_other;
95#define SIN_PROXY 1
96};
97/*
98 * IP and ethernet specific routing flags
99 */
100#define RTF_USETRAILERS RTF_PROTO1      /* use trailers */
101#define RTF_ANNOUNCE    RTF_PROTO2      /* announce new arp entry */
102
103#ifdef  _KERNEL
104extern u_char   etherbroadcastaddr[ETHER_ADDR_LEN];
105extern u_char   ether_ipmulticast_min[ETHER_ADDR_LEN];
106extern u_char   ether_ipmulticast_max[ETHER_ADDR_LEN];
107extern struct   ifqueue arpintrq;
108
109int     arpresolve __P((struct arpcom *, struct rtentry *, struct mbuf *,
110                        struct sockaddr *, u_char *, struct rtentry *));
111void    arp_ifinit __P((struct arpcom *, struct ifaddr *));
112int     ether_addmulti __P((struct ifreq *, struct arpcom *));
113int     ether_delmulti __P((struct ifreq *, struct arpcom *));
114
115/*
116 * Ethernet multicast address structure.  There is one of these for each
117 * multicast address or range of multicast addresses that we are supposed
118 * to listen to on a particular interface.  They are kept in a linked list,
119 * rooted in the interface's arpcom structure.  (This really has nothing to
120 * do with ARP, or with the Internet address family, but this appears to be
121 * the minimally-disrupting place to put it.)
122 */
123struct ether_multi {
124        u_char  enm_addrlo[ETHER_ADDR_LEN];             /* low  or only address of range */
125        u_char  enm_addrhi[ETHER_ADDR_LEN];             /* high or only address of range */
126        struct  arpcom *enm_ac;         /* back pointer to arpcom */
127        u_int   enm_refcount;           /* no. claims to this addr/range */
128        struct  ether_multi *enm_next;  /* ptr to next ether_multi */
129};
130
131/*
132 * Structure used by macros below to remember position when stepping through
133 * all of the ether_multi records.
134 */
135struct ether_multistep {
136        struct ether_multi  *e_enm;
137};
138
139/*
140 * Macro for looking up the ether_multi record for a given range of Ethernet
141 * multicast addresses connected to a given arpcom structure.  If no matching
142 * record is found, "enm" returns NULL.
143 */
144#define ETHER_LOOKUP_MULTI(addrlo, addrhi, ac, enm) \
145        /* u_char addrlo[ETHER_ADDR_LEN]; */ \
146        /* u_char addrhi[ETHER_ADDR_LEN]; */ \
147        /* struct arpcom *ac; */ \
148        /* struct ether_multi *enm; */ \
149{ \
150        for ((enm) = (ac)->ac_multiaddrs; \
151            (enm) != NULL && \
152            (bcmp((enm)->enm_addrlo, (addrlo), ETHER_ADDR_LEN) != 0 || \
153             bcmp((enm)->enm_addrhi, (addrhi), ETHER_ADDR_LEN) != 0); \
154                (enm) = (enm)->enm_next); \
155}
156
157/*
158 * Macro to step through all of the ether_multi records, one at a time.
159 * The current position is remembered in "step", which the caller must
160 * provide.  ETHER_FIRST_MULTI(), below, must be called to initialize "step"
161 * and get the first record.  Both macros return a NULL "enm" when there
162 * are no remaining records.
163 */
164#define ETHER_NEXT_MULTI(step, enm) \
165        /* struct ether_multistep step; */  \
166        /* struct ether_multi *enm; */  \
167{ \
168        if (((enm) = (step).e_enm) != NULL) \
169                (step).e_enm = (enm)->enm_next; \
170}
171
172#define ETHER_FIRST_MULTI(step, ac, enm) \
173        /* struct ether_multistep step; */ \
174        /* struct arpcom *ac; */ \
175        /* struct ether_multi *enm; */ \
176{ \
177        (step).e_enm = (ac)->ac_multiaddrs; \
178        ETHER_NEXT_MULTI((step), (enm)); \
179}
180
181#endif
182
183#endif
Note: See TracBrowser for help on using the repository browser.