[mirror_ubuntu-zesty-kernel.git] / net / netfilter / nft_set_rbtree.c

/*
 * Copyright (c) 2008-2009 Patrick McHardy <kaber@trash.net>
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation.
 *
 * Development of this code funded by Astaro AG (http://www.astaro.com/)
 */

#include <linux/kernel.h>
#include <linux/init.h>
#include <linux/module.h>
#include <linux/list.h>
#include <linux/rbtree.h>
#include <linux/netlink.h>
#include <linux/netfilter.h>
#include <linux/netfilter/nf_tables.h>
#include <net/netfilter/nf_tables.h>

static DEFINE_SPINLOCK(nft_rbtree_lock);

struct nft_rbtree {
	struct rb_root		root;
};

struct nft_rbtree_elem {
	struct rb_node		node;
	struct nft_set_ext	ext;
};

static bool nft_rbtree_interval_end(const struct nft_rbtree_elem *rbe)
{
	return nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) &&
	       (*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END);
}

static bool nft_rbtree_equal(const struct nft_set *set, const void *this,
			     const struct nft_rbtree_elem *interval)
{
	return memcmp(this, nft_set_ext_key(&interval->ext), set->klen) == 0;
}

static bool nft_rbtree_lookup(const struct net *net, const struct nft_set *set,
			      const u32 *key, const struct nft_set_ext **ext)
{
	const struct nft_rbtree *priv = nft_set_priv(set);
	const struct nft_rbtree_elem *rbe, *interval = NULL;
	u8 genmask = nft_genmask_cur(net);
	const struct rb_node *parent;
	const void *this;
	int d;

	spin_lock_bh(&nft_rbtree_lock);
	parent = priv->root.rb_node;
	while (parent != NULL) {
		rbe = rb_entry(parent, struct nft_rbtree_elem, node);

		this = nft_set_ext_key(&rbe->ext);
		d = memcmp(this, key, set->klen);
		if (d < 0) {
			parent = parent->rb_left;
			/* In case of adjacent ranges, we always see the high
			 * part of the range in first place, before the low one.
			 * So don't update interval if the keys are equal.
			 */
			if (interval && nft_rbtree_equal(set, this, interval))
				continue;
			interval = rbe;
		} else if (d > 0)
			parent = parent->rb_right;
		else {
			if (!nft_set_elem_active(&rbe->ext, genmask)) {
				parent = parent->rb_left;
				continue;
			}
			if (nft_rbtree_interval_end(rbe))
				goto out;
			spin_unlock_bh(&nft_rbtree_lock);

			*ext = &rbe->ext;
			return true;
		}
	}

	if (set->flags & NFT_SET_INTERVAL && interval != NULL &&
	    nft_set_elem_active(&interval->ext, genmask) &&
	    !nft_rbtree_interval_end(interval)) {
		spin_unlock_bh(&nft_rbtree_lock);
		*ext = &interval->ext;
		return true;
	}
out:
	spin_unlock_bh(&nft_rbtree_lock);
	return false;
}

static int __nft_rbtree_insert(const struct net *net, const struct nft_set *set,
			       struct nft_rbtree_elem *new,
			       struct nft_set_ext **ext)
{
	struct nft_rbtree *priv = nft_set_priv(set);
	u8 genmask = nft_genmask_next(net);
	struct nft_rbtree_elem *rbe;
	struct rb_node *parent, **p;
	int d;

	parent = NULL;
	p = &priv->root.rb_node;
	while (*p != NULL) {
		parent = *p;
		rbe = rb_entry(parent, struct nft_rbtree_elem, node);
		d = memcmp(nft_set_ext_key(&rbe->ext),
			   nft_set_ext_key(&new->ext),
			   set->klen);
		if (d < 0)
			p = &parent->rb_left;
		else if (d > 0)
			p = &parent->rb_right;
		else {
			if (nft_set_elem_active(&rbe->ext, genmask)) {
				if (nft_rbtree_interval_end(rbe) &&
				    !nft_rbtree_interval_end(new))
					p = &parent->rb_left;
				else if (!nft_rbtree_interval_end(rbe) &&
					 nft_rbtree_interval_end(new))
					p = &parent->rb_right;
				else {
					*ext = &rbe->ext;
					return -EEXIST;
				}
			}
		}
	}
	rb_link_node(&new->node, parent, p);
	rb_insert_color(&new->node, &priv->root);
	return 0;
}

