2004-05-25 08:33:59 +04:00
|
|
|
/* $NetBSD: icmp6.c,v 1.107 2004/05/25 04:34:00 atatat Exp $ */
|
2001-06-22 17:01:49 +04:00
|
|
|
/* $KAME: icmp6.c,v 1.217 2001/06/20 15:03:29 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-09 15:51:12 +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-09 15:51:12 +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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1982, 1986, 1988, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1999-06-28 10:36:47 +04:00
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* @(#)ip_icmp.c 8.2 (Berkeley) 1/4/94
|
|
|
|
*/
|
|
|
|
|
2001-11-13 03:56:55 +03:00
|
|
|
#include <sys/cdefs.h>
|
2004-05-25 08:33:59 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: icmp6.c,v 1.107 2004/05/25 04:34:00 atatat 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/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/syslog.h>
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <sys/domain.h>
|
2001-10-29 10:02:30 +03:00
|
|
|
#include <sys/sysctl.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/if_dl.h>
|
|
|
|
#include <net/if_types.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.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>
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/icmp6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/mld6_var.h>
|
|
|
|
#include <netinet6/in6_pcb.h>
|
|
|
|
#include <netinet6/nd6.h>
|
|
|
|
#include <netinet6/in6_ifattach.h>
|
1999-07-31 22:41:15 +04:00
|
|
|
#include <netinet6/ip6protosw.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef IPSEC
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <netinet6/ipsec.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netkey/key.h>
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#include "faith.h"
|
2001-05-08 14:15:13 +04:00
|
|
|
#if defined(NFAITH) && 0 < NFAITH
|
|
|
|
#include <net/if_faith.h>
|
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <net/net_osdep.h>
|
|
|
|
|
|
|
|
extern struct domain inet6domain;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
struct icmp6stat icmp6stat;
|
|
|
|
|
2003-09-04 13:16:57 +04:00
|
|
|
extern struct inpcbtable raw6cbtable;
|
2000-07-06 16:36:18 +04:00
|
|
|
extern int icmp6errppslim;
|
|
|
|
static int icmp6errpps_count = 0;
|
2000-07-09 10:44:57 +04:00
|
|
|
static struct timeval icmp6errppslim_last;
|
2000-01-02 19:31:17 +03:00
|
|
|
extern int icmp6_nodeinfo;
|
2000-10-19 01:14:12 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* List of callbacks to notify when Path MTU changes are made.
|
|
|
|
*/
|
|
|
|
struct icmp6_mtudisc_callback {
|
|
|
|
LIST_ENTRY(icmp6_mtudisc_callback) mc_list;
|
|
|
|
void (*mc_func) __P((struct in6_addr *));
|
|
|
|
};
|
|
|
|
|
|
|
|
LIST_HEAD(, icmp6_mtudisc_callback) icmp6_mtudisc_callbacks =
|
|
|
|
LIST_HEAD_INITIALIZER(&icmp6_mtudisc_callbacks);
|
|
|
|
|
1999-07-22 16:56:56 +04:00
|
|
|
static struct rttimer_queue *icmp6_mtudisc_timeout_q = NULL;
|
|
|
|
extern int pmtu_expire;
|
|
|
|
|
2000-12-09 04:29:45 +03:00
|
|
|
/* XXX do these values make any sense? */
|
2001-02-08 19:07:39 +03:00
|
|
|
static int icmp6_mtudisc_hiwat = 1280;
|
|
|
|
static int icmp6_mtudisc_lowat = 256;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* keep track of # of redirect routes.
|
|
|
|
*/
|
|
|
|
static struct rttimer_queue *icmp6_redirect_timeout_q = NULL;
|
|
|
|
|
|
|
|
/* XXX experimental, turned off */
|
|
|
|
static int icmp6_redirect_hiwat = -1;
|
|
|
|
static int icmp6_redirect_lowat = -1;
|
2000-12-09 04:29:45 +03:00
|
|
|
|
2000-07-06 16:36:18 +04:00
|
|
|
static void icmp6_errcount __P((struct icmp6errstat *, int, int));
|
1999-06-28 10:36:47 +04:00
|
|
|
static int icmp6_rip6_input __P((struct mbuf **, int));
|
|
|
|
static int icmp6_ratelimit __P((const struct in6_addr *, const int, const int));
|
1999-12-13 18:17:17 +03:00
|
|
|
static const char *icmp6_redirect_diag __P((struct in6_addr *,
|
|
|
|
struct in6_addr *, struct in6_addr *));
|
2000-06-12 20:21:02 +04:00
|
|
|
static struct mbuf *ni6_input __P((struct mbuf *, int));
|
|
|
|
static struct mbuf *ni6_nametodns __P((const char *, int, int));
|
|
|
|
static int ni6_dnsmatch __P((const char *, int, const char *, int));
|
1999-06-28 10:36:47 +04:00
|
|
|
static int ni6_addrs __P((struct icmp6_nodeinfo *, struct mbuf *,
|
2000-11-11 03:46:36 +03:00
|
|
|
struct ifnet **, char *));
|
1999-06-28 10:36:47 +04:00
|
|
|
static int ni6_store_addrs __P((struct icmp6_nodeinfo *, struct icmp6_nodeinfo *,
|
|
|
|
struct ifnet *, int));
|
2001-02-11 09:49:49 +03:00
|
|
|
static int icmp6_notify_error __P((struct mbuf *, int, int, int));
|
1999-07-22 16:56:56 +04:00
|
|
|
static struct rtentry *icmp6_mtudisc_clone __P((struct sockaddr *));
|
|
|
|
static void icmp6_mtudisc_timeout __P((struct rtentry *, struct rttimer *));
|
2001-02-08 19:07:39 +03:00
|
|
|
static void icmp6_redirect_timeout __P((struct rtentry *, struct rttimer *));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
void
|
|
|
|
icmp6_init()
|
|
|
|
{
|
|
|
|
mld6_init();
|
1999-07-22 16:56:56 +04:00
|
|
|
icmp6_mtudisc_timeout_q = rt_timer_queue_create(pmtu_expire);
|
2001-02-08 19:07:39 +03:00
|
|
|
icmp6_redirect_timeout_q = rt_timer_queue_create(icmp6_redirtimeout);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2000-07-06 16:36:18 +04:00
|
|
|
static void
|
|
|
|
icmp6_errcount(stat, type, code)
|
|
|
|
struct icmp6errstat *stat;
|
|
|
|
int type, code;
|
|
|
|
{
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (type) {
|
2000-07-06 16:36:18 +04:00
|
|
|
case ICMP6_DST_UNREACH:
|
|
|
|
switch (code) {
|
|
|
|
case ICMP6_DST_UNREACH_NOROUTE:
|
|
|
|
stat->icp6errs_dst_unreach_noroute++;
|
|
|
|
return;
|
|
|
|
case ICMP6_DST_UNREACH_ADMIN:
|
|
|
|
stat->icp6errs_dst_unreach_admin++;
|
|
|
|
return;
|
|
|
|
case ICMP6_DST_UNREACH_BEYONDSCOPE:
|
|
|
|
stat->icp6errs_dst_unreach_beyondscope++;
|
|
|
|
return;
|
|
|
|
case ICMP6_DST_UNREACH_ADDR:
|
|
|
|
stat->icp6errs_dst_unreach_addr++;
|
|
|
|
return;
|
|
|
|
case ICMP6_DST_UNREACH_NOPORT:
|
|
|
|
stat->icp6errs_dst_unreach_noport++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ICMP6_PACKET_TOO_BIG:
|
|
|
|
stat->icp6errs_packet_too_big++;
|
|
|
|
return;
|
|
|
|
case ICMP6_TIME_EXCEEDED:
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (code) {
|
2000-07-06 16:36:18 +04:00
|
|
|
case ICMP6_TIME_EXCEED_TRANSIT:
|
|
|
|
stat->icp6errs_time_exceed_transit++;
|
|
|
|
return;
|
|
|
|
case ICMP6_TIME_EXCEED_REASSEMBLY:
|
|
|
|
stat->icp6errs_time_exceed_reassembly++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ICMP6_PARAM_PROB:
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (code) {
|
2000-07-06 16:36:18 +04:00
|
|
|
case ICMP6_PARAMPROB_HEADER:
|
|
|
|
stat->icp6errs_paramprob_header++;
|
|
|
|
return;
|
|
|
|
case ICMP6_PARAMPROB_NEXTHEADER:
|
|
|
|
stat->icp6errs_paramprob_nextheader++;
|
|
|
|
return;
|
|
|
|
case ICMP6_PARAMPROB_OPTION:
|
|
|
|
stat->icp6errs_paramprob_option++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
case ND_REDIRECT:
|
|
|
|
stat->icp6errs_redirect++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
stat->icp6errs_unknown++;
|
|
|
|
}
|
|
|
|
|
2000-10-19 01:14:12 +04:00
|
|
|
/*
|
|
|
|
* Register a Path MTU Discovery callback.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
icmp6_mtudisc_callback_register(func)
|
|
|
|
void (*func) __P((struct in6_addr *));
|
|
|
|
{
|
|
|
|
struct icmp6_mtudisc_callback *mc;
|
|
|
|
|
|
|
|
for (mc = LIST_FIRST(&icmp6_mtudisc_callbacks); mc != NULL;
|
|
|
|
mc = LIST_NEXT(mc, mc_list)) {
|
|
|
|
if (mc->mc_func == func)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
mc = malloc(sizeof(*mc), M_PCB, M_NOWAIT);
|
|
|
|
if (mc == NULL)
|
|
|
|
panic("icmp6_mtudisc_callback_register");
|
|
|
|
|
|
|
|
mc->mc_func = func;
|
|
|
|
LIST_INSERT_HEAD(&icmp6_mtudisc_callbacks, mc, mc_list);
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Generate an error packet of type error in response to bad IP6 packet.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
icmp6_error(m, type, code, param)
|
|
|
|
struct mbuf *m;
|
|
|
|
int type, code, param;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *oip6, *nip6;
|
|
|
|
struct icmp6_hdr *icmp6;
|
2000-01-07 09:44:30 +03:00
|
|
|
u_int preplen;
|
1999-06-28 10:36:47 +04:00
|
|
|
int off;
|
2000-03-22 07:42:01 +03:00
|
|
|
int nxt;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
icmp6stat.icp6s_error++;
|
|
|
|
|
2000-07-06 16:36:18 +04:00
|
|
|
/* count per-type-code statistics */
|
|
|
|
icmp6_errcount(&icmp6stat.icp6s_outerrhist, type, code);
|
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
if (m->m_flags & M_DECRYPTED) {
|
|
|
|
icmp6stat.icp6s_canterror++;
|
1999-06-28 10:36:47 +04:00
|
|
|
goto freeit;
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
if (m->m_len < sizeof(struct ip6_hdr)) {
|
|
|
|
m = m_pullup(m, sizeof(struct ip6_hdr));
|
|
|
|
if (m == NULL)
|
|
|
|
return;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
oip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
/*
|
2001-10-15 15:12:44 +04:00
|
|
|
* If the destination address of the erroneous packet is a multicast
|
|
|
|
* address, or the packet was sent using link-layer multicast,
|
|
|
|
* we should basically suppress sending an error (RFC 2463, Section
|
|
|
|
* 2.4).
|
|
|
|
* We have two exceptions (the item e.2 in that section):
|
|
|
|
* - the Pakcet Too Big message can be sent for path MTU discovery.
|
|
|
|
* - the Parameter Problem Message that can be allowed an icmp6 error
|
|
|
|
* in the option type field. This check has been done in
|
|
|
|
* ip6_unknown_opt(), so we can just check the type and code.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
if ((m->m_flags & (M_BCAST|M_MCAST) ||
|
|
|
|
IN6_IS_ADDR_MULTICAST(&oip6->ip6_dst)) &&
|
|
|
|
(type != ICMP6_PACKET_TOO_BIG &&
|
|
|
|
(type != ICMP6_PARAM_PROB ||
|
|
|
|
code != ICMP6_PARAMPROB_OPTION)))
|
|
|
|
goto freeit;
|
|
|
|
|
2001-10-15 15:12:44 +04:00
|
|
|
/*
|
|
|
|
* RFC 2463, 2.4 (e.5): source address check.
|
|
|
|
* XXX: the case of anycast source?
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&oip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_MULTICAST(&oip6->ip6_src))
|
|
|
|
goto freeit;
|
|
|
|
|
|
|
|
/*
|
2000-03-22 07:42:01 +03:00
|
|
|
* If we are about to send ICMPv6 against ICMPv6 error/redirect,
|
|
|
|
* don't do it.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2000-03-22 07:42:01 +03:00
|
|
|
nxt = -1;
|
2000-04-13 18:07:10 +04:00
|
|
|
off = ip6_lasthdr(m, 0, IPPROTO_IPV6, &nxt);
|
2000-03-22 07:42:01 +03:00
|
|
|
if (off >= 0 && nxt == IPPROTO_ICMPV6) {
|
1999-06-28 10:36:47 +04:00
|
|
|
struct icmp6_hdr *icp;
|
|
|
|
|
2000-03-22 07:42:01 +03:00
|
|
|
IP6_EXTHDR_GET(icp, struct icmp6_hdr *, m, off,
|
|
|
|
sizeof(*icp));
|
|
|
|
if (icp == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (icp->icmp6_type < ICMP6_ECHO_REQUEST ||
|
|
|
|
icp->icmp6_type == ND_REDIRECT) {
|
|
|
|
/*
|
|
|
|
* ICMPv6 error
|
|
|
|
* Special case: for redirect (which is
|
|
|
|
* informational) we must not send icmp6 error.
|
|
|
|
*/
|
|
|
|
icmp6stat.icp6s_canterror++;
|
|
|
|
goto freeit;
|
|
|
|
} else {
|
|
|
|
/* ICMPv6 informational - send the error */
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2001-10-15 15:12:44 +04:00
|
|
|
}
|
|
|
|
#if 0 /* controversial */
|
|
|
|
else if (off >= 0 && nxt == IPPROTO_ESP) {
|
|
|
|
/*
|
|
|
|
* It could be ICMPv6 error inside ESP. Take a safer side,
|
|
|
|
* don't respond.
|
|
|
|
*/
|
|
|
|
icmp6stat.icp6s_canterror++;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
else {
|
2000-03-22 07:42:01 +03:00
|
|
|
/* non-ICMPv6 - send the error */
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
oip6 = mtod(m, struct ip6_hdr *); /* adjust pointer */
|
|
|
|
|
|
|
|
/* Finally, do rate limitation check. */
|
|
|
|
if (icmp6_ratelimit(&oip6->ip6_src, type, code)) {
|
|
|
|
icmp6stat.icp6s_toofreq++;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* OK, ICMP6 can be generated.
|
|
|
|
*/
|
|
|
|
|
|
|
|
if (m->m_pkthdr.len >= ICMPV6_PLD_MAXLEN)
|
|
|
|
m_adj(m, ICMPV6_PLD_MAXLEN - m->m_pkthdr.len);
|
|
|
|
|
2000-01-07 09:44:30 +03:00
|
|
|
preplen = sizeof(struct ip6_hdr) + sizeof(struct icmp6_hdr);
|
|
|
|
M_PREPEND(m, preplen, M_DONTWAIT);
|
|
|
|
if (m && m->m_len < preplen)
|
|
|
|
m = m_pullup(m, preplen);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (m == NULL) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_DEBUG, "ENOBUFS in icmp6_error %d\n", __LINE__));
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
nip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
nip6->ip6_src = oip6->ip6_src;
|
|
|
|
nip6->ip6_dst = oip6->ip6_dst;
|
|
|
|
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&oip6->ip6_src))
|
|
|
|
oip6->ip6_src.s6_addr16[1] = 0;
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&oip6->ip6_dst))
|
|
|
|
oip6->ip6_dst.s6_addr16[1] = 0;
|
|
|
|
|
|
|
|
icmp6 = (struct icmp6_hdr *)(nip6 + 1);
|
|
|
|
icmp6->icmp6_type = type;
|
|
|
|
icmp6->icmp6_code = code;
|
1999-07-22 07:59:42 +04:00
|
|
|
icmp6->icmp6_pptr = htonl((u_int32_t)param);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-04-04 10:28:40 +04:00
|
|
|
/*
|
|
|
|
* icmp6_reflect() is designed to be in the input path.
|
|
|
|
* icmp6_error() can be called from both input and outut path,
|
|
|
|
* and if we are in output path rcvif could contain bogus value.
|
|
|
|
* clear m->m_pkthdr.rcvif for safety, we should have enough scope
|
|
|
|
* information in ip header (nip6).
|
|
|
|
*/
|
|
|
|
m->m_pkthdr.rcvif = NULL;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
icmp6stat.icp6s_outhist[type]++;
|
2001-10-15 15:12:44 +04:00
|
|
|
icmp6_reflect(m, sizeof(struct ip6_hdr)); /* header order: IPv6 - ICMPv6 */
|
2000-03-22 07:42:01 +03:00
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
freeit:
|
|
|
|
/*
|
|
|
|
* If we can't tell wheter or not we can generate ICMP6, free it.
|
|
|
|
*/
|
|
|
|
m_freem(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Process a received ICMP6 message.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
icmp6_input(mp, offp, proto)
|
|
|
|
struct mbuf **mp;
|
|
|
|
int *offp, proto;
|
|
|
|
{
|
|
|
|
struct mbuf *m = *mp, *n;
|
|
|
|
struct ip6_hdr *ip6, *nip6;
|
|
|
|
struct icmp6_hdr *icmp6, *nicmp6;
|
|
|
|
int off = *offp;
|
|
|
|
int icmp6len = m->m_pkthdr.len - *offp;
|
|
|
|
int code, sum, noff;
|
|
|
|
|
2001-12-07 13:10:43 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_msg);
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Locate icmp6 structure in mbuf, and check
|
|
|
|
* that not corrupted and of at least minimum length
|
|
|
|
*/
|
|
|
|
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (icmp6len < sizeof(struct icmp6_hdr)) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2001-12-07 13:10:43 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_error);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* calculate the checksum
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
IP6_EXTHDR_GET(icmp6, struct icmp6_hdr *, m, off, sizeof(*icmp6));
|
|
|
|
if (icmp6 == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2004-03-26 06:35:02 +03:00
|
|
|
/* m is invalid */
|
|
|
|
/*icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_error);*/
|
1999-12-13 18:17:17 +03:00
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
Changes to allow the IPv4 and IPv6 layers to align headers themseves,
as necessary:
* Implement a new mbuf utility routine, m_copyup(), is is like
m_pullup(), except that it always prepends and copies, rather
than only doing so if the desired length is larger than m->m_len.
m_copyup() also allows an offset into the destination mbuf, which
allows space for packet headers, in the forwarding case.
* Add *_HDR_ALIGNED_P() macros for IP, IPv6, ICMP, and IGMP. These
macros expand to 1 if __NO_STRICT_ALIGNMENT is defined, so that
architectures which do not have strict alignment constraints don't
pay for the test or visit the new align-if-needed path.
* Use the new macros to check if a header needs to be aligned, or to
assert that it already is, as appropriate.
Note: This code is still somewhat experimental. However, the new
code path won't be visited if individual device drivers continue
to guarantee that packets are delivered to layer 3 already properly
aligned (which are rules that are already in use).
2002-07-01 02:40:32 +04:00
|
|
|
KASSERT(IP6_HDR_ALIGNED_P(icmp6));
|
1999-06-28 10:36:47 +04:00
|
|
|
code = icmp6->icmp6_code;
|
|
|
|
|
|
|
|
if ((sum = in6_cksum(m, IPPROTO_ICMPV6, off, icmp6len)) != 0) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-06-28 10:36:47 +04:00
|
|
|
"ICMP6 checksum error(%d|%x) %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6->icmp6_type, sum, ip6_sprintf(&ip6->ip6_src)));
|
1999-06-28 10:36:47 +04:00
|
|
|
icmp6stat.icp6s_checksum++;
|
2001-12-07 13:10:43 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_error);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
|
|
|
|
#if defined(NFAITH) && 0 < NFAITH
|
2001-05-08 14:15:13 +04:00
|
|
|
if (faithprefix(&ip6->ip6_dst)) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Deliver very specific ICMP6 type only.
|
|
|
|
* This is important to deilver TOOBIG. Otherwise PMTUD
|
|
|
|
* will not work.
|
|
|
|
*/
|
|
|
|
switch (icmp6->icmp6_type) {
|
|
|
|
case ICMP6_DST_UNREACH:
|
|
|
|
case ICMP6_PACKET_TOO_BIG:
|
|
|
|
case ICMP6_TIME_EXCEEDED:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
icmp6stat.icp6s_inhist[icmp6->icmp6_type]++;
|
|
|
|
|
|
|
|
switch (icmp6->icmp6_type) {
|
|
|
|
case ICMP6_DST_UNREACH:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_dstunreach);
|
1999-06-28 10:36:47 +04:00
|
|
|
switch (code) {
|
|
|
|
case ICMP6_DST_UNREACH_NOROUTE:
|
|
|
|
code = PRC_UNREACH_NET;
|
|
|
|
break;
|
|
|
|
case ICMP6_DST_UNREACH_ADMIN:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_adminprohib);
|
2000-02-26 11:39:18 +03:00
|
|
|
code = PRC_UNREACH_PROTOCOL; /* is this a good code? */
|
|
|
|
break;
|
1999-06-28 10:36:47 +04:00
|
|
|
case ICMP6_DST_UNREACH_ADDR:
|
2000-02-26 11:39:18 +03:00
|
|
|
code = PRC_HOSTDEAD;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
2000-02-26 11:39:18 +03:00
|
|
|
#ifdef COMPAT_RFC1885
|
1999-06-28 10:36:47 +04:00
|
|
|
case ICMP6_DST_UNREACH_NOTNEIGHBOR:
|
|
|
|
code = PRC_UNREACH_SRCFAIL;
|
|
|
|
break;
|
2000-02-26 11:39:18 +03:00
|
|
|
#else
|
|
|
|
case ICMP6_DST_UNREACH_BEYONDSCOPE:
|
|
|
|
/* I mean "source address was incorrect." */
|
2001-10-15 15:12:44 +04:00
|
|
|
code = PRC_UNREACH_NET;
|
2000-02-26 11:39:18 +03:00
|
|
|
break;
|
2000-05-09 15:51:12 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
case ICMP6_DST_UNREACH_NOPORT:
|
|
|
|
code = PRC_UNREACH_PORT;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto badcode;
|
|
|
|
}
|
|
|
|
goto deliver;
|
|
|
|
|
|
|
|
case ICMP6_PACKET_TOO_BIG:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_pkttoobig);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
|
|
|
|
code = PRC_MSGSIZE;
|
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
/*
|
|
|
|
* Updating the path MTU will be done after examining
|
|
|
|
* intermediate extension headers.
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
goto deliver;
|
|
|
|
|
|
|
|
case ICMP6_TIME_EXCEEDED:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_timeexceed);
|
1999-06-28 10:36:47 +04:00
|
|
|
switch (code) {
|
|
|
|
case ICMP6_TIME_EXCEED_TRANSIT:
|
2001-10-15 15:12:44 +04:00
|
|
|
code = PRC_TIMXCEED_INTRANS;
|
|
|
|
break;
|
1999-06-28 10:36:47 +04:00
|
|
|
case ICMP6_TIME_EXCEED_REASSEMBLY:
|
2001-10-15 15:12:44 +04:00
|
|
|
code = PRC_TIMXCEED_REASS;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto badcode;
|
|
|
|
}
|
|
|
|
goto deliver;
|
|
|
|
|
|
|
|
case ICMP6_PARAM_PROB:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_paramprob);
|
1999-06-28 10:36:47 +04:00
|
|
|
switch (code) {
|
|
|
|
case ICMP6_PARAMPROB_NEXTHEADER:
|
|
|
|
code = PRC_UNREACH_PROTOCOL;
|
|
|
|
break;
|
|
|
|
case ICMP6_PARAMPROB_HEADER:
|
|
|
|
case ICMP6_PARAMPROB_OPTION:
|
|
|
|
code = PRC_PARAMPROB;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto badcode;
|
|
|
|
}
|
|
|
|
goto deliver;
|
|
|
|
|
|
|
|
case ICMP6_ECHO_REQUEST:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_echo);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
2001-10-15 15:12:44 +04:00
|
|
|
/*
|
|
|
|
* Copy mbuf to send to two data paths: userland socket(s),
|
|
|
|
* and to the querier (echo reply).
|
|
|
|
* m: a copy for socket, n: a copy for querier
|
|
|
|
*/
|
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* Give up local */
|
|
|
|
n = m;
|
|
|
|
m = NULL;
|
|
|
|
goto deliverecho;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2001-10-15 15:12:44 +04:00
|
|
|
/*
|
|
|
|
* If the first mbuf is shared, or the first mbuf is too short,
|
|
|
|
* copy the first part of the data into a fresh mbuf.
|
|
|
|
* Otherwise, we will wrongly overwrite both copies.
|
|
|
|
*/
|
|
|
|
if ((n->m_flags & M_EXT) != 0 ||
|
|
|
|
n->m_len < off + sizeof(struct icmp6_hdr)) {
|
1999-06-28 10:36:47 +04:00
|
|
|
struct mbuf *n0 = n;
|
2000-02-26 11:39:18 +03:00
|
|
|
const int maxlen = sizeof(*nip6) + sizeof(*nicmp6);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
2001-10-15 15:12:44 +04:00
|
|
|
* Prepare an internal mbuf. m_pullup() doesn't
|
1999-06-28 10:36:47 +04:00
|
|
|
* always copy the length we specified.
|
|
|
|
*/
|
2000-02-26 11:39:18 +03:00
|
|
|
if (maxlen >= MCLBYTES) {
|
|
|
|
/* Give up remote */
|
|
|
|
m_freem(n0);
|
|
|
|
break;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
MGETHDR(n, M_DONTWAIT, n0->m_type);
|
2000-02-26 11:39:18 +03:00
|
|
|
if (n && maxlen >= MHLEN) {
|
|
|
|
MCLGET(n, M_DONTWAIT);
|
|
|
|
if ((n->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(n);
|
|
|
|
n = NULL;
|
|
|
|
}
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
if (n == NULL) {
|
2001-10-15 15:12:44 +04:00
|
|
|
/* Give up local */
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(n0);
|
2001-10-15 15:12:44 +04:00
|
|
|
n = m;
|
|
|
|
m = NULL;
|
|
|
|
goto deliverecho;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
M_COPY_PKTHDR(n, n0);
|
|
|
|
/*
|
|
|
|
* Copy IPv6 and ICMPv6 only.
|
|
|
|
*/
|
|
|
|
nip6 = mtod(n, struct ip6_hdr *);
|
|
|
|
bcopy(ip6, nip6, sizeof(struct ip6_hdr));
|
|
|
|
nicmp6 = (struct icmp6_hdr *)(nip6 + 1);
|
|
|
|
bcopy(icmp6, nicmp6, sizeof(struct icmp6_hdr));
|
1999-12-13 18:17:17 +03:00
|
|
|
noff = sizeof(struct ip6_hdr);
|
2001-10-15 15:12:44 +04:00
|
|
|
n->m_len = noff + sizeof(struct icmp6_hdr);
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2001-10-15 15:12:44 +04:00
|
|
|
* Adjust mbuf. ip6_plen will be adjusted in
|
1999-12-13 18:17:17 +03:00
|
|
|
* ip6_output().
|
2001-10-15 15:12:44 +04:00
|
|
|
* n->m_pkthdr.len == n0->m_pkthdr.len at this point.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2001-10-15 15:12:44 +04:00
|
|
|
n->m_pkthdr.len += noff + sizeof(struct icmp6_hdr);
|
|
|
|
n->m_pkthdr.len -= (off + sizeof(struct icmp6_hdr));
|
1999-12-13 18:17:17 +03:00
|
|
|
m_adj(n0, off + sizeof(struct icmp6_hdr));
|
|
|
|
n->m_next = n0;
|
|
|
|
n0->m_flags &= ~M_PKTHDR;
|
1999-06-28 10:36:47 +04:00
|
|
|
} else {
|
2001-10-15 15:12:44 +04:00
|
|
|
deliverecho:
|
1999-06-28 10:36:47 +04:00
|
|
|
nip6 = mtod(n, struct ip6_hdr *);
|
|
|
|
nicmp6 = (struct icmp6_hdr *)((caddr_t)nip6 + off);
|
|
|
|
noff = off;
|
|
|
|
}
|
|
|
|
nicmp6->icmp6_type = ICMP6_ECHO_REPLY;
|
|
|
|
nicmp6->icmp6_code = 0;
|
1999-07-31 22:41:15 +04:00
|
|
|
if (n) {
|
|
|
|
icmp6stat.icp6s_reflect++;
|
|
|
|
icmp6stat.icp6s_outhist[ICMP6_ECHO_REPLY]++;
|
|
|
|
icmp6_reflect(n, noff);
|
|
|
|
}
|
2001-10-15 15:12:44 +04:00
|
|
|
if (!m)
|
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
|
|
|
|
|
|
|
case ICMP6_ECHO_REPLY:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_echoreply);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
break;
|
|
|
|
|
2003-06-06 12:13:43 +04:00
|
|
|
case MLD_LISTENER_QUERY:
|
|
|
|
case MLD_LISTENER_REPORT:
|
|
|
|
if (icmp6len < sizeof(struct mld_hdr))
|
1999-06-28 10:36:47 +04:00
|
|
|
goto badlen;
|
2003-06-06 12:13:43 +04:00
|
|
|
if (icmp6->icmp6_type == MLD_LISTENER_QUERY) /* XXX: ugly... */
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_mldquery);
|
|
|
|
else
|
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_mldreport);
|
2000-02-26 11:39:18 +03:00
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* give up local */
|
|
|
|
mld6_input(m, off);
|
|
|
|
m = NULL;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
mld6_input(n, off);
|
1999-06-28 10:36:47 +04:00
|
|
|
/* m stays. */
|
|
|
|
break;
|
|
|
|
|
2003-06-06 12:13:43 +04:00
|
|
|
case MLD_LISTENER_DONE:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_mlddone);
|
2003-06-06 12:13:43 +04:00
|
|
|
if (icmp6len < sizeof(struct mld_hdr)) /* necessary? */
|
1999-06-28 10:36:47 +04:00
|
|
|
goto badlen;
|
|
|
|
break; /* nothing to be done in kernel */
|
|
|
|
|
2003-06-06 12:13:43 +04:00
|
|
|
case MLD_MTRACE_RESP:
|
|
|
|
case MLD_MTRACE:
|
2001-12-21 11:54:52 +03:00
|
|
|
/* XXX: these two are experimental. not officially defined. */
|
1999-12-13 18:17:17 +03:00
|
|
|
/* XXX: per-interface statistics? */
|
2000-02-26 11:39:18 +03:00
|
|
|
break; /* just pass it to applications */
|
1999-12-13 18:17:17 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
case ICMP6_WRUREQUEST: /* ICMP6_FQDN_QUERY */
|
|
|
|
{
|
|
|
|
enum { WRU, FQDN } mode;
|
|
|
|
|
2000-01-02 19:31:17 +03:00
|
|
|
if (!icmp6_nodeinfo)
|
|
|
|
break;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (icmp6len == sizeof(struct icmp6_hdr) + 4)
|
|
|
|
mode = WRU;
|
2000-06-12 20:21:02 +04:00
|
|
|
else if (icmp6len >= sizeof(struct icmp6_nodeinfo))
|
1999-06-28 10:36:47 +04:00
|
|
|
mode = FQDN;
|
|
|
|
else
|
|
|
|
goto badlen;
|
|
|
|
|
|
|
|
if (mode == FQDN) {
|
2001-10-15 15:12:44 +04:00
|
|
|
n = m_copym(m, 0, M_COPYALL, M_DONTWAIT);
|
2000-01-02 19:31:17 +03:00
|
|
|
if (n)
|
|
|
|
n = ni6_input(n, off);
|
2000-06-12 20:21:02 +04:00
|
|
|
/* XXX meaningless if n == NULL */
|
|
|
|
noff = sizeof(struct ip6_hdr);
|
2000-01-02 19:31:17 +03:00
|
|
|
} else {
|
1999-06-28 10:36:47 +04:00
|
|
|
u_char *p;
|
2000-02-26 11:39:18 +03:00
|
|
|
int maxlen, maxhlen;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2002-06-09 00:06:44 +04:00
|
|
|
if ((icmp6_nodeinfo & 5) != 5)
|
2001-10-15 15:12:44 +04:00
|
|
|
break;
|
|
|
|
|
2000-06-12 20:21:02 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
2000-02-26 11:39:18 +03:00
|
|
|
maxlen = sizeof(*nip6) + sizeof(*nicmp6) + 4;
|
|
|
|
if (maxlen >= MCLBYTES) {
|
|
|
|
/* Give up remote */
|
|
|
|
break;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
MGETHDR(n, M_DONTWAIT, m->m_type);
|
2000-02-26 11:39:18 +03:00
|
|
|
if (n && maxlen > MHLEN) {
|
|
|
|
MCLGET(n, M_DONTWAIT);
|
|
|
|
if ((n->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(n);
|
|
|
|
n = NULL;
|
|
|
|
}
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
if (n == NULL) {
|
|
|
|
/* Give up remote */
|
|
|
|
break;
|
|
|
|
}
|
2001-10-15 15:12:44 +04:00
|
|
|
n->m_pkthdr.rcvif = NULL;
|
2000-02-26 11:39:18 +03:00
|
|
|
n->m_len = 0;
|
|
|
|
maxhlen = M_TRAILINGSPACE(n) - maxlen;
|
|
|
|
if (maxhlen > hostnamelen)
|
|
|
|
maxhlen = hostnamelen;
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Copy IPv6 and ICMPv6 only.
|
|
|
|
*/
|
|
|
|
nip6 = mtod(n, struct ip6_hdr *);
|
|
|
|
bcopy(ip6, nip6, sizeof(struct ip6_hdr));
|
|
|
|
nicmp6 = (struct icmp6_hdr *)(nip6 + 1);
|
|
|
|
bcopy(icmp6, nicmp6, sizeof(struct icmp6_hdr));
|
|
|
|
p = (u_char *)(nicmp6 + 1);
|
|
|
|
bzero(p, 4);
|
2001-10-15 15:12:44 +04:00
|
|
|
bcopy(hostname, p + 4, maxhlen); /* meaningless TTL */
|
1999-06-28 10:36:47 +04:00
|
|
|
noff = sizeof(struct ip6_hdr);
|
2001-12-21 11:54:52 +03:00
|
|
|
M_COPY_PKTHDR(n, m); /* just for rcvif */
|
1999-06-28 10:36:47 +04:00
|
|
|
n->m_pkthdr.len = n->m_len = sizeof(struct ip6_hdr) +
|
2000-02-26 11:39:18 +03:00
|
|
|
sizeof(struct icmp6_hdr) + 4 + maxhlen;
|
1999-06-28 10:36:47 +04:00
|
|
|
nicmp6->icmp6_type = ICMP6_WRUREPLY;
|
|
|
|
nicmp6->icmp6_code = 0;
|
|
|
|
}
|
|
|
|
#undef hostnamelen
|
|
|
|
if (n) {
|
|
|
|
icmp6stat.icp6s_reflect++;
|
|
|
|
icmp6stat.icp6s_outhist[ICMP6_WRUREPLY]++;
|
|
|
|
icmp6_reflect(n, noff);
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
case ICMP6_WRUREPLY:
|
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ND_ROUTER_SOLICIT:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_routersolicit);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
if (icmp6len < sizeof(struct nd_router_solicit))
|
|
|
|
goto badlen;
|
2000-02-26 11:39:18 +03:00
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* give up local */
|
|
|
|
nd6_rs_input(m, off, icmp6len);
|
|
|
|
m = NULL;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
nd6_rs_input(n, off, icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
/* m stays. */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ND_ROUTER_ADVERT:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_routeradvert);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
if (icmp6len < sizeof(struct nd_router_advert))
|
|
|
|
goto badlen;
|
2000-02-26 11:39:18 +03:00
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* give up local */
|
|
|
|
nd6_ra_input(m, off, icmp6len);
|
|
|
|
m = NULL;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
nd6_ra_input(n, off, icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
/* m stays. */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ND_NEIGHBOR_SOLICIT:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_neighborsolicit);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
if (icmp6len < sizeof(struct nd_neighbor_solicit))
|
|
|
|
goto badlen;
|
2000-02-26 11:39:18 +03:00
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* give up local */
|
|
|
|
nd6_ns_input(m, off, icmp6len);
|
|
|
|
m = NULL;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
nd6_ns_input(n, off, icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
/* m stays. */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ND_NEIGHBOR_ADVERT:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_neighboradvert);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
if (icmp6len < sizeof(struct nd_neighbor_advert))
|
|
|
|
goto badlen;
|
2000-02-26 11:39:18 +03:00
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* give up local */
|
|
|
|
nd6_na_input(m, off, icmp6len);
|
|
|
|
m = NULL;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
nd6_na_input(n, off, icmp6len);
|
1999-06-28 10:36:47 +04:00
|
|
|
/* m stays. */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ND_REDIRECT:
|
1999-12-13 18:17:17 +03:00
|
|
|
icmp6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_redirect);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (code != 0)
|
|
|
|
goto badcode;
|
|
|
|
if (icmp6len < sizeof(struct nd_redirect))
|
|
|
|
goto badlen;
|
2000-02-26 11:39:18 +03:00
|
|
|
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
|
|
|
|
/* give up local */
|
|
|
|
icmp6_redirect_input(m, off);
|
|
|
|
m = NULL;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
icmp6_redirect_input(n, off);
|
1999-06-28 10:36:47 +04:00
|
|
|
/* m stays. */
|
|
|
|
break;
|
|
|
|
|
|
|
|
case ICMP6_ROUTER_RENUMBERING:
|
|
|
|
if (code != ICMP6_ROUTER_RENUMBERING_COMMAND &&
|
|
|
|
code != ICMP6_ROUTER_RENUMBERING_RESULT)
|
|
|
|
goto badcode;
|
|
|
|
if (icmp6len < sizeof(struct icmp6_router_renum))
|
|
|
|
goto badlen;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_DEBUG,
|
|
|
|
"icmp6_input: unknown type %d(src=%s, dst=%s, ifid=%d)\n",
|
|
|
|
icmp6->icmp6_type, ip6_sprintf(&ip6->ip6_src),
|
|
|
|
ip6_sprintf(&ip6->ip6_dst),
|
|
|
|
m->m_pkthdr.rcvif ? m->m_pkthdr.rcvif->if_index : 0));
|
1999-06-28 10:36:47 +04:00
|
|
|
if (icmp6->icmp6_type < ICMP6_ECHO_REQUEST) {
|
|
|
|
/* ICMPv6 error: MUST deliver it by spec... */
|
|
|
|
code = PRC_NCMDS;
|
|
|
|
/* deliver */
|
|
|
|
} else {
|
|
|
|
/* ICMPv6 informational: MUST not deliver */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
deliver:
|
2001-02-11 09:49:49 +03:00
|
|
|
if (icmp6_notify_error(m, off, icmp6len, code)) {
|
|
|
|
/* In this case, m should've been freed. */
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2001-02-11 09:49:49 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
badcode:
|
|
|
|
icmp6stat.icp6s_badcode++;
|
|
|
|
break;
|
|
|
|
|
|
|
|
badlen:
|
|
|
|
icmp6stat.icp6s_badlen++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* deliver the packet to appropriate sockets */
|
|
|
|
icmp6_rip6_input(&m, *offp);
|
|
|
|
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
|
|
|
|
freeit:
|
|
|
|
m_freem(m);
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
icmp6_notify_error(m, off, icmp6len, code)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off, icmp6len;
|
|
|
|
{
|
|
|
|
struct icmp6_hdr *icmp6;
|
|
|
|
struct ip6_hdr *eip6;
|
|
|
|
u_int32_t notifymtu;
|
|
|
|
struct sockaddr_in6 icmp6src, icmp6dst;
|
|
|
|
|
|
|
|
if (icmp6len < sizeof(struct icmp6_hdr) + sizeof(struct ip6_hdr)) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
IP6_EXTHDR_GET(icmp6, struct icmp6_hdr *, m, off,
|
|
|
|
sizeof(*icmp6) + sizeof(struct ip6_hdr));
|
|
|
|
if (icmp6 == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
2001-02-11 09:49:49 +03:00
|
|
|
}
|
|
|
|
eip6 = (struct ip6_hdr *)(icmp6 + 1);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-02-11 09:49:49 +03:00
|
|
|
/* Detect the upper level protocol */
|
|
|
|
{
|
1999-12-13 18:17:17 +03:00
|
|
|
void (*ctlfunc) __P((int, struct sockaddr *, void *));
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int8_t nxt = eip6->ip6_nxt;
|
|
|
|
int eoff = off + sizeof(struct icmp6_hdr) +
|
|
|
|
sizeof(struct ip6_hdr);
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ip6ctlparam ip6cp;
|
2000-02-26 11:39:18 +03:00
|
|
|
struct in6_addr *finaldst = NULL;
|
2001-02-11 09:49:49 +03:00
|
|
|
int icmp6type = icmp6->icmp6_type;
|
2000-02-26 11:39:18 +03:00
|
|
|
struct ip6_frag *fh;
|
|
|
|
struct ip6_rthdr *rth;
|
|
|
|
struct ip6_rthdr0 *rth0;
|
|
|
|
int rthlen;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-10-15 15:12:44 +04:00
|
|
|
while (1) { /* XXX: should avoid infinite loop explicitly? */
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ip6_ext *eh;
|
|
|
|
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (nxt) {
|
1999-06-28 10:36:47 +04:00
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
case IPPROTO_AH:
|
1999-12-13 18:17:17 +03:00
|
|
|
IP6_EXTHDR_GET(eh, struct ip6_ext *, m,
|
2001-02-11 09:49:49 +03:00
|
|
|
eoff, sizeof(*eh));
|
1999-12-13 18:17:17 +03:00
|
|
|
if (eh == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
2002-06-09 18:43:10 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (nxt == IPPROTO_AH)
|
|
|
|
eoff += (eh->ip6e_len + 2) << 2;
|
|
|
|
else
|
|
|
|
eoff += (eh->ip6e_len + 1) << 3;
|
|
|
|
nxt = eh->ip6e_nxt;
|
|
|
|
break;
|
2000-02-26 11:39:18 +03:00
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
/*
|
|
|
|
* When the erroneous packet contains a
|
|
|
|
* routing header, we should examine the
|
|
|
|
* header to determine the final destination.
|
|
|
|
* Otherwise, we can't properly update
|
|
|
|
* information that depends on the final
|
|
|
|
* destination (e.g. path MTU).
|
|
|
|
*/
|
|
|
|
IP6_EXTHDR_GET(rth, struct ip6_rthdr *, m,
|
2001-02-11 09:49:49 +03:00
|
|
|
eoff, sizeof(*rth));
|
2000-02-26 11:39:18 +03:00
|
|
|
if (rth == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
|
|
|
rthlen = (rth->ip6r_len + 1) << 3;
|
|
|
|
/*
|
|
|
|
* XXX: currently there is no
|
|
|
|
* officially defined type other
|
|
|
|
* than type-0.
|
|
|
|
* Note that if the segment left field
|
|
|
|
* is 0, all intermediate hops must
|
|
|
|
* have been passed.
|
|
|
|
*/
|
|
|
|
if (rth->ip6r_segleft &&
|
|
|
|
rth->ip6r_type == IPV6_RTHDR_TYPE_0) {
|
|
|
|
int hops;
|
|
|
|
|
|
|
|
IP6_EXTHDR_GET(rth0,
|
|
|
|
struct ip6_rthdr0 *, m,
|
|
|
|
eoff, rthlen);
|
|
|
|
if (rth0 == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
|
|
|
/* just ignore a bogus header */
|
|
|
|
if ((rth0->ip6r0_len % 2) == 0 &&
|
|
|
|
(hops = rth0->ip6r0_len/2))
|
|
|
|
finaldst = (struct in6_addr *)(rth0 + 1) + (hops - 1);
|
|
|
|
}
|
|
|
|
eoff += rthlen;
|
|
|
|
nxt = rth->ip6r_nxt;
|
|
|
|
break;
|
|
|
|
case IPPROTO_FRAGMENT:
|
|
|
|
IP6_EXTHDR_GET(fh, struct ip6_frag *, m,
|
2001-02-11 09:49:49 +03:00
|
|
|
eoff, sizeof(*fh));
|
2000-02-26 11:39:18 +03:00
|
|
|
if (fh == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Data after a fragment header is meaningless
|
|
|
|
* unless it is the first fragment, but
|
|
|
|
* we'll go to the notify label for path MTU
|
|
|
|
* discovery.
|
|
|
|
*/
|
|
|
|
if (fh->ip6f_offlg & IP6F_OFF_MASK)
|
|
|
|
goto notify;
|
|
|
|
|
|
|
|
eoff += sizeof(struct ip6_frag);
|
|
|
|
nxt = fh->ip6f_nxt;
|
|
|
|
break;
|
1999-06-28 10:36:47 +04:00
|
|
|
default:
|
2000-02-26 11:39:18 +03:00
|
|
|
/*
|
|
|
|
* This case includes ESP and the No Next
|
2001-10-15 15:12:44 +04:00
|
|
|
* Header. In such cases going to the notify
|
2000-02-26 11:39:18 +03:00
|
|
|
* label does not have any meaning
|
|
|
|
* (i.e. ctlfunc will be NULL), but we go
|
|
|
|
* anyway since we might have to update
|
|
|
|
* path MTU information.
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
goto notify;
|
|
|
|
}
|
|
|
|
}
|
2001-02-11 09:49:49 +03:00
|
|
|
notify:
|
1999-12-13 18:17:17 +03:00
|
|
|
IP6_EXTHDR_GET(icmp6, struct icmp6_hdr *, m, off,
|
2001-02-11 09:49:49 +03:00
|
|
|
sizeof(*icmp6) + sizeof(struct ip6_hdr));
|
1999-12-13 18:17:17 +03:00
|
|
|
if (icmp6 == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
2001-02-11 09:49:49 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
eip6 = (struct ip6_hdr *)(icmp6 + 1);
|
|
|
|
bzero(&icmp6dst, sizeof(icmp6dst));
|
|
|
|
icmp6dst.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
icmp6dst.sin6_family = AF_INET6;
|
|
|
|
if (finaldst == NULL)
|
|
|
|
icmp6dst.sin6_addr = eip6->ip6_dst;
|
|
|
|
else
|
|
|
|
icmp6dst.sin6_addr = *finaldst;
|
|
|
|
icmp6dst.sin6_scope_id = in6_addr2scopeid(m->m_pkthdr.rcvif,
|
|
|
|
&icmp6dst.sin6_addr);
|
|
|
|
#ifndef SCOPEDROUTING
|
|
|
|
if (in6_embedscope(&icmp6dst.sin6_addr, &icmp6dst,
|
|
|
|
NULL, NULL)) {
|
|
|
|
/* should be impossbile */
|
|
|
|
nd6log((LOG_DEBUG,
|
|
|
|
"icmp6_notify_error: in6_embedscope failed\n"));
|
|
|
|
goto freeit;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
|
|
|
#endif
|
2001-02-11 09:49:49 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* retrieve parameters from the inner IPv6 header, and convert
|
|
|
|
* them into sockaddr structures.
|
|
|
|
*/
|
|
|
|
bzero(&icmp6src, sizeof(icmp6src));
|
|
|
|
icmp6src.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
icmp6src.sin6_family = AF_INET6;
|
|
|
|
icmp6src.sin6_addr = eip6->ip6_src;
|
|
|
|
icmp6src.sin6_scope_id = in6_addr2scopeid(m->m_pkthdr.rcvif,
|
|
|
|
&icmp6src.sin6_addr);
|
|
|
|
#ifndef SCOPEDROUTING
|
|
|
|
if (in6_embedscope(&icmp6src.sin6_addr, &icmp6src,
|
|
|
|
NULL, NULL)) {
|
|
|
|
/* should be impossbile */
|
|
|
|
nd6log((LOG_DEBUG,
|
|
|
|
"icmp6_notify_error: in6_embedscope failed\n"));
|
|
|
|
goto freeit;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
icmp6src.sin6_flowinfo =
|
|
|
|
(eip6->ip6_flow & IPV6_FLOWLABEL_MASK);
|
|
|
|
|
2000-10-19 01:14:12 +04:00
|
|
|
if (finaldst == NULL)
|
2001-02-11 09:49:49 +03:00
|
|
|
finaldst = &eip6->ip6_dst;
|
2000-10-19 01:14:12 +04:00
|
|
|
ip6cp.ip6c_m = m;
|
|
|
|
ip6cp.ip6c_icmp6 = icmp6;
|
|
|
|
ip6cp.ip6c_ip6 = (struct ip6_hdr *)(icmp6 + 1);
|
|
|
|
ip6cp.ip6c_off = eoff;
|
|
|
|
ip6cp.ip6c_finaldst = finaldst;
|
2001-02-11 09:49:49 +03:00
|
|
|
ip6cp.ip6c_src = &icmp6src;
|
|
|
|
ip6cp.ip6c_nxt = nxt;
|
|
|
|
|
|
|
|
if (icmp6type == ICMP6_PACKET_TOO_BIG) {
|
|
|
|
notifymtu = ntohl(icmp6->icmp6_mtu);
|
|
|
|
ip6cp.ip6c_cmdarg = (void *)¬ifymtu;
|
|
|
|
}
|
2000-02-26 11:39:18 +03:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
ctlfunc = (void (*) __P((int, struct sockaddr *, void *)))
|
1999-06-28 10:36:47 +04:00
|
|
|
(inet6sw[ip6_protox[nxt]].pr_ctlinput);
|
1999-12-13 18:17:17 +03:00
|
|
|
if (ctlfunc) {
|
2001-02-11 09:49:49 +03:00
|
|
|
(void) (*ctlfunc)(code, (struct sockaddr *)&icmp6dst,
|
|
|
|
&ip6cp);
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-09-11 06:46:42 +04:00
|
|
|
return (0);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-02-11 09:49:49 +03:00
|
|
|
freeit:
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (-1);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2000-10-19 01:14:12 +04:00
|
|
|
void
|
2000-12-09 04:29:45 +03:00
|
|
|
icmp6_mtudisc_update(ip6cp, validated)
|
2000-10-19 01:14:12 +04:00
|
|
|
struct ip6ctlparam *ip6cp;
|
2000-12-09 04:29:45 +03:00
|
|
|
int validated;
|
2000-02-26 11:39:18 +03:00
|
|
|
{
|
2000-12-09 04:29:45 +03:00
|
|
|
unsigned long rtcount;
|
2000-10-19 01:14:12 +04:00
|
|
|
struct icmp6_mtudisc_callback *mc;
|
|
|
|
struct in6_addr *dst = ip6cp->ip6c_finaldst;
|
|
|
|
struct icmp6_hdr *icmp6 = ip6cp->ip6c_icmp6;
|
|
|
|
struct mbuf *m = ip6cp->ip6c_m; /* will be necessary for scope issue */
|
2000-02-26 11:39:18 +03:00
|
|
|
u_int mtu = ntohl(icmp6->icmp6_mtu);
|
|
|
|
struct rtentry *rt = NULL;
|
|
|
|
struct sockaddr_in6 sin6;
|
|
|
|
|
2000-12-09 04:29:45 +03:00
|
|
|
/*
|
|
|
|
* allow non-validated cases if memory is plenty, to make traffic
|
|
|
|
* from non-connected pcb happy.
|
|
|
|
*/
|
|
|
|
rtcount = rt_timer_count(icmp6_mtudisc_timeout_q);
|
|
|
|
if (validated) {
|
2001-02-08 19:07:39 +03:00
|
|
|
if (0 <= icmp6_mtudisc_hiwat && rtcount > icmp6_mtudisc_hiwat)
|
2000-12-09 04:29:45 +03:00
|
|
|
return;
|
2001-02-08 19:07:39 +03:00
|
|
|
else if (0 <= icmp6_mtudisc_lowat &&
|
|
|
|
rtcount > icmp6_mtudisc_lowat) {
|
2000-12-09 04:29:45 +03:00
|
|
|
/*
|
|
|
|
* XXX nuke a victim, install the new one.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
} else {
|
2001-02-08 19:07:39 +03:00
|
|
|
if (0 <= icmp6_mtudisc_lowat && rtcount > icmp6_mtudisc_lowat)
|
2000-12-09 04:29:45 +03:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
bzero(&sin6, sizeof(sin6));
|
|
|
|
sin6.sin6_family = PF_INET6;
|
|
|
|
sin6.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
sin6.sin6_addr = *dst;
|
2000-10-19 01:14:12 +04:00
|
|
|
/* XXX normally, this won't happen */
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(dst)) {
|
|
|
|
sin6.sin6_addr.s6_addr16[1] =
|
|
|
|
htons(m->m_pkthdr.rcvif->if_index);
|
|
|
|
}
|
2000-02-26 11:39:18 +03:00
|
|
|
/* sin6.sin6_scope_id = XXX: should be set if DST is a scoped addr */
|
2000-12-11 22:28:47 +03:00
|
|
|
rt = icmp6_mtudisc_clone((struct sockaddr *)&sin6);
|
2000-02-26 11:39:18 +03:00
|
|
|
|
2002-05-31 08:26:19 +04:00
|
|
|
if (rt && (rt->rt_flags & RTF_HOST) &&
|
|
|
|
!(rt->rt_rmx.rmx_locks & RTV_MTU) &&
|
|
|
|
(rt->rt_rmx.rmx_mtu > mtu || rt->rt_rmx.rmx_mtu == 0)) {
|
|
|
|
if (mtu < IN6_LINKMTU(rt->rt_ifp)) {
|
2000-10-19 01:14:12 +04:00
|
|
|
icmp6stat.icp6s_pmtuchg++;
|
2000-02-26 11:39:18 +03:00
|
|
|
rt->rt_rmx.rmx_mtu = mtu;
|
|
|
|
}
|
|
|
|
}
|
2001-10-15 15:12:44 +04:00
|
|
|
if (rt) { /* XXX: need braces to avoid conflict with else in RTFREE. */
|
2000-02-26 11:39:18 +03:00
|
|
|
RTFREE(rt);
|
2001-10-15 15:12:44 +04:00
|
|
|
}
|
2000-10-19 01:14:12 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Notify protocols that the MTU for this destination
|
|
|
|
* has changed.
|
|
|
|
*/
|
|
|
|
for (mc = LIST_FIRST(&icmp6_mtudisc_callbacks); mc != NULL;
|
|
|
|
mc = LIST_NEXT(mc, mc_list))
|
|
|
|
(*mc->mc_func)(&sin6.sin6_addr);
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2000-08-03 18:31:04 +04:00
|
|
|
* Process a Node Information Query packet, based on
|
2000-11-11 03:46:36 +03:00
|
|
|
* draft-ietf-ipngwg-icmp-name-lookups-07.
|
2002-06-09 00:06:44 +04:00
|
|
|
*
|
2000-06-12 20:21:02 +04:00
|
|
|
* Spec incompatibilities:
|
|
|
|
* - IPv6 Subject address handling
|
|
|
|
* - IPv4 Subject address handling support missing
|
|
|
|
* - Proxy reply (answer even if it's not for me)
|
|
|
|
* - joins NI group address at in6_ifattach() time only, does not cope
|
|
|
|
* with hostname changes by sethostname(3)
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
#ifndef offsetof /* XXX */
|
|
|
|
#define offsetof(type, member) ((size_t)(&((type *)0)->member))
|
2000-05-09 15:51:12 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
static struct mbuf *
|
|
|
|
ni6_input(m, off)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
{
|
1999-12-13 18:17:17 +03:00
|
|
|
struct icmp6_nodeinfo *ni6, *nni6;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct mbuf *n = NULL;
|
1999-12-13 18:17:17 +03:00
|
|
|
u_int16_t qtype;
|
2000-06-12 20:21:02 +04:00
|
|
|
int subjlen;
|
1999-06-28 10:36:47 +04:00
|
|
|
int replylen = sizeof(struct ip6_hdr) + sizeof(struct icmp6_nodeinfo);
|
|
|
|
struct ni_reply_fqdn *fqdn;
|
|
|
|
int addrs; /* for NI_QTYPE_NODEADDR */
|
|
|
|
struct ifnet *ifp = NULL; /* for NI_QTYPE_NODEADDR */
|
2000-11-11 03:46:36 +03:00
|
|
|
struct sockaddr_in6 sin6; /* double meaning; ip6_dst and subjectaddr */
|
2000-06-12 20:21:02 +04:00
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
int oldfqdn = 0; /* if 1, return pascal string (03 draft) */
|
2000-11-11 03:46:36 +03:00
|
|
|
char *subj = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-06-12 20:21:02 +04:00
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
2000-01-02 19:31:17 +03:00
|
|
|
IP6_EXTHDR_GET(ni6, struct icmp6_nodeinfo *, m, off, sizeof(*ni6));
|
|
|
|
if (ni6 == NULL) {
|
|
|
|
/* m is already reclaimed */
|
1999-12-13 18:17:17 +03:00
|
|
|
return NULL;
|
2000-01-02 19:31:17 +03:00
|
|
|
}
|
2000-06-12 20:21:02 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Validate IPv6 destination address.
|
|
|
|
*
|
2000-11-11 03:46:36 +03:00
|
|
|
* The Responder must discard the Query without further processing
|
|
|
|
* unless it is one of the Responder's unicast or anycast addresses, or
|
|
|
|
* a link-local scope multicast address which the Responder has joined.
|
|
|
|
* [icmp-name-lookups-07, Section 4.]
|
2000-06-12 20:21:02 +04:00
|
|
|
*/
|
|
|
|
bzero(&sin6, sizeof(sin6));
|
|
|
|
sin6.sin6_family = AF_INET6;
|
|
|
|
sin6.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
bcopy(&ip6->ip6_dst, &sin6.sin6_addr, sizeof(sin6.sin6_addr));
|
|
|
|
/* XXX scopeid */
|
|
|
|
if (ifa_ifwithaddr((struct sockaddr *)&sin6))
|
2000-11-11 03:46:36 +03:00
|
|
|
; /* unicast/anycast, fine */
|
2000-06-12 20:21:02 +04:00
|
|
|
else if (IN6_IS_ADDR_MC_LINKLOCAL(&sin6.sin6_addr))
|
2000-11-11 03:46:36 +03:00
|
|
|
; /* link-local multicast, fine */
|
2000-06-12 20:21:02 +04:00
|
|
|
else
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
/* validate query Subject field. */
|
2000-11-11 03:46:36 +03:00
|
|
|
qtype = ntohs(ni6->ni_qtype);
|
2000-06-12 20:21:02 +04:00
|
|
|
subjlen = m->m_pkthdr.len - off - sizeof(struct icmp6_nodeinfo);
|
|
|
|
switch (qtype) {
|
|
|
|
case NI_QTYPE_NOOP:
|
|
|
|
case NI_QTYPE_SUPTYPES:
|
2000-11-11 03:46:36 +03:00
|
|
|
/* 07 draft */
|
2000-08-03 18:31:04 +04:00
|
|
|
if (ni6->ni_code == ICMP6_NI_SUBJ_FQDN && subjlen == 0)
|
|
|
|
break;
|
2001-10-15 15:12:44 +04:00
|
|
|
/* FALLTHROUGH */
|
2000-06-12 20:21:02 +04:00
|
|
|
case NI_QTYPE_FQDN:
|
|
|
|
case NI_QTYPE_NODEADDR:
|
|
|
|
switch (ni6->ni_code) {
|
|
|
|
case ICMP6_NI_SUBJ_IPV6:
|
|
|
|
#if ICMP6_NI_SUBJ_IPV6 != 0
|
|
|
|
case 0:
|
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* backward compatibility - try to accept 03 draft
|
|
|
|
* format, where no Subject is present.
|
|
|
|
*/
|
2000-08-03 18:31:04 +04:00
|
|
|
if (qtype == NI_QTYPE_FQDN && ni6->ni_code == 0 &&
|
|
|
|
subjlen == 0) {
|
2000-06-12 20:21:02 +04:00
|
|
|
oldfqdn++;
|
|
|
|
break;
|
|
|
|
}
|
2000-08-03 18:31:04 +04:00
|
|
|
#if ICMP6_NI_SUBJ_IPV6 != 0
|
|
|
|
if (ni6->ni_code != ICMP6_NI_SUBJ_IPV6)
|
|
|
|
goto bad;
|
|
|
|
#endif
|
2000-06-12 20:21:02 +04:00
|
|
|
|
|
|
|
if (subjlen != sizeof(sin6.sin6_addr))
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Validate Subject address.
|
|
|
|
*
|
2001-02-07 11:59:47 +03:00
|
|
|
* Not sure what exactly "address belongs to the node"
|
|
|
|
* means in the spec, is it just unicast, or what?
|
2000-06-12 20:21:02 +04:00
|
|
|
*
|
|
|
|
* At this moment we consider Subject address as
|
|
|
|
* "belong to the node" if the Subject address equals
|
|
|
|
* to the IPv6 destination address; validation for
|
|
|
|
* IPv6 destination address should have done enough
|
|
|
|
* check for us.
|
|
|
|
*
|
|
|
|
* We do not do proxy at this moment.
|
|
|
|
*/
|
|
|
|
/* m_pulldown instead of copy? */
|
|
|
|
m_copydata(m, off + sizeof(struct icmp6_nodeinfo),
|
|
|
|
subjlen, (caddr_t)&sin6.sin6_addr);
|
|
|
|
/* XXX kame scope hack */
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&sin6.sin6_addr)) {
|
|
|
|
if ((m->m_flags & M_PKTHDR) != 0 &&
|
|
|
|
m->m_pkthdr.rcvif) {
|
|
|
|
sin6.sin6_addr.s6_addr16[1] =
|
|
|
|
htons(m->m_pkthdr.rcvif->if_index);
|
|
|
|
}
|
|
|
|
}
|
2000-11-11 03:46:36 +03:00
|
|
|
subj = (char *)&sin6;
|
2000-06-12 20:21:02 +04:00
|
|
|
if (IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst, &sin6.sin6_addr))
|
|
|
|
break;
|
2000-11-11 03:46:36 +03:00
|
|
|
|
2000-06-12 20:21:02 +04:00
|
|
|
/*
|
|
|
|
* XXX if we are to allow other cases, we should really
|
|
|
|
* be careful about scope here.
|
|
|
|
* basically, we should disallow queries toward IPv6
|
|
|
|
* destination X with subject Y, if scope(X) > scope(Y).
|
|
|
|
* if we allow scope(X) > scope(Y), it will result in
|
|
|
|
* information leakage across scope boundary.
|
|
|
|
*/
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
case ICMP6_NI_SUBJ_FQDN:
|
|
|
|
/*
|
|
|
|
* Validate Subject name with gethostname(3).
|
|
|
|
*
|
|
|
|
* The behavior may need some debate, since:
|
|
|
|
* - we are not sure if the node has FQDN as
|
|
|
|
* hostname (returned by gethostname(3)).
|
|
|
|
* - the code does wildcard match for truncated names.
|
|
|
|
* however, we are not sure if we want to perform
|
|
|
|
* wildcard match, if gethostname(3) side has
|
|
|
|
* truncated hostname.
|
|
|
|
*/
|
|
|
|
n = ni6_nametodns(hostname, hostnamelen, 0);
|
|
|
|
if (!n || n->m_next || n->m_len == 0)
|
|
|
|
goto bad;
|
|
|
|
IP6_EXTHDR_GET(subj, char *, m,
|
|
|
|
off + sizeof(struct icmp6_nodeinfo), subjlen);
|
|
|
|
if (subj == NULL)
|
|
|
|
goto bad;
|
|
|
|
if (!ni6_dnsmatch(subj, subjlen, mtod(n, const char *),
|
|
|
|
n->m_len)) {
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
m_freem(n);
|
|
|
|
n = NULL;
|
|
|
|
break;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
case ICMP6_NI_SUBJ_IPV4: /* XXX: to be implemented? */
|
2000-06-12 20:21:02 +04:00
|
|
|
default:
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
break;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2001-10-15 15:12:44 +04:00
|
|
|
/* refuse based on configuration. XXX ICMP6_NI_REFUSED? */
|
|
|
|
switch (qtype) {
|
|
|
|
case NI_QTYPE_FQDN:
|
|
|
|
if ((icmp6_nodeinfo & 1) == 0)
|
|
|
|
goto bad;
|
|
|
|
break;
|
|
|
|
case NI_QTYPE_NODEADDR:
|
|
|
|
if ((icmp6_nodeinfo & 2) == 0)
|
|
|
|
goto bad;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
/* guess reply length */
|
|
|
|
switch (qtype) {
|
|
|
|
case NI_QTYPE_NOOP:
|
|
|
|
break; /* no reply data */
|
|
|
|
case NI_QTYPE_SUPTYPES:
|
|
|
|
replylen += sizeof(u_int32_t);
|
|
|
|
break;
|
|
|
|
case NI_QTYPE_FQDN:
|
|
|
|
/* XXX will append an mbuf */
|
|
|
|
replylen += offsetof(struct ni_reply_fqdn, ni_fqdn_namelen);
|
|
|
|
break;
|
|
|
|
case NI_QTYPE_NODEADDR:
|
|
|
|
addrs = ni6_addrs(ni6, m, &ifp, subj);
|
|
|
|
if ((replylen += addrs * (sizeof(struct in6_addr) +
|
|
|
|
sizeof(u_int32_t))) > MCLBYTES)
|
|
|
|
replylen = MCLBYTES; /* XXX: will truncate pkt later */
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/*
|
|
|
|
* XXX: We must return a reply with the ICMP6 code
|
2001-10-15 15:12:44 +04:00
|
|
|
* `unknown Qtype' in this case. However we regard the case
|
2000-11-11 03:46:36 +03:00
|
|
|
* as an FQDN query for backward compatibility.
|
|
|
|
* Older versions set a random value to this field,
|
|
|
|
* so it rarely varies in the defined qtypes.
|
|
|
|
* But the mechanism is not reliable...
|
|
|
|
* maybe we should obsolete older versions.
|
|
|
|
*/
|
|
|
|
qtype = NI_QTYPE_FQDN;
|
|
|
|
/* XXX will append an mbuf */
|
|
|
|
replylen += offsetof(struct ni_reply_fqdn, ni_fqdn_namelen);
|
|
|
|
oldfqdn++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* allocate an mbuf to reply. */
|
1999-06-28 10:36:47 +04:00
|
|
|
MGETHDR(n, M_DONTWAIT, m->m_type);
|
2000-01-02 19:31:17 +03:00
|
|
|
if (n == NULL) {
|
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (NULL);
|
2000-01-02 19:31:17 +03:00
|
|
|
}
|
2001-12-21 11:54:52 +03:00
|
|
|
M_COPY_PKTHDR(n, m); /* just for rcvif */
|
1999-06-28 10:36:47 +04:00
|
|
|
if (replylen > MHLEN) {
|
2000-06-12 20:21:02 +04:00
|
|
|
if (replylen > MCLBYTES) {
|
2001-02-07 11:59:47 +03:00
|
|
|
/*
|
|
|
|
* XXX: should we try to allocate more? But MCLBYTES
|
|
|
|
* is probably much larger than IPV6_MMTU...
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
2000-06-12 20:21:02 +04:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
MCLGET(n, M_DONTWAIT);
|
|
|
|
if ((n->m_flags & M_EXT) == 0) {
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
n->m_pkthdr.len = n->m_len = replylen;
|
|
|
|
|
|
|
|
/* copy mbuf header and IPv6 + Node Information base headers */
|
|
|
|
bcopy(mtod(m, caddr_t), mtod(n, caddr_t), sizeof(struct ip6_hdr));
|
2000-05-09 15:51:12 +04:00
|
|
|
nni6 = (struct icmp6_nodeinfo *)(mtod(n, struct ip6_hdr *) + 1);
|
1999-12-13 18:17:17 +03:00
|
|
|
bcopy((caddr_t)ni6, (caddr_t)nni6, sizeof(struct icmp6_nodeinfo));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* qtype dependent procedure */
|
|
|
|
switch (qtype) {
|
2000-06-12 20:21:02 +04:00
|
|
|
case NI_QTYPE_NOOP:
|
2000-08-03 18:31:04 +04:00
|
|
|
nni6->ni_code = ICMP6_NI_SUCCESS;
|
2000-06-12 20:21:02 +04:00
|
|
|
nni6->ni_flags = 0;
|
|
|
|
break;
|
|
|
|
case NI_QTYPE_SUPTYPES:
|
2000-08-19 12:15:53 +04:00
|
|
|
{
|
|
|
|
u_int32_t v;
|
2000-08-03 18:31:04 +04:00
|
|
|
nni6->ni_code = ICMP6_NI_SUCCESS;
|
|
|
|
nni6->ni_flags = htons(0x0000); /* raw bitmap */
|
|
|
|
/* supports NOOP, SUPTYPES, FQDN, and NODEADDR */
|
2000-08-19 12:15:53 +04:00
|
|
|
v = (u_int32_t)htonl(0x0000000f);
|
|
|
|
bcopy(&v, nni6 + 1, sizeof(u_int32_t));
|
2000-06-12 20:21:02 +04:00
|
|
|
break;
|
2000-08-19 12:15:53 +04:00
|
|
|
}
|
2000-06-12 20:21:02 +04:00
|
|
|
case NI_QTYPE_FQDN:
|
2000-08-03 18:31:04 +04:00
|
|
|
nni6->ni_code = ICMP6_NI_SUCCESS;
|
2000-06-12 20:21:02 +04:00
|
|
|
fqdn = (struct ni_reply_fqdn *)(mtod(n, caddr_t) +
|
|
|
|
sizeof(struct ip6_hdr) +
|
|
|
|
sizeof(struct icmp6_nodeinfo));
|
|
|
|
nni6->ni_flags = 0; /* XXX: meaningless TTL */
|
|
|
|
fqdn->ni_fqdn_ttl = 0; /* ditto. */
|
|
|
|
/*
|
|
|
|
* XXX do we really have FQDN in variable "hostname"?
|
|
|
|
*/
|
|
|
|
n->m_next = ni6_nametodns(hostname, hostnamelen, oldfqdn);
|
|
|
|
if (n->m_next == NULL)
|
|
|
|
goto bad;
|
|
|
|
/* XXX we assume that n->m_next is not a chain */
|
|
|
|
if (n->m_next->m_next != NULL)
|
|
|
|
goto bad;
|
|
|
|
n->m_pkthdr.len += n->m_next->m_len;
|
|
|
|
break;
|
|
|
|
case NI_QTYPE_NODEADDR:
|
|
|
|
{
|
|
|
|
int lenlim, copied;
|
|
|
|
|
2000-08-03 18:31:04 +04:00
|
|
|
nni6->ni_code = ICMP6_NI_SUCCESS;
|
2000-08-19 12:15:53 +04:00
|
|
|
n->m_pkthdr.len = n->m_len =
|
|
|
|
sizeof(struct ip6_hdr) + sizeof(struct icmp6_nodeinfo);
|
|
|
|
lenlim = M_TRAILINGSPACE(n);
|
2000-06-12 20:21:02 +04:00
|
|
|
copied = ni6_store_addrs(ni6, nni6, ifp, lenlim);
|
|
|
|
/* XXX: reset mbuf length */
|
|
|
|
n->m_pkthdr.len = n->m_len = sizeof(struct ip6_hdr) +
|
|
|
|
sizeof(struct icmp6_nodeinfo) + copied;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
default:
|
|
|
|
break; /* XXX impossible! */
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
nni6->ni_type = ICMP6_NI_REPLY;
|
2000-01-02 19:31:17 +03:00
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (n);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
bad:
|
2000-01-02 19:31:17 +03:00
|
|
|
m_freem(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (n)
|
|
|
|
m_freem(n);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
#undef hostnamelen
|
|
|
|
|
2002-05-24 13:13:59 +04:00
|
|
|
#define isupper(x) ('A' <= (x) && (x) <= 'Z')
|
|
|
|
#define isalpha(x) (('A' <= (x) && (x) <= 'Z') || ('a' <= (x) && (x) <= 'z'))
|
|
|
|
#define isalnum(x) (isalpha(x) || ('0' <= (x) && (x) <= '9'))
|
|
|
|
#define tolower(x) (isupper(x) ? (x) + 'a' - 'A' : (x))
|
|
|
|
|
2000-06-12 20:21:02 +04:00
|
|
|
/*
|
|
|
|
* make a mbuf with DNS-encoded string. no compression support.
|
|
|
|
*
|
|
|
|
* XXX names with less than 2 dots (like "foo" or "foo.section") will be
|
|
|
|
* treated as truncated name (two \0 at the end). this is a wild guess.
|
|
|
|
*/
|
|
|
|
static struct mbuf *
|
|
|
|
ni6_nametodns(name, namelen, old)
|
|
|
|
const char *name;
|
|
|
|
int namelen;
|
|
|
|
int old; /* return pascal string if non-zero */
|
|
|
|
{
|
|
|
|
struct mbuf *m;
|
|
|
|
char *cp, *ep;
|
|
|
|
const char *p, *q;
|
|
|
|
int i, len, nterm;
|
|
|
|
|
|
|
|
if (old)
|
|
|
|
len = namelen + 1;
|
|
|
|
else
|
|
|
|
len = MCLBYTES;
|
|
|
|
|
|
|
|
/* because MAXHOSTNAMELEN is usually 256, we use cluster mbuf */
|
|
|
|
MGET(m, M_DONTWAIT, MT_DATA);
|
|
|
|
if (m && len > MLEN) {
|
|
|
|
MCLGET(m, M_DONTWAIT);
|
|
|
|
if ((m->m_flags & M_EXT) == 0)
|
|
|
|
goto fail;
|
|
|
|
}
|
|
|
|
if (!m)
|
|
|
|
goto fail;
|
|
|
|
m->m_next = NULL;
|
|
|
|
|
|
|
|
if (old) {
|
|
|
|
m->m_len = len;
|
|
|
|
*mtod(m, char *) = namelen;
|
|
|
|
bcopy(name, mtod(m, char *) + 1, namelen);
|
|
|
|
return m;
|
|
|
|
} else {
|
|
|
|
m->m_len = 0;
|
|
|
|
cp = mtod(m, char *);
|
|
|
|
ep = mtod(m, char *) + M_TRAILINGSPACE(m);
|
|
|
|
|
|
|
|
/* if not certain about my name, return empty buffer */
|
|
|
|
if (namelen == 0)
|
|
|
|
return m;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* guess if it looks like shortened hostname, or FQDN.
|
|
|
|
* shortened hostname needs two trailing "\0".
|
|
|
|
*/
|
|
|
|
i = 0;
|
|
|
|
for (p = name; p < name + namelen; p++) {
|
|
|
|
if (*p && *p == '.')
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
if (i < 2)
|
|
|
|
nterm = 2;
|
|
|
|
else
|
|
|
|
nterm = 1;
|
|
|
|
|
|
|
|
p = name;
|
|
|
|
while (cp < ep && p < name + namelen) {
|
|
|
|
i = 0;
|
|
|
|
for (q = p; q < name + namelen && *q && *q != '.'; q++)
|
|
|
|
i++;
|
|
|
|
/* result does not fit into mbuf */
|
|
|
|
if (cp + i + 1 >= ep)
|
|
|
|
goto fail;
|
2001-10-15 15:12:44 +04:00
|
|
|
/*
|
|
|
|
* DNS label length restriction, RFC1035 page 8.
|
|
|
|
* "i == 0" case is included here to avoid returning
|
|
|
|
* 0-length label on "foo..bar".
|
|
|
|
*/
|
|
|
|
if (i <= 0 || i >= 64)
|
2000-06-12 20:21:02 +04:00
|
|
|
goto fail;
|
|
|
|
*cp++ = i;
|
2002-05-24 13:13:59 +04:00
|
|
|
if (!isalpha(p[0]) || !isalnum(p[i - 1]))
|
|
|
|
goto fail;
|
|
|
|
while (i > 0) {
|
|
|
|
if (!isalnum(*p) && *p != '-')
|
|
|
|
goto fail;
|
2002-07-10 09:05:01 +04:00
|
|
|
if (isupper(*p)) {
|
|
|
|
*cp++ = tolower(*p);
|
|
|
|
p++;
|
|
|
|
} else
|
2002-05-24 13:13:59 +04:00
|
|
|
*cp++ = *p++;
|
|
|
|
i--;
|
|
|
|
}
|
2000-06-12 20:21:02 +04:00
|
|
|
p = q;
|
|
|
|
if (p < name + namelen && *p == '.')
|
|
|
|
p++;
|
|
|
|
}
|
|
|
|
/* termination */
|
|
|
|
if (cp + nterm >= ep)
|
|
|
|
goto fail;
|
|
|
|
while (nterm-- > 0)
|
|
|
|
*cp++ = '\0';
|
|
|
|
m->m_len = cp - mtod(m, char *);
|
|
|
|
return m;
|
|
|
|
}
|
|
|
|
|
|
|
|
panic("should not reach here");
|
2001-10-15 15:12:44 +04:00
|
|
|
/* NOTREACHED */
|
2000-06-12 20:21:02 +04:00
|
|
|
|
|
|
|
fail:
|
|
|
|
if (m)
|
|
|
|
m_freem(m);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* check if two DNS-encoded string matches. takes care of truncated
|
|
|
|
* form (with \0\0 at the end). no compression support.
|
2000-08-03 18:31:04 +04:00
|
|
|
* XXX upper/lowercase match (see RFC2065)
|
2000-06-12 20:21:02 +04:00
|
|
|
*/
|
|
|
|
static int
|
|
|
|
ni6_dnsmatch(a, alen, b, blen)
|
|
|
|
const char *a;
|
|
|
|
int alen;
|
|
|
|
const char *b;
|
|
|
|
int blen;
|
|
|
|
{
|
|
|
|
const char *a0, *b0;
|
|
|
|
int l;
|
|
|
|
|
|
|
|
/* simplest case - need validation? */
|
|
|
|
if (alen == blen && bcmp(a, b, alen) == 0)
|
|
|
|
return 1;
|
|
|
|
|
|
|
|
a0 = a;
|
|
|
|
b0 = b;
|
|
|
|
|
|
|
|
/* termination is mandatory */
|
|
|
|
if (alen < 2 || blen < 2)
|
|
|
|
return 0;
|
|
|
|
if (a0[alen - 1] != '\0' || b0[blen - 1] != '\0')
|
|
|
|
return 0;
|
|
|
|
alen--;
|
|
|
|
blen--;
|
|
|
|
|
|
|
|
while (a - a0 < alen && b - b0 < blen) {
|
|
|
|
if (a - a0 + 1 > alen || b - b0 + 1 > blen)
|
|
|
|
return 0;
|
|
|
|
|
2000-06-13 21:31:37 +04:00
|
|
|
if ((signed char)a[0] < 0 || (signed char)b[0] < 0)
|
2000-06-12 20:21:02 +04:00
|
|
|
return 0;
|
|
|
|
/* we don't support compression yet */
|
|
|
|
if (a[0] >= 64 || b[0] >= 64)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
/* truncated case */
|
|
|
|
if (a[0] == 0 && a - a0 == alen - 1)
|
|
|
|
return 1;
|
|
|
|
if (b[0] == 0 && b - b0 == blen - 1)
|
|
|
|
return 1;
|
|
|
|
if (a[0] == 0 || b[0] == 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
if (a[0] != b[0])
|
|
|
|
return 0;
|
|
|
|
l = a[0];
|
|
|
|
if (a - a0 + 1 + l > alen || b - b0 + 1 + l > blen)
|
|
|
|
return 0;
|
|
|
|
if (bcmp(a + 1, b + 1, l) != 0)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
a += 1 + l;
|
|
|
|
b += 1 + l;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (a - a0 == alen && b - b0 == blen)
|
|
|
|
return 1;
|
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* calculate the number of addresses to be returned in the node info reply.
|
|
|
|
*/
|
|
|
|
static int
|
2000-11-11 03:46:36 +03:00
|
|
|
ni6_addrs(ni6, m, ifpp, subj)
|
1999-06-28 10:36:47 +04:00
|
|
|
struct icmp6_nodeinfo *ni6;
|
|
|
|
struct mbuf *m;
|
|
|
|
struct ifnet **ifpp;
|
2000-11-11 03:46:36 +03:00
|
|
|
char *subj;
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-07 11:59:47 +03:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct in6_ifaddr *ifa6;
|
|
|
|
struct ifaddr *ifa;
|
2000-11-11 03:46:36 +03:00
|
|
|
struct sockaddr_in6 *subj_ip6 = NULL; /* XXX pedant */
|
1999-06-28 10:36:47 +04:00
|
|
|
int addrs = 0, addrsofif, iffound = 0;
|
2000-11-11 03:46:36 +03:00
|
|
|
int niflags = ni6->ni_flags;
|
|
|
|
|
|
|
|
if ((niflags & NI_NODEADDR_FLAG_ALL) == 0) {
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (ni6->ni_code) {
|
2000-11-11 03:46:36 +03:00
|
|
|
case ICMP6_NI_SUBJ_IPV6:
|
|
|
|
if (subj == NULL) /* must be impossible... */
|
2002-09-11 06:46:42 +04:00
|
|
|
return (0);
|
2000-11-11 03:46:36 +03:00
|
|
|
subj_ip6 = (struct sockaddr_in6 *)subj;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
/*
|
|
|
|
* XXX: we only support IPv6 subject address for
|
|
|
|
* this Qtype.
|
|
|
|
*/
|
2002-09-11 06:46:42 +04:00
|
|
|
return (0);
|
2000-11-11 03:46:36 +03:00
|
|
|
}
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
for (ifp = TAILQ_FIRST(&ifnet); ifp; ifp = TAILQ_NEXT(ifp, if_list))
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
addrsofif = 0;
|
|
|
|
for (ifa = ifp->if_addrlist.tqh_first; ifa;
|
|
|
|
ifa = ifa->ifa_list.tqe_next)
|
|
|
|
{
|
|
|
|
if (ifa->ifa_addr->sa_family != AF_INET6)
|
|
|
|
continue;
|
|
|
|
ifa6 = (struct in6_ifaddr *)ifa;
|
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_ALL) == 0 &&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&subj_ip6->sin6_addr,
|
1999-06-28 10:36:47 +04:00
|
|
|
&ifa6->ia_addr.sin6_addr))
|
|
|
|
iffound = 1;
|
|
|
|
|
2000-02-28 16:48:50 +03:00
|
|
|
/*
|
|
|
|
* IPv4-mapped addresses can only be returned by a
|
|
|
|
* Node Information proxy, since they represent
|
|
|
|
* addresses of IPv4-only nodes, which perforce do
|
|
|
|
* not implement this protocol.
|
2000-11-11 03:46:36 +03:00
|
|
|
* [icmp-name-lookups-07, Section 5.4]
|
2000-02-28 16:48:50 +03:00
|
|
|
* So we don't support NI_NODEADDR_FLAG_COMPAT in
|
|
|
|
* this function at this moment.
|
|
|
|
*/
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* What do we have to do about ::1? */
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (in6_addrscope(&ifa6->ia_addr.sin6_addr)) {
|
2000-11-11 03:46:36 +03:00
|
|
|
case IPV6_ADDR_SCOPE_LINKLOCAL:
|
2001-02-07 11:59:47 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_LINKLOCAL) == 0)
|
2000-11-11 03:46:36 +03:00
|
|
|
continue;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
2000-11-11 03:46:36 +03:00
|
|
|
case IPV6_ADDR_SCOPE_SITELOCAL:
|
2001-02-07 11:59:47 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_SITELOCAL) == 0)
|
2000-11-11 03:46:36 +03:00
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
case IPV6_ADDR_SCOPE_GLOBAL:
|
2001-02-07 11:59:47 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_GLOBAL) == 0)
|
2000-11-11 03:46:36 +03:00
|
|
|
continue;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
2000-11-11 03:46:36 +03:00
|
|
|
default:
|
|
|
|
continue;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2000-11-11 03:46:36 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* check if anycast is okay.
|
2001-10-15 15:12:44 +04:00
|
|
|
* XXX: just experimental. not in the spec.
|
2000-11-11 03:46:36 +03:00
|
|
|
*/
|
|
|
|
if ((ifa6->ia6_flags & IN6_IFF_ANYCAST) != 0 &&
|
|
|
|
(niflags & NI_NODEADDR_FLAG_ANYCAST) == 0)
|
|
|
|
continue; /* we need only unicast addresses */
|
|
|
|
|
|
|
|
addrsofif++; /* count the address */
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
if (iffound) {
|
|
|
|
*ifpp = ifp;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (addrsofif);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
addrs += addrsofif;
|
|
|
|
}
|
|
|
|
|
2002-09-11 06:46:42 +04:00
|
|
|
return (addrs);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
ni6_store_addrs(ni6, nni6, ifp0, resid)
|
|
|
|
struct icmp6_nodeinfo *ni6, *nni6;
|
|
|
|
struct ifnet *ifp0;
|
|
|
|
int resid;
|
|
|
|
{
|
2001-02-07 11:59:47 +03:00
|
|
|
struct ifnet *ifp = ifp0 ? ifp0 : TAILQ_FIRST(&ifnet);
|
|
|
|
struct in6_ifaddr *ifa6;
|
|
|
|
struct ifaddr *ifa;
|
2000-11-11 03:46:36 +03:00
|
|
|
struct ifnet *ifp_dep = NULL;
|
|
|
|
int copied = 0, allow_deprecated = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
u_char *cp = (u_char *)(nni6 + 1);
|
2000-11-11 03:46:36 +03:00
|
|
|
int niflags = ni6->ni_flags;
|
|
|
|
u_int32_t ltime;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
if (ifp0 == NULL && !(niflags & NI_NODEADDR_FLAG_ALL))
|
2002-09-11 06:46:42 +04:00
|
|
|
return (0); /* needless to copy */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
again:
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
for (; ifp; ifp = TAILQ_NEXT(ifp, if_list))
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
for (ifa = ifp->if_addrlist.tqh_first; ifa;
|
|
|
|
ifa = ifa->ifa_list.tqe_next)
|
|
|
|
{
|
|
|
|
if (ifa->ifa_addr->sa_family != AF_INET6)
|
|
|
|
continue;
|
|
|
|
ifa6 = (struct in6_ifaddr *)ifa;
|
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
if ((ifa6->ia6_flags & IN6_IFF_DEPRECATED) != 0 &&
|
|
|
|
allow_deprecated == 0) {
|
|
|
|
/*
|
|
|
|
* prefererred address should be put before
|
|
|
|
* deprecated addresses.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* record the interface for later search */
|
|
|
|
if (ifp_dep == NULL)
|
|
|
|
ifp_dep = ifp;
|
|
|
|
|
|
|
|
continue;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
2000-11-11 03:46:36 +03:00
|
|
|
else if ((ifa6->ia6_flags & IN6_IFF_DEPRECATED) == 0 &&
|
|
|
|
allow_deprecated != 0)
|
|
|
|
continue; /* we now collect deprecated addrs */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* What do we have to do about ::1? */
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (in6_addrscope(&ifa6->ia_addr.sin6_addr)) {
|
2000-11-11 03:46:36 +03:00
|
|
|
case IPV6_ADDR_SCOPE_LINKLOCAL:
|
2001-02-07 11:59:47 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_LINKLOCAL) == 0)
|
2000-11-11 03:46:36 +03:00
|
|
|
continue;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
2000-11-11 03:46:36 +03:00
|
|
|
case IPV6_ADDR_SCOPE_SITELOCAL:
|
2001-02-07 11:59:47 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_SITELOCAL) == 0)
|
2000-11-11 03:46:36 +03:00
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
case IPV6_ADDR_SCOPE_GLOBAL:
|
2001-02-07 11:59:47 +03:00
|
|
|
if ((niflags & NI_NODEADDR_FLAG_GLOBAL) == 0)
|
2000-11-11 03:46:36 +03:00
|
|
|
continue;
|
1999-06-28 10:36:47 +04:00
|
|
|
break;
|
2000-11-11 03:46:36 +03:00
|
|
|
default:
|
|
|
|
continue;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
/*
|
|
|
|
* check if anycast is okay.
|
2001-10-15 15:12:44 +04:00
|
|
|
* XXX: just experimental. not in the spec.
|
2000-11-11 03:46:36 +03:00
|
|
|
*/
|
|
|
|
if ((ifa6->ia6_flags & IN6_IFF_ANYCAST) != 0 &&
|
|
|
|
(niflags & NI_NODEADDR_FLAG_ANYCAST) == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
/* now we can copy the address */
|
|
|
|
if (resid < sizeof(struct in6_addr) +
|
|
|
|
sizeof(u_int32_t)) {
|
|
|
|
/*
|
|
|
|
* We give up much more copy.
|
|
|
|
* Set the truncate flag and return.
|
|
|
|
*/
|
|
|
|
nni6->ni_flags |=
|
|
|
|
NI_NODEADDR_FLAG_TRUNCATE;
|
2002-09-11 06:46:42 +04:00
|
|
|
return (copied);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2000-11-11 03:46:36 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Set the TTL of the address.
|
|
|
|
* The TTL value should be one of the following
|
|
|
|
* according to the specification:
|
|
|
|
*
|
|
|
|
* 1. The remaining lifetime of a DHCP lease on the
|
|
|
|
* address, or
|
|
|
|
* 2. The remaining Valid Lifetime of a prefix from
|
|
|
|
* which the address was derived through Stateless
|
|
|
|
* Autoconfiguration.
|
|
|
|
*
|
|
|
|
* Note that we currently do not support stateful
|
|
|
|
* address configuration by DHCPv6, so the former
|
|
|
|
* case can't happen.
|
2001-10-15 15:12:44 +04:00
|
|
|
*
|
|
|
|
* TTL must be 2^31 > TTL >= 0.
|
2000-11-11 03:46:36 +03:00
|
|
|
*/
|
|
|
|
if (ifa6->ia6_lifetime.ia6t_expire == 0)
|
|
|
|
ltime = ND6_INFINITE_LIFETIME;
|
|
|
|
else {
|
|
|
|
if (ifa6->ia6_lifetime.ia6t_expire >
|
2003-06-24 11:39:24 +04:00
|
|
|
time.tv_sec)
|
|
|
|
ltime = ifa6->ia6_lifetime.ia6t_expire - time.tv_sec;
|
2000-11-11 03:46:36 +03:00
|
|
|
else
|
|
|
|
ltime = 0;
|
|
|
|
}
|
2001-10-15 15:12:44 +04:00
|
|
|
if (ltime > 0x7fffffff)
|
|
|
|
ltime = 0x7fffffff;
|
|
|
|
ltime = htonl(ltime);
|
2002-06-09 18:43:10 +04:00
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
bcopy(<ime, cp, sizeof(u_int32_t));
|
|
|
|
cp += sizeof(u_int32_t);
|
|
|
|
|
|
|
|
/* copy the address itself */
|
|
|
|
bcopy(&ifa6->ia_addr.sin6_addr, cp,
|
|
|
|
sizeof(struct in6_addr));
|
|
|
|
/* XXX: KAME link-local hack; remove ifindex */
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&ifa6->ia_addr.sin6_addr))
|
|
|
|
((struct in6_addr *)cp)->s6_addr16[1] = 0;
|
|
|
|
cp += sizeof(struct in6_addr);
|
2002-06-09 18:43:10 +04:00
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
resid -= (sizeof(struct in6_addr) + sizeof(u_int32_t));
|
|
|
|
copied += (sizeof(struct in6_addr) +
|
|
|
|
sizeof(u_int32_t));
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
if (ifp0) /* we need search only on the specified IF */
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2000-11-11 03:46:36 +03:00
|
|
|
if (allow_deprecated == 0 && ifp_dep != NULL) {
|
|
|
|
ifp = ifp_dep;
|
|
|
|
allow_deprecated = 1;
|
|
|
|
|
|
|
|
goto again;
|
|
|
|
}
|
|
|
|
|
2002-09-11 06:46:42 +04:00
|
|
|
return (copied);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX almost dup'ed code with rip6_input.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
icmp6_rip6_input(mp, off)
|
|
|
|
struct mbuf **mp;
|
|
|
|
int off;
|
|
|
|
{
|
|
|
|
struct mbuf *m = *mp;
|
2001-02-07 11:59:47 +03:00
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
2003-09-04 13:16:57 +04:00
|
|
|
struct inpcb_hdr *inph;
|
2001-02-07 11:59:47 +03:00
|
|
|
struct in6pcb *in6p;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6pcb *last = NULL;
|
|
|
|
struct sockaddr_in6 rip6src;
|
|
|
|
struct icmp6_hdr *icmp6;
|
|
|
|
struct mbuf *opts = NULL;
|
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
IP6_EXTHDR_GET(icmp6, struct icmp6_hdr *, m, off, sizeof(*icmp6));
|
|
|
|
if (icmp6 == NULL) {
|
|
|
|
/* m is already reclaimed */
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
bzero(&rip6src, sizeof(rip6src));
|
|
|
|
rip6src.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
rip6src.sin6_family = AF_INET6;
|
2000-07-07 19:54:16 +04:00
|
|
|
/* KAME hack: recover scopeid */
|
|
|
|
(void)in6_recoverscope(&rip6src, &ip6->ip6_src, m->m_pkthdr.rcvif);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-09-04 13:16:57 +04:00
|
|
|
CIRCLEQ_FOREACH(inph, &raw6cbtable.inpt_queue, inph_queue) {
|
|
|
|
in6p = (struct in6pcb *)inph;
|
|
|
|
if (in6p->in6p_af != AF_INET6)
|
|
|
|
continue;
|
2003-08-25 04:11:52 +04:00
|
|
|
if (in6p->in6p_ip6.ip6_nxt != IPPROTO_ICMPV6)
|
1999-06-28 10:36:47 +04:00
|
|
|
continue;
|
1999-12-13 18:17:17 +03:00
|
|
|
if (!IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_laddr) &&
|
1999-06-28 10:36:47 +04:00
|
|
|
!IN6_ARE_ADDR_EQUAL(&in6p->in6p_laddr, &ip6->ip6_dst))
|
|
|
|
continue;
|
1999-12-13 18:17:17 +03:00
|
|
|
if (!IN6_IS_ADDR_UNSPECIFIED(&in6p->in6p_faddr) &&
|
1999-06-28 10:36:47 +04:00
|
|
|
!IN6_ARE_ADDR_EQUAL(&in6p->in6p_faddr, &ip6->ip6_src))
|
|
|
|
continue;
|
|
|
|
if (in6p->in6p_icmp6filt
|
|
|
|
&& ICMP6_FILTER_WILLBLOCK(icmp6->icmp6_type,
|
|
|
|
in6p->in6p_icmp6filt))
|
|
|
|
continue;
|
|
|
|
if (last) {
|
|
|
|
struct mbuf *n;
|
|
|
|
if ((n = m_copy(m, 0, (int)M_COPYALL)) != NULL) {
|
|
|
|
if (last->in6p_flags & IN6P_CONTROLOPTS)
|
|
|
|
ip6_savecontrol(last, &opts, ip6, n);
|
|
|
|
/* strip intermediate headers */
|
|
|
|
m_adj(n, off);
|
|
|
|
if (sbappendaddr(&last->in6p_socket->so_rcv,
|
|
|
|
(struct sockaddr *)&rip6src,
|
|
|
|
n, opts) == 0) {
|
|
|
|
/* should notify about lost packet */
|
|
|
|
m_freem(n);
|
|
|
|
if (opts)
|
|
|
|
m_freem(opts);
|
|
|
|
} else
|
|
|
|
sorwakeup(last->in6p_socket);
|
|
|
|
opts = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
last = in6p;
|
|
|
|
}
|
|
|
|
if (last) {
|
|
|
|
if (last->in6p_flags & IN6P_CONTROLOPTS)
|
|
|
|
ip6_savecontrol(last, &opts, ip6, m);
|
|
|
|
/* strip intermediate headers */
|
|
|
|
m_adj(m, off);
|
|
|
|
if (sbappendaddr(&last->in6p_socket->so_rcv,
|
|
|
|
(struct sockaddr *)&rip6src, m, opts) == 0) {
|
|
|
|
m_freem(m);
|
|
|
|
if (opts)
|
|
|
|
m_freem(opts);
|
|
|
|
} else
|
|
|
|
sorwakeup(last->in6p_socket);
|
|
|
|
} else {
|
|
|
|
m_freem(m);
|
|
|
|
ip6stat.ip6s_delivered--;
|
|
|
|
}
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Reflect the ip6 packet back to the source.
|
2000-01-02 19:31:17 +03:00
|
|
|
* OFF points to the icmp6 header, counted from the top of the mbuf.
|
2001-06-22 17:01:49 +04:00
|
|
|
*
|
|
|
|
* Note: RFC 1885 required that an echo reply should be truncated if it
|
|
|
|
* did not fit in with (return) path MTU, and KAME code supported the
|
|
|
|
* behavior. However, as a clarification after the RFC, this limitation
|
|
|
|
* was removed in a revised version of the spec, RFC 2463. We had kept the
|
|
|
|
* old behavior, with a (non-default) ifdef block, while the new version of
|
|
|
|
* the spec was an internet-draft status, and even after the new RFC was
|
|
|
|
* published. But it would rather make sense to clean the obsoleted part
|
|
|
|
* up, and to make the code simpler at this stage.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
|
|
|
icmp6_reflect(m, off)
|
|
|
|
struct mbuf *m;
|
|
|
|
size_t off;
|
|
|
|
{
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ip6_hdr *ip6;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct icmp6_hdr *icmp6;
|
|
|
|
struct in6_ifaddr *ia;
|
|
|
|
struct in6_addr t, *src = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
int plen;
|
|
|
|
int type, code;
|
|
|
|
struct ifnet *outif = NULL;
|
2001-02-08 19:07:39 +03:00
|
|
|
struct sockaddr_in6 sa6_src, sa6_dst;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/* too short to reflect */
|
|
|
|
if (off < sizeof(struct ip6_hdr)) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_DEBUG,
|
|
|
|
"sanity fail: off=%lx, sizeof(ip6)=%lx in %s:%d\n",
|
|
|
|
(u_long)off, (u_long)sizeof(struct ip6_hdr),
|
|
|
|
__FILE__, __LINE__));
|
1999-12-13 18:17:17 +03:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* If there are extra headers between IPv6 and ICMPv6, strip
|
|
|
|
* off that header first.
|
|
|
|
*/
|
2000-07-06 16:36:18 +04:00
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (sizeof(struct ip6_hdr) + sizeof(struct icmp6_hdr) > MHLEN)
|
|
|
|
panic("assumption failed in icmp6_reflect");
|
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
if (off > sizeof(struct ip6_hdr)) {
|
|
|
|
size_t l;
|
|
|
|
struct ip6_hdr nip6;
|
|
|
|
|
|
|
|
l = off - sizeof(struct ip6_hdr);
|
|
|
|
m_copydata(m, 0, sizeof(nip6), (caddr_t)&nip6);
|
|
|
|
m_adj(m, l);
|
|
|
|
l = sizeof(struct ip6_hdr) + sizeof(struct icmp6_hdr);
|
|
|
|
if (m->m_len < l) {
|
|
|
|
if ((m = m_pullup(m, l)) == NULL)
|
|
|
|
return;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
bcopy((caddr_t)&nip6, mtod(m, caddr_t), sizeof(nip6));
|
|
|
|
} else /* off == sizeof(struct ip6_hdr) */ {
|
|
|
|
size_t l;
|
|
|
|
l = sizeof(struct ip6_hdr) + sizeof(struct icmp6_hdr);
|
|
|
|
if (m->m_len < l) {
|
|
|
|
if ((m = m_pullup(m, l)) == NULL)
|
|
|
|
return;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
plen = m->m_pkthdr.len - sizeof(struct ip6_hdr);
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
ip6->ip6_nxt = IPPROTO_ICMPV6;
|
1999-06-28 10:36:47 +04:00
|
|
|
icmp6 = (struct icmp6_hdr *)(ip6 + 1);
|
1999-12-13 18:17:17 +03:00
|
|
|
type = icmp6->icmp6_type; /* keep type for statistics */
|
|
|
|
code = icmp6->icmp6_code; /* ditto. */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
t = ip6->ip6_dst;
|
|
|
|
/*
|
|
|
|
* ip6_input() drops a packet if its src is multicast.
|
|
|
|
* So, the src is never multicast.
|
|
|
|
*/
|
|
|
|
ip6->ip6_dst = ip6->ip6_src;
|
|
|
|
|
2001-02-08 19:07:39 +03:00
|
|
|
/*
|
|
|
|
* XXX: make sure to embed scope zone information, using
|
|
|
|
* already embedded IDs or the received interface (if any).
|
|
|
|
* Note that rcvif may be NULL.
|
|
|
|
* TODO: scoped routing case (XXX).
|
|
|
|
*/
|
|
|
|
bzero(&sa6_src, sizeof(sa6_src));
|
|
|
|
sa6_src.sin6_family = AF_INET6;
|
|
|
|
sa6_src.sin6_len = sizeof(sa6_src);
|
|
|
|
sa6_src.sin6_addr = ip6->ip6_dst;
|
|
|
|
in6_recoverscope(&sa6_src, &ip6->ip6_dst, m->m_pkthdr.rcvif);
|
2001-10-15 15:12:44 +04:00
|
|
|
in6_embedscope(&sa6_src.sin6_addr, &sa6_src, NULL, NULL);
|
|
|
|
ip6->ip6_dst = sa6_src.sin6_addr;
|
|
|
|
|
2001-02-08 19:07:39 +03:00
|
|
|
bzero(&sa6_dst, sizeof(sa6_dst));
|
|
|
|
sa6_dst.sin6_family = AF_INET6;
|
|
|
|
sa6_dst.sin6_len = sizeof(sa6_dst);
|
|
|
|
sa6_dst.sin6_addr = t;
|
|
|
|
in6_recoverscope(&sa6_dst, &t, m->m_pkthdr.rcvif);
|
|
|
|
in6_embedscope(&t, &sa6_dst, NULL, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
2001-10-15 15:12:44 +04:00
|
|
|
* If the incoming packet was addressed directly to us (i.e. unicast),
|
1999-06-28 10:36:47 +04:00
|
|
|
* use dst as the src for the reply.
|
2000-06-12 20:21:02 +04:00
|
|
|
* The IN6_IFF_NOTREADY case would be VERY rare, but is possible
|
2000-02-26 11:39:18 +03:00
|
|
|
* (for example) when we encounter an error while forwarding procedure
|
|
|
|
* destined to a duplicated address of ours.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
for (ia = in6_ifaddr; ia; ia = ia->ia_next)
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&t, &ia->ia_addr.sin6_addr) &&
|
2000-02-26 11:39:18 +03:00
|
|
|
(ia->ia6_flags & (IN6_IFF_ANYCAST|IN6_IFF_NOTREADY)) == 0) {
|
1999-06-28 10:36:47 +04:00
|
|
|
src = &t;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (ia == NULL && IN6_IS_ADDR_LINKLOCAL(&t) && (m->m_flags & M_LOOP)) {
|
|
|
|
/*
|
|
|
|
* This is the case if the dst is our link-local address
|
2001-10-15 15:12:44 +04:00
|
|
|
* and the sender is also ourselves.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
src = &t;
|
|
|
|
}
|
|
|
|
|
2001-02-08 19:07:39 +03:00
|
|
|
if (src == 0) {
|
|
|
|
int e;
|
|
|
|
struct route_in6 ro;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2000-02-26 11:39:18 +03:00
|
|
|
* This case matches to multicasts, our anycast, or unicasts
|
2001-10-15 15:12:44 +04:00
|
|
|
* that we do not own. Select a source address based on the
|
2001-02-08 19:07:39 +03:00
|
|
|
* source address of the erroneous packet.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2001-02-08 19:07:39 +03:00
|
|
|
bzero(&ro, sizeof(ro));
|
|
|
|
src = in6_selectsrc(&sa6_src, NULL, NULL, &ro, NULL, &e);
|
2001-10-15 15:12:44 +04:00
|
|
|
if (ro.ro_rt) { /* XXX: see comments in icmp6_mtudisc_update */
|
2001-02-08 19:07:39 +03:00
|
|
|
RTFREE(ro.ro_rt); /* XXX: we could use this */
|
2001-10-15 15:12:44 +04:00
|
|
|
}
|
2001-02-08 19:07:39 +03:00
|
|
|
if (src == NULL) {
|
|
|
|
nd6log((LOG_DEBUG,
|
|
|
|
"icmp6_reflect: source can't be determined: "
|
|
|
|
"dst=%s, error=%d\n",
|
|
|
|
ip6_sprintf(&sa6_src.sin6_addr), e));
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
ip6->ip6_src = *src;
|
|
|
|
|
|
|
|
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;
|
|
|
|
if (m->m_pkthdr.rcvif) {
|
|
|
|
/* XXX: This may not be the outgoing interface */
|
2002-05-29 23:50:48 +04:00
|
|
|
ip6->ip6_hlim = ND_IFINFO(m->m_pkthdr.rcvif)->chlim;
|
2001-06-01 09:54:19 +04:00
|
|
|
} else
|
|
|
|
ip6->ip6_hlim = ip6_defhlim;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
icmp6->icmp6_cksum = 0;
|
|
|
|
icmp6->icmp6_cksum = in6_cksum(m, IPPROTO_ICMPV6,
|
|
|
|
sizeof(struct ip6_hdr), plen);
|
|
|
|
|
|
|
|
/*
|
2001-10-15 15:12:44 +04:00
|
|
|
* XXX option handling
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
|
|
|
|
m->m_flags &= ~(M_BCAST|M_MCAST);
|
|
|
|
|
2001-12-20 10:26:36 +03:00
|
|
|
/*
|
|
|
|
* To avoid a "too big" situation at an intermediate router
|
|
|
|
* and the path MTU discovery process, specify the IPV6_MINMTU flag.
|
|
|
|
* Note that only echo and node information replies are affected,
|
|
|
|
* since the length of ICMP6 errors is limited to the minimum MTU.
|
|
|
|
*/
|
2003-08-23 00:20:09 +04:00
|
|
|
if (ip6_output(m, NULL, NULL, IPV6_MINMTU,
|
2003-08-23 01:53:01 +04:00
|
|
|
(struct ip6_moptions *)NULL, (struct socket *)NULL, &outif) != 0
|
2003-08-23 00:20:09 +04:00
|
|
|
&& outif)
|
2001-12-07 13:10:43 +03:00
|
|
|
icmp6_ifstat_inc(outif, ifs6_out_error);
|
2001-06-22 17:01:49 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
if (outif)
|
|
|
|
icmp6_ifoutstat_inc(outif, type, code);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
icmp6_fasttimo()
|
|
|
|
{
|
2000-06-12 20:21:02 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
mld6_fasttimeo();
|
|
|
|
}
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
static const char *
|
|
|
|
icmp6_redirect_diag(src6, dst6, tgt6)
|
1999-10-01 14:16:16 +04:00
|
|
|
struct in6_addr *src6;
|
|
|
|
struct in6_addr *dst6;
|
|
|
|
struct in6_addr *tgt6;
|
|
|
|
{
|
1999-12-13 18:17:17 +03:00
|
|
|
static char buf[1024];
|
|
|
|
snprintf(buf, sizeof(buf), "(src=%s dst=%s tgt=%s)",
|
1999-10-01 14:16:16 +04:00
|
|
|
ip6_sprintf(src6), ip6_sprintf(dst6), ip6_sprintf(tgt6));
|
1999-12-13 18:17:17 +03:00
|
|
|
return buf;
|
1999-10-01 14:16:16 +04:00
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
void
|
|
|
|
icmp6_redirect_input(m, off)
|
2001-02-07 11:59:47 +03:00
|
|
|
struct mbuf *m;
|
1999-06-28 10:36:47 +04:00
|
|
|
int off;
|
|
|
|
{
|
|
|
|
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_redirect *nd_rd;
|
1999-06-28 10:36:47 +04:00
|
|
|
int icmp6len = ntohs(ip6->ip6_plen);
|
|
|
|
char *lladdr = NULL;
|
|
|
|
int lladdrlen = 0;
|
|
|
|
struct rtentry *rt = NULL;
|
|
|
|
int is_router;
|
|
|
|
int is_onlink;
|
|
|
|
struct in6_addr src6 = ip6->ip6_src;
|
2000-02-26 11:39:18 +03:00
|
|
|
struct in6_addr redtgt6;
|
|
|
|
struct in6_addr reddst6;
|
1999-06-28 10:36:47 +04:00
|
|
|
union nd_opts ndopts;
|
|
|
|
|
2002-07-31 03:27:15 +04:00
|
|
|
if (!ifp)
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
|
|
|
|
|
|
|
/* XXX if we are router, we don't update route by icmp6 redirect */
|
|
|
|
if (ip6_forwarding)
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
if (!icmp6_rediraccept)
|
2000-02-26 11:39:18 +03:00
|
|
|
goto freeit;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-02-26 11:39:18 +03:00
|
|
|
IP6_EXTHDR_GET(nd_rd, struct nd_redirect *, m, off, icmp6len);
|
|
|
|
if (nd_rd == NULL) {
|
|
|
|
icmp6stat.icp6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
redtgt6 = nd_rd->nd_rd_target;
|
|
|
|
reddst6 = nd_rd->nd_rd_dst;
|
|
|
|
|
2000-02-28 17:30:36 +03:00
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&redtgt6))
|
|
|
|
redtgt6.s6_addr16[1] = htons(ifp->if_index);
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&reddst6))
|
|
|
|
reddst6.s6_addr16[1] = htons(ifp->if_index);
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* validation */
|
|
|
|
if (!IN6_IS_ADDR_LINKLOCAL(&src6)) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-06-28 10:36:47 +04:00
|
|
|
"ICMP6 redirect sent from %s rejected; "
|
2001-02-07 11:59:47 +03:00
|
|
|
"must be from linklocal\n", ip6_sprintf(&src6)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
if (ip6->ip6_hlim != 255) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-06-28 10:36:47 +04:00
|
|
|
"ICMP6 redirect sent from %s rejected; "
|
|
|
|
"hlim=%d (must be 255)\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
ip6_sprintf(&src6), ip6->ip6_hlim));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
{
|
|
|
|
/* ip6->ip6_src must be equal to gw for icmp6->icmp6_reddst */
|
|
|
|
struct sockaddr_in6 sin6;
|
|
|
|
struct in6_addr *gw6;
|
|
|
|
|
|
|
|
bzero(&sin6, sizeof(sin6));
|
|
|
|
sin6.sin6_family = AF_INET6;
|
|
|
|
sin6.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
bcopy(&reddst6, &sin6.sin6_addr, sizeof(reddst6));
|
2000-02-26 11:39:18 +03:00
|
|
|
rt = rtalloc1((struct sockaddr *)&sin6, 0);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (rt) {
|
2000-09-16 14:12:22 +04:00
|
|
|
if (rt->rt_gateway == NULL ||
|
|
|
|
rt->rt_gateway->sa_family != AF_INET6) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
2000-09-16 14:12:22 +04:00
|
|
|
"ICMP6 redirect rejected; no route "
|
|
|
|
"with inet6 gateway found for redirect dst: %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
2000-09-16 14:12:22 +04:00
|
|
|
RTFREE(rt);
|
2001-02-07 11:59:47 +03:00
|
|
|
goto bad;
|
2000-09-16 14:12:22 +04:00
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
gw6 = &(((struct sockaddr_in6 *)rt->rt_gateway)->sin6_addr);
|
|
|
|
if (bcmp(&src6, gw6, sizeof(struct in6_addr)) != 0) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-12-13 18:17:17 +03:00
|
|
|
"ICMP6 redirect rejected; "
|
|
|
|
"not equal to gw-for-src=%s (must be same): "
|
|
|
|
"%s\n",
|
|
|
|
ip6_sprintf(gw6),
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
1999-06-28 10:36:47 +04:00
|
|
|
RTFREE(rt);
|
2001-02-07 11:59:47 +03:00
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
} else {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-12-13 18:17:17 +03:00
|
|
|
"ICMP6 redirect rejected; "
|
|
|
|
"no route found for redirect dst: %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
RTFREE(rt);
|
|
|
|
rt = NULL;
|
|
|
|
}
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&reddst6)) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-12-13 18:17:17 +03:00
|
|
|
"ICMP6 redirect rejected; "
|
|
|
|
"redirect dst must be unicast: %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
is_router = is_onlink = 0;
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&redtgt6))
|
|
|
|
is_router = 1; /* router case */
|
|
|
|
if (bcmp(&redtgt6, &reddst6, sizeof(redtgt6)) == 0)
|
|
|
|
is_onlink = 1; /* on-link destination case */
|
|
|
|
if (!is_router && !is_onlink) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_ERR,
|
1999-12-13 18:17:17 +03:00
|
|
|
"ICMP6 redirect rejected; "
|
|
|
|
"neither router case nor onlink case: %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
/* validation passed */
|
|
|
|
|
|
|
|
icmp6len -= sizeof(*nd_rd);
|
|
|
|
nd6_option_init(nd_rd + 1, icmp6len, &ndopts);
|
|
|
|
if (nd6_options(&ndopts) < 0) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO, "icmp6_redirect_input: "
|
1999-12-13 18:17:17 +03:00
|
|
|
"invalid ND option, rejected: %s\n",
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
|
|
|
/* 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;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (lladdr && ((ifp->if_addrlen + 2 + 7) & ~7) != lladdrlen) {
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO,
|
1999-06-28 10:36:47 +04:00
|
|
|
"icmp6_redirect_input: lladdrlen mismatch for %s "
|
1999-12-13 18:17:17 +03:00
|
|
|
"(if %d, icmp6 packet %d): %s\n",
|
|
|
|
ip6_sprintf(&redtgt6), ifp->if_addrlen, lladdrlen - 2,
|
2001-02-07 11:59:47 +03:00
|
|
|
icmp6_redirect_diag(&src6, &reddst6, &redtgt6)));
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* RFC 2461 8.3 */
|
1999-07-31 22:41:15 +04:00
|
|
|
nd6_cache_lladdr(ifp, &redtgt6, lladdr, lladdrlen, ND_REDIRECT,
|
|
|
|
is_onlink ? ND_REDIRECT_ONLINK : ND_REDIRECT_ROUTER);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-10-15 15:12:44 +04:00
|
|
|
if (!is_onlink) { /* better router case. perform rtredirect. */
|
1999-06-28 10:36:47 +04:00
|
|
|
/* perform rtredirect */
|
|
|
|
struct sockaddr_in6 sdst;
|
|
|
|
struct sockaddr_in6 sgw;
|
|
|
|
struct sockaddr_in6 ssrc;
|
2001-02-08 19:07:39 +03:00
|
|
|
unsigned long rtcount;
|
|
|
|
struct rtentry *newrt = NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* do not install redirect route, if the number of entries
|
|
|
|
* is too much (> hiwat). note that, the node (= host) will
|
|
|
|
* work just fine even if we do not install redirect route
|
|
|
|
* (there will be additional hops, though).
|
|
|
|
*/
|
|
|
|
rtcount = rt_timer_count(icmp6_redirect_timeout_q);
|
|
|
|
if (0 <= icmp6_redirect_hiwat && rtcount > icmp6_redirect_hiwat)
|
|
|
|
return;
|
|
|
|
else if (0 <= icmp6_redirect_lowat &&
|
|
|
|
rtcount > icmp6_redirect_lowat) {
|
|
|
|
/*
|
|
|
|
* XXX nuke a victim, install the new one.
|
|
|
|
*/
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
bzero(&sdst, sizeof(sdst));
|
|
|
|
bzero(&sgw, sizeof(sgw));
|
|
|
|
bzero(&ssrc, sizeof(ssrc));
|
|
|
|
sdst.sin6_family = sgw.sin6_family = ssrc.sin6_family = AF_INET6;
|
|
|
|
sdst.sin6_len = sgw.sin6_len = ssrc.sin6_len =
|
|
|
|
sizeof(struct sockaddr_in6);
|
|
|
|
bcopy(&redtgt6, &sgw.sin6_addr, sizeof(struct in6_addr));
|
|
|
|
bcopy(&reddst6, &sdst.sin6_addr, sizeof(struct in6_addr));
|
|
|
|
bcopy(&src6, &ssrc.sin6_addr, sizeof(struct in6_addr));
|
|
|
|
rtredirect((struct sockaddr *)&sdst, (struct sockaddr *)&sgw,
|
|
|
|
(struct sockaddr *)NULL, RTF_GATEWAY | RTF_HOST,
|
|
|
|
(struct sockaddr *)&ssrc,
|
2001-02-08 19:07:39 +03:00
|
|
|
&newrt);
|
|
|
|
|
|
|
|
if (newrt) {
|
|
|
|
(void)rt_timer_add(newrt, icmp6_redirect_timeout,
|
|
|
|
icmp6_redirect_timeout_q);
|
|
|
|
rtfree(newrt);
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
/* finally update cached route in each socket via pfctlinput */
|
2001-12-21 11:54:52 +03:00
|
|
|
{
|
|
|
|
struct sockaddr_in6 sdst;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-12-21 11:54:52 +03:00
|
|
|
bzero(&sdst, sizeof(sdst));
|
|
|
|
sdst.sin6_family = AF_INET6;
|
|
|
|
sdst.sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
bcopy(&reddst6, &sdst.sin6_addr, sizeof(struct in6_addr));
|
|
|
|
pfctlinput(PRC_REDIRECT_HOST, (struct sockaddr *)&sdst);
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef IPSEC
|
2001-12-21 11:54:52 +03:00
|
|
|
key_sa_routechange((struct sockaddr *)&sdst);
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
2001-12-21 11:54:52 +03:00
|
|
|
}
|
2000-02-26 11:39:18 +03:00
|
|
|
|
|
|
|
freeit:
|
|
|
|
m_freem(m);
|
2001-02-07 11:59:47 +03:00
|
|
|
return;
|
|
|
|
|
|
|
|
bad:
|
|
|
|
icmp6stat.icp6s_badredirect++;
|
|
|
|
m_freem(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
icmp6_redirect_output(m0, rt)
|
|
|
|
struct mbuf *m0;
|
|
|
|
struct rtentry *rt;
|
|
|
|
{
|
|
|
|
struct ifnet *ifp; /* my outgoing interface */
|
|
|
|
struct in6_addr *ifp_ll6;
|
2002-03-05 11:13:56 +03:00
|
|
|
struct in6_addr *nexthop;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ip6_hdr *sip6; /* m0 as struct ip6_hdr */
|
|
|
|
struct mbuf *m = NULL; /* newly allocated one */
|
|
|
|
struct ip6_hdr *ip6; /* m as struct ip6_hdr */
|
|
|
|
struct nd_redirect *nd_rd;
|
|
|
|
size_t maxlen;
|
|
|
|
u_char *p;
|
2000-05-09 15:51:12 +04:00
|
|
|
struct sockaddr_in6 src_sa;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-07-06 16:36:18 +04:00
|
|
|
icmp6_errcount(&icmp6stat.icp6s_outerrhist, ND_REDIRECT, 0);
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* if we are not router, we don't send icmp6 redirect */
|
2003-06-24 11:54:47 +04:00
|
|
|
if (!ip6_forwarding)
|
1999-06-28 10:36:47 +04:00
|
|
|
goto fail;
|
|
|
|
|
|
|
|
/* sanity check */
|
|
|
|
if (!m0 || !rt || !(rt->rt_flags & RTF_UP) || !(ifp = rt->rt_ifp))
|
|
|
|
goto fail;
|
1999-07-06 16:23:19 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Address check:
|
|
|
|
* the source address must identify a neighbor, and
|
|
|
|
* the destination address must not be a multicast address
|
|
|
|
* [RFC 2461, sec 8.2]
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
sip6 = mtod(m0, struct ip6_hdr *);
|
2000-05-09 15:51:12 +04:00
|
|
|
bzero(&src_sa, sizeof(src_sa));
|
|
|
|
src_sa.sin6_family = AF_INET6;
|
|
|
|
src_sa.sin6_len = sizeof(src_sa);
|
|
|
|
src_sa.sin6_addr = sip6->ip6_src;
|
|
|
|
/* we don't currently use sin6_scope_id, but eventually use it */
|
|
|
|
src_sa.sin6_scope_id = in6_addr2scopeid(ifp, &sip6->ip6_src);
|
|
|
|
if (nd6_is_addr_neighbor(&src_sa, ifp) == 0)
|
1999-07-06 16:23:19 +04:00
|
|
|
goto fail;
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_IS_ADDR_MULTICAST(&sip6->ip6_dst))
|
|
|
|
goto fail; /* what should we do here? */
|
|
|
|
|
|
|
|
/* rate limit */
|
|
|
|
if (icmp6_ratelimit(&sip6->ip6_src, ND_REDIRECT, 0))
|
|
|
|
goto fail;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Since we are going to append up to 1280 bytes (= IPV6_MMTU),
|
|
|
|
* we almost always ask for an mbuf cluster for simplicity.
|
|
|
|
* (MHLEN < IPV6_MMTU is almost always true)
|
|
|
|
*/
|
2000-02-26 11:39:18 +03:00
|
|
|
#if IPV6_MMTU >= MCLBYTES
|
|
|
|
# error assumption failed about IPV6_MMTU and MCLBYTES
|
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
MGETHDR(m, M_DONTWAIT, MT_HEADER);
|
2000-02-26 11:39:18 +03:00
|
|
|
if (m && IPV6_MMTU >= MHLEN)
|
|
|
|
MCLGET(m, M_DONTWAIT);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (!m)
|
|
|
|
goto fail;
|
2001-12-21 11:54:52 +03:00
|
|
|
m->m_pkthdr.rcvif = NULL;
|
2000-08-19 12:15:53 +04:00
|
|
|
m->m_len = 0;
|
|
|
|
maxlen = M_TRAILINGSPACE(m);
|
1999-06-28 10:36:47 +04:00
|
|
|
maxlen = min(IPV6_MMTU, maxlen);
|
|
|
|
/* just for safety */
|
2000-02-26 11:39:18 +03:00
|
|
|
if (maxlen < sizeof(struct ip6_hdr) + sizeof(struct icmp6_hdr) +
|
|
|
|
((sizeof(struct nd_opt_hdr) + ifp->if_addrlen + 7) & ~7)) {
|
1999-06-28 10:36:47 +04:00
|
|
|
goto fail;
|
2000-02-26 11:39:18 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
{
|
|
|
|
/* get ip6 linklocal address for ifp(my outgoing interface). */
|
2000-02-26 11:39:18 +03:00
|
|
|
struct in6_ifaddr *ia;
|
|
|
|
if ((ia = in6ifa_ifpforlinklocal(ifp,
|
|
|
|
IN6_IFF_NOTREADY|
|
|
|
|
IN6_IFF_ANYCAST)) == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
goto fail;
|
|
|
|
ifp_ll6 = &ia->ia_addr.sin6_addr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* get ip6 linklocal address for the router. */
|
|
|
|
if (rt->rt_gateway && (rt->rt_flags & RTF_GATEWAY)) {
|
|
|
|
struct sockaddr_in6 *sin6;
|
|
|
|
sin6 = (struct sockaddr_in6 *)rt->rt_gateway;
|
2002-03-05 11:13:56 +03:00
|
|
|
nexthop = &sin6->sin6_addr;
|
|
|
|
if (!IN6_IS_ADDR_LINKLOCAL(nexthop))
|
|
|
|
nexthop = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
} else
|
2002-03-05 11:13:56 +03:00
|
|
|
nexthop = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* ip6 */
|
|
|
|
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;
|
|
|
|
/* ip6->ip6_src must be linklocal addr for my outgoing if. */
|
|
|
|
bcopy(ifp_ll6, &ip6->ip6_src, sizeof(struct in6_addr));
|
|
|
|
bcopy(&sip6->ip6_src, &ip6->ip6_dst, sizeof(struct in6_addr));
|
|
|
|
|
|
|
|
/* ND Redirect */
|
|
|
|
nd_rd = (struct nd_redirect *)(ip6 + 1);
|
|
|
|
nd_rd->nd_rd_type = ND_REDIRECT;
|
|
|
|
nd_rd->nd_rd_code = 0;
|
|
|
|
nd_rd->nd_rd_reserved = 0;
|
|
|
|
if (rt->rt_flags & RTF_GATEWAY) {
|
|
|
|
/*
|
|
|
|
* nd_rd->nd_rd_target must be a link-local address in
|
|
|
|
* better router cases.
|
|
|
|
*/
|
2002-03-05 11:13:56 +03:00
|
|
|
if (!nexthop)
|
1999-06-28 10:36:47 +04:00
|
|
|
goto fail;
|
2002-03-05 11:13:56 +03:00
|
|
|
bcopy(nexthop, &nd_rd->nd_rd_target,
|
1999-06-28 10:36:47 +04:00
|
|
|
sizeof(nd_rd->nd_rd_target));
|
|
|
|
bcopy(&sip6->ip6_dst, &nd_rd->nd_rd_dst,
|
|
|
|
sizeof(nd_rd->nd_rd_dst));
|
|
|
|
} else {
|
|
|
|
/* make sure redtgt == reddst */
|
2002-03-05 11:13:56 +03:00
|
|
|
nexthop = &sip6->ip6_dst;
|
1999-06-28 10:36:47 +04:00
|
|
|
bcopy(&sip6->ip6_dst, &nd_rd->nd_rd_target,
|
|
|
|
sizeof(nd_rd->nd_rd_target));
|
|
|
|
bcopy(&sip6->ip6_dst, &nd_rd->nd_rd_dst,
|
|
|
|
sizeof(nd_rd->nd_rd_dst));
|
|
|
|
}
|
|
|
|
|
|
|
|
p = (u_char *)(nd_rd + 1);
|
|
|
|
|
2002-03-05 11:13:56 +03:00
|
|
|
{
|
|
|
|
/* target lladdr option */
|
|
|
|
struct rtentry *rt_nexthop = NULL;
|
|
|
|
int len;
|
|
|
|
struct sockaddr_dl *sdl;
|
|
|
|
struct nd_opt_hdr *nd_opt;
|
|
|
|
char *lladdr;
|
|
|
|
|
|
|
|
rt_nexthop = nd6_lookup(nexthop, 0, ifp);
|
|
|
|
if (!rt_nexthop)
|
|
|
|
goto nolladdropt;
|
|
|
|
len = sizeof(*nd_opt) + ifp->if_addrlen;
|
|
|
|
len = (len + 7) & ~7; /* round by 8 */
|
|
|
|
/* safety check */
|
|
|
|
if (len + (p - (u_char *)ip6) > maxlen)
|
|
|
|
goto nolladdropt;
|
|
|
|
if (!(rt_nexthop->rt_flags & RTF_GATEWAY) &&
|
|
|
|
(rt_nexthop->rt_flags & RTF_LLINFO) &&
|
|
|
|
(rt_nexthop->rt_gateway->sa_family == AF_LINK) &&
|
|
|
|
(sdl = (struct sockaddr_dl *)rt_nexthop->rt_gateway) &&
|
|
|
|
sdl->sdl_alen) {
|
|
|
|
nd_opt = (struct nd_opt_hdr *)p;
|
|
|
|
nd_opt->nd_opt_type = ND_OPT_TARGET_LINKADDR;
|
|
|
|
nd_opt->nd_opt_len = len >> 3;
|
|
|
|
lladdr = (char *)(nd_opt + 1);
|
|
|
|
bcopy(LLADDR(sdl), lladdr, ifp->if_addrlen);
|
|
|
|
p += len;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-03-05 11:13:56 +03:00
|
|
|
nolladdropt:;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
m->m_pkthdr.len = m->m_len = p - (u_char *)ip6;
|
|
|
|
|
|
|
|
/* just to be safe */
|
|
|
|
if (m0->m_flags & M_DECRYPTED)
|
|
|
|
goto noredhdropt;
|
2000-02-26 11:39:18 +03:00
|
|
|
if (p - (u_char *)ip6 > maxlen)
|
|
|
|
goto noredhdropt;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-06-03 09:20:06 +04:00
|
|
|
{
|
|
|
|
/* redirected header option */
|
|
|
|
int len;
|
|
|
|
struct nd_opt_rd_hdr *nd_opt_rh;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-06-03 09:20:06 +04:00
|
|
|
/*
|
|
|
|
* compute the maximum size for icmp6 redirect header option.
|
|
|
|
* XXX room for auth header?
|
|
|
|
*/
|
|
|
|
len = maxlen - (p - (u_char *)ip6);
|
|
|
|
len &= ~7;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-06-03 09:20:06 +04:00
|
|
|
/*
|
|
|
|
* Redirected header option spec (RFC2461 4.6.3) talks nothing
|
|
|
|
* about padding/truncate rule for the original IP packet.
|
|
|
|
* From the discussion on IPv6imp in Feb 1999,
|
|
|
|
* the consensus was:
|
|
|
|
* - "attach as much as possible" is the goal
|
|
|
|
* - pad if not aligned (original size can be guessed by
|
|
|
|
* original ip6 header)
|
|
|
|
* Following code adds the padding if it is simple enough,
|
|
|
|
* and truncates if not.
|
|
|
|
*/
|
|
|
|
if (len - sizeof(*nd_opt_rh) < m0->m_pkthdr.len) {
|
|
|
|
/* not enough room, truncate */
|
|
|
|
m_adj(m0, (len - sizeof(*nd_opt_rh)) -
|
|
|
|
m0->m_pkthdr.len);
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* enough room, truncate if not aligned.
|
|
|
|
* we don't pad here for simplicity.
|
|
|
|
*/
|
|
|
|
size_t extra;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-06-03 09:20:06 +04:00
|
|
|
extra = m0->m_pkthdr.len % 8;
|
|
|
|
if (extra) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/* truncate */
|
2003-06-03 09:20:06 +04:00
|
|
|
m_adj(m0, -extra);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2003-06-03 09:20:06 +04:00
|
|
|
len = m0->m_pkthdr.len + sizeof(*nd_opt_rh);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2003-06-03 09:20:06 +04:00
|
|
|
nd_opt_rh = (struct nd_opt_rd_hdr *)p;
|
|
|
|
bzero(nd_opt_rh, sizeof(*nd_opt_rh));
|
|
|
|
nd_opt_rh->nd_opt_rh_type = ND_OPT_REDIRECTED_HEADER;
|
|
|
|
nd_opt_rh->nd_opt_rh_len = len >> 3;
|
|
|
|
p += sizeof(*nd_opt_rh);
|
|
|
|
m->m_pkthdr.len = m->m_len = p - (u_char *)ip6;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-06-03 09:20:06 +04:00
|
|
|
/* connect m0 to m */
|
|
|
|
m->m_pkthdr.len += m0->m_pkthdr.len;
|
2003-08-06 18:47:32 +04:00
|
|
|
m_cat(m, m0);
|
2003-06-03 09:20:06 +04:00
|
|
|
m0 = NULL;
|
|
|
|
}
|
|
|
|
noredhdropt:
|
2003-04-01 03:55:46 +04:00
|
|
|
if (m0) {
|
|
|
|
m_freem(m0);
|
|
|
|
m0 = NULL;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&sip6->ip6_src))
|
|
|
|
sip6->ip6_src.s6_addr16[1] = 0;
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&sip6->ip6_dst))
|
|
|
|
sip6->ip6_dst.s6_addr16[1] = 0;
|
|
|
|
#if 0
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&ip6->ip6_src))
|
|
|
|
ip6->ip6_src.s6_addr16[1] = 0;
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&ip6->ip6_dst))
|
|
|
|
ip6->ip6_dst.s6_addr16[1] = 0;
|
|
|
|
#endif
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&nd_rd->nd_rd_target))
|
|
|
|
nd_rd->nd_rd_target.s6_addr16[1] = 0;
|
|
|
|
if (IN6_IS_ADDR_LINKLOCAL(&nd_rd->nd_rd_dst))
|
|
|
|
nd_rd->nd_rd_dst.s6_addr16[1] = 0;
|
|
|
|
|
|
|
|
ip6->ip6_plen = htons(m->m_pkthdr.len - sizeof(struct ip6_hdr));
|
|
|
|
|
|
|
|
nd_rd->nd_rd_cksum = 0;
|
|
|
|
nd_rd->nd_rd_cksum
|
|
|
|
= in6_cksum(m, IPPROTO_ICMPV6, sizeof(*ip6), ntohs(ip6->ip6_plen));
|
|
|
|
|
|
|
|
/* send the packet to outside... */
|
2003-08-23 00:20:09 +04:00
|
|
|
if (ip6_output(m, NULL, NULL, 0,
|
2003-08-23 01:53:01 +04:00
|
|
|
(struct ip6_moptions *)NULL, (struct socket *)NULL, NULL) != 0)
|
2001-12-07 13:10:43 +03:00
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_error);
|
|
|
|
|
2001-10-18 13:09:25 +04:00
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_msg);
|
|
|
|
icmp6_ifstat_inc(ifp, ifs6_out_redirect);
|
1999-06-28 10:36:47 +04:00
|
|
|
icmp6stat.icp6s_outhist[ND_REDIRECT]++;
|
|
|
|
|
|
|
|
return;
|
|
|
|
|
|
|
|
fail:
|
|
|
|
if (m)
|
|
|
|
m_freem(m);
|
|
|
|
if (m0)
|
|
|
|
m_freem(m0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ICMPv6 socket option processing.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
icmp6_ctloutput(op, so, level, optname, mp)
|
|
|
|
int op;
|
|
|
|
struct socket *so;
|
|
|
|
int level, optname;
|
|
|
|
struct mbuf **mp;
|
|
|
|
{
|
|
|
|
int error = 0;
|
2001-02-10 07:14:26 +03:00
|
|
|
int optlen;
|
|
|
|
struct in6pcb *in6p = sotoin6pcb(so);
|
|
|
|
struct mbuf *m = *mp;
|
|
|
|
|
|
|
|
optlen = m ? m->m_len : 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (level != IPPROTO_ICMPV6) {
|
|
|
|
if (op == PRCO_SETOPT && m)
|
|
|
|
(void)m_free(m);
|
2001-02-10 07:14:26 +03:00
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (op) {
|
|
|
|
case PRCO_SETOPT:
|
|
|
|
switch (optname) {
|
|
|
|
case ICMP6_FILTER:
|
|
|
|
{
|
|
|
|
struct icmp6_filter *p;
|
|
|
|
|
|
|
|
if (optlen != sizeof(*p)) {
|
|
|
|
error = EMSGSIZE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
p = mtod(m, struct icmp6_filter *);
|
|
|
|
if (!p || !in6p->in6p_icmp6filt) {
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
bcopy(p, in6p->in6p_icmp6filt,
|
1999-06-28 10:36:47 +04:00
|
|
|
sizeof(struct icmp6_filter));
|
2001-02-10 07:14:26 +03:00
|
|
|
error = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
error = ENOPROTOOPT;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (m)
|
|
|
|
(void)m_freem(m);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRCO_GETOPT:
|
|
|
|
switch (optname) {
|
|
|
|
case ICMP6_FILTER:
|
|
|
|
{
|
|
|
|
struct icmp6_filter *p;
|
|
|
|
|
|
|
|
if (!in6p->in6p_icmp6filt) {
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
*mp = m = m_get(M_WAIT, MT_SOOPTS);
|
|
|
|
m->m_len = sizeof(struct icmp6_filter);
|
|
|
|
p = mtod(m, struct icmp6_filter *);
|
|
|
|
bcopy(in6p->in6p_icmp6filt, p,
|
1999-06-28 10:36:47 +04:00
|
|
|
sizeof(struct icmp6_filter));
|
2001-02-10 07:14:26 +03:00
|
|
|
error = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
default:
|
|
|
|
error = ENOPROTOOPT;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2002-09-11 06:46:42 +04:00
|
|
|
return (error);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Perform rate limit check.
|
|
|
|
* Returns 0 if it is okay to send the icmp6 packet.
|
|
|
|
* Returns 1 if the router SHOULD NOT send this icmp6 packet due to rate
|
|
|
|
* limitation.
|
|
|
|
*
|
|
|
|
* XXX per-destination/type check necessary?
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
icmp6_ratelimit(dst, type, code)
|
|
|
|
const struct in6_addr *dst; /* not used at this moment */
|
|
|
|
const int type; /* not used at this moment */
|
|
|
|
const int code; /* not used at this moment */
|
|
|
|
{
|
2000-07-06 16:36:18 +04:00
|
|
|
int ret;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-10-15 15:12:44 +04:00
|
|
|
ret = 0; /* okay to send */
|
2000-07-06 16:36:18 +04:00
|
|
|
|
|
|
|
/* PPS limit */
|
2000-07-09 10:44:57 +04:00
|
|
|
if (!ppsratecheck(&icmp6errppslim_last, &icmp6errpps_count,
|
|
|
|
icmp6errppslim)) {
|
|
|
|
/* The packet is subject to rate limit */
|
2000-07-06 16:36:18 +04:00
|
|
|
ret++;
|
|
|
|
}
|
|
|
|
|
|
|
|
return ret;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
1999-07-22 16:56:56 +04:00
|
|
|
static struct rtentry *
|
|
|
|
icmp6_mtudisc_clone(dst)
|
|
|
|
struct sockaddr *dst;
|
|
|
|
{
|
|
|
|
struct rtentry *rt;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
rt = rtalloc1(dst, 1);
|
|
|
|
if (rt == 0)
|
|
|
|
return NULL;
|
2000-05-09 15:51:12 +04:00
|
|
|
|
1999-07-22 16:56:56 +04:00
|
|
|
/* If we didn't get a host route, allocate one */
|
|
|
|
if ((rt->rt_flags & RTF_HOST) == 0) {
|
|
|
|
struct rtentry *nrt;
|
|
|
|
|
2000-05-09 15:51:12 +04:00
|
|
|
error = rtrequest((int) RTM_ADD, dst,
|
1999-07-22 16:56:56 +04:00
|
|
|
(struct sockaddr *) rt->rt_gateway,
|
2000-05-09 15:51:12 +04:00
|
|
|
(struct sockaddr *) 0,
|
1999-07-22 16:56:56 +04:00
|
|
|
RTF_GATEWAY | RTF_HOST | RTF_DYNAMIC, &nrt);
|
|
|
|
if (error) {
|
|
|
|
rtfree(rt);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
nrt->rt_rmx = rt->rt_rmx;
|
|
|
|
rtfree(rt);
|
|
|
|
rt = nrt;
|
|
|
|
}
|
|
|
|
error = rt_timer_add(rt, icmp6_mtudisc_timeout,
|
|
|
|
icmp6_mtudisc_timeout_q);
|
|
|
|
if (error) {
|
|
|
|
rtfree(rt);
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return rt; /* caller need to call rtfree() */
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
icmp6_mtudisc_timeout(rt, r)
|
|
|
|
struct rtentry *rt;
|
|
|
|
struct rttimer *r;
|
|
|
|
{
|
|
|
|
if (rt == NULL)
|
|
|
|
panic("icmp6_mtudisc_timeout: bad route to timeout");
|
2000-05-09 15:51:12 +04:00
|
|
|
if ((rt->rt_flags & (RTF_DYNAMIC | RTF_HOST)) ==
|
1999-07-22 16:56:56 +04:00
|
|
|
(RTF_DYNAMIC | RTF_HOST)) {
|
|
|
|
rtrequest((int) RTM_DELETE, (struct sockaddr *)rt_key(rt),
|
|
|
|
rt->rt_gateway, rt_mask(rt), rt->rt_flags, 0);
|
|
|
|
} else {
|
2002-05-29 10:55:48 +04:00
|
|
|
if (!(rt->rt_rmx.rmx_locks & RTV_MTU))
|
|
|
|
rt->rt_rmx.rmx_mtu = 0;
|
1999-07-22 16:56:56 +04:00
|
|
|
}
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-02-08 19:07:39 +03:00
|
|
|
static void
|
|
|
|
icmp6_redirect_timeout(rt, r)
|
|
|
|
struct rtentry *rt;
|
|
|
|
struct rttimer *r;
|
|
|
|
{
|
|
|
|
if (rt == NULL)
|
|
|
|
panic("icmp6_redirect_timeout: bad route to timeout");
|
|
|
|
if ((rt->rt_flags & (RTF_GATEWAY | RTF_DYNAMIC | RTF_HOST)) ==
|
|
|
|
(RTF_GATEWAY | RTF_DYNAMIC | RTF_HOST)) {
|
|
|
|
rtrequest((int) RTM_DELETE, (struct sockaddr *)rt_key(rt),
|
|
|
|
rt->rt_gateway, rt_mask(rt), rt->rt_flags, 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
/*
|
|
|
|
* sysctl helper routine for the net.inet6.icmp6.nd6 nodes. silly?
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
sysctl_net_inet6_icmp6_nd6(SYSCTLFN_ARGS)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
|
2003-12-17 21:49:38 +03:00
|
|
|
if (namelen != 0)
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
return (EINVAL);
|
|
|
|
|
2003-12-17 21:49:38 +03:00
|
|
|
return (nd6_sysctl(rnode->sysctl_num, oldp, oldlenp,
|
|
|
|
(void*)newp, newlen));
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
SYSCTL_SETUP(sysctl_net_inet6_icmp6_setup,
|
|
|
|
"sysctl net.inet6.icmp6 subtree setup")
|
|
|
|
{
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "net", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_NODE, "inet6", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_NODE, "icmp6",
|
|
|
|
SYSCTL_DESCR("ICMPv6 related settings"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6, CTL_EOL);
|
|
|
|
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_STRUCT, "stats",
|
|
|
|
SYSCTL_DESCR("ICMPv6 transmission statistics"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6stat, sizeof(icmp6stat),
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_STATS, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "rediraccept",
|
|
|
|
SYSCTL_DESCR("Accept and process redirect messages"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6_rediraccept, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_REDIRACCEPT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "redirtimeout",
|
|
|
|
SYSCTL_DESCR("Redirect generated route lifetime"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6_redirtimeout, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_REDIRTIMEOUT, CTL_EOL);
|
|
|
|
#if 0 /* obsoleted */
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_INT, "errratelimit", NULL,
|
|
|
|
NULL, 0, &icmp6_errratelimit, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ERRRATELIMIT, CTL_EOL);
|
|
|
|
#endif
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_prune",
|
|
|
|
SYSCTL_DESCR("Neighbor discovery prune interval"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_prune, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_PRUNE, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_delay",
|
|
|
|
SYSCTL_DESCR("First probe delay time"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_delay, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_DELAY, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_umaxtries",
|
|
|
|
SYSCTL_DESCR("Number of unicast discovery attempts"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_umaxtries, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_UMAXTRIES, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_mmaxtries",
|
|
|
|
SYSCTL_DESCR("Number of multicast discovery attempts"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_mmaxtries, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_MMAXTRIES, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_useloopback",
|
|
|
|
SYSCTL_DESCR("Use loopback interface for local traffic"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_useloopback, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_USELOOPBACK, CTL_EOL);
|
|
|
|
#if 0 /* obsoleted */
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
CTLTYPE_INT, "nd6_proxyall", NULL,
|
|
|
|
NULL, 0, &nd6_proxyall, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_PROXYALL, CTL_EOL);
|
|
|
|
#endif
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nodeinfo",
|
|
|
|
SYSCTL_DESCR("Respond to node information requests"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6_nodeinfo, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_NODEINFO, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "errppslimit",
|
|
|
|
SYSCTL_DESCR("Maximum ICMP errors sent per second"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6errppslim, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ERRPPSLIMIT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_maxnudhint",
|
|
|
|
SYSCTL_DESCR("Maximum neighbor unreachable hint count"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_maxnudhint, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_MAXNUDHINT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "mtudisc_hiwat",
|
|
|
|
SYSCTL_DESCR("Low mark on MTU Discovery route timers"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6_mtudisc_hiwat, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_MTUDISC_HIWAT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "mtudisc_lowat",
|
|
|
|
SYSCTL_DESCR("Low mark on MTU Discovery route timers"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &icmp6_mtudisc_lowat, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_MTUDISC_LOWAT, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "nd6_debug",
|
|
|
|
SYSCTL_DESCR("Enable neighbor discovery debug output"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
NULL, 0, &nd6_debug, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_DEBUG, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_STRUCT, "nd6_drlist",
|
|
|
|
SYSCTL_DESCR("Default router list"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_net_inet6_icmp6_nd6, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_DRLIST, CTL_EOL);
|
2004-03-24 18:34:46 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_STRUCT, "nd6_prlist",
|
|
|
|
SYSCTL_DESCR("Prefix list"),
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
sysctl_net_inet6_icmp6_nd6, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_ICMPV6,
|
|
|
|
ICMPV6CTL_ND6_PRLIST, CTL_EOL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|