2007-11-28 01:45:29 +03:00
|
|
|
/* $NetBSD: ip6_mroute.c,v 1.86 2007/11/27 22:45:30 christos Exp $ */
|
2001-07-25 13:23:46 +04:00
|
|
|
/* $KAME: ip6_mroute.c,v 1.49 2001/07/25 09:21:18 jinmei Exp $ */
|
1999-07-04 01:24:45 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2000-05-19 14:39:43 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2000-05-19 14:39:43 +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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* BSDI ip_mroute.c,v 2.10 1996/11/14 00:29:52 jch Exp */
|
|
|
|
|
2002-11-27 08:09:36 +03:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Stephen Deering of Stanford University.
|
|
|
|
*
|
|
|
|
* 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
|
|
|
|
* 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_mroute.c 8.2 (Berkeley) 11/15/93
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1989 Stephen Deering
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Stephen Deering of Stanford University.
|
|
|
|
*
|
|
|
|
* 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.
|
2002-11-27 08:09:36 +03:00
|
|
|
* 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_mroute.c 8.2 (Berkeley) 11/15/93
|
|
|
|
*/
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* IP multicast forwarding procedures
|
|
|
|
*
|
|
|
|
* Written by David Waitzman, BBN Labs, August 1988.
|
|
|
|
* Modified by Steve Deering, Stanford, February 1989.
|
|
|
|
* Modified by Mark J. Steiglitz, Stanford, May, 1991
|
|
|
|
* Modified by Van Jacobson, LBL, January 1993
|
|
|
|
* Modified by Ajit Thyagarajan, PARC, August 1993
|
2002-06-29 16:33:33 +04:00
|
|
|
* Modified by Bill Fenner, PARC, April 1994
|
1999-06-28 10:36:47 +04:00
|
|
|
*
|
|
|
|
* MROUTING Revision: 3.5.1.2 + PIM-SMv2 (pimd) Support
|
|
|
|
*/
|
|
|
|
|
2001-11-13 03:56:55 +03:00
|
|
|
#include <sys/cdefs.h>
|
2007-11-28 01:45:29 +03:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: ip6_mroute.c,v 1.86 2007/11/27 22:45:30 christos Exp $");
|
2001-11-13 03:56:55 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#include "opt_inet.h"
|
2003-06-23 15:00:59 +04:00
|
|
|
#include "opt_mrouting.h"
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/systm.h>
|
2000-03-23 10:01:25 +03:00
|
|
|
#include <sys/callout.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/sockio.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/time.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/ioctl.h>
|
2005-08-29 01:03:18 +04:00
|
|
|
#include <sys/sysctl.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <sys/syslog.h>
|
|
|
|
|
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
|
|
|
#include <net/raw_cb.h>
|
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
2002-11-09 06:12:05 +03:00
|
|
|
#include <netinet/icmp6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-02-06 15:49:37 +03:00
|
|
|
#include <netinet/ip6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netinet6/ip6_var.h>
|
|
|
|
#include <netinet6/ip6_mroute.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/pim6.h>
|
|
|
|
#include <netinet6/pim6_var.h>
|
2002-05-29 11:53:39 +04:00
|
|
|
#include <netinet6/nd6.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-08-29 13:19:43 +04:00
|
|
|
#include <net/net_osdep.h>
|
|
|
|
|
2007-11-01 23:33:56 +03:00
|
|
|
static int ip6_mdq(struct mbuf *, struct ifnet *, struct mf6c *);
|
|
|
|
static void phyint_send(struct ip6_hdr *, struct mif6 *, struct mbuf *);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-11-01 23:33:56 +03:00
|
|
|
static int set_pim6(int *);
|
|
|
|
static int get_pim6(struct mbuf *);
|
|
|
|
static int socket_send(struct socket *, struct mbuf *,
|
|
|
|
struct sockaddr_in6 *);
|
|
|
|
static int register_send(struct ip6_hdr *, struct mif6 *, struct mbuf *);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Globals. All but ip6_mrouter, ip6_mrtproto and mrt6stat could be static,
|
|
|
|
* except for netstat or debugging purposes.
|
|
|
|
*/
|
2002-05-30 08:39:15 +04:00
|
|
|
struct socket *ip6_mrouter = NULL;
|
2000-05-19 14:39:43 +04:00
|
|
|
int ip6_mrouter_ver = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
int ip6_mrtproto = IPPROTO_PIM; /* for netstat only */
|
|
|
|
struct mrt6stat mrt6stat;
|
|
|
|
|
|
|
|
#define NO_RTE_FOUND 0x1
|
|
|
|
#define RTE_FOUND 0x2
|
|
|
|
|
|
|
|
struct mf6c *mf6ctable[MF6CTBLSIZ];
|
2002-05-30 08:39:15 +04:00
|
|
|
u_char n6expire[MF6CTBLSIZ];
|
2005-10-21 22:00:45 +04:00
|
|
|
struct mif6 mif6table[MAXMIFS];
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
u_int mrt6debug = 0; /* debug level */
|
2003-07-12 19:16:50 +04:00
|
|
|
#define DEBUG_MFC 0x02
|
|
|
|
#define DEBUG_FORWARD 0x04
|
|
|
|
#define DEBUG_EXPIRE 0x08
|
|
|
|
#define DEBUG_XMIT 0x10
|
|
|
|
#define DEBUG_REG 0x20
|
|
|
|
#define DEBUG_PIM 0x40
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
|
|
|
|
2007-11-01 23:33:56 +03:00
|
|
|
static void expire_upcalls(void *);
|
2003-07-12 19:16:50 +04:00
|
|
|
#define EXPIRE_TIMEOUT (hz / 4) /* 4x / second */
|
|
|
|
#define UPCALL_EXPIRE 6 /* number of timeouts */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef INET
|
|
|
|
#ifdef MROUTING
|
|
|
|
extern struct socket *ip_mrouter;
|
|
|
|
#endif
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 'Interfaces' associated with decapsulator (so we can tell
|
|
|
|
* packets that went through it from ones that get reflected
|
|
|
|
* by a broken gateway). These interfaces are never linked into
|
|
|
|
* the system ifnet list & no routes point to them. I.e., packets
|
|
|
|
* can't be sent this way. They only exist as a placeholder for
|
|
|
|
* multicast source verification.
|
|
|
|
*/
|
2005-10-17 19:56:43 +04:00
|
|
|
struct ifnet multicast_register_if6;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#define ENCAP_HOPS 64
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Private variables.
|
|
|
|
*/
|
|
|
|
static mifi_t nummifs = 0;
|
|
|
|
static mifi_t reg_mif_num = (mifi_t)-1;
|
|
|
|
|
2004-09-05 03:29:44 +04:00
|
|
|
struct pim6stat pim6stat;
|
1999-06-28 10:36:47 +04:00
|
|
|
static int pim6;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Hash function for a source, group entry
|
|
|
|
*/
|
|
|
|
#define MF6CHASH(a, g) MF6CHASHMOD((a).s6_addr32[0] ^ (a).s6_addr32[1] ^ \
|
|
|
|
(a).s6_addr32[2] ^ (a).s6_addr32[3] ^ \
|
|
|
|
(g).s6_addr32[0] ^ (g).s6_addr32[1] ^ \
|
|
|
|
(g).s6_addr32[2] ^ (g).s6_addr32[3])
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find a route for a given origin IPv6 address and Multicast group address.
|
|
|
|
* Quality of service parameter to be added in the future!!!
|
|
|
|
*/
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
#define MF6CFIND(o, g, rt) do { \
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mf6c *_rt = mf6ctable[MF6CHASH(o,g)]; \
|
1999-06-28 10:36:47 +04:00
|
|
|
rt = NULL; \
|
|
|
|
mrt6stat.mrt6s_mfc_lookups++; \
|
|
|
|
while (_rt) { \
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&_rt->mf6c_origin.sin6_addr, &(o)) && \
|
|
|
|
IN6_ARE_ADDR_EQUAL(&_rt->mf6c_mcastgrp.sin6_addr, &(g)) && \
|
|
|
|
(_rt->mf6c_stall == NULL)) { \
|
|
|
|
rt = _rt; \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
_rt = _rt->mf6c_next; \
|
|
|
|
} \
|
|
|
|
if (rt == NULL) { \
|
|
|
|
mrt6stat.mrt6s_mfc_misses++; \
|
|
|
|
} \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Macros to compute elapsed time efficiently
|
|
|
|
* Borrowed from Van Jacobson's scheduling code
|
|
|
|
*/
|
2000-05-19 14:39:43 +04:00
|
|
|
#define TV_DELTA(a, b, delta) do { \
|
2001-02-10 05:19:57 +03:00
|
|
|
int xxs; \
|
1999-06-28 10:36:47 +04:00
|
|
|
\
|
|
|
|
delta = (a).tv_usec - (b).tv_usec; \
|
|
|
|
if ((xxs = (a).tv_sec - (b).tv_sec)) { \
|
|
|
|
switch (xxs) { \
|
|
|
|
case 2: \
|
|
|
|
delta += 1000000; \
|
2002-06-07 08:18:11 +04:00
|
|
|
/* FALLTHROUGH */ \
|
1999-06-28 10:36:47 +04:00
|
|
|
case 1: \
|
|
|
|
delta += 1000000; \
|
|
|
|
break; \
|
|
|
|
default: \
|
|
|
|
delta += (1000000 * xxs); \
|
|
|
|
} \
|
|
|
|
} \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#define TV_LT(a, b) (((a).tv_usec < (b).tv_usec && \
|
|
|
|
(a).tv_sec <= (b).tv_sec) || (a).tv_sec < (b).tv_sec)
|
|
|
|
|
|
|
|
#ifdef UPCALL_TIMING
|
1999-07-22 19:46:13 +04:00
|
|
|
#define UPCALL_MAX 50
|
|
|
|
u_long upcall_data[UPCALL_MAX + 1];
|
1999-06-28 10:36:47 +04:00
|
|
|
static void collate();
|
|
|
|
#endif /* UPCALL_TIMING */
|
|
|
|
|
2007-11-01 23:33:56 +03:00
|
|
|
static int get_sg_cnt(struct sioc_sg_req6 *);
|
|
|
|
static int get_mif6_cnt(struct sioc_mif_req6 *);
|
|
|
|
static int ip6_mrouter_init(struct socket *, int, int);
|
|
|
|
static int add_m6if(struct mif6ctl *);
|
|
|
|
static int del_m6if(mifi_t *);
|
|
|
|
static int add_m6fc(struct mf6cctl *);
|
|
|
|
static int del_m6fc(struct mf6cctl *);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-07-10 00:51:58 +04:00
|
|
|
static callout_t expire_upcalls_ch;
|
2000-03-23 10:01:25 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Handle MRT setsockopt commands to modify the multicast routing tables.
|
|
|
|
*/
|
|
|
|
int
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_mrouter_set(int cmd, struct socket *so, struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
if (cmd != MRT6_INIT && so != ip6_mrouter)
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EACCES);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
switch (cmd) {
|
2003-12-10 12:28:38 +03:00
|
|
|
#ifdef MRT6_OINIT
|
|
|
|
case MRT6_OINIT:
|
|
|
|
#endif
|
|
|
|
case MRT6_INIT:
|
2007-11-28 01:45:29 +03:00
|
|
|
if (m == NULL || m->m_len != sizeof(int))
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EINVAL);
|
|
|
|
return (ip6_mrouter_init(so, *mtod(m, int *), cmd));
|
|
|
|
case MRT6_DONE:
|
|
|
|
return (ip6_mrouter_done());
|
|
|
|
case MRT6_ADD_MIF:
|
2007-11-28 01:45:29 +03:00
|
|
|
if (m == NULL || m->m_len != sizeof(struct mif6ctl))
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EINVAL);
|
|
|
|
return (add_m6if(mtod(m, struct mif6ctl *)));
|
|
|
|
case MRT6_DEL_MIF:
|
2007-11-28 01:45:29 +03:00
|
|
|
if (m == NULL || m->m_len != sizeof(mifi_t))
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EINVAL);
|
|
|
|
return (del_m6if(mtod(m, mifi_t *)));
|
|
|
|
case MRT6_ADD_MFC:
|
2007-11-28 01:45:29 +03:00
|
|
|
if (m == NULL || m->m_len != sizeof(struct mf6cctl))
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EINVAL);
|
|
|
|
return (add_m6fc(mtod(m, struct mf6cctl *)));
|
|
|
|
case MRT6_DEL_MFC:
|
2007-11-28 01:45:29 +03:00
|
|
|
if (m == NULL || m->m_len != sizeof(struct mf6cctl))
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EINVAL);
|
|
|
|
return (del_m6fc(mtod(m, struct mf6cctl *)));
|
|
|
|
case MRT6_PIM:
|
2007-11-28 01:45:29 +03:00
|
|
|
if (m == NULL || m->m_len != sizeof(int))
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EINVAL);
|
|
|
|
return (set_pim6(mtod(m, int *)));
|
|
|
|
default:
|
|
|
|
return (EOPNOTSUPP);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle MRT getsockopt commands
|
|
|
|
*/
|
|
|
|
int
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_mrouter_get(int cmd, struct socket *so, struct mbuf **m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct mbuf *mb;
|
|
|
|
|
|
|
|
if (so != ip6_mrouter) return EACCES;
|
|
|
|
|
|
|
|
*m = mb = m_get(M_WAIT, MT_SOOPTS);
|
|
|
|
|
|
|
|
switch (cmd) {
|
2001-10-16 10:24:44 +04:00
|
|
|
case MRT6_PIM:
|
|
|
|
return get_pim6(mb);
|
|
|
|
default:
|
|
|
|
m_free(mb);
|
|
|
|
return EOPNOTSUPP;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Handle ioctl commands to obtain information from the cache
|
|
|
|
*/
|
|
|
|
int
|
2007-05-23 21:14:59 +04:00
|
|
|
mrt6_ioctl(int cmd, void *data)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-10-16 10:24:44 +04:00
|
|
|
|
|
|
|
switch (cmd) {
|
|
|
|
case SIOCGETSGCNT_IN6:
|
2002-09-11 06:46:42 +04:00
|
|
|
return (get_sg_cnt((struct sioc_sg_req6 *)data));
|
2001-10-16 10:24:44 +04:00
|
|
|
case SIOCGETMIFCNT_IN6:
|
2002-09-11 06:46:42 +04:00
|
|
|
return (get_mif6_cnt((struct sioc_mif_req6 *)data));
|
2001-10-16 10:24:44 +04:00
|
|
|
default:
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* returns the packet, byte, rpf-failure count for the source group provided
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
get_sg_cnt(struct sioc_sg_req6 *req)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mf6c *rt;
|
1999-06-28 10:36:47 +04:00
|
|
|
int s;
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
MF6CFIND(req->src.sin6_addr, req->grp.sin6_addr, rt);
|
|
|
|
splx(s);
|
|
|
|
if (rt != NULL) {
|
|
|
|
req->pktcnt = rt->mf6c_pkt_cnt;
|
|
|
|
req->bytecnt = rt->mf6c_byte_cnt;
|
|
|
|
req->wrong_if = rt->mf6c_wrong_if;
|
|
|
|
} else
|
2002-09-11 06:46:42 +04:00
|
|
|
return (ESRCH);
|
1999-06-28 10:36:47 +04:00
|
|
|
#if 0
|
|
|
|
req->pktcnt = req->bytecnt = req->wrong_if = 0xffffffff;
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* returns the input and output packet and byte counts on the mif provided
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
get_mif6_cnt(struct sioc_mif_req6 *req)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
mifi_t mifi = req->mifi;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (mifi >= nummifs)
|
|
|
|
return EINVAL;
|
|
|
|
|
|
|
|
req->icount = mif6table[mifi].m6_pkt_in;
|
|
|
|
req->ocount = mif6table[mifi].m6_pkt_out;
|
|
|
|
req->ibytes = mif6table[mifi].m6_bytes_in;
|
|
|
|
req->obytes = mif6table[mifi].m6_bytes_out;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get PIM processiong global
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
get_pim6(struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
int *i;
|
|
|
|
|
|
|
|
i = mtod(m, int *);
|
|
|
|
|
|
|
|
*i = pim6;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
set_pim6(int *i)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
if ((*i != 1) && (*i != 0))
|
|
|
|
return EINVAL;
|
|
|
|
|
|
|
|
pim6 = *i;
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Enable multicast routing
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_mrouter_init(struct socket *so, int v, int cmd)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"ip6_mrouter_init: so_type = %d, pr_protocol = %d\n",
|
|
|
|
so->so_type, so->so_proto->pr_protocol);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (so->so_type != SOCK_RAW ||
|
|
|
|
so->so_proto->pr_protocol != IPPROTO_ICMPV6)
|
2003-12-10 12:28:38 +03:00
|
|
|
return (EOPNOTSUPP);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-12-10 12:28:38 +03:00
|
|
|
if (v != 1)
|
|
|
|
return (ENOPROTOOPT);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-12-10 12:28:38 +03:00
|
|
|
if (ip6_mrouter != NULL)
|
|
|
|
return (EADDRINUSE);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
ip6_mrouter = so;
|
2000-05-19 14:39:43 +04:00
|
|
|
ip6_mrouter_ver = cmd;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)mf6ctable, sizeof(mf6ctable));
|
|
|
|
bzero((void *)n6expire, sizeof(n6expire));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
pim6 = 0;/* used for stubbing out/in pim stuff */
|
|
|
|
|
2007-07-10 00:51:58 +04:00
|
|
|
callout_init(&expire_upcalls_ch, 0);
|
2000-03-23 10:01:25 +03:00
|
|
|
callout_reset(&expire_upcalls_ch, EXPIRE_TIMEOUT,
|
|
|
|
expire_upcalls, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_DEBUG, "ip6_mrouter_init\n");
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Disable multicast routing
|
|
|
|
*/
|
|
|
|
int
|
|
|
|
ip6_mrouter_done()
|
|
|
|
{
|
|
|
|
mifi_t mifi;
|
|
|
|
int i;
|
|
|
|
struct ifnet *ifp;
|
|
|
|
struct in6_ifreq ifr;
|
|
|
|
struct mf6c *rt;
|
|
|
|
struct rtdetq *rte;
|
|
|
|
int s;
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* For each phyint in use, disable promiscuous reception of all IPv6
|
|
|
|
* multicasts.
|
|
|
|
*/
|
|
|
|
#ifdef INET
|
|
|
|
#ifdef MROUTING
|
|
|
|
/*
|
|
|
|
* If there is still IPv4 multicast routing daemon,
|
|
|
|
* we remain interfaces to receive all muliticasted packets.
|
|
|
|
* XXX: there may be an interface in which the IPv4 multicast
|
|
|
|
* daemon is not interested...
|
|
|
|
*/
|
|
|
|
if (!ip_mrouter)
|
|
|
|
#endif
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
for (mifi = 0; mifi < nummifs; mifi++) {
|
|
|
|
if (mif6table[mifi].m6_ifp &&
|
|
|
|
!(mif6table[mifi].m6_flags & MIFF_REGISTER)) {
|
|
|
|
ifr.ifr_addr.sin6_family = AF_INET6;
|
|
|
|
ifr.ifr_addr.sin6_addr= in6addr_any;
|
|
|
|
ifp = mif6table[mifi].m6_ifp;
|
|
|
|
(*ifp->if_ioctl)(ifp, SIOCDELMULTI,
|
2007-03-04 08:59:00 +03:00
|
|
|
(void *)&ifr);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#ifdef notyet
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)qtable, sizeof(qtable));
|
|
|
|
bzero((void *)tbftable, sizeof(tbftable));
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)mif6table, sizeof(mif6table));
|
1999-06-28 10:36:47 +04:00
|
|
|
nummifs = 0;
|
|
|
|
|
|
|
|
pim6 = 0; /* used to stub out/in pim specific code */
|
|
|
|
|
2000-03-23 10:01:25 +03:00
|
|
|
callout_stop(&expire_upcalls_ch);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Free all multicast forwarding cache entries.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < MF6CTBLSIZ; i++) {
|
|
|
|
rt = mf6ctable[i];
|
|
|
|
while (rt) {
|
|
|
|
struct mf6c *frt;
|
|
|
|
|
|
|
|
for (rte = rt->mf6c_stall; rte != NULL; ) {
|
|
|
|
struct rtdetq *n = rte->next;
|
|
|
|
|
|
|
|
m_free(rte->m);
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
rte = n;
|
|
|
|
}
|
|
|
|
frt = rt;
|
|
|
|
rt = rt->mf6c_next;
|
|
|
|
free(frt, M_MRTABLE);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)mf6ctable, sizeof(mf6ctable));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
2005-10-17 19:56:43 +04:00
|
|
|
* Reset register interface
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2005-10-17 19:56:43 +04:00
|
|
|
if (reg_mif_num != (mifi_t)-1) {
|
|
|
|
if_detach(&multicast_register_if6);
|
|
|
|
reg_mif_num = (mifi_t)-1;
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6_mrouter = NULL;
|
2000-05-19 14:39:43 +04:00
|
|
|
ip6_mrouter_ver = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_DEBUG, "ip6_mrouter_done\n");
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2003-07-08 14:20:45 +04:00
|
|
|
void
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_mrouter_detach(struct ifnet *ifp)
|
2003-07-08 14:20:45 +04:00
|
|
|
{
|
|
|
|
struct rtdetq *rte;
|
|
|
|
struct mf6c *mfc;
|
|
|
|
mifi_t mifi;
|
|
|
|
int i;
|
|
|
|
|
2006-03-06 02:47:08 +03:00
|
|
|
if (ip6_mrouter == NULL)
|
|
|
|
return;
|
|
|
|
|
2003-07-08 14:20:45 +04:00
|
|
|
/*
|
|
|
|
* Delete a mif which points to ifp.
|
|
|
|
*/
|
|
|
|
for (mifi = 0; mifi < nummifs; mifi++)
|
|
|
|
if (mif6table[mifi].m6_ifp == ifp)
|
|
|
|
del_m6if(&mifi);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clear rte->ifp of cache entries received on ifp.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < MF6CTBLSIZ; i++) {
|
|
|
|
if (n6expire[i] == 0)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
for (mfc = mf6ctable[i]; mfc != NULL; mfc = mfc->mf6c_next) {
|
|
|
|
for (rte = mfc->mf6c_stall; rte != NULL; rte = rte->next) {
|
|
|
|
if (rte->ifp == ifp)
|
|
|
|
rte->ifp = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Add a mif to the mif table
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
add_m6if(struct mif6ctl *mifcp)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mif6 *mifp;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct in6_ifreq ifr;
|
|
|
|
int error, s;
|
|
|
|
#ifdef notyet
|
|
|
|
struct tbf *m_tbf = tbftable + mifcp->mif6c_mifi;
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (mifcp->mif6c_mifi >= MAXMIFS)
|
|
|
|
return EINVAL;
|
|
|
|
mifp = mif6table + mifcp->mif6c_mifi;
|
|
|
|
if (mifp->m6_ifp)
|
|
|
|
return EADDRINUSE; /* XXX: is it appropriate? */
|
2004-12-21 14:40:12 +03:00
|
|
|
if (mifcp->mif6c_pifi == 0 || mifcp->mif6c_pifi >= if_indexlim)
|
1999-06-28 10:36:47 +04:00
|
|
|
return ENXIO;
|
2001-07-25 13:23:46 +04:00
|
|
|
/*
|
|
|
|
* XXX: some OSes can remove ifp and clear ifindex2ifnet[id]
|
|
|
|
* even for id between 0 and if_index.
|
|
|
|
*/
|
|
|
|
if ((ifp = ifindex2ifnet[mifcp->mif6c_pifi]) == NULL)
|
|
|
|
return ENXIO;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (mifcp->mif6c_flags & MIFF_REGISTER) {
|
2005-10-17 19:56:43 +04:00
|
|
|
ifp = &multicast_register_if6;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (reg_mif_num == (mifi_t)-1) {
|
2005-10-17 19:56:43 +04:00
|
|
|
strlcpy(ifp->if_xname, "register_mif",
|
|
|
|
sizeof(ifp->if_xname));
|
|
|
|
ifp->if_flags |= IFF_LOOPBACK;
|
|
|
|
ifp->if_index = mifcp->mif6c_mifi;
|
1999-06-28 10:36:47 +04:00
|
|
|
reg_mif_num = mifcp->mif6c_mifi;
|
2005-10-17 19:56:43 +04:00
|
|
|
if_attach(ifp);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
} /* if REGISTER */
|
|
|
|
else {
|
|
|
|
/* Make sure the interface supports multicast */
|
|
|
|
if ((ifp->if_flags & IFF_MULTICAST) == 0)
|
|
|
|
return EOPNOTSUPP;
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Enable promiscuous reception of all IPv6 multicasts
|
1999-12-13 18:17:17 +03:00
|
|
|
* from the interface.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
ifr.ifr_addr.sin6_family = AF_INET6;
|
|
|
|
ifr.ifr_addr.sin6_addr = in6addr_any;
|
2007-03-04 08:59:00 +03:00
|
|
|
error = (*ifp->if_ioctl)(ifp, SIOCADDMULTI, (void *)&ifr);
|
1999-06-28 10:36:47 +04:00
|
|
|
splx(s);
|
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
}
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
mifp->m6_flags = mifcp->mif6c_flags;
|
|
|
|
mifp->m6_ifp = ifp;
|
|
|
|
#ifdef notyet
|
|
|
|
/* scaling up here allows division by 1024 in critical code */
|
|
|
|
mifp->m6_rate_limit = mifcp->mif6c_rate_limit * 1024 / 1000;
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
/* initialize per mif pkt counters */
|
|
|
|
mifp->m6_pkt_in = 0;
|
|
|
|
mifp->m6_pkt_out = 0;
|
|
|
|
mifp->m6_bytes_in = 0;
|
|
|
|
mifp->m6_bytes_out = 0;
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
/* Adjust nummifs up if the mifi is higher than nummifs */
|
|
|
|
if (nummifs <= mifcp->mif6c_mifi)
|
|
|
|
nummifs = mifcp->mif6c_mifi + 1;
|
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_DEBUG,
|
2006-08-17 21:11:27 +04:00
|
|
|
"add_mif #%d, phyint %s\n",
|
|
|
|
mifcp->mif6c_mifi, ifp->if_xname);
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Delete a mif from the mif table
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
del_m6if(mifi_t *mifip)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mif6 *mifp = mif6table + *mifip;
|
|
|
|
mifi_t mifi;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct in6_ifreq ifr;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
if (*mifip >= nummifs)
|
|
|
|
return EINVAL;
|
|
|
|
if (mifp->m6_ifp == NULL)
|
|
|
|
return EINVAL;
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (!(mifp->m6_flags & MIFF_REGISTER)) {
|
|
|
|
/*
|
|
|
|
* XXX: what if there is yet IPv4 multicast daemon
|
|
|
|
* using the interface?
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
ifp = mifp->m6_ifp;
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
ifr.ifr_addr.sin6_family = AF_INET6;
|
|
|
|
ifr.ifr_addr.sin6_addr = in6addr_any;
|
2007-03-04 08:59:00 +03:00
|
|
|
(*ifp->if_ioctl)(ifp, SIOCDELMULTI, (void *)&ifr);
|
2005-10-17 19:56:43 +04:00
|
|
|
} else {
|
|
|
|
if (reg_mif_num != (mifi_t)-1) {
|
|
|
|
if_detach(&multicast_register_if6);
|
|
|
|
reg_mif_num = (mifi_t)-1;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef notyet
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)qtable[*mifip], sizeof(qtable[*mifip]));
|
|
|
|
bzero((void *)mifp->m6_tbf, sizeof(*(mifp->m6_tbf)));
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
2007-03-04 08:59:00 +03:00
|
|
|
bzero((void *)mifp, sizeof (*mifp));
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* Adjust nummifs down */
|
|
|
|
for (mifi = nummifs; mifi > 0; mifi--)
|
|
|
|
if (mif6table[mifi - 1].m6_ifp)
|
|
|
|
break;
|
|
|
|
nummifs = mifi;
|
|
|
|
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_DEBUG, "del_m6if %d, nummifs %d\n", *mifip, nummifs);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Add an mfc entry
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
add_m6fc(struct mf6cctl *mfccp)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct mf6c *rt;
|
|
|
|
u_long hash;
|
|
|
|
struct rtdetq *rte;
|
2001-02-10 05:19:57 +03:00
|
|
|
u_short nstl;
|
1999-06-28 10:36:47 +04:00
|
|
|
int s;
|
|
|
|
|
|
|
|
MF6CFIND(mfccp->mf6cc_origin.sin6_addr,
|
|
|
|
mfccp->mf6cc_mcastgrp.sin6_addr, rt);
|
|
|
|
|
|
|
|
/* If an entry already exists, just update the fields */
|
|
|
|
if (rt) {
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_MFC)
|
|
|
|
log(LOG_DEBUG,"add_m6fc update o %s g %s p %x\n",
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_origin.sin6_addr),
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_mcastgrp.sin6_addr),
|
|
|
|
mfccp->mf6cc_parent);
|
|
|
|
#endif
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
rt->mf6c_parent = mfccp->mf6cc_parent;
|
|
|
|
rt->mf6c_ifset = mfccp->mf6cc_ifset;
|
|
|
|
splx(s);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
/*
|
1999-06-28 10:36:47 +04:00
|
|
|
* Find the entry for which the upcall was made and update
|
|
|
|
*/
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
hash = MF6CHASH(mfccp->mf6cc_origin.sin6_addr,
|
|
|
|
mfccp->mf6cc_mcastgrp.sin6_addr);
|
|
|
|
for (rt = mf6ctable[hash], nstl = 0; rt; rt = rt->mf6c_next) {
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&rt->mf6c_origin.sin6_addr,
|
|
|
|
&mfccp->mf6cc_origin.sin6_addr) &&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&rt->mf6c_mcastgrp.sin6_addr,
|
|
|
|
&mfccp->mf6cc_mcastgrp.sin6_addr) &&
|
|
|
|
(rt->mf6c_stall != NULL)) {
|
|
|
|
|
|
|
|
if (nstl++)
|
|
|
|
log(LOG_ERR,
|
1999-07-06 12:55:56 +04:00
|
|
|
"add_m6fc: %s o %s g %s p %x dbx %p\n",
|
1999-06-28 10:36:47 +04:00
|
|
|
"multiple kernel entries",
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_origin.sin6_addr),
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_mcastgrp.sin6_addr),
|
1999-07-06 12:55:56 +04:00
|
|
|
mfccp->mf6cc_parent, rt->mf6c_stall);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_MFC)
|
|
|
|
log(LOG_DEBUG,
|
2006-08-17 21:11:27 +04:00
|
|
|
"add_m6fc o %s g %s p %x dbg %p\n",
|
1999-06-28 10:36:47 +04:00
|
|
|
ip6_sprintf(&mfccp->mf6cc_origin.sin6_addr),
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_mcastgrp.sin6_addr),
|
|
|
|
mfccp->mf6cc_parent, rt->mf6c_stall);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
rt->mf6c_origin = mfccp->mf6cc_origin;
|
|
|
|
rt->mf6c_mcastgrp = mfccp->mf6cc_mcastgrp;
|
|
|
|
rt->mf6c_parent = mfccp->mf6cc_parent;
|
|
|
|
rt->mf6c_ifset = mfccp->mf6cc_ifset;
|
|
|
|
/* initialize pkt counters per src-grp */
|
|
|
|
rt->mf6c_pkt_cnt = 0;
|
|
|
|
rt->mf6c_byte_cnt = 0;
|
|
|
|
rt->mf6c_wrong_if = 0;
|
|
|
|
|
|
|
|
rt->mf6c_expire = 0; /* Don't clean this guy up */
|
2002-05-30 08:39:15 +04:00
|
|
|
n6expire[hash]--;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* free packets Qed at the end of this entry */
|
|
|
|
for (rte = rt->mf6c_stall; rte != NULL; ) {
|
|
|
|
struct rtdetq *n = rte->next;
|
2003-07-08 14:20:45 +04:00
|
|
|
if (rte->ifp) {
|
|
|
|
ip6_mdq(rte->m, rte->ifp, rt);
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(rte->m);
|
|
|
|
#ifdef UPCALL_TIMING
|
|
|
|
collate(&(rte->t));
|
|
|
|
#endif /* UPCALL_TIMING */
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
rte = n;
|
|
|
|
}
|
|
|
|
rt->mf6c_stall = NULL;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* It is possible that an entry is being inserted without an upcall
|
|
|
|
*/
|
|
|
|
if (nstl == 0) {
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_MFC)
|
2002-05-30 08:39:15 +04:00
|
|
|
log(LOG_DEBUG,
|
2006-08-17 21:11:27 +04:00
|
|
|
"add_mfc no upcall h %ld o %s g %s p %x\n",
|
1999-06-28 10:36:47 +04:00
|
|
|
hash,
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_origin.sin6_addr),
|
|
|
|
ip6_sprintf(&mfccp->mf6cc_mcastgrp.sin6_addr),
|
|
|
|
mfccp->mf6cc_parent);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
for (rt = mf6ctable[hash]; rt; rt = rt->mf6c_next) {
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (IN6_ARE_ADDR_EQUAL(&rt->mf6c_origin.sin6_addr,
|
|
|
|
&mfccp->mf6cc_origin.sin6_addr)&&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&rt->mf6c_mcastgrp.sin6_addr,
|
|
|
|
&mfccp->mf6cc_mcastgrp.sin6_addr)) {
|
|
|
|
|
|
|
|
rt->mf6c_origin = mfccp->mf6cc_origin;
|
|
|
|
rt->mf6c_mcastgrp = mfccp->mf6cc_mcastgrp;
|
|
|
|
rt->mf6c_parent = mfccp->mf6cc_parent;
|
2000-10-19 07:15:48 +04:00
|
|
|
rt->mf6c_ifset = mfccp->mf6cc_ifset;
|
1999-06-28 10:36:47 +04:00
|
|
|
/* initialize pkt counters per src-grp */
|
|
|
|
rt->mf6c_pkt_cnt = 0;
|
|
|
|
rt->mf6c_byte_cnt = 0;
|
|
|
|
rt->mf6c_wrong_if = 0;
|
|
|
|
|
|
|
|
if (rt->mf6c_expire)
|
2002-05-30 08:39:15 +04:00
|
|
|
n6expire[hash]--;
|
1999-06-28 10:36:47 +04:00
|
|
|
rt->mf6c_expire = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (rt == NULL) {
|
|
|
|
/* no upcall, so make a new entry */
|
|
|
|
rt = (struct mf6c *)malloc(sizeof(*rt), M_MRTABLE,
|
|
|
|
M_NOWAIT);
|
|
|
|
if (rt == NULL) {
|
|
|
|
splx(s);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* insert new entry at head of hash chain */
|
|
|
|
rt->mf6c_origin = mfccp->mf6cc_origin;
|
|
|
|
rt->mf6c_mcastgrp = mfccp->mf6cc_mcastgrp;
|
|
|
|
rt->mf6c_parent = mfccp->mf6cc_parent;
|
2000-10-19 07:15:48 +04:00
|
|
|
rt->mf6c_ifset = mfccp->mf6cc_ifset;
|
1999-06-28 10:36:47 +04:00
|
|
|
/* initialize pkt counters per src-grp */
|
|
|
|
rt->mf6c_pkt_cnt = 0;
|
|
|
|
rt->mf6c_byte_cnt = 0;
|
|
|
|
rt->mf6c_wrong_if = 0;
|
|
|
|
rt->mf6c_expire = 0;
|
|
|
|
rt->mf6c_stall = NULL;
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* link into table */
|
|
|
|
rt->mf6c_next = mf6ctable[hash];
|
|
|
|
mf6ctable[hash] = rt;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef UPCALL_TIMING
|
|
|
|
/*
|
2000-05-19 14:39:43 +04:00
|
|
|
* collect delay statistics on the upcalls
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
static void
|
2007-05-23 21:14:59 +04:00
|
|
|
collate(struct timeval *t)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
u_long d;
|
|
|
|
struct timeval tp;
|
|
|
|
u_long delta;
|
2000-05-19 14:39:43 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
GET_TIME(tp);
|
2000-05-19 14:39:43 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if (TV_LT(*t, tp))
|
|
|
|
{
|
|
|
|
TV_DELTA(tp, *t, delta);
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
d = delta >> 10;
|
1999-07-22 19:46:13 +04:00
|
|
|
if (d > UPCALL_MAX)
|
|
|
|
d = UPCALL_MAX;
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
++upcall_data[d];
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* UPCALL_TIMING */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Delete an mfc entry
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
del_m6fc(struct mf6cctl *mfccp)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct sockaddr_in6 origin;
|
|
|
|
struct sockaddr_in6 mcastgrp;
|
|
|
|
struct mf6c *rt;
|
|
|
|
struct mf6c **nptr;
|
|
|
|
u_long hash;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
origin = mfccp->mf6cc_origin;
|
|
|
|
mcastgrp = mfccp->mf6cc_mcastgrp;
|
|
|
|
hash = MF6CHASH(origin.sin6_addr, mcastgrp.sin6_addr);
|
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_MFC)
|
|
|
|
log(LOG_DEBUG,"del_m6fc orig %s mcastgrp %s\n",
|
|
|
|
ip6_sprintf(&origin.sin6_addr),
|
|
|
|
ip6_sprintf(&mcastgrp.sin6_addr));
|
|
|
|
#endif
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
nptr = &mf6ctable[hash];
|
|
|
|
while ((rt = *nptr) != NULL) {
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&origin.sin6_addr,
|
|
|
|
&rt->mf6c_origin.sin6_addr) &&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&mcastgrp.sin6_addr,
|
|
|
|
&rt->mf6c_mcastgrp.sin6_addr) &&
|
|
|
|
rt->mf6c_stall == NULL)
|
|
|
|
break;
|
|
|
|
|
|
|
|
nptr = &rt->mf6c_next;
|
|
|
|
}
|
|
|
|
if (rt == NULL) {
|
|
|
|
splx(s);
|
|
|
|
return EADDRNOTAVAIL;
|
|
|
|
}
|
|
|
|
|
|
|
|
*nptr = rt->mf6c_next;
|
|
|
|
free(rt, M_MRTABLE);
|
|
|
|
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
socket_send(struct socket *s, struct mbuf *mm, struct sockaddr_in6 *src)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
if (s) {
|
|
|
|
if (sbappendaddr(&s->so_rcv,
|
|
|
|
(struct sockaddr *)src,
|
|
|
|
mm, (struct mbuf *)0) != 0) {
|
|
|
|
sorwakeup(s);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
m_freem(mm);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IPv6 multicast forwarding function. This function assumes that the packet
|
|
|
|
* pointed to by "ip6" has arrived on (or is about to be sent to) the interface
|
|
|
|
* pointed to by "ifp", and the packet is to be relayed to other networks
|
|
|
|
* that have members of the packet's destination IPv6 multicast group.
|
|
|
|
*
|
|
|
|
* The packet is returned unscathed to the caller, unless it is
|
|
|
|
* erroneous, in which case a non-zero return value tells the caller to
|
|
|
|
* discard it.
|
|
|
|
*/
|
|
|
|
|
|
|
|
int
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_mforward(struct ip6_hdr *ip6, struct ifnet *ifp, struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mf6c *rt;
|
|
|
|
struct mif6 *mifp;
|
|
|
|
struct mbuf *mm;
|
1999-06-28 10:36:47 +04:00
|
|
|
int s;
|
|
|
|
mifi_t mifi;
|
2005-05-30 01:43:09 +04:00
|
|
|
struct sockaddr_in6 sin6;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_FORWARD)
|
|
|
|
log(LOG_DEBUG, "ip6_mforward: src %s, dst %s, ifindex %d\n",
|
|
|
|
ip6_sprintf(&ip6->ip6_src), ip6_sprintf(&ip6->ip6_dst),
|
|
|
|
ifp->if_index);
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Don't forward a packet with Hop limit of zero or one,
|
|
|
|
* or a packet destined to a local-only group.
|
|
|
|
*/
|
|
|
|
if (ip6->ip6_hlim <= 1 || IN6_IS_ADDR_MC_NODELOCAL(&ip6->ip6_dst) ||
|
|
|
|
IN6_IS_ADDR_MC_LINKLOCAL(&ip6->ip6_dst))
|
|
|
|
return 0;
|
|
|
|
ip6->ip6_hlim--;
|
|
|
|
|
2000-08-29 13:19:43 +04:00
|
|
|
/*
|
|
|
|
* Source address check: do not forward packets with unspecified
|
|
|
|
* source. It was discussed in July 2000, on ipngwg mailing list.
|
|
|
|
* This is rather more serious than unicast cases, because some
|
|
|
|
* MLD packets can be sent with the unspecified source address
|
2006-03-03 17:07:06 +03:00
|
|
|
* (although such packets must normally set the hop limit field to 1).
|
2000-08-29 13:19:43 +04:00
|
|
|
*/
|
|
|
|
if (IN6_IS_ADDR_UNSPECIFIED(&ip6->ip6_src)) {
|
|
|
|
ip6stat.ip6s_cantforward++;
|
2006-06-08 02:33:33 +04:00
|
|
|
if (ip6_log_time + ip6_log_interval < time_second) {
|
|
|
|
ip6_log_time = time_second;
|
2000-08-29 13:19:43 +04:00
|
|
|
log(LOG_DEBUG,
|
|
|
|
"cannot forward "
|
|
|
|
"from %s to %s nxt %d received on %s\n",
|
|
|
|
ip6_sprintf(&ip6->ip6_src),
|
|
|
|
ip6_sprintf(&ip6->ip6_dst),
|
|
|
|
ip6->ip6_nxt,
|
2001-12-18 06:04:02 +03:00
|
|
|
m->m_pkthdr.rcvif ?
|
|
|
|
if_name(m->m_pkthdr.rcvif) : "?");
|
2000-08-29 13:19:43 +04:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Determine forwarding mifs from the forwarding cache table
|
|
|
|
*/
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
MF6CFIND(ip6->ip6_src, ip6->ip6_dst, rt);
|
|
|
|
|
|
|
|
/* Entry exists, so forward if necessary */
|
|
|
|
if (rt) {
|
|
|
|
splx(s);
|
|
|
|
return (ip6_mdq(m, ifp, rt));
|
|
|
|
} else {
|
|
|
|
/*
|
|
|
|
* If we don't have a route for packet's origin,
|
|
|
|
* Make a copy of the packet &
|
|
|
|
* send message to routing daemon
|
|
|
|
*/
|
|
|
|
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mbuf *mb0;
|
|
|
|
struct rtdetq *rte;
|
|
|
|
u_long hash;
|
|
|
|
/* int i, npkts;*/
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef UPCALL_TIMING
|
|
|
|
struct timeval tp;
|
|
|
|
|
|
|
|
GET_TIME(tp);
|
|
|
|
#endif /* UPCALL_TIMING */
|
|
|
|
|
|
|
|
mrt6stat.mrt6s_no_route++;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & (DEBUG_FORWARD | DEBUG_MFC))
|
|
|
|
log(LOG_DEBUG, "ip6_mforward: no rte s %s g %s\n",
|
|
|
|
ip6_sprintf(&ip6->ip6_src),
|
|
|
|
ip6_sprintf(&ip6->ip6_dst));
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate mbufs early so that we don't do extra work if we
|
|
|
|
* are just going to fail anyway.
|
|
|
|
*/
|
|
|
|
rte = (struct rtdetq *)malloc(sizeof(*rte), M_MRTABLE,
|
|
|
|
M_NOWAIT);
|
|
|
|
if (rte == NULL) {
|
|
|
|
splx(s);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
mb0 = m_copy(m, 0, M_COPYALL);
|
|
|
|
/*
|
|
|
|
* Pullup packet header if needed before storing it,
|
|
|
|
* as other references may modify it in the meantime.
|
|
|
|
*/
|
|
|
|
if (mb0 &&
|
2002-05-30 08:39:15 +04:00
|
|
|
(M_READONLY(mb0) || mb0->m_len < sizeof(struct ip6_hdr)))
|
1999-06-28 10:36:47 +04:00
|
|
|
mb0 = m_pullup(mb0, sizeof(struct ip6_hdr));
|
|
|
|
if (mb0 == NULL) {
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
splx(s);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* is there an upcall waiting for this packet? */
|
|
|
|
hash = MF6CHASH(ip6->ip6_src, ip6->ip6_dst);
|
|
|
|
for (rt = mf6ctable[hash]; rt; rt = rt->mf6c_next) {
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&ip6->ip6_src,
|
|
|
|
&rt->mf6c_origin.sin6_addr) &&
|
|
|
|
IN6_ARE_ADDR_EQUAL(&ip6->ip6_dst,
|
|
|
|
&rt->mf6c_mcastgrp.sin6_addr) &&
|
|
|
|
(rt->mf6c_stall != NULL))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (rt == NULL) {
|
|
|
|
struct mrt6msg *im;
|
2000-05-19 14:39:43 +04:00
|
|
|
struct omrt6msg *oim;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* no upcall, so make a new entry */
|
|
|
|
rt = (struct mf6c *)malloc(sizeof(*rt), M_MRTABLE,
|
|
|
|
M_NOWAIT);
|
|
|
|
if (rt == NULL) {
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
m_freem(mb0);
|
|
|
|
splx(s);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Make a copy of the header to send to the user
|
|
|
|
* level process
|
|
|
|
*/
|
|
|
|
mm = m_copy(mb0, 0, sizeof(struct ip6_hdr));
|
|
|
|
|
|
|
|
if (mm == NULL) {
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
m_freem(mb0);
|
|
|
|
free(rt, M_MRTABLE);
|
|
|
|
splx(s);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
/*
|
1999-06-28 10:36:47 +04:00
|
|
|
* Send message to routing daemon
|
|
|
|
*/
|
2007-11-10 03:14:31 +03:00
|
|
|
sockaddr_in6_init(&sin6, &ip6->ip6_src, 0, 0, 0);
|
2002-03-04 18:18:32 +03:00
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
im = NULL;
|
|
|
|
oim = NULL;
|
|
|
|
switch (ip6_mrouter_ver) {
|
|
|
|
case MRT6_OINIT:
|
|
|
|
oim = mtod(mm, struct omrt6msg *);
|
|
|
|
oim->im6_msgtype = MRT6MSG_NOCACHE;
|
|
|
|
oim->im6_mbz = 0;
|
|
|
|
break;
|
|
|
|
case MRT6_INIT:
|
|
|
|
im = mtod(mm, struct mrt6msg *);
|
|
|
|
im->im6_msgtype = MRT6MSG_NOCACHE;
|
|
|
|
im->im6_mbz = 0;
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
m_freem(mb0);
|
|
|
|
free(rt, M_MRTABLE);
|
|
|
|
splx(s);
|
|
|
|
return EINVAL;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_FORWARD)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"getting the iif info in the kernel\n");
|
|
|
|
#endif
|
|
|
|
|
|
|
|
for (mifp = mif6table, mifi = 0;
|
|
|
|
mifi < nummifs && mifp->m6_ifp != ifp;
|
|
|
|
mifp++, mifi++)
|
|
|
|
;
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
switch (ip6_mrouter_ver) {
|
|
|
|
case MRT6_OINIT:
|
|
|
|
oim->im6_mif = mifi;
|
|
|
|
break;
|
|
|
|
case MRT6_INIT:
|
|
|
|
im->im6_mif = mifi;
|
|
|
|
break;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
if (socket_send(ip6_mrouter, mm, &sin6) < 0) {
|
|
|
|
log(LOG_WARNING, "ip6_mforward: ip6_mrouter "
|
|
|
|
"socket queue full\n");
|
|
|
|
mrt6stat.mrt6s_upq_sockfull++;
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
m_freem(mb0);
|
|
|
|
free(rt, M_MRTABLE);
|
|
|
|
splx(s);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
|
|
|
|
mrt6stat.mrt6s_upcalls++;
|
|
|
|
|
|
|
|
/* insert new entry at head of hash chain */
|
|
|
|
bzero(rt, sizeof(*rt));
|
2007-11-10 03:14:31 +03:00
|
|
|
sockaddr_in6_init(&rt->mf6c_origin, &ip6->ip6_src,
|
|
|
|
0, 0, 0);
|
|
|
|
sockaddr_in6_init(&rt->mf6c_mcastgrp, &ip6->ip6_dst,
|
|
|
|
0, 0, 0);
|
1999-06-28 10:36:47 +04:00
|
|
|
rt->mf6c_expire = UPCALL_EXPIRE;
|
2002-05-30 08:39:15 +04:00
|
|
|
n6expire[hash]++;
|
1999-06-28 10:36:47 +04:00
|
|
|
rt->mf6c_parent = MF6C_INCOMPLETE_PARENT;
|
|
|
|
|
|
|
|
/* link into table */
|
|
|
|
rt->mf6c_next = mf6ctable[hash];
|
|
|
|
mf6ctable[hash] = rt;
|
|
|
|
/* Add this entry to the end of the queue */
|
|
|
|
rt->mf6c_stall = rte;
|
|
|
|
} else {
|
|
|
|
/* determine if q has overflowed */
|
|
|
|
struct rtdetq **p;
|
2001-02-10 05:19:57 +03:00
|
|
|
int npkts = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
for (p = &rt->mf6c_stall; *p != NULL; p = &(*p)->next)
|
|
|
|
if (++npkts > MAX_UPQ6) {
|
|
|
|
mrt6stat.mrt6s_upq_ovflw++;
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
m_freem(mb0);
|
|
|
|
splx(s);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add this entry to the end of the queue */
|
|
|
|
*p = rte;
|
|
|
|
}
|
|
|
|
|
|
|
|
rte->next = NULL;
|
|
|
|
rte->m = mb0;
|
|
|
|
rte->ifp = ifp;
|
|
|
|
#ifdef UPCALL_TIMING
|
|
|
|
rte->t = tp;
|
|
|
|
#endif /* UPCALL_TIMING */
|
|
|
|
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Clean up cache entries if upcalls are not serviced
|
2006-03-06 02:47:08 +03:00
|
|
|
* Call from the Slow Timeout mechanism, every 0.25 seconds.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
static void
|
2006-11-16 04:32:37 +03:00
|
|
|
expire_upcalls(void *unused)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
|
|
|
struct rtdetq *rte;
|
|
|
|
struct mf6c *mfc, **nptr;
|
|
|
|
int i;
|
|
|
|
int s;
|
|
|
|
|
1999-07-04 06:01:15 +04:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
for (i = 0; i < MF6CTBLSIZ; i++) {
|
2002-05-30 08:39:15 +04:00
|
|
|
if (n6expire[i] == 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
continue;
|
|
|
|
nptr = &mf6ctable[i];
|
|
|
|
while ((mfc = *nptr) != NULL) {
|
|
|
|
rte = mfc->mf6c_stall;
|
|
|
|
/*
|
|
|
|
* Skip real cache entries
|
|
|
|
* Make sure it wasn't marked to not expire (shouldn't happen)
|
|
|
|
* If it expires now
|
|
|
|
*/
|
|
|
|
if (rte != NULL &&
|
|
|
|
mfc->mf6c_expire != 0 &&
|
|
|
|
--mfc->mf6c_expire == 0) {
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_EXPIRE)
|
|
|
|
log(LOG_DEBUG, "expire_upcalls: expiring (%s %s)\n",
|
|
|
|
ip6_sprintf(&mfc->mf6c_origin.sin6_addr),
|
|
|
|
ip6_sprintf(&mfc->mf6c_mcastgrp.sin6_addr));
|
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* drop all the packets
|
|
|
|
* free the mbuf with the pkt, if, timing info
|
|
|
|
*/
|
|
|
|
do {
|
|
|
|
struct rtdetq *n = rte->next;
|
|
|
|
m_freem(rte->m);
|
|
|
|
free(rte, M_MRTABLE);
|
|
|
|
rte = n;
|
|
|
|
} while (rte != NULL);
|
|
|
|
mrt6stat.mrt6s_cache_cleanups++;
|
2002-05-30 08:39:15 +04:00
|
|
|
n6expire[i]--;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
*nptr = mfc->mf6c_next;
|
|
|
|
free(mfc, M_MRTABLE);
|
|
|
|
} else {
|
|
|
|
nptr = &mfc->mf6c_next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
splx(s);
|
2000-03-23 10:01:25 +03:00
|
|
|
callout_reset(&expire_upcalls_ch, EXPIRE_TIMEOUT,
|
|
|
|
expire_upcalls, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Packet forwarding routine once entry in the cache is made
|
|
|
|
*/
|
|
|
|
static int
|
2007-05-23 21:14:59 +04:00
|
|
|
ip6_mdq(struct mbuf *m, struct ifnet *ifp, struct mf6c *rt)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct ip6_hdr *ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
mifi_t mifi, iif;
|
|
|
|
struct mif6 *mifp;
|
|
|
|
int plen = m->m_pkthdr.len;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct in6_addr src0, dst0; /* copies for local work */
|
|
|
|
u_int32_t iszone, idzone, oszone, odzone;
|
|
|
|
int error = 0;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Macro to send packet on mif. Since RSVP packets don't get counted on
|
|
|
|
* input, they shouldn't get counted on output, so statistics keeping is
|
2001-07-22 17:33:58 +04:00
|
|
|
* separate.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
#define MC6_SEND(ip6, mifp, m) do { \
|
2003-05-14 21:00:22 +04:00
|
|
|
if ((mifp)->m6_flags & MIFF_REGISTER) \
|
|
|
|
register_send((ip6), (mifp), (m)); \
|
|
|
|
else \
|
|
|
|
phyint_send((ip6), (mifp), (m)); \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Don't forward if it didn't arrive from the parent mif
|
|
|
|
* for its origin.
|
|
|
|
*/
|
|
|
|
mifi = rt->mf6c_parent;
|
|
|
|
if ((mifi >= nummifs) || (mif6table[mifi].m6_ifp != ifp)) {
|
|
|
|
/* came in the wrong interface */
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_FORWARD)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"wrong if: ifid %d mifi %d mififid %x\n",
|
|
|
|
ifp->if_index, mifi,
|
2003-07-08 14:20:45 +04:00
|
|
|
mif6table[mifi].m6_ifp ?
|
2005-02-27 01:45:09 +03:00
|
|
|
mif6table[mifi].m6_ifp->if_index : -1);
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
|
|
|
mrt6stat.mrt6s_wrong_if++;
|
|
|
|
rt->mf6c_wrong_if++;
|
|
|
|
/*
|
|
|
|
* If we are doing PIM processing, and we are forwarding
|
|
|
|
* packets on this interface, send a message to the
|
|
|
|
* routing daemon.
|
|
|
|
*/
|
2000-05-19 14:39:43 +04:00
|
|
|
/* have to make sure this is a valid mif */
|
|
|
|
if (mifi < nummifs && mif6table[mifi].m6_ifp)
|
|
|
|
if (pim6 && (m->m_flags & M_LOOP) == 0) {
|
|
|
|
/*
|
|
|
|
* Check the M_LOOP flag to avoid an
|
|
|
|
* unnecessary PIM assert.
|
|
|
|
* XXX: M_LOOP is an ad-hoc hack...
|
|
|
|
*/
|
2005-05-30 01:43:09 +04:00
|
|
|
struct sockaddr_in6 sin6;
|
2000-05-19 14:39:43 +04:00
|
|
|
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mbuf *mm;
|
2000-05-19 14:39:43 +04:00
|
|
|
struct mrt6msg *im;
|
|
|
|
struct omrt6msg *oim;
|
|
|
|
|
|
|
|
mm = m_copy(m, 0, sizeof(struct ip6_hdr));
|
|
|
|
if (mm &&
|
2002-05-30 08:39:15 +04:00
|
|
|
(M_READONLY(mm) ||
|
2000-05-19 14:39:43 +04:00
|
|
|
mm->m_len < sizeof(struct ip6_hdr)))
|
|
|
|
mm = m_pullup(mm, sizeof(struct ip6_hdr));
|
|
|
|
if (mm == NULL)
|
|
|
|
return ENOBUFS;
|
2002-03-04 18:18:32 +03:00
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
oim = NULL;
|
|
|
|
im = NULL;
|
|
|
|
switch (ip6_mrouter_ver) {
|
|
|
|
case MRT6_OINIT:
|
|
|
|
oim = mtod(mm, struct omrt6msg *);
|
|
|
|
oim->im6_msgtype = MRT6MSG_WRONGMIF;
|
|
|
|
oim->im6_mbz = 0;
|
|
|
|
break;
|
|
|
|
case MRT6_INIT:
|
1999-06-28 10:36:47 +04:00
|
|
|
im = mtod(mm, struct mrt6msg *);
|
2000-05-19 14:39:43 +04:00
|
|
|
im->im6_msgtype = MRT6MSG_WRONGMIF;
|
2001-02-10 06:06:39 +03:00
|
|
|
im->im6_mbz = 0;
|
2000-05-19 14:39:43 +04:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
m_freem(mm);
|
|
|
|
return EINVAL;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
for (mifp = mif6table, iif = 0;
|
|
|
|
iif < nummifs && mifp &&
|
|
|
|
mifp->m6_ifp != ifp;
|
|
|
|
mifp++, iif++)
|
|
|
|
;
|
|
|
|
|
2006-03-06 02:47:08 +03:00
|
|
|
bzero(&sin6, sizeof(sin6));
|
2005-05-30 01:43:09 +04:00
|
|
|
sin6.sin6_len = sizeof(sin6);
|
|
|
|
sin6.sin6_family = AF_INET6;
|
2000-05-19 14:39:43 +04:00
|
|
|
switch (ip6_mrouter_ver) {
|
|
|
|
case MRT6_OINIT:
|
|
|
|
oim->im6_mif = iif;
|
|
|
|
sin6.sin6_addr = oim->im6_src;
|
|
|
|
break;
|
|
|
|
case MRT6_INIT:
|
|
|
|
im->im6_mif = iif;
|
1999-06-28 10:36:47 +04:00
|
|
|
sin6.sin6_addr = im->im6_src;
|
2000-05-19 14:39:43 +04:00
|
|
|
break;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
mrt6stat.mrt6s_upcalls++;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
if (socket_send(ip6_mrouter, mm, &sin6) < 0) {
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef MRT6DEBUG
|
2000-05-19 14:39:43 +04:00
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_WARNING, "mdq, ip6_mrouter socket queue full\n");
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
2000-05-19 14:39:43 +04:00
|
|
|
++mrt6stat.mrt6s_upq_sockfull;
|
|
|
|
return ENOBUFS;
|
|
|
|
} /* if socket Q full */
|
|
|
|
} /* if PIM */
|
1999-06-28 10:36:47 +04:00
|
|
|
return 0;
|
|
|
|
} /* if wrong iif */
|
|
|
|
|
|
|
|
/* If I sourced this packet, it counts as output, else it was input. */
|
|
|
|
if (m->m_pkthdr.rcvif == NULL) {
|
|
|
|
/* XXX: is rcvif really NULL when output?? */
|
|
|
|
mif6table[mifi].m6_pkt_out++;
|
|
|
|
mif6table[mifi].m6_bytes_out += plen;
|
|
|
|
} else {
|
|
|
|
mif6table[mifi].m6_pkt_in++;
|
|
|
|
mif6table[mifi].m6_bytes_in += plen;
|
|
|
|
}
|
|
|
|
rt->mf6c_pkt_cnt++;
|
|
|
|
rt->mf6c_byte_cnt += plen;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For each mif, forward a copy of the packet if there are group
|
|
|
|
* members downstream on the interface.
|
|
|
|
*/
|
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
|
|
|
src0 = ip6->ip6_src;
|
|
|
|
dst0 = ip6->ip6_dst;
|
|
|
|
if ((error = in6_setscope(&src0, ifp, &iszone)) != 0 ||
|
|
|
|
(error = in6_setscope(&dst0, ifp, &idzone)) != 0) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
return (error);
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
for (mifp = mif6table, mifi = 0; mifi < nummifs; mifp++, mifi++)
|
|
|
|
if (IF_ISSET(mifi, &rt->mf6c_ifset)) {
|
2003-06-06 10:52:29 +04:00
|
|
|
if (mif6table[mifi].m6_ifp == NULL)
|
|
|
|
continue;
|
2000-05-19 14:39:43 +04:00
|
|
|
/*
|
|
|
|
* check if the outgoing packet is going to break
|
|
|
|
* a scope boundary.
|
2006-03-03 17:07:06 +03:00
|
|
|
* XXX: For packets through PIM register tunnel
|
|
|
|
* interface, we believe the routing daemon.
|
2000-05-19 14:39:43 +04:00
|
|
|
*/
|
|
|
|
if ((mif6table[rt->mf6c_parent].m6_flags &
|
|
|
|
MIFF_REGISTER) == 0 &&
|
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
|
|
|
(mif6table[mifi].m6_flags & MIFF_REGISTER) == 0) {
|
|
|
|
if (in6_setscope(&src0, mif6table[mifi].m6_ifp,
|
|
|
|
&oszone) ||
|
|
|
|
in6_setscope(&dst0, mif6table[mifi].m6_ifp,
|
|
|
|
&odzone) ||
|
|
|
|
iszone != oszone || idzone != odzone) {
|
|
|
|
ip6stat.ip6s_badscope++;
|
|
|
|
continue;
|
|
|
|
}
|
2000-05-19 14:39:43 +04:00
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
mifp->m6_pkt_out++;
|
|
|
|
mifp->m6_bytes_out += plen;
|
|
|
|
MC6_SEND(ip6, mifp, m);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
2007-05-23 21:14:59 +04:00
|
|
|
phyint_send(struct ip6_hdr *ip6, struct mif6 *mifp, struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mbuf *mb_copy;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct ifnet *ifp = mifp->m6_ifp;
|
|
|
|
int error = 0;
|
2007-01-29 09:05:10 +03:00
|
|
|
int s;
|
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
|
|
|
static struct route ro;
|
2006-03-06 02:47:08 +03:00
|
|
|
struct in6_multi *in6m;
|
|
|
|
struct sockaddr_in6 dst6;
|
2002-05-29 11:53:39 +04:00
|
|
|
u_long linkmtu;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2007-01-29 09:05:10 +03:00
|
|
|
s = splsoftnet();
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Make a new reference to the packet; make sure that
|
|
|
|
* the IPv6 header is actually copied, not just referenced,
|
|
|
|
* so that ip6_output() only scribbles on the copy.
|
|
|
|
*/
|
|
|
|
mb_copy = m_copy(m, 0, M_COPYALL);
|
|
|
|
if (mb_copy &&
|
2002-05-30 08:39:15 +04:00
|
|
|
(M_READONLY(mb_copy) || mb_copy->m_len < sizeof(struct ip6_hdr)))
|
1999-06-28 10:36:47 +04:00
|
|
|
mb_copy = m_pullup(mb_copy, sizeof(struct ip6_hdr));
|
2001-03-08 01:50:14 +03:00
|
|
|
if (mb_copy == NULL) {
|
|
|
|
splx(s);
|
1999-06-28 10:36:47 +04:00
|
|
|
return;
|
2001-03-08 01:50:14 +03:00
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
/* set MCAST flag to the outgoing packet */
|
|
|
|
mb_copy->m_flags |= M_MCAST;
|
|
|
|
|
|
|
|
/*
|
2006-03-06 02:47:08 +03:00
|
|
|
* If we sourced the packet, call ip6_output since we may divide
|
1999-06-28 10:36:47 +04:00
|
|
|
* the packet into fragments when the packet is too big for the
|
|
|
|
* outgoing interface.
|
|
|
|
* Otherwise, we can simply send the packet to the interface
|
|
|
|
* sending queue.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.rcvif == NULL) {
|
|
|
|
struct ip6_moptions im6o;
|
|
|
|
|
|
|
|
im6o.im6o_multicast_ifp = ifp;
|
|
|
|
/* XXX: ip6_output will override ip6->ip6_hlim */
|
|
|
|
im6o.im6o_multicast_hlim = ip6->ip6_hlim;
|
|
|
|
im6o.im6o_multicast_loop = 1;
|
2003-08-23 00:20:09 +04:00
|
|
|
error = ip6_output(mb_copy, NULL, &ro, IPV6_FORWARDING,
|
2007-01-29 09:05:10 +03:00
|
|
|
&im6o, NULL, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_XMIT)
|
|
|
|
log(LOG_DEBUG, "phyint_send on mif %d err %d\n",
|
|
|
|
mifp - mif6table, error);
|
|
|
|
#endif
|
|
|
|
splx(s);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If we belong to the destination multicast group
|
|
|
|
* on the outgoing interface, loop back a copy.
|
|
|
|
*/
|
2006-03-06 02:47:08 +03:00
|
|
|
/*
|
|
|
|
* Does not have to check source info, as it's alreay covered by
|
|
|
|
* ip6_input
|
|
|
|
*/
|
2007-11-10 03:14:31 +03:00
|
|
|
sockaddr_in6_init(&dst6, &ip6->ip6_dst, 0, 0, 0);
|
2006-03-06 02:47:08 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
IN6_LOOKUP_MULTI(ip6->ip6_dst, ifp, in6m);
|
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 (in6m != NULL) {
|
|
|
|
ip6_mloopback(ifp, m,
|
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
|
|
|
satocsin6(rtcache_getdst(&ro)));
|
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
|
|
|
}
|
2006-03-06 02:47:08 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
2000-05-19 14:39:43 +04:00
|
|
|
* Put the packet into the sending queue of the outgoing interface
|
1999-06-28 10:36:47 +04:00
|
|
|
* if it would fit in the MTU of the interface.
|
|
|
|
*/
|
2002-05-29 11:53:39 +04:00
|
|
|
linkmtu = IN6_LINKMTU(ifp);
|
2002-07-25 16:41:51 +04:00
|
|
|
if (mb_copy->m_pkthdr.len <= linkmtu || linkmtu < IPV6_MMTU) {
|
1999-12-13 18:17:17 +03:00
|
|
|
/*
|
2006-03-06 02:47:08 +03:00
|
|
|
* We could call if_output directly here, but we use
|
|
|
|
* nd6_output on purpose to see if IPv6 operation is allowed
|
|
|
|
* on the interface.
|
1999-12-13 18:17:17 +03:00
|
|
|
*/
|
2006-03-06 02:47:08 +03:00
|
|
|
error = nd6_output(ifp, ifp, mb_copy, &dst6, NULL);
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_XMIT)
|
|
|
|
log(LOG_DEBUG, "phyint_send on mif %d err %d\n",
|
|
|
|
mifp - mif6table, error);
|
|
|
|
#endif
|
2001-03-25 13:06:03 +04:00
|
|
|
} else {
|
2006-03-06 02:47:08 +03:00
|
|
|
/*
|
|
|
|
* pMTU discovery is intentionally disabled by default, since
|
|
|
|
* various router may notify pMTU in multicast, which can be
|
|
|
|
* a DDoS to a router
|
|
|
|
*/
|
|
|
|
if (ip6_mcast_pmtu)
|
|
|
|
icmp6_error(mb_copy, ICMP6_PACKET_TOO_BIG, 0, linkmtu);
|
|
|
|
else {
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef MRT6DEBUG
|
2006-03-06 02:47:08 +03:00
|
|
|
if (mrt6debug & DEBUG_XMIT)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"phyint_send: packet too big on %s o %s g %s"
|
|
|
|
" size %d(discarded)\n",
|
|
|
|
if_name(ifp),
|
|
|
|
ip6_sprintf(&ip6->ip6_src),
|
|
|
|
ip6_sprintf(&ip6->ip6_dst),
|
|
|
|
mb_copy->m_pkthdr.len);
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif /* MRT6DEBUG */
|
2006-03-06 02:47:08 +03:00
|
|
|
m_freem(mb_copy); /* simply discard the packet */
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2001-03-25 13:06:03 +04:00
|
|
|
|
|
|
|
splx(s);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
static int
|
2007-05-23 21:32:46 +04:00
|
|
|
register_send(struct ip6_hdr *ip6, struct mif6 *mif, struct mbuf *m)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct mbuf *mm;
|
|
|
|
int i, len = m->m_pkthdr.len;
|
2005-05-30 01:43:09 +04:00
|
|
|
struct sockaddr_in6 sin6;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct mrt6msg *im6;
|
|
|
|
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_DEBUG, "** IPv6 register_send **\n src %s dst %s\n",
|
|
|
|
ip6_sprintf(&ip6->ip6_src), ip6_sprintf(&ip6->ip6_dst));
|
|
|
|
#endif
|
|
|
|
++pim6stat.pim6s_snd_registers;
|
|
|
|
|
|
|
|
/* Make a copy of the packet to send to the user level process */
|
|
|
|
MGETHDR(mm, M_DONTWAIT, MT_HEADER);
|
|
|
|
if (mm == NULL)
|
|
|
|
return ENOBUFS;
|
|
|
|
mm->m_data += max_linkhdr;
|
|
|
|
mm->m_len = sizeof(struct ip6_hdr);
|
|
|
|
|
|
|
|
if ((mm->m_next = m_copy(m, 0, M_COPYALL)) == NULL) {
|
|
|
|
m_freem(mm);
|
|
|
|
return ENOBUFS;
|
|
|
|
}
|
|
|
|
i = MHLEN - M_LEADINGSPACE(mm);
|
|
|
|
if (i > len)
|
|
|
|
i = len;
|
|
|
|
mm = m_pullup(mm, i);
|
2002-03-24 23:46:56 +03:00
|
|
|
if (mm == NULL)
|
1999-06-28 10:36:47 +04:00
|
|
|
return ENOBUFS;
|
|
|
|
/* TODO: check it! */
|
|
|
|
mm->m_pkthdr.len = len + sizeof(struct ip6_hdr);
|
|
|
|
|
2000-05-19 14:39:43 +04:00
|
|
|
/*
|
1999-06-28 10:36:47 +04:00
|
|
|
* Send message to routing daemon
|
|
|
|
*/
|
2007-11-10 03:14:31 +03:00
|
|
|
sockaddr_in6_init(&sin6, &ip6->ip6_src, 0, 0, 0);
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
im6 = mtod(mm, struct mrt6msg *);
|
|
|
|
im6->im6_msgtype = MRT6MSG_WHOLEPKT;
|
|
|
|
im6->im6_mbz = 0;
|
|
|
|
|
|
|
|
im6->im6_mif = mif - mif6table;
|
|
|
|
|
|
|
|
/* iif info is not given for reg. encap.n */
|
|
|
|
mrt6stat.mrt6s_upcalls++;
|
|
|
|
|
|
|
|
if (socket_send(ip6_mrouter, mm, &sin6) < 0) {
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug)
|
|
|
|
log(LOG_WARNING,
|
2002-06-07 22:19:05 +04:00
|
|
|
"register_send: ip6_mrouter socket queue full\n");
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif
|
2001-02-10 05:19:57 +03:00
|
|
|
++mrt6stat.mrt6s_upq_sockfull;
|
|
|
|
return ENOBUFS;
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2000-05-19 14:39:43 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* PIM sparse mode hook
|
|
|
|
* Receives the pim control messages, and passes them up to the listening
|
|
|
|
* socket, using rip6_input.
|
|
|
|
* The only message processed is the REGISTER pim message; the pim header
|
|
|
|
* is stripped off, and the inner packet is passed to register_mforward.
|
|
|
|
*/
|
|
|
|
int
|
2007-05-23 21:14:59 +04:00
|
|
|
pim6_input(struct mbuf **mp, int *offp, int proto)
|
1999-06-28 10:36:47 +04:00
|
|
|
{
|
2001-02-10 05:19:57 +03:00
|
|
|
struct pim *pim; /* pointer to a pim struct */
|
|
|
|
struct ip6_hdr *ip6;
|
|
|
|
int pimlen;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct mbuf *m = *mp;
|
2001-02-10 05:19:57 +03:00
|
|
|
int minlen;
|
1999-06-28 10:36:47 +04:00
|
|
|
int off = *offp;
|
|
|
|
|
|
|
|
++pim6stat.pim6s_rcv_total;
|
|
|
|
|
2001-02-10 05:19:57 +03:00
|
|
|
ip6 = mtod(m, struct ip6_hdr *);
|
|
|
|
pimlen = m->m_pkthdr.len - *offp;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2001-02-10 05:19:57 +03:00
|
|
|
/*
|
|
|
|
* Validate lengths
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
if (pimlen < PIM_MINLEN) {
|
|
|
|
++pim6stat.pim6s_rcv_tooshort;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_PIM)
|
|
|
|
log(LOG_DEBUG,"pim6_input: PIM packet too short\n");
|
|
|
|
#endif
|
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* if the packet is at least as big as a REGISTER, go ahead
|
|
|
|
* and grab the PIM REGISTER header size, to avoid another
|
|
|
|
* possible m_pullup() later.
|
2000-05-19 14:39:43 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* PIM_MINLEN == pimhdr + u_int32 == 8
|
|
|
|
* PIM6_REG_MINLEN == pimhdr + reghdr + eip6hdr == 4 + 4 + 40
|
|
|
|
*/
|
|
|
|
minlen = (pimlen >= PIM6_REG_MINLEN) ? PIM6_REG_MINLEN : PIM_MINLEN;
|
2000-05-19 14:39:43 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Make sure that the IP6 and PIM headers in contiguous memory, and
|
|
|
|
* possibly the PIM REGISTER header
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
IP6_EXTHDR_GET(pim, struct pim *, m, off, minlen);
|
|
|
|
if (pim == NULL) {
|
|
|
|
pim6stat.pim6s_rcv_tooshort++;
|
|
|
|
return IPPROTO_DONE;
|
|
|
|
}
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2003-05-15 17:46:15 +04:00
|
|
|
/* PIM version check */
|
|
|
|
if (pim->pim_ver != PIM_VERSION) {
|
|
|
|
++pim6stat.pim6s_rcv_badversion;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
log(LOG_ERR,
|
|
|
|
"pim6_input: incorrect version %d, expecting %d\n",
|
|
|
|
pim->pim_ver, PIM_VERSION);
|
|
|
|
#endif
|
|
|
|
m_freem(m);
|
|
|
|
return (IPPROTO_DONE);
|
|
|
|
}
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#define PIM6_CHECKSUM
|
|
|
|
#ifdef PIM6_CHECKSUM
|
|
|
|
{
|
|
|
|
int cksumlen;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Validate checksum.
|
|
|
|
* If PIM REGISTER, exclude the data packet
|
|
|
|
*/
|
|
|
|
if (pim->pim_type == PIM_REGISTER)
|
|
|
|
cksumlen = PIM_MINLEN;
|
|
|
|
else
|
|
|
|
cksumlen = pimlen;
|
|
|
|
|
|
|
|
if (in6_cksum(m, IPPROTO_PIM, off, cksumlen)) {
|
|
|
|
++pim6stat.pim6s_rcv_badsum;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_PIM)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"pim6_input: invalid checksum\n");
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* PIM_CHECKSUM */
|
|
|
|
|
|
|
|
if (pim->pim_type == PIM_REGISTER) {
|
|
|
|
/*
|
|
|
|
* since this is a REGISTER, we'll make a copy of the register
|
1999-07-22 19:46:13 +04:00
|
|
|
* headers ip6+pim+u_int32_t+encap_ip6, to be passed up to the
|
1999-06-28 10:36:47 +04:00
|
|
|
* routing daemon.
|
|
|
|
*/
|
2006-08-30 21:13:45 +04:00
|
|
|
static const struct sockaddr_in6 dst = {
|
|
|
|
.sin6_len = sizeof(dst),
|
|
|
|
.sin6_family = AF_INET6,
|
|
|
|
};
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
struct mbuf *mcp;
|
|
|
|
struct ip6_hdr *eip6;
|
1999-07-22 19:46:13 +04:00
|
|
|
u_int32_t *reghdr;
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
++pim6stat.pim6s_rcv_registers;
|
|
|
|
|
|
|
|
if ((reg_mif_num >= nummifs) || (reg_mif_num == (mifi_t) -1)) {
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_PIM)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"pim6_input: register mif not set: %d\n",
|
|
|
|
reg_mif_num);
|
|
|
|
#endif
|
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-07-22 19:46:13 +04:00
|
|
|
reghdr = (u_int32_t *)(pim + 1);
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
if ((ntohl(*reghdr) & PIM_NULL_REGISTER))
|
|
|
|
goto pim6_input_to_daemon;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Validate length
|
|
|
|
*/
|
|
|
|
if (pimlen < PIM6_REG_MINLEN) {
|
|
|
|
++pim6stat.pim6s_rcv_tooshort;
|
|
|
|
++pim6stat.pim6s_rcv_badregisters;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
log(LOG_ERR,
|
|
|
|
"pim6_input: register packet size too "
|
|
|
|
"small %d from %s\n",
|
|
|
|
pimlen, ip6_sprintf(&ip6->ip6_src));
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
eip6 = (struct ip6_hdr *) (reghdr + 1);
|
2002-03-04 18:18:32 +03:00
|
|
|
#ifdef MRT6DEBUG
|
1999-06-28 10:36:47 +04:00
|
|
|
if (mrt6debug & DEBUG_PIM)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"pim6_input[register], eip6: %s -> %s, "
|
|
|
|
"eip6 plen %d\n",
|
|
|
|
ip6_sprintf(&eip6->ip6_src),
|
|
|
|
ip6_sprintf(&eip6->ip6_dst),
|
|
|
|
ntohs(eip6->ip6_plen));
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
2000-10-19 07:15:48 +04:00
|
|
|
|
|
|
|
/* verify the version number of the inner packet */
|
|
|
|
if ((eip6->ip6_vfc & IPV6_VERSION_MASK) != IPV6_VERSION) {
|
|
|
|
++pim6stat.pim6s_rcv_badregisters;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
log(LOG_DEBUG, "pim6_input: invalid IP version (%d) "
|
|
|
|
"of the inner packet\n",
|
|
|
|
(eip6->ip6_vfc & IPV6_VERSION));
|
|
|
|
#endif
|
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_NONE);
|
2000-10-19 07:15:48 +04:00
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* verify the inner packet is destined to a mcast group */
|
|
|
|
if (!IN6_IS_ADDR_MULTICAST(&eip6->ip6_dst)) {
|
|
|
|
++pim6stat.pim6s_rcv_badregisters;
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_PIM)
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"pim6_input: inner packet of register "
|
|
|
|
"is not multicast %s\n",
|
|
|
|
ip6_sprintf(&eip6->ip6_dst));
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* make a copy of the whole header to pass to the daemon later.
|
|
|
|
*/
|
|
|
|
mcp = m_copy(m, 0, off + PIM6_REG_MINLEN);
|
|
|
|
if (mcp == NULL) {
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
log(LOG_ERR,
|
|
|
|
"pim6_input: pim register: "
|
|
|
|
"could not copy register head\n");
|
2000-05-19 14:39:43 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
m_freem(m);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* forward the inner ip6 packet; point m_data at the inner ip6.
|
|
|
|
*/
|
|
|
|
m_adj(m, off + PIM_MINLEN);
|
|
|
|
#ifdef MRT6DEBUG
|
|
|
|
if (mrt6debug & DEBUG_PIM) {
|
|
|
|
log(LOG_DEBUG,
|
|
|
|
"pim6_input: forwarding decapsulated register: "
|
|
|
|
"src %s, dst %s, mif %d\n",
|
|
|
|
ip6_sprintf(&eip6->ip6_src),
|
|
|
|
ip6_sprintf(&eip6->ip6_dst),
|
|
|
|
reg_mif_num);
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2003-10-30 04:43:08 +03:00
|
|
|
looutput(mif6table[reg_mif_num].m6_ifp, m,
|
2006-08-30 21:13:45 +04:00
|
|
|
(struct sockaddr *)__UNCONST(&dst),
|
1999-06-28 10:36:47 +04:00
|
|
|
(struct rtentry *) NULL);
|
2002-03-04 18:18:32 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/* prepare the register head to send to the mrouting daemon */
|
|
|
|
m = mcp;
|
|
|
|
}
|
2000-05-19 14:39:43 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Pass the PIM message up to the daemon; if it is a register message
|
|
|
|
* pass the 'head' only up to the daemon. This includes the
|
|
|
|
* encapsulator ip6 header, pim header, register header and the
|
|
|
|
* encapsulated ip6 header.
|
|
|
|
*/
|
|
|
|
pim6_input_to_daemon:
|
|
|
|
rip6_input(&m, offp, proto);
|
2002-09-11 06:46:42 +04:00
|
|
|
return (IPPROTO_DONE);
|
1999-06-28 10:36:47 +04:00
|
|
|
}
|
2005-08-29 01:03:18 +04:00
|
|
|
|
|
|
|
SYSCTL_SETUP(sysctl_net_inet6_pim6_setup, "sysctl net.inet6.pim6 subtree setup")
|
|
|
|
{
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "net", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "inet6", NULL,
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, CTL_EOL);
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_NODE, "pim6",
|
|
|
|
SYSCTL_DESCR("PIMv6 settings"),
|
|
|
|
NULL, 0, NULL, 0,
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_PIM, CTL_EOL);
|
|
|
|
|
|
|
|
sysctl_createv(clog, 0, NULL, NULL,
|
|
|
|
CTLFLAG_PERMANENT,
|
|
|
|
CTLTYPE_STRUCT, "stats",
|
|
|
|
SYSCTL_DESCR("PIMv6 statistics"),
|
|
|
|
NULL, 0, &pim6stat, sizeof(pim6stat),
|
|
|
|
CTL_NET, PF_INET6, IPPROTO_PIM, PIM6CTL_STATS,
|
|
|
|
CTL_EOL);
|
|
|
|
}
|