[linux-2.6-block.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 {
	struct rb_root		root;
	rwlock_t		lock;
	seqcount_t		count;
	struct delayed_work	gc_work;
};

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,
				unsigned int seq)
{
	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;

	parent = rcu_dereference_raw(priv->root.rb_node);
	while (parent != NULL) {
		if (read_seqcount_retry(&priv->count, seq))
			return false;

		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 = rcu_dereference_raw(parent->rb_left);
			if (interval &&
			    nft_rbtree_equal(set, this, interval) &&
			    nft_rbtree_interval_end(rbe) &&
			    !nft_rbtree_interval_end(interval))
				continue;
			interval = rbe;
		} else if (d > 0)
			parent = rcu_dereference_raw(parent->rb_right);
		else {
			if (!nft_set_elem_active(&rbe->ext, genmask)) {
				parent = rcu_dereference_raw(parent->rb_left);
				continue;
			}
			if (nft_rbtree_interval_end(rbe))
				goto out;

			*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)) {
		*ext = &interval->ext;
		return true;
	}
out:
	return false;
}

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);
	unsigned int seq = read_seqcount_begin(&priv->count);
	bool ret;

	ret = __nft_rbtree_lookup(net, set, key, ext, seq);
	if (ret || !read_seqcount_retry(&priv->count, seq))
		return ret;

	read_lock_bh(&priv->lock);
	seq = read_seqcount_begin(&priv->count);
	ret = __nft_rbtree_lookup(net, set, key, ext, seq);
	read_unlock_bh(&priv->lock);

	return ret;
}

static bool __nft_rbtree_get(const struct net *net, const struct nft_set *set,
			     const u32 *key, struct nft_rbtree_elem **elem,
			     unsigned int seq, unsigned int flags, u8 genmask)
{
	struct nft_rbtree_elem *rbe, *interval = NULL;
	struct nft_rbtree *priv = nft_set_priv(set);
	const struct rb_node *parent;
	const void *this;
	int d;

	parent = rcu_dereference_raw(priv->root.rb_node);
	while (parent != NULL) {
		if (read_seqcount_retry(&priv->count, seq))
			return false;

		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 = rcu_dereference_raw(parent->rb_left);
			if (!(flags & NFT_SET_ELEM_INTERVAL_END))
				interval = rbe;
		} else if (d > 0) {
			parent = rcu_dereference_raw(parent->rb_right);
			if (flags & NFT_SET_ELEM_INTERVAL_END)
				interval = rbe;
		} else {
			if (!nft_set_elem_active(&rbe->ext, genmask))
				parent = rcu_dereference_raw(parent->rb_left);

			if (!nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) ||
			    (*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END) ==
			    (flags & NFT_SET_ELEM_INTERVAL_END)) {
				*elem = rbe;
				return true;
			}
			return false;
		}
	}

	if (set->flags & NFT_SET_INTERVAL && interval != NULL &&
	    nft_set_elem_active(&interval->ext, genmask) &&
	    ((!nft_rbtree_interval_end(interval) &&
	      !(flags & NFT_SET_ELEM_INTERVAL_END)) ||
	     (nft_rbtree_interval_end(interval) &&
	      (flags & NFT_SET_ELEM_INTERVAL_END)))) {
		*elem = interval;
		return true;
	}

	return false;
}

