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>
25 struct nft_rbtree_elem {
29 struct nft_data data[];
32 static bool nft_rbtree_lookup(const struct nft_set *set,
33 const struct nft_data *key,
34 struct nft_data *data)
36 const struct nft_rbtree *priv = nft_set_priv(set);
37 const struct nft_rbtree_elem *rbe, *interval = NULL;
38 const struct rb_node *parent = priv->root.rb_node;
41 while (parent != NULL) {
42 rbe = rb_entry(parent, struct nft_rbtree_elem, node);
44 d = nft_data_cmp(&rbe->key, key, set->klen);
46 parent = parent->rb_left;
49 parent = parent->rb_right;
52 if (rbe->flags & NFT_SET_ELEM_INTERVAL_END)
54 if (set->flags & NFT_SET_MAP)
55 nft_data_copy(data, rbe->data);
60 if (set->flags & NFT_SET_INTERVAL && interval != NULL) {
68 static void nft_rbtree_elem_destroy(const struct nft_set *set,
69 struct nft_rbtree_elem *rbe)
71 nft_data_uninit(&rbe->key, NFT_DATA_VALUE);
72 if (set->flags & NFT_SET_MAP)
73 nft_data_uninit(rbe->data, set->dtype);
77 static int __nft_rbtree_insert(const struct nft_set *set,
78 struct nft_rbtree_elem *new)
80 struct nft_rbtree *priv = nft_set_priv(set);
81 struct nft_rbtree_elem *rbe;
82 struct rb_node *parent, **p;
86 p = &priv->root.rb_node;
89 rbe = rb_entry(parent, struct nft_rbtree_elem, node);
90 d = nft_data_cmp(&rbe->key, &new->key, set->klen);
94 p = &parent->rb_right;
98 rb_link_node(&new->node, parent, p);
99 rb_insert_color(&new->node, &priv->root);
103 static int nft_rbtree_insert(const struct nft_set *set,
104 const struct nft_set_elem *elem)
106 struct nft_rbtree_elem *rbe;
111 if (set->flags & NFT_SET_MAP)
112 size += sizeof(rbe->data[0]);
114 rbe = kzalloc(size, GFP_KERNEL);
118 rbe->flags = elem->flags;
119 nft_data_copy(&rbe->key, &elem->key);
120 if (set->flags & NFT_SET_MAP)
121 nft_data_copy(rbe->data, &elem->data);
123 err = __nft_rbtree_insert(set, rbe);
129 static void nft_rbtree_remove(const struct nft_set *set,
130 const struct nft_set_elem *elem)
132 struct nft_rbtree *priv = nft_set_priv(set);
133 struct nft_rbtree_elem *rbe = elem->cookie;
135 rb_erase(&rbe->node, &priv->root);
139 static int nft_rbtree_get(const struct nft_set *set, struct nft_set_elem *elem)
141 const struct nft_rbtree *priv = nft_set_priv(set);
142 const struct rb_node *parent = priv->root.rb_node;
143 struct nft_rbtree_elem *rbe;
146 while (parent != NULL) {
147 rbe = rb_entry(parent, struct nft_rbtree_elem, node);
149 d = nft_data_cmp(&rbe->key, &elem->key, set->klen);
151 parent = parent->rb_left;
153 parent = parent->rb_right;
156 if (set->flags & NFT_SET_MAP)
157 nft_data_copy(&elem->data, rbe->data);
158 elem->flags = rbe->flags;
165 static void nft_rbtree_walk(const struct nft_ctx *ctx,
166 const struct nft_set *set,
167 struct nft_set_iter *iter)
169 const struct nft_rbtree *priv = nft_set_priv(set);
170 const struct nft_rbtree_elem *rbe;
171 struct nft_set_elem elem;
172 struct rb_node *node;
174 for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) {
175 if (iter->count < iter->skip)
178 rbe = rb_entry(node, struct nft_rbtree_elem, node);
179 nft_data_copy(&elem.key, &rbe->key);
180 if (set->flags & NFT_SET_MAP)
181 nft_data_copy(&elem.data, rbe->data);
182 elem.flags = rbe->flags;
184 iter->err = iter->fn(ctx, set, iter, &elem);
192 static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[])
194 return sizeof(struct nft_rbtree);
197 static int nft_rbtree_init(const struct nft_set *set,
198 const struct nlattr * const nla[])
200 struct nft_rbtree *priv = nft_set_priv(set);
202 priv->root = RB_ROOT;
206 static void nft_rbtree_destroy(const struct nft_set *set)
208 struct nft_rbtree *priv = nft_set_priv(set);
209 struct nft_rbtree_elem *rbe;
210 struct rb_node *node;
212 while ((node = priv->root.rb_node) != NULL) {
213 rb_erase(node, &priv->root);
214 rbe = rb_entry(node, struct nft_rbtree_elem, node);
215 nft_rbtree_elem_destroy(set, rbe);
219 static struct nft_set_ops nft_rbtree_ops __read_mostly = {
220 .privsize = nft_rbtree_privsize,
221 .init = nft_rbtree_init,
222 .destroy = nft_rbtree_destroy,
223 .insert = nft_rbtree_insert,
224 .remove = nft_rbtree_remove,
225 .get = nft_rbtree_get,
226 .lookup = nft_rbtree_lookup,
227 .walk = nft_rbtree_walk,
228 .features = NFT_SET_INTERVAL | NFT_SET_MAP,
229 .owner = THIS_MODULE,
232 static int __init nft_rbtree_module_init(void)
234 return nft_register_set(&nft_rbtree_ops);
237 static void __exit nft_rbtree_module_exit(void)
239 nft_unregister_set(&nft_rbtree_ops);
242 module_init(nft_rbtree_module_init);
243 module_exit(nft_rbtree_module_exit);
245 MODULE_LICENSE("GPL");
246 MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
247 MODULE_ALIAS_NFT_SET();