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 IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
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 IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
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.. */
174 net_err_ratelimited("max count of %u reached\n", ht->cfg.max);
177 ent = kmem_cache_alloc(hashlimit_cachep, GFP_ATOMIC);
179 memcpy(&ent->dst, dst, sizeof(ent->dst));
180 spin_lock_init(&ent->lock);
182 spin_lock(&ent->lock);
183 hlist_add_head_rcu(&ent->node, &ht->hash[hash_dst(ht, dst)]);
186 spin_unlock(&ht->lock);
190 static void dsthash_free_rcu(struct rcu_head *head)
192 struct dsthash_ent *ent = container_of(head, struct dsthash_ent, rcu);
194 kmem_cache_free(hashlimit_cachep, ent);
198 dsthash_free(struct xt_hashlimit_htable *ht, struct dsthash_ent *ent)
200 hlist_del_rcu(&ent->node);
201 call_rcu_bh(&ent->rcu, dsthash_free_rcu);
204 static void htable_gc(unsigned long htlong);
206 static int htable_create(struct net *net, struct xt_hashlimit_mtinfo1 *minfo,
209 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
210 struct xt_hashlimit_htable *hinfo;
214 if (minfo->cfg.size) {
215 size = minfo->cfg.size;
217 size = (totalram_pages << PAGE_SHIFT) / 16384 /
218 sizeof(struct list_head);
219 if (totalram_pages > 1024 * 1024 * 1024 / PAGE_SIZE)
224 /* FIXME: don't use vmalloc() here or anywhere else -HW */
225 hinfo = vmalloc(sizeof(struct xt_hashlimit_htable) +
226 sizeof(struct list_head) * size);
229 minfo->hinfo = hinfo;
231 /* copy match config into hashtable config */
232 memcpy(&hinfo->cfg, &minfo->cfg, sizeof(hinfo->cfg));
233 hinfo->cfg.size = size;
234 if (hinfo->cfg.max == 0)
235 hinfo->cfg.max = 8 * hinfo->cfg.size;
236 else if (hinfo->cfg.max < hinfo->cfg.size)
237 hinfo->cfg.max = hinfo->cfg.size;
239 for (i = 0; i < hinfo->cfg.size; i++)
240 INIT_HLIST_HEAD(&hinfo->hash[i]);
244 hinfo->family = family;
245 hinfo->rnd_initialized = false;
246 spin_lock_init(&hinfo->lock);
248 hinfo->pde = proc_create_data(minfo->name, 0,
249 (family == NFPROTO_IPV4) ?
250 hashlimit_net->ipt_hashlimit : hashlimit_net->ip6t_hashlimit,
251 &dl_file_ops, hinfo);
252 if (hinfo->pde == NULL) {
258 setup_timer(&hinfo->timer, htable_gc, (unsigned long)hinfo);
259 hinfo->timer.expires = jiffies + msecs_to_jiffies(hinfo->cfg.gc_interval);
260 add_timer(&hinfo->timer);
262 hlist_add_head(&hinfo->node, &hashlimit_net->htables);
267 static bool select_all(const struct xt_hashlimit_htable *ht,
268 const struct dsthash_ent *he)
273 static bool select_gc(const struct xt_hashlimit_htable *ht,
274 const struct dsthash_ent *he)
276 return time_after_eq(jiffies, he->expires);
279 static void htable_selective_cleanup(struct xt_hashlimit_htable *ht,
280 bool (*select)(const struct xt_hashlimit_htable *ht,
281 const struct dsthash_ent *he))
285 /* lock hash table and iterate over it */
286 spin_lock_bh(&ht->lock);
287 for (i = 0; i < ht->cfg.size; i++) {
288 struct dsthash_ent *dh;
289 struct hlist_node *pos, *n;
290 hlist_for_each_entry_safe(dh, pos, n, &ht->hash[i], node) {
291 if ((*select)(ht, dh))
292 dsthash_free(ht, dh);
295 spin_unlock_bh(&ht->lock);
298 /* hash table garbage collector, run by timer */
299 static void htable_gc(unsigned long htlong)
301 struct xt_hashlimit_htable *ht = (struct xt_hashlimit_htable *)htlong;
303 htable_selective_cleanup(ht, select_gc);
305 /* re-add the timer accordingly */
306 ht->timer.expires = jiffies + msecs_to_jiffies(ht->cfg.gc_interval);
307 add_timer(&ht->timer);
310 static void htable_destroy(struct xt_hashlimit_htable *hinfo)
312 struct hashlimit_net *hashlimit_net = hashlimit_pernet(hinfo->net);
313 struct proc_dir_entry *parent;
315 del_timer_sync(&hinfo->timer);
317 if (hinfo->family == NFPROTO_IPV4)
318 parent = hashlimit_net->ipt_hashlimit;
320 parent = hashlimit_net->ip6t_hashlimit;
321 remove_proc_entry(hinfo->pde->name, parent);
322 htable_selective_cleanup(hinfo, select_all);
326 static struct xt_hashlimit_htable *htable_find_get(struct net *net,
330 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
331 struct xt_hashlimit_htable *hinfo;
332 struct hlist_node *pos;
334 hlist_for_each_entry(hinfo, pos, &hashlimit_net->htables, node) {
335 if (!strcmp(name, hinfo->pde->name) &&
336 hinfo->family == family) {
344 static void htable_put(struct xt_hashlimit_htable *hinfo)
346 mutex_lock(&hashlimit_mutex);
347 if (--hinfo->use == 0) {
348 hlist_del(&hinfo->node);
349 htable_destroy(hinfo);
351 mutex_unlock(&hashlimit_mutex);
354 /* The algorithm used is the Simple Token Bucket Filter (TBF)
355 * see net/sched/sch_tbf.c in the linux source tree
358 /* Rusty: This is my (non-mathematically-inclined) understanding of
359 this algorithm. The `average rate' in jiffies becomes your initial
360 amount of credit `credit' and the most credit you can ever have
361 `credit_cap'. The `peak rate' becomes the cost of passing the
364 `prev' tracks the last packet hit: you gain one credit per jiffy.
365 If you get credit balance more than this, the extra credit is
366 discarded. Every time the match passes, you lose `cost' credits;
367 if you don't have that many, the test fails.
369 See Alexey's formal explanation in net/sched/sch_tbf.c.
371 To get the maximum range, we multiply by this factor (ie. you get N
372 credits per jiffy). We want to allow a rate as low as 1 per day
373 (slowest userspace tool allows), which means
374 CREDITS_PER_JIFFY*HZ*60*60*24 < 2^32 ie.
376 #define MAX_CPJ (0xFFFFFFFF / (HZ*60*60*24))
378 /* Repeated shift and or gives us all 1s, final shift and add 1 gives
379 * us the power of 2 below the theoretical max, so GCC simply does a
381 #define _POW2_BELOW2(x) ((x)|((x)>>1))
382 #define _POW2_BELOW4(x) (_POW2_BELOW2(x)|_POW2_BELOW2((x)>>2))
383 #define _POW2_BELOW8(x) (_POW2_BELOW4(x)|_POW2_BELOW4((x)>>4))
384 #define _POW2_BELOW16(x) (_POW2_BELOW8(x)|_POW2_BELOW8((x)>>8))
385 #define _POW2_BELOW32(x) (_POW2_BELOW16(x)|_POW2_BELOW16((x)>>16))
386 #define POW2_BELOW32(x) ((_POW2_BELOW32(x)>>1) + 1)
388 #define CREDITS_PER_JIFFY POW2_BELOW32(MAX_CPJ)
390 /* in byte mode, the lowest possible rate is one packet/second.
391 * credit_cap is used as a counter that tells us how many times we can
392 * refill the "credits available" counter when it becomes empty.
394 #define MAX_CPJ_BYTES (0xFFFFFFFF / HZ)
395 #define CREDITS_PER_JIFFY_BYTES POW2_BELOW32(MAX_CPJ_BYTES)
397 static u32 xt_hashlimit_len_to_chunks(u32 len)
399 return (len >> XT_HASHLIMIT_BYTE_SHIFT) + 1;
402 /* Precision saver. */
403 static u32 user2credits(u32 user)
405 /* If multiplying would overflow... */
406 if (user > 0xFFFFFFFF / (HZ*CREDITS_PER_JIFFY))
408 return (user / XT_HASHLIMIT_SCALE) * HZ * CREDITS_PER_JIFFY;
410 return (user * HZ * CREDITS_PER_JIFFY) / XT_HASHLIMIT_SCALE;
413 static u32 user2credits_byte(u32 user)
416 us *= HZ * CREDITS_PER_JIFFY_BYTES;
417 return (u32) (us >> 32);
420 static void rateinfo_recalc(struct dsthash_ent *dh, unsigned long now, u32 mode)
422 unsigned long delta = now - dh->rateinfo.prev;
428 dh->rateinfo.prev = now;
430 if (mode & XT_HASHLIMIT_BYTES) {
431 u32 tmp = dh->rateinfo.credit;
432 dh->rateinfo.credit += CREDITS_PER_JIFFY_BYTES * delta;
433 cap = CREDITS_PER_JIFFY_BYTES * HZ;
434 if (tmp >= dh->rateinfo.credit) {/* overflow */
435 dh->rateinfo.credit = cap;
439 dh->rateinfo.credit += delta * CREDITS_PER_JIFFY;
440 cap = dh->rateinfo.credit_cap;
442 if (dh->rateinfo.credit > cap)
443 dh->rateinfo.credit = cap;
446 static void rateinfo_init(struct dsthash_ent *dh,
447 struct xt_hashlimit_htable *hinfo)
449 dh->rateinfo.prev = jiffies;
450 if (hinfo->cfg.mode & XT_HASHLIMIT_BYTES) {
451 dh->rateinfo.credit = CREDITS_PER_JIFFY_BYTES * HZ;
452 dh->rateinfo.cost = user2credits_byte(hinfo->cfg.avg);
453 dh->rateinfo.credit_cap = hinfo->cfg.burst;
455 dh->rateinfo.credit = user2credits(hinfo->cfg.avg *
457 dh->rateinfo.cost = user2credits(hinfo->cfg.avg);
458 dh->rateinfo.credit_cap = dh->rateinfo.credit;
462 static inline __be32 maskl(__be32 a, unsigned int l)
464 return l ? htonl(ntohl(a) & ~0 << (32 - l)) : 0;
467 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
468 static void hashlimit_ipv6_mask(__be32 *i, unsigned int p)
472 i[0] = maskl(i[0], p);
473 i[1] = i[2] = i[3] = 0;
476 i[1] = maskl(i[1], p - 32);
480 i[2] = maskl(i[2], p - 64);
484 i[3] = maskl(i[3], p - 96);
493 hashlimit_init_dst(const struct xt_hashlimit_htable *hinfo,
494 struct dsthash_dst *dst,
495 const struct sk_buff *skb, unsigned int protoff)
497 __be16 _ports[2], *ports;
501 memset(dst, 0, sizeof(*dst));
503 switch (hinfo->family) {
505 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DIP)
506 dst->ip.dst = maskl(ip_hdr(skb)->daddr,
508 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SIP)
509 dst->ip.src = maskl(ip_hdr(skb)->saddr,
512 if (!(hinfo->cfg.mode &
513 (XT_HASHLIMIT_HASH_DPT | XT_HASHLIMIT_HASH_SPT)))
515 nexthdr = ip_hdr(skb)->protocol;
517 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
522 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DIP) {
523 memcpy(&dst->ip6.dst, &ipv6_hdr(skb)->daddr,
524 sizeof(dst->ip6.dst));
525 hashlimit_ipv6_mask(dst->ip6.dst, hinfo->cfg.dstmask);
527 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SIP) {
528 memcpy(&dst->ip6.src, &ipv6_hdr(skb)->saddr,
529 sizeof(dst->ip6.src));
530 hashlimit_ipv6_mask(dst->ip6.src, hinfo->cfg.srcmask);
533 if (!(hinfo->cfg.mode &
534 (XT_HASHLIMIT_HASH_DPT | XT_HASHLIMIT_HASH_SPT)))
536 nexthdr = ipv6_hdr(skb)->nexthdr;
537 protoff = ipv6_skip_exthdr(skb, sizeof(struct ipv6hdr), &nexthdr, &frag_off);
538 if ((int)protoff < 0)
548 poff = proto_ports_offset(nexthdr);
550 ports = skb_header_pointer(skb, protoff + poff, sizeof(_ports),
553 _ports[0] = _ports[1] = 0;
558 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_SPT)
559 dst->src_port = ports[0];
560 if (hinfo->cfg.mode & XT_HASHLIMIT_HASH_DPT)
561 dst->dst_port = ports[1];
565 static u32 hashlimit_byte_cost(unsigned int len, struct dsthash_ent *dh)
567 u64 tmp = xt_hashlimit_len_to_chunks(len);
568 tmp = tmp * dh->rateinfo.cost;
570 if (unlikely(tmp > CREDITS_PER_JIFFY_BYTES * HZ))
571 tmp = CREDITS_PER_JIFFY_BYTES * HZ;
573 if (dh->rateinfo.credit < tmp && dh->rateinfo.credit_cap) {
574 dh->rateinfo.credit_cap--;
575 dh->rateinfo.credit = CREDITS_PER_JIFFY_BYTES * HZ;
581 hashlimit_mt(const struct sk_buff *skb, struct xt_action_param *par)
583 const struct xt_hashlimit_mtinfo1 *info = par->matchinfo;
584 struct xt_hashlimit_htable *hinfo = info->hinfo;
585 unsigned long now = jiffies;
586 struct dsthash_ent *dh;
587 struct dsthash_dst dst;
590 if (hashlimit_init_dst(hinfo, &dst, skb, par->thoff) < 0)
594 dh = dsthash_find(hinfo, &dst);
596 dh = dsthash_alloc_init(hinfo, &dst);
598 rcu_read_unlock_bh();
601 dh->expires = jiffies + msecs_to_jiffies(hinfo->cfg.expire);
602 rateinfo_init(dh, hinfo);
604 /* update expiration timeout */
605 dh->expires = now + msecs_to_jiffies(hinfo->cfg.expire);
606 rateinfo_recalc(dh, now, hinfo->cfg.mode);
609 if (info->cfg.mode & XT_HASHLIMIT_BYTES)
610 cost = hashlimit_byte_cost(skb->len, dh);
612 cost = dh->rateinfo.cost;
614 if (dh->rateinfo.credit >= cost) {
615 /* below the limit */
616 dh->rateinfo.credit -= cost;
617 spin_unlock(&dh->lock);
618 rcu_read_unlock_bh();
619 return !(info->cfg.mode & XT_HASHLIMIT_INVERT);
622 spin_unlock(&dh->lock);
623 rcu_read_unlock_bh();
624 /* default match is underlimit - so over the limit, we need to invert */
625 return info->cfg.mode & XT_HASHLIMIT_INVERT;
632 static int hashlimit_mt_check(const struct xt_mtchk_param *par)
634 struct net *net = par->net;
635 struct xt_hashlimit_mtinfo1 *info = par->matchinfo;
638 if (info->cfg.gc_interval == 0 || info->cfg.expire == 0)
640 if (info->name[sizeof(info->name)-1] != '\0')
642 if (par->family == NFPROTO_IPV4) {
643 if (info->cfg.srcmask > 32 || info->cfg.dstmask > 32)
646 if (info->cfg.srcmask > 128 || info->cfg.dstmask > 128)
650 if (info->cfg.mode & ~XT_HASHLIMIT_ALL) {
651 pr_info("Unknown mode mask %X, kernel too old?\n",
656 /* Check for overflow. */
657 if (info->cfg.mode & XT_HASHLIMIT_BYTES) {
658 if (user2credits_byte(info->cfg.avg) == 0) {
659 pr_info("overflow, rate too high: %u\n", info->cfg.avg);
662 } else if (info->cfg.burst == 0 ||
663 user2credits(info->cfg.avg * info->cfg.burst) <
664 user2credits(info->cfg.avg)) {
665 pr_info("overflow, try lower: %u/%u\n",
666 info->cfg.avg, info->cfg.burst);
670 mutex_lock(&hashlimit_mutex);
671 info->hinfo = htable_find_get(net, info->name, par->family);
672 if (info->hinfo == NULL) {
673 ret = htable_create(net, info, par->family);
675 mutex_unlock(&hashlimit_mutex);
679 mutex_unlock(&hashlimit_mutex);
683 static void hashlimit_mt_destroy(const struct xt_mtdtor_param *par)
685 const struct xt_hashlimit_mtinfo1 *info = par->matchinfo;
687 htable_put(info->hinfo);
690 static struct xt_match hashlimit_mt_reg[] __read_mostly = {
694 .family = NFPROTO_IPV4,
695 .match = hashlimit_mt,
696 .matchsize = sizeof(struct xt_hashlimit_mtinfo1),
697 .checkentry = hashlimit_mt_check,
698 .destroy = hashlimit_mt_destroy,
701 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
705 .family = NFPROTO_IPV6,
706 .match = hashlimit_mt,
707 .matchsize = sizeof(struct xt_hashlimit_mtinfo1),
708 .checkentry = hashlimit_mt_check,
709 .destroy = hashlimit_mt_destroy,
716 static void *dl_seq_start(struct seq_file *s, loff_t *pos)
717 __acquires(htable->lock)
719 struct xt_hashlimit_htable *htable = s->private;
720 unsigned int *bucket;
722 spin_lock_bh(&htable->lock);
723 if (*pos >= htable->cfg.size)
726 bucket = kmalloc(sizeof(unsigned int), GFP_ATOMIC);
728 return ERR_PTR(-ENOMEM);
734 static void *dl_seq_next(struct seq_file *s, void *v, loff_t *pos)
736 struct xt_hashlimit_htable *htable = s->private;
737 unsigned int *bucket = (unsigned int *)v;
740 if (*pos >= htable->cfg.size) {
747 static void dl_seq_stop(struct seq_file *s, void *v)
748 __releases(htable->lock)
750 struct xt_hashlimit_htable *htable = s->private;
751 unsigned int *bucket = (unsigned int *)v;
755 spin_unlock_bh(&htable->lock);
758 static int dl_seq_real_show(struct dsthash_ent *ent, u_int8_t family,
762 const struct xt_hashlimit_htable *ht = s->private;
764 spin_lock(&ent->lock);
765 /* recalculate to show accurate numbers */
766 rateinfo_recalc(ent, jiffies, ht->cfg.mode);
770 res = seq_printf(s, "%ld %pI4:%u->%pI4:%u %u %u %u\n",
771 (long)(ent->expires - jiffies)/HZ,
773 ntohs(ent->dst.src_port),
775 ntohs(ent->dst.dst_port),
776 ent->rateinfo.credit, ent->rateinfo.credit_cap,
779 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
781 res = seq_printf(s, "%ld %pI6:%u->%pI6:%u %u %u %u\n",
782 (long)(ent->expires - jiffies)/HZ,
784 ntohs(ent->dst.src_port),
786 ntohs(ent->dst.dst_port),
787 ent->rateinfo.credit, ent->rateinfo.credit_cap,
795 spin_unlock(&ent->lock);
799 static int dl_seq_show(struct seq_file *s, void *v)
801 struct xt_hashlimit_htable *htable = s->private;
802 unsigned int *bucket = (unsigned int *)v;
803 struct dsthash_ent *ent;
804 struct hlist_node *pos;
806 if (!hlist_empty(&htable->hash[*bucket])) {
807 hlist_for_each_entry(ent, pos, &htable->hash[*bucket], node)
808 if (dl_seq_real_show(ent, htable->family, s))
814 static const struct seq_operations dl_seq_ops = {
815 .start = dl_seq_start,
821 static int dl_proc_open(struct inode *inode, struct file *file)
823 int ret = seq_open(file, &dl_seq_ops);
826 struct seq_file *sf = file->private_data;
827 sf->private = PDE(inode)->data;
832 static const struct file_operations dl_file_ops = {
833 .owner = THIS_MODULE,
834 .open = dl_proc_open,
837 .release = seq_release
840 static int __net_init hashlimit_proc_net_init(struct net *net)
842 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
844 hashlimit_net->ipt_hashlimit = proc_mkdir("ipt_hashlimit", net->proc_net);
845 if (!hashlimit_net->ipt_hashlimit)
847 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
848 hashlimit_net->ip6t_hashlimit = proc_mkdir("ip6t_hashlimit", net->proc_net);
849 if (!hashlimit_net->ip6t_hashlimit) {
850 proc_net_remove(net, "ipt_hashlimit");
857 static void __net_exit hashlimit_proc_net_exit(struct net *net)
859 proc_net_remove(net, "ipt_hashlimit");
860 #if IS_ENABLED(CONFIG_IP6_NF_IPTABLES)
861 proc_net_remove(net, "ip6t_hashlimit");
865 static int __net_init hashlimit_net_init(struct net *net)
867 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
869 INIT_HLIST_HEAD(&hashlimit_net->htables);
870 return hashlimit_proc_net_init(net);
873 static void __net_exit hashlimit_net_exit(struct net *net)
875 struct hashlimit_net *hashlimit_net = hashlimit_pernet(net);
877 BUG_ON(!hlist_empty(&hashlimit_net->htables));
878 hashlimit_proc_net_exit(net);
881 static struct pernet_operations hashlimit_net_ops = {
882 .init = hashlimit_net_init,
883 .exit = hashlimit_net_exit,
884 .id = &hashlimit_net_id,
885 .size = sizeof(struct hashlimit_net),
888 static int __init hashlimit_mt_init(void)
892 err = register_pernet_subsys(&hashlimit_net_ops);
895 err = xt_register_matches(hashlimit_mt_reg,
896 ARRAY_SIZE(hashlimit_mt_reg));
901 hashlimit_cachep = kmem_cache_create("xt_hashlimit",
902 sizeof(struct dsthash_ent), 0, 0,
904 if (!hashlimit_cachep) {
905 pr_warning("unable to create slab cache\n");
911 xt_unregister_matches(hashlimit_mt_reg, ARRAY_SIZE(hashlimit_mt_reg));
913 unregister_pernet_subsys(&hashlimit_net_ops);
918 static void __exit hashlimit_mt_exit(void)
920 xt_unregister_matches(hashlimit_mt_reg, ARRAY_SIZE(hashlimit_mt_reg));
921 unregister_pernet_subsys(&hashlimit_net_ops);
924 kmem_cache_destroy(hashlimit_cachep);
927 module_init(hashlimit_mt_init);
928 module_exit(hashlimit_mt_exit);