static void *nft_rbtree_get(const struct net *net, const struct nft_set *set,
			    const struct nft_set_elem *elem, unsigned int flags)
{
	struct nft_rbtree *priv = nft_set_priv(set);
	unsigned int seq = read_seqcount_begin(&priv->count);
	struct nft_rbtree_elem *rbe = ERR_PTR(-ENOENT);
	const u32 *key = (const u32 *)&elem->key.val;
	u8 genmask = nft_genmask_cur(net);
	bool ret;

	ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask);
	if (ret || !read_seqcount_retry(&priv->count, seq))
		return rbe;

	read_lock_bh(&priv->lock);
	seq = read_seqcount_begin(&priv->count);
	ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask);
	if (!ret)
		rbe = ERR_PTR(-ENOENT);
	read_unlock_bh(&priv->lock);

	return rbe;
}

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_rcu(&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);
	write_seqcount_begin(&priv->count);
	err = __nft_rbtree_insert(net, set, rbe, ext);
	write_seqcount_end(&priv->count);
	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);
	write_seqcount_begin(&priv->count);
	rb_erase(&rbe->node, &priv->root);
	write_seqcount_end(&priv->count);
	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);
	nft_set_elem_clear_busy(&rbe->ext);
}

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

	if (!nft_set_elem_mark_busy(&rbe->ext) ||
	    !nft_is_active(net, &rbe->ext)) {
		nft_set_elem_change_active(net, set, &rbe->ext);
		return true;
	}
	return false;
}

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 void nft_rbtree_gc(struct work_struct *work)
{
	struct nft_rbtree_elem *rbe, *rbe_end = NULL, *rbe_prev = NULL;
	struct nft_set_gc_batch *gcb = NULL;
	struct nft_rbtree *priv;
	struct rb_node *node;
	struct nft_set *set;

	priv = container_of(work, struct nft_rbtree, gc_work.work);
	set  = nft_set_container_of(priv);

	write_lock_bh(&priv->lock);
	write_seqcount_begin(&priv->count);
	for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
		rbe = rb_entry(node, struct nft_rbtree_elem, node);

		if (nft_rbtree_interval_end(rbe)) {
			rbe_end = rbe;
			continue;
		}
		if (!nft_set_elem_expired(&rbe->ext))
			continue;
		if (nft_set_elem_mark_busy(&rbe->ext))
			continue;

		if (rbe_prev) {
			rb_erase(&rbe_prev->node, &priv->root);
			rbe_prev = NULL;
		}
		gcb = nft_set_gc_batch_check(set, gcb, GFP_ATOMIC);
		if (!gcb)
			break;

		atomic_dec(&set->nelems);
		nft_set_gc_batch_add(gcb, rbe);
		rbe_prev = rbe;

		if (rbe_end) {
			atomic_dec(&set->nelems);
			nft_set_gc_batch_add(gcb, rbe_end);
			rb_erase(&rbe_end->node, &priv->root);
			rbe_end = NULL;
		}
		node = rb_next(node);
		if (!node)
			break;
	}
	if (rbe_prev)
		rb_erase(&rbe_prev->node, &priv->root);
	write_seqcount_end(&priv->count);
	write_unlock_bh(&priv->lock);

	nft_set_gc_batch_complete(gcb);

	queue_delayed_work(system_power_efficient_wq, &priv->gc_work,
			   nft_set_gc_interval(set));
}

static u64 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);
	seqcount_init(&priv->count);
	priv->root = RB_ROOT;

	INIT_DEFERRABLE_WORK(&priv->gc_work, nft_rbtree_gc);
	if (set->flags & NFT_SET_TIMEOUT)
		queue_delayed_work(system_power_efficient_wq, &priv->gc_work,
				   nft_set_gc_interval(set));

	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;

	cancel_delayed_work_sync(&priv->gc_work);
	rcu_barrier();
	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;
}

struct nft_set_type nft_set_rbtree_type __read_mostly = {
	.owner		= THIS_MODULE,
	.features	= NFT_SET_INTERVAL | NFT_SET_MAP | NFT_SET_OBJECT | NFT_SET_TIMEOUT,
	.ops		= {
		.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,
		.get		= nft_rbtree_get,
	},
};
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 {
	22	struct rb_root root;
9b7e26ae FW	23	rwlock_t lock;
9b7e26ae FW	24	seqcount_t count;
8d8540c4	25	struct delayed_work gc_work;
20a69341 PM	26	};
	27
	28	struct nft_rbtree_elem {
	29	struct rb_node node;
fe2811eb	30	struct nft_set_ext ext;
20a69341 PM	31	};
20a69341 PM	32
ef1d20e0 PNA	33	static bool nft_rbtree_interval_end(const struct nft_rbtree_elem *rbe)
	34	{
	35	return nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) &&
	36	(*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END);
	37	}
cc02e457	38
e701001e PNA	39	static bool nft_rbtree_equal(const struct nft_set set, const void this,
	40	const struct nft_rbtree_elem *interval)
	41	{
	42	return memcmp(this, nft_set_ext_key(&interval->ext), set->klen) == 0;
	43	}
	44
