]> bbs.cooldavid.org Git - net-next-2.6.git/blame - net/ipv4/netfilter/ipt_recent.c
Merge branch 'fixes-davem' of master.kernel.org:/pub/scm/linux/kernel/git/linville...
[net-next-2.6.git] / net / ipv4 / netfilter / ipt_recent.c
CommitLineData
404bdbfd
PM
1/*
2 * Copyright (c) 2006 Patrick McHardy <kaber@trash.net>
3 *
4 * This program is free software; you can redistribute it and/or modify
5 * it under the terms of the GNU General Public License version 2 as
6 * published by the Free Software Foundation.
7 *
8 * This is a replacement of the old ipt_recent module, which carried the
9 * following copyright notice:
10 *
11 * Author: Stephen Frost <sfrost@snowman.net>
12 * Copyright 2002-2003, Stephen Frost, 2.5.x port by laforge@netfilter.org
13 */
14#include <linux/init.h>
6709dbbb 15#include <linux/ip.h>
404bdbfd 16#include <linux/moduleparam.h>
1da177e4 17#include <linux/proc_fs.h>
404bdbfd
PM
18#include <linux/seq_file.h>
19#include <linux/string.h>
1da177e4 20#include <linux/ctype.h>
404bdbfd
PM
21#include <linux/list.h>
22#include <linux/random.h>
23#include <linux/jhash.h>
24#include <linux/bitops.h>
25#include <linux/skbuff.h>
26#include <linux/inet.h>
1da177e4 27
6709dbbb 28#include <linux/netfilter/x_tables.h>
1da177e4
LT
29#include <linux/netfilter_ipv4/ipt_recent.h>
30
404bdbfd
PM
31MODULE_AUTHOR("Patrick McHardy <kaber@trash.net>");
32MODULE_DESCRIPTION("IP tables recently seen matching module");
33MODULE_LICENSE("GPL");
1da177e4 34
e7be6994
PM
35static unsigned int ip_list_tot = 100;
36static unsigned int ip_pkt_list_tot = 20;
37static unsigned int ip_list_hash_size = 0;
38static unsigned int ip_list_perms = 0644;
b93ff783
DDG
39static unsigned int ip_list_uid = 0;
40static unsigned int ip_list_gid = 0;
e7be6994
PM
41module_param(ip_list_tot, uint, 0400);
42module_param(ip_pkt_list_tot, uint, 0400);
43module_param(ip_list_hash_size, uint, 0400);
44module_param(ip_list_perms, uint, 0400);
b93ff783
DDG
45module_param(ip_list_uid, uint, 0400);
46module_param(ip_list_gid, uint, 0400);
404bdbfd
PM
47MODULE_PARM_DESC(ip_list_tot, "number of IPs to remember per list");
48MODULE_PARM_DESC(ip_pkt_list_tot, "number of packets per IP to remember (max. 255)");
49MODULE_PARM_DESC(ip_list_hash_size, "size of hash table used to look up IPs");
50MODULE_PARM_DESC(ip_list_perms, "permissions on /proc/net/ipt_recent/* files");
b93ff783
DDG
51MODULE_PARM_DESC(ip_list_uid,"owner of /proc/net/ipt_recent/* files");
52MODULE_PARM_DESC(ip_list_gid,"owning group of /proc/net/ipt_recent/* files");
404bdbfd 53
404bdbfd
PM
54struct recent_entry {
55 struct list_head list;
56 struct list_head lru_list;
6a19d614 57 __be32 addr;
404bdbfd
PM
58 u_int8_t ttl;
59 u_int8_t index;
60 u_int16_t nstamps;
61 unsigned long stamps[0];
1da177e4
LT
62};
63
404bdbfd
PM
64struct recent_table {
65 struct list_head list;
66 char name[IPT_RECENT_NAME_LEN];
1da177e4 67#ifdef CONFIG_PROC_FS
404bdbfd
PM
68 struct proc_dir_entry *proc;
69#endif
70 unsigned int refcnt;
71 unsigned int entries;
72 struct list_head lru_list;
73 struct list_head iphash[0];
1da177e4
LT
74};
75
404bdbfd 76static LIST_HEAD(tables);
1da177e4 77static DEFINE_SPINLOCK(recent_lock);
a0e889bb 78static DEFINE_MUTEX(recent_mutex);
1da177e4
LT
79
80#ifdef CONFIG_PROC_FS
404bdbfd 81static struct proc_dir_entry *proc_dir;
9a32144e 82static const struct file_operations recent_fops;
1da177e4
LT
83#endif
84
404bdbfd
PM
85static u_int32_t hash_rnd;
86static int hash_rnd_initted;
1da177e4 87
6a19d614 88static unsigned int recent_entry_hash(__be32 addr)
1da177e4 89{
404bdbfd
PM
90 if (!hash_rnd_initted) {
91 get_random_bytes(&hash_rnd, 4);
92 hash_rnd_initted = 1;
1da177e4 93 }
6a19d614 94 return jhash_1word((__force u32)addr, hash_rnd) & (ip_list_hash_size - 1);
1da177e4
LT
95}
96
404bdbfd 97static struct recent_entry *
6a19d614 98recent_entry_lookup(const struct recent_table *table, __be32 addr, u_int8_t ttl)
1da177e4 99{
404bdbfd
PM
100 struct recent_entry *e;
101 unsigned int h;
102
103 h = recent_entry_hash(addr);
104 list_for_each_entry(e, &table->iphash[h], list)
105 if (e->addr == addr && (ttl == e->ttl || !ttl || !e->ttl))
106 return e;
107 return NULL;
108}
1da177e4 109
404bdbfd
PM
110static void recent_entry_remove(struct recent_table *t, struct recent_entry *e)
111{
112 list_del(&e->list);
113 list_del(&e->lru_list);
114 kfree(e);
115 t->entries--;
116}
1da177e4 117
404bdbfd 118static struct recent_entry *
6a19d614 119recent_entry_init(struct recent_table *t, __be32 addr, u_int8_t ttl)
404bdbfd
PM
120{
121 struct recent_entry *e;
1da177e4 122
404bdbfd
PM
123 if (t->entries >= ip_list_tot) {
124 e = list_entry(t->lru_list.next, struct recent_entry, lru_list);
125 recent_entry_remove(t, e);
1da177e4 126 }
404bdbfd
PM
127 e = kmalloc(sizeof(*e) + sizeof(e->stamps[0]) * ip_pkt_list_tot,
128 GFP_ATOMIC);
129 if (e == NULL)
130 return NULL;
131 e->addr = addr;
132 e->ttl = ttl;
133 e->stamps[0] = jiffies;
134 e->nstamps = 1;
135 e->index = 1;
136 list_add_tail(&e->list, &t->iphash[recent_entry_hash(addr)]);
137 list_add_tail(&e->lru_list, &t->lru_list);
138 t->entries++;
139 return e;
140}
1da177e4 141
404bdbfd
PM
142static void recent_entry_update(struct recent_table *t, struct recent_entry *e)
143{
144 e->stamps[e->index++] = jiffies;
145 if (e->index > e->nstamps)
146 e->nstamps = e->index;
147 e->index %= ip_pkt_list_tot;
148 list_move_tail(&e->lru_list, &t->lru_list);
149}
1da177e4 150
404bdbfd
PM
151static struct recent_table *recent_table_lookup(const char *name)
152{
153 struct recent_table *t;
1da177e4 154
404bdbfd
PM
155 list_for_each_entry(t, &tables, list)
156 if (!strcmp(t->name, name))
157 return t;
158 return NULL;
159}
1da177e4 160
404bdbfd
PM
161static void recent_table_flush(struct recent_table *t)
162{
163 struct recent_entry *e, *next;
164 unsigned int i;
1da177e4 165
7c4e36bc 166 for (i = 0; i < ip_list_hash_size; i++)
404bdbfd
PM
167 list_for_each_entry_safe(e, next, &t->iphash[i], list)
168 recent_entry_remove(t, e);
1da177e4
LT
169}
170
1d93a9cb 171static bool
404bdbfd
PM
172ipt_recent_match(const struct sk_buff *skb,
173 const struct net_device *in, const struct net_device *out,
174 const struct xt_match *match, const void *matchinfo,
cff533ac 175 int offset, unsigned int protoff, bool *hotdrop)
1da177e4 176{
1da177e4 177 const struct ipt_recent_info *info = matchinfo;
404bdbfd
PM
178 struct recent_table *t;
179 struct recent_entry *e;
6a19d614 180 __be32 addr;
404bdbfd 181 u_int8_t ttl;
1d93a9cb 182 bool ret = info->invert;
1da177e4 183
404bdbfd 184 if (info->side == IPT_RECENT_DEST)
eddc9ec5 185 addr = ip_hdr(skb)->daddr;
404bdbfd 186 else
eddc9ec5 187 addr = ip_hdr(skb)->saddr;
1da177e4 188
eddc9ec5 189 ttl = ip_hdr(skb)->ttl;
404bdbfd
PM
190 /* use TTL as seen before forwarding */
191 if (out && !skb->sk)
192 ttl++;
1da177e4 193
1da177e4 194 spin_lock_bh(&recent_lock);
404bdbfd
PM
195 t = recent_table_lookup(info->name);
196 e = recent_entry_lookup(t, addr,
197 info->check_set & IPT_RECENT_TTL ? ttl : 0);
198 if (e == NULL) {
199 if (!(info->check_set & IPT_RECENT_SET))
200 goto out;
201 e = recent_entry_init(t, addr, ttl);
202 if (e == NULL)
cff533ac 203 *hotdrop = true;
1d93a9cb 204 ret = !ret;
404bdbfd 205 goto out;
1da177e4
LT
206 }
207
404bdbfd 208 if (info->check_set & IPT_RECENT_SET)
1d93a9cb 209 ret = !ret;
404bdbfd
PM
210 else if (info->check_set & IPT_RECENT_REMOVE) {
211 recent_entry_remove(t, e);
1d93a9cb 212 ret = !ret;
404bdbfd
PM
213 } else if (info->check_set & (IPT_RECENT_CHECK | IPT_RECENT_UPDATE)) {
214 unsigned long t = jiffies - info->seconds * HZ;
215 unsigned int i, hits = 0;
216
217 for (i = 0; i < e->nstamps; i++) {
218 if (info->seconds && time_after(t, e->stamps[i]))
219 continue;
220 if (++hits >= info->hit_count) {
1d93a9cb 221 ret = !ret;
404bdbfd 222 break;
1da177e4 223 }
1da177e4 224 }
1da177e4
LT
225 }
226
404bdbfd
PM
227 if (info->check_set & IPT_RECENT_SET ||
228 (info->check_set & IPT_RECENT_UPDATE && ret)) {
229 recent_entry_update(t, e);
230 e->ttl = ttl;
231 }
232out:
233 spin_unlock_bh(&recent_lock);
234 return ret;
1da177e4
LT
235}
236
ccb79bdc 237static bool
404bdbfd
PM
238ipt_recent_checkentry(const char *tablename, const void *ip,
239 const struct xt_match *match, void *matchinfo,
efa74165 240 unsigned int hook_mask)
1da177e4 241{
1da177e4 242 const struct ipt_recent_info *info = matchinfo;
404bdbfd
PM
243 struct recent_table *t;
244 unsigned i;
ccb79bdc 245 bool ret = false;
1da177e4 246
404bdbfd
PM
247 if (hweight8(info->check_set &
248 (IPT_RECENT_SET | IPT_RECENT_REMOVE |
249 IPT_RECENT_CHECK | IPT_RECENT_UPDATE)) != 1)
ccb79bdc 250 return false;
404bdbfd
PM
251 if ((info->check_set & (IPT_RECENT_SET | IPT_RECENT_REMOVE)) &&
252 (info->seconds || info->hit_count))
ccb79bdc 253 return false;
404bdbfd
PM
254 if (info->name[0] == '\0' ||
255 strnlen(info->name, IPT_RECENT_NAME_LEN) == IPT_RECENT_NAME_LEN)
ccb79bdc 256 return false;
1da177e4 257
a0e889bb 258 mutex_lock(&recent_mutex);
404bdbfd
PM
259 t = recent_table_lookup(info->name);
260 if (t != NULL) {
261 t->refcnt++;
ccb79bdc 262 ret = true;
404bdbfd 263 goto out;
1da177e4
LT
264 }
265
404bdbfd 266 t = kzalloc(sizeof(*t) + sizeof(t->iphash[0]) * ip_list_hash_size,
a0e889bb 267 GFP_KERNEL);
404bdbfd
PM
268 if (t == NULL)
269 goto out;
2b2283d0 270 t->refcnt = 1;
404bdbfd
PM
271 strcpy(t->name, info->name);
272 INIT_LIST_HEAD(&t->lru_list);
273 for (i = 0; i < ip_list_hash_size; i++)
274 INIT_LIST_HEAD(&t->iphash[i]);
275#ifdef CONFIG_PROC_FS
276 t->proc = create_proc_entry(t->name, ip_list_perms, proc_dir);
277 if (t->proc == NULL) {
278 kfree(t);
279 goto out;
1da177e4 280 }
404bdbfd 281 t->proc->proc_fops = &recent_fops;
b93ff783
DDG
282 t->proc->uid = ip_list_uid;
283 t->proc->gid = ip_list_gid;
404bdbfd 284 t->proc->data = t;
1da177e4 285#endif
a0e889bb 286 spin_lock_bh(&recent_lock);
404bdbfd 287 list_add_tail(&t->list, &tables);
a0e889bb 288 spin_unlock_bh(&recent_lock);
ccb79bdc 289 ret = true;
404bdbfd 290out:
a0e889bb 291 mutex_unlock(&recent_mutex);
404bdbfd
PM
292 return ret;
293}
1da177e4 294
404bdbfd 295static void
efa74165 296ipt_recent_destroy(const struct xt_match *match, void *matchinfo)
404bdbfd
PM
297{
298 const struct ipt_recent_info *info = matchinfo;
299 struct recent_table *t;
1da177e4 300
a0e889bb 301 mutex_lock(&recent_mutex);
404bdbfd
PM
302 t = recent_table_lookup(info->name);
303 if (--t->refcnt == 0) {
a0e889bb 304 spin_lock_bh(&recent_lock);
404bdbfd 305 list_del(&t->list);
a0e889bb 306 spin_unlock_bh(&recent_lock);
404bdbfd
PM
307 recent_table_flush(t);
308#ifdef CONFIG_PROC_FS
309 remove_proc_entry(t->name, proc_dir);
1da177e4 310#endif
404bdbfd 311 kfree(t);
1da177e4 312 }
a0e889bb 313 mutex_unlock(&recent_mutex);
404bdbfd 314}
1da177e4 315
404bdbfd
PM
316#ifdef CONFIG_PROC_FS
317struct recent_iter_state {
318 struct recent_table *table;
319 unsigned int bucket;
320};
1da177e4 321
404bdbfd
PM
322static void *recent_seq_start(struct seq_file *seq, loff_t *pos)
323{
324 struct recent_iter_state *st = seq->private;
a47362a2 325 const struct recent_table *t = st->table;
404bdbfd
PM
326 struct recent_entry *e;
327 loff_t p = *pos;
1da177e4 328
1da177e4 329 spin_lock_bh(&recent_lock);
1da177e4 330
7c4e36bc
JE
331 for (st->bucket = 0; st->bucket < ip_list_hash_size; st->bucket++)
332 list_for_each_entry(e, &t->iphash[st->bucket], list)
404bdbfd
PM
333 if (p-- == 0)
334 return e;
404bdbfd
PM
335 return NULL;
336}
1da177e4 337
404bdbfd
PM
338static void *recent_seq_next(struct seq_file *seq, void *v, loff_t *pos)
339{
340 struct recent_iter_state *st = seq->private;
341 struct recent_table *t = st->table;
342 struct recent_entry *e = v;
343 struct list_head *head = e->list.next;
344
345 while (head == &t->iphash[st->bucket]) {
346 if (++st->bucket >= ip_list_hash_size)
347 return NULL;
348 head = t->iphash[st->bucket].next;
349 }
350 (*pos)++;
351 return list_entry(head, struct recent_entry, list);
1da177e4
LT
352}
353
404bdbfd 354static void recent_seq_stop(struct seq_file *s, void *v)
1da177e4 355{
404bdbfd
PM
356 spin_unlock_bh(&recent_lock);
357}
1da177e4 358
404bdbfd
PM
359static int recent_seq_show(struct seq_file *seq, void *v)
360{
361 struct recent_entry *e = v;
362 unsigned int i;
363
364 i = (e->index - 1) % ip_pkt_list_tot;
365 seq_printf(seq, "src=%u.%u.%u.%u ttl: %u last_seen: %lu oldest_pkt: %u",
366 NIPQUAD(e->addr), e->ttl, e->stamps[i], e->index);
367 for (i = 0; i < e->nstamps; i++)
368 seq_printf(seq, "%s %lu", i ? "," : "", e->stamps[i]);
369 seq_printf(seq, "\n");
370 return 0;
371}
1da177e4 372
56b3d975 373static const struct seq_operations recent_seq_ops = {
404bdbfd
PM
374 .start = recent_seq_start,
375 .next = recent_seq_next,
376 .stop = recent_seq_stop,
377 .show = recent_seq_show,
378};
1da177e4 379
404bdbfd
PM
380static int recent_seq_open(struct inode *inode, struct file *file)
381{
382 struct proc_dir_entry *pde = PDE(inode);
383 struct seq_file *seq;
384 struct recent_iter_state *st;
385 int ret;
386
387 st = kzalloc(sizeof(*st), GFP_KERNEL);
388 if (st == NULL)
389 return -ENOMEM;
390 ret = seq_open(file, &recent_seq_ops);
391 if (ret)
392 kfree(st);
393 st->table = pde->data;
394 seq = file->private_data;
395 seq->private = st;
396 return ret;
397}
1da177e4 398
404bdbfd
PM
399static ssize_t recent_proc_write(struct file *file, const char __user *input,
400 size_t size, loff_t *loff)
401{
6df81ab2 402 struct proc_dir_entry *pde = PDE(file->f_path.dentry->d_inode);
404bdbfd
PM
403 struct recent_table *t = pde->data;
404 struct recent_entry *e;
405 char buf[sizeof("+255.255.255.255")], *c = buf;
6a19d614 406 __be32 addr;
404bdbfd
PM
407 int add;
408
409 if (size > sizeof(buf))
410 size = sizeof(buf);
411 if (copy_from_user(buf, input, size))
412 return -EFAULT;
413 while (isspace(*c))
414 c++;
415
416 if (size - (c - buf) < 5)
417 return c - buf;
418 if (!strncmp(c, "clear", 5)) {
419 c += 5;
420 spin_lock_bh(&recent_lock);
421 recent_table_flush(t);
1da177e4 422 spin_unlock_bh(&recent_lock);
404bdbfd 423 return c - buf;
1da177e4 424 }
1da177e4 425
404bdbfd
PM
426 switch (*c) {
427 case '-':
428 add = 0;
429 c++;
430 break;
431 case '+':
432 c++;
433 default:
434 add = 1;
435 break;
1da177e4 436 }
404bdbfd 437 addr = in_aton(c);
1da177e4 438
404bdbfd
PM
439 spin_lock_bh(&recent_lock);
440 e = recent_entry_lookup(t, addr, 0);
441 if (e == NULL) {
442 if (add)
443 recent_entry_init(t, addr, 0);
444 } else {
445 if (add)
446 recent_entry_update(t, e);
447 else
448 recent_entry_remove(t, e);
1da177e4 449 }
1da177e4 450 spin_unlock_bh(&recent_lock);
404bdbfd
PM
451 return size;
452}
1da177e4 453
9a32144e 454static const struct file_operations recent_fops = {
404bdbfd
PM
455 .open = recent_seq_open,
456 .read = seq_read,
457 .write = recent_proc_write,
458 .release = seq_release_private,
459 .owner = THIS_MODULE,
460};
1da177e4 461#endif /* CONFIG_PROC_FS */
1da177e4 462
9f15c530 463static struct xt_match recent_match __read_mostly = {
1d5cd909 464 .name = "recent",
6709dbbb 465 .family = AF_INET,
404bdbfd 466 .match = ipt_recent_match,
1d5cd909 467 .matchsize = sizeof(struct ipt_recent_info),
404bdbfd
PM
468 .checkentry = ipt_recent_checkentry,
469 .destroy = ipt_recent_destroy,
470 .me = THIS_MODULE,
1da177e4
LT
471};
472
65b4b4e8 473static int __init ipt_recent_init(void)
1da177e4 474{
404bdbfd 475 int err;
1da177e4 476
404bdbfd
PM
477 if (!ip_list_tot || !ip_pkt_list_tot || ip_pkt_list_tot > 255)
478 return -EINVAL;
479 ip_list_hash_size = 1 << fls(ip_list_tot);
1da177e4 480
6709dbbb 481 err = xt_register_match(&recent_match);
404bdbfd 482#ifdef CONFIG_PROC_FS
1da177e4 483 if (err)
404bdbfd
PM
484 return err;
485 proc_dir = proc_mkdir("ipt_recent", proc_net);
486 if (proc_dir == NULL) {
6709dbbb 487 xt_unregister_match(&recent_match);
404bdbfd
PM
488 err = -ENOMEM;
489 }
490#endif
1da177e4
LT
491 return err;
492}
493
404bdbfd 494static void __exit ipt_recent_exit(void)
1da177e4 495{
404bdbfd 496 BUG_ON(!list_empty(&tables));
6709dbbb 497 xt_unregister_match(&recent_match);
404bdbfd
PM
498#ifdef CONFIG_PROC_FS
499 remove_proc_entry("ipt_recent", proc_net);
500#endif
1da177e4
LT
501}
502
65b4b4e8 503module_init(ipt_recent_init);
404bdbfd 504module_exit(ipt_recent_exit);