2 * Copyright (c) 2008-2009 Patrick McHardy <kaber@trash.net>
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.
8 * Development of this code funded by Astaro AG (http://www.astaro.com/)
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>
21 static DEFINE_SPINLOCK(nft_rbtree_lock);
27 struct nft_rbtree_elem {
29 struct nft_set_ext ext;
32 static bool nft_rbtree_interval_end(const struct nft_rbtree_elem *rbe)
34 return nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) &&
35 (*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END);
38 static bool nft_rbtree_equal(const struct nft_set *set, const void *this,
39 const struct nft_rbtree_elem *interval)
41 return memcmp(this, nft_set_ext_key(&interval->ext), set->klen) == 0;
44 static bool nft_rbtree_lookup(const struct net *net, const struct nft_set *set,
45 const u32 *key, const struct nft_set_ext **ext)
47 const struct nft_rbtree *priv = nft_set_priv(set);
48 const struct nft_rbtree_elem *rbe, *interval = NULL;
49 u8 genmask = nft_genmask_cur(net);
50 const struct rb_node *parent;
54 spin_lock_bh(&nft_rbtree_lock);
55 parent = priv->root.rb_node;
56 while (parent != NULL) {
57 rbe = rb_entry(parent, struct nft_rbtree_elem, node);
59 this = nft_set_ext_key(&rbe->ext);
60 d = memcmp(this, key, set->klen);
62 parent = parent->rb_left;
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.
67 if (interval && nft_rbtree_equal(set, this, interval))
71 parent = parent->rb_right;
73 if (!nft_set_elem_active(&rbe->ext, genmask)) {
74 parent = parent->rb_left;
77 if (nft_rbtree_interval_end(rbe))
79 spin_unlock_bh(&nft_rbtree_lock);
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;
94 spin_unlock_bh(&nft_rbtree_lock);
98 static int __nft_rbtree_insert(const struct net *net, const struct nft_set *set,
99 struct nft_rbtree_elem *new,
100 struct nft_set_ext **ext)
102 struct nft_rbtree *priv = nft_set_priv(set);
103 u8 genmask = nft_genmask_next(net);
104 struct nft_rbtree_elem *rbe;
105 struct rb_node *parent, **p;
109 p = &priv->root.rb_node;
112 rbe = rb_entry(parent, struct nft_rbtree_elem, node);
113 d = memcmp(nft_set_ext_key(&rbe->ext),
114 nft_set_ext_key(&new->ext),
117 p = &parent->rb_left;
119 p = &parent->rb_right;
121 if (nft_rbtree_interval_end(rbe) &&
122 !nft_rbtree_interval_end(new)) {
123 p = &parent->rb_left;
124 } else if (!nft_rbtree_interval_end(rbe) &&
125 nft_rbtree_interval_end(new)) {
126 p = &parent->rb_right;
127 } else if (nft_set_elem_active(&rbe->ext, genmask)) {
131 p = &parent->rb_left;
135 rb_link_node(&new->node, parent, p);
136 rb_insert_color(&new->node, &priv->root);
140 static int nft_rbtree_insert(const struct net *net, const struct nft_set *set,
141 const struct nft_set_elem *elem,
142 struct nft_set_ext **ext)
144 struct nft_rbtree_elem *rbe = elem->priv;
147 spin_lock_bh(&nft_rbtree_lock);
148 err = __nft_rbtree_insert(net, set, rbe, ext);
149 spin_unlock_bh(&nft_rbtree_lock);
154 static void nft_rbtree_remove(const struct nft_set *set,
155 const struct nft_set_elem *elem)
157 struct nft_rbtree *priv = nft_set_priv(set);
158 struct nft_rbtree_elem *rbe = elem->priv;
160 spin_lock_bh(&nft_rbtree_lock);
161 rb_erase(&rbe->node, &priv->root);
162 spin_unlock_bh(&nft_rbtree_lock);
165 static void nft_rbtree_activate(const struct net *net,
166 const struct nft_set *set,
167 const struct nft_set_elem *elem)
169 struct nft_rbtree_elem *rbe = elem->priv;
171 nft_set_elem_change_active(net, set, &rbe->ext);
174 static void *nft_rbtree_deactivate(const struct net *net,
175 const struct nft_set *set,
176 const struct nft_set_elem *elem)
178 const struct nft_rbtree *priv = nft_set_priv(set);
179 const struct rb_node *parent = priv->root.rb_node;
180 struct nft_rbtree_elem *rbe, *this = elem->priv;
181 u8 genmask = nft_genmask_next(net);
184 while (parent != NULL) {
185 rbe = rb_entry(parent, struct nft_rbtree_elem, node);
187 d = memcmp(nft_set_ext_key(&rbe->ext), &elem->key.val,
190 parent = parent->rb_left;
192 parent = parent->rb_right;
194 if (nft_rbtree_interval_end(rbe) &&
195 !nft_rbtree_interval_end(this)) {
196 parent = parent->rb_left;
198 } else if (!nft_rbtree_interval_end(rbe) &&
199 nft_rbtree_interval_end(this)) {
200 parent = parent->rb_right;
202 } else if (!nft_set_elem_active(&rbe->ext, genmask)) {
203 parent = parent->rb_left;
206 nft_set_elem_change_active(net, set, &rbe->ext);
213 static void nft_rbtree_walk(const struct nft_ctx *ctx,
214 const struct nft_set *set,
215 struct nft_set_iter *iter)
217 const struct nft_rbtree *priv = nft_set_priv(set);
218 struct nft_rbtree_elem *rbe;
219 struct nft_set_elem elem;
220 struct rb_node *node;
222 spin_lock_bh(&nft_rbtree_lock);
223 for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
224 rbe = rb_entry(node, struct nft_rbtree_elem, node);
226 if (iter->count < iter->skip)
228 if (!nft_set_elem_active(&rbe->ext, iter->genmask))
233 iter->err = iter->fn(ctx, set, iter, &elem);
235 spin_unlock_bh(&nft_rbtree_lock);
241 spin_unlock_bh(&nft_rbtree_lock);
244 static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[])
246 return sizeof(struct nft_rbtree);
249 static int nft_rbtree_init(const struct nft_set *set,
250 const struct nft_set_desc *desc,
251 const struct nlattr * const nla[])
253 struct nft_rbtree *priv = nft_set_priv(set);
255 priv->root = RB_ROOT;
259 static void nft_rbtree_destroy(const struct nft_set *set)
261 struct nft_rbtree *priv = nft_set_priv(set);
262 struct nft_rbtree_elem *rbe;
263 struct rb_node *node;
265 while ((node = priv->root.rb_node) != NULL) {
266 rb_erase(node, &priv->root);
267 rbe = rb_entry(node, struct nft_rbtree_elem, node);
268 nft_set_elem_destroy(set, rbe, true);
272 static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features,
273 struct nft_set_estimate *est)
277 nsize = sizeof(struct nft_rbtree_elem);
279 est->size = sizeof(struct nft_rbtree) + desc->size * nsize;
283 est->class = NFT_SET_CLASS_O_LOG_N;
288 static struct nft_set_ops nft_rbtree_ops __read_mostly = {
289 .privsize = nft_rbtree_privsize,
290 .elemsize = offsetof(struct nft_rbtree_elem, ext),
291 .estimate = nft_rbtree_estimate,
292 .init = nft_rbtree_init,
293 .destroy = nft_rbtree_destroy,
294 .insert = nft_rbtree_insert,
295 .remove = nft_rbtree_remove,
296 .deactivate = nft_rbtree_deactivate,
297 .activate = nft_rbtree_activate,
298 .lookup = nft_rbtree_lookup,
299 .walk = nft_rbtree_walk,
300 .features = NFT_SET_INTERVAL | NFT_SET_MAP,
301 .owner = THIS_MODULE,
304 static int __init nft_rbtree_module_init(void)
306 return nft_register_set(&nft_rbtree_ops);
309 static void __exit nft_rbtree_module_exit(void)
311 nft_unregister_set(&nft_rbtree_ops);
314 module_init(nft_rbtree_module_init);
315 module_exit(nft_rbtree_module_exit);
317 MODULE_LICENSE("GPL");
318 MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
319 MODULE_ALIAS_NFT_SET();