2 * Packet matching code for ARP packets.
4 * Based heavily, if not almost entirely, upon ip_tables.c framework.
6 * Some ARP specific bits are:
8 * Copyright (C) 2002 David S. Miller (davem@redhat.com)
9 * Copyright (C) 2006-2009 Patrick McHardy <kaber@trash.net>
12 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
13 #include <linux/kernel.h>
14 #include <linux/skbuff.h>
15 #include <linux/netdevice.h>
16 #include <linux/capability.h>
17 #include <linux/if_arp.h>
18 #include <linux/kmod.h>
19 #include <linux/vmalloc.h>
20 #include <linux/proc_fs.h>
21 #include <linux/module.h>
22 #include <linux/init.h>
23 #include <linux/mutex.h>
24 #include <linux/err.h>
25 #include <net/compat.h>
27 #include <linux/uaccess.h>
29 #include <linux/netfilter/x_tables.h>
30 #include <linux/netfilter_arp/arp_tables.h>
31 #include "../../netfilter/xt_repldata.h"
33 MODULE_LICENSE("GPL");
34 MODULE_AUTHOR("David S. Miller <davem@redhat.com>");
35 MODULE_DESCRIPTION("arptables core");
37 void *arpt_alloc_initial_table(const struct xt_table *info)
39 return xt_alloc_initial_table(arpt, ARPT);
41 EXPORT_SYMBOL_GPL(arpt_alloc_initial_table);
43 static inline int arp_devaddr_compare(const struct arpt_devaddr_info *ap,
44 const char *hdr_addr, int len)
48 if (len > ARPT_DEV_ADDR_LEN_MAX)
49 len = ARPT_DEV_ADDR_LEN_MAX;
52 for (i = 0; i < len; i++)
53 ret |= (hdr_addr[i] ^ ap->addr[i]) & ap->mask[i];
59 * Unfortunately, _b and _mask are not aligned to an int (or long int)
60 * Some arches dont care, unrolling the loop is a win on them.
61 * For other arches, we only have a 16bit alignement.
63 static unsigned long ifname_compare(const char *_a, const char *_b, const char *_mask)
65 #ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
66 unsigned long ret = ifname_compare_aligned(_a, _b, _mask);
68 unsigned long ret = 0;
69 const u16 *a = (const u16 *)_a;
70 const u16 *b = (const u16 *)_b;
71 const u16 *mask = (const u16 *)_mask;
74 for (i = 0; i < IFNAMSIZ/sizeof(u16); i++)
75 ret |= (a[i] ^ b[i]) & mask[i];
80 /* Returns whether packet matches rule or not. */
81 static inline int arp_packet_match(const struct arphdr *arphdr,
82 struct net_device *dev,
85 const struct arpt_arp *arpinfo)
87 const char *arpptr = (char *)(arphdr + 1);
88 const char *src_devaddr, *tgt_devaddr;
89 __be32 src_ipaddr, tgt_ipaddr;
92 if (NF_INVF(arpinfo, ARPT_INV_ARPOP,
93 (arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop))
96 if (NF_INVF(arpinfo, ARPT_INV_ARPHRD,
97 (arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd))
100 if (NF_INVF(arpinfo, ARPT_INV_ARPPRO,
101 (arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro))
104 if (NF_INVF(arpinfo, ARPT_INV_ARPHLN,
105 (arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln))
108 src_devaddr = arpptr;
109 arpptr += dev->addr_len;
110 memcpy(&src_ipaddr, arpptr, sizeof(u32));
111 arpptr += sizeof(u32);
112 tgt_devaddr = arpptr;
113 arpptr += dev->addr_len;
114 memcpy(&tgt_ipaddr, arpptr, sizeof(u32));
116 if (NF_INVF(arpinfo, ARPT_INV_SRCDEVADDR,
117 arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr,
119 NF_INVF(arpinfo, ARPT_INV_TGTDEVADDR,
120 arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr,
124 if (NF_INVF(arpinfo, ARPT_INV_SRCIP,
125 (src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr) ||
126 NF_INVF(arpinfo, ARPT_INV_TGTIP,
127 (tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr))
130 /* Look for ifname matches. */
131 ret = ifname_compare(indev, arpinfo->iniface, arpinfo->iniface_mask);
133 if (NF_INVF(arpinfo, ARPT_INV_VIA_IN, ret != 0))
136 ret = ifname_compare(outdev, arpinfo->outiface, arpinfo->outiface_mask);
138 if (NF_INVF(arpinfo, ARPT_INV_VIA_OUT, ret != 0))
144 static inline int arp_checkentry(const struct arpt_arp *arp)
146 if (arp->flags & ~ARPT_F_MASK)
148 if (arp->invflags & ~ARPT_INV_MASK)
155 arpt_error(struct sk_buff *skb, const struct xt_action_param *par)
157 net_err_ratelimited("arp_tables: error: '%s'\n",
158 (const char *)par->targinfo);
163 static inline const struct xt_entry_target *
164 arpt_get_target_c(const struct arpt_entry *e)
166 return arpt_get_target((struct arpt_entry *)e);
169 static inline struct arpt_entry *
170 get_entry(const void *base, unsigned int offset)
172 return (struct arpt_entry *)(base + offset);
176 struct arpt_entry *arpt_next_entry(const struct arpt_entry *entry)
178 return (void *)entry + entry->next_offset;
181 unsigned int arpt_do_table(struct sk_buff *skb,
182 const struct nf_hook_state *state,
183 struct xt_table *table)
185 unsigned int hook = state->hook;
186 static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
187 unsigned int verdict = NF_DROP;
188 const struct arphdr *arp;
189 struct arpt_entry *e, **jumpstack;
190 const char *indev, *outdev;
191 const void *table_base;
192 unsigned int cpu, stackidx = 0;
193 const struct xt_table_info *private;
194 struct xt_action_param acpar;
197 if (!pskb_may_pull(skb, arp_hdr_len(skb->dev)))
200 indev = state->in ? state->in->name : nulldevname;
201 outdev = state->out ? state->out->name : nulldevname;
204 addend = xt_write_recseq_begin();
205 private = READ_ONCE(table->private); /* Address dependency. */
206 cpu = smp_processor_id();
207 table_base = private->entries;
208 jumpstack = (struct arpt_entry **)private->jumpstack[cpu];
210 /* No TEE support for arptables, so no need to switch to alternate
211 * stack. All targets that reenter must return absolute verdicts.
213 e = get_entry(table_base, private->hook_entry[hook]);
216 acpar.hotdrop = false;
220 const struct xt_entry_target *t;
221 struct xt_counters *counter;
223 if (!arp_packet_match(arp, skb->dev, indev, outdev, &e->arp)) {
224 e = arpt_next_entry(e);
228 counter = xt_get_this_cpu_counter(&e->counters);
229 ADD_COUNTER(*counter, arp_hdr_len(skb->dev), 1);
231 t = arpt_get_target_c(e);
233 /* Standard target? */
234 if (!t->u.kernel.target->target) {
237 v = ((struct xt_standard_target *)t)->verdict;
239 /* Pop from stack? */
240 if (v != XT_RETURN) {
241 verdict = (unsigned int)(-v) - 1;
245 e = get_entry(table_base,
246 private->underflow[hook]);
248 e = jumpstack[--stackidx];
249 e = arpt_next_entry(e);
254 != arpt_next_entry(e)) {
255 if (unlikely(stackidx >= private->stacksize)) {
259 jumpstack[stackidx++] = e;
262 e = get_entry(table_base, v);
266 acpar.target = t->u.kernel.target;
267 acpar.targinfo = t->data;
268 verdict = t->u.kernel.target->target(skb, &acpar);
270 if (verdict == XT_CONTINUE) {
271 /* Target might have changed stuff. */
273 e = arpt_next_entry(e);
278 } while (!acpar.hotdrop);
279 xt_write_recseq_end(addend);
288 /* All zeroes == unconditional rule. */
289 static inline bool unconditional(const struct arpt_entry *e)
291 static const struct arpt_arp uncond;
293 return e->target_offset == sizeof(struct arpt_entry) &&
294 memcmp(&e->arp, &uncond, sizeof(uncond)) == 0;
297 /* Figures out from what hook each rule can be called: returns 0 if
298 * there are loops. Puts hook bitmask in comefrom.
300 static int mark_source_chains(const struct xt_table_info *newinfo,
301 unsigned int valid_hooks, void *entry0,
302 unsigned int *offsets)
306 /* No recursion; use packet counter to save back ptrs (reset
307 * to 0 as we leave), and comefrom to save source hook bitmask.
309 for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) {
310 unsigned int pos = newinfo->hook_entry[hook];
311 struct arpt_entry *e = entry0 + pos;
313 if (!(valid_hooks & (1 << hook)))
316 /* Set initial back pointer. */
317 e->counters.pcnt = pos;
320 const struct xt_standard_target *t
321 = (void *)arpt_get_target_c(e);
322 int visited = e->comefrom & (1 << hook);
324 if (e->comefrom & (1 << NF_ARP_NUMHOOKS))
328 |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS));
330 /* Unconditional return/END. */
331 if ((unconditional(e) &&
332 (strcmp(t->target.u.user.name,
333 XT_STANDARD_TARGET) == 0) &&
334 t->verdict < 0) || visited) {
335 unsigned int oldpos, size;
337 if ((strcmp(t->target.u.user.name,
338 XT_STANDARD_TARGET) == 0) &&
339 t->verdict < -NF_MAX_VERDICT - 1)
342 /* Return: backtrack through the last
346 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
348 pos = e->counters.pcnt;
349 e->counters.pcnt = 0;
351 /* We're at the start. */
356 } while (oldpos == pos + e->next_offset);
359 size = e->next_offset;
360 e = entry0 + pos + size;
361 if (pos + size >= newinfo->size)
363 e->counters.pcnt = pos;
366 int newpos = t->verdict;
368 if (strcmp(t->target.u.user.name,
369 XT_STANDARD_TARGET) == 0 &&
371 /* This a jump; chase it. */
372 if (!xt_find_jump_offset(offsets, newpos,
376 /* ... this is a fallthru */
377 newpos = pos + e->next_offset;
378 if (newpos >= newinfo->size)
382 e->counters.pcnt = pos;
391 static inline int check_target(struct arpt_entry *e, const char *name)
393 struct xt_entry_target *t = arpt_get_target(e);
394 struct xt_tgchk_param par = {
397 .target = t->u.kernel.target,
399 .hook_mask = e->comefrom,
400 .family = NFPROTO_ARP,
403 return xt_check_target(&par, t->u.target_size - sizeof(*t), 0, false);
407 find_check_entry(struct arpt_entry *e, const char *name, unsigned int size,
408 struct xt_percpu_counter_alloc_state *alloc_state)
410 struct xt_entry_target *t;
411 struct xt_target *target;
414 if (!xt_percpu_counter_alloc(alloc_state, &e->counters))
417 t = arpt_get_target(e);
418 target = xt_request_find_target(NFPROTO_ARP, t->u.user.name,
420 if (IS_ERR(target)) {
421 ret = PTR_ERR(target);
424 t->u.kernel.target = target;
426 ret = check_target(e, name);
431 module_put(t->u.kernel.target->me);
433 xt_percpu_counter_free(&e->counters);
438 static bool check_underflow(const struct arpt_entry *e)
440 const struct xt_entry_target *t;
441 unsigned int verdict;
443 if (!unconditional(e))
445 t = arpt_get_target_c(e);
446 if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
448 verdict = ((struct xt_standard_target *)t)->verdict;
449 verdict = -verdict - 1;
450 return verdict == NF_DROP || verdict == NF_ACCEPT;
453 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
454 struct xt_table_info *newinfo,
455 const unsigned char *base,
456 const unsigned char *limit,
457 const unsigned int *hook_entries,
458 const unsigned int *underflows,
459 unsigned int valid_hooks)
464 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0 ||
465 (unsigned char *)e + sizeof(struct arpt_entry) >= limit ||
466 (unsigned char *)e + e->next_offset > limit)
470 < sizeof(struct arpt_entry) + sizeof(struct xt_entry_target))
473 if (!arp_checkentry(&e->arp))
476 err = xt_check_entry_offsets(e, e->elems, e->target_offset,
481 /* Check hooks & underflows */
482 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
483 if (!(valid_hooks & (1 << h)))
485 if ((unsigned char *)e - base == hook_entries[h])
486 newinfo->hook_entry[h] = hook_entries[h];
487 if ((unsigned char *)e - base == underflows[h]) {
488 if (!check_underflow(e))
491 newinfo->underflow[h] = underflows[h];
495 /* Clear counters and comefrom */
496 e->counters = ((struct xt_counters) { 0, 0 });
501 static inline void cleanup_entry(struct arpt_entry *e)
503 struct xt_tgdtor_param par;
504 struct xt_entry_target *t;
506 t = arpt_get_target(e);
507 par.target = t->u.kernel.target;
508 par.targinfo = t->data;
509 par.family = NFPROTO_ARP;
510 if (par.target->destroy != NULL)
511 par.target->destroy(&par);
512 module_put(par.target->me);
513 xt_percpu_counter_free(&e->counters);
516 /* Checks and translates the user-supplied table segment (held in
519 static int translate_table(struct xt_table_info *newinfo, void *entry0,
520 const struct arpt_replace *repl)
522 struct xt_percpu_counter_alloc_state alloc_state = { 0 };
523 struct arpt_entry *iter;
524 unsigned int *offsets;
528 newinfo->size = repl->size;
529 newinfo->number = repl->num_entries;
531 /* Init all hooks to impossible value. */
532 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
533 newinfo->hook_entry[i] = 0xFFFFFFFF;
534 newinfo->underflow[i] = 0xFFFFFFFF;
537 offsets = xt_alloc_entry_offsets(newinfo->number);
542 /* Walk through entries, checking offsets. */
543 xt_entry_foreach(iter, entry0, newinfo->size) {
544 ret = check_entry_size_and_hooks(iter, newinfo, entry0,
551 if (i < repl->num_entries)
552 offsets[i] = (void *)iter - entry0;
554 if (strcmp(arpt_get_target(iter)->u.user.name,
555 XT_ERROR_TARGET) == 0)
556 ++newinfo->stacksize;
560 if (i != repl->num_entries)
563 /* Check hooks all assigned */
564 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
565 /* Only hooks which are valid */
566 if (!(repl->valid_hooks & (1 << i)))
568 if (newinfo->hook_entry[i] == 0xFFFFFFFF)
570 if (newinfo->underflow[i] == 0xFFFFFFFF)
574 if (!mark_source_chains(newinfo, repl->valid_hooks, entry0, offsets)) {
580 /* Finally, each sanity check must pass */
582 xt_entry_foreach(iter, entry0, newinfo->size) {
583 ret = find_check_entry(iter, repl->name, repl->size,
591 xt_entry_foreach(iter, entry0, newinfo->size) {
605 static void get_counters(const struct xt_table_info *t,
606 struct xt_counters counters[])
608 struct arpt_entry *iter;
612 for_each_possible_cpu(cpu) {
613 seqcount_t *s = &per_cpu(xt_recseq, cpu);
616 xt_entry_foreach(iter, t->entries, t->size) {
617 struct xt_counters *tmp;
621 tmp = xt_get_per_cpu_counter(&iter->counters, cpu);
623 start = read_seqcount_begin(s);
626 } while (read_seqcount_retry(s, start));
628 ADD_COUNTER(counters[i], bcnt, pcnt);
635 static void get_old_counters(const struct xt_table_info *t,
636 struct xt_counters counters[])
638 struct arpt_entry *iter;
641 for_each_possible_cpu(cpu) {
643 xt_entry_foreach(iter, t->entries, t->size) {
644 struct xt_counters *tmp;
646 tmp = xt_get_per_cpu_counter(&iter->counters, cpu);
647 ADD_COUNTER(counters[i], tmp->bcnt, tmp->pcnt);
654 static struct xt_counters *alloc_counters(const struct xt_table *table)
656 unsigned int countersize;
657 struct xt_counters *counters;
658 const struct xt_table_info *private = table->private;
660 /* We need atomic snapshot of counters: rest doesn't change
661 * (other than comefrom, which userspace doesn't care
664 countersize = sizeof(struct xt_counters) * private->number;
665 counters = vzalloc(countersize);
667 if (counters == NULL)
668 return ERR_PTR(-ENOMEM);
670 get_counters(private, counters);
675 static int copy_entries_to_user(unsigned int total_size,
676 const struct xt_table *table,
677 void __user *userptr)
679 unsigned int off, num;
680 const struct arpt_entry *e;
681 struct xt_counters *counters;
682 struct xt_table_info *private = table->private;
686 counters = alloc_counters(table);
687 if (IS_ERR(counters))
688 return PTR_ERR(counters);
690 loc_cpu_entry = private->entries;
692 /* FIXME: use iterator macros --RR */
693 /* ... then go back and fix counters and names */
694 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
695 const struct xt_entry_target *t;
697 e = loc_cpu_entry + off;
698 if (copy_to_user(userptr + off, e, sizeof(*e))) {
702 if (copy_to_user(userptr + off
703 + offsetof(struct arpt_entry, counters),
705 sizeof(counters[num])) != 0) {
710 t = arpt_get_target_c(e);
711 if (xt_target_to_user(t, userptr + off + e->target_offset)) {
723 static void compat_standard_from_user(void *dst, const void *src)
725 int v = *(compat_int_t *)src;
728 v += xt_compat_calc_jump(NFPROTO_ARP, v);
729 memcpy(dst, &v, sizeof(v));
732 static int compat_standard_to_user(void __user *dst, const void *src)
734 compat_int_t cv = *(int *)src;
737 cv -= xt_compat_calc_jump(NFPROTO_ARP, cv);
738 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
741 static int compat_calc_entry(const struct arpt_entry *e,
742 const struct xt_table_info *info,
743 const void *base, struct xt_table_info *newinfo)
745 const struct xt_entry_target *t;
746 unsigned int entry_offset;
749 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
750 entry_offset = (void *)e - base;
752 t = arpt_get_target_c(e);
753 off += xt_compat_target_offset(t->u.kernel.target);
754 newinfo->size -= off;
755 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
759 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
760 if (info->hook_entry[i] &&
761 (e < (struct arpt_entry *)(base + info->hook_entry[i])))
762 newinfo->hook_entry[i] -= off;
763 if (info->underflow[i] &&
764 (e < (struct arpt_entry *)(base + info->underflow[i])))
765 newinfo->underflow[i] -= off;
770 static int compat_table_info(const struct xt_table_info *info,
771 struct xt_table_info *newinfo)
773 struct arpt_entry *iter;
774 const void *loc_cpu_entry;
777 if (!newinfo || !info)
780 /* we dont care about newinfo->entries */
781 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
782 newinfo->initial_entries = 0;
783 loc_cpu_entry = info->entries;
784 xt_compat_init_offsets(NFPROTO_ARP, info->number);
785 xt_entry_foreach(iter, loc_cpu_entry, info->size) {
786 ret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo);
794 static int get_info(struct net *net, void __user *user,
795 const int *len, int compat)
797 char name[XT_TABLE_MAXNAMELEN];
801 if (*len != sizeof(struct arpt_getinfo))
804 if (copy_from_user(name, user, sizeof(name)) != 0)
807 name[XT_TABLE_MAXNAMELEN-1] = '\0';
810 xt_compat_lock(NFPROTO_ARP);
812 t = xt_request_find_table_lock(net, NFPROTO_ARP, name);
814 struct arpt_getinfo info;
815 const struct xt_table_info *private = t->private;
817 struct xt_table_info tmp;
820 ret = compat_table_info(private, &tmp);
821 xt_compat_flush_offsets(NFPROTO_ARP);
825 memset(&info, 0, sizeof(info));
826 info.valid_hooks = t->valid_hooks;
827 memcpy(info.hook_entry, private->hook_entry,
828 sizeof(info.hook_entry));
829 memcpy(info.underflow, private->underflow,
830 sizeof(info.underflow));
831 info.num_entries = private->number;
832 info.size = private->size;
833 strcpy(info.name, name);
835 if (copy_to_user(user, &info, *len) != 0)
845 xt_compat_unlock(NFPROTO_ARP);
850 static int get_entries(struct net *net, struct arpt_get_entries __user *uptr,
854 struct arpt_get_entries get;
857 if (*len < sizeof(get))
859 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
861 if (*len != sizeof(struct arpt_get_entries) + get.size)
864 get.name[sizeof(get.name) - 1] = '\0';
866 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
868 const struct xt_table_info *private = t->private;
870 if (get.size == private->size)
871 ret = copy_entries_to_user(private->size,
872 t, uptr->entrytable);
884 static int __do_replace(struct net *net, const char *name,
885 unsigned int valid_hooks,
886 struct xt_table_info *newinfo,
887 unsigned int num_counters,
888 void __user *counters_ptr)
892 struct xt_table_info *oldinfo;
893 struct xt_counters *counters;
894 void *loc_cpu_old_entry;
895 struct arpt_entry *iter;
898 counters = vzalloc(num_counters * sizeof(struct xt_counters));
904 t = xt_request_find_table_lock(net, NFPROTO_ARP, name);
907 goto free_newinfo_counters_untrans;
911 if (valid_hooks != t->valid_hooks) {
916 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
920 /* Update module usage count based on number of rules */
921 if ((oldinfo->number > oldinfo->initial_entries) ||
922 (newinfo->number <= oldinfo->initial_entries))
924 if ((oldinfo->number > oldinfo->initial_entries) &&
925 (newinfo->number <= oldinfo->initial_entries))
928 get_old_counters(oldinfo, counters);
930 /* Decrease module usage counts and free resource */
931 loc_cpu_old_entry = oldinfo->entries;
932 xt_entry_foreach(iter, loc_cpu_old_entry, oldinfo->size)
935 xt_free_table_info(oldinfo);
936 if (copy_to_user(counters_ptr, counters,
937 sizeof(struct xt_counters) * num_counters) != 0) {
938 /* Silent error, can't fail, new table is already in place */
939 net_warn_ratelimited("arptables: counters copy to user failed while replacing table\n");
948 free_newinfo_counters_untrans:
954 static int do_replace(struct net *net, const void __user *user,
958 struct arpt_replace tmp;
959 struct xt_table_info *newinfo;
961 struct arpt_entry *iter;
963 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
967 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
969 if (tmp.num_counters == 0)
972 tmp.name[sizeof(tmp.name)-1] = 0;
974 newinfo = xt_alloc_table_info(tmp.size);
978 loc_cpu_entry = newinfo->entries;
979 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
985 ret = translate_table(newinfo, loc_cpu_entry, &tmp);
989 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
990 tmp.num_counters, tmp.counters);
992 goto free_newinfo_untrans;
995 free_newinfo_untrans:
996 xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
999 xt_free_table_info(newinfo);
1003 static int do_add_counters(struct net *net, const void __user *user,
1004 unsigned int len, int compat)
1007 struct xt_counters_info tmp;
1008 struct xt_counters *paddc;
1010 const struct xt_table_info *private;
1012 struct arpt_entry *iter;
1013 unsigned int addend;
1015 paddc = xt_copy_counters_from_user(user, len, &tmp, compat);
1017 return PTR_ERR(paddc);
1019 t = xt_find_table_lock(net, NFPROTO_ARP, tmp.name);
1026 private = t->private;
1027 if (private->number != tmp.num_counters) {
1029 goto unlock_up_free;
1034 addend = xt_write_recseq_begin();
1035 xt_entry_foreach(iter, private->entries, private->size) {
1036 struct xt_counters *tmp;
1038 tmp = xt_get_this_cpu_counter(&iter->counters);
1039 ADD_COUNTER(*tmp, paddc[i].bcnt, paddc[i].pcnt);
1042 xt_write_recseq_end(addend);
1053 #ifdef CONFIG_COMPAT
1054 struct compat_arpt_replace {
1055 char name[XT_TABLE_MAXNAMELEN];
1059 u32 hook_entry[NF_ARP_NUMHOOKS];
1060 u32 underflow[NF_ARP_NUMHOOKS];
1062 compat_uptr_t counters;
1063 struct compat_arpt_entry entries[0];
1066 static inline void compat_release_entry(struct compat_arpt_entry *e)
1068 struct xt_entry_target *t;
1070 t = compat_arpt_get_target(e);
1071 module_put(t->u.kernel.target->me);
1075 check_compat_entry_size_and_hooks(struct compat_arpt_entry *e,
1076 struct xt_table_info *newinfo,
1078 const unsigned char *base,
1079 const unsigned char *limit)
1081 struct xt_entry_target *t;
1082 struct xt_target *target;
1083 unsigned int entry_offset;
1086 if ((unsigned long)e % __alignof__(struct compat_arpt_entry) != 0 ||
1087 (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit ||
1088 (unsigned char *)e + e->next_offset > limit)
1091 if (e->next_offset < sizeof(struct compat_arpt_entry) +
1092 sizeof(struct compat_xt_entry_target))
1095 if (!arp_checkentry(&e->arp))
1098 ret = xt_compat_check_entry_offsets(e, e->elems, e->target_offset,
1103 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1104 entry_offset = (void *)e - (void *)base;
1106 t = compat_arpt_get_target(e);
1107 target = xt_request_find_target(NFPROTO_ARP, t->u.user.name,
1108 t->u.user.revision);
1109 if (IS_ERR(target)) {
1110 ret = PTR_ERR(target);
1113 t->u.kernel.target = target;
1115 off += xt_compat_target_offset(target);
1117 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
1119 goto release_target;
1124 module_put(t->u.kernel.target->me);
1130 compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr,
1132 struct xt_table_info *newinfo, unsigned char *base)
1134 struct xt_entry_target *t;
1135 struct arpt_entry *de;
1136 unsigned int origsize;
1141 memcpy(de, e, sizeof(struct arpt_entry));
1142 memcpy(&de->counters, &e->counters, sizeof(e->counters));
1144 *dstptr += sizeof(struct arpt_entry);
1145 *size += sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1147 de->target_offset = e->target_offset - (origsize - *size);
1148 t = compat_arpt_get_target(e);
1149 xt_compat_target_from_user(t, dstptr, size);
1151 de->next_offset = e->next_offset - (origsize - *size);
1152 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1153 if ((unsigned char *)de - base < newinfo->hook_entry[h])
1154 newinfo->hook_entry[h] -= origsize - *size;
1155 if ((unsigned char *)de - base < newinfo->underflow[h])
1156 newinfo->underflow[h] -= origsize - *size;
1160 static int translate_compat_table(struct xt_table_info **pinfo,
1162 const struct compat_arpt_replace *compatr)
1165 struct xt_table_info *newinfo, *info;
1166 void *pos, *entry0, *entry1;
1167 struct compat_arpt_entry *iter0;
1168 struct arpt_replace repl;
1174 size = compatr->size;
1175 info->number = compatr->num_entries;
1178 xt_compat_lock(NFPROTO_ARP);
1179 xt_compat_init_offsets(NFPROTO_ARP, compatr->num_entries);
1180 /* Walk through entries, checking offsets. */
1181 xt_entry_foreach(iter0, entry0, compatr->size) {
1182 ret = check_compat_entry_size_and_hooks(iter0, info, &size,
1184 entry0 + compatr->size);
1191 if (j != compatr->num_entries)
1195 newinfo = xt_alloc_table_info(size);
1199 newinfo->number = compatr->num_entries;
1200 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1201 newinfo->hook_entry[i] = compatr->hook_entry[i];
1202 newinfo->underflow[i] = compatr->underflow[i];
1204 entry1 = newinfo->entries;
1206 size = compatr->size;
1207 xt_entry_foreach(iter0, entry0, compatr->size)
1208 compat_copy_entry_from_user(iter0, &pos, &size,
1211 /* all module references in entry0 are now gone */
1213 xt_compat_flush_offsets(NFPROTO_ARP);
1214 xt_compat_unlock(NFPROTO_ARP);
1216 memcpy(&repl, compatr, sizeof(*compatr));
1218 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1219 repl.hook_entry[i] = newinfo->hook_entry[i];
1220 repl.underflow[i] = newinfo->underflow[i];
1223 repl.num_counters = 0;
1224 repl.counters = NULL;
1225 repl.size = newinfo->size;
1226 ret = translate_table(newinfo, entry1, &repl);
1232 xt_free_table_info(info);
1236 xt_free_table_info(newinfo);
1239 xt_compat_flush_offsets(NFPROTO_ARP);
1240 xt_compat_unlock(NFPROTO_ARP);
1241 xt_entry_foreach(iter0, entry0, compatr->size) {
1244 compat_release_entry(iter0);
1249 static int compat_do_replace(struct net *net, void __user *user,
1253 struct compat_arpt_replace tmp;
1254 struct xt_table_info *newinfo;
1255 void *loc_cpu_entry;
1256 struct arpt_entry *iter;
1258 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1261 /* overflow check */
1262 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1264 if (tmp.num_counters == 0)
1267 tmp.name[sizeof(tmp.name)-1] = 0;
1269 newinfo = xt_alloc_table_info(tmp.size);
1273 loc_cpu_entry = newinfo->entries;
1274 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), tmp.size) != 0) {
1279 ret = translate_compat_table(&newinfo, &loc_cpu_entry, &tmp);
1283 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1284 tmp.num_counters, compat_ptr(tmp.counters));
1286 goto free_newinfo_untrans;
1289 free_newinfo_untrans:
1290 xt_entry_foreach(iter, loc_cpu_entry, newinfo->size)
1291 cleanup_entry(iter);
1293 xt_free_table_info(newinfo);
1297 static int compat_do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user,
1302 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1306 case ARPT_SO_SET_REPLACE:
1307 ret = compat_do_replace(sock_net(sk), user, len);
1310 case ARPT_SO_SET_ADD_COUNTERS:
1311 ret = do_add_counters(sock_net(sk), user, len, 1);
1321 static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr,
1322 compat_uint_t *size,
1323 struct xt_counters *counters,
1326 struct xt_entry_target *t;
1327 struct compat_arpt_entry __user *ce;
1328 u_int16_t target_offset, next_offset;
1329 compat_uint_t origsize;
1334 if (copy_to_user(ce, e, sizeof(struct arpt_entry)) != 0 ||
1335 copy_to_user(&ce->counters, &counters[i],
1336 sizeof(counters[i])) != 0)
1339 *dstptr += sizeof(struct compat_arpt_entry);
1340 *size -= sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1342 target_offset = e->target_offset - (origsize - *size);
1344 t = arpt_get_target(e);
1345 ret = xt_compat_target_to_user(t, dstptr, size);
1348 next_offset = e->next_offset - (origsize - *size);
1349 if (put_user(target_offset, &ce->target_offset) != 0 ||
1350 put_user(next_offset, &ce->next_offset) != 0)
1355 static int compat_copy_entries_to_user(unsigned int total_size,
1356 struct xt_table *table,
1357 void __user *userptr)
1359 struct xt_counters *counters;
1360 const struct xt_table_info *private = table->private;
1365 struct arpt_entry *iter;
1367 counters = alloc_counters(table);
1368 if (IS_ERR(counters))
1369 return PTR_ERR(counters);
1373 xt_entry_foreach(iter, private->entries, total_size) {
1374 ret = compat_copy_entry_to_user(iter, &pos,
1375 &size, counters, i++);
1383 struct compat_arpt_get_entries {
1384 char name[XT_TABLE_MAXNAMELEN];
1386 struct compat_arpt_entry entrytable[0];
1389 static int compat_get_entries(struct net *net,
1390 struct compat_arpt_get_entries __user *uptr,
1394 struct compat_arpt_get_entries get;
1397 if (*len < sizeof(get))
1399 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1401 if (*len != sizeof(struct compat_arpt_get_entries) + get.size)
1404 get.name[sizeof(get.name) - 1] = '\0';
1406 xt_compat_lock(NFPROTO_ARP);
1407 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1409 const struct xt_table_info *private = t->private;
1410 struct xt_table_info info;
1412 ret = compat_table_info(private, &info);
1413 if (!ret && get.size == info.size) {
1414 ret = compat_copy_entries_to_user(private->size,
1415 t, uptr->entrytable);
1419 xt_compat_flush_offsets(NFPROTO_ARP);
1425 xt_compat_unlock(NFPROTO_ARP);
1429 static int do_arpt_get_ctl(struct sock *, int, void __user *, int *);
1431 static int compat_do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user,
1436 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1440 case ARPT_SO_GET_INFO:
1441 ret = get_info(sock_net(sk), user, len, 1);
1443 case ARPT_SO_GET_ENTRIES:
1444 ret = compat_get_entries(sock_net(sk), user, len);
1447 ret = do_arpt_get_ctl(sk, cmd, user, len);
1453 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
1457 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1461 case ARPT_SO_SET_REPLACE:
1462 ret = do_replace(sock_net(sk), user, len);
1465 case ARPT_SO_SET_ADD_COUNTERS:
1466 ret = do_add_counters(sock_net(sk), user, len, 0);
1476 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1480 if (!ns_capable(sock_net(sk)->user_ns, CAP_NET_ADMIN))
1484 case ARPT_SO_GET_INFO:
1485 ret = get_info(sock_net(sk), user, len, 0);
1488 case ARPT_SO_GET_ENTRIES:
1489 ret = get_entries(sock_net(sk), user, len);
1492 case ARPT_SO_GET_REVISION_TARGET: {
1493 struct xt_get_revision rev;
1495 if (*len != sizeof(rev)) {
1499 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1503 rev.name[sizeof(rev.name)-1] = 0;
1505 try_then_request_module(xt_find_revision(NFPROTO_ARP, rev.name,
1506 rev.revision, 1, &ret),
1507 "arpt_%s", rev.name);
1518 static void __arpt_unregister_table(struct xt_table *table)
1520 struct xt_table_info *private;
1521 void *loc_cpu_entry;
1522 struct module *table_owner = table->me;
1523 struct arpt_entry *iter;
1525 private = xt_unregister_table(table);
1527 /* Decrease module usage counts and free resources */
1528 loc_cpu_entry = private->entries;
1529 xt_entry_foreach(iter, loc_cpu_entry, private->size)
1530 cleanup_entry(iter);
1531 if (private->number > private->initial_entries)
1532 module_put(table_owner);
1533 xt_free_table_info(private);
1536 int arpt_register_table(struct net *net,
1537 const struct xt_table *table,
1538 const struct arpt_replace *repl,
1539 const struct nf_hook_ops *ops,
1540 struct xt_table **res)
1543 struct xt_table_info *newinfo;
1544 struct xt_table_info bootstrap = {0};
1545 void *loc_cpu_entry;
1546 struct xt_table *new_table;
1548 newinfo = xt_alloc_table_info(repl->size);
1552 loc_cpu_entry = newinfo->entries;
1553 memcpy(loc_cpu_entry, repl->entries, repl->size);
1555 ret = translate_table(newinfo, loc_cpu_entry, repl);
1559 new_table = xt_register_table(net, table, &bootstrap, newinfo);
1560 if (IS_ERR(new_table)) {
1561 ret = PTR_ERR(new_table);
1565 /* set res now, will see skbs right after nf_register_net_hooks */
1566 WRITE_ONCE(*res, new_table);
1568 ret = nf_register_net_hooks(net, ops, hweight32(table->valid_hooks));
1570 __arpt_unregister_table(new_table);
1577 xt_free_table_info(newinfo);
1581 void arpt_unregister_table(struct net *net, struct xt_table *table,
1582 const struct nf_hook_ops *ops)
1584 nf_unregister_net_hooks(net, ops, hweight32(table->valid_hooks));
1585 __arpt_unregister_table(table);
1588 /* The built-in targets: standard (NULL) and error. */
1589 static struct xt_target arpt_builtin_tg[] __read_mostly = {
1591 .name = XT_STANDARD_TARGET,
1592 .targetsize = sizeof(int),
1593 .family = NFPROTO_ARP,
1594 #ifdef CONFIG_COMPAT
1595 .compatsize = sizeof(compat_int_t),
1596 .compat_from_user = compat_standard_from_user,
1597 .compat_to_user = compat_standard_to_user,
1601 .name = XT_ERROR_TARGET,
1602 .target = arpt_error,
1603 .targetsize = XT_FUNCTION_MAXNAMELEN,
1604 .family = NFPROTO_ARP,
1608 static struct nf_sockopt_ops arpt_sockopts = {
1610 .set_optmin = ARPT_BASE_CTL,
1611 .set_optmax = ARPT_SO_SET_MAX+1,
1612 .set = do_arpt_set_ctl,
1613 #ifdef CONFIG_COMPAT
1614 .compat_set = compat_do_arpt_set_ctl,
1616 .get_optmin = ARPT_BASE_CTL,
1617 .get_optmax = ARPT_SO_GET_MAX+1,
1618 .get = do_arpt_get_ctl,
1619 #ifdef CONFIG_COMPAT
1620 .compat_get = compat_do_arpt_get_ctl,
1622 .owner = THIS_MODULE,
1625 static int __net_init arp_tables_net_init(struct net *net)
1627 return xt_proto_init(net, NFPROTO_ARP);
1630 static void __net_exit arp_tables_net_exit(struct net *net)
1632 xt_proto_fini(net, NFPROTO_ARP);
1635 static struct pernet_operations arp_tables_net_ops = {
1636 .init = arp_tables_net_init,
1637 .exit = arp_tables_net_exit,
1640 static int __init arp_tables_init(void)
1644 ret = register_pernet_subsys(&arp_tables_net_ops);
1648 /* No one else will be downing sem now, so we won't sleep */
1649 ret = xt_register_targets(arpt_builtin_tg, ARRAY_SIZE(arpt_builtin_tg));
1653 /* Register setsockopt */
1654 ret = nf_register_sockopt(&arpt_sockopts);
1661 xt_unregister_targets(arpt_builtin_tg, ARRAY_SIZE(arpt_builtin_tg));
1663 unregister_pernet_subsys(&arp_tables_net_ops);
1668 static void __exit arp_tables_fini(void)
1670 nf_unregister_sockopt(&arpt_sockopts);
1671 xt_unregister_targets(arpt_builtin_tg, ARRAY_SIZE(arpt_builtin_tg));
1672 unregister_pernet_subsys(&arp_tables_net_ops);
1675 EXPORT_SYMBOL(arpt_register_table);
1676 EXPORT_SYMBOL(arpt_unregister_table);
1677 EXPORT_SYMBOL(arpt_do_table);
1679 module_init(arp_tables_init);
1680 module_exit(arp_tables_fini);