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