static int nft_rbtree_insert(const struct net *net, const struct nft_set *set,
			     const struct nft_set_elem *elem,
			     struct nft_set_ext **ext)
{
	struct nft_rbtree_elem *rbe = elem->priv;
	int err;

	spin_lock_bh(&nft_rbtree_lock);
	err = __nft_rbtree_insert(net, set, rbe, ext);
	spin_unlock_bh(&nft_rbtree_lock);

	return err;
}

static void nft_rbtree_remove(const struct nft_set *set,
			      const struct nft_set_elem *elem)
{
	struct nft_rbtree *priv = nft_set_priv(set);
	struct nft_rbtree_elem *rbe = elem->priv;

	spin_lock_bh(&nft_rbtree_lock);
	rb_erase(&rbe->node, &priv->root);
	spin_unlock_bh(&nft_rbtree_lock);
}

static void nft_rbtree_activate(const struct net *net,
				const struct nft_set *set,
				const struct nft_set_elem *elem)
{
	struct nft_rbtree_elem *rbe = elem->priv;

	nft_set_elem_change_active(net, set, &rbe->ext);
}

static bool nft_rbtree_deactivate_one(const struct net *net,
				      const struct nft_set *set, void *priv)
{
	struct nft_rbtree_elem *rbe = priv;

	nft_set_elem_change_active(net, set, &rbe->ext);
	return true;
}

static void *nft_rbtree_deactivate(const struct net *net,
				   const struct nft_set *set,
				   const struct nft_set_elem *elem)
{
	const struct nft_rbtree *priv = nft_set_priv(set);
	const struct rb_node *parent = priv->root.rb_node;
	struct nft_rbtree_elem *rbe, *this = elem->priv;
	u8 genmask = nft_genmask_next(net);
	int d;

	while (parent != NULL) {
		rbe = rb_entry(parent, struct nft_rbtree_elem, node);

		d = memcmp(nft_set_ext_key(&rbe->ext), &elem->key.val,
					   set->klen);
		if (d < 0)
			parent = parent->rb_left;
		else if (d > 0)
			parent = parent->rb_right;
		else {
			if (!nft_set_elem_active(&rbe->ext, genmask)) {
				parent = parent->rb_left;
				continue;
			}
			if (nft_rbtree_interval_end(rbe) &&
			    !nft_rbtree_interval_end(this)) {
				parent = parent->rb_left;
				continue;
			} else if (!nft_rbtree_interval_end(rbe) &&
				   nft_rbtree_interval_end(this)) {
				parent = parent->rb_right;
				continue;
			}
			nft_rbtree_deactivate_one(net, set, rbe);
			return rbe;
		}
	}
	return NULL;
}

static void nft_rbtree_walk(const struct nft_ctx *ctx,
			    const struct nft_set *set,
			    struct nft_set_iter *iter)
{
	const struct nft_rbtree *priv = nft_set_priv(set);
	struct nft_rbtree_elem *rbe;
	struct nft_set_elem elem;
	struct rb_node *node;

	spin_lock_bh(&nft_rbtree_lock);
	for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
		rbe = rb_entry(node, struct nft_rbtree_elem, node);

		if (iter->count < iter->skip)
			goto cont;
		if (!nft_set_elem_active(&rbe->ext, iter->genmask))
			goto cont;

		elem.priv = rbe;

		iter->err = iter->fn(ctx, set, iter, &elem);
		if (iter->err < 0) {
			spin_unlock_bh(&nft_rbtree_lock);
			return;
		}
cont:
		iter->count++;
	}
	spin_unlock_bh(&nft_rbtree_lock);
}

static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[])
{
	return sizeof(struct nft_rbtree);
}

static int nft_rbtree_init(const struct nft_set *set,
			   const struct nft_set_desc *desc,
			   const struct nlattr * const nla[])
{
	struct nft_rbtree *priv = nft_set_priv(set);

	priv->root = RB_ROOT;
	return 0;
}

