]> git.proxmox.com Git - mirror_ubuntu-bionic-kernel.git/blame - net/netfilter/xt_recent.c
Merge branches 'topic/asoc', 'topic/misc-fixes' and 'topic/hda' into for-linus
[mirror_ubuntu-bionic-kernel.git] / net / netfilter / xt_recent.c
CommitLineData
404bdbfd
PM
1/*
2 * Copyright (c) 2006 Patrick McHardy <kaber@trash.net>
079aa88f 3 * Copyright © CC Computer Consultants GmbH, 2007 - 2008
404bdbfd
PM
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#include <linux/init.h>
6709dbbb 16#include <linux/ip.h>
079aa88f
JE
17#include <linux/ipv6.h>
18#include <linux/module.h>
404bdbfd 19#include <linux/moduleparam.h>
1da177e4 20#include <linux/proc_fs.h>
404bdbfd
PM
21#include <linux/seq_file.h>
22#include <linux/string.h>
1da177e4 23#include <linux/ctype.h>
404bdbfd
PM
24#include <linux/list.h>
25#include <linux/random.h>
26#include <linux/jhash.h>
27#include <linux/bitops.h>
28#include <linux/skbuff.h>
29#include <linux/inet.h>
457c4cbc 30#include <net/net_namespace.h>
1da177e4 31
6709dbbb 32#include <linux/netfilter/x_tables.h>
e948b20a 33#include <linux/netfilter/xt_recent.h>
1da177e4 34
404bdbfd 35MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
079aa88f 36MODULE_AUTHOR("Jan Engelhardt <jengelh@computergmbh.de>");
2ae15b64 37MODULE_DESCRIPTION("Xtables: \"recently-seen\" host matching for IPv4");
404bdbfd 38MODULE_LICENSE("GPL");
e948b20a 39MODULE_ALIAS("ipt_recent");
079aa88f 40MODULE_ALIAS("ip6t_recent");
1da177e4 41
e7be6994
PM
42static unsigned int ip_list_tot = 100;
43static unsigned int ip_pkt_list_tot = 20;
44static unsigned int ip_list_hash_size = 0;
45static unsigned int ip_list_perms = 0644;
b93ff783
DDG
46static unsigned int ip_list_uid = 0;
47static unsigned int ip_list_gid = 0;
e7be6994
PM
48module_param(ip_list_tot, uint, 0400);
49module_param(ip_pkt_list_tot, uint, 0400);
50module_param(ip_list_hash_size, uint, 0400);
51module_param(ip_list_perms, uint, 0400);
b93ff783
DDG
52module_param(ip_list_uid, uint, 0400);
53module_param(ip_list_gid, uint, 0400);
404bdbfd
PM
54MODULE_PARM_DESC(ip_list_tot, "number of IPs to remember per list");
55MODULE_PARM_DESC(ip_pkt_list_tot, "number of packets per IP to remember (max. 255)");
56MODULE_PARM_DESC(ip_list_hash_size, "size of hash table used to look up IPs");
079aa88f
JE
57MODULE_PARM_DESC(ip_list_perms, "permissions on /proc/net/xt_recent/* files");
58MODULE_PARM_DESC(ip_list_uid,"owner of /proc/net/xt_recent/* files");
59MODULE_PARM_DESC(ip_list_gid,"owning group of /proc/net/xt_recent/* files");
404bdbfd 60
404bdbfd
PM
61struct recent_entry {
62 struct list_head list;
63 struct list_head lru_list;
079aa88f
JE
64 union nf_inet_addr addr;
65 u_int16_t family;
404bdbfd
PM
66 u_int8_t ttl;
67 u_int8_t index;
68 u_int16_t nstamps;
69 unsigned long stamps[0];
1da177e4
LT
70};
71
404bdbfd
PM
72struct recent_table {
73 struct list_head list;
e948b20a 74 char name[XT_RECENT_NAME_LEN];
1da177e4 75#ifdef CONFIG_PROC_FS
079aa88f 76 struct proc_dir_entry *proc_old, *proc;
404bdbfd
PM
77#endif
78 unsigned int refcnt;
79 unsigned int entries;
80 struct list_head lru_list;
81 struct list_head iphash[0];
1da177e4
LT
82};
83
404bdbfd 84static LIST_HEAD(tables);
1da177e4 85static DEFINE_SPINLOCK(recent_lock);
a0e889bb 86static DEFINE_MUTEX(recent_mutex);
1da177e4
LT
87
88#ifdef CONFIG_PROC_FS
079aa88f
JE
89#ifdef CONFIG_NETFILTER_XT_MATCH_RECENT_PROC_COMPAT
90static struct proc_dir_entry *proc_old_dir;
91#endif
92static struct proc_dir_entry *recent_proc_dir;
93static const struct file_operations recent_old_fops, recent_mt_fops;
1da177e4
LT
94#endif
95
404bdbfd 96static u_int32_t hash_rnd;
079aa88f
JE
97static bool hash_rnd_initted;
98
99static unsigned int recent_entry_hash4(const union nf_inet_addr *addr)
100{
101 if (!hash_rnd_initted) {
102 get_random_bytes(&hash_rnd, sizeof(hash_rnd));
103 hash_rnd_initted = true;
104 }
105 return jhash_1word((__force u32)addr->ip, hash_rnd) &
106 (ip_list_hash_size - 1);
107}
1da177e4 108
079aa88f 109static unsigned int recent_entry_hash6(const union nf_inet_addr *addr)
1da177e4 110{
404bdbfd 111 if (!hash_rnd_initted) {
079aa88f
JE
112 get_random_bytes(&hash_rnd, sizeof(hash_rnd));
113 hash_rnd_initted = true;
1da177e4 114 }
079aa88f
JE
115 return jhash2((u32 *)addr->ip6, ARRAY_SIZE(addr->ip6), hash_rnd) &
116 (ip_list_hash_size - 1);
1da177e4
LT
117}
118
404bdbfd 119static struct recent_entry *
079aa88f
JE
120recent_entry_lookup(const struct recent_table *table,
121 const union nf_inet_addr *addrp, u_int16_t family,
122 u_int8_t ttl)
1da177e4 123{
404bdbfd
PM
124 struct recent_entry *e;
125 unsigned int h;
126
ee999d8b 127 if (family == NFPROTO_IPV4)
079aa88f
JE
128 h = recent_entry_hash4(addrp);
129 else
130 h = recent_entry_hash6(addrp);
131
404bdbfd 132 list_for_each_entry(e, &table->iphash[h], list)
079aa88f
JE
133 if (e->family == family &&
134 memcmp(&e->addr, addrp, sizeof(e->addr)) == 0 &&
135 (ttl == e->ttl || ttl == 0 || e->ttl == 0))
404bdbfd
PM
136 return e;
137 return NULL;
138}
1da177e4 139
404bdbfd
PM
140static void recent_entry_remove(struct recent_table *t, struct recent_entry *e)
141{
142 list_del(&e->list);
143 list_del(&e->lru_list);
144 kfree(e);
145 t->entries--;
146}
1da177e4 147
404bdbfd 148static struct recent_entry *
079aa88f
JE
149recent_entry_init(struct recent_table *t, const union nf_inet_addr *addr,
150 u_int16_t family, u_int8_t ttl)
404bdbfd
PM
151{
152 struct recent_entry *e;
1da177e4 153
404bdbfd
PM
154 if (t->entries >= ip_list_tot) {
155 e = list_entry(t->lru_list.next, struct recent_entry, lru_list);
156 recent_entry_remove(t, e);
1da177e4 157 }
404bdbfd
PM
158 e = kmalloc(sizeof(*e) + sizeof(e->stamps[0]) * ip_pkt_list_tot,
159 GFP_ATOMIC);
160 if (e == NULL)
161 return NULL;
079aa88f 162 memcpy(&e->addr, addr, sizeof(e->addr));
404bdbfd
PM
163 e->ttl = ttl;
164 e->stamps[0] = jiffies;
165 e->nstamps = 1;
166 e->index = 1;
079aa88f 167 e->family = family;
ee999d8b 168 if (family == NFPROTO_IPV4)
079aa88f
JE
169 list_add_tail(&e->list, &t->iphash[recent_entry_hash4(addr)]);
170 else
171 list_add_tail(&e->list, &t->iphash[recent_entry_hash6(addr)]);
404bdbfd
PM
172 list_add_tail(&e->lru_list, &t->lru_list);
173 t->entries++;
174 return e;
175}
1da177e4 176
404bdbfd
PM
177static void recent_entry_update(struct recent_table *t, struct recent_entry *e)
178{
179 e->stamps[e->index++] = jiffies;
180 if (e->index > e->nstamps)
181 e->nstamps = e->index;
182 e->index %= ip_pkt_list_tot;
183 list_move_tail(&e->lru_list, &t->lru_list);
184}
1da177e4 185
404bdbfd
PM
186static struct recent_table *recent_table_lookup(const char *name)
187{
188 struct recent_table *t;
1da177e4 189
404bdbfd
PM
190 list_for_each_entry(t, &tables, list)
191 if (!strcmp(t->name, name))
192 return t;
193 return NULL;
194}
1da177e4 195
404bdbfd
PM
196static void recent_table_flush(struct recent_table *t)
197{
198 struct recent_entry *e, *next;
199 unsigned int i;
1da177e4 200
7c4e36bc 201 for (i = 0; i < ip_list_hash_size; i++)
404bdbfd
PM
202 list_for_each_entry_safe(e, next, &t->iphash[i], list)
203 recent_entry_remove(t, e);
1da177e4
LT
204}
205
1d93a9cb 206static bool
f7108a20 207recent_mt(const struct sk_buff *skb, const struct xt_match_param *par)
1da177e4 208{
f7108a20 209 const struct xt_recent_mtinfo *info = par->matchinfo;
404bdbfd
PM
210 struct recent_table *t;
211 struct recent_entry *e;
079aa88f 212 union nf_inet_addr addr = {};
404bdbfd 213 u_int8_t ttl;
1d93a9cb 214 bool ret = info->invert;
1da177e4 215
f7108a20 216 if (par->match->family == NFPROTO_IPV4) {
079aa88f
JE
217 const struct iphdr *iph = ip_hdr(skb);
218
219 if (info->side == XT_RECENT_DEST)
220 addr.ip = iph->daddr;
221 else
222 addr.ip = iph->saddr;
223
224 ttl = iph->ttl;
225 } else {
226 const struct ipv6hdr *iph = ipv6_hdr(skb);
227
228 if (info->side == XT_RECENT_DEST)
229 memcpy(&addr.in6, &iph->daddr, sizeof(addr.in6));
230 else
231 memcpy(&addr.in6, &iph->saddr, sizeof(addr.in6));
232
233 ttl = iph->hop_limit;
234 }
1da177e4 235
404bdbfd 236 /* use TTL as seen before forwarding */
f7108a20 237 if (par->out != NULL && skb->sk == NULL)
404bdbfd 238 ttl++;
1da177e4 239
1da177e4 240 spin_lock_bh(&recent_lock);
404bdbfd 241 t = recent_table_lookup(info->name);
f7108a20 242 e = recent_entry_lookup(t, &addr, par->match->family,
079aa88f 243 (info->check_set & XT_RECENT_TTL) ? ttl : 0);
404bdbfd 244 if (e == NULL) {
e948b20a 245 if (!(info->check_set & XT_RECENT_SET))
404bdbfd 246 goto out;
f7108a20 247 e = recent_entry_init(t, &addr, par->match->family, ttl);
404bdbfd 248 if (e == NULL)
f7108a20 249 *par->hotdrop = true;
1d93a9cb 250 ret = !ret;
404bdbfd 251 goto out;
1da177e4
LT
252 }
253
e948b20a 254 if (info->check_set & XT_RECENT_SET)
1d93a9cb 255 ret = !ret;
e948b20a 256 else if (info->check_set & XT_RECENT_REMOVE) {
404bdbfd 257 recent_entry_remove(t, e);
1d93a9cb 258 ret = !ret;
e948b20a 259 } else if (info->check_set & (XT_RECENT_CHECK | XT_RECENT_UPDATE)) {
855304af 260 unsigned long time = jiffies - info->seconds * HZ;
404bdbfd
PM
261 unsigned int i, hits = 0;
262
263 for (i = 0; i < e->nstamps; i++) {
855304af 264 if (info->seconds && time_after(time, e->stamps[i]))
404bdbfd
PM
265 continue;
266 if (++hits >= info->hit_count) {
1d93a9cb 267 ret = !ret;
404bdbfd 268 break;
1da177e4 269 }
1da177e4 270 }
1da177e4
LT
271 }
272
e948b20a
JE
273 if (info->check_set & XT_RECENT_SET ||
274 (info->check_set & XT_RECENT_UPDATE && ret)) {
404bdbfd
PM
275 recent_entry_update(t, e);
276 e->ttl = ttl;
277 }
278out:
279 spin_unlock_bh(&recent_lock);
280 return ret;
1da177e4
LT
281}
282
9b4fce7a 283static bool recent_mt_check(const struct xt_mtchk_param *par)
1da177e4 284{
9b4fce7a 285 const struct xt_recent_mtinfo *info = par->matchinfo;
404bdbfd
PM
286 struct recent_table *t;
287 unsigned i;
ccb79bdc 288 bool ret = false;
1da177e4 289
404bdbfd 290 if (hweight8(info->check_set &
e948b20a
JE
291 (XT_RECENT_SET | XT_RECENT_REMOVE |
292 XT_RECENT_CHECK | XT_RECENT_UPDATE)) != 1)
ccb79bdc 293 return false;
e948b20a 294 if ((info->check_set & (XT_RECENT_SET | XT_RECENT_REMOVE)) &&
404bdbfd 295 (info->seconds || info->hit_count))
ccb79bdc 296 return false;
d0ebf133
DHZ
297 if (info->hit_count > ip_pkt_list_tot)
298 return false;
404bdbfd 299 if (info->name[0] == '\0' ||
e948b20a 300 strnlen(info->name, XT_RECENT_NAME_LEN) == XT_RECENT_NAME_LEN)
ccb79bdc 301 return false;
1da177e4 302
a0e889bb 303 mutex_lock(&recent_mutex);
404bdbfd
PM
304 t = recent_table_lookup(info->name);
305 if (t != NULL) {
306 t->refcnt++;
ccb79bdc 307 ret = true;
404bdbfd 308 goto out;
1da177e4
LT
309 }
310
404bdbfd 311 t = kzalloc(sizeof(*t) + sizeof(t->iphash[0]) * ip_list_hash_size,
a0e889bb 312 GFP_KERNEL);
404bdbfd
PM
313 if (t == NULL)
314 goto out;
2b2283d0 315 t->refcnt = 1;
404bdbfd
PM
316 strcpy(t->name, info->name);
317 INIT_LIST_HEAD(&t->lru_list);
318 for (i = 0; i < ip_list_hash_size; i++)
319 INIT_LIST_HEAD(&t->iphash[i]);
320#ifdef CONFIG_PROC_FS
079aa88f
JE
321 t->proc = proc_create(t->name, ip_list_perms, recent_proc_dir,
322 &recent_mt_fops);
404bdbfd
PM
323 if (t->proc == NULL) {
324 kfree(t);
325 goto out;
1da177e4 326 }
079aa88f
JE
327#ifdef CONFIG_NETFILTER_XT_MATCH_RECENT_PROC_COMPAT
328 t->proc_old = proc_create(t->name, ip_list_perms, proc_old_dir,
329 &recent_old_fops);
330 if (t->proc_old == NULL) {
331 remove_proc_entry(t->name, proc_old_dir);
332 kfree(t);
333 goto out;
334 }
335 t->proc_old->uid = ip_list_uid;
336 t->proc_old->gid = ip_list_gid;
337 t->proc_old->data = t;
338#endif
b93ff783
DDG
339 t->proc->uid = ip_list_uid;
340 t->proc->gid = ip_list_gid;
404bdbfd 341 t->proc->data = t;
1da177e4 342#endif
a0e889bb 343 spin_lock_bh(&recent_lock);
404bdbfd 344 list_add_tail(&t->list, &tables);
a0e889bb 345 spin_unlock_bh(&recent_lock);
ccb79bdc 346 ret = true;
404bdbfd 347out:
a0e889bb 348 mutex_unlock(&recent_mutex);
404bdbfd
PM
349 return ret;
350}
1da177e4 351
6be3d859 352static void recent_mt_destroy(const struct xt_mtdtor_param *par)
404bdbfd 353{
6be3d859 354 const struct xt_recent_mtinfo *info = par->matchinfo;
404bdbfd 355 struct recent_table *t;
1da177e4 356
a0e889bb 357 mutex_lock(&recent_mutex);
404bdbfd
PM
358 t = recent_table_lookup(info->name);
359 if (--t->refcnt == 0) {
a0e889bb 360 spin_lock_bh(&recent_lock);
404bdbfd 361 list_del(&t->list);
a0e889bb 362 spin_unlock_bh(&recent_lock);
404bdbfd 363#ifdef CONFIG_PROC_FS
079aa88f
JE
364#ifdef CONFIG_NETFILTER_XT_MATCH_RECENT_PROC_COMPAT
365 remove_proc_entry(t->name, proc_old_dir);
366#endif
367 remove_proc_entry(t->name, recent_proc_dir);
1da177e4 368#endif
a8ddc916 369 recent_table_flush(t);
404bdbfd 370 kfree(t);
1da177e4 371 }
a0e889bb 372 mutex_unlock(&recent_mutex);
404bdbfd 373}
1da177e4 374
404bdbfd
PM
375#ifdef CONFIG_PROC_FS
376struct recent_iter_state {
079aa88f 377 const struct recent_table *table;
404bdbfd
PM
378 unsigned int bucket;
379};
1da177e4 380
404bdbfd 381static void *recent_seq_start(struct seq_file *seq, loff_t *pos)
855304af 382 __acquires(recent_lock)
404bdbfd
PM
383{
384 struct recent_iter_state *st = seq->private;
a47362a2 385 const struct recent_table *t = st->table;
404bdbfd
PM
386 struct recent_entry *e;
387 loff_t p = *pos;
1da177e4 388
1da177e4 389 spin_lock_bh(&recent_lock);
1da177e4 390
7c4e36bc
JE
391 for (st->bucket = 0; st->bucket < ip_list_hash_size; st->bucket++)
392 list_for_each_entry(e, &t->iphash[st->bucket], list)
404bdbfd
PM
393 if (p-- == 0)
394 return e;
404bdbfd
PM
395 return NULL;
396}
1da177e4 397
404bdbfd
PM
398static void *recent_seq_next(struct seq_file *seq, void *v, loff_t *pos)
399{
400 struct recent_iter_state *st = seq->private;
3cf93c96 401 const struct recent_table *t = st->table;
079aa88f
JE
402 const struct recent_entry *e = v;
403 const struct list_head *head = e->list.next;
404bdbfd
PM
404
405 while (head == &t->iphash[st->bucket]) {
406 if (++st->bucket >= ip_list_hash_size)
407 return NULL;
408 head = t->iphash[st->bucket].next;
409 }
410 (*pos)++;
411 return list_entry(head, struct recent_entry, list);
1da177e4
LT
412}
413
404bdbfd 414static void recent_seq_stop(struct seq_file *s, void *v)
855304af 415 __releases(recent_lock)
1da177e4 416{
404bdbfd
PM
417 spin_unlock_bh(&recent_lock);
418}
1da177e4 419
404bdbfd
PM
420static int recent_seq_show(struct seq_file *seq, void *v)
421{
3cf93c96 422 const struct recent_entry *e = v;
404bdbfd
PM
423 unsigned int i;
424
425 i = (e->index - 1) % ip_pkt_list_tot;
ee999d8b 426 if (e->family == NFPROTO_IPV4)
079aa88f
JE
427 seq_printf(seq, "src=" NIPQUAD_FMT " ttl: %u last_seen: %lu "
428 "oldest_pkt: %u", NIPQUAD(e->addr.ip), e->ttl,
429 e->stamps[i], e->index);
430 else
431 seq_printf(seq, "src=" NIP6_FMT " ttl: %u last_seen: %lu "
432 "oldest_pkt: %u", NIP6(e->addr.in6), e->ttl,
433 e->stamps[i], e->index);
404bdbfd
PM
434 for (i = 0; i < e->nstamps; i++)
435 seq_printf(seq, "%s %lu", i ? "," : "", e->stamps[i]);
436 seq_printf(seq, "\n");
437 return 0;
438}
1da177e4 439
56b3d975 440static const struct seq_operations recent_seq_ops = {
404bdbfd
PM
441 .start = recent_seq_start,
442 .next = recent_seq_next,
443 .stop = recent_seq_stop,
444 .show = recent_seq_show,
445};
1da177e4 446
404bdbfd
PM
447static int recent_seq_open(struct inode *inode, struct file *file)
448{
449 struct proc_dir_entry *pde = PDE(inode);
404bdbfd 450 struct recent_iter_state *st;
404bdbfd 451
e2da5913 452 st = __seq_open_private(file, &recent_seq_ops, sizeof(*st));
404bdbfd
PM
453 if (st == NULL)
454 return -ENOMEM;
3af8e31c 455
404bdbfd 456 st->table = pde->data;
e2da5913 457 return 0;
404bdbfd 458}
1da177e4 459
079aa88f
JE
460#ifdef CONFIG_NETFILTER_XT_MATCH_RECENT_PROC_COMPAT
461static int recent_old_seq_open(struct inode *inode, struct file *filp)
462{
463 static bool warned_of_old;
464
465 if (unlikely(!warned_of_old)) {
466 printk(KERN_INFO KBUILD_MODNAME ": Use of /proc/net/ipt_recent"
467 " is deprecated; use /proc/net/xt_recent.\n");
468 warned_of_old = true;
469 }
470 return recent_seq_open(inode, filp);
471}
472
473static ssize_t recent_old_proc_write(struct file *file,
474 const char __user *input,
475 size_t size, loff_t *loff)
404bdbfd 476{
3cf93c96 477 const struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
404bdbfd
PM
478 struct recent_table *t = pde->data;
479 struct recent_entry *e;
480 char buf[sizeof("+255.255.255.255")], *c = buf;
6a19d614 481 __be32 addr;
404bdbfd
PM
482 int add;
483
484 if (size > sizeof(buf))
485 size = sizeof(buf);
486 if (copy_from_user(buf, input, size))
487 return -EFAULT;
079aa88f 488
404bdbfd
PM
489 while (isspace(*c))
490 c++;
491
492 if (size - (c - buf) < 5)
493 return c - buf;
494 if (!strncmp(c, "clear", 5)) {
495 c += 5;
496 spin_lock_bh(&recent_lock);
497 recent_table_flush(t);
1da177e4 498 spin_unlock_bh(&recent_lock);
404bdbfd 499 return c - buf;
1da177e4 500 }
1da177e4 501
404bdbfd
PM
502 switch (*c) {
503 case '-':
504 add = 0;
505 c++;
506 break;
507 case '+':
508 c++;
509 default:
510 add = 1;
511 break;
1da177e4 512 }
404bdbfd 513 addr = in_aton(c);
1da177e4 514
404bdbfd 515 spin_lock_bh(&recent_lock);
ee999d8b 516 e = recent_entry_lookup(t, (const void *)&addr, NFPROTO_IPV4, 0);
404bdbfd
PM
517 if (e == NULL) {
518 if (add)
ee999d8b
JE
519 recent_entry_init(t, (const void *)&addr,
520 NFPROTO_IPV4, 0);
404bdbfd
PM
521 } else {
522 if (add)
523 recent_entry_update(t, e);
524 else
525 recent_entry_remove(t, e);
1da177e4 526 }
1da177e4 527 spin_unlock_bh(&recent_lock);
404bdbfd
PM
528 return size;
529}
1da177e4 530
079aa88f
JE
531static const struct file_operations recent_old_fops = {
532 .open = recent_old_seq_open,
404bdbfd 533 .read = seq_read,
079aa88f 534 .write = recent_old_proc_write,
404bdbfd
PM
535 .release = seq_release_private,
536 .owner = THIS_MODULE,
537};
079aa88f
JE
538#endif
539
540static ssize_t
541recent_mt_proc_write(struct file *file, const char __user *input,
542 size_t size, loff_t *loff)
543{
544 const struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
545 struct recent_table *t = pde->data;
546 struct recent_entry *e;
547 char buf[sizeof("+b335:1d35:1e55:dead:c0de:1715:5afe:c0de")];
548 const char *c = buf;
549 union nf_inet_addr addr;
550 u_int16_t family;
551 bool add, succ;
552
553 if (size == 0)
554 return 0;
555 if (size > sizeof(buf))
556 size = sizeof(buf);
557 if (copy_from_user(buf, input, size) != 0)
558 return -EFAULT;
559
560 /* Strict protocol! */
561 if (*loff != 0)
562 return -ESPIPE;
563 switch (*c) {
564 case '/': /* flush table */
565 spin_lock_bh(&recent_lock);
566 recent_table_flush(t);
567 spin_unlock_bh(&recent_lock);
568 return size;
569 case '-': /* remove address */
570 add = false;
571 break;
572 case '+': /* add address */
573 add = true;
574 break;
575 default:
576 printk(KERN_INFO KBUILD_MODNAME ": Need +ip, -ip or /\n");
577 return -EINVAL;
578 }
579
580 ++c;
581 --size;
582 if (strnchr(c, size, ':') != NULL) {
ee999d8b 583 family = NFPROTO_IPV6;
079aa88f
JE
584 succ = in6_pton(c, size, (void *)&addr, '\n', NULL);
585 } else {
ee999d8b 586 family = NFPROTO_IPV4;
079aa88f
JE
587 succ = in4_pton(c, size, (void *)&addr, '\n', NULL);
588 }
589
590 if (!succ) {
591 printk(KERN_INFO KBUILD_MODNAME ": illegal address written "
592 "to procfs\n");
593 return -EINVAL;
594 }
595
596 spin_lock_bh(&recent_lock);
597 e = recent_entry_lookup(t, &addr, family, 0);
598 if (e == NULL) {
599 if (add)
600 recent_entry_init(t, &addr, family, 0);
601 } else {
602 if (add)
603 recent_entry_update(t, e);
604 else
605 recent_entry_remove(t, e);
606 }
607 spin_unlock_bh(&recent_lock);
608 /* Note we removed one above */
609 *loff += size + 1;
610 return size + 1;
611}
612
613static const struct file_operations recent_mt_fops = {
614 .open = recent_seq_open,
615 .read = seq_read,
616 .write = recent_mt_proc_write,
617 .release = seq_release_private,
618 .owner = THIS_MODULE,
619};
1da177e4 620#endif /* CONFIG_PROC_FS */
1da177e4 621
079aa88f
JE
622static struct xt_match recent_mt_reg[] __read_mostly = {
623 {
624 .name = "recent",
625 .revision = 0,
ee999d8b 626 .family = NFPROTO_IPV4,
079aa88f
JE
627 .match = recent_mt,
628 .matchsize = sizeof(struct xt_recent_mtinfo),
629 .checkentry = recent_mt_check,
630 .destroy = recent_mt_destroy,
631 .me = THIS_MODULE,
632 },
633 {
634 .name = "recent",
635 .revision = 0,
ee999d8b 636 .family = NFPROTO_IPV6,
079aa88f
JE
637 .match = recent_mt,
638 .matchsize = sizeof(struct xt_recent_mtinfo),
639 .checkentry = recent_mt_check,
640 .destroy = recent_mt_destroy,
641 .me = THIS_MODULE,
642 },
1da177e4
LT
643};
644
d3c5ee6d 645static int __init recent_mt_init(void)
1da177e4 646{
404bdbfd 647 int err;
1da177e4 648
404bdbfd
PM
649 if (!ip_list_tot || !ip_pkt_list_tot || ip_pkt_list_tot > 255)
650 return -EINVAL;
651 ip_list_hash_size = 1 << fls(ip_list_tot);
1da177e4 652
079aa88f 653 err = xt_register_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg));
404bdbfd 654#ifdef CONFIG_PROC_FS
1da177e4 655 if (err)
404bdbfd 656 return err;
079aa88f
JE
657 recent_proc_dir = proc_mkdir("xt_recent", init_net.proc_net);
658 if (recent_proc_dir == NULL) {
659 xt_unregister_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg));
660 err = -ENOMEM;
661 }
662#ifdef CONFIG_NETFILTER_XT_MATCH_RECENT_PROC_COMPAT
663 if (err < 0)
664 return err;
665 proc_old_dir = proc_mkdir("ipt_recent", init_net.proc_net);
666 if (proc_old_dir == NULL) {
667 remove_proc_entry("xt_recent", init_net.proc_net);
668 xt_unregister_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg));
404bdbfd
PM
669 err = -ENOMEM;
670 }
079aa88f 671#endif
404bdbfd 672#endif
1da177e4
LT
673 return err;
674}
675
d3c5ee6d 676static void __exit recent_mt_exit(void)
1da177e4 677{
404bdbfd 678 BUG_ON(!list_empty(&tables));
079aa88f 679 xt_unregister_matches(recent_mt_reg, ARRAY_SIZE(recent_mt_reg));
404bdbfd 680#ifdef CONFIG_PROC_FS
079aa88f 681#ifdef CONFIG_NETFILTER_XT_MATCH_RECENT_PROC_COMPAT
457c4cbc 682 remove_proc_entry("ipt_recent", init_net.proc_net);
079aa88f
JE
683#endif
684 remove_proc_entry("xt_recent", init_net.proc_net);
404bdbfd 685#endif
1da177e4
LT
686}
687
d3c5ee6d
JE
688module_init(recent_mt_init);
689module_exit(recent_mt_exit);