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>
23 #include <asm/uaccess.h>
24 #include <linux/mutex.h>
26 #include <linux/netfilter/x_tables.h>
27 #include <linux/netfilter_arp/arp_tables.h>
29 MODULE_LICENSE("GPL");
30 MODULE_AUTHOR("David S. Miller <davem@redhat.com>");
31 MODULE_DESCRIPTION("arptables core");
33 /*#define DEBUG_ARP_TABLES*/
34 /*#define DEBUG_ARP_TABLES_USER*/
36 #ifdef DEBUG_ARP_TABLES
37 #define dprintf(format, args...) printk(format , ## args)
39 #define dprintf(format, args...)
42 #ifdef DEBUG_ARP_TABLES_USER
43 #define duprintf(format, args...) printk(format , ## args)
45 #define duprintf(format, args...)
48 #ifdef CONFIG_NETFILTER_DEBUG
49 #define ARP_NF_ASSERT(x) \
52 printk("ARP_NF_ASSERT: %s:%s:%u\n", \
53 __FUNCTION__, __FILE__, __LINE__); \
56 #define ARP_NF_ASSERT(x)
59 #include <linux/netfilter_ipv4/listhelp.h>
61 static inline int arp_devaddr_compare(const struct arpt_devaddr_info *ap,
62 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];
76 /* Returns whether packet matches rule or not. */
77 static inline int arp_packet_match(const struct arphdr *arphdr,
78 struct net_device *dev,
81 const struct arpt_arp *arpinfo)
83 char *arpptr = (char *)(arphdr + 1);
84 char *src_devaddr, *tgt_devaddr;
85 u32 src_ipaddr, tgt_ipaddr;
88 #define FWINV(bool,invflg) ((bool) ^ !!(arpinfo->invflags & invflg))
90 if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop,
92 dprintf("ARP operation field mismatch.\n");
93 dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n",
94 arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask);
98 if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd,
100 dprintf("ARP hardware address format mismatch.\n");
101 dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n",
102 arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask);
106 if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro,
108 dprintf("ARP protocol address format mismatch.\n");
109 dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n",
110 arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask);
114 if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln,
116 dprintf("ARP hardware address length mismatch.\n");
117 dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n",
118 arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask);
122 src_devaddr = arpptr;
123 arpptr += dev->addr_len;
124 memcpy(&src_ipaddr, arpptr, sizeof(u32));
125 arpptr += sizeof(u32);
126 tgt_devaddr = arpptr;
127 arpptr += dev->addr_len;
128 memcpy(&tgt_ipaddr, arpptr, sizeof(u32));
130 if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len),
131 ARPT_INV_SRCDEVADDR) ||
132 FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len),
133 ARPT_INV_TGTDEVADDR)) {
134 dprintf("Source or target device address mismatch.\n");
139 if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr,
141 FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr),
143 dprintf("Source or target IP address mismatch.\n");
145 dprintf("SRC: %u.%u.%u.%u. Mask: %u.%u.%u.%u. Target: %u.%u.%u.%u.%s\n",
147 NIPQUAD(arpinfo->smsk.s_addr),
148 NIPQUAD(arpinfo->src.s_addr),
149 arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : "");
150 dprintf("TGT: %u.%u.%u.%u Mask: %u.%u.%u.%u Target: %u.%u.%u.%u.%s\n",
152 NIPQUAD(arpinfo->tmsk.s_addr),
153 NIPQUAD(arpinfo->tgt.s_addr),
154 arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : "");
158 /* Look for ifname matches. */
159 for (i = 0, ret = 0; i < IFNAMSIZ; i++) {
160 ret |= (indev[i] ^ arpinfo->iniface[i])
161 & arpinfo->iniface_mask[i];
164 if (FWINV(ret != 0, ARPT_INV_VIA_IN)) {
165 dprintf("VIA in mismatch (%s vs %s).%s\n",
166 indev, arpinfo->iniface,
167 arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":"");
171 for (i = 0, ret = 0; i < IFNAMSIZ/sizeof(unsigned long); i++) {
173 memcpy(&odev, outdev + i*sizeof(unsigned long),
174 sizeof(unsigned long));
176 ^ ((const unsigned long *)arpinfo->outiface)[i])
177 & ((const unsigned long *)arpinfo->outiface_mask)[i];
180 if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) {
181 dprintf("VIA out mismatch (%s vs %s).%s\n",
182 outdev, arpinfo->outiface,
183 arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":"");
190 static inline int arp_checkentry(const struct arpt_arp *arp)
192 if (arp->flags & ~ARPT_F_MASK) {
193 duprintf("Unknown flag bits set: %08X\n",
194 arp->flags & ~ARPT_F_MASK);
197 if (arp->invflags & ~ARPT_INV_MASK) {
198 duprintf("Unknown invflag bits set: %08X\n",
199 arp->invflags & ~ARPT_INV_MASK);
206 static unsigned int arpt_error(struct sk_buff **pskb,
207 const struct net_device *in,
208 const struct net_device *out,
209 unsigned int hooknum,
210 const struct xt_target *target,
211 const void *targinfo)
214 printk("arp_tables: error: '%s'\n", (char *)targinfo);
219 static inline struct arpt_entry *get_entry(void *base, unsigned int offset)
221 return (struct arpt_entry *)(base + offset);
224 unsigned int arpt_do_table(struct sk_buff **pskb,
226 const struct net_device *in,
227 const struct net_device *out,
228 struct arpt_table *table)
230 static const char nulldevname[IFNAMSIZ];
231 unsigned int verdict = NF_DROP;
234 struct arpt_entry *e, *back;
235 const char *indev, *outdev;
237 struct xt_table_info *private;
239 /* ARP header, plus 2 device addresses, plus 2 IP addresses. */
240 if (!pskb_may_pull((*pskb), (sizeof(struct arphdr) +
241 (2 * (*pskb)->dev->addr_len) +
245 indev = in ? in->name : nulldevname;
246 outdev = out ? out->name : nulldevname;
248 read_lock_bh(&table->lock);
249 private = table->private;
250 table_base = (void *)private->entries[smp_processor_id()];
251 e = get_entry(table_base, private->hook_entry[hook]);
252 back = get_entry(table_base, private->underflow[hook]);
254 arp = (*pskb)->nh.arph;
256 if (arp_packet_match(arp, (*pskb)->dev, indev, outdev, &e->arp)) {
257 struct arpt_entry_target *t;
260 hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) +
261 (2 * (*pskb)->dev->addr_len);
262 ADD_COUNTER(e->counters, hdr_len, 1);
264 t = arpt_get_target(e);
266 /* Standard target? */
267 if (!t->u.kernel.target->target) {
270 v = ((struct arpt_standard_target *)t)->verdict;
272 /* Pop from stack? */
273 if (v != ARPT_RETURN) {
274 verdict = (unsigned)(-v) - 1;
278 back = get_entry(table_base,
283 != (void *)e + e->next_offset) {
284 /* Save old back ptr in next entry */
285 struct arpt_entry *next
286 = (void *)e + e->next_offset;
288 (void *)back - table_base;
290 /* set back pointer to next entry */
294 e = get_entry(table_base, v);
296 /* Targets which reenter must return
299 verdict = t->u.kernel.target->target(pskb,
305 /* Target might have changed stuff. */
306 arp = (*pskb)->nh.arph;
308 if (verdict == ARPT_CONTINUE)
309 e = (void *)e + e->next_offset;
315 e = (void *)e + e->next_offset;
318 read_unlock_bh(&table->lock);
326 /* All zeroes == unconditional rule. */
327 static inline int unconditional(const struct arpt_arp *arp)
331 for (i = 0; i < sizeof(*arp)/sizeof(__u32); i++)
332 if (((__u32 *)arp)[i])
338 /* Figures out from what hook each rule can be called: returns 0 if
339 * there are loops. Puts hook bitmask in comefrom.
341 static int mark_source_chains(struct xt_table_info *newinfo,
342 unsigned int valid_hooks, void *entry0)
346 /* No recursion; use packet counter to save back ptrs (reset
347 * to 0 as we leave), and comefrom to save source hook bitmask.
349 for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) {
350 unsigned int pos = newinfo->hook_entry[hook];
352 = (struct arpt_entry *)(entry0 + pos);
354 if (!(valid_hooks & (1 << hook)))
357 /* Set initial back pointer. */
358 e->counters.pcnt = pos;
361 struct arpt_standard_target *t
362 = (void *)arpt_get_target(e);
364 if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) {
365 printk("arptables: loop hook %u pos %u %08X.\n",
366 hook, pos, e->comefrom);
370 |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS));
372 /* Unconditional return/END. */
373 if (e->target_offset == sizeof(struct arpt_entry)
374 && (strcmp(t->target.u.user.name,
375 ARPT_STANDARD_TARGET) == 0)
377 && unconditional(&e->arp)) {
378 unsigned int oldpos, size;
380 /* Return: backtrack through the last
384 e->comefrom ^= (1<<NF_ARP_NUMHOOKS);
386 pos = e->counters.pcnt;
387 e->counters.pcnt = 0;
389 /* We're at the start. */
393 e = (struct arpt_entry *)
395 } while (oldpos == pos + e->next_offset);
398 size = e->next_offset;
399 e = (struct arpt_entry *)
400 (entry0 + pos + size);
401 e->counters.pcnt = pos;
404 int newpos = t->verdict;
406 if (strcmp(t->target.u.user.name,
407 ARPT_STANDARD_TARGET) == 0
409 /* This a jump; chase it. */
410 duprintf("Jump rule %u -> %u\n",
413 /* ... this is a fallthru */
414 newpos = pos + e->next_offset;
416 e = (struct arpt_entry *)
418 e->counters.pcnt = pos;
423 duprintf("Finished chain %u\n", hook);
428 static inline int standard_check(const struct arpt_entry_target *t,
429 unsigned int max_offset)
431 struct arpt_standard_target *targ = (void *)t;
433 /* Check standard info. */
435 != ARPT_ALIGN(sizeof(struct arpt_standard_target))) {
436 duprintf("arpt_standard_check: target size %u != %Zu\n",
438 ARPT_ALIGN(sizeof(struct arpt_standard_target)));
442 if (targ->verdict >= 0
443 && targ->verdict > max_offset - sizeof(struct arpt_entry)) {
444 duprintf("arpt_standard_check: bad verdict (%i)\n",
449 if (targ->verdict < -NF_MAX_VERDICT - 1) {
450 duprintf("arpt_standard_check: bad negative verdict (%i)\n",
457 static struct arpt_target arpt_standard_target;
459 static inline int check_entry(struct arpt_entry *e, const char *name, unsigned int size,
462 struct arpt_entry_target *t;
463 struct arpt_target *target;
466 if (!arp_checkentry(&e->arp)) {
467 duprintf("arp_tables: arp check failed %p %s.\n", e, name);
471 t = arpt_get_target(e);
472 target = try_then_request_module(xt_find_target(NF_ARP, t->u.user.name,
474 "arpt_%s", t->u.user.name);
475 if (IS_ERR(target) || !target) {
476 duprintf("check_entry: `%s' not found\n", t->u.user.name);
477 ret = target ? PTR_ERR(target) : -ENOENT;
480 t->u.kernel.target = target;
482 ret = xt_check_target(target, NF_ARP, t->u.target_size - sizeof(*t),
483 name, e->comefrom, 0, 0);
487 if (t->u.kernel.target == &arpt_standard_target) {
488 if (!standard_check(t, size)) {
492 } else if (t->u.kernel.target->checkentry
493 && !t->u.kernel.target->checkentry(name, e, target, t->data,
497 duprintf("arp_tables: check failed for `%s'.\n",
498 t->u.kernel.target->name);
506 module_put(t->u.kernel.target->me);
511 static inline int check_entry_size_and_hooks(struct arpt_entry *e,
512 struct xt_table_info *newinfo,
514 unsigned char *limit,
515 const unsigned int *hook_entries,
516 const unsigned int *underflows,
521 if ((unsigned long)e % __alignof__(struct arpt_entry) != 0
522 || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) {
523 duprintf("Bad offset %p\n", e);
528 < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
529 duprintf("checking: element %p size %u\n",
534 /* Check hooks & underflows */
535 for (h = 0; h < NF_ARP_NUMHOOKS; h++) {
536 if ((unsigned char *)e - base == hook_entries[h])
537 newinfo->hook_entry[h] = hook_entries[h];
538 if ((unsigned char *)e - base == underflows[h])
539 newinfo->underflow[h] = underflows[h];
542 /* FIXME: underflows must be unconditional, standard verdicts
543 < 0 (not ARPT_RETURN). --RR */
545 /* Clear counters and comefrom */
546 e->counters = ((struct xt_counters) { 0, 0 });
553 static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i)
555 struct arpt_entry_target *t;
557 if (i && (*i)-- == 0)
560 t = arpt_get_target(e);
561 if (t->u.kernel.target->destroy)
562 t->u.kernel.target->destroy(t->u.kernel.target, t->data,
563 t->u.target_size - sizeof(*t));
564 module_put(t->u.kernel.target->me);
568 /* Checks and translates the user-supplied table segment (held in
571 static int translate_table(const char *name,
572 unsigned int valid_hooks,
573 struct xt_table_info *newinfo,
577 const unsigned int *hook_entries,
578 const unsigned int *underflows)
583 newinfo->size = size;
584 newinfo->number = number;
586 /* Init all hooks to impossible value. */
587 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
588 newinfo->hook_entry[i] = 0xFFFFFFFF;
589 newinfo->underflow[i] = 0xFFFFFFFF;
592 duprintf("translate_table: size %u\n", newinfo->size);
595 /* Walk through entries, checking offsets. */
596 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
597 check_entry_size_and_hooks,
601 hook_entries, underflows, &i);
602 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret);
607 duprintf("translate_table: %u not %u entries\n",
612 /* Check hooks all assigned */
613 for (i = 0; i < NF_ARP_NUMHOOKS; i++) {
614 /* Only hooks which are valid */
615 if (!(valid_hooks & (1 << i)))
617 if (newinfo->hook_entry[i] == 0xFFFFFFFF) {
618 duprintf("Invalid hook entry %u %u\n",
622 if (newinfo->underflow[i] == 0xFFFFFFFF) {
623 duprintf("Invalid underflow %u %u\n",
629 if (!mark_source_chains(newinfo, valid_hooks, entry0)) {
630 duprintf("Looping hook\n");
634 /* Finally, each sanity check must pass */
636 ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size,
637 check_entry, name, size, &i);
640 ARPT_ENTRY_ITERATE(entry0, newinfo->size,
645 /* And one copy for every other CPU */
646 for_each_possible_cpu(i) {
647 if (newinfo->entries[i] && newinfo->entries[i] != entry0)
648 memcpy(newinfo->entries[i], entry0, newinfo->size);
655 static inline int add_entry_to_counter(const struct arpt_entry *e,
656 struct xt_counters total[],
659 ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
665 static inline int set_entry_to_counter(const struct arpt_entry *e,
666 struct xt_counters total[],
669 SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt);
675 static void get_counters(const struct xt_table_info *t,
676 struct xt_counters counters[])
682 /* Instead of clearing (by a previous call to memset())
683 * the counters and using adds, we set the counters
684 * with data used by 'current' CPU
685 * We dont care about preemption here.
687 curcpu = raw_smp_processor_id();
690 ARPT_ENTRY_ITERATE(t->entries[curcpu],
692 set_entry_to_counter,
696 for_each_possible_cpu(cpu) {
700 ARPT_ENTRY_ITERATE(t->entries[cpu],
702 add_entry_to_counter,
708 static int copy_entries_to_user(unsigned int total_size,
709 struct arpt_table *table,
710 void __user *userptr)
712 unsigned int off, num, countersize;
713 struct arpt_entry *e;
714 struct xt_counters *counters;
715 struct xt_table_info *private = table->private;
719 /* We need atomic snapshot of counters: rest doesn't change
720 * (other than comefrom, which userspace doesn't care
723 countersize = sizeof(struct xt_counters) * private->number;
724 counters = vmalloc_node(countersize, numa_node_id());
726 if (counters == NULL)
729 /* First, sum counters... */
730 write_lock_bh(&table->lock);
731 get_counters(private, counters);
732 write_unlock_bh(&table->lock);
734 loc_cpu_entry = private->entries[raw_smp_processor_id()];
735 /* ... then copy entire thing ... */
736 if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) {
741 /* FIXME: use iterator macros --RR */
742 /* ... then go back and fix counters and names */
743 for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
744 struct arpt_entry_target *t;
746 e = (struct arpt_entry *)(loc_cpu_entry + off);
747 if (copy_to_user(userptr + off
748 + offsetof(struct arpt_entry, counters),
750 sizeof(counters[num])) != 0) {
755 t = arpt_get_target(e);
756 if (copy_to_user(userptr + off + e->target_offset
757 + offsetof(struct arpt_entry_target,
759 t->u.kernel.target->name,
760 strlen(t->u.kernel.target->name)+1) != 0) {
771 static int get_entries(const struct arpt_get_entries *entries,
772 struct arpt_get_entries __user *uptr)
775 struct arpt_table *t;
777 t = xt_find_table_lock(NF_ARP, entries->name);
778 if (t && !IS_ERR(t)) {
779 struct xt_table_info *private = t->private;
780 duprintf("t->private->number = %u\n",
782 if (entries->size == private->size)
783 ret = copy_entries_to_user(private->size,
784 t, uptr->entrytable);
786 duprintf("get_entries: I've got %u not %u!\n",
787 private->size, entries->size);
793 ret = t ? PTR_ERR(t) : -ENOENT;
798 static int do_replace(void __user *user, unsigned int len)
801 struct arpt_replace tmp;
802 struct arpt_table *t;
803 struct xt_table_info *newinfo, *oldinfo;
804 struct xt_counters *counters;
805 void *loc_cpu_entry, *loc_cpu_old_entry;
807 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
810 /* Hack: Causes ipchains to give correct error msg --RR */
811 if (len != sizeof(tmp) + tmp.size)
815 if (tmp.size >= (INT_MAX - sizeof(struct xt_table_info)) / NR_CPUS -
818 if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters))
821 newinfo = xt_alloc_table_info(tmp.size);
825 /* choose the copy that is on our node/cpu */
826 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
827 if (copy_from_user(loc_cpu_entry, user + sizeof(tmp),
833 counters = vmalloc(tmp.num_counters * sizeof(struct xt_counters));
839 ret = translate_table(tmp.name, tmp.valid_hooks,
840 newinfo, loc_cpu_entry, tmp.size, tmp.num_entries,
841 tmp.hook_entry, tmp.underflow);
843 goto free_newinfo_counters;
845 duprintf("arp_tables: Translated table\n");
847 t = try_then_request_module(xt_find_table_lock(NF_ARP, tmp.name),
848 "arptable_%s", tmp.name);
849 if (!t || IS_ERR(t)) {
850 ret = t ? PTR_ERR(t) : -ENOENT;
851 goto free_newinfo_counters_untrans;
855 if (tmp.valid_hooks != t->valid_hooks) {
856 duprintf("Valid hook crap: %08X vs %08X\n",
857 tmp.valid_hooks, t->valid_hooks);
862 oldinfo = xt_replace_table(t, tmp.num_counters, newinfo, &ret);
866 /* Update module usage count based on number of rules */
867 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
868 oldinfo->number, oldinfo->initial_entries, newinfo->number);
869 if ((oldinfo->number > oldinfo->initial_entries) ||
870 (newinfo->number <= oldinfo->initial_entries))
872 if ((oldinfo->number > oldinfo->initial_entries) &&
873 (newinfo->number <= oldinfo->initial_entries))
876 /* Get the old counters. */
877 get_counters(oldinfo, counters);
878 /* Decrease module usage counts and free resource */
879 loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()];
880 ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,NULL);
882 xt_free_table_info(oldinfo);
883 if (copy_to_user(tmp.counters, counters,
884 sizeof(struct xt_counters) * tmp.num_counters) != 0)
893 free_newinfo_counters_untrans:
894 ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL);
895 free_newinfo_counters:
898 xt_free_table_info(newinfo);
902 /* We're lazy, and add to the first CPU; overflow works its fey magic
903 * and everything is OK.
905 static inline int add_counter_to_entry(struct arpt_entry *e,
906 const struct xt_counters addme[],
910 ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt);
916 static int do_add_counters(void __user *user, unsigned int len)
919 struct xt_counters_info tmp, *paddc;
920 struct arpt_table *t;
921 struct xt_table_info *private;
925 if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
928 if (len != sizeof(tmp) + tmp.num_counters*sizeof(struct xt_counters))
931 paddc = vmalloc(len);
935 if (copy_from_user(paddc, user, len) != 0) {
940 t = xt_find_table_lock(NF_ARP, tmp.name);
941 if (!t || IS_ERR(t)) {
942 ret = t ? PTR_ERR(t) : -ENOENT;
946 write_lock_bh(&t->lock);
947 private = t->private;
948 if (private->number != tmp.num_counters) {
954 /* Choose the copy that is on our node */
955 loc_cpu_entry = private->entries[smp_processor_id()];
956 ARPT_ENTRY_ITERATE(loc_cpu_entry,
958 add_counter_to_entry,
962 write_unlock_bh(&t->lock);
971 static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len)
975 if (!capable(CAP_NET_ADMIN))
979 case ARPT_SO_SET_REPLACE:
980 ret = do_replace(user, len);
983 case ARPT_SO_SET_ADD_COUNTERS:
984 ret = do_add_counters(user, len);
988 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd);
995 static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
999 if (!capable(CAP_NET_ADMIN))
1003 case ARPT_SO_GET_INFO: {
1004 char name[ARPT_TABLE_MAXNAMELEN];
1005 struct arpt_table *t;
1007 if (*len != sizeof(struct arpt_getinfo)) {
1008 duprintf("length %u != %Zu\n", *len,
1009 sizeof(struct arpt_getinfo));
1014 if (copy_from_user(name, user, sizeof(name)) != 0) {
1018 name[ARPT_TABLE_MAXNAMELEN-1] = '\0';
1020 t = try_then_request_module(xt_find_table_lock(NF_ARP, name),
1021 "arptable_%s", name);
1022 if (t && !IS_ERR(t)) {
1023 struct arpt_getinfo info;
1024 struct xt_table_info *private = t->private;
1026 info.valid_hooks = t->valid_hooks;
1027 memcpy(info.hook_entry, private->hook_entry,
1028 sizeof(info.hook_entry));
1029 memcpy(info.underflow, private->underflow,
1030 sizeof(info.underflow));
1031 info.num_entries = private->number;
1032 info.size = private->size;
1033 strcpy(info.name, name);
1035 if (copy_to_user(user, &info, *len) != 0)
1042 ret = t ? PTR_ERR(t) : -ENOENT;
1046 case ARPT_SO_GET_ENTRIES: {
1047 struct arpt_get_entries get;
1049 if (*len < sizeof(get)) {
1050 duprintf("get_entries: %u < %Zu\n", *len, sizeof(get));
1052 } else if (copy_from_user(&get, user, sizeof(get)) != 0) {
1054 } else if (*len != sizeof(struct arpt_get_entries) + get.size) {
1055 duprintf("get_entries: %u != %Zu\n", *len,
1056 sizeof(struct arpt_get_entries) + get.size);
1059 ret = get_entries(&get, user);
1063 case ARPT_SO_GET_REVISION_TARGET: {
1064 struct xt_get_revision rev;
1066 if (*len != sizeof(rev)) {
1070 if (copy_from_user(&rev, user, sizeof(rev)) != 0) {
1075 try_then_request_module(xt_find_revision(NF_ARP, rev.name,
1076 rev.revision, 1, &ret),
1077 "arpt_%s", rev.name);
1082 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd);
1089 int arpt_register_table(struct arpt_table *table,
1090 const struct arpt_replace *repl)
1093 struct xt_table_info *newinfo;
1094 static struct xt_table_info bootstrap
1095 = { 0, 0, 0, { 0 }, { 0 }, { } };
1096 void *loc_cpu_entry;
1098 newinfo = xt_alloc_table_info(repl->size);
1104 /* choose the copy on our node/cpu */
1105 loc_cpu_entry = newinfo->entries[raw_smp_processor_id()];
1106 memcpy(loc_cpu_entry, repl->entries, repl->size);
1108 ret = translate_table(table->name, table->valid_hooks,
1109 newinfo, loc_cpu_entry, repl->size,
1114 duprintf("arpt_register_table: translate table gives %d\n", ret);
1116 xt_free_table_info(newinfo);
1120 ret = xt_register_table(table, &bootstrap, newinfo);
1122 xt_free_table_info(newinfo);
1129 void arpt_unregister_table(struct arpt_table *table)
1131 struct xt_table_info *private;
1132 void *loc_cpu_entry;
1134 private = xt_unregister_table(table);
1136 /* Decrease module usage counts and free resources */
1137 loc_cpu_entry = private->entries[raw_smp_processor_id()];
1138 ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size,
1139 cleanup_entry, NULL);
1140 xt_free_table_info(private);
1143 /* The built-in targets: standard (NULL) and error. */
1144 static struct arpt_target arpt_standard_target = {
1145 .name = ARPT_STANDARD_TARGET,
1146 .targetsize = sizeof(int),
1150 static struct arpt_target arpt_error_target = {
1151 .name = ARPT_ERROR_TARGET,
1152 .target = arpt_error,
1153 .targetsize = ARPT_FUNCTION_MAXNAMELEN,
1157 static struct nf_sockopt_ops arpt_sockopts = {
1159 .set_optmin = ARPT_BASE_CTL,
1160 .set_optmax = ARPT_SO_SET_MAX+1,
1161 .set = do_arpt_set_ctl,
1162 .get_optmin = ARPT_BASE_CTL,
1163 .get_optmax = ARPT_SO_GET_MAX+1,
1164 .get = do_arpt_get_ctl,
1167 static int __init arp_tables_init(void)
1171 ret = xt_proto_init(NF_ARP);
1175 /* Noone else will be downing sem now, so we won't sleep */
1176 ret = xt_register_target(&arpt_standard_target);
1179 ret = xt_register_target(&arpt_error_target);
1183 /* Register setsockopt */
1184 ret = nf_register_sockopt(&arpt_sockopts);
1188 printk("arp_tables: (C) 2002 David S. Miller\n");
1192 xt_unregister_target(&arpt_error_target);
1194 xt_unregister_target(&arpt_standard_target);
1196 xt_proto_fini(NF_ARP);
1201 static void __exit arp_tables_fini(void)
1203 nf_unregister_sockopt(&arpt_sockopts);
1204 xt_proto_fini(NF_ARP);
1207 EXPORT_SYMBOL(arpt_register_table);
1208 EXPORT_SYMBOL(arpt_unregister_table);
1209 EXPORT_SYMBOL(arpt_do_table);
1211 module_init(arp_tables_init);
1212 module_exit(arp_tables_fini);