static void nft_rbtree_destroy(const struct nft_set *set)
{
	struct nft_rbtree *priv = nft_set_priv(set);
	struct nft_rbtree_elem *rbe;
	struct rb_node *node;

	while ((node = priv->root.rb_node) != NULL) {
		rb_erase(node, &priv->root);
		rbe = rb_entry(node, struct nft_rbtree_elem, node);
		nft_set_elem_destroy(set, rbe, true);
	}
}

static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features,
				struct nft_set_estimate *est)
{
	unsigned int nsize;

	nsize = sizeof(struct nft_rbtree_elem);
	if (desc->size)
		est->size = sizeof(struct nft_rbtree) + desc->size * nsize;
	else
		est->size = nsize;

	est->class = NFT_SET_CLASS_O_LOG_N;

	return true;
}

static struct nft_set_ops nft_rbtree_ops __read_mostly = {
	.privsize	= nft_rbtree_privsize,
	.elemsize	= offsetof(struct nft_rbtree_elem, ext),
	.estimate	= nft_rbtree_estimate,
	.init		= nft_rbtree_init,
	.destroy	= nft_rbtree_destroy,
	.insert		= nft_rbtree_insert,
	.remove		= nft_rbtree_remove,
	.deactivate	= nft_rbtree_deactivate,
	.deactivate_one	= nft_rbtree_deactivate_one,
	.activate	= nft_rbtree_activate,
	.lookup		= nft_rbtree_lookup,
	.walk		= nft_rbtree_walk,
	.features	= NFT_SET_INTERVAL | NFT_SET_MAP,
	.owner		= THIS_MODULE,
};

static int __init nft_rbtree_module_init(void)
{
	return nft_register_set(&nft_rbtree_ops);
}

static void __exit nft_rbtree_module_exit(void)
{
	nft_unregister_set(&nft_rbtree_ops);
}

module_init(nft_rbtree_module_init);
module_exit(nft_rbtree_module_exit);

MODULE_LICENSE("GPL");
MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
MODULE_ALIAS_NFT_SET();
Commit	Line	Data
20a69341 PM	1	/*
	2	* Copyright (c) 2008-2009 Patrick McHardy <kaber@trash.net>
	3	*
	4	* This program is free software; you can redistribute it and/or modify
	5	* it under the terms of the GNU General Public License version 2 as
	6	* published by the Free Software Foundation.
	7	*
	8	* Development of this code funded by Astaro AG (http://www.astaro.com/)
	9	*/
	10
	11	#include <linux/kernel.h>
	12	#include <linux/init.h>
	13	#include <linux/module.h>
	14	#include <linux/list.h>
	15	#include <linux/rbtree.h>
	16	#include <linux/netlink.h>
	17	#include <linux/netfilter.h>
	18	#include <linux/netfilter/nf_tables.h>
	19	#include <net/netfilter/nf_tables.h>
	20
7632667d PNA	21	static DEFINE_SPINLOCK(nft_rbtree_lock);
7632667d PNA	22
20a69341 PM	23	struct nft_rbtree {
	24	struct rb_root root;
	25	};
	26
	27	struct nft_rbtree_elem {
	28	struct rb_node node;
fe2811eb	29	struct nft_set_ext ext;
20a69341 PM	30	};
20a69341 PM	31
ef1d20e0 PNA	32	static bool nft_rbtree_interval_end(const struct nft_rbtree_elem *rbe)
	33	{
	34	return nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) &&
	35	(*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END);
	36	}
cc02e457	37
e701001e PNA	38	static bool nft_rbtree_equal(const struct nft_set set, const void this,
	39	const struct nft_rbtree_elem *interval)
	40	{
	41	return memcmp(this, nft_set_ext_key(&interval->ext), set->klen) == 0;
	42	}
	43
