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 nft_set
*set
, const u32
*key
,
45 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 const struct rb_node
*parent
;
50 u8 genmask
= nft_genmask_cur(read_pnet(&set
->pnet
));
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
;
74 if (!nft_set_elem_active(&rbe
->ext
, genmask
)) {
75 parent
= parent
->rb_left
;
78 if (nft_rbtree_interval_end(rbe
))
80 spin_unlock_bh(&nft_rbtree_lock
);
87 if (set
->flags
& NFT_SET_INTERVAL
&& interval
!= NULL
) {
92 spin_unlock_bh(&nft_rbtree_lock
);
96 static int __nft_rbtree_insert(const struct nft_set
*set
,
97 struct nft_rbtree_elem
*new)
99 struct nft_rbtree
*priv
= nft_set_priv(set
);
100 struct nft_rbtree_elem
*rbe
;
101 struct rb_node
*parent
, **p
;
102 u8 genmask
= nft_genmask_next(read_pnet(&set
->pnet
));
106 p
= &priv
->root
.rb_node
;
109 rbe
= rb_entry(parent
, struct nft_rbtree_elem
, node
);
110 d
= memcmp(nft_set_ext_key(&rbe
->ext
),
111 nft_set_ext_key(&new->ext
),
114 p
= &parent
->rb_left
;
116 p
= &parent
->rb_right
;
118 if (nft_set_elem_active(&rbe
->ext
, genmask
)) {
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
;
130 rb_link_node(&new->node
, parent
, p
);
131 rb_insert_color(&new->node
, &priv
->root
);
135 static int nft_rbtree_insert(const struct nft_set
*set
,
136 const struct nft_set_elem
*elem
)
138 struct nft_rbtree_elem
*rbe
= elem
->priv
;
141 spin_lock_bh(&nft_rbtree_lock
);
142 err
= __nft_rbtree_insert(set
, rbe
);
143 spin_unlock_bh(&nft_rbtree_lock
);
148 static void nft_rbtree_remove(const struct nft_set
*set
,
149 const struct nft_set_elem
*elem
)
151 struct nft_rbtree
*priv
= nft_set_priv(set
);
152 struct nft_rbtree_elem
*rbe
= elem
->priv
;
154 spin_lock_bh(&nft_rbtree_lock
);
155 rb_erase(&rbe
->node
, &priv
->root
);
156 spin_unlock_bh(&nft_rbtree_lock
);
159 static void nft_rbtree_activate(const struct nft_set
*set
,
160 const struct nft_set_elem
*elem
)
162 struct nft_rbtree_elem
*rbe
= elem
->priv
;
164 nft_set_elem_change_active(set
, &rbe
->ext
);
167 static void *nft_rbtree_deactivate(const struct nft_set
*set
,
168 const struct nft_set_elem
*elem
)
170 const struct nft_rbtree
*priv
= nft_set_priv(set
);
171 const struct rb_node
*parent
= priv
->root
.rb_node
;
172 struct nft_rbtree_elem
*rbe
, *this = elem
->priv
;
173 u8 genmask
= nft_genmask_cur(read_pnet(&set
->pnet
));
176 while (parent
!= NULL
) {
177 rbe
= rb_entry(parent
, struct nft_rbtree_elem
, node
);
179 d
= memcmp(nft_set_ext_key(&rbe
->ext
), &elem
->key
.val
,
182 parent
= parent
->rb_left
;
184 parent
= parent
->rb_right
;
186 if (!nft_set_elem_active(&rbe
->ext
, genmask
)) {
187 parent
= parent
->rb_left
;
190 if (nft_rbtree_interval_end(rbe
) &&
191 !nft_rbtree_interval_end(this)) {
192 parent
= parent
->rb_left
;
194 } else if (!nft_rbtree_interval_end(rbe
) &&
195 nft_rbtree_interval_end(this)) {
196 parent
= parent
->rb_right
;
199 nft_set_elem_change_active(set
, &rbe
->ext
);
206 static void nft_rbtree_walk(const struct nft_ctx
*ctx
,
207 const struct nft_set
*set
,
208 struct nft_set_iter
*iter
)
210 const struct nft_rbtree
*priv
= nft_set_priv(set
);
211 struct nft_rbtree_elem
*rbe
;
212 struct nft_set_elem elem
;
213 struct rb_node
*node
;
215 spin_lock_bh(&nft_rbtree_lock
);
216 for (node
= rb_first(&priv
->root
); node
!= NULL
; node
= rb_next(node
)) {
217 rbe
= rb_entry(node
, struct nft_rbtree_elem
, node
);
219 if (iter
->count
< iter
->skip
)
221 if (!nft_set_elem_active(&rbe
->ext
, iter
->genmask
))
226 iter
->err
= iter
->fn(ctx
, set
, iter
, &elem
);
228 spin_unlock_bh(&nft_rbtree_lock
);
234 spin_unlock_bh(&nft_rbtree_lock
);
237 static unsigned int nft_rbtree_privsize(const struct nlattr
* const nla
[])
239 return sizeof(struct nft_rbtree
);
242 static int nft_rbtree_init(const struct nft_set
*set
,
243 const struct nft_set_desc
*desc
,
244 const struct nlattr
* const nla
[])
246 struct nft_rbtree
*priv
= nft_set_priv(set
);
248 priv
->root
= RB_ROOT
;
252 static void nft_rbtree_destroy(const struct nft_set
*set
)
254 struct nft_rbtree
*priv
= nft_set_priv(set
);
255 struct nft_rbtree_elem
*rbe
;
256 struct rb_node
*node
;
258 while ((node
= priv
->root
.rb_node
) != NULL
) {
259 rb_erase(node
, &priv
->root
);
260 rbe
= rb_entry(node
, struct nft_rbtree_elem
, node
);
261 nft_set_elem_destroy(set
, rbe
);
265 static bool nft_rbtree_estimate(const struct nft_set_desc
*desc
, u32 features
,
266 struct nft_set_estimate
*est
)
270 nsize
= sizeof(struct nft_rbtree_elem
);
272 est
->size
= sizeof(struct nft_rbtree
) + desc
->size
* nsize
;
276 est
->class = NFT_SET_CLASS_O_LOG_N
;
281 static struct nft_set_ops nft_rbtree_ops __read_mostly
= {
282 .privsize
= nft_rbtree_privsize
,
283 .elemsize
= offsetof(struct nft_rbtree_elem
, ext
),
284 .estimate
= nft_rbtree_estimate
,
285 .init
= nft_rbtree_init
,
286 .destroy
= nft_rbtree_destroy
,
287 .insert
= nft_rbtree_insert
,
288 .remove
= nft_rbtree_remove
,
289 .deactivate
= nft_rbtree_deactivate
,
290 .activate
= nft_rbtree_activate
,
291 .lookup
= nft_rbtree_lookup
,
292 .walk
= nft_rbtree_walk
,
293 .features
= NFT_SET_INTERVAL
| NFT_SET_MAP
,
294 .owner
= THIS_MODULE
,
297 static int __init
nft_rbtree_module_init(void)
299 return nft_register_set(&nft_rbtree_ops
);
302 static void __exit
nft_rbtree_module_exit(void)
304 nft_unregister_set(&nft_rbtree_ops
);
307 module_init(nft_rbtree_module_init
);
308 module_exit(nft_rbtree_module_exit
);
310 MODULE_LICENSE("GPL");
311 MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
312 MODULE_ALIAS_NFT_SET();