net/ipv4/netfilter/arp_tables.c

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