[mirror_ubuntu-artful-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>

struct nft_rbtree {
	rwlock_t		lock;
	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)
{
	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;

	read_lock_bh(&priv->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;
			if (interval &&
			    nft_rbtree_equal(set, this, interval) &&
			    nft_rbtree_interval_end(this) &&
			    !nft_rbtree_interval_end(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;
			read_unlock_bh(&priv->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)) {
		read_unlock_bh(&priv->lock);
		*ext = &interval->ext;
		return true;
	}
out:
	read_unlock_bh(&priv->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_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 if (nft_set_elem_active(&rbe->ext, genmask)) {
				*ext = &rbe->ext;
				return -EEXIST;
			} else {
				p = &parent->rb_left;
			}
		}
	}
	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 *priv = nft_set_priv(set);
	struct nft_rbtree_elem *rbe = elem->priv;
	int err;

	write_lock_bh(&priv->lock);
	err = __nft_rbtree_insert(net, set, rbe, ext);
	write_unlock_bh(&priv->lock);

	return err;
}

static void nft_rbtree_remove(const struct net *net,
			      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;

	write_lock_bh(&priv->lock);
	rb_erase(&rbe->node, &priv->root);
	write_unlock_bh(&priv->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_flush(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_flush(net, set, rbe);
			return rbe;
		}
	}
	return NULL;
}

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

	read_lock_bh(&priv->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) {
			read_unlock_bh(&priv->lock);
			return;
		}
cont:
		iter->count++;
	}
	read_unlock_bh(&priv->lock);
}

static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[],
					const struct nft_set_desc *desc)
{
	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);

	rwlock_init(&priv->lock);
	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)
{
	if (desc->size)
		est->size = sizeof(struct nft_rbtree) +
			    desc->size * sizeof(struct nft_rbtree_elem);
	else
		est->size = ~0;

	est->lookup = NFT_SET_CLASS_O_LOG_N;
	est->space  = NFT_SET_CLASS_O_N;

	return true;
}

static struct nft_set_type nft_rbtree_type;
static struct nft_set_ops nft_rbtree_ops __read_mostly = {
	.type		= &nft_rbtree_type,
	.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,
	.flush		= nft_rbtree_flush,
	.activate	= nft_rbtree_activate,
	.lookup		= nft_rbtree_lookup,
	.walk		= nft_rbtree_walk,
	.features	= NFT_SET_INTERVAL | NFT_SET_MAP | NFT_SET_OBJECT,
};

static struct nft_set_type nft_rbtree_type __read_mostly = {
	.ops		= &nft_rbtree_ops,
	.owner		= THIS_MODULE,
};

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

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

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
	21	struct nft_rbtree {
03e5fd0e	22	rwlock_t lock;
20a69341 PM	23	struct rb_root root;
	24	};
	25
	26	struct nft_rbtree_elem {
	27	struct rb_node node;
fe2811eb	28	struct nft_set_ext ext;
20a69341 PM	29	};
20a69341 PM	30
ef1d20e0 PNA	31	static bool nft_rbtree_interval_end(const struct nft_rbtree_elem *rbe)
	32	{
	33	return nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) &&
	34	(*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END);
	35	}
cc02e457	36
e701001e PNA	37	static bool nft_rbtree_equal(const struct nft_set set, const void this,
	38	const struct nft_rbtree_elem *interval)
	39	{
	40	return memcmp(this, nft_set_ext_key(&interval->ext), set->klen) == 0;
	41	}
	42