42a55769 PNA	44	static bool nft_rbtree_lookup(const struct net net, const struct nft_set set,
42a55769 PNA	45	const u32 key, const struct nft_set_ext *ext)
20a69341 PM	46	{
	47	const struct nft_rbtree *priv = nft_set_priv(set);
	48	const struct nft_rbtree_elem rbe, interval = NULL;
42a55769	49	u8 genmask = nft_genmask_cur(net);
16c45eda	50	const struct rb_node *parent;
e701001e	51	const void *this;
20a69341 PM	52	int d;
20a69341 PM	53
7632667d	54	spin_lock_bh(&nft_rbtree_lock);
16c45eda	55	parent = priv->root.rb_node;
20a69341 PM	56	while (parent != NULL) {
	57	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
	58
e701001e PNA	59	this = nft_set_ext_key(&rbe->ext);
e701001e PNA	60	d = memcmp(this, key, set->klen);
20a69341 PM	61	if (d < 0) {
20a69341 PM	62	parent = parent->rb_left;
e701001e PNA	63	/* In case of adjacent ranges, we always see the high
	64	* part of the range in first place, before the low one.
	65	* So don't update interval if the keys are equal.
	66	*/
	67	if (interval && nft_rbtree_equal(set, this, interval))
	68	continue;
20a69341 PM	69	interval = rbe;
	70	} else if (d > 0)
	71	parent = parent->rb_right;
	72	else {
cc02e457 PM	73	if (!nft_set_elem_active(&rbe->ext, genmask)) {
	74	parent = parent->rb_left;
	75	continue;
	76	}
ef1d20e0	77	if (nft_rbtree_interval_end(rbe))
20a69341	78	goto out;
7632667d	79	spin_unlock_bh(&nft_rbtree_lock);
b2832dd6 PM	80
b2832dd6 PM	81	*ext = &rbe->ext;
20a69341 PM	82	return true;
	83	}
	84	}
	85
c1eda3c6 PNA	86	if (set->flags & NFT_SET_INTERVAL && interval != NULL &&
	87	nft_set_elem_active(&interval->ext, genmask) &&
	88	!nft_rbtree_interval_end(interval)) {
	89	spin_unlock_bh(&nft_rbtree_lock);
	90	*ext = &interval->ext;
	91	return true;
20a69341 PM	92	}
20a69341 PM	93	out:
7632667d	94	spin_unlock_bh(&nft_rbtree_lock);
20a69341 PM	95	return false;
	96	}
	97
42a55769	98	static int __nft_rbtree_insert(const struct net net, const struct nft_set set,
c016c7e4 PNA	99	struct nft_rbtree_elem *new,
c016c7e4 PNA	100	struct nft_set_ext **ext)
20a69341 PM	101	{
20a69341 PM	102	struct nft_rbtree *priv = nft_set_priv(set);
42a55769	103	u8 genmask = nft_genmask_next(net);
20a69341 PM	104	struct nft_rbtree_elem *rbe;
	105	struct rb_node parent, *p;
	106	int d;
	107
	108	parent = NULL;
	109	p = &priv->root.rb_node;
	110	while (*p != NULL) {
	111	parent = *p;
	112	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
e562d860 PM	113	d = memcmp(nft_set_ext_key(&rbe->ext),
	114	nft_set_ext_key(&new->ext),
	115	set->klen);
20a69341 PM	116	if (d < 0)
	117	p = &parent->rb_left;
	118	else if (d > 0)
	119	p = &parent->rb_right;
cc02e457	120	else {
e701001e PNA	121	if (nft_set_elem_active(&rbe->ext, genmask)) {
	122	if (nft_rbtree_interval_end(rbe) &&
	123	!nft_rbtree_interval_end(new))
	124	p = &parent->rb_left;
	125	else if (!nft_rbtree_interval_end(rbe) &&
	126	nft_rbtree_interval_end(new))
	127	p = &parent->rb_right;
c016c7e4 PNA	128	else {
c016c7e4 PNA	129	*ext = &rbe->ext;
e701001e	130	return -EEXIST;
c016c7e4	131	}
e701001e	132	}
cc02e457	133	}
20a69341 PM	134	}
	135	rb_link_node(&new->node, parent, p);
	136	rb_insert_color(&new->node, &priv->root);
	137	return 0;
	138	}
	139
