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/config.h>
13 #include <linux/kernel.h>
14 #include <linux/skbuff.h>
15 #include <linux/netdevice.h>
16 #include <linux/capability.h>
17 #include <linux/if_arp.h>
18 #include <linux/kmod.h>
19 #include <linux/vmalloc.h>
20 #include <linux/proc_fs.h>
21 #include <linux/module.h>
22 #include <linux/init.h>
24 #include <asm/uaccess.h>
25 #include <linux/mutex.h>
27 #include <linux/netfilter/x_tables.h>
28 #include <linux/netfilter_arp/arp_tables.h>
30 MODULE_LICENSE("GPL");
31 MODULE_AUTHOR("David S. Miller <davem@redhat.com>");
32 MODULE_DESCRIPTION("arptables core");
34 /*#define DEBUG_ARP_TABLES*/
35 /*#define DEBUG_ARP_TABLES_USER*/
37 #ifdef DEBUG_ARP_TABLES
38 #define dprintf(format, args...) printk(format , ## args)
40 #define dprintf(format, args...)
43 #ifdef DEBUG_ARP_TABLES_USER
44 #define duprintf(format, args...) printk(format , ## args)
46 #define duprintf(format, args...)
49 #ifdef CONFIG_NETFILTER_DEBUG
50 #define ARP_NF_ASSERT(x) \
53 printk("ARP_NF_ASSERT: %s:%s:%u\n", \
54 __FUNCTION__, __FILE__, __LINE__); \
57 #define ARP_NF_ASSERT(x)
60 #include <linux/netfilter_ipv4/listhelp.h>
62 static inline int arp_devaddr_compare(const struct arpt_devaddr_info *ap,
63 char *hdr_addr, int len)
67 if (len > ARPT_DEV_ADDR_LEN_MAX)
68 len = ARPT_DEV_ADDR_LEN_MAX;
71 for (i = 0; i < len; i++)
72 ret |= (hdr_addr[i] ^ ap->addr[i]) & ap->mask[i];
77 /* Returns whether packet matches rule or not. */
78 static inline int arp_packet_match(const struct arphdr *arphdr,
79 struct net_device *dev,
82 const struct arpt_arp *arpinfo)
84 char *arpptr = (char *)(arphdr + 1);
85 char *src_devaddr, *tgt_devaddr;
86 u32 src_ipaddr, tgt_ipaddr;
89 #define FWINV(bool,invflg) ((bool) ^ !!(arpinfo->invflags & invflg))
91 if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop,
93 dprintf("ARP operation field mismatch.\n");
94 dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n",
95 arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask);
99 if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd,
101 dprintf("ARP hardware address format mismatch.\n");
102 dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n",
103 arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask);
107 if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro,
109 dprintf("ARP protocol address format mismatch.\n");
110 dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n",
111 arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask);
115 if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln,
117 dprintf("ARP hardware address length mismatch.\n");
118 dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n",
119 arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask);
123 src_devaddr = arpptr;
124 arpptr += dev->addr_len;
125 memcpy(&src_ipaddr, arpptr, sizeof(u32));
126 arpptr += sizeof(u32);
127 tgt_devaddr = arpptr;
128 arpptr += dev->addr_len;
129 memcpy(&tgt_ipaddr, arpptr, sizeof(u32));
131 if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len),
132 ARPT_INV_SRCDEVADDR) ||
133 FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len),
134 ARPT_INV_TGTDEVADDR)) {
135 dprintf("Source or target device address mismatch.\n");
140 if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr,
142 FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr),
144 dprintf("Source or target IP address mismatch.\n");
146 dprintf("SRC: %u.%u.%u.%u. Mask: %u.%u.%u.%u. Target: %u.%u.%u.%u.%s\n",
148 NIPQUAD(arpinfo->smsk.s_addr),
149 NIPQUAD(arpinfo->src.s_addr),
150 arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : "");
151 dprintf("TGT: %u.%u.%u.%u Mask: %u.%u.%u.%u Target: %u.%u.%u.%u.%s\n",
153 NIPQUAD(arpinfo->tmsk.s_addr),
154 NIPQUAD(arpinfo->tgt.s_addr),
155 arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : "");
159 /* Look for ifname matches. */
160 for (i = 0, ret = 0; i < IFNAMSIZ; i++) {
161 ret |= (indev[i] ^ arpinfo->iniface[i])
162 & arpinfo->iniface_mask[i];
165 if (FWINV(ret != 0, ARPT_INV_VIA_IN)) {
166 dprintf("VIA in mismatch (%s vs %s).%s\n",
167 indev, arpinfo->iniface,
168 arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":"");
172 for (i = 0, ret = 0; i < IFNAMSIZ/sizeof(unsigned long); i++) {
174 memcpy(&odev, outdev + i*sizeof(unsigned long),
175 sizeof(unsigned long));
177 ^ ((const unsigned long *)arpinfo->outiface)[i])
178 & ((const unsigned long *)arpinfo->outiface_mask)[i];
181 if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) {
182 dprintf("VIA out mismatch (%s vs %s).%s\n",
183 outdev, arpinfo->outiface,
184 arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":"");
191 static inline int arp_checkentry(const struct arpt_arp *arp)
193 if (arp->flags & ~ARPT_F_MASK) {
194 duprintf("Unknown flag bits set: %08X\n",
195 arp->flags & ~ARPT_F_MASK);
198 if (arp->invflags & ~ARPT_INV_MASK) {
199 duprintf("Unknown invflag bits set: %08X\n",
200 arp->invflags & ~ARPT_INV_MASK);
207 static unsigned int arpt_error(struct sk_buff **pskb,
208 const struct net_device *in,
209 const struct net_device *out,
210 unsigned int hooknum,
211 const struct xt_target *target,
212 const void *targinfo,
216 printk("arp_tables: error: '%s'\n", (char *)targinfo);
221 static inline struct arpt_entry *get_entry(void *base, unsigned int offset)
223 return (struct arpt_entry *)(base + offset);
226 unsigned int arpt_do_table(struct sk_buff **pskb,
228 const struct net_device *in,
229 const struct net_device *out,
230 struct arpt_table *table,
233 static const char nulldevname[IFNAMSIZ];
234 unsigned int verdict = NF_DROP;
237 struct arpt_entry *e, *back;
238 const char *indev, *outdev;
240 struct xt_table_info *private = table->private;
242 /* ARP header, plus 2 device addresses, plus 2 IP addresses. */
243 if (!pskb_may_pull((*pskb), (sizeof(struct arphdr) +
244 (2 * (*pskb)->dev->addr_len) +
248 indev = in ? in->name : nulldevname;
249 outdev = out ? out->name : nulldevname;
251 read_lock_bh(&table->lock);
252 table_base = (void *)private->entries[smp_processor_id()];
253 e = get_entry(table_base, private->hook_entry[hook]);
254 back = get_entry(table_base, private->underflow[hook]);
256 arp = (*pskb)->nh.arph;
258 if (arp_packet_match(arp, (*pskb)->dev, indev, outdev, &e->arp)) {
259 struct arpt_entry_target *t;
262 hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) +
263 (2 * (*pskb)->dev->addr_len);
264 ADD_COUNTER(e->counters, hdr_len, 1);
266 t = arpt_get_target(e);
268 /* Standard target? */
269 if (!t->u.kernel.target->target) {
272 v = ((struct arpt_standard_target *)t)->verdict;
274 /* Pop from stack? */
275 if (v != ARPT_RETURN) {
276 verdict = (unsigned)(-v) - 1;
280 back = get_entry(table_base,
285 != (void *)e + e->next_offset) {
286 /* Save old back ptr in next entry */
287 struct arpt_entry *next
288 = (void *)e + e->next_offset;
290 (void *)back - table_base;
292 /* set back pointer to next entry */
296 e = get_entry(table_base, v);
298 /* Targets which reenter must return
301 verdict = t->u.kernel.target->target(pskb,
308 /* Target might have changed stuff. */
309 arp = (*pskb)->nh.arph;
311 if (verdict == ARPT_CONTINUE)
312 e = (void *)e + e->next_offset;
318 e = (void *)e + e->next_offset;
321 read_unlock_bh(&table->lock);
329 /* All zeroes == unconditional rule. */
330 static inline int unconditional(const struct arpt_arp *arp)
334 for (i = 0; i < sizeof(*arp)/sizeof(__u32); i++)
335 if (((__u32 *)arp)[i])
341 /* Figures out from what hook each rule can be called: returns 0 if
342 * there are loops. Puts hook bitmask in comefrom.
344 static int mark_source_chains(struct xt_table_info *newinfo,
345 unsigned int valid_hooks, void *entry0)
349 /* No recursion; use packet counter to save back ptrs (reset
350 * to 0 as we leave), and comefrom to save source hook bitmask.
352 for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) {
353 unsigned int pos = newinfo->hook_entry[hook];
355 = (struct arpt_entry *)(entry0 + pos);
357 if (!(valid_hooks & (1 << hook)))
360 /* Set initial back pointer. */
361 e->counters.pcnt = pos;
364 struct arpt_standard_target *t
365 = (void *)arpt_get_target(e);
367 if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) {
368 printk("arptables: loop hook %u pos %u %08X.\n",
369 hook, pos, e->comefrom);
373 |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS));
375 /* Unconditional return/END. */
376 if (e->target_offset == sizeof(struct arpt_entry)
377 && (strcmp(t->target.u.user.name,
378 ARPT_STANDARD_TARGET) == 0)
380 && unconditional(&e->arp)) {
381 unsigned int oldpos, size;
383 /* Return: backtrack through the last
387 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
389 pos = e->counters.pcnt;
390 e->counters.pcnt = 0;
392 /* We're at the start. */
396 e = (struct arpt_entry *)
398 } while (oldpos == pos + e->next_offset);
401 size = e->next_offset;
402 e = (struct arpt_entry *)
403 (entry0 + pos + size);
404 e->counters.pcnt = pos;
407 int newpos = t->verdict;
409 if (strcmp(t->target.u.user.name,
410 ARPT_STANDARD_TARGET) == 0
412 /* This a jump; chase it. */
413 duprintf("Jump rule %u -> %u\n",
416 /* ... this is a fallthru */
417 newpos = pos + e->next_offset;
419 e = (struct arpt_entry *)
421 e->counters.pcnt = pos;
426 duprintf("Finished chain %u\n", hook);
431 static inline int standard_check(const struct arpt_entry_target *t,
432 unsigned int max_offset)
434 struct arpt_standard_target *targ = (void *)t;
436 /* Check standard info. */
438 != ARPT_ALIGN(sizeof(struct arpt_standard_target))) {
439 duprintf("arpt_standard_check: target size %u != %Zu\n",
441 ARPT_ALIGN(sizeof(struct arpt_standard_target)));
445 if (targ->verdict >= 0
446 && targ->verdict > max_offset - sizeof(struct arpt_entry)) {
447 duprintf("arpt_standard_check: bad verdict (%i)\n",
452 if (targ->verdict < -NF_MAX_VERDICT - 1) {
453 duprintf("arpt_standard_check: bad negative verdict (%i)\n",
460 static struct arpt_target arpt_standard_target;
462 static inline int check_entry(struct arpt_entry *e, const char *name, unsigned int size,
465 struct arpt_entry_target *t;
466 struct arpt_target *target;
469 if (!arp_checkentry(&e->arp)) {
470 duprintf("arp_tables: arp check failed %p %s.\n", e, name);
474 t = arpt_get_target(e);
475 target = try_then_request_module(xt_find_target(NF_ARP, t->u.user.name,
477 "arpt_%s", t->u.user.name);
478 if (IS_ERR(target) || !target) {
479 duprintf("check_entry: `%s' not found\n", t->u.user.name);
480 ret = target ? PTR_ERR(target) : -ENOENT;
483 t->u.kernel.target = target;
485 ret = xt_check_target(target, NF_ARP, t->u.target_size - sizeof(*t),
486 name, e->comefrom, 0, 0);
490 if (t->u.kernel.target == &arpt_standard_target) {
491 if (!standard_check(t, size)) {
495 } else if (t->u.kernel.target->checkentry
496 && !t->u.kernel.target->checkentry(name, e, target, t->data,
500 duprintf("arp_tables: check failed for `%s'.\n",
501 t->u.kernel.target->name);
509 module_put(t->u.kernel.target->me);
514 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
515 struct xt_table_info *newinfo,
517 unsigned char *limit,
518 const unsigned int *hook_entries,
519 const unsigned int *underflows,
524 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0
525 || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
526 duprintf("Bad offset %p\n", e);
531 < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
532 duprintf("checking: element %p size %u\n",
537 /* Check hooks & underflows */
538 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
539 if ((unsigned char *)e - base == hook_entries[h])
540 newinfo->hook_entry[h] = hook_entries[h];
541 if ((unsigned char *)e - base == underflows[h])
542 newinfo->underflow[h] = underflows[h];
545 /* FIXME: underflows must be unconditional, standard verdicts
546 < 0 (not ARPT_RETURN). --RR */
548 /* Clear counters and comefrom */
549 e->counters = ((struct xt_counters) { 0, 0 });
556 static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i)
558 struct arpt_entry_target *t;
560 if (i && (*i)-- == 0)
563 t = arpt_get_target(e);
564 if (t->u.kernel.target->destroy)
565 t->u.kernel.target->destroy(t->u.kernel.target, t->data,
566 t->u.target_size - sizeof(*t));
567 module_put(t->u.kernel.target->me);
571 /* Checks and translates the user-supplied table segment (held in
574 static int translate_table(const char *name,
575 unsigned int valid_hooks,
576 struct xt_table_info *newinfo,
580 const unsigned int *hook_entries,
581 const unsigned int *underflows)
586 newinfo->size = size;
587 newinfo->number = number;
589 /* Init all hooks to impossible value. */
590 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
591 newinfo->hook_entry[i] = 0xFFFFFFFF;
592 newinfo->underflow[i] = 0xFFFFFFFF;
595 duprintf("translate_table: size %u\n", newinfo->size);
598 /* Walk through entries, checking offsets. */
599 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
600 check_entry_size_and_hooks,
604 hook_entries, underflows, &i);
605 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret);
610 duprintf("translate_table: %u not %u entries\n",
615 /* Check hooks all assigned */
616 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
617 /* Only hooks which are valid */
618 if (!(valid_hooks & (1 << i)))
620 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
621 duprintf("Invalid hook entry %u %u\n",
625 if (newinfo->underflow[i] == 0xFFFFFFFF) {
626 duprintf("Invalid underflow %u %u\n",
632 if (!mark_source_chains(newinfo, valid_hooks, entry0)) {
633 duprintf("Looping hook\n");
637 /* Finally, each sanity check must pass */
639 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
640 check_entry, name, size, &i);
643 ARPT_ENTRY_ITERATE(entry0, newinfo->size,
648 /* And one copy for every other CPU */
650 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
651 memcpy(newinfo->entries[i], entry0, newinfo->size);
658 static inline int add_entry_to_counter(const struct arpt_entry *e,
659 struct xt_counters total[],
662 ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
668 static inline int set_entry_to_counter(const struct arpt_entry *e,
669 struct xt_counters total[],
672 SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
678 static void get_counters(const struct xt_table_info *t,
679 struct xt_counters counters[])
685 /* Instead of clearing (by a previous call to memset())
686 * the counters and using adds, we set the counters
687 * with data used by 'current' CPU
688 * We dont care about preemption here.
690 curcpu = raw_smp_processor_id();
693 ARPT_ENTRY_ITERATE(t->entries[curcpu],
695 set_entry_to_counter,
703 ARPT_ENTRY_ITERATE(t->entries[cpu],
705 add_entry_to_counter,
711 static int copy_entries_to_user(unsigned int total_size,
712 struct arpt_table *table,
713 void __user *userptr)
715 unsigned int off, num, countersize;
716 struct arpt_entry *e;
717 struct xt_counters *counters;
718 struct xt_table_info *private = table->private;
722 /* We need atomic snapshot of counters: rest doesn't change
723 * (other than comefrom, which userspace doesn't care
726 countersize = sizeof(struct xt_counters) * private->number;
727 counters = vmalloc_node(countersize, numa_node_id());
729 if (counters == NULL)
732 /* First, sum counters... */
733 write_lock_bh(&table->lock);
734 get_counters(private, counters);
735 write_unlock_bh(&table->lock);
737 loc_cpu_entry = private->entries[raw_smp_processor_id()];
738 /* ... then copy entire thing ... */
739 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
744 /* FIXME: use iterator macros --RR */
745 /* ... then go back and fix counters and names */
746 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
747 struct arpt_entry_target *t;
749 e = (struct arpt_entry *)(loc_cpu_entry + off);
750 if (copy_to_user(userptr + off
751 + offsetof(struct arpt_entry, counters),
753 sizeof(counters[num])) != 0) {
758 t = arpt_get_target(e);
759 if (copy_to_user(userptr + off + e->target_offset
760 + offsetof(struct arpt_entry_target,
762 t->u.kernel.target->name,
763 strlen(t->u.kernel.target->name)+1) != 0) {
774 static int get_entries(const struct arpt_get_entries *entries,
775 struct arpt_get_entries __user *uptr)
778 struct arpt_table *t;
780 t = xt_find_table_lock(NF_ARP, entries->name);
781 if (t && !IS_ERR(t)) {
782 struct xt_table_info *private = t->private;
783 duprintf("t->private->number = %u\n",
785 if (entries->size == private->size)
786 ret = copy_entries_to_user(private->size,
787 t, uptr->entrytable);
789 duprintf("get_entries: I've got %u not %u!\n",
790 private->size, entries->size);
796 ret = t ? PTR_ERR(t) : -ENOENT;
801 static int do_replace(void __user *user, unsigned int len)
804 struct arpt_replace tmp;
805 struct arpt_table *t;
806 struct xt_table_info *newinfo, *oldinfo;
807 struct xt_counters *counters;
808 void *loc_cpu_entry, *loc_cpu_old_entry;
810 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
813 /* Hack: Causes ipchains to give correct error msg --RR */
814 if (len != sizeof(tmp) + tmp.size)
818 if (tmp.size >= (INT_MAX - sizeof(struct xt_table_info)) / NR_CPUS -
821 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
824 newinfo = xt_alloc_table_info(tmp.size);
828 /* choose the copy that is on our node/cpu */
829 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
830 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
836 counters = vmalloc(tmp.num_counters * sizeof(struct xt_counters));
842 ret = translate_table(tmp.name, tmp.valid_hooks,
843 newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
844 tmp.hook_entry, tmp.underflow);
846 goto free_newinfo_counters;
848 duprintf("arp_tables: Translated table\n");
850 t = try_then_request_module(xt_find_table_lock(NF_ARP, tmp.name),
851 "arptable_%s", tmp.name);
852 if (!t || IS_ERR(t)) {
853 ret = t ? PTR_ERR(t) : -ENOENT;
854 goto free_newinfo_counters_untrans;
858 if (tmp.valid_hooks != t->valid_hooks) {
859 duprintf("Valid hook crap: %08X vs %08X\n",
860 tmp.valid_hooks, t->valid_hooks);
865 oldinfo = xt_replace_table(t, tmp.num_counters, newinfo, &ret);
869 /* Update module usage count based on number of rules */
870 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
871 oldinfo->number, oldinfo->initial_entries, newinfo->number);
872 if ((oldinfo->number > oldinfo->initial_entries) ||
873 (newinfo->number <= oldinfo->initial_entries))
875 if ((oldinfo->number > oldinfo->initial_entries) &&
876 (newinfo->number <= oldinfo->initial_entries))
879 /* Get the old counters. */
880 get_counters(oldinfo, counters);
881 /* Decrease module usage counts and free resource */
882 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
883 ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,NULL);
885 xt_free_table_info(oldinfo);
886 if (copy_to_user(tmp.counters, counters,
887 sizeof(struct xt_counters) * tmp.num_counters) != 0)
896 free_newinfo_counters_untrans:
897 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
898 free_newinfo_counters:
901 xt_free_table_info(newinfo);
905 /* We're lazy, and add to the first CPU; overflow works its fey magic
906 * and everything is OK.
908 static inline int add_counter_to_entry(struct arpt_entry *e,
909 const struct xt_counters addme[],
913 ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);
919 static int do_add_counters(void __user *user, unsigned int len)
922 struct xt_counters_info tmp, *paddc;
923 struct arpt_table *t;
924 struct xt_table_info *private;
928 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
931 if (len != sizeof(tmp) + tmp.num_counters*sizeof(struct xt_counters))
934 paddc = vmalloc(len);
938 if (copy_from_user(paddc, user, len) != 0) {
943 t = xt_find_table_lock(NF_ARP, tmp.name);
944 if (!t || IS_ERR(t)) {
945 ret = t ? PTR_ERR(t) : -ENOENT;
949 write_lock_bh(&t->lock);
950 private = t->private;
951 if (private->number != paddc->num_counters) {
957 /* Choose the copy that is on our node */
958 loc_cpu_entry = private->entries[smp_processor_id()];
959 ARPT_ENTRY_ITERATE(loc_cpu_entry,
961 add_counter_to_entry,
965 write_unlock_bh(&t->lock);
974 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
978 if (!capable(CAP_NET_ADMIN))
982 case ARPT_SO_SET_REPLACE:
983 ret = do_replace(user, len);
986 case ARPT_SO_SET_ADD_COUNTERS:
987 ret = do_add_counters(user, len);
991 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
998 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1002 if (!capable(CAP_NET_ADMIN))
1006 case ARPT_SO_GET_INFO: {
1007 char name[ARPT_TABLE_MAXNAMELEN];
1008 struct arpt_table *t;
1010 if (*len != sizeof(struct arpt_getinfo)) {
1011 duprintf("length %u != %Zu\n", *len,
1012 sizeof(struct arpt_getinfo));
1017 if (copy_from_user(name, user, sizeof(name)) != 0) {
1021 name[ARPT_TABLE_MAXNAMELEN-1] = '\0';
1023 t = try_then_request_module(xt_find_table_lock(NF_ARP, name),
1024 "arptable_%s", name);
1025 if (t && !IS_ERR(t)) {
1026 struct arpt_getinfo info;
1027 struct xt_table_info *private = t->private;
1029 info.valid_hooks = t->valid_hooks;
1030 memcpy(info.hook_entry, private->hook_entry,
1031 sizeof(info.hook_entry));
1032 memcpy(info.underflow, private->underflow,
1033 sizeof(info.underflow));
1034 info.num_entries = private->number;
1035 info.size = private->size;
1036 strcpy(info.name, name);
1038 if (copy_to_user(user, &info, *len) != 0)
1045 ret = t ? PTR_ERR(t) : -ENOENT;
1049 case ARPT_SO_GET_ENTRIES: {
1050 struct arpt_get_entries get;
1052 if (*len < sizeof(get)) {
1053 duprintf("get_entries: %u < %Zu\n", *len, sizeof(get));
1055 } else if (copy_from_user(&get, user, sizeof(get)) != 0) {
1057 } else if (*len != sizeof(struct arpt_get_entries) + get.size) {
1058 duprintf("get_entries: %u != %Zu\n", *len,
1059 sizeof(struct arpt_get_entries) + get.size);
1062 ret = get_entries(&get, user);
1066 case ARPT_SO_GET_REVISION_TARGET: {
1067 struct xt_get_revision rev;
1069 if (*len != sizeof(rev)) {
1073 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1078 try_then_request_module(xt_find_revision(NF_ARP, rev.name,
1079 rev.revision, 1, &ret),
1080 "arpt_%s", rev.name);
1085 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd);
1092 int arpt_register_table(struct arpt_table *table,
1093 const struct arpt_replace *repl)
1096 struct xt_table_info *newinfo;
1097 static struct xt_table_info bootstrap
1098 = { 0, 0, 0, { 0 }, { 0 }, { } };
1099 void *loc_cpu_entry;
1101 newinfo = xt_alloc_table_info(repl->size);
1107 /* choose the copy on our node/cpu */
1108 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1109 memcpy(loc_cpu_entry, repl->entries, repl->size);
1111 ret = translate_table(table->name, table->valid_hooks,
1112 newinfo, loc_cpu_entry, repl->size,
1117 duprintf("arpt_register_table: translate table gives %d\n", ret);
1119 xt_free_table_info(newinfo);
1123 if (xt_register_table(table, &bootstrap, newinfo) != 0) {
1124 xt_free_table_info(newinfo);
1131 void arpt_unregister_table(struct arpt_table *table)
1133 struct xt_table_info *private;
1134 void *loc_cpu_entry;
1136 private = xt_unregister_table(table);
1138 /* Decrease module usage counts and free resources */
1139 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1140 ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size,
1141 cleanup_entry, NULL);
1142 xt_free_table_info(private);
1145 /* The built-in targets: standard (NULL) and error. */
1146 static struct arpt_target arpt_standard_target = {
1147 .name = ARPT_STANDARD_TARGET,
1148 .targetsize = sizeof(int),
1152 static struct arpt_target arpt_error_target = {
1153 .name = ARPT_ERROR_TARGET,
1154 .target = arpt_error,
1155 .targetsize = ARPT_FUNCTION_MAXNAMELEN,
1159 static struct nf_sockopt_ops arpt_sockopts = {
1161 .set_optmin = ARPT_BASE_CTL,
1162 .set_optmax = ARPT_SO_SET_MAX+1,
1163 .set = do_arpt_set_ctl,
1164 .get_optmin = ARPT_BASE_CTL,
1165 .get_optmax = ARPT_SO_GET_MAX+1,
1166 .get = do_arpt_get_ctl,
1169 static int __init arp_tables_init(void)
1173 xt_proto_init(NF_ARP);
1175 /* Noone else will be downing sem now, so we won't sleep */
1176 xt_register_target(&arpt_standard_target);
1177 xt_register_target(&arpt_error_target);
1179 /* Register setsockopt */
1180 ret = nf_register_sockopt(&arpt_sockopts);
1182 duprintf("Unable to register sockopts.\n");
1186 printk("arp_tables: (C) 2002 David S. Miller\n");
1190 static void __exit arp_tables_fini(void)
1192 nf_unregister_sockopt(&arpt_sockopts);
1193 xt_proto_fini(NF_ARP);
1196 EXPORT_SYMBOL(arpt_register_table);
1197 EXPORT_SYMBOL(arpt_unregister_table);
1198 EXPORT_SYMBOL(arpt_do_table);
1200 module_init(arp_tables_init);
1201 module_exit(arp_tables_fini);