2004-12-04 19:10:25 +03:00
|
|
|
/* $NetBSD: ip6_input.c,v 1.77 2004/12/04 16:10:25 peter Exp $ */
|
2001-03-30 15:08:56 +04:00
|
|
|
/* $KAME: ip6_input.c,v 1.188 2001/03/29 05:34:31 itojun 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-20 00:09:26 +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-20 00:09:26 +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_input.c 8.2 (Berkeley) 1/4/94
|
|
|
|
*/
|
|
|
|
|
2001-11-13 03:56:55 +03:00
|
|
|
#include <sys/cdefs.h>
|
2004-12-04 19:10:25 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: ip6_input.c,v 1.77 2004/12/04 16:10:25 peter 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"
|
2000-02-17 13:59:32 +03:00
|
|
|
#include "opt_pfil_hooks.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/domain.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/syslog.h>
|
|
|
|
#include <sys/proc.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/if_types.h>
|
|
|
|
#include <net/if_dl.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/netisr.h>
|
2000-02-17 13:59:32 +03:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
#include <net/pfil.h>
|
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
1999-12-13 18:17:17 +03:00
|
|
|
#ifdef INET
|
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/ip_icmp.h>
|
2001-10-24 10:36:37 +04:00
|
|
|
#endif /* INET */
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/ip6.h>
|
2000-01-06 09:41:18 +03:00
|
|
|
#include <netinet6/in6_var.h>
|
|
|
|
#include <netinet6/ip6_var.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/in6_pcb.h>
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/icmp6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/in6_ifattach.h>
|
|
|
|
#include <netinet6/nd6.h>
|
|
|
|
|
2001-03-01 19:31:37 +03:00
|
|
|
#ifdef IPSEC
|
|
|
|
#include <netinet6/ipsec.h>
|
|
|
|
#endif
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/ip6protosw.h>
|
|
|
|
|
|
|
|
#include "faith.h"
|
|
|
|
#include "gif.h"
|
|
|
|
|
2001-12-21 06:58:15 +03:00
|
|
|
#if NGIF > 0
|
|
|
|
#include <netinet6/in6_gif.h>
|
|
|
|
#endif
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#include <net/net_osdep.h>
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
extern struct domain inet6domain;
|
|
|
|
|
|
|
|
u_char ip6_protox[IPPROTO_MAX];
|
|
|
|
static int ip6qmaxlen = IFQ_MAXLEN;
|
|
|
|
struct in6_ifaddr *in6_ifaddr;
|
|
|
|
struct ifqueue ip6intrq;
|
|
|
|
|
|
|
|
int ip6_forward_srcrt; /* XXX */
|
|
|
|
int ip6_sourcecheck; /* XXX */
|
|
|
|
int ip6_sourcecheck_interval; /* XXX */
|
1999-12-13 18:17:17 +03:00
|
|
|
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
struct pfil_head inet6_pfil_hook;
|
|
|
|
#endif
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ip6stat ip6stat;
|
|
|
|
|
|
|
|
static void ip6_init2 __P((void *));
|
|
|
|
|
1999-07-22 07:59:42 +04:00
|
|
|
static int ip6_hopopts_input __P((u_int32_t *, u_int32_t *, struct mbuf **, int *));
|
2003-05-14 18:34:14 +04:00
|
|
|
static struct mbuf *ip6_pullexthdr __P((struct mbuf *, size_t, int));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* IP6 initialization: fill in IP6 protocol switch table.
|
|
|
|
* All protocols not implemented in kernel go to raw IP6 protocol handler.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ip6_init()
|
|
|
|
{
|
2001-02-10 07:14:26 +03:00
|
|
|
struct ip6protosw *pr;
|
|
|
|
int i;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
pr = (struct ip6protosw *)pffindproto(PF_INET6, IPPROTO_RAW, SOCK_RAW);
|
|
|
|
if (pr == 0)
|
|
|
|
panic("ip6_init");
|
|
|
|
for (i = 0; i < IPPROTO_MAX; i++)
|
|
|
|
ip6_protox[i] = pr - inet6sw;
|
|
|
|
for (pr = (struct ip6protosw *)inet6domain.dom_protosw;
|
|
|
|
pr < (struct ip6protosw *)inet6domain.dom_protoswNPROTOSW; pr++)
|
|
|
|
if (pr->pr_domain->dom_family == PF_INET6 &&
|
|
|
|
pr->pr_protocol && pr->pr_protocol != IPPROTO_RAW)
|
|
|
|
ip6_protox[pr->pr_protocol] = pr - inet6sw;
|
|
|
|
ip6intrq.ifq_maxlen = ip6qmaxlen;
|
|
|
|
nd6_init();
|
|
|
|
frag6_init();
|
|
|
|
|
|
|
|
ip6_init2((void *)0);
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
|
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
/* Register our Packet Filter hook. */
|
2000-12-29 00:40:59 +03:00
|
|
|
inet6_pfil_hook.ph_type = PFIL_TYPE_AF;
|
|
|
|
inet6_pfil_hook.ph_af = AF_INET6;
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
i = pfil_head_register(&inet6_pfil_hook);
|
|
|
|
if (i != 0)
|
|
|
|
printf("ip6_init: WARNING: unable to register pfil hook, "
|
|
|
|
"error %d\n", i);
|
|
|
|
#endif /* PFIL_HOOKS */
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
ip6_init2(dummy)
|
|
|
|
void *dummy;
|
|
|
|
{
|
|
|
|
|
|
|
|
/* nd6_timer_init */
|
2000-03-23 10:01:25 +03:00
|
|
|
callout_init(&nd6_timer_ch);
|
|
|
|
callout_reset(&nd6_timer_ch, hz, nd6_timer, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IP6 input interrupt handling. Just pass the packet to ip6_input.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ip6intr()
|
|
|
|
{
|
|
|
|
int s;
|
|
|
|
struct mbuf *m;
|
|
|
|
|
|
|
|
for (;;) {
|
2001-04-14 03:29:55 +04:00
|
|
|
s = splnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
IF_DEQUEUE(&ip6intrq, m);
|
|
|
|
splx(s);
|
|
|
|
if (m == 0)
|
|
|
|
return;
|
|
|
|
ip6_input(m);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
extern struct route_in6 ip6_forward_rt;
|
|
|
|
|
|
|
|
void
|
|
|
|
ip6_input(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ip6_hdr *ip6;
|
1999-06-28 10:36:47 +04:00
|
|
|
int off = sizeof(struct ip6_hdr), nest;
|
|
|
|
u_int32_t plen;
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t rtalert = ~0;
|
1999-06-28 10:36:47 +04:00
|
|
|
int nxt, ours = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ifnet *deliverifp = NULL;
|
2003-06-30 12:00:59 +04:00
|
|
|
int srcrt = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef IPSEC
|
|
|
|
/*
|
|
|
|
* should the inner packet be considered authentic?
|
|
|
|
* see comment in ah4_input().
|
|
|
|
*/
|
2001-12-18 06:04:02 +03:00
|
|
|
m->m_flags &= ~M_AUTHIPHDR;
|
|
|
|
m->m_flags &= ~M_AUTHIPDGM;
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2001-10-16 10:24:44 +04:00
|
|
|
* mbuf statistics
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
if (m->m_flags & M_EXT) {
|
|
|
|
if (m->m_next)
|
|
|
|
ip6stat.ip6s_mext2m++;
|
|
|
|
else
|
|
|
|
ip6stat.ip6s_mext1++;
|
|
|
|
} else {
|
2001-03-30 15:08:56 +04:00
|
|
|
#define M2MMAX (sizeof(ip6stat.ip6s_m2m)/sizeof(ip6stat.ip6s_m2m[0]))
|
1999-06-28 10:36:47 +04:00
|
|
|
if (m->m_next) {
|
1999-12-13 18:17:17 +03:00
|
|
|
if (m->m_flags & M_LOOP) {
|
2004-12-04 19:10:25 +03:00
|
|
|
ip6stat.ip6s_m2m[lo0ifp->if_index]++; /* XXX */
|
2001-03-30 15:08:56 +04:00
|
|
|
} else if (m->m_pkthdr.rcvif->if_index < M2MMAX)
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6stat.ip6s_m2m[m->m_pkthdr.rcvif->if_index]++;
|
|
|
|
else
|
|
|
|
ip6stat.ip6s_m2m[0]++;
|
|
|
|
} else
|
|
|
|
ip6stat.ip6s_m1++;
|
2001-03-30 15:08:56 +04:00
|
|
|
#undef M2MMAX
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_receive);
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6stat.ip6s_total++;
|
|
|
|
|
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
|
|
|
/*
|
|
|
|
* If the IPv6 header is not aligned, slurp it up into a new
|
|
|
|
* mbuf with space for link headers, in the event we forward
|
|
|
|
* it. OTherwise, if it is aligned, make sure the entire base
|
|
|
|
* IPv6 header is in the first mbuf of the chain.
|
|
|
|
*/
|
|
|
|
if (IP6_HDR_ALIGNED_P(mtod(m, caddr_t)) == 0) {
|
|
|
|
struct ifnet *inifp = m->m_pkthdr.rcvif;
|
|
|
|
if ((m = m_copyup(m, sizeof(struct ip6_hdr),
|
|
|
|
(max_linkhdr + 3) & ~3)) == NULL) {
|
|
|
|
/* XXXJRT new stat, please */
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
in6_ifstat_inc(inifp, ifs6_in_hdrerr);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else if (__predict_false(m->m_len < sizeof(struct ip6_hdr))) {
|
|
|
|
struct ifnet *inifp = m->m_pkthdr.rcvif;
|
2002-06-09 01:22:29 +04:00
|
|
|
if ((m = m_pullup(m, sizeof(struct ip6_hdr))) == NULL) {
|
1999-12-13 18:17:17 +03:00
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
in6_ifstat_inc(inifp, ifs6_in_hdrerr);
|
|
|
|
return;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
if ((ip6->ip6_vfc & IPV6_VERSION_MASK) != IPV6_VERSION) {
|
|
|
|
ip6stat.ip6s_badvers++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_hdrerr);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2000-02-17 13:59:32 +03:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
/*
|
|
|
|
* Run through list of hooks for input packets. If there are any
|
|
|
|
* filters which require that additional packets in the flow are
|
|
|
|
* not fast-forwarded, they must clear the M_CANFASTFWD flag.
|
|
|
|
* Note that filters must _never_ set this flag, as another filter
|
|
|
|
* in the list may have previously cleared it.
|
|
|
|
*/
|
2001-03-21 22:12:56 +03:00
|
|
|
/*
|
|
|
|
* let ipfilter look at packet on the wire,
|
|
|
|
* not the decapsulated packet.
|
|
|
|
*/
|
|
|
|
#ifdef IPSEC
|
2001-08-06 14:25:00 +04:00
|
|
|
if (!ipsec_getnhist(m))
|
2001-03-21 22:12:56 +03:00
|
|
|
#else
|
|
|
|
if (1)
|
|
|
|
#endif
|
|
|
|
{
|
2003-06-30 12:00:59 +04:00
|
|
|
struct in6_addr odst;
|
|
|
|
|
|
|
|
odst = ip6->ip6_dst;
|
2001-03-21 22:12:56 +03:00
|
|
|
if (pfil_run_hooks(&inet6_pfil_hook, &m, m->m_pkthdr.rcvif,
|
|
|
|
PFIL_IN) != 0)
|
|
|
|
return;
|
|
|
|
if (m == NULL)
|
|
|
|
return;
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
2003-06-30 12:00:59 +04:00
|
|
|
srcrt = !IN6_ARE_ADDR_EQUAL(&odst, &ip6->ip6_dst);
|
2001-03-21 22:12:56 +03:00
|
|
|
}
|
2000-02-17 13:59:32 +03:00
|
|
|
#endif /* PFIL_HOOKS */
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6stat.ip6s_nxthist[ip6->ip6_nxt]++;
|
|
|
|
|
2000-12-14 20:36:44 +03:00
|
|
|
#ifdef ALTQ
|
|
|
|
if (altq_input != NULL && (*altq_input)(m, AF_INET6) == 0) {
|
|
|
|
/* packet is dropped by traffic conditioner */
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2001-10-16 10:24:44 +04:00
|
|
|
* Check against address spoofing/corruption.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_UNSPECIFIED(&ip6->ip6_dst)) {
|
2002-06-09 01:22:29 +04:00
|
|
|
/*
|
|
|
|
* XXX: "badscope" is not very suitable for a multicast source.
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6stat.ip6s_badscope++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
2000-01-31 13:33:22 +03:00
|
|
|
/*
|
2001-10-16 10:24:44 +04:00
|
|
|
* The following check is not documented in specs. A malicious
|
|
|
|
* party may be able to use IPv4 mapped addr to confuse tcp/udp stack
|
|
|
|
* and bypass security checks (act as if it was from 127.0.0.1 by using
|
|
|
|
* IPv6 src ::ffff:127.0.0.1). Be cautious.
|
2001-02-10 07:14:26 +03:00
|
|
|
*
|
2001-10-16 10:24:44 +04:00
|
|
|
* This check chokes if we are in an SIIT cloud. As none of BSDs
|
|
|
|
* support IPv4-less kernel compilation, we cannot support SIIT
|
|
|
|
* environment at all. So, it makes more sense for us to reject any
|
|
|
|
* malicious packets for non-SIIT environment, than try to do a
|
2002-05-12 19:48:36 +04:00
|
|
|
* partial support for SIIT environment.
|
2000-01-31 13:33:22 +03:00
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4MAPPED(&ip6->ip6_dst)) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
2000-03-21 14:05:12 +03:00
|
|
|
#if 0
|
2000-01-31 13:33:22 +03:00
|
|
|
/*
|
2000-03-21 14:05:12 +03:00
|
|
|
* Reject packets with IPv4 compatible addresses (auto tunnel).
|
|
|
|
*
|
|
|
|
* The code forbids auto tunnel relay case in RFC1933 (the check is
|
|
|
|
* stronger than RFC1933). We may want to re-enable it if mech-xx
|
|
|
|
* is revised to forbid relaying case.
|
2000-01-31 13:33:22 +03:00
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_V4COMPAT(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4COMPAT(&ip6->ip6_dst)) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
2001-02-10 07:14:26 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_IS_ADDR_LOOPBACK(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_LOOPBACK(&ip6->ip6_dst)) {
|
|
|
|
if (m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) {
|
|
|
|
ours = 1;
|
1999-12-13 18:17:17 +03:00
|
|
|
deliverifp = m->m_pkthdr.rcvif;
|
1999-06-28 10:36:47 +04:00
|
|
|
goto hbhcheck;
|
|
|
|
} else {
|
|
|
|
ip6stat.ip6s_badscope++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-03-16 15:22:34 +03:00
|
|
|
/* drop packets if interface ID portion is already filled */
|
|
|
|
if ((m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) == 0) {
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_src) &&
|
|
|
|
ip6->ip6_src.s6_addr16[1]) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_dst) &&
|
|
|
|
ip6->ip6_dst.s6_addr16[1]) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
}
|
2001-03-30 15:08:56 +04:00
|
|
|
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_src))
|
|
|
|
ip6->ip6_src.s6_addr16[1]
|
|
|
|
= htons(m->m_pkthdr.rcvif->if_index);
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_dst))
|
|
|
|
ip6->ip6_dst.s6_addr16[1]
|
|
|
|
= htons(m->m_pkthdr.rcvif->if_index);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/*
|
2001-03-30 15:08:56 +04:00
|
|
|
* We use rt->rt_ifp to determine if the address is ours or not.
|
|
|
|
* If rt_ifp is lo0, the address is ours.
|
|
|
|
* The problem here is, rt->rt_ifp for fe80::%lo0/64 is set to lo0,
|
|
|
|
* so any address under fe80::%lo0/64 will be mistakenly considered
|
|
|
|
* local. The special case is supplied to handle the case properly
|
|
|
|
* by actually looking at interface addresses
|
|
|
|
* (using in6ifa_ifpwithaddr).
|
1999-12-13 18:17:17 +03:00
|
|
|
*/
|
2001-03-30 15:08:56 +04:00
|
|
|
if ((m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) != 0 &&
|
|
|
|
IN6_IS_ADDR_LINKLOCAL(&ip6->ip6_dst)) {
|
|
|
|
if (!in6ifa_ifpwithaddr(m->m_pkthdr.rcvif, &ip6->ip6_dst)) {
|
|
|
|
icmp6_error(m, ICMP6_DST_UNREACH,
|
|
|
|
ICMP6_DST_UNREACH_ADDR, 0);
|
|
|
|
/* m is already freed */
|
|
|
|
return;
|
2000-05-20 00:09:26 +04:00
|
|
|
}
|
2001-03-30 15:08:56 +04:00
|
|
|
|
|
|
|
ours = 1;
|
|
|
|
deliverifp = m->m_pkthdr.rcvif;
|
|
|
|
goto hbhcheck;
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Multicast check
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst)) {
|
|
|
|
struct in6_multi *in6m = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_mcast);
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* See if we belong to the destination multicast group on the
|
|
|
|
* arrival interface.
|
|
|
|
*/
|
|
|
|
IN6_LOOKUP_MULTI(ip6->ip6_dst, m->m_pkthdr.rcvif, in6m);
|
|
|
|
if (in6m)
|
|
|
|
ours = 1;
|
|
|
|
else if (!ip6_mrouter) {
|
|
|
|
ip6stat.ip6s_notmember++;
|
|
|
|
ip6stat.ip6s_cantforward++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
deliverifp = m->m_pkthdr.rcvif;
|
1999-06-28 10:36:47 +04:00
|
|
|
goto hbhcheck;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unicast check
|
|
|
|
*/
|
2000-06-13 18:43:44 +04:00
|
|
|
if (ip6_forward_rt.ro_rt != NULL &&
|
2002-06-09 01:22:29 +04:00
|
|
|
(ip6_forward_rt.ro_rt->rt_flags & RTF_UP) != 0 &&
|
2000-06-13 18:43:44 +04:00
|
|
|
IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst,
|
2004-02-11 13:54:29 +03:00
|
|
|
&((struct sockaddr_in6 *)(&ip6_forward_rt.ro_dst))->sin6_addr))
|
2000-07-06 16:36:18 +04:00
|
|
|
ip6stat.ip6s_forward_cachehit++;
|
2000-06-13 18:43:44 +04:00
|
|
|
else {
|
2001-02-10 07:14:26 +03:00
|
|
|
struct sockaddr_in6 *dst6;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (ip6_forward_rt.ro_rt) {
|
2000-06-13 18:43:44 +04:00
|
|
|
/* route is down or destination is different */
|
2000-07-06 16:36:18 +04:00
|
|
|
ip6stat.ip6s_forward_cachemiss++;
|
1999-06-28 10:36:47 +04:00
|
|
|
RTFREE(ip6_forward_rt.ro_rt);
|
|
|
|
ip6_forward_rt.ro_rt = 0;
|
|
|
|
}
|
2000-06-13 18:43:44 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
bzero(&ip6_forward_rt.ro_dst, sizeof(struct sockaddr_in6));
|
2001-02-10 07:14:26 +03:00
|
|
|
dst6 = (struct sockaddr_in6 *)&ip6_forward_rt.ro_dst;
|
|
|
|
dst6->sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
dst6->sin6_family = AF_INET6;
|
|
|
|
dst6->sin6_addr = ip6->ip6_dst;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
rtalloc((struct route *)&ip6_forward_rt);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
#define rt6_key(r) ((struct sockaddr_in6 *)((r)->rt_nodes->rn_key))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Accept the packet if the forwarding interface to the destination
|
|
|
|
* according to the routing table is the loopback interface,
|
|
|
|
* unless the associated route has a gateway.
|
|
|
|
* Note that this approach causes to accept a packet if there is a
|
|
|
|
* route to the loopback interface for the destination of the packet.
|
|
|
|
* But we think it's even useful in some situations, e.g. when using
|
|
|
|
* a special daemon which wants to intercept the packet.
|
|
|
|
*/
|
|
|
|
if (ip6_forward_rt.ro_rt &&
|
|
|
|
(ip6_forward_rt.ro_rt->rt_flags &
|
|
|
|
(RTF_HOST|RTF_GATEWAY)) == RTF_HOST &&
|
2002-06-09 01:22:29 +04:00
|
|
|
!(ip6_forward_rt.ro_rt->rt_flags & RTF_CLONED) &&
|
1999-06-28 10:36:47 +04:00
|
|
|
#if 0
|
|
|
|
/*
|
|
|
|
* The check below is redundant since the comparison of
|
|
|
|
* the destination and the key of the rtentry has
|
|
|
|
* already done through looking up the routing table.
|
|
|
|
*/
|
|
|
|
IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst,
|
2002-06-09 01:22:29 +04:00
|
|
|
&rt6_key(ip6_forward_rt.ro_rt)->sin6_addr) &&
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
ip6_forward_rt.ro_rt->rt_ifp->if_type == IFT_LOOP) {
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_ifaddr *ia6 =
|
|
|
|
(struct in6_ifaddr *)ip6_forward_rt.ro_rt->rt_ifa;
|
|
|
|
if (ia6->ia6_flags & IN6_IFF_ANYCAST)
|
|
|
|
m->m_flags |= M_ANYCAST6;
|
2000-07-02 13:56:39 +04:00
|
|
|
/*
|
|
|
|
* packets to a tentative, duplicated, or somehow invalid
|
|
|
|
* address must not be accepted.
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
if (!(ia6->ia6_flags & IN6_IFF_NOTREADY)) {
|
2000-07-02 13:56:39 +04:00
|
|
|
/* this address is ready */
|
1999-06-28 10:36:47 +04:00
|
|
|
ours = 1;
|
1999-12-13 18:17:17 +03:00
|
|
|
deliverifp = ia6->ia_ifp; /* correct? */
|
1999-06-28 10:36:47 +04:00
|
|
|
goto hbhcheck;
|
|
|
|
} else {
|
2000-07-02 13:56:39 +04:00
|
|
|
/* address is not ready, so discard the packet. */
|
2001-02-07 11:59:47 +03:00
|
|
|
nd6log((LOG_INFO,
|
2000-08-31 11:35:44 +04:00
|
|
|
"ip6_input: packet to an unready address %s->%s\n",
|
2000-07-02 13:56:39 +04:00
|
|
|
ip6_sprintf(&ip6->ip6_src),
|
2001-02-07 11:59:47 +03:00
|
|
|
ip6_sprintf(&ip6->ip6_dst)));
|
2000-07-02 13:56:39 +04:00
|
|
|
|
|
|
|
goto bad;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2002-06-09 01:22:29 +04:00
|
|
|
* FAITH (Firewall Aided Internet Translator)
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
#if defined(NFAITH) && 0 < NFAITH
|
|
|
|
if (ip6_keepfaith) {
|
2004-02-11 13:47:28 +03:00
|
|
|
if (ip6_forward_rt.ro_rt && ip6_forward_rt.ro_rt->rt_ifp &&
|
|
|
|
ip6_forward_rt.ro_rt->rt_ifp->if_type == IFT_FAITH) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/* XXX do we need more sanity checks? */
|
|
|
|
ours = 1;
|
2001-10-24 10:36:37 +04:00
|
|
|
deliverifp = ip6_forward_rt.ro_rt->rt_ifp; /* faith */
|
1999-12-13 18:17:17 +03:00
|
|
|
goto hbhcheck;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#if 0
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Last resort: check in6_ifaddr for incoming interface.
|
|
|
|
* The code is here until I update the "goto ours hack" code above
|
|
|
|
* working right.
|
|
|
|
*/
|
|
|
|
struct ifaddr *ifa;
|
|
|
|
for (ifa = m->m_pkthdr.rcvif->if_addrlist.tqh_first;
|
|
|
|
ifa;
|
|
|
|
ifa = ifa->ifa_list.tqe_next) {
|
|
|
|
if (ifa->ifa_addr == NULL)
|
|
|
|
continue; /* just for safety */
|
|
|
|
if (ifa->ifa_addr->sa_family != AF_INET6)
|
|
|
|
continue;
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(IFA_IN6(ifa), &ip6->ip6_dst)) {
|
|
|
|
ours = 1;
|
|
|
|
deliverifp = ifa->ifa_ifp;
|
1999-06-28 10:36:47 +04:00
|
|
|
goto hbhcheck;
|
|
|
|
}
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now there is no reason to process the packet if it's not our own
|
|
|
|
* and we're not a router.
|
|
|
|
*/
|
|
|
|
if (!ip6_forwarding) {
|
|
|
|
ip6stat.ip6s_cantforward++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
hbhcheck:
|
|
|
|
/*
|
|
|
|
* Process Hop-by-Hop options header if it's contained.
|
|
|
|
* m may be modified in ip6_hopopts_input().
|
|
|
|
* If a JumboPayload option is included, plen will also be modified.
|
|
|
|
*/
|
|
|
|
plen = (u_int32_t)ntohs(ip6->ip6_plen);
|
|
|
|
if (ip6->ip6_nxt == IPPROTO_HOPOPTS) {
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ip6_hbh *hbh;
|
|
|
|
|
|
|
|
if (ip6_hopopts_input(&plen, &rtalert, &m, &off)) {
|
|
|
|
#if 0 /*touches NULL pointer*/
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
return; /* m have already been freed */
|
1999-12-13 18:17:17 +03:00
|
|
|
}
|
2000-06-13 18:43:44 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* adjust pointer */
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
2000-06-13 18:43:44 +04:00
|
|
|
|
|
|
|
/*
|
2001-12-18 06:04:02 +03:00
|
|
|
* if the payload length field is 0 and the next header field
|
2000-06-13 18:43:44 +04:00
|
|
|
* indicates Hop-by-Hop Options header, then a Jumbo Payload
|
|
|
|
* option MUST be included.
|
|
|
|
*/
|
|
|
|
if (ip6->ip6_plen == 0 && plen == 0) {
|
|
|
|
/*
|
|
|
|
* Note that if a valid jumbo payload option is
|
|
|
|
* contained, ip6_hoptops_input() must set a valid
|
2002-06-09 01:22:29 +04:00
|
|
|
* (non-zero) payload length to the variable plen.
|
2000-06-13 18:43:44 +04:00
|
|
|
*/
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_hdrerr);
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
(caddr_t)&ip6->ip6_plen - (caddr_t)ip6);
|
|
|
|
return;
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m, sizeof(struct ip6_hdr),
|
|
|
|
sizeof(struct ip6_hbh));
|
|
|
|
if (hbh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
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(hbh));
|
1999-12-13 18:17:17 +03:00
|
|
|
nxt = hbh->ip6h_nxt;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* accept the packet if a router alert option is included
|
|
|
|
* and we act as an IPv6 router.
|
|
|
|
*/
|
1999-07-22 07:59:42 +04:00
|
|
|
if (rtalert != ~0 && ip6_forwarding)
|
1999-06-28 10:36:47 +04:00
|
|
|
ours = 1;
|
|
|
|
} else
|
|
|
|
nxt = ip6->ip6_nxt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check that the amount of data in the buffers
|
|
|
|
* is as at least much as the IPv6 header would have us expect.
|
|
|
|
* Trim mbufs if longer than we expect.
|
|
|
|
* Drop packet if shorter than we expect.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len - sizeof(struct ip6_hdr) < plen) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_truncated);
|
1999-06-28 10:36:47 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if (m->m_pkthdr.len > sizeof(struct ip6_hdr) + plen) {
|
|
|
|
if (m->m_len == m->m_pkthdr.len) {
|
|
|
|
m->m_len = sizeof(struct ip6_hdr) + plen;
|
|
|
|
m->m_pkthdr.len = sizeof(struct ip6_hdr) + plen;
|
|
|
|
} else
|
|
|
|
m_adj(m, sizeof(struct ip6_hdr) + plen - m->m_pkthdr.len);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Forward if desirable.
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst)) {
|
|
|
|
/*
|
|
|
|
* If we are acting as a multicast router, all
|
|
|
|
* incoming multicast packets are passed to the
|
|
|
|
* kernel-level multicast forwarding function.
|
|
|
|
* The packet is returned (relatively) intact; if
|
|
|
|
* ip6_mforward() returns a non-zero value, the packet
|
|
|
|
* must be discarded, else it may be accepted below.
|
|
|
|
*/
|
|
|
|
if (ip6_mrouter && ip6_mforward(ip6, m->m_pkthdr.rcvif, m)) {
|
|
|
|
ip6stat.ip6s_cantforward++;
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
if (!ours) {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
2000-06-13 18:43:44 +04:00
|
|
|
} else if (!ours) {
|
2003-06-30 12:00:59 +04:00
|
|
|
ip6_forward(m, srcrt);
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
2002-06-09 18:43:10 +04:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-07-06 16:36:18 +04:00
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Malicious party may be able to use IPv4 mapped addr to confuse
|
|
|
|
* tcp/udp stack and bypass security checks (act as if it was from
|
|
|
|
* 127.0.0.1 by using IPv6 src ::ffff:127.0.0.1). Be cautious.
|
|
|
|
*
|
|
|
|
* For SIIT end node behavior, you may want to disable the check.
|
|
|
|
* However, you will become vulnerable to attacks using IPv4 mapped
|
|
|
|
* source.
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4MAPPED(&ip6->ip6_dst)) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Tell launch routine the next header
|
|
|
|
*/
|
2000-01-06 18:46:07 +03:00
|
|
|
#ifdef IFA_STATS
|
2000-10-23 07:45:25 +04:00
|
|
|
if (deliverifp != NULL) {
|
1999-12-13 18:17:17 +03:00
|
|
|
struct in6_ifaddr *ia6;
|
|
|
|
ia6 = in6_ifawithifp(deliverifp, &ip6->ip6_dst);
|
|
|
|
if (ia6)
|
|
|
|
ia6->ia_ifa.ifa_data.ifad_inbytes += m->m_pkthdr.len;
|
|
|
|
}
|
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6stat.ip6s_delivered++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(deliverifp, ifs6_in_deliver);
|
1999-06-28 10:36:47 +04:00
|
|
|
nest = 0;
|
2001-03-30 15:08:56 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
while (nxt != IPPROTO_DONE) {
|
|
|
|
if (ip6_hdrnestlimit && (++nest > ip6_hdrnestlimit)) {
|
|
|
|
ip6stat.ip6s_toomanyhdr++;
|
|
|
|
goto bad;
|
|
|
|
}
|
1999-10-01 14:15:16 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* protection against faulty packet - there should be
|
|
|
|
* more sanity checks in header chain processing.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < off) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
1999-12-13 18:17:17 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_truncated);
|
1999-10-01 14:15:16 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2001-03-01 19:31:37 +03:00
|
|
|
#ifdef IPSEC
|
|
|
|
/*
|
|
|
|
* enforce IPsec policy checking if we are seeing last header.
|
|
|
|
* note that we do not visit this with protocols with pcb layer
|
|
|
|
* code - like udp/tcp/raw ip.
|
|
|
|
*/
|
|
|
|
if ((inet6sw[ip6_protox[nxt]].pr_flags & PR_LASTHDR) != 0 &&
|
|
|
|
ipsec6_in_reject(m, NULL)) {
|
|
|
|
ipsec6stat.in_polvio++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
2002-06-09 18:43:10 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
nxt = (*inet6sw[ip6_protox[nxt]].pr_input)(&m, &off, nxt);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
bad:
|
|
|
|
m_freem(m);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Hop-by-Hop options header processing. If a valid jumbo payload option is
|
|
|
|
* included, the real payload length will be stored in plenp.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
ip6_hopopts_input(plenp, rtalertp, mp, offp)
|
|
|
|
u_int32_t *plenp;
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t *rtalertp; /* XXX: should be stored more smart way */
|
1999-06-28 10:36:47 +04:00
|
|
|
struct mbuf **mp;
|
|
|
|
int *offp;
|
|
|
|
{
|
2001-02-10 07:14:26 +03:00
|
|
|
struct mbuf *m = *mp;
|
1999-06-28 10:36:47 +04:00
|
|
|
int off = *offp, hbhlen;
|
|
|
|
struct ip6_hbh *hbh;
|
|
|
|
|
|
|
|
/* validation of the length of the header */
|
1999-12-13 18:17:17 +03:00
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m,
|
|
|
|
sizeof(struct ip6_hdr), sizeof(struct ip6_hbh));
|
|
|
|
if (hbh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m, sizeof(struct ip6_hdr),
|
|
|
|
hbhlen);
|
|
|
|
if (hbh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return -1;
|
|
|
|
}
|
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(hbh));
|
1999-06-28 10:36:47 +04:00
|
|
|
off += hbhlen;
|
|
|
|
hbhlen -= sizeof(struct ip6_hbh);
|
|
|
|
|
|
|
|
if (ip6_process_hopopts(m, (u_int8_t *)hbh + sizeof(struct ip6_hbh),
|
|
|
|
hbhlen, rtalertp, plenp) < 0)
|
2002-09-11 06:41:19 +04:00
|
|
|
return (-1);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
*offp = off;
|
|
|
|
*mp = m;
|
2002-09-11 06:41:19 +04:00
|
|
|
return (0);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Search header for all Hop-by-hop options and process each option.
|
|
|
|
* This function is separate from ip6_hopopts_input() in order to
|
|
|
|
* handle a case where the sending node itself process its hop-by-hop
|
|
|
|
* options header. In such a case, the function is called from ip6_output().
|
2002-06-09 01:22:29 +04:00
|
|
|
*
|
|
|
|
* The function assumes that hbh header is located right after the IPv6 header
|
|
|
|
* (RFC2460 p7), opthead is pointer into data content in m, and opthead to
|
|
|
|
* opthead + hbhlen is located in continuous memory region.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_process_hopopts(m, opthead, hbhlen, rtalertp, plenp)
|
|
|
|
struct mbuf *m;
|
|
|
|
u_int8_t *opthead;
|
|
|
|
int hbhlen;
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t *rtalertp;
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int32_t *plenp;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
int optlen = 0;
|
|
|
|
u_int8_t *opt = opthead;
|
|
|
|
u_int16_t rtalert_val;
|
2000-06-13 18:43:44 +04:00
|
|
|
u_int32_t jumboplen;
|
2002-06-09 01:22:29 +04:00
|
|
|
const int erroff = sizeof(struct ip6_hdr) + sizeof(struct ip6_hbh);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
for (; hbhlen > 0; hbhlen -= optlen, opt += optlen) {
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (*opt) {
|
|
|
|
case IP6OPT_PAD1:
|
|
|
|
optlen = 1;
|
|
|
|
break;
|
|
|
|
case IP6OPT_PADN:
|
|
|
|
if (hbhlen < IP6OPT_MINLEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
optlen = *(opt + 1) + 2;
|
|
|
|
break;
|
|
|
|
case IP6OPT_RTALERT:
|
2000-06-13 18:43:44 +04:00
|
|
|
/* XXX may need check for alignment */
|
2001-02-10 07:14:26 +03:00
|
|
|
if (hbhlen < IP6OPT_RTALERT_LEN) {
|
2000-06-13 18:43:44 +04:00
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
2001-02-10 07:14:26 +03:00
|
|
|
if (*(opt + 1) != IP6OPT_RTALERT_LEN - 2) {
|
2002-06-09 01:22:29 +04:00
|
|
|
/* XXX stat */
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt + 1 - opthead);
|
|
|
|
return (-1);
|
2001-02-10 07:14:26 +03:00
|
|
|
}
|
|
|
|
optlen = IP6OPT_RTALERT_LEN;
|
|
|
|
bcopy((caddr_t)(opt + 2), (caddr_t)&rtalert_val, 2);
|
|
|
|
*rtalertp = ntohs(rtalert_val);
|
|
|
|
break;
|
|
|
|
case IP6OPT_JUMBO:
|
|
|
|
/* XXX may need check for alignment */
|
|
|
|
if (hbhlen < IP6OPT_JUMBO_LEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if (*(opt + 1) != IP6OPT_JUMBO_LEN - 2) {
|
2002-06-09 01:22:29 +04:00
|
|
|
/* XXX stat */
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt + 1 - opthead);
|
|
|
|
return (-1);
|
2001-02-10 07:14:26 +03:00
|
|
|
}
|
2000-06-13 18:43:44 +04:00
|
|
|
optlen = IP6OPT_JUMBO_LEN;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IPv6 packets that have non 0 payload length
|
2001-02-10 07:14:26 +03:00
|
|
|
* must not contain a jumbo payload option.
|
2000-06-13 18:43:44 +04:00
|
|
|
*/
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (ip6->ip6_plen) {
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
2002-06-09 01:22:29 +04:00
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt - opthead);
|
|
|
|
return (-1);
|
2000-06-13 18:43:44 +04:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-06-13 18:43:44 +04:00
|
|
|
/*
|
|
|
|
* We may see jumbolen in unaligned location, so
|
|
|
|
* we'd need to perform bcopy().
|
|
|
|
*/
|
|
|
|
bcopy(opt + 2, &jumboplen, sizeof(jumboplen));
|
|
|
|
jumboplen = (u_int32_t)htonl(jumboplen);
|
|
|
|
|
|
|
|
#if 1
|
|
|
|
/*
|
|
|
|
* if there are multiple jumbo payload options,
|
|
|
|
* *plenp will be non-zero and the packet will be
|
|
|
|
* rejected.
|
|
|
|
* the behavior may need some debate in ipngwg -
|
|
|
|
* multiple options does not make sense, however,
|
|
|
|
* there's no explicit mention in specification.
|
|
|
|
*/
|
|
|
|
if (*plenp != 0) {
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
2002-06-09 01:22:29 +04:00
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt + 2 - opthead);
|
|
|
|
return (-1);
|
2000-06-13 18:43:44 +04:00
|
|
|
}
|
1999-10-01 14:15:16 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-06-13 18:43:44 +04:00
|
|
|
/*
|
|
|
|
* jumbo payload length must be larger than 65535.
|
|
|
|
*/
|
|
|
|
if (jumboplen <= IPV6_MAXPACKET) {
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
2002-06-09 01:22:29 +04:00
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt + 2 - opthead);
|
|
|
|
return (-1);
|
2000-06-13 18:43:44 +04:00
|
|
|
}
|
|
|
|
*plenp = jumboplen;
|
|
|
|
|
|
|
|
break;
|
2001-02-10 07:14:26 +03:00
|
|
|
default: /* unknown option */
|
|
|
|
if (hbhlen < IP6OPT_MINLEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
2002-06-09 01:22:29 +04:00
|
|
|
optlen = ip6_unknown_opt(opt, m,
|
|
|
|
erroff + opt - opthead);
|
|
|
|
if (optlen == -1)
|
|
|
|
return (-1);
|
2001-02-10 07:14:26 +03:00
|
|
|
optlen += 2;
|
|
|
|
break;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-06-09 01:22:29 +04:00
|
|
|
return (0);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
bad:
|
|
|
|
m_freem(m);
|
2002-06-09 01:22:29 +04:00
|
|
|
return (-1);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unknown option processing.
|
|
|
|
* The third argument `off' is the offset from the IPv6 header to the option,
|
|
|
|
* which is necessary if the IPv6 header the and option header and IPv6 header
|
|
|
|
* is not continuous in order to return an ICMPv6 error.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_unknown_opt(optp, m, off)
|
|
|
|
u_int8_t *optp;
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (IP6OPT_TYPE(*optp)) {
|
|
|
|
case IP6OPT_TYPE_SKIP: /* ignore the option */
|
2002-09-11 06:41:19 +04:00
|
|
|
return ((int)*(optp + 1));
|
2001-02-10 07:14:26 +03:00
|
|
|
case IP6OPT_TYPE_DISCARD: /* silently discard */
|
|
|
|
m_freem(m);
|
2002-09-11 06:41:19 +04:00
|
|
|
return (-1);
|
2001-02-10 07:14:26 +03:00
|
|
|
case IP6OPT_TYPE_FORCEICMP: /* send ICMP even if multicasted */
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB, ICMP6_PARAMPROB_OPTION, off);
|
2002-09-11 06:41:19 +04:00
|
|
|
return (-1);
|
2001-02-10 07:14:26 +03:00
|
|
|
case IP6OPT_TYPE_ICMP: /* send ICMP if not multicasted */
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst) ||
|
|
|
|
(m->m_flags & (M_BCAST|M_MCAST)))
|
|
|
|
m_freem(m);
|
|
|
|
else
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_OPTION, off);
|
2002-09-11 06:41:19 +04:00
|
|
|
return (-1);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
m_freem(m); /* XXX: NOTREACHED */
|
2002-09-11 06:41:19 +04:00
|
|
|
return (-1);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
1999-12-13 18:17:17 +03:00
|
|
|
* Create the "control" list for this pcb.
|
|
|
|
*
|
|
|
|
* The routine will be called from upper layer handlers like tcp6_input().
|
|
|
|
* Thus the routine assumes that the caller (tcp6_input) have already
|
|
|
|
* called IP6_EXTHDR_CHECK() and all the extension headers are located in the
|
|
|
|
* very first mbuf on the mbuf chain.
|
|
|
|
* We may want to add some infinite loop prevention or sanity checks for safety.
|
|
|
|
* (This applies only when you are using KAME mbuf chain restriction, i.e.
|
|
|
|
* you are using IP6_EXTHDR_CHECK() not m_pulldown())
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
void
|
|
|
|
ip6_savecontrol(in6p, mp, ip6, m)
|
2001-02-10 07:14:26 +03:00
|
|
|
struct in6pcb *in6p;
|
|
|
|
struct mbuf **mp;
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
struct mbuf *m;
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#ifdef SO_TIMESTAMP
|
1999-06-28 10:36:47 +04:00
|
|
|
if (in6p->in6p_socket->so_options & SO_TIMESTAMP) {
|
|
|
|
struct timeval tv;
|
|
|
|
|
|
|
|
microtime(&tv);
|
|
|
|
*mp = sbcreatecontrol((caddr_t) &tv, sizeof(tv),
|
2003-05-14 18:41:33 +04:00
|
|
|
SCM_TIMESTAMP, SOL_SOCKET);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
1999-12-13 18:17:17 +03:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
if (in6p->in6p_flags & IN6P_RECVDSTADDR) {
|
|
|
|
*mp = sbcreatecontrol((caddr_t) &ip6->ip6_dst,
|
2003-05-14 18:41:33 +04:00
|
|
|
sizeof(struct in6_addr), IPV6_RECVDSTADDR, IPPROTO_IPV6);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef noyet
|
|
|
|
/* options were tossed above */
|
|
|
|
if (in6p->in6p_flags & IN6P_RECVOPTS)
|
|
|
|
/* broken */
|
|
|
|
/* ip6_srcroute doesn't do what we want here, need to fix */
|
|
|
|
if (in6p->in6p_flags & IPV6P_RECVRETOPTS)
|
|
|
|
/* broken */
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* RFC 2292 sec. 5 */
|
2001-02-10 07:14:26 +03:00
|
|
|
if ((in6p->in6p_flags & IN6P_PKTINFO) != 0) {
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_pktinfo pi6;
|
|
|
|
bcopy(&ip6->ip6_dst, &pi6.ipi6_addr, sizeof(struct in6_addr));
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&pi6.ipi6_addr))
|
|
|
|
pi6.ipi6_addr.s6_addr16[1] = 0;
|
|
|
|
pi6.ipi6_ifindex = (m && m->m_pkthdr.rcvif)
|
|
|
|
? m->m_pkthdr.rcvif->if_index
|
|
|
|
: 0;
|
|
|
|
*mp = sbcreatecontrol((caddr_t) &pi6,
|
2003-05-14 18:41:33 +04:00
|
|
|
sizeof(struct in6_pktinfo), IPV6_PKTINFO, IPPROTO_IPV6);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
|
|
|
if (in6p->in6p_flags & IN6P_HOPLIMIT) {
|
|
|
|
int hlim = ip6->ip6_hlim & 0xff;
|
2003-05-14 18:41:33 +04:00
|
|
|
*mp = sbcreatecontrol((caddr_t) &hlim, sizeof(int),
|
|
|
|
IPV6_HOPLIMIT, IPPROTO_IPV6);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
|
|
|
/* IN6P_NEXTHOP - for outgoing packet only */
|
|
|
|
|
|
|
|
/*
|
2004-06-01 07:13:22 +04:00
|
|
|
* IPV6_HOPOPTS socket option. Recall that we required super-user
|
|
|
|
* privilege for the option (see ip6_ctloutput), but it might be too
|
|
|
|
* strict, since there might be some hop-by-hop options which can be
|
|
|
|
* returned to normal user.
|
|
|
|
* See also RFC 2292 section 6.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2004-06-01 07:13:22 +04:00
|
|
|
if ((in6p->in6p_flags & IN6P_HOPOPTS) != 0) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Check if a hop-by-hop options header is contatined in the
|
|
|
|
* received packet, and if so, store the options as ancillary
|
|
|
|
* data. Note that a hop-by-hop options header must be
|
|
|
|
* just after the IPv6 header, which fact is assured through
|
|
|
|
* the IPv6 input processing.
|
|
|
|
*/
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (ip6->ip6_nxt == IPPROTO_HOPOPTS) {
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ip6_hbh *hbh;
|
|
|
|
int hbhlen;
|
2003-05-14 18:34:14 +04:00
|
|
|
struct mbuf *ext;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2003-05-14 18:34:14 +04:00
|
|
|
ext = ip6_pullexthdr(m, sizeof(struct ip6_hdr),
|
|
|
|
ip6->ip6_nxt);
|
|
|
|
if (ext == NULL) {
|
1999-12-13 18:17:17 +03:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
2003-05-14 18:34:14 +04:00
|
|
|
hbh = mtod(ext, struct ip6_hbh *);
|
1999-12-13 18:17:17 +03:00
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
2003-05-14 18:34:14 +04:00
|
|
|
if (hbhlen != ext->m_len) {
|
|
|
|
m_freem(ext);
|
1999-12-13 18:17:17 +03:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX: We copy whole the header even if a jumbo
|
|
|
|
* payload option is included, which option is to
|
|
|
|
* be removed before returning in the RFC 2292.
|
|
|
|
* But it's too painful operation...
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
*mp = sbcreatecontrol((caddr_t)hbh, hbhlen,
|
2003-05-14 18:41:33 +04:00
|
|
|
IPV6_HOPOPTS, IPPROTO_IPV6);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
2003-05-14 18:34:14 +04:00
|
|
|
m_freem(ext);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* IPV6_DSTOPTS and IPV6_RTHDR socket options */
|
|
|
|
if (in6p->in6p_flags & (IN6P_DSTOPTS | IN6P_RTHDR)) {
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
2003-01-20 08:29:53 +03:00
|
|
|
int nxt = ip6->ip6_nxt, off = sizeof(struct ip6_hdr);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Search for destination options headers or routing
|
|
|
|
* header(s) through the header chain, and stores each
|
|
|
|
* header as ancillary data.
|
|
|
|
* Note that the order of the headers remains in
|
|
|
|
* the chain of ancillary data.
|
|
|
|
*/
|
2001-02-10 07:14:26 +03:00
|
|
|
while (1) { /* is explicit loop prevention necessary? */
|
2003-05-14 18:34:14 +04:00
|
|
|
struct ip6_ext *ip6e = NULL;
|
1999-12-13 18:17:17 +03:00
|
|
|
int elen;
|
2003-05-14 18:34:14 +04:00
|
|
|
struct mbuf *ext = NULL;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2003-05-14 18:34:14 +04:00
|
|
|
/*
|
|
|
|
* if it is not an extension header, don't try to
|
|
|
|
* pull it from the chain.
|
|
|
|
*/
|
|
|
|
switch (nxt) {
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_AH: /* is it possible? */
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
goto loopend;
|
|
|
|
}
|
|
|
|
|
|
|
|
ext = ip6_pullexthdr(m, off, nxt);
|
|
|
|
if (ext == NULL) {
|
1999-12-13 18:17:17 +03:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
2003-05-14 18:34:14 +04:00
|
|
|
ip6e = mtod(ext, struct ip6_ext *);
|
1999-12-13 18:17:17 +03:00
|
|
|
if (nxt == IPPROTO_AH)
|
|
|
|
elen = (ip6e->ip6e_len + 2) << 2;
|
|
|
|
else
|
|
|
|
elen = (ip6e->ip6e_len + 1) << 3;
|
2003-05-14 18:34:14 +04:00
|
|
|
if (elen != ext->m_len) {
|
|
|
|
m_freem(ext);
|
1999-12-13 18:17:17 +03:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
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(ip6e));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (nxt) {
|
2003-05-14 18:34:14 +04:00
|
|
|
case IPPROTO_DSTOPTS:
|
2001-02-10 07:14:26 +03:00
|
|
|
if (!in6p->in6p_flags & IN6P_DSTOPTS)
|
|
|
|
break;
|
|
|
|
|
|
|
|
*mp = sbcreatecontrol((caddr_t)ip6e, elen,
|
2003-05-14 18:41:33 +04:00
|
|
|
IPV6_DSTOPTS, IPPROTO_IPV6);
|
2001-02-10 07:14:26 +03:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
if (!in6p->in6p_flags & IN6P_RTHDR)
|
|
|
|
break;
|
|
|
|
|
|
|
|
*mp = sbcreatecontrol((caddr_t)ip6e, elen,
|
2003-05-14 18:41:33 +04:00
|
|
|
IPV6_RTHDR, IPPROTO_IPV6);
|
2001-02-10 07:14:26 +03:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
break;
|
|
|
|
|
2003-05-14 18:34:14 +04:00
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_AH: /* is it possible? */
|
|
|
|
break;
|
|
|
|
|
2001-02-10 07:14:26 +03:00
|
|
|
default:
|
|
|
|
/*
|
2003-05-14 18:34:14 +04:00
|
|
|
* other cases have been filtered in the above.
|
|
|
|
* none will visit this case. here we supply
|
|
|
|
* the code just in case (nxt overwritten or
|
|
|
|
* other cases).
|
2001-02-10 07:14:26 +03:00
|
|
|
*/
|
2003-05-14 18:34:14 +04:00
|
|
|
m_freem(ext);
|
2001-02-10 07:14:26 +03:00
|
|
|
goto loopend;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/* proceed with the next header. */
|
1999-12-13 18:17:17 +03:00
|
|
|
off += elen;
|
1999-06-28 10:36:47 +04:00
|
|
|
nxt = ip6e->ip6e_nxt;
|
2003-05-14 18:34:14 +04:00
|
|
|
ip6e = NULL;
|
|
|
|
m_freem(ext);
|
|
|
|
ext = NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
loopend:
|
2003-05-14 18:34:14 +04:00
|
|
|
;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* pull single extension header from mbuf chain. returns single mbuf that
|
|
|
|
* contains the result, or NULL on error.
|
|
|
|
*/
|
|
|
|
static struct mbuf *
|
|
|
|
ip6_pullexthdr(m, off, nxt)
|
|
|
|
struct mbuf *m;
|
|
|
|
size_t off;
|
|
|
|
int nxt;
|
|
|
|
{
|
|
|
|
struct ip6_ext ip6e;
|
|
|
|
size_t elen;
|
|
|
|
struct mbuf *n;
|
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
switch (nxt) {
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_AH: /* is it possible? */
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("ip6_pullexthdr: invalid nxt=%d\n", nxt);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2003-05-14 18:34:14 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
m_copydata(m, off, sizeof(ip6e), (caddr_t)&ip6e);
|
|
|
|
if (nxt == IPPROTO_AH)
|
|
|
|
elen = (ip6e.ip6e_len + 2) << 2;
|
|
|
|
else
|
|
|
|
elen = (ip6e.ip6e_len + 1) << 3;
|
|
|
|
|
|
|
|
MGET(n, M_DONTWAIT, MT_DATA);
|
|
|
|
if (n && elen >= MLEN) {
|
|
|
|
MCLGET(n, M_DONTWAIT);
|
|
|
|
if ((n->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(n);
|
|
|
|
n = NULL;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2003-05-14 18:34:14 +04:00
|
|
|
if (!n)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
n->m_len = 0;
|
|
|
|
if (elen >= M_TRAILINGSPACE(n)) {
|
|
|
|
m_free(n);
|
|
|
|
return NULL;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2003-05-14 18:34:14 +04:00
|
|
|
m_copydata(m, off, elen, mtod(n, caddr_t));
|
|
|
|
n->m_len = elen;
|
|
|
|
return n;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get pointer to the previous header followed by the header
|
|
|
|
* currently processed.
|
|
|
|
* XXX: This function supposes that
|
|
|
|
* M includes all headers,
|
|
|
|
* the next header field and the header length field of each header
|
|
|
|
* are valid, and
|
|
|
|
* the sum of each header length equals to OFF.
|
|
|
|
* Because of these assumptions, this function must be called very
|
|
|
|
* carefully. Moreover, it will not be used in the near future when
|
|
|
|
* we develop `neater' mechanism to process extension headers.
|
|
|
|
*/
|
2002-09-11 06:41:19 +04:00
|
|
|
u_int8_t *
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6_get_prevhdr(m, off)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
if (off == sizeof(struct ip6_hdr))
|
2002-09-11 06:41:19 +04:00
|
|
|
return (&ip6->ip6_nxt);
|
1999-06-28 10:36:47 +04:00
|
|
|
else {
|
|
|
|
int len, nxt;
|
|
|
|
struct ip6_ext *ip6e = NULL;
|
|
|
|
|
|
|
|
nxt = ip6->ip6_nxt;
|
|
|
|
len = sizeof(struct ip6_hdr);
|
|
|
|
while (len < off) {
|
|
|
|
ip6e = (struct ip6_ext *)(mtod(m, caddr_t) + len);
|
|
|
|
|
2001-02-10 07:14:26 +03:00
|
|
|
switch (nxt) {
|
1999-06-28 10:36:47 +04:00
|
|
|
case IPPROTO_FRAGMENT:
|
|
|
|
len += sizeof(struct ip6_frag);
|
|
|
|
break;
|
|
|
|
case IPPROTO_AH:
|
|
|
|
len += (ip6e->ip6e_len + 2) << 2;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
len += (ip6e->ip6e_len + 1) << 3;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
nxt = ip6e->ip6e_nxt;
|
|
|
|
}
|
|
|
|
if (ip6e)
|
2002-09-11 06:41:19 +04:00
|
|
|
return (&ip6e->ip6e_nxt);
|
1999-06-28 10:36:47 +04:00
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-03-22 02:53:30 +03:00
|
|
|
/*
|
|
|
|
* get next header offset. m will be retained.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_nexthdr(m, off, proto, nxtp)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
int proto;
|
|
|
|
int *nxtp;
|
|
|
|
{
|
|
|
|
struct ip6_hdr ip6;
|
|
|
|
struct ip6_ext ip6e;
|
|
|
|
struct ip6_frag fh;
|
|
|
|
|
|
|
|
/* just in case */
|
|
|
|
if (m == NULL)
|
|
|
|
panic("ip6_nexthdr: m == NULL");
|
|
|
|
if ((m->m_flags & M_PKTHDR) == 0 || m->m_pkthdr.len < off)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
switch (proto) {
|
|
|
|
case IPPROTO_IPV6:
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(ip6), (caddr_t)&ip6);
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = ip6.ip6_nxt;
|
|
|
|
off += sizeof(ip6);
|
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_FRAGMENT:
|
|
|
|
/*
|
|
|
|
* terminate parsing if it is not the first fragment,
|
|
|
|
* it does not make sense to parse through it.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(fh))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(fh), (caddr_t)&fh);
|
2003-10-14 09:33:04 +04:00
|
|
|
if ((fh.ip6f_offlg & IP6F_OFF_MASK) != 0)
|
2000-03-22 02:53:30 +03:00
|
|
|
return -1;
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = fh.ip6f_nxt;
|
|
|
|
off += sizeof(struct ip6_frag);
|
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_AH:
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6e))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(ip6e), (caddr_t)&ip6e);
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = ip6e.ip6e_nxt;
|
|
|
|
off += (ip6e.ip6e_len + 2) << 2;
|
2001-11-02 11:05:48 +03:00
|
|
|
if (m->m_pkthdr.len < off)
|
|
|
|
return -1;
|
2000-03-22 02:53:30 +03:00
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6e))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(ip6e), (caddr_t)&ip6e);
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = ip6e.ip6e_nxt;
|
|
|
|
off += (ip6e.ip6e_len + 1) << 3;
|
2001-11-02 11:05:48 +03:00
|
|
|
if (m->m_pkthdr.len < off)
|
|
|
|
return -1;
|
2000-03-22 02:53:30 +03:00
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_NONE:
|
|
|
|
case IPPROTO_ESP:
|
|
|
|
case IPPROTO_IPCOMP:
|
|
|
|
/* give up */
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get offset for the last header in the chain. m will be kept untainted.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_lasthdr(m, off, proto, nxtp)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
int proto;
|
|
|
|
int *nxtp;
|
|
|
|
{
|
|
|
|
int newoff;
|
|
|
|
int nxt;
|
|
|
|
|
|
|
|
if (!nxtp) {
|
|
|
|
nxt = -1;
|
|
|
|
nxtp = &nxt;
|
|
|
|
}
|
|
|
|
while (1) {
|
|
|
|
newoff = ip6_nexthdr(m, off, proto, nxtp);
|
|
|
|
if (newoff < 0)
|
|
|
|
return off;
|
|
|
|
else if (newoff < off)
|
|
|
|
return -1; /* invalid */
|
|
|
|
else if (newoff == off)
|
|
|
|
return newoff;
|
|
|
|
|
|
|
|
off = newoff;
|
|
|
|
proto = *nxtp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* System control for IP6
|
|
|
|
*/
|
|
|
|
|
|
|
|
u_char inet6ctlerrmap[PRC_NCMDS] = {
|
|
|
|
0, 0, 0, 0,
|
|
|
|
0, EMSGSIZE, EHOSTDOWN, EHOSTUNREACH,
|
|
|
|
EHOSTUNREACH, EHOSTUNREACH, ECONNREFUSED, ECONNREFUSED,
|
|
|
|
EMSGSIZE, EHOSTUNREACH, 0, 0,
|
|
|
|
0, 0, 0, 0,
|
|
|
|
ENOPROTOOPT
|
|
|
|
};
|
|
|
|
|
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_ip6_setup, "sysctl net.inet6.ip6 subtree setup")
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
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
|
|
|
|
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,
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_NODE, "inet6",
|
|
|
|
SYSCTL_DESCR("PF_INET6 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, 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, "ip6",
|
|
|
|
SYSCTL_DESCR("IPv6 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_IPV6, 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, "forwarding",
|
|
|
|
SYSCTL_DESCR("Enable forwarding of INET6 datagrams"),
|
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, &ip6_forwarding, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_FORWARDING, 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, "redirect",
|
|
|
|
SYSCTL_DESCR("Enable sending of ICMPv6 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, &ip6_sendredirects, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_SENDREDIRECTS, 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, "hlim",
|
|
|
|
SYSCTL_DESCR("Hop limit for an INET6 datagram"),
|
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, &ip6_defhlim, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_DEFHLIM, CTL_EOL);
|
|
|
|
#ifdef notyet
|
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, "mtu", NULL,
|
|
|
|
NULL, 0, &, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_DEFMTU, CTL_EOL);
|
2001-12-22 04:40:03 +03:00
|
|
|
#endif
|
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
|
|
|
#ifdef __no_idea__
|
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, "forwsrcrt", NULL,
|
|
|
|
NULL, 0, &?, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_FORWSRCRT, CTL_EOL);
|
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_STRUCT, "stats", NULL,
|
|
|
|
NULL, 0, &?, sizeof(?),
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_STATS, CTL_EOL);
|
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_STRUCT, "mrtstats", NULL,
|
|
|
|
NULL, 0, &?, sizeof(?),
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_MRTSTATS, CTL_EOL);
|
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_?, "mrtproto", NULL,
|
|
|
|
NULL, 0, &?, sizeof(?),
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_MRTPROTO, CTL_EOL);
|
2000-08-26 15:03:45 +04:00
|
|
|
#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, "maxfragpackets",
|
|
|
|
SYSCTL_DESCR("Maximum number of fragments to buffer "
|
|
|
|
"for reassembly"),
|
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, &ip6_maxfragpackets, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_MAXFRAGPACKETS, CTL_EOL);
|
|
|
|
#ifdef __no_idea__
|
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, "sourcecheck", NULL,
|
|
|
|
NULL, 0, &?, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_SOURCECHECK, CTL_EOL);
|
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, "sourcecheck_logint", NULL,
|
|
|
|
NULL, 0, &?, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_SOURCECHECK_LOGINT, CTL_EOL);
|
2000-08-26 15:03:45 +04:00
|
|
|
#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, "accept_rtadv",
|
|
|
|
SYSCTL_DESCR("Accept router advertisements"),
|
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, &ip6_accept_rtadv, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_ACCEPT_RTADV, 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, "keepfaith",
|
|
|
|
SYSCTL_DESCR("Activate faith interface"),
|
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, &ip6_keepfaith, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_KEEPFAITH, 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, "log_interval",
|
|
|
|
SYSCTL_DESCR("Minumum interval between logging "
|
|
|
|
"unroutable packets"),
|
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, &ip6_log_interval, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_LOG_INTERVAL, 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, "hdrnestlimit",
|
|
|
|
SYSCTL_DESCR("Maximum number of nested IPv6 headers"),
|
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, &ip6_hdrnestlimit, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_HDRNESTLIMIT, 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, "dad_count",
|
|
|
|
SYSCTL_DESCR("Number of Duplicate Address Detection "
|
|
|
|
"probes to send"),
|
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, &ip6_dad_count, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_DAD_COUNT, 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, "auto_flowlabel",
|
|
|
|
SYSCTL_DESCR("Assign random IPv6 flow labels"),
|
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, &ip6_auto_flowlabel, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_AUTO_FLOWLABEL, 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, "defmcasthlim",
|
|
|
|
SYSCTL_DESCR("Default multicast hop limit"),
|
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, &ip6_defmcasthlim, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_DEFMCASTHLIM, CTL_EOL);
|
|
|
|
#if NGIF > 0
|
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, "gifhlim",
|
|
|
|
SYSCTL_DESCR("Default hop limit for a gif tunnel datagram"),
|
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, &ip6_gif_hlim, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_GIF_HLIM, CTL_EOL);
|
|
|
|
#endif /* NGIF */
|
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_STRING, "kame_version",
|
|
|
|
SYSCTL_DESCR("KAME Version"),
|
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, __KAME_VERSION, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_KAME_VERSION, 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, "use_deprecated",
|
|
|
|
SYSCTL_DESCR("Allow use of deprecated addresses as "
|
|
|
|
"source addresses"),
|
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, &ip6_use_deprecated, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_USE_DEPRECATED, CTL_EOL);
|
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, "rr_prune", NULL,
|
|
|
|
NULL, 0, &ip6_rr_prune, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_RR_PRUNE, 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
|
|
|
#ifndef INET6_BINDV6ONLY
|
2004-03-24 18:34:46 +03:00
|
|
|
|CTLFLAG_READWRITE,
|
2000-08-26 15:03:45 +04:00
|
|
|
#endif
|
2004-05-25 08:33:59 +04:00
|
|
|
CTLTYPE_INT, "v6only",
|
|
|
|
SYSCTL_DESCR("Disallow PF_INET6 sockets from connecting "
|
|
|
|
"to PF_INET sockets"),
|
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, &ip6_v6only, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_V6ONLY, 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, "anonportmin",
|
|
|
|
SYSCTL_DESCR("Lowest ephemeral port number to assign"),
|
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_inet_ip_ports, 0, &ip6_anonportmin, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_ANONPORTMIN, 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, "anonportmax",
|
|
|
|
SYSCTL_DESCR("Highest ephemeral port number to assign"),
|
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_inet_ip_ports, 0, &ip6_anonportmax, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_ANONPORTMAX, CTL_EOL);
|
2000-08-26 15:03:45 +04:00
|
|
|
#ifndef IPNOPRIVPORTS
|
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, "lowportmin",
|
|
|
|
SYSCTL_DESCR("Lowest privileged ephemeral port number "
|
|
|
|
"to assign"),
|
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_inet_ip_ports, 0, &ip6_lowportmin, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_LOWPORTMIN, 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, "lowportmax",
|
|
|
|
SYSCTL_DESCR("Highest privileged ephemeral port number "
|
|
|
|
"to assign"),
|
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_inet_ip_ports, 0, &ip6_lowportmax, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_LOWPORTMAX, CTL_EOL);
|
|
|
|
#endif /* IPNOPRIVPORTS */
|
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, "maxfrags",
|
|
|
|
SYSCTL_DESCR("Maximum fragments in reassembly queue"),
|
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, &ip6_maxfrags, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_MAXFRAGS, CTL_EOL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|