42a55769	140	static int nft_rbtree_insert(const struct net net, const struct nft_set set,
c016c7e4 PNA	141	const struct nft_set_elem *elem,
c016c7e4 PNA	142	struct nft_set_ext **ext)
20a69341	143	{
fe2811eb	144	struct nft_rbtree_elem *rbe = elem->priv;
20a69341 PM	145	int err;
20a69341 PM	146
7632667d	147	spin_lock_bh(&nft_rbtree_lock);
c016c7e4	148	err = __nft_rbtree_insert(net, set, rbe, ext);
7632667d	149	spin_unlock_bh(&nft_rbtree_lock);
fe2811eb	150
20a69341 PM	151	return err;
	152	}
	153
	154	static void nft_rbtree_remove(const struct nft_set *set,
	155	const struct nft_set_elem *elem)
	156	{
	157	struct nft_rbtree *priv = nft_set_priv(set);
cc02e457	158	struct nft_rbtree_elem *rbe = elem->priv;
20a69341	159
7632667d	160	spin_lock_bh(&nft_rbtree_lock);
20a69341	161	rb_erase(&rbe->node, &priv->root);
7632667d	162	spin_unlock_bh(&nft_rbtree_lock);
20a69341 PM	163	}
20a69341 PM	164
42a55769 PNA	165	static void nft_rbtree_activate(const struct net *net,
42a55769 PNA	166	const struct nft_set *set,
cc02e457 PM	167	const struct nft_set_elem *elem)
	168	{
	169	struct nft_rbtree_elem *rbe = elem->priv;
	170
42a55769	171	nft_set_elem_change_active(net, set, &rbe->ext);
cc02e457 PM	172	}
cc02e457 PM	173
37df5301 PNA	174	static bool nft_rbtree_deactivate_one(const struct net *net,
	175	const struct nft_set set, void priv)
	176	{
	177	struct nft_rbtree_elem *rbe = priv;
	178
	179	nft_set_elem_change_active(net, set, &rbe->ext);
	180	return true;
	181	}
	182
42a55769 PNA	183	static void nft_rbtree_deactivate(const struct net net,
42a55769 PNA	184	const struct nft_set *set,
cc02e457	185	const struct nft_set_elem *elem)
20a69341 PM	186	{
	187	const struct nft_rbtree *priv = nft_set_priv(set);
	188	const struct rb_node *parent = priv->root.rb_node;
e701001e	189	struct nft_rbtree_elem rbe, this = elem->priv;
42a55769	190	u8 genmask = nft_genmask_next(net);
20a69341 PM	191	int d;
	192
	193	while (parent != NULL) {
	194	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
	195
7d740264 PM	196	d = memcmp(nft_set_ext_key(&rbe->ext), &elem->key.val,
7d740264 PM	197	set->klen);
20a69341 PM	198	if (d < 0)
	199	parent = parent->rb_left;
	200	else if (d > 0)
	201	parent = parent->rb_right;
	202	else {
cc02e457 PM	203	if (!nft_set_elem_active(&rbe->ext, genmask)) {
	204	parent = parent->rb_left;
	205	continue;
	206	}
e701001e PNA	207	if (nft_rbtree_interval_end(rbe) &&
	208	!nft_rbtree_interval_end(this)) {
	209	parent = parent->rb_left;
	210	continue;
	211	} else if (!nft_rbtree_interval_end(rbe) &&
	212	nft_rbtree_interval_end(this)) {
	213	parent = parent->rb_right;
	214	continue;
	215	}
37df5301	216	nft_rbtree_deactivate_one(net, set, rbe);
cc02e457	217	return rbe;
20a69341 PM	218	}
20a69341 PM	219	}
cc02e457	220	return NULL;
20a69341 PM	221	}
	222
	223	static void nft_rbtree_walk(const struct nft_ctx *ctx,
	224	const struct nft_set *set,
	225	struct nft_set_iter *iter)
	226	{
	227	const struct nft_rbtree *priv = nft_set_priv(set);
fe2811eb	228	struct nft_rbtree_elem *rbe;
20a69341 PM	229	struct nft_set_elem elem;
	230	struct rb_node *node;
	231
7632667d	232	spin_lock_bh(&nft_rbtree_lock);
20a69341	233	for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
cc02e457 PM	234	rbe = rb_entry(node, struct nft_rbtree_elem, node);
cc02e457 PM	235
20a69341 PM	236	if (iter->count < iter->skip)
20a69341 PM	237	goto cont;
8588ac09	238	if (!nft_set_elem_active(&rbe->ext, iter->genmask))
cc02e457	239	goto cont;
20a69341	240
fe2811eb	241	elem.priv = rbe;
20a69341 PM	242
20a69341 PM	243	iter->err = iter->fn(ctx, set, iter, &elem);
7632667d PNA	244	if (iter->err < 0) {
7632667d PNA	245	spin_unlock_bh(&nft_rbtree_lock);
20a69341	246	return;
7632667d	247	}
20a69341 PM	248	cont:
	249	iter->count++;
	250	}