9b7e26ae FW	45	static bool __nft_rbtree_lookup(const struct net net, const struct nft_set set,
	46	const u32 key, const struct nft_set_ext *ext,
	47	unsigned int seq)
20a69341	48	{
03e5fd0e	49	struct nft_rbtree *priv = nft_set_priv(set);
20a69341	50	const struct nft_rbtree_elem rbe, interval = NULL;
42a55769	51	u8 genmask = nft_genmask_cur(net);
16c45eda	52	const struct rb_node *parent;
e701001e	53	const void *this;
20a69341 PM	54	int d;
20a69341 PM	55
9b7e26ae	56	parent = rcu_dereference_raw(priv->root.rb_node);
20a69341	57	while (parent != NULL) {
9b7e26ae FW	58	if (read_seqcount_retry(&priv->count, seq))
	59	return false;
	60
20a69341 PM	61	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
20a69341 PM	62
e701001e PNA	63	this = nft_set_ext_key(&rbe->ext);
e701001e PNA	64	d = memcmp(this, key, set->klen);
20a69341	65	if (d < 0) {
9b7e26ae	66	parent = rcu_dereference_raw(parent->rb_left);
f9121355 PNA	67	if (interval &&
f9121355 PNA	68	nft_rbtree_equal(set, this, interval) &&
82e20b44	69	nft_rbtree_interval_end(rbe) &&
f9121355	70	!nft_rbtree_interval_end(interval))
e701001e	71	continue;
20a69341 PM	72	interval = rbe;
20a69341 PM	73	} else if (d > 0)
9b7e26ae	74	parent = rcu_dereference_raw(parent->rb_right);
20a69341	75	else {
cc02e457	76	if (!nft_set_elem_active(&rbe->ext, genmask)) {
9b7e26ae	77	parent = rcu_dereference_raw(parent->rb_left);
cc02e457 PM	78	continue;
cc02e457 PM	79	}
ef1d20e0	80	if (nft_rbtree_interval_end(rbe))
20a69341	81	goto out;
b2832dd6 PM	82
b2832dd6 PM	83	*ext = &rbe->ext;
20a69341 PM	84	return true;
	85	}
	86	}
	87
c1eda3c6 PNA	88	if (set->flags & NFT_SET_INTERVAL && interval != NULL &&
	89	nft_set_elem_active(&interval->ext, genmask) &&
	90	!nft_rbtree_interval_end(interval)) {
c1eda3c6 PNA	91	*ext = &interval->ext;
c1eda3c6 PNA	92	return true;
20a69341 PM	93	}
	94	out:
	95	return false;
	96	}
	97
9b7e26ae FW	98	static bool nft_rbtree_lookup(const struct net net, const struct nft_set set,
	99	const u32 key, const struct nft_set_ext *ext)
	100	{
	101	struct nft_rbtree *priv = nft_set_priv(set);
	102	unsigned int seq = read_seqcount_begin(&priv->count);
	103	bool ret;
	104
	105	ret = __nft_rbtree_lookup(net, set, key, ext, seq);
	106	if (ret \|\| !read_seqcount_retry(&priv->count, seq))
	107	return ret;
	108
	109	read_lock_bh(&priv->lock);
	110	seq = read_seqcount_begin(&priv->count);
	111	ret = __nft_rbtree_lookup(net, set, key, ext, seq);
	112	read_unlock_bh(&priv->lock);
	113
	114	return ret;
	115	}
	116
