| 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 | */ |
| 11 | |
| 12 | #include <linux/kernel.h> |
| 13 | #include <linux/skbuff.h> |
| 14 | #include <linux/netdevice.h> |
| 15 | #include <linux/capability.h> |
| 16 | #include <linux/if_arp.h> |
| 17 | #include <linux/kmod.h> |
| 18 | #include <linux/vmalloc.h> |
| 19 | #include <linux/proc_fs.h> |
| 20 | #include <linux/module.h> |
| 21 | #include <linux/init.h> |
| 22 | |
| 23 | #include <asm/uaccess.h> |
| 24 | #include <linux/mutex.h> |
| 25 | |
| 26 | #include <linux/netfilter/x_tables.h> |
| 27 | #include <linux/netfilter_arp/arp_tables.h> |
| 28 | |
| 29 | MODULE_LICENSE("GPL"); |
| 30 | MODULE_AUTHOR("David S. Miller <davem@redhat.com>"); |
| 31 | MODULE_DESCRIPTION("arptables core"); |
| 32 | |
| 33 | /*#define DEBUG_ARP_TABLES*/ |
| 34 | /*#define DEBUG_ARP_TABLES_USER*/ |
| 35 | |
| 36 | #ifdef DEBUG_ARP_TABLES |
| 37 | #define dprintf(format, args...) printk(format , ## args) |
| 38 | #else |
| 39 | #define dprintf(format, args...) |
| 40 | #endif |
| 41 | |
| 42 | #ifdef DEBUG_ARP_TABLES_USER |
| 43 | #define duprintf(format, args...) printk(format , ## args) |
| 44 | #else |
| 45 | #define duprintf(format, args...) |
| 46 | #endif |
| 47 | |
| 48 | #ifdef CONFIG_NETFILTER_DEBUG |
| 49 | #define ARP_NF_ASSERT(x) \ |
| 50 | do { \ |
| 51 | if (!(x)) \ |
| 52 | printk("ARP_NF_ASSERT: %s:%s:%u\n", \ |
| 53 | __FUNCTION__, __FILE__, __LINE__); \ |
| 54 | } while(0) |
| 55 | #else |
| 56 | #define ARP_NF_ASSERT(x) |
| 57 | #endif |
| 58 | |
| 59 | static inline int arp_devaddr_compare(const struct arpt_devaddr_info *ap, |
| 60 | char *hdr_addr, int len) |
| 61 | { |
| 62 | int i, ret; |
| 63 | |
| 64 | if (len > ARPT_DEV_ADDR_LEN_MAX) |
| 65 | len = ARPT_DEV_ADDR_LEN_MAX; |
| 66 | |
| 67 | ret = 0; |
| 68 | for (i = 0; i < len; i++) |
| 69 | ret |= (hdr_addr[i] ^ ap->addr[i]) & ap->mask[i]; |
| 70 | |
| 71 | return (ret != 0); |
| 72 | } |
| 73 | |
| 74 | /* Returns whether packet matches rule or not. */ |
| 75 | static inline int arp_packet_match(const struct arphdr *arphdr, |
| 76 | struct net_device *dev, |
| 77 | const char *indev, |
| 78 | const char *outdev, |
| 79 | const struct arpt_arp *arpinfo) |
| 80 | { |
| 81 | char *arpptr = (char *)(arphdr + 1); |
| 82 | char *src_devaddr, *tgt_devaddr; |
| 83 | __be32 src_ipaddr, tgt_ipaddr; |
| 84 | int i, ret; |
| 85 | |
| 86 | #define FWINV(bool,invflg) ((bool) ^ !!(arpinfo->invflags & invflg)) |
| 87 | |
| 88 | if (FWINV((arphdr->ar_op & arpinfo->arpop_mask) != arpinfo->arpop, |
| 89 | ARPT_INV_ARPOP)) { |
| 90 | dprintf("ARP operation field mismatch.\n"); |
| 91 | dprintf("ar_op: %04x info->arpop: %04x info->arpop_mask: %04x\n", |
| 92 | arphdr->ar_op, arpinfo->arpop, arpinfo->arpop_mask); |
| 93 | return 0; |
| 94 | } |
| 95 | |
| 96 | if (FWINV((arphdr->ar_hrd & arpinfo->arhrd_mask) != arpinfo->arhrd, |
| 97 | ARPT_INV_ARPHRD)) { |
| 98 | dprintf("ARP hardware address format mismatch.\n"); |
| 99 | dprintf("ar_hrd: %04x info->arhrd: %04x info->arhrd_mask: %04x\n", |
| 100 | arphdr->ar_hrd, arpinfo->arhrd, arpinfo->arhrd_mask); |
| 101 | return 0; |
| 102 | } |
| 103 | |
| 104 | if (FWINV((arphdr->ar_pro & arpinfo->arpro_mask) != arpinfo->arpro, |
| 105 | ARPT_INV_ARPPRO)) { |
| 106 | dprintf("ARP protocol address format mismatch.\n"); |
| 107 | dprintf("ar_pro: %04x info->arpro: %04x info->arpro_mask: %04x\n", |
| 108 | arphdr->ar_pro, arpinfo->arpro, arpinfo->arpro_mask); |
| 109 | return 0; |
| 110 | } |
| 111 | |
| 112 | if (FWINV((arphdr->ar_hln & arpinfo->arhln_mask) != arpinfo->arhln, |
| 113 | ARPT_INV_ARPHLN)) { |
| 114 | dprintf("ARP hardware address length mismatch.\n"); |
| 115 | dprintf("ar_hln: %02x info->arhln: %02x info->arhln_mask: %02x\n", |
| 116 | arphdr->ar_hln, arpinfo->arhln, arpinfo->arhln_mask); |
| 117 | return 0; |
| 118 | } |
| 119 | |
| 120 | src_devaddr = arpptr; |
| 121 | arpptr += dev->addr_len; |
| 122 | memcpy(&src_ipaddr, arpptr, sizeof(u32)); |
| 123 | arpptr += sizeof(u32); |
| 124 | tgt_devaddr = arpptr; |
| 125 | arpptr += dev->addr_len; |
| 126 | memcpy(&tgt_ipaddr, arpptr, sizeof(u32)); |
| 127 | |
| 128 | if (FWINV(arp_devaddr_compare(&arpinfo->src_devaddr, src_devaddr, dev->addr_len), |
| 129 | ARPT_INV_SRCDEVADDR) || |
| 130 | FWINV(arp_devaddr_compare(&arpinfo->tgt_devaddr, tgt_devaddr, dev->addr_len), |
| 131 | ARPT_INV_TGTDEVADDR)) { |
| 132 | dprintf("Source or target device address mismatch.\n"); |
| 133 | |
| 134 | return 0; |
| 135 | } |
| 136 | |
| 137 | if (FWINV((src_ipaddr & arpinfo->smsk.s_addr) != arpinfo->src.s_addr, |
| 138 | ARPT_INV_SRCIP) || |
| 139 | FWINV(((tgt_ipaddr & arpinfo->tmsk.s_addr) != arpinfo->tgt.s_addr), |
| 140 | ARPT_INV_TGTIP)) { |
| 141 | dprintf("Source or target IP address mismatch.\n"); |
| 142 | |
| 143 | dprintf("SRC: %u.%u.%u.%u. Mask: %u.%u.%u.%u. Target: %u.%u.%u.%u.%s\n", |
| 144 | NIPQUAD(src_ipaddr), |
| 145 | NIPQUAD(arpinfo->smsk.s_addr), |
| 146 | NIPQUAD(arpinfo->src.s_addr), |
| 147 | arpinfo->invflags & ARPT_INV_SRCIP ? " (INV)" : ""); |
| 148 | dprintf("TGT: %u.%u.%u.%u Mask: %u.%u.%u.%u Target: %u.%u.%u.%u.%s\n", |
| 149 | NIPQUAD(tgt_ipaddr), |
| 150 | NIPQUAD(arpinfo->tmsk.s_addr), |
| 151 | NIPQUAD(arpinfo->tgt.s_addr), |
| 152 | arpinfo->invflags & ARPT_INV_TGTIP ? " (INV)" : ""); |
| 153 | return 0; |
| 154 | } |
| 155 | |
| 156 | /* Look for ifname matches. */ |
| 157 | for (i = 0, ret = 0; i < IFNAMSIZ; i++) { |
| 158 | ret |= (indev[i] ^ arpinfo->iniface[i]) |
| 159 | & arpinfo->iniface_mask[i]; |
| 160 | } |
| 161 | |
| 162 | if (FWINV(ret != 0, ARPT_INV_VIA_IN)) { |
| 163 | dprintf("VIA in mismatch (%s vs %s).%s\n", |
| 164 | indev, arpinfo->iniface, |
| 165 | arpinfo->invflags&ARPT_INV_VIA_IN ?" (INV)":""); |
| 166 | return 0; |
| 167 | } |
| 168 | |
| 169 | for (i = 0, ret = 0; i < IFNAMSIZ; i++) { |
| 170 | ret |= (outdev[i] ^ arpinfo->outiface[i]) |
| 171 | & arpinfo->outiface_mask[i]; |
| 172 | } |
| 173 | |
| 174 | if (FWINV(ret != 0, ARPT_INV_VIA_OUT)) { |
| 175 | dprintf("VIA out mismatch (%s vs %s).%s\n", |
| 176 | outdev, arpinfo->outiface, |
| 177 | arpinfo->invflags&ARPT_INV_VIA_OUT ?" (INV)":""); |
| 178 | return 0; |
| 179 | } |
| 180 | |
| 181 | return 1; |
| 182 | } |
| 183 | |
| 184 | static inline int arp_checkentry(const struct arpt_arp *arp) |
| 185 | { |
| 186 | if (arp->flags & ~ARPT_F_MASK) { |
| 187 | duprintf("Unknown flag bits set: %08X\n", |
| 188 | arp->flags & ~ARPT_F_MASK); |
| 189 | return 0; |
| 190 | } |
| 191 | if (arp->invflags & ~ARPT_INV_MASK) { |
| 192 | duprintf("Unknown invflag bits set: %08X\n", |
| 193 | arp->invflags & ~ARPT_INV_MASK); |
| 194 | return 0; |
| 195 | } |
| 196 | |
| 197 | return 1; |
| 198 | } |
| 199 | |
| 200 | static unsigned int arpt_error(struct sk_buff **pskb, |
| 201 | const struct net_device *in, |
| 202 | const struct net_device *out, |
| 203 | unsigned int hooknum, |
| 204 | const struct xt_target *target, |
| 205 | const void *targinfo) |
| 206 | { |
| 207 | if (net_ratelimit()) |
| 208 | printk("arp_tables: error: '%s'\n", (char *)targinfo); |
| 209 | |
| 210 | return NF_DROP; |
| 211 | } |
| 212 | |
| 213 | static inline struct arpt_entry *get_entry(void *base, unsigned int offset) |
| 214 | { |
| 215 | return (struct arpt_entry *)(base + offset); |
| 216 | } |
| 217 | |
| 218 | unsigned int arpt_do_table(struct sk_buff **pskb, |
| 219 | unsigned int hook, |
| 220 | const struct net_device *in, |
| 221 | const struct net_device *out, |
| 222 | struct arpt_table *table) |
| 223 | { |
| 224 | static const char nulldevname[IFNAMSIZ]; |
| 225 | unsigned int verdict = NF_DROP; |
| 226 | struct arphdr *arp; |
| 227 | bool hotdrop = false; |
| 228 | struct arpt_entry *e, *back; |
| 229 | const char *indev, *outdev; |
| 230 | void *table_base; |
| 231 | struct xt_table_info *private; |
| 232 | |
| 233 | /* ARP header, plus 2 device addresses, plus 2 IP addresses. */ |
| 234 | if (!pskb_may_pull((*pskb), (sizeof(struct arphdr) + |
| 235 | (2 * (*pskb)->dev->addr_len) + |
| 236 | (2 * sizeof(u32))))) |
| 237 | return NF_DROP; |
| 238 | |
| 239 | indev = in ? in->name : nulldevname; |
| 240 | outdev = out ? out->name : nulldevname; |
| 241 | |
| 242 | read_lock_bh(&table->lock); |
| 243 | private = table->private; |
| 244 | table_base = (void *)private->entries[smp_processor_id()]; |
| 245 | e = get_entry(table_base, private->hook_entry[hook]); |
| 246 | back = get_entry(table_base, private->underflow[hook]); |
| 247 | |
| 248 | arp = arp_hdr(*pskb); |
| 249 | do { |
| 250 | if (arp_packet_match(arp, (*pskb)->dev, indev, outdev, &e->arp)) { |
| 251 | struct arpt_entry_target *t; |
| 252 | int hdr_len; |
| 253 | |
| 254 | hdr_len = sizeof(*arp) + (2 * sizeof(struct in_addr)) + |
| 255 | (2 * (*pskb)->dev->addr_len); |
| 256 | ADD_COUNTER(e->counters, hdr_len, 1); |
| 257 | |
| 258 | t = arpt_get_target(e); |
| 259 | |
| 260 | /* Standard target? */ |
| 261 | if (!t->u.kernel.target->target) { |
| 262 | int v; |
| 263 | |
| 264 | v = ((struct arpt_standard_target *)t)->verdict; |
| 265 | if (v < 0) { |
| 266 | /* Pop from stack? */ |
| 267 | if (v != ARPT_RETURN) { |
| 268 | verdict = (unsigned)(-v) - 1; |
| 269 | break; |
| 270 | } |
| 271 | e = back; |
| 272 | back = get_entry(table_base, |
| 273 | back->comefrom); |
| 274 | continue; |
| 275 | } |
| 276 | if (table_base + v |
| 277 | != (void *)e + e->next_offset) { |
| 278 | /* Save old back ptr in next entry */ |
| 279 | struct arpt_entry *next |
| 280 | = (void *)e + e->next_offset; |
| 281 | next->comefrom = |
| 282 | (void *)back - table_base; |
| 283 | |
| 284 | /* set back pointer to next entry */ |
| 285 | back = next; |
| 286 | } |
| 287 | |
| 288 | e = get_entry(table_base, v); |
| 289 | } else { |
| 290 | /* Targets which reenter must return |
| 291 | * abs. verdicts |
| 292 | */ |
| 293 | verdict = t->u.kernel.target->target(pskb, |
| 294 | in, out, |
| 295 | hook, |
| 296 | t->u.kernel.target, |
| 297 | t->data); |
| 298 | |
| 299 | /* Target might have changed stuff. */ |
| 300 | arp = arp_hdr(*pskb); |
| 301 | |
| 302 | if (verdict == ARPT_CONTINUE) |
| 303 | e = (void *)e + e->next_offset; |
| 304 | else |
| 305 | /* Verdict */ |
| 306 | break; |
| 307 | } |
| 308 | } else { |
| 309 | e = (void *)e + e->next_offset; |
| 310 | } |
| 311 | } while (!hotdrop); |
| 312 | read_unlock_bh(&table->lock); |
| 313 | |
| 314 | if (hotdrop) |
| 315 | return NF_DROP; |
| 316 | else |
| 317 | return verdict; |
| 318 | } |
| 319 | |
| 320 | /* All zeroes == unconditional rule. */ |
| 321 | static inline int unconditional(const struct arpt_arp *arp) |
| 322 | { |
| 323 | unsigned int i; |
| 324 | |
| 325 | for (i = 0; i < sizeof(*arp)/sizeof(__u32); i++) |
| 326 | if (((__u32 *)arp)[i]) |
| 327 | return 0; |
| 328 | |
| 329 | return 1; |
| 330 | } |
| 331 | |
| 332 | /* Figures out from what hook each rule can be called: returns 0 if |
| 333 | * there are loops. Puts hook bitmask in comefrom. |
| 334 | */ |
| 335 | static int mark_source_chains(struct xt_table_info *newinfo, |
| 336 | unsigned int valid_hooks, void *entry0) |
| 337 | { |
| 338 | unsigned int hook; |
| 339 | |
| 340 | /* No recursion; use packet counter to save back ptrs (reset |
| 341 | * to 0 as we leave), and comefrom to save source hook bitmask. |
| 342 | */ |
| 343 | for (hook = 0; hook < NF_ARP_NUMHOOKS; hook++) { |
| 344 | unsigned int pos = newinfo->hook_entry[hook]; |
| 345 | struct arpt_entry *e |
| 346 | = (struct arpt_entry *)(entry0 + pos); |
| 347 | |
| 348 | if (!(valid_hooks & (1 << hook))) |
| 349 | continue; |
| 350 | |
| 351 | /* Set initial back pointer. */ |
| 352 | e->counters.pcnt = pos; |
| 353 | |
| 354 | for (;;) { |
| 355 | struct arpt_standard_target *t |
| 356 | = (void *)arpt_get_target(e); |
| 357 | int visited = e->comefrom & (1 << hook); |
| 358 | |
| 359 | if (e->comefrom & (1 << NF_ARP_NUMHOOKS)) { |
| 360 | printk("arptables: loop hook %u pos %u %08X.\n", |
| 361 | hook, pos, e->comefrom); |
| 362 | return 0; |
| 363 | } |
| 364 | e->comefrom |
| 365 | |= ((1 << hook) | (1 << NF_ARP_NUMHOOKS)); |
| 366 | |
| 367 | /* Unconditional return/END. */ |
| 368 | if ((e->target_offset == sizeof(struct arpt_entry) |
| 369 | && (strcmp(t->target.u.user.name, |
| 370 | ARPT_STANDARD_TARGET) == 0) |
| 371 | && t->verdict < 0 |
| 372 | && unconditional(&e->arp)) || visited) { |
| 373 | unsigned int oldpos, size; |
| 374 | |
| 375 | if (t->verdict < -NF_MAX_VERDICT - 1) { |
| 376 | duprintf("mark_source_chains: bad " |
| 377 | "negative verdict (%i)\n", |
| 378 | t->verdict); |
| 379 | return 0; |
| 380 | } |
| 381 | |
| 382 | /* Return: backtrack through the last |
| 383 | * big jump. |
| 384 | */ |
| 385 | do { |
| 386 | e->comefrom ^= (1<<NF_ARP_NUMHOOKS); |
| 387 | oldpos = pos; |
| 388 | pos = e->counters.pcnt; |
| 389 | e->counters.pcnt = 0; |
| 390 | |
| 391 | /* We're at the start. */ |
| 392 | if (pos == oldpos) |
| 393 | goto next; |
| 394 | |
| 395 | e = (struct arpt_entry *) |
| 396 | (entry0 + pos); |
| 397 | } while (oldpos == pos + e->next_offset); |
| 398 | |
| 399 | /* Move along one */ |
| 400 | size = e->next_offset; |
| 401 | e = (struct arpt_entry *) |
| 402 | (entry0 + pos + size); |
| 403 | e->counters.pcnt = pos; |
| 404 | pos += size; |
| 405 | } else { |
| 406 | int newpos = t->verdict; |
| 407 | |
| 408 | if (strcmp(t->target.u.user.name, |
| 409 | ARPT_STANDARD_TARGET) == 0 |
| 410 | && newpos >= 0) { |
| 411 | if (newpos > newinfo->size - |
| 412 | sizeof(struct arpt_entry)) { |
| 413 | duprintf("mark_source_chains: " |
| 414 | "bad verdict (%i)\n", |
| 415 | newpos); |
| 416 | return 0; |
| 417 | } |
| 418 | |
| 419 | /* This a jump; chase it. */ |
| 420 | duprintf("Jump rule %u -> %u\n", |
| 421 | pos, newpos); |
| 422 | } else { |
| 423 | /* ... this is a fallthru */ |
| 424 | newpos = pos + e->next_offset; |
| 425 | } |
| 426 | e = (struct arpt_entry *) |
| 427 | (entry0 + newpos); |
| 428 | e->counters.pcnt = pos; |
| 429 | pos = newpos; |
| 430 | } |
| 431 | } |
| 432 | next: |
| 433 | duprintf("Finished chain %u\n", hook); |
| 434 | } |
| 435 | return 1; |
| 436 | } |
| 437 | |
| 438 | static inline int standard_check(const struct arpt_entry_target *t, |
| 439 | unsigned int max_offset) |
| 440 | { |
| 441 | /* Check standard info. */ |
| 442 | if (t->u.target_size |
| 443 | != ARPT_ALIGN(sizeof(struct arpt_standard_target))) { |
| 444 | duprintf("arpt_standard_check: target size %u != %Zu\n", |
| 445 | t->u.target_size, |
| 446 | ARPT_ALIGN(sizeof(struct arpt_standard_target))); |
| 447 | return 0; |
| 448 | } |
| 449 | |
| 450 | return 1; |
| 451 | } |
| 452 | |
| 453 | static struct arpt_target arpt_standard_target; |
| 454 | |
| 455 | static inline int check_entry(struct arpt_entry *e, const char *name, unsigned int size, |
| 456 | unsigned int *i) |
| 457 | { |
| 458 | struct arpt_entry_target *t; |
| 459 | struct arpt_target *target; |
| 460 | int ret; |
| 461 | |
| 462 | if (!arp_checkentry(&e->arp)) { |
| 463 | duprintf("arp_tables: arp check failed %p %s.\n", e, name); |
| 464 | return -EINVAL; |
| 465 | } |
| 466 | |
| 467 | if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset) |
| 468 | return -EINVAL; |
| 469 | |
| 470 | t = arpt_get_target(e); |
| 471 | if (e->target_offset + t->u.target_size > e->next_offset) |
| 472 | return -EINVAL; |
| 473 | |
| 474 | target = try_then_request_module(xt_find_target(NF_ARP, t->u.user.name, |
| 475 | t->u.user.revision), |
| 476 | "arpt_%s", t->u.user.name); |
| 477 | if (IS_ERR(target) || !target) { |
| 478 | duprintf("check_entry: `%s' not found\n", t->u.user.name); |
| 479 | ret = target ? PTR_ERR(target) : -ENOENT; |
| 480 | goto out; |
| 481 | } |
| 482 | t->u.kernel.target = target; |
| 483 | |
| 484 | ret = xt_check_target(target, NF_ARP, t->u.target_size - sizeof(*t), |
| 485 | name, e->comefrom, 0, 0); |
| 486 | if (ret) |
| 487 | goto err; |
| 488 | |
| 489 | if (t->u.kernel.target == &arpt_standard_target) { |
| 490 | if (!standard_check(t, size)) { |
| 491 | ret = -EINVAL; |
| 492 | goto err; |
| 493 | } |
| 494 | } else if (t->u.kernel.target->checkentry |
| 495 | && !t->u.kernel.target->checkentry(name, e, target, t->data, |
| 496 | e->comefrom)) { |
| 497 | duprintf("arp_tables: check failed for `%s'.\n", |
| 498 | t->u.kernel.target->name); |
| 499 | ret = -EINVAL; |
| 500 | goto err; |
| 501 | } |
| 502 | |
| 503 | (*i)++; |
| 504 | return 0; |
| 505 | err: |
| 506 | module_put(t->u.kernel.target->me); |
| 507 | out: |
| 508 | return ret; |
| 509 | } |
| 510 | |
| 511 | static inline int check_entry_size_and_hooks(struct arpt_entry *e, |
| 512 | struct xt_table_info *newinfo, |
| 513 | unsigned char *base, |
| 514 | unsigned char *limit, |
| 515 | const unsigned int *hook_entries, |
| 516 | const unsigned int *underflows, |
| 517 | unsigned int *i) |
| 518 | { |
| 519 | unsigned int h; |
| 520 | |
| 521 | if ((unsigned long)e % __alignof__(struct arpt_entry) != 0 |
| 522 | || (unsigned char *)e + sizeof(struct arpt_entry) >= limit) { |
| 523 | duprintf("Bad offset %p\n", e); |
| 524 | return -EINVAL; |
| 525 | } |
| 526 | |
| 527 | if (e->next_offset |
| 528 | < sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) { |
| 529 | duprintf("checking: element %p size %u\n", |
| 530 | e, e->next_offset); |
| 531 | return -EINVAL; |
| 532 | } |
| 533 | |
| 534 | /* Check hooks & underflows */ |
| 535 | for (h = 0; h < NF_ARP_NUMHOOKS; h++) { |
| 536 | if ((unsigned char *)e - base == hook_entries[h]) |
| 537 | newinfo->hook_entry[h] = hook_entries[h]; |
| 538 | if ((unsigned char *)e - base == underflows[h]) |
| 539 | newinfo->underflow[h] = underflows[h]; |
| 540 | } |
| 541 | |
| 542 | /* FIXME: underflows must be unconditional, standard verdicts |
| 543 | < 0 (not ARPT_RETURN). --RR */ |
| 544 | |
| 545 | /* Clear counters and comefrom */ |
| 546 | e->counters = ((struct xt_counters) { 0, 0 }); |
| 547 | e->comefrom = 0; |
| 548 | |
| 549 | (*i)++; |
| 550 | return 0; |
| 551 | } |
| 552 | |
| 553 | static inline int cleanup_entry(struct arpt_entry *e, unsigned int *i) |
| 554 | { |
| 555 | struct arpt_entry_target *t; |
| 556 | |
| 557 | if (i && (*i)-- == 0) |
| 558 | return 1; |
| 559 | |
| 560 | t = arpt_get_target(e); |
| 561 | if (t->u.kernel.target->destroy) |
| 562 | t->u.kernel.target->destroy(t->u.kernel.target, t->data); |
| 563 | module_put(t->u.kernel.target->me); |
| 564 | return 0; |
| 565 | } |
| 566 | |
| 567 | /* Checks and translates the user-supplied table segment (held in |
| 568 | * newinfo). |
| 569 | */ |
| 570 | static int translate_table(const char *name, |
| 571 | unsigned int valid_hooks, |
| 572 | struct xt_table_info *newinfo, |
| 573 | void *entry0, |
| 574 | unsigned int size, |
| 575 | unsigned int number, |
| 576 | const unsigned int *hook_entries, |
| 577 | const unsigned int *underflows) |
| 578 | { |
| 579 | unsigned int i; |
| 580 | int ret; |
| 581 | |
| 582 | newinfo->size = size; |
| 583 | newinfo->number = number; |
| 584 | |
| 585 | /* Init all hooks to impossible value. */ |
| 586 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { |
| 587 | newinfo->hook_entry[i] = 0xFFFFFFFF; |
| 588 | newinfo->underflow[i] = 0xFFFFFFFF; |
| 589 | } |
| 590 | |
| 591 | duprintf("translate_table: size %u\n", newinfo->size); |
| 592 | i = 0; |
| 593 | |
| 594 | /* Walk through entries, checking offsets. */ |
| 595 | ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size, |
| 596 | check_entry_size_and_hooks, |
| 597 | newinfo, |
| 598 | entry0, |
| 599 | entry0 + size, |
| 600 | hook_entries, underflows, &i); |
| 601 | duprintf("translate_table: ARPT_ENTRY_ITERATE gives %d\n", ret); |
| 602 | if (ret != 0) |
| 603 | return ret; |
| 604 | |
| 605 | if (i != number) { |
| 606 | duprintf("translate_table: %u not %u entries\n", |
| 607 | i, number); |
| 608 | return -EINVAL; |
| 609 | } |
| 610 | |
| 611 | /* Check hooks all assigned */ |
| 612 | for (i = 0; i < NF_ARP_NUMHOOKS; i++) { |
| 613 | /* Only hooks which are valid */ |
| 614 | if (!(valid_hooks & (1 << i))) |
| 615 | continue; |
| 616 | if (newinfo->hook_entry[i] == 0xFFFFFFFF) { |
| 617 | duprintf("Invalid hook entry %u %u\n", |
| 618 | i, hook_entries[i]); |
| 619 | return -EINVAL; |
| 620 | } |
| 621 | if (newinfo->underflow[i] == 0xFFFFFFFF) { |
| 622 | duprintf("Invalid underflow %u %u\n", |
| 623 | i, underflows[i]); |
| 624 | return -EINVAL; |
| 625 | } |
| 626 | } |
| 627 | |
| 628 | if (!mark_source_chains(newinfo, valid_hooks, entry0)) { |
| 629 | duprintf("Looping hook\n"); |
| 630 | return -ELOOP; |
| 631 | } |
| 632 | |
| 633 | /* Finally, each sanity check must pass */ |
| 634 | i = 0; |
| 635 | ret = ARPT_ENTRY_ITERATE(entry0, newinfo->size, |
| 636 | check_entry, name, size, &i); |
| 637 | |
| 638 | if (ret != 0) { |
| 639 | ARPT_ENTRY_ITERATE(entry0, newinfo->size, |
| 640 | cleanup_entry, &i); |
| 641 | return ret; |
| 642 | } |
| 643 | |
| 644 | /* And one copy for every other CPU */ |
| 645 | for_each_possible_cpu(i) { |
| 646 | if (newinfo->entries[i] && newinfo->entries[i] != entry0) |
| 647 | memcpy(newinfo->entries[i], entry0, newinfo->size); |
| 648 | } |
| 649 | |
| 650 | return ret; |
| 651 | } |
| 652 | |
| 653 | /* Gets counters. */ |
| 654 | static inline int add_entry_to_counter(const struct arpt_entry *e, |
| 655 | struct xt_counters total[], |
| 656 | unsigned int *i) |
| 657 | { |
| 658 | ADD_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt); |
| 659 | |
| 660 | (*i)++; |
| 661 | return 0; |
| 662 | } |
| 663 | |
| 664 | static inline int set_entry_to_counter(const struct arpt_entry *e, |
| 665 | struct xt_counters total[], |
| 666 | unsigned int *i) |
| 667 | { |
| 668 | SET_COUNTER(total[*i], e->counters.bcnt, e->counters.pcnt); |
| 669 | |
| 670 | (*i)++; |
| 671 | return 0; |
| 672 | } |
| 673 | |
| 674 | static void get_counters(const struct xt_table_info *t, |
| 675 | struct xt_counters counters[]) |
| 676 | { |
| 677 | unsigned int cpu; |
| 678 | unsigned int i; |
| 679 | unsigned int curcpu; |
| 680 | |
| 681 | /* Instead of clearing (by a previous call to memset()) |
| 682 | * the counters and using adds, we set the counters |
| 683 | * with data used by 'current' CPU |
| 684 | * We dont care about preemption here. |
| 685 | */ |
| 686 | curcpu = raw_smp_processor_id(); |
| 687 | |
| 688 | i = 0; |
| 689 | ARPT_ENTRY_ITERATE(t->entries[curcpu], |
| 690 | t->size, |
| 691 | set_entry_to_counter, |
| 692 | counters, |
| 693 | &i); |
| 694 | |
| 695 | for_each_possible_cpu(cpu) { |
| 696 | if (cpu == curcpu) |
| 697 | continue; |
| 698 | i = 0; |
| 699 | ARPT_ENTRY_ITERATE(t->entries[cpu], |
| 700 | t->size, |
| 701 | add_entry_to_counter, |
| 702 | counters, |
| 703 | &i); |
| 704 | } |
| 705 | } |
| 706 | |
| 707 | static int copy_entries_to_user(unsigned int total_size, |
| 708 | struct arpt_table *table, |
| 709 | void __user *userptr) |
| 710 | { |
| 711 | unsigned int off, num, countersize; |
| 712 | struct arpt_entry *e; |
| 713 | struct xt_counters *counters; |
| 714 | struct xt_table_info *private = table->private; |
| 715 | int ret = 0; |
| 716 | void *loc_cpu_entry; |
| 717 | |
| 718 | /* We need atomic snapshot of counters: rest doesn't change |
| 719 | * (other than comefrom, which userspace doesn't care |
| 720 | * about). |
| 721 | */ |
| 722 | countersize = sizeof(struct xt_counters) * private->number; |
| 723 | counters = vmalloc_node(countersize, numa_node_id()); |
| 724 | |
| 725 | if (counters == NULL) |
| 726 | return -ENOMEM; |
| 727 | |
| 728 | /* First, sum counters... */ |
| 729 | write_lock_bh(&table->lock); |
| 730 | get_counters(private, counters); |
| 731 | write_unlock_bh(&table->lock); |
| 732 | |
| 733 | loc_cpu_entry = private->entries[raw_smp_processor_id()]; |
| 734 | /* ... then copy entire thing ... */ |
| 735 | if (copy_to_user(userptr, loc_cpu_entry, total_size) != 0) { |
| 736 | ret = -EFAULT; |
| 737 | goto free_counters; |
| 738 | } |
| 739 | |
| 740 | /* FIXME: use iterator macros --RR */ |
| 741 | /* ... then go back and fix counters and names */ |
| 742 | for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){ |
| 743 | struct arpt_entry_target *t; |
| 744 | |
| 745 | e = (struct arpt_entry *)(loc_cpu_entry + off); |
| 746 | if (copy_to_user(userptr + off |
| 747 | + offsetof(struct arpt_entry, counters), |
| 748 | &counters[num], |
| 749 | sizeof(counters[num])) != 0) { |
| 750 | ret = -EFAULT; |
| 751 | goto free_counters; |
| 752 | } |
| 753 | |
| 754 | t = arpt_get_target(e); |
| 755 | if (copy_to_user(userptr + off + e->target_offset |
| 756 | + offsetof(struct arpt_entry_target, |
| 757 | u.user.name), |
| 758 | t->u.kernel.target->name, |
| 759 | strlen(t->u.kernel.target->name)+1) != 0) { |
| 760 | ret = -EFAULT; |
| 761 | goto free_counters; |
| 762 | } |
| 763 | } |
| 764 | |
| 765 | free_counters: |
| 766 | vfree(counters); |
| 767 | return ret; |
| 768 | } |
| 769 | |
| 770 | static int get_entries(const struct arpt_get_entries *entries, |
| 771 | struct arpt_get_entries __user *uptr) |
| 772 | { |
| 773 | int ret; |
| 774 | struct arpt_table *t; |
| 775 | |
| 776 | t = xt_find_table_lock(NF_ARP, entries->name); |
| 777 | if (t && !IS_ERR(t)) { |
| 778 | struct xt_table_info *private = t->private; |
| 779 | duprintf("t->private->number = %u\n", |
| 780 | private->number); |
| 781 | if (entries->size == private->size) |
| 782 | ret = copy_entries_to_user(private->size, |
| 783 | t, uptr->entrytable); |
| 784 | else { |
| 785 | duprintf("get_entries: I've got %u not %u!\n", |
| 786 | private->size, entries->size); |
| 787 | ret = -EINVAL; |
| 788 | } |
| 789 | module_put(t->me); |
| 790 | xt_table_unlock(t); |
| 791 | } else |
| 792 | ret = t ? PTR_ERR(t) : -ENOENT; |
| 793 | |
| 794 | return ret; |
| 795 | } |
| 796 | |
| 797 | static int do_replace(void __user *user, unsigned int len) |
| 798 | { |
| 799 | int ret; |
| 800 | struct arpt_replace tmp; |
| 801 | struct arpt_table *t; |
| 802 | struct xt_table_info *newinfo, *oldinfo; |
| 803 | struct xt_counters *counters; |
| 804 | void *loc_cpu_entry, *loc_cpu_old_entry; |
| 805 | |
| 806 | if (copy_from_user(&tmp, user, sizeof(tmp)) != 0) |
| 807 | return -EFAULT; |
| 808 | |
| 809 | /* Hack: Causes ipchains to give correct error msg --RR */ |
| 810 | if (len != sizeof(tmp) + tmp.size) |
| 811 | return -ENOPROTOOPT; |
| 812 | |
| 813 | /* overflow check */ |
| 814 | if (tmp.size >= (INT_MAX - sizeof(struct xt_table_info)) / NR_CPUS - |
| 815 | SMP_CACHE_BYTES) |
| 816 | return -ENOMEM; |
| 817 | if (tmp.num_counters >= INT_MAX / sizeof(struct xt_counters)) |
| 818 | return -ENOMEM; |
| 819 | |
| 820 | newinfo = xt_alloc_table_info(tmp.size); |
| 821 | if (!newinfo) |
| 822 | return -ENOMEM; |
| 823 | |
| 824 | /* choose the copy that is on our node/cpu */ |
| 825 | loc_cpu_entry = newinfo->entries[raw_smp_processor_id()]; |
| 826 | if (copy_from_user(loc_cpu_entry, user + sizeof(tmp), |
| 827 | tmp.size) != 0) { |
| 828 | ret = -EFAULT; |
| 829 | goto free_newinfo; |
| 830 | } |
| 831 | |
| 832 | counters = vmalloc(tmp.num_counters * sizeof(struct xt_counters)); |
| 833 | if (!counters) { |
| 834 | ret = -ENOMEM; |
| 835 | goto free_newinfo; |
| 836 | } |
| 837 | |
| 838 | ret = translate_table(tmp.name, tmp.valid_hooks, |
| 839 | newinfo, loc_cpu_entry, tmp.size, tmp.num_entries, |
| 840 | tmp.hook_entry, tmp.underflow); |
| 841 | if (ret != 0) |
| 842 | goto free_newinfo_counters; |
| 843 | |
| 844 | duprintf("arp_tables: Translated table\n"); |
| 845 | |
| 846 | t = try_then_request_module(xt_find_table_lock(NF_ARP, tmp.name), |
| 847 | "arptable_%s", tmp.name); |
| 848 | if (!t || IS_ERR(t)) { |
| 849 | ret = t ? PTR_ERR(t) : -ENOENT; |
| 850 | goto free_newinfo_counters_untrans; |
| 851 | } |
| 852 | |
| 853 | /* You lied! */ |
| 854 | if (tmp.valid_hooks != t->valid_hooks) { |
| 855 | duprintf("Valid hook crap: %08X vs %08X\n", |
| 856 | tmp.valid_hooks, t->valid_hooks); |
| 857 | ret = -EINVAL; |
| 858 | goto put_module; |
| 859 | } |
| 860 | |
| 861 | oldinfo = xt_replace_table(t, tmp.num_counters, newinfo, &ret); |
| 862 | if (!oldinfo) |
| 863 | goto put_module; |
| 864 | |
| 865 | /* Update module usage count based on number of rules */ |
| 866 | duprintf("do_replace: oldnum=%u, initnum=%u, newnum=%u\n", |
| 867 | oldinfo->number, oldinfo->initial_entries, newinfo->number); |
| 868 | if ((oldinfo->number > oldinfo->initial_entries) || |
| 869 | (newinfo->number <= oldinfo->initial_entries)) |
| 870 | module_put(t->me); |
| 871 | if ((oldinfo->number > oldinfo->initial_entries) && |
| 872 | (newinfo->number <= oldinfo->initial_entries)) |
| 873 | module_put(t->me); |
| 874 | |
| 875 | /* Get the old counters. */ |
| 876 | get_counters(oldinfo, counters); |
| 877 | /* Decrease module usage counts and free resource */ |
| 878 | loc_cpu_old_entry = oldinfo->entries[raw_smp_processor_id()]; |
| 879 | ARPT_ENTRY_ITERATE(loc_cpu_old_entry, oldinfo->size, cleanup_entry,NULL); |
| 880 | |
| 881 | xt_free_table_info(oldinfo); |
| 882 | if (copy_to_user(tmp.counters, counters, |
| 883 | sizeof(struct xt_counters) * tmp.num_counters) != 0) |
| 884 | ret = -EFAULT; |
| 885 | vfree(counters); |
| 886 | xt_table_unlock(t); |
| 887 | return ret; |
| 888 | |
| 889 | put_module: |
| 890 | module_put(t->me); |
| 891 | xt_table_unlock(t); |
| 892 | free_newinfo_counters_untrans: |
| 893 | ARPT_ENTRY_ITERATE(loc_cpu_entry, newinfo->size, cleanup_entry, NULL); |
| 894 | free_newinfo_counters: |
| 895 | vfree(counters); |
| 896 | free_newinfo: |
| 897 | xt_free_table_info(newinfo); |
| 898 | return ret; |
| 899 | } |
| 900 | |
| 901 | /* We're lazy, and add to the first CPU; overflow works its fey magic |
| 902 | * and everything is OK. |
| 903 | */ |
| 904 | static inline int add_counter_to_entry(struct arpt_entry *e, |
| 905 | const struct xt_counters addme[], |
| 906 | unsigned int *i) |
| 907 | { |
| 908 | |
| 909 | ADD_COUNTER(e->counters, addme[*i].bcnt, addme[*i].pcnt); |
| 910 | |
| 911 | (*i)++; |
| 912 | return 0; |
| 913 | } |
| 914 | |
| 915 | static int do_add_counters(void __user *user, unsigned int len) |
| 916 | { |
| 917 | unsigned int i; |
| 918 | struct xt_counters_info tmp, *paddc; |
| 919 | struct arpt_table *t; |
| 920 | struct xt_table_info *private; |
| 921 | int ret = 0; |
| 922 | void *loc_cpu_entry; |
| 923 | |
| 924 | if (copy_from_user(&tmp, user, sizeof(tmp)) != 0) |
| 925 | return -EFAULT; |
| 926 | |
| 927 | if (len != sizeof(tmp) + tmp.num_counters*sizeof(struct xt_counters)) |
| 928 | return -EINVAL; |
| 929 | |
| 930 | paddc = vmalloc(len); |
| 931 | if (!paddc) |
| 932 | return -ENOMEM; |
| 933 | |
| 934 | if (copy_from_user(paddc, user, len) != 0) { |
| 935 | ret = -EFAULT; |
| 936 | goto free; |
| 937 | } |
| 938 | |
| 939 | t = xt_find_table_lock(NF_ARP, tmp.name); |
| 940 | if (!t || IS_ERR(t)) { |
| 941 | ret = t ? PTR_ERR(t) : -ENOENT; |
| 942 | goto free; |
| 943 | } |
| 944 | |
| 945 | write_lock_bh(&t->lock); |
| 946 | private = t->private; |
| 947 | if (private->number != tmp.num_counters) { |
| 948 | ret = -EINVAL; |
| 949 | goto unlock_up_free; |
| 950 | } |
| 951 | |
| 952 | i = 0; |
| 953 | /* Choose the copy that is on our node */ |
| 954 | loc_cpu_entry = private->entries[smp_processor_id()]; |
| 955 | ARPT_ENTRY_ITERATE(loc_cpu_entry, |
| 956 | private->size, |
| 957 | add_counter_to_entry, |
| 958 | paddc->counters, |
| 959 | &i); |
| 960 | unlock_up_free: |
| 961 | write_unlock_bh(&t->lock); |
| 962 | xt_table_unlock(t); |
| 963 | module_put(t->me); |
| 964 | free: |
| 965 | vfree(paddc); |
| 966 | |
| 967 | return ret; |
| 968 | } |
| 969 | |
| 970 | static int do_arpt_set_ctl(struct sock *sk, int cmd, void __user *user, unsigned int len) |
| 971 | { |
| 972 | int ret; |
| 973 | |
| 974 | if (!capable(CAP_NET_ADMIN)) |
| 975 | return -EPERM; |
| 976 | |
| 977 | switch (cmd) { |
| 978 | case ARPT_SO_SET_REPLACE: |
| 979 | ret = do_replace(user, len); |
| 980 | break; |
| 981 | |
| 982 | case ARPT_SO_SET_ADD_COUNTERS: |
| 983 | ret = do_add_counters(user, len); |
| 984 | break; |
| 985 | |
| 986 | default: |
| 987 | duprintf("do_arpt_set_ctl: unknown request %i\n", cmd); |
| 988 | ret = -EINVAL; |
| 989 | } |
| 990 | |
| 991 | return ret; |
| 992 | } |
| 993 | |
| 994 | static int do_arpt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len) |
| 995 | { |
| 996 | int ret; |
| 997 | |
| 998 | if (!capable(CAP_NET_ADMIN)) |
| 999 | return -EPERM; |
| 1000 | |
| 1001 | switch (cmd) { |
| 1002 | case ARPT_SO_GET_INFO: { |
| 1003 | char name[ARPT_TABLE_MAXNAMELEN]; |
| 1004 | struct arpt_table *t; |
| 1005 | |
| 1006 | if (*len != sizeof(struct arpt_getinfo)) { |
| 1007 | duprintf("length %u != %Zu\n", *len, |
| 1008 | sizeof(struct arpt_getinfo)); |
| 1009 | ret = -EINVAL; |
| 1010 | break; |
| 1011 | } |
| 1012 | |
| 1013 | if (copy_from_user(name, user, sizeof(name)) != 0) { |
| 1014 | ret = -EFAULT; |
| 1015 | break; |
| 1016 | } |
| 1017 | name[ARPT_TABLE_MAXNAMELEN-1] = '\0'; |
| 1018 | |
| 1019 | t = try_then_request_module(xt_find_table_lock(NF_ARP, name), |
| 1020 | "arptable_%s", name); |
| 1021 | if (t && !IS_ERR(t)) { |
| 1022 | struct arpt_getinfo info; |
| 1023 | struct xt_table_info *private = t->private; |
| 1024 | |
| 1025 | info.valid_hooks = t->valid_hooks; |
| 1026 | memcpy(info.hook_entry, private->hook_entry, |
| 1027 | sizeof(info.hook_entry)); |
| 1028 | memcpy(info.underflow, private->underflow, |
| 1029 | sizeof(info.underflow)); |
| 1030 | info.num_entries = private->number; |
| 1031 | info.size = private->size; |
| 1032 | strcpy(info.name, name); |
| 1033 | |
| 1034 | if (copy_to_user(user, &info, *len) != 0) |
| 1035 | ret = -EFAULT; |
| 1036 | else |
| 1037 | ret = 0; |
| 1038 | xt_table_unlock(t); |
| 1039 | module_put(t->me); |
| 1040 | } else |
| 1041 | ret = t ? PTR_ERR(t) : -ENOENT; |
| 1042 | } |
| 1043 | break; |
| 1044 | |
| 1045 | case ARPT_SO_GET_ENTRIES: { |
| 1046 | struct arpt_get_entries get; |
| 1047 | |
| 1048 | if (*len < sizeof(get)) { |
| 1049 | duprintf("get_entries: %u < %Zu\n", *len, sizeof(get)); |
| 1050 | ret = -EINVAL; |
| 1051 | } else if (copy_from_user(&get, user, sizeof(get)) != 0) { |
| 1052 | ret = -EFAULT; |
| 1053 | } else if (*len != sizeof(struct arpt_get_entries) + get.size) { |
| 1054 | duprintf("get_entries: %u != %Zu\n", *len, |
| 1055 | sizeof(struct arpt_get_entries) + get.size); |
| 1056 | ret = -EINVAL; |
| 1057 | } else |
| 1058 | ret = get_entries(&get, user); |
| 1059 | break; |
| 1060 | } |
| 1061 | |
| 1062 | case ARPT_SO_GET_REVISION_TARGET: { |
| 1063 | struct xt_get_revision rev; |
| 1064 | |
| 1065 | if (*len != sizeof(rev)) { |
| 1066 | ret = -EINVAL; |
| 1067 | break; |
| 1068 | } |
| 1069 | if (copy_from_user(&rev, user, sizeof(rev)) != 0) { |
| 1070 | ret = -EFAULT; |
| 1071 | break; |
| 1072 | } |
| 1073 | |
| 1074 | try_then_request_module(xt_find_revision(NF_ARP, rev.name, |
| 1075 | rev.revision, 1, &ret), |
| 1076 | "arpt_%s", rev.name); |
| 1077 | break; |
| 1078 | } |
| 1079 | |
| 1080 | default: |
| 1081 | duprintf("do_arpt_get_ctl: unknown request %i\n", cmd); |
| 1082 | ret = -EINVAL; |
| 1083 | } |
| 1084 | |
| 1085 | return ret; |
| 1086 | } |
| 1087 | |
| 1088 | int arpt_register_table(struct arpt_table *table, |
| 1089 | const struct arpt_replace *repl) |
| 1090 | { |
| 1091 | int ret; |
| 1092 | struct xt_table_info *newinfo; |
| 1093 | static struct xt_table_info bootstrap |
| 1094 | = { 0, 0, 0, { 0 }, { 0 }, { } }; |
| 1095 | void *loc_cpu_entry; |
| 1096 | |
| 1097 | newinfo = xt_alloc_table_info(repl->size); |
| 1098 | if (!newinfo) { |
| 1099 | ret = -ENOMEM; |
| 1100 | return ret; |
| 1101 | } |
| 1102 | |
| 1103 | /* choose the copy on our node/cpu */ |
| 1104 | loc_cpu_entry = newinfo->entries[raw_smp_processor_id()]; |
| 1105 | memcpy(loc_cpu_entry, repl->entries, repl->size); |
| 1106 | |
| 1107 | ret = translate_table(table->name, table->valid_hooks, |
| 1108 | newinfo, loc_cpu_entry, repl->size, |
| 1109 | repl->num_entries, |
| 1110 | repl->hook_entry, |
| 1111 | repl->underflow); |
| 1112 | |
| 1113 | duprintf("arpt_register_table: translate table gives %d\n", ret); |
| 1114 | if (ret != 0) { |
| 1115 | xt_free_table_info(newinfo); |
| 1116 | return ret; |
| 1117 | } |
| 1118 | |
| 1119 | ret = xt_register_table(table, &bootstrap, newinfo); |
| 1120 | if (ret != 0) { |
| 1121 | xt_free_table_info(newinfo); |
| 1122 | return ret; |
| 1123 | } |
| 1124 | |
| 1125 | return 0; |
| 1126 | } |
| 1127 | |
| 1128 | void arpt_unregister_table(struct arpt_table *table) |
| 1129 | { |
| 1130 | struct xt_table_info *private; |
| 1131 | void *loc_cpu_entry; |
| 1132 | |
| 1133 | private = xt_unregister_table(table); |
| 1134 | |
| 1135 | /* Decrease module usage counts and free resources */ |
| 1136 | loc_cpu_entry = private->entries[raw_smp_processor_id()]; |
| 1137 | ARPT_ENTRY_ITERATE(loc_cpu_entry, private->size, |
| 1138 | cleanup_entry, NULL); |
| 1139 | xt_free_table_info(private); |
| 1140 | } |
| 1141 | |
| 1142 | /* The built-in targets: standard (NULL) and error. */ |
| 1143 | static struct arpt_target arpt_standard_target __read_mostly = { |
| 1144 | .name = ARPT_STANDARD_TARGET, |
| 1145 | .targetsize = sizeof(int), |
| 1146 | .family = NF_ARP, |
| 1147 | }; |
| 1148 | |
| 1149 | static struct arpt_target arpt_error_target __read_mostly = { |
| 1150 | .name = ARPT_ERROR_TARGET, |
| 1151 | .target = arpt_error, |
| 1152 | .targetsize = ARPT_FUNCTION_MAXNAMELEN, |
| 1153 | .family = NF_ARP, |
| 1154 | }; |
| 1155 | |
| 1156 | static struct nf_sockopt_ops arpt_sockopts = { |
| 1157 | .pf = PF_INET, |
| 1158 | .set_optmin = ARPT_BASE_CTL, |
| 1159 | .set_optmax = ARPT_SO_SET_MAX+1, |
| 1160 | .set = do_arpt_set_ctl, |
| 1161 | .get_optmin = ARPT_BASE_CTL, |
| 1162 | .get_optmax = ARPT_SO_GET_MAX+1, |
| 1163 | .get = do_arpt_get_ctl, |
| 1164 | }; |
| 1165 | |
| 1166 | static int __init arp_tables_init(void) |
| 1167 | { |
| 1168 | int ret; |
| 1169 | |
| 1170 | ret = xt_proto_init(NF_ARP); |
| 1171 | if (ret < 0) |
| 1172 | goto err1; |
| 1173 | |
| 1174 | /* Noone else will be downing sem now, so we won't sleep */ |
| 1175 | ret = xt_register_target(&arpt_standard_target); |
| 1176 | if (ret < 0) |
| 1177 | goto err2; |
| 1178 | ret = xt_register_target(&arpt_error_target); |
| 1179 | if (ret < 0) |
| 1180 | goto err3; |
| 1181 | |
| 1182 | /* Register setsockopt */ |
| 1183 | ret = nf_register_sockopt(&arpt_sockopts); |
| 1184 | if (ret < 0) |
| 1185 | goto err4; |
| 1186 | |
| 1187 | printk("arp_tables: (C) 2002 David S. Miller\n"); |
| 1188 | return 0; |
| 1189 | |
| 1190 | err4: |
| 1191 | xt_unregister_target(&arpt_error_target); |
| 1192 | err3: |
| 1193 | xt_unregister_target(&arpt_standard_target); |
| 1194 | err2: |
| 1195 | xt_proto_fini(NF_ARP); |
| 1196 | err1: |
| 1197 | return ret; |
| 1198 | } |
| 1199 | |
| 1200 | static void __exit arp_tables_fini(void) |
| 1201 | { |
| 1202 | nf_unregister_sockopt(&arpt_sockopts); |
| 1203 | xt_unregister_target(&arpt_error_target); |
| 1204 | xt_unregister_target(&arpt_standard_target); |
| 1205 | xt_proto_fini(NF_ARP); |
| 1206 | } |
| 1207 | |
| 1208 | EXPORT_SYMBOL(arpt_register_table); |
| 1209 | EXPORT_SYMBOL(arpt_unregister_table); |
| 1210 | EXPORT_SYMBOL(arpt_do_table); |
| 1211 | |
| 1212 | module_init(arp_tables_init); |
| 1213 | module_exit(arp_tables_fini); |