1 /* Copyright (C) 2013 Jozsef Kadlecsik <kadlec@blackhole.kfki.hu>
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.
8 #ifndef _IP_SET_HASH_GEN_H
9 #define _IP_SET_HASH_GEN_H
11 #include <linux/rcupdate.h>
12 #include <linux/jhash.h>
13 #include <linux/netfilter/ipset/ip_set_timeout.h>
14 #ifndef rcu_dereference_bh
15 #define rcu_dereference_bh(p) rcu_dereference(p)
18 #define rcu_dereference_bh_nfnl(p) rcu_dereference_bh_check(p, 1)
20 /* Hashing which uses arrays to resolve clashing. The hash table is resized
21 * (doubled) when searching becomes too long.
22 * Internally jhash is used with the assumption that the size of the
23 * stored data is a multiple of sizeof(u32). If storage supports timeout,
24 * the timeout field must be the last one in the data structure - that field
25 * is ignored when computing the hash key.
27 * Readers and resizing
29 * Resizing can be triggered by userspace command only, and those
30 * are serialized by the nfnl mutex. During resizing the set is
31 * read-locked, so the only possible concurrent operations are
32 * the kernel side readers. Those must be protected by proper RCU locking.
35 /* Number of elements to store in an initial array block */
36 #define AHASH_INIT_SIZE 4
37 /* Max number of elements to store in an array block */
38 #define AHASH_MAX_SIZE (3*AHASH_INIT_SIZE)
40 /* Max number of elements can be tuned */
41 #ifdef IP_SET_HASH_WITH_MULTI
42 #define AHASH_MAX(h) ((h)->ahash_max)
45 tune_ahash_max(u8 curr, u32 multi)
52 n = curr + AHASH_INIT_SIZE;
53 /* Currently, at listing one hash bucket must fit into a message.
54 * Therefore we have a hard limit here.
56 return n > curr && n <= 64 ? n : curr;
58 #define TUNE_AHASH_MAX(h, multi) \
59 ((h)->ahash_max = tune_ahash_max((h)->ahash_max, multi))
61 #define AHASH_MAX(h) AHASH_MAX_SIZE
62 #define TUNE_AHASH_MAX(h, multi)
67 void *value; /* the array of the values */
68 u8 size; /* size of the array */
69 u8 pos; /* position of the first free entry */
72 /* The hash table: the table size stored here in order to make resizing easy */
74 u8 htable_bits; /* size of hash table == 2^htable_bits */
75 struct hbucket bucket[0]; /* hashtable buckets */
78 #define hbucket(h, i) (&((h)->bucket[i]))
80 #ifndef IPSET_NET_COUNT
81 #define IPSET_NET_COUNT 1
84 /* Book-keeping of the prefixes added to the set */
86 u32 nets[IPSET_NET_COUNT]; /* number of elements per cidr */
87 u8 cidr[IPSET_NET_COUNT]; /* the different cidr values in the set */
90 /* Compute the hash table size */
96 /* We must fit both into u32 in jhash and size_t */
99 hsize = jhash_size(hbits);
100 if ((((size_t)-1) - sizeof(struct htable))/sizeof(struct hbucket)
104 return hsize * sizeof(struct hbucket) + sizeof(struct htable);
107 /* Compute htable_bits from the user input parameter hashsize */
109 htable_bits(u32 hashsize)
111 /* Assume that hashsize == 2^htable_bits */
112 u8 bits = fls(hashsize - 1);
113 if (jhash_size(bits) != hashsize)
114 /* Round up to the first 2^n value */
115 bits = fls(hashsize);
121 hbucket_elem_add(struct hbucket *n, u8 ahash_max, size_t dsize)
123 if (n->pos >= n->size) {
126 if (n->size >= ahash_max)
127 /* Trigger rehashing */
130 tmp = kzalloc((n->size + AHASH_INIT_SIZE) * dsize,
135 memcpy(tmp, n->value, n->size * dsize);
139 n->size += AHASH_INIT_SIZE;
144 #ifdef IP_SET_HASH_WITH_NETS
145 #if IPSET_NET_COUNT > 1
146 #define __CIDR(cidr, i) (cidr[i])
148 #define __CIDR(cidr, i) (cidr)
150 #ifdef IP_SET_HASH_WITH_NETS_PACKED
151 /* When cidr is packed with nomatch, cidr - 1 is stored in the entry */
152 #define CIDR(cidr, i) (__CIDR(cidr, i) + 1)
154 #define CIDR(cidr, i) (__CIDR(cidr, i))
157 #define SET_HOST_MASK(family) (family == AF_INET ? 32 : 128)
159 #ifdef IP_SET_HASH_WITH_MULTI
160 #define NLEN(family) (SET_HOST_MASK(family) + 1)
162 #define NLEN(family) SET_HOST_MASK(family)
166 #define NLEN(family) 0
167 #endif /* IP_SET_HASH_WITH_NETS */
169 #endif /* _IP_SET_HASH_GEN_H */
171 /* Family dependent templates */
174 #undef mtype_data_equal
175 #undef mtype_do_data_match
176 #undef mtype_data_set_flags
177 #undef mtype_data_reset_flags
178 #undef mtype_data_netmask
179 #undef mtype_data_list
180 #undef mtype_data_next
183 #undef mtype_ahash_destroy
184 #undef mtype_ext_cleanup
185 #undef mtype_add_cidr
186 #undef mtype_del_cidr
187 #undef mtype_ahash_memsize
191 #undef mtype_same_set
198 #undef mtype_test_cidrs
207 #undef mtype_data_match
211 #define mtype_data_equal IPSET_TOKEN(MTYPE, _data_equal)
212 #ifdef IP_SET_HASH_WITH_NETS
213 #define mtype_do_data_match IPSET_TOKEN(MTYPE, _do_data_match)
215 #define mtype_do_data_match(d) 1
217 #define mtype_data_set_flags IPSET_TOKEN(MTYPE, _data_set_flags)
218 #define mtype_data_reset_elem IPSET_TOKEN(MTYPE, _data_reset_elem)
219 #define mtype_data_reset_flags IPSET_TOKEN(MTYPE, _data_reset_flags)
220 #define mtype_data_netmask IPSET_TOKEN(MTYPE, _data_netmask)
221 #define mtype_data_list IPSET_TOKEN(MTYPE, _data_list)
222 #define mtype_data_next IPSET_TOKEN(MTYPE, _data_next)
223 #define mtype_elem IPSET_TOKEN(MTYPE, _elem)
224 #define mtype_ahash_destroy IPSET_TOKEN(MTYPE, _ahash_destroy)
225 #define mtype_ext_cleanup IPSET_TOKEN(MTYPE, _ext_cleanup)
226 #define mtype_add_cidr IPSET_TOKEN(MTYPE, _add_cidr)
227 #define mtype_del_cidr IPSET_TOKEN(MTYPE, _del_cidr)
228 #define mtype_ahash_memsize IPSET_TOKEN(MTYPE, _ahash_memsize)
229 #define mtype_flush IPSET_TOKEN(MTYPE, _flush)
230 #define mtype_destroy IPSET_TOKEN(MTYPE, _destroy)
231 #define mtype_gc_init IPSET_TOKEN(MTYPE, _gc_init)
232 #define mtype_same_set IPSET_TOKEN(MTYPE, _same_set)
233 #define mtype_kadt IPSET_TOKEN(MTYPE, _kadt)
234 #define mtype_uadt IPSET_TOKEN(MTYPE, _uadt)
237 #define mtype_add IPSET_TOKEN(MTYPE, _add)
238 #define mtype_del IPSET_TOKEN(MTYPE, _del)
239 #define mtype_test_cidrs IPSET_TOKEN(MTYPE, _test_cidrs)
240 #define mtype_test IPSET_TOKEN(MTYPE, _test)
241 #define mtype_expire IPSET_TOKEN(MTYPE, _expire)
242 #define mtype_resize IPSET_TOKEN(MTYPE, _resize)
243 #define mtype_head IPSET_TOKEN(MTYPE, _head)
244 #define mtype_list IPSET_TOKEN(MTYPE, _list)
245 #define mtype_gc IPSET_TOKEN(MTYPE, _gc)
246 #define mtype_variant IPSET_TOKEN(MTYPE, _variant)
247 #define mtype_data_match IPSET_TOKEN(MTYPE, _data_match)
250 #define HKEY_DATALEN sizeof(struct mtype_elem)
253 #define HKEY(data, initval, htable_bits) \
254 (jhash2((u32 *)(data), HKEY_DATALEN/sizeof(u32), initval) \
255 & jhash_mask(htable_bits))
260 /* The generic hash structure */
262 struct htable __rcu *table; /* the hash table */
263 u32 maxelem; /* max elements in the hash */
264 u32 elements; /* current element (vs timeout) */
265 u32 initval; /* random jhash init value */
266 struct timer_list gc; /* garbage collection when timeout enabled */
267 struct mtype_elem next; /* temporary storage for uadd */
268 #ifdef IP_SET_HASH_WITH_MULTI
269 u8 ahash_max; /* max elements in an array block */
271 #ifdef IP_SET_HASH_WITH_NETMASK
272 u8 netmask; /* netmask value for subnets to store */
274 #ifdef IP_SET_HASH_WITH_RBTREE
275 struct rb_root rbtree;
277 #ifdef IP_SET_HASH_WITH_NETS
278 struct net_prefixes nets[0]; /* book-keeping of prefixes */
283 #ifdef IP_SET_HASH_WITH_NETS
284 /* Network cidr size book keeping when the hash stores different
287 mtype_add_cidr(struct htype *h, u8 cidr, u8 nets_length, u8 n)
291 /* Add in increasing prefix order, so larger cidr first */
292 for (i = 0, j = -1; i < nets_length && h->nets[i].nets[n]; i++) {
295 else if (h->nets[i].cidr[n] < cidr)
297 else if (h->nets[i].cidr[n] == cidr) {
298 h->nets[i].nets[n]++;
304 h->nets[i].cidr[n] = h->nets[i - 1].cidr[n];
305 h->nets[i].nets[n] = h->nets[i - 1].nets[n];
308 h->nets[i].cidr[n] = cidr;
309 h->nets[i].nets[n] = 1;
313 mtype_del_cidr(struct htype *h, u8 cidr, u8 nets_length, u8 n)
315 u8 i, j, net_end = nets_length - 1;
317 for (i = 0; i < nets_length; i++) {
318 if (h->nets[i].cidr[n] != cidr)
320 if (h->nets[i].nets[n] > 1 || i == net_end ||
321 h->nets[i + 1].nets[n] == 0) {
322 h->nets[i].nets[n]--;
325 for (j = i; j < net_end && h->nets[j].nets[n]; j++) {
326 h->nets[j].cidr[n] = h->nets[j + 1].cidr[n];
327 h->nets[j].nets[n] = h->nets[j + 1].nets[n];
329 h->nets[j].nets[n] = 0;
335 /* Calculate the actual memory size of the set data */
337 mtype_ahash_memsize(const struct htype *h, const struct htable *t,
338 u8 nets_length, size_t dsize)
341 size_t memsize = sizeof(*h)
343 #ifdef IP_SET_HASH_WITH_NETS
344 + sizeof(struct net_prefixes) * nets_length
346 + jhash_size(t->htable_bits) * sizeof(struct hbucket);
348 for (i = 0; i < jhash_size(t->htable_bits); i++)
349 memsize += t->bucket[i].size * dsize;
354 /* Get the ith element from the array block n */
355 #define ahash_data(n, i, dsize) \
356 ((struct mtype_elem *)((n)->value + ((i) * (dsize))))
359 mtype_ext_cleanup(struct ip_set *set, struct hbucket *n)
363 for (i = 0; i < n->pos; i++)
364 ip_set_ext_destroy(set, ahash_data(n, i, set->dsize));
367 /* Flush a hash type of set: destroy all elements */
369 mtype_flush(struct ip_set *set)
371 struct htype *h = set->data;
376 t = rcu_dereference_bh_nfnl(h->table);
377 for (i = 0; i < jhash_size(t->htable_bits); i++) {
380 if (set->extensions & IPSET_EXT_DESTROY)
381 mtype_ext_cleanup(set, n);
382 n->size = n->pos = 0;
383 /* FIXME: use slab cache */
387 #ifdef IP_SET_HASH_WITH_NETS
388 memset(h->nets, 0, sizeof(struct net_prefixes) * NLEN(set->family));
393 /* Destroy the hashtable part of the set */
395 mtype_ahash_destroy(struct ip_set *set, struct htable *t, bool ext_destroy)
400 for (i = 0; i < jhash_size(t->htable_bits); i++) {
403 if (set->extensions & IPSET_EXT_DESTROY && ext_destroy)
404 mtype_ext_cleanup(set, n);
405 /* FIXME: use slab cache */
413 /* Destroy a hash type of set */
415 mtype_destroy(struct ip_set *set)
417 struct htype *h = set->data;
419 if (set->extensions & IPSET_EXT_TIMEOUT)
420 del_timer_sync(&h->gc);
422 mtype_ahash_destroy(set, rcu_dereference_bh_nfnl(h->table), true);
423 #ifdef IP_SET_HASH_WITH_RBTREE
424 rbtree_destroy(&h->rbtree);
432 mtype_gc_init(struct ip_set *set, void (*gc)(unsigned long ul_set))
434 struct htype *h = set->data;
437 h->gc.data = (unsigned long) set;
439 h->gc.expires = jiffies + IPSET_GC_PERIOD(set->timeout) * HZ;
441 pr_debug("gc initialized, run in every %u\n",
442 IPSET_GC_PERIOD(set->timeout));
446 mtype_same_set(const struct ip_set *a, const struct ip_set *b)
448 const struct htype *x = a->data;
449 const struct htype *y = b->data;
451 /* Resizing changes htable_bits, so we ignore it */
452 return x->maxelem == y->maxelem &&
453 a->timeout == b->timeout &&
454 #ifdef IP_SET_HASH_WITH_NETMASK
455 x->netmask == y->netmask &&
457 a->extensions == b->extensions;
460 /* Delete expired elements from the hashtable */
462 mtype_expire(struct ip_set *set, struct htype *h, u8 nets_length, size_t dsize)
466 struct mtype_elem *data;
469 #ifdef IP_SET_HASH_WITH_NETS
474 t = rcu_dereference_bh(h->table);
475 for (i = 0; i < jhash_size(t->htable_bits); i++) {
477 for (j = 0; j < n->pos; j++) {
478 data = ahash_data(n, j, dsize);
479 if (ip_set_timeout_expired(ext_timeout(data, set))) {
480 pr_debug("expired %u/%u\n", i, j);
481 #ifdef IP_SET_HASH_WITH_NETS
482 for (k = 0; k < IPSET_NET_COUNT; k++)
483 mtype_del_cidr(h, CIDR(data->cidr, k),
486 ip_set_ext_destroy(set, data);
490 ahash_data(n, n->pos - 1, dsize),
496 if (n->pos + AHASH_INIT_SIZE < n->size) {
497 void *tmp = kzalloc((n->size - AHASH_INIT_SIZE)
501 /* Still try to delete expired elements */
503 n->size -= AHASH_INIT_SIZE;
504 memcpy(tmp, n->value, n->size * dsize);
509 rcu_read_unlock_bh();
513 mtype_gc(unsigned long ul_set)
515 struct ip_set *set = (struct ip_set *) ul_set;
516 struct htype *h = set->data;
518 pr_debug("called\n");
519 write_lock_bh(&set->lock);
520 mtype_expire(set, h, NLEN(set->family), set->dsize);
521 write_unlock_bh(&set->lock);
523 h->gc.expires = jiffies + IPSET_GC_PERIOD(set->timeout) * HZ;
527 /* Resize a hash: create a new hash table with doubling the hashsize
528 * and inserting the elements to it. Repeat until we succeed or
529 * fail due to memory pressures. */
531 mtype_resize(struct ip_set *set, bool retried)
533 struct htype *h = set->data;
534 struct htable *t, *orig = rcu_dereference_bh_nfnl(h->table);
535 u8 htable_bits = orig->htable_bits;
536 #ifdef IP_SET_HASH_WITH_NETS
539 struct mtype_elem *data;
540 struct mtype_elem *d;
541 struct hbucket *n, *m;
545 /* Try to cleanup once */
546 if (SET_WITH_TIMEOUT(set) && !retried) {
548 write_lock_bh(&set->lock);
549 mtype_expire(set, set->data, NLEN(set->family), set->dsize);
550 write_unlock_bh(&set->lock);
558 pr_debug("attempt to resize set %s from %u to %u, t %p\n",
559 set->name, orig->htable_bits, htable_bits, orig);
561 /* In case we have plenty of memory :-) */
562 pr_warning("Cannot increase the hashsize of set %s further\n",
564 return -IPSET_ERR_HASH_FULL;
566 t = ip_set_alloc(sizeof(*t)
567 + jhash_size(htable_bits) * sizeof(struct hbucket));
570 t->htable_bits = htable_bits;
572 read_lock_bh(&set->lock);
573 for (i = 0; i < jhash_size(orig->htable_bits); i++) {
574 n = hbucket(orig, i);
575 for (j = 0; j < n->pos; j++) {
576 data = ahash_data(n, j, set->dsize);
577 #ifdef IP_SET_HASH_WITH_NETS
579 mtype_data_reset_flags(data, &flags);
581 m = hbucket(t, HKEY(data, h->initval, htable_bits));
582 ret = hbucket_elem_add(m, AHASH_MAX(h), set->dsize);
584 #ifdef IP_SET_HASH_WITH_NETS
585 mtype_data_reset_flags(data, &flags);
587 read_unlock_bh(&set->lock);
588 mtype_ahash_destroy(set, t, false);
593 d = ahash_data(m, m->pos++, set->dsize);
594 memcpy(d, data, set->dsize);
595 #ifdef IP_SET_HASH_WITH_NETS
596 mtype_data_reset_flags(d, &flags);
601 rcu_assign_pointer(h->table, t);
602 read_unlock_bh(&set->lock);
604 /* Give time to other readers of the set */
605 synchronize_rcu_bh();
607 pr_debug("set %s resized from %u (%p) to %u (%p)\n", set->name,
608 orig->htable_bits, orig, t->htable_bits, t);
609 mtype_ahash_destroy(set, orig, false);
614 /* Add an element to a hash and update the internal counters when succeeded,
615 * otherwise report the proper error code. */
617 mtype_add(struct ip_set *set, void *value, const struct ip_set_ext *ext,
618 struct ip_set_ext *mext, u32 flags)
620 struct htype *h = set->data;
622 const struct mtype_elem *d = value;
623 struct mtype_elem *data;
626 int j = AHASH_MAX(h) + 1;
627 bool flag_exist = flags & IPSET_FLAG_EXIST;
630 if (SET_WITH_TIMEOUT(set) && h->elements >= h->maxelem)
631 /* FIXME: when set is full, we slow down here */
632 mtype_expire(set, h, NLEN(set->family), set->dsize);
634 if (h->elements >= h->maxelem) {
636 pr_warning("Set %s is full, maxelem %u reached\n",
637 set->name, h->maxelem);
638 return -IPSET_ERR_HASH_FULL;
642 t = rcu_dereference_bh(h->table);
643 key = HKEY(value, h->initval, t->htable_bits);
645 for (i = 0; i < n->pos; i++) {
646 data = ahash_data(n, i, set->dsize);
647 if (mtype_data_equal(data, d, &multi)) {
649 (SET_WITH_TIMEOUT(set) &&
650 ip_set_timeout_expired(ext_timeout(data, set)))) {
651 /* Just the extensions could be overwritten */
655 ret = -IPSET_ERR_EXIST;
659 /* Reuse first timed out entry */
660 if (SET_WITH_TIMEOUT(set) &&
661 ip_set_timeout_expired(ext_timeout(data, set)) &&
662 j != AHASH_MAX(h) + 1)
666 if (j != AHASH_MAX(h) + 1) {
667 /* Fill out reused slot */
668 data = ahash_data(n, j, set->dsize);
669 #ifdef IP_SET_HASH_WITH_NETS
670 for (i = 0; i < IPSET_NET_COUNT; i++) {
671 mtype_del_cidr(h, CIDR(data->cidr, i),
672 NLEN(set->family), i);
673 mtype_add_cidr(h, CIDR(d->cidr, i),
674 NLEN(set->family), i);
677 ip_set_ext_destroy(set, data);
679 /* Use/create a new slot */
680 TUNE_AHASH_MAX(h, multi);
681 ret = hbucket_elem_add(n, AHASH_MAX(h), set->dsize);
684 mtype_data_next(&h->next, d);
687 data = ahash_data(n, n->pos++, set->dsize);
688 #ifdef IP_SET_HASH_WITH_NETS
689 for (i = 0; i < IPSET_NET_COUNT; i++)
690 mtype_add_cidr(h, CIDR(d->cidr, i), NLEN(set->family),
695 memcpy(data, d, sizeof(struct mtype_elem));
696 #ifdef IP_SET_HASH_WITH_NETS
697 mtype_data_set_flags(data, flags);
699 if (SET_WITH_TIMEOUT(set))
700 ip_set_timeout_set(ext_timeout(data, set), ext->timeout);
701 if (SET_WITH_COUNTER(set))
702 ip_set_init_counter(ext_counter(data, set), ext);
703 if (SET_WITH_COMMENT(set))
704 ip_set_init_comment(ext_comment(data, set), ext);
707 rcu_read_unlock_bh();
711 /* Delete an element from the hash: swap it with the last element
712 * and free up space if possible.
715 mtype_del(struct ip_set *set, void *value, const struct ip_set_ext *ext,
716 struct ip_set_ext *mext, u32 flags)
718 struct htype *h = set->data;
720 const struct mtype_elem *d = value;
721 struct mtype_elem *data;
723 int i, ret = -IPSET_ERR_EXIST;
724 #ifdef IP_SET_HASH_WITH_NETS
730 t = rcu_dereference_bh(h->table);
731 key = HKEY(value, h->initval, t->htable_bits);
733 for (i = 0; i < n->pos; i++) {
734 data = ahash_data(n, i, set->dsize);
735 if (!mtype_data_equal(data, d, &multi))
737 if (SET_WITH_TIMEOUT(set) &&
738 ip_set_timeout_expired(ext_timeout(data, set)))
742 memcpy(data, ahash_data(n, n->pos - 1, set->dsize),
747 #ifdef IP_SET_HASH_WITH_NETS
748 for (j = 0; j < IPSET_NET_COUNT; j++)
749 mtype_del_cidr(h, CIDR(d->cidr, j), NLEN(set->family),
752 ip_set_ext_destroy(set, data);
753 if (n->pos + AHASH_INIT_SIZE < n->size) {
754 void *tmp = kzalloc((n->size - AHASH_INIT_SIZE)
761 n->size -= AHASH_INIT_SIZE;
762 memcpy(tmp, n->value, n->size * set->dsize);
771 rcu_read_unlock_bh();
776 mtype_data_match(struct mtype_elem *data, const struct ip_set_ext *ext,
777 struct ip_set_ext *mext, struct ip_set *set, u32 flags)
779 if (SET_WITH_COUNTER(set))
780 ip_set_update_counter(ext_counter(data, set),
782 return mtype_do_data_match(data);
785 #ifdef IP_SET_HASH_WITH_NETS
786 /* Special test function which takes into account the different network
787 * sizes added to the set */
789 mtype_test_cidrs(struct ip_set *set, struct mtype_elem *d,
790 const struct ip_set_ext *ext,
791 struct ip_set_ext *mext, u32 flags)
793 struct htype *h = set->data;
794 struct htable *t = rcu_dereference_bh(h->table);
796 struct mtype_elem *data;
797 #if IPSET_NET_COUNT == 2
798 struct mtype_elem orig = *d;
804 u8 nets_length = NLEN(set->family);
806 pr_debug("test by nets\n");
807 for (; j < nets_length && h->nets[j].nets[0] && !multi; j++) {
808 #if IPSET_NET_COUNT == 2
809 mtype_data_reset_elem(d, &orig);
810 mtype_data_netmask(d, h->nets[j].cidr[0], false);
811 for (k = 0; k < nets_length && h->nets[k].nets[1] && !multi;
813 mtype_data_netmask(d, h->nets[k].cidr[1], true);
815 mtype_data_netmask(d, h->nets[j].cidr[0]);
817 key = HKEY(d, h->initval, t->htable_bits);
819 for (i = 0; i < n->pos; i++) {
820 data = ahash_data(n, i, set->dsize);
821 if (!mtype_data_equal(data, d, &multi))
823 if (SET_WITH_TIMEOUT(set)) {
824 if (!ip_set_timeout_expired(
825 ext_timeout(data, set)))
826 return mtype_data_match(data, ext,
829 #ifdef IP_SET_HASH_WITH_MULTI
833 return mtype_data_match(data, ext,
836 #if IPSET_NET_COUNT == 2
844 /* Test whether the element is added to the set */
846 mtype_test(struct ip_set *set, void *value, const struct ip_set_ext *ext,
847 struct ip_set_ext *mext, u32 flags)
849 struct htype *h = set->data;
851 struct mtype_elem *d = value;
853 struct mtype_elem *data;
858 t = rcu_dereference_bh(h->table);
859 #ifdef IP_SET_HASH_WITH_NETS
860 /* If we test an IP address and not a network address,
861 * try all possible network sizes */
862 for (i = 0; i < IPSET_NET_COUNT; i++)
863 if (CIDR(d->cidr, i) != SET_HOST_MASK(set->family))
865 if (i == IPSET_NET_COUNT) {
866 ret = mtype_test_cidrs(set, d, ext, mext, flags);
871 key = HKEY(d, h->initval, t->htable_bits);
873 for (i = 0; i < n->pos; i++) {
874 data = ahash_data(n, i, set->dsize);
875 if (mtype_data_equal(data, d, &multi) &&
876 !(SET_WITH_TIMEOUT(set) &&
877 ip_set_timeout_expired(ext_timeout(data, set)))) {
878 ret = mtype_data_match(data, ext, mext, set, flags);
883 rcu_read_unlock_bh();
887 /* Reply a HEADER request: fill out the header part of the set */
889 mtype_head(struct ip_set *set, struct sk_buff *skb)
891 const struct htype *h = set->data;
892 const struct htable *t;
893 struct nlattr *nested;
896 t = rcu_dereference_bh_nfnl(h->table);
897 memsize = mtype_ahash_memsize(h, t, NLEN(set->family), set->dsize);
899 nested = ipset_nest_start(skb, IPSET_ATTR_DATA);
901 goto nla_put_failure;
902 if (nla_put_net32(skb, IPSET_ATTR_HASHSIZE,
903 htonl(jhash_size(t->htable_bits))) ||
904 nla_put_net32(skb, IPSET_ATTR_MAXELEM, htonl(h->maxelem)))
905 goto nla_put_failure;
906 #ifdef IP_SET_HASH_WITH_NETMASK
907 if (h->netmask != HOST_MASK &&
908 nla_put_u8(skb, IPSET_ATTR_NETMASK, h->netmask))
909 goto nla_put_failure;
911 if (nla_put_net32(skb, IPSET_ATTR_REFERENCES, htonl(set->ref - 1)) ||
912 nla_put_net32(skb, IPSET_ATTR_MEMSIZE, htonl(memsize)))
913 goto nla_put_failure;
914 if (unlikely(ip_set_put_flags(skb, set)))
915 goto nla_put_failure;
916 ipset_nest_end(skb, nested);
923 /* Reply a LIST/SAVE request: dump the elements of the specified set */
925 mtype_list(const struct ip_set *set,
926 struct sk_buff *skb, struct netlink_callback *cb)
928 const struct htype *h = set->data;
929 const struct htable *t = rcu_dereference_bh_nfnl(h->table);
930 struct nlattr *atd, *nested;
931 const struct hbucket *n;
932 const struct mtype_elem *e;
933 u32 first = cb->args[IPSET_CB_ARG0];
934 /* We assume that one hash bucket fills into one page */
938 atd = ipset_nest_start(skb, IPSET_ATTR_ADT);
941 pr_debug("list hash set %s\n", set->name);
942 for (; cb->args[IPSET_CB_ARG0] < jhash_size(t->htable_bits);
943 cb->args[IPSET_CB_ARG0]++) {
944 incomplete = skb_tail_pointer(skb);
945 n = hbucket(t, cb->args[IPSET_CB_ARG0]);
946 pr_debug("cb->arg bucket: %lu, t %p n %p\n",
947 cb->args[IPSET_CB_ARG0], t, n);
948 for (i = 0; i < n->pos; i++) {
949 e = ahash_data(n, i, set->dsize);
950 if (SET_WITH_TIMEOUT(set) &&
951 ip_set_timeout_expired(ext_timeout(e, set)))
953 pr_debug("list hash %lu hbucket %p i %u, data %p\n",
954 cb->args[IPSET_CB_ARG0], n, i, e);
955 nested = ipset_nest_start(skb, IPSET_ATTR_DATA);
957 if (cb->args[IPSET_CB_ARG0] == first) {
958 nla_nest_cancel(skb, atd);
961 goto nla_put_failure;
963 if (mtype_data_list(skb, e))
964 goto nla_put_failure;
965 if (ip_set_put_extensions(skb, set, e, true))
966 goto nla_put_failure;
967 ipset_nest_end(skb, nested);
970 ipset_nest_end(skb, atd);
971 /* Set listing finished */
972 cb->args[IPSET_CB_ARG0] = 0;
977 nlmsg_trim(skb, incomplete);
978 if (unlikely(first == cb->args[IPSET_CB_ARG0])) {
979 pr_warning("Can't list set %s: one bucket does not fit into "
980 "a message. Please report it!\n", set->name);
981 cb->args[IPSET_CB_ARG0] = 0;
984 ipset_nest_end(skb, atd);
989 IPSET_TOKEN(MTYPE, _kadt)(struct ip_set *set, const struct sk_buff *skb,
990 const struct xt_action_param *par,
991 enum ipset_adt adt, struct ip_set_adt_opt *opt);
994 IPSET_TOKEN(MTYPE, _uadt)(struct ip_set *set, struct nlattr *tb[],
995 enum ipset_adt adt, u32 *lineno, u32 flags, bool retried);
997 static const struct ip_set_type_variant mtype_variant = {
1001 [IPSET_ADD] = mtype_add,
1002 [IPSET_DEL] = mtype_del,
1003 [IPSET_TEST] = mtype_test,
1005 .destroy = mtype_destroy,
1006 .flush = mtype_flush,
1009 .resize = mtype_resize,
1010 .same_set = mtype_same_set,
1013 #ifdef IP_SET_EMIT_CREATE
1015 IPSET_TOKEN(HTYPE, _create)(struct net *net, struct ip_set *set,
1016 struct nlattr *tb[], u32 flags)
1018 u32 hashsize = IPSET_DEFAULT_HASHSIZE, maxelem = IPSET_DEFAULT_MAXELEM;
1020 #ifdef IP_SET_HASH_WITH_NETMASK
1027 if (!(set->family == NFPROTO_IPV4 || set->family == NFPROTO_IPV6))
1028 return -IPSET_ERR_INVALID_FAMILY;
1029 #ifdef IP_SET_HASH_WITH_NETMASK
1030 netmask = set->family == NFPROTO_IPV4 ? 32 : 128;
1031 pr_debug("Create set %s with family %s\n",
1032 set->name, set->family == NFPROTO_IPV4 ? "inet" : "inet6");
1035 if (unlikely(!ip_set_optattr_netorder(tb, IPSET_ATTR_HASHSIZE) ||
1036 !ip_set_optattr_netorder(tb, IPSET_ATTR_MAXELEM) ||
1037 !ip_set_optattr_netorder(tb, IPSET_ATTR_TIMEOUT) ||
1038 !ip_set_optattr_netorder(tb, IPSET_ATTR_CADT_FLAGS)))
1039 return -IPSET_ERR_PROTOCOL;
1041 if (tb[IPSET_ATTR_HASHSIZE]) {
1042 hashsize = ip_set_get_h32(tb[IPSET_ATTR_HASHSIZE]);
1043 if (hashsize < IPSET_MIMINAL_HASHSIZE)
1044 hashsize = IPSET_MIMINAL_HASHSIZE;
1047 if (tb[IPSET_ATTR_MAXELEM])
1048 maxelem = ip_set_get_h32(tb[IPSET_ATTR_MAXELEM]);
1050 #ifdef IP_SET_HASH_WITH_NETMASK
1051 if (tb[IPSET_ATTR_NETMASK]) {
1052 netmask = nla_get_u8(tb[IPSET_ATTR_NETMASK]);
1054 if ((set->family == NFPROTO_IPV4 && netmask > 32) ||
1055 (set->family == NFPROTO_IPV6 && netmask > 128) ||
1057 return -IPSET_ERR_INVALID_NETMASK;
1062 #ifdef IP_SET_HASH_WITH_NETS
1063 hsize += sizeof(struct net_prefixes) *
1064 (set->family == NFPROTO_IPV4 ? 32 : 128);
1066 h = kzalloc(hsize, GFP_KERNEL);
1070 h->maxelem = maxelem;
1071 #ifdef IP_SET_HASH_WITH_NETMASK
1072 h->netmask = netmask;
1074 get_random_bytes(&h->initval, sizeof(h->initval));
1075 set->timeout = IPSET_NO_TIMEOUT;
1077 hbits = htable_bits(hashsize);
1078 hsize = htable_size(hbits);
1083 t = ip_set_alloc(hsize);
1088 t->htable_bits = hbits;
1089 rcu_assign_pointer(h->table, t);
1092 if (set->family == NFPROTO_IPV4) {
1093 set->variant = &IPSET_TOKEN(HTYPE, 4_variant);
1094 set->dsize = ip_set_elem_len(set, tb,
1095 sizeof(struct IPSET_TOKEN(HTYPE, 4_elem)));
1097 set->variant = &IPSET_TOKEN(HTYPE, 6_variant);
1098 set->dsize = ip_set_elem_len(set, tb,
1099 sizeof(struct IPSET_TOKEN(HTYPE, 6_elem)));
1101 if (tb[IPSET_ATTR_TIMEOUT]) {
1102 set->timeout = ip_set_timeout_uget(tb[IPSET_ATTR_TIMEOUT]);
1103 if (set->family == NFPROTO_IPV4)
1104 IPSET_TOKEN(HTYPE, 4_gc_init)(set,
1105 IPSET_TOKEN(HTYPE, 4_gc));
1107 IPSET_TOKEN(HTYPE, 6_gc_init)(set,
1108 IPSET_TOKEN(HTYPE, 6_gc));
1111 pr_debug("create %s hashsize %u (%u) maxelem %u: %p(%p)\n",
1112 set->name, jhash_size(t->htable_bits),
1113 t->htable_bits, h->maxelem, set->data, t);
1117 #endif /* IP_SET_EMIT_CREATE */