ba0e4d99 PNA	117	static bool __nft_rbtree_get(const struct net net, const struct nft_set set,
	118	const u32 key, struct nft_rbtree_elem *elem,
	119	unsigned int seq, unsigned int flags, u8 genmask)
	120	{
	121	struct nft_rbtree_elem rbe, interval = NULL;
	122	struct nft_rbtree *priv = nft_set_priv(set);
	123	const struct rb_node *parent;
	124	const void *this;
	125	int d;
	126
	127	parent = rcu_dereference_raw(priv->root.rb_node);
	128	while (parent != NULL) {
	129	if (read_seqcount_retry(&priv->count, seq))
	130	return false;
	131
	132	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
	133
	134	this = nft_set_ext_key(&rbe->ext);
	135	d = memcmp(this, key, set->klen);
	136	if (d < 0) {
	137	parent = rcu_dereference_raw(parent->rb_left);
3b18d5eb PNA	138	if (!(flags & NFT_SET_ELEM_INTERVAL_END))
3b18d5eb PNA	139	interval = rbe;
ba0e4d99 PNA	140	} else if (d > 0) {
ba0e4d99 PNA	141	parent = rcu_dereference_raw(parent->rb_right);
3b18d5eb PNA	142	if (flags & NFT_SET_ELEM_INTERVAL_END)
3b18d5eb PNA	143	interval = rbe;
ba0e4d99 PNA	144	} else {
	145	if (!nft_set_elem_active(&rbe->ext, genmask))
	146	parent = rcu_dereference_raw(parent->rb_left);
	147
	148	if (!nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) \|\|
	149	(*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END) ==
	150	(flags & NFT_SET_ELEM_INTERVAL_END)) {
	151	*elem = rbe;
	152	return true;
	153	}
	154	return false;
	155	}
	156	}
	157
	158	if (set->flags & NFT_SET_INTERVAL && interval != NULL &&
	159	nft_set_elem_active(&interval->ext, genmask) &&
3b18d5eb PNA	160	((!nft_rbtree_interval_end(interval) &&
	161	!(flags & NFT_SET_ELEM_INTERVAL_END)) \|\|
	162	(nft_rbtree_interval_end(interval) &&
	163	(flags & NFT_SET_ELEM_INTERVAL_END)))) {
ba0e4d99 PNA	164	*elem = interval;
	165	return true;
	166	}
	167
	168	return false;
	169	}
	170
	171	static void nft_rbtree_get(const struct net net, const struct nft_set *set,
	172	const struct nft_set_elem *elem, unsigned int flags)
	173	{
	174	struct nft_rbtree *priv = nft_set_priv(set);
	175	unsigned int seq = read_seqcount_begin(&priv->count);
	176	struct nft_rbtree_elem *rbe = ERR_PTR(-ENOENT);
	177	const u32 key = (const u32 )&elem->key.val;
	178	u8 genmask = nft_genmask_cur(net);
	179	bool ret;
	180
	181	ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask);
	182	if (ret \|\| !read_seqcount_retry(&priv->count, seq))
	183	return rbe;
	184
	185	read_lock_bh(&priv->lock);
	186	seq = read_seqcount_begin(&priv->count);
	187	ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask);
	188	if (!ret)
	189	rbe = ERR_PTR(-ENOENT);
	190	read_unlock_bh(&priv->lock);
	191
	192	return rbe;
	193	}
	194
42a55769	195	static int __nft_rbtree_insert(const struct net net, const struct nft_set set,
c016c7e4 PNA	196	struct nft_rbtree_elem *new,
c016c7e4 PNA	197	struct nft_set_ext **ext)
20a69341 PM	198	{
20a69341 PM	199	struct nft_rbtree *priv = nft_set_priv(set);
42a55769	200	u8 genmask = nft_genmask_next(net);
20a69341 PM	201	struct nft_rbtree_elem *rbe;
	202	struct rb_node parent, *p;
	203	int d;
	204
	205	parent = NULL;
	206	p = &priv->root.rb_node;
	207	while (*p != NULL) {
	208	parent = *p;
	209	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
e562d860 PM	210	d = memcmp(nft_set_ext_key(&rbe->ext),
	211	nft_set_ext_key(&new->ext),
	212	set->klen);
20a69341 PM	213	if (d < 0)
	214	p = &parent->rb_left;
	215	else if (d > 0)
	216	p = &parent->rb_right;
cc02e457	217	else {
d2df92e9 PNA	218	if (nft_rbtree_interval_end(rbe) &&
	219	!nft_rbtree_interval_end(new)) {
	220	p = &parent->rb_left;
	221	} else if (!nft_rbtree_interval_end(rbe) &&
	222	nft_rbtree_interval_end(new)) {
	223	p = &parent->rb_right;
	224	} else if (nft_set_elem_active(&rbe->ext, genmask)) {
	225	*ext = &rbe->ext;
	226	return -EEXIST;
	227	} else {
	228	p = &parent->rb_left;
e701001e	229	}
cc02e457	230	}
20a69341	231	}
9b7e26ae	232	rb_link_node_rcu(&new->node, parent, p);
20a69341 PM	233	rb_insert_color(&new->node, &priv->root);
	234	return 0;
	235	}
	236
