1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1988, 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.
|
|
|
|
*
|
|
|
|
* @(#)if_ether.c 8.1 (Berkeley) 6/10/93
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Ethernet address resolution protocol.
|
|
|
|
* TODO:
|
|
|
|
* add "inuse/lock" bit (or ref. count) along with valid bit
|
|
|
|
*/
|
|
|
|
|
1998-01-08 23:42:31 +00:00
|
|
|
#include "opt_inet.h"
|
1998-12-14 18:09:13 +00:00
|
|
|
#include "opt_bdg.h"
|
2002-07-31 16:45:16 +00:00
|
|
|
#include "opt_mac.h"
|
1998-01-08 23:42:31 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/param.h>
|
1995-12-09 16:06:54 +00:00
|
|
|
#include <sys/kernel.h>
|
1999-02-16 10:49:55 +00:00
|
|
|
#include <sys/queue.h>
|
1995-12-09 16:06:54 +00:00
|
|
|
#include <sys/sysctl.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/systm.h>
|
2002-07-31 16:45:16 +00:00
|
|
|
#include <sys/mac.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/mbuf.h>
|
1995-12-09 16:06:54 +00:00
|
|
|
#include <sys/malloc.h>
|
1996-10-12 19:49:43 +00:00
|
|
|
#include <sys/socket.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/syslog.h>
|
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/if_dl.h>
|
1999-02-20 11:18:00 +00:00
|
|
|
#include <net/if_types.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <net/route.h>
|
1995-05-11 00:13:26 +00:00
|
|
|
#include <net/netisr.h>
|
2000-03-19 21:34:39 +00:00
|
|
|
#include <net/if_llc.h>
|
2001-02-03 17:25:21 +00:00
|
|
|
#include <net/ethernet.h>
|
|
|
|
#include <net/bridge.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/if_ether.h>
|
|
|
|
|
2001-10-14 20:17:53 +00:00
|
|
|
#include <net/if_arc.h>
|
1999-03-10 10:11:43 +00:00
|
|
|
#include <net/iso88025.h>
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#define SIN(s) ((struct sockaddr_in *)s)
|
|
|
|
#define SDL(s) ((struct sockaddr_dl *)s)
|
|
|
|
|
1999-02-16 10:49:55 +00:00
|
|
|
SYSCTL_DECL(_net_link_ether);
|
1995-12-20 21:53:53 +00:00
|
|
|
SYSCTL_NODE(_net_link_ether, PF_INET, inet, CTLFLAG_RW, 0, "");
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/* timer values */
|
1995-12-20 21:53:53 +00:00
|
|
|
static int arpt_prune = (5*60*1); /* walk list every 5 minutes */
|
|
|
|
static int arpt_keep = (20*60); /* once resolved, good for 20 more minutes */
|
|
|
|
static int arpt_down = 20; /* once declared down, don't send for 20 sec */
|
1995-12-09 16:06:54 +00:00
|
|
|
|
1995-12-20 21:53:53 +00:00
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, prune_intvl, CTLFLAG_RW,
|
|
|
|
&arpt_prune, 0, "");
|
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, max_age, CTLFLAG_RW,
|
|
|
|
&arpt_keep, 0, "");
|
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, host_down_time, CTLFLAG_RW,
|
|
|
|
&arpt_down, 0, "");
|
1995-12-09 16:06:54 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#define rt_expire rt_rmx.rmx_expire
|
|
|
|
|
1995-10-05 20:08:43 +00:00
|
|
|
struct llinfo_arp {
|
2000-05-26 02:09:24 +00:00
|
|
|
LIST_ENTRY(llinfo_arp) la_le;
|
1995-10-05 20:08:43 +00:00
|
|
|
struct rtentry *la_rt;
|
2003-02-04 05:28:08 +00:00
|
|
|
struct mbuf *la_hold; /* last packet until resolved/timeout */
|
2003-02-08 15:05:15 +00:00
|
|
|
u_short la_preempt; /* countdown for pre-expiry arps */
|
2003-02-04 05:28:08 +00:00
|
|
|
u_short la_asked; /* #times we QUERIED following expiration */
|
1995-10-05 20:08:43 +00:00
|
|
|
#define la_timer la_rt->rt_rmx.rmx_expire /* deletion time in seconds */
|
|
|
|
};
|
|
|
|
|
2000-05-26 02:09:24 +00:00
|
|
|
static LIST_HEAD(, llinfo_arp) llinfo_arp;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-03-04 23:19:55 +00:00
|
|
|
static struct ifqueue arpintrq;
|
2003-10-04 03:44:50 +00:00
|
|
|
static int arp_allocated;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-12-09 16:06:54 +00:00
|
|
|
static int arp_maxtries = 5;
|
1995-12-20 21:53:53 +00:00
|
|
|
static int useloopback = 1; /* use loopback interface for local traffic */
|
1995-12-09 16:06:54 +00:00
|
|
|
static int arp_proxyall = 0;
|
2003-10-04 03:44:50 +00:00
|
|
|
static struct callout arp_callout;
|
1995-12-20 21:53:53 +00:00
|
|
|
|
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, maxtries, CTLFLAG_RW,
|
|
|
|
&arp_maxtries, 0, "");
|
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, useloopback, CTLFLAG_RW,
|
|
|
|
&useloopback, 0, "");
|
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, proxyall, CTLFLAG_RW,
|
|
|
|
&arp_proxyall, 0, "");
|
1995-12-09 16:06:54 +00:00
|
|
|
|
2002-03-19 21:25:46 +00:00
|
|
|
static void arp_init(void);
|
|
|
|
static void arp_rtrequest(int, struct rtentry *, struct rt_addrinfo *);
|
|
|
|
static void arprequest(struct ifnet *,
|
|
|
|
struct in_addr *, struct in_addr *, u_char *);
|
2003-03-04 23:19:55 +00:00
|
|
|
static void arpintr(struct mbuf *);
|
2002-03-19 21:25:46 +00:00
|
|
|
static void arptfree(struct llinfo_arp *);
|
|
|
|
static void arptimer(void *);
|
1995-12-09 16:06:54 +00:00
|
|
|
static struct llinfo_arp
|
2002-03-19 21:25:46 +00:00
|
|
|
*arplookup(u_long, int, int);
|
1998-01-08 23:42:31 +00:00
|
|
|
#ifdef INET
|
2002-03-19 21:25:46 +00:00
|
|
|
static void in_arpinput(struct mbuf *);
|
1998-01-08 23:42:31 +00:00
|
|
|
#endif
|
1994-10-01 21:50:33 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Timeout routine. Age arp_tab entries periodically.
|
|
|
|
*/
|
|
|
|
/* ARGSUSED */
|
|
|
|
static void
|
|
|
|
arptimer(ignored_arg)
|
|
|
|
void *ignored_arg;
|
|
|
|
{
|
2003-01-17 07:59:35 +00:00
|
|
|
struct llinfo_arp *la, *ola;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-01-28 20:22:19 +00:00
|
|
|
RADIX_NODE_HEAD_LOCK(rt_tables[AF_INET]);
|
2003-01-17 07:59:35 +00:00
|
|
|
la = LIST_FIRST(&llinfo_arp);
|
|
|
|
while (la != NULL) {
|
|
|
|
struct rtentry *rt = la->la_rt;
|
|
|
|
ola = la;
|
2001-02-04 13:13:25 +00:00
|
|
|
la = LIST_NEXT(la, la_le);
|
1998-03-30 09:56:58 +00:00
|
|
|
if (rt->rt_expire && rt->rt_expire <= time_second)
|
2003-01-17 07:59:35 +00:00
|
|
|
arptfree(ola); /* timer has expired, clear */
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2003-01-28 20:22:19 +00:00
|
|
|
RADIX_NODE_HEAD_UNLOCK(rt_tables[AF_INET]);
|
2003-10-04 03:44:50 +00:00
|
|
|
|
|
|
|
callout_reset(&arp_callout, arpt_prune * hz, arptimer, NULL);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Parallel to llc_rtrequest.
|
|
|
|
*/
|
1994-12-22 22:00:30 +00:00
|
|
|
static void
|
2001-10-17 18:07:05 +00:00
|
|
|
arp_rtrequest(req, rt, info)
|
1994-05-24 10:09:53 +00:00
|
|
|
int req;
|
2004-03-14 00:44:11 +00:00
|
|
|
struct rtentry *rt;
|
2001-10-17 18:07:05 +00:00
|
|
|
struct rt_addrinfo *info;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2004-03-14 00:44:11 +00:00
|
|
|
struct sockaddr *gate;
|
|
|
|
struct llinfo_arp *la;
|
1994-05-24 10:09:53 +00:00
|
|
|
static struct sockaddr_dl null_sdl = {sizeof(null_sdl), AF_LINK};
|
|
|
|
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_LOCK_ASSERT(rt);
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
if (rt->rt_flags & RTF_GATEWAY)
|
|
|
|
return;
|
2003-10-04 03:44:50 +00:00
|
|
|
gate = rt->rt_gateway;
|
|
|
|
la = (struct llinfo_arp *)rt->rt_llinfo;
|
1994-05-24 10:09:53 +00:00
|
|
|
switch (req) {
|
|
|
|
|
|
|
|
case RTM_ADD:
|
|
|
|
/*
|
|
|
|
* XXX: If this is a manually added route to interface
|
|
|
|
* such as older version of routed or gated might provide,
|
|
|
|
* restore cloning bit.
|
|
|
|
*/
|
|
|
|
if ((rt->rt_flags & RTF_HOST) == 0 &&
|
|
|
|
SIN(rt_mask(rt))->sin_addr.s_addr != 0xffffffff)
|
|
|
|
rt->rt_flags |= RTF_CLONING;
|
|
|
|
if (rt->rt_flags & RTF_CLONING) {
|
|
|
|
/*
|
|
|
|
* Case 1: This route should come from a route to iface.
|
|
|
|
*/
|
|
|
|
rt_setgate(rt, rt_key(rt),
|
|
|
|
(struct sockaddr *)&null_sdl);
|
|
|
|
gate = rt->rt_gateway;
|
|
|
|
SDL(gate)->sdl_type = rt->rt_ifp->if_type;
|
|
|
|
SDL(gate)->sdl_index = rt->rt_ifp->if_index;
|
1998-03-30 09:56:58 +00:00
|
|
|
rt->rt_expire = time_second;
|
1994-05-24 10:09:53 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
/* Announce a new entry if requested. */
|
|
|
|
if (rt->rt_flags & RTF_ANNOUNCE)
|
2001-10-14 20:17:53 +00:00
|
|
|
arprequest(rt->rt_ifp,
|
1998-06-12 03:48:19 +00:00
|
|
|
&SIN(rt_key(rt))->sin_addr,
|
|
|
|
&SIN(rt_key(rt))->sin_addr,
|
1994-05-24 10:09:53 +00:00
|
|
|
(u_char *)LLADDR(SDL(gate)));
|
|
|
|
/*FALLTHROUGH*/
|
|
|
|
case RTM_RESOLVE:
|
|
|
|
if (gate->sa_family != AF_LINK ||
|
|
|
|
gate->sa_len < sizeof(null_sdl)) {
|
2003-10-04 03:44:50 +00:00
|
|
|
log(LOG_DEBUG, "%s: bad gateway %s%s\n", __func__,
|
2003-10-03 17:21:17 +00:00
|
|
|
inet_ntoa(SIN(rt_key(rt))->sin_addr),
|
|
|
|
(gate->sa_family != AF_LINK) ?
|
2003-10-03 17:22:14 +00:00
|
|
|
" (!AF_LINK)": "");
|
1994-05-24 10:09:53 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
SDL(gate)->sdl_type = rt->rt_ifp->if_type;
|
|
|
|
SDL(gate)->sdl_index = rt->rt_ifp->if_index;
|
|
|
|
if (la != 0)
|
|
|
|
break; /* This happens on a route change */
|
|
|
|
/*
|
|
|
|
* Case 2: This route may come from cloning, or a manual route
|
|
|
|
* add with a LL address.
|
|
|
|
*/
|
2003-10-04 03:44:50 +00:00
|
|
|
R_Zalloc(la, struct llinfo_arp *, sizeof(*la));
|
1994-05-24 10:09:53 +00:00
|
|
|
rt->rt_llinfo = (caddr_t)la;
|
|
|
|
if (la == 0) {
|
2003-10-04 03:44:50 +00:00
|
|
|
log(LOG_DEBUG, "%s: malloc failed\n", __func__);
|
1994-05-24 10:09:53 +00:00
|
|
|
break;
|
|
|
|
}
|
2003-10-04 03:44:50 +00:00
|
|
|
arp_allocated++;
|
1994-05-24 10:09:53 +00:00
|
|
|
la->la_rt = rt;
|
|
|
|
rt->rt_flags |= RTF_LLINFO;
|
2003-01-28 20:22:19 +00:00
|
|
|
RADIX_NODE_HEAD_LOCK_ASSERT(rt_tables[AF_INET]);
|
1995-10-05 20:08:43 +00:00
|
|
|
LIST_INSERT_HEAD(&llinfo_arp, la, la_le);
|
1996-02-05 18:04:30 +00:00
|
|
|
|
1998-01-08 23:42:31 +00:00
|
|
|
#ifdef INET
|
1996-02-05 18:04:30 +00:00
|
|
|
/*
|
|
|
|
* This keeps the multicast addresses from showing up
|
|
|
|
* in `arp -a' listings as unresolved. It's not actually
|
|
|
|
* functional. Then the same for broadcast.
|
|
|
|
*/
|
2001-12-13 04:01:01 +00:00
|
|
|
if (IN_MULTICAST(ntohl(SIN(rt_key(rt))->sin_addr.s_addr)) &&
|
|
|
|
rt->rt_ifp->if_type != IFT_ARCNET) {
|
1996-02-05 18:04:30 +00:00
|
|
|
ETHER_MAP_IP_MULTICAST(&SIN(rt_key(rt))->sin_addr,
|
|
|
|
LLADDR(SDL(gate)));
|
|
|
|
SDL(gate)->sdl_alen = 6;
|
1996-06-21 21:45:58 +00:00
|
|
|
rt->rt_expire = 0;
|
1996-02-05 18:04:30 +00:00
|
|
|
}
|
|
|
|
if (in_broadcast(SIN(rt_key(rt))->sin_addr, rt->rt_ifp)) {
|
2001-10-14 20:17:53 +00:00
|
|
|
memcpy(LLADDR(SDL(gate)), rt->rt_ifp->if_broadcastaddr,
|
|
|
|
rt->rt_ifp->if_addrlen);
|
|
|
|
SDL(gate)->sdl_alen = rt->rt_ifp->if_addrlen;
|
1996-06-21 21:45:58 +00:00
|
|
|
rt->rt_expire = 0;
|
1996-02-05 18:04:30 +00:00
|
|
|
}
|
1998-01-08 23:42:31 +00:00
|
|
|
#endif
|
1996-02-05 18:04:30 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
if (SIN(rt_key(rt))->sin_addr.s_addr ==
|
|
|
|
(IA_SIN(rt->rt_ifa))->sin_addr.s_addr) {
|
|
|
|
/*
|
|
|
|
* This test used to be
|
|
|
|
* if (loif.if_flags & IFF_UP)
|
|
|
|
* It allowed local traffic to be forced
|
|
|
|
* through the hardware by configuring the loopback down.
|
|
|
|
* However, it causes problems during network configuration
|
|
|
|
* for boards that can't receive packets they send.
|
|
|
|
* It is now necessary to clear "useloopback" and remove
|
|
|
|
* the route to force traffic out to the hardware.
|
|
|
|
*/
|
|
|
|
rt->rt_expire = 0;
|
2004-04-18 11:45:49 +00:00
|
|
|
bcopy(IF_LLADDR(rt->rt_ifp), LLADDR(SDL(gate)),
|
2001-10-14 20:17:53 +00:00
|
|
|
SDL(gate)->sdl_alen = rt->rt_ifp->if_addrlen);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (useloopback)
|
1995-04-26 18:10:58 +00:00
|
|
|
rt->rt_ifp = loif;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case RTM_DELETE:
|
|
|
|
if (la == 0)
|
|
|
|
break;
|
2003-01-28 20:22:19 +00:00
|
|
|
RADIX_NODE_HEAD_LOCK_ASSERT(rt_tables[AF_INET]);
|
1995-10-05 20:08:43 +00:00
|
|
|
LIST_REMOVE(la, la_le);
|
1994-05-24 10:09:53 +00:00
|
|
|
rt->rt_llinfo = 0;
|
|
|
|
rt->rt_flags &= ~RTF_LLINFO;
|
|
|
|
if (la->la_hold)
|
|
|
|
m_freem(la->la_hold);
|
|
|
|
Free((caddr_t)la);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Broadcast an ARP request. Caller specifies:
|
|
|
|
* - arp header source ip address
|
|
|
|
* - arp header target ip address
|
|
|
|
* - arp header source ethernet address
|
|
|
|
*/
|
|
|
|
static void
|
2001-10-14 20:17:53 +00:00
|
|
|
arprequest(ifp, sip, tip, enaddr)
|
2004-03-14 00:44:11 +00:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct in_addr *sip, *tip;
|
|
|
|
u_char *enaddr;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2004-03-14 00:44:11 +00:00
|
|
|
struct mbuf *m;
|
|
|
|
struct arphdr *ah;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct sockaddr sa;
|
|
|
|
|
2003-02-19 05:47:46 +00:00
|
|
|
if ((m = m_gethdr(M_DONTWAIT, MT_DATA)) == NULL)
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
2004-03-21 06:36:05 +00:00
|
|
|
m->m_len = sizeof(*ah) + 2*sizeof(struct in_addr) +
|
|
|
|
2*ifp->if_data.ifi_addrlen;
|
2004-03-21 18:51:26 +00:00
|
|
|
m->m_pkthdr.len = m->m_len;
|
|
|
|
MH_ALIGN(m, m->m_len);
|
|
|
|
ah = mtod(m, struct arphdr *);
|
2004-03-21 06:36:05 +00:00
|
|
|
bzero((caddr_t)ah, m->m_len);
|
|
|
|
#ifdef MAC
|
|
|
|
mac_create_mbuf_linklayer(ifp, m);
|
|
|
|
#endif
|
2001-10-14 20:17:53 +00:00
|
|
|
ah->ar_pro = htons(ETHERTYPE_IP);
|
|
|
|
ah->ar_hln = ifp->if_addrlen; /* hardware address length */
|
|
|
|
ah->ar_pln = sizeof(struct in_addr); /* protocol address length */
|
|
|
|
ah->ar_op = htons(ARPOP_REQUEST);
|
2004-03-21 06:36:05 +00:00
|
|
|
bcopy((caddr_t)enaddr, (caddr_t)ar_sha(ah), ah->ar_hln);
|
|
|
|
bcopy((caddr_t)sip, (caddr_t)ar_spa(ah), ah->ar_pln);
|
|
|
|
bcopy((caddr_t)tip, (caddr_t)ar_tpa(ah), ah->ar_pln);
|
|
|
|
sa.sa_family = AF_ARP;
|
|
|
|
sa.sa_len = 2;
|
|
|
|
m->m_flags |= M_BCAST;
|
2001-10-14 20:17:53 +00:00
|
|
|
(*ifp->if_output)(ifp, m, &sa, (struct rtentry *)0);
|
2004-03-21 06:36:05 +00:00
|
|
|
|
|
|
|
return;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
* Resolve an IP address into an ethernet address.
|
|
|
|
* On input:
|
|
|
|
* ifp is the interface we use
|
|
|
|
* dst is the next hop,
|
|
|
|
* rt0 is the route to the final destination (possibly useless)
|
|
|
|
* m is the mbuf
|
|
|
|
* desten is where we want the address.
|
|
|
|
*
|
|
|
|
* On success, desten is filled in and the function returns 0;
|
|
|
|
* If the packet must be held pending resolution, we return EWOULDBLOCK
|
|
|
|
* On other errors, we return the corresponding error code.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
int
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
arpresolve(struct ifnet *ifp, struct rtentry *rt0, struct mbuf *m,
|
2004-04-04 06:14:55 +00:00
|
|
|
struct sockaddr *dst, u_char *desten)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2001-06-15 21:00:32 +00:00
|
|
|
struct llinfo_arp *la = 0;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct sockaddr_dl *sdl;
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
int error;
|
|
|
|
struct rtentry *rt;
|
|
|
|
|
|
|
|
error = rt_check(&rt, &rt0, dst);
|
|
|
|
if (error) {
|
|
|
|
m_freem(m);
|
|
|
|
return error;
|
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
if (m->m_flags & M_BCAST) { /* broadcast */
|
2001-10-14 20:17:53 +00:00
|
|
|
(void)memcpy(desten, ifp->if_broadcastaddr, ifp->if_addrlen);
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-10-14 20:17:53 +00:00
|
|
|
if (m->m_flags & M_MCAST && ifp->if_type != IFT_ARCNET) {/* multicast */
|
1994-05-24 10:09:53 +00:00
|
|
|
ETHER_MAP_IP_MULTICAST(&SIN(dst)->sin_addr, desten);
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
if (rt)
|
|
|
|
la = (struct llinfo_arp *)rt->rt_llinfo;
|
1999-01-18 01:54:36 +00:00
|
|
|
if (la == 0) {
|
1994-10-02 17:48:58 +00:00
|
|
|
la = arplookup(SIN(dst)->sin_addr.s_addr, 1, 0);
|
|
|
|
if (la)
|
1994-05-24 10:09:53 +00:00
|
|
|
rt = la->la_rt;
|
|
|
|
}
|
|
|
|
if (la == 0 || rt == 0) {
|
1998-05-23 08:03:40 +00:00
|
|
|
log(LOG_DEBUG, "arpresolve: can't allocate llinfo for %s%s%s\n",
|
|
|
|
inet_ntoa(SIN(dst)->sin_addr), la ? "la" : "",
|
|
|
|
rt ? "rt" : "");
|
1994-05-24 10:09:53 +00:00
|
|
|
m_freem(m);
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
return (EINVAL); /* XXX */
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
sdl = SDL(rt->rt_gateway);
|
|
|
|
/*
|
|
|
|
* Check the address family and length is valid, the address
|
|
|
|
* is resolved; otherwise, try to resolve.
|
|
|
|
*/
|
1998-03-30 09:56:58 +00:00
|
|
|
if ((rt->rt_expire == 0 || rt->rt_expire > time_second) &&
|
1994-05-24 10:09:53 +00:00
|
|
|
sdl->sdl_family == AF_LINK && sdl->sdl_alen != 0) {
|
2002-03-20 15:56:36 +00:00
|
|
|
/*
|
|
|
|
* If entry has an expiry time and it is approaching,
|
|
|
|
* see if we need to send an ARP request within this
|
|
|
|
* arpt_down interval.
|
|
|
|
*/
|
|
|
|
if ((rt->rt_expire != 0) &&
|
2003-02-08 15:05:15 +00:00
|
|
|
(time_second + la->la_preempt > rt->rt_expire)) {
|
2002-03-20 15:56:36 +00:00
|
|
|
arprequest(ifp,
|
|
|
|
&SIN(rt->rt_ifa->ifa_addr)->sin_addr,
|
|
|
|
&SIN(dst)->sin_addr,
|
|
|
|
IF_LLADDR(ifp));
|
2003-02-08 15:05:15 +00:00
|
|
|
la->la_preempt--;
|
2002-03-20 15:56:36 +00:00
|
|
|
}
|
|
|
|
|
1996-06-08 08:19:03 +00:00
|
|
|
bcopy(LLADDR(sdl), desten, sdl->sdl_alen);
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2001-06-15 21:00:32 +00:00
|
|
|
/*
|
2003-10-01 08:32:37 +00:00
|
|
|
* If ARP is disabled or static on this interface, stop.
|
2001-06-15 21:00:32 +00:00
|
|
|
* XXX
|
|
|
|
* Probably should not allocate empty llinfo struct if we are
|
|
|
|
* not going to be sending out an arp request.
|
|
|
|
*/
|
2003-10-01 08:32:37 +00:00
|
|
|
if (ifp->if_flags & (IFF_NOARP | IFF_STATICARP)) {
|
2001-12-05 18:13:34 +00:00
|
|
|
m_freem(m);
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
return (EINVAL);
|
2001-12-05 18:13:34 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* There is an arptab entry, but no ethernet address
|
|
|
|
* response yet. Replace the held mbuf with this
|
|
|
|
* latest one.
|
|
|
|
*/
|
|
|
|
if (la->la_hold)
|
|
|
|
m_freem(la->la_hold);
|
|
|
|
la->la_hold = m;
|
|
|
|
if (rt->rt_expire) {
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_LOCK(rt);
|
1994-05-24 10:09:53 +00:00
|
|
|
rt->rt_flags &= ~RTF_REJECT;
|
1998-03-30 09:56:58 +00:00
|
|
|
if (la->la_asked == 0 || rt->rt_expire != time_second) {
|
|
|
|
rt->rt_expire = time_second;
|
2003-02-04 05:28:08 +00:00
|
|
|
if (la->la_asked++ < arp_maxtries) {
|
|
|
|
arprequest(ifp,
|
|
|
|
&SIN(rt->rt_ifa->ifa_addr)->sin_addr,
|
|
|
|
&SIN(dst)->sin_addr,
|
|
|
|
IF_LLADDR(ifp));
|
|
|
|
} else {
|
1994-05-24 10:09:53 +00:00
|
|
|
rt->rt_flags |= RTF_REJECT;
|
|
|
|
rt->rt_expire += arpt_down;
|
2003-02-08 15:05:15 +00:00
|
|
|
la->la_asked = 0;
|
|
|
|
la->la_preempt = arp_maxtries;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
}
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_UNLOCK(rt);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
This commit does two things:
1. rt_check() cleanup:
rt_check() is only necessary for some address families to gain access
to the corresponding arp entry, so call it only in/near the *resolve()
routines where it is actually used -- at the moment this is
arpresolve(), nd6_storelladdr() (the call is embedded here),
and atmresolve() (the call is just before atmresolve to reduce
the number of changes).
This change will make it a lot easier to decouple the arp table
from the routing table.
There is an extra call to rt_check() in if_iso88025subr.c to
determine the routing info length. I have left it alone for
the time being.
The interface of arpresolve() and nd6_storelladdr() now changes slightly:
+ the 'rtentry' parameter (really a hint from the upper level layer)
is now passed unchanged from *_output(), so it becomes the route
to the final destination and not to the gateway.
+ the routines will return 0 if resolution is possible, non-zero
otherwise.
+ arpresolve() returns EWOULDBLOCK in case the mbuf is being held
waiting for an arp reply -- in this case the error code is masked
in the caller so the upper layer protocol will not see a failure.
2. arpcom untangling
Where possible, use 'struct ifnet' instead of 'struct arpcom' variables,
and use the IFP2AC macro to access arpcom fields.
This mostly affects the netatalk code.
=== Detailed changes: ===
net/if_arcsubr.c
rt_check() cleanup, remove a useless variable
net/if_atmsubr.c
rt_check() cleanup
net/if_ethersubr.c
rt_check() cleanup, arpcom untangling
net/if_fddisubr.c
rt_check() cleanup, arpcom untangling
net/if_iso88025subr.c
rt_check() cleanup
netatalk/aarp.c
arpcom untangling, remove a block of duplicated code
netatalk/at_extern.h
arpcom untangling
netinet/if_ether.c
rt_check() cleanup (change arpresolve)
netinet6/nd6.c
rt_check() cleanup (change nd6_storelladdr)
2004-04-25 09:24:52 +00:00
|
|
|
return (EWOULDBLOCK);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Common length and type checks are done here,
|
|
|
|
* then the protocol-specific routine is called.
|
|
|
|
*/
|
1995-12-09 16:06:54 +00:00
|
|
|
static void
|
2003-03-04 23:19:55 +00:00
|
|
|
arpintr(struct mbuf *m)
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2003-03-04 23:19:55 +00:00
|
|
|
struct arphdr *ar;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-03-04 23:19:55 +00:00
|
|
|
if (m->m_len < sizeof(struct arphdr) &&
|
|
|
|
((m = m_pullup(m, sizeof(struct arphdr))) == NULL)) {
|
|
|
|
log(LOG_ERR, "arp: runt packet -- m_pullup failed\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ar = mtod(m, struct arphdr *);
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-03-04 23:19:55 +00:00
|
|
|
if (ntohs(ar->ar_hrd) != ARPHRD_ETHER &&
|
|
|
|
ntohs(ar->ar_hrd) != ARPHRD_IEEE802 &&
|
2004-06-13 10:54:36 +00:00
|
|
|
ntohs(ar->ar_hrd) != ARPHRD_ARCNET &&
|
|
|
|
ntohs(ar->ar_hrd) != ARPHRD_IEEE1394) {
|
2003-03-04 23:19:55 +00:00
|
|
|
log(LOG_ERR, "arp: unknown hardware address format (0x%2D)\n",
|
|
|
|
(unsigned char *)&ar->ar_hrd, "");
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2003-12-23 14:08:50 +00:00
|
|
|
if (m->m_len < arphdr_len(ar)) {
|
2003-12-23 13:33:23 +00:00
|
|
|
if ((m = m_pullup(m, arphdr_len(ar))) == NULL) {
|
|
|
|
log(LOG_ERR, "arp: runt packet\n");
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ar = mtod(m, struct arphdr *);
|
2003-03-04 23:19:55 +00:00
|
|
|
}
|
2000-03-11 00:24:29 +00:00
|
|
|
|
2003-03-04 23:19:55 +00:00
|
|
|
switch (ntohs(ar->ar_pro)) {
|
1998-01-08 23:42:31 +00:00
|
|
|
#ifdef INET
|
2003-03-04 23:19:55 +00:00
|
|
|
case ETHERTYPE_IP:
|
|
|
|
in_arpinput(m);
|
|
|
|
return;
|
1998-01-08 23:42:31 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2003-03-04 23:19:55 +00:00
|
|
|
m_freem(m);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1998-01-08 23:42:31 +00:00
|
|
|
#ifdef INET
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* ARP for Internet protocols on 10 Mb/s Ethernet.
|
|
|
|
* Algorithm is that given in RFC 826.
|
|
|
|
* In addition, a sanity check is performed on the sender
|
|
|
|
* protocol address, to catch impersonators.
|
|
|
|
* We no longer handle negotiations for use of trailer protocol:
|
|
|
|
* Formerly, ARP replied for protocol type ETHERTYPE_TRAIL sent
|
|
|
|
* along with IP replies if we wanted trailers sent to us,
|
|
|
|
* and also sent them in response to IP replies.
|
|
|
|
* This allowed either end to announce the desire to receive
|
|
|
|
* trailer packets.
|
|
|
|
* We no longer reply to requests for ETHERTYPE_TRAIL protocol either,
|
|
|
|
* but formerly didn't normally send requests.
|
|
|
|
*/
|
2001-01-06 00:45:08 +00:00
|
|
|
static int log_arp_wrong_iface = 1;
|
2001-09-03 21:53:15 +00:00
|
|
|
static int log_arp_movements = 1;
|
2001-01-06 00:45:08 +00:00
|
|
|
|
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, log_arp_wrong_iface, CTLFLAG_RW,
|
|
|
|
&log_arp_wrong_iface, 0,
|
|
|
|
"log arp packets arriving on the wrong interface");
|
2001-09-03 21:53:15 +00:00
|
|
|
SYSCTL_INT(_net_link_ether_inet, OID_AUTO, log_arp_movements, CTLFLAG_RW,
|
|
|
|
&log_arp_movements, 0,
|
2001-09-04 15:25:23 +00:00
|
|
|
"log arp replies from MACs different than the one in the cache");
|
2001-09-03 21:53:15 +00:00
|
|
|
|
2001-01-06 00:45:08 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
static void
|
|
|
|
in_arpinput(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
2004-03-14 00:44:11 +00:00
|
|
|
struct arphdr *ah;
|
|
|
|
struct ifnet *ifp = m->m_pkthdr.rcvif;
|
1999-03-10 10:11:43 +00:00
|
|
|
struct iso88025_header *th = (struct iso88025_header *)0;
|
2002-05-07 22:14:06 +00:00
|
|
|
struct iso88025_sockaddr_dl_data *trld;
|
2004-03-14 00:44:11 +00:00
|
|
|
struct llinfo_arp *la = 0;
|
|
|
|
struct rtentry *rt;
|
2001-09-29 04:34:11 +00:00
|
|
|
struct ifaddr *ifa;
|
|
|
|
struct in_ifaddr *ia;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct sockaddr_dl *sdl;
|
|
|
|
struct sockaddr sa;
|
|
|
|
struct in_addr isaddr, itaddr, myaddr;
|
2000-03-19 21:34:39 +00:00
|
|
|
int op, rif_len;
|
2001-10-14 20:17:53 +00:00
|
|
|
int req_len;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2001-10-14 20:17:53 +00:00
|
|
|
req_len = arphdr_len2(ifp->if_addrlen, sizeof(struct in_addr));
|
|
|
|
if (m->m_len < req_len && (m = m_pullup(m, req_len)) == NULL) {
|
2001-03-27 12:34:58 +00:00
|
|
|
log(LOG_ERR, "in_arp: runt packet -- m_pullup failed\n");
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2001-10-14 20:17:53 +00:00
|
|
|
ah = mtod(m, struct arphdr *);
|
|
|
|
op = ntohs(ah->ar_op);
|
|
|
|
(void)memcpy(&isaddr, ar_spa(ah), sizeof (isaddr));
|
|
|
|
(void)memcpy(&itaddr, ar_tpa(ah), sizeof (itaddr));
|
2004-09-09 12:34:07 +00:00
|
|
|
|
2001-09-29 04:34:11 +00:00
|
|
|
/*
|
|
|
|
* For a bridge, we want to check the address irrespective
|
|
|
|
* of the receive interface. (This will change slightly
|
|
|
|
* when we have clusters of interfaces).
|
|
|
|
*/
|
|
|
|
LIST_FOREACH(ia, INADDR_HASH(itaddr.s_addr), ia_hash)
|
2004-09-09 12:34:07 +00:00
|
|
|
if ((do_bridge || (ia->ia_ifp == ifp)) &&
|
2001-09-29 04:34:11 +00:00
|
|
|
itaddr.s_addr == ia->ia_addr.sin_addr.s_addr)
|
|
|
|
goto match;
|
|
|
|
LIST_FOREACH(ia, INADDR_HASH(isaddr.s_addr), ia_hash)
|
2004-09-09 12:34:07 +00:00
|
|
|
if ((do_bridge || (ia->ia_ifp == ifp)) &&
|
2001-09-29 04:34:11 +00:00
|
|
|
isaddr.s_addr == ia->ia_addr.sin_addr.s_addr)
|
|
|
|
goto match;
|
|
|
|
/*
|
2001-10-20 05:14:06 +00:00
|
|
|
* No match, use the first inet address on the receive interface
|
2001-09-29 04:34:11 +00:00
|
|
|
* as a dummy address for the rest of the function.
|
|
|
|
*/
|
2001-10-20 05:14:06 +00:00
|
|
|
TAILQ_FOREACH(ifa, &ifp->if_addrhead, ifa_link)
|
2001-10-25 06:14:21 +00:00
|
|
|
if (ifa->ifa_addr && ifa->ifa_addr->sa_family == AF_INET) {
|
|
|
|
ia = ifatoia(ifa);
|
|
|
|
goto match;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* If bridging, fall back to using any inet address.
|
|
|
|
*/
|
2004-09-09 12:34:07 +00:00
|
|
|
if (!do_bridge || (ia = TAILQ_FIRST(&in_ifaddrhead)) == NULL)
|
2004-04-25 15:00:17 +00:00
|
|
|
goto drop;
|
2001-09-29 04:34:11 +00:00
|
|
|
match:
|
|
|
|
myaddr = ia->ia_addr.sin_addr;
|
2004-04-25 15:00:17 +00:00
|
|
|
if (!bcmp(ar_sha(ah), IF_LLADDR(ifp), ifp->if_addrlen))
|
|
|
|
goto drop; /* it's from me, ignore it. */
|
2001-10-14 20:17:53 +00:00
|
|
|
if (!bcmp(ar_sha(ah), ifp->if_broadcastaddr, ifp->if_addrlen)) {
|
1994-05-24 10:09:53 +00:00
|
|
|
log(LOG_ERR,
|
2001-10-14 20:17:53 +00:00
|
|
|
"arp: link address is broadcast for IP address %s!\n",
|
1995-03-16 17:32:27 +00:00
|
|
|
inet_ntoa(isaddr));
|
2004-04-25 15:00:17 +00:00
|
|
|
goto drop;
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
2004-10-12 17:10:40 +00:00
|
|
|
/*
|
|
|
|
* Warn if another host is using the same IP address, but only if the
|
|
|
|
* IP address isn't 0.0.0.0, which is used for DHCP only, in which
|
|
|
|
* case we suppress the warning to avoid false positive complaints of
|
|
|
|
* potential misconfiguration.
|
|
|
|
*/
|
|
|
|
if (isaddr.s_addr == myaddr.s_addr && myaddr.s_addr != 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
log(LOG_ERR,
|
2001-10-14 20:17:53 +00:00
|
|
|
"arp: %*D is using my IP address %s!\n",
|
|
|
|
ifp->if_addrlen, (u_char *)ar_sha(ah), ":",
|
|
|
|
inet_ntoa(isaddr));
|
1994-05-24 10:09:53 +00:00
|
|
|
itaddr = myaddr;
|
|
|
|
goto reply;
|
|
|
|
}
|
2003-10-01 08:32:37 +00:00
|
|
|
if (ifp->if_flags & IFF_STATICARP)
|
|
|
|
goto reply;
|
1994-05-24 10:09:53 +00:00
|
|
|
la = arplookup(isaddr.s_addr, itaddr.s_addr == myaddr.s_addr, 0);
|
|
|
|
if (la && (rt = la->la_rt) && (sdl = SDL(rt->rt_gateway))) {
|
2001-02-10 00:10:18 +00:00
|
|
|
/* the following is not an error when doing bridging */
|
2004-09-09 12:34:07 +00:00
|
|
|
if (!do_bridge && rt->rt_ifp != ifp) {
|
2001-02-10 00:10:18 +00:00
|
|
|
if (log_arp_wrong_iface)
|
2003-10-31 18:32:15 +00:00
|
|
|
log(LOG_ERR, "arp: %s is on %s but got reply from %*D on %s\n",
|
2001-02-03 17:25:21 +00:00
|
|
|
inet_ntoa(isaddr),
|
2003-10-31 18:32:15 +00:00
|
|
|
rt->rt_ifp->if_xname,
|
2001-10-14 20:17:53 +00:00
|
|
|
ifp->if_addrlen, (u_char *)ar_sha(ah), ":",
|
2003-10-31 18:32:15 +00:00
|
|
|
ifp->if_xname);
|
2001-02-10 00:10:18 +00:00
|
|
|
goto reply;
|
2001-02-03 17:25:21 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
if (sdl->sdl_alen &&
|
2001-10-14 20:17:53 +00:00
|
|
|
bcmp(ar_sha(ah), LLADDR(sdl), sdl->sdl_alen)) {
|
2001-09-03 21:53:15 +00:00
|
|
|
if (rt->rt_expire) {
|
|
|
|
if (log_arp_movements)
|
2003-10-31 18:32:15 +00:00
|
|
|
log(LOG_INFO, "arp: %s moved from %*D to %*D on %s\n",
|
2001-10-14 20:17:53 +00:00
|
|
|
inet_ntoa(isaddr),
|
|
|
|
ifp->if_addrlen, (u_char *)LLADDR(sdl), ":",
|
|
|
|
ifp->if_addrlen, (u_char *)ar_sha(ah), ":",
|
2003-10-31 18:32:15 +00:00
|
|
|
ifp->if_xname);
|
2001-09-03 21:53:15 +00:00
|
|
|
} else {
|
1998-09-17 00:04:21 +00:00
|
|
|
log(LOG_ERR,
|
2003-10-31 18:32:15 +00:00
|
|
|
"arp: %*D attempts to modify permanent entry for %s on %s\n",
|
2001-10-14 20:17:53 +00:00
|
|
|
ifp->if_addrlen, (u_char *)ar_sha(ah), ":",
|
2003-10-31 18:32:15 +00:00
|
|
|
inet_ntoa(isaddr), ifp->if_xname);
|
1998-09-17 00:04:21 +00:00
|
|
|
goto reply;
|
|
|
|
}
|
1999-05-06 18:13:11 +00:00
|
|
|
}
|
2001-10-14 20:17:53 +00:00
|
|
|
/*
|
|
|
|
* sanity check for the address length.
|
|
|
|
* XXX this does not work for protocols with variable address
|
|
|
|
* length. -is
|
|
|
|
*/
|
|
|
|
if (sdl->sdl_alen &&
|
|
|
|
sdl->sdl_alen != ah->ar_hln) {
|
|
|
|
log(LOG_WARNING,
|
|
|
|
"arp from %*D: new addr len %d, was %d",
|
|
|
|
ifp->if_addrlen, (u_char *) ar_sha(ah), ":",
|
|
|
|
ah->ar_hln, sdl->sdl_alen);
|
|
|
|
}
|
|
|
|
if (ifp->if_addrlen != ah->ar_hln) {
|
|
|
|
log(LOG_WARNING,
|
|
|
|
"arp from %*D: addr len: new %d, i/f %d (ignored)",
|
|
|
|
ifp->if_addrlen, (u_char *) ar_sha(ah), ":",
|
|
|
|
ah->ar_hln, ifp->if_addrlen);
|
|
|
|
goto reply;
|
|
|
|
}
|
|
|
|
(void)memcpy(LLADDR(sdl), ar_sha(ah),
|
|
|
|
sdl->sdl_alen = ah->ar_hln);
|
1999-04-15 17:58:24 +00:00
|
|
|
/*
|
|
|
|
* If we receive an arp from a token-ring station over
|
|
|
|
* a token-ring nic then try to save the source
|
|
|
|
* routing info.
|
|
|
|
*/
|
2001-10-14 20:17:53 +00:00
|
|
|
if (ifp->if_type == IFT_ISO88025) {
|
1999-03-10 10:11:43 +00:00
|
|
|
th = (struct iso88025_header *)m->m_pkthdr.header;
|
2002-05-07 22:14:06 +00:00
|
|
|
trld = SDL_ISO88025(sdl);
|
2000-03-19 21:34:39 +00:00
|
|
|
rif_len = TR_RCF_RIFLEN(th->rcf);
|
|
|
|
if ((th->iso88025_shost[0] & TR_RII) &&
|
|
|
|
(rif_len > 2)) {
|
2002-05-07 22:14:06 +00:00
|
|
|
trld->trld_rcf = th->rcf;
|
|
|
|
trld->trld_rcf ^= htons(TR_RCF_DIR);
|
|
|
|
memcpy(trld->trld_route, th->rd, rif_len - 2);
|
|
|
|
trld->trld_rcf &= ~htons(TR_RCF_BCST_MASK);
|
1999-09-16 00:35:39 +00:00
|
|
|
/*
|
|
|
|
* Set up source routing information for
|
|
|
|
* reply packet (XXX)
|
|
|
|
*/
|
2000-03-19 21:34:39 +00:00
|
|
|
m->m_data -= rif_len;
|
|
|
|
m->m_len += rif_len;
|
|
|
|
m->m_pkthdr.len += rif_len;
|
1999-03-10 10:11:43 +00:00
|
|
|
} else {
|
2000-03-19 21:34:39 +00:00
|
|
|
th->iso88025_shost[0] &= ~TR_RII;
|
2002-05-15 01:03:32 +00:00
|
|
|
trld->trld_rcf = 0;
|
1999-03-10 10:11:43 +00:00
|
|
|
}
|
1999-08-28 14:57:12 +00:00
|
|
|
m->m_data -= 8;
|
|
|
|
m->m_len += 8;
|
|
|
|
m->m_pkthdr.len += 8;
|
2002-05-07 22:14:06 +00:00
|
|
|
th->rcf = trld->trld_rcf;
|
1999-03-10 10:11:43 +00:00
|
|
|
}
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_LOCK(rt);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (rt->rt_expire)
|
1998-03-30 09:56:58 +00:00
|
|
|
rt->rt_expire = time_second + arpt_keep;
|
1994-05-24 10:09:53 +00:00
|
|
|
rt->rt_flags &= ~RTF_REJECT;
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_UNLOCK(rt);
|
2003-02-08 15:05:15 +00:00
|
|
|
la->la_asked = 0;
|
|
|
|
la->la_preempt = arp_maxtries;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (la->la_hold) {
|
2004-03-21 18:51:26 +00:00
|
|
|
(*ifp->if_output)(ifp, la->la_hold, rt_key(rt), rt);
|
1994-05-24 10:09:53 +00:00
|
|
|
la->la_hold = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
reply:
|
2004-04-25 15:00:17 +00:00
|
|
|
if (op != ARPOP_REQUEST)
|
|
|
|
goto drop;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (itaddr.s_addr == myaddr.s_addr) {
|
|
|
|
/* I am the target */
|
2001-10-14 20:17:53 +00:00
|
|
|
(void)memcpy(ar_tha(ah), ar_sha(ah), ah->ar_hln);
|
|
|
|
(void)memcpy(ar_sha(ah), IF_LLADDR(ifp), ah->ar_hln);
|
1994-05-24 10:09:53 +00:00
|
|
|
} else {
|
|
|
|
la = arplookup(itaddr.s_addr, 0, SIN_PROXY);
|
1994-10-01 21:50:33 +00:00
|
|
|
if (la == NULL) {
|
|
|
|
struct sockaddr_in sin;
|
|
|
|
|
2004-04-25 15:00:17 +00:00
|
|
|
if (!arp_proxyall)
|
|
|
|
goto drop;
|
1994-10-01 21:50:33 +00:00
|
|
|
|
|
|
|
bzero(&sin, sizeof sin);
|
|
|
|
sin.sin_family = AF_INET;
|
|
|
|
sin.sin_len = sizeof sin;
|
|
|
|
sin.sin_addr = itaddr;
|
|
|
|
|
1994-12-13 22:32:45 +00:00
|
|
|
rt = rtalloc1((struct sockaddr *)&sin, 0, 0UL);
|
2004-04-25 15:00:17 +00:00
|
|
|
if (!rt)
|
|
|
|
goto drop;
|
1994-10-01 21:50:33 +00:00
|
|
|
/*
|
|
|
|
* Don't send proxies for nodes on the same interface
|
|
|
|
* as this one came out of, or we'll get into a fight
|
|
|
|
* over who claims what Ether address.
|
|
|
|
*/
|
2001-10-14 20:17:53 +00:00
|
|
|
if (rt->rt_ifp == ifp) {
|
1994-10-01 21:50:33 +00:00
|
|
|
rtfree(rt);
|
2004-04-25 15:00:17 +00:00
|
|
|
goto drop;
|
1994-10-01 21:50:33 +00:00
|
|
|
}
|
2001-10-14 20:17:53 +00:00
|
|
|
(void)memcpy(ar_tha(ah), ar_sha(ah), ah->ar_hln);
|
|
|
|
(void)memcpy(ar_sha(ah), IF_LLADDR(ifp), ah->ar_hln);
|
1994-10-01 21:50:33 +00:00
|
|
|
rtfree(rt);
|
2000-07-13 19:31:01 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Also check that the node which sent the ARP packet
|
|
|
|
* is on the the interface we expect it to be on. This
|
|
|
|
* avoids ARP chaos if an interface is connected to the
|
|
|
|
* wrong network.
|
|
|
|
*/
|
|
|
|
sin.sin_addr = isaddr;
|
|
|
|
|
|
|
|
rt = rtalloc1((struct sockaddr *)&sin, 0, 0UL);
|
2004-04-25 15:00:17 +00:00
|
|
|
if (!rt)
|
|
|
|
goto drop;
|
2001-10-14 20:17:53 +00:00
|
|
|
if (rt->rt_ifp != ifp) {
|
2000-07-13 19:31:01 +00:00
|
|
|
log(LOG_INFO, "arp_proxy: ignoring request"
|
2003-10-31 18:32:15 +00:00
|
|
|
" from %s via %s, expecting %s\n",
|
|
|
|
inet_ntoa(isaddr), ifp->if_xname,
|
|
|
|
rt->rt_ifp->if_xname);
|
2000-07-13 19:31:01 +00:00
|
|
|
rtfree(rt);
|
2004-04-25 15:00:17 +00:00
|
|
|
goto drop;
|
2000-07-13 19:31:01 +00:00
|
|
|
}
|
|
|
|
rtfree(rt);
|
|
|
|
|
1994-11-02 00:58:29 +00:00
|
|
|
#ifdef DEBUG_PROXY
|
1995-05-30 08:16:23 +00:00
|
|
|
printf("arp: proxying for %s\n",
|
1995-03-16 17:32:27 +00:00
|
|
|
inet_ntoa(itaddr));
|
1994-10-01 21:50:33 +00:00
|
|
|
#endif
|
|
|
|
} else {
|
|
|
|
rt = la->la_rt;
|
2001-10-14 20:17:53 +00:00
|
|
|
(void)memcpy(ar_tha(ah), ar_sha(ah), ah->ar_hln);
|
1994-10-01 21:50:33 +00:00
|
|
|
sdl = SDL(rt->rt_gateway);
|
2001-10-14 20:17:53 +00:00
|
|
|
(void)memcpy(ar_sha(ah), LLADDR(sdl), ah->ar_hln);
|
1994-10-01 21:50:33 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
2001-10-14 20:17:53 +00:00
|
|
|
(void)memcpy(ar_tpa(ah), ar_spa(ah), ah->ar_pln);
|
|
|
|
(void)memcpy(ar_spa(ah), &itaddr, ah->ar_pln);
|
|
|
|
ah->ar_op = htons(ARPOP_REPLY);
|
|
|
|
ah->ar_pro = htons(ETHERTYPE_IP); /* let's be sure! */
|
2004-03-21 06:36:05 +00:00
|
|
|
m->m_flags &= ~(M_BCAST|M_MCAST); /* never reply by broadcast */
|
|
|
|
m->m_len = sizeof(*ah) + (2 * ah->ar_pln) + (2 * ah->ar_hln);
|
|
|
|
m->m_pkthdr.len = m->m_len;
|
|
|
|
sa.sa_family = AF_ARP;
|
|
|
|
sa.sa_len = 2;
|
2001-10-14 20:17:53 +00:00
|
|
|
(*ifp->if_output)(ifp, m, &sa, (struct rtentry *)0);
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
2004-04-25 15:00:17 +00:00
|
|
|
|
|
|
|
drop:
|
|
|
|
m_freem(m);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
1998-01-08 23:42:31 +00:00
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Free an arp entry.
|
|
|
|
*/
|
|
|
|
static void
|
|
|
|
arptfree(la)
|
2004-03-14 00:44:11 +00:00
|
|
|
struct llinfo_arp *la;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
2004-03-14 00:44:11 +00:00
|
|
|
struct rtentry *rt = la->la_rt;
|
|
|
|
struct sockaddr_dl *sdl;
|
2003-10-04 03:44:50 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
if (rt == 0)
|
|
|
|
panic("arptfree");
|
|
|
|
if (rt->rt_refcnt > 0 && (sdl = SDL(rt->rt_gateway)) &&
|
|
|
|
sdl->sdl_family == AF_LINK) {
|
|
|
|
sdl->sdl_alen = 0;
|
2003-02-04 05:28:08 +00:00
|
|
|
la->la_preempt = la->la_asked = 0;
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_LOCK(rt); /* XXX needed or move higher? */
|
1994-05-24 10:09:53 +00:00
|
|
|
rt->rt_flags &= ~RTF_REJECT;
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_UNLOCK(rt);
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
rtrequest(RTM_DELETE, rt_key(rt), (struct sockaddr *)0, rt_mask(rt),
|
|
|
|
0, (struct rtentry **)0);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Lookup or enter a new address in arptab.
|
|
|
|
*/
|
|
|
|
static struct llinfo_arp *
|
|
|
|
arplookup(addr, create, proxy)
|
|
|
|
u_long addr;
|
|
|
|
int create, proxy;
|
|
|
|
{
|
2004-03-14 00:44:11 +00:00
|
|
|
struct rtentry *rt;
|
2003-10-04 03:44:50 +00:00
|
|
|
struct sockaddr_inarp sin;
|
1994-11-02 00:58:29 +00:00
|
|
|
const char *why = 0;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
2003-10-04 03:44:50 +00:00
|
|
|
bzero(&sin, sizeof(sin));
|
|
|
|
sin.sin_len = sizeof(sin);
|
|
|
|
sin.sin_family = AF_INET;
|
1994-05-24 10:09:53 +00:00
|
|
|
sin.sin_addr.s_addr = addr;
|
2003-10-04 03:44:50 +00:00
|
|
|
if (proxy)
|
|
|
|
sin.sin_other = SIN_PROXY;
|
1994-12-13 22:32:45 +00:00
|
|
|
rt = rtalloc1((struct sockaddr *)&sin, create, 0UL);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (rt == 0)
|
|
|
|
return (0);
|
1994-11-02 00:58:29 +00:00
|
|
|
|
1995-12-09 16:06:54 +00:00
|
|
|
if (rt->rt_flags & RTF_GATEWAY)
|
1994-11-02 00:58:29 +00:00
|
|
|
why = "host is not on local network";
|
1995-12-09 16:06:54 +00:00
|
|
|
else if ((rt->rt_flags & RTF_LLINFO) == 0)
|
1994-11-02 00:58:29 +00:00
|
|
|
why = "could not allocate llinfo";
|
1995-12-09 16:06:54 +00:00
|
|
|
else if (rt->rt_gateway->sa_family != AF_LINK)
|
1994-11-02 00:58:29 +00:00
|
|
|
why = "gateway route is not ours";
|
|
|
|
|
2003-09-23 16:39:31 +00:00
|
|
|
if (why) {
|
2003-10-04 03:44:50 +00:00
|
|
|
#define ISDYNCLONE(_rt) \
|
|
|
|
(((_rt)->rt_flags & (RTF_STATIC | RTF_WASCLONED)) == RTF_WASCLONED)
|
|
|
|
if (create)
|
2003-09-23 16:39:31 +00:00
|
|
|
log(LOG_DEBUG, "arplookup %s failed: %s\n",
|
|
|
|
inet_ntoa(sin.sin_addr), why);
|
2003-10-04 03:44:50 +00:00
|
|
|
/*
|
|
|
|
* If there are no references to this Layer 2 route,
|
|
|
|
* and it is a cloned route, and not static, and
|
|
|
|
* arplookup() is creating the route, then purge
|
|
|
|
* it from the routing table as it is probably bogus.
|
|
|
|
*/
|
2003-10-30 23:02:51 +00:00
|
|
|
if (rt->rt_refcnt == 1 && ISDYNCLONE(rt))
|
|
|
|
rtexpunge(rt);
|
|
|
|
RTFREE_LOCKED(rt);
|
2003-09-23 16:39:31 +00:00
|
|
|
return (0);
|
2003-10-04 03:44:50 +00:00
|
|
|
#undef ISDYNCLONE
|
|
|
|
} else {
|
2003-11-08 23:36:32 +00:00
|
|
|
RT_REMREF(rt);
|
2003-10-04 03:44:50 +00:00
|
|
|
RT_UNLOCK(rt);
|
|
|
|
return ((struct llinfo_arp *)rt->rt_llinfo);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1994-12-22 21:56:22 +00:00
|
|
|
void
|
2001-10-14 20:17:53 +00:00
|
|
|
arp_ifinit(ifp, ifa)
|
|
|
|
struct ifnet *ifp;
|
1994-12-22 21:56:22 +00:00
|
|
|
struct ifaddr *ifa;
|
|
|
|
{
|
1997-05-14 16:39:52 +00:00
|
|
|
if (ntohl(IA_SIN(ifa)->sin_addr.s_addr) != INADDR_ANY)
|
2001-10-14 20:17:53 +00:00
|
|
|
arprequest(ifp, &IA_SIN(ifa)->sin_addr,
|
|
|
|
&IA_SIN(ifa)->sin_addr, IF_LLADDR(ifp));
|
1994-12-22 21:56:22 +00:00
|
|
|
ifa->ifa_rtrequest = arp_rtrequest;
|
|
|
|
ifa->ifa_flags |= RTF_CLONING;
|
|
|
|
}
|
Lock down the network interface queues. The queue mutex must be obtained
before adding/removing packets from the queue. Also, the if_obytes and
if_omcasts fields should only be manipulated under protection of the mutex.
IF_ENQUEUE, IF_PREPEND, and IF_DEQUEUE perform all necessary locking on
the queue. An IF_LOCK macro is provided, as well as the old (mutex-less)
versions of the macros in the form _IF_ENQUEUE, _IF_QFULL, for code which
needs them, but their use is discouraged.
Two new macros are introduced: IF_DRAIN() to drain a queue, and IF_HANDOFF,
which takes care of locking/enqueue, and also statistics updating/start
if necessary.
2000-11-25 07:35:38 +00:00
|
|
|
|
|
|
|
static void
|
|
|
|
arp_init(void)
|
|
|
|
{
|
|
|
|
|
|
|
|
arpintrq.ifq_maxlen = 50;
|
2002-04-04 21:03:38 +00:00
|
|
|
mtx_init(&arpintrq.ifq_mtx, "arp_inq", NULL, MTX_DEF);
|
2002-06-20 01:27:40 +00:00
|
|
|
LIST_INIT(&llinfo_arp);
|
2003-10-04 03:44:50 +00:00
|
|
|
callout_init(&arp_callout, CALLOUT_MPSAFE);
|
2003-11-08 22:28:40 +00:00
|
|
|
netisr_register(NETISR_ARP, arpintr, &arpintrq, NETISR_MPSAFE);
|
2004-04-25 12:50:14 +00:00
|
|
|
callout_reset(&arp_callout, hz, arptimer, NULL);
|
Lock down the network interface queues. The queue mutex must be obtained
before adding/removing packets from the queue. Also, the if_obytes and
if_omcasts fields should only be manipulated under protection of the mutex.
IF_ENQUEUE, IF_PREPEND, and IF_DEQUEUE perform all necessary locking on
the queue. An IF_LOCK macro is provided, as well as the old (mutex-less)
versions of the macros in the form _IF_ENQUEUE, _IF_QFULL, for code which
needs them, but their use is discouraged.
Two new macros are introduced: IF_DRAIN() to drain a queue, and IF_HANDOFF,
which takes care of locking/enqueue, and also statistics updating/start
if necessary.
2000-11-25 07:35:38 +00:00
|
|
|
}
|
|
|
|
SYSINIT(arp, SI_SUB_PROTO_DOMAIN, SI_ORDER_ANY, arp_init, 0);
|