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_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
;
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_set_elem_active(&rbe
->ext
, genmask
)) {
195 parent
= parent
->rb_left
;
198 if (nft_rbtree_interval_end(rbe
) &&
199 !nft_rbtree_interval_end(this)) {
200 parent
= parent
->rb_left
;
202 } else if (!nft_rbtree_interval_end(rbe
) &&
203 nft_rbtree_interval_end(this)) {
204 parent
= parent
->rb_right
;
207 nft_set_elem_change_active(net
, set
, &rbe
->ext
);
214 static void nft_rbtree_walk(const struct nft_ctx
*ctx
,
215 const struct nft_set
*set
,
216 struct nft_set_iter
*iter
)
218 const struct nft_rbtree
*priv
= nft_set_priv(set
);
219 struct nft_rbtree_elem
*rbe
;
220 struct nft_set_elem elem
;
221 struct rb_node
*node
;
223 spin_lock_bh(&nft_rbtree_lock
);
224 for (node
= rb_first(&priv
->root
); node
!= NULL
; node
= rb_next(node
)) {
225 rbe
= rb_entry(node
, struct nft_rbtree_elem
, node
);
227 if (iter
->count
< iter
->skip
)
229 if (!nft_set_elem_active(&rbe
->ext
, iter
->genmask
))
234 iter
->err
= iter
->fn(ctx
, set
, iter
, &elem
);
236 spin_unlock_bh(&nft_rbtree_lock
);
242 spin_unlock_bh(&nft_rbtree_lock
);
245 static unsigned int nft_rbtree_privsize(const struct nlattr
* const nla
[])
247 return sizeof(struct nft_rbtree
);
250 static int nft_rbtree_init(const struct nft_set
*set
,
251 const struct nft_set_desc
*desc
,
252 const struct nlattr
* const nla
[])
254 struct nft_rbtree
*priv
= nft_set_priv(set
);
256 priv
->root
= RB_ROOT
;
260 static void nft_rbtree_destroy(const struct nft_set
*set
)
262 struct nft_rbtree
*priv
= nft_set_priv(set
);
263 struct nft_rbtree_elem
*rbe
;
264 struct rb_node
*node
;
266 while ((node
= priv
->root
.rb_node
) != NULL
) {
267 rb_erase(node
, &priv
->root
);
268 rbe
= rb_entry(node
, struct nft_rbtree_elem
, node
);
269 nft_set_elem_destroy(set
, rbe
);
273 static bool nft_rbtree_estimate(const struct nft_set_desc
*desc
, u32 features
,
274 struct nft_set_estimate
*est
)
278 nsize
= sizeof(struct nft_rbtree_elem
);
280 est
->size
= sizeof(struct nft_rbtree
) + desc
->size
* nsize
;
284 est
->class = NFT_SET_CLASS_O_LOG_N
;
289 static struct nft_set_ops nft_rbtree_ops __read_mostly
= {
290 .privsize
= nft_rbtree_privsize
,
291 .elemsize
= offsetof(struct nft_rbtree_elem
, ext
),
292 .estimate
= nft_rbtree_estimate
,
293 .init
= nft_rbtree_init
,
294 .destroy
= nft_rbtree_destroy
,
295 .insert
= nft_rbtree_insert
,
296 .remove
= nft_rbtree_remove
,
297 .deactivate
= nft_rbtree_deactivate
,
298 .activate
= nft_rbtree_activate
,
299 .lookup
= nft_rbtree_lookup
,
300 .walk
= nft_rbtree_walk
,
301 .features
= NFT_SET_INTERVAL
| NFT_SET_MAP
,
302 .owner
= THIS_MODULE
,
305 static int __init
nft_rbtree_module_init(void)
307 return nft_register_set(&nft_rbtree_ops
);
310 static void __exit
nft_rbtree_module_exit(void)
312 nft_unregister_set(&nft_rbtree_ops
);
315 module_init(nft_rbtree_module_init
);
316 module_exit(nft_rbtree_module_exit
);
318 MODULE_LICENSE("GPL");
319 MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
320 MODULE_ALIAS_NFT_SET();