Version:  2.0.40 2.2.26 2.4.37 3.1 3.2 3.3 3.4 3.5 3.6 3.7 3.8 3.9 3.10 3.11 3.12 3.13 3.14 3.15 3.16 3.17

Linux/net/netfilter/xt_recent.c

  1 /*
  2  * Copyright (c) 2006 Patrick McHardy <kaber@trash.net>
  3  * Copyright © CC Computer Consultants GmbH, 2007 - 2008
  4  *
  5  * This program is free software; you can redistribute it and/or modify
  6  * it under the terms of the GNU General Public License version 2 as
  7  * published by the Free Software Foundation.
  8  *
  9  * This is a replacement of the old ipt_recent module, which carried the
 10  * following copyright notice:
 11  *
 12  * Author: Stephen Frost <sfrost@snowman.net>
 13  * Copyright 2002-2003, Stephen Frost, 2.5.x port by laforge@netfilter.org
 14  */
 15 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
 16 #include <linux/init.h>
 17 #include <linux/ip.h>
 18 #include <linux/ipv6.h>
 19 #include <linux/module.h>
 20 #include <linux/moduleparam.h>
 21 #include <linux/proc_fs.h>
 22 #include <linux/seq_file.h>
 23 #include <linux/string.h>
 24 #include <linux/ctype.h>
 25 #include <linux/list.h>
 26 #include <linux/random.h>
 27 #include <linux/jhash.h>
 28 #include <linux/bitops.h>
 29 #include <linux/skbuff.h>
 30 #include <linux/inet.h>
 31 #include <linux/slab.h>
 32 #include <linux/vmalloc.h>
 33 #include <net/net_namespace.h>
 34 #include <net/netns/generic.h>
 35 
 36 #include <linux/netfilter/x_tables.h>
 37 #include <linux/netfilter/xt_recent.h>
 38 
 39 MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
 40 MODULE_AUTHOR("Jan Engelhardt <jengelh@medozas.de>");
 41 MODULE_DESCRIPTION("Xtables: \"recently-seen\" host matching");
 42 MODULE_LICENSE("GPL");
 43 MODULE_ALIAS("ipt_recent");
 44 MODULE_ALIAS("ip6t_recent");
 45 
 46 static unsigned int ip_list_tot = 100;
 47 static unsigned int ip_pkt_list_tot = 20;
 48 static unsigned int ip_list_hash_size = 0;
 49 static unsigned int ip_list_perms = 0644;
 50 static unsigned int ip_list_uid = 0;
 51 static unsigned int ip_list_gid = 0;
 52 module_param(ip_list_tot, uint, 0400);
 53 module_param(ip_pkt_list_tot, uint, 0400);
 54 module_param(ip_list_hash_size, uint, 0400);
 55 module_param(ip_list_perms, uint, 0400);
 56 module_param(ip_list_uid, uint, S_IRUGO | S_IWUSR);
 57 module_param(ip_list_gid, uint, S_IRUGO | S_IWUSR);
 58 MODULE_PARM_DESC(ip_list_tot, "number of IPs to remember per list");
 59 MODULE_PARM_DESC(ip_pkt_list_tot, "number of packets per IP address to remember (max. 255)");
 60 MODULE_PARM_DESC(ip_list_hash_size, "size of hash table used to look up IPs");
 61 MODULE_PARM_DESC(ip_list_perms, "permissions on /proc/net/xt_recent/* files");
 62 MODULE_PARM_DESC(ip_list_uid, "default owner of /proc/net/xt_recent/* files");
 63 MODULE_PARM_DESC(ip_list_gid, "default owning group of /proc/net/xt_recent/* files");
 64 
 65 struct recent_entry {
 66         struct list_head        list;
 67         struct list_head        lru_list;
 68         union nf_inet_addr      addr;
 69         u_int16_t               family;
 70         u_int8_t                ttl;
 71         u_int8_t                index;
 72         u_int16_t               nstamps;
 73         unsigned long           stamps[0];
 74 };
 75 
 76 struct recent_table {
 77         struct list_head        list;
 78         char                    name[XT_RECENT_NAME_LEN];
 79         union nf_inet_addr      mask;
 80         unsigned int            refcnt;
 81         unsigned int            entries;
 82         struct list_head        lru_list;
 83         struct list_head        iphash[0];
 84 };
 85 
 86 struct recent_net {
 87         struct list_head        tables;
 88 #ifdef CONFIG_PROC_FS
 89         struct proc_dir_entry   *xt_recent;
 90 #endif
 91 };
 92 
 93 static int recent_net_id;
 94 static inline struct recent_net *recent_pernet(struct net *net)
 95 {
 96         return net_generic(net, recent_net_id);
 97 }
 98 
 99 static DEFINE_SPINLOCK(recent_lock);
