2008-05-04 11:22:14 +04:00
|
|
|
/* $NetBSD: ip6_input.c,v 1.119 2008/05/04 07:22:15 thorpej 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>
|
2008-05-04 11:22:14 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: ip6_input.c,v 1.119 2008/05/04 07:22:15 thorpej Exp $");
|
2001-11-13 03:56:55 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#include "opt_inet.h"
|
2006-05-05 04:03:21 +04:00
|
|
|
#include "opt_inet6.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>
|
2008-04-15 07:57:04 +04:00
|
|
|
#include <netinet6/ip6_private.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>
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
#include <netinet6/scope6_var.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/in6_ifattach.h>
|
|
|
|
#include <netinet6/nd6.h>
|
|
|
|
|
2001-03-01 19:31:37 +03:00
|
|
|
#ifdef IPSEC
|
|
|
|
#include <netinet6/ipsec.h>
|
2008-04-23 10:09:04 +04:00
|
|
|
#include <netinet6/ipsec_private.h>
|
2001-03-01 19:31:37 +03:00
|
|
|
#endif
|
|
|
|
|
2007-02-10 12:43:05 +03:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
#include <netipsec/ipsec.h>
|
|
|
|
#include <netipsec/ipsec6.h>
|
|
|
|
#include <netipsec/key.h>
|
|
|
|
#endif /* FAST_IPSEC */
|
|
|
|
|
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;
|
|
|
|
|
2007-07-10 00:51:58 +04:00
|
|
|
extern callout_t in6_tmpaddrtimer_ch;
|
2006-03-06 02:47:08 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
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
|
|
|
|
|
2008-04-15 07:57:04 +04:00
|
|
|
percpu_t *ip6stat_percpu;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-10-24 10:37:20 +04:00
|
|
|
static void ip6_init2(void *);
|
2007-10-29 19:54:42 +03:00
|
|
|
static struct m_tag *ip6_setdstifaddr(struct mbuf *, const struct in6_ifaddr *);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-10-24 10:37:20 +04:00
|
|
|
static int ip6_hopopts_input(u_int32_t *, u_int32_t *, struct mbuf **, int *);
|
|
|
|
static struct mbuf *ip6_pullexthdr(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
|
2008-02-27 22:40:56 +03:00
|
|
|
ip6_init(void)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2005-05-30 01:43:51 +04:00
|
|
|
const struct ip6protosw *pr;
|
2001-02-10 07:14:26 +03:00
|
|
|
int i;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2005-05-30 01:43:51 +04:00
|
|
|
pr = (const struct ip6protosw *)pffindproto(PF_INET6, IPPROTO_RAW, SOCK_RAW);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (pr == 0)
|
|
|
|
panic("ip6_init");
|
|
|
|
for (i = 0; i < IPPROTO_MAX; i++)
|
|
|
|
ip6_protox[i] = pr - inet6sw;
|
2005-05-30 01:43:51 +04:00
|
|
|
for (pr = (const struct ip6protosw *)inet6domain.dom_protosw;
|
|
|
|
pr < (const struct ip6protosw *)inet6domain.dom_protoswNPROTOSW; pr++)
|
1999-06-28 10:36:47 +04:00
|
|
|
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;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
scope6_init();
|
|
|
|
addrsel_policy_init();
|
1999-06-28 10:36:47 +04:00
|
|
|
nd6_init();
|
|
|
|
frag6_init();
|
2006-03-06 02:47:08 +03:00
|
|
|
ip6_desync_factor = arc4random() % MAX_TEMP_DESYNC_FACTOR;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
ip6_init2((void *)0);
|
2007-03-08 01:20:04 +03:00
|
|
|
#ifdef GATEWAY
|
2007-03-23 17:24:22 +03:00
|
|
|
ip6flow_init(ip6_hashsize);
|
2007-03-08 01:20:04 +03:00
|
|
|
#endif
|
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 */
|
2008-04-15 07:57:04 +04:00
|
|
|
|
|
|
|
ip6stat_percpu = percpu_alloc(sizeof(uint64_t) * IP6_NSTATS);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2006-11-16 04:32:37 +03:00
|
|
|
ip6_init2(void *dummy)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
|
|
|
|
/* nd6_timer_init */
|
2008-04-24 15:38:36 +04:00
|
|
|
callout_init(&nd6_timer_ch, CALLOUT_MPSAFE);
|
2000-03-23 10:01:25 +03:00
|
|
|
callout_reset(&nd6_timer_ch, hz, nd6_timer, NULL);
|
2006-03-06 02:47:08 +03:00
|
|
|
|
|
|
|
/* timer for regeneranation of temporary addresses randomize ID */
|
2008-04-24 15:38:36 +04:00
|
|
|
callout_init(&in6_tmpaddrtimer_ch, CALLOUT_MPSAFE);
|
2006-03-06 02:47:08 +03:00
|
|
|
callout_reset(&in6_tmpaddrtimer_ch,
|
|
|
|
(ip6_temp_preferred_lifetime - ip6_desync_factor -
|
|
|
|
ip6_temp_regen_advance) * hz,
|
|
|
|
in6_tmpaddrtimer, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IP6 input interrupt handling. Just pass the packet to ip6_input.
|
|
|
|
*/
|
|
|
|
void
|
2008-02-27 22:40:56 +03:00
|
|
|
ip6intr(void)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
int s;
|
|
|
|
struct mbuf *m;
|
|
|
|
|
2008-04-24 15:38:36 +04:00
|
|
|
mutex_enter(softnet_lock);
|
|
|
|
KERNEL_LOCK(1, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
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)
|
2008-04-24 15:38:36 +04:00
|
|
|
break;
|
2006-03-06 02:47:08 +03:00
|
|
|
/* drop the packet if IPv6 operation is disabled on the IF */
|
|
|
|
if ((ND_IFINFO(m->m_pkthdr.rcvif)->flags & ND6_IFF_IFDISABLED)) {
|
|
|
|
m_freem(m);
|
2008-04-24 15:38:36 +04:00
|
|
|
break;
|
2006-03-06 02:47:08 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6_input(m);
|
|
|
|
}
|
2008-04-24 15:38:36 +04:00
|
|
|
KERNEL_UNLOCK_ONE(NULL);
|
|
|
|
mutex_exit(softnet_lock);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
extern struct route ip6_forward_rt;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
void
|
2007-02-22 11:39:27 +03:00
|
|
|
ip6_input(struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ip6_hdr *ip6;
|
2007-05-06 06:29:33 +04:00
|
|
|
int hit, off = sizeof(struct ip6_hdr), nest;
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int32_t plen;
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t rtalert = ~0;
|
2007-05-06 01:23:50 +04:00
|
|
|
int nxt, ours = 0, rh_present = 0;
|
1999-12-13 18:17:17 +03:00
|
|
|
struct ifnet *deliverifp = NULL;
|
2003-06-30 12:00:59 +04:00
|
|
|
int srcrt = 0;
|
2007-05-06 06:29:33 +04:00
|
|
|
const struct rtentry *rt;
|
|
|
|
union {
|
|
|
|
struct sockaddr dst;
|
|
|
|
struct sockaddr_in6 dst6;
|
|
|
|
} u;
|
2007-02-10 12:43:05 +03:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
struct m_tag *mtag;
|
|
|
|
struct tdb_ident *tdbi;
|
|
|
|
struct secpolicy *sp;
|
|
|
|
int s, error;
|
|
|
|
#endif
|
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
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
/*
|
|
|
|
* make sure we don't have onion peering information into m_tag.
|
|
|
|
*/
|
|
|
|
ip6_delaux(m);
|
|
|
|
|
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)
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_MEXT2M);
|
1999-06-28 10:36:47 +04:00
|
|
|
else
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_MEXT1);
|
1999-06-28 10:36:47 +04:00
|
|
|
} else {
|
2008-04-09 03:37:43 +04:00
|
|
|
#define M2MMAX 32
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
/*XXX*/ IP6_STATINC(IP6_STAT_M2M + lo0ifp->if_index);
|
2008-04-09 03:37:43 +04:00
|
|
|
} else if (m->m_pkthdr.rcvif->if_index < M2MMAX) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_M2M +
|
|
|
|
m->m_pkthdr.rcvif->if_index);
|
2008-04-09 03:37:43 +04:00
|
|
|
} else
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_M2M);
|
1999-06-28 10:36:47 +04:00
|
|
|
} else
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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);
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOTAL);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
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
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
* it. Otherwise, if it is aligned, make sure the entire base
|
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
|
|
|
* IPv6 header is in the first mbuf of the chain.
|
|
|
|
*/
|
2007-03-04 08:59:00 +03:00
|
|
|
if (IP6_HDR_ALIGNED_P(mtod(m, void *)) == 0) {
|
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
|
|
|
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 */
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSMALL);
|
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
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSMALL);
|
1999-12-13 18:17:17 +03:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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;
|
|
|
|
}
|
|
|
|
|
2007-03-08 01:20:04 +03:00
|
|
|
#if defined(IPSEC)
|
|
|
|
/* IPv6 fast forwarding is not compatible with IPsec. */
|
|
|
|
m->m_flags &= ~M_CANFASTFWD;
|
|
|
|
#else
|
|
|
|
/*
|
|
|
|
* Assume that we can create a fast-forward IP flow entry
|
|
|
|
* based on this packet.
|
|
|
|
*/
|
|
|
|
m->m_flags |= M_CANFASTFWD;
|
|
|
|
#endif
|
|
|
|
|
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))
|
2007-02-10 12:43:05 +03:00
|
|
|
#elif defined(FAST_IPSEC)
|
|
|
|
if (!ipsec_indone(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 */
|
|
|
|
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_NXTHIST + ip6->ip6_nxt);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
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.
|
|
|
|
*/
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADSCOPE);
|
2000-01-31 13:33:22 +03:00
|
|
|
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)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADSCOPE);
|
2000-01-31 13:33:22 +03:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
2001-02-10 07:14:26 +03:00
|
|
|
|
2006-01-24 02:01:40 +03:00
|
|
|
/*
|
|
|
|
* Disambiguate address scope zones (if there is ambiguity).
|
|
|
|
* We first make sure that the original source or destination address
|
|
|
|
* is not in our internal form for scoped addresses. Such addresses
|
|
|
|
* are not necessarily invalid spec-wise, but we cannot accept them due
|
|
|
|
* to the usage conflict.
|
|
|
|
* in6_setscope() then also checks and rejects the cases where src or
|
|
|
|
* dst are the loopback address and the receiving interface
|
|
|
|
* is not loopback.
|
|
|
|
*/
|
2006-05-26 01:32:47 +04:00
|
|
|
if (__predict_false(
|
|
|
|
m_makewritable(&m, 0, sizeof(struct ip6_hdr), M_DONTWAIT)))
|
|
|
|
goto bad;
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
2006-01-24 02:01:40 +03:00
|
|
|
if (in6_clearscope(&ip6->ip6_src) || in6_clearscope(&ip6->ip6_dst)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADSCOPE); /* XXX */
|
2006-01-24 02:01:40 +03:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if (in6_setscope(&ip6->ip6_src, m->m_pkthdr.rcvif, NULL) ||
|
|
|
|
in6_setscope(&ip6->ip6_dst, m->m_pkthdr.rcvif, NULL)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADSCOPE);
|
2006-01-24 02:01:40 +03:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
uint64_t *ip6s = IP6_STAT_GETREF();
|
|
|
|
ip6s[IP6_STAT_NOTMEMBER]++;
|
|
|
|
ip6s[IP6_STAT_CANTFORWARD]++;
|
|
|
|
IP6_STAT_PUTREF();
|
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;
|
|
|
|
}
|
|
|
|
|
2007-05-06 06:29:33 +04:00
|
|
|
sockaddr_in6_init(&u.dst6, &ip6->ip6_dst, 0, 0, 0);
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Unicast check
|
|
|
|
*/
|
2007-05-06 06:29:33 +04:00
|
|
|
rt = rtcache_lookup2(&ip6_forward_rt, &u.dst, 1, &hit);
|
|
|
|
if (hit)
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_FORWARD_CACHEHIT);
|
2007-05-06 06:29:33 +04:00
|
|
|
else
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_FORWARD_CACHEMISS);
|
2000-06-13 18:43:44 +04:00
|
|
|
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
#define rt6_getkey(__rt) satocsin6(rt_getkey(__rt))
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
2007-05-06 06:29:33 +04:00
|
|
|
if (rt != NULL &&
|
|
|
|
(rt->rt_flags & (RTF_HOST|RTF_GATEWAY)) == RTF_HOST &&
|
|
|
|
!(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.
|
|
|
|
*/
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst, &rt6_getkey(rt)->sin6_addr) &&
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
2007-05-06 06:29:33 +04:00
|
|
|
rt->rt_ifp->if_type == IFT_LOOP) {
|
|
|
|
struct in6_ifaddr *ia6 = (struct in6_ifaddr *)rt->rt_ifa;
|
1999-06-28 10:36:47 +04:00
|
|
|
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) {
|
2007-05-06 06:29:33 +04:00
|
|
|
if (rt != NULL && rt->rt_ifp != NULL &&
|
|
|
|
rt->rt_ifp->if_type == IFT_FAITH) {
|
1999-06-28 10:36:47 +04:00
|
|
|
/* XXX do we need more sanity checks? */
|
|
|
|
ours = 1;
|
2007-05-06 06:29:33 +04:00
|
|
|
deliverifp = 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;
|
2007-12-04 13:27:33 +03:00
|
|
|
IFADDR_FOREACH(ifa, m->m_pkthdr.rcvif) {
|
1999-12-13 18:17:17 +03:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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:
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
/*
|
|
|
|
* record address information into m_tag, if we don't have one yet.
|
|
|
|
* note that we are unable to record it, if the address is not listed
|
|
|
|
* as our interface address (e.g. multicast addresses, addresses
|
|
|
|
* within FAITH prefixes and such).
|
|
|
|
*/
|
2007-10-24 10:37:20 +04:00
|
|
|
if (deliverifp && ip6_getdstifaddr(m) == NULL) {
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct in6_ifaddr *ia6;
|
|
|
|
|
|
|
|
ia6 = in6_ifawithifp(deliverifp, &ip6->ip6_dst);
|
2007-10-24 10:37:20 +04:00
|
|
|
if (ia6 != NULL && ip6_setdstifaddr(m, ia6) == NULL) {
|
|
|
|
/*
|
|
|
|
* XXX maybe we should drop the packet here,
|
|
|
|
* as we could not provide enough information
|
|
|
|
* to the upper layers.
|
|
|
|
*/
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* 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
|
2006-03-06 02:47:08 +03:00
|
|
|
* contained, ip6_hopopts_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
|
|
|
*/
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2000-06-13 18:43:44 +04:00
|
|
|
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,
|
2007-03-04 08:59:00 +03:00
|
|
|
(char *)&ip6->ip6_plen - (char *)ip6);
|
2000-06-13 18:43:44 +04:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_CANTFORWARD);
|
1999-06-28 10:36:47 +04:00
|
|
|
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)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADSCOPE);
|
2000-07-06 16:36:18 +04:00
|
|
|
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
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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
|
|
|
|
2007-05-06 01:23:50 +04:00
|
|
|
rh_present = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
while (nxt != IPPROTO_DONE) {
|
|
|
|
if (ip6_hdrnestlimit && (++nest > ip6_hdrnestlimit)) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOMANYHDR);
|
2007-05-06 01:23:50 +04:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_hdrerr);
|
1999-06-28 10:36:47 +04:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_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;
|
|
|
|
}
|
|
|
|
|
2007-05-06 01:23:50 +04:00
|
|
|
if (nxt == IPPROTO_ROUTING) {
|
|
|
|
if (rh_present++) {
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif,
|
|
|
|
ifs6_in_hdrerr);
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2007-05-06 01:23:50 +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)) {
|
2008-04-23 10:09:04 +04:00
|
|
|
IPSEC6_STATINC(IPSEC_STAT_IN_POLVIO);
|
2001-03-01 19:31:37 +03:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
2007-02-10 12:43:05 +03:00
|
|
|
#ifdef FAST_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[ip_protox[nxt]].pr_flags & PR_LASTHDR) != 0) {
|
|
|
|
/*
|
|
|
|
* Check if the packet has already had IPsec processing
|
|
|
|
* done. If so, then just pass it along. This tag gets
|
|
|
|
* set during AH, ESP, etc. input handling, before the
|
|
|
|
* packet is returned to the ip input queue for delivery.
|
|
|
|
*/
|
|
|
|
mtag = m_tag_find(m, PACKET_TAG_IPSEC_IN_DONE, NULL);
|
|
|
|
s = splsoftnet();
|
|
|
|
if (mtag != NULL) {
|
|
|
|
tdbi = (struct tdb_ident *)(mtag + 1);
|
|
|
|
sp = ipsec_getpolicy(tdbi, IPSEC_DIR_INBOUND);
|
|
|
|
} else {
|
|
|
|
sp = ipsec_getpolicybyaddr(m, IPSEC_DIR_INBOUND,
|
|
|
|
IP_FORWARDING, &error);
|
|
|
|
}
|
|
|
|
if (sp != NULL) {
|
|
|
|
/*
|
|
|
|
* Check security policy against packet attributes.
|
|
|
|
*/
|
|
|
|
error = ipsec_in_reject(sp, m);
|
|
|
|
KEY_FREESP(&sp);
|
|
|
|
} else {
|
|
|
|
/* XXX error stat??? */
|
|
|
|
error = EINVAL;
|
|
|
|
DPRINTF(("ip6_input: no SP, packet discarded\n"));/*XXX*/
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
if (error)
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif /* FAST_IPSEC */
|
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
/*
|
|
|
|
* set/grab in6_ifaddr correspond to IPv6 destination address.
|
|
|
|
*/
|
|
|
|
static struct m_tag *
|
2007-10-29 19:54:42 +03:00
|
|
|
ip6_setdstifaddr(struct mbuf *m, const struct in6_ifaddr *ia)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
mtag = ip6_addaux(m);
|
2007-10-29 19:54:42 +03:00
|
|
|
if (mtag != NULL) {
|
|
|
|
struct ip6aux *ip6a;
|
|
|
|
|
|
|
|
ip6a = (struct ip6aux *)(mtag + 1);
|
|
|
|
in6_setscope(&ip6a->ip6a_src, ia->ia_ifp, &ip6a->ip6a_scope_id);
|
|
|
|
ip6a->ip6a_src = ia->ia_addr.sin6_addr;
|
|
|
|
ip6a->ip6a_flags = ia->ia6_flags;
|
|
|
|
}
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
return mtag; /* NULL if failed to set */
|
|
|
|
}
|
|
|
|
|
2007-10-29 19:54:42 +03:00
|
|
|
const struct ip6aux *
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_getdstifaddr(struct mbuf *m)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
mtag = ip6_findaux(m);
|
2007-10-29 19:54:42 +03:00
|
|
|
if (mtag != NULL)
|
|
|
|
return (struct ip6aux *)(mtag + 1);
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Hop-by-Hop options header processing. If a valid jumbo payload option is
|
|
|
|
* included, the real payload length will be stored in plenp.
|
2007-05-23 21:14:59 +04:00
|
|
|
*
|
|
|
|
* rtalertp - XXX: should be stored more smart way
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_hopopts_input(u_int32_t *plenp, u_int32_t *rtalertp,
|
|
|
|
struct mbuf **mp, int *offp)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m, sizeof(struct ip6_hdr),
|
|
|
|
hbhlen);
|
|
|
|
if (hbh == NULL) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
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
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_process_hopopts(struct mbuf *m, u_int8_t *opthead, int hbhlen,
|
|
|
|
u_int32_t *rtalertp, u_int32_t *plenp)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSMALL);
|
2001-02-10 07:14:26 +03:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSMALL);
|
2000-06-13 18:43:44 +04:00
|
|
|
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;
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy((void *)(opt + 2), (void *)&rtalert_val, 2);
|
2001-02-10 07:14:26 +03:00
|
|
|
*rtalertp = ntohs(rtalert_val);
|
|
|
|
break;
|
|
|
|
case IP6OPT_JUMBO:
|
|
|
|
/* XXX may need check for alignment */
|
|
|
|
if (hbhlen < IP6OPT_JUMBO_LEN) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSMALL);
|
2001-02-10 07:14:26 +03:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2000-06-13 18:43:44 +04:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2000-06-13 18:43:44 +04:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2000-06-13 18:43:44 +04:00
|
|
|
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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSMALL);
|
2001-02-10 07:14:26 +03:00
|
|
|
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
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_unknown_opt(u_int8_t *optp, struct mbuf *m, int off)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
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 */
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2001-02-10 07:14:26 +03:00
|
|
|
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 */
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_BADOPTIONS);
|
2001-02-10 07:14:26 +03:00
|
|
|
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
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_savecontrol(struct in6pcb *in6p, struct mbuf **mp,
|
|
|
|
struct ip6_hdr *ip6, struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2006-05-05 04:03:21 +04:00
|
|
|
#ifdef RFC2292
|
|
|
|
#define IS2292(x, y) ((in6p->in6p_flags & IN6P_RFC2292) ? (x) : (y))
|
|
|
|
#else
|
|
|
|
#define IS2292(x, y) (y)
|
|
|
|
#endif
|
|
|
|
|
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);
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *) &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
|
2006-05-23 18:20:56 +04:00
|
|
|
|
|
|
|
/* some OSes call this logic with IPv4 packet, for SO_TIMESTAMP */
|
|
|
|
if ((ip6->ip6_vfc & IPV6_VERSION_MASK) != IPV6_VERSION)
|
|
|
|
return;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* 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;
|
2006-05-05 04:03:21 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
bcopy(&ip6->ip6_dst, &pi6.ipi6_addr, sizeof(struct in6_addr));
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
in6_clearscope(&pi6.ipi6_addr); /* XXX */
|
2006-04-15 04:13:23 +04:00
|
|
|
pi6.ipi6_ifindex = m->m_pkthdr.rcvif ?
|
|
|
|
m->m_pkthdr.rcvif->if_index : 0;
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *) &pi6,
|
2006-05-05 04:03:21 +04:00
|
|
|
sizeof(struct in6_pktinfo),
|
|
|
|
IS2292(IPV6_2292PKTINFO, IPV6_PKTINFO), IPPROTO_IPV6);
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
2006-05-05 04:03:21 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (in6p->in6p_flags & IN6P_HOPLIMIT) {
|
|
|
|
int hlim = ip6->ip6_hlim & 0xff;
|
2006-05-05 04:03:21 +04:00
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *) &hlim, sizeof(int),
|
2006-05-05 04:03:21 +04:00
|
|
|
IS2292(IPV6_2292HOPLIMIT, IPV6_HOPLIMIT), IPPROTO_IPV6);
|
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((in6p->in6p_flags & IN6P_TCLASS) != 0) {
|
|
|
|
u_int32_t flowinfo;
|
|
|
|
int tclass;
|
|
|
|
|
|
|
|
flowinfo = (u_int32_t)ntohl(ip6->ip6_flow & IPV6_FLOWINFO_MASK);
|
|
|
|
flowinfo >>= 20;
|
|
|
|
|
|
|
|
tclass = flowinfo & 0xff;
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *)&tclass, sizeof(tclass),
|
2006-05-05 04:03:21 +04:00
|
|
|
IPV6_TCLASS, IPPROTO_IPV6);
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
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.
|
2006-05-05 04:03:21 +04:00
|
|
|
* See also RFC3542 section 8 (or RFC2292 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.
|
|
|
|
*/
|
2005-05-30 01:43:51 +04:00
|
|
|
struct ip6_hdr *xip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (xip6->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),
|
2005-05-30 01:43:51 +04:00
|
|
|
xip6->ip6_nxt);
|
2003-05-14 18:34:14 +04:00
|
|
|
if (ext == NULL) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
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);
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
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.
|
2006-05-05 04:03:21 +04:00
|
|
|
* Note: this constraint is removed in RFC3542.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *)hbh, hbhlen,
|
2006-05-05 04:03:21 +04:00
|
|
|
IS2292(IPV6_2292HOPOPTS, 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)) {
|
2005-05-30 01:43:51 +04:00
|
|
|
struct ip6_hdr *xip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
int nxt = xip6->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.
|
|
|
|
*/
|
2006-05-07 20:02:40 +04:00
|
|
|
for (;;) { /* 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) {
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
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);
|
2008-04-15 07:57:04 +04:00
|
|
|
IP6_STATINC(IP6_STAT_TOOSHORT);
|
1999-12-13 18:17:17 +03:00
|
|
|
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;
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *)ip6e, elen,
|
2006-05-05 04:03:21 +04:00
|
|
|
IS2292(IPV6_2292DSTOPTS, 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;
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
*mp = sbcreatecontrol((void *)ip6e, elen,
|
2006-05-05 04:03:21 +04:00
|
|
|
IS2292(IPV6_2292RTHDR, 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
|
|
|
;
|
|
|
|
}
|
|
|
|
}
|
2006-05-05 04:03:21 +04:00
|
|
|
#undef IS2292
|
|
|
|
|
|
|
|
|
|
|
|
void
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
ip6_notify_pmtu(struct in6pcb *in6p, const struct sockaddr_in6 *dst,
|
|
|
|
uint32_t *mtu)
|
2006-05-05 04:03:21 +04:00
|
|
|
{
|
|
|
|
struct socket *so;
|
|
|
|
struct mbuf *m_mtu;
|
|
|
|
struct ip6_mtuinfo mtuctl;
|
|
|
|
|
|
|
|
so = in6p->in6p_socket;
|
|
|
|
|
|
|
|
if (mtu == NULL)
|
|
|
|
return;
|
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (so == NULL) /* I believe this is impossible */
|
|
|
|
panic("ip6_notify_pmtu: socket is NULL");
|
|
|
|
#endif
|
|
|
|
|
|
|
|
memset(&mtuctl, 0, sizeof(mtuctl)); /* zero-clear for safety */
|
|
|
|
mtuctl.ip6m_mtu = *mtu;
|
|
|
|
mtuctl.ip6m_addr = *dst;
|
|
|
|
if (sa6_recoverscope(&mtuctl.ip6m_addr))
|
|
|
|
return;
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
if ((m_mtu = sbcreatecontrol((void *)&mtuctl, sizeof(mtuctl),
|
2006-05-05 04:03:21 +04:00
|
|
|
IPV6_PATHMTU, IPPROTO_IPV6)) == NULL)
|
|
|
|
return;
|
|
|
|
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
if (sbappendaddr(&so->so_rcv, (const struct sockaddr *)dst, NULL, m_mtu)
|
2006-05-05 04:03:21 +04:00
|
|
|
== 0) {
|
|
|
|
m_freem(m_mtu);
|
|
|
|
/* XXX: should count statistics */
|
|
|
|
} else
|
|
|
|
sorwakeup(so);
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
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 *
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_pullexthdr(struct mbuf *m, size_t off, int nxt)
|
2003-05-14 18:34:14 +04:00
|
|
|
{
|
|
|
|
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
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, sizeof(ip6e), (void *)&ip6e);
|
2003-05-14 18:34:14 +04:00
|
|
|
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
|
|
|
}
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, elen, mtod(n, void *));
|
2003-05-14 18:34:14 +04:00
|
|
|
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 *
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_get_prevhdr(struct mbuf *m, int off)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
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) {
|
2007-03-04 08:59:00 +03:00
|
|
|
ip6e = (struct ip6_ext *)(mtod(m, char *) + len);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
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
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_nexthdr(struct mbuf *m, int off, int proto, int *nxtp)
|
2000-03-22 02:53:30 +03:00
|
|
|
{
|
|
|
|
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:
|
2006-03-06 02:47:08 +03:00
|
|
|
/* do not chase beyond intermediate IPv6 headers */
|
|
|
|
if (off != 0)
|
|
|
|
return -1;
|
2000-03-22 02:53:30 +03:00
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6))
|
|
|
|
return -1;
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, sizeof(ip6), (void *)&ip6);
|
2000-03-22 02:53:30 +03:00
|
|
|
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;
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, sizeof(fh), (void *)&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;
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, sizeof(ip6e), (void *)&ip6e);
|
2000-03-22 02:53:30 +03:00
|
|
|
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;
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copydata(m, off, sizeof(ip6e), (void *)&ip6e);
|
2000-03-22 02:53:30 +03:00
|
|
|
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
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_lasthdr(struct mbuf *m, int off, int proto, int *nxtp)
|
2000-03-22 02:53:30 +03:00
|
|
|
{
|
|
|
|
int newoff;
|
|
|
|
int nxt;
|
|
|
|
|
|
|
|
if (!nxtp) {
|
|
|
|
nxt = -1;
|
|
|
|
nxtp = &nxt;
|
|
|
|
}
|
2006-05-07 20:02:40 +04:00
|
|
|
for (;;) {
|
2000-03-22 02:53:30 +03:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct m_tag *
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_addaux(struct mbuf *m)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
mtag = m_tag_find(m, PACKET_TAG_INET6, NULL);
|
|
|
|
if (!mtag) {
|
|
|
|
mtag = m_tag_get(PACKET_TAG_INET6, sizeof(struct ip6aux),
|
|
|
|
M_NOWAIT);
|
|
|
|
if (mtag) {
|
|
|
|
m_tag_prepend(m, mtag);
|
|
|
|
bzero(mtag + 1, sizeof(struct ip6aux));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return mtag;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct m_tag *
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_findaux(struct mbuf *m)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
mtag = m_tag_find(m, PACKET_TAG_INET6, NULL);
|
|
|
|
return mtag;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_delaux(struct mbuf *m)
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
{
|
|
|
|
struct m_tag *mtag;
|
|
|
|
|
|
|
|
mtag = m_tag_find(m, PACKET_TAG_INET6, NULL);
|
|
|
|
if (mtag)
|
|
|
|
m_tag_delete(m, mtag);
|
|
|
|
}
|
|
|
|
|
2007-03-08 01:20:04 +03:00
|
|
|
#ifdef GATEWAY
|
|
|
|
/*
|
|
|
|
* sysctl helper routine for net.inet.ip6.maxflows. Since
|
|
|
|
* we could reduce this value, call ip6flow_reap();
|
|
|
|
*/
|
|
|
|
static int
|
2007-03-24 03:42:14 +03:00
|
|
|
sysctl_net_inet6_ip6_maxflows(SYSCTLFN_ARGS)
|
2007-03-08 01:20:04 +03:00
|
|
|
{
|
|
|
|
int s;
|
|
|
|
|
|
|
|
s = sysctl_lookup(SYSCTLFN_CALL(rnode));
|
2007-03-24 03:27:58 +03:00
|
|
|
if (s || newp == NULL)
|
2007-03-08 01:20:04 +03:00
|
|
|
return (s);
|
|
|
|
|
|
|
|
s = splsoftnet();
|
|
|
|
ip6flow_reap(0);
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
2007-03-23 17:24:22 +03:00
|
|
|
|
|
|
|
static int
|
|
|
|
sysctl_net_inet6_ip6_hashsize(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
int error, tmp;
|
|
|
|
struct sysctlnode node;
|
|
|
|
|
|
|
|
node = *rnode;
|
|
|
|
tmp = ip6_hashsize;
|
|
|
|
node.sysctl_data = &tmp;
|
|
|
|
error = sysctl_lookup(SYSCTLFN_CALL(&node));
|
|
|
|
if (error || newp == NULL)
|
|
|
|
return (error);
|
|
|
|
|
|
|
|
if ((tmp & (tmp - 1)) == 0 && tmp != 0) {
|
|
|
|
/*
|
|
|
|
* Can only fail due to malloc()
|
|
|
|
*/
|
|
|
|
if (ip6flow_invalidate_all(tmp))
|
|
|
|
return ENOMEM;
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* EINVAL if not a power of 2
|
|
|
|
*/
|
|
|
|
return EINVAL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (0);
|
|
|
|
}
|
2007-03-08 01:20:04 +03:00
|
|
|
#endif /* GATEWAY */
|
|
|
|
|
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
|
|
|
|
};
|
|
|
|
|
2008-04-15 07:57:04 +04:00
|
|
|
static int
|
|
|
|
sysctl_net_inet6_ip6_stats(SYSCTLFN_ARGS)
|
|
|
|
{
|
|
|
|
|
2008-05-04 11:22:14 +04:00
|
|
|
return (NETSTAT_SYSCTL(ip6stat_percpu, IP6_NSTATS));
|
2008-04-15 07:57:04 +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
|
|
|
SYSCTL_SETUP(sysctl_net_inet6_ip6_setup, "sysctl net.inet6.ip6 subtree setup")
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2006-05-05 04:03:21 +04:00
|
|
|
#ifdef RFC2292
|
|
|
|
#define IS2292(x, y) ((in6p->in6p_flags & IN6P_RFC2292) ? (x) : (y))
|
|
|
|
#else
|
|
|
|
#define IS2292(x, y) (y)
|
|
|
|
#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
|
|
|
|
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, "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"),
|
2005-05-30 01:43:51 +04:00
|
|
|
NULL, 0, __UNCONST(__KAME_VERSION), 0,
|
Dynamic sysctl.
Gone are the old kern_sysctl(), cpu_sysctl(), hw_sysctl(),
vfs_sysctl(), etc, routines, along with sysctl_int() et al. Now all
nodes are registered with the tree, and nodes can be added (or
removed) easily, and I/O to and from the tree is handled generically.
Since the nodes are registered with the tree, the mapping from name to
number (and back again) can now be discovered, instead of having to be
hard coded. Adding new nodes to the tree is likewise much simpler --
the new infrastructure handles almost all the work for simple types,
and just about anything else can be done with a small helper function.
All existing nodes are where they were before (numerically speaking),
so all existing consumers of sysctl information should notice no
difference.
PS - I'm sorry, but there's a distinct lack of documentation at the
moment. I'm working on sysctl(3/8/9) right now, and I promise to
watch out for buses.
2003-12-04 22:38:21 +03:00
|
|
|
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 */
|
2006-03-06 02:47:08 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "use_tempaddr",
|
|
|
|
SYSCTL_DESCR("Use temporary address"),
|
|
|
|
NULL, 0, &ip6_use_tempaddr, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "temppltime",
|
|
|
|
SYSCTL_DESCR("preferred lifetime of a temporary address"),
|
|
|
|
NULL, 0, &ip6_temp_preferred_lifetime, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
CTL_CREATE, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "tempvltime",
|
|
|
|
SYSCTL_DESCR("valid lifetime of a temporary address"),
|
|
|
|
NULL, 0, &ip6_temp_valid_lifetime, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
CTL_CREATE, 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, "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);
|
2005-08-29 01:01:53 +04:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRUCT, "stats",
|
|
|
|
SYSCTL_DESCR("IPv6 statistics"),
|
2008-04-15 07:57:04 +04:00
|
|
|
sysctl_net_inet6_ip6_stats, 0, NULL, 0,
|
2005-08-29 01:01:53 +04:00
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_STATS, CTL_EOL);
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "use_defaultzone",
|
|
|
|
SYSCTL_DESCR("Whether to use the default scope zones"),
|
|
|
|
NULL, 0, &ip6_use_defzone, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
IPV6CTL_USE_DEFAULTZONE, CTL_EOL);
|
2006-03-06 02:47:08 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "mcast_pmtu",
|
|
|
|
SYSCTL_DESCR("Enable pMTU discovery for multicast packet"),
|
|
|
|
NULL, 0, &ip6_mcast_pmtu, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
CTL_CREATE, CTL_EOL);
|
2007-03-08 01:20:04 +03:00
|
|
|
#ifdef GATEWAY
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "maxflows",
|
|
|
|
SYSCTL_DESCR("Number of flows for fast forwarding (IPv6)"),
|
2007-03-24 03:42:14 +03:00
|
|
|
sysctl_net_inet6_ip6_maxflows, 0, &ip6_maxflows, 0,
|
2007-03-08 01:20:04 +03:00
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
CTL_CREATE, CTL_EOL);
|
2007-03-23 17:24:22 +03:00
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT|CTLFLAG_READWRITE,
|
|
|
|
CTLTYPE_INT, "hashsize",
|
|
|
|
SYSCTL_DESCR("Size of hash table for fast forwarding (IPv6)"),
|
|
|
|
sysctl_net_inet6_ip6_hashsize, 0, &ip6_hashsize, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_IPV6,
|
|
|
|
CTL_CREATE, CTL_EOL);
|
2007-03-08 01:20:04 +03:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2008-04-15 07:57:04 +04:00
|
|
|
|
|
|
|
void
|
|
|
|
ip6_statinc(u_int stat)
|
|
|
|
{
|
|
|
|
|
|
|
|
KASSERT(stat < IP6_NSTATS);
|
|
|
|
IP6_STATINC(stat);
|
|
|
|
}
|