IB/hfi1: Fix TID caching actions
[deliverable/linux.git] / net / netfilter / ipset / ip_set_list_set.c
CommitLineData
7d47d972 1/* Copyright (C) 2008-2013 Jozsef Kadlecsik <kadlec@blackhole.kfki.hu>
f830837f
JK
2 *
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License version 2 as
5 * published by the Free Software Foundation.
6 */
7
8/* Kernel module implementing an IP set type: the list:set type */
9
10#include <linux/module.h>
11#include <linux/ip.h>
00590fdd 12#include <linux/rculist.h>
f830837f
JK
13#include <linux/skbuff.h>
14#include <linux/errno.h>
15
16#include <linux/netfilter/ipset/ip_set.h>
f830837f
JK
17#include <linux/netfilter/ipset/ip_set_list.h>
18
35b8dcf8 19#define IPSET_TYPE_REV_MIN 0
81b10bb4 20/* 1 Counters support added */
cbee93d7
AD
21/* 2 Comments support added */
22#define IPSET_TYPE_REV_MAX 3 /* skbinfo support added */
10111a6e 23
f830837f
JK
24MODULE_LICENSE("GPL");
25MODULE_AUTHOR("Jozsef Kadlecsik <kadlec@blackhole.kfki.hu>");
35b8dcf8 26IP_SET_MODULE_DESC("list:set", IPSET_TYPE_REV_MIN, IPSET_TYPE_REV_MAX);
f830837f
JK
27MODULE_ALIAS("ip_set_list:set");
28
7d47d972 29/* Member elements */
f830837f 30struct set_elem {
00590fdd
JK
31 struct rcu_head rcu;
32 struct list_head list;
45040978 33 struct ip_set *set; /* Sigh, in order to cleanup reference */
f830837f 34 ip_set_id_t id;
95ad1f4a 35} __aligned(__alignof__(u64));
f830837f 36
7d47d972
JK
37struct set_adt_elem {
38 ip_set_id_t id;
39 ip_set_id_t refid;
40 int before;
41};
42
f830837f
JK
43/* Type structure */
44struct list_set {
f830837f 45 u32 size; /* size of set list array */
f830837f 46 struct timer_list gc; /* garbage collection */
1785e8f4 47 struct net *net; /* namespace */
00590fdd 48 struct list_head members; /* the set members */
f830837f
JK
49};
50
7d47d972
JK
51static int
52list_set_ktest(struct ip_set *set, const struct sk_buff *skb,
53 const struct xt_action_param *par,
54 struct ip_set_adt_opt *opt, const struct ip_set_ext *ext)
f830837f 55{
7d47d972
JK
56 struct list_set *map = set->data;
57 struct set_elem *e;
00590fdd 58 u32 cmdflags = opt->cmdflags;
7d47d972 59 int ret;
f830837f 60
6e01781d
JK
61 /* Don't lookup sub-counters at all */
62 opt->cmdflags &= ~IPSET_FLAG_MATCH_COUNTERS;
63 if (opt->cmdflags & IPSET_FLAG_SKIP_SUBCOUNTER_UPDATE)
64 opt->cmdflags &= ~IPSET_FLAG_SKIP_COUNTER_UPDATE;
00590fdd 65 list_for_each_entry_rcu(e, &map->members, list) {
7d47d972 66 if (SET_WITH_TIMEOUT(set) &&
ca134ce8 67 ip_set_timeout_expired(ext_timeout(e, set)))
7d47d972
JK
68 continue;
69 ret = ip_set_test(e->id, skb, par, opt);
de76303c
JK
70 if (ret > 0) {
71 if (SET_WITH_COUNTER(set))
ca134ce8 72 ip_set_update_counter(ext_counter(e, set),
de76303c 73 ext, &opt->ext,
6e01781d 74 cmdflags);
cbee93d7
AD
75 if (SET_WITH_SKBINFO(set))
76 ip_set_get_skbinfo(ext_skbinfo(e, set),
77 ext, &opt->ext,
78 cmdflags);
7d47d972 79 return ret;
de76303c 80 }
7d47d972
JK
81 }
82 return 0;
f830837f
JK
83}
84
7d47d972
JK
85static int
86list_set_kadd(struct ip_set *set, const struct sk_buff *skb,
87 const struct xt_action_param *par,
88 struct ip_set_adt_opt *opt, const struct ip_set_ext *ext)
f830837f 89{
7d47d972
JK
90 struct list_set *map = set->data;
91 struct set_elem *e;
7d47d972 92 int ret;
f830837f 93
00590fdd 94 list_for_each_entry(e, &map->members, list) {
7d47d972 95 if (SET_WITH_TIMEOUT(set) &&
ca134ce8 96 ip_set_timeout_expired(ext_timeout(e, set)))
7d47d972
JK
97 continue;
98 ret = ip_set_add(e->id, skb, par, opt);
99 if (ret == 0)
100 return ret;
101 }
102 return 0;
f830837f
JK
103}
104
f830837f 105static int
7d47d972 106list_set_kdel(struct ip_set *set, const struct sk_buff *skb,
b66554cf 107 const struct xt_action_param *par,
7d47d972 108 struct ip_set_adt_opt *opt, const struct ip_set_ext *ext)
f830837f
JK
109{
110 struct list_set *map = set->data;
7d47d972 111 struct set_elem *e;
f830837f
JK
112 int ret;
113
00590fdd 114 list_for_each_entry(e, &map->members, list) {
7d47d972 115 if (SET_WITH_TIMEOUT(set) &&
ca134ce8 116 ip_set_timeout_expired(ext_timeout(e, set)))
f830837f 117 continue;
7d47d972
JK
118 ret = ip_set_del(e->id, skb, par, opt);
119 if (ret == 0)
120 return ret;
121 }
122 return 0;
123}
124
125static int
126list_set_kadt(struct ip_set *set, const struct sk_buff *skb,
127 const struct xt_action_param *par,
128 enum ipset_adt adt, struct ip_set_adt_opt *opt)
129{
ca134ce8 130 struct ip_set_ext ext = IP_SET_INIT_KEXT(skb, opt, set);
00590fdd 131 int ret = -EINVAL;
7d47d972 132
00590fdd 133 rcu_read_lock();
7d47d972
JK
134 switch (adt) {
135 case IPSET_TEST:
00590fdd
JK
136 ret = list_set_ktest(set, skb, par, opt, &ext);
137 break;
7d47d972 138 case IPSET_ADD:
00590fdd
JK
139 ret = list_set_kadd(set, skb, par, opt, &ext);
140 break;
7d47d972 141 case IPSET_DEL:
00590fdd
JK
142 ret = list_set_kdel(set, skb, par, opt, &ext);
143 break;
7d47d972
JK
144 default:
145 break;
f830837f 146 }
00590fdd 147 rcu_read_unlock();
f830837f 148
00590fdd 149 return ret;
7d47d972
JK
150}
151
00590fdd 152/* Userspace interfaces: we are protected by the nfnl mutex */
5416219e 153
00590fdd 154static void
45040978 155__list_set_del_rcu(struct rcu_head * rcu)
5416219e 156{
45040978
JK
157 struct set_elem *e = container_of(rcu, struct set_elem, rcu);
158 struct ip_set *set = e->set;
7d47d972 159 struct list_set *map = set->data;
5416219e 160
1785e8f4 161 ip_set_put_byindex(map->net, e->id);
40cd63bf 162 ip_set_ext_destroy(set, e);
45040978 163 kfree(e);
00590fdd 164}
f830837f 165
00590fdd
JK
166static inline void
167list_set_del(struct ip_set *set, struct set_elem *e)
168{
169 list_del_rcu(&e->list);
45040978 170 call_rcu(&e->rcu, __list_set_del_rcu);
00590fdd 171}
7d47d972 172
00590fdd 173static inline void
45040978 174list_set_replace(struct set_elem *e, struct set_elem *old)
00590fdd
JK
175{
176 list_replace_rcu(&old->list, &e->list);
45040978 177 call_rcu(&old->rcu, __list_set_del_rcu);
f830837f
JK
178}
179
180static void
7d47d972 181set_cleanup_entries(struct ip_set *set)
f830837f 182{
7d47d972 183 struct list_set *map = set->data;
00590fdd 184 struct set_elem *e, *n;
f830837f 185
00590fdd
JK
186 list_for_each_entry_safe(e, n, &map->members, list)
187 if (ip_set_timeout_expired(ext_timeout(e, set)))
188 list_set_del(set, e);
f830837f
JK
189}
190
7d47d972
JK
191static int
192list_set_utest(struct ip_set *set, void *value, const struct ip_set_ext *ext,
193 struct ip_set_ext *mext, u32 flags)
f830837f 194{
7d47d972
JK
195 struct list_set *map = set->data;
196 struct set_adt_elem *d = value;
00590fdd 197 struct set_elem *e, *next, *prev = NULL;
7d47d972 198 int ret;
f830837f 199
00590fdd
JK
200 list_for_each_entry(e, &map->members, list) {
201 if (SET_WITH_TIMEOUT(set) &&
202 ip_set_timeout_expired(ext_timeout(e, set)))
7d47d972 203 continue;
00590fdd
JK
204 else if (e->id != d->id) {
205 prev = e;
7d47d972 206 continue;
00590fdd 207 }
7d47d972 208
ca0f6a5c 209 if (d->before == 0) {
00590fdd 210 ret = 1;
ca0f6a5c 211 } else if (d->before > 0) {
00590fdd
JK
212 next = list_next_entry(e, list);
213 ret = !list_is_last(&e->list, &map->members) &&
214 next->id == d->refid;
ca0f6a5c 215 } else {
00590fdd 216 ret = prev && prev->id == d->refid;
ca0f6a5c 217 }
7d47d972 218 return ret;
f830837f 219 }
7d47d972 220 return 0;
f830837f
JK
221}
222
00590fdd
JK
223static void
224list_set_init_extensions(struct ip_set *set, const struct ip_set_ext *ext,
225 struct set_elem *e)
226{
227 if (SET_WITH_COUNTER(set))
228 ip_set_init_counter(ext_counter(e, set), ext);
229 if (SET_WITH_COMMENT(set))
230 ip_set_init_comment(ext_comment(e, set), ext);
231 if (SET_WITH_SKBINFO(set))
232 ip_set_init_skbinfo(ext_skbinfo(e, set), ext);
233 /* Update timeout last */
234 if (SET_WITH_TIMEOUT(set))
235 ip_set_timeout_set(ext_timeout(e, set), ext->timeout);
236}
7d47d972 237
f830837f 238static int
7d47d972
JK
239list_set_uadd(struct ip_set *set, void *value, const struct ip_set_ext *ext,
240 struct ip_set_ext *mext, u32 flags)
f830837f 241{
7d47d972
JK
242 struct list_set *map = set->data;
243 struct set_adt_elem *d = value;
00590fdd 244 struct set_elem *e, *n, *prev, *next;
7d47d972 245 bool flag_exist = flags & IPSET_FLAG_EXIST;
f830837f 246
00590fdd
JK
247 /* Find where to add the new entry */
248 n = prev = next = NULL;
249 list_for_each_entry(e, &map->members, list) {
250 if (SET_WITH_TIMEOUT(set) &&
251 ip_set_timeout_expired(ext_timeout(e, set)))
7d47d972 252 continue;
00590fdd
JK
253 else if (d->id == e->id)
254 n = e;
255 else if (d->before == 0 || e->id != d->refid)
256 continue;
257 else if (d->before > 0)
258 next = e;
259 else
260 prev = e;
261 }
262 /* Re-add already existing element */
263 if (n) {
264 if ((d->before > 0 && !next) ||
265 (d->before < 0 && !prev))
7d47d972
JK
266 return -IPSET_ERR_REF_EXIST;
267 if (!flag_exist)
7d47d972
JK
268 return -IPSET_ERR_EXIST;
269 /* Update extensions */
00590fdd
JK
270 ip_set_ext_destroy(set, n);
271 list_set_init_extensions(set, ext, n);
40cd63bf 272
7d47d972 273 /* Set is already added to the list */
1785e8f4 274 ip_set_put_byindex(map->net, d->id);
7d47d972
JK
275 return 0;
276 }
00590fdd
JK
277 /* Add new entry */
278 if (d->before == 0) {
279 /* Append */
280 n = list_empty(&map->members) ? NULL :
281 list_last_entry(&map->members, struct set_elem, list);
282 } else if (d->before > 0) {
283 /* Insert after next element */
284 if (!list_is_last(&next->list, &map->members))
285 n = list_next_entry(next, list);
286 } else {
287 /* Insert before prev element */
288 if (prev->list.prev != &map->members)
289 n = list_prev_entry(prev, list);
02f815cb 290 }
00590fdd
JK
291 /* Can we replace a timed out entry? */
292 if (n &&
293 !(SET_WITH_TIMEOUT(set) &&
294 ip_set_timeout_expired(ext_timeout(n, set))))
295 n = NULL;
296
00db674b 297 e = kzalloc(set->dsize, GFP_ATOMIC);
00590fdd
JK
298 if (!e)
299 return -ENOMEM;
300 e->id = d->id;
45040978 301 e->set = set;
00590fdd
JK
302 INIT_LIST_HEAD(&e->list);
303 list_set_init_extensions(set, ext, e);
304 if (n)
45040978 305 list_set_replace(e, n);
00590fdd
JK
306 else if (next)
307 list_add_tail_rcu(&e->list, &next->list);
308 else if (prev)
309 list_add_rcu(&e->list, &prev->list);
310 else
311 list_add_tail_rcu(&e->list, &map->members);
f830837f 312
00590fdd 313 return 0;
f830837f
JK
314}
315
316static int
7d47d972
JK
317list_set_udel(struct ip_set *set, void *value, const struct ip_set_ext *ext,
318 struct ip_set_ext *mext, u32 flags)
f830837f 319{
7d47d972
JK
320 struct list_set *map = set->data;
321 struct set_adt_elem *d = value;
00590fdd
JK
322 struct set_elem *e, *next, *prev = NULL;
323
324 list_for_each_entry(e, &map->members, list) {
325 if (SET_WITH_TIMEOUT(set) &&
326 ip_set_timeout_expired(ext_timeout(e, set)))
7d47d972 327 continue;
00590fdd
JK
328 else if (e->id != d->id) {
329 prev = e;
7d47d972 330 continue;
00590fdd 331 }
7d47d972 332
00590fdd
JK
333 if (d->before > 0) {
334 next = list_next_entry(e, list);
335 if (list_is_last(&e->list, &map->members) ||
336 next->id != d->refid)
7d47d972 337 return -IPSET_ERR_REF_EXIST;
00590fdd
JK
338 } else if (d->before < 0) {
339 if (!prev || prev->id != d->refid)
340 return -IPSET_ERR_REF_EXIST;
341 }
342 list_set_del(set, e);
343 return 0;
5416219e 344 }
00590fdd 345 return d->before != 0 ? -IPSET_ERR_REF_EXIST : -IPSET_ERR_EXIST;
5416219e
JK
346}
347
f830837f
JK
348static int
349list_set_uadt(struct ip_set *set, struct nlattr *tb[],
3d14b171 350 enum ipset_adt adt, u32 *lineno, u32 flags, bool retried)
f830837f 351{
1785e8f4 352 struct list_set *map = set->data;
7d47d972
JK
353 ipset_adtfn adtfn = set->variant->adt[adt];
354 struct set_adt_elem e = { .refid = IPSET_INVALID_ID };
ca134ce8 355 struct ip_set_ext ext = IP_SET_INIT_UEXT(set);
f830837f 356 struct ip_set *s;
f830837f
JK
357 int ret = 0;
358
a212e08e
SP
359 if (tb[IPSET_ATTR_LINENO])
360 *lineno = nla_get_u32(tb[IPSET_ATTR_LINENO]);
361
f830837f 362 if (unlikely(!tb[IPSET_ATTR_NAME] ||
7dd37bc8 363 !ip_set_optattr_netorder(tb, IPSET_ATTR_CADT_FLAGS)))
f830837f
JK
364 return -IPSET_ERR_PROTOCOL;
365
7d47d972
JK
366 ret = ip_set_get_extensions(set, tb, &ext);
367 if (ret)
368 return ret;
1785e8f4 369 e.id = ip_set_get_byname(map->net, nla_data(tb[IPSET_ATTR_NAME]), &s);
7d47d972 370 if (e.id == IPSET_INVALID_ID)
f830837f
JK
371 return -IPSET_ERR_NAME;
372 /* "Loop detection" */
373 if (s->type->features & IPSET_TYPE_NAME) {
374 ret = -IPSET_ERR_LOOP;
375 goto finish;
376 }
377
378 if (tb[IPSET_ATTR_CADT_FLAGS]) {
379 u32 f = ip_set_get_h32(tb[IPSET_ATTR_CADT_FLAGS]);
00590fdd 380
7d47d972 381 e.before = f & IPSET_FLAG_BEFORE;
f830837f
JK
382 }
383
7d47d972 384 if (e.before && !tb[IPSET_ATTR_NAMEREF]) {
f830837f
JK
385 ret = -IPSET_ERR_BEFORE;
386 goto finish;
387 }
388
389 if (tb[IPSET_ATTR_NAMEREF]) {
1785e8f4
VL
390 e.refid = ip_set_get_byname(map->net,
391 nla_data(tb[IPSET_ATTR_NAMEREF]),
7d47d972
JK
392 &s);
393 if (e.refid == IPSET_INVALID_ID) {
f830837f
JK
394 ret = -IPSET_ERR_NAMEREF;
395 goto finish;
396 }
7d47d972
JK
397 if (!e.before)
398 e.before = -1;
f830837f 399 }
7d47d972
JK
400 if (adt != IPSET_TEST && SET_WITH_TIMEOUT(set))
401 set_cleanup_entries(set);
f830837f 402
7d47d972 403 ret = adtfn(set, &e, &ext, &ext, flags);
f830837f
JK
404
405finish:
7d47d972 406 if (e.refid != IPSET_INVALID_ID)
1785e8f4 407 ip_set_put_byindex(map->net, e.refid);
f830837f 408 if (adt != IPSET_ADD || ret)
1785e8f4 409 ip_set_put_byindex(map->net, e.id);
f830837f
JK
410
411 return ip_set_eexist(ret, flags) ? 0 : ret;
412}
413
414static void
415list_set_flush(struct ip_set *set)
416{
417 struct list_set *map = set->data;
00590fdd
JK
418 struct set_elem *e, *n;
419
420 list_for_each_entry_safe(e, n, &map->members, list)
421 list_set_del(set, e);
f830837f
JK
422}
423
424static void
425list_set_destroy(struct ip_set *set)
426{
427 struct list_set *map = set->data;
00590fdd 428 struct set_elem *e, *n;
f830837f 429
7d47d972 430 if (SET_WITH_TIMEOUT(set))
f830837f 431 del_timer_sync(&map->gc);
45040978 432
00590fdd
JK
433 list_for_each_entry_safe(e, n, &map->members, list) {
434 list_del(&e->list);
435 ip_set_put_byindex(map->net, e->id);
436 ip_set_ext_destroy(set, e);
437 kfree(e);
438 }
f830837f
JK
439 kfree(map);
440
441 set->data = NULL;
442}
443
444static int
445list_set_head(struct ip_set *set, struct sk_buff *skb)
446{
447 const struct list_set *map = set->data;
448 struct nlattr *nested;
00590fdd
JK
449 struct set_elem *e;
450 u32 n = 0;
451
45040978
JK
452 rcu_read_lock();
453 list_for_each_entry_rcu(e, &map->members, list)
00590fdd 454 n++;
45040978 455 rcu_read_unlock();
f830837f
JK
456
457 nested = ipset_nest_start(skb, IPSET_ATTR_DATA);
458 if (!nested)
459 goto nla_put_failure;
7cf7899d 460 if (nla_put_net32(skb, IPSET_ATTR_SIZE, htonl(map->size)) ||
596cf3fe 461 nla_put_net32(skb, IPSET_ATTR_REFERENCES, htonl(set->ref)) ||
7cf7899d 462 nla_put_net32(skb, IPSET_ATTR_MEMSIZE,
00590fdd 463 htonl(sizeof(*map) + n * set->dsize)))
7cf7899d 464 goto nla_put_failure;
81b10bb4
OS
465 if (unlikely(ip_set_put_flags(skb, set)))
466 goto nla_put_failure;
f830837f
JK
467 ipset_nest_end(skb, nested);
468
469 return 0;
470nla_put_failure:
471 return -EMSGSIZE;
472}
473
474static int
475list_set_list(const struct ip_set *set,
476 struct sk_buff *skb, struct netlink_callback *cb)
477{
478 const struct list_set *map = set->data;
479 struct nlattr *atd, *nested;
00590fdd
JK
480 u32 i = 0, first = cb->args[IPSET_CB_ARG0];
481 struct set_elem *e;
482 int ret = 0;
f830837f
JK
483
484 atd = ipset_nest_start(skb, IPSET_ATTR_ADT);
485 if (!atd)
486 return -EMSGSIZE;
00590fdd
JK
487
488 rcu_read_lock();
45040978
JK
489 list_for_each_entry_rcu(e, &map->members, list) {
490 if (i < first ||
491 (SET_WITH_TIMEOUT(set) &&
492 ip_set_timeout_expired(ext_timeout(e, set)))) {
493 i++;
f830837f 494 continue;
45040978 495 }
f830837f 496 nested = ipset_nest_start(skb, IPSET_ATTR_DATA);
45040978 497 if (!nested)
00590fdd 498 goto nla_put_failure;
7cf7899d 499 if (nla_put_string(skb, IPSET_ATTR_NAME,
1785e8f4 500 ip_set_name_byindex(map->net, e->id)))
7cf7899d 501 goto nla_put_failure;
3fd986b3 502 if (ip_set_put_extensions(skb, set, e, true))
81b10bb4 503 goto nla_put_failure;
f830837f 504 ipset_nest_end(skb, nested);
45040978 505 i++;
f830837f 506 }
00590fdd 507
f830837f
JK
508 ipset_nest_end(skb, atd);
509 /* Set listing finished */
93302880 510 cb->args[IPSET_CB_ARG0] = 0;
00590fdd 511 goto out;
f830837f
JK
512
513nla_put_failure:
514 nla_nest_cancel(skb, nested);
f830837f 515 if (unlikely(i == first)) {
45040978 516 nla_nest_cancel(skb, atd);
93302880 517 cb->args[IPSET_CB_ARG0] = 0;
00590fdd 518 ret = -EMSGSIZE;
45040978
JK
519 } else {
520 cb->args[IPSET_CB_ARG0] = i;
f830837f 521 }
122ebbf2 522 ipset_nest_end(skb, atd);
00590fdd
JK
523out:
524 rcu_read_unlock();
525 return ret;
f830837f
JK
526}
527
528static bool
529list_set_same_set(const struct ip_set *a, const struct ip_set *b)
530{
531 const struct list_set *x = a->data;
532 const struct list_set *y = b->data;
533
534 return x->size == y->size &&
ca134ce8 535 a->timeout == b->timeout &&
7d47d972 536 a->extensions == b->extensions;
f830837f
JK
537}
538
7d47d972 539static const struct ip_set_type_variant set_variant = {
f830837f
JK
540 .kadt = list_set_kadt,
541 .uadt = list_set_uadt,
7d47d972
JK
542 .adt = {
543 [IPSET_ADD] = list_set_uadd,
544 [IPSET_DEL] = list_set_udel,
545 [IPSET_TEST] = list_set_utest,
546 },
f830837f
JK
547 .destroy = list_set_destroy,
548 .flush = list_set_flush,
549 .head = list_set_head,
550 .list = list_set_list,
551 .same_set = list_set_same_set,
552};
553
554static void
555list_set_gc(unsigned long ul_set)
556{
ca0f6a5c 557 struct ip_set *set = (struct ip_set *)ul_set;
f830837f 558 struct list_set *map = set->data;
2f9f28b2 559
00590fdd 560 spin_lock_bh(&set->lock);
7d47d972 561 set_cleanup_entries(set);
00590fdd 562 spin_unlock_bh(&set->lock);
f830837f 563
ca134ce8 564 map->gc.expires = jiffies + IPSET_GC_PERIOD(set->timeout) * HZ;
f830837f
JK
565 add_timer(&map->gc);
566}
567
568static void
7d47d972 569list_set_gc_init(struct ip_set *set, void (*gc)(unsigned long ul_set))
f830837f
JK
570{
571 struct list_set *map = set->data;
572
573 init_timer(&map->gc);
ca0f6a5c 574 map->gc.data = (unsigned long)set;
7d47d972 575 map->gc.function = gc;
ca134ce8 576 map->gc.expires = jiffies + IPSET_GC_PERIOD(set->timeout) * HZ;
f830837f
JK
577 add_timer(&map->gc);
578}
579
580/* Create list:set type of sets */
581
03c8b234 582static bool
1785e8f4 583init_list_set(struct net *net, struct ip_set *set, u32 size)
f830837f
JK
584{
585 struct list_set *map;
f830837f 586
00590fdd 587 map = kzalloc(sizeof(*map), GFP_KERNEL);
f830837f 588 if (!map)
03c8b234 589 return false;
f830837f
JK
590
591 map->size = size;
1785e8f4 592 map->net = net;
00590fdd 593 INIT_LIST_HEAD(&map->members);
f830837f
JK
594 set->data = map;
595
03c8b234 596 return true;
f830837f
JK
597}
598
599static int
1785e8f4
VL
600list_set_create(struct net *net, struct ip_set *set, struct nlattr *tb[],
601 u32 flags)
f830837f 602{
03c8b234 603 u32 size = IP_SET_LIST_DEFAULT_SIZE;
f830837f
JK
604
605 if (unlikely(!ip_set_optattr_netorder(tb, IPSET_ATTR_SIZE) ||
de76303c
JK
606 !ip_set_optattr_netorder(tb, IPSET_ATTR_TIMEOUT) ||
607 !ip_set_optattr_netorder(tb, IPSET_ATTR_CADT_FLAGS)))
f830837f
JK
608 return -IPSET_ERR_PROTOCOL;
609
610 if (tb[IPSET_ATTR_SIZE])
611 size = ip_set_get_h32(tb[IPSET_ATTR_SIZE]);
612 if (size < IP_SET_LIST_MIN_SIZE)
613 size = IP_SET_LIST_MIN_SIZE;
614
7d47d972 615 set->variant = &set_variant;
95ad1f4a
JK
616 set->dsize = ip_set_elem_len(set, tb, sizeof(struct set_elem),
617 __alignof__(struct set_elem));
1785e8f4 618 if (!init_list_set(net, set, size))
03c8b234
JK
619 return -ENOMEM;
620 if (tb[IPSET_ATTR_TIMEOUT]) {
621 set->timeout = ip_set_timeout_uget(tb[IPSET_ATTR_TIMEOUT]);
7d47d972 622 list_set_gc_init(set, list_set_gc);
f830837f 623 }
f830837f
JK
624 return 0;
625}
626
627static struct ip_set_type list_set_type __read_mostly = {
628 .name = "list:set",
629 .protocol = IPSET_PROTOCOL,
630 .features = IPSET_TYPE_NAME | IPSET_DUMP_LAST,
631 .dimension = IPSET_DIM_ONE,
c15f1c83 632 .family = NFPROTO_UNSPEC,
35b8dcf8
JK
633 .revision_min = IPSET_TYPE_REV_MIN,
634 .revision_max = IPSET_TYPE_REV_MAX,
f830837f
JK
635 .create = list_set_create,
636 .create_policy = {
637 [IPSET_ATTR_SIZE] = { .type = NLA_U32 },
638 [IPSET_ATTR_TIMEOUT] = { .type = NLA_U32 },
de76303c 639 [IPSET_ATTR_CADT_FLAGS] = { .type = NLA_U32 },
f830837f
JK
640 },
641 .adt_policy = {
642 [IPSET_ATTR_NAME] = { .type = NLA_STRING,
643 .len = IPSET_MAXNAMELEN },
644 [IPSET_ATTR_NAMEREF] = { .type = NLA_STRING,
645 .len = IPSET_MAXNAMELEN },
646 [IPSET_ATTR_TIMEOUT] = { .type = NLA_U32 },
647 [IPSET_ATTR_LINENO] = { .type = NLA_U32 },
648 [IPSET_ATTR_CADT_FLAGS] = { .type = NLA_U32 },
de76303c
JK
649 [IPSET_ATTR_BYTES] = { .type = NLA_U64 },
650 [IPSET_ATTR_PACKETS] = { .type = NLA_U64 },
03726186
SP
651 [IPSET_ATTR_COMMENT] = { .type = NLA_NUL_STRING,
652 .len = IPSET_MAX_COMMENT_SIZE },
cbee93d7
AD
653 [IPSET_ATTR_SKBMARK] = { .type = NLA_U64 },
654 [IPSET_ATTR_SKBPRIO] = { .type = NLA_U32 },
655 [IPSET_ATTR_SKBQUEUE] = { .type = NLA_U16 },
f830837f
JK
656 },
657 .me = THIS_MODULE,
658};
659
660static int __init
661list_set_init(void)
662{
663 return ip_set_type_register(&list_set_type);
664}
665
666static void __exit
667list_set_fini(void)
668{
00590fdd 669 rcu_barrier();
f830837f
JK
670 ip_set_type_unregister(&list_set_type);
671}
672
673module_init(list_set_init);
674module_exit(list_set_fini);
This page took 0.318027 seconds and 5 git commands to generate.