Commit | Line | Data |
---|---|---|
d2912cb1 | 1 | // SPDX-License-Identifier: GPL-2.0-only |
20a69341 PM |
2 | /* |
3 | * Copyright (c) 2008-2009 Patrick McHardy <kaber@trash.net> | |
4 | * | |
20a69341 PM |
5 | * Development of this code funded by Astaro AG (http://www.astaro.com/) |
6 | */ | |
7 | ||
8 | #include <linux/kernel.h> | |
9 | #include <linux/init.h> | |
10 | #include <linux/module.h> | |
11 | #include <linux/list.h> | |
12 | #include <linux/rbtree.h> | |
13 | #include <linux/netlink.h> | |
14 | #include <linux/netfilter.h> | |
15 | #include <linux/netfilter/nf_tables.h> | |
5785cf15 | 16 | #include <net/netfilter/nf_tables_core.h> |
20a69341 PM |
17 | |
18 | struct nft_rbtree { | |
19 | struct rb_root root; | |
9b7e26ae | 20 | rwlock_t lock; |
b901892b | 21 | seqcount_rwlock_t count; |
8d8540c4 | 22 | struct delayed_work gc_work; |
20a69341 PM |
23 | }; |
24 | ||
25 | struct nft_rbtree_elem { | |
26 | struct rb_node node; | |
fe2811eb | 27 | struct nft_set_ext ext; |
20a69341 PM |
28 | }; |
29 | ||
ef1d20e0 PNA |
30 | static bool nft_rbtree_interval_end(const struct nft_rbtree_elem *rbe) |
31 | { | |
32 | return nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) && | |
33 | (*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END); | |
34 | } | |
cc02e457 | 35 | |
6f7c9caf SB |
36 | static bool nft_rbtree_interval_start(const struct nft_rbtree_elem *rbe) |
37 | { | |
38 | return !nft_rbtree_interval_end(rbe); | |
39 | } | |
40 | ||
c9e6978e PNA |
41 | static int nft_rbtree_cmp(const struct nft_set *set, |
42 | const struct nft_rbtree_elem *e1, | |
43 | const struct nft_rbtree_elem *e2) | |
e701001e | 44 | { |
c9e6978e PNA |
45 | return memcmp(nft_set_ext_key(&e1->ext), nft_set_ext_key(&e2->ext), |
46 | set->klen); | |
e701001e PNA |
47 | } |
48 | ||
f6c383b8 PNA |
49 | static bool nft_rbtree_elem_expired(const struct nft_rbtree_elem *rbe) |
50 | { | |
51 | return nft_set_elem_expired(&rbe->ext) || | |
52 | nft_set_elem_is_dead(&rbe->ext); | |
53 | } | |
54 | ||
9b7e26ae FW |
55 | static bool __nft_rbtree_lookup(const struct net *net, const struct nft_set *set, |
56 | const u32 *key, const struct nft_set_ext **ext, | |
57 | unsigned int seq) | |
20a69341 | 58 | { |
03e5fd0e | 59 | struct nft_rbtree *priv = nft_set_priv(set); |
20a69341 | 60 | const struct nft_rbtree_elem *rbe, *interval = NULL; |
42a55769 | 61 | u8 genmask = nft_genmask_cur(net); |
16c45eda | 62 | const struct rb_node *parent; |
20a69341 PM |
63 | int d; |
64 | ||
9b7e26ae | 65 | parent = rcu_dereference_raw(priv->root.rb_node); |
20a69341 | 66 | while (parent != NULL) { |
9b7e26ae FW |
67 | if (read_seqcount_retry(&priv->count, seq)) |
68 | return false; | |
69 | ||
20a69341 PM |
70 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); |
71 | ||
c9e6978e | 72 | d = memcmp(nft_set_ext_key(&rbe->ext), key, set->klen); |
20a69341 | 73 | if (d < 0) { |
9b7e26ae | 74 | parent = rcu_dereference_raw(parent->rb_left); |
f9121355 | 75 | if (interval && |
c9e6978e | 76 | !nft_rbtree_cmp(set, rbe, interval) && |
82e20b44 | 77 | nft_rbtree_interval_end(rbe) && |
6f7c9caf | 78 | nft_rbtree_interval_start(interval)) |
e701001e | 79 | continue; |
20a69341 PM |
80 | interval = rbe; |
81 | } else if (d > 0) | |
9b7e26ae | 82 | parent = rcu_dereference_raw(parent->rb_right); |
20a69341 | 83 | else { |
cc02e457 | 84 | if (!nft_set_elem_active(&rbe->ext, genmask)) { |
9b7e26ae | 85 | parent = rcu_dereference_raw(parent->rb_left); |
cc02e457 PM |
86 | continue; |
87 | } | |
340eaff6 | 88 | |
f6c383b8 | 89 | if (nft_rbtree_elem_expired(rbe)) |
340eaff6 PS |
90 | return false; |
91 | ||
db3b665d PNA |
92 | if (nft_rbtree_interval_end(rbe)) { |
93 | if (nft_set_is_anonymous(set)) | |
94 | return false; | |
95 | parent = rcu_dereference_raw(parent->rb_left); | |
96 | interval = NULL; | |
97 | continue; | |
98 | } | |
b2832dd6 PM |
99 | |
100 | *ext = &rbe->ext; | |
20a69341 PM |
101 | return true; |
102 | } | |
103 | } | |
104 | ||
c1eda3c6 PNA |
105 | if (set->flags & NFT_SET_INTERVAL && interval != NULL && |
106 | nft_set_elem_active(&interval->ext, genmask) && | |
f6c383b8 | 107 | !nft_rbtree_elem_expired(interval) && |
6f7c9caf | 108 | nft_rbtree_interval_start(interval)) { |
c1eda3c6 PNA |
109 | *ext = &interval->ext; |
110 | return true; | |
20a69341 | 111 | } |
db3b665d | 112 | |
20a69341 PM |
113 | return false; |
114 | } | |
115 | ||
f227925e FW |
116 | INDIRECT_CALLABLE_SCOPE |
117 | bool nft_rbtree_lookup(const struct net *net, const struct nft_set *set, | |
118 | const u32 *key, const struct nft_set_ext **ext) | |
9b7e26ae FW |
119 | { |
120 | struct nft_rbtree *priv = nft_set_priv(set); | |
121 | unsigned int seq = read_seqcount_begin(&priv->count); | |
122 | bool ret; | |
123 | ||
124 | ret = __nft_rbtree_lookup(net, set, key, ext, seq); | |
125 | if (ret || !read_seqcount_retry(&priv->count, seq)) | |
126 | return ret; | |
127 | ||
128 | read_lock_bh(&priv->lock); | |
129 | seq = read_seqcount_begin(&priv->count); | |
130 | ret = __nft_rbtree_lookup(net, set, key, ext, seq); | |
131 | read_unlock_bh(&priv->lock); | |
132 | ||
133 | return ret; | |
134 | } | |
135 | ||
ba0e4d99 PNA |
136 | static bool __nft_rbtree_get(const struct net *net, const struct nft_set *set, |
137 | const u32 *key, struct nft_rbtree_elem **elem, | |
138 | unsigned int seq, unsigned int flags, u8 genmask) | |
139 | { | |
140 | struct nft_rbtree_elem *rbe, *interval = NULL; | |
141 | struct nft_rbtree *priv = nft_set_priv(set); | |
142 | const struct rb_node *parent; | |
143 | const void *this; | |
144 | int d; | |
145 | ||
146 | parent = rcu_dereference_raw(priv->root.rb_node); | |
147 | while (parent != NULL) { | |
148 | if (read_seqcount_retry(&priv->count, seq)) | |
149 | return false; | |
150 | ||
151 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
152 | ||
153 | this = nft_set_ext_key(&rbe->ext); | |
154 | d = memcmp(this, key, set->klen); | |
155 | if (d < 0) { | |
156 | parent = rcu_dereference_raw(parent->rb_left); | |
3b18d5eb PNA |
157 | if (!(flags & NFT_SET_ELEM_INTERVAL_END)) |
158 | interval = rbe; | |
ba0e4d99 PNA |
159 | } else if (d > 0) { |
160 | parent = rcu_dereference_raw(parent->rb_right); | |
3b18d5eb PNA |
161 | if (flags & NFT_SET_ELEM_INTERVAL_END) |
162 | interval = rbe; | |
ba0e4d99 | 163 | } else { |
db3b665d | 164 | if (!nft_set_elem_active(&rbe->ext, genmask)) { |
ba0e4d99 | 165 | parent = rcu_dereference_raw(parent->rb_left); |
db3b665d PNA |
166 | continue; |
167 | } | |
ba0e4d99 | 168 | |
340eaff6 PS |
169 | if (nft_set_elem_expired(&rbe->ext)) |
170 | return false; | |
171 | ||
ba0e4d99 PNA |
172 | if (!nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) || |
173 | (*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END) == | |
174 | (flags & NFT_SET_ELEM_INTERVAL_END)) { | |
175 | *elem = rbe; | |
176 | return true; | |
177 | } | |
db3b665d PNA |
178 | |
179 | if (nft_rbtree_interval_end(rbe)) | |
180 | interval = NULL; | |
181 | ||
182 | parent = rcu_dereference_raw(parent->rb_left); | |
ba0e4d99 PNA |
183 | } |
184 | } | |
185 | ||
186 | if (set->flags & NFT_SET_INTERVAL && interval != NULL && | |
187 | nft_set_elem_active(&interval->ext, genmask) && | |
340eaff6 | 188 | !nft_set_elem_expired(&interval->ext) && |
3b18d5eb PNA |
189 | ((!nft_rbtree_interval_end(interval) && |
190 | !(flags & NFT_SET_ELEM_INTERVAL_END)) || | |
191 | (nft_rbtree_interval_end(interval) && | |
192 | (flags & NFT_SET_ELEM_INTERVAL_END)))) { | |
ba0e4d99 PNA |
193 | *elem = interval; |
194 | return true; | |
195 | } | |
196 | ||
197 | return false; | |
198 | } | |
199 | ||
200 | static void *nft_rbtree_get(const struct net *net, const struct nft_set *set, | |
201 | const struct nft_set_elem *elem, unsigned int flags) | |
202 | { | |
203 | struct nft_rbtree *priv = nft_set_priv(set); | |
204 | unsigned int seq = read_seqcount_begin(&priv->count); | |
205 | struct nft_rbtree_elem *rbe = ERR_PTR(-ENOENT); | |
206 | const u32 *key = (const u32 *)&elem->key.val; | |
207 | u8 genmask = nft_genmask_cur(net); | |
208 | bool ret; | |
209 | ||
210 | ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask); | |
211 | if (ret || !read_seqcount_retry(&priv->count, seq)) | |
212 | return rbe; | |
213 | ||
214 | read_lock_bh(&priv->lock); | |
215 | seq = read_seqcount_begin(&priv->count); | |
216 | ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask); | |
217 | if (!ret) | |
218 | rbe = ERR_PTR(-ENOENT); | |
219 | read_unlock_bh(&priv->lock); | |
220 | ||
221 | return rbe; | |
222 | } | |
223 | ||
f6c383b8 PNA |
224 | static void nft_rbtree_gc_remove(struct net *net, struct nft_set *set, |
225 | struct nft_rbtree *priv, | |
226 | struct nft_rbtree_elem *rbe) | |
227 | { | |
228 | struct nft_set_elem elem = { | |
229 | .priv = rbe, | |
230 | }; | |
231 | ||
232 | nft_setelem_data_deactivate(net, set, &elem); | |
233 | rb_erase(&rbe->node, &priv->root); | |
234 | } | |
235 | ||
c9e6978e PNA |
236 | static int nft_rbtree_gc_elem(const struct nft_set *__set, |
237 | struct nft_rbtree *priv, | |
f718863a FW |
238 | struct nft_rbtree_elem *rbe, |
239 | u8 genmask) | |
c9e6978e PNA |
240 | { |
241 | struct nft_set *set = (struct nft_set *)__set; | |
242 | struct rb_node *prev = rb_prev(&rbe->node); | |
f6c383b8 | 243 | struct net *net = read_pnet(&set->net); |
f718863a | 244 | struct nft_rbtree_elem *rbe_prev; |
f6c383b8 | 245 | struct nft_trans_gc *gc; |
c9e6978e | 246 | |
f6c383b8 PNA |
247 | gc = nft_trans_gc_alloc(set, 0, GFP_ATOMIC); |
248 | if (!gc) | |
c9e6978e PNA |
249 | return -ENOMEM; |
250 | ||
f718863a FW |
251 | /* search for end interval coming before this element. |
252 | * end intervals don't carry a timeout extension, they | |
253 | * are coupled with the interval start element. | |
254 | */ | |
61ae320a | 255 | while (prev) { |
c9e6978e | 256 | rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node); |
f718863a FW |
257 | if (nft_rbtree_interval_end(rbe_prev) && |
258 | nft_set_elem_active(&rbe_prev->ext, genmask)) | |
c9e6978e PNA |
259 | break; |
260 | ||
261 | prev = rb_prev(prev); | |
61ae320a FW |
262 | } |
263 | ||
f718863a FW |
264 | if (prev) { |
265 | rbe_prev = rb_entry(prev, struct nft_rbtree_elem, node); | |
f6c383b8 | 266 | nft_rbtree_gc_remove(net, set, priv, rbe_prev); |
f718863a | 267 | |
f6c383b8 PNA |
268 | /* There is always room in this trans gc for this element, |
269 | * memory allocation never actually happens, hence, the warning | |
270 | * splat in such case. No need to set NFT_SET_ELEM_DEAD_BIT, | |
271 | * this is synchronous gc which never fails. | |
272 | */ | |
273 | gc = nft_trans_gc_queue_sync(gc, GFP_ATOMIC); | |
274 | if (WARN_ON_ONCE(!gc)) | |
275 | return -ENOMEM; | |
276 | ||
277 | nft_trans_gc_elem_add(gc, rbe_prev); | |
61ae320a | 278 | } |
c9e6978e | 279 | |
f6c383b8 PNA |
280 | nft_rbtree_gc_remove(net, set, priv, rbe); |
281 | gc = nft_trans_gc_queue_sync(gc, GFP_ATOMIC); | |
282 | if (WARN_ON_ONCE(!gc)) | |
283 | return -ENOMEM; | |
284 | ||
285 | nft_trans_gc_elem_add(gc, rbe); | |
c9e6978e | 286 | |
f6c383b8 | 287 | nft_trans_gc_queue_sync_done(gc); |
c9e6978e PNA |
288 | |
289 | return 0; | |
290 | } | |
291 | ||
292 | static bool nft_rbtree_update_first(const struct nft_set *set, | |
293 | struct nft_rbtree_elem *rbe, | |
294 | struct rb_node *first) | |
295 | { | |
296 | struct nft_rbtree_elem *first_elem; | |
297 | ||
298 | first_elem = rb_entry(first, struct nft_rbtree_elem, node); | |
299 | /* this element is closest to where the new element is to be inserted: | |
300 | * update the first element for the node list path. | |
301 | */ | |
302 | if (nft_rbtree_cmp(set, rbe, first_elem) < 0) | |
303 | return true; | |
304 | ||
305 | return false; | |
306 | } | |
307 | ||
42a55769 | 308 | static int __nft_rbtree_insert(const struct net *net, const struct nft_set *set, |
c016c7e4 PNA |
309 | struct nft_rbtree_elem *new, |
310 | struct nft_set_ext **ext) | |
20a69341 | 311 | { |
c9e6978e | 312 | struct nft_rbtree_elem *rbe, *rbe_le = NULL, *rbe_ge = NULL; |
61ae320a | 313 | struct rb_node *node, *next, *parent, **p, *first = NULL; |
20a69341 | 314 | struct nft_rbtree *priv = nft_set_priv(set); |
42a55769 | 315 | u8 genmask = nft_genmask_next(net); |
c9e6978e | 316 | int d, err; |
20a69341 | 317 | |
c9e6978e PNA |
318 | /* Descend the tree to search for an existing element greater than the |
319 | * key value to insert that is greater than the new element. This is the | |
320 | * first element to walk the ordered elements to find possible overlap. | |
7c84d414 | 321 | */ |
20a69341 PM |
322 | parent = NULL; |
323 | p = &priv->root.rb_node; | |
324 | while (*p != NULL) { | |
325 | parent = *p; | |
326 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
c9e6978e PNA |
327 | d = nft_rbtree_cmp(set, rbe, new); |
328 | ||
7c84d414 | 329 | if (d < 0) { |
20a69341 | 330 | p = &parent->rb_left; |
7c84d414 | 331 | } else if (d > 0) { |
c9e6978e PNA |
332 | if (!first || |
333 | nft_rbtree_update_first(set, rbe, first)) | |
334 | first = &rbe->node; | |
7c84d414 | 335 | |
c9e6978e | 336 | p = &parent->rb_right; |
7c84d414 | 337 | } else { |
c9e6978e | 338 | if (nft_rbtree_interval_end(rbe)) |
d2df92e9 | 339 | p = &parent->rb_left; |
c9e6978e | 340 | else |
d2df92e9 | 341 | p = &parent->rb_right; |
c9e6978e PNA |
342 | } |
343 | } | |
344 | ||
345 | if (!first) | |
346 | first = rb_first(&priv->root); | |
347 | ||
348 | /* Detect overlap by going through the list of valid tree nodes. | |
349 | * Values stored in the tree are in reversed order, starting from | |
350 | * highest to lowest value. | |
351 | */ | |
61ae320a FW |
352 | for (node = first; node != NULL; node = next) { |
353 | next = rb_next(node); | |
354 | ||
c9e6978e PNA |
355 | rbe = rb_entry(node, struct nft_rbtree_elem, node); |
356 | ||
357 | if (!nft_set_elem_active(&rbe->ext, genmask)) | |
358 | continue; | |
359 | ||
360 | /* perform garbage collection to avoid bogus overlap reports. */ | |
361 | if (nft_set_elem_expired(&rbe->ext)) { | |
f718863a | 362 | err = nft_rbtree_gc_elem(set, priv, rbe, genmask); |
c9e6978e PNA |
363 | if (err < 0) |
364 | return err; | |
7c84d414 | 365 | |
c9e6978e PNA |
366 | continue; |
367 | } | |
368 | ||
369 | d = nft_rbtree_cmp(set, rbe, new); | |
370 | if (d == 0) { | |
371 | /* Matching end element: no need to look for an | |
372 | * overlapping greater or equal element. | |
373 | */ | |
374 | if (nft_rbtree_interval_end(rbe)) { | |
375 | rbe_le = rbe; | |
376 | break; | |
377 | } | |
378 | ||
379 | /* first element that is greater or equal to key value. */ | |
380 | if (!rbe_ge) { | |
381 | rbe_ge = rbe; | |
382 | continue; | |
e701001e | 383 | } |
c9e6978e PNA |
384 | |
385 | /* this is a closer more or equal element, update it. */ | |
386 | if (nft_rbtree_cmp(set, rbe_ge, new) != 0) { | |
387 | rbe_ge = rbe; | |
388 | continue; | |
389 | } | |
390 | ||
391 | /* element is equal to key value, make sure flags are | |
392 | * the same, an existing more or equal start element | |
393 | * must not be replaced by more or equal end element. | |
394 | */ | |
395 | if ((nft_rbtree_interval_start(new) && | |
396 | nft_rbtree_interval_start(rbe_ge)) || | |
397 | (nft_rbtree_interval_end(new) && | |
398 | nft_rbtree_interval_end(rbe_ge))) { | |
399 | rbe_ge = rbe; | |
400 | continue; | |
401 | } | |
402 | } else if (d > 0) { | |
403 | /* annotate element greater than the new element. */ | |
404 | rbe_ge = rbe; | |
405 | continue; | |
406 | } else if (d < 0) { | |
407 | /* annotate element less than the new element. */ | |
408 | rbe_le = rbe; | |
409 | break; | |
cc02e457 | 410 | } |
c9e6978e | 411 | } |
07267630 | 412 | |
c9e6978e PNA |
413 | /* - new start element matching existing start element: full overlap |
414 | * reported as -EEXIST, cleared by caller if NLM_F_EXCL is not given. | |
415 | */ | |
416 | if (rbe_ge && !nft_rbtree_cmp(set, new, rbe_ge) && | |
417 | nft_rbtree_interval_start(rbe_ge) == nft_rbtree_interval_start(new)) { | |
418 | *ext = &rbe_ge->ext; | |
419 | return -EEXIST; | |
20a69341 | 420 | } |
7c84d414 | 421 | |
c9e6978e PNA |
422 | /* - new end element matching existing end element: full overlap |
423 | * reported as -EEXIST, cleared by caller if NLM_F_EXCL is not given. | |
424 | */ | |
425 | if (rbe_le && !nft_rbtree_cmp(set, new, rbe_le) && | |
426 | nft_rbtree_interval_end(rbe_le) == nft_rbtree_interval_end(new)) { | |
427 | *ext = &rbe_le->ext; | |
428 | return -EEXIST; | |
429 | } | |
430 | ||
431 | /* - new start element with existing closest, less or equal key value | |
432 | * being a start element: partial overlap, reported as -ENOTEMPTY. | |
433 | * Anonymous sets allow for two consecutive start element since they | |
434 | * are constant, skip them to avoid bogus overlap reports. | |
435 | */ | |
436 | if (!nft_set_is_anonymous(set) && rbe_le && | |
437 | nft_rbtree_interval_start(rbe_le) && nft_rbtree_interval_start(new)) | |
7c84d414 SB |
438 | return -ENOTEMPTY; |
439 | ||
c9e6978e PNA |
440 | /* - new end element with existing closest, less or equal key value |
441 | * being a end element: partial overlap, reported as -ENOTEMPTY. | |
442 | */ | |
443 | if (rbe_le && | |
444 | nft_rbtree_interval_end(rbe_le) && nft_rbtree_interval_end(new)) | |
445 | return -ENOTEMPTY; | |
446 | ||
447 | /* - new end element with existing closest, greater or equal key value | |
448 | * being an end element: partial overlap, reported as -ENOTEMPTY | |
449 | */ | |
450 | if (rbe_ge && | |
451 | nft_rbtree_interval_end(rbe_ge) && nft_rbtree_interval_end(new)) | |
452 | return -ENOTEMPTY; | |
453 | ||
454 | /* Accepted element: pick insertion point depending on key value */ | |
455 | parent = NULL; | |
456 | p = &priv->root.rb_node; | |
457 | while (*p != NULL) { | |
458 | parent = *p; | |
459 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
460 | d = nft_rbtree_cmp(set, rbe, new); | |
461 | ||
462 | if (d < 0) | |
463 | p = &parent->rb_left; | |
464 | else if (d > 0) | |
465 | p = &parent->rb_right; | |
466 | else if (nft_rbtree_interval_end(rbe)) | |
467 | p = &parent->rb_left; | |
468 | else | |
469 | p = &parent->rb_right; | |
470 | } | |
471 | ||
9b7e26ae | 472 | rb_link_node_rcu(&new->node, parent, p); |
20a69341 PM |
473 | rb_insert_color(&new->node, &priv->root); |
474 | return 0; | |
475 | } | |
476 | ||
42a55769 | 477 | static int nft_rbtree_insert(const struct net *net, const struct nft_set *set, |
c016c7e4 PNA |
478 | const struct nft_set_elem *elem, |
479 | struct nft_set_ext **ext) | |
20a69341 | 480 | { |
03e5fd0e | 481 | struct nft_rbtree *priv = nft_set_priv(set); |
fe2811eb | 482 | struct nft_rbtree_elem *rbe = elem->priv; |
20a69341 PM |
483 | int err; |
484 | ||
03e5fd0e | 485 | write_lock_bh(&priv->lock); |
9b7e26ae | 486 | write_seqcount_begin(&priv->count); |
c016c7e4 | 487 | err = __nft_rbtree_insert(net, set, rbe, ext); |
9b7e26ae | 488 | write_seqcount_end(&priv->count); |
03e5fd0e | 489 | write_unlock_bh(&priv->lock); |
fe2811eb | 490 | |
20a69341 PM |
491 | return err; |
492 | } | |
493 | ||
5cb82a38 PNA |
494 | static void nft_rbtree_remove(const struct net *net, |
495 | const struct nft_set *set, | |
20a69341 PM |
496 | const struct nft_set_elem *elem) |
497 | { | |
498 | struct nft_rbtree *priv = nft_set_priv(set); | |
cc02e457 | 499 | struct nft_rbtree_elem *rbe = elem->priv; |
20a69341 | 500 | |
03e5fd0e | 501 | write_lock_bh(&priv->lock); |
9b7e26ae | 502 | write_seqcount_begin(&priv->count); |
20a69341 | 503 | rb_erase(&rbe->node, &priv->root); |
9b7e26ae | 504 | write_seqcount_end(&priv->count); |
03e5fd0e | 505 | write_unlock_bh(&priv->lock); |
20a69341 PM |
506 | } |
507 | ||
42a55769 PNA |
508 | static void nft_rbtree_activate(const struct net *net, |
509 | const struct nft_set *set, | |
cc02e457 PM |
510 | const struct nft_set_elem *elem) |
511 | { | |
512 | struct nft_rbtree_elem *rbe = elem->priv; | |
513 | ||
42a55769 | 514 | nft_set_elem_change_active(net, set, &rbe->ext); |
cc02e457 PM |
515 | } |
516 | ||
1ba1c414 PNA |
517 | static bool nft_rbtree_flush(const struct net *net, |
518 | const struct nft_set *set, void *priv) | |
37df5301 PNA |
519 | { |
520 | struct nft_rbtree_elem *rbe = priv; | |
521 | ||
f6c383b8 PNA |
522 | nft_set_elem_change_active(net, set, &rbe->ext); |
523 | ||
524 | return true; | |
37df5301 PNA |
525 | } |
526 | ||
42a55769 PNA |
527 | static void *nft_rbtree_deactivate(const struct net *net, |
528 | const struct nft_set *set, | |
cc02e457 | 529 | const struct nft_set_elem *elem) |
20a69341 PM |
530 | { |
531 | const struct nft_rbtree *priv = nft_set_priv(set); | |
532 | const struct rb_node *parent = priv->root.rb_node; | |
e701001e | 533 | struct nft_rbtree_elem *rbe, *this = elem->priv; |
42a55769 | 534 | u8 genmask = nft_genmask_next(net); |
20a69341 PM |
535 | int d; |
536 | ||
537 | while (parent != NULL) { | |
538 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
539 | ||
7d740264 PM |
540 | d = memcmp(nft_set_ext_key(&rbe->ext), &elem->key.val, |
541 | set->klen); | |
20a69341 PM |
542 | if (d < 0) |
543 | parent = parent->rb_left; | |
544 | else if (d > 0) | |
545 | parent = parent->rb_right; | |
546 | else { | |
e701001e | 547 | if (nft_rbtree_interval_end(rbe) && |
6f7c9caf | 548 | nft_rbtree_interval_start(this)) { |
e701001e PNA |
549 | parent = parent->rb_left; |
550 | continue; | |
6f7c9caf | 551 | } else if (nft_rbtree_interval_start(rbe) && |
e701001e PNA |
552 | nft_rbtree_interval_end(this)) { |
553 | parent = parent->rb_right; | |
554 | continue; | |
05b7639d PNA |
555 | } else if (!nft_set_elem_active(&rbe->ext, genmask)) { |
556 | parent = parent->rb_left; | |
557 | continue; | |
e701001e | 558 | } |
1ba1c414 | 559 | nft_rbtree_flush(net, set, rbe); |
cc02e457 | 560 | return rbe; |
20a69341 PM |
561 | } |
562 | } | |
cc02e457 | 563 | return NULL; |
20a69341 PM |
564 | } |
565 | ||
566 | static void nft_rbtree_walk(const struct nft_ctx *ctx, | |
de70185d | 567 | struct nft_set *set, |
20a69341 PM |
568 | struct nft_set_iter *iter) |
569 | { | |
03e5fd0e | 570 | struct nft_rbtree *priv = nft_set_priv(set); |
fe2811eb | 571 | struct nft_rbtree_elem *rbe; |
20a69341 PM |
572 | struct nft_set_elem elem; |
573 | struct rb_node *node; | |
574 | ||
03e5fd0e | 575 | read_lock_bh(&priv->lock); |
20a69341 | 576 | for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { |
cc02e457 PM |
577 | rbe = rb_entry(node, struct nft_rbtree_elem, node); |
578 | ||
20a69341 PM |
579 | if (iter->count < iter->skip) |
580 | goto cont; | |
8588ac09 | 581 | if (!nft_set_elem_active(&rbe->ext, iter->genmask)) |
cc02e457 | 582 | goto cont; |
20a69341 | 583 | |
fe2811eb | 584 | elem.priv = rbe; |
20a69341 PM |
585 | |
586 | iter->err = iter->fn(ctx, set, iter, &elem); | |
7632667d | 587 | if (iter->err < 0) { |
03e5fd0e | 588 | read_unlock_bh(&priv->lock); |
20a69341 | 589 | return; |
7632667d | 590 | } |
20a69341 PM |
591 | cont: |
592 | iter->count++; | |
593 | } | |
03e5fd0e | 594 | read_unlock_bh(&priv->lock); |
20a69341 PM |
595 | } |
596 | ||
8d8540c4 PNA |
597 | static void nft_rbtree_gc(struct work_struct *work) |
598 | { | |
f6c383b8 PNA |
599 | struct nft_rbtree_elem *rbe, *rbe_end = NULL; |
600 | struct nftables_pernet *nft_net; | |
8d8540c4 | 601 | struct nft_rbtree *priv; |
f6c383b8 | 602 | struct nft_trans_gc *gc; |
a13f814a | 603 | struct rb_node *node; |
8d8540c4 | 604 | struct nft_set *set; |
f6c383b8 | 605 | unsigned int gc_seq; |
5d235d6c | 606 | struct net *net; |
8d8540c4 PNA |
607 | |
608 | priv = container_of(work, struct nft_rbtree, gc_work.work); | |
609 | set = nft_set_container_of(priv); | |
5d235d6c | 610 | net = read_pnet(&set->net); |
f6c383b8 PNA |
611 | nft_net = nft_pernet(net); |
612 | gc_seq = READ_ONCE(nft_net->gc_seq); | |
613 | ||
614 | gc = nft_trans_gc_alloc(set, gc_seq, GFP_KERNEL); | |
615 | if (!gc) | |
616 | goto done; | |
8d8540c4 PNA |
617 | |
618 | write_lock_bh(&priv->lock); | |
619 | write_seqcount_begin(&priv->count); | |
620 | for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { | |
f6c383b8 PNA |
621 | |
622 | /* Ruleset has been updated, try later. */ | |
623 | if (READ_ONCE(nft_net->gc_seq) != gc_seq) { | |
624 | nft_trans_gc_destroy(gc); | |
625 | gc = NULL; | |
626 | goto try_later; | |
627 | } | |
628 | ||
8d8540c4 PNA |
629 | rbe = rb_entry(node, struct nft_rbtree_elem, node); |
630 | ||
f6c383b8 PNA |
631 | if (nft_set_elem_is_dead(&rbe->ext)) |
632 | goto dead_elem; | |
5d235d6c PNA |
633 | |
634 | /* elements are reversed in the rbtree for historical reasons, | |
635 | * from highest to lowest value, that is why end element is | |
636 | * always visited before the start element. | |
637 | */ | |
8d8540c4 | 638 | if (nft_rbtree_interval_end(rbe)) { |
a13f814a | 639 | rbe_end = rbe; |
8d8540c4 PNA |
640 | continue; |
641 | } | |
642 | if (!nft_set_elem_expired(&rbe->ext)) | |
643 | continue; | |
5d235d6c | 644 | |
f6c383b8 PNA |
645 | nft_set_elem_dead(&rbe->ext); |
646 | ||
647 | if (!rbe_end) | |
8d8540c4 PNA |
648 | continue; |
649 | ||
f6c383b8 | 650 | nft_set_elem_dead(&rbe_end->ext); |
8d8540c4 | 651 | |
f6c383b8 PNA |
652 | gc = nft_trans_gc_queue_async(gc, gc_seq, GFP_ATOMIC); |
653 | if (!gc) | |
654 | goto try_later; | |
8d8540c4 | 655 | |
f6c383b8 PNA |
656 | nft_trans_gc_elem_add(gc, rbe_end); |
657 | rbe_end = NULL; | |
658 | dead_elem: | |
659 | gc = nft_trans_gc_queue_async(gc, gc_seq, GFP_ATOMIC); | |
660 | if (!gc) | |
661 | goto try_later; | |
662 | ||
663 | nft_trans_gc_elem_add(gc, rbe); | |
8d8540c4 | 664 | } |
f6c383b8 PNA |
665 | |
666 | gc = nft_trans_gc_catchall(gc, gc_seq); | |
667 | ||
668 | try_later: | |
8d8540c4 PNA |
669 | write_seqcount_end(&priv->count); |
670 | write_unlock_bh(&priv->lock); | |
671 | ||
f6c383b8 PNA |
672 | if (gc) |
673 | nft_trans_gc_queue_async_done(gc); | |
674 | done: | |
8d8540c4 PNA |
675 | queue_delayed_work(system_power_efficient_wq, &priv->gc_work, |
676 | nft_set_gc_interval(set)); | |
677 | } | |
678 | ||
4ef360dd TY |
679 | static u64 nft_rbtree_privsize(const struct nlattr * const nla[], |
680 | const struct nft_set_desc *desc) | |
20a69341 PM |
681 | { |
682 | return sizeof(struct nft_rbtree); | |
683 | } | |
684 | ||
685 | static int nft_rbtree_init(const struct nft_set *set, | |
c50b960c | 686 | const struct nft_set_desc *desc, |
20a69341 PM |
687 | const struct nlattr * const nla[]) |
688 | { | |
689 | struct nft_rbtree *priv = nft_set_priv(set); | |
690 | ||
03e5fd0e | 691 | rwlock_init(&priv->lock); |
b901892b | 692 | seqcount_rwlock_init(&priv->count, &priv->lock); |
20a69341 | 693 | priv->root = RB_ROOT; |
8d8540c4 PNA |
694 | |
695 | INIT_DEFERRABLE_WORK(&priv->gc_work, nft_rbtree_gc); | |
696 | if (set->flags & NFT_SET_TIMEOUT) | |
697 | queue_delayed_work(system_power_efficient_wq, &priv->gc_work, | |
698 | nft_set_gc_interval(set)); | |
699 | ||
20a69341 PM |
700 | return 0; |
701 | } | |
702 | ||
628bd3e4 PNA |
703 | static void nft_rbtree_destroy(const struct nft_ctx *ctx, |
704 | const struct nft_set *set) | |
20a69341 PM |
705 | { |
706 | struct nft_rbtree *priv = nft_set_priv(set); | |
707 | struct nft_rbtree_elem *rbe; | |
708 | struct rb_node *node; | |
709 | ||
8d8540c4 | 710 | cancel_delayed_work_sync(&priv->gc_work); |
c293ac95 | 711 | rcu_barrier(); |
20a69341 PM |
712 | while ((node = priv->root.rb_node) != NULL) { |
713 | rb_erase(node, &priv->root); | |
714 | rbe = rb_entry(node, struct nft_rbtree_elem, node); | |
628bd3e4 | 715 | nf_tables_set_elem_destroy(ctx, set, rbe); |
20a69341 PM |
716 | } |
717 | } | |
718 | ||
c50b960c PM |
719 | static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features, |
720 | struct nft_set_estimate *est) | |
721 | { | |
f3a2181e SB |
722 | if (desc->field_count > 1) |
723 | return false; | |
724 | ||
c50b960c | 725 | if (desc->size) |
080ed636 PNA |
726 | est->size = sizeof(struct nft_rbtree) + |
727 | desc->size * sizeof(struct nft_rbtree_elem); | |
c50b960c | 728 | else |
080ed636 | 729 | est->size = ~0; |
c50b960c | 730 | |
55af753c | 731 | est->lookup = NFT_SET_CLASS_O_LOG_N; |
0b5a7874 | 732 | est->space = NFT_SET_CLASS_O_N; |
c50b960c PM |
733 | |
734 | return true; | |
735 | } | |
736 | ||
24d19826 | 737 | const struct nft_set_type nft_set_rbtree_type = { |
8d8540c4 | 738 | .features = NFT_SET_INTERVAL | NFT_SET_MAP | NFT_SET_OBJECT | NFT_SET_TIMEOUT, |
71cc0873 PS |
739 | .ops = { |
740 | .privsize = nft_rbtree_privsize, | |
741 | .elemsize = offsetof(struct nft_rbtree_elem, ext), | |
742 | .estimate = nft_rbtree_estimate, | |
743 | .init = nft_rbtree_init, | |
744 | .destroy = nft_rbtree_destroy, | |
745 | .insert = nft_rbtree_insert, | |
746 | .remove = nft_rbtree_remove, | |
747 | .deactivate = nft_rbtree_deactivate, | |
748 | .flush = nft_rbtree_flush, | |
749 | .activate = nft_rbtree_activate, | |
750 | .lookup = nft_rbtree_lookup, | |
751 | .walk = nft_rbtree_walk, | |
752 | .get = nft_rbtree_get, | |
753 | }, | |
20a69341 | 754 | }; |