2 * x_tables core - Backend for {ip,ip6,arp}_tables
4 * Copyright (C) 2006-2006 Harald Welte <laforge@netfilter.org>
5 * Copyright (C) 2006-2012 Patrick McHardy <kaber@trash.net>
7 * Based on existing ip_tables code which is
8 * Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling
9 * Copyright (C) 2000-2005 Netfilter Core Team <coreteam@netfilter.org>
11 * This program is free software; you can redistribute it and/or modify
12 * it under the terms of the GNU General Public License version 2 as
13 * published by the Free Software Foundation.
16 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
17 #include <linux/kernel.h>
18 #include <linux/module.h>
19 #include <linux/socket.h>
20 #include <linux/net.h>
21 #include <linux/proc_fs.h>
22 #include <linux/seq_file.h>
23 #include <linux/string.h>
24 #include <linux/vmalloc.h>
25 #include <linux/mutex.h>
27 #include <linux/slab.h>
28 #include <linux/audit.h>
29 #include <net/net_namespace.h>
31 #include <linux/netfilter/x_tables.h>
32 #include <linux/netfilter_arp.h>
33 #include <linux/netfilter_ipv4/ip_tables.h>
34 #include <linux/netfilter_ipv6/ip6_tables.h>
35 #include <linux/netfilter_arp/arp_tables.h>
37 MODULE_LICENSE("GPL");
38 MODULE_AUTHOR("Harald Welte <laforge@netfilter.org>");
39 MODULE_DESCRIPTION("{ip,ip6,arp,eb}_tables backend module");
41 #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1))
44 unsigned int offset; /* offset in kernel */
45 int delta; /* delta in 32bit user land */
50 struct list_head match;
51 struct list_head target;
53 struct mutex compat_mutex;
54 struct compat_delta *compat_tab;
55 unsigned int number; /* number of slots in compat_tab[] */
56 unsigned int cur; /* number of used slots in compat_tab[] */
60 static struct xt_af *xt;
62 static const char *const xt_prefix[NFPROTO_NUMPROTO] = {
63 [NFPROTO_UNSPEC] = "x",
64 [NFPROTO_IPV4] = "ip",
65 [NFPROTO_ARP] = "arp",
66 [NFPROTO_BRIDGE] = "eb",
67 [NFPROTO_IPV6] = "ip6",
70 /* Registration hooks for targets. */
71 int xt_register_target(struct xt_target *target)
73 u_int8_t af = target->family;
75 mutex_lock(&xt[af].mutex);
76 list_add(&target->list, &xt[af].target);
77 mutex_unlock(&xt[af].mutex);
80 EXPORT_SYMBOL(xt_register_target);
83 xt_unregister_target(struct xt_target *target)
85 u_int8_t af = target->family;
87 mutex_lock(&xt[af].mutex);
88 list_del(&target->list);
89 mutex_unlock(&xt[af].mutex);
91 EXPORT_SYMBOL(xt_unregister_target);
94 xt_register_targets(struct xt_target *target, unsigned int n)
99 for (i = 0; i < n; i++) {
100 err = xt_register_target(&target[i]);
108 xt_unregister_targets(target, i);
111 EXPORT_SYMBOL(xt_register_targets);
114 xt_unregister_targets(struct xt_target *target, unsigned int n)
117 xt_unregister_target(&target[n]);
119 EXPORT_SYMBOL(xt_unregister_targets);
121 int xt_register_match(struct xt_match *match)
123 u_int8_t af = match->family;
125 mutex_lock(&xt[af].mutex);
126 list_add(&match->list, &xt[af].match);
127 mutex_unlock(&xt[af].mutex);
130 EXPORT_SYMBOL(xt_register_match);
133 xt_unregister_match(struct xt_match *match)
135 u_int8_t af = match->family;
137 mutex_lock(&xt[af].mutex);
138 list_del(&match->list);
139 mutex_unlock(&xt[af].mutex);
141 EXPORT_SYMBOL(xt_unregister_match);
144 xt_register_matches(struct xt_match *match, unsigned int n)
149 for (i = 0; i < n; i++) {
150 err = xt_register_match(&match[i]);
158 xt_unregister_matches(match, i);
161 EXPORT_SYMBOL(xt_register_matches);
164 xt_unregister_matches(struct xt_match *match, unsigned int n)
167 xt_unregister_match(&match[n]);
169 EXPORT_SYMBOL(xt_unregister_matches);
173 * These are weird, but module loading must not be done with mutex
174 * held (since they will register), and we have to have a single
178 /* Find match, grabs ref. Returns ERR_PTR() on error. */
179 struct xt_match *xt_find_match(u8 af, const char *name, u8 revision)
184 mutex_lock(&xt[af].mutex);
185 list_for_each_entry(m, &xt[af].match, list) {
186 if (strcmp(m->name, name) == 0) {
187 if (m->revision == revision) {
188 if (try_module_get(m->me)) {
189 mutex_unlock(&xt[af].mutex);
193 err = -EPROTOTYPE; /* Found something. */
196 mutex_unlock(&xt[af].mutex);
198 if (af != NFPROTO_UNSPEC)
199 /* Try searching again in the family-independent list */
200 return xt_find_match(NFPROTO_UNSPEC, name, revision);
204 EXPORT_SYMBOL(xt_find_match);
207 xt_request_find_match(uint8_t nfproto, const char *name, uint8_t revision)
209 struct xt_match *match;
211 match = xt_find_match(nfproto, name, revision);
213 request_module("%st_%s", xt_prefix[nfproto], name);
214 match = xt_find_match(nfproto, name, revision);
219 EXPORT_SYMBOL_GPL(xt_request_find_match);
221 /* Find target, grabs ref. Returns ERR_PTR() on error. */
222 struct xt_target *xt_find_target(u8 af, const char *name, u8 revision)
227 mutex_lock(&xt[af].mutex);
228 list_for_each_entry(t, &xt[af].target, list) {
229 if (strcmp(t->name, name) == 0) {
230 if (t->revision == revision) {
231 if (try_module_get(t->me)) {
232 mutex_unlock(&xt[af].mutex);
236 err = -EPROTOTYPE; /* Found something. */
239 mutex_unlock(&xt[af].mutex);
241 if (af != NFPROTO_UNSPEC)
242 /* Try searching again in the family-independent list */
243 return xt_find_target(NFPROTO_UNSPEC, name, revision);
247 EXPORT_SYMBOL(xt_find_target);
249 struct xt_target *xt_request_find_target(u8 af, const char *name, u8 revision)
251 struct xt_target *target;
253 target = xt_find_target(af, name, revision);
254 if (IS_ERR(target)) {
255 request_module("%st_%s", xt_prefix[af], name);
256 target = xt_find_target(af, name, revision);
261 EXPORT_SYMBOL_GPL(xt_request_find_target);
263 static int match_revfn(u8 af, const char *name, u8 revision, int *bestp)
265 const struct xt_match *m;
268 list_for_each_entry(m, &xt[af].match, list) {
269 if (strcmp(m->name, name) == 0) {
270 if (m->revision > *bestp)
271 *bestp = m->revision;
272 if (m->revision == revision)
277 if (af != NFPROTO_UNSPEC && !have_rev)
278 return match_revfn(NFPROTO_UNSPEC, name, revision, bestp);
283 static int target_revfn(u8 af, const char *name, u8 revision, int *bestp)
285 const struct xt_target *t;
288 list_for_each_entry(t, &xt[af].target, list) {
289 if (strcmp(t->name, name) == 0) {
290 if (t->revision > *bestp)
291 *bestp = t->revision;
292 if (t->revision == revision)
297 if (af != NFPROTO_UNSPEC && !have_rev)
298 return target_revfn(NFPROTO_UNSPEC, name, revision, bestp);
303 /* Returns true or false (if no such extension at all) */
304 int xt_find_revision(u8 af, const char *name, u8 revision, int target,
307 int have_rev, best = -1;
309 mutex_lock(&xt[af].mutex);
311 have_rev = target_revfn(af, name, revision, &best);
313 have_rev = match_revfn(af, name, revision, &best);
314 mutex_unlock(&xt[af].mutex);
316 /* Nothing at all? Return 0 to try loading module. */
324 *err = -EPROTONOSUPPORT;
327 EXPORT_SYMBOL_GPL(xt_find_revision);
330 textify_hooks(char *buf, size_t size, unsigned int mask, uint8_t nfproto)
332 static const char *const inetbr_names[] = {
333 "PREROUTING", "INPUT", "FORWARD",
334 "OUTPUT", "POSTROUTING", "BROUTING",
336 static const char *const arp_names[] = {
337 "INPUT", "FORWARD", "OUTPUT",
339 const char *const *names;
345 names = (nfproto == NFPROTO_ARP) ? arp_names : inetbr_names;
346 max = (nfproto == NFPROTO_ARP) ? ARRAY_SIZE(arp_names) :
347 ARRAY_SIZE(inetbr_names);
349 for (i = 0; i < max; ++i) {
350 if (!(mask & (1 << i)))
352 res = snprintf(p, size, "%s%s", np ? "/" : "", names[i]);
363 int xt_check_match(struct xt_mtchk_param *par,
364 unsigned int size, u_int8_t proto, bool inv_proto)
368 if (XT_ALIGN(par->match->matchsize) != size &&
369 par->match->matchsize != -1) {
371 * ebt_among is exempt from centralized matchsize checking
372 * because it uses a dynamic-size data set.
374 pr_err("%s_tables: %s.%u match: invalid size "
375 "%u (kernel) != (user) %u\n",
376 xt_prefix[par->family], par->match->name,
377 par->match->revision,
378 XT_ALIGN(par->match->matchsize), size);
381 if (par->match->table != NULL &&
382 strcmp(par->match->table, par->table) != 0) {
383 pr_err("%s_tables: %s match: only valid in %s table, not %s\n",
384 xt_prefix[par->family], par->match->name,
385 par->match->table, par->table);
388 if (par->match->hooks && (par->hook_mask & ~par->match->hooks) != 0) {
389 char used[64], allow[64];
391 pr_err("%s_tables: %s match: used from hooks %s, but only "
393 xt_prefix[par->family], par->match->name,
394 textify_hooks(used, sizeof(used), par->hook_mask,
396 textify_hooks(allow, sizeof(allow), par->match->hooks,
400 if (par->match->proto && (par->match->proto != proto || inv_proto)) {
401 pr_err("%s_tables: %s match: only valid for protocol %u\n",
402 xt_prefix[par->family], par->match->name,
406 if (par->match->checkentry != NULL) {
407 ret = par->match->checkentry(par);
411 /* Flag up potential errors. */
416 EXPORT_SYMBOL_GPL(xt_check_match);
418 /** xt_check_entry_match - check that matches end before start of target
420 * @match: beginning of xt_entry_match
421 * @target: beginning of this rules target (alleged end of matches)
422 * @alignment: alignment requirement of match structures
424 * Validates that all matches add up to the beginning of the target,
425 * and that each match covers at least the base structure size.
427 * Return: 0 on success, negative errno on failure.
429 static int xt_check_entry_match(const char *match, const char *target,
430 const size_t alignment)
432 const struct xt_entry_match *pos;
433 int length = target - match;
435 if (length == 0) /* no matches */
438 pos = (struct xt_entry_match *)match;
440 if ((unsigned long)pos % alignment)
443 if (length < (int)sizeof(struct xt_entry_match))
446 if (pos->u.match_size < sizeof(struct xt_entry_match))
449 if (pos->u.match_size > length)
452 length -= pos->u.match_size;
453 pos = ((void *)((char *)(pos) + (pos)->u.match_size));
454 } while (length > 0);
460 int xt_compat_add_offset(u_int8_t af, unsigned int offset, int delta)
462 struct xt_af *xp = &xt[af];
464 if (!xp->compat_tab) {
467 xp->compat_tab = vmalloc(sizeof(struct compat_delta) * xp->number);
473 if (xp->cur >= xp->number)
477 delta += xp->compat_tab[xp->cur - 1].delta;
478 xp->compat_tab[xp->cur].offset = offset;
479 xp->compat_tab[xp->cur].delta = delta;
483 EXPORT_SYMBOL_GPL(xt_compat_add_offset);
485 void xt_compat_flush_offsets(u_int8_t af)
487 if (xt[af].compat_tab) {
488 vfree(xt[af].compat_tab);
489 xt[af].compat_tab = NULL;
494 EXPORT_SYMBOL_GPL(xt_compat_flush_offsets);
496 int xt_compat_calc_jump(u_int8_t af, unsigned int offset)
498 struct compat_delta *tmp = xt[af].compat_tab;
499 int mid, left = 0, right = xt[af].cur - 1;
501 while (left <= right) {
502 mid = (left + right) >> 1;
503 if (offset > tmp[mid].offset)
505 else if (offset < tmp[mid].offset)
508 return mid ? tmp[mid - 1].delta : 0;
510 return left ? tmp[left - 1].delta : 0;
512 EXPORT_SYMBOL_GPL(xt_compat_calc_jump);
514 void xt_compat_init_offsets(u_int8_t af, unsigned int number)
516 xt[af].number = number;
519 EXPORT_SYMBOL(xt_compat_init_offsets);
521 int xt_compat_match_offset(const struct xt_match *match)
523 u_int16_t csize = match->compatsize ? : match->matchsize;
524 return XT_ALIGN(match->matchsize) - COMPAT_XT_ALIGN(csize);
526 EXPORT_SYMBOL_GPL(xt_compat_match_offset);
528 void xt_compat_match_from_user(struct xt_entry_match *m, void **dstptr,
531 const struct xt_match *match = m->u.kernel.match;
532 struct compat_xt_entry_match *cm = (struct compat_xt_entry_match *)m;
533 int pad, off = xt_compat_match_offset(match);
534 u_int16_t msize = cm->u.user.match_size;
535 char name[sizeof(m->u.user.name)];
538 memcpy(m, cm, sizeof(*cm));
539 if (match->compat_from_user)
540 match->compat_from_user(m->data, cm->data);
542 memcpy(m->data, cm->data, msize - sizeof(*cm));
543 pad = XT_ALIGN(match->matchsize) - match->matchsize;
545 memset(m->data + match->matchsize, 0, pad);
548 m->u.user.match_size = msize;
549 strlcpy(name, match->name, sizeof(name));
550 module_put(match->me);
551 strncpy(m->u.user.name, name, sizeof(m->u.user.name));
556 EXPORT_SYMBOL_GPL(xt_compat_match_from_user);
558 int xt_compat_match_to_user(const struct xt_entry_match *m,
559 void __user **dstptr, unsigned int *size)
561 const struct xt_match *match = m->u.kernel.match;
562 struct compat_xt_entry_match __user *cm = *dstptr;
563 int off = xt_compat_match_offset(match);
564 u_int16_t msize = m->u.user.match_size - off;
566 if (copy_to_user(cm, m, sizeof(*cm)) ||
567 put_user(msize, &cm->u.user.match_size) ||
568 copy_to_user(cm->u.user.name, m->u.kernel.match->name,
569 strlen(m->u.kernel.match->name) + 1))
572 if (match->compat_to_user) {
573 if (match->compat_to_user((void __user *)cm->data, m->data))
576 if (copy_to_user(cm->data, m->data, msize - sizeof(*cm)))
584 EXPORT_SYMBOL_GPL(xt_compat_match_to_user);
586 /* non-compat version may have padding after verdict */
587 struct compat_xt_standard_target {
588 struct compat_xt_entry_target t;
589 compat_uint_t verdict;
592 int xt_compat_check_entry_offsets(const void *base, const char *elems,
593 unsigned int target_offset,
594 unsigned int next_offset)
596 long size_of_base_struct = elems - (const char *)base;
597 const struct compat_xt_entry_target *t;
598 const char *e = base;
600 if (target_offset < size_of_base_struct)
603 if (target_offset + sizeof(*t) > next_offset)
606 t = (void *)(e + target_offset);
607 if (t->u.target_size < sizeof(*t))
610 if (target_offset + t->u.target_size > next_offset)
613 if (strcmp(t->u.user.name, XT_STANDARD_TARGET) == 0 &&
614 COMPAT_XT_ALIGN(target_offset + sizeof(struct compat_xt_standard_target)) != next_offset)
617 /* compat_xt_entry match has less strict aligment requirements,
618 * otherwise they are identical. In case of padding differences
619 * we need to add compat version of xt_check_entry_match.
621 BUILD_BUG_ON(sizeof(struct compat_xt_entry_match) != sizeof(struct xt_entry_match));
623 return xt_check_entry_match(elems, base + target_offset,
624 __alignof__(struct compat_xt_entry_match));
626 EXPORT_SYMBOL(xt_compat_check_entry_offsets);
627 #endif /* CONFIG_COMPAT */
630 * xt_check_entry_offsets - validate arp/ip/ip6t_entry
632 * @base: pointer to arp/ip/ip6t_entry
633 * @elems: pointer to first xt_entry_match, i.e. ip(6)t_entry->elems
634 * @target_offset: the arp/ip/ip6_t->target_offset
635 * @next_offset: the arp/ip/ip6_t->next_offset
637 * validates that target_offset and next_offset are sane and that all
638 * match sizes (if any) align with the target offset.
640 * This function does not validate the targets or matches themselves, it
641 * only tests that all the offsets and sizes are correct, that all
642 * match structures are aligned, and that the last structure ends where
643 * the target structure begins.
645 * Also see xt_compat_check_entry_offsets for CONFIG_COMPAT version.
647 * The arp/ip/ip6t_entry structure @base must have passed following tests:
648 * - it must point to a valid memory location
649 * - base to base + next_offset must be accessible, i.e. not exceed allocated
652 * A well-formed entry looks like this:
654 * ip(6)t_entry match [mtdata] match [mtdata] target [tgdata] ip(6)t_entry
655 * e->elems[]-----' | |
659 * target_offset---------------------------------' |
660 * next_offset---------------------------------------------------'
662 * elems[]: flexible array member at end of ip(6)/arpt_entry struct.
663 * This is where matches (if any) and the target reside.
664 * target_offset: beginning of target.
665 * next_offset: start of the next rule; also: size of this rule.
666 * Since targets have a minimum size, target_offset + minlen <= next_offset.
668 * Every match stores its size, sum of sizes must not exceed target_offset.
670 * Return: 0 on success, negative errno on failure.
672 int xt_check_entry_offsets(const void *base,
674 unsigned int target_offset,
675 unsigned int next_offset)
677 long size_of_base_struct = elems - (const char *)base;
678 const struct xt_entry_target *t;
679 const char *e = base;
681 /* target start is within the ip/ip6/arpt_entry struct */
682 if (target_offset < size_of_base_struct)
685 if (target_offset + sizeof(*t) > next_offset)
688 t = (void *)(e + target_offset);
689 if (t->u.target_size < sizeof(*t))
692 if (target_offset + t->u.target_size > next_offset)
695 if (strcmp(t->u.user.name, XT_STANDARD_TARGET) == 0 &&
696 XT_ALIGN(target_offset + sizeof(struct xt_standard_target)) != next_offset)
699 return xt_check_entry_match(elems, base + target_offset,
700 __alignof__(struct xt_entry_match));
702 EXPORT_SYMBOL(xt_check_entry_offsets);
704 int xt_check_target(struct xt_tgchk_param *par,
705 unsigned int size, u_int8_t proto, bool inv_proto)
709 if (XT_ALIGN(par->target->targetsize) != size) {
710 pr_err("%s_tables: %s.%u target: invalid size "
711 "%u (kernel) != (user) %u\n",
712 xt_prefix[par->family], par->target->name,
713 par->target->revision,
714 XT_ALIGN(par->target->targetsize), size);
717 if (par->target->table != NULL &&
718 strcmp(par->target->table, par->table) != 0) {
719 pr_err("%s_tables: %s target: only valid in %s table, not %s\n",
720 xt_prefix[par->family], par->target->name,
721 par->target->table, par->table);
724 if (par->target->hooks && (par->hook_mask & ~par->target->hooks) != 0) {
725 char used[64], allow[64];
727 pr_err("%s_tables: %s target: used from hooks %s, but only "
729 xt_prefix[par->family], par->target->name,
730 textify_hooks(used, sizeof(used), par->hook_mask,
732 textify_hooks(allow, sizeof(allow), par->target->hooks,
736 if (par->target->proto && (par->target->proto != proto || inv_proto)) {
737 pr_err("%s_tables: %s target: only valid for protocol %u\n",
738 xt_prefix[par->family], par->target->name,
742 if (par->target->checkentry != NULL) {
743 ret = par->target->checkentry(par);
747 /* Flag up potential errors. */
752 EXPORT_SYMBOL_GPL(xt_check_target);
755 int xt_compat_target_offset(const struct xt_target *target)
757 u_int16_t csize = target->compatsize ? : target->targetsize;
758 return XT_ALIGN(target->targetsize) - COMPAT_XT_ALIGN(csize);
760 EXPORT_SYMBOL_GPL(xt_compat_target_offset);
762 void xt_compat_target_from_user(struct xt_entry_target *t, void **dstptr,
765 const struct xt_target *target = t->u.kernel.target;
766 struct compat_xt_entry_target *ct = (struct compat_xt_entry_target *)t;
767 int pad, off = xt_compat_target_offset(target);
768 u_int16_t tsize = ct->u.user.target_size;
769 char name[sizeof(t->u.user.name)];
772 memcpy(t, ct, sizeof(*ct));
773 if (target->compat_from_user)
774 target->compat_from_user(t->data, ct->data);
776 memcpy(t->data, ct->data, tsize - sizeof(*ct));
777 pad = XT_ALIGN(target->targetsize) - target->targetsize;
779 memset(t->data + target->targetsize, 0, pad);
782 t->u.user.target_size = tsize;
783 strlcpy(name, target->name, sizeof(name));
784 module_put(target->me);
785 strncpy(t->u.user.name, name, sizeof(t->u.user.name));
790 EXPORT_SYMBOL_GPL(xt_compat_target_from_user);
792 int xt_compat_target_to_user(const struct xt_entry_target *t,
793 void __user **dstptr, unsigned int *size)
795 const struct xt_target *target = t->u.kernel.target;
796 struct compat_xt_entry_target __user *ct = *dstptr;
797 int off = xt_compat_target_offset(target);
798 u_int16_t tsize = t->u.user.target_size - off;
800 if (copy_to_user(ct, t, sizeof(*ct)) ||
801 put_user(tsize, &ct->u.user.target_size) ||
802 copy_to_user(ct->u.user.name, t->u.kernel.target->name,
803 strlen(t->u.kernel.target->name) + 1))
806 if (target->compat_to_user) {
807 if (target->compat_to_user((void __user *)ct->data, t->data))
810 if (copy_to_user(ct->data, t->data, tsize - sizeof(*ct)))
818 EXPORT_SYMBOL_GPL(xt_compat_target_to_user);
821 struct xt_table_info *xt_alloc_table_info(unsigned int size)
823 struct xt_table_info *info = NULL;
824 size_t sz = sizeof(*info) + size;
826 /* Pedantry: prevent them from hitting BUG() in vmalloc.c --RR */
827 if ((SMP_ALIGN(size) >> PAGE_SHIFT) + 2 > totalram_pages)
830 if (sz <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER))
831 info = kmalloc(sz, GFP_KERNEL | __GFP_NOWARN | __GFP_NORETRY);
837 memset(info, 0, sizeof(*info));
841 EXPORT_SYMBOL(xt_alloc_table_info);
843 void xt_free_table_info(struct xt_table_info *info)
847 if (info->jumpstack != NULL) {
848 for_each_possible_cpu(cpu)
849 kvfree(info->jumpstack[cpu]);
850 kvfree(info->jumpstack);
855 EXPORT_SYMBOL(xt_free_table_info);
857 /* Find table by name, grabs mutex & ref. Returns ERR_PTR() on error. */
858 struct xt_table *xt_find_table_lock(struct net *net, u_int8_t af,
863 mutex_lock(&xt[af].mutex);
864 list_for_each_entry(t, &net->xt.tables[af], list)
865 if (strcmp(t->name, name) == 0 && try_module_get(t->me))
867 mutex_unlock(&xt[af].mutex);
870 EXPORT_SYMBOL_GPL(xt_find_table_lock);
872 void xt_table_unlock(struct xt_table *table)
874 mutex_unlock(&xt[table->af].mutex);
876 EXPORT_SYMBOL_GPL(xt_table_unlock);
879 void xt_compat_lock(u_int8_t af)
881 mutex_lock(&xt[af].compat_mutex);
883 EXPORT_SYMBOL_GPL(xt_compat_lock);
885 void xt_compat_unlock(u_int8_t af)
887 mutex_unlock(&xt[af].compat_mutex);
889 EXPORT_SYMBOL_GPL(xt_compat_unlock);
892 DEFINE_PER_CPU(seqcount_t, xt_recseq);
893 EXPORT_PER_CPU_SYMBOL_GPL(xt_recseq);
895 struct static_key xt_tee_enabled __read_mostly;
896 EXPORT_SYMBOL_GPL(xt_tee_enabled);
898 static int xt_jumpstack_alloc(struct xt_table_info *i)
903 size = sizeof(void **) * nr_cpu_ids;
904 if (size > PAGE_SIZE)
905 i->jumpstack = vzalloc(size);
907 i->jumpstack = kzalloc(size, GFP_KERNEL);
908 if (i->jumpstack == NULL)
911 /* ruleset without jumps -- no stack needed */
912 if (i->stacksize == 0)
915 /* Jumpstack needs to be able to record two full callchains, one
916 * from the first rule set traversal, plus one table reentrancy
917 * via -j TEE without clobbering the callchain that brought us to
920 * This is done by allocating two jumpstacks per cpu, on reentry
921 * the upper half of the stack is used.
923 * see the jumpstack setup in ipt_do_table() for more details.
925 size = sizeof(void *) * i->stacksize * 2u;
926 for_each_possible_cpu(cpu) {
927 if (size > PAGE_SIZE)
928 i->jumpstack[cpu] = vmalloc_node(size,
931 i->jumpstack[cpu] = kmalloc_node(size,
932 GFP_KERNEL, cpu_to_node(cpu));
933 if (i->jumpstack[cpu] == NULL)
935 * Freeing will be done later on by the callers. The
936 * chain is: xt_replace_table -> __do_replace ->
937 * do_replace -> xt_free_table_info.
945 struct xt_table_info *
946 xt_replace_table(struct xt_table *table,
947 unsigned int num_counters,
948 struct xt_table_info *newinfo,
951 struct xt_table_info *private;
954 ret = xt_jumpstack_alloc(newinfo);
960 /* Do the substitution. */
962 private = table->private;
964 /* Check inside lock: is the old number correct? */
965 if (num_counters != private->number) {
966 pr_debug("num_counters != table->private->number (%u/%u)\n",
967 num_counters, private->number);
973 newinfo->initial_entries = private->initial_entries;
975 * Ensure contents of newinfo are visible before assigning to
979 table->private = newinfo;
982 * Even though table entries have now been swapped, other CPU's
983 * may still be using the old entries. This is okay, because
984 * resynchronization happens because of the locking done
985 * during the get_counters() routine.
991 struct audit_buffer *ab;
993 ab = audit_log_start(current->audit_context, GFP_KERNEL,
994 AUDIT_NETFILTER_CFG);
996 audit_log_format(ab, "table=%s family=%u entries=%u",
997 table->name, table->af,
1006 EXPORT_SYMBOL_GPL(xt_replace_table);
1008 struct xt_table *xt_register_table(struct net *net,
1009 const struct xt_table *input_table,
1010 struct xt_table_info *bootstrap,
1011 struct xt_table_info *newinfo)
1014 struct xt_table_info *private;
1015 struct xt_table *t, *table;
1017 /* Don't add one object to multiple lists. */
1018 table = kmemdup(input_table, sizeof(struct xt_table), GFP_KERNEL);
1024 mutex_lock(&xt[table->af].mutex);
1025 /* Don't autoload: we'd eat our tail... */
1026 list_for_each_entry(t, &net->xt.tables[table->af], list) {
1027 if (strcmp(t->name, table->name) == 0) {
1033 /* Simplifies replace_table code. */
1034 table->private = bootstrap;
1036 if (!xt_replace_table(table, 0, newinfo, &ret))
1039 private = table->private;
1040 pr_debug("table->private->number = %u\n", private->number);
1042 /* save number of initial entries */
1043 private->initial_entries = private->number;
1045 list_add(&table->list, &net->xt.tables[table->af]);
1046 mutex_unlock(&xt[table->af].mutex);
1050 mutex_unlock(&xt[table->af].mutex);
1053 return ERR_PTR(ret);
1055 EXPORT_SYMBOL_GPL(xt_register_table);
1057 void *xt_unregister_table(struct xt_table *table)
1059 struct xt_table_info *private;
1061 mutex_lock(&xt[table->af].mutex);
1062 private = table->private;
1063 list_del(&table->list);
1064 mutex_unlock(&xt[table->af].mutex);
1069 EXPORT_SYMBOL_GPL(xt_unregister_table);
1071 #ifdef CONFIG_PROC_FS
1072 struct xt_names_priv {
1073 struct seq_net_private p;
1076 static void *xt_table_seq_start(struct seq_file *seq, loff_t *pos)
1078 struct xt_names_priv *priv = seq->private;
1079 struct net *net = seq_file_net(seq);
1080 u_int8_t af = priv->af;
1082 mutex_lock(&xt[af].mutex);
1083 return seq_list_start(&net->xt.tables[af], *pos);
1086 static void *xt_table_seq_next(struct seq_file *seq, void *v, loff_t *pos)
1088 struct xt_names_priv *priv = seq->private;
1089 struct net *net = seq_file_net(seq);
1090 u_int8_t af = priv->af;
1092 return seq_list_next(v, &net->xt.tables[af], pos);
1095 static void xt_table_seq_stop(struct seq_file *seq, void *v)
1097 struct xt_names_priv *priv = seq->private;
1098 u_int8_t af = priv->af;
1100 mutex_unlock(&xt[af].mutex);
1103 static int xt_table_seq_show(struct seq_file *seq, void *v)
1105 struct xt_table *table = list_entry(v, struct xt_table, list);
1108 seq_printf(seq, "%s\n", table->name);
1112 static const struct seq_operations xt_table_seq_ops = {
1113 .start = xt_table_seq_start,
1114 .next = xt_table_seq_next,
1115 .stop = xt_table_seq_stop,
1116 .show = xt_table_seq_show,
1119 static int xt_table_open(struct inode *inode, struct file *file)
1122 struct xt_names_priv *priv;
1124 ret = seq_open_net(inode, file, &xt_table_seq_ops,
1125 sizeof(struct xt_names_priv));
1127 priv = ((struct seq_file *)file->private_data)->private;
1128 priv->af = (unsigned long)PDE_DATA(inode);
1133 static const struct file_operations xt_table_ops = {
1134 .owner = THIS_MODULE,
1135 .open = xt_table_open,
1137 .llseek = seq_lseek,
1138 .release = seq_release_net,
1142 * Traverse state for ip{,6}_{tables,matches} for helping crossing
1143 * the multi-AF mutexes.
1145 struct nf_mttg_trav {
1146 struct list_head *head, *curr;
1147 uint8_t class, nfproto;
1152 MTTG_TRAV_NFP_UNSPEC,
1157 static void *xt_mttg_seq_next(struct seq_file *seq, void *v, loff_t *ppos,
1160 static const uint8_t next_class[] = {
1161 [MTTG_TRAV_NFP_UNSPEC] = MTTG_TRAV_NFP_SPEC,
1162 [MTTG_TRAV_NFP_SPEC] = MTTG_TRAV_DONE,
1164 struct nf_mttg_trav *trav = seq->private;
1166 switch (trav->class) {
1167 case MTTG_TRAV_INIT:
1168 trav->class = MTTG_TRAV_NFP_UNSPEC;
1169 mutex_lock(&xt[NFPROTO_UNSPEC].mutex);
1170 trav->head = trav->curr = is_target ?
1171 &xt[NFPROTO_UNSPEC].target : &xt[NFPROTO_UNSPEC].match;
1173 case MTTG_TRAV_NFP_UNSPEC:
1174 trav->curr = trav->curr->next;
1175 if (trav->curr != trav->head)
1177 mutex_unlock(&xt[NFPROTO_UNSPEC].mutex);
1178 mutex_lock(&xt[trav->nfproto].mutex);
1179 trav->head = trav->curr = is_target ?
1180 &xt[trav->nfproto].target : &xt[trav->nfproto].match;
1181 trav->class = next_class[trav->class];
1183 case MTTG_TRAV_NFP_SPEC:
1184 trav->curr = trav->curr->next;
1185 if (trav->curr != trav->head)
1187 /* fallthru, _stop will unlock */
1197 static void *xt_mttg_seq_start(struct seq_file *seq, loff_t *pos,
1200 struct nf_mttg_trav *trav = seq->private;
1203 trav->class = MTTG_TRAV_INIT;
1204 for (j = 0; j < *pos; ++j)
1205 if (xt_mttg_seq_next(seq, NULL, NULL, is_target) == NULL)
1210 static void xt_mttg_seq_stop(struct seq_file *seq, void *v)
1212 struct nf_mttg_trav *trav = seq->private;
1214 switch (trav->class) {
1215 case MTTG_TRAV_NFP_UNSPEC:
1216 mutex_unlock(&xt[NFPROTO_UNSPEC].mutex);
1218 case MTTG_TRAV_NFP_SPEC:
1219 mutex_unlock(&xt[trav->nfproto].mutex);
1224 static void *xt_match_seq_start(struct seq_file *seq, loff_t *pos)
1226 return xt_mttg_seq_start(seq, pos, false);
1229 static void *xt_match_seq_next(struct seq_file *seq, void *v, loff_t *ppos)
1231 return xt_mttg_seq_next(seq, v, ppos, false);
1234 static int xt_match_seq_show(struct seq_file *seq, void *v)
1236 const struct nf_mttg_trav *trav = seq->private;
1237 const struct xt_match *match;
1239 switch (trav->class) {
1240 case MTTG_TRAV_NFP_UNSPEC:
1241 case MTTG_TRAV_NFP_SPEC:
1242 if (trav->curr == trav->head)
1244 match = list_entry(trav->curr, struct xt_match, list);
1246 seq_printf(seq, "%s\n", match->name);
1251 static const struct seq_operations xt_match_seq_ops = {
1252 .start = xt_match_seq_start,
1253 .next = xt_match_seq_next,
1254 .stop = xt_mttg_seq_stop,
1255 .show = xt_match_seq_show,
1258 static int xt_match_open(struct inode *inode, struct file *file)
1260 struct nf_mttg_trav *trav;
1261 trav = __seq_open_private(file, &xt_match_seq_ops, sizeof(*trav));
1265 trav->nfproto = (unsigned long)PDE_DATA(inode);
1269 static const struct file_operations xt_match_ops = {
1270 .owner = THIS_MODULE,
1271 .open = xt_match_open,
1273 .llseek = seq_lseek,
1274 .release = seq_release_private,
1277 static void *xt_target_seq_start(struct seq_file *seq, loff_t *pos)
1279 return xt_mttg_seq_start(seq, pos, true);
1282 static void *xt_target_seq_next(struct seq_file *seq, void *v, loff_t *ppos)
1284 return xt_mttg_seq_next(seq, v, ppos, true);
1287 static int xt_target_seq_show(struct seq_file *seq, void *v)
1289 const struct nf_mttg_trav *trav = seq->private;
1290 const struct xt_target *target;
1292 switch (trav->class) {
1293 case MTTG_TRAV_NFP_UNSPEC:
1294 case MTTG_TRAV_NFP_SPEC:
1295 if (trav->curr == trav->head)
1297 target = list_entry(trav->curr, struct xt_target, list);
1299 seq_printf(seq, "%s\n", target->name);
1304 static const struct seq_operations xt_target_seq_ops = {
1305 .start = xt_target_seq_start,
1306 .next = xt_target_seq_next,
1307 .stop = xt_mttg_seq_stop,
1308 .show = xt_target_seq_show,
1311 static int xt_target_open(struct inode *inode, struct file *file)
1313 struct nf_mttg_trav *trav;
1314 trav = __seq_open_private(file, &xt_target_seq_ops, sizeof(*trav));
1318 trav->nfproto = (unsigned long)PDE_DATA(inode);
1322 static const struct file_operations xt_target_ops = {
1323 .owner = THIS_MODULE,
1324 .open = xt_target_open,
1326 .llseek = seq_lseek,
1327 .release = seq_release_private,
1330 #define FORMAT_TABLES "_tables_names"
1331 #define FORMAT_MATCHES "_tables_matches"
1332 #define FORMAT_TARGETS "_tables_targets"
1334 #endif /* CONFIG_PROC_FS */
1337 * xt_hook_link - set up hooks for a new table
1338 * @table: table with metadata needed to set up hooks
1339 * @fn: Hook function
1341 * This function will take care of creating and registering the necessary
1342 * Netfilter hooks for XT tables.
1344 struct nf_hook_ops *xt_hook_link(const struct xt_table *table, nf_hookfn *fn)
1346 unsigned int hook_mask = table->valid_hooks;
1347 uint8_t i, num_hooks = hweight32(hook_mask);
1349 struct nf_hook_ops *ops;
1352 ops = kmalloc(sizeof(*ops) * num_hooks, GFP_KERNEL);
1354 return ERR_PTR(-ENOMEM);
1356 for (i = 0, hooknum = 0; i < num_hooks && hook_mask != 0;
1357 hook_mask >>= 1, ++hooknum) {
1358 if (!(hook_mask & 1))
1361 ops[i].pf = table->af;
1362 ops[i].hooknum = hooknum;
1363 ops[i].priority = table->priority;
1367 ret = nf_register_hooks(ops, num_hooks);
1370 return ERR_PTR(ret);
1375 EXPORT_SYMBOL_GPL(xt_hook_link);
1378 * xt_hook_unlink - remove hooks for a table
1379 * @ops: nf_hook_ops array as returned by nf_hook_link
1380 * @hook_mask: the very same mask that was passed to nf_hook_link
1382 void xt_hook_unlink(const struct xt_table *table, struct nf_hook_ops *ops)
1384 nf_unregister_hooks(ops, hweight32(table->valid_hooks));
1387 EXPORT_SYMBOL_GPL(xt_hook_unlink);
1389 int xt_proto_init(struct net *net, u_int8_t af)
1391 #ifdef CONFIG_PROC_FS
1392 char buf[XT_FUNCTION_MAXNAMELEN];
1393 struct proc_dir_entry *proc;
1396 if (af >= ARRAY_SIZE(xt_prefix))
1400 #ifdef CONFIG_PROC_FS
1401 strlcpy(buf, xt_prefix[af], sizeof(buf));
1402 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1403 proc = proc_create_data(buf, 0440, net->proc_net, &xt_table_ops,
1404 (void *)(unsigned long)af);
1408 strlcpy(buf, xt_prefix[af], sizeof(buf));
1409 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1410 proc = proc_create_data(buf, 0440, net->proc_net, &xt_match_ops,
1411 (void *)(unsigned long)af);
1413 goto out_remove_tables;
1415 strlcpy(buf, xt_prefix[af], sizeof(buf));
1416 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
1417 proc = proc_create_data(buf, 0440, net->proc_net, &xt_target_ops,
1418 (void *)(unsigned long)af);
1420 goto out_remove_matches;
1425 #ifdef CONFIG_PROC_FS
1427 strlcpy(buf, xt_prefix[af], sizeof(buf));
1428 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1429 remove_proc_entry(buf, net->proc_net);
1432 strlcpy(buf, xt_prefix[af], sizeof(buf));
1433 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1434 remove_proc_entry(buf, net->proc_net);
1439 EXPORT_SYMBOL_GPL(xt_proto_init);
1441 void xt_proto_fini(struct net *net, u_int8_t af)
1443 #ifdef CONFIG_PROC_FS
1444 char buf[XT_FUNCTION_MAXNAMELEN];
1446 strlcpy(buf, xt_prefix[af], sizeof(buf));
1447 strlcat(buf, FORMAT_TABLES, sizeof(buf));
1448 remove_proc_entry(buf, net->proc_net);
1450 strlcpy(buf, xt_prefix[af], sizeof(buf));
1451 strlcat(buf, FORMAT_TARGETS, sizeof(buf));
1452 remove_proc_entry(buf, net->proc_net);
1454 strlcpy(buf, xt_prefix[af], sizeof(buf));
1455 strlcat(buf, FORMAT_MATCHES, sizeof(buf));
1456 remove_proc_entry(buf, net->proc_net);
1457 #endif /*CONFIG_PROC_FS*/
1459 EXPORT_SYMBOL_GPL(xt_proto_fini);
1461 static int __net_init xt_net_init(struct net *net)
1465 for (i = 0; i < NFPROTO_NUMPROTO; i++)
1466 INIT_LIST_HEAD(&net->xt.tables[i]);
1470 static struct pernet_operations xt_net_ops = {
1471 .init = xt_net_init,
1474 static int __init xt_init(void)
1479 for_each_possible_cpu(i) {
1480 seqcount_init(&per_cpu(xt_recseq, i));
1483 xt = kmalloc(sizeof(struct xt_af) * NFPROTO_NUMPROTO, GFP_KERNEL);
1487 for (i = 0; i < NFPROTO_NUMPROTO; i++) {
1488 mutex_init(&xt[i].mutex);
1489 #ifdef CONFIG_COMPAT
1490 mutex_init(&xt[i].compat_mutex);
1491 xt[i].compat_tab = NULL;
1493 INIT_LIST_HEAD(&xt[i].target);
1494 INIT_LIST_HEAD(&xt[i].match);
1496 rv = register_pernet_subsys(&xt_net_ops);
1502 static void __exit xt_fini(void)
1504 unregister_pernet_subsys(&xt_net_ops);
1508 module_init(xt_init);
1509 module_exit(xt_fini);