2000-07-04 16:35:15 +00:00
|
|
|
/* $FreeBSD$ */
|
2002-04-19 04:46:24 +00:00
|
|
|
/* $KAME: ip6_input.c,v 1.259 2002/01/21 04:58:09 jinmei Exp $ */
|
2000-07-04 16:35:15 +00:00
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* 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.
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* @(#)ip_input.c 8.2 (Berkeley) 1/4/94
|
|
|
|
*/
|
|
|
|
|
2000-01-29 13:54:44 +00:00
|
|
|
#include "opt_ip6fw.h"
|
2000-07-04 16:35:15 +00:00
|
|
|
#include "opt_inet.h"
|
|
|
|
#include "opt_inet6.h"
|
|
|
|
#include "opt_ipsec.h"
|
2000-07-31 13:11:42 +00:00
|
|
|
#include "opt_pfil_hooks.h"
|
1999-12-22 19:13:38 +00:00
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
2001-06-11 12:39:29 +00:00
|
|
|
#include <sys/malloc.h>
|
1999-11-22 02:45:11 +00:00
|
|
|
#include <sys/mbuf.h>
|
2001-09-12 08:38:13 +00:00
|
|
|
#include <sys/proc.h>
|
1999-11-22 02:45:11 +00:00
|
|
|
#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 <net/if.h>
|
|
|
|
#include <net/if_types.h>
|
|
|
|
#include <net/if_dl.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/netisr.h>
|
2000-01-24 20:39:02 +00:00
|
|
|
#include <net/intrq.h>
|
2000-07-31 13:11:42 +00:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
#include <net/pfil.h>
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
2000-07-04 16:35:15 +00:00
|
|
|
#ifdef INET
|
1999-11-22 02:45:11 +00:00
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/ip_icmp.h>
|
2002-04-19 04:46:24 +00:00
|
|
|
#endif /* INET */
|
2000-07-04 16:35:15 +00:00
|
|
|
#include <netinet/ip6.h>
|
1999-11-22 02:45:11 +00:00
|
|
|
#include <netinet6/in6_var.h>
|
|
|
|
#include <netinet6/ip6_var.h>
|
2000-07-04 16:35:15 +00:00
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/icmp6.h>
|
1999-11-22 02:45:11 +00:00
|
|
|
#include <netinet6/in6_ifattach.h>
|
|
|
|
#include <netinet6/nd6.h>
|
|
|
|
#include <netinet6/in6_prefix.h>
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef IPSEC
|
|
|
|
#include <netinet6/ipsec.h>
|
|
|
|
#ifdef INET6
|
|
|
|
#include <netinet6/ipsec6.h>
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
|
2002-10-16 02:25:05 +00:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
#include <netipsec/ipsec.h>
|
|
|
|
#include <netipsec/ipsec6.h>
|
|
|
|
#define IPSEC
|
|
|
|
#endif /* FAST_IPSEC */
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
#include <netinet6/ip6_fw.h>
|
|
|
|
|
|
|
|
#include <netinet6/ip6protosw.h>
|
|
|
|
|
|
|
|
#include <net/net_osdep.h>
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
extern struct domain inet6domain;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
u_char ip6_protox[IPPROTO_MAX];
|
|
|
|
static int ip6qmaxlen = IFQ_MAXLEN;
|
|
|
|
struct in6_ifaddr *in6_ifaddr;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
extern struct callout in6_tmpaddrtimer_ch;
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
int ip6_forward_srcrt; /* XXX */
|
|
|
|
int ip6_sourcecheck; /* XXX */
|
|
|
|
int ip6_sourcecheck_interval; /* XXX */
|
2000-01-24 20:39:02 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
int ip6_ours_check_algorithm;
|
|
|
|
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/* firewall hooks */
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6_fw_chk_t *ip6_fw_chk_ptr;
|
|
|
|
ip6_fw_ctl_t *ip6_fw_ctl_ptr;
|
2000-09-23 18:50:59 +00:00
|
|
|
int ip6_fw_enable = 1;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
struct ip6stat ip6stat;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
static void ip6_init2 __P((void *));
|
2002-10-16 01:54:46 +00:00
|
|
|
static struct ip6aux *ip6_setdstifaddr __P((struct mbuf *, struct in6_ifaddr *));
|
2000-07-04 16:35:15 +00:00
|
|
|
static int ip6_hopopts_input __P((u_int32_t *, u_int32_t *, struct mbuf **, int *));
|
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
static struct mbuf *ip6_pullexthdr __P((struct mbuf *, size_t, int));
|
1999-11-22 02:45:11 +00:00
|
|
|
#endif
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
|
|
|
* IP6 initialization: fill in IP6 protocol switch table.
|
|
|
|
* All protocols not implemented in kernel go to raw IP6 protocol handler.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ip6_init()
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
struct ip6protosw *pr;
|
|
|
|
int i;
|
1999-11-22 02:45:11 +00:00
|
|
|
struct timeval tv;
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (sizeof(struct protosw) != sizeof(struct ip6protosw))
|
|
|
|
panic("sizeof(protosw) != sizeof(ip6protosw)");
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
pr = (struct ip6protosw *)pffindproto(PF_INET6, IPPROTO_RAW, SOCK_RAW);
|
|
|
|
if (pr == 0)
|
|
|
|
panic("ip6_init");
|
|
|
|
for (i = 0; i < IPPROTO_MAX; i++)
|
|
|
|
ip6_protox[i] = pr - inet6sw;
|
|
|
|
for (pr = (struct ip6protosw *)inet6domain.dom_protosw;
|
|
|
|
pr < (struct ip6protosw *)inet6domain.dom_protoswNPROTOSW; pr++)
|
|
|
|
if (pr->pr_domain->dom_family == PF_INET6 &&
|
|
|
|
pr->pr_protocol && pr->pr_protocol != IPPROTO_RAW)
|
|
|
|
ip6_protox[pr->pr_protocol] = pr - inet6sw;
|
|
|
|
ip6intrq.ifq_maxlen = ip6qmaxlen;
|
2002-04-04 21:03:38 +00:00
|
|
|
mtx_init(&ip6intrq.ifq_mtx, "ip6_inq", NULL, MTX_DEF);
|
2002-01-08 10:34:03 +00:00
|
|
|
ip6intrq_present = 1;
|
2000-02-13 03:32:07 +00:00
|
|
|
register_netisr(NETISR_IPV6, ip6intr);
|
1999-11-22 02:45:11 +00:00
|
|
|
nd6_init();
|
|
|
|
frag6_init();
|
|
|
|
/*
|
|
|
|
* in many cases, random() here does NOT return random number
|
|
|
|
* as initialization during bootstrap time occur in fixed order.
|
|
|
|
*/
|
|
|
|
microtime(&tv);
|
|
|
|
ip6_flow_seq = random() ^ tv.tv_usec;
|
2001-06-11 12:39:29 +00:00
|
|
|
microtime(&tv);
|
|
|
|
ip6_desync_factor = (random() ^ tv.tv_usec) % MAX_TEMP_DESYNC_FACTOR;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
ip6_init2(dummy)
|
|
|
|
void *dummy;
|
|
|
|
{
|
|
|
|
|
|
|
|
/*
|
|
|
|
* to route local address of p2p link to loopback,
|
|
|
|
* assign loopback address first.
|
|
|
|
*/
|
2000-07-04 16:35:15 +00:00
|
|
|
in6_ifattach(&loif[0], NULL);
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/* nd6_timer_init */
|
2001-06-11 12:39:29 +00:00
|
|
|
callout_init(&nd6_timer_ch, 0);
|
|
|
|
callout_reset(&nd6_timer_ch, hz, nd6_timer, NULL);
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/* router renumbering prefix list maintenance */
|
2001-06-11 12:39:29 +00:00
|
|
|
callout_init(&in6_rr_timer_ch, 0);
|
|
|
|
callout_reset(&in6_rr_timer_ch, hz, in6_rr_timer, NULL);
|
|
|
|
|
|
|
|
/* timer for regeneranation of temporary addresses randomize ID */
|
|
|
|
callout_reset(&in6_tmpaddrtimer_ch,
|
|
|
|
(ip6_temp_preferred_lifetime - ip6_desync_factor -
|
|
|
|
ip6_temp_regen_advance) * hz,
|
|
|
|
in6_tmpaddrtimer, NULL);
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* cheat */
|
1999-12-22 19:13:38 +00:00
|
|
|
/* This must be after route_init(), which is now SI_ORDER_THIRD */
|
|
|
|
SYSINIT(netinet6init2, SI_SUB_PROTO_DOMAIN, SI_ORDER_MIDDLE, ip6_init2, NULL);
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* IP6 input interrupt handling. Just pass the packet to ip6_input.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
ip6intr()
|
|
|
|
{
|
|
|
|
int s;
|
|
|
|
struct mbuf *m;
|
|
|
|
|
|
|
|
for (;;) {
|
|
|
|
s = splimp();
|
|
|
|
IF_DEQUEUE(&ip6intrq, m);
|
|
|
|
splx(s);
|
|
|
|
if (m == 0)
|
|
|
|
return;
|
|
|
|
ip6_input(m);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
extern struct route_in6 ip6_forward_rt;
|
|
|
|
|
|
|
|
void
|
|
|
|
ip6_input(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
int off = sizeof(struct ip6_hdr), nest;
|
|
|
|
u_int32_t plen;
|
|
|
|
u_int32_t rtalert = ~0;
|
|
|
|
int nxt, ours = 0;
|
|
|
|
struct ifnet *deliverifp = NULL;
|
2000-07-31 13:11:42 +00:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
struct packet_filter_hook *pfh;
|
|
|
|
struct mbuf *m0;
|
|
|
|
int rv;
|
|
|
|
#endif /* PFIL_HOOKS */
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
#ifdef IPSEC
|
|
|
|
/*
|
|
|
|
* should the inner packet be considered authentic?
|
|
|
|
* see comment in ah4_input().
|
|
|
|
*/
|
|
|
|
if (m) {
|
|
|
|
m->m_flags &= ~M_AUTHIPHDR;
|
|
|
|
m->m_flags &= ~M_AUTHIPDGM;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/*
|
|
|
|
* make sure we don't have onion peering information into m_aux.
|
|
|
|
*/
|
|
|
|
ip6_delaux(m);
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
2002-04-19 04:46:24 +00:00
|
|
|
* mbuf statistics
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
|
|
|
if (m->m_flags & M_EXT) {
|
|
|
|
if (m->m_next)
|
|
|
|
ip6stat.ip6s_mext2m++;
|
|
|
|
else
|
|
|
|
ip6stat.ip6s_mext1++;
|
|
|
|
} else {
|
2001-06-11 12:39:29 +00:00
|
|
|
#define M2MMAX (sizeof(ip6stat.ip6s_m2m)/sizeof(ip6stat.ip6s_m2m[0]))
|
1999-11-22 02:45:11 +00:00
|
|
|
if (m->m_next) {
|
|
|
|
if (m->m_flags & M_LOOP) {
|
2002-04-19 04:46:24 +00:00
|
|
|
ip6stat.ip6s_m2m[loif[0].if_index]++; /* XXX */
|
2001-06-11 12:39:29 +00:00
|
|
|
} else if (m->m_pkthdr.rcvif->if_index < M2MMAX)
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6stat.ip6s_m2m[m->m_pkthdr.rcvif->if_index]++;
|
|
|
|
else
|
|
|
|
ip6stat.ip6s_m2m[0]++;
|
|
|
|
} else
|
|
|
|
ip6stat.ip6s_m1++;
|
2001-06-11 12:39:29 +00:00
|
|
|
#undef M2MMAX
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_receive);
|
|
|
|
ip6stat.ip6s_total++;
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
#ifndef PULLDOWN_TEST
|
2001-03-16 10:58:16 +00:00
|
|
|
/*
|
|
|
|
* L2 bridge code and some other code can return mbuf chain
|
|
|
|
* that does not conform to KAME requirement. too bad.
|
|
|
|
* XXX: fails to join if interface MTU > MCLBYTES. jumbogram?
|
|
|
|
*/
|
|
|
|
if (m && m->m_next != NULL && m->m_pkthdr.len < MCLBYTES) {
|
|
|
|
struct mbuf *n;
|
|
|
|
|
|
|
|
MGETHDR(n, M_DONTWAIT, MT_HEADER);
|
2001-05-22 17:32:02 +00:00
|
|
|
if (n)
|
2002-12-30 20:22:40 +00:00
|
|
|
M_MOVE_PKTHDR(n, m);
|
2001-03-16 10:58:16 +00:00
|
|
|
if (n && m->m_pkthdr.len > MHLEN) {
|
|
|
|
MCLGET(n, M_DONTWAIT);
|
|
|
|
if ((n->m_flags & M_EXT) == 0) {
|
|
|
|
m_freem(n);
|
|
|
|
n = NULL;
|
|
|
|
}
|
|
|
|
}
|
2002-04-19 04:46:24 +00:00
|
|
|
if (n == NULL) {
|
2001-05-22 17:32:02 +00:00
|
|
|
m_freem(m);
|
2001-03-16 10:58:16 +00:00
|
|
|
return; /*ENOBUFS*/
|
2001-05-22 17:32:02 +00:00
|
|
|
}
|
2001-03-16 10:58:16 +00:00
|
|
|
|
|
|
|
m_copydata(m, 0, m->m_pkthdr.len, mtod(n, caddr_t));
|
|
|
|
n->m_len = m->m_pkthdr.len;
|
|
|
|
m_freem(m);
|
|
|
|
m = n;
|
|
|
|
}
|
1999-11-22 02:45:11 +00:00
|
|
|
IP6_EXTHDR_CHECK(m, 0, sizeof(struct ip6_hdr), /*nothing*/);
|
2000-07-04 16:35:15 +00:00
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
if (m->m_len < sizeof(struct ip6_hdr)) {
|
|
|
|
struct ifnet *inifp;
|
|
|
|
inifp = m->m_pkthdr.rcvif;
|
|
|
|
if ((m = m_pullup(m, sizeof(struct ip6_hdr))) == 0) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
in6_ifstat_inc(inifp, ifs6_in_hdrerr);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
if ((ip6->ip6_vfc & IPV6_VERSION_MASK) != IPV6_VERSION) {
|
|
|
|
ip6stat.ip6s_badvers++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_hdrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2000-07-31 13:11:42 +00: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.
|
|
|
|
*/
|
|
|
|
m0 = m;
|
2000-08-12 18:14:13 +00:00
|
|
|
pfh = pfil_hook_get(PFIL_IN, &inet6sw[ip6_protox[IPPROTO_IPV6]].pr_pfh);
|
2000-07-31 13:11:42 +00:00
|
|
|
for (; pfh; pfh = pfh->pfil_link.tqe_next)
|
|
|
|
if (pfh->pfil_func) {
|
|
|
|
rv = pfh->pfil_func(ip6, sizeof(*ip6),
|
|
|
|
m->m_pkthdr.rcvif, 0, &m0);
|
|
|
|
if (rv)
|
|
|
|
return;
|
|
|
|
m = m0;
|
|
|
|
if (m == NULL)
|
|
|
|
return;
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
}
|
|
|
|
#endif /* PFIL_HOOKS */
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6stat.ip6s_nxthist[ip6->ip6_nxt]++;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check with the firewall...
|
|
|
|
*/
|
2000-09-23 18:50:59 +00:00
|
|
|
if (ip6_fw_enable && ip6_fw_chk_ptr) {
|
1999-11-22 02:45:11 +00:00
|
|
|
u_short port = 0;
|
|
|
|
/* If ipfw says divert, we have to just drop packet */
|
|
|
|
/* use port as a dummy argument */
|
|
|
|
if ((*ip6_fw_chk_ptr)(&ip6, NULL, &port, &m)) {
|
|
|
|
m_freem(m);
|
|
|
|
m = NULL;
|
|
|
|
}
|
|
|
|
if (!m)
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2001-06-11 12:39:29 +00:00
|
|
|
* Check against address spoofing/corruption.
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_UNSPECIFIED(&ip6->ip6_dst)) {
|
2001-06-11 12:39:29 +00:00
|
|
|
/*
|
|
|
|
* XXX: "badscope" is not very suitable for a multicast source.
|
|
|
|
*/
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if ((IN6_IS_ADDR_LOOPBACK(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_LOOPBACK(&ip6->ip6_dst)) &&
|
|
|
|
(m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) == 0) {
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
2002-04-19 04:46:24 +00:00
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
/*
|
2001-06-11 12:39:29 +00: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.
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
* partical support for SIIT environment.
|
2000-07-04 16:35:15 +00:00
|
|
|
*/
|
2001-06-11 12:39:29 +00:00
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4MAPPED(&ip6->ip6_dst)) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
#if 0
|
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_V4COMPAT(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4COMPAT(&ip6->ip6_dst)) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
/* drop packets if interface ID portion is already filled */
|
|
|
|
if ((m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) == 0) {
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_src) &&
|
|
|
|
ip6->ip6_src.s6_addr16[1]) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_dst) &&
|
|
|
|
ip6->ip6_dst.s6_addr16[1]) {
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_src))
|
|
|
|
ip6->ip6_src.s6_addr16[1]
|
|
|
|
= htons(m->m_pkthdr.rcvif->if_index);
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&ip6->ip6_dst))
|
|
|
|
ip6->ip6_dst.s6_addr16[1]
|
|
|
|
= htons(m->m_pkthdr.rcvif->if_index);
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
#if 0 /* this case seems to be unnecessary. (jinmei, 20010401) */
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
2001-06-11 12:39:29 +00:00
|
|
|
* We use rt->rt_ifp to determine if the address is ours or not.
|
|
|
|
* If rt_ifp is lo0, the address is ours.
|
|
|
|
* The problem here is, rt->rt_ifp for fe80::%lo0/64 is set to lo0,
|
|
|
|
* so any address under fe80::%lo0/64 will be mistakenly considered
|
|
|
|
* local. The special case is supplied to handle the case properly
|
|
|
|
* by actually looking at interface addresses
|
|
|
|
* (using in6ifa_ifpwithaddr).
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((m->m_pkthdr.rcvif->if_flags & IFF_LOOPBACK) != 0 &&
|
|
|
|
IN6_IS_ADDR_LINKLOCAL(&ip6->ip6_dst)) {
|
|
|
|
if (!in6ifa_ifpwithaddr(m->m_pkthdr.rcvif, &ip6->ip6_dst)) {
|
|
|
|
icmp6_error(m, ICMP6_DST_UNREACH,
|
|
|
|
ICMP6_DST_UNREACH_ADDR, 0);
|
|
|
|
/* m is already freed */
|
|
|
|
return;
|
2000-07-04 16:35:15 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
ours = 1;
|
|
|
|
deliverifp = m->m_pkthdr.rcvif;
|
|
|
|
goto hbhcheck;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Multicast check
|
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst)) {
|
|
|
|
struct in6_multi *in6m = 0;
|
|
|
|
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_mcast);
|
|
|
|
/*
|
|
|
|
* 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;
|
2000-01-28 05:27:14 +00:00
|
|
|
else if (!ip6_mrouter) {
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6stat.ip6s_notmember++;
|
|
|
|
ip6stat.ip6s_cantforward++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
deliverifp = m->m_pkthdr.rcvif;
|
|
|
|
goto hbhcheck;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unicast check
|
|
|
|
*/
|
2001-06-11 12:39:29 +00:00
|
|
|
switch (ip6_ours_check_algorithm) {
|
|
|
|
default:
|
|
|
|
/*
|
|
|
|
* XXX: I intentionally broke our indentation rule here,
|
|
|
|
* since this switch-case is just for measurement and
|
|
|
|
* therefore should soon be removed.
|
|
|
|
*/
|
2000-07-04 16:35:15 +00:00
|
|
|
if (ip6_forward_rt.ro_rt != NULL &&
|
|
|
|
(ip6_forward_rt.ro_rt->rt_flags & RTF_UP) != 0 &&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst,
|
2001-06-11 12:39:29 +00:00
|
|
|
&((struct sockaddr_in6 *)(&ip6_forward_rt.ro_dst))->sin6_addr))
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6stat.ip6s_forward_cachehit++;
|
|
|
|
else {
|
2001-06-11 12:39:29 +00:00
|
|
|
struct sockaddr_in6 *dst6;
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
if (ip6_forward_rt.ro_rt) {
|
2000-07-04 16:35:15 +00:00
|
|
|
/* route is down or destination is different */
|
|
|
|
ip6stat.ip6s_forward_cachemiss++;
|
1999-11-22 02:45:11 +00:00
|
|
|
RTFREE(ip6_forward_rt.ro_rt);
|
|
|
|
ip6_forward_rt.ro_rt = 0;
|
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
bzero(&ip6_forward_rt.ro_dst, sizeof(struct sockaddr_in6));
|
2001-06-11 12:39:29 +00:00
|
|
|
dst6 = (struct sockaddr_in6 *)&ip6_forward_rt.ro_dst;
|
|
|
|
dst6->sin6_len = sizeof(struct sockaddr_in6);
|
|
|
|
dst6->sin6_family = AF_INET6;
|
|
|
|
dst6->sin6_addr = ip6->ip6_dst;
|
2000-07-04 16:35:15 +00:00
|
|
|
#ifdef SCOPEDROUTING
|
|
|
|
ip6_forward_rt.ro_dst.sin6_scope_id =
|
|
|
|
in6_addr2scopeid(m->m_pkthdr.rcvif, &ip6->ip6_dst);
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
rtalloc_ign((struct route *)&ip6_forward_rt, RTF_PRCLONING);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define rt6_key(r) ((struct sockaddr_in6 *)((r)->rt_nodes->rn_key))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Accept the packet if the forwarding interface to the destination
|
|
|
|
* according to the routing table is the loopback interface,
|
|
|
|
* unless the associated route has a gateway.
|
|
|
|
* Note that this approach causes to accept a packet if there is a
|
|
|
|
* route to the loopback interface for the destination of the packet.
|
|
|
|
* But we think it's even useful in some situations, e.g. when using
|
|
|
|
* a special daemon which wants to intercept the packet.
|
2001-06-11 12:39:29 +00:00
|
|
|
*
|
|
|
|
* XXX: some OSes automatically make a cloned route for the destination
|
|
|
|
* of an outgoing packet. If the outgoing interface of the packet
|
|
|
|
* is a loopback one, the kernel would consider the packet to be
|
|
|
|
* accepted, even if we have no such address assinged on the interface.
|
|
|
|
* We check the cloned flag of the route entry to reject such cases,
|
|
|
|
* assuming that route entries for our own addresses are not made by
|
|
|
|
* cloning (it should be true because in6_addloop explicitly installs
|
|
|
|
* the host route). However, we might have to do an explicit check
|
|
|
|
* while it would be less efficient. Or, should we rather install a
|
|
|
|
* reject route for such a case?
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
|
|
|
if (ip6_forward_rt.ro_rt &&
|
|
|
|
(ip6_forward_rt.ro_rt->rt_flags &
|
|
|
|
(RTF_HOST|RTF_GATEWAY)) == RTF_HOST &&
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef RTF_WASCLONED
|
|
|
|
!(ip6_forward_rt.ro_rt->rt_flags & RTF_WASCLONED) &&
|
|
|
|
#endif
|
|
|
|
#ifdef RTF_CLONED
|
|
|
|
!(ip6_forward_rt.ro_rt->rt_flags & RTF_CLONED) &&
|
|
|
|
#endif
|
2000-07-04 16:35:15 +00:00
|
|
|
#if 0
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
2000-07-04 16:35:15 +00:00
|
|
|
* 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.
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
2000-07-04 16:35:15 +00:00
|
|
|
IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst,
|
2001-06-11 12:39:29 +00:00
|
|
|
&rt6_key(ip6_forward_rt.ro_rt)->sin6_addr)
|
2000-07-04 16:35:15 +00:00
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6_forward_rt.ro_rt->rt_ifp->if_type == IFT_LOOP) {
|
|
|
|
struct in6_ifaddr *ia6 =
|
|
|
|
(struct in6_ifaddr *)ip6_forward_rt.ro_rt->rt_ifa;
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* record address information into m_aux.
|
|
|
|
*/
|
|
|
|
(void)ip6_setdstifaddr(m, ia6);
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
/*
|
|
|
|
* packets to a tentative, duplicated, or somehow invalid
|
|
|
|
* address must not be accepted.
|
|
|
|
*/
|
1999-11-22 02:45:11 +00:00
|
|
|
if (!(ia6->ia6_flags & IN6_IFF_NOTREADY)) {
|
2000-07-04 16:35:15 +00:00
|
|
|
/* this address is ready */
|
1999-11-22 02:45:11 +00:00
|
|
|
ours = 1;
|
|
|
|
deliverifp = ia6->ia_ifp; /* correct? */
|
2000-10-19 23:15:54 +00:00
|
|
|
/* Count the packet in the ip address stats */
|
|
|
|
ia6->ia_ifa.if_ipackets++;
|
|
|
|
ia6->ia_ifa.if_ibytes += m->m_pkthdr.len;
|
1999-11-22 02:45:11 +00:00
|
|
|
goto hbhcheck;
|
|
|
|
} else {
|
2000-07-04 16:35:15 +00:00
|
|
|
/* address is not ready, so discard the packet. */
|
2001-06-11 12:39:29 +00:00
|
|
|
nd6log((LOG_INFO,
|
|
|
|
"ip6_input: packet to an unready address %s->%s\n",
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6_sprintf(&ip6->ip6_src),
|
2001-06-11 12:39:29 +00:00
|
|
|
ip6_sprintf(&ip6->ip6_dst)));
|
2000-07-04 16:35:15 +00:00
|
|
|
|
|
|
|
goto bad;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
} /* XXX indentation (see above) */
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* FAITH(Firewall Aided Internet Translator)
|
|
|
|
*/
|
|
|
|
if (ip6_keepfaith) {
|
|
|
|
if (ip6_forward_rt.ro_rt && ip6_forward_rt.ro_rt->rt_ifp
|
|
|
|
&& ip6_forward_rt.ro_rt->rt_ifp->if_type == IFT_FAITH) {
|
|
|
|
/* XXX do we need more sanity checks? */
|
|
|
|
ours = 1;
|
2002-04-19 04:46:24 +00:00
|
|
|
deliverifp = ip6_forward_rt.ro_rt->rt_ifp; /* faith */
|
1999-11-22 02:45:11 +00:00
|
|
|
goto hbhcheck;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Now there is no reason to process the packet if it's not our own
|
|
|
|
* and we're not a router.
|
|
|
|
*/
|
|
|
|
if (!ip6_forwarding) {
|
|
|
|
ip6stat.ip6s_cantforward++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
hbhcheck:
|
2001-06-11 12:39:29 +00:00
|
|
|
/*
|
|
|
|
* record address information into m_aux, 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).
|
|
|
|
*/
|
|
|
|
if (deliverifp && !ip6_getdstifaddr(m)) {
|
|
|
|
struct in6_ifaddr *ia6;
|
|
|
|
|
|
|
|
ia6 = in6_ifawithifp(deliverifp, &ip6->ip6_dst);
|
|
|
|
if (ia6) {
|
|
|
|
if (!ip6_setdstifaddr(m, ia6)) {
|
|
|
|
/*
|
|
|
|
* XXX maybe we should drop the packet here,
|
|
|
|
* as we could not provide enough information
|
|
|
|
* to the upper layers.
|
|
|
|
*/
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-11-22 02:45:11 +00: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) {
|
2000-07-04 16:35:15 +00:00
|
|
|
struct ip6_hbh *hbh;
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
if (ip6_hopopts_input(&plen, &rtalert, &m, &off)) {
|
2000-07-04 16:35:15 +00:00
|
|
|
#if 0 /*touches NULL pointer*/
|
1999-11-22 02:45:11 +00:00
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
2000-07-04 16:35:15 +00:00
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
return; /* m have already been freed */
|
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/* adjust pointer */
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
2000-07-04 16:35:15 +00:00
|
|
|
|
|
|
|
/*
|
2002-04-19 04:46:24 +00:00
|
|
|
* if the payload length field is 0 and the next header field
|
2000-07-04 16:35:15 +00:00
|
|
|
* indicates Hop-by-Hop Options header, then a Jumbo Payload
|
|
|
|
* option MUST be included.
|
|
|
|
*/
|
|
|
|
if (ip6->ip6_plen == 0 && plen == 0) {
|
|
|
|
/*
|
|
|
|
* Note that if a valid jumbo payload option is
|
|
|
|
* contained, ip6_hoptops_input() must set a valid
|
|
|
|
* (non-zero) payload length to the variable plen.
|
|
|
|
*/
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_discard);
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_hdrerr);
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
(caddr_t)&ip6->ip6_plen - (caddr_t)ip6);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#ifndef PULLDOWN_TEST
|
|
|
|
/* ip6_hopopts_input() ensures that mbuf is contiguous */
|
|
|
|
hbh = (struct ip6_hbh *)(ip6 + 1);
|
|
|
|
#else
|
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m, sizeof(struct ip6_hdr),
|
|
|
|
sizeof(struct ip6_hbh));
|
|
|
|
if (hbh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
nxt = hbh->ip6h_nxt;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* accept the packet if a router alert option is included
|
|
|
|
* and we act as an IPv6 router.
|
|
|
|
*/
|
|
|
|
if (rtalert != ~0 && ip6_forwarding)
|
|
|
|
ours = 1;
|
|
|
|
} else
|
|
|
|
nxt = ip6->ip6_nxt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check that the amount of data in the buffers
|
|
|
|
* is as at least much as the IPv6 header would have us expect.
|
|
|
|
* Trim mbufs if longer than we expect.
|
|
|
|
* Drop packet if shorter than we expect.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len - sizeof(struct ip6_hdr) < plen) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_truncated);
|
|
|
|
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)) {
|
2000-01-28 05:27:14 +00:00
|
|
|
/*
|
|
|
|
* If we are acting as a multicast router, all
|
|
|
|
* incoming multicast packets are passed to the
|
|
|
|
* kernel-level multicast forwarding function.
|
|
|
|
* The packet is returned (relatively) intact; if
|
|
|
|
* ip6_mforward() returns a non-zero value, the packet
|
|
|
|
* must be discarded, else it may be accepted below.
|
|
|
|
*/
|
|
|
|
if (ip6_mrouter && ip6_mforward(ip6, m->m_pkthdr.rcvif, m)) {
|
|
|
|
ip6stat.ip6s_cantforward++;
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
1999-11-22 02:45:11 +00:00
|
|
|
if (!ours) {
|
|
|
|
m_freem(m);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
} else if (!ours) {
|
|
|
|
ip6_forward(m, 0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
2000-07-04 16:35:15 +00:00
|
|
|
* 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.
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
2000-07-04 16:35:15 +00:00
|
|
|
if (IN6_IS_ADDR_V4MAPPED(&ip6->ip6_src) ||
|
|
|
|
IN6_IS_ADDR_V4MAPPED(&ip6->ip6_dst)) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_addrerr);
|
|
|
|
goto bad;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Tell launch routine the next header
|
|
|
|
*/
|
1999-11-22 02:45:11 +00:00
|
|
|
ip6stat.ip6s_delivered++;
|
|
|
|
in6_ifstat_inc(deliverifp, ifs6_in_deliver);
|
|
|
|
nest = 0;
|
2001-06-11 12:39:29 +00:00
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
while (nxt != IPPROTO_DONE) {
|
|
|
|
if (ip6_hdrnestlimit && (++nest > ip6_hdrnestlimit)) {
|
|
|
|
ip6stat.ip6s_toomanyhdr++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* protection against faulty packet - there should be
|
|
|
|
* more sanity checks in header chain processing.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < off) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
in6_ifstat_inc(m->m_pkthdr.rcvif, ifs6_in_truncated);
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
#if 0
|
|
|
|
/*
|
|
|
|
* do we need to do it for every header? yeah, other
|
|
|
|
* functions can play with it (like re-allocate and copy).
|
|
|
|
*/
|
|
|
|
mhist = ip6_addaux(m);
|
|
|
|
if (mhist && M_TRAILINGSPACE(mhist) >= sizeof(nxt)) {
|
|
|
|
hist = mtod(mhist, caddr_t) + mhist->m_len;
|
|
|
|
bcopy(&nxt, hist, sizeof(nxt));
|
|
|
|
mhist->m_len += sizeof(nxt);
|
|
|
|
} else {
|
|
|
|
ip6stat.ip6s_toomanyhdr++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#ifdef IPSEC
|
|
|
|
/*
|
|
|
|
* enforce IPsec policy checking if we are seeing last header.
|
|
|
|
* note that we do not visit this with protocols with pcb layer
|
|
|
|
* code - like udp/tcp/raw ip.
|
|
|
|
*/
|
|
|
|
if ((inet6sw[ip6_protox[nxt]].pr_flags & PR_LASTHDR) != 0 &&
|
|
|
|
ipsec6_in_reject(m, NULL)) {
|
|
|
|
ipsec6stat.in_polvio++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
nxt = (*inet6sw[ip6_protox[nxt]].pr_input)(&m, &off, nxt);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
bad:
|
|
|
|
m_freem(m);
|
|
|
|
}
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
/*
|
|
|
|
* set/grab in6_ifaddr correspond to IPv6 destination address.
|
|
|
|
* XXX backward compatibility wrapper
|
|
|
|
*/
|
2002-10-16 01:54:46 +00:00
|
|
|
static struct ip6aux *
|
2001-06-11 12:39:29 +00:00
|
|
|
ip6_setdstifaddr(m, ia6)
|
|
|
|
struct mbuf *m;
|
|
|
|
struct in6_ifaddr *ia6;
|
|
|
|
{
|
2002-10-16 01:54:46 +00:00
|
|
|
struct ip6aux *n;
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
n = ip6_addaux(m);
|
|
|
|
if (n)
|
2002-10-16 01:54:46 +00:00
|
|
|
n->ip6a_dstia6 = ia6;
|
2001-06-11 12:39:29 +00:00
|
|
|
return n; /* NULL if failed to set */
|
|
|
|
}
|
|
|
|
|
|
|
|
struct in6_ifaddr *
|
|
|
|
ip6_getdstifaddr(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
2002-10-16 01:54:46 +00:00
|
|
|
struct ip6aux *n;
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
n = ip6_findaux(m);
|
|
|
|
if (n)
|
2002-10-16 01:54:46 +00:00
|
|
|
return n->ip6a_dstia6;
|
2001-06-11 12:39:29 +00:00
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
|
|
|
* Hop-by-Hop options header processing. If a valid jumbo payload option is
|
|
|
|
* included, the real payload length will be stored in plenp.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
ip6_hopopts_input(plenp, rtalertp, mp, offp)
|
|
|
|
u_int32_t *plenp;
|
|
|
|
u_int32_t *rtalertp; /* XXX: should be stored more smart way */
|
|
|
|
struct mbuf **mp;
|
|
|
|
int *offp;
|
|
|
|
{
|
2001-06-11 12:39:29 +00:00
|
|
|
struct mbuf *m = *mp;
|
1999-11-22 02:45:11 +00:00
|
|
|
int off = *offp, hbhlen;
|
|
|
|
struct ip6_hbh *hbh;
|
|
|
|
u_int8_t *opt;
|
|
|
|
|
|
|
|
/* validation of the length of the header */
|
2000-07-04 16:35:15 +00:00
|
|
|
#ifndef PULLDOWN_TEST
|
1999-11-22 02:45:11 +00:00
|
|
|
IP6_EXTHDR_CHECK(m, off, sizeof(*hbh), -1);
|
|
|
|
hbh = (struct ip6_hbh *)(mtod(m, caddr_t) + off);
|
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
|
|
|
|
|
|
|
IP6_EXTHDR_CHECK(m, off, hbhlen, -1);
|
|
|
|
hbh = (struct ip6_hbh *)(mtod(m, caddr_t) + off);
|
2000-07-04 16:35:15 +00:00
|
|
|
#else
|
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m,
|
|
|
|
sizeof(struct ip6_hdr), sizeof(struct ip6_hbh));
|
|
|
|
if (hbh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
|
|
|
IP6_EXTHDR_GET(hbh, struct ip6_hbh *, m, sizeof(struct ip6_hdr),
|
|
|
|
hbhlen);
|
|
|
|
if (hbh == NULL) {
|
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
off += hbhlen;
|
|
|
|
hbhlen -= sizeof(struct ip6_hbh);
|
|
|
|
opt = (u_int8_t *)hbh + sizeof(struct ip6_hbh);
|
|
|
|
|
|
|
|
if (ip6_process_hopopts(m, (u_int8_t *)hbh + sizeof(struct ip6_hbh),
|
|
|
|
hbhlen, rtalertp, plenp) < 0)
|
|
|
|
return(-1);
|
|
|
|
|
|
|
|
*offp = off;
|
|
|
|
*mp = m;
|
|
|
|
return(0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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().
|
2001-06-11 12:39:29 +00: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-11-22 02:45:11 +00:00
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_process_hopopts(m, opthead, hbhlen, rtalertp, plenp)
|
|
|
|
struct mbuf *m;
|
|
|
|
u_int8_t *opthead;
|
|
|
|
int hbhlen;
|
|
|
|
u_int32_t *rtalertp;
|
|
|
|
u_int32_t *plenp;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
int optlen = 0;
|
|
|
|
u_int8_t *opt = opthead;
|
|
|
|
u_int16_t rtalert_val;
|
2000-07-04 16:35:15 +00:00
|
|
|
u_int32_t jumboplen;
|
2001-06-11 12:39:29 +00:00
|
|
|
const int erroff = sizeof(struct ip6_hdr) + sizeof(struct ip6_hbh);
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
for (; hbhlen > 0; hbhlen -= optlen, opt += optlen) {
|
2001-06-11 12:39:29 +00:00
|
|
|
switch (*opt) {
|
|
|
|
case IP6OPT_PAD1:
|
|
|
|
optlen = 1;
|
|
|
|
break;
|
|
|
|
case IP6OPT_PADN:
|
|
|
|
if (hbhlen < IP6OPT_MINLEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
optlen = *(opt + 1) + 2;
|
|
|
|
break;
|
|
|
|
case IP6OPT_RTALERT:
|
|
|
|
/* XXX may need check for alignment */
|
|
|
|
if (hbhlen < IP6OPT_RTALERT_LEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if (*(opt + 1) != IP6OPT_RTALERT_LEN - 2) {
|
|
|
|
/* XXX stat */
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt + 1 - opthead);
|
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
optlen = IP6OPT_RTALERT_LEN;
|
|
|
|
bcopy((caddr_t)(opt + 2), (caddr_t)&rtalert_val, 2);
|
|
|
|
*rtalertp = ntohs(rtalert_val);
|
|
|
|
break;
|
|
|
|
case IP6OPT_JUMBO:
|
2000-07-04 16:35:15 +00:00
|
|
|
/* XXX may need check for alignment */
|
|
|
|
if (hbhlen < IP6OPT_JUMBO_LEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
if (*(opt + 1) != IP6OPT_JUMBO_LEN - 2) {
|
|
|
|
/* XXX stat */
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
|
|
|
erroff + opt + 1 - opthead);
|
|
|
|
return(-1);
|
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
optlen = IP6OPT_JUMBO_LEN;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
/*
|
|
|
|
* IPv6 packets that have non 0 payload length
|
2001-06-11 12:39:29 +00:00
|
|
|
* must not contain a jumbo payload option.
|
2000-07-04 16:35:15 +00:00
|
|
|
*/
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (ip6->ip6_plen) {
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
2001-06-11 12:39:29 +00:00
|
|
|
erroff + opt - opthead);
|
2000-07-04 16:35:15 +00:00
|
|
|
return(-1);
|
|
|
|
}
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
/*
|
|
|
|
* We may see jumbolen in unaligned location, so
|
|
|
|
* we'd need to perform bcopy().
|
|
|
|
*/
|
|
|
|
bcopy(opt + 2, &jumboplen, sizeof(jumboplen));
|
|
|
|
jumboplen = (u_int32_t)htonl(jumboplen);
|
|
|
|
|
|
|
|
#if 1
|
|
|
|
/*
|
|
|
|
* if there are multiple jumbo payload options,
|
|
|
|
* *plenp will be non-zero and the packet will be
|
|
|
|
* rejected.
|
|
|
|
* the behavior may need some debate in ipngwg -
|
|
|
|
* multiple options does not make sense, however,
|
|
|
|
* there's no explicit mention in specification.
|
|
|
|
*/
|
|
|
|
if (*plenp != 0) {
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
2001-06-11 12:39:29 +00:00
|
|
|
erroff + opt + 2 - opthead);
|
2000-07-04 16:35:15 +00:00
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* jumbo payload length must be larger than 65535.
|
|
|
|
*/
|
|
|
|
if (jumboplen <= IPV6_MAXPACKET) {
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_HEADER,
|
2001-06-11 12:39:29 +00:00
|
|
|
erroff + opt + 2 - opthead);
|
2000-07-04 16:35:15 +00:00
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
*plenp = jumboplen;
|
|
|
|
|
|
|
|
break;
|
2001-06-11 12:39:29 +00:00
|
|
|
default: /* unknown option */
|
|
|
|
if (hbhlen < IP6OPT_MINLEN) {
|
|
|
|
ip6stat.ip6s_toosmall++;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
optlen = ip6_unknown_opt(opt, m,
|
|
|
|
erroff + opt - opthead);
|
|
|
|
if (optlen == -1)
|
|
|
|
return(-1);
|
|
|
|
optlen += 2;
|
|
|
|
break;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return(0);
|
|
|
|
|
|
|
|
bad:
|
|
|
|
m_freem(m);
|
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unknown option processing.
|
|
|
|
* The third argument `off' is the offset from the IPv6 header to the option,
|
|
|
|
* which is necessary if the IPv6 header the and option header and IPv6 header
|
|
|
|
* is not continuous in order to return an ICMPv6 error.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_unknown_opt(optp, m, off)
|
|
|
|
u_int8_t *optp;
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
switch (IP6OPT_TYPE(*optp)) {
|
|
|
|
case IP6OPT_TYPE_SKIP: /* ignore the option */
|
|
|
|
return((int)*(optp + 1));
|
|
|
|
case IP6OPT_TYPE_DISCARD: /* silently discard */
|
|
|
|
m_freem(m);
|
|
|
|
return(-1);
|
|
|
|
case IP6OPT_TYPE_FORCEICMP: /* send ICMP even if multicasted */
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB, ICMP6_PARAMPROB_OPTION, off);
|
|
|
|
return(-1);
|
|
|
|
case IP6OPT_TYPE_ICMP: /* send ICMP if not multicasted */
|
|
|
|
ip6stat.ip6s_badoptions++;
|
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (IN6_IS_ADDR_MULTICAST(&ip6->ip6_dst) ||
|
|
|
|
(m->m_flags & (M_BCAST|M_MCAST)))
|
|
|
|
m_freem(m);
|
|
|
|
else
|
|
|
|
icmp6_error(m, ICMP6_PARAM_PROB,
|
|
|
|
ICMP6_PARAMPROB_OPTION, off);
|
|
|
|
return(-1);
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
m_freem(m); /* XXX: NOTREACHED */
|
|
|
|
return(-1);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2000-07-04 16:35:15 +00:00
|
|
|
* Create the "control" list for this pcb.
|
2001-06-11 12:39:29 +00:00
|
|
|
* The function will not modify mbuf chain at all.
|
2000-07-04 16:35:15 +00:00
|
|
|
*
|
2001-06-11 12:39:29 +00:00
|
|
|
* with KAME mbuf chain restriction:
|
2000-07-04 16:35:15 +00:00
|
|
|
* 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.
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
|
|
|
void
|
|
|
|
ip6_savecontrol(in6p, mp, ip6, m)
|
2001-06-11 12:39:29 +00:00
|
|
|
struct inpcb *in6p;
|
|
|
|
struct mbuf **mp;
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
struct mbuf *m;
|
1999-11-22 02:45:11 +00:00
|
|
|
{
|
2002-05-31 17:56:45 +00:00
|
|
|
#if __FreeBSD_version >= 500000
|
2002-04-01 21:31:13 +00:00
|
|
|
struct thread *td = curthread; /* XXX */
|
|
|
|
#else
|
|
|
|
struct proc *td = curproc; /* XXX */
|
|
|
|
#endif
|
2001-06-11 12:39:29 +00:00
|
|
|
int privileged = 0;
|
|
|
|
int rthdr_exist = 0;
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2002-04-01 21:31:13 +00:00
|
|
|
if (td && !suser(td))
|
2001-06-11 12:39:29 +00:00
|
|
|
privileged++;
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef SO_TIMESTAMP
|
|
|
|
if ((in6p->in6p_socket->so_options & SO_TIMESTAMP) != 0) {
|
1999-11-22 02:45:11 +00:00
|
|
|
struct timeval tv;
|
|
|
|
|
|
|
|
microtime(&tv);
|
|
|
|
*mp = sbcreatecontrol((caddr_t) &tv, sizeof(tv),
|
2001-06-11 12:39:29 +00:00
|
|
|
SCM_TIMESTAMP, SOL_SOCKET);
|
|
|
|
if (*mp) {
|
1999-11-22 02:45:11 +00:00
|
|
|
mp = &(*mp)->m_next;
|
2001-06-11 12:39:29 +00:00
|
|
|
}
|
2002-05-31 11:52:35 +00:00
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/* RFC 2292 sec. 5 */
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((in6p->in6p_flags & IN6P_PKTINFO) != 0) {
|
1999-11-22 02:45:11 +00:00
|
|
|
struct in6_pktinfo pi6;
|
|
|
|
bcopy(&ip6->ip6_dst, &pi6.ipi6_addr, sizeof(struct in6_addr));
|
|
|
|
if (IN6_IS_SCOPE_LINKLOCAL(&pi6.ipi6_addr))
|
|
|
|
pi6.ipi6_addr.s6_addr16[1] = 0;
|
|
|
|
pi6.ipi6_ifindex = (m && m->m_pkthdr.rcvif)
|
|
|
|
? m->m_pkthdr.rcvif->if_index
|
|
|
|
: 0;
|
|
|
|
*mp = sbcreatecontrol((caddr_t) &pi6,
|
|
|
|
sizeof(struct in6_pktinfo), IPV6_PKTINFO,
|
|
|
|
IPPROTO_IPV6);
|
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
if ((in6p->in6p_flags & IN6P_HOPLIMIT) != 0) {
|
1999-11-22 02:45:11 +00:00
|
|
|
int hlim = ip6->ip6_hlim & 0xff;
|
|
|
|
*mp = sbcreatecontrol((caddr_t) &hlim,
|
|
|
|
sizeof(int), IPV6_HOPLIMIT, IPPROTO_IPV6);
|
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IPV6_HOPOPTS socket option. We require super-user privilege
|
|
|
|
* for the option, but it might be too strict, since there might
|
|
|
|
* be some hop-by-hop options which can be returned to normal user.
|
|
|
|
* See RFC 2292 section 6.
|
|
|
|
*/
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((in6p->in6p_flags & IN6P_HOPOPTS) != 0 && privileged) {
|
1999-11-22 02:45:11 +00:00
|
|
|
/*
|
|
|
|
* Check if a hop-by-hop options header is contatined in the
|
|
|
|
* received packet, and if so, store the options as ancillary
|
|
|
|
* data. Note that a hop-by-hop options header must be
|
|
|
|
* just after the IPv6 header, which fact is assured through
|
|
|
|
* the IPv6 input processing.
|
|
|
|
*/
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
if (ip6->ip6_nxt == IPPROTO_HOPOPTS) {
|
2000-07-04 16:35:15 +00:00
|
|
|
struct ip6_hbh *hbh;
|
2001-06-11 12:39:29 +00:00
|
|
|
int hbhlen = 0;
|
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
struct mbuf *ext;
|
|
|
|
#endif
|
2000-07-04 16:35:15 +00:00
|
|
|
|
|
|
|
#ifndef PULLDOWN_TEST
|
|
|
|
hbh = (struct ip6_hbh *)(ip6 + 1);
|
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
|
|
|
#else
|
2001-06-11 12:39:29 +00:00
|
|
|
ext = ip6_pullexthdr(m, sizeof(struct ip6_hdr),
|
|
|
|
ip6->ip6_nxt);
|
|
|
|
if (ext == NULL) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
hbh = mtod(ext, struct ip6_hbh *);
|
2000-07-04 16:35:15 +00:00
|
|
|
hbhlen = (hbh->ip6h_len + 1) << 3;
|
2001-06-11 12:39:29 +00:00
|
|
|
if (hbhlen != ext->m_len) {
|
|
|
|
m_freem(ext);
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00: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.
|
2001-06-11 12:39:29 +00:00
|
|
|
* Note: this constraint is removed in 2292bis.
|
1999-11-22 02:45:11 +00:00
|
|
|
*/
|
2000-07-04 16:35:15 +00:00
|
|
|
*mp = sbcreatecontrol((caddr_t)hbh, hbhlen,
|
1999-11-22 02:45:11 +00:00
|
|
|
IPV6_HOPOPTS, IPPROTO_IPV6);
|
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
m_freem(ext);
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* IPV6_DSTOPTS and IPV6_RTHDR socket options */
|
2001-06-11 12:39:29 +00:00
|
|
|
if ((in6p->in6p_flags & (IN6P_DSTOPTS | IN6P_RTHDRDSTOPTS)) != 0) {
|
|
|
|
int proto, off, nxt;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* go through the header chain to see if a routing header is
|
|
|
|
* contained in the packet. We need this information to store
|
|
|
|
* destination options headers (if any) properly.
|
|
|
|
* XXX: performance issue. We should record this info when
|
|
|
|
* processing extension headers in incoming routine.
|
|
|
|
* (todo) use m_aux?
|
|
|
|
*/
|
|
|
|
proto = IPPROTO_IPV6;
|
|
|
|
off = 0;
|
|
|
|
nxt = -1;
|
|
|
|
while (1) {
|
|
|
|
int newoff;
|
|
|
|
|
|
|
|
newoff = ip6_nexthdr(m, off, proto, &nxt);
|
|
|
|
if (newoff < 0)
|
|
|
|
break;
|
|
|
|
if (newoff < off) /* invalid, check for safety */
|
|
|
|
break;
|
|
|
|
if ((proto = nxt) == IPPROTO_ROUTING) {
|
|
|
|
rthdr_exist = 1;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
off = newoff;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((in6p->in6p_flags &
|
|
|
|
(IN6P_RTHDR | IN6P_DSTOPTS | IN6P_RTHDRDSTOPTS)) != 0) {
|
1999-11-22 02:45:11 +00:00
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
2001-06-11 12:39:29 +00:00
|
|
|
int nxt = ip6->ip6_nxt, off = sizeof(struct ip6_hdr);
|
1999-11-22 02:45:11 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Search for destination options headers or routing
|
|
|
|
* header(s) through the header chain, and stores each
|
|
|
|
* header as ancillary data.
|
|
|
|
* Note that the order of the headers remains in
|
|
|
|
* the chain of ancillary data.
|
|
|
|
*/
|
2001-06-11 12:39:29 +00:00
|
|
|
while (1) { /* is explicit loop prevention necessary? */
|
|
|
|
struct ip6_ext *ip6e = NULL;
|
2000-07-04 16:35:15 +00:00
|
|
|
int elen;
|
2001-06-11 12:39:29 +00:00
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
struct mbuf *ext = NULL;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* 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;
|
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
|
|
|
|
#ifndef PULLDOWN_TEST
|
2001-06-11 12:39:29 +00:00
|
|
|
if (off + sizeof(*ip6e) > m->m_len)
|
|
|
|
goto loopend;
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6e = (struct ip6_ext *)(mtod(m, caddr_t) + off);
|
|
|
|
if (nxt == IPPROTO_AH)
|
|
|
|
elen = (ip6e->ip6e_len + 2) << 2;
|
|
|
|
else
|
|
|
|
elen = (ip6e->ip6e_len + 1) << 3;
|
2001-06-11 12:39:29 +00:00
|
|
|
if (off + elen > m->m_len)
|
|
|
|
goto loopend;
|
2000-07-04 16:35:15 +00:00
|
|
|
#else
|
2001-06-11 12:39:29 +00:00
|
|
|
ext = ip6_pullexthdr(m, off, nxt);
|
|
|
|
if (ext == NULL) {
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
ip6e = mtod(ext, struct ip6_ext *);
|
2000-07-04 16:35:15 +00:00
|
|
|
if (nxt == IPPROTO_AH)
|
|
|
|
elen = (ip6e->ip6e_len + 2) << 2;
|
|
|
|
else
|
|
|
|
elen = (ip6e->ip6e_len + 1) << 3;
|
2001-06-11 12:39:29 +00:00
|
|
|
if (elen != ext->m_len) {
|
|
|
|
m_freem(ext);
|
2000-07-04 16:35:15 +00:00
|
|
|
ip6stat.ip6s_tooshort++;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
switch (nxt) {
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
if ((in6p->in6p_flags & IN6P_DSTOPTS) == 0)
|
|
|
|
break;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We also require super-user privilege for
|
|
|
|
* the option.
|
|
|
|
* See the comments on IN6_HOPOPTS.
|
|
|
|
*/
|
|
|
|
if (!privileged)
|
|
|
|
break;
|
|
|
|
|
|
|
|
*mp = sbcreatecontrol((caddr_t)ip6e, elen,
|
|
|
|
IPV6_DSTOPTS,
|
|
|
|
IPPROTO_IPV6);
|
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
break;
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
if (!in6p->in6p_flags & IN6P_RTHDR)
|
|
|
|
break;
|
|
|
|
|
|
|
|
*mp = sbcreatecontrol((caddr_t)ip6e, elen,
|
|
|
|
IPV6_RTHDR,
|
|
|
|
IPPROTO_IPV6);
|
|
|
|
if (*mp)
|
|
|
|
mp = &(*mp)->m_next;
|
|
|
|
break;
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_AH: /* is it possible? */
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
/*
|
|
|
|
* 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).
|
|
|
|
*/
|
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
m_freem(ext);
|
|
|
|
#endif
|
|
|
|
goto loopend;
|
|
|
|
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* proceed with the next header. */
|
2000-07-04 16:35:15 +00:00
|
|
|
off += elen;
|
1999-11-22 02:45:11 +00:00
|
|
|
nxt = ip6e->ip6e_nxt;
|
2001-06-11 12:39:29 +00:00
|
|
|
ip6e = NULL;
|
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
m_freem(ext);
|
|
|
|
ext = NULL;
|
|
|
|
#endif
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
|
|
|
loopend:
|
2001-06-11 12:39:29 +00:00
|
|
|
;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef PULLDOWN_TEST
|
|
|
|
/*
|
|
|
|
* pull single extension header from mbuf chain. returns single mbuf that
|
|
|
|
* contains the result, or NULL on error.
|
|
|
|
*/
|
|
|
|
static struct mbuf *
|
|
|
|
ip6_pullexthdr(m, off, nxt)
|
|
|
|
struct mbuf *m;
|
|
|
|
size_t off;
|
|
|
|
int nxt;
|
|
|
|
{
|
|
|
|
struct ip6_ext ip6e;
|
|
|
|
size_t elen;
|
|
|
|
struct mbuf *n;
|
|
|
|
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
switch (nxt) {
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_AH: /* is it possible? */
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("ip6_pullexthdr: invalid nxt=%d\n", nxt);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
m_copydata(m, off, sizeof(ip6e), (caddr_t)&ip6e);
|
|
|
|
if (nxt == IPPROTO_AH)
|
|
|
|
elen = (ip6e.ip6e_len + 2) << 2;
|
|
|
|
else
|
|
|
|
elen = (ip6e.ip6e_len + 1) << 3;
|
|
|
|
|
|
|
|
MGET(n, M_DONTWAIT, MT_DATA);
|
|
|
|
if (n && elen >= MLEN) {
|
|
|
|
MCLGET(n, M_DONTWAIT);
|
|
|
|
if ((n->m_flags & M_EXT) == 0) {
|
|
|
|
m_free(n);
|
|
|
|
n = NULL;
|
|
|
|
}
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
if (!n)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
n->m_len = 0;
|
|
|
|
if (elen >= M_TRAILINGSPACE(n)) {
|
|
|
|
m_free(n);
|
|
|
|
return NULL;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
2000-07-04 16:35:15 +00:00
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
m_copydata(m, off, elen, mtod(n, caddr_t));
|
|
|
|
n->m_len = elen;
|
|
|
|
return n;
|
1999-11-22 02:45:11 +00:00
|
|
|
}
|
2001-06-11 12:39:29 +00:00
|
|
|
#endif
|
1999-11-22 02:45:11 +00: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.
|
|
|
|
*/
|
|
|
|
char *
|
|
|
|
ip6_get_prevhdr(m, off)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
{
|
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
|
|
|
|
if (off == sizeof(struct ip6_hdr))
|
|
|
|
return(&ip6->ip6_nxt);
|
|
|
|
else {
|
|
|
|
int len, nxt;
|
|
|
|
struct ip6_ext *ip6e = NULL;
|
|
|
|
|
|
|
|
nxt = ip6->ip6_nxt;
|
|
|
|
len = sizeof(struct ip6_hdr);
|
|
|
|
while (len < off) {
|
|
|
|
ip6e = (struct ip6_ext *)(mtod(m, caddr_t) + len);
|
|
|
|
|
2001-06-11 12:39:29 +00:00
|
|
|
switch (nxt) {
|
1999-11-22 02:45:11 +00: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)
|
|
|
|
return(&ip6e->ip6e_nxt);
|
|
|
|
else
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2000-07-04 16:35:15 +00:00
|
|
|
/*
|
|
|
|
* get next header offset. m will be retained.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_nexthdr(m, off, proto, nxtp)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
int proto;
|
|
|
|
int *nxtp;
|
|
|
|
{
|
|
|
|
struct ip6_hdr ip6;
|
|
|
|
struct ip6_ext ip6e;
|
|
|
|
struct ip6_frag fh;
|
|
|
|
|
|
|
|
/* just in case */
|
|
|
|
if (m == NULL)
|
|
|
|
panic("ip6_nexthdr: m == NULL");
|
|
|
|
if ((m->m_flags & M_PKTHDR) == 0 || m->m_pkthdr.len < off)
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
switch (proto) {
|
|
|
|
case IPPROTO_IPV6:
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(ip6), (caddr_t)&ip6);
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = ip6.ip6_nxt;
|
|
|
|
off += sizeof(ip6);
|
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_FRAGMENT:
|
|
|
|
/*
|
|
|
|
* terminate parsing if it is not the first fragment,
|
|
|
|
* it does not make sense to parse through it.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(fh))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(fh), (caddr_t)&fh);
|
|
|
|
if ((ntohs(fh.ip6f_offlg) & IP6F_OFF_MASK) != 0)
|
|
|
|
return -1;
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = fh.ip6f_nxt;
|
|
|
|
off += sizeof(struct ip6_frag);
|
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_AH:
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6e))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(ip6e), (caddr_t)&ip6e);
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = ip6e.ip6e_nxt;
|
|
|
|
off += (ip6e.ip6e_len + 2) << 2;
|
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_HOPOPTS:
|
|
|
|
case IPPROTO_ROUTING:
|
|
|
|
case IPPROTO_DSTOPTS:
|
|
|
|
if (m->m_pkthdr.len < off + sizeof(ip6e))
|
|
|
|
return -1;
|
|
|
|
m_copydata(m, off, sizeof(ip6e), (caddr_t)&ip6e);
|
|
|
|
if (nxtp)
|
|
|
|
*nxtp = ip6e.ip6e_nxt;
|
|
|
|
off += (ip6e.ip6e_len + 1) << 3;
|
|
|
|
return off;
|
|
|
|
|
|
|
|
case IPPROTO_NONE:
|
|
|
|
case IPPROTO_ESP:
|
|
|
|
case IPPROTO_IPCOMP:
|
|
|
|
/* give up */
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
default:
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* get offset for the last header in the chain. m will be kept untainted.
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_lasthdr(m, off, proto, nxtp)
|
|
|
|
struct mbuf *m;
|
|
|
|
int off;
|
|
|
|
int proto;
|
|
|
|
int *nxtp;
|
|
|
|
{
|
|
|
|
int newoff;
|
|
|
|
int nxt;
|
|
|
|
|
|
|
|
if (!nxtp) {
|
|
|
|
nxt = -1;
|
|
|
|
nxtp = &nxt;
|
|
|
|
}
|
|
|
|
while (1) {
|
|
|
|
newoff = ip6_nexthdr(m, off, proto, nxtp);
|
|
|
|
if (newoff < 0)
|
|
|
|
return off;
|
|
|
|
else if (newoff < off)
|
|
|
|
return -1; /* invalid */
|
|
|
|
else if (newoff == off)
|
|
|
|
return newoff;
|
|
|
|
|
|
|
|
off = newoff;
|
|
|
|
proto = *nxtp;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2002-10-16 01:54:46 +00:00
|
|
|
struct ip6aux *
|
2001-06-11 12:39:29 +00:00
|
|
|
ip6_addaux(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
2002-10-16 01:54:46 +00:00
|
|
|
struct m_tag *tag = m_tag_find(m, PACKET_TAG_IPV6_INPUT, NULL);
|
|
|
|
if (!tag) {
|
|
|
|
tag = m_tag_get(PACKET_TAG_IPV6_INPUT,
|
|
|
|
sizeof (struct ip6aux),
|
2002-12-19 22:58:27 +00:00
|
|
|
M_DONTWAIT);
|
2002-10-16 01:54:46 +00:00
|
|
|
if (tag)
|
|
|
|
m_tag_prepend(m, tag);
|
2001-06-11 12:39:29 +00:00
|
|
|
}
|
2002-10-16 01:54:46 +00:00
|
|
|
if (tag)
|
|
|
|
bzero(tag+1, sizeof (struct ip6aux));
|
|
|
|
return tag ? (struct ip6aux*)(tag+1) : NULL;
|
2001-06-11 12:39:29 +00:00
|
|
|
}
|
|
|
|
|
2002-10-16 01:54:46 +00:00
|
|
|
struct ip6aux *
|
2001-06-11 12:39:29 +00:00
|
|
|
ip6_findaux(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
2002-10-16 01:54:46 +00:00
|
|
|
struct m_tag *tag = m_tag_find(m, PACKET_TAG_IPV6_INPUT, NULL);
|
|
|
|
return tag ? (struct ip6aux*)(tag+1) : NULL;
|
2001-06-11 12:39:29 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
ip6_delaux(m)
|
|
|
|
struct mbuf *m;
|
|
|
|
{
|
2002-10-16 01:54:46 +00:00
|
|
|
struct m_tag *tag = m_tag_find(m, PACKET_TAG_IPV6_INPUT, NULL);
|
|
|
|
if (tag)
|
|
|
|
m_tag_delete(m, tag);
|
2001-06-11 12:39:29 +00:00
|
|
|
}
|
|
|
|
|
1999-11-22 02:45:11 +00: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
|
|
|
|
};
|