2005-01-07 01:45:51 +00:00
|
|
|
/*-
|
1994-05-24 10:09:53 +00:00
|
|
|
* Copyright (c) 1982, 1986, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
1995-09-21 17:39:51 +00:00
|
|
|
* @(#)if_ether.h 8.3 (Berkeley) 5/2/95
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
1994-08-21 05:27:42 +00:00
|
|
|
#ifndef _NETINET_IF_ETHER_H_
|
|
|
|
#define _NETINET_IF_ETHER_H_
|
|
|
|
|
1996-08-06 21:14:36 +00:00
|
|
|
#include <net/ethernet.h>
|
1996-12-11 17:46:33 +00:00
|
|
|
#include <net/if_arp.h>
|
1995-04-02 01:26:26 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Macro to map an IP multicast address to an Ethernet multicast address.
|
|
|
|
* The high-order 25 bits of the Ethernet address are statically assigned,
|
|
|
|
* and the low-order 23 bits are taken from the low end of the IP address.
|
|
|
|
*/
|
|
|
|
#define ETHER_MAP_IP_MULTICAST(ipaddr, enaddr) \
|
|
|
|
/* struct in_addr *ipaddr; */ \
|
1996-08-06 21:14:36 +00:00
|
|
|
/* u_char enaddr[ETHER_ADDR_LEN]; */ \
|
1994-05-24 10:09:53 +00:00
|
|
|
{ \
|
|
|
|
(enaddr)[0] = 0x01; \
|
|
|
|
(enaddr)[1] = 0x00; \
|
|
|
|
(enaddr)[2] = 0x5e; \
|
|
|
|
(enaddr)[3] = ((u_char *)ipaddr)[1] & 0x7f; \
|
|
|
|
(enaddr)[4] = ((u_char *)ipaddr)[2]; \
|
|
|
|
(enaddr)[5] = ((u_char *)ipaddr)[3]; \
|
|
|
|
}
|
1999-11-05 14:41:39 +00:00
|
|
|
/*
|
|
|
|
* Macro to map an IP6 multicast address to an Ethernet multicast address.
|
|
|
|
* The high-order 16 bits of the Ethernet address are statically assigned,
|
|
|
|
* and the low-order 32 bits are taken from the low end of the IP6 address.
|
|
|
|
*/
|
|
|
|
#define ETHER_MAP_IPV6_MULTICAST(ip6addr, enaddr) \
|
|
|
|
/* struct in6_addr *ip6addr; */ \
|
|
|
|
/* u_char enaddr[ETHER_ADDR_LEN]; */ \
|
|
|
|
{ \
|
|
|
|
(enaddr)[0] = 0x33; \
|
|
|
|
(enaddr)[1] = 0x33; \
|
|
|
|
(enaddr)[2] = ((u_char *)ip6addr)[12]; \
|
|
|
|
(enaddr)[3] = ((u_char *)ip6addr)[13]; \
|
|
|
|
(enaddr)[4] = ((u_char *)ip6addr)[14]; \
|
|
|
|
(enaddr)[5] = ((u_char *)ip6addr)[15]; \
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Ethernet Address Resolution Protocol.
|
|
|
|
*
|
|
|
|
* See RFC 826 for protocol description. Structure below is adapted
|
1995-05-30 08:16:23 +00:00
|
|
|
* to resolving internet addresses. Field names used correspond to
|
1994-05-24 10:09:53 +00:00
|
|
|
* RFC 826.
|
|
|
|
*/
|
|
|
|
struct ether_arp {
|
|
|
|
struct arphdr ea_hdr; /* fixed-size header */
|
1996-08-06 21:14:36 +00:00
|
|
|
u_char arp_sha[ETHER_ADDR_LEN]; /* sender hardware address */
|
1994-05-24 10:09:53 +00:00
|
|
|
u_char arp_spa[4]; /* sender protocol address */
|
1996-08-06 21:14:36 +00:00
|
|
|
u_char arp_tha[ETHER_ADDR_LEN]; /* target hardware address */
|
1994-05-24 10:09:53 +00:00
|
|
|
u_char arp_tpa[4]; /* target protocol address */
|
|
|
|
};
|
|
|
|
#define arp_hrd ea_hdr.ar_hrd
|
|
|
|
#define arp_pro ea_hdr.ar_pro
|
|
|
|
#define arp_hln ea_hdr.ar_hln
|
|
|
|
#define arp_pln ea_hdr.ar_pln
|
|
|
|
#define arp_op ea_hdr.ar_op
|
|
|
|
|
|
|
|
struct sockaddr_inarp {
|
|
|
|
u_char sin_len;
|
|
|
|
u_char sin_family;
|
|
|
|
u_short sin_port;
|
|
|
|
struct in_addr sin_addr;
|
|
|
|
struct in_addr sin_srcaddr;
|
|
|
|
u_short sin_tos;
|
|
|
|
u_short sin_other;
|
|
|
|
#define SIN_PROXY 1
|
|
|
|
};
|
|
|
|
/*
|
|
|
|
* IP and ethernet specific routing flags
|
|
|
|
*/
|
|
|
|
#define RTF_USETRAILERS RTF_PROTO1 /* use trailers */
|
|
|
|
#define RTF_ANNOUNCE RTF_PROTO2 /* announce new arp entry */
|
|
|
|
|
1999-12-29 04:46:21 +00:00
|
|
|
#ifdef _KERNEL
|
1996-08-06 21:14:36 +00:00
|
|
|
extern u_char ether_ipmulticast_min[ETHER_ADDR_LEN];
|
|
|
|
extern u_char ether_ipmulticast_max[ETHER_ADDR_LEN];
|
1994-05-24 10:09:53 +00:00
|
|
|
|
This main goals of this project are:
1. separating L2 tables (ARP, NDP) from the L3 routing tables
2. removing as much locking dependencies among these layers as
possible to allow for some parallelism in the search operations
3. simplify the logic in the routing code,
The most notable end result is the obsolescent of the route
cloning (RTF_CLONING) concept, which translated into code reduction
in both IPv4 ARP and IPv6 NDP related modules, and size reduction in
struct rtentry{}. The change in design obsoletes the semantics of
RTF_CLONING, RTF_WASCLONE and RTF_LLINFO routing flags. The userland
applications such as "arp" and "ndp" have been modified to reflect
those changes. The output from "netstat -r" shows only the routing
entries.
Quite a few developers have contributed to this project in the
past: Glebius Smirnoff, Luigi Rizzo, Alessandro Cerri, and
Andre Oppermann. And most recently:
- Kip Macy revised the locking code completely, thus completing
the last piece of the puzzle, Kip has also been conducting
active functional testing
- Sam Leffler has helped me improving/refactoring the code, and
provided valuable reviews
- Julian Elischer setup the perforce tree for me and has helped
me maintaining that branch before the svn conversion
2008-12-15 06:10:57 +00:00
|
|
|
struct llentry;
|
2009-02-16 15:07:40 +00:00
|
|
|
struct ifaddr;
|
This main goals of this project are:
1. separating L2 tables (ARP, NDP) from the L3 routing tables
2. removing as much locking dependencies among these layers as
possible to allow for some parallelism in the search operations
3. simplify the logic in the routing code,
The most notable end result is the obsolescent of the route
cloning (RTF_CLONING) concept, which translated into code reduction
in both IPv4 ARP and IPv6 NDP related modules, and size reduction in
struct rtentry{}. The change in design obsoletes the semantics of
RTF_CLONING, RTF_WASCLONE and RTF_LLINFO routing flags. The userland
applications such as "arp" and "ndp" have been modified to reflect
those changes. The output from "netstat -r" shows only the routing
entries.
Quite a few developers have contributed to this project in the
past: Glebius Smirnoff, Luigi Rizzo, Alessandro Cerri, and
Andre Oppermann. And most recently:
- Kip Macy revised the locking code completely, thus completing
the last piece of the puzzle, Kip has also been conducting
active functional testing
- Sam Leffler has helped me improving/refactoring the code, and
provided valuable reviews
- Julian Elischer setup the perforce tree for me and has helped
me maintaining that branch before the svn conversion
2008-12-15 06:10:57 +00:00
|
|
|
|
2004-04-04 06:14:55 +00:00
|
|
|
int arpresolve(struct ifnet *ifp, struct rtentry *rt,
|
This main goals of this project are:
1. separating L2 tables (ARP, NDP) from the L3 routing tables
2. removing as much locking dependencies among these layers as
possible to allow for some parallelism in the search operations
3. simplify the logic in the routing code,
The most notable end result is the obsolescent of the route
cloning (RTF_CLONING) concept, which translated into code reduction
in both IPv4 ARP and IPv6 NDP related modules, and size reduction in
struct rtentry{}. The change in design obsoletes the semantics of
RTF_CLONING, RTF_WASCLONE and RTF_LLINFO routing flags. The userland
applications such as "arp" and "ndp" have been modified to reflect
those changes. The output from "netstat -r" shows only the routing
entries.
Quite a few developers have contributed to this project in the
past: Glebius Smirnoff, Luigi Rizzo, Alessandro Cerri, and
Andre Oppermann. And most recently:
- Kip Macy revised the locking code completely, thus completing
the last piece of the puzzle, Kip has also been conducting
active functional testing
- Sam Leffler has helped me improving/refactoring the code, and
provided valuable reviews
- Julian Elischer setup the perforce tree for me and has helped
me maintaining that branch before the svn conversion
2008-12-15 06:10:57 +00:00
|
|
|
struct mbuf *m, struct sockaddr *dst, u_char *desten,
|
|
|
|
struct llentry **lle);
|
2002-03-19 21:25:46 +00:00
|
|
|
void arp_ifinit(struct ifnet *, struct ifaddr *);
|
2005-02-22 13:04:05 +00:00
|
|
|
void arp_ifinit2(struct ifnet *, struct ifaddr *, u_char *);
|
A major overhaul of the CARP implementation. The ip_carp.c was started
from scratch, copying needed functionality from the old implemenation
on demand, with a thorough review of all code. The main change is that
interface layer has been removed from the CARP. Now redundant addresses
are configured exactly on the interfaces, they run on.
The CARP configuration itself is, as before, configured and read via
SIOCSVH/SIOCGVH ioctls. A new prefix created with SIOCAIFADDR or
SIOCAIFADDR_IN6 may now be configured to a particular virtual host id,
which makes the prefix redundant.
ifconfig(8) semantics has been changed too: now one doesn't need
to clone carpXX interface, he/she should directly configure a vhid
on a Ethernet interface.
To supply vhid data from the kernel to an application the getifaddrs(8)
function had been changed to pass ifam_data with each address. [1]
The new implementation definitely closes all PRs related to carp(4)
being an interface, and may close several others. It also allows
to run a single redundant IP per interface.
Big thanks to Bjoern Zeeb for his help with inet6 part of patch, for
idea on using ifam_data and for several rounds of reviewing!
PR: kern/117000, kern/126945, kern/126714, kern/120130, kern/117448
Reviewed by: bz
Submitted by: bz [1]
2011-12-16 12:16:56 +00:00
|
|
|
void arp_ifscrub(struct ifnet *, uint32_t);
|
2009-09-08 21:17:17 +00:00
|
|
|
|
|
|
|
#include <sys/eventhandler.h>
|
|
|
|
typedef void (*llevent_arp_update_fn)(void *, struct llentry *);
|
|
|
|
EVENTHANDLER_DECLARE(arp_update_event, llevent_arp_update_fn);
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#endif
|
1994-08-21 05:27:42 +00:00
|
|
|
|
|
|
|
#endif
|