2005-01-07 01:45:51 +00:00
|
|
|
/*-
|
2017-11-27 15:23:17 +00:00
|
|
|
* SPDX-License-Identifier: BSD-2-Clause-NetBSD
|
|
|
|
*
|
2002-09-06 17:12:50 +00:00
|
|
|
* Copyright (c) 1998 The NetBSD Foundation, Inc.
|
2018-06-13 11:11:33 +00:00
|
|
|
* Copyright (c) 2014, 2018 Andrey V. Elsukov <ae@FreeBSD.org>
|
2002-09-06 17:12:50 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Heiko W.Rupp <hwr@pilhuhn.de>
|
|
|
|
*
|
2005-08-01 08:14:21 +00:00
|
|
|
* IPv6-over-GRE contributed by Gert Doering <gert@greenie.muc.de>
|
|
|
|
*
|
2002-09-06 17:12:50 +00: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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
2014-11-07 19:13:19 +00:00
|
|
|
*
|
|
|
|
* $NetBSD: ip_gre.c,v 1.29 2003/09/05 23:02:43 itojun Exp $
|
2002-09-06 17:12:50 +00:00
|
|
|
*/
|
|
|
|
|
2007-10-07 20:44:24 +00:00
|
|
|
#include <sys/cdefs.h>
|
|
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
|
2002-09-06 17:12:50 +00:00
|
|
|
#include "opt_inet.h"
|
2005-08-01 08:14:21 +00:00
|
|
|
#include "opt_inet6.h"
|
2002-09-06 17:12:50 +00:00
|
|
|
|
|
|
|
#include <sys/param.h>
|
2018-06-13 11:11:33 +00:00
|
|
|
#include <sys/jail.h>
|
2002-09-06 17:12:50 +00:00
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/socket.h>
|
2018-06-13 11:11:33 +00:00
|
|
|
#include <sys/sockio.h>
|
|
|
|
#include <sys/mbuf.h>
|
2002-09-06 17:12:50 +00:00
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/kernel.h>
|
2014-11-07 19:13:19 +00:00
|
|
|
#include <sys/sysctl.h>
|
2018-06-13 11:11:33 +00:00
|
|
|
#include <sys/malloc.h>
|
2018-07-04 02:47:16 +00:00
|
|
|
#include <sys/proc.h>
|
2018-06-13 11:11:33 +00:00
|
|
|
|
2002-09-06 17:12:50 +00:00
|
|
|
#include <net/if.h>
|
2013-10-26 17:58:36 +00:00
|
|
|
#include <net/if_var.h>
|
2014-11-07 19:13:19 +00:00
|
|
|
#include <net/vnet.h>
|
2002-09-06 17:12:50 +00:00
|
|
|
|
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/ip.h>
|
2014-11-07 19:13:19 +00:00
|
|
|
#include <netinet/ip_encap.h>
|
2002-09-06 17:12:50 +00:00
|
|
|
#include <netinet/ip_var.h>
|
|
|
|
|
2014-11-07 19:13:19 +00:00
|
|
|
#ifdef INET6
|
|
|
|
#include <netinet/ip6.h>
|
2002-09-06 17:12:50 +00:00
|
|
|
#endif
|
|
|
|
|
2014-11-07 19:13:19 +00:00
|
|
|
#include <net/if_gre.h>
|
2002-09-06 17:12:50 +00:00
|
|
|
|
2014-11-07 19:13:19 +00:00
|
|
|
#define GRE_TTL 30
|
|
|
|
VNET_DEFINE(int, ip_gre_ttl) = GRE_TTL;
|
|
|
|
#define V_ip_gre_ttl VNET(ip_gre_ttl)
|
|
|
|
SYSCTL_INT(_net_inet_ip, OID_AUTO, grettl, CTLFLAG_VNET | CTLFLAG_RW,
|
Rework IP encapsulation handling code.
Currently it has several disadvantages:
- it uses single mutex to protect internal structures. It is used by
data- and control- path, thus there are no parallelism at all.
- it uses single list to keep encap handlers for both INET and INET6
families.
- struct encaptab keeps unneeded information (src, dst, masks, protosw),
that isn't used by code in the source tree.
- matches are prioritized and when many tunneling interfaces are
registered, encapcheck handler of each interface is invoked for each
packet. The search takes O(n) for n interfaces. All this work is done
with exclusive lock held.
What this patch includes:
- the datapath is converted to be lockless using epoch(9) KPI.
- struct encaptab now linked using CK_LIST.
- all unused fields removed from struct encaptab. Several new fields
addedr: min_length is the minimum packet length, that encapsulation
handler expects to see; exact_match is maximum number of bits, that
can return an encapsulation handler, when it wants to consume a packet.
- IPv6 and IPv4 handlers are stored in separate lists;
- added new "encap_lookup_t" method, that will be used later. It is
targeted to speedup lookup of needed interface, when gif(4)/gre(4) have
many interfaces.
- the need to use protosw structure is eliminated. The only pr_input
method was used from this structure, so I don't see the need to keep
using it.
- encap_input_t method changed to avoid using mbuf tags to store softc
pointer. Now it is passed directly trough encap_input_t method.
encap_getarg() funtions is removed.
- all sockaddr structures and code that uses them removed. We don't have
any code in the tree that uses them. All consumers use encap_attach_func()
method, that relies on invoking of encapcheck() to determine the needed
handler.
- introduced struct encap_config, it contains parameters of encap handler
that is going to be registered by encap_attach() function.
- encap handlers are stored in lists ordered by exact_match value, thus
handlers that need more bits to match will be checked first, and if
encapcheck method returns exact_match value, the search will be stopped.
- all current consumers changed to use new KPI.
Reviewed by: mmacy
Sponsored by: Yandex LLC
Differential Revision: https://reviews.freebsd.org/D15617
2018-06-05 20:51:01 +00:00
|
|
|
&VNET_NAME(ip_gre_ttl), 0, "Default TTL value for encapsulated packets");
|
2014-11-07 19:13:19 +00:00
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
static VNET_DEFINE(struct gre_list *, ipv4_hashtbl) = NULL;
|
|
|
|
#define V_ipv4_hashtbl VNET(ipv4_hashtbl)
|
|
|
|
#define GRE_HASH(src, dst) (V_ipv4_hashtbl[\
|
|
|
|
in_gre_hashval((src), (dst)) & (GRE_HASH_SIZE - 1)])
|
|
|
|
#define GRE_HASH_SC(sc) GRE_HASH((sc)->gre_oip.ip_src.s_addr,\
|
|
|
|
(sc)->gre_oip.ip_dst.s_addr)
|
|
|
|
|
|
|
|
static uint32_t
|
|
|
|
in_gre_hashval(in_addr_t src, in_addr_t dst)
|
|
|
|
{
|
|
|
|
uint32_t ret;
|
|
|
|
|
|
|
|
ret = fnv_32_buf(&src, sizeof(src), FNV1_32_INIT);
|
|
|
|
return (fnv_32_buf(&dst, sizeof(dst), ret));
|
|
|
|
}
|
|
|
|
|
|
|
|
static int
|
|
|
|
in_gre_checkdup(const struct gre_softc *sc, in_addr_t src, in_addr_t dst)
|
|
|
|
{
|
|
|
|
struct gre_softc *tmp;
|
|
|
|
|
|
|
|
if (sc->gre_family == AF_INET &&
|
|
|
|
sc->gre_oip.ip_src.s_addr == src &&
|
|
|
|
sc->gre_oip.ip_dst.s_addr == dst)
|
|
|
|
return (EEXIST);
|
|
|
|
|
|
|
|
CK_LIST_FOREACH(tmp, &GRE_HASH(src, dst), chain) {
|
|
|
|
if (tmp == sc)
|
|
|
|
continue;
|
|
|
|
if (tmp->gre_oip.ip_src.s_addr == src &&
|
|
|
|
tmp->gre_oip.ip_dst.s_addr == dst)
|
|
|
|
return (EADDRNOTAVAIL);
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
2014-11-07 19:13:19 +00:00
|
|
|
static int
|
2018-06-13 11:11:33 +00:00
|
|
|
in_gre_lookup(const struct mbuf *m, int off, int proto, void **arg)
|
2002-09-06 17:12:50 +00:00
|
|
|
{
|
2018-06-13 11:11:33 +00:00
|
|
|
const struct ip *ip;
|
2014-11-07 19:13:19 +00:00
|
|
|
struct gre_softc *sc;
|
2002-09-06 17:12:50 +00:00
|
|
|
|
2018-06-28 11:39:27 +00:00
|
|
|
if (V_ipv4_hashtbl == NULL)
|
|
|
|
return (0);
|
|
|
|
|
2018-07-04 02:47:16 +00:00
|
|
|
MPASS(in_epoch(net_epoch_preempt));
|
2018-06-13 11:11:33 +00:00
|
|
|
ip = mtod(m, const struct ip *);
|
|
|
|
CK_LIST_FOREACH(sc, &GRE_HASH(ip->ip_dst.s_addr,
|
|
|
|
ip->ip_src.s_addr), chain) {
|
|
|
|
/*
|
|
|
|
* This is an inbound packet, its ip_dst is source address
|
|
|
|
* in softc.
|
|
|
|
*/
|
|
|
|
if (sc->gre_oip.ip_src.s_addr == ip->ip_dst.s_addr &&
|
|
|
|
sc->gre_oip.ip_dst.s_addr == ip->ip_src.s_addr) {
|
|
|
|
if ((GRE2IFP(sc)->if_flags & IFF_UP) == 0)
|
|
|
|
return (0);
|
|
|
|
*arg = sc;
|
|
|
|
return (ENCAP_DRV_LOOKUP);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
in_gre_attach(struct gre_softc *sc)
|
|
|
|
{
|
2006-05-16 11:15:22 +00:00
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
sc->gre_hlen = sizeof(struct greip);
|
|
|
|
sc->gre_oip.ip_v = IPVERSION;
|
|
|
|
sc->gre_oip.ip_hl = sizeof(struct ip) >> 2;
|
|
|
|
sc->gre_oip.ip_p = IPPROTO_GRE;
|
|
|
|
gre_updatehdr(sc, &sc->gre_gihdr->gi_gre);
|
|
|
|
CK_LIST_INSERT_HEAD(&GRE_HASH_SC(sc), sc, chain);
|
|
|
|
}
|
2002-09-06 17:12:50 +00:00
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
void
|
|
|
|
in_gre_setopts(struct gre_softc *sc, u_long cmd, uint32_t value)
|
|
|
|
{
|
2003-12-30 11:41:43 +00:00
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
MPASS(cmd == GRESKEY || cmd == GRESOPTS);
|
2013-05-11 19:05:38 +00:00
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
/* NOTE: we are protected with gre_ioctl_sx lock */
|
|
|
|
MPASS(sc->gre_family == AF_INET);
|
|
|
|
CK_LIST_REMOVE(sc, chain);
|
|
|
|
GRE_WAIT();
|
|
|
|
if (cmd == GRESKEY)
|
|
|
|
sc->gre_key = value;
|
|
|
|
else
|
|
|
|
sc->gre_options = value;
|
|
|
|
in_gre_attach(sc);
|
|
|
|
}
|
2014-11-07 19:13:19 +00:00
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
int
|
|
|
|
in_gre_ioctl(struct gre_softc *sc, u_long cmd, caddr_t data)
|
|
|
|
{
|
|
|
|
struct ifreq *ifr = (struct ifreq *)data;
|
|
|
|
struct sockaddr_in *dst, *src;
|
|
|
|
struct ip *ip;
|
|
|
|
int error;
|
|
|
|
|
|
|
|
/* NOTE: we are protected with gre_ioctl_sx lock */
|
|
|
|
error = EINVAL;
|
|
|
|
switch (cmd) {
|
|
|
|
case SIOCSIFPHYADDR:
|
|
|
|
src = &((struct in_aliasreq *)data)->ifra_addr;
|
|
|
|
dst = &((struct in_aliasreq *)data)->ifra_dstaddr;
|
|
|
|
|
|
|
|
/* sanity checks */
|
|
|
|
if (src->sin_family != dst->sin_family ||
|
|
|
|
src->sin_family != AF_INET ||
|
|
|
|
src->sin_len != dst->sin_len ||
|
|
|
|
src->sin_len != sizeof(*src))
|
|
|
|
break;
|
|
|
|
if (src->sin_addr.s_addr == INADDR_ANY ||
|
|
|
|
dst->sin_addr.s_addr == INADDR_ANY) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (V_ipv4_hashtbl == NULL)
|
|
|
|
V_ipv4_hashtbl = gre_hashinit();
|
|
|
|
error = in_gre_checkdup(sc, src->sin_addr.s_addr,
|
|
|
|
dst->sin_addr.s_addr);
|
|
|
|
if (error == EADDRNOTAVAIL)
|
|
|
|
break;
|
|
|
|
if (error == EEXIST) {
|
|
|
|
/* Addresses are the same. Just return. */
|
|
|
|
error = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
ip = malloc(sizeof(struct greip) + 3 * sizeof(uint32_t),
|
|
|
|
M_GRE, M_WAITOK | M_ZERO);
|
|
|
|
ip->ip_src.s_addr = src->sin_addr.s_addr;
|
|
|
|
ip->ip_dst.s_addr = dst->sin_addr.s_addr;
|
|
|
|
if (sc->gre_family != 0) {
|
|
|
|
/* Detach existing tunnel first */
|
|
|
|
CK_LIST_REMOVE(sc, chain);
|
|
|
|
GRE_WAIT();
|
|
|
|
free(sc->gre_hdr, M_GRE);
|
|
|
|
/* XXX: should we notify about link state change? */
|
|
|
|
}
|
|
|
|
sc->gre_family = AF_INET;
|
|
|
|
sc->gre_hdr = ip;
|
|
|
|
sc->gre_oseq = 0;
|
|
|
|
sc->gre_iseq = UINT32_MAX;
|
|
|
|
in_gre_attach(sc);
|
|
|
|
break;
|
|
|
|
case SIOCGIFPSRCADDR:
|
|
|
|
case SIOCGIFPDSTADDR:
|
|
|
|
if (sc->gre_family != AF_INET) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
src = (struct sockaddr_in *)&ifr->ifr_addr;
|
|
|
|
memset(src, 0, sizeof(*src));
|
|
|
|
src->sin_family = AF_INET;
|
|
|
|
src->sin_len = sizeof(*src);
|
|
|
|
src->sin_addr = (cmd == SIOCGIFPSRCADDR) ?
|
|
|
|
sc->gre_oip.ip_src: sc->gre_oip.ip_dst;
|
|
|
|
error = prison_if(curthread->td_ucred, (struct sockaddr *)src);
|
|
|
|
if (error != 0)
|
|
|
|
memset(src, 0, sizeof(*src));
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return (error);
|
2002-09-06 17:12:50 +00:00
|
|
|
}
|
|
|
|
|
2014-08-08 01:57:15 +00:00
|
|
|
int
|
2014-11-07 19:13:19 +00:00
|
|
|
in_gre_output(struct mbuf *m, int af, int hlen)
|
2002-09-06 17:12:50 +00:00
|
|
|
{
|
2014-11-07 19:13:19 +00:00
|
|
|
struct greip *gi;
|
|
|
|
|
|
|
|
gi = mtod(m, struct greip *);
|
|
|
|
switch (af) {
|
|
|
|
case AF_INET:
|
|
|
|
/*
|
|
|
|
* gre_transmit() has used M_PREPEND() that doesn't guarantee
|
|
|
|
* m_data is contiguous more than hlen bytes. Use m_copydata()
|
|
|
|
* here to avoid m_pullup().
|
|
|
|
*/
|
|
|
|
m_copydata(m, hlen + offsetof(struct ip, ip_tos),
|
|
|
|
sizeof(u_char), &gi->gi_ip.ip_tos);
|
|
|
|
m_copydata(m, hlen + offsetof(struct ip, ip_id),
|
|
|
|
sizeof(u_short), (caddr_t)&gi->gi_ip.ip_id);
|
|
|
|
break;
|
|
|
|
#ifdef INET6
|
|
|
|
case AF_INET6:
|
|
|
|
gi->gi_ip.ip_tos = 0; /* XXX */
|
2015-04-01 22:26:39 +00:00
|
|
|
ip_fillid(&gi->gi_ip);
|
2014-11-07 19:13:19 +00:00
|
|
|
break;
|
|
|
|
#endif
|
2013-05-11 19:05:38 +00:00
|
|
|
}
|
2014-11-07 19:13:19 +00:00
|
|
|
gi->gi_ip.ip_ttl = V_ip_gre_ttl;
|
|
|
|
gi->gi_ip.ip_len = htons(m->m_pkthdr.len);
|
|
|
|
return (ip_output(m, NULL, NULL, IP_FORWARDING, NULL, NULL));
|
2002-09-06 17:12:50 +00:00
|
|
|
}
|
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
static const struct encaptab *ecookie = NULL;
|
Rework IP encapsulation handling code.
Currently it has several disadvantages:
- it uses single mutex to protect internal structures. It is used by
data- and control- path, thus there are no parallelism at all.
- it uses single list to keep encap handlers for both INET and INET6
families.
- struct encaptab keeps unneeded information (src, dst, masks, protosw),
that isn't used by code in the source tree.
- matches are prioritized and when many tunneling interfaces are
registered, encapcheck handler of each interface is invoked for each
packet. The search takes O(n) for n interfaces. All this work is done
with exclusive lock held.
What this patch includes:
- the datapath is converted to be lockless using epoch(9) KPI.
- struct encaptab now linked using CK_LIST.
- all unused fields removed from struct encaptab. Several new fields
addedr: min_length is the minimum packet length, that encapsulation
handler expects to see; exact_match is maximum number of bits, that
can return an encapsulation handler, when it wants to consume a packet.
- IPv6 and IPv4 handlers are stored in separate lists;
- added new "encap_lookup_t" method, that will be used later. It is
targeted to speedup lookup of needed interface, when gif(4)/gre(4) have
many interfaces.
- the need to use protosw structure is eliminated. The only pr_input
method was used from this structure, so I don't see the need to keep
using it.
- encap_input_t method changed to avoid using mbuf tags to store softc
pointer. Now it is passed directly trough encap_input_t method.
encap_getarg() funtions is removed.
- all sockaddr structures and code that uses them removed. We don't have
any code in the tree that uses them. All consumers use encap_attach_func()
method, that relies on invoking of encapcheck() to determine the needed
handler.
- introduced struct encap_config, it contains parameters of encap handler
that is going to be registered by encap_attach() function.
- encap handlers are stored in lists ordered by exact_match value, thus
handlers that need more bits to match will be checked first, and if
encapcheck method returns exact_match value, the search will be stopped.
- all current consumers changed to use new KPI.
Reviewed by: mmacy
Sponsored by: Yandex LLC
Differential Revision: https://reviews.freebsd.org/D15617
2018-06-05 20:51:01 +00:00
|
|
|
static const struct encap_config ipv4_encap_cfg = {
|
|
|
|
.proto = IPPROTO_GRE,
|
|
|
|
.min_length = sizeof(struct greip) + sizeof(struct ip),
|
2018-06-13 11:11:33 +00:00
|
|
|
.exact_match = ENCAP_DRV_LOOKUP,
|
|
|
|
.lookup = in_gre_lookup,
|
Rework IP encapsulation handling code.
Currently it has several disadvantages:
- it uses single mutex to protect internal structures. It is used by
data- and control- path, thus there are no parallelism at all.
- it uses single list to keep encap handlers for both INET and INET6
families.
- struct encaptab keeps unneeded information (src, dst, masks, protosw),
that isn't used by code in the source tree.
- matches are prioritized and when many tunneling interfaces are
registered, encapcheck handler of each interface is invoked for each
packet. The search takes O(n) for n interfaces. All this work is done
with exclusive lock held.
What this patch includes:
- the datapath is converted to be lockless using epoch(9) KPI.
- struct encaptab now linked using CK_LIST.
- all unused fields removed from struct encaptab. Several new fields
addedr: min_length is the minimum packet length, that encapsulation
handler expects to see; exact_match is maximum number of bits, that
can return an encapsulation handler, when it wants to consume a packet.
- IPv6 and IPv4 handlers are stored in separate lists;
- added new "encap_lookup_t" method, that will be used later. It is
targeted to speedup lookup of needed interface, when gif(4)/gre(4) have
many interfaces.
- the need to use protosw structure is eliminated. The only pr_input
method was used from this structure, so I don't see the need to keep
using it.
- encap_input_t method changed to avoid using mbuf tags to store softc
pointer. Now it is passed directly trough encap_input_t method.
encap_getarg() funtions is removed.
- all sockaddr structures and code that uses them removed. We don't have
any code in the tree that uses them. All consumers use encap_attach_func()
method, that relies on invoking of encapcheck() to determine the needed
handler.
- introduced struct encap_config, it contains parameters of encap handler
that is going to be registered by encap_attach() function.
- encap handlers are stored in lists ordered by exact_match value, thus
handlers that need more bits to match will be checked first, and if
encapcheck method returns exact_match value, the search will be stopped.
- all current consumers changed to use new KPI.
Reviewed by: mmacy
Sponsored by: Yandex LLC
Differential Revision: https://reviews.freebsd.org/D15617
2018-06-05 20:51:01 +00:00
|
|
|
.input = gre_input
|
|
|
|
};
|
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
void
|
|
|
|
in_gre_init(void)
|
2002-09-06 17:12:50 +00:00
|
|
|
{
|
|
|
|
|
2018-06-13 11:11:33 +00:00
|
|
|
if (!IS_DEFAULT_VNET(curvnet))
|
|
|
|
return;
|
|
|
|
ecookie = ip_encap_attach(&ipv4_encap_cfg, NULL, M_WAITOK);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
in_gre_uninit(void)
|
|
|
|
{
|
|
|
|
|
|
|
|
if (IS_DEFAULT_VNET(curvnet))
|
|
|
|
ip_encap_detach(ecookie);
|
|
|
|
if (V_ipv4_hashtbl != NULL)
|
|
|
|
gre_hashdestroy(V_ipv4_hashtbl);
|
2002-09-06 17:12:50 +00:00
|
|
|
}
|