100 static DEFINE_MUTEX(recent_mutex);
101 
102 #ifdef CONFIG_PROC_FS
103 static const struct file_operations recent_old_fops, recent_mt_fops;
104 #endif
105 
106 static u_int32_t hash_rnd __read_mostly;
107 static bool hash_rnd_inited __read_mostly;
108 
109 static inline unsigned int recent_entry_hash4(const union nf_inet_addr *addr)
110 {
111         return jhash_1word((__force u32)addr->ip, hash_rnd) &
112                (ip_list_hash_size - 1);
113 }
114 
115 static inline unsigned int recent_entry_hash6(const union nf_inet_addr *addr)
116 {
117         return jhash2((u32 *)addr->ip6, ARRAY_SIZE(addr->ip6), hash_rnd) &
118                (ip_list_hash_size - 1);
119 }
120 
121 static struct recent_entry *
122 recent_entry_lookup(const struct recent_table *table,
123                     const union nf_inet_addr *addrp, u_int16_t family,
124                     u_int8_t ttl)
125 {
126         struct recent_entry *e;
127         unsigned int h;
128 
129         if (family == NFPROTO_IPV4)
130                 h = recent_entry_hash4(addrp);
131         else
132                 h = recent_entry_hash6(addrp);
133 
134         list_for_each_entry(e, &table->iphash[h], list)
135                 if (e->family == family &&
136                     memcmp(&e->addr, addrp, sizeof(e->addr)) == 0 &&
137                     (ttl == e->ttl || ttl == 0 || e->ttl == 0))
138                         return e;
139         return NULL;
140 }
141 
142 static void recent_entry_remove(struct recent_table *t, struct recent_entry *e)
143 {
144         list_del(&e->list);
145         list_del(&e->lru_list);
146         kfree(e);
147         t->entries--;
148 }
149 
150 /*
151  * Drop entries with timestamps older then 'time'.
152  */
153 static void recent_entry_reap(struct recent_table *t, unsigned long time)
154 {
155         struct recent_entry *e;
156 
157         /*
158          * The head of the LRU list is always the oldest entry.
159          */
160         e = list_entry(t->lru_list.next, struct recent_entry, lru_list);
161 
162         /*
163          * The last time stamp is the most recent.
164          */
165         if (time_after(time, e->stamps[e->index-1]))
166                 recent_entry_remove(t, e);
167 }
168 
169 static struct recent_entry *
170 recent_entry_init(struct recent_table *t, const union nf_inet_addr *addr,
171                   u_int16_t family, u_int8_t ttl)
172 {
173         struct recent_entry *e;
174 
175         if (t->entries >= ip_list_tot) {
176                 e = list_entry(t->lru_list.next, struct recent_entry, lru_list);
177                 recent_entry_remove(t, e);
178         }
179         e = kmalloc(sizeof(*e) + sizeof(e->stamps[0]) * ip_pkt_list_tot,
180                     GFP_ATOMIC);
181         if (e == NULL)
182                 return NULL;
183         memcpy(&e->addr, addr, sizeof(e->addr));
184         e->ttl       = ttl;
185         e->stamps[0] = jiffies;
186         e->nstamps   = 1;
187         e->index     = 1;
188         e->family    = family;
189         if (family == NFPROTO_IPV4)
190                 list_add_tail(&e->list, &t->iphash[recent_entry_hash4(addr)]);
191         else
192                 list_add_tail(&e->list, &t->iphash[recent_entry_hash6(addr)]);
193         list_add_tail(&e->lru_list, &t->lru_list);
194         t->entries++;
195         return e;
196 }
197 
198 static void recent_entry_update(struct recent_table *t, struct recent_entry *e)
199 {
200         e->index %= ip_pkt_list_tot;
201         e->stamps[e->index++] = jiffies;
202         if (e->index > e->nstamps)
203                 e->nstamps = e->index;
204         list_move_tail(&e->lru_list, &t->lru_list);
205 }
206 
207 static struct recent_table *recent_table_lookup(struct recent_net *recent_net,
208                                                 const char *name)
209 {
210         struct recent_table *t;
211 
212         list_for_each_entry(t, &recent_net->tables, list)
213                 if (!strcmp(t->name, name))
214                         return t;
215         return NULL;
216 }
217 
218 static void recent_table_flush(struct recent_table *t)
219 {
220         struct recent_entry *e, *next;
221         unsigned int i;
222 
223         for (i = 0; i < ip_list_hash_size; i++)
224                 list_for_each_entry_safe(e, next, &t->iphash[i], list)
225                         recent_entry_remove(t, e);
226 }
227 
228 static bool
229 recent_mt(const struct sk_buff *skb, struct xt_action_param *par)
230 {
231         struct net *net = dev_net(par->in ? par->in : par->out);
232         struct recent_net *recent_net = recent_pernet(net);
233         const struct xt_recent_mtinfo_v1 *info = par->matchinfo;
234         struct recent_table *t;
235         struct recent_entry *e;
236         union nf_inet_addr addr = {}, addr_mask;
237         u_int8_t ttl;
238         bool ret = info->invert;
239 
240         if (par->family == NFPROTO_IPV4) {
241                 const struct iphdr *iph = ip_hdr(skb);
242 
243                 if (info->side == XT_RECENT_DEST)
244                         addr.ip = iph->daddr;
245                 else
246                         addr.ip = iph->saddr;
247 
248                 ttl = iph->ttl;
249         } else {
250                 const struct ipv6hdr *iph = ipv6_hdr(skb);
251 
252                 if (info->side == XT_RECENT_DEST)
253                         memcpy(&addr.in6, &iph->daddr, sizeof(addr.in6));
254                 else
255                         memcpy(&addr.in6, &iph->saddr, sizeof(addr.in6));
256 
257                 ttl = iph->hop_limit;
258         }
259 
260         /* use TTL as seen before forwarding */
261         if (par->out != NULL && skb->sk == NULL)
262                 ttl++;
263 
264         spin_lock_bh(&recent_lock);
265         t = recent_table_lookup(recent_net, info->name);
266 
267         nf_inet_addr_mask(&addr, &addr_mask, &t->mask);
268 
269         e = recent_entry_lookup(t, &addr_mask, par->family,
270                                 (info->check_set & XT_RECENT_TTL) ? ttl : 0);
271         if (e == NULL) {
272                 if (!(info->check_set & XT_RECENT_SET))
273                         goto out;
274                 e = recent_entry_init(t, &addr_mask, par->family, ttl);
275                 if (e == NULL)
276                         par->hotdrop = true;
277                 ret = !ret;
278                 goto out;
279         }
280 
281         if (info->check_set & XT_RECENT_SET)
282                 ret = !ret;
283         else if (info->check_set & XT_RECENT_REMOVE) {
284                 recent_entry_remove(t, e);
285                 ret = !ret;
286         } else if (info->check_set & (XT_RECENT_CHECK | XT_RECENT_UPDATE)) {
287                 unsigned long time = jiffies - info->seconds * HZ;
288                 unsigned int i, hits = 0;
289 
290                 for (i = 0; i < e->nstamps; i++) {
291                         if (info->seconds && time_after(time, e->stamps[i]))
292                                 continue;
293                         if (!info->hit_count || ++hits >= info->hit_count) {
294                                 ret = !ret;
295                                 break;
296                         }
297                 }
298 
299                 /* info->seconds must be non-zero */
300                 if (info->check_set & XT_RECENT_REAP)
301                         recent_entry_reap(t, time);
302         }
303 
304         if (info->check_set & XT_RECENT_SET ||
305             (info->check_set & XT_RECENT_UPDATE && ret)) {
306                 recent_entry_update(t, e);
307                 e->ttl = ttl;
308         }
309 out:
310         spin_unlock_bh(&recent_lock);
311         return ret;
312 }
313 
314 static void recent_table_free(void *addr)
315 {
316         kvfree(addr);
317 }
318 
319 static int recent_mt_check(const struct xt_mtchk_param *par,
320                            const struct xt_recent_mtinfo_v1 *info)
321 {
322         struct recent_net *recent_net = recent_pernet(par->net);
323         struct recent_table *t;
324 #ifdef CONFIG_PROC_FS
325         struct proc_dir_entry *pde;
326         kuid_t uid;
327         kgid_t gid;
328 #endif
329         unsigned int i;
330         int ret = -EINVAL;
331         size_t sz;
332 
333         if (unlikely(!hash_rnd_inited)) {
334                 get_random_bytes(&hash_rnd, sizeof(hash_rnd));
335                 hash_rnd_inited = true;
336         }
337         if (info->check_set & ~XT_RECENT_VALID_FLAGS) {
338                 pr_info("Unsupported user space flags (%08x)\n",
339                         info->check_set);
340                 return -EINVAL;
341         }
342         if (hweight8(info->check_set &
343                      (XT_RECENT_SET | XT_RECENT_REMOVE |
344                       XT_RECENT_CHECK | XT_RECENT_UPDATE)) != 1)
345                 return -EINVAL;
346         if ((info->check_set & (XT_RECENT_SET | XT_RECENT_REMOVE)) &&
347             (info->seconds || info->hit_count ||
348             (info->check_set & XT_RECENT_MODIFIERS)))
349                 return -EINVAL;
350         if ((info->check_set & XT_RECENT_REAP) && !info->seconds)
351                 return -EINVAL;
352         if (info->hit_count > ip_pkt_list_tot) {
353                 pr_info("hitcount (%u) is larger than "
354                         "packets to be remembered (%u)\n",
355                         info->hit_count, ip_pkt_list_tot);
356                 return -EINVAL;
357         }
358         if (info->name[0] == '\0' ||
359             strnlen(info->name, XT_RECENT_NAME_LEN) == XT_RECENT_NAME_LEN)
360                 return -EINVAL;
361 
362         mutex_lock(&recent_mutex);
363         t = recent_table_lookup(recent_net, info->name);
364         if (t != NULL) {
365                 t->refcnt++;
366                 ret = 0;
367                 goto out;
368         }
369 
370         sz = sizeof(*t) + sizeof(t->iphash[0]) * ip_list_hash_size;
371         if (sz <= PAGE_SIZE)
372                 t = kzalloc(sz, GFP_KERNEL);
373         else
374                 t = vzalloc(sz);
375         if (t == NULL) {
376                 ret = -ENOMEM;
377                 goto out;
378         }
379         t->refcnt = 1;
380 
381         memcpy(&t->mask, &info->mask, sizeof(t->mask));
382         strcpy(t->name, info->name);
383         INIT_LIST_HEAD(&t->lru_list);
384         for (i = 0; i < ip_list_hash_size; i++)
385                 INIT_LIST_HEAD(&t->iphash[i]);
386 #ifdef CONFIG_PROC_FS
387         uid = make_kuid(&init_user_ns, ip_list_uid);
388         gid = make_kgid(&init_user_ns, ip_list_gid);
389         if (!uid_valid(uid) || !gid_valid(gid)) {
390                 recent_table_free(t);
391                 ret = -EINVAL;
392                 goto out;
393         }
394         pde = proc_create_data(t->name, ip_list_perms, recent_net->xt_recent,
395                   &recent_mt_fops, t);
396         if (pde == NULL) {
397                 recent_table_free(t);
398                 ret = -ENOMEM;
399                 goto out;
400         }
401         proc_set_user(pde, uid, gid);
402 #endif
403         spin_lock_bh(&recent_lock);
404         list_add_tail(&t->list, &recent_net->tables);
405         spin_unlock_bh(&recent_lock);
406         ret = 0;
407 out:
408         mutex_unlock(&recent_mutex);
409         return ret;
410 }
411 
412 static int recent_mt_check_v0(const struct xt_mtchk_param *par)
413 {
414         const struct xt_recent_mtinfo_v0 *info_v0 = par->matchinfo;
415         struct xt_recent_mtinfo_v1 info_v1;
416 
417         /* Copy revision 0 structure to revision 1 */
418         memcpy(&info_v1, info_v0, sizeof(struct xt_recent_mtinfo));
419         /* Set default mask to ensure backward compatible behaviour */
420         memset(info_v1.mask.all, 0xFF, sizeof(info_v1.mask.all));
421 
422         return recent_mt_check(par, &info_v1);
423 }
424 
425 static int recent_mt_check_v1(const struct xt_mtchk_param *par)
426 {
427         return recent_mt_check(par, par->matchinfo);
428 }
429 
430 static void recent_mt_destroy(const struct xt_mtdtor_param *par)
431 {
432         struct recent_net *recent_net = recent_pernet(par->net);
433         const struct xt_recent_mtinfo_v1 *info = par->matchinfo;
434         struct recent_table *t;
435 
436         mutex_lock(&recent_mutex);
437         t = recent_table_lookup(recent_net, info->name);
438         if (--t->refcnt == 0) {
439                 spin_lock_bh(&recent_lock);
440                 list_del(&t->list);
441                 spin_unlock_bh(&recent_lock);
442 #ifdef CONFIG_PROC_FS
443                 if (recent_net->xt_recent != NULL)
444                         remove_proc_entry(t->name, recent_net->xt_recent);
445 #endif
446                 recent_table_flush(t);
447                 recent_table_free(t);
448         }
449         mutex_unlock(&recent_mutex);
450 }
451 
452 #ifdef CONFIG_PROC_FS
453 struct recent_iter_state {
454         const struct recent_table *table;
455         unsigned int            bucket;
456 };
457 
458 static void *recent_seq_start(struct seq_file *seq, loff_t *pos)
459         __acquires(recent_lock)
460 {
461         struct recent_iter_state *st = seq->private;
462         const struct recent_table *t = st->table;
463         struct recent_entry *e;
464         loff_t p = *pos;
465 
466         spin_lock_bh(&recent_lock);
467 
468         for (st->bucket = 0; st->bucket < ip_list_hash_size; st->bucket++)
469                 list_for_each_entry(e, &t->iphash[st->bucket], list)
470                         if (p-- == 0)
471                                 return e;
472         return NULL;
473 }
474 
475 static void *recent_seq_next(struct seq_file *seq, void *v, loff_t *pos)
476 {
477         struct recent_iter_state *st = seq->private;
478         const struct recent_table *t = st->table;
479         const struct recent_entry *e = v;
480         const struct list_head *head = e->list.next;
481 
482         while (head == &t->iphash[st->bucket]) {
483                 if (++st->bucket >= ip_list_hash_size)
484                         return NULL;
485                 head = t->iphash[st->bucket].next;
486         }
487         (*pos)++;
488         return list_entry(head, struct recent_entry, list);
489 }
490 
491 static void recent_seq_stop(struct seq_file *s, void *v)
492         __releases(recent_lock)
493 {
494         spin_unlock_bh(&recent_lock);
495 }
496 
497 static int recent_seq_show(struct seq_file *seq, void *v)
498 {
499         const struct recent_entry *e = v;
500         unsigned int i;
501 
502         i = (e->index - 1) % ip_pkt_list_tot;
503         if (e->family == NFPROTO_IPV4)
504                 seq_printf(seq, "src=%pI4 ttl: %u last_seen: %lu oldest_pkt: %u",
505                            &e->addr.ip, e->ttl, e->stamps[i], e->index);
506         else
507                 seq_printf(seq, "src=%pI6 ttl: %u last_seen: %lu oldest_pkt: %u",
508                            &e->addr.in6, e->ttl, e->stamps[i], e->index);
509         for (i = 0; i < e->nstamps; i++)
510                 seq_printf(seq, "%s %lu", i ? "," : "", e->stamps[i]);
511         seq_printf(seq, "\n");
512         return 0;
513 }
514 
515 static const struct seq_operations recent_seq_ops = {
516         .start          = recent_seq_start,
517         .next           = recent_seq_next,
518         .stop           = recent_seq_stop,
519         .show           = recent_seq_show,
520 };
521 
522 static int recent_seq_open(struct inode *inode, struct file *file)
523 {
524         struct recent_iter_state *st;
525 
526         st = __seq_open_private(file, &recent_seq_ops, sizeof(*st));
527         if (st == NULL)
528                 return -ENOMEM;
529 
530         st->table    = PDE_DATA(inode);
531         return 0;
532 }
533 
534 static ssize_t
535 recent_mt_proc_write(struct file *file, const char __user *input,
536                      size_t size, loff_t *loff)
537 {
538         struct recent_table *t = PDE_DATA(file_inode(file));
539         struct recent_entry *e;
540         char buf[sizeof("+b335:1d35:1e55:dead:c0de:1715:5afe:c0de")];
541         const char *c = buf;
542         union nf_inet_addr addr = {};
543         u_int16_t family;
544         bool add, succ;
545 
546         if (size == 0)
547                 return 0;
548         if (size > sizeof(buf))
549                 size = sizeof(buf);
550         if (copy_from_user(buf, input, size) != 0)
551                 return -EFAULT;
552 
553         /* Strict protocol! */
554         if (*loff != 0)
555                 return -ESPIPE;
556         switch (*c) {
557         case '/': /* flush table */
558                 spin_lock_bh(&recent_lock);
559                 recent_table_flush(t);
560                 spin_unlock_bh(&recent_lock);
561                 return size;
562         case '-': /* remove address */
563                 add = false;
564                 break;
565         case '+': /* add address */
566                 add = true;
567                 break;
568         default:
569                 pr_info("Need \"+ip\", \"-ip\" or \"/\"\n");
570                 return -EINVAL;
571         }
572 
573         ++c;
574         --size;
575         if (strnchr(c, size, ':') != NULL) {
576                 family = NFPROTO_IPV6;
577                 succ   = in6_pton(c, size, (void *)&addr, '\n', NULL);
578         } else {
579                 family = NFPROTO_IPV4;
580                 succ   = in4_pton(c, size, (void *)&addr, '\n', NULL);
581         }
582 
583         if (!succ) {
584                 pr_info("illegal address written to procfs\n");
585                 return -EINVAL;
586         }
587 
588         spin_lock_bh(&recent_lock);
589         e = recent_entry_lookup(t, &addr, family, 0);
590         if (e == NULL) {
591                 if (add)
592                         recent_entry_init(t, &addr, family, 0);
593         } else {
594                 if (add)
595                         recent_entry_update(t, e);
596                 else
597                         recent_entry_remove(t, e);
598         }
599         spin_unlock_bh(&recent_lock);
600         /* Note we removed one above */
601         *loff += size + 1;
602         return size + 1;
603 }
604 
605 static const struct file_operations recent_mt_fops = {
606         .open    = recent_seq_open,
607         .read    = seq_read,
608         .write   = recent_mt_proc_write,
609         .release = seq_release_private,
610         .owner   = THIS_MODULE,
611         .llseek = seq_lseek,
612 };
613 
614 static int __net_init recent_proc_net_init(struct net *net)
615 {
616         struct recent_net *recent_net = recent_pernet(net);
617 
618         recent_net->xt_recent = proc_mkdir("xt_recent", net->proc_net);
619         if (!recent_net->xt_recent)
620                 return -ENOMEM;
621         return 0;
622 }
623 
624 static void __net_exit recent_proc_net_exit(struct net *net)
625 {
626         struct recent_net *recent_net = recent_pernet(net);
627         struct recent_table *t;
628 
629         /* recent_net_exit() is called before recent_mt_destroy(). Make sure
630          * that the parent xt_recent proc entry is is empty before trying to
631          * remove it.
632          */
633         spin_lock_bh(&recent_lock);
634         list_for_each_entry(t, &recent_net->tables, list)
635                 remove_proc_entry(t->name, recent_net->xt_recent);
636 
637         recent_net->xt_recent = NULL;
638         spin_unlock_bh(&recent_lock);
639 
640         remove_proc_entry("xt_recent", net->proc_net);
641 }
642 #else
643 static inline int recent_proc_net_init(struct net *net)
644 {
645         return 0;
646 }
647 
648 static inline void recent_proc_net_exit(struct net *net)
649 {
650 }
651 #endif /* CONFIG_PROC_FS */
652 
653 static int __net_init recent_net_init(struct net *net)
654 {
655         struct recent_net *recent_net = recent_pernet(net);
656 
657         INIT_LIST_HEAD(&recent_net->tables);
658         return recent_proc_net_init(net);
659 }
660 
661 static void __net_exit recent_net_exit(struct net *net)
662 {
663         recent_proc_net_exit(net);
664 }
665 
666 static struct pernet_operations recent_net_ops = {
667         .init   = recent_net_init,
668         .exit   = recent_net_exit,
669         .id     = &recent_net_id,
670         .size   = sizeof(struct recent_net),
671 };
672 
673 static struct xt_match recent_mt_reg[] __read_mostly = {
674         {
675                 .name       = "recent",
676                 .revision   = 0,
677                 .family     = NFPROTO_IPV4,
678                 .match      = recent_mt,
679                 .matchsize  = sizeof(struct xt_recent_mtinfo),
680                 .checkentry = recent_mt_check_v0,
681                 .destroy    = recent_mt_destroy,
682                 .me         = THIS_MODULE,
683         },
684         {
685                 .name       = "recent",
686                 .revision   = 0,
687                 .family     = NFPROTO_IPV6,
688                 .match      = recent_mt,
689                 .matchsize  = sizeof(struct xt_recent_mtinfo),
690                 .checkentry = recent_mt_check_v0,
691                 .destroy    = recent_mt_destroy,
692                 .me         = THIS_MODULE,
693         },
694         {
695                 .name       = "recent",
696                 .revision   = 1,
697                 .family     = NFPROTO_IPV4,
698                 .match      = recent_mt,
699                 .matchsize  = sizeof(struct xt_recent_mtinfo_v1),
700                 .checkentry = recent_mt_check_v1,
701                 .destroy    = recent_mt_destroy,
702                 .me         = THIS_MODULE,
703         },
704         {
705                 .name       = "recent",
706                 .revision   = 1,
707                 .family     = NFPROTO_IPV6,
708                 .match      = recent_mt,
709                 .matchsize  = sizeof(struct xt_recent_mtinfo_v1),
710                 .checkentry = recent_mt_check_v1,
711                 .destroy    = recent_mt_destroy,
712                 .me         = THIS_MODULE,
713         }
714 };
715 
716 static int __init recent_mt_init(void)
717 {
718         int err;
719 
720         if (!ip_list_tot || !ip_pkt_list_tot || ip_pkt_list_tot > 255)
721                 return -EINVAL;
722         ip_list_hash_size = 1 << fls(ip_list_tot);
723 
724         err = register_pernet_subsys(&recent_net_ops);
725         if (err)
726                 return err;
727         err = xt_register_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg));
728         if (err)
729                 unregister_pernet_subsys(&recent_net_ops);
730         return err;
731 }
732 
733 static void __exit recent_mt_exit(void)
734 {
735         xt_unregister_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg));
736         unregister_pernet_subsys(&recent_net_ops);
737 }
738 
739 module_init(recent_mt_init);
740 module_exit(recent_mt_exit);
741 

This page was automatically generated by LXR 0.3.1 (source).  •  Linux is a registered trademark of Linus Torvalds  •  Contact us