42a55769	237	static int nft_rbtree_insert(const struct net net, const struct nft_set set,
c016c7e4 PNA	238	const struct nft_set_elem *elem,
c016c7e4 PNA	239	struct nft_set_ext **ext)
20a69341	240	{
03e5fd0e	241	struct nft_rbtree *priv = nft_set_priv(set);
fe2811eb	242	struct nft_rbtree_elem *rbe = elem->priv;
20a69341 PM	243	int err;
20a69341 PM	244
03e5fd0e	245	write_lock_bh(&priv->lock);
9b7e26ae	246	write_seqcount_begin(&priv->count);
c016c7e4	247	err = __nft_rbtree_insert(net, set, rbe, ext);
9b7e26ae	248	write_seqcount_end(&priv->count);
03e5fd0e	249	write_unlock_bh(&priv->lock);
fe2811eb	250
20a69341 PM	251	return err;
	252	}
	253
5cb82a38 PNA	254	static void nft_rbtree_remove(const struct net *net,
5cb82a38 PNA	255	const struct nft_set *set,
20a69341 PM	256	const struct nft_set_elem *elem)
	257	{
	258	struct nft_rbtree *priv = nft_set_priv(set);
cc02e457	259	struct nft_rbtree_elem *rbe = elem->priv;
20a69341	260
03e5fd0e	261	write_lock_bh(&priv->lock);
9b7e26ae	262	write_seqcount_begin(&priv->count);
20a69341	263	rb_erase(&rbe->node, &priv->root);
9b7e26ae	264	write_seqcount_end(&priv->count);
03e5fd0e	265	write_unlock_bh(&priv->lock);
20a69341 PM	266	}
20a69341 PM	267
42a55769 PNA	268	static void nft_rbtree_activate(const struct net *net,
42a55769 PNA	269	const struct nft_set *set,
cc02e457 PM	270	const struct nft_set_elem *elem)
	271	{
	272	struct nft_rbtree_elem *rbe = elem->priv;
	273
42a55769	274	nft_set_elem_change_active(net, set, &rbe->ext);
8d8540c4	275	nft_set_elem_clear_busy(&rbe->ext);
cc02e457 PM	276	}
cc02e457 PM	277
1ba1c414 PNA	278	static bool nft_rbtree_flush(const struct net *net,
1ba1c414 PNA	279	const struct nft_set set, void priv)
37df5301 PNA	280	{
	281	struct nft_rbtree_elem *rbe = priv;
	282
8d8540c4 PNA	283	if (!nft_set_elem_mark_busy(&rbe->ext) \|\|
	284	!nft_is_active(net, &rbe->ext)) {
	285	nft_set_elem_change_active(net, set, &rbe->ext);
	286	return true;
	287	}
	288	return false;
37df5301 PNA	289	}
37df5301 PNA	290
42a55769 PNA	291	static void nft_rbtree_deactivate(const struct net net,
42a55769 PNA	292	const struct nft_set *set,
cc02e457	293	const struct nft_set_elem *elem)
20a69341 PM	294	{
	295	const struct nft_rbtree *priv = nft_set_priv(set);
	296	const struct rb_node *parent = priv->root.rb_node;
e701001e	297	struct nft_rbtree_elem rbe, this = elem->priv;
42a55769	298	u8 genmask = nft_genmask_next(net);
20a69341 PM	299	int d;
	300
	301	while (parent != NULL) {
	302	rbe = rb_entry(parent, struct nft_rbtree_elem, node);
	303
7d740264 PM	304	d = memcmp(nft_set_ext_key(&rbe->ext), &elem->key.val,
7d740264 PM	305	set->klen);
20a69341 PM	306	if (d < 0)
	307	parent = parent->rb_left;
	308	else if (d > 0)
	309	parent = parent->rb_right;
	310	else {
cc02e457 PM	311	if (!nft_set_elem_active(&rbe->ext, genmask)) {
	312	parent = parent->rb_left;
	313	continue;
	314	}
e701001e PNA	315	if (nft_rbtree_interval_end(rbe) &&
	316	!nft_rbtree_interval_end(this)) {
	317	parent = parent->rb_left;
	318	continue;
	319	} else if (!nft_rbtree_interval_end(rbe) &&
	320	nft_rbtree_interval_end(this)) {
	321	parent = parent->rb_right;
	322	continue;
	323	}
1ba1c414	324	nft_rbtree_flush(net, set, rbe);
cc02e457	325	return rbe;
20a69341 PM	326	}
20a69341 PM	327	}
cc02e457	328	return NULL;
20a69341 PM	329	}
	330
	331	static void nft_rbtree_walk(const struct nft_ctx *ctx,
de70185d	332	struct nft_set *set,
20a69341 PM	333	struct nft_set_iter *iter)
20a69341 PM	334	{
03e5fd0e	335	struct nft_rbtree *priv = nft_set_priv(set);
fe2811eb	336	struct nft_rbtree_elem *rbe;
20a69341 PM	337	struct nft_set_elem elem;
	338	struct rb_node *node;
	339
03e5fd0e	340	read_lock_bh(&priv->lock);
20a69341	341	for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
cc02e457 PM	342	rbe = rb_entry(node, struct nft_rbtree_elem, node);
cc02e457 PM	343
20a69341 PM	344	if (iter->count < iter->skip)
20a69341 PM	345	goto cont;
8588ac09	346	if (!nft_set_elem_active(&rbe->ext, iter->genmask))
cc02e457	347	goto cont;
20a69341	348
fe2811eb	349	elem.priv = rbe;
20a69341 PM	350
20a69341 PM	351	iter->err = iter->fn(ctx, set, iter, &elem);
7632667d	352	if (iter->err < 0) {
03e5fd0e	353	read_unlock_bh(&priv->lock);
20a69341	354	return;
7632667d	355	}
20a69341 PM	356	cont:
	357	iter->count++;
	358	}
