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