]>
Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Packet matching code for ARP packets. | |
3 | * | |
4 | * Based heavily, if not almost entirely, upon ip_tables.c framework. | |
5 | * | |
6 | * Some ARP specific bits are: | |
7 | * | |
8 | * Copyright (C) 2002 David S. Miller (davem@redhat.com) | |
9 | * | |
10 | */ | |
90e7d4ab | 11 | #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt |
1da177e4 LT |
12 | #include <linux/kernel.h> |
13 | #include <linux/skbuff.h> | |
14 | #include <linux/netdevice.h> | |
4fc268d2 | 15 | #include <linux/capability.h> |
1da177e4 LT |
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> | |
57b47a53 | 22 | #include <linux/mutex.h> |
d6a2ba07 PM |
23 | #include <linux/err.h> |
24 | #include <net/compat.h> | |
79df341a | 25 | #include <net/sock.h> |
d6a2ba07 | 26 | #include <asm/uaccess.h> |
1da177e4 | 27 | |
2e4e6a17 | 28 | #include <linux/netfilter/x_tables.h> |
1da177e4 | 29 | #include <linux/netfilter_arp/arp_tables.h> |
e3eaa991 | 30 | #include "../../netfilter/xt_repldata.h" |
1da177e4 LT |
31 | |
32 | MODULE_LICENSE("GPL"); | |
33 | MODULE_AUTHOR("David S. Miller <davem@redhat.com>"); | |
34 | MODULE_DESCRIPTION("arptables core"); | |
35 | ||
36 | /*#define DEBUG_ARP_TABLES*/ | |
37 | /*#define DEBUG_ARP_TABLES_USER*/ | |
38 | ||
39 | #ifdef DEBUG_ARP_TABLES | |
40 | #define dprintf(format, args...) printk(format , ## args) | |
41 | #else | |
42 | #define dprintf(format, args...) | |
43 | #endif | |
44 | ||
45 | #ifdef DEBUG_ARP_TABLES_USER | |
46 | #define duprintf(format, args...) printk(format , ## args) | |
47 | #else | |
48 | #define duprintf(format, args...) | |
49 | #endif | |
50 | ||
51 | #ifdef CONFIG_NETFILTER_DEBUG | |
af567603 | 52 | #define ARP_NF_ASSERT(x) WARN_ON(!(x)) |
1da177e4 LT |
53 | #else |
54 | #define ARP_NF_ASSERT(x) | |
55 | #endif | |
1da177e4 | 56 | |
e3eaa991 JE |
57 | void *arpt_alloc_initial_table(const struct xt_table *info) |
58 | { | |
59 | return xt_alloc_initial_table(arpt, ARPT); | |
60 | } | |
61 | EXPORT_SYMBOL_GPL(arpt_alloc_initial_table); | |
62 | ||
1da177e4 | 63 | static inline int arp_devaddr_compare(const struct arpt_devaddr_info *ap, |
5452e425 | 64 | const char *hdr_addr, int len) |
1da177e4 LT |
65 | { |
66 | int i, ret; | |
67 | ||
68 | if (len > ARPT_DEV_ADDR_LEN_MAX) | |
69 | len = ARPT_DEV_ADDR_LEN_MAX; | |
70 | ||
71 | ret = 0; | |
72 | for (i = 0; i < len; i++) | |
73 | ret |= (hdr_addr[i] ^ ap->addr[i]) & ap->mask[i]; | |
74 | ||
75 | return (ret != 0); | |
76 | } | |
77 | ||
ddc214c4 ED |
78 | /* |
79 | * Unfortunatly, _b and _mask are not aligned to an int (or long int) | |
80 | * Some arches dont care, unrolling the loop is a win on them. | |
35c7f6de | 81 | * For other arches, we only have a 16bit alignement. |
ddc214c4 ED |
82 | */ |
83 | static unsigned long ifname_compare(const char *_a, const char *_b, const char *_mask) | |
84 | { | |
85 | #ifdef CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS | |
b8dfe498 | 86 | unsigned long ret = ifname_compare_aligned(_a, _b, _mask); |
ddc214c4 ED |
87 | #else |
88 | unsigned long ret = 0; | |
35c7f6de ED |
89 | const u16 *a = (const u16 *)_a; |
90 | const u16 *b = (const u16 *)_b; | |
91 | const u16 *mask = (const u16 *)_mask; | |
ddc214c4 ED |
92 | int i; |
93 | ||
35c7f6de ED |
94 | for (i = 0; i < IFNAMSIZ/sizeof(u16); i++) |
95 | ret |= (a[i] ^ b[i]) & mask[i]; | |
ddc214c4 ED |
96 | #endif |
97 | return ret; | |
98 | } | |
99 | ||
1da177e4 LT |
100 | /* Returns whether packet matches rule or not. */ |
101 | static inline int arp_packet_match(const struct arphdr *arphdr, | |
102 | struct net_device *dev, | |
103 | const char *indev, | |
104 | const char *outdev, | |
105 | const struct arpt_arp *arpinfo) | |
106 | { | |
5452e425 JE |
107 | const char *arpptr = (char *)(arphdr + 1); |
108 | const char *src_devaddr, *tgt_devaddr; | |
59b8bfd8 | 109 | __be32 src_ipaddr, tgt_ipaddr; |
ddc214c4 | 110 | long ret; |
1da177e4 | 111 | |
e79ec50b | 112 | #define FWINV(bool, invflg) ((bool) ^ !!(arpinfo->invflags & (invflg))) |
1da177e4 LT |
113 | |
114 | if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop, | |
115 | ARPT_INV_ARPOP)) { | |
116 | dprintf("ARP operation field mismatch.\n"); | |
117 | dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n", | |
118 | arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask); | |
119 | return 0; | |
120 | } | |
121 | ||
122 | if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd, | |
123 | ARPT_INV_ARPHRD)) { | |
124 | dprintf("ARP hardware address format mismatch.\n"); | |
125 | dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n", | |
126 | arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask); | |
127 | return 0; | |
128 | } | |
129 | ||
130 | if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro, | |
131 | ARPT_INV_ARPPRO)) { | |
132 | dprintf("ARP protocol address format mismatch.\n"); | |
133 | dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n", | |
134 | arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask); | |
135 | return 0; | |
136 | } | |
137 | ||
138 | if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln, | |
139 | ARPT_INV_ARPHLN)) { | |
140 | dprintf("ARP hardware address length mismatch.\n"); | |
141 | dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n", | |
142 | arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask); | |
143 | return 0; | |
144 | } | |
145 | ||
146 | src_devaddr = arpptr; | |
147 | arpptr += dev->addr_len; | |
148 | memcpy(&src_ipaddr, arpptr, sizeof(u32)); | |
149 | arpptr += sizeof(u32); | |
150 | tgt_devaddr = arpptr; | |
151 | arpptr += dev->addr_len; | |
152 | memcpy(&tgt_ipaddr, arpptr, sizeof(u32)); | |
153 | ||
154 | if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len), | |
155 | ARPT_INV_SRCDEVADDR) || | |
156 | FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len), | |
157 | ARPT_INV_TGTDEVADDR)) { | |
158 | dprintf("Source or target device address mismatch.\n"); | |
159 | ||
160 | return 0; | |
161 | } | |
162 | ||
163 | if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr, | |
164 | ARPT_INV_SRCIP) || | |
165 | FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr), | |
166 | ARPT_INV_TGTIP)) { | |
167 | dprintf("Source or target IP address mismatch.\n"); | |
168 | ||
cffee385 HH |
169 | dprintf("SRC: %pI4. Mask: %pI4. Target: %pI4.%s\n", |
170 | &src_ipaddr, | |
171 | &arpinfo->smsk.s_addr, | |
172 | &arpinfo->src.s_addr, | |
1da177e4 | 173 | arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : ""); |
cffee385 HH |
174 | dprintf("TGT: %pI4 Mask: %pI4 Target: %pI4.%s\n", |
175 | &tgt_ipaddr, | |
176 | &arpinfo->tmsk.s_addr, | |
177 | &arpinfo->tgt.s_addr, | |
1da177e4 LT |
178 | arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : ""); |
179 | return 0; | |
180 | } | |
181 | ||
182 | /* Look for ifname matches. */ | |
ddc214c4 | 183 | ret = ifname_compare(indev, arpinfo->iniface, arpinfo->iniface_mask); |
1da177e4 LT |
184 | |
185 | if (FWINV(ret != 0, ARPT_INV_VIA_IN)) { | |
186 | dprintf("VIA in mismatch (%s vs %s).%s\n", | |
187 | indev, arpinfo->iniface, | |
188 | arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":""); | |
189 | return 0; | |
190 | } | |
191 | ||
ddc214c4 | 192 | ret = ifname_compare(outdev, arpinfo->outiface, arpinfo->outiface_mask); |
1da177e4 LT |
193 | |
194 | if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) { | |
195 | dprintf("VIA out mismatch (%s vs %s).%s\n", | |
196 | outdev, arpinfo->outiface, | |
197 | arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":""); | |
198 | return 0; | |
199 | } | |
200 | ||
201 | return 1; | |
e79ec50b | 202 | #undef FWINV |
1da177e4 LT |
203 | } |
204 | ||
205 | static inline int arp_checkentry(const struct arpt_arp *arp) | |
206 | { | |
207 | if (arp->flags & ~ARPT_F_MASK) { | |
208 | duprintf("Unknown flag bits set: %08X\n", | |
209 | arp->flags & ~ARPT_F_MASK); | |
210 | return 0; | |
211 | } | |
212 | if (arp->invflags & ~ARPT_INV_MASK) { | |
213 | duprintf("Unknown invflag bits set: %08X\n", | |
214 | arp->invflags & ~ARPT_INV_MASK); | |
215 | return 0; | |
216 | } | |
217 | ||
218 | return 1; | |
219 | } | |
220 | ||
7eb35586 | 221 | static unsigned int |
4b560b44 | 222 | arpt_error(struct sk_buff *skb, const struct xt_action_param *par) |
1da177e4 LT |
223 | { |
224 | if (net_ratelimit()) | |
654d0fbd | 225 | pr_err("arp_tables: error: '%s'\n", |
7eb35586 | 226 | (const char *)par->targinfo); |
1da177e4 LT |
227 | |
228 | return NF_DROP; | |
229 | } | |
230 | ||
d5d1baa1 JE |
231 | static inline const struct arpt_entry_target * |
232 | arpt_get_target_c(const struct arpt_entry *e) | |
233 | { | |
234 | return arpt_get_target((struct arpt_entry *)e); | |
235 | } | |
236 | ||
237 | static inline struct arpt_entry * | |
238 | get_entry(const void *base, unsigned int offset) | |
1da177e4 LT |
239 | { |
240 | return (struct arpt_entry *)(base + offset); | |
241 | } | |
242 | ||
98e86403 JE |
243 | static inline __pure |
244 | struct arpt_entry *arpt_next_entry(const struct arpt_entry *entry) | |
245 | { | |
246 | return (void *)entry + entry->next_offset; | |
247 | } | |
248 | ||
3db05fea | 249 | unsigned int arpt_do_table(struct sk_buff *skb, |
1da177e4 LT |
250 | unsigned int hook, |
251 | const struct net_device *in, | |
252 | const struct net_device *out, | |
4abff077 | 253 | struct xt_table *table) |
1da177e4 | 254 | { |
ddc214c4 | 255 | static const char nulldevname[IFNAMSIZ] __attribute__((aligned(sizeof(long)))); |
1da177e4 | 256 | unsigned int verdict = NF_DROP; |
5452e425 | 257 | const struct arphdr *arp; |
1da177e4 LT |
258 | struct arpt_entry *e, *back; |
259 | const char *indev, *outdev; | |
260 | void *table_base; | |
5452e425 | 261 | const struct xt_table_info *private; |
de74c169 | 262 | struct xt_action_param acpar; |
1da177e4 | 263 | |
988b7050 | 264 | if (!pskb_may_pull(skb, arp_hdr_len(skb->dev))) |
1da177e4 LT |
265 | return NF_DROP; |
266 | ||
267 | indev = in ? in->name : nulldevname; | |
268 | outdev = out ? out->name : nulldevname; | |
269 | ||
942e4a2b SH |
270 | xt_info_rdlock_bh(); |
271 | private = table->private; | |
272 | table_base = private->entries[smp_processor_id()]; | |
78454473 | 273 | |
2e4e6a17 HW |
274 | e = get_entry(table_base, private->hook_entry[hook]); |
275 | back = get_entry(table_base, private->underflow[hook]); | |
1da177e4 | 276 | |
de74c169 JE |
277 | acpar.in = in; |
278 | acpar.out = out; | |
279 | acpar.hooknum = hook; | |
280 | acpar.family = NFPROTO_ARP; | |
b4ba2611 | 281 | acpar.hotdrop = false; |
7eb35586 | 282 | |
3db05fea | 283 | arp = arp_hdr(skb); |
1da177e4 | 284 | do { |
d5d1baa1 | 285 | const struct arpt_entry_target *t; |
a1ff4ac8 JE |
286 | int hdr_len; |
287 | ||
288 | if (!arp_packet_match(arp, skb->dev, indev, outdev, &e->arp)) { | |
289 | e = arpt_next_entry(e); | |
290 | continue; | |
291 | } | |
292 | ||
293 | hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) + | |
294 | (2 * skb->dev->addr_len); | |
295 | ADD_COUNTER(e->counters, hdr_len, 1); | |
1da177e4 | 296 | |
d5d1baa1 | 297 | t = arpt_get_target_c(e); |
a1ff4ac8 JE |
298 | |
299 | /* Standard target? */ | |
300 | if (!t->u.kernel.target->target) { | |
301 | int v; | |
302 | ||
303 | v = ((struct arpt_standard_target *)t)->verdict; | |
304 | if (v < 0) { | |
305 | /* Pop from stack? */ | |
306 | if (v != ARPT_RETURN) { | |
307 | verdict = (unsigned)(-v) - 1; | |
1da177e4 | 308 | break; |
a1ff4ac8 JE |
309 | } |
310 | e = back; | |
311 | back = get_entry(table_base, back->comefrom); | |
312 | continue; | |
1da177e4 | 313 | } |
a1ff4ac8 JE |
314 | if (table_base + v |
315 | != arpt_next_entry(e)) { | |
316 | /* Save old back ptr in next entry */ | |
317 | struct arpt_entry *next = arpt_next_entry(e); | |
318 | next->comefrom = (void *)back - table_base; | |
319 | ||
320 | /* set back pointer to next entry */ | |
321 | back = next; | |
322 | } | |
323 | ||
324 | e = get_entry(table_base, v); | |
7a6b1c46 | 325 | continue; |
1da177e4 | 326 | } |
7a6b1c46 JE |
327 | |
328 | /* Targets which reenter must return | |
329 | * abs. verdicts | |
330 | */ | |
de74c169 JE |
331 | acpar.target = t->u.kernel.target; |
332 | acpar.targinfo = t->data; | |
333 | verdict = t->u.kernel.target->target(skb, &acpar); | |
7a6b1c46 JE |
334 | |
335 | /* Target might have changed stuff. */ | |
336 | arp = arp_hdr(skb); | |
337 | ||
338 | if (verdict == ARPT_CONTINUE) | |
339 | e = arpt_next_entry(e); | |
340 | else | |
341 | /* Verdict */ | |
342 | break; | |
b4ba2611 | 343 | } while (!acpar.hotdrop); |
942e4a2b | 344 | xt_info_rdunlock_bh(); |
1da177e4 | 345 | |
b4ba2611 | 346 | if (acpar.hotdrop) |
1da177e4 LT |
347 | return NF_DROP; |
348 | else | |
349 | return verdict; | |
350 | } | |
351 | ||
1da177e4 | 352 | /* All zeroes == unconditional rule. */ |
47901dc2 | 353 | static inline bool unconditional(const struct arpt_arp *arp) |
1da177e4 | 354 | { |
47901dc2 | 355 | static const struct arpt_arp uncond; |
1da177e4 | 356 | |
47901dc2 | 357 | return memcmp(arp, &uncond, sizeof(uncond)) == 0; |
1da177e4 LT |
358 | } |
359 | ||
360 | /* Figures out from what hook each rule can be called: returns 0 if | |
361 | * there are loops. Puts hook bitmask in comefrom. | |
362 | */ | |
d5d1baa1 | 363 | static int mark_source_chains(const struct xt_table_info *newinfo, |
31836064 | 364 | unsigned int valid_hooks, void *entry0) |
1da177e4 LT |
365 | { |
366 | unsigned int hook; | |
367 | ||
368 | /* No recursion; use packet counter to save back ptrs (reset | |
369 | * to 0 as we leave), and comefrom to save source hook bitmask. | |
370 | */ | |
371 | for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) { | |
372 | unsigned int pos = newinfo->hook_entry[hook]; | |
373 | struct arpt_entry *e | |
31836064 | 374 | = (struct arpt_entry *)(entry0 + pos); |
1da177e4 LT |
375 | |
376 | if (!(valid_hooks & (1 << hook))) | |
377 | continue; | |
378 | ||
379 | /* Set initial back pointer. */ | |
380 | e->counters.pcnt = pos; | |
381 | ||
382 | for (;;) { | |
5452e425 | 383 | const struct arpt_standard_target *t |
d5d1baa1 | 384 | = (void *)arpt_get_target_c(e); |
e1b4b9f3 | 385 | int visited = e->comefrom & (1 << hook); |
1da177e4 LT |
386 | |
387 | if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) { | |
654d0fbd | 388 | pr_notice("arptables: loop hook %u pos %u %08X.\n", |
1da177e4 LT |
389 | hook, pos, e->comefrom); |
390 | return 0; | |
391 | } | |
392 | e->comefrom | |
393 | |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS)); | |
394 | ||
395 | /* Unconditional return/END. */ | |
3666ed1c JP |
396 | if ((e->target_offset == sizeof(struct arpt_entry) && |
397 | (strcmp(t->target.u.user.name, | |
398 | ARPT_STANDARD_TARGET) == 0) && | |
399 | t->verdict < 0 && unconditional(&e->arp)) || | |
400 | visited) { | |
1da177e4 LT |
401 | unsigned int oldpos, size; |
402 | ||
1f9352ae PM |
403 | if ((strcmp(t->target.u.user.name, |
404 | ARPT_STANDARD_TARGET) == 0) && | |
405 | t->verdict < -NF_MAX_VERDICT - 1) { | |
74c9c0c1 DM |
406 | duprintf("mark_source_chains: bad " |
407 | "negative verdict (%i)\n", | |
408 | t->verdict); | |
409 | return 0; | |
410 | } | |
411 | ||
1da177e4 LT |
412 | /* Return: backtrack through the last |
413 | * big jump. | |
414 | */ | |
415 | do { | |
416 | e->comefrom ^= (1<<NF_ARP_NUMHOOKS); | |
417 | oldpos = pos; | |
418 | pos = e->counters.pcnt; | |
419 | e->counters.pcnt = 0; | |
420 | ||
421 | /* We're at the start. */ | |
422 | if (pos == oldpos) | |
423 | goto next; | |
424 | ||
425 | e = (struct arpt_entry *) | |
31836064 | 426 | (entry0 + pos); |
1da177e4 LT |
427 | } while (oldpos == pos + e->next_offset); |
428 | ||
429 | /* Move along one */ | |
430 | size = e->next_offset; | |
431 | e = (struct arpt_entry *) | |
31836064 | 432 | (entry0 + pos + size); |
1da177e4 LT |
433 | e->counters.pcnt = pos; |
434 | pos += size; | |
435 | } else { | |
436 | int newpos = t->verdict; | |
437 | ||
438 | if (strcmp(t->target.u.user.name, | |
3666ed1c JP |
439 | ARPT_STANDARD_TARGET) == 0 && |
440 | newpos >= 0) { | |
74c9c0c1 DM |
441 | if (newpos > newinfo->size - |
442 | sizeof(struct arpt_entry)) { | |
443 | duprintf("mark_source_chains: " | |
444 | "bad verdict (%i)\n", | |
445 | newpos); | |
446 | return 0; | |
447 | } | |
448 | ||
1da177e4 LT |
449 | /* This a jump; chase it. */ |
450 | duprintf("Jump rule %u -> %u\n", | |
451 | pos, newpos); | |
452 | } else { | |
453 | /* ... this is a fallthru */ | |
454 | newpos = pos + e->next_offset; | |
455 | } | |
456 | e = (struct arpt_entry *) | |
31836064 | 457 | (entry0 + newpos); |
1da177e4 LT |
458 | e->counters.pcnt = pos; |
459 | pos = newpos; | |
460 | } | |
461 | } | |
462 | next: | |
463 | duprintf("Finished chain %u\n", hook); | |
464 | } | |
465 | return 1; | |
466 | } | |
467 | ||
d5d1baa1 | 468 | static inline int check_entry(const struct arpt_entry *e, const char *name) |
1da177e4 | 469 | { |
5452e425 | 470 | const struct arpt_entry_target *t; |
1da177e4 LT |
471 | |
472 | if (!arp_checkentry(&e->arp)) { | |
473 | duprintf("arp_tables: arp check failed %p %s.\n", e, name); | |
474 | return -EINVAL; | |
475 | } | |
476 | ||
590bdf7f DM |
477 | if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset) |
478 | return -EINVAL; | |
479 | ||
d5d1baa1 | 480 | t = arpt_get_target_c(e); |
590bdf7f DM |
481 | if (e->target_offset + t->u.target_size > e->next_offset) |
482 | return -EINVAL; | |
483 | ||
fb5b6095 PM |
484 | return 0; |
485 | } | |
486 | ||
487 | static inline int check_target(struct arpt_entry *e, const char *name) | |
488 | { | |
af5d6dc2 | 489 | struct arpt_entry_target *t = arpt_get_target(e); |
fb5b6095 | 490 | int ret; |
af5d6dc2 JE |
491 | struct xt_tgchk_param par = { |
492 | .table = name, | |
493 | .entryinfo = e, | |
494 | .target = t->u.kernel.target, | |
495 | .targinfo = t->data, | |
496 | .hook_mask = e->comefrom, | |
916a917d | 497 | .family = NFPROTO_ARP, |
af5d6dc2 JE |
498 | }; |
499 | ||
916a917d | 500 | ret = xt_check_target(&par, t->u.target_size - sizeof(*t), 0, false); |
367c6790 | 501 | if (ret < 0) { |
fb5b6095 PM |
502 | duprintf("arp_tables: check failed for `%s'.\n", |
503 | t->u.kernel.target->name); | |
367c6790 | 504 | return ret; |
fb5b6095 | 505 | } |
367c6790 | 506 | return 0; |
fb5b6095 PM |
507 | } |
508 | ||
509 | static inline int | |
0559518b | 510 | find_check_entry(struct arpt_entry *e, const char *name, unsigned int size) |
fb5b6095 PM |
511 | { |
512 | struct arpt_entry_target *t; | |
95eea855 | 513 | struct xt_target *target; |
fb5b6095 PM |
514 | int ret; |
515 | ||
516 | ret = check_entry(e, name); | |
517 | if (ret) | |
518 | return ret; | |
519 | ||
520 | t = arpt_get_target(e); | |
d2a7b6ba JE |
521 | target = xt_request_find_target(NFPROTO_ARP, t->u.user.name, |
522 | t->u.user.revision); | |
523 | if (IS_ERR(target)) { | |
fb5b6095 | 524 | duprintf("find_check_entry: `%s' not found\n", t->u.user.name); |
d2a7b6ba | 525 | ret = PTR_ERR(target); |
1da177e4 LT |
526 | goto out; |
527 | } | |
1da177e4 | 528 | t->u.kernel.target = target; |
1da177e4 | 529 | |
fb5b6095 | 530 | ret = check_target(e, name); |
3cdc7c95 PM |
531 | if (ret) |
532 | goto err; | |
1da177e4 | 533 | return 0; |
3cdc7c95 PM |
534 | err: |
535 | module_put(t->u.kernel.target->me); | |
1da177e4 LT |
536 | out: |
537 | return ret; | |
538 | } | |
539 | ||
d5d1baa1 | 540 | static bool check_underflow(const struct arpt_entry *e) |
e2fe35c1 JE |
541 | { |
542 | const struct arpt_entry_target *t; | |
543 | unsigned int verdict; | |
544 | ||
545 | if (!unconditional(&e->arp)) | |
546 | return false; | |
d5d1baa1 | 547 | t = arpt_get_target_c(e); |
e2fe35c1 JE |
548 | if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0) |
549 | return false; | |
550 | verdict = ((struct arpt_standard_target *)t)->verdict; | |
551 | verdict = -verdict - 1; | |
552 | return verdict == NF_DROP || verdict == NF_ACCEPT; | |
553 | } | |
554 | ||
1da177e4 | 555 | static inline int check_entry_size_and_hooks(struct arpt_entry *e, |
2e4e6a17 | 556 | struct xt_table_info *newinfo, |
d5d1baa1 JE |
557 | const unsigned char *base, |
558 | const unsigned char *limit, | |
1da177e4 LT |
559 | const unsigned int *hook_entries, |
560 | const unsigned int *underflows, | |
0559518b | 561 | unsigned int valid_hooks) |
1da177e4 LT |
562 | { |
563 | unsigned int h; | |
564 | ||
3666ed1c JP |
565 | if ((unsigned long)e % __alignof__(struct arpt_entry) != 0 || |
566 | (unsigned char *)e + sizeof(struct arpt_entry) >= limit) { | |
1da177e4 LT |
567 | duprintf("Bad offset %p\n", e); |
568 | return -EINVAL; | |
569 | } | |
570 | ||
571 | if (e->next_offset | |
572 | < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) { | |
573 | duprintf("checking: element %p size %u\n", | |
574 | e, e->next_offset); | |
575 | return -EINVAL; | |
576 | } | |
577 | ||
578 | /* Check hooks & underflows */ | |
579 | for (h = 0; h < NF_ARP_NUMHOOKS; h++) { | |
a7d51738 JE |
580 | if (!(valid_hooks & (1 << h))) |
581 | continue; | |
1da177e4 LT |
582 | if ((unsigned char *)e - base == hook_entries[h]) |
583 | newinfo->hook_entry[h] = hook_entries[h]; | |
90e7d4ab | 584 | if ((unsigned char *)e - base == underflows[h]) { |
e2fe35c1 JE |
585 | if (!check_underflow(e)) { |
586 | pr_err("Underflows must be unconditional and " | |
587 | "use the STANDARD target with " | |
588 | "ACCEPT/DROP\n"); | |
90e7d4ab JE |
589 | return -EINVAL; |
590 | } | |
1da177e4 | 591 | newinfo->underflow[h] = underflows[h]; |
90e7d4ab | 592 | } |
1da177e4 LT |
593 | } |
594 | ||
1da177e4 | 595 | /* Clear counters and comefrom */ |
2e4e6a17 | 596 | e->counters = ((struct xt_counters) { 0, 0 }); |
1da177e4 | 597 | e->comefrom = 0; |
1da177e4 LT |
598 | return 0; |
599 | } | |
600 | ||
0559518b | 601 | static inline void cleanup_entry(struct arpt_entry *e) |
1da177e4 | 602 | { |
a2df1648 | 603 | struct xt_tgdtor_param par; |
1da177e4 LT |
604 | struct arpt_entry_target *t; |
605 | ||
1da177e4 | 606 | t = arpt_get_target(e); |
a2df1648 JE |
607 | par.target = t->u.kernel.target; |
608 | par.targinfo = t->data; | |
916a917d | 609 | par.family = NFPROTO_ARP; |
a2df1648 JE |
610 | if (par.target->destroy != NULL) |
611 | par.target->destroy(&par); | |
612 | module_put(par.target->me); | |
1da177e4 LT |
613 | } |
614 | ||
615 | /* Checks and translates the user-supplied table segment (held in | |
616 | * newinfo). | |
617 | */ | |
0f234214 JE |
618 | static int translate_table(struct xt_table_info *newinfo, void *entry0, |
619 | const struct arpt_replace *repl) | |
1da177e4 | 620 | { |
72b2b1dd | 621 | struct arpt_entry *iter; |
1da177e4 | 622 | unsigned int i; |
72b2b1dd | 623 | int ret = 0; |
1da177e4 | 624 | |
0f234214 JE |
625 | newinfo->size = repl->size; |
626 | newinfo->number = repl->num_entries; | |
1da177e4 LT |
627 | |
628 | /* Init all hooks to impossible value. */ | |
629 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { | |
630 | newinfo->hook_entry[i] = 0xFFFFFFFF; | |
631 | newinfo->underflow[i] = 0xFFFFFFFF; | |
632 | } | |
633 | ||
634 | duprintf("translate_table: size %u\n", newinfo->size); | |
635 | i = 0; | |
636 | ||
637 | /* Walk through entries, checking offsets. */ | |
72b2b1dd JE |
638 | xt_entry_foreach(iter, entry0, newinfo->size) { |
639 | ret = check_entry_size_and_hooks(iter, newinfo, entry0, | |
6b4ff2d7 JE |
640 | entry0 + repl->size, |
641 | repl->hook_entry, | |
642 | repl->underflow, | |
643 | repl->valid_hooks); | |
72b2b1dd JE |
644 | if (ret != 0) |
645 | break; | |
0559518b | 646 | ++i; |
f3c5c1bf JE |
647 | if (strcmp(arpt_get_target(iter)->u.user.name, |
648 | XT_ERROR_TARGET) == 0) | |
649 | ++newinfo->stacksize; | |
72b2b1dd | 650 | } |
1da177e4 LT |
651 | duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret); |
652 | if (ret != 0) | |
653 | return ret; | |
654 | ||
0f234214 | 655 | if (i != repl->num_entries) { |
1da177e4 | 656 | duprintf("translate_table: %u not %u entries\n", |
0f234214 | 657 | i, repl->num_entries); |
1da177e4 LT |
658 | return -EINVAL; |
659 | } | |
660 | ||
661 | /* Check hooks all assigned */ | |
662 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { | |
663 | /* Only hooks which are valid */ | |
0f234214 | 664 | if (!(repl->valid_hooks & (1 << i))) |
1da177e4 LT |
665 | continue; |
666 | if (newinfo->hook_entry[i] == 0xFFFFFFFF) { | |
667 | duprintf("Invalid hook entry %u %u\n", | |
0f234214 | 668 | i, repl->hook_entry[i]); |
1da177e4 LT |
669 | return -EINVAL; |
670 | } | |
671 | if (newinfo->underflow[i] == 0xFFFFFFFF) { | |
672 | duprintf("Invalid underflow %u %u\n", | |
0f234214 | 673 | i, repl->underflow[i]); |
1da177e4 LT |
674 | return -EINVAL; |
675 | } | |
676 | } | |
677 | ||
0f234214 | 678 | if (!mark_source_chains(newinfo, repl->valid_hooks, entry0)) { |
74c9c0c1 DM |
679 | duprintf("Looping hook\n"); |
680 | return -ELOOP; | |
681 | } | |
682 | ||
1da177e4 LT |
683 | /* Finally, each sanity check must pass */ |
684 | i = 0; | |
72b2b1dd | 685 | xt_entry_foreach(iter, entry0, newinfo->size) { |
0f234214 | 686 | ret = find_check_entry(iter, repl->name, repl->size); |
72b2b1dd JE |
687 | if (ret != 0) |
688 | break; | |
0559518b | 689 | ++i; |
72b2b1dd | 690 | } |
1da177e4 | 691 | |
74c9c0c1 | 692 | if (ret != 0) { |
0559518b JE |
693 | xt_entry_foreach(iter, entry0, newinfo->size) { |
694 | if (i-- == 0) | |
72b2b1dd | 695 | break; |
0559518b JE |
696 | cleanup_entry(iter); |
697 | } | |
74c9c0c1 | 698 | return ret; |
1da177e4 LT |
699 | } |
700 | ||
701 | /* And one copy for every other CPU */ | |
6f912042 | 702 | for_each_possible_cpu(i) { |
31836064 ED |
703 | if (newinfo->entries[i] && newinfo->entries[i] != entry0) |
704 | memcpy(newinfo->entries[i], entry0, newinfo->size); | |
1da177e4 LT |
705 | } |
706 | ||
707 | return ret; | |
708 | } | |
709 | ||
2e4e6a17 HW |
710 | static void get_counters(const struct xt_table_info *t, |
711 | struct xt_counters counters[]) | |
1da177e4 | 712 | { |
72b2b1dd | 713 | struct arpt_entry *iter; |
1da177e4 LT |
714 | unsigned int cpu; |
715 | unsigned int i; | |
31836064 ED |
716 | unsigned int curcpu; |
717 | ||
718 | /* Instead of clearing (by a previous call to memset()) | |
719 | * the counters and using adds, we set the counters | |
720 | * with data used by 'current' CPU | |
942e4a2b SH |
721 | * |
722 | * Bottom half has to be disabled to prevent deadlock | |
723 | * if new softirq were to run and call ipt_do_table | |
31836064 | 724 | */ |
942e4a2b SH |
725 | local_bh_disable(); |
726 | curcpu = smp_processor_id(); | |
31836064 ED |
727 | |
728 | i = 0; | |
0559518b JE |
729 | xt_entry_foreach(iter, t->entries[curcpu], t->size) { |
730 | SET_COUNTER(counters[i], iter->counters.bcnt, | |
6b4ff2d7 | 731 | iter->counters.pcnt); |
0559518b JE |
732 | ++i; |
733 | } | |
1da177e4 | 734 | |
6f912042 | 735 | for_each_possible_cpu(cpu) { |
31836064 ED |
736 | if (cpu == curcpu) |
737 | continue; | |
1da177e4 | 738 | i = 0; |
942e4a2b | 739 | xt_info_wrlock(cpu); |
0559518b JE |
740 | xt_entry_foreach(iter, t->entries[cpu], t->size) { |
741 | ADD_COUNTER(counters[i], iter->counters.bcnt, | |
6b4ff2d7 | 742 | iter->counters.pcnt); |
0559518b JE |
743 | ++i; |
744 | } | |
942e4a2b | 745 | xt_info_wrunlock(cpu); |
1da177e4 | 746 | } |
78454473 SH |
747 | local_bh_enable(); |
748 | } | |
749 | ||
d5d1baa1 | 750 | static struct xt_counters *alloc_counters(const struct xt_table *table) |
1da177e4 | 751 | { |
27e2c26b | 752 | unsigned int countersize; |
2e4e6a17 | 753 | struct xt_counters *counters; |
d5d1baa1 | 754 | const struct xt_table_info *private = table->private; |
1da177e4 LT |
755 | |
756 | /* We need atomic snapshot of counters: rest doesn't change | |
757 | * (other than comefrom, which userspace doesn't care | |
758 | * about). | |
759 | */ | |
2e4e6a17 | 760 | countersize = sizeof(struct xt_counters) * private->number; |
e12f8e29 | 761 | counters = vmalloc(countersize); |
1da177e4 LT |
762 | |
763 | if (counters == NULL) | |
942e4a2b | 764 | return ERR_PTR(-ENOMEM); |
78454473 | 765 | |
942e4a2b | 766 | get_counters(private, counters); |
1da177e4 | 767 | |
27e2c26b PM |
768 | return counters; |
769 | } | |
770 | ||
771 | static int copy_entries_to_user(unsigned int total_size, | |
d5d1baa1 | 772 | const struct xt_table *table, |
27e2c26b PM |
773 | void __user *userptr) |
774 | { | |
775 | unsigned int off, num; | |
d5d1baa1 | 776 | const struct arpt_entry *e; |
27e2c26b | 777 | struct xt_counters *counters; |
4abff077 | 778 | struct xt_table_info *private = table->private; |
27e2c26b PM |
779 | int ret = 0; |
780 | void *loc_cpu_entry; | |
781 | ||
782 | counters = alloc_counters(table); | |
783 | if (IS_ERR(counters)) | |
784 | return PTR_ERR(counters); | |
785 | ||
2e4e6a17 | 786 | loc_cpu_entry = private->entries[raw_smp_processor_id()]; |
31836064 ED |
787 | /* ... then copy entire thing ... */ |
788 | if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) { | |
1da177e4 LT |
789 | ret = -EFAULT; |
790 | goto free_counters; | |
791 | } | |
792 | ||
793 | /* FIXME: use iterator macros --RR */ | |
794 | /* ... then go back and fix counters and names */ | |
795 | for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){ | |
d5d1baa1 | 796 | const struct arpt_entry_target *t; |
1da177e4 | 797 | |
31836064 | 798 | e = (struct arpt_entry *)(loc_cpu_entry + off); |
1da177e4 LT |
799 | if (copy_to_user(userptr + off |
800 | + offsetof(struct arpt_entry, counters), | |
801 | &counters[num], | |
802 | sizeof(counters[num])) != 0) { | |
803 | ret = -EFAULT; | |
804 | goto free_counters; | |
805 | } | |
806 | ||
d5d1baa1 | 807 | t = arpt_get_target_c(e); |
1da177e4 LT |
808 | if (copy_to_user(userptr + off + e->target_offset |
809 | + offsetof(struct arpt_entry_target, | |
810 | u.user.name), | |
811 | t->u.kernel.target->name, | |
812 | strlen(t->u.kernel.target->name)+1) != 0) { | |
813 | ret = -EFAULT; | |
814 | goto free_counters; | |
815 | } | |
816 | } | |
817 | ||
818 | free_counters: | |
819 | vfree(counters); | |
820 | return ret; | |
821 | } | |
822 | ||
d6a2ba07 | 823 | #ifdef CONFIG_COMPAT |
739674fb | 824 | static void compat_standard_from_user(void *dst, const void *src) |
d6a2ba07 PM |
825 | { |
826 | int v = *(compat_int_t *)src; | |
827 | ||
828 | if (v > 0) | |
ee999d8b | 829 | v += xt_compat_calc_jump(NFPROTO_ARP, v); |
d6a2ba07 PM |
830 | memcpy(dst, &v, sizeof(v)); |
831 | } | |
832 | ||
739674fb | 833 | static int compat_standard_to_user(void __user *dst, const void *src) |
d6a2ba07 PM |
834 | { |
835 | compat_int_t cv = *(int *)src; | |
836 | ||
837 | if (cv > 0) | |
ee999d8b | 838 | cv -= xt_compat_calc_jump(NFPROTO_ARP, cv); |
d6a2ba07 PM |
839 | return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0; |
840 | } | |
841 | ||
d5d1baa1 | 842 | static int compat_calc_entry(const struct arpt_entry *e, |
d6a2ba07 | 843 | const struct xt_table_info *info, |
d5d1baa1 | 844 | const void *base, struct xt_table_info *newinfo) |
d6a2ba07 | 845 | { |
d5d1baa1 | 846 | const struct arpt_entry_target *t; |
d6a2ba07 PM |
847 | unsigned int entry_offset; |
848 | int off, i, ret; | |
849 | ||
850 | off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry); | |
851 | entry_offset = (void *)e - base; | |
852 | ||
d5d1baa1 | 853 | t = arpt_get_target_c(e); |
d6a2ba07 PM |
854 | off += xt_compat_target_offset(t->u.kernel.target); |
855 | newinfo->size -= off; | |
ee999d8b | 856 | ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off); |
d6a2ba07 PM |
857 | if (ret) |
858 | return ret; | |
859 | ||
860 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { | |
861 | if (info->hook_entry[i] && | |
862 | (e < (struct arpt_entry *)(base + info->hook_entry[i]))) | |
863 | newinfo->hook_entry[i] -= off; | |
864 | if (info->underflow[i] && | |
865 | (e < (struct arpt_entry *)(base + info->underflow[i]))) | |
866 | newinfo->underflow[i] -= off; | |
867 | } | |
868 | return 0; | |
869 | } | |
870 | ||
871 | static int compat_table_info(const struct xt_table_info *info, | |
872 | struct xt_table_info *newinfo) | |
873 | { | |
72b2b1dd | 874 | struct arpt_entry *iter; |
d6a2ba07 | 875 | void *loc_cpu_entry; |
0559518b | 876 | int ret; |
d6a2ba07 PM |
877 | |
878 | if (!newinfo || !info) | |
879 | return -EINVAL; | |
880 | ||
881 | /* we dont care about newinfo->entries[] */ | |
882 | memcpy(newinfo, info, offsetof(struct xt_table_info, entries)); | |
883 | newinfo->initial_entries = 0; | |
884 | loc_cpu_entry = info->entries[raw_smp_processor_id()]; | |
72b2b1dd JE |
885 | xt_entry_foreach(iter, loc_cpu_entry, info->size) { |
886 | ret = compat_calc_entry(iter, info, loc_cpu_entry, newinfo); | |
887 | if (ret != 0) | |
0559518b | 888 | return ret; |
72b2b1dd | 889 | } |
0559518b | 890 | return 0; |
d6a2ba07 PM |
891 | } |
892 | #endif | |
893 | ||
d5d1baa1 JE |
894 | static int get_info(struct net *net, void __user *user, |
895 | const int *len, int compat) | |
41acd975 PM |
896 | { |
897 | char name[ARPT_TABLE_MAXNAMELEN]; | |
4abff077 | 898 | struct xt_table *t; |
41acd975 PM |
899 | int ret; |
900 | ||
901 | if (*len != sizeof(struct arpt_getinfo)) { | |
902 | duprintf("length %u != %Zu\n", *len, | |
903 | sizeof(struct arpt_getinfo)); | |
904 | return -EINVAL; | |
905 | } | |
906 | ||
907 | if (copy_from_user(name, user, sizeof(name)) != 0) | |
908 | return -EFAULT; | |
909 | ||
910 | name[ARPT_TABLE_MAXNAMELEN-1] = '\0'; | |
d6a2ba07 PM |
911 | #ifdef CONFIG_COMPAT |
912 | if (compat) | |
ee999d8b | 913 | xt_compat_lock(NFPROTO_ARP); |
d6a2ba07 | 914 | #endif |
ee999d8b | 915 | t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name), |
41acd975 PM |
916 | "arptable_%s", name); |
917 | if (t && !IS_ERR(t)) { | |
918 | struct arpt_getinfo info; | |
5452e425 | 919 | const struct xt_table_info *private = t->private; |
d6a2ba07 | 920 | #ifdef CONFIG_COMPAT |
14c7dbe0 AD |
921 | struct xt_table_info tmp; |
922 | ||
d6a2ba07 | 923 | if (compat) { |
d6a2ba07 | 924 | ret = compat_table_info(private, &tmp); |
ee999d8b | 925 | xt_compat_flush_offsets(NFPROTO_ARP); |
d6a2ba07 PM |
926 | private = &tmp; |
927 | } | |
928 | #endif | |
41acd975 PM |
929 | info.valid_hooks = t->valid_hooks; |
930 | memcpy(info.hook_entry, private->hook_entry, | |
931 | sizeof(info.hook_entry)); | |
932 | memcpy(info.underflow, private->underflow, | |
933 | sizeof(info.underflow)); | |
934 | info.num_entries = private->number; | |
935 | info.size = private->size; | |
936 | strcpy(info.name, name); | |
937 | ||
938 | if (copy_to_user(user, &info, *len) != 0) | |
939 | ret = -EFAULT; | |
940 | else | |
941 | ret = 0; | |
942 | xt_table_unlock(t); | |
943 | module_put(t->me); | |
944 | } else | |
945 | ret = t ? PTR_ERR(t) : -ENOENT; | |
d6a2ba07 PM |
946 | #ifdef CONFIG_COMPAT |
947 | if (compat) | |
ee999d8b | 948 | xt_compat_unlock(NFPROTO_ARP); |
d6a2ba07 | 949 | #endif |
41acd975 PM |
950 | return ret; |
951 | } | |
952 | ||
79df341a | 953 | static int get_entries(struct net *net, struct arpt_get_entries __user *uptr, |
d5d1baa1 | 954 | const int *len) |
1da177e4 LT |
955 | { |
956 | int ret; | |
11f6dff8 | 957 | struct arpt_get_entries get; |
4abff077 | 958 | struct xt_table *t; |
1da177e4 | 959 | |
11f6dff8 PM |
960 | if (*len < sizeof(get)) { |
961 | duprintf("get_entries: %u < %Zu\n", *len, sizeof(get)); | |
962 | return -EINVAL; | |
963 | } | |
964 | if (copy_from_user(&get, uptr, sizeof(get)) != 0) | |
965 | return -EFAULT; | |
966 | if (*len != sizeof(struct arpt_get_entries) + get.size) { | |
967 | duprintf("get_entries: %u != %Zu\n", *len, | |
968 | sizeof(struct arpt_get_entries) + get.size); | |
969 | return -EINVAL; | |
970 | } | |
971 | ||
ee999d8b | 972 | t = xt_find_table_lock(net, NFPROTO_ARP, get.name); |
31fe4d33 | 973 | if (t && !IS_ERR(t)) { |
5452e425 JE |
974 | const struct xt_table_info *private = t->private; |
975 | ||
1da177e4 | 976 | duprintf("t->private->number = %u\n", |
2e4e6a17 | 977 | private->number); |
11f6dff8 | 978 | if (get.size == private->size) |
2e4e6a17 | 979 | ret = copy_entries_to_user(private->size, |
1da177e4 LT |
980 | t, uptr->entrytable); |
981 | else { | |
982 | duprintf("get_entries: I've got %u not %u!\n", | |
11f6dff8 | 983 | private->size, get.size); |
544473c1 | 984 | ret = -EAGAIN; |
1da177e4 | 985 | } |
6b7d31fc | 986 | module_put(t->me); |
2e4e6a17 | 987 | xt_table_unlock(t); |
1da177e4 | 988 | } else |
6b7d31fc | 989 | ret = t ? PTR_ERR(t) : -ENOENT; |
1da177e4 LT |
990 | |
991 | return ret; | |
992 | } | |
993 | ||
79df341a AD |
994 | static int __do_replace(struct net *net, const char *name, |
995 | unsigned int valid_hooks, | |
d6a2ba07 PM |
996 | struct xt_table_info *newinfo, |
997 | unsigned int num_counters, | |
998 | void __user *counters_ptr) | |
1da177e4 LT |
999 | { |
1000 | int ret; | |
4abff077 | 1001 | struct xt_table *t; |
d6a2ba07 | 1002 | struct xt_table_info *oldinfo; |
2e4e6a17 | 1003 | struct xt_counters *counters; |
d6a2ba07 | 1004 | void *loc_cpu_old_entry; |
72b2b1dd | 1005 | struct arpt_entry *iter; |
1da177e4 | 1006 | |
d6a2ba07 | 1007 | ret = 0; |
e12f8e29 | 1008 | counters = vmalloc(num_counters * sizeof(struct xt_counters)); |
1da177e4 LT |
1009 | if (!counters) { |
1010 | ret = -ENOMEM; | |
d6a2ba07 | 1011 | goto out; |
1da177e4 | 1012 | } |
1da177e4 | 1013 | |
ee999d8b | 1014 | t = try_then_request_module(xt_find_table_lock(net, NFPROTO_ARP, name), |
d6a2ba07 | 1015 | "arptable_%s", name); |
6b7d31fc HW |
1016 | if (!t || IS_ERR(t)) { |
1017 | ret = t ? PTR_ERR(t) : -ENOENT; | |
1da177e4 | 1018 | goto free_newinfo_counters_untrans; |
6b7d31fc | 1019 | } |
1da177e4 LT |
1020 | |
1021 | /* You lied! */ | |
d6a2ba07 | 1022 | if (valid_hooks != t->valid_hooks) { |
1da177e4 | 1023 | duprintf("Valid hook crap: %08X vs %08X\n", |
d6a2ba07 | 1024 | valid_hooks, t->valid_hooks); |
1da177e4 | 1025 | ret = -EINVAL; |
6b7d31fc | 1026 | goto put_module; |
1da177e4 LT |
1027 | } |
1028 | ||
d6a2ba07 | 1029 | oldinfo = xt_replace_table(t, num_counters, newinfo, &ret); |
1da177e4 LT |
1030 | if (!oldinfo) |
1031 | goto put_module; | |
1032 | ||
1033 | /* Update module usage count based on number of rules */ | |
1034 | duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n", | |
1035 | oldinfo->number, oldinfo->initial_entries, newinfo->number); | |
e905a9ed YH |
1036 | if ((oldinfo->number > oldinfo->initial_entries) || |
1037 | (newinfo->number <= oldinfo->initial_entries)) | |
1da177e4 LT |
1038 | module_put(t->me); |
1039 | if ((oldinfo->number > oldinfo->initial_entries) && | |
1040 | (newinfo->number <= oldinfo->initial_entries)) | |
1041 | module_put(t->me); | |
1042 | ||
942e4a2b | 1043 | /* Get the old counters, and synchronize with replace */ |
1da177e4 | 1044 | get_counters(oldinfo, counters); |
942e4a2b | 1045 | |
1da177e4 | 1046 | /* Decrease module usage counts and free resource */ |
31836064 | 1047 | loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()]; |
72b2b1dd | 1048 | xt_entry_foreach(iter, loc_cpu_old_entry, oldinfo->size) |
0559518b | 1049 | cleanup_entry(iter); |
31836064 | 1050 | |
2e4e6a17 | 1051 | xt_free_table_info(oldinfo); |
d6a2ba07 PM |
1052 | if (copy_to_user(counters_ptr, counters, |
1053 | sizeof(struct xt_counters) * num_counters) != 0) | |
1da177e4 LT |
1054 | ret = -EFAULT; |
1055 | vfree(counters); | |
2e4e6a17 | 1056 | xt_table_unlock(t); |
1da177e4 LT |
1057 | return ret; |
1058 | ||
1059 | put_module: | |
1060 | module_put(t->me); | |
2e4e6a17 | 1061 | xt_table_unlock(t); |
1da177e4 | 1062 | free_newinfo_counters_untrans: |
1da177e4 | 1063 | vfree(counters); |
d6a2ba07 PM |
1064 | out: |
1065 | return ret; | |
1066 | } | |
1067 | ||
d5d1baa1 JE |
1068 | static int do_replace(struct net *net, const void __user *user, |
1069 | unsigned int len) | |
d6a2ba07 PM |
1070 | { |
1071 | int ret; | |
1072 | struct arpt_replace tmp; | |
1073 | struct xt_table_info *newinfo; | |
1074 | void *loc_cpu_entry; | |
72b2b1dd | 1075 | struct arpt_entry *iter; |
d6a2ba07 PM |
1076 | |
1077 | if (copy_from_user(&tmp, user, sizeof(tmp)) != 0) | |
1078 | return -EFAULT; | |
1079 | ||
1080 | /* overflow check */ | |
1081 | if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters)) | |
1082 | return -ENOMEM; | |
1083 | ||
1084 | newinfo = xt_alloc_table_info(tmp.size); | |
1085 | if (!newinfo) | |
1086 | return -ENOMEM; | |
1087 | ||
1088 | /* choose the copy that is on our node/cpu */ | |
1089 | loc_cpu_entry = newinfo->entries[raw_smp_processor_id()]; | |
1090 | if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), | |
1091 | tmp.size) != 0) { | |
1092 | ret = -EFAULT; | |
1093 | goto free_newinfo; | |
1094 | } | |
1095 | ||
0f234214 | 1096 | ret = translate_table(newinfo, loc_cpu_entry, &tmp); |
d6a2ba07 PM |
1097 | if (ret != 0) |
1098 | goto free_newinfo; | |
1099 | ||
1100 | duprintf("arp_tables: Translated table\n"); | |
1101 | ||
79df341a | 1102 | ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo, |
d6a2ba07 PM |
1103 | tmp.num_counters, tmp.counters); |
1104 | if (ret) | |
1105 | goto free_newinfo_untrans; | |
1106 | return 0; | |
1107 | ||
1108 | free_newinfo_untrans: | |
72b2b1dd | 1109 | xt_entry_foreach(iter, loc_cpu_entry, newinfo->size) |
0559518b | 1110 | cleanup_entry(iter); |
1da177e4 | 1111 | free_newinfo: |
2e4e6a17 | 1112 | xt_free_table_info(newinfo); |
1da177e4 LT |
1113 | return ret; |
1114 | } | |
1115 | ||
d5d1baa1 JE |
1116 | static int do_add_counters(struct net *net, const void __user *user, |
1117 | unsigned int len, int compat) | |
1da177e4 | 1118 | { |
942e4a2b | 1119 | unsigned int i, curcpu; |
d6a2ba07 PM |
1120 | struct xt_counters_info tmp; |
1121 | struct xt_counters *paddc; | |
1122 | unsigned int num_counters; | |
5452e425 | 1123 | const char *name; |
d6a2ba07 PM |
1124 | int size; |
1125 | void *ptmp; | |
4abff077 | 1126 | struct xt_table *t; |
5452e425 | 1127 | const struct xt_table_info *private; |
6b7d31fc | 1128 | int ret = 0; |
31836064 | 1129 | void *loc_cpu_entry; |
72b2b1dd | 1130 | struct arpt_entry *iter; |
d6a2ba07 PM |
1131 | #ifdef CONFIG_COMPAT |
1132 | struct compat_xt_counters_info compat_tmp; | |
1da177e4 | 1133 | |
d6a2ba07 PM |
1134 | if (compat) { |
1135 | ptmp = &compat_tmp; | |
1136 | size = sizeof(struct compat_xt_counters_info); | |
1137 | } else | |
1138 | #endif | |
1139 | { | |
1140 | ptmp = &tmp; | |
1141 | size = sizeof(struct xt_counters_info); | |
1142 | } | |
1143 | ||
1144 | if (copy_from_user(ptmp, user, size) != 0) | |
1da177e4 LT |
1145 | return -EFAULT; |
1146 | ||
d6a2ba07 PM |
1147 | #ifdef CONFIG_COMPAT |
1148 | if (compat) { | |
1149 | num_counters = compat_tmp.num_counters; | |
1150 | name = compat_tmp.name; | |
1151 | } else | |
1152 | #endif | |
1153 | { | |
1154 | num_counters = tmp.num_counters; | |
1155 | name = tmp.name; | |
1156 | } | |
1157 | ||
1158 | if (len != size + num_counters * sizeof(struct xt_counters)) | |
1da177e4 LT |
1159 | return -EINVAL; |
1160 | ||
e12f8e29 | 1161 | paddc = vmalloc(len - size); |
1da177e4 LT |
1162 | if (!paddc) |
1163 | return -ENOMEM; | |
1164 | ||
d6a2ba07 | 1165 | if (copy_from_user(paddc, user + size, len - size) != 0) { |
1da177e4 LT |
1166 | ret = -EFAULT; |
1167 | goto free; | |
1168 | } | |
1169 | ||
ee999d8b | 1170 | t = xt_find_table_lock(net, NFPROTO_ARP, name); |
6b7d31fc HW |
1171 | if (!t || IS_ERR(t)) { |
1172 | ret = t ? PTR_ERR(t) : -ENOENT; | |
1da177e4 | 1173 | goto free; |
6b7d31fc | 1174 | } |
1da177e4 | 1175 | |
942e4a2b | 1176 | local_bh_disable(); |
2e4e6a17 | 1177 | private = t->private; |
d6a2ba07 | 1178 | if (private->number != num_counters) { |
1da177e4 LT |
1179 | ret = -EINVAL; |
1180 | goto unlock_up_free; | |
1181 | } | |
1182 | ||
1183 | i = 0; | |
31836064 | 1184 | /* Choose the copy that is on our node */ |
942e4a2b SH |
1185 | curcpu = smp_processor_id(); |
1186 | loc_cpu_entry = private->entries[curcpu]; | |
1187 | xt_info_wrlock(curcpu); | |
0559518b JE |
1188 | xt_entry_foreach(iter, loc_cpu_entry, private->size) { |
1189 | ADD_COUNTER(iter->counters, paddc[i].bcnt, paddc[i].pcnt); | |
1190 | ++i; | |
1191 | } | |
942e4a2b | 1192 | xt_info_wrunlock(curcpu); |
1da177e4 | 1193 | unlock_up_free: |
942e4a2b | 1194 | local_bh_enable(); |
2e4e6a17 | 1195 | xt_table_unlock(t); |
6b7d31fc | 1196 | module_put(t->me); |
1da177e4 LT |
1197 | free: |
1198 | vfree(paddc); | |
1199 | ||
1200 | return ret; | |
1201 | } | |
1202 | ||
d6a2ba07 | 1203 | #ifdef CONFIG_COMPAT |
0559518b | 1204 | static inline void compat_release_entry(struct compat_arpt_entry *e) |
d6a2ba07 PM |
1205 | { |
1206 | struct arpt_entry_target *t; | |
1207 | ||
d6a2ba07 PM |
1208 | t = compat_arpt_get_target(e); |
1209 | module_put(t->u.kernel.target->me); | |
d6a2ba07 PM |
1210 | } |
1211 | ||
1212 | static inline int | |
1213 | check_compat_entry_size_and_hooks(struct compat_arpt_entry *e, | |
1214 | struct xt_table_info *newinfo, | |
1215 | unsigned int *size, | |
d5d1baa1 JE |
1216 | const unsigned char *base, |
1217 | const unsigned char *limit, | |
1218 | const unsigned int *hook_entries, | |
1219 | const unsigned int *underflows, | |
d6a2ba07 PM |
1220 | const char *name) |
1221 | { | |
1222 | struct arpt_entry_target *t; | |
1223 | struct xt_target *target; | |
1224 | unsigned int entry_offset; | |
1225 | int ret, off, h; | |
1226 | ||
1227 | duprintf("check_compat_entry_size_and_hooks %p\n", e); | |
3666ed1c JP |
1228 | if ((unsigned long)e % __alignof__(struct compat_arpt_entry) != 0 || |
1229 | (unsigned char *)e + sizeof(struct compat_arpt_entry) >= limit) { | |
d6a2ba07 PM |
1230 | duprintf("Bad offset %p, limit = %p\n", e, limit); |
1231 | return -EINVAL; | |
1232 | } | |
1233 | ||
1234 | if (e->next_offset < sizeof(struct compat_arpt_entry) + | |
1235 | sizeof(struct compat_xt_entry_target)) { | |
1236 | duprintf("checking: element %p size %u\n", | |
1237 | e, e->next_offset); | |
1238 | return -EINVAL; | |
1239 | } | |
1240 | ||
1241 | /* For purposes of check_entry casting the compat entry is fine */ | |
1242 | ret = check_entry((struct arpt_entry *)e, name); | |
1243 | if (ret) | |
1244 | return ret; | |
1245 | ||
1246 | off = sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry); | |
1247 | entry_offset = (void *)e - (void *)base; | |
1248 | ||
1249 | t = compat_arpt_get_target(e); | |
d2a7b6ba JE |
1250 | target = xt_request_find_target(NFPROTO_ARP, t->u.user.name, |
1251 | t->u.user.revision); | |
1252 | if (IS_ERR(target)) { | |
d6a2ba07 PM |
1253 | duprintf("check_compat_entry_size_and_hooks: `%s' not found\n", |
1254 | t->u.user.name); | |
d2a7b6ba | 1255 | ret = PTR_ERR(target); |
d6a2ba07 PM |
1256 | goto out; |
1257 | } | |
1258 | t->u.kernel.target = target; | |
1259 | ||
1260 | off += xt_compat_target_offset(target); | |
1261 | *size += off; | |
ee999d8b | 1262 | ret = xt_compat_add_offset(NFPROTO_ARP, entry_offset, off); |
d6a2ba07 PM |
1263 | if (ret) |
1264 | goto release_target; | |
1265 | ||
1266 | /* Check hooks & underflows */ | |
1267 | for (h = 0; h < NF_ARP_NUMHOOKS; h++) { | |
1268 | if ((unsigned char *)e - base == hook_entries[h]) | |
1269 | newinfo->hook_entry[h] = hook_entries[h]; | |
1270 | if ((unsigned char *)e - base == underflows[h]) | |
1271 | newinfo->underflow[h] = underflows[h]; | |
1272 | } | |
1273 | ||
1274 | /* Clear counters and comefrom */ | |
1275 | memset(&e->counters, 0, sizeof(e->counters)); | |
1276 | e->comefrom = 0; | |
d6a2ba07 PM |
1277 | return 0; |
1278 | ||
1279 | release_target: | |
1280 | module_put(t->u.kernel.target->me); | |
1281 | out: | |
1282 | return ret; | |
1283 | } | |
1284 | ||
1285 | static int | |
1286 | compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr, | |
1287 | unsigned int *size, const char *name, | |
1288 | struct xt_table_info *newinfo, unsigned char *base) | |
1289 | { | |
1290 | struct arpt_entry_target *t; | |
1291 | struct xt_target *target; | |
1292 | struct arpt_entry *de; | |
1293 | unsigned int origsize; | |
1294 | int ret, h; | |
1295 | ||
1296 | ret = 0; | |
1297 | origsize = *size; | |
1298 | de = (struct arpt_entry *)*dstptr; | |
1299 | memcpy(de, e, sizeof(struct arpt_entry)); | |
1300 | memcpy(&de->counters, &e->counters, sizeof(e->counters)); | |
1301 | ||
1302 | *dstptr += sizeof(struct arpt_entry); | |
1303 | *size += sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry); | |
1304 | ||
1305 | de->target_offset = e->target_offset - (origsize - *size); | |
1306 | t = compat_arpt_get_target(e); | |
1307 | target = t->u.kernel.target; | |
1308 | xt_compat_target_from_user(t, dstptr, size); | |
1309 | ||
1310 | de->next_offset = e->next_offset - (origsize - *size); | |
1311 | for (h = 0; h < NF_ARP_NUMHOOKS; h++) { | |
1312 | if ((unsigned char *)de - base < newinfo->hook_entry[h]) | |
1313 | newinfo->hook_entry[h] -= origsize - *size; | |
1314 | if ((unsigned char *)de - base < newinfo->underflow[h]) | |
1315 | newinfo->underflow[h] -= origsize - *size; | |
1316 | } | |
1317 | return ret; | |
1318 | } | |
1319 | ||
d6a2ba07 PM |
1320 | static int translate_compat_table(const char *name, |
1321 | unsigned int valid_hooks, | |
1322 | struct xt_table_info **pinfo, | |
1323 | void **pentry0, | |
1324 | unsigned int total_size, | |
1325 | unsigned int number, | |
1326 | unsigned int *hook_entries, | |
1327 | unsigned int *underflows) | |
1328 | { | |
1329 | unsigned int i, j; | |
1330 | struct xt_table_info *newinfo, *info; | |
1331 | void *pos, *entry0, *entry1; | |
72b2b1dd JE |
1332 | struct compat_arpt_entry *iter0; |
1333 | struct arpt_entry *iter1; | |
d6a2ba07 | 1334 | unsigned int size; |
72b2b1dd | 1335 | int ret = 0; |
d6a2ba07 PM |
1336 | |
1337 | info = *pinfo; | |
1338 | entry0 = *pentry0; | |
1339 | size = total_size; | |
1340 | info->number = number; | |
1341 | ||
1342 | /* Init all hooks to impossible value. */ | |
1343 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { | |
1344 | info->hook_entry[i] = 0xFFFFFFFF; | |
1345 | info->underflow[i] = 0xFFFFFFFF; | |
1346 | } | |
1347 | ||
1348 | duprintf("translate_compat_table: size %u\n", info->size); | |
1349 | j = 0; | |
ee999d8b | 1350 | xt_compat_lock(NFPROTO_ARP); |
d6a2ba07 | 1351 | /* Walk through entries, checking offsets. */ |
72b2b1dd JE |
1352 | xt_entry_foreach(iter0, entry0, total_size) { |
1353 | ret = check_compat_entry_size_and_hooks(iter0, info, &size, | |
6b4ff2d7 JE |
1354 | entry0, |
1355 | entry0 + total_size, | |
1356 | hook_entries, | |
1357 | underflows, | |
1358 | name); | |
72b2b1dd | 1359 | if (ret != 0) |
0559518b JE |
1360 | goto out_unlock; |
1361 | ++j; | |
72b2b1dd | 1362 | } |
d6a2ba07 PM |
1363 | |
1364 | ret = -EINVAL; | |
1365 | if (j != number) { | |
1366 | duprintf("translate_compat_table: %u not %u entries\n", | |
1367 | j, number); | |
1368 | goto out_unlock; | |
1369 | } | |
1370 | ||
1371 | /* Check hooks all assigned */ | |
1372 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { | |
1373 | /* Only hooks which are valid */ | |
1374 | if (!(valid_hooks & (1 << i))) | |
1375 | continue; | |
1376 | if (info->hook_entry[i] == 0xFFFFFFFF) { | |
1377 | duprintf("Invalid hook entry %u %u\n", | |
1378 | i, hook_entries[i]); | |
1379 | goto out_unlock; | |
1380 | } | |
1381 | if (info->underflow[i] == 0xFFFFFFFF) { | |
1382 | duprintf("Invalid underflow %u %u\n", | |
1383 | i, underflows[i]); | |
1384 | goto out_unlock; | |
1385 | } | |
1386 | } | |
1387 | ||
1388 | ret = -ENOMEM; | |
1389 | newinfo = xt_alloc_table_info(size); | |
1390 | if (!newinfo) | |
1391 | goto out_unlock; | |
1392 | ||
1393 | newinfo->number = number; | |
1394 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { | |
1395 | newinfo->hook_entry[i] = info->hook_entry[i]; | |
1396 | newinfo->underflow[i] = info->underflow[i]; | |
1397 | } | |
1398 | entry1 = newinfo->entries[raw_smp_processor_id()]; | |
1399 | pos = entry1; | |
1400 | size = total_size; | |
72b2b1dd | 1401 | xt_entry_foreach(iter0, entry0, total_size) { |
6b4ff2d7 JE |
1402 | ret = compat_copy_entry_from_user(iter0, &pos, &size, |
1403 | name, newinfo, entry1); | |
72b2b1dd JE |
1404 | if (ret != 0) |
1405 | break; | |
1406 | } | |
ee999d8b JE |
1407 | xt_compat_flush_offsets(NFPROTO_ARP); |
1408 | xt_compat_unlock(NFPROTO_ARP); | |
d6a2ba07 PM |
1409 | if (ret) |
1410 | goto free_newinfo; | |
1411 | ||
1412 | ret = -ELOOP; | |
1413 | if (!mark_source_chains(newinfo, valid_hooks, entry1)) | |
1414 | goto free_newinfo; | |
1415 | ||
1416 | i = 0; | |
72b2b1dd | 1417 | xt_entry_foreach(iter1, entry1, newinfo->size) { |
0559518b | 1418 | ret = check_target(iter1, name); |
72b2b1dd JE |
1419 | if (ret != 0) |
1420 | break; | |
0559518b | 1421 | ++i; |
72b2b1dd | 1422 | } |
d6a2ba07 | 1423 | if (ret) { |
72b2b1dd JE |
1424 | /* |
1425 | * The first i matches need cleanup_entry (calls ->destroy) | |
1426 | * because they had called ->check already. The other j-i | |
1427 | * entries need only release. | |
1428 | */ | |
1429 | int skip = i; | |
d6a2ba07 | 1430 | j -= i; |
72b2b1dd JE |
1431 | xt_entry_foreach(iter0, entry0, newinfo->size) { |
1432 | if (skip-- > 0) | |
1433 | continue; | |
0559518b | 1434 | if (j-- == 0) |
72b2b1dd | 1435 | break; |
0559518b | 1436 | compat_release_entry(iter0); |
72b2b1dd | 1437 | } |
0559518b JE |
1438 | xt_entry_foreach(iter1, entry1, newinfo->size) { |
1439 | if (i-- == 0) | |
72b2b1dd | 1440 | break; |
0559518b JE |
1441 | cleanup_entry(iter1); |
1442 | } | |
d6a2ba07 PM |
1443 | xt_free_table_info(newinfo); |
1444 | return ret; | |
1445 | } | |
1446 | ||
1447 | /* And one copy for every other CPU */ | |
1448 | for_each_possible_cpu(i) | |
1449 | if (newinfo->entries[i] && newinfo->entries[i] != entry1) | |
1450 | memcpy(newinfo->entries[i], entry1, newinfo->size); | |
1451 | ||
1452 | *pinfo = newinfo; | |
1453 | *pentry0 = entry1; | |
1454 | xt_free_table_info(info); | |
1455 | return 0; | |
1456 | ||
1457 | free_newinfo: | |
1458 | xt_free_table_info(newinfo); | |
1459 | out: | |
0559518b JE |
1460 | xt_entry_foreach(iter0, entry0, total_size) { |
1461 | if (j-- == 0) | |
72b2b1dd | 1462 | break; |
0559518b JE |
1463 | compat_release_entry(iter0); |
1464 | } | |
d6a2ba07 PM |
1465 | return ret; |
1466 | out_unlock: | |
ee999d8b JE |
1467 | xt_compat_flush_offsets(NFPROTO_ARP); |
1468 | xt_compat_unlock(NFPROTO_ARP); | |
d6a2ba07 PM |
1469 | goto out; |
1470 | } | |
1471 | ||
1472 | struct compat_arpt_replace { | |
1473 | char name[ARPT_TABLE_MAXNAMELEN]; | |
1474 | u32 valid_hooks; | |
1475 | u32 num_entries; | |
1476 | u32 size; | |
1477 | u32 hook_entry[NF_ARP_NUMHOOKS]; | |
1478 | u32 underflow[NF_ARP_NUMHOOKS]; | |
1479 | u32 num_counters; | |
1480 | compat_uptr_t counters; | |
1481 | struct compat_arpt_entry entries[0]; | |
1482 | }; | |
1483 | ||
79df341a AD |
1484 | static int compat_do_replace(struct net *net, void __user *user, |
1485 | unsigned int len) | |
d6a2ba07 PM |
1486 | { |
1487 | int ret; | |
1488 | struct compat_arpt_replace tmp; | |
1489 | struct xt_table_info *newinfo; | |
1490 | void *loc_cpu_entry; | |
72b2b1dd | 1491 | struct arpt_entry *iter; |
d6a2ba07 PM |
1492 | |
1493 | if (copy_from_user(&tmp, user, sizeof(tmp)) != 0) | |
1494 | return -EFAULT; | |
1495 | ||
1496 | /* overflow check */ | |
1497 | if (tmp.size >= INT_MAX / num_possible_cpus()) | |
1498 | return -ENOMEM; | |
1499 | if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters)) | |
1500 | return -ENOMEM; | |
1501 | ||
1502 | newinfo = xt_alloc_table_info(tmp.size); | |
1503 | if (!newinfo) | |
1504 | return -ENOMEM; | |
1505 | ||
1506 | /* choose the copy that is on our node/cpu */ | |
1507 | loc_cpu_entry = newinfo->entries[raw_smp_processor_id()]; | |
1508 | if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), tmp.size) != 0) { | |
1509 | ret = -EFAULT; | |
1510 | goto free_newinfo; | |
1511 | } | |
1512 | ||
1513 | ret = translate_compat_table(tmp.name, tmp.valid_hooks, | |
1514 | &newinfo, &loc_cpu_entry, tmp.size, | |
1515 | tmp.num_entries, tmp.hook_entry, | |
1516 | tmp.underflow); | |
1517 | if (ret != 0) | |
1518 | goto free_newinfo; | |
1519 | ||
1520 | duprintf("compat_do_replace: Translated table\n"); | |
1521 | ||
79df341a | 1522 | ret = __do_replace(net, tmp.name, tmp.valid_hooks, newinfo, |
d6a2ba07 PM |
1523 | tmp.num_counters, compat_ptr(tmp.counters)); |
1524 | if (ret) | |
1525 | goto free_newinfo_untrans; | |
1526 | return 0; | |
1527 | ||
1528 | free_newinfo_untrans: | |
72b2b1dd | 1529 | xt_entry_foreach(iter, loc_cpu_entry, newinfo->size) |
0559518b | 1530 | cleanup_entry(iter); |
d6a2ba07 PM |
1531 | free_newinfo: |
1532 | xt_free_table_info(newinfo); | |
1533 | return ret; | |
1534 | } | |
1535 | ||
1536 | static int compat_do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, | |
1537 | unsigned int len) | |
1538 | { | |
1539 | int ret; | |
1540 | ||
1541 | if (!capable(CAP_NET_ADMIN)) | |
1542 | return -EPERM; | |
1543 | ||
1544 | switch (cmd) { | |
1545 | case ARPT_SO_SET_REPLACE: | |
3b1e0a65 | 1546 | ret = compat_do_replace(sock_net(sk), user, len); |
d6a2ba07 PM |
1547 | break; |
1548 | ||
1549 | case ARPT_SO_SET_ADD_COUNTERS: | |
3b1e0a65 | 1550 | ret = do_add_counters(sock_net(sk), user, len, 1); |
d6a2ba07 PM |
1551 | break; |
1552 | ||
1553 | default: | |
1554 | duprintf("do_arpt_set_ctl: unknown request %i\n", cmd); | |
1555 | ret = -EINVAL; | |
1556 | } | |
1557 | ||
1558 | return ret; | |
1559 | } | |
1560 | ||
1561 | static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr, | |
1562 | compat_uint_t *size, | |
1563 | struct xt_counters *counters, | |
0559518b | 1564 | unsigned int i) |
d6a2ba07 PM |
1565 | { |
1566 | struct arpt_entry_target *t; | |
1567 | struct compat_arpt_entry __user *ce; | |
1568 | u_int16_t target_offset, next_offset; | |
1569 | compat_uint_t origsize; | |
1570 | int ret; | |
1571 | ||
d6a2ba07 PM |
1572 | origsize = *size; |
1573 | ce = (struct compat_arpt_entry __user *)*dstptr; | |
0559518b JE |
1574 | if (copy_to_user(ce, e, sizeof(struct arpt_entry)) != 0 || |
1575 | copy_to_user(&ce->counters, &counters[i], | |
1576 | sizeof(counters[i])) != 0) | |
1577 | return -EFAULT; | |
d6a2ba07 PM |
1578 | |
1579 | *dstptr += sizeof(struct compat_arpt_entry); | |
1580 | *size -= sizeof(struct arpt_entry) - sizeof(struct compat_arpt_entry); | |
1581 | ||
1582 | target_offset = e->target_offset - (origsize - *size); | |
1583 | ||
1584 | t = arpt_get_target(e); | |
1585 | ret = xt_compat_target_to_user(t, dstptr, size); | |
1586 | if (ret) | |
0559518b | 1587 | return ret; |
d6a2ba07 | 1588 | next_offset = e->next_offset - (origsize - *size); |
0559518b JE |
1589 | if (put_user(target_offset, &ce->target_offset) != 0 || |
1590 | put_user(next_offset, &ce->next_offset) != 0) | |
1591 | return -EFAULT; | |
d6a2ba07 | 1592 | return 0; |
d6a2ba07 PM |
1593 | } |
1594 | ||
1595 | static int compat_copy_entries_to_user(unsigned int total_size, | |
4abff077 | 1596 | struct xt_table *table, |
d6a2ba07 PM |
1597 | void __user *userptr) |
1598 | { | |
1599 | struct xt_counters *counters; | |
5452e425 | 1600 | const struct xt_table_info *private = table->private; |
d6a2ba07 PM |
1601 | void __user *pos; |
1602 | unsigned int size; | |
1603 | int ret = 0; | |
1604 | void *loc_cpu_entry; | |
1605 | unsigned int i = 0; | |
72b2b1dd | 1606 | struct arpt_entry *iter; |
d6a2ba07 PM |
1607 | |
1608 | counters = alloc_counters(table); | |
1609 | if (IS_ERR(counters)) | |
1610 | return PTR_ERR(counters); | |
1611 | ||
1612 | /* choose the copy on our node/cpu */ | |
1613 | loc_cpu_entry = private->entries[raw_smp_processor_id()]; | |
1614 | pos = userptr; | |
1615 | size = total_size; | |
72b2b1dd JE |
1616 | xt_entry_foreach(iter, loc_cpu_entry, total_size) { |
1617 | ret = compat_copy_entry_to_user(iter, &pos, | |
6b4ff2d7 | 1618 | &size, counters, i++); |
72b2b1dd JE |
1619 | if (ret != 0) |
1620 | break; | |
1621 | } | |
d6a2ba07 PM |
1622 | vfree(counters); |
1623 | return ret; | |
1624 | } | |
1625 | ||
1626 | struct compat_arpt_get_entries { | |
1627 | char name[ARPT_TABLE_MAXNAMELEN]; | |
1628 | compat_uint_t size; | |
1629 | struct compat_arpt_entry entrytable[0]; | |
1630 | }; | |
1631 | ||
79df341a AD |
1632 | static int compat_get_entries(struct net *net, |
1633 | struct compat_arpt_get_entries __user *uptr, | |
d6a2ba07 PM |
1634 | int *len) |
1635 | { | |
1636 | int ret; | |
1637 | struct compat_arpt_get_entries get; | |
4abff077 | 1638 | struct xt_table *t; |
d6a2ba07 PM |
1639 | |
1640 | if (*len < sizeof(get)) { | |
1641 | duprintf("compat_get_entries: %u < %zu\n", *len, sizeof(get)); | |
1642 | return -EINVAL; | |
1643 | } | |
1644 | if (copy_from_user(&get, uptr, sizeof(get)) != 0) | |
1645 | return -EFAULT; | |
1646 | if (*len != sizeof(struct compat_arpt_get_entries) + get.size) { | |
1647 | duprintf("compat_get_entries: %u != %zu\n", | |
1648 | *len, sizeof(get) + get.size); | |
1649 | return -EINVAL; | |
1650 | } | |
1651 | ||
ee999d8b JE |
1652 | xt_compat_lock(NFPROTO_ARP); |
1653 | t = xt_find_table_lock(net, NFPROTO_ARP, get.name); | |
d6a2ba07 | 1654 | if (t && !IS_ERR(t)) { |
5452e425 | 1655 | const struct xt_table_info *private = t->private; |
d6a2ba07 PM |
1656 | struct xt_table_info info; |
1657 | ||
1658 | duprintf("t->private->number = %u\n", private->number); | |
1659 | ret = compat_table_info(private, &info); | |
1660 | if (!ret && get.size == info.size) { | |
1661 | ret = compat_copy_entries_to_user(private->size, | |
1662 | t, uptr->entrytable); | |
1663 | } else if (!ret) { | |
1664 | duprintf("compat_get_entries: I've got %u not %u!\n", | |
1665 | private->size, get.size); | |
544473c1 | 1666 | ret = -EAGAIN; |
d6a2ba07 | 1667 | } |
ee999d8b | 1668 | xt_compat_flush_offsets(NFPROTO_ARP); |
d6a2ba07 PM |
1669 | module_put(t->me); |
1670 | xt_table_unlock(t); | |
1671 | } else | |
1672 | ret = t ? PTR_ERR(t) : -ENOENT; | |
1673 | ||
ee999d8b | 1674 | xt_compat_unlock(NFPROTO_ARP); |
d6a2ba07 PM |
1675 | return ret; |
1676 | } | |
1677 | ||
1678 | static int do_arpt_get_ctl(struct sock *, int, void __user *, int *); | |
1679 | ||
1680 | static int compat_do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, | |
1681 | int *len) | |
1682 | { | |
1683 | int ret; | |
1684 | ||
1685 | if (!capable(CAP_NET_ADMIN)) | |
1686 | return -EPERM; | |
1687 | ||
1688 | switch (cmd) { | |
1689 | case ARPT_SO_GET_INFO: | |
3b1e0a65 | 1690 | ret = get_info(sock_net(sk), user, len, 1); |
d6a2ba07 PM |
1691 | break; |
1692 | case ARPT_SO_GET_ENTRIES: | |
3b1e0a65 | 1693 | ret = compat_get_entries(sock_net(sk), user, len); |
d6a2ba07 PM |
1694 | break; |
1695 | default: | |
1696 | ret = do_arpt_get_ctl(sk, cmd, user, len); | |
1697 | } | |
1698 | return ret; | |
1699 | } | |
1700 | #endif | |
1701 | ||
1da177e4 LT |
1702 | static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len) |
1703 | { | |
1704 | int ret; | |
1705 | ||
1706 | if (!capable(CAP_NET_ADMIN)) | |
1707 | return -EPERM; | |
1708 | ||
1709 | switch (cmd) { | |
1710 | case ARPT_SO_SET_REPLACE: | |
3b1e0a65 | 1711 | ret = do_replace(sock_net(sk), user, len); |
1da177e4 LT |
1712 | break; |
1713 | ||
1714 | case ARPT_SO_SET_ADD_COUNTERS: | |
3b1e0a65 | 1715 | ret = do_add_counters(sock_net(sk), user, len, 0); |
1da177e4 LT |
1716 | break; |
1717 | ||
1718 | default: | |
1719 | duprintf("do_arpt_set_ctl: unknown request %i\n", cmd); | |
1720 | ret = -EINVAL; | |
1721 | } | |
1722 | ||
1723 | return ret; | |
1724 | } | |
1725 | ||
1726 | static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len) | |
1727 | { | |
1728 | int ret; | |
1729 | ||
1730 | if (!capable(CAP_NET_ADMIN)) | |
1731 | return -EPERM; | |
1732 | ||
1733 | switch (cmd) { | |
41acd975 | 1734 | case ARPT_SO_GET_INFO: |
3b1e0a65 | 1735 | ret = get_info(sock_net(sk), user, len, 0); |
41acd975 | 1736 | break; |
1da177e4 | 1737 | |
11f6dff8 | 1738 | case ARPT_SO_GET_ENTRIES: |
3b1e0a65 | 1739 | ret = get_entries(sock_net(sk), user, len); |
1da177e4 | 1740 | break; |
1da177e4 | 1741 | |
6b7d31fc | 1742 | case ARPT_SO_GET_REVISION_TARGET: { |
2e4e6a17 | 1743 | struct xt_get_revision rev; |
6b7d31fc HW |
1744 | |
1745 | if (*len != sizeof(rev)) { | |
1746 | ret = -EINVAL; | |
1747 | break; | |
1748 | } | |
1749 | if (copy_from_user(&rev, user, sizeof(rev)) != 0) { | |
1750 | ret = -EFAULT; | |
1751 | break; | |
1752 | } | |
1753 | ||
ee999d8b | 1754 | try_then_request_module(xt_find_revision(NFPROTO_ARP, rev.name, |
2e4e6a17 | 1755 | rev.revision, 1, &ret), |
6b7d31fc HW |
1756 | "arpt_%s", rev.name); |
1757 | break; | |
1758 | } | |
1759 | ||
1da177e4 LT |
1760 | default: |
1761 | duprintf("do_arpt_get_ctl: unknown request %i\n", cmd); | |
1762 | ret = -EINVAL; | |
1763 | } | |
1764 | ||
1765 | return ret; | |
1766 | } | |
1767 | ||
35aad0ff JE |
1768 | struct xt_table *arpt_register_table(struct net *net, |
1769 | const struct xt_table *table, | |
4abff077 | 1770 | const struct arpt_replace *repl) |
1da177e4 LT |
1771 | { |
1772 | int ret; | |
2e4e6a17 | 1773 | struct xt_table_info *newinfo; |
f3c5c1bf | 1774 | struct xt_table_info bootstrap = {0}; |
31836064 | 1775 | void *loc_cpu_entry; |
a98da11d | 1776 | struct xt_table *new_table; |
1da177e4 | 1777 | |
2e4e6a17 | 1778 | newinfo = xt_alloc_table_info(repl->size); |
1da177e4 LT |
1779 | if (!newinfo) { |
1780 | ret = -ENOMEM; | |
44d34e72 | 1781 | goto out; |
1da177e4 | 1782 | } |
31836064 ED |
1783 | |
1784 | /* choose the copy on our node/cpu */ | |
1785 | loc_cpu_entry = newinfo->entries[raw_smp_processor_id()]; | |
1786 | memcpy(loc_cpu_entry, repl->entries, repl->size); | |
1da177e4 | 1787 | |
0f234214 | 1788 | ret = translate_table(newinfo, loc_cpu_entry, repl); |
1da177e4 | 1789 | duprintf("arpt_register_table: translate table gives %d\n", ret); |
44d34e72 AD |
1790 | if (ret != 0) |
1791 | goto out_free; | |
1da177e4 | 1792 | |
79df341a | 1793 | new_table = xt_register_table(net, table, &bootstrap, newinfo); |
a98da11d | 1794 | if (IS_ERR(new_table)) { |
44d34e72 AD |
1795 | ret = PTR_ERR(new_table); |
1796 | goto out_free; | |
1da177e4 | 1797 | } |
44d34e72 | 1798 | return new_table; |
1da177e4 | 1799 | |
44d34e72 AD |
1800 | out_free: |
1801 | xt_free_table_info(newinfo); | |
1802 | out: | |
1803 | return ERR_PTR(ret); | |
1da177e4 LT |
1804 | } |
1805 | ||
4abff077 | 1806 | void arpt_unregister_table(struct xt_table *table) |
1da177e4 | 1807 | { |
2e4e6a17 | 1808 | struct xt_table_info *private; |
31836064 | 1809 | void *loc_cpu_entry; |
df200969 | 1810 | struct module *table_owner = table->me; |
72b2b1dd | 1811 | struct arpt_entry *iter; |
31836064 | 1812 | |
2e4e6a17 | 1813 | private = xt_unregister_table(table); |
1da177e4 LT |
1814 | |
1815 | /* Decrease module usage counts and free resources */ | |
2e4e6a17 | 1816 | loc_cpu_entry = private->entries[raw_smp_processor_id()]; |
72b2b1dd | 1817 | xt_entry_foreach(iter, loc_cpu_entry, private->size) |
0559518b | 1818 | cleanup_entry(iter); |
df200969 AD |
1819 | if (private->number > private->initial_entries) |
1820 | module_put(table_owner); | |
2e4e6a17 | 1821 | xt_free_table_info(private); |
1da177e4 LT |
1822 | } |
1823 | ||
1824 | /* The built-in targets: standard (NULL) and error. */ | |
4538506b JE |
1825 | static struct xt_target arpt_builtin_tg[] __read_mostly = { |
1826 | { | |
1827 | .name = ARPT_STANDARD_TARGET, | |
1828 | .targetsize = sizeof(int), | |
1829 | .family = NFPROTO_ARP, | |
d6a2ba07 | 1830 | #ifdef CONFIG_COMPAT |
4538506b JE |
1831 | .compatsize = sizeof(compat_int_t), |
1832 | .compat_from_user = compat_standard_from_user, | |
1833 | .compat_to_user = compat_standard_to_user, | |
d6a2ba07 | 1834 | #endif |
4538506b JE |
1835 | }, |
1836 | { | |
1837 | .name = ARPT_ERROR_TARGET, | |
1838 | .target = arpt_error, | |
1839 | .targetsize = ARPT_FUNCTION_MAXNAMELEN, | |
1840 | .family = NFPROTO_ARP, | |
1841 | }, | |
1da177e4 LT |
1842 | }; |
1843 | ||
1844 | static struct nf_sockopt_ops arpt_sockopts = { | |
1845 | .pf = PF_INET, | |
1846 | .set_optmin = ARPT_BASE_CTL, | |
1847 | .set_optmax = ARPT_SO_SET_MAX+1, | |
1848 | .set = do_arpt_set_ctl, | |
d6a2ba07 PM |
1849 | #ifdef CONFIG_COMPAT |
1850 | .compat_set = compat_do_arpt_set_ctl, | |
1851 | #endif | |
1da177e4 LT |
1852 | .get_optmin = ARPT_BASE_CTL, |
1853 | .get_optmax = ARPT_SO_GET_MAX+1, | |
1854 | .get = do_arpt_get_ctl, | |
d6a2ba07 PM |
1855 | #ifdef CONFIG_COMPAT |
1856 | .compat_get = compat_do_arpt_get_ctl, | |
1857 | #endif | |
16fcec35 | 1858 | .owner = THIS_MODULE, |
1da177e4 LT |
1859 | }; |
1860 | ||
3cb609d5 AD |
1861 | static int __net_init arp_tables_net_init(struct net *net) |
1862 | { | |
ee999d8b | 1863 | return xt_proto_init(net, NFPROTO_ARP); |
3cb609d5 AD |
1864 | } |
1865 | ||
1866 | static void __net_exit arp_tables_net_exit(struct net *net) | |
1867 | { | |
ee999d8b | 1868 | xt_proto_fini(net, NFPROTO_ARP); |
3cb609d5 AD |
1869 | } |
1870 | ||
1871 | static struct pernet_operations arp_tables_net_ops = { | |
1872 | .init = arp_tables_net_init, | |
1873 | .exit = arp_tables_net_exit, | |
1874 | }; | |
1875 | ||
65b4b4e8 | 1876 | static int __init arp_tables_init(void) |
1da177e4 LT |
1877 | { |
1878 | int ret; | |
1879 | ||
3cb609d5 | 1880 | ret = register_pernet_subsys(&arp_tables_net_ops); |
0eff66e6 PM |
1881 | if (ret < 0) |
1882 | goto err1; | |
2e4e6a17 | 1883 | |
1da177e4 | 1884 | /* Noone else will be downing sem now, so we won't sleep */ |
4538506b | 1885 | ret = xt_register_targets(arpt_builtin_tg, ARRAY_SIZE(arpt_builtin_tg)); |
0eff66e6 PM |
1886 | if (ret < 0) |
1887 | goto err2; | |
1da177e4 LT |
1888 | |
1889 | /* Register setsockopt */ | |
1890 | ret = nf_register_sockopt(&arpt_sockopts); | |
0eff66e6 PM |
1891 | if (ret < 0) |
1892 | goto err4; | |
1da177e4 | 1893 | |
a887c1c1 | 1894 | printk(KERN_INFO "arp_tables: (C) 2002 David S. Miller\n"); |
1da177e4 | 1895 | return 0; |
0eff66e6 PM |
1896 | |
1897 | err4: | |
4538506b | 1898 | xt_unregister_targets(arpt_builtin_tg, ARRAY_SIZE(arpt_builtin_tg)); |
0eff66e6 | 1899 | err2: |
3cb609d5 | 1900 | unregister_pernet_subsys(&arp_tables_net_ops); |
0eff66e6 PM |
1901 | err1: |
1902 | return ret; | |
1da177e4 LT |
1903 | } |
1904 | ||
65b4b4e8 | 1905 | static void __exit arp_tables_fini(void) |
1da177e4 LT |
1906 | { |
1907 | nf_unregister_sockopt(&arpt_sockopts); | |
4538506b | 1908 | xt_unregister_targets(arpt_builtin_tg, ARRAY_SIZE(arpt_builtin_tg)); |
3cb609d5 | 1909 | unregister_pernet_subsys(&arp_tables_net_ops); |
1da177e4 LT |
1910 | } |
1911 | ||
1912 | EXPORT_SYMBOL(arpt_register_table); | |
1913 | EXPORT_SYMBOL(arpt_unregister_table); | |
1914 | EXPORT_SYMBOL(arpt_do_table); | |
1da177e4 | 1915 | |
65b4b4e8 AM |
1916 | module_init(arp_tables_init); |
1917 | module_exit(arp_tables_fini); |