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.
79 * For other arches, we only have a 16bit alignement.
81 static unsigned long ifname_compare(const char *_a, const char *_b, const char *_mask)
83 #ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
84 unsigned long ret = ifname_compare_aligned(_a, _b, _mask);
86 unsigned long ret = 0;
87 const u16 *a = (const u16 *)_a;
88 const u16 *b = (const u16 *)_b;
89 const u16 *mask = (const u16 *)_mask;
92 for (i = 0; i < IFNAMSIZ/sizeof(u16); i++)
93 ret |= (a[i] ^ b[i]) & mask[i];
98 /* Returns whether packet matches rule or not. */
99 static inline int arp_packet_match(const struct arphdr *arphdr,
100 struct net_device *dev,
103 const struct arpt_arp *arpinfo)
105 const char *arpptr = (char *)(arphdr + 1);
106 const char *src_devaddr, *tgt_devaddr;
107 __be32 src_ipaddr, tgt_ipaddr;
110 #define FWINV(bool, invflg) ((bool) ^ !!(arpinfo->invflags & (invflg)))
112 if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop,
114 dprintf("ARP operation field mismatch.\n");
115 dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n",
116 arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask);
120 if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd,
122 dprintf("ARP hardware address format mismatch.\n");
123 dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n",
124 arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask);
128 if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro,
130 dprintf("ARP protocol address format mismatch.\n");
131 dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n",
132 arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask);
136 if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln,
138 dprintf("ARP hardware address length mismatch.\n");
139 dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n",
140 arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask);
144 src_devaddr = arpptr;
145 arpptr += dev->addr_len;
146 memcpy(&src_ipaddr, arpptr, sizeof(u32));
147 arpptr += sizeof(u32);
148 tgt_devaddr = arpptr;
149 arpptr += dev->addr_len;
150 memcpy(&tgt_ipaddr, arpptr, sizeof(u32));
152 if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len),
153 ARPT_INV_SRCDEVADDR) ||
154 FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len),
155 ARPT_INV_TGTDEVADDR)) {
156 dprintf("Source or target device address mismatch.\n");
161 if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr,
163 FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr),
165 dprintf("Source or target IP address mismatch.\n");
167 dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
169 &arpinfo->smsk.s_addr,
170 &arpinfo->src.s_addr,
171 arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : "");
172 dprintf("TGT: %pI4 Mask: %pI4 Target: %pI4.%s\n",
174 &arpinfo->tmsk.s_addr,
175 &arpinfo->tgt.s_addr,
176 arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : "");
180 /* Look for ifname matches. */
181 ret = ifname_compare(indev, arpinfo->iniface, arpinfo->iniface_mask);
183 if (FWINV(ret != 0, ARPT_INV_VIA_IN)) {
184 dprintf("VIA in mismatch (%s vs %s).%s\n",
185 indev, arpinfo->iniface,
186 arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":"");
190 ret = ifname_compare(outdev, arpinfo->outiface, arpinfo->outiface_mask);
192 if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) {
193 dprintf("VIA out mismatch (%s vs %s).%s\n",
194 outdev, arpinfo->outiface,
195 arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":"");
203 static inline int arp_checkentry(const struct arpt_arp *arp)
205 if (arp->flags & ~ARPT_F_MASK) {
206 duprintf("Unknown flag bits set: %08X\n",
207 arp->flags & ~ARPT_F_MASK);
210 if (arp->invflags & ~ARPT_INV_MASK) {
211 duprintf("Unknown invflag bits set: %08X\n",
212 arp->invflags & ~ARPT_INV_MASK);
220 arpt_error(struct sk_buff *skb, const struct xt_target_param *par)
223 printk("arp_tables: error: '%s'\n",
224 (const char *)par->targinfo);
229 static inline struct arpt_entry *get_entry(void *base, unsigned int offset)
231 return (struct arpt_entry *)(base + offset);
235 struct arpt_entry *arpt_next_entry(const struct arpt_entry *entry)
237 return (void *)entry + entry->next_offset;
240 unsigned int arpt_do_table(struct sk_buff *skb,
242 const struct net_device *in,
243 const struct net_device *out,
244 struct xt_table *table)
246 static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
247 unsigned int verdict = NF_DROP;
248 const struct arphdr *arp;
249 bool hotdrop = false;
250 struct arpt_entry *e, *back;
251 const char *indev, *outdev;
253 const struct xt_table_info *private;
254 struct xt_target_param tgpar;
256 if (!pskb_may_pull(skb, arp_hdr_len(skb->dev)))
259 indev = in ? in->name : nulldevname;
260 outdev = out ? out->name : nulldevname;
263 private = table->private;
264 table_base = private->entries[smp_processor_id()];
266 e = get_entry(table_base, private->hook_entry[hook]);
267 back = get_entry(table_base, private->underflow[hook]);
271 tgpar.hooknum = hook;
272 tgpar.family = NFPROTO_ARP;
276 struct arpt_entry_target *t;
279 if (!arp_packet_match(arp, skb->dev, indev, outdev, &e->arp)) {
280 e = arpt_next_entry(e);
284 hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) +
285 (2 * skb->dev->addr_len);
286 ADD_COUNTER(e->counters, hdr_len, 1);
288 t = arpt_get_target(e);
290 /* Standard target? */
291 if (!t->u.kernel.target->target) {
294 v = ((struct arpt_standard_target *)t)->verdict;
296 /* Pop from stack? */
297 if (v != ARPT_RETURN) {
298 verdict = (unsigned)(-v) - 1;
302 back = get_entry(table_base, back->comefrom);
306 != arpt_next_entry(e)) {
307 /* Save old back ptr in next entry */
308 struct arpt_entry *next = arpt_next_entry(e);
309 next->comefrom = (void *)back - table_base;
311 /* set back pointer to next entry */
315 e = get_entry(table_base, v);
319 /* Targets which reenter must return
322 tgpar.target = t->u.kernel.target;
323 tgpar.targinfo = t->data;
324 verdict = t->u.kernel.target->target(skb, &tgpar);
326 /* Target might have changed stuff. */
329 if (verdict == ARPT_CONTINUE)
330 e = arpt_next_entry(e);
335 xt_info_rdunlock_bh();
343 /* All zeroes == unconditional rule. */
344 static inline int unconditional(const struct arpt_arp *arp)
348 for (i = 0; i < sizeof(*arp)/sizeof(__u32); i++)
349 if (((__u32 *)arp)[i])
355 /* Figures out from what hook each rule can be called: returns 0 if
356 * there are loops. Puts hook bitmask in comefrom.
358 static int mark_source_chains(struct xt_table_info *newinfo,
359 unsigned int valid_hooks, void *entry0)
363 /* No recursion; use packet counter to save back ptrs (reset
364 * to 0 as we leave), and comefrom to save source hook bitmask.
366 for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) {
367 unsigned int pos = newinfo->hook_entry[hook];
369 = (struct arpt_entry *)(entry0 + pos);
371 if (!(valid_hooks & (1 << hook)))
374 /* Set initial back pointer. */
375 e->counters.pcnt = pos;
378 const struct arpt_standard_target *t
379 = (void *)arpt_get_target(e);
380 int visited = e->comefrom & (1 << hook);
382 if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) {
383 printk("arptables: loop hook %u pos %u %08X.\n",
384 hook, pos, e->comefrom);
388 |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS));
390 /* Unconditional return/END. */
391 if ((e->target_offset == sizeof(struct arpt_entry)
392 && (strcmp(t->target.u.user.name,
393 ARPT_STANDARD_TARGET) == 0)
395 && unconditional(&e->arp)) || visited) {
396 unsigned int oldpos, size;
398 if ((strcmp(t->target.u.user.name,
399 ARPT_STANDARD_TARGET) == 0) &&
400 t->verdict < -NF_MAX_VERDICT - 1) {
401 duprintf("mark_source_chains: bad "
402 "negative verdict (%i)\n",
407 /* Return: backtrack through the last
411 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
413 pos = e->counters.pcnt;
414 e->counters.pcnt = 0;
416 /* We're at the start. */
420 e = (struct arpt_entry *)
422 } while (oldpos == pos + e->next_offset);
425 size = e->next_offset;
426 e = (struct arpt_entry *)
427 (entry0 + pos + size);
428 e->counters.pcnt = pos;
431 int newpos = t->verdict;
433 if (strcmp(t->target.u.user.name,
434 ARPT_STANDARD_TARGET) == 0
436 if (newpos > newinfo->size -
437 sizeof(struct arpt_entry)) {
438 duprintf("mark_source_chains: "
439 "bad verdict (%i)\n",
444 /* This a jump; chase it. */
445 duprintf("Jump rule %u -> %u\n",
448 /* ... this is a fallthru */
449 newpos = pos + e->next_offset;
451 e = (struct arpt_entry *)
453 e->counters.pcnt = pos;
458 duprintf("Finished chain %u\n", hook);
463 static inline int check_entry(struct arpt_entry *e, const char *name)
465 const struct arpt_entry_target *t;
467 if (!arp_checkentry(&e->arp)) {
468 duprintf("arp_tables: arp check failed %p %s.\n", e, name);
472 if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset)
475 t = arpt_get_target(e);
476 if (e->target_offset + t->u.target_size > e->next_offset)
482 static inline int check_target(struct arpt_entry *e, const char *name)
484 struct arpt_entry_target *t = arpt_get_target(e);
486 struct xt_tgchk_param par = {
489 .target = t->u.kernel.target,
491 .hook_mask = e->comefrom,
492 .family = NFPROTO_ARP,
495 ret = xt_check_target(&par, t->u.target_size - sizeof(*t), 0, false);
497 duprintf("arp_tables: check failed for `%s'.\n",
498 t->u.kernel.target->name);
505 find_check_entry(struct arpt_entry *e, const char *name, unsigned int size,
508 struct arpt_entry_target *t;
509 struct xt_target *target;
512 ret = check_entry(e, name);
516 t = arpt_get_target(e);
517 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
520 "arpt_%s", t->u.user.name);
521 if (IS_ERR(target) || !target) {
522 duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
523 ret = target ? PTR_ERR(target) : -ENOENT;
526 t->u.kernel.target = target;
528 ret = check_target(e, name);
535 module_put(t->u.kernel.target->me);
540 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
541 struct xt_table_info *newinfo,
543 unsigned char *limit,
544 const unsigned int *hook_entries,
545 const unsigned int *underflows,
550 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0
551 || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
552 duprintf("Bad offset %p\n", e);
557 < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
558 duprintf("checking: element %p size %u\n",
563 /* Check hooks & underflows */
564 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
565 if ((unsigned char *)e - base == hook_entries[h])
566 newinfo->hook_entry[h] = hook_entries[h];
567 if ((unsigned char *)e - base == underflows[h])
568 newinfo->underflow[h] = underflows[h];
571 /* FIXME: underflows must be unconditional, standard verdicts
572 < 0 (not ARPT_RETURN). --RR */
574 /* Clear counters and comefrom */
575 e->counters = ((struct xt_counters) { 0, 0 });
582 static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i)
584 struct xt_tgdtor_param par;
585 struct arpt_entry_target *t;
587 if (i && (*i)-- == 0)
590 t = arpt_get_target(e);
591 par.target = t->u.kernel.target;
592 par.targinfo = t->data;
593 par.family = NFPROTO_ARP;
594 if (par.target->destroy != NULL)
595 par.target->destroy(&par);
596 module_put(par.target->me);
600 /* Checks and translates the user-supplied table segment (held in
603 static int translate_table(const char *name,
604 unsigned int valid_hooks,
605 struct xt_table_info *newinfo,
609 const unsigned int *hook_entries,
610 const unsigned int *underflows)
615 newinfo->size = size;
616 newinfo->number = number;
618 /* Init all hooks to impossible value. */
619 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
620 newinfo->hook_entry[i] = 0xFFFFFFFF;
621 newinfo->underflow[i] = 0xFFFFFFFF;
624 duprintf("translate_table: size %u\n", newinfo->size);
627 /* Walk through entries, checking offsets. */
628 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
629 check_entry_size_and_hooks,
633 hook_entries, underflows, &i);
634 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret);
639 duprintf("translate_table: %u not %u entries\n",
644 /* Check hooks all assigned */
645 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
646 /* Only hooks which are valid */
647 if (!(valid_hooks & (1 << i)))
649 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
650 duprintf("Invalid hook entry %u %u\n",
654 if (newinfo->underflow[i] == 0xFFFFFFFF) {
655 duprintf("Invalid underflow %u %u\n",
661 if (!mark_source_chains(newinfo, valid_hooks, entry0)) {
662 duprintf("Looping hook\n");
666 /* Finally, each sanity check must pass */
668 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
669 find_check_entry, name, size, &i);
672 ARPT_ENTRY_ITERATE(entry0, newinfo->size,
677 /* And one copy for every other CPU */
678 for_each_possible_cpu(i) {
679 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
680 memcpy(newinfo->entries[i], entry0, newinfo->size);
687 static inline int add_entry_to_counter(const struct arpt_entry *e,
688 struct xt_counters total[],
691 ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
697 static inline int set_entry_to_counter(const struct arpt_entry *e,
698 struct xt_counters total[],
701 SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
707 static void get_counters(const struct xt_table_info *t,
708 struct xt_counters counters[])
714 /* Instead of clearing (by a previous call to memset())
715 * the counters and using adds, we set the counters
716 * with data used by 'current' CPU
718 * Bottom half has to be disabled to prevent deadlock
719 * if new softirq were to run and call ipt_do_table
722 curcpu = smp_processor_id();
725 ARPT_ENTRY_ITERATE(t->entries[curcpu],
727 set_entry_to_counter,
731 for_each_possible_cpu(cpu) {
736 ARPT_ENTRY_ITERATE(t->entries[cpu],
738 add_entry_to_counter,
741 xt_info_wrunlock(cpu);
746 static struct xt_counters *alloc_counters(struct xt_table *table)
748 unsigned int countersize;
749 struct xt_counters *counters;
750 struct xt_table_info *private = table->private;
752 /* We need atomic snapshot of counters: rest doesn't change
753 * (other than comefrom, which userspace doesn't care
756 countersize = sizeof(struct xt_counters) * private->number;
757 counters = vmalloc_node(countersize, numa_node_id());
759 if (counters == NULL)
760 return ERR_PTR(-ENOMEM);
762 get_counters(private, counters);
767 static int copy_entries_to_user(unsigned int total_size,
768 struct xt_table *table,
769 void __user *userptr)
771 unsigned int off, num;
772 struct arpt_entry *e;
773 struct xt_counters *counters;
774 struct xt_table_info *private = table->private;
778 counters = alloc_counters(table);
779 if (IS_ERR(counters))
780 return PTR_ERR(counters);
782 loc_cpu_entry = private->entries[raw_smp_processor_id()];
783 /* ... then copy entire thing ... */
784 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
789 /* FIXME: use iterator macros --RR */
790 /* ... then go back and fix counters and names */
791 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
792 struct arpt_entry_target *t;
794 e = (struct arpt_entry *)(loc_cpu_entry + off);
795 if (copy_to_user(userptr + off
796 + offsetof(struct arpt_entry, counters),
798 sizeof(counters[num])) != 0) {
803 t = arpt_get_target(e);
804 if (copy_to_user(userptr + off + e->target_offset
805 + offsetof(struct arpt_entry_target,
807 t->u.kernel.target->name,
808 strlen(t->u.kernel.target->name)+1) != 0) {
820 static void compat_standard_from_user(void *dst, void *src)
822 int v = *(compat_int_t *)src;
825 v += xt_compat_calc_jump(NFPROTO_ARP, v);
826 memcpy(dst, &v, sizeof(v));
829 static int compat_standard_to_user(void __user *dst, void *src)
831 compat_int_t cv = *(int *)src;
834 cv -= xt_compat_calc_jump(NFPROTO_ARP, cv);
835 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
838 static int compat_calc_entry(struct arpt_entry *e,
839 const struct xt_table_info *info,
840 void *base, struct xt_table_info *newinfo)
842 struct arpt_entry_target *t;
843 unsigned int entry_offset;
846 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
847 entry_offset = (void *)e - base;
849 t = arpt_get_target(e);
850 off += xt_compat_target_offset(t->u.kernel.target);
851 newinfo->size -= off;
852 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
856 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
857 if (info->hook_entry[i] &&
858 (e < (struct arpt_entry *)(base + info->hook_entry[i])))
859 newinfo->hook_entry[i] -= off;
860 if (info->underflow[i] &&
861 (e < (struct arpt_entry *)(base + info->underflow[i])))
862 newinfo->underflow[i] -= off;
867 static int compat_table_info(const struct xt_table_info *info,
868 struct xt_table_info *newinfo)
872 if (!newinfo || !info)
875 /* we dont care about newinfo->entries[] */
876 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
877 newinfo->initial_entries = 0;
878 loc_cpu_entry = info->entries[raw_smp_processor_id()];
879 return ARPT_ENTRY_ITERATE(loc_cpu_entry, info->size,
880 compat_calc_entry, info, loc_cpu_entry,
885 static int get_info(struct net *net, void __user *user, int *len, int compat)
887 char name[ARPT_TABLE_MAXNAMELEN];
891 if (*len != sizeof(struct arpt_getinfo)) {
892 duprintf("length %u != %Zu\n", *len,
893 sizeof(struct arpt_getinfo));
897 if (copy_from_user(name, user, sizeof(name)) != 0)
900 name[ARPT_TABLE_MAXNAMELEN-1] = '\0';
903 xt_compat_lock(NFPROTO_ARP);
905 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
906 "arptable_%s", name);
907 if (t && !IS_ERR(t)) {
908 struct arpt_getinfo info;
909 const struct xt_table_info *private = t->private;
913 struct xt_table_info tmp;
914 ret = compat_table_info(private, &tmp);
915 xt_compat_flush_offsets(NFPROTO_ARP);
919 info.valid_hooks = t->valid_hooks;
920 memcpy(info.hook_entry, private->hook_entry,
921 sizeof(info.hook_entry));
922 memcpy(info.underflow, private->underflow,
923 sizeof(info.underflow));
924 info.num_entries = private->number;
925 info.size = private->size;
926 strcpy(info.name, name);
928 if (copy_to_user(user, &info, *len) != 0)
935 ret = t ? PTR_ERR(t) : -ENOENT;
938 xt_compat_unlock(NFPROTO_ARP);
943 static int get_entries(struct net *net, struct arpt_get_entries __user *uptr,
947 struct arpt_get_entries get;
950 if (*len < sizeof(get)) {
951 duprintf("get_entries: %u < %Zu\n", *len, sizeof(get));
954 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
956 if (*len != sizeof(struct arpt_get_entries) + get.size) {
957 duprintf("get_entries: %u != %Zu\n", *len,
958 sizeof(struct arpt_get_entries) + get.size);
962 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
963 if (t && !IS_ERR(t)) {
964 const struct xt_table_info *private = t->private;
966 duprintf("t->private->number = %u\n",
968 if (get.size == private->size)
969 ret = copy_entries_to_user(private->size,
970 t, uptr->entrytable);
972 duprintf("get_entries: I've got %u not %u!\n",
973 private->size, get.size);
979 ret = t ? PTR_ERR(t) : -ENOENT;
984 static int __do_replace(struct net *net, const char *name,
985 unsigned int valid_hooks,
986 struct xt_table_info *newinfo,
987 unsigned int num_counters,
988 void __user *counters_ptr)
992 struct xt_table_info *oldinfo;
993 struct xt_counters *counters;
994 void *loc_cpu_old_entry;
997 counters = vmalloc_node(num_counters * sizeof(struct xt_counters),
1004 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
1005 "arptable_%s", name);
1006 if (!t || IS_ERR(t)) {
1007 ret = t ? PTR_ERR(t) : -ENOENT;
1008 goto free_newinfo_counters_untrans;
1012 if (valid_hooks != t->valid_hooks) {
1013 duprintf("Valid hook crap: %08X vs %08X\n",
1014 valid_hooks, t->valid_hooks);
1019 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
1023 /* Update module usage count based on number of rules */
1024 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1025 oldinfo->number, oldinfo->initial_entries, newinfo->number);
1026 if ((oldinfo->number > oldinfo->initial_entries) ||
1027 (newinfo->number <= oldinfo->initial_entries))
1029 if ((oldinfo->number > oldinfo->initial_entries) &&
1030 (newinfo->number <= oldinfo->initial_entries))
1033 /* Get the old counters, and synchronize with replace */
1034 get_counters(oldinfo, counters);
1036 /* Decrease module usage counts and free resource */
1037 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1038 ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,
1041 xt_free_table_info(oldinfo);
1042 if (copy_to_user(counters_ptr, counters,
1043 sizeof(struct xt_counters) * num_counters) != 0)
1052 free_newinfo_counters_untrans:
1058 static int do_replace(struct net *net, void __user *user, unsigned int len)
1061 struct arpt_replace tmp;
1062 struct xt_table_info *newinfo;
1063 void *loc_cpu_entry;
1065 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1068 /* overflow check */
1069 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1072 newinfo = xt_alloc_table_info(tmp.size);
1076 /* choose the copy that is on our node/cpu */
1077 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1078 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1084 ret = translate_table(tmp.name, tmp.valid_hooks,
1085 newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
1086 tmp.hook_entry, tmp.underflow);
1090 duprintf("arp_tables: Translated table\n");
1092 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1093 tmp.num_counters, tmp.counters);
1095 goto free_newinfo_untrans;
1098 free_newinfo_untrans:
1099 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1101 xt_free_table_info(newinfo);
1105 /* We're lazy, and add to the first CPU; overflow works its fey magic
1106 * and everything is OK. */
1108 add_counter_to_entry(struct arpt_entry *e,
1109 const struct xt_counters addme[],
1112 ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);
1118 static int do_add_counters(struct net *net, void __user *user, unsigned int len,
1121 unsigned int i, curcpu;
1122 struct xt_counters_info tmp;
1123 struct xt_counters *paddc;
1124 unsigned int num_counters;
1129 const struct xt_table_info *private;
1131 void *loc_cpu_entry;
1132 #ifdef CONFIG_COMPAT
1133 struct compat_xt_counters_info compat_tmp;
1137 size = sizeof(struct compat_xt_counters_info);
1142 size = sizeof(struct xt_counters_info);
1145 if (copy_from_user(ptmp, user, size) != 0)
1148 #ifdef CONFIG_COMPAT
1150 num_counters = compat_tmp.num_counters;
1151 name = compat_tmp.name;
1155 num_counters = tmp.num_counters;
1159 if (len != size + num_counters * sizeof(struct xt_counters))
1162 paddc = vmalloc_node(len - size, numa_node_id());
1166 if (copy_from_user(paddc, user + size, len - size) != 0) {
1171 t = xt_find_table_lock(net, NFPROTO_ARP, name);
1172 if (!t || IS_ERR(t)) {
1173 ret = t ? PTR_ERR(t) : -ENOENT;
1178 private = t->private;
1179 if (private->number != num_counters) {
1181 goto unlock_up_free;
1185 /* Choose the copy that is on our node */
1186 curcpu = smp_processor_id();
1187 loc_cpu_entry = private->entries[curcpu];
1188 xt_info_wrlock(curcpu);
1189 ARPT_ENTRY_ITERATE(loc_cpu_entry,
1191 add_counter_to_entry,
1194 xt_info_wrunlock(curcpu);
1205 #ifdef CONFIG_COMPAT
1207 compat_release_entry(struct compat_arpt_entry *e, unsigned int *i)
1209 struct arpt_entry_target *t;
1211 if (i && (*i)-- == 0)
1214 t = compat_arpt_get_target(e);
1215 module_put(t->u.kernel.target->me);
1220 check_compat_entry_size_and_hooks(struct compat_arpt_entry *e,
1221 struct xt_table_info *newinfo,
1223 unsigned char *base,
1224 unsigned char *limit,
1225 unsigned int *hook_entries,
1226 unsigned int *underflows,
1230 struct arpt_entry_target *t;
1231 struct xt_target *target;
1232 unsigned int entry_offset;
1235 duprintf("check_compat_entry_size_and_hooks %p\n", e);
1236 if ((unsigned long)e % __alignof__(struct compat_arpt_entry) != 0
1237 || (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit) {
1238 duprintf("Bad offset %p, limit = %p\n", e, limit);
1242 if (e->next_offset < sizeof(struct compat_arpt_entry) +
1243 sizeof(struct compat_xt_entry_target)) {
1244 duprintf("checking: element %p size %u\n",
1249 /* For purposes of check_entry casting the compat entry is fine */
1250 ret = check_entry((struct arpt_entry *)e, name);
1254 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1255 entry_offset = (void *)e - (void *)base;
1257 t = compat_arpt_get_target(e);
1258 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
1260 t->u.user.revision),
1261 "arpt_%s", t->u.user.name);
1262 if (IS_ERR(target) || !target) {
1263 duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1265 ret = target ? PTR_ERR(target) : -ENOENT;
1268 t->u.kernel.target = target;
1270 off += xt_compat_target_offset(target);
1272 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
1274 goto release_target;
1276 /* Check hooks & underflows */
1277 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1278 if ((unsigned char *)e - base == hook_entries[h])
1279 newinfo->hook_entry[h] = hook_entries[h];
1280 if ((unsigned char *)e - base == underflows[h])
1281 newinfo->underflow[h] = underflows[h];
1284 /* Clear counters and comefrom */
1285 memset(&e->counters, 0, sizeof(e->counters));
1292 module_put(t->u.kernel.target->me);
1298 compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr,
1299 unsigned int *size, const char *name,
1300 struct xt_table_info *newinfo, unsigned char *base)
1302 struct arpt_entry_target *t;
1303 struct xt_target *target;
1304 struct arpt_entry *de;
1305 unsigned int origsize;
1310 de = (struct arpt_entry *)*dstptr;
1311 memcpy(de, e, sizeof(struct arpt_entry));
1312 memcpy(&de->counters, &e->counters, sizeof(e->counters));
1314 *dstptr += sizeof(struct arpt_entry);
1315 *size += sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1317 de->target_offset = e->target_offset - (origsize - *size);
1318 t = compat_arpt_get_target(e);
1319 target = t->u.kernel.target;
1320 xt_compat_target_from_user(t, dstptr, size);
1322 de->next_offset = e->next_offset - (origsize - *size);
1323 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1324 if ((unsigned char *)de - base < newinfo->hook_entry[h])
1325 newinfo->hook_entry[h] -= origsize - *size;
1326 if ((unsigned char *)de - base < newinfo->underflow[h])
1327 newinfo->underflow[h] -= origsize - *size;
1332 static inline int compat_check_entry(struct arpt_entry *e, const char *name,
1337 ret = check_target(e, name);
1345 static int translate_compat_table(const char *name,
1346 unsigned int valid_hooks,
1347 struct xt_table_info **pinfo,
1349 unsigned int total_size,
1350 unsigned int number,
1351 unsigned int *hook_entries,
1352 unsigned int *underflows)
1355 struct xt_table_info *newinfo, *info;
1356 void *pos, *entry0, *entry1;
1363 info->number = number;
1365 /* Init all hooks to impossible value. */
1366 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1367 info->hook_entry[i] = 0xFFFFFFFF;
1368 info->underflow[i] = 0xFFFFFFFF;
1371 duprintf("translate_compat_table: size %u\n", info->size);
1373 xt_compat_lock(NFPROTO_ARP);
1374 /* Walk through entries, checking offsets. */
1375 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1376 check_compat_entry_size_and_hooks,
1377 info, &size, entry0,
1378 entry0 + total_size,
1379 hook_entries, underflows, &j, name);
1385 duprintf("translate_compat_table: %u not %u entries\n",
1390 /* Check hooks all assigned */
1391 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1392 /* Only hooks which are valid */
1393 if (!(valid_hooks & (1 << i)))
1395 if (info->hook_entry[i] == 0xFFFFFFFF) {
1396 duprintf("Invalid hook entry %u %u\n",
1397 i, hook_entries[i]);
1400 if (info->underflow[i] == 0xFFFFFFFF) {
1401 duprintf("Invalid underflow %u %u\n",
1408 newinfo = xt_alloc_table_info(size);
1412 newinfo->number = number;
1413 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1414 newinfo->hook_entry[i] = info->hook_entry[i];
1415 newinfo->underflow[i] = info->underflow[i];
1417 entry1 = newinfo->entries[raw_smp_processor_id()];
1420 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1421 compat_copy_entry_from_user,
1422 &pos, &size, name, newinfo, entry1);
1423 xt_compat_flush_offsets(NFPROTO_ARP);
1424 xt_compat_unlock(NFPROTO_ARP);
1429 if (!mark_source_chains(newinfo, valid_hooks, entry1))
1433 ret = ARPT_ENTRY_ITERATE(entry1, newinfo->size, compat_check_entry,
1437 COMPAT_ARPT_ENTRY_ITERATE_CONTINUE(entry0, newinfo->size, i,
1438 compat_release_entry, &j);
1439 ARPT_ENTRY_ITERATE(entry1, newinfo->size, cleanup_entry, &i);
1440 xt_free_table_info(newinfo);
1444 /* And one copy for every other CPU */
1445 for_each_possible_cpu(i)
1446 if (newinfo->entries[i] && newinfo->entries[i] != entry1)
1447 memcpy(newinfo->entries[i], entry1, newinfo->size);
1451 xt_free_table_info(info);
1455 xt_free_table_info(newinfo);
1457 COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size, compat_release_entry, &j);
1460 xt_compat_flush_offsets(NFPROTO_ARP);
1461 xt_compat_unlock(NFPROTO_ARP);
1465 struct compat_arpt_replace {
1466 char name[ARPT_TABLE_MAXNAMELEN];
1470 u32 hook_entry[NF_ARP_NUMHOOKS];
1471 u32 underflow[NF_ARP_NUMHOOKS];
1473 compat_uptr_t counters;
1474 struct compat_arpt_entry entries[0];
1477 static int compat_do_replace(struct net *net, void __user *user,
1481 struct compat_arpt_replace tmp;
1482 struct xt_table_info *newinfo;
1483 void *loc_cpu_entry;
1485 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1488 /* overflow check */
1489 if (tmp.size >= INT_MAX / num_possible_cpus())
1491 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1494 newinfo = xt_alloc_table_info(tmp.size);
1498 /* choose the copy that is on our node/cpu */
1499 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1500 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), tmp.size) != 0) {
1505 ret = translate_compat_table(tmp.name, tmp.valid_hooks,
1506 &newinfo, &loc_cpu_entry, tmp.size,
1507 tmp.num_entries, tmp.hook_entry,
1512 duprintf("compat_do_replace: Translated table\n");
1514 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1515 tmp.num_counters, compat_ptr(tmp.counters));
1517 goto free_newinfo_untrans;
1520 free_newinfo_untrans:
1521 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1523 xt_free_table_info(newinfo);
1527 static int compat_do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user,
1532 if (!capable(CAP_NET_ADMIN))
1536 case ARPT_SO_SET_REPLACE:
1537 ret = compat_do_replace(sock_net(sk), user, len);
1540 case ARPT_SO_SET_ADD_COUNTERS:
1541 ret = do_add_counters(sock_net(sk), user, len, 1);
1545 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1552 static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr,
1553 compat_uint_t *size,
1554 struct xt_counters *counters,
1557 struct arpt_entry_target *t;
1558 struct compat_arpt_entry __user *ce;
1559 u_int16_t target_offset, next_offset;
1560 compat_uint_t origsize;
1565 ce = (struct compat_arpt_entry __user *)*dstptr;
1566 if (copy_to_user(ce, e, sizeof(struct arpt_entry)))
1569 if (copy_to_user(&ce->counters, &counters[*i], sizeof(counters[*i])))
1572 *dstptr += sizeof(struct compat_arpt_entry);
1573 *size -= sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1575 target_offset = e->target_offset - (origsize - *size);
1577 t = arpt_get_target(e);
1578 ret = xt_compat_target_to_user(t, dstptr, size);
1582 next_offset = e->next_offset - (origsize - *size);
1583 if (put_user(target_offset, &ce->target_offset))
1585 if (put_user(next_offset, &ce->next_offset))
1594 static int compat_copy_entries_to_user(unsigned int total_size,
1595 struct xt_table *table,
1596 void __user *userptr)
1598 struct xt_counters *counters;
1599 const struct xt_table_info *private = table->private;
1603 void *loc_cpu_entry;
1606 counters = alloc_counters(table);
1607 if (IS_ERR(counters))
1608 return PTR_ERR(counters);
1610 /* choose the copy on our node/cpu */
1611 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1614 ret = ARPT_ENTRY_ITERATE(loc_cpu_entry, total_size,
1615 compat_copy_entry_to_user,
1616 &pos, &size, counters, &i);
1621 struct compat_arpt_get_entries {
1622 char name[ARPT_TABLE_MAXNAMELEN];
1624 struct compat_arpt_entry entrytable[0];
1627 static int compat_get_entries(struct net *net,
1628 struct compat_arpt_get_entries __user *uptr,
1632 struct compat_arpt_get_entries get;
1635 if (*len < sizeof(get)) {
1636 duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
1639 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1641 if (*len != sizeof(struct compat_arpt_get_entries) + get.size) {
1642 duprintf("compat_get_entries: %u != %zu\n",
1643 *len, sizeof(get) + get.size);
1647 xt_compat_lock(NFPROTO_ARP);
1648 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1649 if (t && !IS_ERR(t)) {
1650 const struct xt_table_info *private = t->private;
1651 struct xt_table_info info;
1653 duprintf("t->private->number = %u\n", private->number);
1654 ret = compat_table_info(private, &info);
1655 if (!ret && get.size == info.size) {
1656 ret = compat_copy_entries_to_user(private->size,
1657 t, uptr->entrytable);
1659 duprintf("compat_get_entries: I've got %u not %u!\n",
1660 private->size, get.size);
1663 xt_compat_flush_offsets(NFPROTO_ARP);
1667 ret = t ? PTR_ERR(t) : -ENOENT;
1669 xt_compat_unlock(NFPROTO_ARP);
1673 static int do_arpt_get_ctl(struct sock *, int, void __user *, int *);
1675 static int compat_do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user,
1680 if (!capable(CAP_NET_ADMIN))
1684 case ARPT_SO_GET_INFO:
1685 ret = get_info(sock_net(sk), user, len, 1);
1687 case ARPT_SO_GET_ENTRIES:
1688 ret = compat_get_entries(sock_net(sk), user, len);
1691 ret = do_arpt_get_ctl(sk, cmd, user, len);
1697 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
1701 if (!capable(CAP_NET_ADMIN))
1705 case ARPT_SO_SET_REPLACE:
1706 ret = do_replace(sock_net(sk), user, len);
1709 case ARPT_SO_SET_ADD_COUNTERS:
1710 ret = do_add_counters(sock_net(sk), user, len, 0);
1714 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1721 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1725 if (!capable(CAP_NET_ADMIN))
1729 case ARPT_SO_GET_INFO:
1730 ret = get_info(sock_net(sk), user, len, 0);
1733 case ARPT_SO_GET_ENTRIES:
1734 ret = get_entries(sock_net(sk), user, len);
1737 case ARPT_SO_GET_REVISION_TARGET: {
1738 struct xt_get_revision rev;
1740 if (*len != sizeof(rev)) {
1744 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1749 try_then_request_module(xt_find_revision(NFPROTO_ARP, rev.name,
1750 rev.revision, 1, &ret),
1751 "arpt_%s", rev.name);
1756 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd);
1763 struct xt_table *arpt_register_table(struct net *net, struct xt_table *table,
1764 const struct arpt_replace *repl)
1767 struct xt_table_info *newinfo;
1768 struct xt_table_info bootstrap
1769 = { 0, 0, 0, { 0 }, { 0 }, { } };
1770 void *loc_cpu_entry;
1771 struct xt_table *new_table;
1773 newinfo = xt_alloc_table_info(repl->size);
1779 /* choose the copy on our node/cpu */
1780 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1781 memcpy(loc_cpu_entry, repl->entries, repl->size);
1783 ret = translate_table(table->name, table->valid_hooks,
1784 newinfo, loc_cpu_entry, repl->size,
1789 duprintf("arpt_register_table: translate table gives %d\n", ret);
1793 new_table = xt_register_table(net, table, &bootstrap, newinfo);
1794 if (IS_ERR(new_table)) {
1795 ret = PTR_ERR(new_table);
1801 xt_free_table_info(newinfo);
1803 return ERR_PTR(ret);
1806 void arpt_unregister_table(struct xt_table *table)
1808 struct xt_table_info *private;
1809 void *loc_cpu_entry;
1810 struct module *table_owner = table->me;
1812 private = xt_unregister_table(table);
1814 /* Decrease module usage counts and free resources */
1815 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1816 ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size,
1817 cleanup_entry, NULL);
1818 if (private->number > private->initial_entries)
1819 module_put(table_owner);
1820 xt_free_table_info(private);
1823 /* The built-in targets: standard (NULL) and error. */
1824 static struct xt_target arpt_standard_target __read_mostly = {
1825 .name = ARPT_STANDARD_TARGET,
1826 .targetsize = sizeof(int),
1827 .family = NFPROTO_ARP,
1828 #ifdef CONFIG_COMPAT
1829 .compatsize = sizeof(compat_int_t),
1830 .compat_from_user = compat_standard_from_user,
1831 .compat_to_user = compat_standard_to_user,
1835 static struct xt_target arpt_error_target __read_mostly = {
1836 .name = ARPT_ERROR_TARGET,
1837 .target = arpt_error,
1838 .targetsize = ARPT_FUNCTION_MAXNAMELEN,
1839 .family = NFPROTO_ARP,
1842 static struct nf_sockopt_ops arpt_sockopts = {
1844 .set_optmin = ARPT_BASE_CTL,
1845 .set_optmax = ARPT_SO_SET_MAX+1,
1846 .set = do_arpt_set_ctl,
1847 #ifdef CONFIG_COMPAT
1848 .compat_set = compat_do_arpt_set_ctl,
1850 .get_optmin = ARPT_BASE_CTL,
1851 .get_optmax = ARPT_SO_GET_MAX+1,
1852 .get = do_arpt_get_ctl,
1853 #ifdef CONFIG_COMPAT
1854 .compat_get = compat_do_arpt_get_ctl,
1856 .owner = THIS_MODULE,
1859 static int __net_init arp_tables_net_init(struct net *net)
1861 return xt_proto_init(net, NFPROTO_ARP);
1864 static void __net_exit arp_tables_net_exit(struct net *net)
1866 xt_proto_fini(net, NFPROTO_ARP);
1869 static struct pernet_operations arp_tables_net_ops = {
1870 .init = arp_tables_net_init,
1871 .exit = arp_tables_net_exit,
1874 static int __init arp_tables_init(void)
1878 ret = register_pernet_subsys(&arp_tables_net_ops);
1882 /* Noone else will be downing sem now, so we won't sleep */
1883 ret = xt_register_target(&arpt_standard_target);
1886 ret = xt_register_target(&arpt_error_target);
1890 /* Register setsockopt */
1891 ret = nf_register_sockopt(&arpt_sockopts);
1895 printk(KERN_INFO "arp_tables: (C) 2002 David S. Miller\n");
1899 xt_unregister_target(&arpt_error_target);
1901 xt_unregister_target(&arpt_standard_target);
1903 unregister_pernet_subsys(&arp_tables_net_ops);
1908 static void __exit arp_tables_fini(void)
1910 nf_unregister_sockopt(&arpt_sockopts);
1911 xt_unregister_target(&arpt_error_target);
1912 xt_unregister_target(&arpt_standard_target);
1913 unregister_pernet_subsys(&arp_tables_net_ops);
1916 EXPORT_SYMBOL(arpt_register_table);
1917 EXPORT_SYMBOL(arpt_unregister_table);
1918 EXPORT_SYMBOL(arpt_do_table);
1920 module_init(arp_tables_init);
1921 module_exit(arp_tables_fini);