42a55769 PNA	43	static bool nft_rbtree_lookup(const struct net net, const struct nft_set set,
42a55769 PNA	44	const u32 key, const struct nft_set_ext *ext)
20a69341	45	{
03e5fd0e	46	struct nft_rbtree *priv = nft_set_priv(set);
20a69341	47	const struct nft_rbtree_elem rbe, interval = NULL;
42a55769	48	u8 genmask = nft_genmask_cur(net);
16c45eda	49	const struct rb_node *parent;
e701001e	50	const void *this;
20a69341 PM	51	int d;
20a69341 PM	52
03e5fd0e	53	read_lock_bh(&priv->lock);
16c45eda	54	parent = priv->root.rb_node;
20a69341 PM	55	while (parent != NULL) {
	56	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
	57
e701001e PNA	58	this = nft_set_ext_key(&rbe->ext);
e701001e PNA	59	d = memcmp(this, key, set->klen);
20a69341 PM	60	if (d < 0) {
20a69341 PM	61	parent = parent->rb_left;
f9121355 PNA	62	if (interval &&
	63	nft_rbtree_equal(set, this, interval) &&
	64	nft_rbtree_interval_end(this) &&
	65	!nft_rbtree_interval_end(interval))
e701001e	66	continue;
20a69341 PM	67	interval = rbe;
	68	} else if (d > 0)
	69	parent = parent->rb_right;
	70	else {
cc02e457 PM	71	if (!nft_set_elem_active(&rbe->ext, genmask)) {
	72	parent = parent->rb_left;
	73	continue;
	74	}
ef1d20e0	75	if (nft_rbtree_interval_end(rbe))
20a69341	76	goto out;
03e5fd0e	77	read_unlock_bh(&priv->lock);
b2832dd6 PM	78
b2832dd6 PM	79	*ext = &rbe->ext;
20a69341 PM	80	return true;
	81	}
	82	}
	83
c1eda3c6 PNA	84	if (set->flags & NFT_SET_INTERVAL && interval != NULL &&
	85	nft_set_elem_active(&interval->ext, genmask) &&
	86	!nft_rbtree_interval_end(interval)) {
03e5fd0e	87	read_unlock_bh(&priv->lock);
c1eda3c6 PNA	88	*ext = &interval->ext;
c1eda3c6 PNA	89	return true;
20a69341 PM	90	}
20a69341 PM	91	out:
03e5fd0e	92	read_unlock_bh(&priv->lock);
20a69341 PM	93	return false;
	94	}
	95
42a55769	96	static int __nft_rbtree_insert(const struct net net, const struct nft_set set,
c016c7e4 PNA	97	struct nft_rbtree_elem *new,
c016c7e4 PNA	98	struct nft_set_ext **ext)
20a69341 PM	99	{
20a69341 PM	100	struct nft_rbtree *priv = nft_set_priv(set);
42a55769	101	u8 genmask = nft_genmask_next(net);
20a69341 PM	102	struct nft_rbtree_elem *rbe;
	103	struct rb_node parent, *p;
	104	int d;
	105
	106	parent = NULL;
	107	p = &priv->root.rb_node;
	108	while (*p != NULL) {
	109	parent = *p;
	110	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
e562d860 PM	111	d = memcmp(nft_set_ext_key(&rbe->ext),
	112	nft_set_ext_key(&new->ext),
	113	set->klen);
20a69341 PM	114	if (d < 0)
	115	p = &parent->rb_left;
	116	else if (d > 0)
	117	p = &parent->rb_right;
cc02e457	118	else {
d2df92e9 PNA	119	if (nft_rbtree_interval_end(rbe) &&
	120	!nft_rbtree_interval_end(new)) {
	121	p = &parent->rb_left;
	122	} else if (!nft_rbtree_interval_end(rbe) &&
	123	nft_rbtree_interval_end(new)) {
	124	p = &parent->rb_right;
	125	} else if (nft_set_elem_active(&rbe->ext, genmask)) {
	126	*ext = &rbe->ext;
	127	return -EEXIST;
	128	} else {
	129	p = &parent->rb_left;
e701001e	130	}
cc02e457	131	}
20a69341 PM	132	}
	133	rb_link_node(&new->node, parent, p);
	134	rb_insert_color(&new->node, &priv->root);
	135	return 0;
	136	}
	137
42a55769	138	static int nft_rbtree_insert(const struct net net, const struct nft_set set,
c016c7e4 PNA	139	const struct nft_set_elem *elem,
c016c7e4 PNA	140	struct nft_set_ext **ext)
20a69341	141	{
03e5fd0e	142	struct nft_rbtree *priv = nft_set_priv(set);
fe2811eb	143	struct nft_rbtree_elem *rbe = elem->priv;
20a69341 PM	144	int err;
20a69341 PM	145
03e5fd0e	146	write_lock_bh(&priv->lock);
c016c7e4	147	err = __nft_rbtree_insert(net, set, rbe, ext);
03e5fd0e	148	write_unlock_bh(&priv->lock);
fe2811eb	149
20a69341 PM	150	return err;
	151	}
	152