7632667d	251	spin_unlock_bh(&nft_rbtree_lock);
20a69341 PM	252	}
	253
	254	static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[])
	255	{
	256	return sizeof(struct nft_rbtree);
	257	}
	258
	259	static int nft_rbtree_init(const struct nft_set *set,
c50b960c	260	const struct nft_set_desc *desc,
20a69341 PM	261	const struct nlattr * const nla[])
	262	{
	263	struct nft_rbtree *priv = nft_set_priv(set);
	264
	265	priv->root = RB_ROOT;
	266	return 0;
	267	}
	268
	269	static void nft_rbtree_destroy(const struct nft_set *set)
	270	{
	271	struct nft_rbtree *priv = nft_set_priv(set);
	272	struct nft_rbtree_elem *rbe;
	273	struct rb_node *node;
	274
	275	while ((node = priv->root.rb_node) != NULL) {
	276	rb_erase(node, &priv->root);
	277	rbe = rb_entry(node, struct nft_rbtree_elem, node);
61f9e292	278	nft_set_elem_destroy(set, rbe, true);
20a69341 PM	279	}
	280	}
	281
c50b960c PM	282	static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features,
	283	struct nft_set_estimate *est)
	284	{
	285	unsigned int nsize;
	286
	287	nsize = sizeof(struct nft_rbtree_elem);
c50b960c PM	288	if (desc->size)
	289	est->size = sizeof(struct nft_rbtree) + desc->size * nsize;
	290	else
	291	est->size = nsize;
	292
	293	est->class = NFT_SET_CLASS_O_LOG_N;
	294
	295	return true;
	296	}
	297
20a69341 PM	298	static struct nft_set_ops nft_rbtree_ops __read_mostly = {
20a69341 PM	299	.privsize = nft_rbtree_privsize,
fe2811eb	300	.elemsize = offsetof(struct nft_rbtree_elem, ext),
c50b960c	301	.estimate = nft_rbtree_estimate,
20a69341 PM	302	.init = nft_rbtree_init,
	303	.destroy = nft_rbtree_destroy,
	304	.insert = nft_rbtree_insert,
	305	.remove = nft_rbtree_remove,
cc02e457	306	.deactivate = nft_rbtree_deactivate,
8411b644	307	.deactivate_one = nft_rbtree_deactivate_one,
cc02e457	308	.activate = nft_rbtree_activate,
20a69341 PM	309	.lookup = nft_rbtree_lookup,
	310	.walk = nft_rbtree_walk,
	311	.features = NFT_SET_INTERVAL \| NFT_SET_MAP,
	312	.owner = THIS_MODULE,
	313	};
	314
	315	static int __init nft_rbtree_module_init(void)
	316	{
	317	return nft_register_set(&nft_rbtree_ops);
	318	}
	319
	320	static void __exit nft_rbtree_module_exit(void)
	321	{
	322	nft_unregister_set(&nft_rbtree_ops);
	323	}
	324
	325	module_init(nft_rbtree_module_init);
	326	module_exit(nft_rbtree_module_exit);
	327
	328	MODULE_LICENSE("GPL");
	329	MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
	330	MODULE_ALIAS_NFT_SET();