2 * xt_hashlimit - Netfilter module to limit the number of packets per time
3 * separately for each hashbucket (sourceip/sourceport/dstip/dstport)
5 * (C) 2003-2004 by Harald Welte <laforge@netfilter.org>
6 * Copyright © CC Computer Consultants GmbH, 2007 - 2008
8 * Development of this code was funded by Astaro AG, http://www.astaro.com/
10 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
11 #include <linux/module.h>
12 #include <linux/spinlock.h>
13 #include <linux/random.h>
14 #include <linux/jhash.h>
15 #include <linux/slab.h>
16 #include <linux/vmalloc.h>
17 #include <linux/proc_fs.h>
18 #include <linux/seq_file.h>
19 #include <linux/list.h>
20 #include <linux/skbuff.h>
24 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
25 #include <linux/ipv6.h>
29 #include <net/net_namespace.h>
30 #include <net/netns/generic.h>
32 #include <linux/netfilter/x_tables.h>
33 #include <linux/netfilter_ipv4/ip_tables.h>
34 #include <linux/netfilter_ipv6/ip6_tables.h>
35 #include <linux/netfilter/xt_hashlimit.h>
36 #include <linux/mutex.h>
38 MODULE_LICENSE("GPL");
39 MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
40 MODULE_AUTHOR("Jan Engelhardt <jengelh@medozas.de>");
41 MODULE_DESCRIPTION("Xtables: per hash-bucket rate-limit match");
42 MODULE_ALIAS("ipt_hashlimit");
43 MODULE_ALIAS("ip6t_hashlimit");
45 struct hashlimit_net {
46 struct hlist_head htables;
47 struct proc_dir_entry *ipt_hashlimit;
48 struct proc_dir_entry *ip6t_hashlimit;
51 static int hashlimit_net_id;
52 static inline struct hashlimit_net *hashlimit_pernet(struct net *net)
54 return net_generic(net, hashlimit_net_id);
57 /* need to declare this at the top */
58 static const struct file_operations dl_file_ops;
67 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
79 /* static / read-only parts in the beginning */
80 struct hlist_node node;
81 struct dsthash_dst dst;
83 /* modified structure members in the end */
85 unsigned long expires; /* precalculated expiry time */
87 unsigned long prev; /* last modification */
89 u_int32_t credit_cap, cost;
94 struct xt_hashlimit_htable {
95 struct hlist_node node; /* global list of all htables */
100 struct hashlimit_cfg1 cfg; /* config */
102 /* used internally */
103 spinlock_t lock; /* lock for list_head */
104 u_int32_t rnd; /* random seed for hash */
105 unsigned int count; /* number entries in table */
106 struct timer_list timer; /* timer for gc */
109 struct proc_dir_entry *pde;
112 struct hlist_head hash[0]; /* hashtable itself */
115 static DEFINE_MUTEX(hashlimit_mutex); /* protects htables list */
116 static struct kmem_cache *hashlimit_cachep __read_mostly;
118 static inline bool dst_cmp(const struct dsthash_ent *ent,
119 const struct dsthash_dst *b)
121 return !memcmp(&ent->dst, b, sizeof(ent->dst));
125 hash_dst(const struct xt_hashlimit_htable *ht, const struct dsthash_dst *dst)
127 u_int32_t hash = jhash2((const u32 *)dst,
128 sizeof(*dst)/sizeof(u32),
131 * Instead of returning hash % ht->cfg.size (implying a divide)
132 * we return the high 32 bits of the (hash * ht->cfg.size) that will
133 * give results between [0 and cfg.size-1] and same hash distribution,
134 * but using a multiply, less expensive than a divide
136 return ((u64)hash * ht->cfg.size) >> 32;
139 static struct dsthash_ent *
140 dsthash_find(const struct xt_hashlimit_htable *ht,
141 const struct dsthash_dst *dst)
143 struct dsthash_ent *ent;
144 struct hlist_node *pos;
145 u_int32_t hash = hash_dst(ht, dst);
147 if (!hlist_empty(&ht->hash[hash])) {
148 hlist_for_each_entry_rcu(ent, pos, &ht->hash[hash], node)
149 if (dst_cmp(ent, dst)) {
150 spin_lock(&ent->lock);
157 /* allocate dsthash_ent, initialize dst, put in htable and lock it */
158 static struct dsthash_ent *
159 dsthash_alloc_init(struct xt_hashlimit_htable *ht,
160 const struct dsthash_dst *dst)
162 struct dsthash_ent *ent;
164 spin_lock(&ht->lock);
165 /* initialize hash with random val at the time we allocate
166 * the first hashtable entry */
167 if (unlikely(!ht->rnd_initialized)) {
168 get_random_bytes(&ht->rnd, sizeof(ht->rnd));
169 ht->rnd_initialized = true;
172 if (ht->cfg.max && ht->count >= ht->cfg.max) {
173 /* FIXME: do something. question is what.. */
175 pr_err("max count of %u reached\n", ht->cfg.max);
178 ent = kmem_cache_alloc(hashlimit_cachep, GFP_ATOMIC);
181 pr_err("cannot allocate dsthash_ent\n");
183 memcpy(&ent->dst, dst, sizeof(ent->dst));
184 spin_lock_init(&ent->lock);
186 spin_lock(&ent->lock);
187 hlist_add_head_rcu(&ent->node, &ht->hash[hash_dst(ht, dst)]);
190 spin_unlock(&ht->lock);
194 static void dsthash_free_rcu(struct rcu_head *head)
196 struct dsthash_ent *ent = container_of(head, struct dsthash_ent, rcu);
198 kmem_cache_free(hashlimit_cachep, ent);
202 dsthash_free(struct xt_hashlimit_htable *ht, struct dsthash_ent *ent)
204 hlist_del_rcu(&ent->node);
205 call_rcu_bh(&ent->rcu, dsthash_free_rcu);
208 static void htable_gc(unsigned long htlong);
210 static int htable_create(struct net *net, struct xt_hashlimit_mtinfo1 *minfo,
213 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
214 struct xt_hashlimit_htable *hinfo;
218 if (minfo->cfg.size) {
219 size = minfo->cfg.size;
221 size = (totalram_pages << PAGE_SHIFT) / 16384 /
222 sizeof(struct list_head);
223 if (totalram_pages > 1024 * 1024 * 1024 / PAGE_SIZE)
228 /* FIXME: don't use vmalloc() here or anywhere else -HW */
229 hinfo = vmalloc(sizeof(struct xt_hashlimit_htable) +
230 sizeof(struct list_head) * size);
233 minfo->hinfo = hinfo;
235 /* copy match config into hashtable config */
236 memcpy(&hinfo->cfg, &minfo->cfg, sizeof(hinfo->cfg));
237 hinfo->cfg.size = size;
238 if (hinfo->cfg.max == 0)
239 hinfo->cfg.max = 8 * hinfo->cfg.size;
240 else if (hinfo->cfg.max < hinfo->cfg.size)
241 hinfo->cfg.max = hinfo->cfg.size;
243 for (i = 0; i < hinfo->cfg.size; i++)
244 INIT_HLIST_HEAD(&hinfo->hash[i]);
248 hinfo->family = family;
249 hinfo->rnd_initialized = false;
250 spin_lock_init(&hinfo->lock);
252 hinfo->pde = proc_create_data(minfo->name, 0,
253 (family == NFPROTO_IPV4) ?
254 hashlimit_net->ipt_hashlimit : hashlimit_net->ip6t_hashlimit,
255 &dl_file_ops, hinfo);
256 if (hinfo->pde == NULL) {
262 setup_timer(&hinfo->timer, htable_gc, (unsigned long)hinfo);
263 hinfo->timer.expires = jiffies + msecs_to_jiffies(hinfo->cfg.gc_interval);
264 add_timer(&hinfo->timer);
266 hlist_add_head(&hinfo->node, &hashlimit_net->htables);
271 static bool select_all(const struct xt_hashlimit_htable *ht,
272 const struct dsthash_ent *he)
277 static bool select_gc(const struct xt_hashlimit_htable *ht,
278 const struct dsthash_ent *he)
280 return time_after_eq(jiffies, he->expires);
283 static void htable_selective_cleanup(struct xt_hashlimit_htable *ht,
284 bool (*select)(const struct xt_hashlimit_htable *ht,
285 const struct dsthash_ent *he))
289 /* lock hash table and iterate over it */
290 spin_lock_bh(&ht->lock);
291 for (i = 0; i < ht->cfg.size; i++) {
292 struct dsthash_ent *dh;
293 struct hlist_node *pos, *n;
294 hlist_for_each_entry_safe(dh, pos, n, &ht->hash[i], node) {
295 if ((*select)(ht, dh))
296 dsthash_free(ht, dh);
299 spin_unlock_bh(&ht->lock);
302 /* hash table garbage collector, run by timer */
303 static void htable_gc(unsigned long htlong)
305 struct xt_hashlimit_htable *ht = (struct xt_hashlimit_htable *)htlong;
307 htable_selective_cleanup(ht, select_gc);
309 /* re-add the timer accordingly */
310 ht->timer.expires = jiffies + msecs_to_jiffies(ht->cfg.gc_interval);
311 add_timer(&ht->timer);
314 static void htable_destroy(struct xt_hashlimit_htable *hinfo)
316 struct hashlimit_net *hashlimit_net = hashlimit_pernet(hinfo->net);
317 struct proc_dir_entry *parent;
319 del_timer_sync(&hinfo->timer);
321 if (hinfo->family == NFPROTO_IPV4)
322 parent = hashlimit_net->ipt_hashlimit;
324 parent = hashlimit_net->ip6t_hashlimit;
325 remove_proc_entry(hinfo->pde->name, parent);
326 htable_selective_cleanup(hinfo, select_all);
330 static struct xt_hashlimit_htable *htable_find_get(struct net *net,
334 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
335 struct xt_hashlimit_htable *hinfo;
336 struct hlist_node *pos;
338 hlist_for_each_entry(hinfo, pos, &hashlimit_net->htables, node) {
339 if (!strcmp(name, hinfo->pde->name) &&
340 hinfo->family == family) {
348 static void htable_put(struct xt_hashlimit_htable *hinfo)
350 mutex_lock(&hashlimit_mutex);
351 if (--hinfo->use == 0) {
352 hlist_del(&hinfo->node);
353 htable_destroy(hinfo);
355 mutex_unlock(&hashlimit_mutex);
358 /* The algorithm used is the Simple Token Bucket Filter (TBF)
359 * see net/sched/sch_tbf.c in the linux source tree
362 /* Rusty: This is my (non-mathematically-inclined) understanding of
363 this algorithm. The `average rate' in jiffies becomes your initial
364 amount of credit `credit' and the most credit you can ever have
365 `credit_cap'. The `peak rate' becomes the cost of passing the
368 `prev' tracks the last packet hit: you gain one credit per jiffy.
369 If you get credit balance more than this, the extra credit is
370 discarded. Every time the match passes, you lose `cost' credits;
371 if you don't have that many, the test fails.
373 See Alexey's formal explanation in net/sched/sch_tbf.c.
375 To get the maximum range, we multiply by this factor (ie. you get N
376 credits per jiffy). We want to allow a rate as low as 1 per day
377 (slowest userspace tool allows), which means
378 CREDITS_PER_JIFFY*HZ*60*60*24 < 2^32 ie.
380 #define MAX_CPJ (0xFFFFFFFF / (HZ*60*60*24))
382 /* Repeated shift and or gives us all 1s, final shift and add 1 gives
383 * us the power of 2 below the theoretical max, so GCC simply does a
385 #define _POW2_BELOW2(x) ((x)|((x)>>1))
386 #define _POW2_BELOW4(x) (_POW2_BELOW2(x)|_POW2_BELOW2((x)>>2))
387 #define _POW2_BELOW8(x) (_POW2_BELOW4(x)|_POW2_BELOW4((x)>>4))
388 #define _POW2_BELOW16(x) (_POW2_BELOW8(x)|_POW2_BELOW8((x)>>8))
389 #define _POW2_BELOW32(x) (_POW2_BELOW16(x)|_POW2_BELOW16((x)>>16))
390 #define POW2_BELOW32(x) ((_POW2_BELOW32(x)>>1) + 1)
392 #define CREDITS_PER_JIFFY POW2_BELOW32(MAX_CPJ)
394 /* Precision saver. */
395 static inline u_int32_t
396 user2credits(u_int32_t user)
398 /* If multiplying would overflow... */
399 if (user > 0xFFFFFFFF / (HZ*CREDITS_PER_JIFFY))
401 return (user / XT_HASHLIMIT_SCALE) * HZ * CREDITS_PER_JIFFY;
403 return (user * HZ * CREDITS_PER_JIFFY) / XT_HASHLIMIT_SCALE;
406 static inline void rateinfo_recalc(struct dsthash_ent *dh, unsigned long now)
408 dh->rateinfo.credit += (now - dh->rateinfo.prev) * CREDITS_PER_JIFFY;
409 if (dh->rateinfo.credit > dh->rateinfo.credit_cap)
410 dh->rateinfo.credit = dh->rateinfo.credit_cap;
411 dh->rateinfo.prev = now;
414 static inline __be32 maskl(__be32 a, unsigned int l)
416 return l ? htonl(ntohl(a) & ~0 << (32 - l)) : 0;
419 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
420 static void hashlimit_ipv6_mask(__be32 *i, unsigned int p)
424 i[0] = maskl(i[0], p);
425 i[1] = i[2] = i[3] = 0;
428 i[1] = maskl(i[1], p - 32);
432 i[2] = maskl(i[2], p - 64);
436 i[3] = maskl(i[3], p - 96);
445 hashlimit_init_dst(const struct xt_hashlimit_htable *hinfo,
446 struct dsthash_dst *dst,
447 const struct sk_buff *skb, unsigned int protoff)
449 __be16 _ports[2], *ports;
452 memset(dst, 0, sizeof(*dst));
454 switch (hinfo->family) {
456 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DIP)
457 dst->ip.dst = maskl(ip_hdr(skb)->daddr,
459 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SIP)
460 dst->ip.src = maskl(ip_hdr(skb)->saddr,
463 if (!(hinfo->cfg.mode &
464 (XT_HASHLIMIT_HASH_DPT | XT_HASHLIMIT_HASH_SPT)))
466 nexthdr = ip_hdr(skb)->protocol;
468 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
470 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DIP) {
471 memcpy(&dst->ip6.dst, &ipv6_hdr(skb)->daddr,
472 sizeof(dst->ip6.dst));
473 hashlimit_ipv6_mask(dst->ip6.dst, hinfo->cfg.dstmask);
475 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SIP) {
476 memcpy(&dst->ip6.src, &ipv6_hdr(skb)->saddr,
477 sizeof(dst->ip6.src));
478 hashlimit_ipv6_mask(dst->ip6.src, hinfo->cfg.srcmask);
481 if (!(hinfo->cfg.mode &
482 (XT_HASHLIMIT_HASH_DPT | XT_HASHLIMIT_HASH_SPT)))
484 nexthdr = ipv6_hdr(skb)->nexthdr;
485 protoff = ipv6_skip_exthdr(skb, sizeof(struct ipv6hdr), &nexthdr);
486 if ((int)protoff < 0)
498 case IPPROTO_UDPLITE:
501 ports = skb_header_pointer(skb, protoff, sizeof(_ports),
505 _ports[0] = _ports[1] = 0;
511 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SPT)
512 dst->src_port = ports[0];
513 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DPT)
514 dst->dst_port = ports[1];
519 hashlimit_mt(const struct sk_buff *skb, struct xt_action_param *par)
521 const struct xt_hashlimit_mtinfo1 *info = par->matchinfo;
522 struct xt_hashlimit_htable *hinfo = info->hinfo;
523 unsigned long now = jiffies;
524 struct dsthash_ent *dh;
525 struct dsthash_dst dst;
527 if (hashlimit_init_dst(hinfo, &dst, skb, par->thoff) < 0)
531 dh = dsthash_find(hinfo, &dst);
533 dh = dsthash_alloc_init(hinfo, &dst);
535 rcu_read_unlock_bh();
538 dh->expires = jiffies + msecs_to_jiffies(hinfo->cfg.expire);
539 dh->rateinfo.prev = jiffies;
540 dh->rateinfo.credit = user2credits(hinfo->cfg.avg *
542 dh->rateinfo.credit_cap = user2credits(hinfo->cfg.avg *
544 dh->rateinfo.cost = user2credits(hinfo->cfg.avg);
546 /* update expiration timeout */
547 dh->expires = now + msecs_to_jiffies(hinfo->cfg.expire);
548 rateinfo_recalc(dh, now);
551 if (dh->rateinfo.credit >= dh->rateinfo.cost) {
552 /* below the limit */
553 dh->rateinfo.credit -= dh->rateinfo.cost;
554 spin_unlock(&dh->lock);
555 rcu_read_unlock_bh();
556 return !(info->cfg.mode & XT_HASHLIMIT_INVERT);
559 spin_unlock(&dh->lock);
560 rcu_read_unlock_bh();
561 /* default match is underlimit - so over the limit, we need to invert */
562 return info->cfg.mode & XT_HASHLIMIT_INVERT;
569 static int hashlimit_mt_check(const struct xt_mtchk_param *par)
571 struct net *net = par->net;
572 struct xt_hashlimit_mtinfo1 *info = par->matchinfo;
575 /* Check for overflow. */
576 if (info->cfg.burst == 0 ||
577 user2credits(info->cfg.avg * info->cfg.burst) <
578 user2credits(info->cfg.avg)) {
579 pr_info("overflow, try lower: %u/%u\n",
580 info->cfg.avg, info->cfg.burst);
583 if (info->cfg.gc_interval == 0 || info->cfg.expire == 0)
585 if (info->name[sizeof(info->name)-1] != '\0')
587 if (par->family == NFPROTO_IPV4) {
588 if (info->cfg.srcmask > 32 || info->cfg.dstmask > 32)
591 if (info->cfg.srcmask > 128 || info->cfg.dstmask > 128)
595 mutex_lock(&hashlimit_mutex);
596 info->hinfo = htable_find_get(net, info->name, par->family);
597 if (info->hinfo == NULL) {
598 ret = htable_create(net, info, par->family);
600 mutex_unlock(&hashlimit_mutex);
604 mutex_unlock(&hashlimit_mutex);
608 static void hashlimit_mt_destroy(const struct xt_mtdtor_param *par)
610 const struct xt_hashlimit_mtinfo1 *info = par->matchinfo;
612 htable_put(info->hinfo);
615 static struct xt_match hashlimit_mt_reg[] __read_mostly = {
619 .family = NFPROTO_IPV4,
620 .match = hashlimit_mt,
621 .matchsize = sizeof(struct xt_hashlimit_mtinfo1),
622 .checkentry = hashlimit_mt_check,
623 .destroy = hashlimit_mt_destroy,
626 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
630 .family = NFPROTO_IPV6,
631 .match = hashlimit_mt,
632 .matchsize = sizeof(struct xt_hashlimit_mtinfo1),
633 .checkentry = hashlimit_mt_check,
634 .destroy = hashlimit_mt_destroy,
641 static void *dl_seq_start(struct seq_file *s, loff_t *pos)
642 __acquires(htable->lock)
644 struct xt_hashlimit_htable *htable = s->private;
645 unsigned int *bucket;
647 spin_lock_bh(&htable->lock);
648 if (*pos >= htable->cfg.size)
651 bucket = kmalloc(sizeof(unsigned int), GFP_ATOMIC);
653 return ERR_PTR(-ENOMEM);
659 static void *dl_seq_next(struct seq_file *s, void *v, loff_t *pos)
661 struct xt_hashlimit_htable *htable = s->private;
662 unsigned int *bucket = (unsigned int *)v;
665 if (*pos >= htable->cfg.size) {
672 static void dl_seq_stop(struct seq_file *s, void *v)
673 __releases(htable->lock)
675 struct xt_hashlimit_htable *htable = s->private;
676 unsigned int *bucket = (unsigned int *)v;
680 spin_unlock_bh(&htable->lock);
683 static int dl_seq_real_show(struct dsthash_ent *ent, u_int8_t family,
688 spin_lock(&ent->lock);
689 /* recalculate to show accurate numbers */
690 rateinfo_recalc(ent, jiffies);
694 res = seq_printf(s, "%ld %pI4:%u->%pI4:%u %u %u %u\n",
695 (long)(ent->expires - jiffies)/HZ,
697 ntohs(ent->dst.src_port),
699 ntohs(ent->dst.dst_port),
700 ent->rateinfo.credit, ent->rateinfo.credit_cap,
703 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
705 res = seq_printf(s, "%ld %pI6:%u->%pI6:%u %u %u %u\n",
706 (long)(ent->expires - jiffies)/HZ,
708 ntohs(ent->dst.src_port),
710 ntohs(ent->dst.dst_port),
711 ent->rateinfo.credit, ent->rateinfo.credit_cap,
719 spin_unlock(&ent->lock);
723 static int dl_seq_show(struct seq_file *s, void *v)
725 struct xt_hashlimit_htable *htable = s->private;
726 unsigned int *bucket = (unsigned int *)v;
727 struct dsthash_ent *ent;
728 struct hlist_node *pos;
730 if (!hlist_empty(&htable->hash[*bucket])) {
731 hlist_for_each_entry(ent, pos, &htable->hash[*bucket], node)
732 if (dl_seq_real_show(ent, htable->family, s))
738 static const struct seq_operations dl_seq_ops = {
739 .start = dl_seq_start,
745 static int dl_proc_open(struct inode *inode, struct file *file)
747 int ret = seq_open(file, &dl_seq_ops);
750 struct seq_file *sf = file->private_data;
751 sf->private = PDE(inode)->data;
756 static const struct file_operations dl_file_ops = {
757 .owner = THIS_MODULE,
758 .open = dl_proc_open,
761 .release = seq_release
764 static int __net_init hashlimit_proc_net_init(struct net *net)
766 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
768 hashlimit_net->ipt_hashlimit = proc_mkdir("ipt_hashlimit", net->proc_net);
769 if (!hashlimit_net->ipt_hashlimit)
771 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
772 hashlimit_net->ip6t_hashlimit = proc_mkdir("ip6t_hashlimit", net->proc_net);
773 if (!hashlimit_net->ip6t_hashlimit) {
774 proc_net_remove(net, "ipt_hashlimit");
781 static void __net_exit hashlimit_proc_net_exit(struct net *net)
783 proc_net_remove(net, "ipt_hashlimit");
784 #if defined(CONFIG_IP6_NF_IPTABLES) || defined(CONFIG_IP6_NF_IPTABLES_MODULE)
785 proc_net_remove(net, "ip6t_hashlimit");
789 static int __net_init hashlimit_net_init(struct net *net)
791 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
793 INIT_HLIST_HEAD(&hashlimit_net->htables);
794 return hashlimit_proc_net_init(net);
797 static void __net_exit hashlimit_net_exit(struct net *net)
799 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
801 BUG_ON(!hlist_empty(&hashlimit_net->htables));
802 hashlimit_proc_net_exit(net);
805 static struct pernet_operations hashlimit_net_ops = {
806 .init = hashlimit_net_init,
807 .exit = hashlimit_net_exit,
808 .id = &hashlimit_net_id,
809 .size = sizeof(struct hashlimit_net),
812 static int __init hashlimit_mt_init(void)
816 err = register_pernet_subsys(&hashlimit_net_ops);
819 err = xt_register_matches(hashlimit_mt_reg,
820 ARRAY_SIZE(hashlimit_mt_reg));
825 hashlimit_cachep = kmem_cache_create("xt_hashlimit",
826 sizeof(struct dsthash_ent), 0, 0,
828 if (!hashlimit_cachep) {
829 pr_warning("unable to create slab cache\n");
835 xt_unregister_matches(hashlimit_mt_reg, ARRAY_SIZE(hashlimit_mt_reg));
837 unregister_pernet_subsys(&hashlimit_net_ops);
842 static void __exit hashlimit_mt_exit(void)
844 xt_unregister_matches(hashlimit_mt_reg, ARRAY_SIZE(hashlimit_mt_reg));
845 unregister_pernet_subsys(&hashlimit_net_ops);
848 kmem_cache_destroy(hashlimit_cachep);
851 module_init(hashlimit_mt_init);
852 module_exit(hashlimit_mt_exit);