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)
12 #include <linux/kernel.h>
13 #include <linux/skbuff.h>
14 #include <linux/netdevice.h>
15 #include <linux/capability.h>
16 #include <linux/if_arp.h>
17 #include <linux/kmod.h>
18 #include <linux/vmalloc.h>
19 #include <linux/proc_fs.h>
20 #include <linux/module.h>
21 #include <linux/init.h>
22 #include <linux/mutex.h>
23 #include <linux/err.h>
24 #include <net/compat.h>
26 #include <asm/uaccess.h>
28 #include <linux/netfilter/x_tables.h>
29 #include <linux/netfilter_arp/arp_tables.h>
31 MODULE_LICENSE("GPL");
32 MODULE_AUTHOR("David S. Miller <davem@redhat.com>");
33 MODULE_DESCRIPTION("arptables core");
35 /*#define DEBUG_ARP_TABLES*/
36 /*#define DEBUG_ARP_TABLES_USER*/
38 #ifdef DEBUG_ARP_TABLES
39 #define dprintf(format, args...) printk(format , ## args)
41 #define dprintf(format, args...)
44 #ifdef DEBUG_ARP_TABLES_USER
45 #define duprintf(format, args...) printk(format , ## args)
47 #define duprintf(format, args...)
50 #ifdef CONFIG_NETFILTER_DEBUG
51 #define ARP_NF_ASSERT(x) \
54 printk("ARP_NF_ASSERT: %s:%s:%u\n", \
55 __func__, __FILE__, __LINE__); \
58 #define ARP_NF_ASSERT(x)
61 static inline int arp_devaddr_compare(const struct arpt_devaddr_info *ap,
62 const char *hdr_addr, int len)
66 if (len > ARPT_DEV_ADDR_LEN_MAX)
67 len = ARPT_DEV_ADDR_LEN_MAX;
70 for (i = 0; i < len; i++)
71 ret |= (hdr_addr[i] ^ ap->addr[i]) & ap->mask[i];
77 * Unfortunatly, _b and _mask are not aligned to an int (or long int)
78 * Some arches dont care, unrolling the loop is a win on them.
80 static unsigned long ifname_compare(const char *_a, const char *_b, const char *_mask)
82 #ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
83 const unsigned long *a = (const unsigned long *)_a;
84 const unsigned long *b = (const unsigned long *)_b;
85 const unsigned long *mask = (const unsigned long *)_mask;
88 ret = (a[0] ^ b[0]) & mask[0];
89 if (IFNAMSIZ > sizeof(unsigned long))
90 ret |= (a[1] ^ b[1]) & mask[1];
91 if (IFNAMSIZ > 2 * sizeof(unsigned long))
92 ret |= (a[2] ^ b[2]) & mask[2];
93 if (IFNAMSIZ > 3 * sizeof(unsigned long))
94 ret |= (a[3] ^ b[3]) & mask[3];
95 BUILD_BUG_ON(IFNAMSIZ > 4 * sizeof(unsigned long));
97 unsigned long ret = 0;
100 for (i = 0; i < IFNAMSIZ; i++)
101 ret |= (_a[i] ^ _b[i]) & _mask[i];
106 /* Returns whether packet matches rule or not. */
107 static inline int arp_packet_match(const struct arphdr *arphdr,
108 struct net_device *dev,
111 const struct arpt_arp *arpinfo)
113 const char *arpptr = (char *)(arphdr + 1);
114 const char *src_devaddr, *tgt_devaddr;
115 __be32 src_ipaddr, tgt_ipaddr;
118 #define FWINV(bool, invflg) ((bool) ^ !!(arpinfo->invflags & (invflg)))
120 if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop,
122 dprintf("ARP operation field mismatch.\n");
123 dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n",
124 arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask);
128 if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd,
130 dprintf("ARP hardware address format mismatch.\n");
131 dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n",
132 arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask);
136 if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro,
138 dprintf("ARP protocol address format mismatch.\n");
139 dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n",
140 arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask);
144 if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln,
146 dprintf("ARP hardware address length mismatch.\n");
147 dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n",
148 arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask);
152 src_devaddr = arpptr;
153 arpptr += dev->addr_len;
154 memcpy(&src_ipaddr, arpptr, sizeof(u32));
155 arpptr += sizeof(u32);
156 tgt_devaddr = arpptr;
157 arpptr += dev->addr_len;
158 memcpy(&tgt_ipaddr, arpptr, sizeof(u32));
160 if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len),
161 ARPT_INV_SRCDEVADDR) ||
162 FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len),
163 ARPT_INV_TGTDEVADDR)) {
164 dprintf("Source or target device address mismatch.\n");
169 if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr,
171 FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr),
173 dprintf("Source or target IP address mismatch.\n");
175 dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
177 &arpinfo->smsk.s_addr,
178 &arpinfo->src.s_addr,
179 arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : "");
180 dprintf("TGT: %pI4 Mask: %pI4 Target: %pI4.%s\n",
182 &arpinfo->tmsk.s_addr,
183 &arpinfo->tgt.s_addr,
184 arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : "");
188 /* Look for ifname matches. */
189 ret = ifname_compare(indev, arpinfo->iniface, arpinfo->iniface_mask);
191 if (FWINV(ret != 0, ARPT_INV_VIA_IN)) {
192 dprintf("VIA in mismatch (%s vs %s).%s\n",
193 indev, arpinfo->iniface,
194 arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":"");
198 ret = ifname_compare(outdev, arpinfo->outiface, arpinfo->outiface_mask);
200 if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) {
201 dprintf("VIA out mismatch (%s vs %s).%s\n",
202 outdev, arpinfo->outiface,
203 arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":"");
211 static inline int arp_checkentry(const struct arpt_arp *arp)
213 if (arp->flags & ~ARPT_F_MASK) {
214 duprintf("Unknown flag bits set: %08X\n",
215 arp->flags & ~ARPT_F_MASK);
218 if (arp->invflags & ~ARPT_INV_MASK) {
219 duprintf("Unknown invflag bits set: %08X\n",
220 arp->invflags & ~ARPT_INV_MASK);
228 arpt_error(struct sk_buff *skb, const struct xt_target_param *par)
231 printk("arp_tables: error: '%s'\n",
232 (const char *)par->targinfo);
237 static inline struct arpt_entry *get_entry(void *base, unsigned int offset)
239 return (struct arpt_entry *)(base + offset);
242 unsigned int arpt_do_table(struct sk_buff *skb,
244 const struct net_device *in,
245 const struct net_device *out,
246 struct xt_table *table)
248 static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
249 unsigned int verdict = NF_DROP;
250 const struct arphdr *arp;
251 bool hotdrop = false;
252 struct arpt_entry *e, *back;
253 const char *indev, *outdev;
255 const struct xt_table_info *private;
256 struct xt_target_param tgpar;
258 if (!pskb_may_pull(skb, arp_hdr_len(skb->dev)))
261 indev = in ? in->name : nulldevname;
262 outdev = out ? out->name : nulldevname;
264 read_lock_bh(&table->lock);
265 private = table->private;
266 table_base = (void *)private->entries[smp_processor_id()];
267 e = get_entry(table_base, private->hook_entry[hook]);
268 back = get_entry(table_base, private->underflow[hook]);
272 tgpar.hooknum = hook;
273 tgpar.family = NFPROTO_ARP;
277 if (arp_packet_match(arp, skb->dev, indev, outdev, &e->arp)) {
278 struct arpt_entry_target *t;
281 hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) +
282 (2 * skb->dev->addr_len);
283 ADD_COUNTER(e->counters, hdr_len, 1);
285 t = arpt_get_target(e);
287 /* Standard target? */
288 if (!t->u.kernel.target->target) {
291 v = ((struct arpt_standard_target *)t)->verdict;
293 /* Pop from stack? */
294 if (v != ARPT_RETURN) {
295 verdict = (unsigned)(-v) - 1;
299 back = get_entry(table_base,
304 != (void *)e + e->next_offset) {
305 /* Save old back ptr in next entry */
306 struct arpt_entry *next
307 = (void *)e + e->next_offset;
309 (void *)back - table_base;
311 /* set back pointer to next entry */
315 e = get_entry(table_base, v);
317 /* Targets which reenter must return
320 tgpar.target = t->u.kernel.target;
321 tgpar.targinfo = t->data;
322 verdict = t->u.kernel.target->target(skb,
325 /* Target might have changed stuff. */
328 if (verdict == ARPT_CONTINUE)
329 e = (void *)e + e->next_offset;
335 e = (void *)e + e->next_offset;
338 read_unlock_bh(&table->lock);
346 /* All zeroes == unconditional rule. */
347 static inline int unconditional(const struct arpt_arp *arp)
351 for (i = 0; i < sizeof(*arp)/sizeof(__u32); i++)
352 if (((__u32 *)arp)[i])
358 /* Figures out from what hook each rule can be called: returns 0 if
359 * there are loops. Puts hook bitmask in comefrom.
361 static int mark_source_chains(struct xt_table_info *newinfo,
362 unsigned int valid_hooks, void *entry0)
366 /* No recursion; use packet counter to save back ptrs (reset
367 * to 0 as we leave), and comefrom to save source hook bitmask.
369 for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) {
370 unsigned int pos = newinfo->hook_entry[hook];
372 = (struct arpt_entry *)(entry0 + pos);
374 if (!(valid_hooks & (1 << hook)))
377 /* Set initial back pointer. */
378 e->counters.pcnt = pos;
381 const struct arpt_standard_target *t
382 = (void *)arpt_get_target(e);
383 int visited = e->comefrom & (1 << hook);
385 if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) {
386 printk("arptables: loop hook %u pos %u %08X.\n",
387 hook, pos, e->comefrom);
391 |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS));
393 /* Unconditional return/END. */
394 if ((e->target_offset == sizeof(struct arpt_entry)
395 && (strcmp(t->target.u.user.name,
396 ARPT_STANDARD_TARGET) == 0)
398 && unconditional(&e->arp)) || visited) {
399 unsigned int oldpos, size;
401 if (t->verdict < -NF_MAX_VERDICT - 1) {
402 duprintf("mark_source_chains: bad "
403 "negative verdict (%i)\n",
408 /* Return: backtrack through the last
412 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
414 pos = e->counters.pcnt;
415 e->counters.pcnt = 0;
417 /* We're at the start. */
421 e = (struct arpt_entry *)
423 } while (oldpos == pos + e->next_offset);
426 size = e->next_offset;
427 e = (struct arpt_entry *)
428 (entry0 + pos + size);
429 e->counters.pcnt = pos;
432 int newpos = t->verdict;
434 if (strcmp(t->target.u.user.name,
435 ARPT_STANDARD_TARGET) == 0
437 if (newpos > newinfo->size -
438 sizeof(struct arpt_entry)) {
439 duprintf("mark_source_chains: "
440 "bad verdict (%i)\n",
445 /* This a jump; chase it. */
446 duprintf("Jump rule %u -> %u\n",
449 /* ... this is a fallthru */
450 newpos = pos + e->next_offset;
452 e = (struct arpt_entry *)
454 e->counters.pcnt = pos;
459 duprintf("Finished chain %u\n", hook);
464 static inline int check_entry(struct arpt_entry *e, const char *name)
466 const struct arpt_entry_target *t;
468 if (!arp_checkentry(&e->arp)) {
469 duprintf("arp_tables: arp check failed %p %s.\n", e, name);
473 if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset)
476 t = arpt_get_target(e);
477 if (e->target_offset + t->u.target_size > e->next_offset)
483 static inline int check_target(struct arpt_entry *e, const char *name)
485 struct arpt_entry_target *t = arpt_get_target(e);
487 struct xt_tgchk_param par = {
490 .target = t->u.kernel.target,
492 .hook_mask = e->comefrom,
493 .family = NFPROTO_ARP,
496 ret = xt_check_target(&par, t->u.target_size - sizeof(*t), 0, false);
498 duprintf("arp_tables: check failed for `%s'.\n",
499 t->u.kernel.target->name);
506 find_check_entry(struct arpt_entry *e, const char *name, unsigned int size,
509 struct arpt_entry_target *t;
510 struct xt_target *target;
513 ret = check_entry(e, name);
517 t = arpt_get_target(e);
518 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
521 "arpt_%s", t->u.user.name);
522 if (IS_ERR(target) || !target) {
523 duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
524 ret = target ? PTR_ERR(target) : -ENOENT;
527 t->u.kernel.target = target;
529 ret = check_target(e, name);
536 module_put(t->u.kernel.target->me);
541 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
542 struct xt_table_info *newinfo,
544 unsigned char *limit,
545 const unsigned int *hook_entries,
546 const unsigned int *underflows,
551 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0
552 || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
553 duprintf("Bad offset %p\n", e);
558 < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
559 duprintf("checking: element %p size %u\n",
564 /* Check hooks & underflows */
565 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
566 if ((unsigned char *)e - base == hook_entries[h])
567 newinfo->hook_entry[h] = hook_entries[h];
568 if ((unsigned char *)e - base == underflows[h])
569 newinfo->underflow[h] = underflows[h];
572 /* FIXME: underflows must be unconditional, standard verdicts
573 < 0 (not ARPT_RETURN). --RR */
575 /* Clear counters and comefrom */
576 e->counters = ((struct xt_counters) { 0, 0 });
583 static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i)
585 struct xt_tgdtor_param par;
586 struct arpt_entry_target *t;
588 if (i && (*i)-- == 0)
591 t = arpt_get_target(e);
592 par.target = t->u.kernel.target;
593 par.targinfo = t->data;
594 par.family = NFPROTO_ARP;
595 if (par.target->destroy != NULL)
596 par.target->destroy(&par);
597 module_put(par.target->me);
601 /* Checks and translates the user-supplied table segment (held in
604 static int translate_table(const char *name,
605 unsigned int valid_hooks,
606 struct xt_table_info *newinfo,
610 const unsigned int *hook_entries,
611 const unsigned int *underflows)
616 newinfo->size = size;
617 newinfo->number = number;
619 /* Init all hooks to impossible value. */
620 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
621 newinfo->hook_entry[i] = 0xFFFFFFFF;
622 newinfo->underflow[i] = 0xFFFFFFFF;
625 duprintf("translate_table: size %u\n", newinfo->size);
628 /* Walk through entries, checking offsets. */
629 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
630 check_entry_size_and_hooks,
634 hook_entries, underflows, &i);
635 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret);
640 duprintf("translate_table: %u not %u entries\n",
645 /* Check hooks all assigned */
646 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
647 /* Only hooks which are valid */
648 if (!(valid_hooks & (1 << i)))
650 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
651 duprintf("Invalid hook entry %u %u\n",
655 if (newinfo->underflow[i] == 0xFFFFFFFF) {
656 duprintf("Invalid underflow %u %u\n",
662 if (!mark_source_chains(newinfo, valid_hooks, entry0)) {
663 duprintf("Looping hook\n");
667 /* Finally, each sanity check must pass */
669 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
670 find_check_entry, name, size, &i);
673 ARPT_ENTRY_ITERATE(entry0, newinfo->size,
678 /* And one copy for every other CPU */
679 for_each_possible_cpu(i) {
680 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
681 memcpy(newinfo->entries[i], entry0, newinfo->size);
688 static inline int add_entry_to_counter(const struct arpt_entry *e,
689 struct xt_counters total[],
692 ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
698 static inline int set_entry_to_counter(const struct arpt_entry *e,
699 struct xt_counters total[],
702 SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
708 static void get_counters(const struct xt_table_info *t,
709 struct xt_counters counters[])
715 /* Instead of clearing (by a previous call to memset())
716 * the counters and using adds, we set the counters
717 * with data used by 'current' CPU
718 * We dont care about preemption here.
720 curcpu = raw_smp_processor_id();
723 ARPT_ENTRY_ITERATE(t->entries[curcpu],
725 set_entry_to_counter,
729 for_each_possible_cpu(cpu) {
733 ARPT_ENTRY_ITERATE(t->entries[cpu],
735 add_entry_to_counter,
741 static inline struct xt_counters *alloc_counters(struct xt_table *table)
743 unsigned int countersize;
744 struct xt_counters *counters;
745 const struct xt_table_info *private = table->private;
747 /* We need atomic snapshot of counters: rest doesn't change
748 * (other than comefrom, which userspace doesn't care
751 countersize = sizeof(struct xt_counters) * private->number;
752 counters = vmalloc_node(countersize, numa_node_id());
754 if (counters == NULL)
755 return ERR_PTR(-ENOMEM);
757 /* First, sum counters... */
758 write_lock_bh(&table->lock);
759 get_counters(private, counters);
760 write_unlock_bh(&table->lock);
765 static int copy_entries_to_user(unsigned int total_size,
766 struct xt_table *table,
767 void __user *userptr)
769 unsigned int off, num;
770 struct arpt_entry *e;
771 struct xt_counters *counters;
772 struct xt_table_info *private = table->private;
776 counters = alloc_counters(table);
777 if (IS_ERR(counters))
778 return PTR_ERR(counters);
780 loc_cpu_entry = private->entries[raw_smp_processor_id()];
781 /* ... then copy entire thing ... */
782 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
787 /* FIXME: use iterator macros --RR */
788 /* ... then go back and fix counters and names */
789 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
790 struct arpt_entry_target *t;
792 e = (struct arpt_entry *)(loc_cpu_entry + off);
793 if (copy_to_user(userptr + off
794 + offsetof(struct arpt_entry, counters),
796 sizeof(counters[num])) != 0) {
801 t = arpt_get_target(e);
802 if (copy_to_user(userptr + off + e->target_offset
803 + offsetof(struct arpt_entry_target,
805 t->u.kernel.target->name,
806 strlen(t->u.kernel.target->name)+1) != 0) {
818 static void compat_standard_from_user(void *dst, void *src)
820 int v = *(compat_int_t *)src;
823 v += xt_compat_calc_jump(NFPROTO_ARP, v);
824 memcpy(dst, &v, sizeof(v));
827 static int compat_standard_to_user(void __user *dst, void *src)
829 compat_int_t cv = *(int *)src;
832 cv -= xt_compat_calc_jump(NFPROTO_ARP, cv);
833 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
836 static int compat_calc_entry(struct arpt_entry *e,
837 const struct xt_table_info *info,
838 void *base, struct xt_table_info *newinfo)
840 struct arpt_entry_target *t;
841 unsigned int entry_offset;
844 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
845 entry_offset = (void *)e - base;
847 t = arpt_get_target(e);
848 off += xt_compat_target_offset(t->u.kernel.target);
849 newinfo->size -= off;
850 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
854 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
855 if (info->hook_entry[i] &&
856 (e < (struct arpt_entry *)(base + info->hook_entry[i])))
857 newinfo->hook_entry[i] -= off;
858 if (info->underflow[i] &&
859 (e < (struct arpt_entry *)(base + info->underflow[i])))
860 newinfo->underflow[i] -= off;
865 static int compat_table_info(const struct xt_table_info *info,
866 struct xt_table_info *newinfo)
870 if (!newinfo || !info)
873 /* we dont care about newinfo->entries[] */
874 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
875 newinfo->initial_entries = 0;
876 loc_cpu_entry = info->entries[raw_smp_processor_id()];
877 return ARPT_ENTRY_ITERATE(loc_cpu_entry, info->size,
878 compat_calc_entry, info, loc_cpu_entry,
883 static int get_info(struct net *net, void __user *user, int *len, int compat)
885 char name[ARPT_TABLE_MAXNAMELEN];
889 if (*len != sizeof(struct arpt_getinfo)) {
890 duprintf("length %u != %Zu\n", *len,
891 sizeof(struct arpt_getinfo));
895 if (copy_from_user(name, user, sizeof(name)) != 0)
898 name[ARPT_TABLE_MAXNAMELEN-1] = '\0';
901 xt_compat_lock(NFPROTO_ARP);
903 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
904 "arptable_%s", name);
905 if (t && !IS_ERR(t)) {
906 struct arpt_getinfo info;
907 const struct xt_table_info *private = t->private;
911 struct xt_table_info tmp;
912 ret = compat_table_info(private, &tmp);
913 xt_compat_flush_offsets(NFPROTO_ARP);
917 info.valid_hooks = t->valid_hooks;
918 memcpy(info.hook_entry, private->hook_entry,
919 sizeof(info.hook_entry));
920 memcpy(info.underflow, private->underflow,
921 sizeof(info.underflow));
922 info.num_entries = private->number;
923 info.size = private->size;
924 strcpy(info.name, name);
926 if (copy_to_user(user, &info, *len) != 0)
933 ret = t ? PTR_ERR(t) : -ENOENT;
936 xt_compat_unlock(NFPROTO_ARP);
941 static int get_entries(struct net *net, struct arpt_get_entries __user *uptr,
945 struct arpt_get_entries get;
948 if (*len < sizeof(get)) {
949 duprintf("get_entries: %u < %Zu\n", *len, sizeof(get));
952 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
954 if (*len != sizeof(struct arpt_get_entries) + get.size) {
955 duprintf("get_entries: %u != %Zu\n", *len,
956 sizeof(struct arpt_get_entries) + get.size);
960 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
961 if (t && !IS_ERR(t)) {
962 const struct xt_table_info *private = t->private;
964 duprintf("t->private->number = %u\n",
966 if (get.size == private->size)
967 ret = copy_entries_to_user(private->size,
968 t, uptr->entrytable);
970 duprintf("get_entries: I've got %u not %u!\n",
971 private->size, get.size);
977 ret = t ? PTR_ERR(t) : -ENOENT;
982 static int __do_replace(struct net *net, const char *name,
983 unsigned int valid_hooks,
984 struct xt_table_info *newinfo,
985 unsigned int num_counters,
986 void __user *counters_ptr)
990 struct xt_table_info *oldinfo;
991 struct xt_counters *counters;
992 void *loc_cpu_old_entry;
995 counters = vmalloc_node(num_counters * sizeof(struct xt_counters),
1002 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
1003 "arptable_%s", name);
1004 if (!t || IS_ERR(t)) {
1005 ret = t ? PTR_ERR(t) : -ENOENT;
1006 goto free_newinfo_counters_untrans;
1010 if (valid_hooks != t->valid_hooks) {
1011 duprintf("Valid hook crap: %08X vs %08X\n",
1012 valid_hooks, t->valid_hooks);
1017 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
1021 /* Update module usage count based on number of rules */
1022 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1023 oldinfo->number, oldinfo->initial_entries, newinfo->number);
1024 if ((oldinfo->number > oldinfo->initial_entries) ||
1025 (newinfo->number <= oldinfo->initial_entries))
1027 if ((oldinfo->number > oldinfo->initial_entries) &&
1028 (newinfo->number <= oldinfo->initial_entries))
1031 /* Get the old counters. */
1032 get_counters(oldinfo, counters);
1033 /* Decrease module usage counts and free resource */
1034 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1035 ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,
1038 xt_free_table_info(oldinfo);
1039 if (copy_to_user(counters_ptr, counters,
1040 sizeof(struct xt_counters) * num_counters) != 0)
1049 free_newinfo_counters_untrans:
1055 static int do_replace(struct net *net, void __user *user, unsigned int len)
1058 struct arpt_replace tmp;
1059 struct xt_table_info *newinfo;
1060 void *loc_cpu_entry;
1062 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1065 /* overflow check */
1066 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1069 newinfo = xt_alloc_table_info(tmp.size);
1073 /* choose the copy that is on our node/cpu */
1074 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1075 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1081 ret = translate_table(tmp.name, tmp.valid_hooks,
1082 newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
1083 tmp.hook_entry, tmp.underflow);
1087 duprintf("arp_tables: Translated table\n");
1089 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1090 tmp.num_counters, tmp.counters);
1092 goto free_newinfo_untrans;
1095 free_newinfo_untrans:
1096 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1098 xt_free_table_info(newinfo);
1102 /* We're lazy, and add to the first CPU; overflow works its fey magic
1103 * and everything is OK.
1105 static inline int add_counter_to_entry(struct arpt_entry *e,
1106 const struct xt_counters addme[],
1110 ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);
1116 static int do_add_counters(struct net *net, void __user *user, unsigned int len,
1120 struct xt_counters_info tmp;
1121 struct xt_counters *paddc;
1122 unsigned int num_counters;
1127 const struct xt_table_info *private;
1129 void *loc_cpu_entry;
1130 #ifdef CONFIG_COMPAT
1131 struct compat_xt_counters_info compat_tmp;
1135 size = sizeof(struct compat_xt_counters_info);
1140 size = sizeof(struct xt_counters_info);
1143 if (copy_from_user(ptmp, user, size) != 0)
1146 #ifdef CONFIG_COMPAT
1148 num_counters = compat_tmp.num_counters;
1149 name = compat_tmp.name;
1153 num_counters = tmp.num_counters;
1157 if (len != size + num_counters * sizeof(struct xt_counters))
1160 paddc = vmalloc_node(len - size, numa_node_id());
1164 if (copy_from_user(paddc, user + size, len - size) != 0) {
1169 t = xt_find_table_lock(net, NFPROTO_ARP, name);
1170 if (!t || IS_ERR(t)) {
1171 ret = t ? PTR_ERR(t) : -ENOENT;
1175 write_lock_bh(&t->lock);
1176 private = t->private;
1177 if (private->number != num_counters) {
1179 goto unlock_up_free;
1183 /* Choose the copy that is on our node */
1184 loc_cpu_entry = private->entries[smp_processor_id()];
1185 ARPT_ENTRY_ITERATE(loc_cpu_entry,
1187 add_counter_to_entry,
1191 write_unlock_bh(&t->lock);
1200 #ifdef CONFIG_COMPAT
1202 compat_release_entry(struct compat_arpt_entry *e, unsigned int *i)
1204 struct arpt_entry_target *t;
1206 if (i && (*i)-- == 0)
1209 t = compat_arpt_get_target(e);
1210 module_put(t->u.kernel.target->me);
1215 check_compat_entry_size_and_hooks(struct compat_arpt_entry *e,
1216 struct xt_table_info *newinfo,
1218 unsigned char *base,
1219 unsigned char *limit,
1220 unsigned int *hook_entries,
1221 unsigned int *underflows,
1225 struct arpt_entry_target *t;
1226 struct xt_target *target;
1227 unsigned int entry_offset;
1230 duprintf("check_compat_entry_size_and_hooks %p\n", e);
1231 if ((unsigned long)e % __alignof__(struct compat_arpt_entry) != 0
1232 || (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit) {
1233 duprintf("Bad offset %p, limit = %p\n", e, limit);
1237 if (e->next_offset < sizeof(struct compat_arpt_entry) +
1238 sizeof(struct compat_xt_entry_target)) {
1239 duprintf("checking: element %p size %u\n",
1244 /* For purposes of check_entry casting the compat entry is fine */
1245 ret = check_entry((struct arpt_entry *)e, name);
1249 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1250 entry_offset = (void *)e - (void *)base;
1252 t = compat_arpt_get_target(e);
1253 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
1255 t->u.user.revision),
1256 "arpt_%s", t->u.user.name);
1257 if (IS_ERR(target) || !target) {
1258 duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1260 ret = target ? PTR_ERR(target) : -ENOENT;
1263 t->u.kernel.target = target;
1265 off += xt_compat_target_offset(target);
1267 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
1269 goto release_target;
1271 /* Check hooks & underflows */
1272 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1273 if ((unsigned char *)e - base == hook_entries[h])
1274 newinfo->hook_entry[h] = hook_entries[h];
1275 if ((unsigned char *)e - base == underflows[h])
1276 newinfo->underflow[h] = underflows[h];
1279 /* Clear counters and comefrom */
1280 memset(&e->counters, 0, sizeof(e->counters));
1287 module_put(t->u.kernel.target->me);
1293 compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr,
1294 unsigned int *size, const char *name,
1295 struct xt_table_info *newinfo, unsigned char *base)
1297 struct arpt_entry_target *t;
1298 struct xt_target *target;
1299 struct arpt_entry *de;
1300 unsigned int origsize;
1305 de = (struct arpt_entry *)*dstptr;
1306 memcpy(de, e, sizeof(struct arpt_entry));
1307 memcpy(&de->counters, &e->counters, sizeof(e->counters));
1309 *dstptr += sizeof(struct arpt_entry);
1310 *size += sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1312 de->target_offset = e->target_offset - (origsize - *size);
1313 t = compat_arpt_get_target(e);
1314 target = t->u.kernel.target;
1315 xt_compat_target_from_user(t, dstptr, size);
1317 de->next_offset = e->next_offset - (origsize - *size);
1318 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1319 if ((unsigned char *)de - base < newinfo->hook_entry[h])
1320 newinfo->hook_entry[h] -= origsize - *size;
1321 if ((unsigned char *)de - base < newinfo->underflow[h])
1322 newinfo->underflow[h] -= origsize - *size;
1327 static inline int compat_check_entry(struct arpt_entry *e, const char *name,
1332 ret = check_target(e, name);
1340 static int translate_compat_table(const char *name,
1341 unsigned int valid_hooks,
1342 struct xt_table_info **pinfo,
1344 unsigned int total_size,
1345 unsigned int number,
1346 unsigned int *hook_entries,
1347 unsigned int *underflows)
1350 struct xt_table_info *newinfo, *info;
1351 void *pos, *entry0, *entry1;
1358 info->number = number;
1360 /* Init all hooks to impossible value. */
1361 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1362 info->hook_entry[i] = 0xFFFFFFFF;
1363 info->underflow[i] = 0xFFFFFFFF;
1366 duprintf("translate_compat_table: size %u\n", info->size);
1368 xt_compat_lock(NFPROTO_ARP);
1369 /* Walk through entries, checking offsets. */
1370 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1371 check_compat_entry_size_and_hooks,
1372 info, &size, entry0,
1373 entry0 + total_size,
1374 hook_entries, underflows, &j, name);
1380 duprintf("translate_compat_table: %u not %u entries\n",
1385 /* Check hooks all assigned */
1386 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1387 /* Only hooks which are valid */
1388 if (!(valid_hooks & (1 << i)))
1390 if (info->hook_entry[i] == 0xFFFFFFFF) {
1391 duprintf("Invalid hook entry %u %u\n",
1392 i, hook_entries[i]);
1395 if (info->underflow[i] == 0xFFFFFFFF) {
1396 duprintf("Invalid underflow %u %u\n",
1403 newinfo = xt_alloc_table_info(size);
1407 newinfo->number = number;
1408 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1409 newinfo->hook_entry[i] = info->hook_entry[i];
1410 newinfo->underflow[i] = info->underflow[i];
1412 entry1 = newinfo->entries[raw_smp_processor_id()];
1415 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1416 compat_copy_entry_from_user,
1417 &pos, &size, name, newinfo, entry1);
1418 xt_compat_flush_offsets(NFPROTO_ARP);
1419 xt_compat_unlock(NFPROTO_ARP);
1424 if (!mark_source_chains(newinfo, valid_hooks, entry1))
1428 ret = ARPT_ENTRY_ITERATE(entry1, newinfo->size, compat_check_entry,
1432 COMPAT_ARPT_ENTRY_ITERATE_CONTINUE(entry0, newinfo->size, i,
1433 compat_release_entry, &j);
1434 ARPT_ENTRY_ITERATE(entry1, newinfo->size, cleanup_entry, &i);
1435 xt_free_table_info(newinfo);
1439 /* And one copy for every other CPU */
1440 for_each_possible_cpu(i)
1441 if (newinfo->entries[i] && newinfo->entries[i] != entry1)
1442 memcpy(newinfo->entries[i], entry1, newinfo->size);
1446 xt_free_table_info(info);
1450 xt_free_table_info(newinfo);
1452 COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size, compat_release_entry, &j);
1455 xt_compat_flush_offsets(NFPROTO_ARP);
1456 xt_compat_unlock(NFPROTO_ARP);
1460 struct compat_arpt_replace {
1461 char name[ARPT_TABLE_MAXNAMELEN];
1465 u32 hook_entry[NF_ARP_NUMHOOKS];
1466 u32 underflow[NF_ARP_NUMHOOKS];
1468 compat_uptr_t counters;
1469 struct compat_arpt_entry entries[0];
1472 static int compat_do_replace(struct net *net, void __user *user,
1476 struct compat_arpt_replace tmp;
1477 struct xt_table_info *newinfo;
1478 void *loc_cpu_entry;
1480 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1483 /* overflow check */
1484 if (tmp.size >= INT_MAX / num_possible_cpus())
1486 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1489 newinfo = xt_alloc_table_info(tmp.size);
1493 /* choose the copy that is on our node/cpu */
1494 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1495 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), tmp.size) != 0) {
1500 ret = translate_compat_table(tmp.name, tmp.valid_hooks,
1501 &newinfo, &loc_cpu_entry, tmp.size,
1502 tmp.num_entries, tmp.hook_entry,
1507 duprintf("compat_do_replace: Translated table\n");
1509 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1510 tmp.num_counters, compat_ptr(tmp.counters));
1512 goto free_newinfo_untrans;
1515 free_newinfo_untrans:
1516 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1518 xt_free_table_info(newinfo);
1522 static int compat_do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user,
1527 if (!capable(CAP_NET_ADMIN))
1531 case ARPT_SO_SET_REPLACE:
1532 ret = compat_do_replace(sock_net(sk), user, len);
1535 case ARPT_SO_SET_ADD_COUNTERS:
1536 ret = do_add_counters(sock_net(sk), user, len, 1);
1540 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1547 static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr,
1548 compat_uint_t *size,
1549 struct xt_counters *counters,
1552 struct arpt_entry_target *t;
1553 struct compat_arpt_entry __user *ce;
1554 u_int16_t target_offset, next_offset;
1555 compat_uint_t origsize;
1560 ce = (struct compat_arpt_entry __user *)*dstptr;
1561 if (copy_to_user(ce, e, sizeof(struct arpt_entry)))
1564 if (copy_to_user(&ce->counters, &counters[*i], sizeof(counters[*i])))
1567 *dstptr += sizeof(struct compat_arpt_entry);
1568 *size -= sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1570 target_offset = e->target_offset - (origsize - *size);
1572 t = arpt_get_target(e);
1573 ret = xt_compat_target_to_user(t, dstptr, size);
1577 next_offset = e->next_offset - (origsize - *size);
1578 if (put_user(target_offset, &ce->target_offset))
1580 if (put_user(next_offset, &ce->next_offset))
1589 static int compat_copy_entries_to_user(unsigned int total_size,
1590 struct xt_table *table,
1591 void __user *userptr)
1593 struct xt_counters *counters;
1594 const struct xt_table_info *private = table->private;
1598 void *loc_cpu_entry;
1601 counters = alloc_counters(table);
1602 if (IS_ERR(counters))
1603 return PTR_ERR(counters);
1605 /* choose the copy on our node/cpu */
1606 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1609 ret = ARPT_ENTRY_ITERATE(loc_cpu_entry, total_size,
1610 compat_copy_entry_to_user,
1611 &pos, &size, counters, &i);
1616 struct compat_arpt_get_entries {
1617 char name[ARPT_TABLE_MAXNAMELEN];
1619 struct compat_arpt_entry entrytable[0];
1622 static int compat_get_entries(struct net *net,
1623 struct compat_arpt_get_entries __user *uptr,
1627 struct compat_arpt_get_entries get;
1630 if (*len < sizeof(get)) {
1631 duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
1634 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1636 if (*len != sizeof(struct compat_arpt_get_entries) + get.size) {
1637 duprintf("compat_get_entries: %u != %zu\n",
1638 *len, sizeof(get) + get.size);
1642 xt_compat_lock(NFPROTO_ARP);
1643 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1644 if (t && !IS_ERR(t)) {
1645 const struct xt_table_info *private = t->private;
1646 struct xt_table_info info;
1648 duprintf("t->private->number = %u\n", private->number);
1649 ret = compat_table_info(private, &info);
1650 if (!ret && get.size == info.size) {
1651 ret = compat_copy_entries_to_user(private->size,
1652 t, uptr->entrytable);
1654 duprintf("compat_get_entries: I've got %u not %u!\n",
1655 private->size, get.size);
1658 xt_compat_flush_offsets(NFPROTO_ARP);
1662 ret = t ? PTR_ERR(t) : -ENOENT;
1664 xt_compat_unlock(NFPROTO_ARP);
1668 static int do_arpt_get_ctl(struct sock *, int, void __user *, int *);
1670 static int compat_do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user,
1675 if (!capable(CAP_NET_ADMIN))
1679 case ARPT_SO_GET_INFO:
1680 ret = get_info(sock_net(sk), user, len, 1);
1682 case ARPT_SO_GET_ENTRIES:
1683 ret = compat_get_entries(sock_net(sk), user, len);
1686 ret = do_arpt_get_ctl(sk, cmd, user, len);
1692 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
1696 if (!capable(CAP_NET_ADMIN))
1700 case ARPT_SO_SET_REPLACE:
1701 ret = do_replace(sock_net(sk), user, len);
1704 case ARPT_SO_SET_ADD_COUNTERS:
1705 ret = do_add_counters(sock_net(sk), user, len, 0);
1709 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1716 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1720 if (!capable(CAP_NET_ADMIN))
1724 case ARPT_SO_GET_INFO:
1725 ret = get_info(sock_net(sk), user, len, 0);
1728 case ARPT_SO_GET_ENTRIES:
1729 ret = get_entries(sock_net(sk), user, len);
1732 case ARPT_SO_GET_REVISION_TARGET: {
1733 struct xt_get_revision rev;
1735 if (*len != sizeof(rev)) {
1739 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1744 try_then_request_module(xt_find_revision(NFPROTO_ARP, rev.name,
1745 rev.revision, 1, &ret),
1746 "arpt_%s", rev.name);
1751 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd);
1758 struct xt_table *arpt_register_table(struct net *net, struct xt_table *table,
1759 const struct arpt_replace *repl)
1762 struct xt_table_info *newinfo;
1763 struct xt_table_info bootstrap
1764 = { 0, 0, 0, { 0 }, { 0 }, { } };
1765 void *loc_cpu_entry;
1766 struct xt_table *new_table;
1768 newinfo = xt_alloc_table_info(repl->size);
1774 /* choose the copy on our node/cpu */
1775 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1776 memcpy(loc_cpu_entry, repl->entries, repl->size);
1778 ret = translate_table(table->name, table->valid_hooks,
1779 newinfo, loc_cpu_entry, repl->size,
1784 duprintf("arpt_register_table: translate table gives %d\n", ret);
1788 new_table = xt_register_table(net, table, &bootstrap, newinfo);
1789 if (IS_ERR(new_table)) {
1790 ret = PTR_ERR(new_table);
1796 xt_free_table_info(newinfo);
1798 return ERR_PTR(ret);
1801 void arpt_unregister_table(struct xt_table *table)
1803 struct xt_table_info *private;
1804 void *loc_cpu_entry;
1805 struct module *table_owner = table->me;
1807 private = xt_unregister_table(table);
1809 /* Decrease module usage counts and free resources */
1810 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1811 ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size,
1812 cleanup_entry, NULL);
1813 if (private->number > private->initial_entries)
1814 module_put(table_owner);
1815 xt_free_table_info(private);
1818 /* The built-in targets: standard (NULL) and error. */
1819 static struct xt_target arpt_standard_target __read_mostly = {
1820 .name = ARPT_STANDARD_TARGET,
1821 .targetsize = sizeof(int),
1822 .family = NFPROTO_ARP,
1823 #ifdef CONFIG_COMPAT
1824 .compatsize = sizeof(compat_int_t),
1825 .compat_from_user = compat_standard_from_user,
1826 .compat_to_user = compat_standard_to_user,
1830 static struct xt_target arpt_error_target __read_mostly = {
1831 .name = ARPT_ERROR_TARGET,
1832 .target = arpt_error,
1833 .targetsize = ARPT_FUNCTION_MAXNAMELEN,
1834 .family = NFPROTO_ARP,
1837 static struct nf_sockopt_ops arpt_sockopts = {
1839 .set_optmin = ARPT_BASE_CTL,
1840 .set_optmax = ARPT_SO_SET_MAX+1,
1841 .set = do_arpt_set_ctl,
1842 #ifdef CONFIG_COMPAT
1843 .compat_set = compat_do_arpt_set_ctl,
1845 .get_optmin = ARPT_BASE_CTL,
1846 .get_optmax = ARPT_SO_GET_MAX+1,
1847 .get = do_arpt_get_ctl,
1848 #ifdef CONFIG_COMPAT
1849 .compat_get = compat_do_arpt_get_ctl,
1851 .owner = THIS_MODULE,
1854 static int __net_init arp_tables_net_init(struct net *net)
1856 return xt_proto_init(net, NFPROTO_ARP);
1859 static void __net_exit arp_tables_net_exit(struct net *net)
1861 xt_proto_fini(net, NFPROTO_ARP);
1864 static struct pernet_operations arp_tables_net_ops = {
1865 .init = arp_tables_net_init,
1866 .exit = arp_tables_net_exit,
1869 static int __init arp_tables_init(void)
1873 ret = register_pernet_subsys(&arp_tables_net_ops);
1877 /* Noone else will be downing sem now, so we won't sleep */
1878 ret = xt_register_target(&arpt_standard_target);
1881 ret = xt_register_target(&arpt_error_target);
1885 /* Register setsockopt */
1886 ret = nf_register_sockopt(&arpt_sockopts);
1890 printk(KERN_INFO "arp_tables: (C) 2002 David S. Miller\n");
1894 xt_unregister_target(&arpt_error_target);
1896 xt_unregister_target(&arpt_standard_target);
1898 unregister_pernet_subsys(&arp_tables_net_ops);
1903 static void __exit arp_tables_fini(void)
1905 nf_unregister_sockopt(&arpt_sockopts);
1906 xt_unregister_target(&arpt_error_target);
1907 xt_unregister_target(&arpt_standard_target);
1908 unregister_pernet_subsys(&arp_tables_net_ops);
1911 EXPORT_SYMBOL(arpt_register_table);
1912 EXPORT_SYMBOL(arpt_unregister_table);
1913 EXPORT_SYMBOL(arpt_do_table);
1915 module_init(arp_tables_init);
1916 module_exit(arp_tables_fini);