5cb82a38 PNA	153	static void nft_rbtree_remove(const struct net *net,
5cb82a38 PNA	154	const struct nft_set *set,
20a69341 PM	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
03e5fd0e	160	write_lock_bh(&priv->lock);
20a69341	161	rb_erase(&rbe->node, &priv->root);
03e5fd0e	162	write_unlock_bh(&priv->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
1ba1c414 PNA	174	static bool nft_rbtree_flush(const struct net *net,
1ba1c414 PNA	175	const struct nft_set set, void priv)
37df5301 PNA	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	}
1ba1c414	216	nft_rbtree_flush(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,
de70185d	224	struct nft_set *set,
20a69341 PM	225	struct nft_set_iter *iter)
20a69341 PM	226	{
03e5fd0e	227	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
03e5fd0e	232	read_lock_bh(&priv->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	244	if (iter->err < 0) {
03e5fd0e	245	read_unlock_bh(&priv->lock);
20a69341	246	return;
7632667d	247	}
20a69341 PM	248	cont:
	249	iter->count++;
	250	}
03e5fd0e	251	read_unlock_bh(&priv->lock);
20a69341 PM	252	}
20a69341 PM	253
347b408d PNA	254	static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[],
347b408d PNA	255	const struct nft_set_desc *desc)
20a69341 PM	256	{
	257	return sizeof(struct nft_rbtree);
	258	}
	259
	260	static int nft_rbtree_init(const struct nft_set *set,
c50b960c	261	const struct nft_set_desc *desc,
20a69341 PM	262	const struct nlattr * const nla[])
	263	{
	264	struct nft_rbtree *priv = nft_set_priv(set);
	265
03e5fd0e	266	rwlock_init(&priv->lock);
20a69341 PM	267	priv->root = RB_ROOT;
	268	return 0;
	269	}
	270
	271	static void nft_rbtree_destroy(const struct nft_set *set)
	272	{
	273	struct nft_rbtree *priv = nft_set_priv(set);
	274	struct nft_rbtree_elem *rbe;
	275	struct rb_node *node;
	276
	277	while ((node = priv->root.rb_node) != NULL) {
	278	rb_erase(node, &priv->root);
	279	rbe = rb_entry(node, struct nft_rbtree_elem, node);
61f9e292	280	nft_set_elem_destroy(set, rbe, true);
20a69341 PM	281	}
	282	}
	283
c50b960c PM	284	static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features,
	285	struct nft_set_estimate *est)
	286	{
c50b960c	287	if (desc->size)
080ed636 PNA	288	est->size = sizeof(struct nft_rbtree) +
080ed636 PNA	289	desc->size * sizeof(struct nft_rbtree_elem);
c50b960c	290	else
080ed636	291	est->size = ~0;
c50b960c	292
55af753c	293	est->lookup = NFT_SET_CLASS_O_LOG_N;
0b5a7874	294	est->space = NFT_SET_CLASS_O_N;
c50b960c PM	295
	296	return true;
	297	}
	298
2b664957	299	static struct nft_set_type nft_rbtree_type;
20a69341	300	static struct nft_set_ops nft_rbtree_ops __read_mostly = {
2b664957	301	.type = &nft_rbtree_type,
20a69341	302	.privsize = nft_rbtree_privsize,
fe2811eb	303	.elemsize = offsetof(struct nft_rbtree_elem, ext),
c50b960c	304	.estimate = nft_rbtree_estimate,
20a69341 PM	305	.init = nft_rbtree_init,
	306	.destroy = nft_rbtree_destroy,
	307	.insert = nft_rbtree_insert,
	308	.remove = nft_rbtree_remove,
cc02e457	309	.deactivate = nft_rbtree_deactivate,
1ba1c414	310	.flush = nft_rbtree_flush,
cc02e457	311	.activate = nft_rbtree_activate,
20a69341 PM	312	.lookup = nft_rbtree_lookup,
20a69341 PM	313	.walk = nft_rbtree_walk,
7286ff7f	314	.features = NFT_SET_INTERVAL \| NFT_SET_MAP \| NFT_SET_OBJECT,
2b664957 PNA	315	};
	316
	317	static struct nft_set_type nft_rbtree_type __read_mostly = {
	318	.ops = &nft_rbtree_ops,
20a69341 PM	319	.owner = THIS_MODULE,
	320	};
	321
	322	static int __init nft_rbtree_module_init(void)
	323	{
2b664957	324	return nft_register_set(&nft_rbtree_type);
20a69341 PM	325	}
	326
	327	static void __exit nft_rbtree_module_exit(void)
	328	{
2b664957	329	nft_unregister_set(&nft_rbtree_type);
20a69341 PM	330	}
	331
	332	module_init(nft_rbtree_module_init);
	333	module_exit(nft_rbtree_module_exit);
	334
	335	MODULE_LICENSE("GPL");
	336	MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
	337	MODULE_ALIAS_NFT_SET();