]>
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 FW |
20 | rwlock_t lock; |
21 | seqcount_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 | ||
e701001e PNA |
41 | static bool nft_rbtree_equal(const struct nft_set *set, const void *this, |
42 | const struct nft_rbtree_elem *interval) | |
43 | { | |
44 | return memcmp(this, nft_set_ext_key(&interval->ext), set->klen) == 0; | |
45 | } | |
46 | ||
9b7e26ae FW |
47 | static bool __nft_rbtree_lookup(const struct net *net, const struct nft_set *set, |
48 | const u32 *key, const struct nft_set_ext **ext, | |
49 | unsigned int seq) | |
20a69341 | 50 | { |
03e5fd0e | 51 | struct nft_rbtree *priv = nft_set_priv(set); |
20a69341 | 52 | const struct nft_rbtree_elem *rbe, *interval = NULL; |
42a55769 | 53 | u8 genmask = nft_genmask_cur(net); |
16c45eda | 54 | const struct rb_node *parent; |
e701001e | 55 | const void *this; |
20a69341 PM |
56 | int d; |
57 | ||
9b7e26ae | 58 | parent = rcu_dereference_raw(priv->root.rb_node); |
20a69341 | 59 | while (parent != NULL) { |
9b7e26ae FW |
60 | if (read_seqcount_retry(&priv->count, seq)) |
61 | return false; | |
62 | ||
20a69341 PM |
63 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); |
64 | ||
e701001e PNA |
65 | this = nft_set_ext_key(&rbe->ext); |
66 | d = memcmp(this, key, set->klen); | |
20a69341 | 67 | if (d < 0) { |
9b7e26ae | 68 | parent = rcu_dereference_raw(parent->rb_left); |
f9121355 PNA |
69 | if (interval && |
70 | nft_rbtree_equal(set, this, interval) && | |
82e20b44 | 71 | nft_rbtree_interval_end(rbe) && |
6f7c9caf | 72 | nft_rbtree_interval_start(interval)) |
e701001e | 73 | continue; |
20a69341 PM |
74 | interval = rbe; |
75 | } else if (d > 0) | |
9b7e26ae | 76 | parent = rcu_dereference_raw(parent->rb_right); |
20a69341 | 77 | else { |
cc02e457 | 78 | if (!nft_set_elem_active(&rbe->ext, genmask)) { |
9b7e26ae | 79 | parent = rcu_dereference_raw(parent->rb_left); |
cc02e457 PM |
80 | continue; |
81 | } | |
340eaff6 PS |
82 | |
83 | if (nft_set_elem_expired(&rbe->ext)) | |
84 | return false; | |
85 | ||
db3b665d PNA |
86 | if (nft_rbtree_interval_end(rbe)) { |
87 | if (nft_set_is_anonymous(set)) | |
88 | return false; | |
89 | parent = rcu_dereference_raw(parent->rb_left); | |
90 | interval = NULL; | |
91 | continue; | |
92 | } | |
b2832dd6 PM |
93 | |
94 | *ext = &rbe->ext; | |
20a69341 PM |
95 | return true; |
96 | } | |
97 | } | |
98 | ||
c1eda3c6 PNA |
99 | if (set->flags & NFT_SET_INTERVAL && interval != NULL && |
100 | nft_set_elem_active(&interval->ext, genmask) && | |
340eaff6 | 101 | !nft_set_elem_expired(&interval->ext) && |
6f7c9caf | 102 | nft_rbtree_interval_start(interval)) { |
c1eda3c6 PNA |
103 | *ext = &interval->ext; |
104 | return true; | |
20a69341 | 105 | } |
db3b665d | 106 | |
20a69341 PM |
107 | return false; |
108 | } | |
109 | ||
9b7e26ae FW |
110 | static bool nft_rbtree_lookup(const struct net *net, const struct nft_set *set, |
111 | const u32 *key, const struct nft_set_ext **ext) | |
112 | { | |
113 | struct nft_rbtree *priv = nft_set_priv(set); | |
114 | unsigned int seq = read_seqcount_begin(&priv->count); | |
115 | bool ret; | |
116 | ||
117 | ret = __nft_rbtree_lookup(net, set, key, ext, seq); | |
118 | if (ret || !read_seqcount_retry(&priv->count, seq)) | |
119 | return ret; | |
120 | ||
121 | read_lock_bh(&priv->lock); | |
122 | seq = read_seqcount_begin(&priv->count); | |
123 | ret = __nft_rbtree_lookup(net, set, key, ext, seq); | |
124 | read_unlock_bh(&priv->lock); | |
125 | ||
126 | return ret; | |
127 | } | |
128 | ||
ba0e4d99 PNA |
129 | static bool __nft_rbtree_get(const struct net *net, const struct nft_set *set, |
130 | const u32 *key, struct nft_rbtree_elem **elem, | |
131 | unsigned int seq, unsigned int flags, u8 genmask) | |
132 | { | |
133 | struct nft_rbtree_elem *rbe, *interval = NULL; | |
134 | struct nft_rbtree *priv = nft_set_priv(set); | |
135 | const struct rb_node *parent; | |
136 | const void *this; | |
137 | int d; | |
138 | ||
139 | parent = rcu_dereference_raw(priv->root.rb_node); | |
140 | while (parent != NULL) { | |
141 | if (read_seqcount_retry(&priv->count, seq)) | |
142 | return false; | |
143 | ||
144 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
145 | ||
146 | this = nft_set_ext_key(&rbe->ext); | |
147 | d = memcmp(this, key, set->klen); | |
148 | if (d < 0) { | |
149 | parent = rcu_dereference_raw(parent->rb_left); | |
3b18d5eb PNA |
150 | if (!(flags & NFT_SET_ELEM_INTERVAL_END)) |
151 | interval = rbe; | |
ba0e4d99 PNA |
152 | } else if (d > 0) { |
153 | parent = rcu_dereference_raw(parent->rb_right); | |
3b18d5eb PNA |
154 | if (flags & NFT_SET_ELEM_INTERVAL_END) |
155 | interval = rbe; | |
ba0e4d99 | 156 | } else { |
db3b665d | 157 | if (!nft_set_elem_active(&rbe->ext, genmask)) { |
ba0e4d99 | 158 | parent = rcu_dereference_raw(parent->rb_left); |
db3b665d PNA |
159 | continue; |
160 | } | |
ba0e4d99 | 161 | |
340eaff6 PS |
162 | if (nft_set_elem_expired(&rbe->ext)) |
163 | return false; | |
164 | ||
ba0e4d99 PNA |
165 | if (!nft_set_ext_exists(&rbe->ext, NFT_SET_EXT_FLAGS) || |
166 | (*nft_set_ext_flags(&rbe->ext) & NFT_SET_ELEM_INTERVAL_END) == | |
167 | (flags & NFT_SET_ELEM_INTERVAL_END)) { | |
168 | *elem = rbe; | |
169 | return true; | |
170 | } | |
db3b665d PNA |
171 | |
172 | if (nft_rbtree_interval_end(rbe)) | |
173 | interval = NULL; | |
174 | ||
175 | parent = rcu_dereference_raw(parent->rb_left); | |
ba0e4d99 PNA |
176 | } |
177 | } | |
178 | ||
179 | if (set->flags & NFT_SET_INTERVAL && interval != NULL && | |
180 | nft_set_elem_active(&interval->ext, genmask) && | |
340eaff6 | 181 | !nft_set_elem_expired(&interval->ext) && |
3b18d5eb PNA |
182 | ((!nft_rbtree_interval_end(interval) && |
183 | !(flags & NFT_SET_ELEM_INTERVAL_END)) || | |
184 | (nft_rbtree_interval_end(interval) && | |
185 | (flags & NFT_SET_ELEM_INTERVAL_END)))) { | |
ba0e4d99 PNA |
186 | *elem = interval; |
187 | return true; | |
188 | } | |
189 | ||
190 | return false; | |
191 | } | |
192 | ||
193 | static void *nft_rbtree_get(const struct net *net, const struct nft_set *set, | |
194 | const struct nft_set_elem *elem, unsigned int flags) | |
195 | { | |
196 | struct nft_rbtree *priv = nft_set_priv(set); | |
197 | unsigned int seq = read_seqcount_begin(&priv->count); | |
198 | struct nft_rbtree_elem *rbe = ERR_PTR(-ENOENT); | |
199 | const u32 *key = (const u32 *)&elem->key.val; | |
200 | u8 genmask = nft_genmask_cur(net); | |
201 | bool ret; | |
202 | ||
203 | ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask); | |
204 | if (ret || !read_seqcount_retry(&priv->count, seq)) | |
205 | return rbe; | |
206 | ||
207 | read_lock_bh(&priv->lock); | |
208 | seq = read_seqcount_begin(&priv->count); | |
209 | ret = __nft_rbtree_get(net, set, key, &rbe, seq, flags, genmask); | |
210 | if (!ret) | |
211 | rbe = ERR_PTR(-ENOENT); | |
212 | read_unlock_bh(&priv->lock); | |
213 | ||
214 | return rbe; | |
215 | } | |
216 | ||
42a55769 | 217 | static int __nft_rbtree_insert(const struct net *net, const struct nft_set *set, |
c016c7e4 PNA |
218 | struct nft_rbtree_elem *new, |
219 | struct nft_set_ext **ext) | |
20a69341 PM |
220 | { |
221 | struct nft_rbtree *priv = nft_set_priv(set); | |
42a55769 | 222 | u8 genmask = nft_genmask_next(net); |
20a69341 PM |
223 | struct nft_rbtree_elem *rbe; |
224 | struct rb_node *parent, **p; | |
7c84d414 | 225 | bool overlap = false; |
20a69341 PM |
226 | int d; |
227 | ||
7c84d414 SB |
228 | /* Detect overlaps as we descend the tree. Set the flag in these cases: |
229 | * | |
72239f27 SB |
230 | * a1. _ _ __>| ?_ _ __| (insert end before existing end) |
231 | * a2. _ _ ___| ?_ _ _>| (insert end after existing end) | |
232 | * a3. _ _ ___? >|_ _ __| (insert start before existing end) | |
7c84d414 SB |
233 | * |
234 | * and clear it later on, as we eventually reach the points indicated by | |
235 | * '?' above, in the cases described below. We'll always meet these | |
236 | * later, locally, due to tree ordering, and overlaps for the intervals | |
237 | * that are the closest together are always evaluated last. | |
238 | * | |
72239f27 SB |
239 | * b1. _ _ __>| !_ _ __| (insert end before existing start) |
240 | * b2. _ _ ___| !_ _ _>| (insert end after existing start) | |
241 | * b3. _ _ ___! >|_ _ __| (insert start after existing end) | |
7c84d414 | 242 | * |
72239f27 | 243 | * Case a3. resolves to b3.: |
7c84d414 SB |
244 | * - if the inserted start element is the leftmost, because the '0' |
245 | * element in the tree serves as end element | |
246 | * - otherwise, if an existing end is found. Note that end elements are | |
247 | * always inserted after corresponding start elements. | |
248 | * | |
72239f27 | 249 | * For a new, rightmost pair of elements, we'll hit cases b3. and b2., |
7c84d414 SB |
250 | * in that order. |
251 | * | |
252 | * The flag is also cleared in two special cases: | |
253 | * | |
254 | * b4. |__ _ _!|<_ _ _ (insert start right before existing end) | |
255 | * b5. |__ _ >|!__ _ _ (insert end right after existing start) | |
256 | * | |
257 | * which always happen as last step and imply that no further | |
258 | * overlapping is possible. | |
259 | */ | |
260 | ||
20a69341 PM |
261 | parent = NULL; |
262 | p = &priv->root.rb_node; | |
263 | while (*p != NULL) { | |
264 | parent = *p; | |
265 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
e562d860 PM |
266 | d = memcmp(nft_set_ext_key(&rbe->ext), |
267 | nft_set_ext_key(&new->ext), | |
268 | set->klen); | |
7c84d414 | 269 | if (d < 0) { |
20a69341 | 270 | p = &parent->rb_left; |
7c84d414 SB |
271 | |
272 | if (nft_rbtree_interval_start(new)) { | |
72239f27 SB |
273 | if (nft_rbtree_interval_end(rbe) && |
274 | nft_set_elem_active(&rbe->ext, genmask)) | |
275 | overlap = false; | |
7c84d414 SB |
276 | } else { |
277 | overlap = nft_rbtree_interval_end(rbe) && | |
278 | nft_set_elem_active(&rbe->ext, | |
279 | genmask); | |
280 | } | |
281 | } else if (d > 0) { | |
20a69341 | 282 | p = &parent->rb_right; |
7c84d414 SB |
283 | |
284 | if (nft_rbtree_interval_end(new)) { | |
285 | overlap = nft_rbtree_interval_end(rbe) && | |
286 | nft_set_elem_active(&rbe->ext, | |
287 | genmask); | |
288 | } else if (nft_rbtree_interval_end(rbe) && | |
289 | nft_set_elem_active(&rbe->ext, genmask)) { | |
290 | overlap = true; | |
291 | } | |
292 | } else { | |
d2df92e9 | 293 | if (nft_rbtree_interval_end(rbe) && |
6f7c9caf | 294 | nft_rbtree_interval_start(new)) { |
d2df92e9 | 295 | p = &parent->rb_left; |
7c84d414 SB |
296 | |
297 | if (nft_set_elem_active(&rbe->ext, genmask)) | |
298 | overlap = false; | |
6f7c9caf | 299 | } else if (nft_rbtree_interval_start(rbe) && |
d2df92e9 PNA |
300 | nft_rbtree_interval_end(new)) { |
301 | p = &parent->rb_right; | |
7c84d414 SB |
302 | |
303 | if (nft_set_elem_active(&rbe->ext, genmask)) | |
304 | overlap = false; | |
d2df92e9 PNA |
305 | } else if (nft_set_elem_active(&rbe->ext, genmask)) { |
306 | *ext = &rbe->ext; | |
307 | return -EEXIST; | |
308 | } else { | |
309 | p = &parent->rb_left; | |
e701001e | 310 | } |
cc02e457 | 311 | } |
20a69341 | 312 | } |
7c84d414 SB |
313 | |
314 | if (overlap) | |
315 | return -ENOTEMPTY; | |
316 | ||
9b7e26ae | 317 | rb_link_node_rcu(&new->node, parent, p); |
20a69341 PM |
318 | rb_insert_color(&new->node, &priv->root); |
319 | return 0; | |
320 | } | |
321 | ||
42a55769 | 322 | static int nft_rbtree_insert(const struct net *net, const struct nft_set *set, |
c016c7e4 PNA |
323 | const struct nft_set_elem *elem, |
324 | struct nft_set_ext **ext) | |
20a69341 | 325 | { |
03e5fd0e | 326 | struct nft_rbtree *priv = nft_set_priv(set); |
fe2811eb | 327 | struct nft_rbtree_elem *rbe = elem->priv; |
20a69341 PM |
328 | int err; |
329 | ||
03e5fd0e | 330 | write_lock_bh(&priv->lock); |
9b7e26ae | 331 | write_seqcount_begin(&priv->count); |
c016c7e4 | 332 | err = __nft_rbtree_insert(net, set, rbe, ext); |
9b7e26ae | 333 | write_seqcount_end(&priv->count); |
03e5fd0e | 334 | write_unlock_bh(&priv->lock); |
fe2811eb | 335 | |
20a69341 PM |
336 | return err; |
337 | } | |
338 | ||
5cb82a38 PNA |
339 | static void nft_rbtree_remove(const struct net *net, |
340 | const struct nft_set *set, | |
20a69341 PM |
341 | const struct nft_set_elem *elem) |
342 | { | |
343 | struct nft_rbtree *priv = nft_set_priv(set); | |
cc02e457 | 344 | struct nft_rbtree_elem *rbe = elem->priv; |
20a69341 | 345 | |
03e5fd0e | 346 | write_lock_bh(&priv->lock); |
9b7e26ae | 347 | write_seqcount_begin(&priv->count); |
20a69341 | 348 | rb_erase(&rbe->node, &priv->root); |
9b7e26ae | 349 | write_seqcount_end(&priv->count); |
03e5fd0e | 350 | write_unlock_bh(&priv->lock); |
20a69341 PM |
351 | } |
352 | ||
42a55769 PNA |
353 | static void nft_rbtree_activate(const struct net *net, |
354 | const struct nft_set *set, | |
cc02e457 PM |
355 | const struct nft_set_elem *elem) |
356 | { | |
357 | struct nft_rbtree_elem *rbe = elem->priv; | |
358 | ||
42a55769 | 359 | nft_set_elem_change_active(net, set, &rbe->ext); |
8d8540c4 | 360 | nft_set_elem_clear_busy(&rbe->ext); |
cc02e457 PM |
361 | } |
362 | ||
1ba1c414 PNA |
363 | static bool nft_rbtree_flush(const struct net *net, |
364 | const struct nft_set *set, void *priv) | |
37df5301 PNA |
365 | { |
366 | struct nft_rbtree_elem *rbe = priv; | |
367 | ||
8d8540c4 PNA |
368 | if (!nft_set_elem_mark_busy(&rbe->ext) || |
369 | !nft_is_active(net, &rbe->ext)) { | |
370 | nft_set_elem_change_active(net, set, &rbe->ext); | |
371 | return true; | |
372 | } | |
373 | return false; | |
37df5301 PNA |
374 | } |
375 | ||
42a55769 PNA |
376 | static void *nft_rbtree_deactivate(const struct net *net, |
377 | const struct nft_set *set, | |
cc02e457 | 378 | const struct nft_set_elem *elem) |
20a69341 PM |
379 | { |
380 | const struct nft_rbtree *priv = nft_set_priv(set); | |
381 | const struct rb_node *parent = priv->root.rb_node; | |
e701001e | 382 | struct nft_rbtree_elem *rbe, *this = elem->priv; |
42a55769 | 383 | u8 genmask = nft_genmask_next(net); |
20a69341 PM |
384 | int d; |
385 | ||
386 | while (parent != NULL) { | |
387 | rbe = rb_entry(parent, struct nft_rbtree_elem, node); | |
388 | ||
7d740264 PM |
389 | d = memcmp(nft_set_ext_key(&rbe->ext), &elem->key.val, |
390 | set->klen); | |
20a69341 PM |
391 | if (d < 0) |
392 | parent = parent->rb_left; | |
393 | else if (d > 0) | |
394 | parent = parent->rb_right; | |
395 | else { | |
e701001e | 396 | if (nft_rbtree_interval_end(rbe) && |
6f7c9caf | 397 | nft_rbtree_interval_start(this)) { |
e701001e PNA |
398 | parent = parent->rb_left; |
399 | continue; | |
6f7c9caf | 400 | } else if (nft_rbtree_interval_start(rbe) && |
e701001e PNA |
401 | nft_rbtree_interval_end(this)) { |
402 | parent = parent->rb_right; | |
403 | continue; | |
05b7639d PNA |
404 | } else if (!nft_set_elem_active(&rbe->ext, genmask)) { |
405 | parent = parent->rb_left; | |
406 | continue; | |
e701001e | 407 | } |
1ba1c414 | 408 | nft_rbtree_flush(net, set, rbe); |
cc02e457 | 409 | return rbe; |
20a69341 PM |
410 | } |
411 | } | |
cc02e457 | 412 | return NULL; |
20a69341 PM |
413 | } |
414 | ||
415 | static void nft_rbtree_walk(const struct nft_ctx *ctx, | |
de70185d | 416 | struct nft_set *set, |
20a69341 PM |
417 | struct nft_set_iter *iter) |
418 | { | |
03e5fd0e | 419 | struct nft_rbtree *priv = nft_set_priv(set); |
fe2811eb | 420 | struct nft_rbtree_elem *rbe; |
20a69341 PM |
421 | struct nft_set_elem elem; |
422 | struct rb_node *node; | |
423 | ||
03e5fd0e | 424 | read_lock_bh(&priv->lock); |
20a69341 | 425 | for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { |
cc02e457 PM |
426 | rbe = rb_entry(node, struct nft_rbtree_elem, node); |
427 | ||
20a69341 PM |
428 | if (iter->count < iter->skip) |
429 | goto cont; | |
340eaff6 PS |
430 | if (nft_set_elem_expired(&rbe->ext)) |
431 | goto cont; | |
8588ac09 | 432 | if (!nft_set_elem_active(&rbe->ext, iter->genmask)) |
cc02e457 | 433 | goto cont; |
20a69341 | 434 | |
fe2811eb | 435 | elem.priv = rbe; |
20a69341 PM |
436 | |
437 | iter->err = iter->fn(ctx, set, iter, &elem); | |
7632667d | 438 | if (iter->err < 0) { |
03e5fd0e | 439 | read_unlock_bh(&priv->lock); |
20a69341 | 440 | return; |
7632667d | 441 | } |
20a69341 PM |
442 | cont: |
443 | iter->count++; | |
444 | } | |
03e5fd0e | 445 | read_unlock_bh(&priv->lock); |
20a69341 PM |
446 | } |
447 | ||
8d8540c4 PNA |
448 | static void nft_rbtree_gc(struct work_struct *work) |
449 | { | |
a13f814a | 450 | struct nft_rbtree_elem *rbe, *rbe_end = NULL, *rbe_prev = NULL; |
8d8540c4 | 451 | struct nft_set_gc_batch *gcb = NULL; |
8d8540c4 | 452 | struct nft_rbtree *priv; |
a13f814a | 453 | struct rb_node *node; |
8d8540c4 | 454 | struct nft_set *set; |
8d8540c4 PNA |
455 | |
456 | priv = container_of(work, struct nft_rbtree, gc_work.work); | |
457 | set = nft_set_container_of(priv); | |
458 | ||
459 | write_lock_bh(&priv->lock); | |
460 | write_seqcount_begin(&priv->count); | |
461 | for (node = rb_first(&priv->root); node != NULL; node = rb_next(node)) { | |
462 | rbe = rb_entry(node, struct nft_rbtree_elem, node); | |
463 | ||
464 | if (nft_rbtree_interval_end(rbe)) { | |
a13f814a | 465 | rbe_end = rbe; |
8d8540c4 PNA |
466 | continue; |
467 | } | |
468 | if (!nft_set_elem_expired(&rbe->ext)) | |
469 | continue; | |
470 | if (nft_set_elem_mark_busy(&rbe->ext)) | |
471 | continue; | |
472 | ||
a13f814a TY |
473 | if (rbe_prev) { |
474 | rb_erase(&rbe_prev->node, &priv->root); | |
475 | rbe_prev = NULL; | |
476 | } | |
8d8540c4 PNA |
477 | gcb = nft_set_gc_batch_check(set, gcb, GFP_ATOMIC); |
478 | if (!gcb) | |
c293ac95 | 479 | break; |
8d8540c4 PNA |
480 | |
481 | atomic_dec(&set->nelems); | |
482 | nft_set_gc_batch_add(gcb, rbe); | |
a13f814a | 483 | rbe_prev = rbe; |
8d8540c4 | 484 | |
a13f814a | 485 | if (rbe_end) { |
8d8540c4 | 486 | atomic_dec(&set->nelems); |
a13f814a TY |
487 | nft_set_gc_batch_add(gcb, rbe_end); |
488 | rb_erase(&rbe_end->node, &priv->root); | |
489 | rbe_end = NULL; | |
8d8540c4 PNA |
490 | } |
491 | node = rb_next(node); | |
c293ac95 TY |
492 | if (!node) |
493 | break; | |
8d8540c4 | 494 | } |
a13f814a TY |
495 | if (rbe_prev) |
496 | rb_erase(&rbe_prev->node, &priv->root); | |
8d8540c4 PNA |
497 | write_seqcount_end(&priv->count); |
498 | write_unlock_bh(&priv->lock); | |
499 | ||
500 | nft_set_gc_batch_complete(gcb); | |
501 | ||
502 | queue_delayed_work(system_power_efficient_wq, &priv->gc_work, | |
503 | nft_set_gc_interval(set)); | |
504 | } | |
505 | ||
4ef360dd TY |
506 | static u64 nft_rbtree_privsize(const struct nlattr * const nla[], |
507 | const struct nft_set_desc *desc) | |
20a69341 PM |
508 | { |
509 | return sizeof(struct nft_rbtree); | |
510 | } | |
511 | ||
512 | static int nft_rbtree_init(const struct nft_set *set, | |
c50b960c | 513 | const struct nft_set_desc *desc, |
20a69341 PM |
514 | const struct nlattr * const nla[]) |
515 | { | |
516 | struct nft_rbtree *priv = nft_set_priv(set); | |
517 | ||
03e5fd0e | 518 | rwlock_init(&priv->lock); |
9b7e26ae | 519 | seqcount_init(&priv->count); |
20a69341 | 520 | priv->root = RB_ROOT; |
8d8540c4 PNA |
521 | |
522 | INIT_DEFERRABLE_WORK(&priv->gc_work, nft_rbtree_gc); | |
523 | if (set->flags & NFT_SET_TIMEOUT) | |
524 | queue_delayed_work(system_power_efficient_wq, &priv->gc_work, | |
525 | nft_set_gc_interval(set)); | |
526 | ||
20a69341 PM |
527 | return 0; |
528 | } | |
529 | ||
530 | static void nft_rbtree_destroy(const struct nft_set *set) | |
531 | { | |
532 | struct nft_rbtree *priv = nft_set_priv(set); | |
533 | struct nft_rbtree_elem *rbe; | |
534 | struct rb_node *node; | |
535 | ||
8d8540c4 | 536 | cancel_delayed_work_sync(&priv->gc_work); |
c293ac95 | 537 | rcu_barrier(); |
20a69341 PM |
538 | while ((node = priv->root.rb_node) != NULL) { |
539 | rb_erase(node, &priv->root); | |
540 | rbe = rb_entry(node, struct nft_rbtree_elem, node); | |
61f9e292 | 541 | nft_set_elem_destroy(set, rbe, true); |
20a69341 PM |
542 | } |
543 | } | |
544 | ||
c50b960c PM |
545 | static bool nft_rbtree_estimate(const struct nft_set_desc *desc, u32 features, |
546 | struct nft_set_estimate *est) | |
547 | { | |
f3a2181e SB |
548 | if (desc->field_count > 1) |
549 | return false; | |
550 | ||
c50b960c | 551 | if (desc->size) |
080ed636 PNA |
552 | est->size = sizeof(struct nft_rbtree) + |
553 | desc->size * sizeof(struct nft_rbtree_elem); | |
c50b960c | 554 | else |
080ed636 | 555 | est->size = ~0; |
c50b960c | 556 | |
55af753c | 557 | est->lookup = NFT_SET_CLASS_O_LOG_N; |
0b5a7874 | 558 | est->space = NFT_SET_CLASS_O_N; |
c50b960c PM |
559 | |
560 | return true; | |
561 | } | |
562 | ||
24d19826 | 563 | const struct nft_set_type nft_set_rbtree_type = { |
8d8540c4 | 564 | .features = NFT_SET_INTERVAL | NFT_SET_MAP | NFT_SET_OBJECT | NFT_SET_TIMEOUT, |
71cc0873 PS |
565 | .ops = { |
566 | .privsize = nft_rbtree_privsize, | |
567 | .elemsize = offsetof(struct nft_rbtree_elem, ext), | |
568 | .estimate = nft_rbtree_estimate, | |
569 | .init = nft_rbtree_init, | |
570 | .destroy = nft_rbtree_destroy, | |
571 | .insert = nft_rbtree_insert, | |
572 | .remove = nft_rbtree_remove, | |
573 | .deactivate = nft_rbtree_deactivate, | |
574 | .flush = nft_rbtree_flush, | |
575 | .activate = nft_rbtree_activate, | |
576 | .lookup = nft_rbtree_lookup, | |
577 | .walk = nft_rbtree_walk, | |
578 | .get = nft_rbtree_get, | |
579 | }, | |
20a69341 | 580 | }; |