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 unsigned long ret = ifname_compare_aligned(_a, _b, _mask);
85 unsigned long ret = 0;
88 for (i = 0; i < IFNAMSIZ; i++)
89 ret |= (_a[i] ^ _b[i]) & _mask[i];
94 /* Returns whether packet matches rule or not. */
95 static inline int arp_packet_match(const struct arphdr *arphdr,
96 struct net_device *dev,
99 const struct arpt_arp *arpinfo)
101 const char *arpptr = (char *)(arphdr + 1);
102 const char *src_devaddr, *tgt_devaddr;
103 __be32 src_ipaddr, tgt_ipaddr;
106 #define FWINV(bool, invflg) ((bool) ^ !!(arpinfo->invflags & (invflg)))
108 if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop,
110 dprintf("ARP operation field mismatch.\n");
111 dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n",
112 arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask);
116 if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd,
118 dprintf("ARP hardware address format mismatch.\n");
119 dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n",
120 arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask);
124 if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro,
126 dprintf("ARP protocol address format mismatch.\n");
127 dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n",
128 arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask);
132 if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln,
134 dprintf("ARP hardware address length mismatch.\n");
135 dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n",
136 arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask);
140 src_devaddr = arpptr;
141 arpptr += dev->addr_len;
142 memcpy(&src_ipaddr, arpptr, sizeof(u32));
143 arpptr += sizeof(u32);
144 tgt_devaddr = arpptr;
145 arpptr += dev->addr_len;
146 memcpy(&tgt_ipaddr, arpptr, sizeof(u32));
148 if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len),
149 ARPT_INV_SRCDEVADDR) ||
150 FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len),
151 ARPT_INV_TGTDEVADDR)) {
152 dprintf("Source or target device address mismatch.\n");
157 if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr,
159 FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr),
161 dprintf("Source or target IP address mismatch.\n");
163 dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
165 &arpinfo->smsk.s_addr,
166 &arpinfo->src.s_addr,
167 arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : "");
168 dprintf("TGT: %pI4 Mask: %pI4 Target: %pI4.%s\n",
170 &arpinfo->tmsk.s_addr,
171 &arpinfo->tgt.s_addr,
172 arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : "");
176 /* Look for ifname matches. */
177 ret = ifname_compare(indev, arpinfo->iniface, arpinfo->iniface_mask);
179 if (FWINV(ret != 0, ARPT_INV_VIA_IN)) {
180 dprintf("VIA in mismatch (%s vs %s).%s\n",
181 indev, arpinfo->iniface,
182 arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":"");
186 ret = ifname_compare(outdev, arpinfo->outiface, arpinfo->outiface_mask);
188 if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) {
189 dprintf("VIA out mismatch (%s vs %s).%s\n",
190 outdev, arpinfo->outiface,
191 arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":"");
199 static inline int arp_checkentry(const struct arpt_arp *arp)
201 if (arp->flags & ~ARPT_F_MASK) {
202 duprintf("Unknown flag bits set: %08X\n",
203 arp->flags & ~ARPT_F_MASK);
206 if (arp->invflags & ~ARPT_INV_MASK) {
207 duprintf("Unknown invflag bits set: %08X\n",
208 arp->invflags & ~ARPT_INV_MASK);
216 arpt_error(struct sk_buff *skb, const struct xt_target_param *par)
219 printk("arp_tables: error: '%s'\n",
220 (const char *)par->targinfo);
225 static inline struct arpt_entry *get_entry(void *base, unsigned int offset)
227 return (struct arpt_entry *)(base + offset);
230 unsigned int arpt_do_table(struct sk_buff *skb,
232 const struct net_device *in,
233 const struct net_device *out,
234 struct xt_table *table)
236 static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long))));
237 unsigned int verdict = NF_DROP;
238 const struct arphdr *arp;
239 bool hotdrop = false;
240 struct arpt_entry *e, *back;
241 const char *indev, *outdev;
243 const struct xt_table_info *private;
244 struct xt_target_param tgpar;
246 if (!pskb_may_pull(skb, arp_hdr_len(skb->dev)))
249 indev = in ? in->name : nulldevname;
250 outdev = out ? out->name : nulldevname;
253 private = rcu_dereference(table->private);
254 table_base = rcu_dereference(private->entries[smp_processor_id()]);
256 e = get_entry(table_base, private->hook_entry[hook]);
257 back = get_entry(table_base, private->underflow[hook]);
261 tgpar.hooknum = hook;
262 tgpar.family = NFPROTO_ARP;
266 if (arp_packet_match(arp, skb->dev, indev, outdev, &e->arp)) {
267 struct arpt_entry_target *t;
270 hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) +
271 (2 * skb->dev->addr_len);
272 ADD_COUNTER(e->counters, hdr_len, 1);
274 t = arpt_get_target(e);
276 /* Standard target? */
277 if (!t->u.kernel.target->target) {
280 v = ((struct arpt_standard_target *)t)->verdict;
282 /* Pop from stack? */
283 if (v != ARPT_RETURN) {
284 verdict = (unsigned)(-v) - 1;
288 back = get_entry(table_base,
293 != (void *)e + e->next_offset) {
294 /* Save old back ptr in next entry */
295 struct arpt_entry *next
296 = (void *)e + e->next_offset;
298 (void *)back - table_base;
300 /* set back pointer to next entry */
304 e = get_entry(table_base, v);
306 /* Targets which reenter must return
309 tgpar.target = t->u.kernel.target;
310 tgpar.targinfo = t->data;
311 verdict = t->u.kernel.target->target(skb,
314 /* Target might have changed stuff. */
317 if (verdict == ARPT_CONTINUE)
318 e = (void *)e + e->next_offset;
324 e = (void *)e + e->next_offset;
336 /* All zeroes == unconditional rule. */
337 static inline int unconditional(const struct arpt_arp *arp)
341 for (i = 0; i < sizeof(*arp)/sizeof(__u32); i++)
342 if (((__u32 *)arp)[i])
348 /* Figures out from what hook each rule can be called: returns 0 if
349 * there are loops. Puts hook bitmask in comefrom.
351 static int mark_source_chains(struct xt_table_info *newinfo,
352 unsigned int valid_hooks, void *entry0)
356 /* No recursion; use packet counter to save back ptrs (reset
357 * to 0 as we leave), and comefrom to save source hook bitmask.
359 for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) {
360 unsigned int pos = newinfo->hook_entry[hook];
362 = (struct arpt_entry *)(entry0 + pos);
364 if (!(valid_hooks & (1 << hook)))
367 /* Set initial back pointer. */
368 e->counters.pcnt = pos;
371 const struct arpt_standard_target *t
372 = (void *)arpt_get_target(e);
373 int visited = e->comefrom & (1 << hook);
375 if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) {
376 printk("arptables: loop hook %u pos %u %08X.\n",
377 hook, pos, e->comefrom);
381 |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS));
383 /* Unconditional return/END. */
384 if ((e->target_offset == sizeof(struct arpt_entry)
385 && (strcmp(t->target.u.user.name,
386 ARPT_STANDARD_TARGET) == 0)
388 && unconditional(&e->arp)) || visited) {
389 unsigned int oldpos, size;
391 if (t->verdict < -NF_MAX_VERDICT - 1) {
392 duprintf("mark_source_chains: bad "
393 "negative verdict (%i)\n",
398 /* Return: backtrack through the last
402 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
404 pos = e->counters.pcnt;
405 e->counters.pcnt = 0;
407 /* We're at the start. */
411 e = (struct arpt_entry *)
413 } while (oldpos == pos + e->next_offset);
416 size = e->next_offset;
417 e = (struct arpt_entry *)
418 (entry0 + pos + size);
419 e->counters.pcnt = pos;
422 int newpos = t->verdict;
424 if (strcmp(t->target.u.user.name,
425 ARPT_STANDARD_TARGET) == 0
427 if (newpos > newinfo->size -
428 sizeof(struct arpt_entry)) {
429 duprintf("mark_source_chains: "
430 "bad verdict (%i)\n",
435 /* This a jump; chase it. */
436 duprintf("Jump rule %u -> %u\n",
439 /* ... this is a fallthru */
440 newpos = pos + e->next_offset;
442 e = (struct arpt_entry *)
444 e->counters.pcnt = pos;
449 duprintf("Finished chain %u\n", hook);
454 static inline int check_entry(struct arpt_entry *e, const char *name)
456 const struct arpt_entry_target *t;
458 if (!arp_checkentry(&e->arp)) {
459 duprintf("arp_tables: arp check failed %p %s.\n", e, name);
463 if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset)
466 t = arpt_get_target(e);
467 if (e->target_offset + t->u.target_size > e->next_offset)
473 static inline int check_target(struct arpt_entry *e, const char *name)
475 struct arpt_entry_target *t = arpt_get_target(e);
477 struct xt_tgchk_param par = {
480 .target = t->u.kernel.target,
482 .hook_mask = e->comefrom,
483 .family = NFPROTO_ARP,
486 ret = xt_check_target(&par, t->u.target_size - sizeof(*t), 0, false);
488 duprintf("arp_tables: check failed for `%s'.\n",
489 t->u.kernel.target->name);
496 find_check_entry(struct arpt_entry *e, const char *name, unsigned int size,
499 struct arpt_entry_target *t;
500 struct xt_target *target;
503 ret = check_entry(e, name);
507 t = arpt_get_target(e);
508 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
511 "arpt_%s", t->u.user.name);
512 if (IS_ERR(target) || !target) {
513 duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
514 ret = target ? PTR_ERR(target) : -ENOENT;
517 t->u.kernel.target = target;
519 ret = check_target(e, name);
526 module_put(t->u.kernel.target->me);
531 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
532 struct xt_table_info *newinfo,
534 unsigned char *limit,
535 const unsigned int *hook_entries,
536 const unsigned int *underflows,
541 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0
542 || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
543 duprintf("Bad offset %p\n", e);
548 < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
549 duprintf("checking: element %p size %u\n",
554 /* Check hooks & underflows */
555 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
556 if ((unsigned char *)e - base == hook_entries[h])
557 newinfo->hook_entry[h] = hook_entries[h];
558 if ((unsigned char *)e - base == underflows[h])
559 newinfo->underflow[h] = underflows[h];
562 /* FIXME: underflows must be unconditional, standard verdicts
563 < 0 (not ARPT_RETURN). --RR */
565 /* Clear counters and comefrom */
566 e->counters = ((struct xt_counters) { 0, 0 });
573 static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i)
575 struct xt_tgdtor_param par;
576 struct arpt_entry_target *t;
578 if (i && (*i)-- == 0)
581 t = arpt_get_target(e);
582 par.target = t->u.kernel.target;
583 par.targinfo = t->data;
584 par.family = NFPROTO_ARP;
585 if (par.target->destroy != NULL)
586 par.target->destroy(&par);
587 module_put(par.target->me);
591 /* Checks and translates the user-supplied table segment (held in
594 static int translate_table(const char *name,
595 unsigned int valid_hooks,
596 struct xt_table_info *newinfo,
600 const unsigned int *hook_entries,
601 const unsigned int *underflows)
606 newinfo->size = size;
607 newinfo->number = number;
609 /* Init all hooks to impossible value. */
610 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
611 newinfo->hook_entry[i] = 0xFFFFFFFF;
612 newinfo->underflow[i] = 0xFFFFFFFF;
615 duprintf("translate_table: size %u\n", newinfo->size);
618 /* Walk through entries, checking offsets. */
619 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
620 check_entry_size_and_hooks,
624 hook_entries, underflows, &i);
625 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret);
630 duprintf("translate_table: %u not %u entries\n",
635 /* Check hooks all assigned */
636 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
637 /* Only hooks which are valid */
638 if (!(valid_hooks & (1 << i)))
640 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
641 duprintf("Invalid hook entry %u %u\n",
645 if (newinfo->underflow[i] == 0xFFFFFFFF) {
646 duprintf("Invalid underflow %u %u\n",
652 if (!mark_source_chains(newinfo, valid_hooks, entry0)) {
653 duprintf("Looping hook\n");
657 /* Finally, each sanity check must pass */
659 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
660 find_check_entry, name, size, &i);
663 ARPT_ENTRY_ITERATE(entry0, newinfo->size,
668 /* And one copy for every other CPU */
669 for_each_possible_cpu(i) {
670 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
671 memcpy(newinfo->entries[i], entry0, newinfo->size);
678 static inline int add_entry_to_counter(const struct arpt_entry *e,
679 struct xt_counters total[],
682 ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
688 static inline int set_entry_to_counter(const struct arpt_entry *e,
689 struct xt_counters total[],
692 SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
698 static void get_counters(const struct xt_table_info *t,
699 struct xt_counters counters[])
705 /* Instead of clearing (by a previous call to memset())
706 * the counters and using adds, we set the counters
707 * with data used by 'current' CPU
708 * We dont care about preemption here.
710 curcpu = raw_smp_processor_id();
713 ARPT_ENTRY_ITERATE(t->entries[curcpu],
715 set_entry_to_counter,
719 for_each_possible_cpu(cpu) {
723 ARPT_ENTRY_ITERATE(t->entries[cpu],
725 add_entry_to_counter,
732 /* We're lazy, and add to the first CPU; overflow works its fey magic
733 * and everything is OK. */
735 add_counter_to_entry(struct arpt_entry *e,
736 const struct xt_counters addme[],
739 ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);
745 /* Take values from counters and add them back onto the current cpu */
746 static void put_counters(struct xt_table_info *t,
747 const struct xt_counters counters[])
752 cpu = smp_processor_id();
754 ARPT_ENTRY_ITERATE(t->entries[cpu],
756 add_counter_to_entry,
763 zero_entry_counter(struct arpt_entry *e, void *arg)
765 e->counters.bcnt = 0;
766 e->counters.pcnt = 0;
771 clone_counters(struct xt_table_info *newinfo, const struct xt_table_info *info)
774 const void *loc_cpu_entry = info->entries[raw_smp_processor_id()];
776 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
777 for_each_possible_cpu(cpu) {
778 memcpy(newinfo->entries[cpu], loc_cpu_entry, info->size);
779 ARPT_ENTRY_ITERATE(newinfo->entries[cpu], newinfo->size,
780 zero_entry_counter, NULL);
784 static struct xt_counters *alloc_counters(struct xt_table *table)
786 unsigned int countersize;
787 struct xt_counters *counters;
788 struct xt_table_info *private = table->private;
789 struct xt_table_info *info;
791 /* We need atomic snapshot of counters: rest doesn't change
792 * (other than comefrom, which userspace doesn't care
795 countersize = sizeof(struct xt_counters) * private->number;
796 counters = vmalloc_node(countersize, numa_node_id());
798 if (counters == NULL)
801 info = xt_alloc_table_info(private->size);
805 clone_counters(info, private);
807 mutex_lock(&table->lock);
808 xt_table_entry_swap_rcu(private, info);
809 synchronize_net(); /* Wait until smoke has cleared */
811 get_counters(info, counters);
812 put_counters(private, counters);
813 mutex_unlock(&table->lock);
815 xt_free_table_info(info);
822 return ERR_PTR(-ENOMEM);
825 static int copy_entries_to_user(unsigned int total_size,
826 struct xt_table *table,
827 void __user *userptr)
829 unsigned int off, num;
830 struct arpt_entry *e;
831 struct xt_counters *counters;
832 struct xt_table_info *private = table->private;
836 counters = alloc_counters(table);
837 if (IS_ERR(counters))
838 return PTR_ERR(counters);
840 loc_cpu_entry = private->entries[raw_smp_processor_id()];
841 /* ... then copy entire thing ... */
842 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
847 /* FIXME: use iterator macros --RR */
848 /* ... then go back and fix counters and names */
849 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
850 struct arpt_entry_target *t;
852 e = (struct arpt_entry *)(loc_cpu_entry + off);
853 if (copy_to_user(userptr + off
854 + offsetof(struct arpt_entry, counters),
856 sizeof(counters[num])) != 0) {
861 t = arpt_get_target(e);
862 if (copy_to_user(userptr + off + e->target_offset
863 + offsetof(struct arpt_entry_target,
865 t->u.kernel.target->name,
866 strlen(t->u.kernel.target->name)+1) != 0) {
878 static void compat_standard_from_user(void *dst, void *src)
880 int v = *(compat_int_t *)src;
883 v += xt_compat_calc_jump(NFPROTO_ARP, v);
884 memcpy(dst, &v, sizeof(v));
887 static int compat_standard_to_user(void __user *dst, void *src)
889 compat_int_t cv = *(int *)src;
892 cv -= xt_compat_calc_jump(NFPROTO_ARP, cv);
893 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
896 static int compat_calc_entry(struct arpt_entry *e,
897 const struct xt_table_info *info,
898 void *base, struct xt_table_info *newinfo)
900 struct arpt_entry_target *t;
901 unsigned int entry_offset;
904 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
905 entry_offset = (void *)e - base;
907 t = arpt_get_target(e);
908 off += xt_compat_target_offset(t->u.kernel.target);
909 newinfo->size -= off;
910 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
914 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
915 if (info->hook_entry[i] &&
916 (e < (struct arpt_entry *)(base + info->hook_entry[i])))
917 newinfo->hook_entry[i] -= off;
918 if (info->underflow[i] &&
919 (e < (struct arpt_entry *)(base + info->underflow[i])))
920 newinfo->underflow[i] -= off;
925 static int compat_table_info(const struct xt_table_info *info,
926 struct xt_table_info *newinfo)
930 if (!newinfo || !info)
933 /* we dont care about newinfo->entries[] */
934 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
935 newinfo->initial_entries = 0;
936 loc_cpu_entry = info->entries[raw_smp_processor_id()];
937 return ARPT_ENTRY_ITERATE(loc_cpu_entry, info->size,
938 compat_calc_entry, info, loc_cpu_entry,
943 static int get_info(struct net *net, void __user *user, int *len, int compat)
945 char name[ARPT_TABLE_MAXNAMELEN];
949 if (*len != sizeof(struct arpt_getinfo)) {
950 duprintf("length %u != %Zu\n", *len,
951 sizeof(struct arpt_getinfo));
955 if (copy_from_user(name, user, sizeof(name)) != 0)
958 name[ARPT_TABLE_MAXNAMELEN-1] = '\0';
961 xt_compat_lock(NFPROTO_ARP);
963 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
964 "arptable_%s", name);
965 if (t && !IS_ERR(t)) {
966 struct arpt_getinfo info;
967 const struct xt_table_info *private = t->private;
971 struct xt_table_info tmp;
972 ret = compat_table_info(private, &tmp);
973 xt_compat_flush_offsets(NFPROTO_ARP);
977 info.valid_hooks = t->valid_hooks;
978 memcpy(info.hook_entry, private->hook_entry,
979 sizeof(info.hook_entry));
980 memcpy(info.underflow, private->underflow,
981 sizeof(info.underflow));
982 info.num_entries = private->number;
983 info.size = private->size;
984 strcpy(info.name, name);
986 if (copy_to_user(user, &info, *len) != 0)
993 ret = t ? PTR_ERR(t) : -ENOENT;
996 xt_compat_unlock(NFPROTO_ARP);
1001 static int get_entries(struct net *net, struct arpt_get_entries __user *uptr,
1005 struct arpt_get_entries get;
1008 if (*len < sizeof(get)) {
1009 duprintf("get_entries: %u < %Zu\n", *len, sizeof(get));
1012 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1014 if (*len != sizeof(struct arpt_get_entries) + get.size) {
1015 duprintf("get_entries: %u != %Zu\n", *len,
1016 sizeof(struct arpt_get_entries) + get.size);
1020 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1021 if (t && !IS_ERR(t)) {
1022 const struct xt_table_info *private = t->private;
1024 duprintf("t->private->number = %u\n",
1026 if (get.size == private->size)
1027 ret = copy_entries_to_user(private->size,
1028 t, uptr->entrytable);
1030 duprintf("get_entries: I've got %u not %u!\n",
1031 private->size, get.size);
1037 ret = t ? PTR_ERR(t) : -ENOENT;
1042 static int __do_replace(struct net *net, const char *name,
1043 unsigned int valid_hooks,
1044 struct xt_table_info *newinfo,
1045 unsigned int num_counters,
1046 void __user *counters_ptr)
1050 struct xt_table_info *oldinfo;
1051 struct xt_counters *counters;
1052 void *loc_cpu_old_entry;
1055 counters = vmalloc_node(num_counters * sizeof(struct xt_counters),
1062 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
1063 "arptable_%s", name);
1064 if (!t || IS_ERR(t)) {
1065 ret = t ? PTR_ERR(t) : -ENOENT;
1066 goto free_newinfo_counters_untrans;
1070 if (valid_hooks != t->valid_hooks) {
1071 duprintf("Valid hook crap: %08X vs %08X\n",
1072 valid_hooks, t->valid_hooks);
1077 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
1081 /* Update module usage count based on number of rules */
1082 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1083 oldinfo->number, oldinfo->initial_entries, newinfo->number);
1084 if ((oldinfo->number > oldinfo->initial_entries) ||
1085 (newinfo->number <= oldinfo->initial_entries))
1087 if ((oldinfo->number > oldinfo->initial_entries) &&
1088 (newinfo->number <= oldinfo->initial_entries))
1091 /* Get the old counters. */
1092 get_counters(oldinfo, counters);
1093 /* Decrease module usage counts and free resource */
1094 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1095 ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,
1098 xt_free_table_info(oldinfo);
1099 if (copy_to_user(counters_ptr, counters,
1100 sizeof(struct xt_counters) * num_counters) != 0)
1109 free_newinfo_counters_untrans:
1115 static int do_replace(struct net *net, void __user *user, unsigned int len)
1118 struct arpt_replace tmp;
1119 struct xt_table_info *newinfo;
1120 void *loc_cpu_entry;
1122 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1125 /* overflow check */
1126 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1129 newinfo = xt_alloc_table_info(tmp.size);
1133 /* choose the copy that is on our node/cpu */
1134 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1135 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1141 ret = translate_table(tmp.name, tmp.valid_hooks,
1142 newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
1143 tmp.hook_entry, tmp.underflow);
1147 duprintf("arp_tables: Translated table\n");
1149 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1150 tmp.num_counters, tmp.counters);
1152 goto free_newinfo_untrans;
1155 free_newinfo_untrans:
1156 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1158 xt_free_table_info(newinfo);
1162 static int do_add_counters(struct net *net, void __user *user, unsigned int len,
1166 struct xt_counters_info tmp;
1167 struct xt_counters *paddc;
1168 unsigned int num_counters;
1173 const struct xt_table_info *private;
1175 void *loc_cpu_entry;
1176 #ifdef CONFIG_COMPAT
1177 struct compat_xt_counters_info compat_tmp;
1181 size = sizeof(struct compat_xt_counters_info);
1186 size = sizeof(struct xt_counters_info);
1189 if (copy_from_user(ptmp, user, size) != 0)
1192 #ifdef CONFIG_COMPAT
1194 num_counters = compat_tmp.num_counters;
1195 name = compat_tmp.name;
1199 num_counters = tmp.num_counters;
1203 if (len != size + num_counters * sizeof(struct xt_counters))
1206 paddc = vmalloc_node(len - size, numa_node_id());
1210 if (copy_from_user(paddc, user + size, len - size) != 0) {
1215 t = xt_find_table_lock(net, NFPROTO_ARP, name);
1216 if (!t || IS_ERR(t)) {
1217 ret = t ? PTR_ERR(t) : -ENOENT;
1221 mutex_lock(&t->lock);
1222 private = t->private;
1223 if (private->number != num_counters) {
1225 goto unlock_up_free;
1230 /* Choose the copy that is on our node */
1231 loc_cpu_entry = private->entries[smp_processor_id()];
1232 ARPT_ENTRY_ITERATE(loc_cpu_entry,
1234 add_counter_to_entry,
1239 mutex_unlock(&t->lock);
1249 #ifdef CONFIG_COMPAT
1251 compat_release_entry(struct compat_arpt_entry *e, unsigned int *i)
1253 struct arpt_entry_target *t;
1255 if (i && (*i)-- == 0)
1258 t = compat_arpt_get_target(e);
1259 module_put(t->u.kernel.target->me);
1264 check_compat_entry_size_and_hooks(struct compat_arpt_entry *e,
1265 struct xt_table_info *newinfo,
1267 unsigned char *base,
1268 unsigned char *limit,
1269 unsigned int *hook_entries,
1270 unsigned int *underflows,
1274 struct arpt_entry_target *t;
1275 struct xt_target *target;
1276 unsigned int entry_offset;
1279 duprintf("check_compat_entry_size_and_hooks %p\n", e);
1280 if ((unsigned long)e % __alignof__(struct compat_arpt_entry) != 0
1281 || (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit) {
1282 duprintf("Bad offset %p, limit = %p\n", e, limit);
1286 if (e->next_offset < sizeof(struct compat_arpt_entry) +
1287 sizeof(struct compat_xt_entry_target)) {
1288 duprintf("checking: element %p size %u\n",
1293 /* For purposes of check_entry casting the compat entry is fine */
1294 ret = check_entry((struct arpt_entry *)e, name);
1298 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1299 entry_offset = (void *)e - (void *)base;
1301 t = compat_arpt_get_target(e);
1302 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
1304 t->u.user.revision),
1305 "arpt_%s", t->u.user.name);
1306 if (IS_ERR(target) || !target) {
1307 duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1309 ret = target ? PTR_ERR(target) : -ENOENT;
1312 t->u.kernel.target = target;
1314 off += xt_compat_target_offset(target);
1316 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
1318 goto release_target;
1320 /* Check hooks & underflows */
1321 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1322 if ((unsigned char *)e - base == hook_entries[h])
1323 newinfo->hook_entry[h] = hook_entries[h];
1324 if ((unsigned char *)e - base == underflows[h])
1325 newinfo->underflow[h] = underflows[h];
1328 /* Clear counters and comefrom */
1329 memset(&e->counters, 0, sizeof(e->counters));
1336 module_put(t->u.kernel.target->me);
1342 compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr,
1343 unsigned int *size, const char *name,
1344 struct xt_table_info *newinfo, unsigned char *base)
1346 struct arpt_entry_target *t;
1347 struct xt_target *target;
1348 struct arpt_entry *de;
1349 unsigned int origsize;
1354 de = (struct arpt_entry *)*dstptr;
1355 memcpy(de, e, sizeof(struct arpt_entry));
1356 memcpy(&de->counters, &e->counters, sizeof(e->counters));
1358 *dstptr += sizeof(struct arpt_entry);
1359 *size += sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1361 de->target_offset = e->target_offset - (origsize - *size);
1362 t = compat_arpt_get_target(e);
1363 target = t->u.kernel.target;
1364 xt_compat_target_from_user(t, dstptr, size);
1366 de->next_offset = e->next_offset - (origsize - *size);
1367 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1368 if ((unsigned char *)de - base < newinfo->hook_entry[h])
1369 newinfo->hook_entry[h] -= origsize - *size;
1370 if ((unsigned char *)de - base < newinfo->underflow[h])
1371 newinfo->underflow[h] -= origsize - *size;
1376 static inline int compat_check_entry(struct arpt_entry *e, const char *name,
1381 ret = check_target(e, name);
1389 static int translate_compat_table(const char *name,
1390 unsigned int valid_hooks,
1391 struct xt_table_info **pinfo,
1393 unsigned int total_size,
1394 unsigned int number,
1395 unsigned int *hook_entries,
1396 unsigned int *underflows)
1399 struct xt_table_info *newinfo, *info;
1400 void *pos, *entry0, *entry1;
1407 info->number = number;
1409 /* Init all hooks to impossible value. */
1410 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1411 info->hook_entry[i] = 0xFFFFFFFF;
1412 info->underflow[i] = 0xFFFFFFFF;
1415 duprintf("translate_compat_table: size %u\n", info->size);
1417 xt_compat_lock(NFPROTO_ARP);
1418 /* Walk through entries, checking offsets. */
1419 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1420 check_compat_entry_size_and_hooks,
1421 info, &size, entry0,
1422 entry0 + total_size,
1423 hook_entries, underflows, &j, name);
1429 duprintf("translate_compat_table: %u not %u entries\n",
1434 /* Check hooks all assigned */
1435 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1436 /* Only hooks which are valid */
1437 if (!(valid_hooks & (1 << i)))
1439 if (info->hook_entry[i] == 0xFFFFFFFF) {
1440 duprintf("Invalid hook entry %u %u\n",
1441 i, hook_entries[i]);
1444 if (info->underflow[i] == 0xFFFFFFFF) {
1445 duprintf("Invalid underflow %u %u\n",
1452 newinfo = xt_alloc_table_info(size);
1456 newinfo->number = number;
1457 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1458 newinfo->hook_entry[i] = info->hook_entry[i];
1459 newinfo->underflow[i] = info->underflow[i];
1461 entry1 = newinfo->entries[raw_smp_processor_id()];
1464 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1465 compat_copy_entry_from_user,
1466 &pos, &size, name, newinfo, entry1);
1467 xt_compat_flush_offsets(NFPROTO_ARP);
1468 xt_compat_unlock(NFPROTO_ARP);
1473 if (!mark_source_chains(newinfo, valid_hooks, entry1))
1477 ret = ARPT_ENTRY_ITERATE(entry1, newinfo->size, compat_check_entry,
1481 COMPAT_ARPT_ENTRY_ITERATE_CONTINUE(entry0, newinfo->size, i,
1482 compat_release_entry, &j);
1483 ARPT_ENTRY_ITERATE(entry1, newinfo->size, cleanup_entry, &i);
1484 xt_free_table_info(newinfo);
1488 /* And one copy for every other CPU */
1489 for_each_possible_cpu(i)
1490 if (newinfo->entries[i] && newinfo->entries[i] != entry1)
1491 memcpy(newinfo->entries[i], entry1, newinfo->size);
1495 xt_free_table_info(info);
1499 xt_free_table_info(newinfo);
1501 COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size, compat_release_entry, &j);
1504 xt_compat_flush_offsets(NFPROTO_ARP);
1505 xt_compat_unlock(NFPROTO_ARP);
1509 struct compat_arpt_replace {
1510 char name[ARPT_TABLE_MAXNAMELEN];
1514 u32 hook_entry[NF_ARP_NUMHOOKS];
1515 u32 underflow[NF_ARP_NUMHOOKS];
1517 compat_uptr_t counters;
1518 struct compat_arpt_entry entries[0];
1521 static int compat_do_replace(struct net *net, void __user *user,
1525 struct compat_arpt_replace tmp;
1526 struct xt_table_info *newinfo;
1527 void *loc_cpu_entry;
1529 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1532 /* overflow check */
1533 if (tmp.size >= INT_MAX / num_possible_cpus())
1535 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1538 newinfo = xt_alloc_table_info(tmp.size);
1542 /* choose the copy that is on our node/cpu */
1543 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1544 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), tmp.size) != 0) {
1549 ret = translate_compat_table(tmp.name, tmp.valid_hooks,
1550 &newinfo, &loc_cpu_entry, tmp.size,
1551 tmp.num_entries, tmp.hook_entry,
1556 duprintf("compat_do_replace: Translated table\n");
1558 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1559 tmp.num_counters, compat_ptr(tmp.counters));
1561 goto free_newinfo_untrans;
1564 free_newinfo_untrans:
1565 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1567 xt_free_table_info(newinfo);
1571 static int compat_do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user,
1576 if (!capable(CAP_NET_ADMIN))
1580 case ARPT_SO_SET_REPLACE:
1581 ret = compat_do_replace(sock_net(sk), user, len);
1584 case ARPT_SO_SET_ADD_COUNTERS:
1585 ret = do_add_counters(sock_net(sk), user, len, 1);
1589 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1596 static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr,
1597 compat_uint_t *size,
1598 struct xt_counters *counters,
1601 struct arpt_entry_target *t;
1602 struct compat_arpt_entry __user *ce;
1603 u_int16_t target_offset, next_offset;
1604 compat_uint_t origsize;
1609 ce = (struct compat_arpt_entry __user *)*dstptr;
1610 if (copy_to_user(ce, e, sizeof(struct arpt_entry)))
1613 if (copy_to_user(&ce->counters, &counters[*i], sizeof(counters[*i])))
1616 *dstptr += sizeof(struct compat_arpt_entry);
1617 *size -= sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1619 target_offset = e->target_offset - (origsize - *size);
1621 t = arpt_get_target(e);
1622 ret = xt_compat_target_to_user(t, dstptr, size);
1626 next_offset = e->next_offset - (origsize - *size);
1627 if (put_user(target_offset, &ce->target_offset))
1629 if (put_user(next_offset, &ce->next_offset))
1638 static int compat_copy_entries_to_user(unsigned int total_size,
1639 struct xt_table *table,
1640 void __user *userptr)
1642 struct xt_counters *counters;
1643 const struct xt_table_info *private = table->private;
1647 void *loc_cpu_entry;
1650 counters = alloc_counters(table);
1651 if (IS_ERR(counters))
1652 return PTR_ERR(counters);
1654 /* choose the copy on our node/cpu */
1655 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1658 ret = ARPT_ENTRY_ITERATE(loc_cpu_entry, total_size,
1659 compat_copy_entry_to_user,
1660 &pos, &size, counters, &i);
1665 struct compat_arpt_get_entries {
1666 char name[ARPT_TABLE_MAXNAMELEN];
1668 struct compat_arpt_entry entrytable[0];
1671 static int compat_get_entries(struct net *net,
1672 struct compat_arpt_get_entries __user *uptr,
1676 struct compat_arpt_get_entries get;
1679 if (*len < sizeof(get)) {
1680 duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
1683 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1685 if (*len != sizeof(struct compat_arpt_get_entries) + get.size) {
1686 duprintf("compat_get_entries: %u != %zu\n",
1687 *len, sizeof(get) + get.size);
1691 xt_compat_lock(NFPROTO_ARP);
1692 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1693 if (t && !IS_ERR(t)) {
1694 const struct xt_table_info *private = t->private;
1695 struct xt_table_info info;
1697 duprintf("t->private->number = %u\n", private->number);
1698 ret = compat_table_info(private, &info);
1699 if (!ret && get.size == info.size) {
1700 ret = compat_copy_entries_to_user(private->size,
1701 t, uptr->entrytable);
1703 duprintf("compat_get_entries: I've got %u not %u!\n",
1704 private->size, get.size);
1707 xt_compat_flush_offsets(NFPROTO_ARP);
1711 ret = t ? PTR_ERR(t) : -ENOENT;
1713 xt_compat_unlock(NFPROTO_ARP);
1717 static int do_arpt_get_ctl(struct sock *, int, void __user *, int *);
1719 static int compat_do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user,
1724 if (!capable(CAP_NET_ADMIN))
1728 case ARPT_SO_GET_INFO:
1729 ret = get_info(sock_net(sk), user, len, 1);
1731 case ARPT_SO_GET_ENTRIES:
1732 ret = compat_get_entries(sock_net(sk), user, len);
1735 ret = do_arpt_get_ctl(sk, cmd, user, len);
1741 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
1745 if (!capable(CAP_NET_ADMIN))
1749 case ARPT_SO_SET_REPLACE:
1750 ret = do_replace(sock_net(sk), user, len);
1753 case ARPT_SO_SET_ADD_COUNTERS:
1754 ret = do_add_counters(sock_net(sk), user, len, 0);
1758 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1765 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1769 if (!capable(CAP_NET_ADMIN))
1773 case ARPT_SO_GET_INFO:
1774 ret = get_info(sock_net(sk), user, len, 0);
1777 case ARPT_SO_GET_ENTRIES:
1778 ret = get_entries(sock_net(sk), user, len);
1781 case ARPT_SO_GET_REVISION_TARGET: {
1782 struct xt_get_revision rev;
1784 if (*len != sizeof(rev)) {
1788 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1793 try_then_request_module(xt_find_revision(NFPROTO_ARP, rev.name,
1794 rev.revision, 1, &ret),
1795 "arpt_%s", rev.name);
1800 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd);
1807 struct xt_table *arpt_register_table(struct net *net, struct xt_table *table,
1808 const struct arpt_replace *repl)
1811 struct xt_table_info *newinfo;
1812 struct xt_table_info bootstrap
1813 = { 0, 0, 0, { 0 }, { 0 }, { } };
1814 void *loc_cpu_entry;
1815 struct xt_table *new_table;
1817 newinfo = xt_alloc_table_info(repl->size);
1823 /* choose the copy on our node/cpu */
1824 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1825 memcpy(loc_cpu_entry, repl->entries, repl->size);
1827 ret = translate_table(table->name, table->valid_hooks,
1828 newinfo, loc_cpu_entry, repl->size,
1833 duprintf("arpt_register_table: translate table gives %d\n", ret);
1837 new_table = xt_register_table(net, table, &bootstrap, newinfo);
1838 if (IS_ERR(new_table)) {
1839 ret = PTR_ERR(new_table);
1845 xt_free_table_info(newinfo);
1847 return ERR_PTR(ret);
1850 void arpt_unregister_table(struct xt_table *table)
1852 struct xt_table_info *private;
1853 void *loc_cpu_entry;
1854 struct module *table_owner = table->me;
1856 private = xt_unregister_table(table);
1858 /* Decrease module usage counts and free resources */
1859 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1860 ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size,
1861 cleanup_entry, NULL);
1862 if (private->number > private->initial_entries)
1863 module_put(table_owner);
1864 xt_free_table_info(private);
1867 /* The built-in targets: standard (NULL) and error. */
1868 static struct xt_target arpt_standard_target __read_mostly = {
1869 .name = ARPT_STANDARD_TARGET,
1870 .targetsize = sizeof(int),
1871 .family = NFPROTO_ARP,
1872 #ifdef CONFIG_COMPAT
1873 .compatsize = sizeof(compat_int_t),
1874 .compat_from_user = compat_standard_from_user,
1875 .compat_to_user = compat_standard_to_user,
1879 static struct xt_target arpt_error_target __read_mostly = {
1880 .name = ARPT_ERROR_TARGET,
1881 .target = arpt_error,
1882 .targetsize = ARPT_FUNCTION_MAXNAMELEN,
1883 .family = NFPROTO_ARP,
1886 static struct nf_sockopt_ops arpt_sockopts = {
1888 .set_optmin = ARPT_BASE_CTL,
1889 .set_optmax = ARPT_SO_SET_MAX+1,
1890 .set = do_arpt_set_ctl,
1891 #ifdef CONFIG_COMPAT
1892 .compat_set = compat_do_arpt_set_ctl,
1894 .get_optmin = ARPT_BASE_CTL,
1895 .get_optmax = ARPT_SO_GET_MAX+1,
1896 .get = do_arpt_get_ctl,
1897 #ifdef CONFIG_COMPAT
1898 .compat_get = compat_do_arpt_get_ctl,
1900 .owner = THIS_MODULE,
1903 static int __net_init arp_tables_net_init(struct net *net)
1905 return xt_proto_init(net, NFPROTO_ARP);
1908 static void __net_exit arp_tables_net_exit(struct net *net)
1910 xt_proto_fini(net, NFPROTO_ARP);
1913 static struct pernet_operations arp_tables_net_ops = {
1914 .init = arp_tables_net_init,
1915 .exit = arp_tables_net_exit,
1918 static int __init arp_tables_init(void)
1922 ret = register_pernet_subsys(&arp_tables_net_ops);
1926 /* Noone else will be downing sem now, so we won't sleep */
1927 ret = xt_register_target(&arpt_standard_target);
1930 ret = xt_register_target(&arpt_error_target);
1934 /* Register setsockopt */
1935 ret = nf_register_sockopt(&arpt_sockopts);
1939 printk(KERN_INFO "arp_tables: (C) 2002 David S. Miller\n");
1943 xt_unregister_target(&arpt_error_target);
1945 xt_unregister_target(&arpt_standard_target);
1947 unregister_pernet_subsys(&arp_tables_net_ops);
1952 static void __exit arp_tables_fini(void)
1954 nf_unregister_sockopt(&arpt_sockopts);
1955 xt_unregister_target(&arpt_error_target);
1956 xt_unregister_target(&arpt_standard_target);
1957 unregister_pernet_subsys(&arp_tables_net_ops);
1960 EXPORT_SYMBOL(arpt_register_table);
1961 EXPORT_SYMBOL(arpt_unregister_table);
1962 EXPORT_SYMBOL(arpt_do_table);
1964 module_init(arp_tables_init);
1965 module_exit(arp_tables_fini);