2 * x_tables core - Backend for {ip,ip6,arp}_tables
4 * Copyright (C) 2006-2006 Harald Welte <laforge@netfilter.org>
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>
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.
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>
25 #include <net/net_namespace.h>
27 #include <linux/netfilter/x_tables.h>
28 #include <linux/netfilter_arp.h>
29 #include <linux/netfilter_ipv4/ip_tables.h>
30 #include <linux/netfilter_ipv6/ip6_tables.h>
31 #include <linux/netfilter_arp/arp_tables.h>
33 MODULE_LICENSE("GPL");
34 MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
35 MODULE_DESCRIPTION("{ip,ip6,arp,eb}_tables backend module");
37 #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1))
40 struct compat_delta *next;
47 struct list_head match;
48 struct list_head target;
50 struct mutex compat_mutex;
51 struct compat_delta *compat_offsets;
55 static struct xt_af *xt;
57 #ifdef DEBUG_IP_FIREWALL_USER
58 #define duprintf(format, args...) printk(format , ## args)
60 #define duprintf(format, args...)
63 static const char *const xt_prefix[NFPROTO_NUMPROTO] = {
64 [NFPROTO_UNSPEC] = "x",
65 [NFPROTO_IPV4] = "ip",
66 [NFPROTO_ARP] = "arp",
67 [NFPROTO_BRIDGE] = "eb",
68 [NFPROTO_IPV6] = "ip6",
71 /* Registration hooks for targets. */
73 xt_register_target(struct xt_target *target)
75 u_int8_t af = target->family;
78 ret = mutex_lock_interruptible(&xt[af].mutex);
81 list_add(&target->list, &xt[af].target);
82 mutex_unlock(&xt[af].mutex);
85 EXPORT_SYMBOL(xt_register_target);
88 xt_unregister_target(struct xt_target *target)
90 u_int8_t af = target->family;
92 mutex_lock(&xt[af].mutex);
93 list_del(&target->list);
94 mutex_unlock(&xt[af].mutex);
96 EXPORT_SYMBOL(xt_unregister_target);
99 xt_register_targets(struct xt_target *target, unsigned int n)
104 for (i = 0; i < n; i++) {
105 err = xt_register_target(&target[i]);
113 xt_unregister_targets(target, i);
116 EXPORT_SYMBOL(xt_register_targets);
119 xt_unregister_targets(struct xt_target *target, unsigned int n)
123 for (i = 0; i < n; i++)
124 xt_unregister_target(&target[i]);
126 EXPORT_SYMBOL(xt_unregister_targets);
129 xt_register_match(struct xt_match *match)
131 u_int8_t af = match->family;
134 ret = mutex_lock_interruptible(&xt[af].mutex);
138 list_add(&match->list, &xt[af].match);
139 mutex_unlock(&xt[af].mutex);
143 EXPORT_SYMBOL(xt_register_match);
146 xt_unregister_match(struct xt_match *match)
148 u_int8_t af = match->family;
150 mutex_lock(&xt[af].mutex);
151 list_del(&match->list);
152 mutex_unlock(&xt[af].mutex);
154 EXPORT_SYMBOL(xt_unregister_match);
157 xt_register_matches(struct xt_match *match, unsigned int n)
162 for (i = 0; i < n; i++) {
163 err = xt_register_match(&match[i]);
171 xt_unregister_matches(match, i);
174 EXPORT_SYMBOL(xt_register_matches);
177 xt_unregister_matches(struct xt_match *match, unsigned int n)
181 for (i = 0; i < n; i++)
182 xt_unregister_match(&match[i]);
184 EXPORT_SYMBOL(xt_unregister_matches);
188 * These are weird, but module loading must not be done with mutex
189 * held (since they will register), and we have to have a single
190 * function to use try_then_request_module().
193 /* Find match, grabs ref. Returns ERR_PTR() on error. */
194 struct xt_match *xt_find_match(u8 af, const char *name, u8 revision)
199 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
200 return ERR_PTR(-EINTR);
202 list_for_each_entry(m, &xt[af].match, list) {
203 if (strcmp(m->name, name) == 0) {
204 if (m->revision == revision) {
205 if (try_module_get(m->me)) {
206 mutex_unlock(&xt[af].mutex);
210 err = -EPROTOTYPE; /* Found something. */
213 mutex_unlock(&xt[af].mutex);
215 if (af != NFPROTO_UNSPEC)
216 /* Try searching again in the family-independent list */
217 return xt_find_match(NFPROTO_UNSPEC, name, revision);
221 EXPORT_SYMBOL(xt_find_match);
223 /* Find target, grabs ref. Returns ERR_PTR() on error. */
224 struct xt_target *xt_find_target(u8 af, const char *name, u8 revision)
229 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
230 return ERR_PTR(-EINTR);
232 list_for_each_entry(t, &xt[af].target, list) {
233 if (strcmp(t->name, name) == 0) {
234 if (t->revision == revision) {
235 if (try_module_get(t->me)) {
236 mutex_unlock(&xt[af].mutex);
240 err = -EPROTOTYPE; /* Found something. */
243 mutex_unlock(&xt[af].mutex);
245 if (af != NFPROTO_UNSPEC)
246 /* Try searching again in the family-independent list */
247 return xt_find_target(NFPROTO_UNSPEC, name, revision);
251 EXPORT_SYMBOL(xt_find_target);
253 struct xt_target *xt_request_find_target(u8 af, const char *name, u8 revision)
255 struct xt_target *target;
257 target = try_then_request_module(xt_find_target(af, name, revision),
258 "%st_%s", xt_prefix[af], name);
259 if (IS_ERR(target) || !target)
263 EXPORT_SYMBOL_GPL(xt_request_find_target);
265 static int match_revfn(u8 af, const char *name, u8 revision, int *bestp)
267 const struct xt_match *m;
270 list_for_each_entry(m, &xt[af].match, list) {
271 if (strcmp(m->name, name) == 0) {
272 if (m->revision > *bestp)
273 *bestp = m->revision;
274 if (m->revision == revision)
279 if (af != NFPROTO_UNSPEC && !have_rev)
280 return match_revfn(NFPROTO_UNSPEC, name, revision, bestp);
285 static int target_revfn(u8 af, const char *name, u8 revision, int *bestp)
287 const struct xt_target *t;
290 list_for_each_entry(t, &xt[af].target, list) {
291 if (strcmp(t->name, name) == 0) {
292 if (t->revision > *bestp)
293 *bestp = t->revision;
294 if (t->revision == revision)
299 if (af != NFPROTO_UNSPEC && !have_rev)
300 return target_revfn(NFPROTO_UNSPEC, name, revision, bestp);
305 /* Returns true or false (if no such extension at all) */
306 int xt_find_revision(u8 af, const char *name, u8 revision, int target,
309 int have_rev, best = -1;
311 if (mutex_lock_interruptible(&xt[af].mutex) != 0) {
316 have_rev = target_revfn(af, name, revision, &best);
318 have_rev = match_revfn(af, name, revision, &best);
319 mutex_unlock(&xt[af].mutex);
321 /* Nothing at all? Return 0 to try loading module. */
329 *err = -EPROTONOSUPPORT;
332 EXPORT_SYMBOL_GPL(xt_find_revision);
334 static char *textify_hooks(char *buf, size_t size, unsigned int mask)
336 static const char *const names[] = {
337 "PREROUTING", "INPUT", "FORWARD",
338 "OUTPUT", "POSTROUTING", "BROUTING",
346 for (i = 0; i < ARRAY_SIZE(names); ++i) {
347 if (!(mask & (1 << i)))
349 res = snprintf(p, size, "%s%s", np ? "/" : "", names[i]);
360 int xt_check_match(struct xt_mtchk_param *par,
361 unsigned int size, u_int8_t proto, bool inv_proto)
363 if (XT_ALIGN(par->match->matchsize) != size &&
364 par->match->matchsize != -1) {
366 * ebt_among is exempt from centralized matchsize checking
367 * because it uses a dynamic-size data set.
369 pr_err("%s_tables: %s match: invalid size %u != %u\n",
370 xt_prefix[par->family], par->match->name,
371 XT_ALIGN(par->match->matchsize), size);
374 if (par->match->table != NULL &&
375 strcmp(par->match->table, par->table) != 0) {
376 pr_err("%s_tables: %s match: only valid in %s table, not %s\n",
377 xt_prefix[par->family], par->match->name,
378 par->match->table, par->table);
381 if (par->match->hooks && (par->hook_mask & ~par->match->hooks) != 0) {
382 char used[64], allow[64];
384 pr_err("%s_tables: %s match: used from hooks %s, but only "
386 xt_prefix[par->family], par->match->name,
387 textify_hooks(used, sizeof(used), par->hook_mask),
388 textify_hooks(allow, sizeof(allow), par->match->hooks));
391 if (par->match->proto && (par->match->proto != proto || inv_proto)) {
392 pr_err("%s_tables: %s match: only valid for protocol %u\n",
393 xt_prefix[par->family], par->match->name,
397 if (par->match->checkentry != NULL && !par->match->checkentry(par))
401 EXPORT_SYMBOL_GPL(xt_check_match);
404 int xt_compat_add_offset(u_int8_t af, unsigned int offset, short delta)
406 struct compat_delta *tmp;
408 tmp = kmalloc(sizeof(struct compat_delta), GFP_KERNEL);
412 tmp->offset = offset;
415 if (xt[af].compat_offsets) {
416 tmp->next = xt[af].compat_offsets->next;
417 xt[af].compat_offsets->next = tmp;
419 xt[af].compat_offsets = tmp;
424 EXPORT_SYMBOL_GPL(xt_compat_add_offset);
426 void xt_compat_flush_offsets(u_int8_t af)
428 struct compat_delta *tmp, *next;
430 if (xt[af].compat_offsets) {
431 for (tmp = xt[af].compat_offsets; tmp; tmp = next) {
435 xt[af].compat_offsets = NULL;
438 EXPORT_SYMBOL_GPL(xt_compat_flush_offsets);
440 short xt_compat_calc_jump(u_int8_t af, unsigned int offset)
442 struct compat_delta *tmp;
445 for (tmp = xt[af].compat_offsets, delta = 0; tmp; tmp = tmp->next)
446 if (tmp->offset < offset)
450 EXPORT_SYMBOL_GPL(xt_compat_calc_jump);
452 int xt_compat_match_offset(const struct xt_match *match)
454 u_int16_t csize = match->compatsize ? : match->matchsize;
455 return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize);
457 EXPORT_SYMBOL_GPL(xt_compat_match_offset);
459 int xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
462 const struct xt_match *match = m->u.kernel.match;
463 struct compat_xt_entry_match *cm = (struct compat_xt_entry_match *)m;
464 int pad, off = xt_compat_match_offset(match);
465 u_int16_t msize = cm->u.user.match_size;
468 memcpy(m, cm, sizeof(*cm));
469 if (match->compat_from_user)
470 match->compat_from_user(m->data, cm->data);
472 memcpy(m->data, cm->data, msize - sizeof(*cm));
473 pad = XT_ALIGN(match->matchsize) - match->matchsize;
475 memset(m->data + match->matchsize, 0, pad);
478 m->u.user.match_size = msize;
484 EXPORT_SYMBOL_GPL(xt_compat_match_from_user);
486 int xt_compat_match_to_user(struct xt_entry_match *m, void __user **dstptr,
489 const struct xt_match *match = m->u.kernel.match;
490 struct compat_xt_entry_match __user *cm = *dstptr;
491 int off = xt_compat_match_offset(match);
492 u_int16_t msize = m->u.user.match_size - off;
494 if (copy_to_user(cm, m, sizeof(*cm)) ||
495 put_user(msize, &cm->u.user.match_size) ||
496 copy_to_user(cm->u.user.name, m->u.kernel.match->name,
497 strlen(m->u.kernel.match->name) + 1))
500 if (match->compat_to_user) {
501 if (match->compat_to_user((void __user *)cm->data, m->data))
504 if (copy_to_user(cm->data, m->data, msize - sizeof(*cm)))
512 EXPORT_SYMBOL_GPL(xt_compat_match_to_user);
513 #endif /* CONFIG_COMPAT */
515 int xt_check_target(struct xt_tgchk_param *par,
516 unsigned int size, u_int8_t proto, bool inv_proto)
518 if (XT_ALIGN(par->target->targetsize) != size) {
519 pr_err("%s_tables: %s target: invalid size %u != %u\n",
520 xt_prefix[par->family], par->target->name,
521 XT_ALIGN(par->target->targetsize), size);
524 if (par->target->table != NULL &&
525 strcmp(par->target->table, par->table) != 0) {
526 pr_err("%s_tables: %s target: only valid in %s table, not %s\n",
527 xt_prefix[par->family], par->target->name,
528 par->target->table, par->table);
531 if (par->target->hooks && (par->hook_mask & ~par->target->hooks) != 0) {
532 char used[64], allow[64];
534 pr_err("%s_tables: %s target: used from hooks %s, but only "
536 xt_prefix[par->family], par->target->name,
537 textify_hooks(used, sizeof(used), par->hook_mask),
538 textify_hooks(allow, sizeof(allow), par->target->hooks));
541 if (par->target->proto && (par->target->proto != proto || inv_proto)) {
542 pr_err("%s_tables: %s target: only valid for protocol %u\n",
543 xt_prefix[par->family], par->target->name,
547 if (par->target->checkentry != NULL && !par->target->checkentry(par))
551 EXPORT_SYMBOL_GPL(xt_check_target);
554 int xt_compat_target_offset(const struct xt_target *target)
556 u_int16_t csize = target->compatsize ? : target->targetsize;
557 return XT_ALIGN(target->targetsize) - COMPAT_XT_ALIGN(csize);
559 EXPORT_SYMBOL_GPL(xt_compat_target_offset);
561 void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
564 const struct xt_target *target = t->u.kernel.target;
565 struct compat_xt_entry_target *ct = (struct compat_xt_entry_target *)t;
566 int pad, off = xt_compat_target_offset(target);
567 u_int16_t tsize = ct->u.user.target_size;
570 memcpy(t, ct, sizeof(*ct));
571 if (target->compat_from_user)
572 target->compat_from_user(t->data, ct->data);
574 memcpy(t->data, ct->data, tsize - sizeof(*ct));
575 pad = XT_ALIGN(target->targetsize) - target->targetsize;
577 memset(t->data + target->targetsize, 0, pad);
580 t->u.user.target_size = tsize;
585 EXPORT_SYMBOL_GPL(xt_compat_target_from_user);
587 int xt_compat_target_to_user(struct xt_entry_target *t, void __user **dstptr,
590 const struct xt_target *target = t->u.kernel.target;
591 struct compat_xt_entry_target __user *ct = *dstptr;
592 int off = xt_compat_target_offset(target);
593 u_int16_t tsize = t->u.user.target_size - off;
595 if (copy_to_user(ct, t, sizeof(*ct)) ||
596 put_user(tsize, &ct->u.user.target_size) ||
597 copy_to_user(ct->u.user.name, t->u.kernel.target->name,
598 strlen(t->u.kernel.target->name) + 1))
601 if (target->compat_to_user) {
602 if (target->compat_to_user((void __user *)ct->data, t->data))
605 if (copy_to_user(ct->data, t->data, tsize - sizeof(*ct)))
613 EXPORT_SYMBOL_GPL(xt_compat_target_to_user);
616 struct xt_table_info *xt_alloc_table_info(unsigned int size)
618 struct xt_table_info *newinfo;
621 /* Pedantry: prevent them from hitting BUG() in vmalloc.c --RR */
622 if ((SMP_ALIGN(size) >> PAGE_SHIFT) + 2 > totalram_pages)
625 newinfo = kzalloc(XT_TABLE_INFO_SZ, GFP_KERNEL);
629 newinfo->size = size;
631 for_each_possible_cpu(cpu) {
632 if (size <= PAGE_SIZE)
633 newinfo->entries[cpu] = kmalloc_node(size,
637 newinfo->entries[cpu] = vmalloc_node(size,
640 if (newinfo->entries[cpu] == NULL) {
641 xt_free_table_info(newinfo);
648 EXPORT_SYMBOL(xt_alloc_table_info);
650 void xt_free_table_info(struct xt_table_info *info)
654 for_each_possible_cpu(cpu) {
655 if (info->size <= PAGE_SIZE)
656 kfree(info->entries[cpu]);
658 vfree(info->entries[cpu]);
662 EXPORT_SYMBOL(xt_free_table_info);
664 /* Find table by name, grabs mutex & ref. Returns ERR_PTR() on error. */
665 struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
670 if (mutex_lock_interruptible(&xt[af].mutex) != 0)
671 return ERR_PTR(-EINTR);
673 list_for_each_entry(t, &net->xt.tables[af], list)
674 if (strcmp(t->name, name) == 0 && try_module_get(t->me))
676 mutex_unlock(&xt[af].mutex);
679 EXPORT_SYMBOL_GPL(xt_find_table_lock);
681 void xt_table_unlock(struct xt_table *table)
683 mutex_unlock(&xt[table->af].mutex);
685 EXPORT_SYMBOL_GPL(xt_table_unlock);
688 void xt_compat_lock(u_int8_t af)
690 mutex_lock(&xt[af].compat_mutex);
692 EXPORT_SYMBOL_GPL(xt_compat_lock);
694 void xt_compat_unlock(u_int8_t af)
696 mutex_unlock(&xt[af].compat_mutex);
698 EXPORT_SYMBOL_GPL(xt_compat_unlock);
701 DEFINE_PER_CPU(struct xt_info_lock, xt_info_locks);
702 EXPORT_PER_CPU_SYMBOL_GPL(xt_info_locks);
705 struct xt_table_info *
706 xt_replace_table(struct xt_table *table,
707 unsigned int num_counters,
708 struct xt_table_info *newinfo,
711 struct xt_table_info *private;
713 /* Do the substitution. */
715 private = table->private;
717 /* Check inside lock: is the old number correct? */
718 if (num_counters != private->number) {
719 duprintf("num_counters != table->private->number (%u/%u)\n",
720 num_counters, private->number);
726 table->private = newinfo;
727 newinfo->initial_entries = private->initial_entries;
730 * Even though table entries have now been swapped, other CPU's
731 * may still be using the old entries. This is okay, because
732 * resynchronization happens because of the locking done
733 * during the get_counters() routine.
739 EXPORT_SYMBOL_GPL(xt_replace_table);
741 struct xt_table *xt_register_table(struct net *net,
742 const struct xt_table *input_table,
743 struct xt_table_info *bootstrap,
744 struct xt_table_info *newinfo)
747 struct xt_table_info *private;
748 struct xt_table *t, *table;
750 /* Don't add one object to multiple lists. */
751 table = kmemdup(input_table, sizeof(struct xt_table), GFP_KERNEL);
757 ret = mutex_lock_interruptible(&xt[table->af].mutex);
761 /* Don't autoload: we'd eat our tail... */
762 list_for_each_entry(t, &net->xt.tables[table->af], list) {
763 if (strcmp(t->name, table->name) == 0) {
769 /* Simplifies replace_table code. */
770 table->private = bootstrap;
772 if (!xt_replace_table(table, 0, newinfo, &ret))
775 private = table->private;
776 duprintf("table->private->number = %u\n", private->number);
778 /* save number of initial entries */
779 private->initial_entries = private->number;
781 list_add(&table->list, &net->xt.tables[table->af]);
782 mutex_unlock(&xt[table->af].mutex);
786 mutex_unlock(&xt[table->af].mutex);
792 EXPORT_SYMBOL_GPL(xt_register_table);
794 void *xt_unregister_table(struct xt_table *table)
796 struct xt_table_info *private;
798 mutex_lock(&xt[table->af].mutex);
799 private = table->private;
800 list_del(&table->list);
801 mutex_unlock(&xt[table->af].mutex);
806 EXPORT_SYMBOL_GPL(xt_unregister_table);
808 #ifdef CONFIG_PROC_FS
809 struct xt_names_priv {
810 struct seq_net_private p;
813 static void *xt_table_seq_start(struct seq_file *seq, loff_t *pos)
815 struct xt_names_priv *priv = seq->private;
816 struct net *net = seq_file_net(seq);
817 u_int8_t af = priv->af;
819 mutex_lock(&xt[af].mutex);
820 return seq_list_start(&net->xt.tables[af], *pos);
823 static void *xt_table_seq_next(struct seq_file *seq, void *v, loff_t *pos)
825 struct xt_names_priv *priv = seq->private;
826 struct net *net = seq_file_net(seq);
827 u_int8_t af = priv->af;
829 return seq_list_next(v, &net->xt.tables[af], pos);
832 static void xt_table_seq_stop(struct seq_file *seq, void *v)
834 struct xt_names_priv *priv = seq->private;
835 u_int8_t af = priv->af;
837 mutex_unlock(&xt[af].mutex);
840 static int xt_table_seq_show(struct seq_file *seq, void *v)
842 struct xt_table *table = list_entry(v, struct xt_table, list);
844 if (strlen(table->name))
845 return seq_printf(seq, "%s\n", table->name);
850 static const struct seq_operations xt_table_seq_ops = {
851 .start = xt_table_seq_start,
852 .next = xt_table_seq_next,
853 .stop = xt_table_seq_stop,
854 .show = xt_table_seq_show,
857 static int xt_table_open(struct inode *inode, struct file *file)
860 struct xt_names_priv *priv;
862 ret = seq_open_net(inode, file, &xt_table_seq_ops,
863 sizeof(struct xt_names_priv));
865 priv = ((struct seq_file *)file->private_data)->private;
866 priv->af = (unsigned long)PDE(inode)->data;
871 static const struct file_operations xt_table_ops = {
872 .owner = THIS_MODULE,
873 .open = xt_table_open,
876 .release = seq_release_net,
880 * Traverse state for ip{,6}_{tables,matches} for helping crossing
881 * the multi-AF mutexes.
883 struct nf_mttg_trav {
884 struct list_head *head, *curr;
885 uint8_t class, nfproto;
890 MTTG_TRAV_NFP_UNSPEC,
895 static void *xt_mttg_seq_next(struct seq_file *seq, void *v, loff_t *ppos,
898 static const uint8_t next_class[] = {
899 [MTTG_TRAV_NFP_UNSPEC] = MTTG_TRAV_NFP_SPEC,
900 [MTTG_TRAV_NFP_SPEC] = MTTG_TRAV_DONE,
902 struct nf_mttg_trav *trav = seq->private;
904 switch (trav->class) {
906 trav->class = MTTG_TRAV_NFP_UNSPEC;
907 mutex_lock(&xt[NFPROTO_UNSPEC].mutex);
908 trav->head = trav->curr = is_target ?
909 &xt[NFPROTO_UNSPEC].target : &xt[NFPROTO_UNSPEC].match;
911 case MTTG_TRAV_NFP_UNSPEC:
912 trav->curr = trav->curr->next;
913 if (trav->curr != trav->head)
915 mutex_unlock(&xt[NFPROTO_UNSPEC].mutex);
916 mutex_lock(&xt[trav->nfproto].mutex);
917 trav->head = trav->curr = is_target ?
918 &xt[trav->nfproto].target : &xt[trav->nfproto].match;
919 trav->class = next_class[trav->class];
921 case MTTG_TRAV_NFP_SPEC:
922 trav->curr = trav->curr->next;
923 if (trav->curr != trav->head)
925 /* fallthru, _stop will unlock */
935 static void *xt_mttg_seq_start(struct seq_file *seq, loff_t *pos,
938 struct nf_mttg_trav *trav = seq->private;
941 trav->class = MTTG_TRAV_INIT;
942 for (j = 0; j < *pos; ++j)
943 if (xt_mttg_seq_next(seq, NULL, NULL, is_target) == NULL)
948 static void xt_mttg_seq_stop(struct seq_file *seq, void *v)
950 struct nf_mttg_trav *trav = seq->private;
952 switch (trav->class) {
953 case MTTG_TRAV_NFP_UNSPEC:
954 mutex_unlock(&xt[NFPROTO_UNSPEC].mutex);
956 case MTTG_TRAV_NFP_SPEC:
957 mutex_unlock(&xt[trav->nfproto].mutex);
962 static void *xt_match_seq_start(struct seq_file *seq, loff_t *pos)
964 return xt_mttg_seq_start(seq, pos, false);
967 static void *xt_match_seq_next(struct seq_file *seq, void *v, loff_t *ppos)
969 return xt_mttg_seq_next(seq, v, ppos, false);
972 static int xt_match_seq_show(struct seq_file *seq, void *v)
974 const struct nf_mttg_trav *trav = seq->private;
975 const struct xt_match *match;
977 switch (trav->class) {
978 case MTTG_TRAV_NFP_UNSPEC:
979 case MTTG_TRAV_NFP_SPEC:
980 if (trav->curr == trav->head)
982 match = list_entry(trav->curr, struct xt_match, list);
983 return (*match->name == '\0') ? 0 :
984 seq_printf(seq, "%s\n", match->name);
989 static const struct seq_operations xt_match_seq_ops = {
990 .start = xt_match_seq_start,
991 .next = xt_match_seq_next,
992 .stop = xt_mttg_seq_stop,
993 .show = xt_match_seq_show,
996 static int xt_match_open(struct inode *inode, struct file *file)
998 struct seq_file *seq;
999 struct nf_mttg_trav *trav;
1002 trav = kmalloc(sizeof(*trav), GFP_KERNEL);
1006 ret = seq_open(file, &xt_match_seq_ops);
1012 seq = file->private_data;
1013 seq->private = trav;
1014 trav->nfproto = (unsigned long)PDE(inode)->data;
1018 static const struct file_operations xt_match_ops = {
1019 .owner = THIS_MODULE,
1020 .open = xt_match_open,
1022 .llseek = seq_lseek,
1023 .release = seq_release_private,
1026 static void *xt_target_seq_start(struct seq_file *seq, loff_t *pos)
1028 return xt_mttg_seq_start(seq, pos, true);
1031 static void *xt_target_seq_next(struct seq_file *seq, void *v, loff_t *ppos)
1033 return xt_mttg_seq_next(seq, v, ppos, true);
1036 static int xt_target_seq_show(struct seq_file *seq, void *v)
1038 const struct nf_mttg_trav *trav = seq->private;
1039 const struct xt_target *target;
1041 switch (trav->class) {
1042 case MTTG_TRAV_NFP_UNSPEC:
1043 case MTTG_TRAV_NFP_SPEC:
1044 if (trav->curr == trav->head)
1046 target = list_entry(trav->curr, struct xt_target, list);
1047 return (*target->name == '\0') ? 0 :
1048 seq_printf(seq, "%s\n", target->name);
1053 static const struct seq_operations xt_target_seq_ops = {
1054 .start = xt_target_seq_start,
1055 .next = xt_target_seq_next,
1056 .stop = xt_mttg_seq_stop,
1057 .show = xt_target_seq_show,
1060 static int xt_target_open(struct inode *inode, struct file *file)
1062 struct seq_file *seq;
1063 struct nf_mttg_trav *trav;
1066 trav = kmalloc(sizeof(*trav), GFP_KERNEL);
1070 ret = seq_open(file, &xt_target_seq_ops);
1076 seq = file->private_data;
1077 seq->private = trav;
1078 trav->nfproto = (unsigned long)PDE(inode)->data;
1082 static const struct file_operations xt_target_ops = {
1083 .owner = THIS_MODULE,
1084 .open = xt_target_open,
1086 .llseek = seq_lseek,
1087 .release = seq_release_private,
1090 #define FORMAT_TABLES "_tables_names"
1091 #define FORMAT_MATCHES "_tables_matches"
1092 #define FORMAT_TARGETS "_tables_targets"
1094 #endif /* CONFIG_PROC_FS */
1097 * xt_hook_link - set up hooks for a new table
1098 * @table: table with metadata needed to set up hooks
1099 * @fn: Hook function
1101 * This function will take care of creating and registering the necessary
1102 * Netfilter hooks for XT tables.
1104 struct nf_hook_ops *xt_hook_link(const struct xt_table *table, nf_hookfn *fn)
1106 unsigned int hook_mask = table->valid_hooks;
1107 uint8_t i, num_hooks = hweight32(hook_mask);
1109 struct nf_hook_ops *ops;
1112 ops = kmalloc(sizeof(*ops) * num_hooks, GFP_KERNEL);
1114 return ERR_PTR(-ENOMEM);
1116 for (i = 0, hooknum = 0; i < num_hooks && hook_mask != 0;
1117 hook_mask >>= 1, ++hooknum) {
1118 if (!(hook_mask & 1))
1121 ops[i].owner = table->me;
1122 ops[i].pf = table->af;
1123 ops[i].hooknum = hooknum;
1124 ops[i].priority = table->priority;
1128 ret = nf_register_hooks(ops, num_hooks);
1131 return ERR_PTR(ret);
1136 EXPORT_SYMBOL_GPL(xt_hook_link);
1139 * xt_hook_unlink - remove hooks for a table
1140 * @ops: nf_hook_ops array as returned by nf_hook_link
1141 * @hook_mask: the very same mask that was passed to nf_hook_link
1143 void xt_hook_unlink(const struct xt_table *table, struct nf_hook_ops *ops)
1145 nf_unregister_hooks(ops, hweight32(table->valid_hooks));
1148 EXPORT_SYMBOL_GPL(xt_hook_unlink);
1150 int xt_proto_init(struct net *net, u_int8_t af)
1152 #ifdef CONFIG_PROC_FS
1153 char buf[XT_FUNCTION_MAXNAMELEN];
1154 struct proc_dir_entry *proc;
1157 if (af >= ARRAY_SIZE(xt_prefix))
1161 #ifdef CONFIG_PROC_FS
1162 strlcpy(buf, xt_prefix[af], sizeof(buf));
1163 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1164 proc = proc_create_data(buf, 0440, net->proc_net, &xt_table_ops,
1165 (void *)(unsigned long)af);
1169 strlcpy(buf, xt_prefix[af], sizeof(buf));
1170 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1171 proc = proc_create_data(buf, 0440, net->proc_net, &xt_match_ops,
1172 (void *)(unsigned long)af);
1174 goto out_remove_tables;
1176 strlcpy(buf, xt_prefix[af], sizeof(buf));
1177 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
1178 proc = proc_create_data(buf, 0440, net->proc_net, &xt_target_ops,
1179 (void *)(unsigned long)af);
1181 goto out_remove_matches;
1186 #ifdef CONFIG_PROC_FS
1188 strlcpy(buf, xt_prefix[af], sizeof(buf));
1189 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1190 proc_net_remove(net, buf);
1193 strlcpy(buf, xt_prefix[af], sizeof(buf));
1194 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1195 proc_net_remove(net, buf);
1200 EXPORT_SYMBOL_GPL(xt_proto_init);
1202 void xt_proto_fini(struct net *net, u_int8_t af)
1204 #ifdef CONFIG_PROC_FS
1205 char buf[XT_FUNCTION_MAXNAMELEN];
1207 strlcpy(buf, xt_prefix[af], sizeof(buf));
1208 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1209 proc_net_remove(net, buf);
1211 strlcpy(buf, xt_prefix[af], sizeof(buf));
1212 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
1213 proc_net_remove(net, buf);
1215 strlcpy(buf, xt_prefix[af], sizeof(buf));
1216 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1217 proc_net_remove(net, buf);
1218 #endif /*CONFIG_PROC_FS*/
1220 EXPORT_SYMBOL_GPL(xt_proto_fini);
1222 static int __net_init xt_net_init(struct net *net)
1226 for (i = 0; i < NFPROTO_NUMPROTO; i++)
1227 INIT_LIST_HEAD(&net->xt.tables[i]);
1231 static struct pernet_operations xt_net_ops = {
1232 .init = xt_net_init,
1235 static int __init xt_init(void)
1240 for_each_possible_cpu(i) {
1241 struct xt_info_lock *lock = &per_cpu(xt_info_locks, i);
1242 spin_lock_init(&lock->lock);
1246 xt = kmalloc(sizeof(struct xt_af) * NFPROTO_NUMPROTO, GFP_KERNEL);
1250 for (i = 0; i < NFPROTO_NUMPROTO; i++) {
1251 mutex_init(&xt[i].mutex);
1252 #ifdef CONFIG_COMPAT
1253 mutex_init(&xt[i].compat_mutex);
1254 xt[i].compat_offsets = NULL;
1256 INIT_LIST_HEAD(&xt[i].target);
1257 INIT_LIST_HEAD(&xt[i].match);
1259 rv = register_pernet_subsys(&xt_net_ops);
1265 static void __exit xt_fini(void)
1267 unregister_pernet_subsys(&xt_net_ops);
1271 module_init(xt_init);
1272 module_exit(xt_fini);