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 | ||
7632667d PNA |
21 | static DEFINE_SPINLOCK(nft_rbtree_lock); |
22 | ||
20a69341 PM |
23 | struct nft_rbtree { |
24 | struct rb_root root; | |
25 | }; | |
26 | ||
27 | struct nft_rbtree_elem { | |
28 | struct rb_node node; | |
fe2811eb | 29 | struct nft_set_ext ext; |
20a69341 PM |
30 | }; |
31 | ||
cc02e457 | 32 | |
20a69341 PM |
33 | static bool nft_rbtree_lookup(const struct nft_set *set, |
34 | const struct nft_data *key, | |
b2832dd6 | 35 | const struct nft_set_ext **ext) |
20a69341 PM |
36 | { |
37 | const struct nft_rbtree *priv = nft_set_priv(set); | |
38 | const struct nft_rbtree_elem *rbe, *interval = NULL; | |
16c45eda | 39 | const struct rb_node *parent; |
cc02e457 | 40 | u8 genmask = nft_genmask_cur(read_pnet(&set->pnet)); |
20a69341 PM |
41 | int d; |
42 | ||
7632667d | 43 | spin_lock_bh(&nft_rbtree_lock); |
16c45eda | 44 | parent = priv->root.rb_node; |
20a69341 PM |
45 | while (parent != NULL) { |
46 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
47 | ||
fe2811eb | 48 | d = nft_data_cmp(nft_set_ext_key(&rbe->ext), key, set->klen); |
20a69341 PM |
49 | if (d < 0) { |
50 | parent = parent->rb_left; | |
51 | interval = rbe; | |
52 | } else if (d > 0) | |
53 | parent = parent->rb_right; | |
54 | else { | |
55 | found: | |
cc02e457 PM |
56 | if (!nft_set_elem_active(&rbe->ext, genmask)) { |
57 | parent = parent->rb_left; | |
58 | continue; | |
59 | } | |
fe2811eb PM |
60 | if (nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) && |
61 | *nft_set_ext_flags(&rbe->ext) & | |
62 | NFT_SET_ELEM_INTERVAL_END) | |
20a69341 | 63 | goto out; |
7632667d | 64 | spin_unlock_bh(&nft_rbtree_lock); |
b2832dd6 PM |
65 | |
66 | *ext = &rbe->ext; | |
20a69341 PM |
67 | return true; |
68 | } | |
69 | } | |
70 | ||
71 | if (set->flags & NFT_SET_INTERVAL && interval != NULL) { | |
72 | rbe = interval; | |
73 | goto found; | |
74 | } | |
75 | out: | |
7632667d | 76 | spin_unlock_bh(&nft_rbtree_lock); |
20a69341 PM |
77 | return false; |
78 | } | |
79 | ||
20a69341 PM |
80 | static int __nft_rbtree_insert(const struct nft_set *set, |
81 | struct nft_rbtree_elem *new) | |
82 | { | |
83 | struct nft_rbtree *priv = nft_set_priv(set); | |
84 | struct nft_rbtree_elem *rbe; | |
85 | struct rb_node *parent, **p; | |
cc02e457 | 86 | u8 genmask = nft_genmask_next(read_pnet(&set->pnet)); |
20a69341 PM |
87 | int d; |
88 | ||
89 | parent = NULL; | |
90 | p = &priv->root.rb_node; | |
91 | while (*p != NULL) { | |
92 | parent = *p; | |
93 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
fe2811eb PM |
94 | d = nft_data_cmp(nft_set_ext_key(&rbe->ext), |
95 | nft_set_ext_key(&new->ext), | |
96 | set->klen); | |
20a69341 PM |
97 | if (d < 0) |
98 | p = &parent->rb_left; | |
99 | else if (d > 0) | |
100 | p = &parent->rb_right; | |
cc02e457 PM |
101 | else { |
102 | if (nft_set_elem_active(&rbe->ext, genmask)) | |
103 | return -EEXIST; | |
104 | p = &parent->rb_left; | |
105 | } | |
20a69341 PM |
106 | } |
107 | rb_link_node(&new->node, parent, p); | |
108 | rb_insert_color(&new->node, &priv->root); | |
109 | return 0; | |
110 | } | |
111 | ||
112 | static int nft_rbtree_insert(const struct nft_set *set, | |
113 | const struct nft_set_elem *elem) | |
114 | { | |
fe2811eb | 115 | struct nft_rbtree_elem *rbe = elem->priv; |
20a69341 PM |
116 | int err; |
117 | ||
7632667d | 118 | spin_lock_bh(&nft_rbtree_lock); |
20a69341 | 119 | err = __nft_rbtree_insert(set, rbe); |
7632667d | 120 | spin_unlock_bh(&nft_rbtree_lock); |
fe2811eb | 121 | |
20a69341 PM |
122 | return err; |
123 | } | |
124 | ||
125 | static void nft_rbtree_remove(const struct nft_set *set, | |
126 | const struct nft_set_elem *elem) | |
127 | { | |
128 | struct nft_rbtree *priv = nft_set_priv(set); | |
cc02e457 | 129 | struct nft_rbtree_elem *rbe = elem->priv; |
20a69341 | 130 | |
7632667d | 131 | spin_lock_bh(&nft_rbtree_lock); |
20a69341 | 132 | rb_erase(&rbe->node, &priv->root); |
7632667d | 133 | spin_unlock_bh(&nft_rbtree_lock); |
20a69341 PM |
134 | } |
135 | ||
cc02e457 PM |
136 | static void nft_rbtree_activate(const struct nft_set *set, |
137 | const struct nft_set_elem *elem) | |
138 | { | |
139 | struct nft_rbtree_elem *rbe = elem->priv; | |
140 | ||
141 | nft_set_elem_change_active(set, &rbe->ext); | |
142 | } | |
143 | ||
144 | static void *nft_rbtree_deactivate(const struct nft_set *set, | |
145 | const struct nft_set_elem *elem) | |
20a69341 PM |
146 | { |
147 | const struct nft_rbtree *priv = nft_set_priv(set); | |
148 | const struct rb_node *parent = priv->root.rb_node; | |
149 | struct nft_rbtree_elem *rbe; | |
cc02e457 | 150 | u8 genmask = nft_genmask_cur(read_pnet(&set->pnet)); |
20a69341 PM |
151 | int d; |
152 | ||
153 | while (parent != NULL) { | |
154 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
155 | ||
fe2811eb PM |
156 | d = nft_data_cmp(nft_set_ext_key(&rbe->ext), &elem->key, |
157 | set->klen); | |
20a69341 PM |
158 | if (d < 0) |
159 | parent = parent->rb_left; | |
160 | else if (d > 0) | |
161 | parent = parent->rb_right; | |
162 | else { | |
cc02e457 PM |
163 | if (!nft_set_elem_active(&rbe->ext, genmask)) { |
164 | parent = parent->rb_left; | |
165 | continue; | |
166 | } | |
167 | nft_set_elem_change_active(set, &rbe->ext); | |
168 | return rbe; | |
20a69341 PM |
169 | } |
170 | } | |
cc02e457 | 171 | return NULL; |
20a69341 PM |
172 | } |
173 | ||
174 | static void nft_rbtree_walk(const struct nft_ctx *ctx, | |
175 | const struct nft_set *set, | |
176 | struct nft_set_iter *iter) | |
177 | { | |
178 | const struct nft_rbtree *priv = nft_set_priv(set); | |
fe2811eb | 179 | struct nft_rbtree_elem *rbe; |
20a69341 PM |
180 | struct nft_set_elem elem; |
181 | struct rb_node *node; | |
cc02e457 | 182 | u8 genmask = nft_genmask_cur(read_pnet(&set->pnet)); |
20a69341 | 183 | |
7632667d | 184 | spin_lock_bh(&nft_rbtree_lock); |
20a69341 | 185 | for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { |
cc02e457 PM |
186 | rbe = rb_entry(node, struct nft_rbtree_elem, node); |
187 | ||
20a69341 PM |
188 | if (iter->count < iter->skip) |
189 | goto cont; | |
cc02e457 PM |
190 | if (!nft_set_elem_active(&rbe->ext, genmask)) |
191 | goto cont; | |
20a69341 | 192 | |
fe2811eb | 193 | elem.priv = rbe; |
20a69341 PM |
194 | |
195 | iter->err = iter->fn(ctx, set, iter, &elem); | |
7632667d PNA |
196 | if (iter->err < 0) { |
197 | spin_unlock_bh(&nft_rbtree_lock); | |
20a69341 | 198 | return; |
7632667d | 199 | } |
20a69341 PM |
200 | cont: |
201 | iter->count++; | |
202 | } | |
7632667d | 203 | spin_unlock_bh(&nft_rbtree_lock); |
20a69341 PM |
204 | } |
205 | ||
206 | static unsigned int nft_rbtree_privsize(const struct nlattr * const nla[]) | |
207 | { | |
208 | return sizeof(struct nft_rbtree); | |
209 | } | |
210 | ||
211 | static int nft_rbtree_init(const struct nft_set *set, | |
c50b960c | 212 | const struct nft_set_desc *desc, |
20a69341 PM |
213 | const struct nlattr * const nla[]) |
214 | { | |
215 | struct nft_rbtree *priv = nft_set_priv(set); | |
216 | ||
217 | priv->root = RB_ROOT; | |
218 | return 0; | |
219 | } | |
220 | ||
221 | static void nft_rbtree_destroy(const struct nft_set *set) | |
222 | { | |
223 | struct nft_rbtree *priv = nft_set_priv(set); | |
224 | struct nft_rbtree_elem *rbe; | |
225 | struct rb_node *node; | |
226 | ||
227 | while ((node = priv->root.rb_node) != NULL) { | |
228 | rb_erase(node, &priv->root); | |
229 | rbe = rb_entry(node, struct nft_rbtree_elem, node); | |
61edafbb | 230 | nft_set_elem_destroy(set, rbe); |
20a69341 PM |
231 | } |
232 | } | |
233 | ||
c50b960c PM |
234 | static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features, |
235 | struct nft_set_estimate *est) | |
236 | { | |
237 | unsigned int nsize; | |
238 | ||
239 | nsize = sizeof(struct nft_rbtree_elem); | |
c50b960c PM |
240 | if (desc->size) |
241 | est->size = sizeof(struct nft_rbtree) + desc->size * nsize; | |
242 | else | |
243 | est->size = nsize; | |
244 | ||
245 | est->class = NFT_SET_CLASS_O_LOG_N; | |
246 | ||
247 | return true; | |
248 | } | |
249 | ||
20a69341 PM |
250 | static struct nft_set_ops nft_rbtree_ops __read_mostly = { |
251 | .privsize = nft_rbtree_privsize, | |
fe2811eb | 252 | .elemsize = offsetof(struct nft_rbtree_elem, ext), |
c50b960c | 253 | .estimate = nft_rbtree_estimate, |
20a69341 PM |
254 | .init = nft_rbtree_init, |
255 | .destroy = nft_rbtree_destroy, | |
256 | .insert = nft_rbtree_insert, | |
257 | .remove = nft_rbtree_remove, | |
cc02e457 PM |
258 | .deactivate = nft_rbtree_deactivate, |
259 | .activate = nft_rbtree_activate, | |
20a69341 PM |
260 | .lookup = nft_rbtree_lookup, |
261 | .walk = nft_rbtree_walk, | |
262 | .features = NFT_SET_INTERVAL | NFT_SET_MAP, | |
263 | .owner = THIS_MODULE, | |
264 | }; | |
265 | ||
266 | static int __init nft_rbtree_module_init(void) | |
267 | { | |
268 | return nft_register_set(&nft_rbtree_ops); | |
269 | } | |
270 | ||
271 | static void __exit nft_rbtree_module_exit(void) | |
272 | { | |
273 | nft_unregister_set(&nft_rbtree_ops); | |
274 | } | |
275 | ||
276 | module_init(nft_rbtree_module_init); | |
277 | module_exit(nft_rbtree_module_exit); | |
278 | ||
279 | MODULE_LICENSE("GPL"); | |
280 | MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>"); | |
281 | MODULE_ALIAS_NFT_SET(); |