net/bridge/netfilter/ebtables.c

   1 /*
   2  *  ebtables
   3  *
   4  *  Author:
   5  *  Bart De Schuymer            <bdschuym@pandora.be>
   6  *
   7  *  ebtables.c,v 2.0, July, 2002
   8  *
   9  *  This code is strongly inspired by the iptables code which is
  10  *  Copyright (C) 1999 Paul `Rusty' Russell & Michael J. Neuling
  11  *
  12  *  This program is free software; you can redistribute it and/or
  13  *  modify it under the terms of the GNU General Public License
  14  *  as published by the Free Software Foundation; either version
  15  *  2 of the License, or (at your option) any later version.
  16  */
  17 #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  18 #include <linux/kmod.h>
  19 #include <linux/module.h>
  20 #include <linux/vmalloc.h>
  21 #include <linux/netfilter/x_tables.h>
  22 #include <linux/netfilter_bridge/ebtables.h>
  23 #include <linux/spinlock.h>
  24 #include <linux/mutex.h>
  25 #include <linux/slab.h>
  26 #include <linux/uaccess.h>
  27 #include <linux/smp.h>
  28 #include <linux/cpumask.h>
  29 #include <linux/audit.h>
  30 #include <net/sock.h>
  31 /* needed for logical [in,out]-dev filtering */
  32 #include "../br_private.h"
  33
  34 #define BUGPRINT(format, args...) printk("kernel msg: ebtables bug: please "\
  35                                          "report to author: "format, ## args)
  36 /* #define BUGPRINT(format, args...) */
  37
  38 /* Each cpu has its own set of counters, so there is no need for write_lock in
  39  * the softirq
  40  * For reading or updating the counters, the user context needs to
  41  * get a write_lock
  42  */
  43
  44 /* The size of each set of counters is altered to get cache alignment */
  45 #define SMP_ALIGN(x) (((x) + SMP_CACHE_BYTES-1) & ~(SMP_CACHE_BYTES-1))
  46 #define COUNTER_OFFSET(n) (SMP_ALIGN(n * sizeof(struct ebt_counter)))
  47 #define COUNTER_BASE(c, n, cpu) ((struct ebt_counter *)(((char *)c) + \
  48                                  COUNTER_OFFSET(n) * cpu))
  49
  50
  51
  52 static DEFINE_MUTEX(ebt_mutex);
  53
  54 #ifdef CONFIG_COMPAT
  55 static void ebt_standard_compat_from_user(void *dst, const void *src)
  56 {
  57         int v = *(compat_int_t *)src;
  58
  59         if (v >= 0)
  60                 v += xt_compat_calc_jump(NFPROTO_BRIDGE, v);
  61         memcpy(dst, &v, sizeof(v));
  62 }
  63
  64 static int ebt_standard_compat_to_user(void __user *dst, const void *src)
  65 {
  66         compat_int_t cv = *(int *)src;
  67
  68         if (cv >= 0)
  69                 cv -= xt_compat_calc_jump(NFPROTO_BRIDGE, cv);
  70         return copy_to_user(dst, &cv, sizeof(cv)) ? -EFAULT : 0;
  71 }
  72 #endif
  73
  74
  75 static struct xt_target ebt_standard_target = {
  76         .name       = "standard",
  77         .revision   = 0,
  78         .family     = NFPROTO_BRIDGE,
  79         .targetsize = sizeof(int),
  80 #ifdef CONFIG_COMPAT
  81         .compatsize = sizeof(compat_int_t),
  82         .compat_from_user = ebt_standard_compat_from_user,
  83         .compat_to_user =  ebt_standard_compat_to_user,
  84 #endif
  85 };
  86
  87 static inline int
  88 ebt_do_watcher(const struct ebt_entry_watcher *w, struct sk_buff *skb,
  89                struct xt_action_param *par)
  90 {
  91         par->target   = w->u.watcher;
  92         par->targinfo = w->data;
  93         w->u.watcher->target(skb, par);
  94         /* watchers don't give a verdict */
  95         return 0;
  96 }
  97
  98 static inline int
  99 ebt_do_match(struct ebt_entry_match *m, const struct sk_buff *skb,
 100              struct xt_action_param *par)
 101 {
 102         par->match     = m->u.match;
 103         par->matchinfo = m->data;
 104         return !m->u.match->match(skb, par);
 105 }
 106
 107 static inline int
 108 ebt_dev_check(const char *entry, const struct net_device *device)
 109 {
 110         int i = 0;
 111         const char *devname;
 112
 113         if (*entry == '\0')
 114                 return 0;
 115         if (!device)
 116                 return 1;
 117         devname = device->name;
 118         /* 1 is the wildcard token */
 119         while (entry[i] != '\0' && entry[i] != 1 && entry[i] == devname[i])
 120                 i++;
 121         return devname[i] != entry[i] && entry[i] != 1;
 122 }
 123
 124 /* process standard matches */
 125 static inline int
 126 ebt_basic_match(const struct ebt_entry *e, const struct sk_buff *skb,
 127                 const struct net_device *in, const struct net_device *out)
 128 {
 129         const struct ethhdr *h = eth_hdr(skb);
 130         const struct net_bridge_port *p;
 131         __be16 ethproto;
 132
 133         if (skb_vlan_tag_present(skb))
 134                 ethproto = htons(ETH_P_8021Q);
 135         else
 136                 ethproto = h->h_proto;
 137
 138         if (e->bitmask & EBT_802_3) {
 139                 if (NF_INVF(e, EBT_IPROTO, eth_proto_is_802_3(ethproto)))
 140                         return 1;
 141         } else if (!(e->bitmask & EBT_NOPROTO) &&
 142                    NF_INVF(e, EBT_IPROTO, e->ethproto != ethproto))
 143                 return 1;
 144
 145         if (NF_INVF(e, EBT_IIN, ebt_dev_check(e->in, in)))
 146                 return 1;
 147         if (NF_INVF(e, EBT_IOUT, ebt_dev_check(e->out, out)))
 148                 return 1;
 149         /* rcu_read_lock()ed by nf_hook_thresh */
 150         if (in && (p = br_port_get_rcu(in)) != NULL &&
 151             NF_INVF(e, EBT_ILOGICALIN,
 152                     ebt_dev_check(e->logical_in, p->br->dev)))
 153                 return 1;
 154         if (out && (p = br_port_get_rcu(out)) != NULL &&
 155             NF_INVF(e, EBT_ILOGICALOUT,
 156                     ebt_dev_check(e->logical_out, p->br->dev)))
 157                 return 1;
 158
 159         if (e->bitmask & EBT_SOURCEMAC) {
 160                 if (NF_INVF(e, EBT_ISOURCE,
 161                             !ether_addr_equal_masked(h->h_source, e->sourcemac,
 162                                                      e->sourcemsk)))
 163                         return 1;
 164         }
 165         if (e->bitmask & EBT_DESTMAC) {
 166                 if (NF_INVF(e, EBT_IDEST,
 167                             !ether_addr_equal_masked(h->h_dest, e->destmac,
 168                                                      e->destmsk)))
 169                         return 1;
 170         }
 171         return 0;
 172 }
 173
 174 static inline
 175 struct ebt_entry *ebt_next_entry(const struct ebt_entry *entry)
 176 {
 177         return (void *)entry + entry->next_offset;
 178 }
 179
 180 static inline const struct ebt_entry_target *
 181 ebt_get_target_c(const struct ebt_entry *e)
 182 {
 183         return ebt_get_target((struct ebt_entry *)e);
 184 }
 185
 186 /* Do some firewalling */
 187 unsigned int ebt_do_table(struct sk_buff *skb,
 188                           const struct nf_hook_state *state,
 189                           struct ebt_table *table)
 190 {
 191         unsigned int hook = state->hook;
 192         int i, nentries;
 193         struct ebt_entry *point;
 194         struct ebt_counter *counter_base, *cb_base;
 195         const struct ebt_entry_target *t;
 196         int verdict, sp = 0;
 197         struct ebt_chainstack *cs;
 198         struct ebt_entries *chaininfo;
 199         const char *base;
 200         const struct ebt_table_info *private;
 201         struct xt_action_param acpar;
 202
 203         acpar.state   = state;
 204         acpar.hotdrop = false;
 205
 206         read_lock_bh(&table->lock);
 207         private = table->private;
 208         cb_base = COUNTER_BASE(private->counters, private->nentries,
 209            smp_processor_id());
 210         if (private->chainstack)
 211                 cs = private->chainstack[smp_processor_id()];
 212         else
 213                 cs = NULL;
 214         chaininfo = private->hook_entry[hook];
 215         nentries = private->hook_entry[hook]->nentries;
 216         point = (struct ebt_entry *)(private->hook_entry[hook]->data);
 217         counter_base = cb_base + private->hook_entry[hook]->counter_offset;
 218         /* base for chain jumps */
 219         base = private->entries;
 220         i = 0;
 221         while (i < nentries) {
 222                 if (ebt_basic_match(point, skb, state->in, state->out))
 223                         goto letscontinue;
 224
 225                 if (EBT_MATCH_ITERATE(point, ebt_do_match, skb, &acpar) != 0)
 226                         goto letscontinue;
 227                 if (acpar.hotdrop) {
 228                         read_unlock_bh(&table->lock);
 229                         return NF_DROP;
 230                 }
 231
 232                 ADD_COUNTER(*(counter_base + i), 1, skb->len);
 233
 234                 /* these should only watch: not modify, nor tell us
 235                  * what to do with the packet
 236                  */
 237                 EBT_WATCHER_ITERATE(point, ebt_do_watcher, skb, &acpar);
 238
 239                 t = ebt_get_target_c(point);
 240                 /* standard target */
 241                 if (!t->u.target->target)
 242                         verdict = ((struct ebt_standard_target *)t)->verdict;
 243                 else {
 244                         acpar.target   = t->u.target;
 245                         acpar.targinfo = t->data;
 246                         verdict = t->u.target->target(skb, &acpar);
 247                 }
 248                 if (verdict == EBT_ACCEPT) {
 249                         read_unlock_bh(&table->lock);
 250                         return NF_ACCEPT;
 251                 }
 252                 if (verdict == EBT_DROP) {
 253                         read_unlock_bh(&table->lock);
 254                         return NF_DROP;
 255                 }
 256                 if (verdict == EBT_RETURN) {
 257 letsreturn:
 258                         if (WARN(sp == 0, "RETURN on base chain")) {
 259                                 /* act like this is EBT_CONTINUE */
 260                                 goto letscontinue;
 261                         }
 262
 263                         sp--;
 264                         /* put all the local variables right */
 265                         i = cs[sp].n;
 266                         chaininfo = cs[sp].chaininfo;
 267                         nentries = chaininfo->nentries;
 268                         point = cs[sp].e;
 269                         counter_base = cb_base +
 270                            chaininfo->counter_offset;
 271                         continue;
 272                 }
 273                 if (verdict == EBT_CONTINUE)
 274                         goto letscontinue;
 275
 276                 if (WARN(verdict < 0, "bogus standard verdict\n")) {
 277                         read_unlock_bh(&table->lock);
 278                         return NF_DROP;
 279                 }
 280
 281                 /* jump to a udc */
 282                 cs[sp].n = i + 1;
 283                 cs[sp].chaininfo = chaininfo;
 284                 cs[sp].e = ebt_next_entry(point);
 285                 i = 0;
 286                 chaininfo = (struct ebt_entries *) (base + verdict);
 287
 288                 if (WARN(chaininfo->distinguisher, "jump to non-chain\n")) {
 289                         read_unlock_bh(&table->lock);
 290                         return NF_DROP;
 291                 }
 292
 293                 nentries = chaininfo->nentries;
 294                 point = (struct ebt_entry *)chaininfo->data;
 295                 counter_base = cb_base + chaininfo->counter_offset;
 296                 sp++;
 297                 continue;
 298 letscontinue:
 299                 point = ebt_next_entry(point);
 300                 i++;
 301         }
 302
 303         /* I actually like this :) */
 304         if (chaininfo->policy == EBT_RETURN)
 305                 goto letsreturn;
 306         if (chaininfo->policy == EBT_ACCEPT) {
 307                 read_unlock_bh(&table->lock);
 308                 return NF_ACCEPT;
 309         }
 310         read_unlock_bh(&table->lock);
 311         return NF_DROP;
 312 }
 313
 314 /* If it succeeds, returns element and locks mutex */
 315 static inline void *
 316 find_inlist_lock_noload(struct list_head *head, const char *name, int *error,
 317                         struct mutex *mutex)
 318 {
 319         struct {
 320                 struct list_head list;
 321                 char name[EBT_FUNCTION_MAXNAMELEN];
 322         } *e;
 323
 324         mutex_lock(mutex);
 325         list_for_each_entry(e, head, list) {
 326                 if (strcmp(e->name, name) == 0)
 327                         return e;
 328         }
 329         *error = -ENOENT;
 330         mutex_unlock(mutex);
 331         return NULL;
 332 }
 333
 334 static void *
 335 find_inlist_lock(struct list_head *head, const char *name, const char *prefix,
 336                  int *error, struct mutex *mutex)
 337 {
 338         return try_then_request_module(
 339                         find_inlist_lock_noload(head, name, error, mutex),
 340                         "%s%s", prefix, name);
 341 }
 342
 343 static inline struct ebt_table *
 344 find_table_lock(struct net *net, const char *name, int *error,
 345                 struct mutex *mutex)
 346 {
 347         return find_inlist_lock(&net->xt.tables[NFPROTO_BRIDGE], name,
 348                                 "ebtable_", error, mutex);
 349 }
 350
 351 static inline void ebt_free_table_info(struct ebt_table_info *info)
 352 {
 353         int i;
 354
 355         if (info->chainstack) {
 356                 for_each_possible_cpu(i)
 357                         vfree(info->chainstack[i]);
 358                 vfree(info->chainstack);
 359         }
 360 }
 361 static inline int
 362 ebt_check_match(struct ebt_entry_match *m, struct xt_mtchk_param *par,
 363                 unsigned int *cnt)
 364 {
 365         const struct ebt_entry *e = par->entryinfo;
 366         struct xt_match *match;
 367         size_t left = ((char *)e + e->watchers_offset) - (char *)m;
 368         int ret;
 369
 370         if (left < sizeof(struct ebt_entry_match) ||
 371             left - sizeof(struct ebt_entry_match) < m->match_size)
 372                 return -EINVAL;
 373
 374         match = xt_find_match(NFPROTO_BRIDGE, m->u.name, m->u.revision);
 375         if (IS_ERR(match) || match->family != NFPROTO_BRIDGE) {
 376                 if (!IS_ERR(match))
 377                         module_put(match->me);
 378                 request_module("ebt_%s", m->u.name);
 379                 match = xt_find_match(NFPROTO_BRIDGE, m->u.name, m->u.revision);
 380         }
 381         if (IS_ERR(match))
 382                 return PTR_ERR(match);
 383         m->u.match = match;
 384
 385         par->match     = match;
 386         par->matchinfo = m->data;
 387         ret = xt_check_match(par, m->match_size,
 388               e->ethproto, e->invflags & EBT_IPROTO);
 389         if (ret < 0) {
 390                 module_put(match->me);
 391                 return ret;
 392         }
 393
 394         (*cnt)++;
 395         return 0;
 396 }
 397
 398 static inline int
 399 ebt_check_watcher(struct ebt_entry_watcher *w, struct xt_tgchk_param *par,
 400                   unsigned int *cnt)
 401 {
 402         const struct ebt_entry *e = par->entryinfo;
 403         struct xt_target *watcher;
 404         size_t left = ((char *)e + e->target_offset) - (char *)w;
 405         int ret;
 406
 407         if (left < sizeof(struct ebt_entry_watcher) ||
 408            left - sizeof(struct ebt_entry_watcher) < w->watcher_size)
 409                 return -EINVAL;
 410
 411         watcher = xt_request_find_target(NFPROTO_BRIDGE, w->u.name, 0);
 412         if (IS_ERR(watcher))
 413                 return PTR_ERR(watcher);
 414         w->u.watcher = watcher;
 415
 416         par->target   = watcher;
 417         par->targinfo = w->data;
 418         ret = xt_check_target(par, w->watcher_size,
 419               e->ethproto, e->invflags & EBT_IPROTO);
 420         if (ret < 0) {
 421                 module_put(watcher->me);
 422                 return ret;
 423         }
 424
 425         (*cnt)++;
 426         return 0;
 427 }
 428
 429 static int ebt_verify_pointers(const struct ebt_replace *repl,
 430                                struct ebt_table_info *newinfo)
 431 {
 432         unsigned int limit = repl->entries_size;
 433         unsigned int valid_hooks = repl->valid_hooks;
 434         unsigned int offset = 0;
 435         int i;
 436
 437         for (i = 0; i < NF_BR_NUMHOOKS; i++)
 438                 newinfo->hook_entry[i] = NULL;
 439
 440         newinfo->entries_size = repl->entries_size;
 441         newinfo->nentries = repl->nentries;
 442
 443         while (offset < limit) {
 444                 size_t left = limit - offset;
 445                 struct ebt_entry *e = (void *)newinfo->entries + offset;
 446
 447                 if (left < sizeof(unsigned int))
 448                         break;
 449
 450                 for (i = 0; i < NF_BR_NUMHOOKS; i++) {
 451                         if ((valid_hooks & (1 << i)) == 0)
 452                                 continue;
 453                         if ((char __user *)repl->hook_entry[i] ==
 454                              repl->entries + offset)
 455                                 break;
 456                 }
 457
 458                 if (i != NF_BR_NUMHOOKS || !(e->bitmask & EBT_ENTRY_OR_ENTRIES)) {
 459                         if (e->bitmask != 0) {
 460                                 /* we make userspace set this right,
 461                                  * so there is no misunderstanding
 462                                  */
 463                                 BUGPRINT("EBT_ENTRY_OR_ENTRIES shouldn't be set "
 464                                          "in distinguisher\n");
 465                                 return -EINVAL;
 466                         }
 467                         if (i != NF_BR_NUMHOOKS)
 468                                 newinfo->hook_entry[i] = (struct ebt_entries *)e;
 469                         if (left < sizeof(struct ebt_entries))
 470                                 break;
 471                         offset += sizeof(struct ebt_entries);
 472                 } else {
 473                         if (left < sizeof(struct ebt_entry))
 474                                 break;
 475                         if (left < e->next_offset)
 476                                 break;
 477                         if (e->next_offset < sizeof(struct ebt_entry))
 478                                 return -EINVAL;
 479                         offset += e->next_offset;
 480                 }
 481         }
 482         if (offset != limit) {
 483                 BUGPRINT("entries_size too small\n");
 484                 return -EINVAL;
 485         }
 486
 487         /* check if all valid hooks have a chain */
 488         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
 489                 if (!newinfo->hook_entry[i] &&
 490                    (valid_hooks & (1 << i))) {
 491                         BUGPRINT("Valid hook without chain\n");
 492                         return -EINVAL;
 493                 }
 494         }
 495         return 0;
 496 }
 497
 498 /* this one is very careful, as it is the first function
 499  * to parse the userspace data
 500  */
 501 static inline int
 502 ebt_check_entry_size_and_hooks(const struct ebt_entry *e,
 503                                const struct ebt_table_info *newinfo,
 504                                unsigned int *n, unsigned int *cnt,
 505                                unsigned int *totalcnt, unsigned int *udc_cnt)
 506 {
 507         int i;
 508
 509         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
 510                 if ((void *)e == (void *)newinfo->hook_entry[i])
 511                         break;
 512         }
 513         /* beginning of a new chain
 514          * if i == NF_BR_NUMHOOKS it must be a user defined chain
 515          */
 516         if (i != NF_BR_NUMHOOKS || !e->bitmask) {
 517                 /* this checks if the previous chain has as many entries
 518                  * as it said it has
 519                  */
 520                 if (*n != *cnt) {
 521                         BUGPRINT("nentries does not equal the nr of entries "
 522                                  "in the chain\n");
 523                         return -EINVAL;
 524                 }
 525                 if (((struct ebt_entries *)e)->policy != EBT_DROP &&
 526                    ((struct ebt_entries *)e)->policy != EBT_ACCEPT) {
 527                         /* only RETURN from udc */
 528                         if (i != NF_BR_NUMHOOKS ||
 529                            ((struct ebt_entries *)e)->policy != EBT_RETURN) {
 530                                 BUGPRINT("bad policy\n");
 531                                 return -EINVAL;
 532                         }
 533                 }
 534                 if (i == NF_BR_NUMHOOKS) /* it's a user defined chain */
 535                         (*udc_cnt)++;
 536                 if (((struct ebt_entries *)e)->counter_offset != *totalcnt) {
 537                         BUGPRINT("counter_offset != totalcnt");
 538                         return -EINVAL;
 539                 }
 540                 *n = ((struct ebt_entries *)e)->nentries;
 541                 *cnt = 0;
 542                 return 0;
 543         }
 544         /* a plain old entry, heh */
 545         if (sizeof(struct ebt_entry) > e->watchers_offset ||
 546            e->watchers_offset > e->target_offset ||
 547            e->target_offset >= e->next_offset) {
 548                 BUGPRINT("entry offsets not in right order\n");
 549                 return -EINVAL;
 550         }
 551         /* this is not checked anywhere else */
 552         if (e->next_offset - e->target_offset < sizeof(struct ebt_entry_target)) {
 553                 BUGPRINT("target size too small\n");
 554                 return -EINVAL;
 555         }
 556         (*cnt)++;
 557         (*totalcnt)++;
 558         return 0;
 559 }
 560
 561 struct ebt_cl_stack {
 562         struct ebt_chainstack cs;
 563         int from;
 564         unsigned int hookmask;
 565 };
 566
 567 /* We need these positions to check that the jumps to a different part of the
 568  * entries is a jump to the beginning of a new chain.
 569  */
 570 static inline int
 571 ebt_get_udc_positions(struct ebt_entry *e, struct ebt_table_info *newinfo,
 572                       unsigned int *n, struct ebt_cl_stack *udc)
 573 {
 574         int i;
 575
 576         /* we're only interested in chain starts */
 577         if (e->bitmask)
 578                 return 0;
 579         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
 580                 if (newinfo->hook_entry[i] == (struct ebt_entries *)e)
 581                         break;
 582         }
 583         /* only care about udc */
 584         if (i != NF_BR_NUMHOOKS)
 585                 return 0;
 586
 587         udc[*n].cs.chaininfo = (struct ebt_entries *)e;
 588         /* these initialisations are depended on later in check_chainloops() */
 589         udc[*n].cs.n = 0;
 590         udc[*n].hookmask = 0;
 591
 592         (*n)++;
 593         return 0;
 594 }
 595
 596 static inline int
 597 ebt_cleanup_match(struct ebt_entry_match *m, struct net *net, unsigned int *i)
 598 {
 599         struct xt_mtdtor_param par;
 600
 601         if (i && (*i)-- == 0)
 602                 return 1;
 603
 604         par.net       = net;
 605         par.match     = m->u.match;
 606         par.matchinfo = m->data;
 607         par.family    = NFPROTO_BRIDGE;
 608         if (par.match->destroy != NULL)
 609                 par.match->destroy(&par);
 610         module_put(par.match->me);
 611         return 0;
 612 }
 613
 614 static inline int
 615 ebt_cleanup_watcher(struct ebt_entry_watcher *w, struct net *net, unsigned int *i)
 616 {
 617         struct xt_tgdtor_param par;
 618
 619         if (i && (*i)-- == 0)
 620                 return 1;
 621
 622         par.net      = net;
 623         par.target   = w->u.watcher;
 624         par.targinfo = w->data;
 625         par.family   = NFPROTO_BRIDGE;
 626         if (par.target->destroy != NULL)
 627                 par.target->destroy(&par);
 628         module_put(par.target->me);
 629         return 0;
 630 }
 631
 632 static inline int
 633 ebt_cleanup_entry(struct ebt_entry *e, struct net *net, unsigned int *cnt)
 634 {
 635         struct xt_tgdtor_param par;
 636         struct ebt_entry_target *t;
 637
 638         if (e->bitmask == 0)
 639                 return 0;
 640         /* we're done */
 641         if (cnt && (*cnt)-- == 0)
 642                 return 1;
 643         EBT_WATCHER_ITERATE(e, ebt_cleanup_watcher, net, NULL);
 644         EBT_MATCH_ITERATE(e, ebt_cleanup_match, net, NULL);
 645         t = ebt_get_target(e);
 646
 647         par.net      = net;
 648         par.target   = t->u.target;
 649         par.targinfo = t->data;
 650         par.family   = NFPROTO_BRIDGE;
 651         if (par.target->destroy != NULL)
 652                 par.target->destroy(&par);
 653         module_put(par.target->me);
 654         return 0;
 655 }
 656
 657 static inline int
 658 ebt_check_entry(struct ebt_entry *e, struct net *net,
 659                 const struct ebt_table_info *newinfo,
 660                 const char *name, unsigned int *cnt,
 661                 struct ebt_cl_stack *cl_s, unsigned int udc_cnt)
 662 {
 663         struct ebt_entry_target *t;
 664         struct xt_target *target;
 665         unsigned int i, j, hook = 0, hookmask = 0;
 666         size_t gap;
 667         int ret;
 668         struct xt_mtchk_param mtpar;
 669         struct xt_tgchk_param tgpar;
 670
 671         /* don't mess with the struct ebt_entries */
 672         if (e->bitmask == 0)
 673                 return 0;
 674
 675         if (e->bitmask & ~EBT_F_MASK) {
 676                 BUGPRINT("Unknown flag for bitmask\n");
 677                 return -EINVAL;
 678         }
 679         if (e->invflags & ~EBT_INV_MASK) {
 680                 BUGPRINT("Unknown flag for inv bitmask\n");
 681                 return -EINVAL;
 682         }
 683         if ((e->bitmask & EBT_NOPROTO) && (e->bitmask & EBT_802_3)) {
 684                 BUGPRINT("NOPROTO & 802_3 not allowed\n");
 685                 return -EINVAL;
 686         }
 687         /* what hook do we belong to? */
 688         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
 689                 if (!newinfo->hook_entry[i])
 690                         continue;
 691                 if ((char *)newinfo->hook_entry[i] < (char *)e)
 692                         hook = i;
 693                 else
 694                         break;
 695         }
 696         /* (1 << NF_BR_NUMHOOKS) tells the check functions the rule is on
 697          * a base chain
 698          */
 699         if (i < NF_BR_NUMHOOKS)
 700                 hookmask = (1 << hook) | (1 << NF_BR_NUMHOOKS);
 701         else {
 702                 for (i = 0; i < udc_cnt; i++)
 703                         if ((char *)(cl_s[i].cs.chaininfo) > (char *)e)
 704                                 break;
 705                 if (i == 0)
 706                         hookmask = (1 << hook) | (1 << NF_BR_NUMHOOKS);
 707                 else
 708                         hookmask = cl_s[i - 1].hookmask;
 709         }
 710         i = 0;
 711
 712         mtpar.net       = tgpar.net       = net;
 713         mtpar.table     = tgpar.table     = name;
 714         mtpar.entryinfo = tgpar.entryinfo = e;
 715         mtpar.hook_mask = tgpar.hook_mask = hookmask;
 716         mtpar.family    = tgpar.family    = NFPROTO_BRIDGE;
 717         ret = EBT_MATCH_ITERATE(e, ebt_check_match, &mtpar, &i);
 718         if (ret != 0)
 719                 goto cleanup_matches;
 720         j = 0;
 721         ret = EBT_WATCHER_ITERATE(e, ebt_check_watcher, &tgpar, &j);
 722         if (ret != 0)
 723                 goto cleanup_watchers;
 724         t = ebt_get_target(e);
 725         gap = e->next_offset - e->target_offset;
 726
 727         target = xt_request_find_target(NFPROTO_BRIDGE, t->u.name, 0);
 728         if (IS_ERR(target)) {
 729                 ret = PTR_ERR(target);
 730                 goto cleanup_watchers;
 731         }
 732
 733         t->u.target = target;
 734         if (t->u.target == &ebt_standard_target) {
 735                 if (gap < sizeof(struct ebt_standard_target)) {
 736                         BUGPRINT("Standard target size too big\n");
 737                         ret = -EFAULT;
 738                         goto cleanup_watchers;
 739                 }
 740                 if (((struct ebt_standard_target *)t)->verdict <
 741                    -NUM_STANDARD_TARGETS) {
 742                         BUGPRINT("Invalid standard target\n");
 743                         ret = -EFAULT;
 744                         goto cleanup_watchers;
 745                 }
 746         } else if (t->target_size > gap - sizeof(struct ebt_entry_target)) {
 747                 module_put(t->u.target->me);
 748                 ret = -EFAULT;
 749                 goto cleanup_watchers;
 750         }
 751
 752         tgpar.target   = target;
 753         tgpar.targinfo = t->data;
 754         ret = xt_check_target(&tgpar, t->target_size,
 755               e->ethproto, e->invflags & EBT_IPROTO);
 756         if (ret < 0) {
 757                 module_put(target->me);
 758                 goto cleanup_watchers;
 759         }
 760         (*cnt)++;
 761         return 0;
 762 cleanup_watchers:
 763         EBT_WATCHER_ITERATE(e, ebt_cleanup_watcher, net, &j);
 764 cleanup_matches:
 765         EBT_MATCH_ITERATE(e, ebt_cleanup_match, net, &i);
 766         return ret;
 767 }
 768
 769 /* checks for loops and sets the hook mask for udc
 770  * the hook mask for udc tells us from which base chains the udc can be
 771  * accessed. This mask is a parameter to the check() functions of the extensions
 772  */
 773 static int check_chainloops(const struct ebt_entries *chain, struct ebt_cl_stack *cl_s,
 774                             unsigned int udc_cnt, unsigned int hooknr, char *base)
 775 {
 776         int i, chain_nr = -1, pos = 0, nentries = chain->nentries, verdict;
 777         const struct ebt_entry *e = (struct ebt_entry *)chain->data;
 778         const struct ebt_entry_target *t;
 779
 780         while (pos < nentries || chain_nr != -1) {
 781                 /* end of udc, go back one 'recursion' step */
 782                 if (pos == nentries) {
 783                         /* put back values of the time when this chain was called */
 784                         e = cl_s[chain_nr].cs.e;
 785                         if (cl_s[chain_nr].from != -1)
 786                                 nentries =
 787                                 cl_s[cl_s[chain_nr].from].cs.chaininfo->nentries;
 788                         else
 789                                 nentries = chain->nentries;
 790                         pos = cl_s[chain_nr].cs.n;
 791                         /* make sure we won't see a loop that isn't one */
 792                         cl_s[chain_nr].cs.n = 0;
 793                         chain_nr = cl_s[chain_nr].from;
 794                         if (pos == nentries)
 795                                 continue;
 796                 }
 797                 t = ebt_get_target_c(e);
 798                 if (strcmp(t->u.name, EBT_STANDARD_TARGET))
 799                         goto letscontinue;
 800                 if (e->target_offset + sizeof(struct ebt_standard_target) >
 801                    e->next_offset) {
 802                         BUGPRINT("Standard target size too big\n");
 803                         return -1;
 804                 }
 805                 verdict = ((struct ebt_standard_target *)t)->verdict;
 806                 if (verdict >= 0) { /* jump to another chain */
 807                         struct ebt_entries *hlp2 =
 808                            (struct ebt_entries *)(base + verdict);
 809                         for (i = 0; i < udc_cnt; i++)
 810                                 if (hlp2 == cl_s[i].cs.chaininfo)
 811                                         break;
 812                         /* bad destination or loop */
 813                         if (i == udc_cnt) {
 814                                 BUGPRINT("bad destination\n");
 815                                 return -1;
 816                         }
 817                         if (cl_s[i].cs.n) {
 818                                 BUGPRINT("loop\n");
 819                                 return -1;
 820                         }
 821                         if (cl_s[i].hookmask & (1 << hooknr))
 822                                 goto letscontinue;
 823                         /* this can't be 0, so the loop test is correct */
 824                         cl_s[i].cs.n = pos + 1;
 825                         pos = 0;
 826                         cl_s[i].cs.e = ebt_next_entry(e);
 827                         e = (struct ebt_entry *)(hlp2->data);
 828                         nentries = hlp2->nentries;
 829                         cl_s[i].from = chain_nr;
 830                         chain_nr = i;
 831                         /* this udc is accessible from the base chain for hooknr */
 832                         cl_s[i].hookmask |= (1 << hooknr);
 833                         continue;
 834                 }
 835 letscontinue:
 836                 e = ebt_next_entry(e);
 837                 pos++;
 838         }
 839         return 0;
 840 }
 841
 842 /* do the parsing of the table/chains/entries/matches/watchers/targets, heh */
 843 static int translate_table(struct net *net, const char *name,
 844                            struct ebt_table_info *newinfo)
 845 {
 846         unsigned int i, j, k, udc_cnt;
 847         int ret;
 848         struct ebt_cl_stack *cl_s = NULL; /* used in the checking for chain loops */
 849
 850         i = 0;
 851         while (i < NF_BR_NUMHOOKS && !newinfo->hook_entry[i])
 852                 i++;
 853         if (i == NF_BR_NUMHOOKS) {
 854                 BUGPRINT("No valid hooks specified\n");
 855                 return -EINVAL;
 856         }
 857         if (newinfo->hook_entry[i] != (struct ebt_entries *)newinfo->entries) {
 858                 BUGPRINT("Chains don't start at beginning\n");
 859                 return -EINVAL;
 860         }
 861         /* make sure chains are ordered after each other in same order
 862          * as their corresponding hooks
 863          */
 864         for (j = i + 1; j < NF_BR_NUMHOOKS; j++) {
 865                 if (!newinfo->hook_entry[j])
 866                         continue;
 867                 if (newinfo->hook_entry[j] <= newinfo->hook_entry[i]) {
 868                         BUGPRINT("Hook order must be followed\n");
 869                         return -EINVAL;
 870                 }
 871                 i = j;
 872         }
 873
 874         /* do some early checkings and initialize some things */
 875         i = 0; /* holds the expected nr. of entries for the chain */
 876         j = 0; /* holds the up to now counted entries for the chain */
 877         k = 0; /* holds the total nr. of entries, should equal
 878                 * newinfo->nentries afterwards
 879                 */
 880         udc_cnt = 0; /* will hold the nr. of user defined chains (udc) */
 881         ret = EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size,
 882            ebt_check_entry_size_and_hooks, newinfo,
 883            &i, &j, &k, &udc_cnt);
 884
 885         if (ret != 0)
 886                 return ret;
 887
 888         if (i != j) {
 889                 BUGPRINT("nentries does not equal the nr of entries in the "
 890                          "(last) chain\n");
 891                 return -EINVAL;
 892         }
 893         if (k != newinfo->nentries) {
 894                 BUGPRINT("Total nentries is wrong\n");
 895                 return -EINVAL;
 896         }
 897
 898         /* get the location of the udc, put them in an array
 899          * while we're at it, allocate the chainstack
 900          */
 901         if (udc_cnt) {
 902                 /* this will get free'd in do_replace()/ebt_register_table()
 903                  * if an error occurs
 904                  */
 905                 newinfo->chainstack =
 906                         vmalloc(array_size(nr_cpu_ids,
 907                                            sizeof(*(newinfo->chainstack))));
 908                 if (!newinfo->chainstack)
 909                         return -ENOMEM;
 910                 for_each_possible_cpu(i) {
 911                         newinfo->chainstack[i] =
 912                           vmalloc(array_size(udc_cnt, sizeof(*(newinfo->chainstack[0]))));
 913                         if (!newinfo->chainstack[i]) {
 914                                 while (i)
 915                                         vfree(newinfo->chainstack[--i]);
 916                                 vfree(newinfo->chainstack);
 917                                 newinfo->chainstack = NULL;
 918                                 return -ENOMEM;
 919                         }
 920                 }
 921
 922                 cl_s = vmalloc(array_size(udc_cnt, sizeof(*cl_s)));
 923                 if (!cl_s)
 924                         return -ENOMEM;
 925                 i = 0; /* the i'th udc */
 926                 EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size,
 927                    ebt_get_udc_positions, newinfo, &i, cl_s);
 928                 /* sanity check */
 929                 if (i != udc_cnt) {
 930                         BUGPRINT("i != udc_cnt\n");
 931                         vfree(cl_s);
 932                         return -EFAULT;
 933                 }
 934         }
 935
 936         /* Check for loops */
 937         for (i = 0; i < NF_BR_NUMHOOKS; i++)
 938                 if (newinfo->hook_entry[i])
 939                         if (check_chainloops(newinfo->hook_entry[i],
 940                            cl_s, udc_cnt, i, newinfo->entries)) {
 941                                 vfree(cl_s);
 942                                 return -EINVAL;
 943                         }
 944
 945         /* we now know the following (along with E=mc²):
 946          *  - the nr of entries in each chain is right
 947          *  - the size of the allocated space is right
 948          *  - all valid hooks have a corresponding chain
 949          *  - there are no loops
 950          *  - wrong data can still be on the level of a single entry
 951          *  - could be there are jumps to places that are not the
 952          *    beginning of a chain. This can only occur in chains that
 953          *    are not accessible from any base chains, so we don't care.
 954          */
 955
 956         /* used to know what we need to clean up if something goes wrong */
 957         i = 0;
 958         ret = EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size,
 959            ebt_check_entry, net, newinfo, name, &i, cl_s, udc_cnt);
 960         if (ret != 0) {
 961                 EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size,
 962                                   ebt_cleanup_entry, net, &i);
 963         }
 964         vfree(cl_s);
 965         return ret;
 966 }
 967
 968 /* called under write_lock */
 969 static void get_counters(const struct ebt_counter *oldcounters,
 970                          struct ebt_counter *counters, unsigned int nentries)
 971 {
 972         int i, cpu;
 973         struct ebt_counter *counter_base;
 974
 975         /* counters of cpu 0 */
 976         memcpy(counters, oldcounters,
 977                sizeof(struct ebt_counter) * nentries);
 978
 979         /* add other counters to those of cpu 0 */
 980         for_each_possible_cpu(cpu) {
 981                 if (cpu == 0)
 982                         continue;
 983                 counter_base = COUNTER_BASE(oldcounters, nentries, cpu);
 984                 for (i = 0; i < nentries; i++)
 985                         ADD_COUNTER(counters[i], counter_base[i].pcnt,
 986                                     counter_base[i].bcnt);
 987         }
 988 }
 989
 990 static int do_replace_finish(struct net *net, struct ebt_replace *repl,
 991                               struct ebt_table_info *newinfo)
 992 {
 993         int ret;
 994         struct ebt_counter *counterstmp = NULL;
 995         /* used to be able to unlock earlier */
 996         struct ebt_table_info *table;
 997         struct ebt_table *t;
 998
 999         /* the user wants counters back
1000          * the check on the size is done later, when we have the lock
1001          */
1002         if (repl->num_counters) {
1003                 unsigned long size = repl->num_counters * sizeof(*counterstmp);
1004                 counterstmp = vmalloc(size);
1005                 if (!counterstmp)
1006                         return -ENOMEM;
1007         }
1008
1009         newinfo->chainstack = NULL;
1010         ret = ebt_verify_pointers(repl, newinfo);
1011         if (ret != 0)
1012                 goto free_counterstmp;
1013
1014         ret = translate_table(net, repl->name, newinfo);
1015
1016         if (ret != 0)
1017                 goto free_counterstmp;
1018
1019         t = find_table_lock(net, repl->name, &ret, &ebt_mutex);
1020         if (!t) {
1021                 ret = -ENOENT;
1022                 goto free_iterate;
1023         }
1024
1025         /* the table doesn't like it */
1026         if (t->check && (ret = t->check(newinfo, repl->valid_hooks)))
1027                 goto free_unlock;
1028
1029         if (repl->num_counters && repl->num_counters != t->private->nentries) {
1030                 BUGPRINT("Wrong nr. of counters requested\n");
1031                 ret = -EINVAL;
1032                 goto free_unlock;
1033         }
1034
1035         /* we have the mutex lock, so no danger in reading this pointer */
1036         table = t->private;
1037         /* make sure the table can only be rmmod'ed if it contains no rules */
1038         if (!table->nentries && newinfo->nentries && !try_module_get(t->me)) {
1039                 ret = -ENOENT;
1040                 goto free_unlock;
1041         } else if (table->nentries && !newinfo->nentries)
1042                 module_put(t->me);
1043         /* we need an atomic snapshot of the counters */
1044         write_lock_bh(&t->lock);
1045         if (repl->num_counters)
1046                 get_counters(t->private->counters, counterstmp,
1047                    t->private->nentries);
1048
1049         t->private = newinfo;
1050         write_unlock_bh(&t->lock);
1051         mutex_unlock(&ebt_mutex);
1052         /* so, a user can change the chains while having messed up her counter
1053          * allocation. Only reason why this is done is because this way the lock
1054          * is held only once, while this doesn't bring the kernel into a
1055          * dangerous state.
1056          */
1057         if (repl->num_counters &&
1058            copy_to_user(repl->counters, counterstmp,
1059            repl->num_counters * sizeof(struct ebt_counter))) {
1060                 /* Silent error, can't fail, new table is already in place */
1061                 net_warn_ratelimited("ebtables: counters copy to user failed while replacing table\n");
1062         }
1063
1064         /* decrease module count and free resources */
1065         EBT_ENTRY_ITERATE(table->entries, table->entries_size,
1066                           ebt_cleanup_entry, net, NULL);
1067
1068         vfree(table->entries);
1069         ebt_free_table_info(table);
1070         vfree(table);
1071         vfree(counterstmp);
1072
1073 #ifdef CONFIG_AUDIT
1074         if (audit_enabled) {
1075                 audit_log(audit_context(), GFP_KERNEL,
1076                           AUDIT_NETFILTER_CFG,
1077                           "table=%s family=%u entries=%u",
1078                           repl->name, AF_BRIDGE, repl->nentries);
1079         }
1080 #endif
1081         return ret;
1082
1083 free_unlock:
1084         mutex_unlock(&ebt_mutex);
1085 free_iterate:
1086         EBT_ENTRY_ITERATE(newinfo->entries, newinfo->entries_size,
1087                           ebt_cleanup_entry, net, NULL);
1088 free_counterstmp:
1089         vfree(counterstmp);
1090         /* can be initialized in translate_table() */
1091         ebt_free_table_info(newinfo);
1092         return ret;
1093 }
1094
1095 /* replace the table */
1096 static int do_replace(struct net *net, const void __user *user,
1097                       unsigned int len)
1098 {
1099         int ret, countersize;
1100         struct ebt_table_info *newinfo;
1101         struct ebt_replace tmp;
1102
1103         if (copy_from_user(&tmp, user, sizeof(tmp)) != 0)
1104                 return -EFAULT;
1105
1106         if (len != sizeof(tmp) + tmp.entries_size) {
1107                 BUGPRINT("Wrong len argument\n");
1108                 return -EINVAL;
1109         }
1110
1111         if (tmp.entries_size == 0) {
1112                 BUGPRINT("Entries_size never zero\n");
1113                 return -EINVAL;
1114         }
1115         /* overflow check */
1116         if (tmp.nentries >= ((INT_MAX - sizeof(struct ebt_table_info)) /
1117                         NR_CPUS - SMP_CACHE_BYTES) / sizeof(struct ebt_counter))
1118                 return -ENOMEM;
1119         if (tmp.num_counters >= INT_MAX / sizeof(struct ebt_counter))
1120                 return -ENOMEM;
1121
1122         tmp.name[sizeof(tmp.name) - 1] = 0;
1123
1124         countersize = COUNTER_OFFSET(tmp.nentries) * nr_cpu_ids;
1125         newinfo = vmalloc(sizeof(*newinfo) + countersize);
1126         if (!newinfo)
1127                 return -ENOMEM;
1128
1129         if (countersize)
1130                 memset(newinfo->counters, 0, countersize);
1131
1132         newinfo->entries = vmalloc(tmp.entries_size);
1133         if (!newinfo->entries) {
1134                 ret = -ENOMEM;
1135                 goto free_newinfo;
1136         }
1137         if (copy_from_user(
1138            newinfo->entries, tmp.entries, tmp.entries_size) != 0) {
1139                 BUGPRINT("Couldn't copy entries from userspace\n");
1140                 ret = -EFAULT;
1141                 goto free_entries;
1142         }
1143
1144         ret = do_replace_finish(net, &tmp, newinfo);
1145         if (ret == 0)
1146                 return ret;
1147 free_entries:
1148         vfree(newinfo->entries);
1149 free_newinfo:
1150         vfree(newinfo);
1151         return ret;
1152 }
1153
1154 static void __ebt_unregister_table(struct net *net, struct ebt_table *table)
1155 {
1156         mutex_lock(&ebt_mutex);
1157         list_del(&table->list);
1158         mutex_unlock(&ebt_mutex);
1159         EBT_ENTRY_ITERATE(table->private->entries, table->private->entries_size,
1160                           ebt_cleanup_entry, net, NULL);
1161         if (table->private->nentries)
1162                 module_put(table->me);
1163         vfree(table->private->entries);
1164         ebt_free_table_info(table->private);
1165         vfree(table->private);
1166         kfree(table);
1167 }
1168
1169 int ebt_register_table(struct net *net, const struct ebt_table *input_table,
1170                        const struct nf_hook_ops *ops, struct ebt_table **res)
1171 {
1172         struct ebt_table_info *newinfo;
1173         struct ebt_table *t, *table;
1174         struct ebt_replace_kernel *repl;
1175         int ret, i, countersize;
1176         void *p;
1177
1178         if (input_table == NULL || (repl = input_table->table) == NULL ||
1179             repl->entries == NULL || repl->entries_size == 0 ||
1180             repl->counters != NULL || input_table->private != NULL) {
1181                 BUGPRINT("Bad table data for ebt_register_table!!!\n");
1182                 return -EINVAL;
1183         }
1184
1185         /* Don't add one table to multiple lists. */
1186         table = kmemdup(input_table, sizeof(struct ebt_table), GFP_KERNEL);
1187         if (!table) {
1188                 ret = -ENOMEM;
1189                 goto out;
1190         }
1191
1192         countersize = COUNTER_OFFSET(repl->nentries) * nr_cpu_ids;
1193         newinfo = vmalloc(sizeof(*newinfo) + countersize);
1194         ret = -ENOMEM;
1195         if (!newinfo)
1196                 goto free_table;
1197
1198         p = vmalloc(repl->entries_size);
1199         if (!p)
1200                 goto free_newinfo;
1201
1202         memcpy(p, repl->entries, repl->entries_size);
1203         newinfo->entries = p;
1204
1205         newinfo->entries_size = repl->entries_size;
1206         newinfo->nentries = repl->nentries;
1207
1208         if (countersize)
1209                 memset(newinfo->counters, 0, countersize);
1210
1211         /* fill in newinfo and parse the entries */
1212         newinfo->chainstack = NULL;
1213         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
1214                 if ((repl->valid_hooks & (1 << i)) == 0)
1215                         newinfo->hook_entry[i] = NULL;
1216                 else
1217                         newinfo->hook_entry[i] = p +
1218                                 ((char *)repl->hook_entry[i] - repl->entries);
1219         }
1220         ret = translate_table(net, repl->name, newinfo);
1221         if (ret != 0) {
1222                 BUGPRINT("Translate_table failed\n");
1223                 goto free_chainstack;
1224         }
1225
1226         if (table->check && table->check(newinfo, table->valid_hooks)) {
1227                 BUGPRINT("The table doesn't like its own initial data, lol\n");
1228                 ret = -EINVAL;
1229                 goto free_chainstack;
1230         }
1231
1232         table->private = newinfo;
1233         rwlock_init(&table->lock);
1234         mutex_lock(&ebt_mutex);
1235         list_for_each_entry(t, &net->xt.tables[NFPROTO_BRIDGE], list) {
1236                 if (strcmp(t->name, table->name) == 0) {
1237                         ret = -EEXIST;
1238                         BUGPRINT("Table name already exists\n");
1239                         goto free_unlock;
1240                 }
1241         }
1242
1243         /* Hold a reference count if the chains aren't empty */
1244         if (newinfo->nentries && !try_module_get(table->me)) {
1245                 ret = -ENOENT;
1246                 goto free_unlock;
1247         }
1248         list_add(&table->list, &net->xt.tables[NFPROTO_BRIDGE]);
1249         mutex_unlock(&ebt_mutex);
1250
1251         WRITE_ONCE(*res, table);
1252
1253         if (!ops)
1254                 return 0;
1255
1256         ret = nf_register_net_hooks(net, ops, hweight32(table->valid_hooks));
1257         if (ret) {
1258                 __ebt_unregister_table(net, table);
1259                 *res = NULL;
1260         }
1261
1262         return ret;
1263 free_unlock:
1264         mutex_unlock(&ebt_mutex);
1265 free_chainstack:
1266         ebt_free_table_info(newinfo);
1267         vfree(newinfo->entries);
1268 free_newinfo:
1269         vfree(newinfo);
1270 free_table:
1271         kfree(table);
1272 out:
1273         return ret;
1274 }
1275
1276 void ebt_unregister_table(struct net *net, struct ebt_table *table,
1277                           const struct nf_hook_ops *ops)
1278 {
1279         if (ops)
1280                 nf_unregister_net_hooks(net, ops, hweight32(table->valid_hooks));
1281         __ebt_unregister_table(net, table);
1282 }
1283
1284 /* userspace just supplied us with counters */
1285 static int do_update_counters(struct net *net, const char *name,
1286                                 struct ebt_counter __user *counters,
1287                                 unsigned int num_counters,
1288                                 const void __user *user, unsigned int len)
1289 {
1290         int i, ret;
1291         struct ebt_counter *tmp;
1292         struct ebt_table *t;
1293
1294         if (num_counters == 0)
1295                 return -EINVAL;
1296
1297         tmp = vmalloc(array_size(num_counters, sizeof(*tmp)));
1298         if (!tmp)
1299                 return -ENOMEM;
1300
1301         t = find_table_lock(net, name, &ret, &ebt_mutex);
1302         if (!t)
1303                 goto free_tmp;
1304
1305         if (num_counters != t->private->nentries) {
1306                 BUGPRINT("Wrong nr of counters\n");
1307                 ret = -EINVAL;
1308                 goto unlock_mutex;
1309         }
1310
1311         if (copy_from_user(tmp, counters, num_counters * sizeof(*counters))) {
1312                 ret = -EFAULT;
1313                 goto unlock_mutex;
1314         }
1315
1316         /* we want an atomic add of the counters */
1317         write_lock_bh(&t->lock);
1318
1319         /* we add to the counters of the first cpu */
1320         for (i = 0; i < num_counters; i++)
1321                 ADD_COUNTER(t->private->counters[i], tmp[i].pcnt, tmp[i].bcnt);
1322
1323         write_unlock_bh(&t->lock);
1324         ret = 0;
1325 unlock_mutex:
1326         mutex_unlock(&ebt_mutex);
1327 free_tmp:
1328         vfree(tmp);
1329         return ret;
1330 }
1331
1332 static int update_counters(struct net *net, const void __user *user,
1333                             unsigned int len)
1334 {
1335         struct ebt_replace hlp;
1336
1337         if (copy_from_user(&hlp, user, sizeof(hlp)))
1338                 return -EFAULT;
1339
1340         if (len != sizeof(hlp) + hlp.num_counters * sizeof(struct ebt_counter))
1341                 return -EINVAL;
1342
1343         return do_update_counters(net, hlp.name, hlp.counters,
1344                                 hlp.num_counters, user, len);
1345 }
1346
1347 static inline int ebt_obj_to_user(char __user *um, const char *_name,
1348                                   const char *data, int entrysize,
1349                                   int usersize, int datasize, u8 revision)
1350 {
1351         char name[EBT_EXTENSION_MAXNAMELEN] = {0};
1352
1353         /* ebtables expects 31 bytes long names but xt_match names are 29 bytes
1354          * long. Copy 29 bytes and fill remaining bytes with zeroes.
1355          */
1356         strlcpy(name, _name, sizeof(name));
1357         if (copy_to_user(um, name, EBT_EXTENSION_MAXNAMELEN) ||
1358             put_user(revision, (u8 __user *)(um + EBT_EXTENSION_MAXNAMELEN)) ||
1359             put_user(datasize, (int __user *)(um + EBT_EXTENSION_MAXNAMELEN + 1)) ||
1360             xt_data_to_user(um + entrysize, data, usersize, datasize,
1361                             XT_ALIGN(datasize)))
1362                 return -EFAULT;
1363
1364         return 0;
1365 }
1366
1367 static inline int ebt_match_to_user(const struct ebt_entry_match *m,
1368                                     const char *base, char __user *ubase)
1369 {
1370         return ebt_obj_to_user(ubase + ((char *)m - base),
1371                                m->u.match->name, m->data, sizeof(*m),
1372                                m->u.match->usersize, m->match_size,
1373                                m->u.match->revision);
1374 }
1375
1376 static inline int ebt_watcher_to_user(const struct ebt_entry_watcher *w,
1377                                       const char *base, char __user *ubase)
1378 {
1379         return ebt_obj_to_user(ubase + ((char *)w - base),
1380                                w->u.watcher->name, w->data, sizeof(*w),
1381                                w->u.watcher->usersize, w->watcher_size,
1382                                w->u.watcher->revision);
1383 }
1384
1385 static inline int ebt_entry_to_user(struct ebt_entry *e, const char *base,
1386                                     char __user *ubase)
1387 {
1388         int ret;
1389         char __user *hlp;
1390         const struct ebt_entry_target *t;
1391
1392         if (e->bitmask == 0) {
1393                 /* special case !EBT_ENTRY_OR_ENTRIES */
1394                 if (copy_to_user(ubase + ((char *)e - base), e,
1395                                  sizeof(struct ebt_entries)))
1396                         return -EFAULT;
1397                 return 0;
1398         }
1399
1400         if (copy_to_user(ubase + ((char *)e - base), e, sizeof(*e)))
1401                 return -EFAULT;
1402
1403         hlp = ubase + (((char *)e + e->target_offset) - base);
1404         t = ebt_get_target_c(e);
1405
1406         ret = EBT_MATCH_ITERATE(e, ebt_match_to_user, base, ubase);
1407         if (ret != 0)
1408                 return ret;
1409         ret = EBT_WATCHER_ITERATE(e, ebt_watcher_to_user, base, ubase);
1410         if (ret != 0)
1411                 return ret;
1412         ret = ebt_obj_to_user(hlp, t->u.target->name, t->data, sizeof(*t),
1413                               t->u.target->usersize, t->target_size,
1414                               t->u.target->revision);
1415         if (ret != 0)
1416                 return ret;
1417
1418         return 0;
1419 }
1420
1421 static int copy_counters_to_user(struct ebt_table *t,
1422                                  const struct ebt_counter *oldcounters,
1423                                  void __user *user, unsigned int num_counters,
1424                                  unsigned int nentries)
1425 {
1426         struct ebt_counter *counterstmp;
1427         int ret = 0;
1428
1429         /* userspace might not need the counters */
1430         if (num_counters == 0)
1431                 return 0;
1432
1433         if (num_counters != nentries) {
1434                 BUGPRINT("Num_counters wrong\n");
1435                 return -EINVAL;
1436         }
1437
1438         counterstmp = vmalloc(array_size(nentries, sizeof(*counterstmp)));
1439         if (!counterstmp)
1440                 return -ENOMEM;
1441
1442         write_lock_bh(&t->lock);
1443         get_counters(oldcounters, counterstmp, nentries);
1444         write_unlock_bh(&t->lock);
1445
1446         if (copy_to_user(user, counterstmp,
1447            nentries * sizeof(struct ebt_counter)))
1448                 ret = -EFAULT;
1449         vfree(counterstmp);
1450         return ret;
1451 }
1452
1453 /* called with ebt_mutex locked */
1454 static int copy_everything_to_user(struct ebt_table *t, void __user *user,
1455                                    const int *len, int cmd)
1456 {
1457         struct ebt_replace tmp;
1458         const struct ebt_counter *oldcounters;
1459         unsigned int entries_size, nentries;
1460         int ret;
1461         char *entries;
1462
1463         if (cmd == EBT_SO_GET_ENTRIES) {
1464                 entries_size = t->private->entries_size;
1465                 nentries = t->private->nentries;
1466                 entries = t->private->entries;
1467                 oldcounters = t->private->counters;
1468         } else {
1469                 entries_size = t->table->entries_size;
1470                 nentries = t->table->nentries;
1471                 entries = t->table->entries;
1472                 oldcounters = t->table->counters;
1473         }
1474
1475         if (copy_from_user(&tmp, user, sizeof(tmp)))
1476                 return -EFAULT;
1477
1478         if (*len != sizeof(struct ebt_replace) + entries_size +
1479            (tmp.num_counters ? nentries * sizeof(struct ebt_counter) : 0))
1480                 return -EINVAL;
1481
1482         if (tmp.nentries != nentries) {
1483                 BUGPRINT("Nentries wrong\n");
1484                 return -EINVAL;
1485         }
1486
1487         if (tmp.entries_size != entries_size) {
1488                 BUGPRINT("Wrong size\n");
1489                 return -EINVAL;
1490         }
1491
1492         ret = copy_counters_to_user(t, oldcounters, tmp.counters,
1493                                         tmp.num_counters, nentries);
1494         if (ret)
1495                 return ret;
1496
1497         /* set the match/watcher/target names right */
1498         return EBT_ENTRY_ITERATE(entries, entries_size,
1499            ebt_entry_to_user, entries, tmp.entries);
1500 }
1501
1502 static int do_ebt_set_ctl(struct sock *sk,
1503         int cmd, void __user *user, unsigned int len)
1504 {
1505         int ret;
1506         struct net *net = sock_net(sk);
1507
1508         if (!ns_capable(net->user_ns, CAP_NET_ADMIN))
1509                 return -EPERM;
1510
1511         switch (cmd) {
1512         case EBT_SO_SET_ENTRIES:
1513                 ret = do_replace(net, user, len);
1514                 break;
1515         case EBT_SO_SET_COUNTERS:
1516                 ret = update_counters(net, user, len);
1517                 break;
1518         default:
1519                 ret = -EINVAL;
1520         }
1521         return ret;
1522 }
1523
1524 static int do_ebt_get_ctl(struct sock *sk, int cmd, void __user *user, int *len)
1525 {
1526         int ret;
1527         struct ebt_replace tmp;
1528         struct ebt_table *t;
1529         struct net *net = sock_net(sk);
1530
1531         if (!ns_capable(net->user_ns, CAP_NET_ADMIN))
1532                 return -EPERM;
1533
1534         if (copy_from_user(&tmp, user, sizeof(tmp)))
1535                 return -EFAULT;
1536
1537         tmp.name[sizeof(tmp.name) - 1] = '\0';
1538
1539         t = find_table_lock(net, tmp.name, &ret, &ebt_mutex);
1540         if (!t)
1541                 return ret;
1542
1543         switch (cmd) {
1544         case EBT_SO_GET_INFO:
1545         case EBT_SO_GET_INIT_INFO:
1546                 if (*len != sizeof(struct ebt_replace)) {
1547                         ret = -EINVAL;
1548                         mutex_unlock(&ebt_mutex);
1549                         break;
1550                 }
1551                 if (cmd == EBT_SO_GET_INFO) {
1552                         tmp.nentries = t->private->nentries;
1553                         tmp.entries_size = t->private->entries_size;
1554                         tmp.valid_hooks = t->valid_hooks;
1555                 } else {
1556                         tmp.nentries = t->table->nentries;
1557                         tmp.entries_size = t->table->entries_size;
1558                         tmp.valid_hooks = t->table->valid_hooks;
1559                 }
1560                 mutex_unlock(&ebt_mutex);
1561                 if (copy_to_user(user, &tmp, *len) != 0) {
1562                         BUGPRINT("c2u Didn't work\n");
1563                         ret = -EFAULT;
1564                         break;
1565                 }
1566                 ret = 0;
1567                 break;
1568
1569         case EBT_SO_GET_ENTRIES:
1570         case EBT_SO_GET_INIT_ENTRIES:
1571                 ret = copy_everything_to_user(t, user, len, cmd);
1572                 mutex_unlock(&ebt_mutex);
1573                 break;
1574
1575         default:
1576                 mutex_unlock(&ebt_mutex);
1577                 ret = -EINVAL;
1578         }
1579
1580         return ret;
1581 }
1582
1583 #ifdef CONFIG_COMPAT
1584 /* 32 bit-userspace compatibility definitions. */
1585 struct compat_ebt_replace {
1586         char name[EBT_TABLE_MAXNAMELEN];
1587         compat_uint_t valid_hooks;
1588         compat_uint_t nentries;
1589         compat_uint_t entries_size;
1590         /* start of the chains */
1591         compat_uptr_t hook_entry[NF_BR_NUMHOOKS];
1592         /* nr of counters userspace expects back */
1593         compat_uint_t num_counters;
1594         /* where the kernel will put the old counters. */
1595         compat_uptr_t counters;
1596         compat_uptr_t entries;
1597 };
1598
1599 /* struct ebt_entry_match, _target and _watcher have same layout */
1600 struct compat_ebt_entry_mwt {
1601         union {
1602                 struct {
1603                         char name[EBT_EXTENSION_MAXNAMELEN];
1604                         u8 revision;
1605                 };
1606                 compat_uptr_t ptr;
1607         } u;
1608         compat_uint_t match_size;
1609         compat_uint_t data[0];
1610 };
1611
1612 /* account for possible padding between match_size and ->data */
1613 static int ebt_compat_entry_padsize(void)
1614 {
1615         BUILD_BUG_ON(XT_ALIGN(sizeof(struct ebt_entry_match)) <
1616                         COMPAT_XT_ALIGN(sizeof(struct compat_ebt_entry_mwt)));
1617         return (int) XT_ALIGN(sizeof(struct ebt_entry_match)) -
1618                         COMPAT_XT_ALIGN(sizeof(struct compat_ebt_entry_mwt));
1619 }
1620
1621 static int ebt_compat_match_offset(const struct xt_match *match,
1622                                    unsigned int userlen)
1623 {
1624         /* ebt_among needs special handling. The kernel .matchsize is
1625          * set to -1 at registration time; at runtime an EBT_ALIGN()ed
1626          * value is expected.
1627          * Example: userspace sends 4500, ebt_among.c wants 4504.
1628          */
1629         if (unlikely(match->matchsize == -1))
1630                 return XT_ALIGN(userlen) - COMPAT_XT_ALIGN(userlen);
1631         return xt_compat_match_offset(match);
1632 }
1633
1634 static int compat_match_to_user(struct ebt_entry_match *m, void __user **dstptr,
1635                                 unsigned int *size)
1636 {
1637         const struct xt_match *match = m->u.match;
1638         struct compat_ebt_entry_mwt __user *cm = *dstptr;
1639         int off = ebt_compat_match_offset(match, m->match_size);
1640         compat_uint_t msize = m->match_size - off;
1641
1642         if (WARN_ON(off >= m->match_size))
1643                 return -EINVAL;
1644
1645         if (copy_to_user(cm->u.name, match->name, strlen(match->name) + 1) ||
1646             put_user(match->revision, &cm->u.revision) ||
1647             put_user(msize, &cm->match_size))
1648                 return -EFAULT;
1649
1650         if (match->compat_to_user) {
1651                 if (match->compat_to_user(cm->data, m->data))
1652                         return -EFAULT;
1653         } else {
1654                 if (xt_data_to_user(cm->data, m->data, match->usersize, msize,
1655                                     COMPAT_XT_ALIGN(msize)))
1656                         return -EFAULT;
1657         }
1658
1659         *size -= ebt_compat_entry_padsize() + off;
1660         *dstptr = cm->data;
1661         *dstptr += msize;
1662         return 0;
1663 }
1664
1665 static int compat_target_to_user(struct ebt_entry_target *t,
1666                                  void __user **dstptr,
1667                                  unsigned int *size)
1668 {
1669         const struct xt_target *target = t->u.target;
1670         struct compat_ebt_entry_mwt __user *cm = *dstptr;
1671         int off = xt_compat_target_offset(target);
1672         compat_uint_t tsize = t->target_size - off;
1673
1674         if (WARN_ON(off >= t->target_size))
1675                 return -EINVAL;
1676
1677         if (copy_to_user(cm->u.name, target->name, strlen(target->name) + 1) ||
1678             put_user(target->revision, &cm->u.revision) ||
1679             put_user(tsize, &cm->match_size))
1680                 return -EFAULT;
1681
1682         if (target->compat_to_user) {
1683                 if (target->compat_to_user(cm->data, t->data))
1684                         return -EFAULT;
1685         } else {
1686                 if (xt_data_to_user(cm->data, t->data, target->usersize, tsize,
1687                                     COMPAT_XT_ALIGN(tsize)))
1688                         return -EFAULT;
1689         }
1690
1691         *size -= ebt_compat_entry_padsize() + off;
1692         *dstptr = cm->data;
1693         *dstptr += tsize;
1694         return 0;
1695 }
1696
1697 static int compat_watcher_to_user(struct ebt_entry_watcher *w,
1698                                   void __user **dstptr,
1699                                   unsigned int *size)
1700 {
1701         return compat_target_to_user((struct ebt_entry_target *)w,
1702                                                         dstptr, size);
1703 }
1704
1705 static int compat_copy_entry_to_user(struct ebt_entry *e, void __user **dstptr,
1706                                 unsigned int *size)
1707 {
1708         struct ebt_entry_target *t;
1709         struct ebt_entry __user *ce;
1710         u32 watchers_offset, target_offset, next_offset;
1711         compat_uint_t origsize;
1712         int ret;
1713
1714         if (e->bitmask == 0) {
1715                 if (*size < sizeof(struct ebt_entries))
1716                         return -EINVAL;
1717                 if (copy_to_user(*dstptr, e, sizeof(struct ebt_entries)))
1718                         return -EFAULT;
1719
1720                 *dstptr += sizeof(struct ebt_entries);
1721                 *size -= sizeof(struct ebt_entries);
1722                 return 0;
1723         }
1724
1725         if (*size < sizeof(*ce))
1726                 return -EINVAL;
1727
1728         ce = *dstptr;
1729         if (copy_to_user(ce, e, sizeof(*ce)))
1730                 return -EFAULT;
1731
1732         origsize = *size;
1733         *dstptr += sizeof(*ce);
1734
1735         ret = EBT_MATCH_ITERATE(e, compat_match_to_user, dstptr, size);
1736         if (ret)
1737                 return ret;
1738         watchers_offset = e->watchers_offset - (origsize - *size);
1739
1740         ret = EBT_WATCHER_ITERATE(e, compat_watcher_to_user, dstptr, size);
1741         if (ret)
1742                 return ret;
1743         target_offset = e->target_offset - (origsize - *size);
1744
1745         t = ebt_get_target(e);
1746
1747         ret = compat_target_to_user(t, dstptr, size);
1748         if (ret)
1749                 return ret;
1750         next_offset = e->next_offset - (origsize - *size);
1751
1752         if (put_user(watchers_offset, &ce->watchers_offset) ||
1753             put_user(target_offset, &ce->target_offset) ||
1754             put_user(next_offset, &ce->next_offset))
1755                 return -EFAULT;
1756
1757         *size -= sizeof(*ce);
1758         return 0;
1759 }
1760
1761 static int compat_calc_match(struct ebt_entry_match *m, int *off)
1762 {
1763         *off += ebt_compat_match_offset(m->u.match, m->match_size);
1764         *off += ebt_compat_entry_padsize();
1765         return 0;
1766 }
1767
1768 static int compat_calc_watcher(struct ebt_entry_watcher *w, int *off)
1769 {
1770         *off += xt_compat_target_offset(w->u.watcher);
1771         *off += ebt_compat_entry_padsize();
1772         return 0;
1773 }
1774
1775 static int compat_calc_entry(const struct ebt_entry *e,
1776                              const struct ebt_table_info *info,
1777                              const void *base,
1778                              struct compat_ebt_replace *newinfo)
1779 {
1780         const struct ebt_entry_target *t;
1781         unsigned int entry_offset;
1782         int off, ret, i;
1783
1784         if (e->bitmask == 0)
1785                 return 0;
1786
1787         off = 0;
1788         entry_offset = (void *)e - base;
1789
1790         EBT_MATCH_ITERATE(e, compat_calc_match, &off);
1791         EBT_WATCHER_ITERATE(e, compat_calc_watcher, &off);
1792
1793         t = ebt_get_target_c(e);
1794
1795         off += xt_compat_target_offset(t->u.target);
1796         off += ebt_compat_entry_padsize();
1797
1798         newinfo->entries_size -= off;
1799
1800         ret = xt_compat_add_offset(NFPROTO_BRIDGE, entry_offset, off);
1801         if (ret)
1802                 return ret;
1803
1804         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
1805                 const void *hookptr = info->hook_entry[i];
1806                 if (info->hook_entry[i] &&
1807                     (e < (struct ebt_entry *)(base - hookptr))) {
1808                         newinfo->hook_entry[i] -= off;
1809                         pr_debug("0x%08X -> 0x%08X\n",
1810                                         newinfo->hook_entry[i] + off,
1811                                         newinfo->hook_entry[i]);
1812                 }
1813         }
1814
1815         return 0;
1816 }
1817
1818
1819 static int compat_table_info(const struct ebt_table_info *info,
1820                              struct compat_ebt_replace *newinfo)
1821 {
1822         unsigned int size = info->entries_size;
1823         const void *entries = info->entries;
1824
1825         newinfo->entries_size = size;
1826         if (info->nentries) {
1827                 int ret = xt_compat_init_offsets(NFPROTO_BRIDGE,
1828                                                  info->nentries);
1829                 if (ret)
1830                         return ret;
1831         }
1832
1833         return EBT_ENTRY_ITERATE(entries, size, compat_calc_entry, info,
1834                                                         entries, newinfo);
1835 }
1836
1837 static int compat_copy_everything_to_user(struct ebt_table *t,
1838                                           void __user *user, int *len, int cmd)
1839 {
1840         struct compat_ebt_replace repl, tmp;
1841         struct ebt_counter *oldcounters;
1842         struct ebt_table_info tinfo;
1843         int ret;
1844         void __user *pos;
1845
1846         memset(&tinfo, 0, sizeof(tinfo));
1847
1848         if (cmd == EBT_SO_GET_ENTRIES) {
1849                 tinfo.entries_size = t->private->entries_size;
1850                 tinfo.nentries = t->private->nentries;
1851                 tinfo.entries = t->private->entries;
1852                 oldcounters = t->private->counters;
1853         } else {
1854                 tinfo.entries_size = t->table->entries_size;
1855                 tinfo.nentries = t->table->nentries;
1856                 tinfo.entries = t->table->entries;
1857                 oldcounters = t->table->counters;
1858         }
1859
1860         if (copy_from_user(&tmp, user, sizeof(tmp)))
1861                 return -EFAULT;
1862
1863         if (tmp.nentries != tinfo.nentries ||
1864            (tmp.num_counters && tmp.num_counters != tinfo.nentries))
1865                 return -EINVAL;
1866
1867         memcpy(&repl, &tmp, sizeof(repl));
1868         if (cmd == EBT_SO_GET_ENTRIES)
1869                 ret = compat_table_info(t->private, &repl);
1870         else
1871                 ret = compat_table_info(&tinfo, &repl);
1872         if (ret)
1873                 return ret;
1874
1875         if (*len != sizeof(tmp) + repl.entries_size +
1876            (tmp.num_counters? tinfo.nentries * sizeof(struct ebt_counter): 0)) {
1877                 pr_err("wrong size: *len %d, entries_size %u, replsz %d\n",
1878                                 *len, tinfo.entries_size, repl.entries_size);
1879                 return -EINVAL;
1880         }
1881
1882         /* userspace might not need the counters */
1883         ret = copy_counters_to_user(t, oldcounters, compat_ptr(tmp.counters),
1884                                         tmp.num_counters, tinfo.nentries);
1885         if (ret)
1886                 return ret;
1887
1888         pos = compat_ptr(tmp.entries);
1889         return EBT_ENTRY_ITERATE(tinfo.entries, tinfo.entries_size,
1890                         compat_copy_entry_to_user, &pos, &tmp.entries_size);
1891 }
1892
1893 struct ebt_entries_buf_state {
1894         char *buf_kern_start;   /* kernel buffer to copy (translated) data to */
1895         u32 buf_kern_len;       /* total size of kernel buffer */
1896         u32 buf_kern_offset;    /* amount of data copied so far */
1897         u32 buf_user_offset;    /* read position in userspace buffer */
1898 };
1899
1900 static int ebt_buf_count(struct ebt_entries_buf_state *state, unsigned int sz)
1901 {
1902         state->buf_kern_offset += sz;
1903         return state->buf_kern_offset >= sz ? 0 : -EINVAL;
1904 }
1905
1906 static int ebt_buf_add(struct ebt_entries_buf_state *state,
1907                        void *data, unsigned int sz)
1908 {
1909         if (state->buf_kern_start == NULL)
1910                 goto count_only;
1911
1912         if (WARN_ON(state->buf_kern_offset + sz > state->buf_kern_len))
1913                 return -EINVAL;
1914
1915         memcpy(state->buf_kern_start + state->buf_kern_offset, data, sz);
1916
1917  count_only:
1918         state->buf_user_offset += sz;
1919         return ebt_buf_count(state, sz);
1920 }
1921
1922 static int ebt_buf_add_pad(struct ebt_entries_buf_state *state, unsigned int sz)
1923 {
1924         char *b = state->buf_kern_start;
1925
1926         if (WARN_ON(b && state->buf_kern_offset > state->buf_kern_len))
1927                 return -EINVAL;
1928
1929         if (b != NULL && sz > 0)
1930                 memset(b + state->buf_kern_offset, 0, sz);
1931         /* do not adjust ->buf_user_offset here, we added kernel-side padding */
1932         return ebt_buf_count(state, sz);
1933 }
1934
1935 enum compat_mwt {
1936         EBT_COMPAT_MATCH,
1937         EBT_COMPAT_WATCHER,
1938         EBT_COMPAT_TARGET,
1939 };
1940
1941 static int compat_mtw_from_user(struct compat_ebt_entry_mwt *mwt,
1942                                 enum compat_mwt compat_mwt,
1943                                 struct ebt_entries_buf_state *state,
1944                                 const unsigned char *base)
1945 {
1946         char name[EBT_EXTENSION_MAXNAMELEN];
1947         struct xt_match *match;
1948         struct xt_target *wt;
1949         void *dst = NULL;
1950         int off, pad = 0;
1951         unsigned int size_kern, match_size = mwt->match_size;
1952
1953         if (strscpy(name, mwt->u.name, sizeof(name)) < 0)
1954                 return -EINVAL;
1955
1956         if (state->buf_kern_start)
1957                 dst = state->buf_kern_start + state->buf_kern_offset;
1958
1959         switch (compat_mwt) {
1960         case EBT_COMPAT_MATCH:
1961                 match = xt_request_find_match(NFPROTO_BRIDGE, name,
1962                                               mwt->u.revision);
1963                 if (IS_ERR(match))
1964                         return PTR_ERR(match);
1965
1966                 off = ebt_compat_match_offset(match, match_size);
1967                 if (dst) {
1968                         if (match->compat_from_user)
1969                                 match->compat_from_user(dst, mwt->data);
1970                         else
1971                                 memcpy(dst, mwt->data, match_size);
1972                 }
1973
1974                 size_kern = match->matchsize;
1975                 if (unlikely(size_kern == -1))
1976                         size_kern = match_size;
1977                 module_put(match->me);
1978                 break;
1979         case EBT_COMPAT_WATCHER: /* fallthrough */
1980         case EBT_COMPAT_TARGET:
1981                 wt = xt_request_find_target(NFPROTO_BRIDGE, name,
1982                                             mwt->u.revision);
1983                 if (IS_ERR(wt))
1984                         return PTR_ERR(wt);
1985                 off = xt_compat_target_offset(wt);
1986
1987                 if (dst) {
1988                         if (wt->compat_from_user)
1989                                 wt->compat_from_user(dst, mwt->data);
1990                         else
1991                                 memcpy(dst, mwt->data, match_size);
1992                 }
1993
1994                 size_kern = wt->targetsize;
1995                 module_put(wt->me);
1996                 break;
1997
1998         default:
1999                 return -EINVAL;
2000         }
2001
2002         state->buf_kern_offset += match_size + off;
2003         state->buf_user_offset += match_size;
2004         pad = XT_ALIGN(size_kern) - size_kern;
2005
2006         if (pad > 0 && dst) {
2007                 if (WARN_ON(state->buf_kern_len <= pad))
2008                         return -EINVAL;
2009                 if (WARN_ON(state->buf_kern_offset - (match_size + off) + size_kern > state->buf_kern_len - pad))
2010                         return -EINVAL;
2011                 memset(dst + size_kern, 0, pad);
2012         }
2013         return off + match_size;
2014 }
2015
2016 /* return size of all matches, watchers or target, including necessary
2017  * alignment and padding.
2018  */
2019 static int ebt_size_mwt(struct compat_ebt_entry_mwt *match32,
2020                         unsigned int size_left, enum compat_mwt type,
2021                         struct ebt_entries_buf_state *state, const void *base)
2022 {
2023         int growth = 0;
2024         char *buf;
2025
2026         if (size_left == 0)
2027                 return 0;
2028
2029         buf = (char *) match32;
2030
2031         while (size_left >= sizeof(*match32)) {
2032                 struct ebt_entry_match *match_kern;
2033                 int ret;
2034
2035                 match_kern = (struct ebt_entry_match *) state->buf_kern_start;
2036                 if (match_kern) {
2037                         char *tmp;
2038                         tmp = state->buf_kern_start + state->buf_kern_offset;
2039                         match_kern = (struct ebt_entry_match *) tmp;
2040                 }
2041                 ret = ebt_buf_add(state, buf, sizeof(*match32));
2042                 if (ret < 0)
2043                         return ret;
2044                 size_left -= sizeof(*match32);
2045
2046                 /* add padding before match->data (if any) */
2047                 ret = ebt_buf_add_pad(state, ebt_compat_entry_padsize());
2048                 if (ret < 0)
2049                         return ret;
2050
2051                 if (match32->match_size > size_left)
2052                         return -EINVAL;
2053
2054                 size_left -= match32->match_size;
2055
2056                 ret = compat_mtw_from_user(match32, type, state, base);
2057                 if (ret < 0)
2058                         return ret;
2059
2060                 if (WARN_ON(ret < match32->match_size))
2061                         return -EINVAL;
2062                 growth += ret - match32->match_size;
2063                 growth += ebt_compat_entry_padsize();
2064
2065                 buf += sizeof(*match32);
2066                 buf += match32->match_size;
2067
2068                 if (match_kern)
2069                         match_kern->match_size = ret;
2070
2071                 if (WARN_ON(type == EBT_COMPAT_TARGET && size_left))
2072                         return -EINVAL;
2073
2074                 match32 = (struct compat_ebt_entry_mwt *) buf;
2075         }
2076
2077         return growth;
2078 }
2079
2080 /* called for all ebt_entry structures. */
2081 static int size_entry_mwt(struct ebt_entry *entry, const unsigned char *base,
2082                           unsigned int *total,
2083                           struct ebt_entries_buf_state *state)
2084 {
2085         unsigned int i, j, startoff, new_offset = 0;
2086         /* stores match/watchers/targets & offset of next struct ebt_entry: */
2087         unsigned int offsets[4];
2088         unsigned int *offsets_update = NULL;
2089         int ret;
2090         char *buf_start;
2091
2092         if (*total < sizeof(struct ebt_entries))
2093                 return -EINVAL;
2094
2095         if (!entry->bitmask) {
2096                 *total -= sizeof(struct ebt_entries);
2097                 return ebt_buf_add(state, entry, sizeof(struct ebt_entries));
2098         }
2099         if (*total < sizeof(*entry) || entry->next_offset < sizeof(*entry))
2100                 return -EINVAL;
2101
2102         startoff = state->buf_user_offset;
2103         /* pull in most part of ebt_entry, it does not need to be changed. */
2104         ret = ebt_buf_add(state, entry,
2105                         offsetof(struct ebt_entry, watchers_offset));
2106         if (ret < 0)
2107                 return ret;
2108
2109         offsets[0] = sizeof(struct ebt_entry); /* matches come first */
2110         memcpy(&offsets[1], &entry->watchers_offset,
2111                         sizeof(offsets) - sizeof(offsets[0]));
2112
2113         if (state->buf_kern_start) {
2114                 buf_start = state->buf_kern_start + state->buf_kern_offset;
2115                 offsets_update = (unsigned int *) buf_start;
2116         }
2117         ret = ebt_buf_add(state, &offsets[1],
2118                         sizeof(offsets) - sizeof(offsets[0]));
2119         if (ret < 0)
2120                 return ret;
2121         buf_start = (char *) entry;
2122         /* 0: matches offset, always follows ebt_entry.
2123          * 1: watchers offset, from ebt_entry structure
2124          * 2: target offset, from ebt_entry structure
2125          * 3: next ebt_entry offset, from ebt_entry structure
2126          *
2127          * offsets are relative to beginning of struct ebt_entry (i.e., 0).
2128          */
2129         for (i = 0; i < 4 ; ++i) {
2130                 if (offsets[i] > *total)
2131                         return -EINVAL;
2132
2133                 if (i < 3 && offsets[i] == *total)
2134                         return -EINVAL;
2135
2136                 if (i == 0)
2137                         continue;
2138                 if (offsets[i-1] > offsets[i])
2139                         return -EINVAL;
2140         }
2141
2142         for (i = 0, j = 1 ; j < 4 ; j++, i++) {
2143                 struct compat_ebt_entry_mwt *match32;
2144                 unsigned int size;
2145                 char *buf = buf_start + offsets[i];
2146
2147                 if (offsets[i] > offsets[j])
2148                         return -EINVAL;
2149
2150                 match32 = (struct compat_ebt_entry_mwt *) buf;
2151                 size = offsets[j] - offsets[i];
2152                 ret = ebt_size_mwt(match32, size, i, state, base);
2153                 if (ret < 0)
2154                         return ret;
2155                 new_offset += ret;
2156                 if (offsets_update && new_offset) {
2157                         pr_debug("change offset %d to %d\n",
2158                                 offsets_update[i], offsets[j] + new_offset);
2159                         offsets_update[i] = offsets[j] + new_offset;
2160                 }
2161         }
2162
2163         if (state->buf_kern_start == NULL) {
2164                 unsigned int offset = buf_start - (char *) base;
2165
2166                 ret = xt_compat_add_offset(NFPROTO_BRIDGE, offset, new_offset);
2167                 if (ret < 0)
2168                         return ret;
2169         }
2170
2171         startoff = state->buf_user_offset - startoff;
2172
2173         if (WARN_ON(*total < startoff))
2174                 return -EINVAL;
2175         *total -= startoff;
2176         return 0;
2177 }
2178
2179 /* repl->entries_size is the size of the ebt_entry blob in userspace.
2180  * It might need more memory when copied to a 64 bit kernel in case
2181  * userspace is 32-bit. So, first task: find out how much memory is needed.
2182  *
2183  * Called before validation is performed.
2184  */
2185 static int compat_copy_entries(unsigned char *data, unsigned int size_user,
2186                                 struct ebt_entries_buf_state *state)
2187 {
2188         unsigned int size_remaining = size_user;
2189         int ret;
2190
2191         ret = EBT_ENTRY_ITERATE(data, size_user, size_entry_mwt, data,
2192                                         &size_remaining, state);
2193         if (ret < 0)
2194                 return ret;
2195
2196         WARN_ON(size_remaining);
2197         return state->buf_kern_offset;
2198 }
2199
2200
2201 static int compat_copy_ebt_replace_from_user(struct ebt_replace *repl,
2202                                             void __user *user, unsigned int len)
2203 {
2204         struct compat_ebt_replace tmp;
2205         int i;
2206
2207         if (len < sizeof(tmp))
2208                 return -EINVAL;
2209
2210         if (copy_from_user(&tmp, user, sizeof(tmp)))
2211                 return -EFAULT;
2212
2213         if (len != sizeof(tmp) + tmp.entries_size)
2214                 return -EINVAL;
2215
2216         if (tmp.entries_size == 0)
2217                 return -EINVAL;
2218
2219         if (tmp.nentries >= ((INT_MAX - sizeof(struct ebt_table_info)) /
2220                         NR_CPUS - SMP_CACHE_BYTES) / sizeof(struct ebt_counter))
2221                 return -ENOMEM;
2222         if (tmp.num_counters >= INT_MAX / sizeof(struct ebt_counter))
2223                 return -ENOMEM;
2224
2225         memcpy(repl, &tmp, offsetof(struct ebt_replace, hook_entry));
2226
2227         /* starting with hook_entry, 32 vs. 64 bit structures are different */
2228         for (i = 0; i < NF_BR_NUMHOOKS; i++)
2229                 repl->hook_entry[i] = compat_ptr(tmp.hook_entry[i]);
2230
2231         repl->num_counters = tmp.num_counters;
2232         repl->counters = compat_ptr(tmp.counters);
2233         repl->entries = compat_ptr(tmp.entries);
2234         return 0;
2235 }
2236
2237 static int compat_do_replace(struct net *net, void __user *user,
2238                              unsigned int len)
2239 {
2240         int ret, i, countersize, size64;
2241         struct ebt_table_info *newinfo;
2242         struct ebt_replace tmp;
2243         struct ebt_entries_buf_state state;
2244         void *entries_tmp;
2245
2246         ret = compat_copy_ebt_replace_from_user(&tmp, user, len);
2247         if (ret) {
2248                 /* try real handler in case userland supplied needed padding */
2249                 if (ret == -EINVAL && do_replace(net, user, len) == 0)
2250                         ret = 0;
2251                 return ret;
2252         }
2253
2254         countersize = COUNTER_OFFSET(tmp.nentries) * nr_cpu_ids;
2255         newinfo = vmalloc(sizeof(*newinfo) + countersize);
2256         if (!newinfo)
2257                 return -ENOMEM;
2258
2259         if (countersize)
2260                 memset(newinfo->counters, 0, countersize);
2261
2262         memset(&state, 0, sizeof(state));
2263
2264         newinfo->entries = vmalloc(tmp.entries_size);
2265         if (!newinfo->entries) {
2266                 ret = -ENOMEM;
2267                 goto free_newinfo;
2268         }
2269         if (copy_from_user(
2270            newinfo->entries, tmp.entries, tmp.entries_size) != 0) {
2271                 ret = -EFAULT;
2272                 goto free_entries;
2273         }
2274
2275         entries_tmp = newinfo->entries;
2276
2277         xt_compat_lock(NFPROTO_BRIDGE);
2278
2279         ret = xt_compat_init_offsets(NFPROTO_BRIDGE, tmp.nentries);
2280         if (ret < 0)
2281                 goto out_unlock;
2282         ret = compat_copy_entries(entries_tmp, tmp.entries_size, &state);
2283         if (ret < 0)
2284                 goto out_unlock;
2285
2286         pr_debug("tmp.entries_size %d, kern off %d, user off %d delta %d\n",
2287                 tmp.entries_size, state.buf_kern_offset, state.buf_user_offset,
2288                 xt_compat_calc_jump(NFPROTO_BRIDGE, tmp.entries_size));
2289
2290         size64 = ret;
2291         newinfo->entries = vmalloc(size64);
2292         if (!newinfo->entries) {
2293                 vfree(entries_tmp);
2294                 ret = -ENOMEM;
2295                 goto out_unlock;
2296         }
2297
2298         memset(&state, 0, sizeof(state));
2299         state.buf_kern_start = newinfo->entries;
2300         state.buf_kern_len = size64;
2301
2302         ret = compat_copy_entries(entries_tmp, tmp.entries_size, &state);
2303         if (WARN_ON(ret < 0))
2304                 goto out_unlock;
2305
2306         vfree(entries_tmp);
2307         tmp.entries_size = size64;
2308
2309         for (i = 0; i < NF_BR_NUMHOOKS; i++) {
2310                 char __user *usrptr;
2311                 if (tmp.hook_entry[i]) {
2312                         unsigned int delta;
2313                         usrptr = (char __user *) tmp.hook_entry[i];
2314                         delta = usrptr - tmp.entries;
2315                         usrptr += xt_compat_calc_jump(NFPROTO_BRIDGE, delta);
2316                         tmp.hook_entry[i] = (struct ebt_entries __user *)usrptr;
2317                 }
2318         }
2319
2320         xt_compat_flush_offsets(NFPROTO_BRIDGE);
2321         xt_compat_unlock(NFPROTO_BRIDGE);
2322
2323         ret = do_replace_finish(net, &tmp, newinfo);
2324         if (ret == 0)
2325                 return ret;
2326 free_entries:
2327         vfree(newinfo->entries);
2328 free_newinfo:
2329         vfree(newinfo);
2330         return ret;
2331 out_unlock:
2332         xt_compat_flush_offsets(NFPROTO_BRIDGE);
2333         xt_compat_unlock(NFPROTO_BRIDGE);
2334         goto free_entries;
2335 }
2336
2337 static int compat_update_counters(struct net *net, void __user *user,
2338                                   unsigned int len)
2339 {
2340         struct compat_ebt_replace hlp;
2341
2342         if (copy_from_user(&hlp, user, sizeof(hlp)))
2343                 return -EFAULT;
2344
2345         /* try real handler in case userland supplied needed padding */
2346         if (len != sizeof(hlp) + hlp.num_counters * sizeof(struct ebt_counter))
2347                 return update_counters(net, user, len);
2348
2349         return do_update_counters(net, hlp.name, compat_ptr(hlp.counters),
2350                                         hlp.num_counters, user, len);
2351 }
2352
2353 static int compat_do_ebt_set_ctl(struct sock *sk,
2354                 int cmd, void __user *user, unsigned int len)
2355 {
2356         int ret;
2357         struct net *net = sock_net(sk);
2358
2359         if (!ns_capable(net->user_ns, CAP_NET_ADMIN))
2360                 return -EPERM;
2361
2362         switch (cmd) {
2363         case EBT_SO_SET_ENTRIES:
2364                 ret = compat_do_replace(net, user, len);
2365                 break;
2366         case EBT_SO_SET_COUNTERS:
2367                 ret = compat_update_counters(net, user, len);
2368                 break;
2369         default:
2370                 ret = -EINVAL;
2371         }
2372         return ret;
2373 }
2374
2375 static int compat_do_ebt_get_ctl(struct sock *sk, int cmd,
2376                 void __user *user, int *len)
2377 {
2378         int ret;
2379         struct compat_ebt_replace tmp;
2380         struct ebt_table *t;
2381         struct net *net = sock_net(sk);
2382
2383         if (!ns_capable(net->user_ns, CAP_NET_ADMIN))
2384                 return -EPERM;
2385
2386         /* try real handler in case userland supplied needed padding */
2387         if ((cmd == EBT_SO_GET_INFO ||
2388              cmd == EBT_SO_GET_INIT_INFO) && *len != sizeof(tmp))
2389                         return do_ebt_get_ctl(sk, cmd, user, len);
2390
2391         if (copy_from_user(&tmp, user, sizeof(tmp)))
2392                 return -EFAULT;
2393
2394         tmp.name[sizeof(tmp.name) - 1] = '\0';
2395
2396         t = find_table_lock(net, tmp.name, &ret, &ebt_mutex);
2397         if (!t)
2398                 return ret;
2399
2400         xt_compat_lock(NFPROTO_BRIDGE);
2401         switch (cmd) {
2402         case EBT_SO_GET_INFO:
2403                 tmp.nentries = t->private->nentries;
2404                 ret = compat_table_info(t->private, &tmp);
2405                 if (ret)
2406                         goto out;
2407                 tmp.valid_hooks = t->valid_hooks;
2408
2409                 if (copy_to_user(user, &tmp, *len) != 0) {
2410                         ret = -EFAULT;
2411                         break;
2412                 }
2413                 ret = 0;
2414                 break;
2415         case EBT_SO_GET_INIT_INFO:
2416                 tmp.nentries = t->table->nentries;
2417                 tmp.entries_size = t->table->entries_size;
2418                 tmp.valid_hooks = t->table->valid_hooks;
2419
2420                 if (copy_to_user(user, &tmp, *len) != 0) {
2421                         ret = -EFAULT;
2422                         break;
2423                 }
2424                 ret = 0;
2425                 break;
2426         case EBT_SO_GET_ENTRIES:
2427         case EBT_SO_GET_INIT_ENTRIES:
2428                 /* try real handler first in case of userland-side padding.
2429                  * in case we are dealing with an 'ordinary' 32 bit binary
2430                  * without 64bit compatibility padding, this will fail right
2431                  * after copy_from_user when the *len argument is validated.
2432                  *
2433                  * the compat_ variant needs to do one pass over the kernel
2434                  * data set to adjust for size differences before it the check.
2435                  */
2436                 if (copy_everything_to_user(t, user, len, cmd) == 0)
2437                         ret = 0;
2438                 else
2439                         ret = compat_copy_everything_to_user(t, user, len, cmd);
2440                 break;
2441         default:
2442                 ret = -EINVAL;
2443         }
2444  out:
2445         xt_compat_flush_offsets(NFPROTO_BRIDGE);
2446         xt_compat_unlock(NFPROTO_BRIDGE);
2447         mutex_unlock(&ebt_mutex);
2448         return ret;
2449 }
2450 #endif
2451
2452 static struct nf_sockopt_ops ebt_sockopts = {
2453         .pf             = PF_INET,
2454         .set_optmin     = EBT_BASE_CTL,
2455         .set_optmax     = EBT_SO_SET_MAX + 1,
2456         .set            = do_ebt_set_ctl,
2457 #ifdef CONFIG_COMPAT
2458         .compat_set     = compat_do_ebt_set_ctl,
2459 #endif
2460         .get_optmin     = EBT_BASE_CTL,
2461         .get_optmax     = EBT_SO_GET_MAX + 1,
2462         .get            = do_ebt_get_ctl,
2463 #ifdef CONFIG_COMPAT
2464         .compat_get     = compat_do_ebt_get_ctl,
2465 #endif
2466         .owner          = THIS_MODULE,
2467 };
2468
2469 static int __init ebtables_init(void)
2470 {
2471         int ret;
2472
2473         ret = xt_register_target(&ebt_standard_target);
2474         if (ret < 0)
2475                 return ret;
2476         ret = nf_register_sockopt(&ebt_sockopts);
2477         if (ret < 0) {
2478                 xt_unregister_target(&ebt_standard_target);
2479                 return ret;
2480         }
2481
2482         return 0;
2483 }
2484
2485 static void __exit ebtables_fini(void)
2486 {
2487         nf_unregister_sockopt(&ebt_sockopts);
2488         xt_unregister_target(&ebt_standard_target);
2489 }
2490
2491 EXPORT_SYMBOL(ebt_register_table);
2492 EXPORT_SYMBOL(ebt_unregister_table);
2493 EXPORT_SYMBOL(ebt_do_table);
2494 module_init(ebtables_init);
2495 module_exit(ebtables_fini);
2496 MODULE_LICENSE("GPL");