03e5fd0e	359	read_unlock_bh(&priv->lock);
20a69341 PM	360	}
20a69341 PM	361
8d8540c4 PNA	362	static void nft_rbtree_gc(struct work_struct *work)
8d8540c4 PNA	363	{
a13f814a	364	struct nft_rbtree_elem rbe, rbe_end = NULL, *rbe_prev = NULL;
8d8540c4	365	struct nft_set_gc_batch *gcb = NULL;
8d8540c4	366	struct nft_rbtree *priv;
a13f814a	367	struct rb_node *node;
8d8540c4	368	struct nft_set *set;
8d8540c4 PNA	369
	370	priv = container_of(work, struct nft_rbtree, gc_work.work);
	371	set = nft_set_container_of(priv);
	372
	373	write_lock_bh(&priv->lock);
	374	write_seqcount_begin(&priv->count);
	375	for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
	376	rbe = rb_entry(node, struct nft_rbtree_elem, node);
	377
	378	if (nft_rbtree_interval_end(rbe)) {
a13f814a	379	rbe_end = rbe;
8d8540c4 PNA	380	continue;
	381	}
	382	if (!nft_set_elem_expired(&rbe->ext))
	383	continue;
	384	if (nft_set_elem_mark_busy(&rbe->ext))
	385	continue;
	386
a13f814a TY	387	if (rbe_prev) {
	388	rb_erase(&rbe_prev->node, &priv->root);
	389	rbe_prev = NULL;
	390	}
8d8540c4 PNA	391	gcb = nft_set_gc_batch_check(set, gcb, GFP_ATOMIC);
8d8540c4 PNA	392	if (!gcb)
c293ac95	393	break;
8d8540c4 PNA	394
	395	atomic_dec(&set->nelems);
	396	nft_set_gc_batch_add(gcb, rbe);
a13f814a	397	rbe_prev = rbe;
8d8540c4	398
a13f814a	399	if (rbe_end) {
8d8540c4	400	atomic_dec(&set->nelems);
a13f814a TY	401	nft_set_gc_batch_add(gcb, rbe_end);
	402	rb_erase(&rbe_end->node, &priv->root);
	403	rbe_end = NULL;
8d8540c4 PNA	404	}
8d8540c4 PNA	405	node = rb_next(node);
c293ac95 TY	406	if (!node)
c293ac95 TY	407	break;
8d8540c4	408	}
a13f814a TY	409	if (rbe_prev)
a13f814a TY	410	rb_erase(&rbe_prev->node, &priv->root);
8d8540c4 PNA	411	write_seqcount_end(&priv->count);
	412	write_unlock_bh(&priv->lock);
	413
	414	nft_set_gc_batch_complete(gcb);
	415
	416	queue_delayed_work(system_power_efficient_wq, &priv->gc_work,
	417	nft_set_gc_interval(set));
	418	}
	419
