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 ((strcmp(t->target.u.user.name,
392 ARPT_STANDARD_TARGET) == 0) &&
393 t->verdict < -NF_MAX_VERDICT - 1) {
394 duprintf("mark_source_chains: bad "
395 "negative verdict (%i)\n",
400 /* Return: backtrack through the last
404 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
406 pos = e->counters.pcnt;
407 e->counters.pcnt = 0;
409 /* We're at the start. */
413 e = (struct arpt_entry *)
415 } while (oldpos == pos + e->next_offset);
418 size = e->next_offset;
419 e = (struct arpt_entry *)
420 (entry0 + pos + size);
421 e->counters.pcnt = pos;
424 int newpos = t->verdict;
426 if (strcmp(t->target.u.user.name,
427 ARPT_STANDARD_TARGET) == 0
429 if (newpos > newinfo->size -
430 sizeof(struct arpt_entry)) {
431 duprintf("mark_source_chains: "
432 "bad verdict (%i)\n",
437 /* This a jump; chase it. */
438 duprintf("Jump rule %u -> %u\n",
441 /* ... this is a fallthru */
442 newpos = pos + e->next_offset;
444 e = (struct arpt_entry *)
446 e->counters.pcnt = pos;
451 duprintf("Finished chain %u\n", hook);
456 static inline int check_entry(struct arpt_entry *e, const char *name)
458 const struct arpt_entry_target *t;
460 if (!arp_checkentry(&e->arp)) {
461 duprintf("arp_tables: arp check failed %p %s.\n", e, name);
465 if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset)
468 t = arpt_get_target(e);
469 if (e->target_offset + t->u.target_size > e->next_offset)
475 static inline int check_target(struct arpt_entry *e, const char *name)
477 struct arpt_entry_target *t = arpt_get_target(e);
479 struct xt_tgchk_param par = {
482 .target = t->u.kernel.target,
484 .hook_mask = e->comefrom,
485 .family = NFPROTO_ARP,
488 ret = xt_check_target(&par, t->u.target_size - sizeof(*t), 0, false);
490 duprintf("arp_tables: check failed for `%s'.\n",
491 t->u.kernel.target->name);
498 find_check_entry(struct arpt_entry *e, const char *name, unsigned int size,
501 struct arpt_entry_target *t;
502 struct xt_target *target;
505 ret = check_entry(e, name);
509 t = arpt_get_target(e);
510 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
513 "arpt_%s", t->u.user.name);
514 if (IS_ERR(target) || !target) {
515 duprintf("find_check_entry: `%s' not found\n", t->u.user.name);
516 ret = target ? PTR_ERR(target) : -ENOENT;
519 t->u.kernel.target = target;
521 ret = check_target(e, name);
528 module_put(t->u.kernel.target->me);
533 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
534 struct xt_table_info *newinfo,
536 unsigned char *limit,
537 const unsigned int *hook_entries,
538 const unsigned int *underflows,
543 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0
544 || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
545 duprintf("Bad offset %p\n", e);
550 < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
551 duprintf("checking: element %p size %u\n",
556 /* Check hooks & underflows */
557 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
558 if ((unsigned char *)e - base == hook_entries[h])
559 newinfo->hook_entry[h] = hook_entries[h];
560 if ((unsigned char *)e - base == underflows[h])
561 newinfo->underflow[h] = underflows[h];
564 /* FIXME: underflows must be unconditional, standard verdicts
565 < 0 (not ARPT_RETURN). --RR */
567 /* Clear counters and comefrom */
568 e->counters = ((struct xt_counters) { 0, 0 });
575 static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i)
577 struct xt_tgdtor_param par;
578 struct arpt_entry_target *t;
580 if (i && (*i)-- == 0)
583 t = arpt_get_target(e);
584 par.target = t->u.kernel.target;
585 par.targinfo = t->data;
586 par.family = NFPROTO_ARP;
587 if (par.target->destroy != NULL)
588 par.target->destroy(&par);
589 module_put(par.target->me);
593 /* Checks and translates the user-supplied table segment (held in
596 static int translate_table(const char *name,
597 unsigned int valid_hooks,
598 struct xt_table_info *newinfo,
602 const unsigned int *hook_entries,
603 const unsigned int *underflows)
608 newinfo->size = size;
609 newinfo->number = number;
611 /* Init all hooks to impossible value. */
612 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
613 newinfo->hook_entry[i] = 0xFFFFFFFF;
614 newinfo->underflow[i] = 0xFFFFFFFF;
617 duprintf("translate_table: size %u\n", newinfo->size);
620 /* Walk through entries, checking offsets. */
621 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
622 check_entry_size_and_hooks,
626 hook_entries, underflows, &i);
627 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret);
632 duprintf("translate_table: %u not %u entries\n",
637 /* Check hooks all assigned */
638 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
639 /* Only hooks which are valid */
640 if (!(valid_hooks & (1 << i)))
642 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
643 duprintf("Invalid hook entry %u %u\n",
647 if (newinfo->underflow[i] == 0xFFFFFFFF) {
648 duprintf("Invalid underflow %u %u\n",
654 if (!mark_source_chains(newinfo, valid_hooks, entry0)) {
655 duprintf("Looping hook\n");
659 /* Finally, each sanity check must pass */
661 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
662 find_check_entry, name, size, &i);
665 ARPT_ENTRY_ITERATE(entry0, newinfo->size,
670 /* And one copy for every other CPU */
671 for_each_possible_cpu(i) {
672 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
673 memcpy(newinfo->entries[i], entry0, newinfo->size);
680 static inline int add_entry_to_counter(const struct arpt_entry *e,
681 struct xt_counters total[],
684 ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
690 static inline int set_entry_to_counter(const struct arpt_entry *e,
691 struct xt_counters total[],
694 SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
700 static void get_counters(const struct xt_table_info *t,
701 struct xt_counters counters[])
707 /* Instead of clearing (by a previous call to memset())
708 * the counters and using adds, we set the counters
709 * with data used by 'current' CPU
710 * We dont care about preemption here.
712 curcpu = raw_smp_processor_id();
715 ARPT_ENTRY_ITERATE(t->entries[curcpu],
717 set_entry_to_counter,
721 for_each_possible_cpu(cpu) {
725 ARPT_ENTRY_ITERATE(t->entries[cpu],
727 add_entry_to_counter,
734 /* We're lazy, and add to the first CPU; overflow works its fey magic
735 * and everything is OK. */
737 add_counter_to_entry(struct arpt_entry *e,
738 const struct xt_counters addme[],
741 ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);
747 /* Take values from counters and add them back onto the current cpu */
748 static void put_counters(struct xt_table_info *t,
749 const struct xt_counters counters[])
754 cpu = smp_processor_id();
756 ARPT_ENTRY_ITERATE(t->entries[cpu],
758 add_counter_to_entry,
765 zero_entry_counter(struct arpt_entry *e, void *arg)
767 e->counters.bcnt = 0;
768 e->counters.pcnt = 0;
773 clone_counters(struct xt_table_info *newinfo, const struct xt_table_info *info)
776 const void *loc_cpu_entry = info->entries[raw_smp_processor_id()];
778 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
779 for_each_possible_cpu(cpu) {
780 memcpy(newinfo->entries[cpu], loc_cpu_entry, info->size);
781 ARPT_ENTRY_ITERATE(newinfo->entries[cpu], newinfo->size,
782 zero_entry_counter, NULL);
786 static struct xt_counters *alloc_counters(struct xt_table *table)
788 unsigned int countersize;
789 struct xt_counters *counters;
790 struct xt_table_info *private = table->private;
791 struct xt_table_info *info;
793 /* We need atomic snapshot of counters: rest doesn't change
794 * (other than comefrom, which userspace doesn't care
797 countersize = sizeof(struct xt_counters) * private->number;
798 counters = vmalloc_node(countersize, numa_node_id());
800 if (counters == NULL)
803 info = xt_alloc_table_info(private->size);
807 clone_counters(info, private);
809 mutex_lock(&table->lock);
810 xt_table_entry_swap_rcu(private, info);
811 synchronize_net(); /* Wait until smoke has cleared */
813 get_counters(info, counters);
814 put_counters(private, counters);
815 mutex_unlock(&table->lock);
817 xt_free_table_info(info);
824 return ERR_PTR(-ENOMEM);
827 static int copy_entries_to_user(unsigned int total_size,
828 struct xt_table *table,
829 void __user *userptr)
831 unsigned int off, num;
832 struct arpt_entry *e;
833 struct xt_counters *counters;
834 struct xt_table_info *private = table->private;
838 counters = alloc_counters(table);
839 if (IS_ERR(counters))
840 return PTR_ERR(counters);
842 loc_cpu_entry = private->entries[raw_smp_processor_id()];
843 /* ... then copy entire thing ... */
844 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
849 /* FIXME: use iterator macros --RR */
850 /* ... then go back and fix counters and names */
851 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
852 struct arpt_entry_target *t;
854 e = (struct arpt_entry *)(loc_cpu_entry + off);
855 if (copy_to_user(userptr + off
856 + offsetof(struct arpt_entry, counters),
858 sizeof(counters[num])) != 0) {
863 t = arpt_get_target(e);
864 if (copy_to_user(userptr + off + e->target_offset
865 + offsetof(struct arpt_entry_target,
867 t->u.kernel.target->name,
868 strlen(t->u.kernel.target->name)+1) != 0) {
880 static void compat_standard_from_user(void *dst, void *src)
882 int v = *(compat_int_t *)src;
885 v += xt_compat_calc_jump(NFPROTO_ARP, v);
886 memcpy(dst, &v, sizeof(v));
889 static int compat_standard_to_user(void __user *dst, void *src)
891 compat_int_t cv = *(int *)src;
894 cv -= xt_compat_calc_jump(NFPROTO_ARP, cv);
895 return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
898 static int compat_calc_entry(struct arpt_entry *e,
899 const struct xt_table_info *info,
900 void *base, struct xt_table_info *newinfo)
902 struct arpt_entry_target *t;
903 unsigned int entry_offset;
906 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
907 entry_offset = (void *)e - base;
909 t = arpt_get_target(e);
910 off += xt_compat_target_offset(t->u.kernel.target);
911 newinfo->size -= off;
912 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
916 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
917 if (info->hook_entry[i] &&
918 (e < (struct arpt_entry *)(base + info->hook_entry[i])))
919 newinfo->hook_entry[i] -= off;
920 if (info->underflow[i] &&
921 (e < (struct arpt_entry *)(base + info->underflow[i])))
922 newinfo->underflow[i] -= off;
927 static int compat_table_info(const struct xt_table_info *info,
928 struct xt_table_info *newinfo)
932 if (!newinfo || !info)
935 /* we dont care about newinfo->entries[] */
936 memcpy(newinfo, info, offsetof(struct xt_table_info, entries));
937 newinfo->initial_entries = 0;
938 loc_cpu_entry = info->entries[raw_smp_processor_id()];
939 return ARPT_ENTRY_ITERATE(loc_cpu_entry, info->size,
940 compat_calc_entry, info, loc_cpu_entry,
945 static int get_info(struct net *net, void __user *user, int *len, int compat)
947 char name[ARPT_TABLE_MAXNAMELEN];
951 if (*len != sizeof(struct arpt_getinfo)) {
952 duprintf("length %u != %Zu\n", *len,
953 sizeof(struct arpt_getinfo));
957 if (copy_from_user(name, user, sizeof(name)) != 0)
960 name[ARPT_TABLE_MAXNAMELEN-1] = '\0';
963 xt_compat_lock(NFPROTO_ARP);
965 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
966 "arptable_%s", name);
967 if (t && !IS_ERR(t)) {
968 struct arpt_getinfo info;
969 const struct xt_table_info *private = t->private;
973 struct xt_table_info tmp;
974 ret = compat_table_info(private, &tmp);
975 xt_compat_flush_offsets(NFPROTO_ARP);
979 info.valid_hooks = t->valid_hooks;
980 memcpy(info.hook_entry, private->hook_entry,
981 sizeof(info.hook_entry));
982 memcpy(info.underflow, private->underflow,
983 sizeof(info.underflow));
984 info.num_entries = private->number;
985 info.size = private->size;
986 strcpy(info.name, name);
988 if (copy_to_user(user, &info, *len) != 0)
995 ret = t ? PTR_ERR(t) : -ENOENT;
998 xt_compat_unlock(NFPROTO_ARP);
1003 static int get_entries(struct net *net, struct arpt_get_entries __user *uptr,
1007 struct arpt_get_entries get;
1010 if (*len < sizeof(get)) {
1011 duprintf("get_entries: %u < %Zu\n", *len, sizeof(get));
1014 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1016 if (*len != sizeof(struct arpt_get_entries) + get.size) {
1017 duprintf("get_entries: %u != %Zu\n", *len,
1018 sizeof(struct arpt_get_entries) + get.size);
1022 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1023 if (t && !IS_ERR(t)) {
1024 const struct xt_table_info *private = t->private;
1026 duprintf("t->private->number = %u\n",
1028 if (get.size == private->size)
1029 ret = copy_entries_to_user(private->size,
1030 t, uptr->entrytable);
1032 duprintf("get_entries: I've got %u not %u!\n",
1033 private->size, get.size);
1039 ret = t ? PTR_ERR(t) : -ENOENT;
1044 static int __do_replace(struct net *net, const char *name,
1045 unsigned int valid_hooks,
1046 struct xt_table_info *newinfo,
1047 unsigned int num_counters,
1048 void __user *counters_ptr)
1052 struct xt_table_info *oldinfo;
1053 struct xt_counters *counters;
1054 void *loc_cpu_old_entry;
1057 counters = vmalloc_node(num_counters * sizeof(struct xt_counters),
1064 t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name),
1065 "arptable_%s", name);
1066 if (!t || IS_ERR(t)) {
1067 ret = t ? PTR_ERR(t) : -ENOENT;
1068 goto free_newinfo_counters_untrans;
1072 if (valid_hooks != t->valid_hooks) {
1073 duprintf("Valid hook crap: %08X vs %08X\n",
1074 valid_hooks, t->valid_hooks);
1079 oldinfo = xt_replace_table(t, num_counters, newinfo, &ret);
1083 /* Update module usage count based on number of rules */
1084 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1085 oldinfo->number, oldinfo->initial_entries, newinfo->number);
1086 if ((oldinfo->number > oldinfo->initial_entries) ||
1087 (newinfo->number <= oldinfo->initial_entries))
1089 if ((oldinfo->number > oldinfo->initial_entries) &&
1090 (newinfo->number <= oldinfo->initial_entries))
1093 /* Get the old counters. */
1094 get_counters(oldinfo, counters);
1095 /* Decrease module usage counts and free resource */
1096 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
1097 ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,
1100 xt_free_table_info(oldinfo);
1101 if (copy_to_user(counters_ptr, counters,
1102 sizeof(struct xt_counters) * num_counters) != 0)
1111 free_newinfo_counters_untrans:
1117 static int do_replace(struct net *net, void __user *user, unsigned int len)
1120 struct arpt_replace tmp;
1121 struct xt_table_info *newinfo;
1122 void *loc_cpu_entry;
1124 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1127 /* overflow check */
1128 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1131 newinfo = xt_alloc_table_info(tmp.size);
1135 /* choose the copy that is on our node/cpu */
1136 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1137 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
1143 ret = translate_table(tmp.name, tmp.valid_hooks,
1144 newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
1145 tmp.hook_entry, tmp.underflow);
1149 duprintf("arp_tables: Translated table\n");
1151 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1152 tmp.num_counters, tmp.counters);
1154 goto free_newinfo_untrans;
1157 free_newinfo_untrans:
1158 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1160 xt_free_table_info(newinfo);
1164 static int do_add_counters(struct net *net, void __user *user, unsigned int len,
1168 struct xt_counters_info tmp;
1169 struct xt_counters *paddc;
1170 unsigned int num_counters;
1175 const struct xt_table_info *private;
1177 void *loc_cpu_entry;
1178 #ifdef CONFIG_COMPAT
1179 struct compat_xt_counters_info compat_tmp;
1183 size = sizeof(struct compat_xt_counters_info);
1188 size = sizeof(struct xt_counters_info);
1191 if (copy_from_user(ptmp, user, size) != 0)
1194 #ifdef CONFIG_COMPAT
1196 num_counters = compat_tmp.num_counters;
1197 name = compat_tmp.name;
1201 num_counters = tmp.num_counters;
1205 if (len != size + num_counters * sizeof(struct xt_counters))
1208 paddc = vmalloc_node(len - size, numa_node_id());
1212 if (copy_from_user(paddc, user + size, len - size) != 0) {
1217 t = xt_find_table_lock(net, NFPROTO_ARP, name);
1218 if (!t || IS_ERR(t)) {
1219 ret = t ? PTR_ERR(t) : -ENOENT;
1223 mutex_lock(&t->lock);
1224 private = t->private;
1225 if (private->number != num_counters) {
1227 goto unlock_up_free;
1232 /* Choose the copy that is on our node */
1233 loc_cpu_entry = private->entries[smp_processor_id()];
1234 ARPT_ENTRY_ITERATE(loc_cpu_entry,
1236 add_counter_to_entry,
1241 mutex_unlock(&t->lock);
1251 #ifdef CONFIG_COMPAT
1253 compat_release_entry(struct compat_arpt_entry *e, unsigned int *i)
1255 struct arpt_entry_target *t;
1257 if (i && (*i)-- == 0)
1260 t = compat_arpt_get_target(e);
1261 module_put(t->u.kernel.target->me);
1266 check_compat_entry_size_and_hooks(struct compat_arpt_entry *e,
1267 struct xt_table_info *newinfo,
1269 unsigned char *base,
1270 unsigned char *limit,
1271 unsigned int *hook_entries,
1272 unsigned int *underflows,
1276 struct arpt_entry_target *t;
1277 struct xt_target *target;
1278 unsigned int entry_offset;
1281 duprintf("check_compat_entry_size_and_hooks %p\n", e);
1282 if ((unsigned long)e % __alignof__(struct compat_arpt_entry) != 0
1283 || (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit) {
1284 duprintf("Bad offset %p, limit = %p\n", e, limit);
1288 if (e->next_offset < sizeof(struct compat_arpt_entry) +
1289 sizeof(struct compat_xt_entry_target)) {
1290 duprintf("checking: element %p size %u\n",
1295 /* For purposes of check_entry casting the compat entry is fine */
1296 ret = check_entry((struct arpt_entry *)e, name);
1300 off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1301 entry_offset = (void *)e - (void *)base;
1303 t = compat_arpt_get_target(e);
1304 target = try_then_request_module(xt_find_target(NFPROTO_ARP,
1306 t->u.user.revision),
1307 "arpt_%s", t->u.user.name);
1308 if (IS_ERR(target) || !target) {
1309 duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1311 ret = target ? PTR_ERR(target) : -ENOENT;
1314 t->u.kernel.target = target;
1316 off += xt_compat_target_offset(target);
1318 ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off);
1320 goto release_target;
1322 /* Check hooks & underflows */
1323 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1324 if ((unsigned char *)e - base == hook_entries[h])
1325 newinfo->hook_entry[h] = hook_entries[h];
1326 if ((unsigned char *)e - base == underflows[h])
1327 newinfo->underflow[h] = underflows[h];
1330 /* Clear counters and comefrom */
1331 memset(&e->counters, 0, sizeof(e->counters));
1338 module_put(t->u.kernel.target->me);
1344 compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr,
1345 unsigned int *size, const char *name,
1346 struct xt_table_info *newinfo, unsigned char *base)
1348 struct arpt_entry_target *t;
1349 struct xt_target *target;
1350 struct arpt_entry *de;
1351 unsigned int origsize;
1356 de = (struct arpt_entry *)*dstptr;
1357 memcpy(de, e, sizeof(struct arpt_entry));
1358 memcpy(&de->counters, &e->counters, sizeof(e->counters));
1360 *dstptr += sizeof(struct arpt_entry);
1361 *size += sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1363 de->target_offset = e->target_offset - (origsize - *size);
1364 t = compat_arpt_get_target(e);
1365 target = t->u.kernel.target;
1366 xt_compat_target_from_user(t, dstptr, size);
1368 de->next_offset = e->next_offset - (origsize - *size);
1369 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
1370 if ((unsigned char *)de - base < newinfo->hook_entry[h])
1371 newinfo->hook_entry[h] -= origsize - *size;
1372 if ((unsigned char *)de - base < newinfo->underflow[h])
1373 newinfo->underflow[h] -= origsize - *size;
1378 static inline int compat_check_entry(struct arpt_entry *e, const char *name,
1383 ret = check_target(e, name);
1391 static int translate_compat_table(const char *name,
1392 unsigned int valid_hooks,
1393 struct xt_table_info **pinfo,
1395 unsigned int total_size,
1396 unsigned int number,
1397 unsigned int *hook_entries,
1398 unsigned int *underflows)
1401 struct xt_table_info *newinfo, *info;
1402 void *pos, *entry0, *entry1;
1409 info->number = number;
1411 /* Init all hooks to impossible value. */
1412 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1413 info->hook_entry[i] = 0xFFFFFFFF;
1414 info->underflow[i] = 0xFFFFFFFF;
1417 duprintf("translate_compat_table: size %u\n", info->size);
1419 xt_compat_lock(NFPROTO_ARP);
1420 /* Walk through entries, checking offsets. */
1421 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1422 check_compat_entry_size_and_hooks,
1423 info, &size, entry0,
1424 entry0 + total_size,
1425 hook_entries, underflows, &j, name);
1431 duprintf("translate_compat_table: %u not %u entries\n",
1436 /* Check hooks all assigned */
1437 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1438 /* Only hooks which are valid */
1439 if (!(valid_hooks & (1 << i)))
1441 if (info->hook_entry[i] == 0xFFFFFFFF) {
1442 duprintf("Invalid hook entry %u %u\n",
1443 i, hook_entries[i]);
1446 if (info->underflow[i] == 0xFFFFFFFF) {
1447 duprintf("Invalid underflow %u %u\n",
1454 newinfo = xt_alloc_table_info(size);
1458 newinfo->number = number;
1459 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
1460 newinfo->hook_entry[i] = info->hook_entry[i];
1461 newinfo->underflow[i] = info->underflow[i];
1463 entry1 = newinfo->entries[raw_smp_processor_id()];
1466 ret = COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size,
1467 compat_copy_entry_from_user,
1468 &pos, &size, name, newinfo, entry1);
1469 xt_compat_flush_offsets(NFPROTO_ARP);
1470 xt_compat_unlock(NFPROTO_ARP);
1475 if (!mark_source_chains(newinfo, valid_hooks, entry1))
1479 ret = ARPT_ENTRY_ITERATE(entry1, newinfo->size, compat_check_entry,
1483 COMPAT_ARPT_ENTRY_ITERATE_CONTINUE(entry0, newinfo->size, i,
1484 compat_release_entry, &j);
1485 ARPT_ENTRY_ITERATE(entry1, newinfo->size, cleanup_entry, &i);
1486 xt_free_table_info(newinfo);
1490 /* And one copy for every other CPU */
1491 for_each_possible_cpu(i)
1492 if (newinfo->entries[i] && newinfo->entries[i] != entry1)
1493 memcpy(newinfo->entries[i], entry1, newinfo->size);
1497 xt_free_table_info(info);
1501 xt_free_table_info(newinfo);
1503 COMPAT_ARPT_ENTRY_ITERATE(entry0, total_size, compat_release_entry, &j);
1506 xt_compat_flush_offsets(NFPROTO_ARP);
1507 xt_compat_unlock(NFPROTO_ARP);
1511 struct compat_arpt_replace {
1512 char name[ARPT_TABLE_MAXNAMELEN];
1516 u32 hook_entry[NF_ARP_NUMHOOKS];
1517 u32 underflow[NF_ARP_NUMHOOKS];
1519 compat_uptr_t counters;
1520 struct compat_arpt_entry entries[0];
1523 static int compat_do_replace(struct net *net, void __user *user,
1527 struct compat_arpt_replace tmp;
1528 struct xt_table_info *newinfo;
1529 void *loc_cpu_entry;
1531 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1534 /* overflow check */
1535 if (tmp.size >= INT_MAX / num_possible_cpus())
1537 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
1540 newinfo = xt_alloc_table_info(tmp.size);
1544 /* choose the copy that is on our node/cpu */
1545 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1546 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), tmp.size) != 0) {
1551 ret = translate_compat_table(tmp.name, tmp.valid_hooks,
1552 &newinfo, &loc_cpu_entry, tmp.size,
1553 tmp.num_entries, tmp.hook_entry,
1558 duprintf("compat_do_replace: Translated table\n");
1560 ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo,
1561 tmp.num_counters, compat_ptr(tmp.counters));
1563 goto free_newinfo_untrans;
1566 free_newinfo_untrans:
1567 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
1569 xt_free_table_info(newinfo);
1573 static int compat_do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user,
1578 if (!capable(CAP_NET_ADMIN))
1582 case ARPT_SO_SET_REPLACE:
1583 ret = compat_do_replace(sock_net(sk), user, len);
1586 case ARPT_SO_SET_ADD_COUNTERS:
1587 ret = do_add_counters(sock_net(sk), user, len, 1);
1591 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1598 static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr,
1599 compat_uint_t *size,
1600 struct xt_counters *counters,
1603 struct arpt_entry_target *t;
1604 struct compat_arpt_entry __user *ce;
1605 u_int16_t target_offset, next_offset;
1606 compat_uint_t origsize;
1611 ce = (struct compat_arpt_entry __user *)*dstptr;
1612 if (copy_to_user(ce, e, sizeof(struct arpt_entry)))
1615 if (copy_to_user(&ce->counters, &counters[*i], sizeof(counters[*i])))
1618 *dstptr += sizeof(struct compat_arpt_entry);
1619 *size -= sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry);
1621 target_offset = e->target_offset - (origsize - *size);
1623 t = arpt_get_target(e);
1624 ret = xt_compat_target_to_user(t, dstptr, size);
1628 next_offset = e->next_offset - (origsize - *size);
1629 if (put_user(target_offset, &ce->target_offset))
1631 if (put_user(next_offset, &ce->next_offset))
1640 static int compat_copy_entries_to_user(unsigned int total_size,
1641 struct xt_table *table,
1642 void __user *userptr)
1644 struct xt_counters *counters;
1645 const struct xt_table_info *private = table->private;
1649 void *loc_cpu_entry;
1652 counters = alloc_counters(table);
1653 if (IS_ERR(counters))
1654 return PTR_ERR(counters);
1656 /* choose the copy on our node/cpu */
1657 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1660 ret = ARPT_ENTRY_ITERATE(loc_cpu_entry, total_size,
1661 compat_copy_entry_to_user,
1662 &pos, &size, counters, &i);
1667 struct compat_arpt_get_entries {
1668 char name[ARPT_TABLE_MAXNAMELEN];
1670 struct compat_arpt_entry entrytable[0];
1673 static int compat_get_entries(struct net *net,
1674 struct compat_arpt_get_entries __user *uptr,
1678 struct compat_arpt_get_entries get;
1681 if (*len < sizeof(get)) {
1682 duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get));
1685 if (copy_from_user(&get, uptr, sizeof(get)) != 0)
1687 if (*len != sizeof(struct compat_arpt_get_entries) + get.size) {
1688 duprintf("compat_get_entries: %u != %zu\n",
1689 *len, sizeof(get) + get.size);
1693 xt_compat_lock(NFPROTO_ARP);
1694 t = xt_find_table_lock(net, NFPROTO_ARP, get.name);
1695 if (t && !IS_ERR(t)) {
1696 const struct xt_table_info *private = t->private;
1697 struct xt_table_info info;
1699 duprintf("t->private->number = %u\n", private->number);
1700 ret = compat_table_info(private, &info);
1701 if (!ret && get.size == info.size) {
1702 ret = compat_copy_entries_to_user(private->size,
1703 t, uptr->entrytable);
1705 duprintf("compat_get_entries: I've got %u not %u!\n",
1706 private->size, get.size);
1709 xt_compat_flush_offsets(NFPROTO_ARP);
1713 ret = t ? PTR_ERR(t) : -ENOENT;
1715 xt_compat_unlock(NFPROTO_ARP);
1719 static int do_arpt_get_ctl(struct sock *, int, void __user *, int *);
1721 static int compat_do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user,
1726 if (!capable(CAP_NET_ADMIN))
1730 case ARPT_SO_GET_INFO:
1731 ret = get_info(sock_net(sk), user, len, 1);
1733 case ARPT_SO_GET_ENTRIES:
1734 ret = compat_get_entries(sock_net(sk), user, len);
1737 ret = do_arpt_get_ctl(sk, cmd, user, len);
1743 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
1747 if (!capable(CAP_NET_ADMIN))
1751 case ARPT_SO_SET_REPLACE:
1752 ret = do_replace(sock_net(sk), user, len);
1755 case ARPT_SO_SET_ADD_COUNTERS:
1756 ret = do_add_counters(sock_net(sk), user, len, 0);
1760 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
1767 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1771 if (!capable(CAP_NET_ADMIN))
1775 case ARPT_SO_GET_INFO:
1776 ret = get_info(sock_net(sk), user, len, 0);
1779 case ARPT_SO_GET_ENTRIES:
1780 ret = get_entries(sock_net(sk), user, len);
1783 case ARPT_SO_GET_REVISION_TARGET: {
1784 struct xt_get_revision rev;
1786 if (*len != sizeof(rev)) {
1790 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1795 try_then_request_module(xt_find_revision(NFPROTO_ARP, rev.name,
1796 rev.revision, 1, &ret),
1797 "arpt_%s", rev.name);
1802 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd);
1809 struct xt_table *arpt_register_table(struct net *net, struct xt_table *table,
1810 const struct arpt_replace *repl)
1813 struct xt_table_info *newinfo;
1814 struct xt_table_info bootstrap
1815 = { 0, 0, 0, { 0 }, { 0 }, { } };
1816 void *loc_cpu_entry;
1817 struct xt_table *new_table;
1819 newinfo = xt_alloc_table_info(repl->size);
1825 /* choose the copy on our node/cpu */
1826 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1827 memcpy(loc_cpu_entry, repl->entries, repl->size);
1829 ret = translate_table(table->name, table->valid_hooks,
1830 newinfo, loc_cpu_entry, repl->size,
1835 duprintf("arpt_register_table: translate table gives %d\n", ret);
1839 new_table = xt_register_table(net, table, &bootstrap, newinfo);
1840 if (IS_ERR(new_table)) {
1841 ret = PTR_ERR(new_table);
1847 xt_free_table_info(newinfo);
1849 return ERR_PTR(ret);
1852 void arpt_unregister_table(struct xt_table *table)
1854 struct xt_table_info *private;
1855 void *loc_cpu_entry;
1856 struct module *table_owner = table->me;
1858 private = xt_unregister_table(table);
1860 /* Decrease module usage counts and free resources */
1861 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1862 ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size,
1863 cleanup_entry, NULL);
1864 if (private->number > private->initial_entries)
1865 module_put(table_owner);
1866 xt_free_table_info(private);
1869 /* The built-in targets: standard (NULL) and error. */
1870 static struct xt_target arpt_standard_target __read_mostly = {
1871 .name = ARPT_STANDARD_TARGET,
1872 .targetsize = sizeof(int),
1873 .family = NFPROTO_ARP,
1874 #ifdef CONFIG_COMPAT
1875 .compatsize = sizeof(compat_int_t),
1876 .compat_from_user = compat_standard_from_user,
1877 .compat_to_user = compat_standard_to_user,
1881 static struct xt_target arpt_error_target __read_mostly = {
1882 .name = ARPT_ERROR_TARGET,
1883 .target = arpt_error,
1884 .targetsize = ARPT_FUNCTION_MAXNAMELEN,
1885 .family = NFPROTO_ARP,
1888 static struct nf_sockopt_ops arpt_sockopts = {
1890 .set_optmin = ARPT_BASE_CTL,
1891 .set_optmax = ARPT_SO_SET_MAX+1,
1892 .set = do_arpt_set_ctl,
1893 #ifdef CONFIG_COMPAT
1894 .compat_set = compat_do_arpt_set_ctl,
1896 .get_optmin = ARPT_BASE_CTL,
1897 .get_optmax = ARPT_SO_GET_MAX+1,
1898 .get = do_arpt_get_ctl,
1899 #ifdef CONFIG_COMPAT
1900 .compat_get = compat_do_arpt_get_ctl,
1902 .owner = THIS_MODULE,
1905 static int __net_init arp_tables_net_init(struct net *net)
1907 return xt_proto_init(net, NFPROTO_ARP);
1910 static void __net_exit arp_tables_net_exit(struct net *net)
1912 xt_proto_fini(net, NFPROTO_ARP);
1915 static struct pernet_operations arp_tables_net_ops = {
1916 .init = arp_tables_net_init,
1917 .exit = arp_tables_net_exit,
1920 static int __init arp_tables_init(void)
1924 ret = register_pernet_subsys(&arp_tables_net_ops);
1928 /* Noone else will be downing sem now, so we won't sleep */
1929 ret = xt_register_target(&arpt_standard_target);
1932 ret = xt_register_target(&arpt_error_target);
1936 /* Register setsockopt */
1937 ret = nf_register_sockopt(&arpt_sockopts);
1941 printk(KERN_INFO "arp_tables: (C) 2002 David S. Miller\n");
1945 xt_unregister_target(&arpt_error_target);
1947 xt_unregister_target(&arpt_standard_target);
1949 unregister_pernet_subsys(&arp_tables_net_ops);
1954 static void __exit arp_tables_fini(void)
1956 nf_unregister_sockopt(&arpt_sockopts);
1957 xt_unregister_target(&arpt_error_target);
1958 xt_unregister_target(&arpt_standard_target);
1959 unregister_pernet_subsys(&arp_tables_net_ops);
1962 EXPORT_SYMBOL(arpt_register_table);
1963 EXPORT_SYMBOL(arpt_unregister_table);
1964 EXPORT_SYMBOL(arpt_do_table);
1966 module_init(arp_tables_init);
1967 module_exit(arp_tables_fini);