2009-03-18 18:14:29 +03:00
|
|
|
/* $NetBSD: nd6_nbr.c,v 1.91 2009/03/18 15:14:31 cegger Exp $ */
|
2001-02-23 11:02:41 +03:00
|
|
|
/* $KAME: nd6_nbr.c,v 1.61 2001/02/10 16:06:14 jinmei Exp $ */
|
1999-07-04 01:24:45 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2000-05-19 05:40:18 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* 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.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2000-05-19 05:40:18 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT 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 PROJECT 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.
|
|
|
|
*/
|
|
|
|
|
2001-11-13 03:56:55 +03:00
|
|
|
#include <sys/cdefs.h>
|
2009-03-18 18:14:29 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: nd6_nbr.c,v 1.91 2009/03/18 15:14:31 cegger Exp $");
|
2001-11-13 03:56:55 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#include "opt_inet.h"
|
1999-07-10 02:57:15 +04:00
|
|
|
#include "opt_ipsec.h"
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/socket.h>
|
2008-04-24 15:38:36 +04:00
|
|
|
#include <sys/socketvar.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <sys/sockio.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <sys/syslog.h>
|
|
|
|
#include <sys/queue.h>
|
2000-03-24 07:09:04 +03:00
|
|
|
#include <sys/callout.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/if_types.h>
|
|
|
|
#include <net/if_dl.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet6/in6_var.h>
|
2006-03-06 02:47:08 +03:00
|
|
|
#include <netinet6/in6_ifattach.h>
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/ip6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/ip6_var.h>
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
#include <netinet6/scope6_var.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/nd6.h>
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/icmp6.h>
|
2008-04-15 07:57:04 +04:00
|
|
|
#include <netinet6/icmp6_private.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-03-01 15:49:27 +03:00
|
|
|
#ifdef IPSEC
|
|
|
|
#include <netinet6/ipsec.h>
|
|
|
|
#endif
|
|
|
|
|
2006-05-18 13:05:49 +04:00
|
|
|
#include "carp.h"
|
|
|
|
#if NCARP > 0
|
|
|
|
#include <netinet/ip_carp.h>
|
|
|
|
#endif
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <net/net_osdep.h>
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct dadq;
|
2007-03-16 02:39:51 +03:00
|
|
|
static struct dadq *nd6_dad_find(struct ifaddr *);
|
|
|
|
static void nd6_dad_starttimer(struct dadq *, int);
|
|
|
|
static void nd6_dad_stoptimer(struct dadq *);
|
|
|
|
static void nd6_dad_timer(struct ifaddr *);
|
|
|
|
static void nd6_dad_ns_output(struct dadq *, struct ifaddr *);
|
|
|
|
static void nd6_dad_ns_input(struct ifaddr *);
|
|
|
|
static void nd6_dad_na_input(struct ifaddr *);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
static int dad_ignore_ns = 0; /* ignore NS in DAD - specwise incorrect*/
|
|
|
|
static int dad_maxtry = 15; /* max # of *tries* to transmit DAD packet */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
2006-03-03 17:07:06 +03:00
|
|
|
* Input a Neighbor Solicitation Message.
|
1999-06-28 10:36:47 +04:00
|
|
|
*
|
|
|
|
* Based on RFC 2461
|
2006-03-03 17:07:06 +03:00
|
|
|
* Based on RFC 2462 (duplicate address detection)
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_ns_input(struct mbuf *m, int off, int icmp6len)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct ifnet *ifp = m->m_pkthdr.rcvif;
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
2000-02-26 11:39:18 +03:00
|
|
|
struct nd_neighbor_solicit *nd_ns;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_addr saddr6 = ip6->ip6_src;
|
|
|
|
struct in6_addr daddr6 = ip6->ip6_dst;
|
2000-02-26 11:39:18 +03:00
|
|
|
struct in6_addr taddr6;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_addr myaddr6;
|
|
|
|
char *lladdr = NULL;
|
|
|
|
struct ifaddr *ifa;
|
|
|
|
int lladdrlen = 0;
|
|
|
|
int anycast = 0, proxy = 0, tentative = 0;
|
2002-06-09 01:22:29 +04:00
|
|
|
int router = ip6_forwarding;
|
1999-06-28 10:36:47 +04:00
|
|
|
int tlladdr;
|
|
|
|
union nd_opts ndopts;
|
2007-08-07 08:35:42 +04:00
|
|
|
const struct sockaddr_dl *proxydl = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-02-07 11:59:47 +03:00
|
|
|
IP6_EXTHDR_GET(nd_ns, struct nd_neighbor_solicit *, m, off, icmp6len);
|
|
|
|
if (nd_ns == NULL) {
|
2008-04-15 07:57:04 +04:00
|
|
|
ICMP6_STATINC(ICMP6_STAT_TOOSHORT);
|
2001-02-07 11:59:47 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *); /* adjust pointer for safety */
|
|
|
|
taddr6 = nd_ns->nd_ns_target;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
if (in6_setscope(&taddr6, ifp, NULL) != 0)
|
|
|
|
goto bad;
|
2001-02-07 11:59:47 +03:00
|
|
|
|
|
|
|
if (ip6->ip6_hlim != 255) {
|
|
|
|
nd6log((LOG_ERR,
|
|
|
|
"nd6_ns_input: invalid hlim (%d) from %s to %s on %s\n",
|
|
|
|
ip6->ip6_hlim, ip6_sprintf(&ip6->ip6_src),
|
|
|
|
ip6_sprintf(&ip6->ip6_dst), if_name(ifp)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&saddr6)) {
|
2006-03-03 17:07:06 +03:00
|
|
|
/* dst has to be a solicited node multicast address. */
|
2002-06-09 01:22:29 +04:00
|
|
|
/* don't check ifindex portion */
|
|
|
|
if (daddr6.s6_addr16[0] == IPV6_ADDR_INT16_MLL &&
|
|
|
|
daddr6.s6_addr32[1] == 0 &&
|
|
|
|
daddr6.s6_addr32[2] == IPV6_ADDR_INT32_ONE &&
|
|
|
|
daddr6.s6_addr8[12] == 0xff) {
|
2001-10-17 14:55:09 +04:00
|
|
|
; /* good */
|
1999-06-28 10:36:47 +04:00
|
|
|
} else {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: bad DAD packet "
|
2002-06-09 01:22:29 +04:00
|
|
|
"(wrong ip6 dst)\n"));
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
2008-07-31 22:01:36 +04:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Make sure the source address is from a neighbor's address.
|
|
|
|
*/
|
2008-07-31 22:24:07 +04:00
|
|
|
if (in6ifa_ifplocaladdr(ifp, &saddr6) == NULL) {
|
2008-07-31 22:01:36 +04:00
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: "
|
|
|
|
"NS packet from non-neighbor\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2008-07-31 22:01:36 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_IS_ADDR_MULTICAST(&taddr6)) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: bad NS target (multicast)\n"));
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
icmp6len -= sizeof(*nd_ns);
|
|
|
|
nd6_option_init(nd_ns + 1, icmp6len, &ndopts);
|
|
|
|
if (nd6_options(&ndopts) < 0) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO,
|
|
|
|
"nd6_ns_input: invalid ND option, ignored\n"));
|
|
|
|
/* nd6_options have incremented stats */
|
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ndopts.nd_opts_src_lladdr) {
|
2001-10-17 14:55:09 +04:00
|
|
|
lladdr = (char *)(ndopts.nd_opts_src_lladdr + 1);
|
1999-06-28 10:36:47 +04:00
|
|
|
lladdrlen = ndopts.nd_opts_src_lladdr->nd_opt_len << 3;
|
|
|
|
}
|
2002-06-09 18:43:10 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&ip6->ip6_src) && lladdr) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: bad DAD packet "
|
|
|
|
"(link-layer address option)\n"));
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Attaching target link-layer address to the NA?
|
|
|
|
* (RFC 2461 7.2.4)
|
|
|
|
*
|
2006-03-06 02:47:08 +03:00
|
|
|
* NS IP dst is multicast MUST add
|
|
|
|
* Otherwise MAY be omitted
|
1999-06-28 10:36:47 +04:00
|
|
|
*
|
2006-03-06 02:47:08 +03:00
|
|
|
* In this implementation, we omit the target link-layer address
|
|
|
|
* in the "MAY" case.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
#if 0 /* too much! */
|
|
|
|
ifa = (struct ifaddr *)in6ifa_ifpwithaddr(ifp, &daddr6);
|
|
|
|
if (ifa && (((struct in6_ifaddr *)ifa)->ia6_flags & IN6_IFF_ANYCAST))
|
|
|
|
tlladdr = 0;
|
|
|
|
else
|
|
|
|
#endif
|
|
|
|
if (!IN6_IS_ADDR_MULTICAST(&daddr6))
|
|
|
|
tlladdr = 0;
|
|
|
|
else
|
|
|
|
tlladdr = 1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Target address (taddr6) must be either:
|
|
|
|
* (1) Valid unicast/anycast address for my receiving interface,
|
|
|
|
* (2) Unicast address for which I'm offering proxy service, or
|
|
|
|
* (3) "tentative" address on which DAD is being performed.
|
|
|
|
*/
|
|
|
|
/* (1) and (3) check. */
|
2006-05-18 13:05:49 +04:00
|
|
|
#if NCARP > 0
|
|
|
|
if (ifp->if_carp && ifp->if_type != IFT_CARP)
|
|
|
|
ifa = carp_iamatch6(ifp->if_carp, &taddr6);
|
|
|
|
else
|
|
|
|
ifa = NULL;
|
|
|
|
if (!ifa)
|
|
|
|
ifa = (struct ifaddr *)in6ifa_ifpwithaddr(ifp, &taddr6);
|
|
|
|
#else
|
1999-06-28 10:36:47 +04:00
|
|
|
ifa = (struct ifaddr *)in6ifa_ifpwithaddr(ifp, &taddr6);
|
2006-05-18 13:05:49 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* (2) check. */
|
2006-03-06 02:47:08 +03:00
|
|
|
if (ifa == NULL) {
|
1999-06-28 10:36:47 +04:00
|
|
|
struct rtentry *rt;
|
|
|
|
struct sockaddr_in6 tsin6;
|
|
|
|
|
2007-11-10 03:14:31 +03:00
|
|
|
sockaddr_in6_init(&tsin6, &taddr6, 0, 0, 0);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-02-28 15:08:21 +03:00
|
|
|
rt = rtalloc1((struct sockaddr *)&tsin6, 0);
|
2000-02-26 11:39:18 +03:00
|
|
|
if (rt && (rt->rt_flags & RTF_ANNOUNCE) != 0 &&
|
|
|
|
rt->rt_gateway->sa_family == AF_LINK) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2000-02-26 11:39:18 +03:00
|
|
|
* proxy NDP for single entry
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2000-02-26 11:39:18 +03:00
|
|
|
ifa = (struct ifaddr *)in6ifa_ifpforlinklocal(ifp,
|
|
|
|
IN6_IFF_NOTREADY|IN6_IFF_ANYCAST);
|
|
|
|
if (ifa) {
|
1999-06-28 10:36:47 +04:00
|
|
|
proxy = 1;
|
2007-08-07 08:35:42 +04:00
|
|
|
proxydl = satocsdl(rt->rt_gateway);
|
2002-06-09 01:22:29 +04:00
|
|
|
router = 0; /* XXX */
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2000-02-26 11:39:18 +03:00
|
|
|
if (rt)
|
|
|
|
rtfree(rt);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2006-03-06 02:47:08 +03:00
|
|
|
if (ifa == NULL) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2006-02-25 03:58:34 +03:00
|
|
|
* We've got an NS packet, and we don't have that address
|
1999-06-28 10:36:47 +04:00
|
|
|
* assigned for us. We MUST silently ignore it.
|
|
|
|
* See RFC2461 7.2.3.
|
|
|
|
*/
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
myaddr6 = *IFA_IN6(ifa);
|
1999-06-28 10:36:47 +04:00
|
|
|
anycast = ((struct in6_ifaddr *)ifa)->ia6_flags & IN6_IFF_ANYCAST;
|
|
|
|
tentative = ((struct in6_ifaddr *)ifa)->ia6_flags & IN6_IFF_TENTATIVE;
|
|
|
|
if (((struct in6_ifaddr *)ifa)->ia6_flags & IN6_IFF_DUPLICATED)
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (lladdr && ((ifp->if_addrlen + 2 + 7) & ~7) != lladdrlen) {
|
2002-06-09 01:22:29 +04:00
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: lladdrlen mismatch for %s "
|
1999-06-28 10:36:47 +04:00
|
|
|
"(if %d, NS packet %d)\n",
|
2002-06-09 01:22:29 +04:00
|
|
|
ip6_sprintf(&taddr6), ifp->if_addrlen, lladdrlen - 2));
|
2001-02-07 11:59:47 +03:00
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&myaddr6, &saddr6)) {
|
2002-06-09 01:22:29 +04:00
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: duplicate IP6 address %s\n",
|
2001-10-17 14:55:09 +04:00
|
|
|
ip6_sprintf(&saddr6)));
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We have neighbor solicitation packet, with target address equals to
|
|
|
|
* one of my tentative address.
|
|
|
|
*
|
|
|
|
* src addr how to process?
|
|
|
|
* --- ---
|
|
|
|
* multicast of course, invalid (rejected in ip6_input)
|
|
|
|
* unicast somebody is doing address resolution -> ignore
|
|
|
|
* unspec dup address detection
|
|
|
|
*
|
|
|
|
* The processing is defined in RFC 2462.
|
|
|
|
*/
|
|
|
|
if (tentative) {
|
|
|
|
/*
|
|
|
|
* If source address is unspecified address, it is for
|
2006-03-03 17:07:06 +03:00
|
|
|
* duplicate address detection.
|
1999-06-28 10:36:47 +04:00
|
|
|
*
|
|
|
|
* If not, the packet is for addess resolution;
|
|
|
|
* silently ignore it.
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&saddr6))
|
|
|
|
nd6_dad_ns_input(ifa);
|
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the source address is unspecified address, entries must not
|
|
|
|
* be created or updated.
|
|
|
|
* It looks that sender is performing DAD. Output NA toward
|
|
|
|
* all-node multicast address, to tell the sender that I'm using
|
|
|
|
* the address.
|
|
|
|
* S bit ("solicited") must be zero.
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&saddr6)) {
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct in6_addr in6_all;
|
|
|
|
|
|
|
|
in6_all = in6addr_linklocal_allnodes;
|
|
|
|
if (in6_setscope(&in6_all, ifp, NULL) != 0)
|
|
|
|
goto bad;
|
|
|
|
nd6_na_output(ifp, &in6_all, &taddr6,
|
2002-06-09 01:22:29 +04:00
|
|
|
((anycast || proxy || !tlladdr) ? 0 : ND_NA_FLAG_OVERRIDE) |
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
(ip6_forwarding ? ND_NA_FLAG_ROUTER : 0),
|
2007-08-07 08:35:42 +04:00
|
|
|
tlladdr, (const struct sockaddr *)proxydl);
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
1999-07-31 22:41:15 +04:00
|
|
|
nd6_cache_lladdr(ifp, &saddr6, lladdr, lladdrlen, ND_NEIGHBOR_SOLICIT, 0);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
nd6_na_output(ifp, &saddr6, &taddr6,
|
2002-06-09 01:22:29 +04:00
|
|
|
((anycast || proxy || !tlladdr) ? 0 : ND_NA_FLAG_OVERRIDE) |
|
|
|
|
(router ? ND_NA_FLAG_ROUTER : 0) | ND_NA_FLAG_SOLICITED,
|
2007-08-07 08:35:42 +04:00
|
|
|
tlladdr, (const struct sockaddr *)proxydl);
|
2000-02-26 11:39:18 +03:00
|
|
|
freeit:
|
|
|
|
m_freem(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR, "nd6_ns_input: src=%s\n", ip6_sprintf(&saddr6)));
|
|
|
|
nd6log((LOG_ERR, "nd6_ns_input: dst=%s\n", ip6_sprintf(&daddr6)));
|
|
|
|
nd6log((LOG_ERR, "nd6_ns_input: tgt=%s\n", ip6_sprintf(&taddr6)));
|
2008-04-15 07:57:04 +04:00
|
|
|
ICMP6_STATINC(ICMP6_STAT_BADNS);
|
2000-02-26 11:39:18 +03:00
|
|
|
m_freem(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2006-03-03 17:07:06 +03:00
|
|
|
* Output a Neighbor Solicitation Message. Caller specifies:
|
1999-06-28 10:36:47 +04:00
|
|
|
* - ICMP6 header source IP6 address
|
|
|
|
* - ND6 header target IP6 address
|
|
|
|
* - ND6 header source datalink address
|
|
|
|
*
|
|
|
|
* Based on RFC 2461
|
2006-03-03 17:07:06 +03:00
|
|
|
* Based on RFC 2462 (duplicate address detection)
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_ns_output(struct ifnet *ifp, const struct in6_addr *daddr6,
|
|
|
|
const struct in6_addr *taddr6,
|
|
|
|
struct llinfo_nd6 *ln, /* for source address determination */
|
|
|
|
int dad /* duplicate address detection */)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
struct nd_neighbor_solicit *nd_ns;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct in6_addr *src, src_in;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ip6_moptions im6o;
|
|
|
|
int icmp6len;
|
2000-02-07 08:42:28 +03:00
|
|
|
int maxlen;
|
Use malloc(9) for sockaddrs instead of pool(9), and remove dom_sa_pool
and dom_sa_len members from struct domain. Pools of fixed-size
objects are too rigid for sockaddr_dls, whose size can vary over
a wide range.
Return sockaddr_dl to its "historical" size. Now that I'm using
malloc(9) instead of pool(9) to allocate sockaddr_dl, I can create
a sockaddr_dl of any size in the kernel, so expanding sockaddr_dl
is useless.
Avoid using sizeof(struct sockaddr_dl) in the kernel.
Introduce sockaddr_dl_alloc() for allocating & initializing an
arbitrary sockaddr_dl on the heap.
Add an argument, the sockaddr length, to sockaddr_alloc(),
sockaddr_copy(), and sockaddr_dl_setaddr().
Constify: LLADDR() -> CLLADDR().
Where the kernel overwrites LLADDR(), use sockaddr_dl_setaddr(),
instead. Used properly, sockaddr_dl_setaddr() will not overrun
the end of the sockaddr.
2007-08-30 06:17:34 +04:00
|
|
|
const void *mac;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
struct route ro;
|
2002-06-09 01:22:29 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_IS_ADDR_MULTICAST(taddr6))
|
|
|
|
return;
|
|
|
|
|
2007-11-16 20:51:51 +03:00
|
|
|
memset(&ro, 0, sizeof(ro));
|
|
|
|
|
2000-02-07 08:42:28 +03:00
|
|
|
/* estimate the size of message */
|
|
|
|
maxlen = sizeof(*ip6) + sizeof(*nd_ns);
|
|
|
|
maxlen += (sizeof(struct nd_opt_hdr) + ifp->if_addrlen + 7) & ~7;
|
|
|
|
#ifdef DIAGNOSTIC
|
2001-10-16 10:24:44 +04:00
|
|
|
if (max_linkhdr + maxlen >= MCLBYTES) {
|
2000-02-07 08:42:28 +03:00
|
|
|
printf("nd6_ns_output: max_linkhdr + maxlen >= MCLBYTES "
|
|
|
|
"(%d + %d > %d)\n", max_linkhdr, maxlen, MCLBYTES);
|
2001-10-16 10:24:44 +04:00
|
|
|
panic("nd6_ns_output: insufficient MCLBYTES");
|
|
|
|
/* NOTREACHED */
|
2000-02-07 08:42:28 +03:00
|
|
|
}
|
2001-10-16 10:24:44 +04:00
|
|
|
#endif
|
2000-02-07 08:42:28 +03:00
|
|
|
|
|
|
|
MGETHDR(m, M_DONTWAIT, MT_DATA);
|
|
|
|
if (m && max_linkhdr + maxlen >= MHLEN) {
|
|
|
|
MCLGET(m, M_DONTWAIT);
|
|
|
|
if ((m->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(m);
|
|
|
|
m = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (m == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
2001-10-17 14:55:09 +04:00
|
|
|
m->m_pkthdr.rcvif = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (daddr6 == NULL || IN6_IS_ADDR_MULTICAST(daddr6)) {
|
|
|
|
m->m_flags |= M_MCAST;
|
|
|
|
im6o.im6o_multicast_ifp = ifp;
|
|
|
|
im6o.im6o_multicast_hlim = 255;
|
|
|
|
im6o.im6o_multicast_loop = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
icmp6len = sizeof(*nd_ns);
|
|
|
|
m->m_pkthdr.len = m->m_len = sizeof(*ip6) + icmp6len;
|
2001-10-17 14:55:09 +04:00
|
|
|
m->m_data += max_linkhdr; /* or MH_ALIGN() equivalent? */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* fill neighbor solicitation packet */
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
ip6->ip6_flow = 0;
|
1999-12-15 09:28:43 +03:00
|
|
|
ip6->ip6_vfc &= ~IPV6_VERSION_MASK;
|
|
|
|
ip6->ip6_vfc |= IPV6_VERSION;
|
1999-06-28 10:36:47 +04:00
|
|
|
/* ip6->ip6_plen will be set later */
|
|
|
|
ip6->ip6_nxt = IPPROTO_ICMPV6;
|
|
|
|
ip6->ip6_hlim = 255;
|
|
|
|
if (daddr6)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
ip6->ip6_dst = *daddr6;
|
1999-06-28 10:36:47 +04:00
|
|
|
else {
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
ip6->ip6_dst.s6_addr16[0] = IPV6_ADDR_INT16_MLL;
|
|
|
|
ip6->ip6_dst.s6_addr16[1] = 0;
|
|
|
|
ip6->ip6_dst.s6_addr32[1] = 0;
|
|
|
|
ip6->ip6_dst.s6_addr32[2] = IPV6_ADDR_INT32_ONE;
|
|
|
|
ip6->ip6_dst.s6_addr32[3] = taddr6->s6_addr32[3];
|
|
|
|
ip6->ip6_dst.s6_addr8[12] = 0xff;
|
|
|
|
if (in6_setscope(&ip6->ip6_dst, ifp, NULL) != 0)
|
|
|
|
goto bad;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
if (!dad) {
|
|
|
|
/*
|
|
|
|
* RFC2461 7.2.2:
|
|
|
|
* "If the source address of the packet prompting the
|
|
|
|
* solicitation is the same as one of the addresses assigned
|
|
|
|
* to the outgoing interface, that address SHOULD be placed
|
|
|
|
* in the IP Source Address of the outgoing solicitation.
|
|
|
|
* Otherwise, any one of the addresses assigned to the
|
|
|
|
* interface should be used."
|
|
|
|
*
|
|
|
|
* We use the source address for the prompting packet
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
* (hsrc), if:
|
|
|
|
* - hsrc is given from the caller (by giving "ln"), and
|
|
|
|
* - hsrc belongs to the outgoing interface.
|
2002-06-09 01:22:29 +04:00
|
|
|
* Otherwise, we perform the source address selection as usual.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2001-10-17 14:55:09 +04:00
|
|
|
struct ip6_hdr *hip6; /* hold ip6 */
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct in6_addr *hsrc = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (ln && ln->ln_hold) {
|
2006-03-06 02:47:08 +03:00
|
|
|
/*
|
|
|
|
* assuming every packet in ln_hold has the same IP
|
|
|
|
* header
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
hip6 = mtod(ln->ln_hold, struct ip6_hdr *);
|
|
|
|
/* XXX pullup? */
|
|
|
|
if (sizeof(*hip6) < ln->ln_hold->m_len)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
hsrc = &hip6->ip6_src;
|
1999-06-28 10:36:47 +04:00
|
|
|
else
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
hsrc = NULL;
|
|
|
|
}
|
|
|
|
if (hsrc && in6ifa_ifpwithaddr(ifp, hsrc))
|
|
|
|
src = hsrc;
|
1999-06-28 10:36:47 +04:00
|
|
|
else {
|
2002-06-09 01:22:29 +04:00
|
|
|
int error;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct sockaddr_in6 dst_sa;
|
|
|
|
|
2007-11-10 03:14:31 +03:00
|
|
|
sockaddr_in6_init(&dst_sa, &ip6->ip6_dst, 0, 0, 0);
|
2002-06-09 01:22:29 +04:00
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
src = in6_selectsrc(&dst_sa, NULL,
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
NULL, &ro, NULL, NULL, &error);
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
if (src == NULL) {
|
2002-06-09 01:22:29 +04:00
|
|
|
nd6log((LOG_DEBUG,
|
|
|
|
"nd6_ns_output: source can't be "
|
|
|
|
"determined: dst=%s, error=%d\n",
|
|
|
|
ip6_sprintf(&dst_sa.sin6_addr), error));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* Source address for DAD packet must always be IPv6
|
|
|
|
* unspecified address. (0::0)
|
2002-06-09 01:22:29 +04:00
|
|
|
* We actually don't have to 0-clear the address (we did it
|
|
|
|
* above), but we do so here explicitly to make the intention
|
|
|
|
* clearer.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
bzero(&src_in, sizeof(src_in));
|
|
|
|
src = &src_in;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
ip6->ip6_src = *src;
|
1999-06-28 10:36:47 +04:00
|
|
|
nd_ns = (struct nd_neighbor_solicit *)(ip6 + 1);
|
|
|
|
nd_ns->nd_ns_type = ND_NEIGHBOR_SOLICIT;
|
|
|
|
nd_ns->nd_ns_code = 0;
|
|
|
|
nd_ns->nd_ns_reserved = 0;
|
|
|
|
nd_ns->nd_ns_target = *taddr6;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
in6_clearscope(&nd_ns->nd_ns_target); /* XXX */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Add source link-layer address option.
|
|
|
|
*
|
|
|
|
* spec implementation
|
|
|
|
* --- ---
|
|
|
|
* DAD packet MUST NOT do not add the option
|
|
|
|
* there's no link layer address:
|
|
|
|
* impossible do not add the option
|
|
|
|
* there's link layer address:
|
|
|
|
* Multicast NS MUST add one add the option
|
|
|
|
* Unicast NS SHOULD add one add the option
|
|
|
|
*/
|
|
|
|
if (!dad && (mac = nd6_ifptomac(ifp))) {
|
|
|
|
int optlen = sizeof(struct nd_opt_hdr) + ifp->if_addrlen;
|
|
|
|
struct nd_opt_hdr *nd_opt = (struct nd_opt_hdr *)(nd_ns + 1);
|
1999-09-20 01:31:33 +04:00
|
|
|
/* 8 byte alignments... */
|
|
|
|
optlen = (optlen + 7) & ~7;
|
2002-06-09 18:43:10 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
m->m_pkthdr.len += optlen;
|
|
|
|
m->m_len += optlen;
|
|
|
|
icmp6len += optlen;
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)nd_opt, optlen);
|
1999-06-28 10:36:47 +04:00
|
|
|
nd_opt->nd_opt_type = ND_OPT_SOURCE_LINKADDR;
|
|
|
|
nd_opt->nd_opt_len = optlen >> 3;
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy(mac, (void *)(nd_opt + 1), ifp->if_addrlen);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2003-09-06 03:20:48 +04:00
|
|
|
ip6->ip6_plen = htons((u_int16_t)icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
nd_ns->nd_ns_cksum = 0;
|
2002-06-09 01:22:29 +04:00
|
|
|
nd_ns->nd_ns_cksum =
|
|
|
|
in6_cksum(m, IPPROTO_ICMPV6, sizeof(*ip6), icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
ip6_output(m, NULL, &ro, dad ? IPV6_UNSPECSRC : 0, &im6o, NULL, NULL);
|
2001-10-18 11:44:33 +04:00
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_msg);
|
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_neighborsolicit);
|
2008-04-15 07:57:04 +04:00
|
|
|
ICMP6_STATINC(ICMP6_STAT_OUTHIST + ND_NEIGHBOR_SOLICIT);
|
2001-10-18 11:44:33 +04:00
|
|
|
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
rtcache_free(&ro);
|
2001-10-18 11:44:33 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
rtcache_free(&ro);
|
2001-10-18 11:44:33 +04:00
|
|
|
m_freem(m);
|
|
|
|
return;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Neighbor advertisement input handling.
|
|
|
|
*
|
|
|
|
* Based on RFC 2461
|
2006-03-03 17:07:06 +03:00
|
|
|
* Based on RFC 2462 (duplicate address detection)
|
2000-02-26 11:39:18 +03:00
|
|
|
*
|
|
|
|
* the following items are not implemented yet:
|
|
|
|
* - proxy advertisement delay rule (RFC2461 7.2.8, last paragraph, SHOULD)
|
|
|
|
* - anycast advertisement delay rule (RFC2461 7.2.7, SHOULD)
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_na_input(struct mbuf *m, int off, int icmp6len)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct ifnet *ifp = m->m_pkthdr.rcvif;
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
2000-02-26 11:39:18 +03:00
|
|
|
struct nd_neighbor_advert *nd_na;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_addr saddr6 = ip6->ip6_src;
|
|
|
|
struct in6_addr daddr6 = ip6->ip6_dst;
|
2000-02-26 11:39:18 +03:00
|
|
|
struct in6_addr taddr6;
|
|
|
|
int flags;
|
|
|
|
int is_router;
|
|
|
|
int is_solicited;
|
|
|
|
int is_override;
|
1999-06-28 10:36:47 +04:00
|
|
|
char *lladdr = NULL;
|
|
|
|
int lladdrlen = 0;
|
|
|
|
struct ifaddr *ifa;
|
|
|
|
struct llinfo_nd6 *ln;
|
|
|
|
struct rtentry *rt;
|
|
|
|
struct sockaddr_dl *sdl;
|
|
|
|
union nd_opts ndopts;
|
|
|
|
|
|
|
|
if (ip6->ip6_hlim != 255) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
|
|
|
"nd6_na_input: invalid hlim (%d) from %s to %s on %s\n",
|
|
|
|
ip6->ip6_hlim, ip6_sprintf(&ip6->ip6_src),
|
|
|
|
ip6_sprintf(&ip6->ip6_dst), if_name(ifp)));
|
|
|
|
goto bad;
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
IP6_EXTHDR_GET(nd_na, struct nd_neighbor_advert *, m, off, icmp6len);
|
|
|
|
if (nd_na == NULL) {
|
2008-04-15 07:57:04 +04:00
|
|
|
ICMP6_STATINC(ICMP6_STAT_TOOSHORT);
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
}
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
flags = nd_na->nd_na_flags_reserved;
|
|
|
|
is_router = ((flags & ND_NA_FLAG_ROUTER) != 0);
|
|
|
|
is_solicited = ((flags & ND_NA_FLAG_SOLICITED) != 0);
|
|
|
|
is_override = ((flags & ND_NA_FLAG_OVERRIDE) != 0);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
taddr6 = nd_na->nd_na_target;
|
|
|
|
if (in6_setscope(&taddr6, ifp, NULL))
|
|
|
|
return; /* XXX: impossible */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&taddr6)) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-06-28 10:36:47 +04:00
|
|
|
"nd6_na_input: invalid target address %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
ip6_sprintf(&taddr6)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-06-09 01:22:29 +04:00
|
|
|
if (is_solicited && IN6_IS_ADDR_MULTICAST(&daddr6)) {
|
|
|
|
nd6log((LOG_ERR,
|
|
|
|
"nd6_na_input: a solicited adv is multicasted\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
icmp6len -= sizeof(*nd_na);
|
|
|
|
nd6_option_init(nd_na + 1, icmp6len, &ndopts);
|
|
|
|
if (nd6_options(&ndopts) < 0) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO,
|
|
|
|
"nd6_na_input: invalid ND option, ignored\n"));
|
|
|
|
/* nd6_options have incremented stats */
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (ndopts.nd_opts_tgt_lladdr) {
|
|
|
|
lladdr = (char *)(ndopts.nd_opts_tgt_lladdr + 1);
|
|
|
|
lladdrlen = ndopts.nd_opts_tgt_lladdr->nd_opt_len << 3;
|
|
|
|
}
|
|
|
|
|
|
|
|
ifa = (struct ifaddr *)in6ifa_ifpwithaddr(ifp, &taddr6);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Target address matches one of my interface address.
|
|
|
|
*
|
|
|
|
* If my address is tentative, this means that there's somebody
|
|
|
|
* already using the same address as mine. This indicates DAD failure.
|
|
|
|
* This is defined in RFC 2462.
|
|
|
|
*
|
|
|
|
* Otherwise, process as defined in RFC 2461.
|
|
|
|
*/
|
|
|
|
if (ifa
|
|
|
|
&& (((struct in6_ifaddr *)ifa)->ia6_flags & IN6_IFF_TENTATIVE)) {
|
|
|
|
nd6_dad_na_input(ifa);
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2001-10-17 14:55:09 +04:00
|
|
|
/* Just for safety, maybe unnecessary. */
|
1999-06-28 10:36:47 +04:00
|
|
|
if (ifa) {
|
|
|
|
log(LOG_ERR,
|
|
|
|
"nd6_na_input: duplicate IP6 address %s\n",
|
|
|
|
ip6_sprintf(&taddr6));
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2008-07-31 22:24:07 +04:00
|
|
|
/*
|
|
|
|
* Make sure the source address is from a neighbor's address.
|
|
|
|
*/
|
|
|
|
if (in6ifa_ifplocaladdr(ifp, &saddr6) == NULL) {
|
|
|
|
nd6log((LOG_INFO, "nd6_ns_input: "
|
|
|
|
"ND packet from non-neighbor\n"));
|
|
|
|
goto bad;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (lladdr && ((ifp->if_addrlen + 2 + 7) & ~7) != lladdrlen) {
|
2002-06-09 01:22:29 +04:00
|
|
|
nd6log((LOG_INFO, "nd6_na_input: lladdrlen mismatch for %s "
|
|
|
|
"(if %d, NA packet %d)\n", ip6_sprintf(&taddr6),
|
|
|
|
ifp->if_addrlen, lladdrlen - 2));
|
2001-02-07 11:59:47 +03:00
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2002-06-09 01:22:29 +04:00
|
|
|
* If no neighbor cache entry is found, NA SHOULD silently be
|
|
|
|
* discarded.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
rt = nd6_lookup(&taddr6, 0, ifp);
|
|
|
|
if ((rt == NULL) ||
|
|
|
|
((ln = (struct llinfo_nd6 *)rt->rt_llinfo) == NULL) ||
|
2007-08-07 08:35:42 +04:00
|
|
|
((sdl = satosdl(rt->rt_gateway)) == NULL))
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (ln->ln_state == ND6_LLINFO_INCOMPLETE) {
|
|
|
|
/*
|
|
|
|
* If the link-layer has address, and no lladdr option came,
|
|
|
|
* discard the packet.
|
|
|
|
*/
|
|
|
|
if (ifp->if_addrlen && !lladdr)
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Record link-layer address, and update the state.
|
|
|
|
*/
|
Use malloc(9) for sockaddrs instead of pool(9), and remove dom_sa_pool
and dom_sa_len members from struct domain. Pools of fixed-size
objects are too rigid for sockaddr_dls, whose size can vary over
a wide range.
Return sockaddr_dl to its "historical" size. Now that I'm using
malloc(9) instead of pool(9) to allocate sockaddr_dl, I can create
a sockaddr_dl of any size in the kernel, so expanding sockaddr_dl
is useless.
Avoid using sizeof(struct sockaddr_dl) in the kernel.
Introduce sockaddr_dl_alloc() for allocating & initializing an
arbitrary sockaddr_dl on the heap.
Add an argument, the sockaddr length, to sockaddr_alloc(),
sockaddr_copy(), and sockaddr_dl_setaddr().
Constify: LLADDR() -> CLLADDR().
Where the kernel overwrites LLADDR(), use sockaddr_dl_setaddr(),
instead. Used properly, sockaddr_dl_setaddr() will not overrun
the end of the sockaddr.
2007-08-30 06:17:34 +04:00
|
|
|
(void)sockaddr_dl_setaddr(sdl, sdl->sdl_len, lladdr,
|
|
|
|
ifp->if_addrlen);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (is_solicited) {
|
|
|
|
ln->ln_state = ND6_LLINFO_REACHABLE;
|
2001-02-11 10:00:03 +03:00
|
|
|
ln->ln_byhint = 0;
|
2003-06-27 12:41:08 +04:00
|
|
|
if (!ND6_LLINFO_PERMANENT(ln)) {
|
|
|
|
nd6_llinfo_settimer(ln,
|
|
|
|
(long)ND_IFINFO(rt->rt_ifp)->reachable * hz);
|
|
|
|
}
|
2001-02-23 11:02:41 +03:00
|
|
|
} else {
|
1999-06-28 10:36:47 +04:00
|
|
|
ln->ln_state = ND6_LLINFO_STALE;
|
2003-06-27 12:41:08 +04:00
|
|
|
nd6_llinfo_settimer(ln, (long)nd6_gctimer * hz);
|
2001-10-17 14:55:09 +04:00
|
|
|
}
|
|
|
|
if ((ln->ln_router = is_router) != 0) {
|
|
|
|
/*
|
|
|
|
* This means a router's state has changed from
|
|
|
|
* non-reachable to probably reachable, and might
|
|
|
|
* affect the status of associated prefixes..
|
|
|
|
*/
|
|
|
|
pfxlist_onlink_check();
|
2001-02-23 11:02:41 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
} else {
|
|
|
|
int llchange;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check if the link-layer address has changed or not.
|
|
|
|
*/
|
2006-03-06 02:47:08 +03:00
|
|
|
if (lladdr == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
llchange = 0;
|
|
|
|
else {
|
|
|
|
if (sdl->sdl_alen) {
|
2009-03-18 18:14:29 +03:00
|
|
|
if (memcmp(lladdr, CLLADDR(sdl), ifp->if_addrlen))
|
1999-06-28 10:36:47 +04:00
|
|
|
llchange = 1;
|
|
|
|
else
|
|
|
|
llchange = 0;
|
|
|
|
} else
|
|
|
|
llchange = 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This is VERY complex. Look at it with care.
|
|
|
|
*
|
|
|
|
* override solicit lladdr llchange action
|
|
|
|
* (L: record lladdr)
|
|
|
|
*
|
|
|
|
* 0 0 n -- (2c)
|
|
|
|
* 0 0 y n (2b) L
|
|
|
|
* 0 0 y y (1) REACHABLE->STALE
|
|
|
|
* 0 1 n -- (2c) *->REACHABLE
|
|
|
|
* 0 1 y n (2b) L *->REACHABLE
|
|
|
|
* 0 1 y y (1) REACHABLE->STALE
|
|
|
|
* 1 0 n -- (2a)
|
|
|
|
* 1 0 y n (2a) L
|
|
|
|
* 1 0 y y (2a) L *->STALE
|
|
|
|
* 1 1 n -- (2a) *->REACHABLE
|
|
|
|
* 1 1 y n (2a) L *->REACHABLE
|
|
|
|
* 1 1 y y (2a) L *->REACHABLE
|
|
|
|
*/
|
2006-03-06 02:47:08 +03:00
|
|
|
if (!is_override && lladdr != NULL && llchange) { /* (1) */
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* If state is REACHABLE, make it STALE.
|
|
|
|
* no other updates should be done.
|
|
|
|
*/
|
2001-02-23 11:02:41 +03:00
|
|
|
if (ln->ln_state == ND6_LLINFO_REACHABLE) {
|
1999-06-28 10:36:47 +04:00
|
|
|
ln->ln_state = ND6_LLINFO_STALE;
|
2003-06-27 12:41:08 +04:00
|
|
|
nd6_llinfo_settimer(ln, (long)nd6_gctimer * hz);
|
2001-02-23 11:02:41 +03:00
|
|
|
}
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
} else if (is_override /* (2a) */
|
2006-03-06 02:47:08 +03:00
|
|
|
|| (!is_override && lladdr != NULL && !llchange) /* (2b) */
|
|
|
|
|| lladdr == NULL) { /* (2c) */
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Update link-local address, if any.
|
|
|
|
*/
|
2006-03-06 02:47:08 +03:00
|
|
|
if (lladdr != NULL) {
|
Use malloc(9) for sockaddrs instead of pool(9), and remove dom_sa_pool
and dom_sa_len members from struct domain. Pools of fixed-size
objects are too rigid for sockaddr_dls, whose size can vary over
a wide range.
Return sockaddr_dl to its "historical" size. Now that I'm using
malloc(9) instead of pool(9) to allocate sockaddr_dl, I can create
a sockaddr_dl of any size in the kernel, so expanding sockaddr_dl
is useless.
Avoid using sizeof(struct sockaddr_dl) in the kernel.
Introduce sockaddr_dl_alloc() for allocating & initializing an
arbitrary sockaddr_dl on the heap.
Add an argument, the sockaddr length, to sockaddr_alloc(),
sockaddr_copy(), and sockaddr_dl_setaddr().
Constify: LLADDR() -> CLLADDR().
Where the kernel overwrites LLADDR(), use sockaddr_dl_setaddr(),
instead. Used properly, sockaddr_dl_setaddr() will not overrun
the end of the sockaddr.
2007-08-30 06:17:34 +04:00
|
|
|
(void)sockaddr_dl_setaddr(sdl, sdl->sdl_len,
|
|
|
|
lladdr, ifp->if_addrlen);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If solicited, make the state REACHABLE.
|
|
|
|
* If not solicited and the link-layer address was
|
|
|
|
* changed, make it STALE.
|
|
|
|
*/
|
|
|
|
if (is_solicited) {
|
|
|
|
ln->ln_state = ND6_LLINFO_REACHABLE;
|
2001-02-11 10:00:03 +03:00
|
|
|
ln->ln_byhint = 0;
|
2003-06-27 12:41:08 +04:00
|
|
|
if (!ND6_LLINFO_PERMANENT(ln)) {
|
|
|
|
nd6_llinfo_settimer(ln,
|
|
|
|
(long)ND_IFINFO(ifp)->reachable * hz);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
} else {
|
2001-02-23 11:02:41 +03:00
|
|
|
if (lladdr && llchange) {
|
1999-06-28 10:36:47 +04:00
|
|
|
ln->ln_state = ND6_LLINFO_STALE;
|
2003-06-27 12:41:08 +04:00
|
|
|
nd6_llinfo_settimer(ln,
|
|
|
|
(long)nd6_gctimer * hz);
|
2001-02-23 11:02:41 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ln->ln_router && !is_router) {
|
|
|
|
/*
|
|
|
|
* The peer dropped the router flag.
|
|
|
|
* Remove the sender from the Default Router List and
|
|
|
|
* update the Destination Cache entries.
|
|
|
|
*/
|
|
|
|
struct nd_defrouter *dr;
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
const struct in6_addr *in6;
|
1999-06-28 10:36:47 +04:00
|
|
|
int s;
|
|
|
|
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
in6 = &satocsin6(rt_getkey(rt))->sin6_addr;
|
2001-10-16 10:24:44 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Lock to protect the default router list.
|
|
|
|
* XXX: this might be unnecessary, since this function
|
|
|
|
* is only called under the network software interrupt
|
2002-06-07 11:35:39 +04:00
|
|
|
* context. However, we keep it just for safety.
|
2001-10-16 10:24:44 +04:00
|
|
|
*/
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
dr = defrouter_lookup(in6, rt->rt_ifp);
|
|
|
|
if (dr)
|
|
|
|
defrtrlist_del(dr);
|
2003-06-24 11:54:47 +04:00
|
|
|
else if (!ip6_forwarding) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Even if the neighbor is not in the default
|
|
|
|
* router list, the neighbor may be used
|
|
|
|
* as a next hop for some destinations
|
|
|
|
* (e.g. redirect case). So we must
|
|
|
|
* call rt6_flush explicitly.
|
|
|
|
*/
|
|
|
|
rt6_flush(&ip6->ip6_src, rt->rt_ifp);
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
}
|
|
|
|
ln->ln_router = is_router;
|
|
|
|
}
|
|
|
|
rt->rt_flags &= ~RTF_REJECT;
|
|
|
|
ln->ln_asked = 0;
|
2007-05-17 04:53:26 +04:00
|
|
|
nd6_llinfo_release_pkts(ln, ifp, rt);
|
2000-02-26 11:39:18 +03:00
|
|
|
|
|
|
|
freeit:
|
|
|
|
m_freem(m);
|
2001-02-07 11:59:47 +03:00
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
2008-04-15 07:57:04 +04:00
|
|
|
ICMP6_STATINC(ICMP6_STAT_BADNA);
|
2001-02-07 11:59:47 +03:00
|
|
|
m_freem(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Neighbor advertisement output handling.
|
|
|
|
*
|
|
|
|
* Based on RFC 2461
|
|
|
|
*
|
2000-02-26 11:39:18 +03:00
|
|
|
* the following items are not implemented yet:
|
|
|
|
* - proxy advertisement delay rule (RFC2461 7.2.8, last paragraph, SHOULD)
|
|
|
|
* - anycast advertisement delay rule (RFC2461 7.2.7, SHOULD)
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
2008-02-27 22:40:56 +03:00
|
|
|
nd6_na_output(
|
|
|
|
struct ifnet *ifp,
|
|
|
|
const struct in6_addr *daddr6_0,
|
|
|
|
const struct in6_addr *taddr6,
|
|
|
|
u_long flags,
|
|
|
|
int tlladdr, /* 1 if include target link-layer address */
|
|
|
|
const struct sockaddr *sdl0) /* sockaddr_dl (= proxy NA) or NULL */
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
struct nd_neighbor_advert *nd_na;
|
|
|
|
struct ip6_moptions im6o;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
struct sockaddr *dst;
|
|
|
|
union {
|
|
|
|
struct sockaddr dst;
|
|
|
|
struct sockaddr_in6 dst6;
|
|
|
|
} u;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct in6_addr *src, daddr6;
|
2002-06-09 01:22:29 +04:00
|
|
|
int icmp6len, maxlen, error;
|
2007-08-07 08:35:42 +04:00
|
|
|
const void *mac;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
struct route ro;
|
2002-06-09 01:22:29 +04:00
|
|
|
|
|
|
|
mac = NULL;
|
2007-01-29 09:20:43 +03:00
|
|
|
memset(&ro, 0, sizeof(ro));
|
2000-02-07 08:42:28 +03:00
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
daddr6 = *daddr6_0; /* make a local copy for modification */
|
|
|
|
|
2000-02-07 08:42:28 +03:00
|
|
|
/* estimate the size of message */
|
|
|
|
maxlen = sizeof(*ip6) + sizeof(*nd_na);
|
|
|
|
maxlen += (sizeof(struct nd_opt_hdr) + ifp->if_addrlen + 7) & ~7;
|
|
|
|
#ifdef DIAGNOSTIC
|
2001-10-16 10:24:44 +04:00
|
|
|
if (max_linkhdr + maxlen >= MCLBYTES) {
|
2000-02-07 08:42:28 +03:00
|
|
|
printf("nd6_na_output: max_linkhdr + maxlen >= MCLBYTES "
|
|
|
|
"(%d + %d > %d)\n", max_linkhdr, maxlen, MCLBYTES);
|
2001-10-16 10:24:44 +04:00
|
|
|
panic("nd6_na_output: insufficient MCLBYTES");
|
|
|
|
/* NOTREACHED */
|
2000-02-07 08:42:28 +03:00
|
|
|
}
|
2001-10-16 10:24:44 +04:00
|
|
|
#endif
|
2000-02-07 08:42:28 +03:00
|
|
|
|
|
|
|
MGETHDR(m, M_DONTWAIT, MT_DATA);
|
|
|
|
if (m && max_linkhdr + maxlen >= MHLEN) {
|
|
|
|
MCLGET(m, M_DONTWAIT);
|
|
|
|
if ((m->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(m);
|
|
|
|
m = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (m == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
2001-10-17 14:55:09 +04:00
|
|
|
m->m_pkthdr.rcvif = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
if (IN6_IS_ADDR_MULTICAST(&daddr6)) {
|
1999-06-28 10:36:47 +04:00
|
|
|
m->m_flags |= M_MCAST;
|
|
|
|
im6o.im6o_multicast_ifp = ifp;
|
|
|
|
im6o.im6o_multicast_hlim = 255;
|
|
|
|
im6o.im6o_multicast_loop = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
icmp6len = sizeof(*nd_na);
|
|
|
|
m->m_pkthdr.len = m->m_len = sizeof(struct ip6_hdr) + icmp6len;
|
2001-10-17 14:55:09 +04:00
|
|
|
m->m_data += max_linkhdr; /* or MH_ALIGN() equivalent? */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* fill neighbor advertisement packet */
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
ip6->ip6_flow = 0;
|
1999-12-15 09:28:43 +03:00
|
|
|
ip6->ip6_vfc &= ~IPV6_VERSION_MASK;
|
|
|
|
ip6->ip6_vfc |= IPV6_VERSION;
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6->ip6_nxt = IPPROTO_ICMPV6;
|
|
|
|
ip6->ip6_hlim = 255;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&daddr6)) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/* reply to DAD */
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
daddr6.s6_addr16[0] = IPV6_ADDR_INT16_MLL;
|
|
|
|
daddr6.s6_addr16[1] = 0;
|
|
|
|
daddr6.s6_addr32[1] = 0;
|
|
|
|
daddr6.s6_addr32[2] = 0;
|
|
|
|
daddr6.s6_addr32[3] = IPV6_ADDR_INT32_ONE;
|
|
|
|
if (in6_setscope(&daddr6, ifp, NULL))
|
|
|
|
goto bad;
|
2002-06-09 01:22:29 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
flags &= ~ND_NA_FLAG_SOLICITED;
|
2002-06-09 01:22:29 +04:00
|
|
|
}
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
ip6->ip6_dst = daddr6;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
sockaddr_in6_init(&u.dst6, &daddr6, 0, 0, 0);
|
|
|
|
dst = &u.dst;
|
|
|
|
rtcache_setdst(&ro, dst);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Select a source whose scope is the same as that of the dest.
|
|
|
|
*/
|
2008-05-23 02:25:05 +04:00
|
|
|
src = in6_selectsrc(satosin6(dst), NULL, NULL, &ro, NULL, NULL, &error);
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
if (src == NULL) {
|
2002-06-09 01:22:29 +04:00
|
|
|
nd6log((LOG_DEBUG, "nd6_na_output: source can't be "
|
|
|
|
"determined: dst=%s, error=%d\n",
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
ip6_sprintf(&satocsin6(dst)->sin6_addr), error));
|
2002-06-09 01:22:29 +04:00
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
ip6->ip6_src = *src;
|
1999-06-28 10:36:47 +04:00
|
|
|
nd_na = (struct nd_neighbor_advert *)(ip6 + 1);
|
|
|
|
nd_na->nd_na_type = ND_NEIGHBOR_ADVERT;
|
|
|
|
nd_na->nd_na_code = 0;
|
|
|
|
nd_na->nd_na_target = *taddr6;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
in6_clearscope(&nd_na->nd_na_target); /* XXX */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* "tlladdr" indicates NS's condition for adding tlladdr or not.
|
|
|
|
* see nd6_ns_input() for details.
|
|
|
|
* Basically, if NS packet is sent to unicast/anycast addr,
|
|
|
|
* target lladdr option SHOULD NOT be included.
|
|
|
|
*/
|
2000-02-26 11:39:18 +03:00
|
|
|
if (tlladdr) {
|
|
|
|
/*
|
|
|
|
* sdl0 != NULL indicates proxy NA. If we do proxy, use
|
|
|
|
* lladdr in sdl0. If we are not proxying (sending NA for
|
|
|
|
* my address) use lladdr configured for the interface.
|
|
|
|
*/
|
|
|
|
if (sdl0 == NULL)
|
|
|
|
mac = nd6_ifptomac(ifp);
|
|
|
|
else if (sdl0->sa_family == AF_LINK) {
|
2007-08-07 08:35:42 +04:00
|
|
|
const struct sockaddr_dl *sdl;
|
|
|
|
sdl = satocsdl(sdl0);
|
2000-02-26 11:39:18 +03:00
|
|
|
if (sdl->sdl_alen == ifp->if_addrlen)
|
2007-08-07 08:35:42 +04:00
|
|
|
mac = CLLADDR(sdl);
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
if (tlladdr && mac) {
|
1999-06-28 10:36:47 +04:00
|
|
|
int optlen = sizeof(struct nd_opt_hdr) + ifp->if_addrlen;
|
|
|
|
struct nd_opt_hdr *nd_opt = (struct nd_opt_hdr *)(nd_na + 1);
|
2002-06-09 18:43:10 +04:00
|
|
|
|
1999-09-20 01:31:33 +04:00
|
|
|
/* roundup to 8 bytes alignment! */
|
|
|
|
optlen = (optlen + 7) & ~7;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
m->m_pkthdr.len += optlen;
|
|
|
|
m->m_len += optlen;
|
|
|
|
icmp6len += optlen;
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)nd_opt, optlen);
|
1999-06-28 10:36:47 +04:00
|
|
|
nd_opt->nd_opt_type = ND_OPT_TARGET_LINKADDR;
|
|
|
|
nd_opt->nd_opt_len = optlen >> 3;
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy(mac, (void *)(nd_opt + 1), ifp->if_addrlen);
|
1999-06-28 10:36:47 +04:00
|
|
|
} else
|
|
|
|
flags &= ~ND_NA_FLAG_OVERRIDE;
|
|
|
|
|
2003-09-06 03:20:48 +04:00
|
|
|
ip6->ip6_plen = htons((u_int16_t)icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
nd_na->nd_na_flags_reserved = flags;
|
|
|
|
nd_na->nd_na_cksum = 0;
|
|
|
|
nd_na->nd_na_cksum =
|
2002-06-09 01:22:29 +04:00
|
|
|
in6_cksum(m, IPPROTO_ICMPV6, sizeof(struct ip6_hdr), icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2008-05-22 05:05:38 +04:00
|
|
|
ip6_output(m, NULL, NULL, 0, &im6o, NULL, NULL);
|
2001-10-18 11:44:33 +04:00
|
|
|
|
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_msg);
|
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_neighboradvert);
|
2008-04-15 07:57:04 +04:00
|
|
|
ICMP6_STATINC(ICMP6_STAT_OUTHIST + ND_NEIGHBOR_ADVERT);
|
2002-06-09 01:22:29 +04:00
|
|
|
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
rtcache_free(&ro);
|
2002-06-09 01:22:29 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
rtcache_free(&ro);
|
2002-06-09 01:22:29 +04:00
|
|
|
m_freem(m);
|
|
|
|
return;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
Use malloc(9) for sockaddrs instead of pool(9), and remove dom_sa_pool
and dom_sa_len members from struct domain. Pools of fixed-size
objects are too rigid for sockaddr_dls, whose size can vary over
a wide range.
Return sockaddr_dl to its "historical" size. Now that I'm using
malloc(9) instead of pool(9) to allocate sockaddr_dl, I can create
a sockaddr_dl of any size in the kernel, so expanding sockaddr_dl
is useless.
Avoid using sizeof(struct sockaddr_dl) in the kernel.
Introduce sockaddr_dl_alloc() for allocating & initializing an
arbitrary sockaddr_dl on the heap.
Add an argument, the sockaddr length, to sockaddr_alloc(),
sockaddr_copy(), and sockaddr_dl_setaddr().
Constify: LLADDR() -> CLLADDR().
Where the kernel overwrites LLADDR(), use sockaddr_dl_setaddr(),
instead. Used properly, sockaddr_dl_setaddr() will not overrun
the end of the sockaddr.
2007-08-30 06:17:34 +04:00
|
|
|
const void *
|
|
|
|
nd6_ifptomac(const struct ifnet *ifp)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
switch (ifp->if_type) {
|
1999-09-20 01:31:33 +04:00
|
|
|
case IFT_ARCNET:
|
1999-06-28 10:36:47 +04:00
|
|
|
case IFT_ETHER:
|
|
|
|
case IFT_FDDI:
|
2000-11-05 20:17:12 +03:00
|
|
|
case IFT_IEEE1394:
|
2002-06-09 01:22:29 +04:00
|
|
|
case IFT_PROPVIRTUAL:
|
2006-05-18 13:05:49 +04:00
|
|
|
case IFT_CARP:
|
2002-06-09 01:22:29 +04:00
|
|
|
case IFT_L2VLAN:
|
|
|
|
case IFT_IEEE80211:
|
Use malloc(9) for sockaddrs instead of pool(9), and remove dom_sa_pool
and dom_sa_len members from struct domain. Pools of fixed-size
objects are too rigid for sockaddr_dls, whose size can vary over
a wide range.
Return sockaddr_dl to its "historical" size. Now that I'm using
malloc(9) instead of pool(9) to allocate sockaddr_dl, I can create
a sockaddr_dl of any size in the kernel, so expanding sockaddr_dl
is useless.
Avoid using sizeof(struct sockaddr_dl) in the kernel.
Introduce sockaddr_dl_alloc() for allocating & initializing an
arbitrary sockaddr_dl on the heap.
Add an argument, the sockaddr length, to sockaddr_alloc(),
sockaddr_copy(), and sockaddr_dl_setaddr().
Constify: LLADDR() -> CLLADDR().
Where the kernel overwrites LLADDR(), use sockaddr_dl_setaddr(),
instead. Used properly, sockaddr_dl_setaddr() will not overrun
the end of the sockaddr.
2007-08-30 06:17:34 +04:00
|
|
|
return CLLADDR(ifp->if_sadl);
|
1999-06-28 10:36:47 +04:00
|
|
|
default:
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
TAILQ_HEAD(dadq_head, dadq);
|
|
|
|
struct dadq {
|
|
|
|
TAILQ_ENTRY(dadq) dad_list;
|
|
|
|
struct ifaddr *dad_ifa;
|
2005-02-10 05:57:17 +03:00
|
|
|
int dad_count; /* max NS to send */
|
1999-12-13 18:17:17 +03:00
|
|
|
int dad_ns_tcount; /* # of trials to send NS */
|
1999-06-28 10:36:47 +04:00
|
|
|
int dad_ns_ocount; /* NS sent so far */
|
|
|
|
int dad_ns_icount;
|
|
|
|
int dad_na_icount;
|
2000-03-24 07:09:04 +03:00
|
|
|
struct callout dad_timer_ch;
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
static struct dadq_head dadq;
|
2001-02-07 11:59:47 +03:00
|
|
|
static int dad_init = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
static struct dadq *
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_find(struct ifaddr *ifa)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct dadq *dp;
|
|
|
|
|
2007-03-16 02:39:51 +03:00
|
|
|
TAILQ_FOREACH(dp, &dadq, dad_list) {
|
1999-06-28 10:36:47 +04:00
|
|
|
if (dp->dad_ifa == ifa)
|
|
|
|
return dp;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2001-02-07 11:59:47 +03:00
|
|
|
static void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_starttimer(struct dadq *dp, int ticks)
|
2001-02-07 11:59:47 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
callout_reset(&dp->dad_timer_ch, ticks,
|
2007-03-16 02:39:51 +03:00
|
|
|
(void (*)(void *))nd6_dad_timer, (void *)dp->dad_ifa);
|
2001-02-07 11:59:47 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2007-05-23 21:14:59 +04:00
|
|
|
nd6_dad_stoptimer(struct dadq *dp)
|
2001-02-07 11:59:47 +03:00
|
|
|
{
|
|
|
|
|
|
|
|
callout_stop(&dp->dad_timer_ch);
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2006-03-03 17:07:06 +03:00
|
|
|
* Start Duplicate Address Detection (DAD) for specified interface address.
|
2007-03-16 02:39:51 +03:00
|
|
|
*
|
|
|
|
* xtick: minimum delay ticks for IFF_UP event
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_start(struct ifaddr *ifa, int xtick)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct in6_ifaddr *ia = (struct in6_ifaddr *)ifa;
|
|
|
|
struct dadq *dp;
|
|
|
|
|
|
|
|
if (!dad_init) {
|
|
|
|
TAILQ_INIT(&dadq);
|
|
|
|
dad_init++;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we don't need DAD, don't do it.
|
|
|
|
* There are several cases:
|
|
|
|
* - DAD is disabled (ip6_dad_count == 0)
|
|
|
|
* - the interface address is anycast
|
|
|
|
*/
|
|
|
|
if (!(ia->ia6_flags & IN6_IFF_TENTATIVE)) {
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_DEBUG,
|
|
|
|
"nd6_dad_start: called with non-tentative address "
|
1999-06-28 10:36:47 +04:00
|
|
|
"%s(%s)\n",
|
|
|
|
ip6_sprintf(&ia->ia_addr.sin6_addr),
|
1999-12-13 18:17:17 +03:00
|
|
|
ifa->ifa_ifp ? if_name(ifa->ifa_ifp) : "???");
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (ia->ia6_flags & IN6_IFF_ANYCAST) {
|
|
|
|
ia->ia6_flags &= ~IN6_IFF_TENTATIVE;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (!ip6_dad_count) {
|
|
|
|
ia->ia6_flags &= ~IN6_IFF_TENTATIVE;
|
|
|
|
return;
|
|
|
|
}
|
2006-03-06 02:47:08 +03:00
|
|
|
if (ifa->ifa_ifp == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
panic("nd6_dad_start: ifa->ifa_ifp == NULL");
|
|
|
|
if (!(ifa->ifa_ifp->if_flags & IFF_UP))
|
|
|
|
return;
|
|
|
|
if (nd6_dad_find(ifa) != NULL) {
|
|
|
|
/* DAD already in progress */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
dp = malloc(sizeof(*dp), M_IP6NDP, M_NOWAIT);
|
|
|
|
if (dp == NULL) {
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "nd6_dad_start: memory allocation failed for "
|
1999-06-28 10:36:47 +04:00
|
|
|
"%s(%s)\n",
|
|
|
|
ip6_sprintf(&ia->ia_addr.sin6_addr),
|
1999-12-13 18:17:17 +03:00
|
|
|
ifa->ifa_ifp ? if_name(ifa->ifa_ifp) : "???");
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
bzero(dp, sizeof(*dp));
|
2008-04-24 15:38:36 +04:00
|
|
|
callout_init(&dp->dad_timer_ch, CALLOUT_MPSAFE);
|
1999-06-28 10:36:47 +04:00
|
|
|
TAILQ_INSERT_TAIL(&dadq, (struct dadq *)dp, dad_list);
|
|
|
|
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_DEBUG, "%s: starting DAD for %s\n", if_name(ifa->ifa_ifp),
|
|
|
|
ip6_sprintf(&ia->ia_addr.sin6_addr)));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Send NS packet for DAD, ip6_dad_count times.
|
|
|
|
* Note that we must delay the first transmission, if this is the
|
|
|
|
* first packet to be sent from the interface after interface
|
|
|
|
* (re)initialization.
|
|
|
|
*/
|
|
|
|
dp->dad_ifa = ifa;
|
2001-10-17 14:55:09 +04:00
|
|
|
IFAREF(ifa); /* just for safety */
|
1999-06-28 10:36:47 +04:00
|
|
|
dp->dad_count = ip6_dad_count;
|
|
|
|
dp->dad_ns_icount = dp->dad_na_icount = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
dp->dad_ns_ocount = dp->dad_ns_tcount = 0;
|
2006-03-06 23:33:52 +03:00
|
|
|
if (xtick == 0) {
|
1999-12-13 18:17:17 +03:00
|
|
|
nd6_dad_ns_output(dp, ifa);
|
2002-06-07 11:38:51 +04:00
|
|
|
nd6_dad_starttimer(dp,
|
2003-06-27 12:41:08 +04:00
|
|
|
(long)ND_IFINFO(ifa->ifa_ifp)->retrans * hz / 1000);
|
2006-03-06 02:47:08 +03:00
|
|
|
} else
|
2006-03-06 23:33:52 +03:00
|
|
|
nd6_dad_starttimer(dp, xtick);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2001-02-07 11:59:47 +03:00
|
|
|
/*
|
|
|
|
* terminate DAD unconditionally. used for address removals.
|
|
|
|
*/
|
|
|
|
void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_stop(struct ifaddr *ifa)
|
2001-02-07 11:59:47 +03:00
|
|
|
{
|
|
|
|
struct dadq *dp;
|
|
|
|
|
|
|
|
if (!dad_init)
|
|
|
|
return;
|
|
|
|
dp = nd6_dad_find(ifa);
|
2006-03-06 02:47:08 +03:00
|
|
|
if (dp == NULL) {
|
2001-02-07 11:59:47 +03:00
|
|
|
/* DAD wasn't started yet */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
nd6_dad_stoptimer(dp);
|
|
|
|
|
2006-12-02 21:59:17 +03:00
|
|
|
TAILQ_REMOVE(&dadq, dp, dad_list);
|
2001-02-07 11:59:47 +03:00
|
|
|
free(dp, M_IP6NDP);
|
|
|
|
dp = NULL;
|
|
|
|
IFAFREE(ifa);
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
static void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_timer(struct ifaddr *ifa)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct in6_ifaddr *ia = (struct in6_ifaddr *)ifa;
|
|
|
|
struct dadq *dp;
|
|
|
|
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_enter(softnet_lock);
|
|
|
|
KERNEL_LOCK(1, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* Sanity check */
|
|
|
|
if (ia == NULL) {
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "nd6_dad_timer: called with null parameter\n");
|
1999-06-28 10:36:47 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
dp = nd6_dad_find(ifa);
|
|
|
|
if (dp == NULL) {
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "nd6_dad_timer: DAD structure not found\n");
|
1999-06-28 10:36:47 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if (ia->ia6_flags & IN6_IFF_DUPLICATED) {
|
2006-03-03 17:07:06 +03:00
|
|
|
log(LOG_ERR, "nd6_dad_timer: called with duplicate address "
|
1999-06-28 10:36:47 +04:00
|
|
|
"%s(%s)\n",
|
|
|
|
ip6_sprintf(&ia->ia_addr.sin6_addr),
|
1999-12-13 18:17:17 +03:00
|
|
|
ifa->ifa_ifp ? if_name(ifa->ifa_ifp) : "???");
|
1999-06-28 10:36:47 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
if ((ia->ia6_flags & IN6_IFF_TENTATIVE) == 0) {
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "nd6_dad_timer: called with non-tentative address "
|
1999-06-28 10:36:47 +04:00
|
|
|
"%s(%s)\n",
|
|
|
|
ip6_sprintf(&ia->ia_addr.sin6_addr),
|
1999-12-13 18:17:17 +03:00
|
|
|
ifa->ifa_ifp ? if_name(ifa->ifa_ifp) : "???");
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* timeouted with IFF_{RUNNING,UP} check */
|
|
|
|
if (dp->dad_ns_tcount > dad_maxtry) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO, "%s: could not run DAD, driver problem?\n",
|
|
|
|
if_name(ifa->ifa_ifp)));
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2006-12-02 21:59:17 +03:00
|
|
|
TAILQ_REMOVE(&dadq, dp, dad_list);
|
1999-12-13 18:17:17 +03:00
|
|
|
free(dp, M_IP6NDP);
|
|
|
|
dp = NULL;
|
2000-02-02 01:52:04 +03:00
|
|
|
IFAFREE(ifa);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Need more checks? */
|
2005-02-10 05:57:17 +03:00
|
|
|
if (dp->dad_ns_ocount < dp->dad_count) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* We have more NS to go. Send NS packet for DAD.
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
nd6_dad_ns_output(dp, ifa);
|
2002-06-07 11:38:51 +04:00
|
|
|
nd6_dad_starttimer(dp,
|
2003-06-27 12:41:08 +04:00
|
|
|
(long)ND_IFINFO(ifa->ifa_ifp)->retrans * hz / 1000);
|
1999-06-28 10:36:47 +04:00
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* We have transmitted sufficient number of DAD packets.
|
|
|
|
* See what we've got.
|
|
|
|
*/
|
|
|
|
int duplicate;
|
|
|
|
|
|
|
|
duplicate = 0;
|
|
|
|
|
|
|
|
if (dp->dad_na_icount) {
|
|
|
|
/*
|
|
|
|
* the check is in nd6_dad_na_input(),
|
|
|
|
* but just in case
|
|
|
|
*/
|
|
|
|
duplicate++;
|
|
|
|
}
|
|
|
|
|
2005-02-10 05:57:17 +03:00
|
|
|
if (dp->dad_ns_icount) {
|
|
|
|
/* We've seen NS, means DAD has failed. */
|
|
|
|
duplicate++;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
if (duplicate) {
|
|
|
|
/* (*dp) will be freed in nd6_dad_duplicated() */
|
|
|
|
dp = NULL;
|
|
|
|
nd6_dad_duplicated(ifa);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* We are done with DAD. No NA came, no NS came.
|
2006-03-03 17:07:06 +03:00
|
|
|
* No duplicate address found.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
ia->ia6_flags &= ~IN6_IFF_TENTATIVE;
|
|
|
|
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_DEBUG,
|
2000-02-07 08:42:28 +03:00
|
|
|
"%s: DAD complete for %s - no duplicates found\n",
|
|
|
|
if_name(ifa->ifa_ifp),
|
2001-02-07 11:59:47 +03:00
|
|
|
ip6_sprintf(&ia->ia_addr.sin6_addr)));
|
1999-07-10 23:46:10 +04:00
|
|
|
|
2006-12-02 21:59:17 +03:00
|
|
|
TAILQ_REMOVE(&dadq, dp, dad_list);
|
1999-06-28 10:36:47 +04:00
|
|
|
free(dp, M_IP6NDP);
|
|
|
|
dp = NULL;
|
2000-02-02 01:52:04 +03:00
|
|
|
IFAFREE(ifa);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
done:
|
2008-04-24 15:38:36 +04:00
|
|
|
KERNEL_UNLOCK_ONE(NULL);
|
|
|
|
mutex_exit(softnet_lock);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_duplicated(struct ifaddr *ifa)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct in6_ifaddr *ia = (struct in6_ifaddr *)ifa;
|
2006-03-06 02:47:08 +03:00
|
|
|
struct ifnet *ifp;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct dadq *dp;
|
|
|
|
|
|
|
|
dp = nd6_dad_find(ifa);
|
|
|
|
if (dp == NULL) {
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "nd6_dad_duplicated: DAD structure not found\n");
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-03-06 02:47:08 +03:00
|
|
|
ifp = ifa->ifa_ifp;
|
2001-10-17 14:55:09 +04:00
|
|
|
log(LOG_ERR, "%s: DAD detected duplicate IPv6 address %s: "
|
|
|
|
"NS in/out=%d/%d, NA in=%d\n",
|
2006-03-06 02:47:08 +03:00
|
|
|
if_name(ifp), ip6_sprintf(&ia->ia_addr.sin6_addr),
|
2001-10-17 14:55:09 +04:00
|
|
|
dp->dad_ns_icount, dp->dad_ns_ocount, dp->dad_na_icount);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
ia->ia6_flags &= ~IN6_IFF_TENTATIVE;
|
|
|
|
ia->ia6_flags |= IN6_IFF_DUPLICATED;
|
|
|
|
|
|
|
|
/* We are done with DAD, with duplicated address found. (failure) */
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6_dad_stoptimer(dp);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "%s: DAD complete for %s - duplicate found\n",
|
2006-03-06 02:47:08 +03:00
|
|
|
if_name(ifp), ip6_sprintf(&ia->ia_addr.sin6_addr));
|
2000-02-07 08:42:28 +03:00
|
|
|
log(LOG_ERR, "%s: manual intervention required\n",
|
2006-03-06 02:47:08 +03:00
|
|
|
if_name(ifp));
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If the address is a link-local address formed from an interface
|
|
|
|
* identifier based on the hardware address which is supposed to be
|
|
|
|
* uniquely assigned (e.g., EUI-64 for an Ethernet interface), IP
|
|
|
|
* operation on the interface SHOULD be disabled.
|
|
|
|
* [rfc2462bis-03 Section 5.4.5]
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&ia->ia_addr.sin6_addr)) {
|
|
|
|
struct in6_addr in6;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* To avoid over-reaction, we only apply this logic when we are
|
|
|
|
* very sure that hardware addresses are supposed to be unique.
|
|
|
|
*/
|
|
|
|
switch (ifp->if_type) {
|
|
|
|
case IFT_ETHER:
|
|
|
|
case IFT_FDDI:
|
|
|
|
case IFT_ATM:
|
|
|
|
case IFT_IEEE1394:
|
|
|
|
#ifdef IFT_IEEE80211
|
|
|
|
case IFT_IEEE80211:
|
|
|
|
#endif
|
|
|
|
in6 = ia->ia_addr.sin6_addr;
|
|
|
|
if (in6_get_hw_ifid(ifp, &in6) == 0 &&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&ia->ia_addr.sin6_addr, &in6)) {
|
|
|
|
ND_IFINFO(ifp)->flags |= ND6_IFF_IFDISABLED;
|
|
|
|
log(LOG_ERR, "%s: possible hardware address "
|
|
|
|
"duplication detected, disable IPv6\n",
|
|
|
|
if_name(ifp));
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
1999-07-10 23:46:10 +04:00
|
|
|
|
2006-12-02 21:59:17 +03:00
|
|
|
TAILQ_REMOVE(&dadq, dp, dad_list);
|
1999-06-28 10:36:47 +04:00
|
|
|
free(dp, M_IP6NDP);
|
|
|
|
dp = NULL;
|
2000-02-02 01:52:04 +03:00
|
|
|
IFAFREE(ifa);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
static void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_ns_output(struct dadq *dp, struct ifaddr *ifa)
|
1999-12-13 18:17:17 +03:00
|
|
|
{
|
|
|
|
struct in6_ifaddr *ia = (struct in6_ifaddr *)ifa;
|
|
|
|
struct ifnet *ifp = ifa->ifa_ifp;
|
|
|
|
|
|
|
|
dp->dad_ns_tcount++;
|
|
|
|
if ((ifp->if_flags & IFF_UP) == 0) {
|
|
|
|
#if 0
|
|
|
|
printf("%s: interface down?\n", if_name(ifp));
|
|
|
|
#endif
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if ((ifp->if_flags & IFF_RUNNING) == 0) {
|
|
|
|
#if 0
|
|
|
|
printf("%s: interface not running?\n", if_name(ifp));
|
|
|
|
#endif
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2006-06-28 20:43:43 +04:00
|
|
|
dp->dad_ns_tcount = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
dp->dad_ns_ocount++;
|
|
|
|
nd6_ns_output(ifp, NULL, &ia->ia_addr.sin6_addr, NULL, 1);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_ns_input(struct ifaddr *ifa)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct in6_ifaddr *ia;
|
2001-10-18 11:44:33 +04:00
|
|
|
const struct in6_addr *taddr6;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct dadq *dp;
|
|
|
|
int duplicate;
|
|
|
|
|
2006-03-06 02:47:08 +03:00
|
|
|
if (ifa == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
panic("ifa == NULL in nd6_dad_ns_input");
|
|
|
|
|
|
|
|
ia = (struct in6_ifaddr *)ifa;
|
|
|
|
taddr6 = &ia->ia_addr.sin6_addr;
|
|
|
|
duplicate = 0;
|
|
|
|
dp = nd6_dad_find(ifa);
|
|
|
|
|
|
|
|
/* Quickhack - completely ignore DAD NS packets */
|
|
|
|
if (dad_ignore_ns) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO,
|
|
|
|
"nd6_dad_ns_input: ignoring DAD NS packet for "
|
1999-06-28 10:36:47 +04:00
|
|
|
"address %s(%s)\n", ip6_sprintf(taddr6),
|
2001-02-07 11:59:47 +03:00
|
|
|
if_name(ifa->ifa_ifp)));
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if I'm yet to start DAD, someone else started using this address
|
|
|
|
* first. I have a duplicate and you win.
|
|
|
|
*/
|
2006-03-06 02:47:08 +03:00
|
|
|
if (dp == NULL || dp->dad_ns_ocount == 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
duplicate++;
|
|
|
|
|
|
|
|
/* XXX more checks for loopback situation - see nd6_dad_timer too */
|
|
|
|
|
|
|
|
if (duplicate) {
|
|
|
|
dp = NULL; /* will be freed in nd6_dad_duplicated() */
|
|
|
|
nd6_dad_duplicated(ifa);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* not sure if I got a duplicate.
|
|
|
|
* increment ns count and see what happens.
|
|
|
|
*/
|
|
|
|
if (dp)
|
|
|
|
dp->dad_ns_icount++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
static void
|
2007-03-16 02:39:51 +03:00
|
|
|
nd6_dad_na_input(struct ifaddr *ifa)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct dadq *dp;
|
|
|
|
|
2006-03-06 02:47:08 +03:00
|
|
|
if (ifa == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
panic("ifa == NULL in nd6_dad_na_input");
|
|
|
|
|
|
|
|
dp = nd6_dad_find(ifa);
|
|
|
|
if (dp)
|
|
|
|
dp->dad_na_icount++;
|
|
|
|
|
|
|
|
/* remove the address. */
|
|
|
|
nd6_dad_duplicated(ifa);
|
|
|
|
}
|