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)
9 * Copyright (C) 2006-2009 Patrick McHardy <kaber@trash.net>
12 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
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>
23 #include <linux/mutex.h>
24 #include <linux/err.h>
25 #include <net/compat.h>
27 #include <asm/uaccess.h>
29 #include <linux/netfilter/x_tables.h>
30 #include <linux/netfilter_arp/arp_tables.h>
31 #include "../../netfilter/xt_repldata.h"
33 MODULE_LICENSE("GPL");
34 MODULE_AUTHOR("David S. Miller <davem@redhat.com>");
35 MODULE_DESCRIPTION("arptables core");
37 /*#define DEBUG_ARP_TABLES*/
38 /*#define DEBUG_ARP_TABLES_USER*/
40 #ifdef DEBUG_ARP_TABLES
41 #define dprintf(format, args...) printk(format , ## args)
43 #define dprintf(format, args...)
46 #ifdef DEBUG_ARP_TABLES_USER
47 #define duprintf(format, args...) printk(format , ## args)
49 #define duprintf(format, args...)
52 #ifdef CONFIG_NETFILTER_DEBUG
53 #define ARP_NF_ASSERT(x) WARN_ON(!(x))
55 #define ARP_NF_ASSERT(x)
58 void *arpt_alloc_initial_table(const struct xt_table
*info
)
60 return xt_alloc_initial_table(arpt
, ARPT
);
62 EXPORT_SYMBOL_GPL(arpt_alloc_initial_table
);
64 static inline int arp_devaddr_compare(const struct arpt_devaddr_info
*ap
,
65 const char *hdr_addr
, int len
)
69 if (len
> ARPT_DEV_ADDR_LEN_MAX
)
70 len
= ARPT_DEV_ADDR_LEN_MAX
;
73 for (i
= 0; i
< len
; i
++)
74 ret
|= (hdr_addr
[i
] ^ ap
->addr
[i
]) & ap
->mask
[i
];
80 * Unfortunately, _b and _mask are not aligned to an int (or long int)
81 * Some arches dont care, unrolling the loop is a win on them.
82 * For other arches, we only have a 16bit alignement.
84 static unsigned long ifname_compare(const char *_a
, const char *_b
, const char *_mask
)
86 #ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS
87 unsigned long ret
= ifname_compare_aligned(_a
, _b
, _mask
);
89 unsigned long ret
= 0;
90 const u16
*a
= (const u16
*)_a
;
91 const u16
*b
= (const u16
*)_b
;
92 const u16
*mask
= (const u16
*)_mask
;
95 for (i
= 0; i
< IFNAMSIZ
/sizeof(u16
); i
++)
96 ret
|= (a
[i
] ^ b
[i
]) & mask
[i
];
101 /* Returns whether packet matches rule or not. */
102 static inline int arp_packet_match(const struct arphdr
*arphdr
,
103 struct net_device
*dev
,
106 const struct arpt_arp
*arpinfo
)
108 const char *arpptr
= (char *)(arphdr
+ 1);
109 const char *src_devaddr
, *tgt_devaddr
;
110 __be32 src_ipaddr
, tgt_ipaddr
;
113 #define FWINV(bool, invflg) ((bool) ^ !!(arpinfo->invflags & (invflg)))
115 if (FWINV((arphdr
->ar_op
& arpinfo
->arpop_mask
) != arpinfo
->arpop
,
117 dprintf("ARP operation field mismatch.\n");
118 dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n",
119 arphdr
->ar_op
, arpinfo
->arpop
, arpinfo
->arpop_mask
);
123 if (FWINV((arphdr
->ar_hrd
& arpinfo
->arhrd_mask
) != arpinfo
->arhrd
,
125 dprintf("ARP hardware address format mismatch.\n");
126 dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n",
127 arphdr
->ar_hrd
, arpinfo
->arhrd
, arpinfo
->arhrd_mask
);
131 if (FWINV((arphdr
->ar_pro
& arpinfo
->arpro_mask
) != arpinfo
->arpro
,
133 dprintf("ARP protocol address format mismatch.\n");
134 dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n",
135 arphdr
->ar_pro
, arpinfo
->arpro
, arpinfo
->arpro_mask
);
139 if (FWINV((arphdr
->ar_hln
& arpinfo
->arhln_mask
) != arpinfo
->arhln
,
141 dprintf("ARP hardware address length mismatch.\n");
142 dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n",
143 arphdr
->ar_hln
, arpinfo
->arhln
, arpinfo
->arhln_mask
);
147 src_devaddr
= arpptr
;
148 arpptr
+= dev
->addr_len
;
149 memcpy(&src_ipaddr
, arpptr
, sizeof(u32
));
150 arpptr
+= sizeof(u32
);
151 tgt_devaddr
= arpptr
;
152 arpptr
+= dev
->addr_len
;
153 memcpy(&tgt_ipaddr
, arpptr
, sizeof(u32
));
155 if (FWINV(arp_devaddr_compare(&arpinfo
->src_devaddr
, src_devaddr
, dev
->addr_len
),
156 ARPT_INV_SRCDEVADDR
) ||
157 FWINV(arp_devaddr_compare(&arpinfo
->tgt_devaddr
, tgt_devaddr
, dev
->addr_len
),
158 ARPT_INV_TGTDEVADDR
)) {
159 dprintf("Source or target device address mismatch.\n");
164 if (FWINV((src_ipaddr
& arpinfo
->smsk
.s_addr
) != arpinfo
->src
.s_addr
,
166 FWINV(((tgt_ipaddr
& arpinfo
->tmsk
.s_addr
) != arpinfo
->tgt
.s_addr
),
168 dprintf("Source or target IP address mismatch.\n");
170 dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n",
172 &arpinfo
->smsk
.s_addr
,
173 &arpinfo
->src
.s_addr
,
174 arpinfo
->invflags
& ARPT_INV_SRCIP
? " (INV)" : "");
175 dprintf("TGT: %pI4 Mask: %pI4 Target: %pI4.%s\n",
177 &arpinfo
->tmsk
.s_addr
,
178 &arpinfo
->tgt
.s_addr
,
179 arpinfo
->invflags
& ARPT_INV_TGTIP
? " (INV)" : "");
183 /* Look for ifname matches. */
184 ret
= ifname_compare(indev
, arpinfo
->iniface
, arpinfo
->iniface_mask
);
186 if (FWINV(ret
!= 0, ARPT_INV_VIA_IN
)) {
187 dprintf("VIA in mismatch (%s vs %s).%s\n",
188 indev
, arpinfo
->iniface
,
189 arpinfo
->invflags
&ARPT_INV_VIA_IN
?" (INV)":"");
193 ret
= ifname_compare(outdev
, arpinfo
->outiface
, arpinfo
->outiface_mask
);
195 if (FWINV(ret
!= 0, ARPT_INV_VIA_OUT
)) {
196 dprintf("VIA out mismatch (%s vs %s).%s\n",
197 outdev
, arpinfo
->outiface
,
198 arpinfo
->invflags
&ARPT_INV_VIA_OUT
?" (INV)":"");
206 static inline int arp_checkentry(const struct arpt_arp
*arp
)
208 if (arp
->flags
& ~ARPT_F_MASK
) {
209 duprintf("Unknown flag bits set: %08X\n",
210 arp
->flags
& ~ARPT_F_MASK
);
213 if (arp
->invflags
& ~ARPT_INV_MASK
) {
214 duprintf("Unknown invflag bits set: %08X\n",
215 arp
->invflags
& ~ARPT_INV_MASK
);
223 arpt_error(struct sk_buff
*skb
, const struct xt_action_param
*par
)
225 net_err_ratelimited("arp_tables: error: '%s'\n",
226 (const char *)par
->targinfo
);
231 static inline const struct xt_entry_target
*
232 arpt_get_target_c(const struct arpt_entry
*e
)
234 return arpt_get_target((struct arpt_entry
*)e
);
237 static inline struct arpt_entry
*
238 get_entry(const void *base
, unsigned int offset
)
240 return (struct arpt_entry
*)(base
+ offset
);
244 struct arpt_entry
*arpt_next_entry(const struct arpt_entry
*entry
)
246 return (void *)entry
+ entry
->next_offset
;
249 unsigned int arpt_do_table(struct sk_buff
*skb
,
251 const struct net_device
*in
,
252 const struct net_device
*out
,
253 struct xt_table
*table
)
255 static const char nulldevname
[IFNAMSIZ
] __attribute__((aligned(sizeof(long))));
256 unsigned int verdict
= NF_DROP
;
257 const struct arphdr
*arp
;
258 struct arpt_entry
*e
, *back
;
259 const char *indev
, *outdev
;
261 const struct xt_table_info
*private;
262 struct xt_action_param acpar
;
265 if (!pskb_may_pull(skb
, arp_hdr_len(skb
->dev
)))
268 indev
= in
? in
->name
: nulldevname
;
269 outdev
= out
? out
->name
: nulldevname
;
272 addend
= xt_write_recseq_begin();
273 private = table
->private;
275 * Ensure we load private-> members after we've fetched the base
278 smp_read_barrier_depends();
279 table_base
= private->entries
[smp_processor_id()];
281 e
= get_entry(table_base
, private->hook_entry
[hook
]);
282 back
= get_entry(table_base
, private->underflow
[hook
]);
286 acpar
.hooknum
= hook
;
287 acpar
.family
= NFPROTO_ARP
;
288 acpar
.hotdrop
= false;
292 const struct xt_entry_target
*t
;
294 if (!arp_packet_match(arp
, skb
->dev
, indev
, outdev
, &e
->arp
)) {
295 e
= arpt_next_entry(e
);
299 ADD_COUNTER(e
->counters
, arp_hdr_len(skb
->dev
), 1);
301 t
= arpt_get_target_c(e
);
303 /* Standard target? */
304 if (!t
->u
.kernel
.target
->target
) {
307 v
= ((struct xt_standard_target
*)t
)->verdict
;
309 /* Pop from stack? */
310 if (v
!= XT_RETURN
) {
311 verdict
= (unsigned int)(-v
) - 1;
315 back
= get_entry(table_base
, back
->comefrom
);
319 != arpt_next_entry(e
)) {
320 /* Save old back ptr in next entry */
321 struct arpt_entry
*next
= arpt_next_entry(e
);
322 next
->comefrom
= (void *)back
- table_base
;
324 /* set back pointer to next entry */
328 e
= get_entry(table_base
, v
);
332 /* Targets which reenter must return
335 acpar
.target
= t
->u
.kernel
.target
;
336 acpar
.targinfo
= t
->data
;
337 verdict
= t
->u
.kernel
.target
->target(skb
, &acpar
);
339 /* Target might have changed stuff. */
342 if (verdict
== XT_CONTINUE
)
343 e
= arpt_next_entry(e
);
347 } while (!acpar
.hotdrop
);
348 xt_write_recseq_end(addend
);
357 /* All zeroes == unconditional rule. */
358 static inline bool unconditional(const struct arpt_arp
*arp
)
360 static const struct arpt_arp uncond
;
362 return memcmp(arp
, &uncond
, sizeof(uncond
)) == 0;
365 /* Figures out from what hook each rule can be called: returns 0 if
366 * there are loops. Puts hook bitmask in comefrom.
368 static int mark_source_chains(const struct xt_table_info
*newinfo
,
369 unsigned int valid_hooks
, void *entry0
)
373 /* No recursion; use packet counter to save back ptrs (reset
374 * to 0 as we leave), and comefrom to save source hook bitmask.
376 for (hook
= 0; hook
< NF_ARP_NUMHOOKS
; hook
++) {
377 unsigned int pos
= newinfo
->hook_entry
[hook
];
379 = (struct arpt_entry
*)(entry0
+ pos
);
381 if (!(valid_hooks
& (1 << hook
)))
384 /* Set initial back pointer. */
385 e
->counters
.pcnt
= pos
;
388 const struct xt_standard_target
*t
389 = (void *)arpt_get_target_c(e
);
390 int visited
= e
->comefrom
& (1 << hook
);
392 if (e
->comefrom
& (1 << NF_ARP_NUMHOOKS
)) {
393 pr_notice("arptables: loop hook %u pos %u %08X.\n",
394 hook
, pos
, e
->comefrom
);
398 |= ((1 << hook
) | (1 << NF_ARP_NUMHOOKS
));
400 /* Unconditional return/END. */
401 if ((e
->target_offset
== sizeof(struct arpt_entry
) &&
402 (strcmp(t
->target
.u
.user
.name
,
403 XT_STANDARD_TARGET
) == 0) &&
404 t
->verdict
< 0 && unconditional(&e
->arp
)) ||
406 unsigned int oldpos
, size
;
408 if ((strcmp(t
->target
.u
.user
.name
,
409 XT_STANDARD_TARGET
) == 0) &&
410 t
->verdict
< -NF_MAX_VERDICT
- 1) {
411 duprintf("mark_source_chains: bad "
412 "negative verdict (%i)\n",
417 /* Return: backtrack through the last
421 e
->comefrom
^= (1<<NF_ARP_NUMHOOKS
);
423 pos
= e
->counters
.pcnt
;
424 e
->counters
.pcnt
= 0;
426 /* We're at the start. */
430 e
= (struct arpt_entry
*)
432 } while (oldpos
== pos
+ e
->next_offset
);
435 size
= e
->next_offset
;
436 e
= (struct arpt_entry
*)
437 (entry0
+ pos
+ size
);
438 e
->counters
.pcnt
= pos
;
441 int newpos
= t
->verdict
;
443 if (strcmp(t
->target
.u
.user
.name
,
444 XT_STANDARD_TARGET
) == 0 &&
446 if (newpos
> newinfo
->size
-
447 sizeof(struct arpt_entry
)) {
448 duprintf("mark_source_chains: "
449 "bad verdict (%i)\n",
454 /* This a jump; chase it. */
455 duprintf("Jump rule %u -> %u\n",
458 /* ... this is a fallthru */
459 newpos
= pos
+ e
->next_offset
;
461 e
= (struct arpt_entry
*)
463 e
->counters
.pcnt
= pos
;
468 duprintf("Finished chain %u\n", hook
);
473 static inline int check_entry(const struct arpt_entry
*e
, const char *name
)
475 const struct xt_entry_target
*t
;
477 if (!arp_checkentry(&e
->arp
)) {
478 duprintf("arp_tables: arp check failed %p %s.\n", e
, name
);
482 if (e
->target_offset
+ sizeof(struct xt_entry_target
) > e
->next_offset
)
485 t
= arpt_get_target_c(e
);
486 if (e
->target_offset
+ t
->u
.target_size
> e
->next_offset
)
492 static inline int check_target(struct arpt_entry
*e
, const char *name
)
494 struct xt_entry_target
*t
= arpt_get_target(e
);
496 struct xt_tgchk_param par
= {
499 .target
= t
->u
.kernel
.target
,
501 .hook_mask
= e
->comefrom
,
502 .family
= NFPROTO_ARP
,
505 ret
= xt_check_target(&par
, t
->u
.target_size
- sizeof(*t
), 0, false);
507 duprintf("arp_tables: check failed for `%s'.\n",
508 t
->u
.kernel
.target
->name
);
515 find_check_entry(struct arpt_entry
*e
, const char *name
, unsigned int size
)
517 struct xt_entry_target
*t
;
518 struct xt_target
*target
;
521 ret
= check_entry(e
, name
);
525 t
= arpt_get_target(e
);
526 target
= xt_request_find_target(NFPROTO_ARP
, t
->u
.user
.name
,
528 if (IS_ERR(target
)) {
529 duprintf("find_check_entry: `%s' not found\n", t
->u
.user
.name
);
530 ret
= PTR_ERR(target
);
533 t
->u
.kernel
.target
= target
;
535 ret
= check_target(e
, name
);
540 module_put(t
->u
.kernel
.target
->me
);
545 static bool check_underflow(const struct arpt_entry
*e
)
547 const struct xt_entry_target
*t
;
548 unsigned int verdict
;
550 if (!unconditional(&e
->arp
))
552 t
= arpt_get_target_c(e
);
553 if (strcmp(t
->u
.user
.name
, XT_STANDARD_TARGET
) != 0)
555 verdict
= ((struct xt_standard_target
*)t
)->verdict
;
556 verdict
= -verdict
- 1;
557 return verdict
== NF_DROP
|| verdict
== NF_ACCEPT
;
560 static inline int check_entry_size_and_hooks(struct arpt_entry
*e
,
561 struct xt_table_info
*newinfo
,
562 const unsigned char *base
,
563 const unsigned char *limit
,
564 const unsigned int *hook_entries
,
565 const unsigned int *underflows
,
566 unsigned int valid_hooks
)
570 if ((unsigned long)e
% __alignof__(struct arpt_entry
) != 0 ||
571 (unsigned char *)e
+ sizeof(struct arpt_entry
) >= limit
) {
572 duprintf("Bad offset %p\n", e
);
577 < sizeof(struct arpt_entry
) + sizeof(struct xt_entry_target
)) {
578 duprintf("checking: element %p size %u\n",
583 /* Check hooks & underflows */
584 for (h
= 0; h
< NF_ARP_NUMHOOKS
; h
++) {
585 if (!(valid_hooks
& (1 << h
)))
587 if ((unsigned char *)e
- base
== hook_entries
[h
])
588 newinfo
->hook_entry
[h
] = hook_entries
[h
];
589 if ((unsigned char *)e
- base
== underflows
[h
]) {
590 if (!check_underflow(e
)) {
591 pr_err("Underflows must be unconditional and "
592 "use the STANDARD target with "
596 newinfo
->underflow
[h
] = underflows
[h
];
600 /* Clear counters and comefrom */
601 e
->counters
= ((struct xt_counters
) { 0, 0 });
606 static inline void cleanup_entry(struct arpt_entry
*e
)
608 struct xt_tgdtor_param par
;
609 struct xt_entry_target
*t
;
611 t
= arpt_get_target(e
);
612 par
.target
= t
->u
.kernel
.target
;
613 par
.targinfo
= t
->data
;
614 par
.family
= NFPROTO_ARP
;
615 if (par
.target
->destroy
!= NULL
)
616 par
.target
->destroy(&par
);
617 module_put(par
.target
->me
);
620 /* Checks and translates the user-supplied table segment (held in
623 static int translate_table(struct xt_table_info
*newinfo
, void *entry0
,
624 const struct arpt_replace
*repl
)
626 struct arpt_entry
*iter
;
630 newinfo
->size
= repl
->size
;
631 newinfo
->number
= repl
->num_entries
;
633 /* Init all hooks to impossible value. */
634 for (i
= 0; i
< NF_ARP_NUMHOOKS
; i
++) {
635 newinfo
->hook_entry
[i
] = 0xFFFFFFFF;
636 newinfo
->underflow
[i
] = 0xFFFFFFFF;
639 duprintf("translate_table: size %u\n", newinfo
->size
);
642 /* Walk through entries, checking offsets. */
643 xt_entry_foreach(iter
, entry0
, newinfo
->size
) {
644 ret
= check_entry_size_and_hooks(iter
, newinfo
, entry0
,
652 if (strcmp(arpt_get_target(iter
)->u
.user
.name
,
653 XT_ERROR_TARGET
) == 0)
654 ++newinfo
->stacksize
;
656 duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret
);
660 if (i
!= repl
->num_entries
) {
661 duprintf("translate_table: %u not %u entries\n",
662 i
, repl
->num_entries
);
666 /* Check hooks all assigned */
667 for (i
= 0; i
< NF_ARP_NUMHOOKS
; i
++) {
668 /* Only hooks which are valid */
669 if (!(repl
->valid_hooks
& (1 << i
)))
671 if (newinfo
->hook_entry
[i
] == 0xFFFFFFFF) {
672 duprintf("Invalid hook entry %u %u\n",
673 i
, repl
->hook_entry
[i
]);
676 if (newinfo
->underflow
[i
] == 0xFFFFFFFF) {
677 duprintf("Invalid underflow %u %u\n",
678 i
, repl
->underflow
[i
]);
683 if (!mark_source_chains(newinfo
, repl
->valid_hooks
, entry0
)) {
684 duprintf("Looping hook\n");
688 /* Finally, each sanity check must pass */
690 xt_entry_foreach(iter
, entry0
, newinfo
->size
) {
691 ret
= find_check_entry(iter
, repl
->name
, repl
->size
);
698 xt_entry_foreach(iter
, entry0
, newinfo
->size
) {
706 /* And one copy for every other CPU */
707 for_each_possible_cpu(i
) {
708 if (newinfo
->entries
[i
] && newinfo
->entries
[i
] != entry0
)
709 memcpy(newinfo
->entries
[i
], entry0
, newinfo
->size
);
715 static void get_counters(const struct xt_table_info
*t
,
716 struct xt_counters counters
[])
718 struct arpt_entry
*iter
;
722 for_each_possible_cpu(cpu
) {
723 seqcount_t
*s
= &per_cpu(xt_recseq
, cpu
);
726 xt_entry_foreach(iter
, t
->entries
[cpu
], t
->size
) {
731 start
= read_seqcount_begin(s
);
732 bcnt
= iter
->counters
.bcnt
;
733 pcnt
= iter
->counters
.pcnt
;
734 } while (read_seqcount_retry(s
, start
));
736 ADD_COUNTER(counters
[i
], bcnt
, pcnt
);
742 static struct xt_counters
*alloc_counters(const struct xt_table
*table
)
744 unsigned int countersize
;
745 struct xt_counters
*counters
;
746 const struct xt_table_info
*private = table
->private;
748 /* We need atomic snapshot of counters: rest doesn't change
749 * (other than comefrom, which userspace doesn't care
752 countersize
= sizeof(struct xt_counters
) * private->number
;
753 counters
= vzalloc(countersize
);
755 if (counters
== NULL
)
756 return ERR_PTR(-ENOMEM
);
758 get_counters(private, counters
);
763 static int copy_entries_to_user(unsigned int total_size
,
764 const struct xt_table
*table
,
765 void __user
*userptr
)
767 unsigned int off
, num
;
768 const struct arpt_entry
*e
;
769 struct xt_counters
*counters
;
770 struct xt_table_info
*private = table
->private;
774 counters
= alloc_counters(table
);
775 if (IS_ERR(counters
))
776 return PTR_ERR(counters
);
778 loc_cpu_entry
= private->entries
[raw_smp_processor_id()];
779 /* ... then copy entire thing ... */
780 if (copy_to_user(userptr
, loc_cpu_entry
, total_size
) != 0) {
785 /* FIXME: use iterator macros --RR */
786 /* ... then go back and fix counters and names */
787 for (off
= 0, num
= 0; off
< total_size
; off
+= e
->next_offset
, num
++){
788 const struct xt_entry_target
*t
;
790 e
= (struct arpt_entry
*)(loc_cpu_entry
+ off
);
791 if (copy_to_user(userptr
+ off
792 + offsetof(struct arpt_entry
, counters
),
794 sizeof(counters
[num
])) != 0) {
799 t
= arpt_get_target_c(e
);
800 if (copy_to_user(userptr
+ off
+ e
->target_offset
801 + offsetof(struct xt_entry_target
,
803 t
->u
.kernel
.target
->name
,
804 strlen(t
->u
.kernel
.target
->name
)+1) != 0) {
816 static void compat_standard_from_user(void *dst
, const void *src
)
818 int v
= *(compat_int_t
*)src
;
821 v
+= xt_compat_calc_jump(NFPROTO_ARP
, v
);
822 memcpy(dst
, &v
, sizeof(v
));
825 static int compat_standard_to_user(void __user
*dst
, const void *src
)
827 compat_int_t cv
= *(int *)src
;
830 cv
-= xt_compat_calc_jump(NFPROTO_ARP
, cv
);
831 return copy_to_user(dst
, &cv
, sizeof(cv
)) ? -EFAULT
: 0;
834 static int compat_calc_entry(const struct arpt_entry
*e
,
835 const struct xt_table_info
*info
,
836 const void *base
, struct xt_table_info
*newinfo
)
838 const struct xt_entry_target
*t
;
839 unsigned int entry_offset
;
842 off
= sizeof(struct arpt_entry
) - sizeof(struct compat_arpt_entry
);
843 entry_offset
= (void *)e
- base
;
845 t
= arpt_get_target_c(e
);
846 off
+= xt_compat_target_offset(t
->u
.kernel
.target
);
847 newinfo
->size
-= off
;
848 ret
= xt_compat_add_offset(NFPROTO_ARP
, entry_offset
, off
);
852 for (i
= 0; i
< NF_ARP_NUMHOOKS
; i
++) {
853 if (info
->hook_entry
[i
] &&
854 (e
< (struct arpt_entry
*)(base
+ info
->hook_entry
[i
])))
855 newinfo
->hook_entry
[i
] -= off
;
856 if (info
->underflow
[i
] &&
857 (e
< (struct arpt_entry
*)(base
+ info
->underflow
[i
])))
858 newinfo
->underflow
[i
] -= off
;
863 static int compat_table_info(const struct xt_table_info
*info
,
864 struct xt_table_info
*newinfo
)
866 struct arpt_entry
*iter
;
870 if (!newinfo
|| !info
)
873 /* we dont care about newinfo->entries[] */
874 memcpy(newinfo
, info
, offsetof(struct xt_table_info
, entries
));
875 newinfo
->initial_entries
= 0;
876 loc_cpu_entry
= info
->entries
[raw_smp_processor_id()];
877 xt_compat_init_offsets(NFPROTO_ARP
, info
->number
);
878 xt_entry_foreach(iter
, loc_cpu_entry
, info
->size
) {
879 ret
= compat_calc_entry(iter
, info
, loc_cpu_entry
, newinfo
);
887 static int get_info(struct net
*net
, void __user
*user
,
888 const int *len
, int compat
)
890 char name
[XT_TABLE_MAXNAMELEN
];
894 if (*len
!= sizeof(struct arpt_getinfo
)) {
895 duprintf("length %u != %Zu\n", *len
,
896 sizeof(struct arpt_getinfo
));
900 if (copy_from_user(name
, user
, sizeof(name
)) != 0)
903 name
[XT_TABLE_MAXNAMELEN
-1] = '\0';
906 xt_compat_lock(NFPROTO_ARP
);
908 t
= try_then_request_module(xt_find_table_lock(net
, NFPROTO_ARP
, name
),
909 "arptable_%s", name
);
910 if (!IS_ERR_OR_NULL(t
)) {
911 struct arpt_getinfo info
;
912 const struct xt_table_info
*private = t
->private;
914 struct xt_table_info tmp
;
917 ret
= compat_table_info(private, &tmp
);
918 xt_compat_flush_offsets(NFPROTO_ARP
);
922 memset(&info
, 0, sizeof(info
));
923 info
.valid_hooks
= t
->valid_hooks
;
924 memcpy(info
.hook_entry
, private->hook_entry
,
925 sizeof(info
.hook_entry
));
926 memcpy(info
.underflow
, private->underflow
,
927 sizeof(info
.underflow
));
928 info
.num_entries
= private->number
;
929 info
.size
= private->size
;
930 strcpy(info
.name
, name
);
932 if (copy_to_user(user
, &info
, *len
) != 0)
939 ret
= t
? PTR_ERR(t
) : -ENOENT
;
942 xt_compat_unlock(NFPROTO_ARP
);
947 static int get_entries(struct net
*net
, struct arpt_get_entries __user
*uptr
,
951 struct arpt_get_entries get
;
954 if (*len
< sizeof(get
)) {
955 duprintf("get_entries: %u < %Zu\n", *len
, sizeof(get
));
958 if (copy_from_user(&get
, uptr
, sizeof(get
)) != 0)
960 if (*len
!= sizeof(struct arpt_get_entries
) + get
.size
) {
961 duprintf("get_entries: %u != %Zu\n", *len
,
962 sizeof(struct arpt_get_entries
) + get
.size
);
966 t
= xt_find_table_lock(net
, NFPROTO_ARP
, get
.name
);
967 if (!IS_ERR_OR_NULL(t
)) {
968 const struct xt_table_info
*private = t
->private;
970 duprintf("t->private->number = %u\n",
972 if (get
.size
== private->size
)
973 ret
= copy_entries_to_user(private->size
,
974 t
, uptr
->entrytable
);
976 duprintf("get_entries: I've got %u not %u!\n",
977 private->size
, get
.size
);
983 ret
= t
? PTR_ERR(t
) : -ENOENT
;
988 static int __do_replace(struct net
*net
, const char *name
,
989 unsigned int valid_hooks
,
990 struct xt_table_info
*newinfo
,
991 unsigned int num_counters
,
992 void __user
*counters_ptr
)
996 struct xt_table_info
*oldinfo
;
997 struct xt_counters
*counters
;
998 void *loc_cpu_old_entry
;
999 struct arpt_entry
*iter
;
1002 counters
= vzalloc(num_counters
* sizeof(struct xt_counters
));
1008 t
= try_then_request_module(xt_find_table_lock(net
, NFPROTO_ARP
, name
),
1009 "arptable_%s", name
);
1010 if (IS_ERR_OR_NULL(t
)) {
1011 ret
= t
? PTR_ERR(t
) : -ENOENT
;
1012 goto free_newinfo_counters_untrans
;
1016 if (valid_hooks
!= t
->valid_hooks
) {
1017 duprintf("Valid hook crap: %08X vs %08X\n",
1018 valid_hooks
, t
->valid_hooks
);
1023 oldinfo
= xt_replace_table(t
, num_counters
, newinfo
, &ret
);
1027 /* Update module usage count based on number of rules */
1028 duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n",
1029 oldinfo
->number
, oldinfo
->initial_entries
, newinfo
->number
);
1030 if ((oldinfo
->number
> oldinfo
->initial_entries
) ||
1031 (newinfo
->number
<= oldinfo
->initial_entries
))
1033 if ((oldinfo
->number
> oldinfo
->initial_entries
) &&
1034 (newinfo
->number
<= oldinfo
->initial_entries
))
1037 /* Get the old counters, and synchronize with replace */
1038 get_counters(oldinfo
, counters
);
1040 /* Decrease module usage counts and free resource */
1041 loc_cpu_old_entry
= oldinfo
->entries
[raw_smp_processor_id()];
1042 xt_entry_foreach(iter
, loc_cpu_old_entry
, oldinfo
->size
)
1043 cleanup_entry(iter
);
1045 xt_free_table_info(oldinfo
);
1046 if (copy_to_user(counters_ptr
, counters
,
1047 sizeof(struct xt_counters
) * num_counters
) != 0) {
1048 /* Silent error, can't fail, new table is already in place */
1049 net_warn_ratelimited("arptables: counters copy to user failed while replacing table\n");
1058 free_newinfo_counters_untrans
:
1064 static int do_replace(struct net
*net
, const void __user
*user
,
1068 struct arpt_replace tmp
;
1069 struct xt_table_info
*newinfo
;
1070 void *loc_cpu_entry
;
1071 struct arpt_entry
*iter
;
1073 if (copy_from_user(&tmp
, user
, sizeof(tmp
)) != 0)
1076 /* overflow check */
1077 if (tmp
.num_counters
>= INT_MAX
/ sizeof(struct xt_counters
))
1079 tmp
.name
[sizeof(tmp
.name
)-1] = 0;
1081 newinfo
= xt_alloc_table_info(tmp
.size
);
1085 /* choose the copy that is on our node/cpu */
1086 loc_cpu_entry
= newinfo
->entries
[raw_smp_processor_id()];
1087 if (copy_from_user(loc_cpu_entry
, user
+ sizeof(tmp
),
1093 ret
= translate_table(newinfo
, loc_cpu_entry
, &tmp
);
1097 duprintf("arp_tables: Translated table\n");
1099 ret
= __do_replace(net
, tmp
.name
, tmp
.valid_hooks
, newinfo
,
1100 tmp
.num_counters
, tmp
.counters
);
1102 goto free_newinfo_untrans
;
1105 free_newinfo_untrans
:
1106 xt_entry_foreach(iter
, loc_cpu_entry
, newinfo
->size
)
1107 cleanup_entry(iter
);
1109 xt_free_table_info(newinfo
);
1113 static int do_add_counters(struct net
*net
, const void __user
*user
,
1114 unsigned int len
, int compat
)
1116 unsigned int i
, curcpu
;
1117 struct xt_counters_info tmp
;
1118 struct xt_counters
*paddc
;
1119 unsigned int num_counters
;
1124 const struct xt_table_info
*private;
1126 void *loc_cpu_entry
;
1127 struct arpt_entry
*iter
;
1128 unsigned int addend
;
1129 #ifdef CONFIG_COMPAT
1130 struct compat_xt_counters_info compat_tmp
;
1134 size
= sizeof(struct compat_xt_counters_info
);
1139 size
= sizeof(struct xt_counters_info
);
1142 if (copy_from_user(ptmp
, user
, size
) != 0)
1145 #ifdef CONFIG_COMPAT
1147 num_counters
= compat_tmp
.num_counters
;
1148 name
= compat_tmp
.name
;
1152 num_counters
= tmp
.num_counters
;
1156 if (len
!= size
+ num_counters
* sizeof(struct xt_counters
))
1159 paddc
= vmalloc(len
- size
);
1163 if (copy_from_user(paddc
, user
+ size
, len
- size
) != 0) {
1168 t
= xt_find_table_lock(net
, NFPROTO_ARP
, name
);
1169 if (IS_ERR_OR_NULL(t
)) {
1170 ret
= t
? PTR_ERR(t
) : -ENOENT
;
1175 private = t
->private;
1176 if (private->number
!= num_counters
) {
1178 goto unlock_up_free
;
1182 /* Choose the copy that is on our node */
1183 curcpu
= smp_processor_id();
1184 loc_cpu_entry
= private->entries
[curcpu
];
1185 addend
= xt_write_recseq_begin();
1186 xt_entry_foreach(iter
, loc_cpu_entry
, private->size
) {
1187 ADD_COUNTER(iter
->counters
, paddc
[i
].bcnt
, paddc
[i
].pcnt
);
1190 xt_write_recseq_end(addend
);
1201 #ifdef CONFIG_COMPAT
1202 static inline void compat_release_entry(struct compat_arpt_entry
*e
)
1204 struct xt_entry_target
*t
;
1206 t
= compat_arpt_get_target(e
);
1207 module_put(t
->u
.kernel
.target
->me
);
1211 check_compat_entry_size_and_hooks(struct compat_arpt_entry
*e
,
1212 struct xt_table_info
*newinfo
,
1214 const unsigned char *base
,
1215 const unsigned char *limit
,
1216 const unsigned int *hook_entries
,
1217 const unsigned int *underflows
,
1220 struct xt_entry_target
*t
;
1221 struct xt_target
*target
;
1222 unsigned int entry_offset
;
1225 duprintf("check_compat_entry_size_and_hooks %p\n", e
);
1226 if ((unsigned long)e
% __alignof__(struct compat_arpt_entry
) != 0 ||
1227 (unsigned char *)e
+ sizeof(struct compat_arpt_entry
) >= limit
) {
1228 duprintf("Bad offset %p, limit = %p\n", e
, limit
);
1232 if (e
->next_offset
< sizeof(struct compat_arpt_entry
) +
1233 sizeof(struct compat_xt_entry_target
)) {
1234 duprintf("checking: element %p size %u\n",
1239 /* For purposes of check_entry casting the compat entry is fine */
1240 ret
= check_entry((struct arpt_entry
*)e
, name
);
1244 off
= sizeof(struct arpt_entry
) - sizeof(struct compat_arpt_entry
);
1245 entry_offset
= (void *)e
- (void *)base
;
1247 t
= compat_arpt_get_target(e
);
1248 target
= xt_request_find_target(NFPROTO_ARP
, t
->u
.user
.name
,
1249 t
->u
.user
.revision
);
1250 if (IS_ERR(target
)) {
1251 duprintf("check_compat_entry_size_and_hooks: `%s' not found\n",
1253 ret
= PTR_ERR(target
);
1256 t
->u
.kernel
.target
= target
;
1258 off
+= xt_compat_target_offset(target
);
1260 ret
= xt_compat_add_offset(NFPROTO_ARP
, entry_offset
, off
);
1262 goto release_target
;
1264 /* Check hooks & underflows */
1265 for (h
= 0; h
< NF_ARP_NUMHOOKS
; h
++) {
1266 if ((unsigned char *)e
- base
== hook_entries
[h
])
1267 newinfo
->hook_entry
[h
] = hook_entries
[h
];
1268 if ((unsigned char *)e
- base
== underflows
[h
])
1269 newinfo
->underflow
[h
] = underflows
[h
];
1272 /* Clear counters and comefrom */
1273 memset(&e
->counters
, 0, sizeof(e
->counters
));
1278 module_put(t
->u
.kernel
.target
->me
);
1284 compat_copy_entry_from_user(struct compat_arpt_entry
*e
, void **dstptr
,
1285 unsigned int *size
, const char *name
,
1286 struct xt_table_info
*newinfo
, unsigned char *base
)
1288 struct xt_entry_target
*t
;
1289 struct xt_target
*target
;
1290 struct arpt_entry
*de
;
1291 unsigned int origsize
;
1296 de
= (struct arpt_entry
*)*dstptr
;
1297 memcpy(de
, e
, sizeof(struct arpt_entry
));
1298 memcpy(&de
->counters
, &e
->counters
, sizeof(e
->counters
));
1300 *dstptr
+= sizeof(struct arpt_entry
);
1301 *size
+= sizeof(struct arpt_entry
) - sizeof(struct compat_arpt_entry
);
1303 de
->target_offset
= e
->target_offset
- (origsize
- *size
);
1304 t
= compat_arpt_get_target(e
);
1305 target
= t
->u
.kernel
.target
;
1306 xt_compat_target_from_user(t
, dstptr
, size
);
1308 de
->next_offset
= e
->next_offset
- (origsize
- *size
);
1309 for (h
= 0; h
< NF_ARP_NUMHOOKS
; h
++) {
1310 if ((unsigned char *)de
- base
< newinfo
->hook_entry
[h
])
1311 newinfo
->hook_entry
[h
] -= origsize
- *size
;
1312 if ((unsigned char *)de
- base
< newinfo
->underflow
[h
])
1313 newinfo
->underflow
[h
] -= origsize
- *size
;
1318 static int translate_compat_table(const char *name
,
1319 unsigned int valid_hooks
,
1320 struct xt_table_info
**pinfo
,
1322 unsigned int total_size
,
1323 unsigned int number
,
1324 unsigned int *hook_entries
,
1325 unsigned int *underflows
)
1328 struct xt_table_info
*newinfo
, *info
;
1329 void *pos
, *entry0
, *entry1
;
1330 struct compat_arpt_entry
*iter0
;
1331 struct arpt_entry
*iter1
;
1338 info
->number
= number
;
1340 /* Init all hooks to impossible value. */
1341 for (i
= 0; i
< NF_ARP_NUMHOOKS
; i
++) {
1342 info
->hook_entry
[i
] = 0xFFFFFFFF;
1343 info
->underflow
[i
] = 0xFFFFFFFF;
1346 duprintf("translate_compat_table: size %u\n", info
->size
);
1348 xt_compat_lock(NFPROTO_ARP
);
1349 xt_compat_init_offsets(NFPROTO_ARP
, number
);
1350 /* Walk through entries, checking offsets. */
1351 xt_entry_foreach(iter0
, entry0
, total_size
) {
1352 ret
= check_compat_entry_size_and_hooks(iter0
, info
, &size
,
1354 entry0
+ total_size
,
1365 duprintf("translate_compat_table: %u not %u entries\n",
1370 /* Check hooks all assigned */
1371 for (i
= 0; i
< NF_ARP_NUMHOOKS
; i
++) {
1372 /* Only hooks which are valid */
1373 if (!(valid_hooks
& (1 << i
)))
1375 if (info
->hook_entry
[i
] == 0xFFFFFFFF) {
1376 duprintf("Invalid hook entry %u %u\n",
1377 i
, hook_entries
[i
]);
1380 if (info
->underflow
[i
] == 0xFFFFFFFF) {
1381 duprintf("Invalid underflow %u %u\n",
1388 newinfo
= xt_alloc_table_info(size
);
1392 newinfo
->number
= number
;
1393 for (i
= 0; i
< NF_ARP_NUMHOOKS
; i
++) {
1394 newinfo
->hook_entry
[i
] = info
->hook_entry
[i
];
1395 newinfo
->underflow
[i
] = info
->underflow
[i
];
1397 entry1
= newinfo
->entries
[raw_smp_processor_id()];
1400 xt_entry_foreach(iter0
, entry0
, total_size
) {
1401 ret
= compat_copy_entry_from_user(iter0
, &pos
, &size
,
1402 name
, newinfo
, entry1
);
1406 xt_compat_flush_offsets(NFPROTO_ARP
);
1407 xt_compat_unlock(NFPROTO_ARP
);
1412 if (!mark_source_chains(newinfo
, valid_hooks
, entry1
))
1416 xt_entry_foreach(iter1
, entry1
, newinfo
->size
) {
1417 ret
= check_target(iter1
, name
);
1421 if (strcmp(arpt_get_target(iter1
)->u
.user
.name
,
1422 XT_ERROR_TARGET
) == 0)
1423 ++newinfo
->stacksize
;
1427 * The first i matches need cleanup_entry (calls ->destroy)
1428 * because they had called ->check already. The other j-i
1429 * entries need only release.
1433 xt_entry_foreach(iter0
, entry0
, newinfo
->size
) {
1438 compat_release_entry(iter0
);
1440 xt_entry_foreach(iter1
, entry1
, newinfo
->size
) {
1443 cleanup_entry(iter1
);
1445 xt_free_table_info(newinfo
);
1449 /* And one copy for every other CPU */
1450 for_each_possible_cpu(i
)
1451 if (newinfo
->entries
[i
] && newinfo
->entries
[i
] != entry1
)
1452 memcpy(newinfo
->entries
[i
], entry1
, newinfo
->size
);
1456 xt_free_table_info(info
);
1460 xt_free_table_info(newinfo
);
1462 xt_entry_foreach(iter0
, entry0
, total_size
) {
1465 compat_release_entry(iter0
);
1469 xt_compat_flush_offsets(NFPROTO_ARP
);
1470 xt_compat_unlock(NFPROTO_ARP
);
1474 struct compat_arpt_replace
{
1475 char name
[XT_TABLE_MAXNAMELEN
];
1479 u32 hook_entry
[NF_ARP_NUMHOOKS
];
1480 u32 underflow
[NF_ARP_NUMHOOKS
];
1482 compat_uptr_t counters
;
1483 struct compat_arpt_entry entries
[0];
1486 static int compat_do_replace(struct net
*net
, void __user
*user
,
1490 struct compat_arpt_replace tmp
;
1491 struct xt_table_info
*newinfo
;
1492 void *loc_cpu_entry
;
1493 struct arpt_entry
*iter
;
1495 if (copy_from_user(&tmp
, user
, sizeof(tmp
)) != 0)
1498 /* overflow check */
1499 if (tmp
.size
>= INT_MAX
/ num_possible_cpus())
1501 if (tmp
.num_counters
>= INT_MAX
/ sizeof(struct xt_counters
))
1503 tmp
.name
[sizeof(tmp
.name
)-1] = 0;
1505 newinfo
= xt_alloc_table_info(tmp
.size
);
1509 /* choose the copy that is on our node/cpu */
1510 loc_cpu_entry
= newinfo
->entries
[raw_smp_processor_id()];
1511 if (copy_from_user(loc_cpu_entry
, user
+ sizeof(tmp
), tmp
.size
) != 0) {
1516 ret
= translate_compat_table(tmp
.name
, tmp
.valid_hooks
,
1517 &newinfo
, &loc_cpu_entry
, tmp
.size
,
1518 tmp
.num_entries
, tmp
.hook_entry
,
1523 duprintf("compat_do_replace: Translated table\n");
1525 ret
= __do_replace(net
, tmp
.name
, tmp
.valid_hooks
, newinfo
,
1526 tmp
.num_counters
, compat_ptr(tmp
.counters
));
1528 goto free_newinfo_untrans
;
1531 free_newinfo_untrans
:
1532 xt_entry_foreach(iter
, loc_cpu_entry
, newinfo
->size
)
1533 cleanup_entry(iter
);
1535 xt_free_table_info(newinfo
);
1539 static int compat_do_arpt_set_ctl(struct sock
*sk
, int cmd
, void __user
*user
,
1544 if (!ns_capable(sock_net(sk
)->user_ns
, CAP_NET_ADMIN
))
1548 case ARPT_SO_SET_REPLACE
:
1549 ret
= compat_do_replace(sock_net(sk
), user
, len
);
1552 case ARPT_SO_SET_ADD_COUNTERS
:
1553 ret
= do_add_counters(sock_net(sk
), user
, len
, 1);
1557 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd
);
1564 static int compat_copy_entry_to_user(struct arpt_entry
*e
, void __user
**dstptr
,
1565 compat_uint_t
*size
,
1566 struct xt_counters
*counters
,
1569 struct xt_entry_target
*t
;
1570 struct compat_arpt_entry __user
*ce
;
1571 u_int16_t target_offset
, next_offset
;
1572 compat_uint_t origsize
;
1576 ce
= (struct compat_arpt_entry __user
*)*dstptr
;
1577 if (copy_to_user(ce
, e
, sizeof(struct arpt_entry
)) != 0 ||
1578 copy_to_user(&ce
->counters
, &counters
[i
],
1579 sizeof(counters
[i
])) != 0)
1582 *dstptr
+= sizeof(struct compat_arpt_entry
);
1583 *size
-= sizeof(struct arpt_entry
) - sizeof(struct compat_arpt_entry
);
1585 target_offset
= e
->target_offset
- (origsize
- *size
);
1587 t
= arpt_get_target(e
);
1588 ret
= xt_compat_target_to_user(t
, dstptr
, size
);
1591 next_offset
= e
->next_offset
- (origsize
- *size
);
1592 if (put_user(target_offset
, &ce
->target_offset
) != 0 ||
1593 put_user(next_offset
, &ce
->next_offset
) != 0)
1598 static int compat_copy_entries_to_user(unsigned int total_size
,
1599 struct xt_table
*table
,
1600 void __user
*userptr
)
1602 struct xt_counters
*counters
;
1603 const struct xt_table_info
*private = table
->private;
1607 void *loc_cpu_entry
;
1609 struct arpt_entry
*iter
;
1611 counters
= alloc_counters(table
);
1612 if (IS_ERR(counters
))
1613 return PTR_ERR(counters
);
1615 /* choose the copy on our node/cpu */
1616 loc_cpu_entry
= private->entries
[raw_smp_processor_id()];
1619 xt_entry_foreach(iter
, loc_cpu_entry
, total_size
) {
1620 ret
= compat_copy_entry_to_user(iter
, &pos
,
1621 &size
, counters
, i
++);
1629 struct compat_arpt_get_entries
{
1630 char name
[XT_TABLE_MAXNAMELEN
];
1632 struct compat_arpt_entry entrytable
[0];
1635 static int compat_get_entries(struct net
*net
,
1636 struct compat_arpt_get_entries __user
*uptr
,
1640 struct compat_arpt_get_entries get
;
1643 if (*len
< sizeof(get
)) {
1644 duprintf("compat_get_entries: %u < %zu\n", *len
, sizeof(get
));
1647 if (copy_from_user(&get
, uptr
, sizeof(get
)) != 0)
1649 if (*len
!= sizeof(struct compat_arpt_get_entries
) + get
.size
) {
1650 duprintf("compat_get_entries: %u != %zu\n",
1651 *len
, sizeof(get
) + get
.size
);
1655 xt_compat_lock(NFPROTO_ARP
);
1656 t
= xt_find_table_lock(net
, NFPROTO_ARP
, get
.name
);
1657 if (!IS_ERR_OR_NULL(t
)) {
1658 const struct xt_table_info
*private = t
->private;
1659 struct xt_table_info info
;
1661 duprintf("t->private->number = %u\n", private->number
);
1662 ret
= compat_table_info(private, &info
);
1663 if (!ret
&& get
.size
== info
.size
) {
1664 ret
= compat_copy_entries_to_user(private->size
,
1665 t
, uptr
->entrytable
);
1667 duprintf("compat_get_entries: I've got %u not %u!\n",
1668 private->size
, get
.size
);
1671 xt_compat_flush_offsets(NFPROTO_ARP
);
1675 ret
= t
? PTR_ERR(t
) : -ENOENT
;
1677 xt_compat_unlock(NFPROTO_ARP
);
1681 static int do_arpt_get_ctl(struct sock
*, int, void __user
*, int *);
1683 static int compat_do_arpt_get_ctl(struct sock
*sk
, int cmd
, void __user
*user
,
1688 if (!ns_capable(sock_net(sk
)->user_ns
, CAP_NET_ADMIN
))
1692 case ARPT_SO_GET_INFO
:
1693 ret
= get_info(sock_net(sk
), user
, len
, 1);
1695 case ARPT_SO_GET_ENTRIES
:
1696 ret
= compat_get_entries(sock_net(sk
), user
, len
);
1699 ret
= do_arpt_get_ctl(sk
, cmd
, user
, len
);
1705 static int do_arpt_set_ctl(struct sock
*sk
, int cmd
, void __user
*user
, unsigned int len
)
1709 if (!ns_capable(sock_net(sk
)->user_ns
, CAP_NET_ADMIN
))
1713 case ARPT_SO_SET_REPLACE
:
1714 ret
= do_replace(sock_net(sk
), user
, len
);
1717 case ARPT_SO_SET_ADD_COUNTERS
:
1718 ret
= do_add_counters(sock_net(sk
), user
, len
, 0);
1722 duprintf("do_arpt_set_ctl: unknown request %i\n", cmd
);
1729 static int do_arpt_get_ctl(struct sock
*sk
, int cmd
, void __user
*user
, int *len
)
1733 if (!ns_capable(sock_net(sk
)->user_ns
, CAP_NET_ADMIN
))
1737 case ARPT_SO_GET_INFO
:
1738 ret
= get_info(sock_net(sk
), user
, len
, 0);
1741 case ARPT_SO_GET_ENTRIES
:
1742 ret
= get_entries(sock_net(sk
), user
, len
);
1745 case ARPT_SO_GET_REVISION_TARGET
: {
1746 struct xt_get_revision rev
;
1748 if (*len
!= sizeof(rev
)) {
1752 if (copy_from_user(&rev
, user
, sizeof(rev
)) != 0) {
1756 rev
.name
[sizeof(rev
.name
)-1] = 0;
1758 try_then_request_module(xt_find_revision(NFPROTO_ARP
, rev
.name
,
1759 rev
.revision
, 1, &ret
),
1760 "arpt_%s", rev
.name
);
1765 duprintf("do_arpt_get_ctl: unknown request %i\n", cmd
);
1772 struct xt_table
*arpt_register_table(struct net
*net
,
1773 const struct xt_table
*table
,
1774 const struct arpt_replace
*repl
)
1777 struct xt_table_info
*newinfo
;
1778 struct xt_table_info bootstrap
= {0};
1779 void *loc_cpu_entry
;
1780 struct xt_table
*new_table
;
1782 newinfo
= xt_alloc_table_info(repl
->size
);
1788 /* choose the copy on our node/cpu */
1789 loc_cpu_entry
= newinfo
->entries
[raw_smp_processor_id()];
1790 memcpy(loc_cpu_entry
, repl
->entries
, repl
->size
);
1792 ret
= translate_table(newinfo
, loc_cpu_entry
, repl
);
1793 duprintf("arpt_register_table: translate table gives %d\n", ret
);
1797 new_table
= xt_register_table(net
, table
, &bootstrap
, newinfo
);
1798 if (IS_ERR(new_table
)) {
1799 ret
= PTR_ERR(new_table
);
1805 xt_free_table_info(newinfo
);
1807 return ERR_PTR(ret
);
1810 void arpt_unregister_table(struct xt_table
*table
)
1812 struct xt_table_info
*private;
1813 void *loc_cpu_entry
;
1814 struct module
*table_owner
= table
->me
;
1815 struct arpt_entry
*iter
;
1817 private = xt_unregister_table(table
);
1819 /* Decrease module usage counts and free resources */
1820 loc_cpu_entry
= private->entries
[raw_smp_processor_id()];
1821 xt_entry_foreach(iter
, loc_cpu_entry
, private->size
)
1822 cleanup_entry(iter
);
1823 if (private->number
> private->initial_entries
)
1824 module_put(table_owner
);
1825 xt_free_table_info(private);
1828 /* The built-in targets: standard (NULL) and error. */
1829 static struct xt_target arpt_builtin_tg
[] __read_mostly
= {
1831 .name
= XT_STANDARD_TARGET
,
1832 .targetsize
= sizeof(int),
1833 .family
= NFPROTO_ARP
,
1834 #ifdef CONFIG_COMPAT
1835 .compatsize
= sizeof(compat_int_t
),
1836 .compat_from_user
= compat_standard_from_user
,
1837 .compat_to_user
= compat_standard_to_user
,
1841 .name
= XT_ERROR_TARGET
,
1842 .target
= arpt_error
,
1843 .targetsize
= XT_FUNCTION_MAXNAMELEN
,
1844 .family
= NFPROTO_ARP
,
1848 static struct nf_sockopt_ops arpt_sockopts
= {
1850 .set_optmin
= ARPT_BASE_CTL
,
1851 .set_optmax
= ARPT_SO_SET_MAX
+1,
1852 .set
= do_arpt_set_ctl
,
1853 #ifdef CONFIG_COMPAT
1854 .compat_set
= compat_do_arpt_set_ctl
,
1856 .get_optmin
= ARPT_BASE_CTL
,
1857 .get_optmax
= ARPT_SO_GET_MAX
+1,
1858 .get
= do_arpt_get_ctl
,
1859 #ifdef CONFIG_COMPAT
1860 .compat_get
= compat_do_arpt_get_ctl
,
1862 .owner
= THIS_MODULE
,
1865 static int __net_init
arp_tables_net_init(struct net
*net
)
1867 return xt_proto_init(net
, NFPROTO_ARP
);
1870 static void __net_exit
arp_tables_net_exit(struct net
*net
)
1872 xt_proto_fini(net
, NFPROTO_ARP
);
1875 static struct pernet_operations arp_tables_net_ops
= {
1876 .init
= arp_tables_net_init
,
1877 .exit
= arp_tables_net_exit
,
1880 static int __init
arp_tables_init(void)
1884 ret
= register_pernet_subsys(&arp_tables_net_ops
);
1888 /* No one else will be downing sem now, so we won't sleep */
1889 ret
= xt_register_targets(arpt_builtin_tg
, ARRAY_SIZE(arpt_builtin_tg
));
1893 /* Register setsockopt */
1894 ret
= nf_register_sockopt(&arpt_sockopts
);
1898 printk(KERN_INFO
"arp_tables: (C) 2002 David S. Miller\n");
1902 xt_unregister_targets(arpt_builtin_tg
, ARRAY_SIZE(arpt_builtin_tg
));
1904 unregister_pernet_subsys(&arp_tables_net_ops
);
1909 static void __exit
arp_tables_fini(void)
1911 nf_unregister_sockopt(&arpt_sockopts
);
1912 xt_unregister_targets(arpt_builtin_tg
, ARRAY_SIZE(arpt_builtin_tg
));
1913 unregister_pernet_subsys(&arp_tables_net_ops
);
1916 EXPORT_SYMBOL(arpt_register_table
);
1917 EXPORT_SYMBOL(arpt_unregister_table
);
1918 EXPORT_SYMBOL(arpt_do_table
);
1920 module_init(arp_tables_init
);
1921 module_exit(arp_tables_fini
);