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 __read_mostly = 100; 47 static unsigned int ip_list_hash_size __read_mostly; 48 static unsigned int ip_list_perms __read_mostly = 0644; 49 static unsigned int ip_list_uid __read_mostly; 50 static unsigned int ip_list_gid __read_mostly; 51 module_param(ip_list_tot, uint, 0400); 52 module_param(ip_list_hash_size, uint, 0400); 53 module_param(ip_list_perms, uint, 0400); 54 module_param(ip_list_uid, uint, 0644); 55 module_param(ip_list_gid, uint, 0644); 56 MODULE_PARM_DESC(ip_list_tot, "number of IPs to remember per list"); 57 MODULE_PARM_DESC(ip_list_hash_size, "size of hash table used to look up IPs"); 58 MODULE_PARM_DESC(ip_list_perms, "permissions on /proc/net/xt_recent/* files"); 59 MODULE_PARM_DESC(ip_list_uid, "default owner of /proc/net/xt_recent/* files"); 60 MODULE_PARM_DESC(ip_list_gid, "default owning group of /proc/net/xt_recent/* files"); 61 62 /* retained for backwards compatibility */ 63 static unsigned int ip_pkt_list_tot __read_mostly; 64 module_param(ip_pkt_list_tot, uint, 0400); 65 MODULE_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 69 struct 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 80 struct 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 91 struct recent_net { 92 struct list_head tables; 93 #ifdef CONFIG_PROC_FS 94 struct proc_dir_entry *xt_recent; 95 #endif 96 }; 97 98 static unsigned int recent_net_id __read_mostly; 99 100 static inline struct recent_net *recent_pernet(struct net *net) 101 { 102 return net_generic(net, recent_net_id); 103 } 104 105 static DEFINE_SPINLOCK(recent_lock); 106 static DEFINE_MUTEX(recent_mutex); 107 108 #ifdef CONFIG_PROC_FS 109 static const struct file_operations recent_mt_fops; 110 #endif 111 112 static u_int32_t hash_rnd __read_mostly; 113 114 static 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 120 static 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 126 static struct recent_entry * 127 recent_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 147 static 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 */ 158 static 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 174 static struct recent_entry * 175 recent_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 205 static 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 214 static 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 225 static 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 235 static bool 236 recent_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 } 317 out: 318 spin_unlock_bh(&recent_lock); 319 return ret; 320 } 321 322 static void recent_table_free(void *addr) 323 { 324 kvfree(addr); 325 } 326 327 static 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 341 net_get_random_once(&hash_rnd, sizeof(hash_rnd)); 342 343 if (info->check_set & ~XT_RECENT_VALID_FLAGS) { 344 pr_info_ratelimited("Unsupported userspace flags (%08x)\n", 345 info->check_set); 346 return -EINVAL; 347 } 348 if (hweight8(info->check_set & 349 (XT_RECENT_SET | XT_RECENT_REMOVE | 350 XT_RECENT_CHECK | XT_RECENT_UPDATE)) != 1) 351 return -EINVAL; 352 if ((info->check_set & (XT_RECENT_SET | XT_RECENT_REMOVE)) && 353 (info->seconds || info->hit_count || 354 (info->check_set & XT_RECENT_MODIFIERS))) 355 return -EINVAL; 356 if ((info->check_set & XT_RECENT_REAP) && !info->seconds) 357 return -EINVAL; 358 if (info->hit_count >= XT_RECENT_MAX_NSTAMPS) { 359 pr_info_ratelimited("hitcount (%u) is larger than allowed maximum (%u)\n", 360 info->hit_count, XT_RECENT_MAX_NSTAMPS - 1); 361 return -EINVAL; 362 } 363 ret = xt_check_proc_name(info->name, sizeof(info->name)); 364 if (ret) 365 return ret; 366 367 if (ip_pkt_list_tot && info->hit_count < ip_pkt_list_tot) 368 nstamp_mask = roundup_pow_of_two(ip_pkt_list_tot) - 1; 369 else if (info->hit_count) 370 nstamp_mask = roundup_pow_of_two(info->hit_count) - 1; 371 else 372 nstamp_mask = 32 - 1; 373 374 mutex_lock(&recent_mutex); 375 t = recent_table_lookup(recent_net, info->name); 376 if (t != NULL) { 377 if (nstamp_mask > t->nstamps_max_mask) { 378 spin_lock_bh(&recent_lock); 379 recent_table_flush(t); 380 t->nstamps_max_mask = nstamp_mask; 381 spin_unlock_bh(&recent_lock); 382 } 383 384 t->refcnt++; 385 ret = 0; 386 goto out; 387 } 388 389 t = kvzalloc(struct_size(t, iphash, ip_list_hash_size), GFP_KERNEL); 390 if (t == NULL) { 391 ret = -ENOMEM; 392 goto out; 393 } 394 t->refcnt = 1; 395 t->nstamps_max_mask = nstamp_mask; 396 397 memcpy(&t->mask, &info->mask, sizeof(t->mask)); 398 strcpy(t->name, info->name); 399 INIT_LIST_HEAD(&t->lru_list); 400 for (i = 0; i < ip_list_hash_size; i++) 401 INIT_LIST_HEAD(&t->iphash[i]); 402 #ifdef CONFIG_PROC_FS 403 uid = make_kuid(&init_user_ns, ip_list_uid); 404 gid = make_kgid(&init_user_ns, ip_list_gid); 405 if (!uid_valid(uid) || !gid_valid(gid)) { 406 recent_table_free(t); 407 ret = -EINVAL; 408 goto out; 409 } 410 pde = proc_create_data(t->name, ip_list_perms, recent_net->xt_recent, 411 &recent_mt_fops, t); 412 if (pde == NULL) { 413 recent_table_free(t); 414 ret = -ENOMEM; 415 goto out; 416 } 417 proc_set_user(pde, uid, gid); 418 #endif 419 spin_lock_bh(&recent_lock); 420 list_add_tail(&t->list, &recent_net->tables); 421 spin_unlock_bh(&recent_lock); 422 ret = 0; 423 out: 424 mutex_unlock(&recent_mutex); 425 return ret; 426 } 427 428 static int recent_mt_check_v0(const struct xt_mtchk_param *par) 429 { 430 const struct xt_recent_mtinfo_v0 *info_v0 = par->matchinfo; 431 struct xt_recent_mtinfo_v1 info_v1; 432 433 /* Copy revision 0 structure to revision 1 */ 434 memcpy(&info_v1, info_v0, sizeof(struct xt_recent_mtinfo)); 435 /* Set default mask to ensure backward compatible behaviour */ 436 memset(info_v1.mask.all, 0xFF, sizeof(info_v1.mask.all)); 437 438 return recent_mt_check(par, &info_v1); 439 } 440 441 static int recent_mt_check_v1(const struct xt_mtchk_param *par) 442 { 443 return recent_mt_check(par, par->matchinfo); 444 } 445 446 static void recent_mt_destroy(const struct xt_mtdtor_param *par) 447 { 448 struct recent_net *recent_net = recent_pernet(par->net); 449 const struct xt_recent_mtinfo_v1 *info = par->matchinfo; 450 struct recent_table *t; 451 452 mutex_lock(&recent_mutex); 453 t = recent_table_lookup(recent_net, info->name); 454 if (--t->refcnt == 0) { 455 spin_lock_bh(&recent_lock); 456 list_del(&t->list); 457 spin_unlock_bh(&recent_lock); 458 #ifdef CONFIG_PROC_FS 459 if (recent_net->xt_recent != NULL) 460 remove_proc_entry(t->name, recent_net->xt_recent); 461 #endif 462 recent_table_flush(t); 463 recent_table_free(t); 464 } 465 mutex_unlock(&recent_mutex); 466 } 467 468 #ifdef CONFIG_PROC_FS 469 struct recent_iter_state { 470 const struct recent_table *table; 471 unsigned int bucket; 472 }; 473 474 static void *recent_seq_start(struct seq_file *seq, loff_t *pos) 475 __acquires(recent_lock) 476 { 477 struct recent_iter_state *st = seq->private; 478 const struct recent_table *t = st->table; 479 struct recent_entry *e; 480 loff_t p = *pos; 481 482 spin_lock_bh(&recent_lock); 483 484 for (st->bucket = 0; st->bucket < ip_list_hash_size; st->bucket++) 485 list_for_each_entry(e, &t->iphash[st->bucket], list) 486 if (p-- == 0) 487 return e; 488 return NULL; 489 } 490 491 static void *recent_seq_next(struct seq_file *seq, void *v, loff_t *pos) 492 { 493 struct recent_iter_state *st = seq->private; 494 const struct recent_table *t = st->table; 495 const struct recent_entry *e = v; 496 const struct list_head *head = e->list.next; 497 498 while (head == &t->iphash[st->bucket]) { 499 if (++st->bucket >= ip_list_hash_size) 500 return NULL; 501 head = t->iphash[st->bucket].next; 502 } 503 (*pos)++; 504 return list_entry(head, struct recent_entry, list); 505 } 506 507 static void recent_seq_stop(struct seq_file *s, void *v) 508 __releases(recent_lock) 509 { 510 spin_unlock_bh(&recent_lock); 511 } 512 513 static int recent_seq_show(struct seq_file *seq, void *v) 514 { 515 const struct recent_entry *e = v; 516 struct recent_iter_state *st = seq->private; 517 const struct recent_table *t = st->table; 518 unsigned int i; 519 520 i = (e->index - 1) & t->nstamps_max_mask; 521 522 if (e->family == NFPROTO_IPV4) 523 seq_printf(seq, "src=%pI4 ttl: %u last_seen: %lu oldest_pkt: %u", 524 &e->addr.ip, e->ttl, e->stamps[i], e->index); 525 else 526 seq_printf(seq, "src=%pI6 ttl: %u last_seen: %lu oldest_pkt: %u", 527 &e->addr.in6, e->ttl, e->stamps[i], e->index); 528 for (i = 0; i < e->nstamps; i++) 529 seq_printf(seq, "%s %lu", i ? "," : "", e->stamps[i]); 530 seq_putc(seq, '\n'); 531 return 0; 532 } 533 534 static const struct seq_operations recent_seq_ops = { 535 .start = recent_seq_start, 536 .next = recent_seq_next, 537 .stop = recent_seq_stop, 538 .show = recent_seq_show, 539 }; 540 541 static int recent_seq_open(struct inode *inode, struct file *file) 542 { 543 struct recent_iter_state *st; 544 545 st = __seq_open_private(file, &recent_seq_ops, sizeof(*st)); 546 if (st == NULL) 547 return -ENOMEM; 548 549 st->table = PDE_DATA(inode); 550 return 0; 551 } 552 553 static ssize_t 554 recent_mt_proc_write(struct file *file, const char __user *input, 555 size_t size, loff_t *loff) 556 { 557 struct recent_table *t = PDE_DATA(file_inode(file)); 558 struct recent_entry *e; 559 char buf[sizeof("+b335:1d35:1e55:dead:c0de:1715:5afe:c0de")]; 560 const char *c = buf; 561 union nf_inet_addr addr = {}; 562 u_int16_t family; 563 bool add, succ; 564 565 if (size == 0) 566 return 0; 567 if (size > sizeof(buf)) 568 size = sizeof(buf); 569 if (copy_from_user(buf, input, size) != 0) 570 return -EFAULT; 571 572 /* Strict protocol! */ 573 if (*loff != 0) 574 return -ESPIPE; 575 switch (*c) { 576 case '/': /* flush table */ 577 spin_lock_bh(&recent_lock); 578 recent_table_flush(t); 579 spin_unlock_bh(&recent_lock); 580 return size; 581 case '-': /* remove address */ 582 add = false; 583 break; 584 case '+': /* add address */ 585 add = true; 586 break; 587 default: 588 pr_info_ratelimited("Need \"+ip\", \"-ip\" or \"/\"\n"); 589 return -EINVAL; 590 } 591 592 ++c; 593 --size; 594 if (strnchr(c, size, ':') != NULL) { 595 family = NFPROTO_IPV6; 596 succ = in6_pton(c, size, (void *)&addr, '\n', NULL); 597 } else { 598 family = NFPROTO_IPV4; 599 succ = in4_pton(c, size, (void *)&addr, '\n', NULL); 600 } 601 602 if (!succ) 603 return -EINVAL; 604 605 spin_lock_bh(&recent_lock); 606 e = recent_entry_lookup(t, &addr, family, 0); 607 if (e == NULL) { 608 if (add) 609 recent_entry_init(t, &addr, family, 0); 610 } else { 611 if (add) 612 recent_entry_update(t, e); 613 else 614 recent_entry_remove(t, e); 615 } 616 spin_unlock_bh(&recent_lock); 617 /* Note we removed one above */ 618 *loff += size + 1; 619 return size + 1; 620 } 621 622 static const struct file_operations recent_mt_fops = { 623 .open = recent_seq_open, 624 .read = seq_read, 625 .write = recent_mt_proc_write, 626 .release = seq_release_private, 627 .owner = THIS_MODULE, 628 .llseek = seq_lseek, 629 }; 630 631 static int __net_init recent_proc_net_init(struct net *net) 632 { 633 struct recent_net *recent_net = recent_pernet(net); 634 635 recent_net->xt_recent = proc_mkdir("xt_recent", net->proc_net); 636 if (!recent_net->xt_recent) 637 return -ENOMEM; 638 return 0; 639 } 640 641 static void __net_exit recent_proc_net_exit(struct net *net) 642 { 643 struct recent_net *recent_net = recent_pernet(net); 644 struct recent_table *t; 645 646 /* recent_net_exit() is called before recent_mt_destroy(). Make sure 647 * that the parent xt_recent proc entry is is empty before trying to 648 * remove it. 649 */ 650 spin_lock_bh(&recent_lock); 651 list_for_each_entry(t, &recent_net->tables, list) 652 remove_proc_entry(t->name, recent_net->xt_recent); 653 654 recent_net->xt_recent = NULL; 655 spin_unlock_bh(&recent_lock); 656 657 remove_proc_entry("xt_recent", net->proc_net); 658 } 659 #else 660 static inline int recent_proc_net_init(struct net *net) 661 { 662 return 0; 663 } 664 665 static inline void recent_proc_net_exit(struct net *net) 666 { 667 } 668 #endif /* CONFIG_PROC_FS */ 669 670 static int __net_init recent_net_init(struct net *net) 671 { 672 struct recent_net *recent_net = recent_pernet(net); 673 674 INIT_LIST_HEAD(&recent_net->tables); 675 return recent_proc_net_init(net); 676 } 677 678 static void __net_exit recent_net_exit(struct net *net) 679 { 680 recent_proc_net_exit(net); 681 } 682 683 static struct pernet_operations recent_net_ops = { 684 .init = recent_net_init, 685 .exit = recent_net_exit, 686 .id = &recent_net_id, 687 .size = sizeof(struct recent_net), 688 }; 689 690 static struct xt_match recent_mt_reg[] __read_mostly = { 691 { 692 .name = "recent", 693 .revision = 0, 694 .family = NFPROTO_IPV4, 695 .match = recent_mt, 696 .matchsize = sizeof(struct xt_recent_mtinfo), 697 .checkentry = recent_mt_check_v0, 698 .destroy = recent_mt_destroy, 699 .me = THIS_MODULE, 700 }, 701 { 702 .name = "recent", 703 .revision = 0, 704 .family = NFPROTO_IPV6, 705 .match = recent_mt, 706 .matchsize = sizeof(struct xt_recent_mtinfo), 707 .checkentry = recent_mt_check_v0, 708 .destroy = recent_mt_destroy, 709 .me = THIS_MODULE, 710 }, 711 { 712 .name = "recent", 713 .revision = 1, 714 .family = NFPROTO_IPV4, 715 .match = recent_mt, 716 .matchsize = sizeof(struct xt_recent_mtinfo_v1), 717 .checkentry = recent_mt_check_v1, 718 .destroy = recent_mt_destroy, 719 .me = THIS_MODULE, 720 }, 721 { 722 .name = "recent", 723 .revision = 1, 724 .family = NFPROTO_IPV6, 725 .match = recent_mt, 726 .matchsize = sizeof(struct xt_recent_mtinfo_v1), 727 .checkentry = recent_mt_check_v1, 728 .destroy = recent_mt_destroy, 729 .me = THIS_MODULE, 730 } 731 }; 732 733 static int __init recent_mt_init(void) 734 { 735 int err; 736 737 BUILD_BUG_ON_NOT_POWER_OF_2(XT_RECENT_MAX_NSTAMPS); 738 739 if (!ip_list_tot || ip_pkt_list_tot >= XT_RECENT_MAX_NSTAMPS) 740 return -EINVAL; 741 ip_list_hash_size = 1 << fls(ip_list_tot); 742 743 err = register_pernet_subsys(&recent_net_ops); 744 if (err) 745 return err; 746 err = xt_register_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg)); 747 if (err) 748 unregister_pernet_subsys(&recent_net_ops); 749 return err; 750 } 751 752 static void __exit recent_mt_exit(void) 753 { 754 xt_unregister_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg)); 755 unregister_pernet_subsys(&recent_net_ops); 756 } 757 758 module_init(recent_mt_init); 759 module_exit(recent_mt_exit); 760