4ef360dd TY	420	static u64 nft_rbtree_privsize(const struct nlattr * const nla[],
4ef360dd TY	421	const struct nft_set_desc *desc)
20a69341 PM	422	{
	423	return sizeof(struct nft_rbtree);
	424	}
	425
	426	static int nft_rbtree_init(const struct nft_set *set,
c50b960c	427	const struct nft_set_desc *desc,
20a69341 PM	428	const struct nlattr * const nla[])
	429	{
	430	struct nft_rbtree *priv = nft_set_priv(set);
	431
03e5fd0e	432	rwlock_init(&priv->lock);
9b7e26ae	433	seqcount_init(&priv->count);
20a69341	434	priv->root = RB_ROOT;
8d8540c4 PNA	435
	436	INIT_DEFERRABLE_WORK(&priv->gc_work, nft_rbtree_gc);
	437	if (set->flags & NFT_SET_TIMEOUT)
	438	queue_delayed_work(system_power_efficient_wq, &priv->gc_work,
	439	nft_set_gc_interval(set));
	440
20a69341 PM	441	return 0;
	442	}
	443
	444	static void nft_rbtree_destroy(const struct nft_set *set)
	445	{
	446	struct nft_rbtree *priv = nft_set_priv(set);
	447	struct nft_rbtree_elem *rbe;
	448	struct rb_node *node;
	449
8d8540c4	450	cancel_delayed_work_sync(&priv->gc_work);
c293ac95	451	rcu_barrier();
20a69341 PM	452	while ((node = priv->root.rb_node) != NULL) {
	453	rb_erase(node, &priv->root);
	454	rbe = rb_entry(node, struct nft_rbtree_elem, node);
61f9e292	455	nft_set_elem_destroy(set, rbe, true);
20a69341 PM	456	}
	457	}
	458
c50b960c PM	459	static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features,
	460	struct nft_set_estimate *est)
	461	{
c50b960c	462	if (desc->size)
080ed636 PNA	463	est->size = sizeof(struct nft_rbtree) +
080ed636 PNA	464	desc->size * sizeof(struct nft_rbtree_elem);
c50b960c	465	else
080ed636	466	est->size = ~0;
c50b960c	467
55af753c	468	est->lookup = NFT_SET_CLASS_O_LOG_N;
0b5a7874	469	est->space = NFT_SET_CLASS_O_N;
c50b960c PM	470
	471	return true;
	472	}
	473
e240cd0d	474	struct nft_set_type nft_set_rbtree_type __read_mostly = {
20a69341	475	.owner = THIS_MODULE,
8d8540c4	476	.features = NFT_SET_INTERVAL \| NFT_SET_MAP \| NFT_SET_OBJECT \| NFT_SET_TIMEOUT,
71cc0873 PS	477	.ops = {
	478	.privsize = nft_rbtree_privsize,
	479	.elemsize = offsetof(struct nft_rbtree_elem, ext),
	480	.estimate = nft_rbtree_estimate,
	481	.init = nft_rbtree_init,
	482	.destroy = nft_rbtree_destroy,
	483	.insert = nft_rbtree_insert,
	484	.remove = nft_rbtree_remove,
	485	.deactivate = nft_rbtree_deactivate,
	486	.flush = nft_rbtree_flush,
	487	.activate = nft_rbtree_activate,
	488	.lookup = nft_rbtree_lookup,
	489	.walk = nft_rbtree_walk,
	490	.get = nft_rbtree_get,
	491	},
20a69341	492	};