[NETFILTER]: x_tables: struct xt_table_info diet
[deliverable/linux.git] / net / netfilter / x_tables.c
1 /*
2 * x_tables core - Backend for {ip,ip6,arp}_tables
3 *
4 * Copyright (C) 2006-2006 Harald Welte <laforge@netfilter.org>
5 *
6 * Based on existing ip_tables code which is
7 * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling
8 * Copyright (C) 2000-2005 Netfilter Core Team <coreteam@netfilter.org>
9 *
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License version 2 as
12 * published by the Free Software Foundation.
13 *
14 */
15
16 #include <linux/kernel.h>
17 #include <linux/socket.h>
18 #include <linux/net.h>
19 #include <linux/proc_fs.h>
20 #include <linux/seq_file.h>
21 #include <linux/string.h>
22 #include <linux/vmalloc.h>
23 #include <linux/mutex.h>
24 #include <linux/mm.h>
25 #include <net/net_namespace.h>
26
27 #include <linux/netfilter/x_tables.h>
28 #include <linux/netfilter_arp.h>
29
30
31 MODULE_LICENSE("GPL");
32 MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
33 MODULE_DESCRIPTION("[ip,ip6,arp]_tables backend module");
34
35 #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1))
36
37 struct xt_af {
38 struct mutex mutex;
39 struct list_head match;
40 struct list_head target;
41 struct list_head tables;
42 struct mutex compat_mutex;
43 };
44
45 static struct xt_af *xt;
46
47 #ifdef DEBUG_IP_FIREWALL_USER
48 #define duprintf(format, args...) printk(format , ## args)
49 #else
50 #define duprintf(format, args...)
51 #endif
52
53 enum {
54 TABLE,
55 TARGET,
56 MATCH,
57 };
58
59 static const char *xt_prefix[NPROTO] = {
60 [AF_INET] = "ip",
61 [AF_INET6] = "ip6",
62 [NF_ARP] = "arp",
63 };
64
65 /* Registration hooks for targets. */
66 int
67 xt_register_target(struct xt_target *target)
68 {
69 int ret, af = target->family;
70
71 ret = mutex_lock_interruptible(&xt[af].mutex);
72 if (ret != 0)
73 return ret;
74 list_add(&target->list, &xt[af].target);
75 mutex_unlock(&xt[af].mutex);
76 return ret;
77 }
78 EXPORT_SYMBOL(xt_register_target);
79
80 void
81 xt_unregister_target(struct xt_target *target)
82 {
83 int af = target->family;
84
85 mutex_lock(&xt[af].mutex);
86 list_del(&target->list);
87 mutex_unlock(&xt[af].mutex);
88 }
89 EXPORT_SYMBOL(xt_unregister_target);
90
91 int
92 xt_register_targets(struct xt_target *target, unsigned int n)
93 {
94 unsigned int i;
95 int err = 0;
96
97 for (i = 0; i < n; i++) {
98 err = xt_register_target(&target[i]);
99 if (err)
100 goto err;
101 }
102 return err;
103
104 err:
105 if (i > 0)
106 xt_unregister_targets(target, i);
107 return err;
108 }
109 EXPORT_SYMBOL(xt_register_targets);
110
111 void
112 xt_unregister_targets(struct xt_target *target, unsigned int n)
113 {
114 unsigned int i;
115
116 for (i = 0; i < n; i++)
117 xt_unregister_target(&target[i]);
118 }
119 EXPORT_SYMBOL(xt_unregister_targets);
120
121 int
122 xt_register_match(struct xt_match *match)
123 {
124 int ret, af = match->family;
125
126 ret = mutex_lock_interruptible(&xt[af].mutex);
127 if (ret != 0)
128 return ret;
129
130 list_add(&match->list, &xt[af].match);
131 mutex_unlock(&xt[af].mutex);
132
133 return ret;
134 }
135 EXPORT_SYMBOL(xt_register_match);
136
137 void
138 xt_unregister_match(struct xt_match *match)
139 {
140 int af = match->family;
141
142 mutex_lock(&xt[af].mutex);
143 list_del(&match->list);
144 mutex_unlock(&xt[af].mutex);
145 }
146 EXPORT_SYMBOL(xt_unregister_match);
147
148 int
149 xt_register_matches(struct xt_match *match, unsigned int n)
150 {
151 unsigned int i;
152 int err = 0;
153
154 for (i = 0; i < n; i++) {
155 err = xt_register_match(&match[i]);
156 if (err)
157 goto err;
158 }
159 return err;
160
161 err:
162 if (i > 0)
163 xt_unregister_matches(match, i);
164 return err;
165 }
166 EXPORT_SYMBOL(xt_register_matches);
167
168 void
169 xt_unregister_matches(struct xt_match *match, unsigned int n)
170 {
171 unsigned int i;
172
173 for (i = 0; i < n; i++)
174 xt_unregister_match(&match[i]);
175 }
176 EXPORT_SYMBOL(xt_unregister_matches);
177
178
179 /*
180 * These are weird, but module loading must not be done with mutex
181 * held (since they will register), and we have to have a single
182 * function to use try_then_request_module().
183 */
184
185 /* Find match, grabs ref. Returns ERR_PTR() on error. */
186 struct xt_match *xt_find_match(int af, const char *name, u8 revision)
187 {
188 struct xt_match *m;
189 int err = 0;
190
191 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
192 return ERR_PTR(-EINTR);
193
194 list_for_each_entry(m, &xt[af].match, list) {
195 if (strcmp(m->name, name) == 0) {
196 if (m->revision == revision) {
197 if (try_module_get(m->me)) {
198 mutex_unlock(&xt[af].mutex);
199 return m;
200 }
201 } else
202 err = -EPROTOTYPE; /* Found something. */
203 }
204 }
205 mutex_unlock(&xt[af].mutex);
206 return ERR_PTR(err);
207 }
208 EXPORT_SYMBOL(xt_find_match);
209
210 /* Find target, grabs ref. Returns ERR_PTR() on error. */
211 struct xt_target *xt_find_target(int af, const char *name, u8 revision)
212 {
213 struct xt_target *t;
214 int err = 0;
215
216 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
217 return ERR_PTR(-EINTR);
218
219 list_for_each_entry(t, &xt[af].target, list) {
220 if (strcmp(t->name, name) == 0) {
221 if (t->revision == revision) {
222 if (try_module_get(t->me)) {
223 mutex_unlock(&xt[af].mutex);
224 return t;
225 }
226 } else
227 err = -EPROTOTYPE; /* Found something. */
228 }
229 }
230 mutex_unlock(&xt[af].mutex);
231 return ERR_PTR(err);
232 }
233 EXPORT_SYMBOL(xt_find_target);
234
235 struct xt_target *xt_request_find_target(int af, const char *name, u8 revision)
236 {
237 struct xt_target *target;
238
239 target = try_then_request_module(xt_find_target(af, name, revision),
240 "%st_%s", xt_prefix[af], name);
241 if (IS_ERR(target) || !target)
242 return NULL;
243 return target;
244 }
245 EXPORT_SYMBOL_GPL(xt_request_find_target);
246
247 static int match_revfn(int af, const char *name, u8 revision, int *bestp)
248 {
249 struct xt_match *m;
250 int have_rev = 0;
251
252 list_for_each_entry(m, &xt[af].match, list) {
253 if (strcmp(m->name, name) == 0) {
254 if (m->revision > *bestp)
255 *bestp = m->revision;
256 if (m->revision == revision)
257 have_rev = 1;
258 }
259 }
260 return have_rev;
261 }
262
263 static int target_revfn(int af, const char *name, u8 revision, int *bestp)
264 {
265 struct xt_target *t;
266 int have_rev = 0;
267
268 list_for_each_entry(t, &xt[af].target, list) {
269 if (strcmp(t->name, name) == 0) {
270 if (t->revision > *bestp)
271 *bestp = t->revision;
272 if (t->revision == revision)
273 have_rev = 1;
274 }
275 }
276 return have_rev;
277 }
278
279 /* Returns true or false (if no such extension at all) */
280 int xt_find_revision(int af, const char *name, u8 revision, int target,
281 int *err)
282 {
283 int have_rev, best = -1;
284
285 if (mutex_lock_interruptible(&xt[af].mutex) != 0) {
286 *err = -EINTR;
287 return 1;
288 }
289 if (target == 1)
290 have_rev = target_revfn(af, name, revision, &best);
291 else
292 have_rev = match_revfn(af, name, revision, &best);
293 mutex_unlock(&xt[af].mutex);
294
295 /* Nothing at all? Return 0 to try loading module. */
296 if (best == -1) {
297 *err = -ENOENT;
298 return 0;
299 }
300
301 *err = best;
302 if (!have_rev)
303 *err = -EPROTONOSUPPORT;
304 return 1;
305 }
306 EXPORT_SYMBOL_GPL(xt_find_revision);
307
308 int xt_check_match(const struct xt_match *match, unsigned short family,
309 unsigned int size, const char *table, unsigned int hook_mask,
310 unsigned short proto, int inv_proto)
311 {
312 if (XT_ALIGN(match->matchsize) != size) {
313 printk("%s_tables: %s match: invalid size %Zu != %u\n",
314 xt_prefix[family], match->name,
315 XT_ALIGN(match->matchsize), size);
316 return -EINVAL;
317 }
318 if (match->table && strcmp(match->table, table)) {
319 printk("%s_tables: %s match: only valid in %s table, not %s\n",
320 xt_prefix[family], match->name, match->table, table);
321 return -EINVAL;
322 }
323 if (match->hooks && (hook_mask & ~match->hooks) != 0) {
324 printk("%s_tables: %s match: bad hook_mask %u/%u\n",
325 xt_prefix[family], match->name, hook_mask, match->hooks);
326 return -EINVAL;
327 }
328 if (match->proto && (match->proto != proto || inv_proto)) {
329 printk("%s_tables: %s match: only valid for protocol %u\n",
330 xt_prefix[family], match->name, match->proto);
331 return -EINVAL;
332 }
333 return 0;
334 }
335 EXPORT_SYMBOL_GPL(xt_check_match);
336
337 #ifdef CONFIG_COMPAT
338 int xt_compat_match_offset(struct xt_match *match)
339 {
340 u_int16_t csize = match->compatsize ? : match->matchsize;
341 return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize);
342 }
343 EXPORT_SYMBOL_GPL(xt_compat_match_offset);
344
345 void xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
346 int *size)
347 {
348 struct xt_match *match = m->u.kernel.match;
349 struct compat_xt_entry_match *cm = (struct compat_xt_entry_match *)m;
350 int pad, off = xt_compat_match_offset(match);
351 u_int16_t msize = cm->u.user.match_size;
352
353 m = *dstptr;
354 memcpy(m, cm, sizeof(*cm));
355 if (match->compat_from_user)
356 match->compat_from_user(m->data, cm->data);
357 else
358 memcpy(m->data, cm->data, msize - sizeof(*cm));
359 pad = XT_ALIGN(match->matchsize) - match->matchsize;
360 if (pad > 0)
361 memset(m->data + match->matchsize, 0, pad);
362
363 msize += off;
364 m->u.user.match_size = msize;
365
366 *size += off;
367 *dstptr += msize;
368 }
369 EXPORT_SYMBOL_GPL(xt_compat_match_from_user);
370
371 int xt_compat_match_to_user(struct xt_entry_match *m, void __user **dstptr,
372 int *size)
373 {
374 struct xt_match *match = m->u.kernel.match;
375 struct compat_xt_entry_match __user *cm = *dstptr;
376 int off = xt_compat_match_offset(match);
377 u_int16_t msize = m->u.user.match_size - off;
378
379 if (copy_to_user(cm, m, sizeof(*cm)) ||
380 put_user(msize, &cm->u.user.match_size) ||
381 copy_to_user(cm->u.user.name, m->u.kernel.match->name,
382 strlen(m->u.kernel.match->name) + 1))
383 return -EFAULT;
384
385 if (match->compat_to_user) {
386 if (match->compat_to_user((void __user *)cm->data, m->data))
387 return -EFAULT;
388 } else {
389 if (copy_to_user(cm->data, m->data, msize - sizeof(*cm)))
390 return -EFAULT;
391 }
392
393 *size -= off;
394 *dstptr += msize;
395 return 0;
396 }
397 EXPORT_SYMBOL_GPL(xt_compat_match_to_user);
398 #endif /* CONFIG_COMPAT */
399
400 int xt_check_target(const struct xt_target *target, unsigned short family,
401 unsigned int size, const char *table, unsigned int hook_mask,
402 unsigned short proto, int inv_proto)
403 {
404 if (XT_ALIGN(target->targetsize) != size) {
405 printk("%s_tables: %s target: invalid size %Zu != %u\n",
406 xt_prefix[family], target->name,
407 XT_ALIGN(target->targetsize), size);
408 return -EINVAL;
409 }
410 if (target->table && strcmp(target->table, table)) {
411 printk("%s_tables: %s target: only valid in %s table, not %s\n",
412 xt_prefix[family], target->name, target->table, table);
413 return -EINVAL;
414 }
415 if (target->hooks && (hook_mask & ~target->hooks) != 0) {
416 printk("%s_tables: %s target: bad hook_mask %u/%u\n",
417 xt_prefix[family], target->name, hook_mask,
418 target->hooks);
419 return -EINVAL;
420 }
421 if (target->proto && (target->proto != proto || inv_proto)) {
422 printk("%s_tables: %s target: only valid for protocol %u\n",
423 xt_prefix[family], target->name, target->proto);
424 return -EINVAL;
425 }
426 return 0;
427 }
428 EXPORT_SYMBOL_GPL(xt_check_target);
429
430 #ifdef CONFIG_COMPAT
431 int xt_compat_target_offset(struct xt_target *target)
432 {
433 u_int16_t csize = target->compatsize ? : target->targetsize;
434 return XT_ALIGN(target->targetsize) - COMPAT_XT_ALIGN(csize);
435 }
436 EXPORT_SYMBOL_GPL(xt_compat_target_offset);
437
438 void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
439 int *size)
440 {
441 struct xt_target *target = t->u.kernel.target;
442 struct compat_xt_entry_target *ct = (struct compat_xt_entry_target *)t;
443 int pad, off = xt_compat_target_offset(target);
444 u_int16_t tsize = ct->u.user.target_size;
445
446 t = *dstptr;
447 memcpy(t, ct, sizeof(*ct));
448 if (target->compat_from_user)
449 target->compat_from_user(t->data, ct->data);
450 else
451 memcpy(t->data, ct->data, tsize - sizeof(*ct));
452 pad = XT_ALIGN(target->targetsize) - target->targetsize;
453 if (pad > 0)
454 memset(t->data + target->targetsize, 0, pad);
455
456 tsize += off;
457 t->u.user.target_size = tsize;
458
459 *size += off;
460 *dstptr += tsize;
461 }
462 EXPORT_SYMBOL_GPL(xt_compat_target_from_user);
463
464 int xt_compat_target_to_user(struct xt_entry_target *t, void __user **dstptr,
465 int *size)
466 {
467 struct xt_target *target = t->u.kernel.target;
468 struct compat_xt_entry_target __user *ct = *dstptr;
469 int off = xt_compat_target_offset(target);
470 u_int16_t tsize = t->u.user.target_size - off;
471
472 if (copy_to_user(ct, t, sizeof(*ct)) ||
473 put_user(tsize, &ct->u.user.target_size) ||
474 copy_to_user(ct->u.user.name, t->u.kernel.target->name,
475 strlen(t->u.kernel.target->name) + 1))
476 return -EFAULT;
477
478 if (target->compat_to_user) {
479 if (target->compat_to_user((void __user *)ct->data, t->data))
480 return -EFAULT;
481 } else {
482 if (copy_to_user(ct->data, t->data, tsize - sizeof(*ct)))
483 return -EFAULT;
484 }
485
486 *size -= off;
487 *dstptr += tsize;
488 return 0;
489 }
490 EXPORT_SYMBOL_GPL(xt_compat_target_to_user);
491 #endif
492
493 struct xt_table_info *xt_alloc_table_info(unsigned int size)
494 {
495 struct xt_table_info *newinfo;
496 int cpu;
497
498 /* Pedantry: prevent them from hitting BUG() in vmalloc.c --RR */
499 if ((SMP_ALIGN(size) >> PAGE_SHIFT) + 2 > num_physpages)
500 return NULL;
501
502 newinfo = kzalloc(XT_TABLE_INFO_SZ, GFP_KERNEL);
503 if (!newinfo)
504 return NULL;
505
506 newinfo->size = size;
507
508 for_each_possible_cpu(cpu) {
509 if (size <= PAGE_SIZE)
510 newinfo->entries[cpu] = kmalloc_node(size,
511 GFP_KERNEL,
512 cpu_to_node(cpu));
513 else
514 newinfo->entries[cpu] = vmalloc_node(size,
515 cpu_to_node(cpu));
516
517 if (newinfo->entries[cpu] == NULL) {
518 xt_free_table_info(newinfo);
519 return NULL;
520 }
521 }
522
523 return newinfo;
524 }
525 EXPORT_SYMBOL(xt_alloc_table_info);
526
527 void xt_free_table_info(struct xt_table_info *info)
528 {
529 int cpu;
530
531 for_each_possible_cpu(cpu) {
532 if (info->size <= PAGE_SIZE)
533 kfree(info->entries[cpu]);
534 else
535 vfree(info->entries[cpu]);
536 }
537 kfree(info);
538 }
539 EXPORT_SYMBOL(xt_free_table_info);
540
541 /* Find table by name, grabs mutex & ref. Returns ERR_PTR() on error. */
542 struct xt_table *xt_find_table_lock(int af, const char *name)
543 {
544 struct xt_table *t;
545
546 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
547 return ERR_PTR(-EINTR);
548
549 list_for_each_entry(t, &xt[af].tables, list)
550 if (strcmp(t->name, name) == 0 && try_module_get(t->me))
551 return t;
552 mutex_unlock(&xt[af].mutex);
553 return NULL;
554 }
555 EXPORT_SYMBOL_GPL(xt_find_table_lock);
556
557 void xt_table_unlock(struct xt_table *table)
558 {
559 mutex_unlock(&xt[table->af].mutex);
560 }
561 EXPORT_SYMBOL_GPL(xt_table_unlock);
562
563 #ifdef CONFIG_COMPAT
564 void xt_compat_lock(int af)
565 {
566 mutex_lock(&xt[af].compat_mutex);
567 }
568 EXPORT_SYMBOL_GPL(xt_compat_lock);
569
570 void xt_compat_unlock(int af)
571 {
572 mutex_unlock(&xt[af].compat_mutex);
573 }
574 EXPORT_SYMBOL_GPL(xt_compat_unlock);
575 #endif
576
577 struct xt_table_info *
578 xt_replace_table(struct xt_table *table,
579 unsigned int num_counters,
580 struct xt_table_info *newinfo,
581 int *error)
582 {
583 struct xt_table_info *oldinfo, *private;
584
585 /* Do the substitution. */
586 write_lock_bh(&table->lock);
587 private = table->private;
588 /* Check inside lock: is the old number correct? */
589 if (num_counters != private->number) {
590 duprintf("num_counters != table->private->number (%u/%u)\n",
591 num_counters, private->number);
592 write_unlock_bh(&table->lock);
593 *error = -EAGAIN;
594 return NULL;
595 }
596 oldinfo = private;
597 table->private = newinfo;
598 newinfo->initial_entries = oldinfo->initial_entries;
599 write_unlock_bh(&table->lock);
600
601 return oldinfo;
602 }
603 EXPORT_SYMBOL_GPL(xt_replace_table);
604
605 int xt_register_table(struct xt_table *table,
606 struct xt_table_info *bootstrap,
607 struct xt_table_info *newinfo)
608 {
609 int ret;
610 struct xt_table_info *private;
611 struct xt_table *t;
612
613 ret = mutex_lock_interruptible(&xt[table->af].mutex);
614 if (ret != 0)
615 return ret;
616
617 /* Don't autoload: we'd eat our tail... */
618 list_for_each_entry(t, &xt[table->af].tables, list) {
619 if (strcmp(t->name, table->name) == 0) {
620 ret = -EEXIST;
621 goto unlock;
622 }
623 }
624
625 /* Simplifies replace_table code. */
626 table->private = bootstrap;
627 rwlock_init(&table->lock);
628 if (!xt_replace_table(table, 0, newinfo, &ret))
629 goto unlock;
630
631 private = table->private;
632 duprintf("table->private->number = %u\n", private->number);
633
634 /* save number of initial entries */
635 private->initial_entries = private->number;
636
637 list_add(&table->list, &xt[table->af].tables);
638
639 ret = 0;
640 unlock:
641 mutex_unlock(&xt[table->af].mutex);
642 return ret;
643 }
644 EXPORT_SYMBOL_GPL(xt_register_table);
645
646 void *xt_unregister_table(struct xt_table *table)
647 {
648 struct xt_table_info *private;
649
650 mutex_lock(&xt[table->af].mutex);
651 private = table->private;
652 list_del(&table->list);
653 mutex_unlock(&xt[table->af].mutex);
654
655 return private;
656 }
657 EXPORT_SYMBOL_GPL(xt_unregister_table);
658
659 #ifdef CONFIG_PROC_FS
660 static struct list_head *xt_get_idx(struct list_head *list, struct seq_file *seq, loff_t pos)
661 {
662 struct list_head *head = list->next;
663
664 if (!head || list_empty(list))
665 return NULL;
666
667 while (pos && (head = head->next)) {
668 if (head == list)
669 return NULL;
670 pos--;
671 }
672 return pos ? NULL : head;
673 }
674
675 static struct list_head *type2list(u_int16_t af, u_int16_t type)
676 {
677 struct list_head *list;
678
679 switch (type) {
680 case TARGET:
681 list = &xt[af].target;
682 break;
683 case MATCH:
684 list = &xt[af].match;
685 break;
686 case TABLE:
687 list = &xt[af].tables;
688 break;
689 default:
690 list = NULL;
691 break;
692 }
693
694 return list;
695 }
696
697 static void *xt_tgt_seq_start(struct seq_file *seq, loff_t *pos)
698 {
699 struct proc_dir_entry *pde = (struct proc_dir_entry *) seq->private;
700 u_int16_t af = (unsigned long)pde->data & 0xffff;
701 u_int16_t type = (unsigned long)pde->data >> 16;
702 struct list_head *list;
703
704 if (af >= NPROTO)
705 return NULL;
706
707 list = type2list(af, type);
708 if (!list)
709 return NULL;
710
711 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
712 return NULL;
713
714 return xt_get_idx(list, seq, *pos);
715 }
716
717 static void *xt_tgt_seq_next(struct seq_file *seq, void *v, loff_t *pos)
718 {
719 struct proc_dir_entry *pde = seq->private;
720 u_int16_t af = (unsigned long)pde->data & 0xffff;
721 u_int16_t type = (unsigned long)pde->data >> 16;
722 struct list_head *list;
723
724 if (af >= NPROTO)
725 return NULL;
726
727 list = type2list(af, type);
728 if (!list)
729 return NULL;
730
731 (*pos)++;
732 return xt_get_idx(list, seq, *pos);
733 }
734
735 static void xt_tgt_seq_stop(struct seq_file *seq, void *v)
736 {
737 struct proc_dir_entry *pde = seq->private;
738 u_int16_t af = (unsigned long)pde->data & 0xffff;
739
740 mutex_unlock(&xt[af].mutex);
741 }
742
743 static int xt_name_seq_show(struct seq_file *seq, void *v)
744 {
745 char *name = (char *)v + sizeof(struct list_head);
746
747 if (strlen(name))
748 return seq_printf(seq, "%s\n", name);
749 else
750 return 0;
751 }
752
753 static const struct seq_operations xt_tgt_seq_ops = {
754 .start = xt_tgt_seq_start,
755 .next = xt_tgt_seq_next,
756 .stop = xt_tgt_seq_stop,
757 .show = xt_name_seq_show,
758 };
759
760 static int xt_tgt_open(struct inode *inode, struct file *file)
761 {
762 int ret;
763
764 ret = seq_open(file, &xt_tgt_seq_ops);
765 if (!ret) {
766 struct seq_file *seq = file->private_data;
767 struct proc_dir_entry *pde = PDE(inode);
768
769 seq->private = pde;
770 }
771
772 return ret;
773 }
774
775 static const struct file_operations xt_file_ops = {
776 .owner = THIS_MODULE,
777 .open = xt_tgt_open,
778 .read = seq_read,
779 .llseek = seq_lseek,
780 .release = seq_release,
781 };
782
783 #define FORMAT_TABLES "_tables_names"
784 #define FORMAT_MATCHES "_tables_matches"
785 #define FORMAT_TARGETS "_tables_targets"
786
787 #endif /* CONFIG_PROC_FS */
788
789 int xt_proto_init(int af)
790 {
791 #ifdef CONFIG_PROC_FS
792 char buf[XT_FUNCTION_MAXNAMELEN];
793 struct proc_dir_entry *proc;
794 #endif
795
796 if (af >= NPROTO)
797 return -EINVAL;
798
799
800 #ifdef CONFIG_PROC_FS
801 strlcpy(buf, xt_prefix[af], sizeof(buf));
802 strlcat(buf, FORMAT_TABLES, sizeof(buf));
803 proc = proc_net_fops_create(&init_net, buf, 0440, &xt_file_ops);
804 if (!proc)
805 goto out;
806 proc->data = (void *) ((unsigned long) af | (TABLE << 16));
807
808
809 strlcpy(buf, xt_prefix[af], sizeof(buf));
810 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
811 proc = proc_net_fops_create(&init_net, buf, 0440, &xt_file_ops);
812 if (!proc)
813 goto out_remove_tables;
814 proc->data = (void *) ((unsigned long) af | (MATCH << 16));
815
816 strlcpy(buf, xt_prefix[af], sizeof(buf));
817 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
818 proc = proc_net_fops_create(&init_net, buf, 0440, &xt_file_ops);
819 if (!proc)
820 goto out_remove_matches;
821 proc->data = (void *) ((unsigned long) af | (TARGET << 16));
822 #endif
823
824 return 0;
825
826 #ifdef CONFIG_PROC_FS
827 out_remove_matches:
828 strlcpy(buf, xt_prefix[af], sizeof(buf));
829 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
830 proc_net_remove(&init_net, buf);
831
832 out_remove_tables:
833 strlcpy(buf, xt_prefix[af], sizeof(buf));
834 strlcat(buf, FORMAT_TABLES, sizeof(buf));
835 proc_net_remove(&init_net, buf);
836 out:
837 return -1;
838 #endif
839 }
840 EXPORT_SYMBOL_GPL(xt_proto_init);
841
842 void xt_proto_fini(int af)
843 {
844 #ifdef CONFIG_PROC_FS
845 char buf[XT_FUNCTION_MAXNAMELEN];
846
847 strlcpy(buf, xt_prefix[af], sizeof(buf));
848 strlcat(buf, FORMAT_TABLES, sizeof(buf));
849 proc_net_remove(&init_net, buf);
850
851 strlcpy(buf, xt_prefix[af], sizeof(buf));
852 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
853 proc_net_remove(&init_net, buf);
854
855 strlcpy(buf, xt_prefix[af], sizeof(buf));
856 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
857 proc_net_remove(&init_net, buf);
858 #endif /*CONFIG_PROC_FS*/
859 }
860 EXPORT_SYMBOL_GPL(xt_proto_fini);
861
862
863 static int __init xt_init(void)
864 {
865 int i;
866
867 xt = kmalloc(sizeof(struct xt_af) * NPROTO, GFP_KERNEL);
868 if (!xt)
869 return -ENOMEM;
870
871 for (i = 0; i < NPROTO; i++) {
872 mutex_init(&xt[i].mutex);
873 #ifdef CONFIG_COMPAT
874 mutex_init(&xt[i].compat_mutex);
875 #endif
876 INIT_LIST_HEAD(&xt[i].target);
877 INIT_LIST_HEAD(&xt[i].match);
878 INIT_LIST_HEAD(&xt[i].tables);
879 }
880 return 0;
881 }
882
883 static void __exit xt_fini(void)
884 {
885 kfree(xt);
886 }
887
888 module_init(xt_init);
889 module_exit(xt_fini);
890
This page took 0.126422 seconds and 6 git commands to generate.