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