src/owniptc/libiptc.c

   1 /**
   2  * This file was imported from the iptables sources.
   3  * Copyright (C) 1999-2008 Netfilter Core Team
   4  *
   5  * This program is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License as published by the
   7  * Free Software Foundation; only version 2 of the License is applicable.
   8  *
   9  * This program is distributed in the hope that it will be useful, but
  10  * WITHOUT ANY WARRANTY; without even the implied warranty of
  11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  12  * General Public License for more details.
  13  *
  14  * You should have received a copy of the GNU General Public License along
  15  * with this program; if not, write to the Free Software Foundation, Inc.,
  16  * 51 Franklin St, Fifth Floor, Boston, MA  02110-1301 USA
  17  */
  18
  19 /* Library which manipulates firewall rules.  Version $Revision: 7138 $ */
  20
  21 /* Architecture of firewall rules is as follows:
  22  *
  23  * Chains go INPUT, FORWARD, OUTPUT then user chains.
  24  * Each user chain starts with an ERROR node.
  25  * Every chain ends with an unconditional jump: a RETURN for user chains,
  26  * and a POLICY for built-ins.
  27  */
  28
  29 /* (C) 1999 Paul ``Rusty'' Russell - Placed under the GNU GPL (See
  30  * COPYING for details).
  31  * (C) 2000-2004 by the Netfilter Core Team <coreteam@netfilter.org>
  32  *
  33  * 2003-Jun-20: Harald Welte <laforge@netfilter.org>:
  34  *      - Reimplementation of chain cache to use offsets instead of entries
  35  * 2003-Jun-23: Harald Welte <laforge@netfilter.org>:
  36  *      - performance optimization, sponsored by Astaro AG (http://www.astaro.com/)
  37  *        don't rebuild the chain cache after every operation, instead fix it
  38  *        up after a ruleset change.
  39  * 2004-Aug-18: Harald Welte <laforge@netfilter.org>:
  40  *      - futher performance work: total reimplementation of libiptc.
  41  *      - libiptc now has a real internal (linked-list) represntation of the
  42  *        ruleset and a parser/compiler from/to this internal representation
  43  *      - again sponsored by Astaro AG (http://www.astaro.com/)
  44  */
  45 #include <sys/types.h>
  46 #include <sys/socket.h>
  47 #include "xtables.h"
  48
  49 #include "linux_list.h"
  50
  51 //#define IPTC_DEBUG2 1
  52
  53 #ifdef IPTC_DEBUG2
  54 #include <fcntl.h>
  55 #define DEBUGP(x, args...)      fprintf(stderr, "%s: " x, __FUNCTION__, ## args)
  56 #define DEBUGP_C(x, args...)    fprintf(stderr, x, ## args)
  57 #else
  58 #define DEBUGP(x, args...)
  59 #define DEBUGP_C(x, args...)
  60 #endif
  61
  62 #ifdef DEBUG
  63 #define debug(x, args...)       fprintf(stderr, x, ## args)
  64 #else
  65 #define debug(x, args...)
  66 #endif
  67
  68 static int sockfd = -1;
  69 static int sockfd_use = 0;
  70 static void *iptc_fn = NULL;
  71
  72 static const char *hooknames[] = {
  73         [HOOK_PRE_ROUTING]      = "PREROUTING",
  74         [HOOK_LOCAL_IN]         = "INPUT",
  75         [HOOK_FORWARD]          = "FORWARD",
  76         [HOOK_LOCAL_OUT]        = "OUTPUT",
  77         [HOOK_POST_ROUTING]     = "POSTROUTING",
  78 #ifdef HOOK_DROPPING
  79         [HOOK_DROPPING]         = "DROPPING"
  80 #endif
  81 };
  82
  83 /* Convenience structures */
  84 struct ipt_error_target
  85 {
  86         STRUCT_ENTRY_TARGET t;
  87         char error[TABLE_MAXNAMELEN];
  88 };
  89
  90 struct chain_head;
  91 struct rule_head;
  92
  93 struct counter_map
  94 {
  95         enum {
  96                 COUNTER_MAP_NOMAP,
  97                 COUNTER_MAP_NORMAL_MAP,
  98                 COUNTER_MAP_ZEROED,
  99                 COUNTER_MAP_SET
 100         } maptype;
 101         unsigned int mappos;
 102 };
 103
 104 enum iptcc_rule_type {
 105         IPTCC_R_STANDARD,               /* standard target (ACCEPT, ...) */
 106         IPTCC_R_MODULE,                 /* extension module (SNAT, ...) */
 107         IPTCC_R_FALLTHROUGH,            /* fallthrough rule */
 108         IPTCC_R_JUMP,                   /* jump to other chain */
 109 };
 110
 111 struct rule_head
 112 {
 113         struct list_head list;
 114         struct chain_head *chain;
 115         struct counter_map counter_map;
 116
 117         unsigned int index;             /* index (needed for counter_map) */
 118         unsigned int offset;            /* offset in rule blob */
 119
 120         enum iptcc_rule_type type;
 121         struct chain_head *jump;        /* jump target, if IPTCC_R_JUMP */
 122
 123         unsigned int size;              /* size of entry data */
 124         STRUCT_ENTRY entry[0];
 125 };
 126
 127 struct chain_head
 128 {
 129         struct list_head list;
 130         char name[TABLE_MAXNAMELEN];
 131         unsigned int hooknum;           /* hook number+1 if builtin */
 132         unsigned int references;        /* how many jumps reference us */
 133         int verdict;                    /* verdict if builtin */
 134
 135         STRUCT_COUNTERS counters;       /* per-chain counters */
 136         struct counter_map counter_map;
 137
 138         unsigned int num_rules;         /* number of rules in list */
 139         struct list_head rules;         /* list of rules */
 140
 141         unsigned int index;             /* index (needed for jump resolval) */
 142         unsigned int head_offset;       /* offset in rule blob */
 143         unsigned int foot_index;        /* index (needed for counter_map) */
 144         unsigned int foot_offset;       /* offset in rule blob */
 145 };
 146
 147 STRUCT_TC_HANDLE
 148 {
 149         int changed;                     /* Have changes been made? */
 150
 151         struct list_head chains;
 152
 153         struct chain_head *chain_iterator_cur;
 154         struct rule_head *rule_iterator_cur;
 155
 156         unsigned int num_chains;         /* number of user defined chains */
 157
 158         struct chain_head **chain_index;   /* array for fast chain list access*/
 159         unsigned int        chain_index_sz;/* size of chain index array */
 160
 161         STRUCT_GETINFO info;
 162         STRUCT_GET_ENTRIES *entries;
 163 };
 164
 165 /* allocate a new chain head for the cache */
 166 static struct chain_head *iptcc_alloc_chain_head(const char *name, int hooknum)
 167 {
 168         struct chain_head *c = malloc(sizeof(*c));
 169         if (!c)
 170                 return NULL;
 171         memset(c, 0, sizeof(*c));
 172
 173         strncpy(c->name, name, TABLE_MAXNAMELEN);
 174         c->hooknum = hooknum;
 175         INIT_LIST_HEAD(&c->rules);
 176
 177         return c;
 178 }
 179
 180 /* allocate and initialize a new rule for the cache */
 181 static struct rule_head *iptcc_alloc_rule(struct chain_head *c, unsigned int size)
 182 {
 183         struct rule_head *r = malloc(sizeof(*r)+size);
 184         if (!r)
 185                 return NULL;
 186         memset(r, 0, sizeof(*r));
 187
 188         r->chain = c;
 189         r->size = size;
 190
 191         return r;
 192 }
 193
 194 /* notify us that the ruleset has been modified by the user */
 195 static inline void
 196 set_changed(TC_HANDLE_T h)
 197 {
 198         h->changed = 1;
 199 }
 200
 201 #ifdef IPTC_DEBUG
 202 static void do_check(TC_HANDLE_T h, unsigned int line);
 203 #define CHECK(h) do { if (!getenv("IPTC_NO_CHECK")) do_check((h), __LINE__); } while(0)
 204 #else
 205 #define CHECK(h)
 206 #endif
 207
 208
 209 /**********************************************************************
 210  * iptc blob utility functions (iptcb_*)
 211  **********************************************************************/
 212
 213 static inline int
 214 iptcb_get_number(const STRUCT_ENTRY *i,
 215            const STRUCT_ENTRY *seek,
 216            unsigned int *pos)
 217 {
 218         if (i == seek)
 219                 return 1;
 220         (*pos)++;
 221         return 0;
 222 }
 223
 224 static inline int
 225 iptcb_get_entry_n(STRUCT_ENTRY *i,
 226             unsigned int number,
 227             unsigned int *pos,
 228             STRUCT_ENTRY **pe)
 229 {
 230         if (*pos == number) {
 231                 *pe = i;
 232                 return 1;
 233         }
 234         (*pos)++;
 235         return 0;
 236 }
 237
 238 static inline STRUCT_ENTRY *
 239 iptcb_get_entry(TC_HANDLE_T h, unsigned int offset)
 240 {
 241         return (STRUCT_ENTRY *)((char *)h->entries->entrytable + offset);
 242 }
 243
 244 static unsigned int
 245 iptcb_entry2index(const TC_HANDLE_T h, const STRUCT_ENTRY *seek)
 246 {
 247         unsigned int pos = 0;
 248
 249         if (ENTRY_ITERATE(h->entries->entrytable, h->entries->size,
 250                           iptcb_get_number, seek, &pos) == 0) {
 251                 fprintf(stderr, "ERROR: offset %u not an entry!\n",
 252                         (unsigned int)((char *)seek - (char *)h->entries->entrytable));
 253                 abort();
 254         }
 255         return pos;
 256 }
 257
 258 static inline STRUCT_ENTRY *
 259 iptcb_offset2entry(TC_HANDLE_T h, unsigned int offset)
 260 {
 261         return (STRUCT_ENTRY *) ((void *)h->entries->entrytable+offset);
 262 }
 263
 264
 265 static inline unsigned long
 266 iptcb_entry2offset(const TC_HANDLE_T h, const STRUCT_ENTRY *e)
 267 {
 268         return (void *)e - (void *)h->entries->entrytable;
 269 }
 270
 271 static inline unsigned int
 272 iptcb_offset2index(const TC_HANDLE_T h, unsigned int offset)
 273 {
 274         return iptcb_entry2index(h, iptcb_offset2entry(h, offset));
 275 }
 276
 277 /* Returns 0 if not hook entry, else hooknumber + 1 */
 278 static inline unsigned int
 279 iptcb_ent_is_hook_entry(STRUCT_ENTRY *e, TC_HANDLE_T h)
 280 {
 281         unsigned int i;
 282
 283         for (i = 0; i < NUMHOOKS; i++) {
 284                 if ((h->info.valid_hooks & (1 << i))
 285                     && iptcb_get_entry(h, h->info.hook_entry[i]) == e)
 286                         return i+1;
 287         }
 288         return 0;
 289 }
 290
 291
 292 /**********************************************************************
 293  * Chain index (cache utility) functions
 294  **********************************************************************
 295  * The chain index is an array with pointers into the chain list, with
 296  * CHAIN_INDEX_BUCKET_LEN spacing.  This facilitates the ability to
 297  * speedup chain list searching, by find a more optimal starting
 298  * points when searching the linked list.
 299  *
 300  * The starting point can be found fast by using a binary search of
 301  * the chain index. Thus, reducing the previous search complexity of
 302  * O(n) to O(log(n/k) + k) where k is CHAIN_INDEX_BUCKET_LEN.
 303  *
 304  * A nice property of the chain index, is that the "bucket" list
 305  * length is max CHAIN_INDEX_BUCKET_LEN (when just build, inserts will
 306  * change this). Oppose to hashing, where the "bucket" list length can
 307  * vary a lot.
 308  */
 309 #ifndef CHAIN_INDEX_BUCKET_LEN
 310 #define CHAIN_INDEX_BUCKET_LEN 40
 311 #endif
 312
 313 /* Another nice property of the chain index is that inserting/creating
 314  * chains in chain list don't change the correctness of the chain
 315  * index, it only causes longer lists in the buckets.
 316  *
 317  * To mitigate the performance penalty of longer bucket lists and the
 318  * penalty of rebuilding, the chain index is rebuild only when
 319  * CHAIN_INDEX_INSERT_MAX chains has been added.
 320  */
 321 #ifndef CHAIN_INDEX_INSERT_MAX
 322 #define CHAIN_INDEX_INSERT_MAX 355
 323 #endif
 324
 325 static inline unsigned int iptcc_is_builtin(struct chain_head *c);
 326
 327
 328 /* Use binary search in the chain index array, to find a chain_head
 329  * pointer closest to the place of the searched name element.
 330  *
 331  * Notes that, binary search (obviously) requires that the chain list
 332  * is sorted by name.
 333  */
 334 static struct list_head *
 335 iptcc_bsearch_chain_index(const char *name, unsigned int *idx, TC_HANDLE_T handle)
 336 {
 337         unsigned int pos, end;
 338         int res;
 339
 340         struct list_head *list_pos;
 341         list_pos=&handle->chains;
 342
 343         /* Check for empty array, e.g. no user defined chains */
 344         if (handle->chain_index_sz == 0) {
 345                 debug("WARNING: handle->chain_index_sz == 0\n");
 346                 return list_pos;
 347         }
 348
 349         /* Init */
 350         end = handle->chain_index_sz;
 351         pos = end / 2;
 352
 353         debug("bsearch Find chain:%s (pos:%d end:%d)\n", name, pos, end);
 354
 355         /* Loop */
 356  loop:
 357         if (!handle->chain_index[pos]) {
 358                 fprintf(stderr, "ERROR: NULL pointer chain_index[%d]\n", pos);
 359                 return &handle->chains; /* Be safe, return orig start pos */
 360         }
 361
 362         res = strcmp(name, handle->chain_index[pos]->name);
 363         list_pos = &handle->chain_index[pos]->list;
 364         *idx = pos;
 365
 366         debug("bsearch Index[%d] name:%s res:%d ",
 367               pos, handle->chain_index[pos]->name, res);
 368
 369         if (res == 0) { /* Found element, by direct hit */
 370                 debug("[found] Direct hit pos:%d end:%d\n", pos, end);
 371                 return list_pos;
 372         } else if (res < 0) { /* Too far, jump back */
 373                 end = pos;
 374                 pos = pos / 2;
 375
 376                 /* Exit case: First element of array */
 377                 if (end == 0) {
 378                         debug("[found] Reached first array elem (end%d)\n",end);
 379                         return list_pos;
 380                 }
 381                 debug("jump back to pos:%d (end:%d)\n", pos, end);
 382                 goto loop;
 383         } else if (res > 0 ){ /* Not far enough, jump forward */
 384
 385                 /* Exit case: Last element of array */
 386                 if (pos == handle->chain_index_sz-1) {
 387                         debug("[found] Last array elem (end:%d)\n", end);
 388                         return list_pos;
 389                 }
 390
 391                 /* Exit case: Next index less, thus elem in this list section */
 392                 res = strcmp(name, handle->chain_index[pos+1]->name);
 393                 if (res < 0) {
 394                         debug("[found] closest list (end:%d)\n", end);
 395                         return list_pos;
 396                 }
 397
 398                 pos = (pos+end)/2;
 399                 debug("jump forward to pos:%d (end:%d)\n", pos, end);
 400                 goto loop;
 401         }
 402
 403         return list_pos;
 404 }
 405
 406 #ifdef DEBUG
 407 /* Trivial linear search of chain index. Function used for verifying
 408    the output of bsearch function */
 409 static struct list_head *
 410 iptcc_linearly_search_chain_index(const char *name, TC_HANDLE_T handle)
 411 {
 412         unsigned int i=0;
 413         int res=0;
 414
 415         struct list_head *list_pos;
 416         list_pos = &handle->chains;
 417
 418         if (handle->chain_index_sz)
 419                 list_pos = &handle->chain_index[0]->list;
 420
 421         /* Linearly walk of chain index array */
 422
 423         for (i=0; i < handle->chain_index_sz; i++) {
 424                 if (handle->chain_index[i]) {
 425                         res = strcmp(handle->chain_index[i]->name, name);
 426                         if (res > 0)
 427                                 break; // One step too far
 428                         list_pos = &handle->chain_index[i]->list;
 429                         if (res == 0)
 430                                 break; // Direct hit
 431                 }
 432         }
 433
 434         return list_pos;
 435 }
 436 #endif
 437
 438 static int iptcc_chain_index_alloc(TC_HANDLE_T h)
 439 {
 440         unsigned int list_length = CHAIN_INDEX_BUCKET_LEN;
 441         unsigned int array_elems;
 442         unsigned int array_mem;
 443
 444         /* Allocate memory for the chain index array */
 445         array_elems = (h->num_chains / list_length) +
 446                       (h->num_chains % list_length ? 1 : 0);
 447         array_mem   = sizeof(h->chain_index) * array_elems;
 448
 449         debug("Alloc Chain index, elems:%d mem:%d bytes\n",
 450               array_elems, array_mem);
 451
 452         h->chain_index = malloc(array_mem);
 453         if (!h->chain_index) {
 454                 h->chain_index_sz = 0;
 455                 return -ENOMEM;
 456         }
 457         memset(h->chain_index, 0, array_mem);
 458         h->chain_index_sz = array_elems;
 459
 460         return 1;
 461 }
 462
 463 static void iptcc_chain_index_free(TC_HANDLE_T h)
 464 {
 465         h->chain_index_sz = 0;
 466         free(h->chain_index);
 467 }
 468
 469
 470 #ifdef DEBUG
 471 static void iptcc_chain_index_dump(TC_HANDLE_T h)
 472 {
 473         unsigned int i = 0;
 474
 475         /* Dump: contents of chain index array */
 476         for (i=0; i < h->chain_index_sz; i++) {
 477                 if (h->chain_index[i]) {
 478                         fprintf(stderr, "Chain index[%d].name: %s\n",
 479                                 i, h->chain_index[i]->name);
 480                 }
 481         }
 482 }
 483 #endif
 484
 485 /* Build the chain index */
 486 static int iptcc_chain_index_build(TC_HANDLE_T h)
 487 {
 488         unsigned int list_length = CHAIN_INDEX_BUCKET_LEN;
 489         unsigned int chains = 0;
 490         unsigned int cindex = 0;
 491         struct chain_head *c;
 492
 493         /* Build up the chain index array here */
 494         debug("Building chain index\n");
 495
 496         debug("Number of user defined chains:%d bucket_sz:%d array_sz:%d\n",
 497                 h->num_chains, list_length, h->chain_index_sz);
 498
 499         if (h->chain_index_sz == 0)
 500                 return 0;
 501
 502         list_for_each_entry(c, &h->chains, list) {
 503
 504                 /* Issue: The index array needs to start after the
 505                  * builtin chains, as they are not sorted */
 506                 if (!iptcc_is_builtin(c)) {
 507                         cindex=chains / list_length;
 508
 509                         /* Safe guard, break out on array limit, this
 510                          * is useful if chains are added and array is
 511                          * rebuild, without realloc of memory. */
 512                         if (cindex >= h->chain_index_sz)
 513                                 break;
 514
 515                         if ((chains % list_length)== 0) {
 516                                 debug("\nIndex[%d] Chains:", cindex);
 517                                 h->chain_index[cindex] = c;
 518                         }
 519                         chains++;
 520                 }
 521                 debug("%s, ", c->name);
 522         }
 523         debug("\n");
 524
 525         return 1;
 526 }
 527
 528 static int iptcc_chain_index_rebuild(TC_HANDLE_T h)
 529 {
 530         debug("REBUILD chain index array\n");
 531         iptcc_chain_index_free(h);
 532         if ((iptcc_chain_index_alloc(h)) < 0)
 533                 return -ENOMEM;
 534         iptcc_chain_index_build(h);
 535         return 1;
 536 }
 537
 538 /* Delete chain (pointer) from index array.  Removing an element from
 539  * the chain list only affects the chain index array, if the chain
 540  * index points-to/uses that list pointer.
 541  *
 542  * There are different strategies, the simple and safe is to rebuild
 543  * the chain index every time.  The more advanced is to update the
 544  * array index to point to the next element, but that requires some
 545  * house keeping and boundry checks.  The advanced is implemented, as
 546  * the simple approach behaves badly when all chains are deleted
 547  * because list_for_each processing will always hit the first chain
 548  * index, thus causing a rebuild for every chain.
 549  */
 550 static int iptcc_chain_index_delete_chain(struct chain_head *c, TC_HANDLE_T h)
 551 {
 552         struct list_head *index_ptr, *index_ptr2, *next;
 553         struct chain_head *c2;
 554         unsigned int idx, idx2;
 555
 556         index_ptr = iptcc_bsearch_chain_index(c->name, &idx, h);
 557
 558         debug("Del chain[%s] c->list:%p index_ptr:%p\n",
 559               c->name, &c->list, index_ptr);
 560
 561         /* Save the next pointer */
 562         next = c->list.next;
 563         list_del(&c->list);
 564
 565         if (index_ptr == &c->list) { /* Chain used as index ptr */
 566
 567                 /* See if its possible to avoid a rebuild, by shifting
 568                  * to next pointer.  Its possible if the next pointer
 569                  * is located in the same index bucket.
 570                  */
 571                 c2         = list_entry(next, struct chain_head, list);
 572                 index_ptr2 = iptcc_bsearch_chain_index(c2->name, &idx2, h);
 573                 if (idx != idx2) {
 574                         /* Rebuild needed */
 575                         return iptcc_chain_index_rebuild(h);
 576                 } else {
 577                         /* Avoiding rebuild */
 578                         debug("Update cindex[%d] with next ptr name:[%s]\n",
 579                               idx, c2->name);
 580                         h->chain_index[idx]=c2;
 581                         return 0;
 582                 }
 583         }
 584         return 0;
 585 }
 586
 587
 588 /**********************************************************************
 589  * iptc cache utility functions (iptcc_*)
 590  **********************************************************************/
 591
 592 /* Is the given chain builtin (1) or user-defined (0) */
 593 static inline unsigned int iptcc_is_builtin(struct chain_head *c)
 594 {
 595         return (c->hooknum ? 1 : 0);
 596 }
 597
 598 /* Get a specific rule within a chain */
 599 static struct rule_head *iptcc_get_rule_num(struct chain_head *c,
 600                                             unsigned int rulenum)
 601 {
 602         struct rule_head *r;
 603         unsigned int num = 0;
 604
 605         list_for_each_entry(r, &c->rules, list) {
 606                 num++;
 607                 if (num == rulenum)
 608                         return r;
 609         }
 610         return NULL;
 611 }
 612
 613 /* Get a specific rule within a chain backwards */
 614 static struct rule_head *iptcc_get_rule_num_reverse(struct chain_head *c,
 615                                             unsigned int rulenum)
 616 {
 617         struct rule_head *r;
 618         unsigned int num = 0;
 619
 620         list_for_each_entry_reverse(r, &c->rules, list) {
 621                 num++;
 622                 if (num == rulenum)
 623                         return r;
 624         }
 625         return NULL;
 626 }
 627
 628 /* Returns chain head if found, otherwise NULL. */
 629 static struct chain_head *
 630 iptcc_find_chain_by_offset(TC_HANDLE_T handle, unsigned int offset)
 631 {
 632         struct list_head *pos;
 633
 634         if (list_empty(&handle->chains))
 635                 return NULL;
 636
 637         list_for_each(pos, &handle->chains) {
 638                 struct chain_head *c = list_entry(pos, struct chain_head, list);
 639                 if (offset >= c->head_offset && offset <= c->foot_offset)
 640                         return c;
 641         }
 642
 643         return NULL;
 644 }
 645
 646 /* Returns chain head if found, otherwise NULL. */
 647 static struct chain_head *
 648 iptcc_find_label(const char *name, TC_HANDLE_T handle)
 649 {
 650         struct list_head *pos;
 651         struct list_head *list_start_pos;
 652         unsigned int i=0;
 653         int res;
 654
 655         if (list_empty(&handle->chains))
 656                 return NULL;
 657
 658         /* First look at builtin chains */
 659         list_for_each(pos, &handle->chains) {
 660                 struct chain_head *c = list_entry(pos, struct chain_head, list);
 661                 if (!iptcc_is_builtin(c))
 662                         break;
 663                 if (!strcmp(c->name, name))
 664                         return c;
 665         }
 666
 667         /* Find a smart place to start the search via chain index */
 668         //list_start_pos = iptcc_linearly_search_chain_index(name, handle);
 669         list_start_pos = iptcc_bsearch_chain_index(name, &i, handle);
 670
 671         /* Handel if bsearch bails out early */
 672         if (list_start_pos == &handle->chains) {
 673                 list_start_pos = pos;
 674         }
 675 #ifdef DEBUG
 676         else {
 677                 /* Verify result of bsearch against linearly index search */
 678                 struct list_head *test_pos;
 679                 struct chain_head *test_c, *tmp_c;
 680                 test_pos = iptcc_linearly_search_chain_index(name, handle);
 681                 if (list_start_pos != test_pos) {
 682                         debug("BUG in chain_index search\n");
 683                         test_c=list_entry(test_pos,      struct chain_head,list);
 684                         tmp_c =list_entry(list_start_pos,struct chain_head,list);
 685                         debug("Verify search found:\n");
 686                         debug(" Chain:%s\n", test_c->name);
 687                         debug("BSearch found:\n");
 688                         debug(" Chain:%s\n", tmp_c->name);
 689                         exit(42);
 690                 }
 691         }
 692 #endif
 693
 694         /* Initial/special case, no user defined chains */
 695         if (handle->num_chains == 0)
 696                 return NULL;
 697
 698         /* Start searching through the chain list */
 699         list_for_each(pos, list_start_pos->prev) {
 700                 struct chain_head *c = list_entry(pos, struct chain_head, list);
 701                 res = strcmp(c->name, name);
 702                 debug("List search name:%s == %s res:%d\n", name, c->name, res);
 703                 if (res==0)
 704                         return c;
 705
 706                 /* We can stop earlier as we know list is sorted */
 707                 if (res>0 && !iptcc_is_builtin(c)) { /* Walked too far*/
 708                         debug(" Not in list, walked too far, sorted list\n");
 709                         return NULL;
 710                 }
 711
 712                 /* Stop on wrap around, if list head is reached */
 713                 if (pos == &handle->chains) {
 714                         debug("Stop, list head reached\n");
 715                         return NULL;
 716                 }
 717         }
 718
 719         debug("List search NOT found name:%s\n", name);
 720         return NULL;
 721 }
 722
 723 /* called when rule is to be removed from cache */
 724 static void iptcc_delete_rule(struct rule_head *r)
 725 {
 726         DEBUGP("deleting rule %p (offset %u)\n", r, r->offset);
 727         /* clean up reference count of called chain */
 728         if (r->type == IPTCC_R_JUMP
 729             && r->jump)
 730                 r->jump->references--;
 731
 732         list_del(&r->list);
 733         free(r);
 734 }
 735
 736
 737 /**********************************************************************
 738  * RULESET PARSER (blob -> cache)
 739  **********************************************************************/
 740
 741 /* Delete policy rule of previous chain, since cache doesn't contain
 742  * chain policy rules.
 743  * WARNING: This function has ugly design and relies on a lot of context, only
 744  * to be called from specific places within the parser */
 745 static int __iptcc_p_del_policy(TC_HANDLE_T h, unsigned int num)
 746 {
 747         if (h->chain_iterator_cur) {
 748                 /* policy rule is last rule */
 749                 struct rule_head *pr = (struct rule_head *)
 750                         h->chain_iterator_cur->rules.prev;
 751
 752                 /* save verdict */
 753                 h->chain_iterator_cur->verdict =
 754                         *(int *)GET_TARGET(pr->entry)->data;
 755
 756                 /* save counter and counter_map information */
 757                 h->chain_iterator_cur->counter_map.maptype =
 758                                                 COUNTER_MAP_NORMAL_MAP;
 759                 h->chain_iterator_cur->counter_map.mappos = num-1;
 760                 memcpy(&h->chain_iterator_cur->counters, &pr->entry->counters,
 761                         sizeof(h->chain_iterator_cur->counters));
 762
 763                 /* foot_offset points to verdict rule */
 764                 h->chain_iterator_cur->foot_index = num;
 765                 h->chain_iterator_cur->foot_offset = pr->offset;
 766
 767                 /* delete rule from cache */
 768                 iptcc_delete_rule(pr);
 769                 h->chain_iterator_cur->num_rules--;
 770
 771                 return 1;
 772         }
 773         return 0;
 774 }
 775
 776 /* alphabetically insert a chain into the list */
 777 static inline void iptc_insert_chain(TC_HANDLE_T h, struct chain_head *c)
 778 {
 779         struct chain_head *tmp;
 780         struct list_head  *list_start_pos;
 781         unsigned int i=1;
 782
 783         /* Find a smart place to start the insert search */
 784         list_start_pos = iptcc_bsearch_chain_index(c->name, &i, h);
 785
 786         /* Handle the case, where chain.name is smaller than index[0] */
 787         if (i==0 && strcmp(c->name, h->chain_index[0]->name) <= 0) {
 788                 h->chain_index[0] = c; /* Update chain index head */
 789                 list_start_pos = h->chains.next;
 790                 debug("Update chain_index[0] with %s\n", c->name);
 791         }
 792
 793         /* Handel if bsearch bails out early */
 794         if (list_start_pos == &h->chains) {
 795                 list_start_pos = h->chains.next;
 796         }
 797
 798         /* sort only user defined chains */
 799         if (!c->hooknum) {
 800                 list_for_each_entry(tmp, list_start_pos->prev, list) {
 801                         if (!tmp->hooknum && strcmp(c->name, tmp->name) <= 0) {
 802                                 list_add(&c->list, tmp->list.prev);
 803                                 return;
 804                         }
 805
 806                         /* Stop if list head is reached */
 807                         if (&tmp->list == &h->chains) {
 808                                 debug("Insert, list head reached add to tail\n");
 809                                 break;
 810                         }
 811                 }
 812         }
 813
 814         /* survived till end of list: add at tail */
 815         list_add_tail(&c->list, &h->chains);
 816 }
 817
 818 /* Another ugly helper function split out of cache_add_entry to make it less
 819  * spaghetti code */
 820 static void __iptcc_p_add_chain(TC_HANDLE_T h, struct chain_head *c,
 821                                 unsigned int offset, unsigned int *num)
 822 {
 823         struct list_head  *tail = h->chains.prev;
 824         struct chain_head *ctail;
 825
 826         __iptcc_p_del_policy(h, *num);
 827
 828         c->head_offset = offset;
 829         c->index = *num;
 830
 831         /* Chains from kernel are already sorted, as they are inserted
 832          * sorted. But there exists an issue when shifting to 1.4.0
 833          * from an older version, as old versions allow last created
 834          * chain to be unsorted.
 835          */
 836         if (iptcc_is_builtin(c)) /* Only user defined chains are sorted*/
 837                 list_add_tail(&c->list, &h->chains);
 838         else {
 839                 ctail = list_entry(tail, struct chain_head, list);
 840                 if (strcmp(c->name, ctail->name) > 0)
 841                         list_add_tail(&c->list, &h->chains);/* Already sorted*/
 842                 else
 843                         iptc_insert_chain(h, c);/* Was not sorted */
 844         }
 845
 846         h->chain_iterator_cur = c;
 847 }
 848
 849 /* main parser function: add an entry from the blob to the cache */
 850 static int cache_add_entry(STRUCT_ENTRY *e,
 851                            TC_HANDLE_T h,
 852                            STRUCT_ENTRY **prev,
 853                            unsigned int *num)
 854 {
 855         unsigned int builtin;
 856         unsigned int offset = (char *)e - (char *)h->entries->entrytable;
 857
 858         DEBUGP("entering...");
 859
 860         /* Last entry ("policy rule"). End it.*/
 861         if (iptcb_entry2offset(h,e) + e->next_offset == h->entries->size) {
 862                 /* This is the ERROR node at the end of the chain */
 863                 DEBUGP_C("%u:%u: end of table:\n", *num, offset);
 864
 865                 __iptcc_p_del_policy(h, *num);
 866
 867                 h->chain_iterator_cur = NULL;
 868                 goto out_inc;
 869         }
 870
 871         /* We know this is the start of a new chain if it's an ERROR
 872          * target, or a hook entry point */
 873
 874         if (strcmp(GET_TARGET(e)->u.user.name, ERROR_TARGET) == 0) {
 875                 struct chain_head *c =
 876                         iptcc_alloc_chain_head((const char *)GET_TARGET(e)->data, 0);
 877                 DEBUGP_C("%u:%u:new userdefined chain %s: %p\n", *num, offset,
 878                         (char *)c->name, c);
 879                 if (!c) {
 880                         errno = -ENOMEM;
 881                         return -1;
 882                 }
 883                 h->num_chains++; /* New user defined chain */
 884
 885                 __iptcc_p_add_chain(h, c, offset, num);
 886
 887         } else if ((builtin = iptcb_ent_is_hook_entry(e, h)) != 0) {
 888                 struct chain_head *c =
 889                         iptcc_alloc_chain_head((char *)hooknames[builtin-1],
 890                                                 builtin);
 891                 DEBUGP_C("%u:%u new builtin chain: %p (rules=%p)\n",
 892                         *num, offset, c, &c->rules);
 893                 if (!c) {
 894                         errno = -ENOMEM;
 895                         return -1;
 896                 }
 897
 898                 c->hooknum = builtin;
 899
 900                 __iptcc_p_add_chain(h, c, offset, num);
 901
 902                 /* FIXME: this is ugly. */
 903                 goto new_rule;
 904         } else {
 905                 /* has to be normal rule */
 906                 struct rule_head *r;
 907 new_rule:
 908
 909                 if (!(r = iptcc_alloc_rule(h->chain_iterator_cur,
 910                                            e->next_offset))) {
 911                         errno = ENOMEM;
 912                         return -1;
 913                 }
 914                 DEBUGP_C("%u:%u normal rule: %p: ", *num, offset, r);
 915
 916                 r->index = *num;
 917                 r->offset = offset;
 918                 memcpy(r->entry, e, e->next_offset);
 919                 r->counter_map.maptype = COUNTER_MAP_NORMAL_MAP;
 920                 r->counter_map.mappos = r->index;
 921
 922                 /* handling of jumps, etc. */
 923                 if (!strcmp(GET_TARGET(e)->u.user.name, STANDARD_TARGET)) {
 924                         STRUCT_STANDARD_TARGET *t;
 925
 926                         t = (STRUCT_STANDARD_TARGET *)GET_TARGET(e);
 927                         if (t->target.u.target_size
 928                             != ALIGN(sizeof(STRUCT_STANDARD_TARGET))) {
 929                                 errno = EINVAL;
 930                                 return -1;
 931                         }
 932
 933                         if (t->verdict < 0) {
 934                                 DEBUGP_C("standard, verdict=%d\n", t->verdict);
 935                                 r->type = IPTCC_R_STANDARD;
 936                         } else if (t->verdict == r->offset+e->next_offset) {
 937                                 DEBUGP_C("fallthrough\n");
 938                                 r->type = IPTCC_R_FALLTHROUGH;
 939                         } else {
 940                                 DEBUGP_C("jump, target=%u\n", t->verdict);
 941                                 r->type = IPTCC_R_JUMP;
 942                                 /* Jump target fixup has to be deferred
 943                                  * until second pass, since we migh not
 944                                  * yet have parsed the target */
 945                         }
 946                 } else {
 947                         DEBUGP_C("module, target=%s\n", GET_TARGET(e)->u.user.name);
 948                         r->type = IPTCC_R_MODULE;
 949                 }
 950
 951                 list_add_tail(&r->list, &h->chain_iterator_cur->rules);
 952                 h->chain_iterator_cur->num_rules++;
 953         }
 954 out_inc:
 955         (*num)++;
 956         return 0;
 957 }
 958
 959
 960 /* parse an iptables blob into it's pieces */
 961 static int parse_table(TC_HANDLE_T h)
 962 {
 963         STRUCT_ENTRY *prev;
 964         unsigned int num = 0;
 965         struct chain_head *c;
 966
 967         /* First pass: over ruleset blob */
 968         ENTRY_ITERATE(h->entries->entrytable, h->entries->size,
 969                         cache_add_entry, h, &prev, &num);
 970
 971         /* Build the chain index, used for chain list search speedup */
 972         if ((iptcc_chain_index_alloc(h)) < 0)
 973                 return -ENOMEM;
 974         iptcc_chain_index_build(h);
 975
 976         /* Second pass: fixup parsed data from first pass */
 977         list_for_each_entry(c, &h->chains, list) {
 978                 struct rule_head *r;
 979                 list_for_each_entry(r, &c->rules, list) {
 980                         struct chain_head *lc;
 981                         STRUCT_STANDARD_TARGET *t;
 982
 983                         if (r->type != IPTCC_R_JUMP)
 984                                 continue;
 985
 986                         t = (STRUCT_STANDARD_TARGET *)GET_TARGET(r->entry);
 987                         lc = iptcc_find_chain_by_offset(h, t->verdict);
 988                         if (!lc)
 989                                 return -1;
 990                         r->jump = lc;
 991                         lc->references++;
 992                 }
 993         }
 994
 995         /* FIXME: sort chains */
 996
 997         return 1;
 998 }
 999
1000
1001 /**********************************************************************
1002  * RULESET COMPILATION (cache -> blob)
1003  **********************************************************************/
1004
1005 /* Convenience structures */
1006 struct iptcb_chain_start{
1007         STRUCT_ENTRY e;
1008         struct ipt_error_target name;
1009 };
1010 #define IPTCB_CHAIN_START_SIZE  (sizeof(STRUCT_ENTRY) +                 \
1011                                  ALIGN(sizeof(struct ipt_error_target)))
1012
1013 struct iptcb_chain_foot {
1014         STRUCT_ENTRY e;
1015         STRUCT_STANDARD_TARGET target;
1016 };
1017 #define IPTCB_CHAIN_FOOT_SIZE   (sizeof(STRUCT_ENTRY) +                 \
1018                                  ALIGN(sizeof(STRUCT_STANDARD_TARGET)))
1019
1020 struct iptcb_chain_error {
1021         STRUCT_ENTRY entry;
1022         struct ipt_error_target target;
1023 };
1024 #define IPTCB_CHAIN_ERROR_SIZE  (sizeof(STRUCT_ENTRY) +                 \
1025                                  ALIGN(sizeof(struct ipt_error_target)))
1026
1027
1028
1029 /* compile rule from cache into blob */
1030 static inline int iptcc_compile_rule (TC_HANDLE_T h, STRUCT_REPLACE *repl, struct rule_head *r)
1031 {
1032         /* handle jumps */
1033         if (r->type == IPTCC_R_JUMP) {
1034                 STRUCT_STANDARD_TARGET *t;
1035                 t = (STRUCT_STANDARD_TARGET *)GET_TARGET(r->entry);
1036                 /* memset for memcmp convenience on delete/replace */
1037                 memset(t->target.u.user.name, 0, FUNCTION_MAXNAMELEN);
1038                 strcpy(t->target.u.user.name, STANDARD_TARGET);
1039                 /* Jumps can only happen to builtin chains, so we
1040                  * can safely assume that they always have a header */
1041                 t->verdict = r->jump->head_offset + IPTCB_CHAIN_START_SIZE;
1042         } else if (r->type == IPTCC_R_FALLTHROUGH) {
1043                 STRUCT_STANDARD_TARGET *t;
1044                 t = (STRUCT_STANDARD_TARGET *)GET_TARGET(r->entry);
1045                 t->verdict = r->offset + r->size;
1046         }
1047
1048         /* copy entry from cache to blob */
1049         memcpy((char *)repl->entries+r->offset, r->entry, r->size);
1050
1051         return 1;
1052 }
1053
1054 /* compile chain from cache into blob */
1055 static int iptcc_compile_chain(TC_HANDLE_T h, STRUCT_REPLACE *repl, struct chain_head *c)
1056 {
1057         int ret;
1058         struct rule_head *r;
1059         struct iptcb_chain_start *head;
1060         struct iptcb_chain_foot *foot;
1061
1062         /* only user-defined chains have heaer */
1063         if (!iptcc_is_builtin(c)) {
1064                 /* put chain header in place */
1065                 head = (void *)repl->entries + c->head_offset;
1066                 head->e.target_offset = sizeof(STRUCT_ENTRY);
1067                 head->e.next_offset = IPTCB_CHAIN_START_SIZE;
1068                 strcpy(head->name.t.u.user.name, ERROR_TARGET);
1069                 head->name.t.u.target_size =
1070                                 ALIGN(sizeof(struct ipt_error_target));
1071                 strcpy(head->name.error, c->name);
1072         } else {
1073                 repl->hook_entry[c->hooknum-1] = c->head_offset;
1074                 repl->underflow[c->hooknum-1] = c->foot_offset;
1075         }
1076
1077         /* iterate over rules */
1078         list_for_each_entry(r, &c->rules, list) {
1079                 ret = iptcc_compile_rule(h, repl, r);
1080                 if (ret < 0)
1081                         return ret;
1082         }
1083
1084         /* put chain footer in place */
1085         foot = (void *)repl->entries + c->foot_offset;
1086         foot->e.target_offset = sizeof(STRUCT_ENTRY);
1087         foot->e.next_offset = IPTCB_CHAIN_FOOT_SIZE;
1088         strcpy(foot->target.target.u.user.name, STANDARD_TARGET);
1089         foot->target.target.u.target_size =
1090                                 ALIGN(sizeof(STRUCT_STANDARD_TARGET));
1091         /* builtin targets have verdict, others return */
1092         if (iptcc_is_builtin(c))
1093                 foot->target.verdict = c->verdict;
1094         else
1095                 foot->target.verdict = RETURN;
1096         /* set policy-counters */
1097         memcpy(&foot->e.counters, &c->counters, sizeof(STRUCT_COUNTERS));
1098
1099         return 0;
1100 }
1101
1102 /* calculate offset and number for every rule in the cache */
1103 static int iptcc_compile_chain_offsets(TC_HANDLE_T h, struct chain_head *c,
1104                                        unsigned int *offset, unsigned int *num)
1105 {
1106         struct rule_head *r;
1107
1108         c->head_offset = *offset;
1109         DEBUGP("%s: chain_head %u, offset=%u\n", c->name, *num, *offset);
1110
1111         if (!iptcc_is_builtin(c))  {
1112                 /* Chain has header */
1113                 *offset += sizeof(STRUCT_ENTRY)
1114                              + ALIGN(sizeof(struct ipt_error_target));
1115                 (*num)++;
1116         }
1117
1118         list_for_each_entry(r, &c->rules, list) {
1119                 DEBUGP("rule %u, offset=%u, index=%u\n", *num, *offset, *num);
1120                 r->offset = *offset;
1121                 r->index = *num;
1122                 *offset += r->size;
1123                 (*num)++;
1124         }
1125
1126         DEBUGP("%s; chain_foot %u, offset=%u, index=%u\n", c->name, *num,
1127                 *offset, *num);
1128         c->foot_offset = *offset;
1129         c->foot_index = *num;
1130         *offset += sizeof(STRUCT_ENTRY)
1131                    + ALIGN(sizeof(STRUCT_STANDARD_TARGET));
1132         (*num)++;
1133
1134         return 1;
1135 }
1136
1137 /* put the pieces back together again */
1138 static int iptcc_compile_table_prep(TC_HANDLE_T h, unsigned int *size)
1139 {
1140         struct chain_head *c;
1141         unsigned int offset = 0, num = 0;
1142         int ret = 0;
1143
1144         /* First pass: calculate offset for every rule */
1145         list_for_each_entry(c, &h->chains, list) {
1146                 ret = iptcc_compile_chain_offsets(h, c, &offset, &num);
1147                 if (ret < 0)
1148                         return ret;
1149         }
1150
1151         /* Append one error rule at end of chain */
1152         num++;
1153         offset += sizeof(STRUCT_ENTRY)
1154                   + ALIGN(sizeof(struct ipt_error_target));
1155
1156         /* ruleset size is now in offset */
1157         *size = offset;
1158         return num;
1159 }
1160
1161 static int iptcc_compile_table(TC_HANDLE_T h, STRUCT_REPLACE *repl)
1162 {
1163         struct chain_head *c;
1164         struct iptcb_chain_error *error;
1165
1166         /* Second pass: copy from cache to offsets, fill in jumps */
1167         list_for_each_entry(c, &h->chains, list) {
1168                 int ret = iptcc_compile_chain(h, repl, c);
1169                 if (ret < 0)
1170                         return ret;
1171         }
1172
1173         /* Append error rule at end of chain */
1174         error = (void *)repl->entries + repl->size - IPTCB_CHAIN_ERROR_SIZE;
1175         error->entry.target_offset = sizeof(STRUCT_ENTRY);
1176         error->entry.next_offset = IPTCB_CHAIN_ERROR_SIZE;
1177         error->target.t.u.user.target_size =
1178                 ALIGN(sizeof(struct ipt_error_target));
1179         strcpy((char *)&error->target.t.u.user.name, ERROR_TARGET);
1180         strcpy((char *)&error->target.error, "ERROR");
1181
1182         return 1;
1183 }
1184
1185 /**********************************************************************
1186  * EXTERNAL API (operates on cache only)
1187  **********************************************************************/
1188
1189 /* Allocate handle of given size */
1190 static TC_HANDLE_T
1191 alloc_handle(const char *tablename, unsigned int size, unsigned int num_rules)
1192 {
1193         size_t len;
1194         TC_HANDLE_T h;
1195
1196         len = sizeof(STRUCT_TC_HANDLE) + size;
1197
1198         h = malloc(sizeof(STRUCT_TC_HANDLE));
1199         if (!h) {
1200                 errno = ENOMEM;
1201                 return NULL;
1202         }
1203         memset(h, 0, sizeof(*h));
1204         INIT_LIST_HEAD(&h->chains);
1205         strcpy(h->info.name, tablename);
1206
1207         h->entries = malloc(sizeof(STRUCT_GET_ENTRIES) + size);
1208         if (!h->entries)
1209                 goto out_free_handle;
1210
1211         strcpy(h->entries->name, tablename);
1212         h->entries->size = size;
1213
1214         return h;
1215
1216 out_free_handle:
1217         free(h);
1218
1219         return NULL;
1220 }
1221
1222
1223 TC_HANDLE_T
1224 TC_INIT(const char *tablename)
1225 {
1226         TC_HANDLE_T h;
1227         STRUCT_GETINFO info;
1228         unsigned int tmp;
1229         socklen_t s;
1230
1231         iptc_fn = TC_INIT;
1232
1233         if (strlen(tablename) >= TABLE_MAXNAMELEN) {
1234                 errno = EINVAL;
1235                 return NULL;
1236         }
1237
1238         if (sockfd_use == 0) {
1239                 sockfd = socket(TC_AF, SOCK_RAW, IPPROTO_RAW);
1240                 if (sockfd < 0)
1241                         return NULL;
1242         }
1243         sockfd_use++;
1244 retry:
1245         s = sizeof(info);
1246
1247         strcpy(info.name, tablename);
1248         if (getsockopt(sockfd, TC_IPPROTO, SO_GET_INFO, &info, &s) < 0) {
1249                 if (--sockfd_use == 0) {
1250                         close(sockfd);
1251                         sockfd = -1;
1252                 }
1253                 return NULL;
1254         }
1255
1256         DEBUGP("valid_hooks=0x%08x, num_entries=%u, size=%u\n",
1257                 info.valid_hooks, info.num_entries, info.size);
1258
1259         if ((h = alloc_handle(info.name, info.size, info.num_entries))
1260             == NULL) {
1261                 if (--sockfd_use == 0) {
1262                         close(sockfd);
1263                         sockfd = -1;
1264                 }
1265                 return NULL;
1266         }
1267
1268         /* Initialize current state */
1269         h->info = info;
1270
1271         h->entries->size = h->info.size;
1272
1273         tmp = sizeof(STRUCT_GET_ENTRIES) + h->info.size;
1274
1275         if (getsockopt(sockfd, TC_IPPROTO, SO_GET_ENTRIES, h->entries,
1276                        &tmp) < 0)
1277                 goto error;
1278
1279 #ifdef IPTC_DEBUG2
1280         {
1281                 int fd = open("/tmp/libiptc-so_get_entries.blob",
1282                                 O_CREAT|O_WRONLY);
1283                 if (fd >= 0) {
1284                         write(fd, h->entries, tmp);
1285                         close(fd);
1286                 }
1287         }
1288 #endif
1289
1290         if (parse_table(h) < 0)
1291                 goto error;
1292
1293         CHECK(h);
1294         return h;
1295 error:
1296         TC_FREE(&h);
1297         /* A different process changed the ruleset size, retry */
1298         if (errno == EAGAIN)
1299                 goto retry;
1300         return NULL;
1301 }
1302
1303 void
1304 TC_FREE(TC_HANDLE_T *h)
1305 {
1306         struct chain_head *c, *tmp;
1307
1308         iptc_fn = TC_FREE;
1309         if (--sockfd_use == 0) {
1310                 close(sockfd);
1311                 sockfd = -1;
1312         }
1313
1314         list_for_each_entry_safe(c, tmp, &(*h)->chains, list) {
1315                 struct rule_head *r, *rtmp;
1316
1317                 list_for_each_entry_safe(r, rtmp, &c->rules, list) {
1318                         free(r);
1319                 }
1320
1321                 free(c);
1322         }
1323
1324         iptcc_chain_index_free(*h);
1325
1326         free((*h)->entries);
1327         free(*h);
1328
1329         *h = NULL;
1330 }
1331
1332 static inline int
1333 print_match(const STRUCT_ENTRY_MATCH *m)
1334 {
1335         printf("Match name: `%s'\n", m->u.user.name);
1336         return 0;
1337 }
1338
1339 static int dump_entry(STRUCT_ENTRY *e, const TC_HANDLE_T handle);
1340
1341 void
1342 TC_DUMP_ENTRIES(const TC_HANDLE_T handle)
1343 {
1344         iptc_fn = TC_DUMP_ENTRIES;
1345         CHECK(handle);
1346
1347         printf("libiptc v%s. %u bytes.\n",
1348                XTABLES_VERSION, handle->entries->size);
1349         printf("Table `%s'\n", handle->info.name);
1350         printf("Hooks: pre/in/fwd/out/post = %u/%u/%u/%u/%u\n",
1351                handle->info.hook_entry[HOOK_PRE_ROUTING],
1352                handle->info.hook_entry[HOOK_LOCAL_IN],
1353                handle->info.hook_entry[HOOK_FORWARD],
1354                handle->info.hook_entry[HOOK_LOCAL_OUT],
1355                handle->info.hook_entry[HOOK_POST_ROUTING]);
1356         printf("Underflows: pre/in/fwd/out/post = %u/%u/%u/%u/%u\n",
1357                handle->info.underflow[HOOK_PRE_ROUTING],
1358                handle->info.underflow[HOOK_LOCAL_IN],
1359                handle->info.underflow[HOOK_FORWARD],
1360                handle->info.underflow[HOOK_LOCAL_OUT],
1361                handle->info.underflow[HOOK_POST_ROUTING]);
1362
1363         ENTRY_ITERATE(handle->entries->entrytable, handle->entries->size,
1364                       dump_entry, handle);
1365 }
1366
1367 /* Does this chain exist? */
1368 int TC_IS_CHAIN(const char *chain, const TC_HANDLE_T handle)
1369 {
1370         iptc_fn = TC_IS_CHAIN;
1371         return iptcc_find_label(chain, handle) != NULL;
1372 }
1373
1374 static void iptcc_chain_iterator_advance(TC_HANDLE_T handle)
1375 {
1376         struct chain_head *c = handle->chain_iterator_cur;
1377
1378         if (c->list.next == &handle->chains)
1379                 handle->chain_iterator_cur = NULL;
1380         else
1381                 handle->chain_iterator_cur =
1382                         list_entry(c->list.next, struct chain_head, list);
1383 }
1384
1385 /* Iterator functions to run through the chains. */
1386 const char *
1387 TC_FIRST_CHAIN(TC_HANDLE_T *handle)
1388 {
1389         struct chain_head *c = list_entry((*handle)->chains.next,
1390                                           struct chain_head, list);
1391
1392         iptc_fn = TC_FIRST_CHAIN;
1393
1394
1395         if (list_empty(&(*handle)->chains)) {
1396                 DEBUGP(": no chains\n");
1397                 return NULL;
1398         }
1399
1400         (*handle)->chain_iterator_cur = c;
1401         iptcc_chain_iterator_advance(*handle);
1402
1403         DEBUGP(": returning `%s'\n", c->name);
1404         return c->name;
1405 }
1406
1407 /* Iterator functions to run through the chains.  Returns NULL at end. */
1408 const char *
1409 TC_NEXT_CHAIN(TC_HANDLE_T *handle)
1410 {
1411         struct chain_head *c = (*handle)->chain_iterator_cur;
1412
1413         iptc_fn = TC_NEXT_CHAIN;
1414
1415         if (!c) {
1416                 DEBUGP(": no more chains\n");
1417                 return NULL;
1418         }
1419
1420         iptcc_chain_iterator_advance(*handle);
1421
1422         DEBUGP(": returning `%s'\n", c->name);
1423         return c->name;
1424 }
1425
1426 /* Get first rule in the given chain: NULL for empty chain. */
1427 const STRUCT_ENTRY *
1428 TC_FIRST_RULE(const char *chain, TC_HANDLE_T *handle)
1429 {
1430         struct chain_head *c;
1431         struct rule_head *r;
1432
1433         iptc_fn = TC_FIRST_RULE;
1434
1435         DEBUGP("first rule(%s): ", chain);
1436
1437         c = iptcc_find_label(chain, *handle);
1438         if (!c) {
1439                 errno = ENOENT;
1440                 return NULL;
1441         }
1442
1443         /* Empty chain: single return/policy rule */
1444         if (list_empty(&c->rules)) {
1445                 DEBUGP_C("no rules, returning NULL\n");
1446                 return NULL;
1447         }
1448
1449         r = list_entry(c->rules.next, struct rule_head, list);
1450         (*handle)->rule_iterator_cur = r;
1451         DEBUGP_C("%p\n", r);
1452
1453         return r->entry;
1454 }
1455
1456 /* Returns NULL when rules run out. */
1457 const STRUCT_ENTRY *
1458 TC_NEXT_RULE(const STRUCT_ENTRY *prev, TC_HANDLE_T *handle)
1459 {
1460         struct rule_head *r;
1461
1462         iptc_fn = TC_NEXT_RULE;
1463         DEBUGP("rule_iterator_cur=%p...", (*handle)->rule_iterator_cur);
1464
1465         if (!(*handle)->rule_iterator_cur) {
1466                 DEBUGP_C("returning NULL\n");
1467                 return NULL;
1468         }
1469
1470         r = list_entry((*handle)->rule_iterator_cur->list.next,
1471                         struct rule_head, list);
1472
1473         iptc_fn = TC_NEXT_RULE;
1474
1475         DEBUGP_C("next=%p, head=%p...", &r->list,
1476                 &(*handle)->rule_iterator_cur->chain->rules);
1477
1478         if (&r->list == &(*handle)->rule_iterator_cur->chain->rules) {
1479                 (*handle)->rule_iterator_cur = NULL;
1480                 DEBUGP_C("finished, returning NULL\n");
1481                 return NULL;
1482         }
1483
1484         (*handle)->rule_iterator_cur = r;
1485
1486         /* NOTE: prev is without any influence ! */
1487         DEBUGP_C("returning rule %p\n", r);
1488         return r->entry;
1489 }
1490
1491 /* Returns a pointer to the target name of this position. */
1492 static const char *standard_target_map(int verdict)
1493 {
1494         switch (verdict) {
1495                 case RETURN:
1496                         return LABEL_RETURN;
1497                         break;
1498                 case -NF_ACCEPT-1:
1499                         return LABEL_ACCEPT;
1500                         break;
1501                 case -NF_DROP-1:
1502                         return LABEL_DROP;
1503                         break;
1504                 case -NF_QUEUE-1:
1505                         return LABEL_QUEUE;
1506                         break;
1507                 default:
1508                         fprintf(stderr, "ERROR: %d not a valid target)\n",
1509                                 verdict);
1510                         abort();
1511                         break;
1512         }
1513         /* not reached */
1514         return NULL;
1515 }
1516
1517 /* Returns a pointer to the target name of this position. */
1518 const char *TC_GET_TARGET(const STRUCT_ENTRY *ce,
1519                           TC_HANDLE_T *handle)
1520 {
1521         STRUCT_ENTRY *e = (STRUCT_ENTRY *)ce;
1522         struct rule_head *r = container_of(e, struct rule_head, entry[0]);
1523
1524         iptc_fn = TC_GET_TARGET;
1525
1526         switch(r->type) {
1527                 int spos;
1528                 case IPTCC_R_FALLTHROUGH:
1529                         return "";
1530                         break;
1531                 case IPTCC_R_JUMP:
1532                         DEBUGP("r=%p, jump=%p, name=`%s'\n", r, r->jump, r->jump->name);
1533                         return r->jump->name;
1534                         break;
1535                 case IPTCC_R_STANDARD:
1536                         spos = *(int *)GET_TARGET(e)->data;
1537                         DEBUGP("r=%p, spos=%d'\n", r, spos);
1538                         return standard_target_map(spos);
1539                         break;
1540                 case IPTCC_R_MODULE:
1541                         return GET_TARGET(e)->u.user.name;
1542                         break;
1543         }
1544         return NULL;
1545 }
1546 /* Is this a built-in chain?  Actually returns hook + 1. */
1547 int
1548 TC_BUILTIN(const char *chain, const TC_HANDLE_T handle)
1549 {
1550         struct chain_head *c;
1551
1552         iptc_fn = TC_BUILTIN;
1553
1554         c = iptcc_find_label(chain, handle);
1555         if (!c) {
1556                 errno = ENOENT;
1557                 return 0;
1558         }
1559
1560         return iptcc_is_builtin(c);
1561 }
1562
1563 /* Get the policy of a given built-in chain */
1564 const char *
1565 TC_GET_POLICY(const char *chain,
1566               STRUCT_COUNTERS *counters,
1567               TC_HANDLE_T *handle)
1568 {
1569         struct chain_head *c;
1570
1571         iptc_fn = TC_GET_POLICY;
1572
1573         DEBUGP("called for chain %s\n", chain);
1574
1575         c = iptcc_find_label(chain, *handle);
1576         if (!c) {
1577                 errno = ENOENT;
1578                 return NULL;
1579         }
1580
1581         if (!iptcc_is_builtin(c))
1582                 return NULL;
1583
1584         *counters = c->counters;
1585
1586         return standard_target_map(c->verdict);
1587 }
1588
1589 static int
1590 iptcc_standard_map(struct rule_head *r, int verdict)
1591 {
1592         STRUCT_ENTRY *e = r->entry;
1593         STRUCT_STANDARD_TARGET *t;
1594
1595         t = (STRUCT_STANDARD_TARGET *)GET_TARGET(e);
1596
1597         if (t->target.u.target_size
1598             != ALIGN(sizeof(STRUCT_STANDARD_TARGET))) {
1599                 errno = EINVAL;
1600                 return 0;
1601         }
1602         /* memset for memcmp convenience on delete/replace */
1603         memset(t->target.u.user.name, 0, FUNCTION_MAXNAMELEN);
1604         strcpy(t->target.u.user.name, STANDARD_TARGET);
1605         t->verdict = verdict;
1606
1607         r->type = IPTCC_R_STANDARD;
1608
1609         return 1;
1610 }
1611
1612 static int
1613 iptcc_map_target(const TC_HANDLE_T handle,
1614            struct rule_head *r)
1615 {
1616         STRUCT_ENTRY *e = r->entry;
1617         STRUCT_ENTRY_TARGET *t = GET_TARGET(e);
1618
1619         /* Maybe it's empty (=> fall through) */
1620         if (strcmp(t->u.user.name, "") == 0) {
1621                 r->type = IPTCC_R_FALLTHROUGH;
1622                 return 1;
1623         }
1624         /* Maybe it's a standard target name... */
1625         else if (strcmp(t->u.user.name, LABEL_ACCEPT) == 0)
1626                 return iptcc_standard_map(r, -NF_ACCEPT - 1);
1627         else if (strcmp(t->u.user.name, LABEL_DROP) == 0)
1628                 return iptcc_standard_map(r, -NF_DROP - 1);
1629         else if (strcmp(t->u.user.name, LABEL_QUEUE) == 0)
1630                 return iptcc_standard_map(r, -NF_QUEUE - 1);
1631         else if (strcmp(t->u.user.name, LABEL_RETURN) == 0)
1632                 return iptcc_standard_map(r, RETURN);
1633         else if (TC_BUILTIN(t->u.user.name, handle)) {
1634                 /* Can't jump to builtins. */
1635                 errno = EINVAL;
1636                 return 0;
1637         } else {
1638                 /* Maybe it's an existing chain name. */
1639                 struct chain_head *c;
1640                 DEBUGP("trying to find chain `%s': ", t->u.user.name);
1641
1642                 c = iptcc_find_label(t->u.user.name, handle);
1643                 if (c) {
1644                         DEBUGP_C("found!\n");
1645                         r->type = IPTCC_R_JUMP;
1646                         r->jump = c;
1647                         c->references++;
1648                         return 1;
1649                 }
1650                 DEBUGP_C("not found :(\n");
1651         }
1652
1653         /* Must be a module?  If not, kernel will reject... */
1654         /* memset to all 0 for your memcmp convenience: don't clear version */
1655         memset(t->u.user.name + strlen(t->u.user.name),
1656                0,
1657                FUNCTION_MAXNAMELEN - 1 - strlen(t->u.user.name));
1658         r->type = IPTCC_R_MODULE;
1659         set_changed(handle);
1660         return 1;
1661 }
1662
1663 /* Insert the entry `fw' in chain `chain' into position `rulenum'. */
1664 int
1665 TC_INSERT_ENTRY(const IPT_CHAINLABEL chain,
1666                 const STRUCT_ENTRY *e,
1667                 unsigned int rulenum,
1668                 TC_HANDLE_T *handle)
1669 {
1670         struct chain_head *c;
1671         struct rule_head *r;
1672         struct list_head *prev;
1673
1674         iptc_fn = TC_INSERT_ENTRY;
1675
1676         if (!(c = iptcc_find_label(chain, *handle))) {
1677                 errno = ENOENT;
1678                 return 0;
1679         }
1680
1681         /* first rulenum index = 0
1682            first c->num_rules index = 1 */
1683         if (rulenum > c->num_rules) {
1684                 errno = E2BIG;
1685                 return 0;
1686         }
1687
1688         /* If we are inserting at the end just take advantage of the
1689            double linked list, insert will happen before the entry
1690            prev points to. */
1691         if (rulenum == c->num_rules) {
1692                 prev = &c->rules;
1693         } else if (rulenum + 1 <= c->num_rules/2) {
1694                 r = iptcc_get_rule_num(c, rulenum + 1);
1695                 prev = &r->list;
1696         } else {
1697                 r = iptcc_get_rule_num_reverse(c, c->num_rules - rulenum);
1698                 prev = &r->list;
1699         }
1700
1701         if (!(r = iptcc_alloc_rule(c, e->next_offset))) {
1702                 errno = ENOMEM;
1703                 return 0;
1704         }
1705
1706         memcpy(r->entry, e, e->next_offset);
1707         r->counter_map.maptype = COUNTER_MAP_SET;
1708
1709         if (!iptcc_map_target(*handle, r)) {
1710                 free(r);
1711                 return 0;
1712         }
1713
1714         list_add_tail(&r->list, prev);
1715         c->num_rules++;
1716
1717         set_changed(*handle);
1718
1719         return 1;
1720 }
1721
1722 /* Atomically replace rule `rulenum' in `chain' with `fw'. */
1723 int
1724 TC_REPLACE_ENTRY(const IPT_CHAINLABEL chain,
1725                  const STRUCT_ENTRY *e,
1726                  unsigned int rulenum,
1727                  TC_HANDLE_T *handle)
1728 {
1729         struct chain_head *c;
1730         struct rule_head *r, *old;
1731
1732         iptc_fn = TC_REPLACE_ENTRY;
1733
1734         if (!(c = iptcc_find_label(chain, *handle))) {
1735                 errno = ENOENT;
1736                 return 0;
1737         }
1738
1739         if (rulenum >= c->num_rules) {
1740                 errno = E2BIG;
1741                 return 0;
1742         }
1743
1744         /* Take advantage of the double linked list if possible. */
1745         if (rulenum + 1 <= c->num_rules/2) {
1746                 old = iptcc_get_rule_num(c, rulenum + 1);
1747         } else {
1748                 old = iptcc_get_rule_num_reverse(c, c->num_rules - rulenum);
1749         }
1750
1751         if (!(r = iptcc_alloc_rule(c, e->next_offset))) {
1752                 errno = ENOMEM;
1753                 return 0;
1754         }
1755
1756         memcpy(r->entry, e, e->next_offset);
1757         r->counter_map.maptype = COUNTER_MAP_SET;
1758
1759         if (!iptcc_map_target(*handle, r)) {
1760                 free(r);
1761                 return 0;
1762         }
1763
1764         list_add(&r->list, &old->list);
1765         iptcc_delete_rule(old);
1766
1767         set_changed(*handle);
1768
1769         return 1;
1770 }
1771
1772 /* Append entry `fw' to chain `chain'.  Equivalent to insert with
1773    rulenum = length of chain. */
1774 int
1775 TC_APPEND_ENTRY(const IPT_CHAINLABEL chain,
1776                 const STRUCT_ENTRY *e,
1777                 TC_HANDLE_T *handle)
1778 {
1779         struct chain_head *c;
1780         struct rule_head *r;
1781
1782         iptc_fn = TC_APPEND_ENTRY;
1783         if (!(c = iptcc_find_label(chain, *handle))) {
1784                 DEBUGP("unable to find chain `%s'\n", chain);
1785                 errno = ENOENT;
1786                 return 0;
1787         }
1788
1789         if (!(r = iptcc_alloc_rule(c, e->next_offset))) {
1790                 DEBUGP("unable to allocate rule for chain `%s'\n", chain);
1791                 errno = ENOMEM;
1792                 return 0;
1793         }
1794
1795         memcpy(r->entry, e, e->next_offset);
1796         r->counter_map.maptype = COUNTER_MAP_SET;
1797
1798         if (!iptcc_map_target(*handle, r)) {
1799                 DEBUGP("unable to map target of rule for chain `%s'\n", chain);
1800                 free(r);
1801                 return 0;
1802         }
1803
1804         list_add_tail(&r->list, &c->rules);
1805         c->num_rules++;
1806
1807         set_changed(*handle);
1808
1809         return 1;
1810 }
1811
1812 static inline int
1813 match_different(const STRUCT_ENTRY_MATCH *a,
1814                 const unsigned char *a_elems,
1815                 const unsigned char *b_elems,
1816                 unsigned char **maskptr)
1817 {
1818         const STRUCT_ENTRY_MATCH *b;
1819         unsigned int i;
1820
1821         /* Offset of b is the same as a. */
1822         b = (void *)b_elems + ((unsigned char *)a - a_elems);
1823
1824         if (a->u.match_size != b->u.match_size)
1825                 return 1;
1826
1827         if (strcmp(a->u.user.name, b->u.user.name) != 0)
1828                 return 1;
1829
1830         *maskptr += ALIGN(sizeof(*a));
1831
1832         for (i = 0; i < a->u.match_size - ALIGN(sizeof(*a)); i++)
1833                 if (((a->data[i] ^ b->data[i]) & (*maskptr)[i]) != 0)
1834                         return 1;
1835         *maskptr += i;
1836         return 0;
1837 }
1838
1839 static inline int
1840 target_same(struct rule_head *a, struct rule_head *b,const unsigned char *mask)
1841 {
1842         unsigned int i;
1843         STRUCT_ENTRY_TARGET *ta, *tb;
1844
1845         if (a->type != b->type)
1846                 return 0;
1847
1848         ta = GET_TARGET(a->entry);
1849         tb = GET_TARGET(b->entry);
1850
1851         switch (a->type) {
1852         case IPTCC_R_FALLTHROUGH:
1853                 return 1;
1854         case IPTCC_R_JUMP:
1855                 return a->jump == b->jump;
1856         case IPTCC_R_STANDARD:
1857                 return ((STRUCT_STANDARD_TARGET *)ta)->verdict
1858                         == ((STRUCT_STANDARD_TARGET *)tb)->verdict;
1859         case IPTCC_R_MODULE:
1860                 if (ta->u.target_size != tb->u.target_size)
1861                         return 0;
1862                 if (strcmp(ta->u.user.name, tb->u.user.name) != 0)
1863                         return 0;
1864
1865                 for (i = 0; i < ta->u.target_size - sizeof(*ta); i++)
1866                         if (((ta->data[i] ^ tb->data[i]) & mask[i]) != 0)
1867                                 return 0;
1868                 return 1;
1869         default:
1870                 fprintf(stderr, "ERROR: bad type %i\n", a->type);
1871                 abort();
1872         }
1873 }
1874
1875 static unsigned char *
1876 is_same(const STRUCT_ENTRY *a,
1877         const STRUCT_ENTRY *b,
1878         unsigned char *matchmask);
1879
1880 /* Delete the first rule in `chain' which matches `fw'. */
1881 int
1882 TC_DELETE_ENTRY(const IPT_CHAINLABEL chain,
1883                 const STRUCT_ENTRY *origfw,
1884                 unsigned char *matchmask,
1885                 TC_HANDLE_T *handle)
1886 {
1887         struct chain_head *c;
1888         struct rule_head *r, *i;
1889
1890         iptc_fn = TC_DELETE_ENTRY;
1891         if (!(c = iptcc_find_label(chain, *handle))) {
1892                 errno = ENOENT;
1893                 return 0;
1894         }
1895
1896         /* Create a rule_head from origfw. */
1897         r = iptcc_alloc_rule(c, origfw->next_offset);
1898         if (!r) {
1899                 errno = ENOMEM;
1900                 return 0;
1901         }
1902
1903         memcpy(r->entry, origfw, origfw->next_offset);
1904         r->counter_map.maptype = COUNTER_MAP_NOMAP;
1905         if (!iptcc_map_target(*handle, r)) {
1906                 DEBUGP("unable to map target of rule for chain `%s'\n", chain);
1907                 free(r);
1908                 return 0;
1909         } else {
1910                 /* iptcc_map_target increment target chain references
1911                  * since this is a fake rule only used for matching
1912                  * the chain references count is decremented again.
1913                  */
1914                 if (r->type == IPTCC_R_JUMP
1915                     && r->jump)
1916                         r->jump->references--;
1917         }
1918
1919         list_for_each_entry(i, &c->rules, list) {
1920                 unsigned char *mask;
1921
1922                 mask = is_same(r->entry, i->entry, matchmask);
1923                 if (!mask)
1924                         continue;
1925
1926                 if (!target_same(r, i, mask))
1927                         continue;
1928
1929                 /* If we are about to delete the rule that is the
1930                  * current iterator, move rule iterator back.  next
1931                  * pointer will then point to real next node */
1932                 if (i == (*handle)->rule_iterator_cur) {
1933                         (*handle)->rule_iterator_cur =
1934                                 list_entry((*handle)->rule_iterator_cur->list.prev,
1935                                            struct rule_head, list);
1936                 }
1937
1938                 c->num_rules--;
1939                 iptcc_delete_rule(i);
1940
1941                 set_changed(*handle);
1942                 free(r);
1943                 return 1;
1944         }
1945
1946         free(r);
1947         errno = ENOENT;
1948         return 0;
1949 }
1950
1951
1952 /* Delete the rule in position `rulenum' in `chain'. */
1953 int
1954 TC_DELETE_NUM_ENTRY(const IPT_CHAINLABEL chain,
1955                     unsigned int rulenum,
1956                     TC_HANDLE_T *handle)
1957 {
1958         struct chain_head *c;
1959         struct rule_head *r;
1960
1961         iptc_fn = TC_DELETE_NUM_ENTRY;
1962
1963         if (!(c = iptcc_find_label(chain, *handle))) {
1964                 errno = ENOENT;
1965                 return 0;
1966         }
1967
1968         if (rulenum >= c->num_rules) {
1969                 errno = E2BIG;
1970                 return 0;
1971         }
1972
1973         /* Take advantage of the double linked list if possible. */
1974         if (rulenum + 1 <= c->num_rules/2) {
1975                 r = iptcc_get_rule_num(c, rulenum + 1);
1976         } else {
1977                 r = iptcc_get_rule_num_reverse(c, c->num_rules - rulenum);
1978         }
1979
1980         /* If we are about to delete the rule that is the current
1981          * iterator, move rule iterator back.  next pointer will then
1982          * point to real next node */
1983         if (r == (*handle)->rule_iterator_cur) {
1984                 (*handle)->rule_iterator_cur =
1985                         list_entry((*handle)->rule_iterator_cur->list.prev,
1986                                    struct rule_head, list);
1987         }
1988
1989         c->num_rules--;
1990         iptcc_delete_rule(r);
1991
1992         set_changed(*handle);
1993
1994         return 1;
1995 }
1996
1997 /* Check the packet `fw' on chain `chain'.  Returns the verdict, or
1998    NULL and sets errno. */
1999 const char *
2000 TC_CHECK_PACKET(const IPT_CHAINLABEL chain,
2001                 STRUCT_ENTRY *entry,
2002                 TC_HANDLE_T *handle)
2003 {
2004         iptc_fn = TC_CHECK_PACKET;
2005         errno = ENOSYS;
2006         return NULL;
2007 }
2008
2009 /* Flushes the entries in the given chain (ie. empties chain). */
2010 int
2011 TC_FLUSH_ENTRIES(const IPT_CHAINLABEL chain, TC_HANDLE_T *handle)
2012 {
2013         struct chain_head *c;
2014         struct rule_head *r, *tmp;
2015
2016         iptc_fn = TC_FLUSH_ENTRIES;
2017         if (!(c = iptcc_find_label(chain, *handle))) {
2018                 errno = ENOENT;
2019                 return 0;
2020         }
2021
2022         list_for_each_entry_safe(r, tmp, &c->rules, list) {
2023                 iptcc_delete_rule(r);
2024         }
2025
2026         c->num_rules = 0;
2027
2028         set_changed(*handle);
2029
2030         return 1;
2031 }
2032
2033 /* Zeroes the counters in a chain. */
2034 int
2035 TC_ZERO_ENTRIES(const IPT_CHAINLABEL chain, TC_HANDLE_T *handle)
2036 {
2037         struct chain_head *c;
2038         struct rule_head *r;
2039
2040         iptc_fn = TC_ZERO_ENTRIES;
2041         if (!(c = iptcc_find_label(chain, *handle))) {
2042                 errno = ENOENT;
2043                 return 0;
2044         }
2045
2046         if (c->counter_map.maptype == COUNTER_MAP_NORMAL_MAP)
2047                 c->counter_map.maptype = COUNTER_MAP_ZEROED;
2048
2049         list_for_each_entry(r, &c->rules, list) {
2050                 if (r->counter_map.maptype == COUNTER_MAP_NORMAL_MAP)
2051                         r->counter_map.maptype = COUNTER_MAP_ZEROED;
2052         }
2053
2054         set_changed(*handle);
2055
2056         return 1;
2057 }
2058
2059 STRUCT_COUNTERS *
2060 TC_READ_COUNTER(const IPT_CHAINLABEL chain,
2061                 unsigned int rulenum,
2062                 TC_HANDLE_T *handle)
2063 {
2064         struct chain_head *c;
2065         struct rule_head *r;
2066
2067         iptc_fn = TC_READ_COUNTER;
2068         CHECK(*handle);
2069
2070         if (!(c = iptcc_find_label(chain, *handle))) {
2071                 errno = ENOENT;
2072                 return NULL;
2073         }
2074
2075         if (!(r = iptcc_get_rule_num(c, rulenum))) {
2076                 errno = E2BIG;
2077                 return NULL;
2078         }
2079
2080         return &r->entry[0].counters;
2081 }
2082
2083 int
2084 TC_ZERO_COUNTER(const IPT_CHAINLABEL chain,
2085                 unsigned int rulenum,
2086                 TC_HANDLE_T *handle)
2087 {
2088         struct chain_head *c;
2089         struct rule_head *r;
2090
2091         iptc_fn = TC_ZERO_COUNTER;
2092         CHECK(*handle);
2093
2094         if (!(c = iptcc_find_label(chain, *handle))) {
2095                 errno = ENOENT;
2096                 return 0;
2097         }
2098
2099         if (!(r = iptcc_get_rule_num(c, rulenum))) {
2100                 errno = E2BIG;
2101                 return 0;
2102         }
2103
2104         if (r->counter_map.maptype == COUNTER_MAP_NORMAL_MAP)
2105                 r->counter_map.maptype = COUNTER_MAP_ZEROED;
2106
2107         set_changed(*handle);
2108
2109         return 1;
2110 }
2111
2112 int
2113 TC_SET_COUNTER(const IPT_CHAINLABEL chain,
2114                unsigned int rulenum,
2115                STRUCT_COUNTERS *counters,
2116                TC_HANDLE_T *handle)
2117 {
2118         struct chain_head *c;
2119         struct rule_head *r;
2120         STRUCT_ENTRY *e;
2121
2122         iptc_fn = TC_SET_COUNTER;
2123         CHECK(*handle);
2124
2125         if (!(c = iptcc_find_label(chain, *handle))) {
2126                 errno = ENOENT;
2127                 return 0;
2128         }
2129
2130         if (!(r = iptcc_get_rule_num(c, rulenum))) {
2131                 errno = E2BIG;
2132                 return 0;
2133         }
2134
2135         e = r->entry;
2136         r->counter_map.maptype = COUNTER_MAP_SET;
2137
2138         memcpy(&e->counters, counters, sizeof(STRUCT_COUNTERS));
2139
2140         set_changed(*handle);
2141
2142         return 1;
2143 }
2144
2145 /* Creates a new chain. */
2146 /* To create a chain, create two rules: error node and unconditional
2147  * return. */
2148 int
2149 TC_CREATE_CHAIN(const IPT_CHAINLABEL chain, TC_HANDLE_T *handle)
2150 {
2151         static struct chain_head *c;
2152         int capacity;
2153         int exceeded;
2154
2155         iptc_fn = TC_CREATE_CHAIN;
2156
2157         /* find_label doesn't cover built-in targets: DROP, ACCEPT,
2158            QUEUE, RETURN. */
2159         if (iptcc_find_label(chain, *handle)
2160             || strcmp(chain, LABEL_DROP) == 0
2161             || strcmp(chain, LABEL_ACCEPT) == 0
2162             || strcmp(chain, LABEL_QUEUE) == 0
2163             || strcmp(chain, LABEL_RETURN) == 0) {
2164                 DEBUGP("Chain `%s' already exists\n", chain);
2165                 errno = EEXIST;
2166                 return 0;
2167         }
2168
2169         if (strlen(chain)+1 > sizeof(IPT_CHAINLABEL)) {
2170                 DEBUGP("Chain name `%s' too long\n", chain);
2171                 errno = EINVAL;
2172                 return 0;
2173         }
2174
2175         c = iptcc_alloc_chain_head(chain, 0);
2176         if (!c) {
2177                 DEBUGP("Cannot allocate memory for chain `%s'\n", chain);
2178                 errno = ENOMEM;
2179                 return 0;
2180
2181         }
2182         (*handle)->num_chains++; /* New user defined chain */
2183
2184         DEBUGP("Creating chain `%s'\n", chain);
2185         iptc_insert_chain(*handle, c); /* Insert sorted */
2186
2187         /* Inserting chains don't change the correctness of the chain
2188          * index (except if its smaller than index[0], but that
2189          * handled by iptc_insert_chain).  It only causes longer lists
2190          * in the buckets. Thus, only rebuild chain index when the
2191          * capacity is exceed with CHAIN_INDEX_INSERT_MAX chains.
2192          */
2193         capacity = (*handle)->chain_index_sz * CHAIN_INDEX_BUCKET_LEN;
2194         exceeded = ((((*handle)->num_chains)-capacity));
2195         if (exceeded > CHAIN_INDEX_INSERT_MAX) {
2196                 debug("Capacity(%d) exceeded(%d) rebuild (chains:%d)\n",
2197                       capacity, exceeded, (*handle)->num_chains);
2198                 iptcc_chain_index_rebuild(*handle);
2199         }
2200
2201         set_changed(*handle);
2202
2203         return 1;
2204 }
2205
2206 /* Get the number of references to this chain. */
2207 int
2208 TC_GET_REFERENCES(unsigned int *ref, const IPT_CHAINLABEL chain,
2209                   TC_HANDLE_T *handle)
2210 {
2211         struct chain_head *c;
2212
2213         iptc_fn = TC_GET_REFERENCES;
2214         if (!(c = iptcc_find_label(chain, *handle))) {
2215                 errno = ENOENT;
2216                 return 0;
2217         }
2218
2219         *ref = c->references;
2220
2221         return 1;
2222 }
2223
2224 /* Deletes a chain. */
2225 int
2226 TC_DELETE_CHAIN(const IPT_CHAINLABEL chain, TC_HANDLE_T *handle)
2227 {
2228         unsigned int references;
2229         struct chain_head *c;
2230
2231         iptc_fn = TC_DELETE_CHAIN;
2232
2233         if (!(c = iptcc_find_label(chain, *handle))) {
2234                 DEBUGP("cannot find chain `%s'\n", chain);
2235                 errno = ENOENT;
2236                 return 0;
2237         }
2238
2239         if (TC_BUILTIN(chain, *handle)) {
2240                 DEBUGP("cannot remove builtin chain `%s'\n", chain);
2241                 errno = EINVAL;
2242                 return 0;
2243         }
2244
2245         if (!TC_GET_REFERENCES(&references, chain, handle)) {
2246                 DEBUGP("cannot get references on chain `%s'\n", chain);
2247                 return 0;
2248         }
2249
2250         if (references > 0) {
2251                 DEBUGP("chain `%s' still has references\n", chain);
2252                 errno = EMLINK;
2253                 return 0;
2254         }
2255
2256         if (c->num_rules) {
2257                 DEBUGP("chain `%s' is not empty\n", chain);
2258                 errno = ENOTEMPTY;
2259                 return 0;
2260         }
2261
2262         /* If we are about to delete the chain that is the current
2263          * iterator, move chain iterator forward. */
2264         if (c == (*handle)->chain_iterator_cur)
2265                 iptcc_chain_iterator_advance(*handle);
2266
2267         (*handle)->num_chains--; /* One user defined chain deleted */
2268
2269         //list_del(&c->list); /* Done in iptcc_chain_index_delete_chain() */
2270         iptcc_chain_index_delete_chain(c, *handle);
2271         free(c);
2272
2273         DEBUGP("chain `%s' deleted\n", chain);
2274
2275         set_changed(*handle);
2276
2277         return 1;
2278 }
2279
2280 /* Renames a chain. */
2281 int TC_RENAME_CHAIN(const IPT_CHAINLABEL oldname,
2282                     const IPT_CHAINLABEL newname,
2283                     TC_HANDLE_T *handle)
2284 {
2285         struct chain_head *c;
2286         iptc_fn = TC_RENAME_CHAIN;
2287
2288         /* find_label doesn't cover built-in targets: DROP, ACCEPT,
2289            QUEUE, RETURN. */
2290         if (iptcc_find_label(newname, *handle)
2291             || strcmp(newname, LABEL_DROP) == 0
2292             || strcmp(newname, LABEL_ACCEPT) == 0
2293             || strcmp(newname, LABEL_QUEUE) == 0
2294             || strcmp(newname, LABEL_RETURN) == 0) {
2295                 errno = EEXIST;
2296                 return 0;
2297         }
2298
2299         if (!(c = iptcc_find_label(oldname, *handle))
2300             || TC_BUILTIN(oldname, *handle)) {
2301                 errno = ENOENT;
2302                 return 0;
2303         }
2304
2305         if (strlen(newname)+1 > sizeof(IPT_CHAINLABEL)) {
2306                 errno = EINVAL;
2307                 return 0;
2308         }
2309
2310         strncpy(c->name, newname, sizeof(IPT_CHAINLABEL));
2311
2312         set_changed(*handle);
2313
2314         return 1;
2315 }
2316
2317 /* Sets the policy on a built-in chain. */
2318 int
2319 TC_SET_POLICY(const IPT_CHAINLABEL chain,
2320               const IPT_CHAINLABEL policy,
2321               STRUCT_COUNTERS *counters,
2322               TC_HANDLE_T *handle)
2323 {
2324         struct chain_head *c;
2325
2326         iptc_fn = TC_SET_POLICY;
2327
2328         if (!(c = iptcc_find_label(chain, *handle))) {
2329                 DEBUGP("cannot find chain `%s'\n", chain);
2330                 errno = ENOENT;
2331                 return 0;
2332         }
2333
2334         if (!iptcc_is_builtin(c)) {
2335                 DEBUGP("cannot set policy of userdefinedchain `%s'\n", chain);
2336                 errno = ENOENT;
2337                 return 0;
2338         }
2339
2340         if (strcmp(policy, LABEL_ACCEPT) == 0)
2341                 c->verdict = -NF_ACCEPT - 1;
2342         else if (strcmp(policy, LABEL_DROP) == 0)
2343                 c->verdict = -NF_DROP - 1;
2344         else {
2345                 errno = EINVAL;
2346                 return 0;
2347         }
2348
2349         if (counters) {
2350                 /* set byte and packet counters */
2351                 memcpy(&c->counters, counters, sizeof(STRUCT_COUNTERS));
2352                 c->counter_map.maptype = COUNTER_MAP_SET;
2353         } else {
2354                 c->counter_map.maptype = COUNTER_MAP_NOMAP;
2355         }
2356
2357         set_changed(*handle);
2358
2359         return 1;
2360 }
2361
2362 /* Without this, on gcc 2.7.2.3, we get:
2363    libiptc.c: In function `TC_COMMIT':
2364    libiptc.c:833: fixed or forbidden register was spilled.
2365    This may be due to a compiler bug or to impossible asm
2366    statements or clauses.
2367 */
2368 static void
2369 subtract_counters(STRUCT_COUNTERS *answer,
2370                   const STRUCT_COUNTERS *a,
2371                   const STRUCT_COUNTERS *b)
2372 {
2373         answer->pcnt = a->pcnt - b->pcnt;
2374         answer->bcnt = a->bcnt - b->bcnt;
2375 }
2376
2377
2378 static void counters_nomap(STRUCT_COUNTERS_INFO *newcounters, unsigned int idx)
2379 {
2380         newcounters->counters[idx] = ((STRUCT_COUNTERS) { 0, 0});
2381         DEBUGP_C("NOMAP => zero\n");
2382 }
2383
2384 static void counters_normal_map(STRUCT_COUNTERS_INFO *newcounters,
2385                                 STRUCT_REPLACE *repl, unsigned int idx,
2386                                 unsigned int mappos)
2387 {
2388         /* Original read: X.
2389          * Atomic read on replacement: X + Y.
2390          * Currently in kernel: Z.
2391          * Want in kernel: X + Y + Z.
2392          * => Add in X + Y
2393          * => Add in replacement read.
2394          */
2395         newcounters->counters[idx] = repl->counters[mappos];
2396         DEBUGP_C("NORMAL_MAP => mappos %u \n", mappos);
2397 }
2398
2399 static void counters_map_zeroed(STRUCT_COUNTERS_INFO *newcounters,
2400                                 STRUCT_REPLACE *repl, unsigned int idx,
2401                                 unsigned int mappos, STRUCT_COUNTERS *counters)
2402 {
2403         /* Original read: X.
2404          * Atomic read on replacement: X + Y.
2405          * Currently in kernel: Z.
2406          * Want in kernel: Y + Z.
2407          * => Add in Y.
2408          * => Add in (replacement read - original read).
2409          */
2410         subtract_counters(&newcounters->counters[idx],
2411                           &repl->counters[mappos],
2412                           counters);
2413         DEBUGP_C("ZEROED => mappos %u\n", mappos);
2414 }
2415
2416 static void counters_map_set(STRUCT_COUNTERS_INFO *newcounters,
2417                              unsigned int idx, STRUCT_COUNTERS *counters)
2418 {
2419         /* Want to set counter (iptables-restore) */
2420
2421         memcpy(&newcounters->counters[idx], counters,
2422                 sizeof(STRUCT_COUNTERS));
2423
2424         DEBUGP_C("SET\n");
2425 }
2426
2427
2428 int
2429 TC_COMMIT(TC_HANDLE_T *handle)
2430 {
2431         /* Replace, then map back the counters. */
2432         STRUCT_REPLACE *repl;
2433         STRUCT_COUNTERS_INFO *newcounters;
2434         struct chain_head *c;
2435         int ret;
2436         size_t counterlen;
2437         int new_number;
2438         unsigned int new_size;
2439
2440         iptc_fn = TC_COMMIT;
2441         CHECK(*handle);
2442
2443         /* Don't commit if nothing changed. */
2444         if (!(*handle)->changed)
2445                 goto finished;
2446
2447         new_number = iptcc_compile_table_prep(*handle, &new_size);
2448         if (new_number < 0) {
2449                 errno = ENOMEM;
2450                 goto out_zero;
2451         }
2452
2453         repl = malloc(sizeof(*repl) + new_size);
2454         if (!repl) {
2455                 errno = ENOMEM;
2456                 goto out_zero;
2457         }
2458         memset(repl, 0, sizeof(*repl) + new_size);
2459
2460 #if 0
2461         TC_DUMP_ENTRIES(*handle);
2462 #endif
2463
2464         counterlen = sizeof(STRUCT_COUNTERS_INFO)
2465                         + sizeof(STRUCT_COUNTERS) * new_number;
2466
2467         /* These are the old counters we will get from kernel */
2468         repl->counters = malloc(sizeof(STRUCT_COUNTERS)
2469                                 * (*handle)->info.num_entries);
2470         if (!repl->counters) {
2471                 errno = ENOMEM;
2472                 goto out_free_repl;
2473         }
2474         /* These are the counters we're going to put back, later. */
2475         newcounters = malloc(counterlen);
2476         if (!newcounters) {
2477                 errno = ENOMEM;
2478                 goto out_free_repl_counters;
2479         }
2480         memset(newcounters, 0, counterlen);
2481
2482         strcpy(repl->name, (*handle)->info.name);
2483         repl->num_entries = new_number;
2484         repl->size = new_size;
2485
2486         repl->num_counters = (*handle)->info.num_entries;
2487         repl->valid_hooks = (*handle)->info.valid_hooks;
2488
2489         DEBUGP("num_entries=%u, size=%u, num_counters=%u\n",
2490                 repl->num_entries, repl->size, repl->num_counters);
2491
2492         ret = iptcc_compile_table(*handle, repl);
2493         if (ret < 0) {
2494                 errno = ret;
2495                 goto out_free_newcounters;
2496         }
2497
2498
2499 #ifdef IPTC_DEBUG2
2500         {
2501                 int fd = open("/tmp/libiptc-so_set_replace.blob",
2502                                 O_CREAT|O_WRONLY);
2503                 if (fd >= 0) {
2504                         write(fd, repl, sizeof(*repl) + repl->size);
2505                         close(fd);
2506                 }
2507         }
2508 #endif
2509
2510         ret = setsockopt(sockfd, TC_IPPROTO, SO_SET_REPLACE, repl,
2511                          sizeof(*repl) + repl->size);
2512         if (ret < 0)
2513                 goto out_free_newcounters;
2514
2515         /* Put counters back. */
2516         strcpy(newcounters->name, (*handle)->info.name);
2517         newcounters->num_counters = new_number;
2518
2519         list_for_each_entry(c, &(*handle)->chains, list) {
2520                 struct rule_head *r;
2521
2522                 /* Builtin chains have their own counters */
2523                 if (iptcc_is_builtin(c)) {
2524                         DEBUGP("counter for chain-index %u: ", c->foot_index);
2525                         switch(c->counter_map.maptype) {
2526                         case COUNTER_MAP_NOMAP:
2527                                 counters_nomap(newcounters, c->foot_index);
2528                                 break;
2529                         case COUNTER_MAP_NORMAL_MAP:
2530                                 counters_normal_map(newcounters, repl,
2531                                                     c->foot_index,
2532                                                     c->counter_map.mappos);
2533                                 break;
2534                         case COUNTER_MAP_ZEROED:
2535                                 counters_map_zeroed(newcounters, repl,
2536                                                     c->foot_index,
2537                                                     c->counter_map.mappos,
2538                                                     &c->counters);
2539                                 break;
2540                         case COUNTER_MAP_SET:
2541                                 counters_map_set(newcounters, c->foot_index,
2542                                                  &c->counters);
2543                                 break;
2544                         }
2545                 }
2546
2547                 list_for_each_entry(r, &c->rules, list) {
2548                         DEBUGP("counter for index %u: ", r->index);
2549                         switch (r->counter_map.maptype) {
2550                         case COUNTER_MAP_NOMAP:
2551                                 counters_nomap(newcounters, r->index);
2552                                 break;
2553
2554                         case COUNTER_MAP_NORMAL_MAP:
2555                                 counters_normal_map(newcounters, repl,
2556                                                     r->index,
2557                                                     r->counter_map.mappos);
2558                                 break;
2559
2560                         case COUNTER_MAP_ZEROED:
2561                                 counters_map_zeroed(newcounters, repl,
2562                                                     r->index,
2563                                                     r->counter_map.mappos,
2564                                                     &r->entry->counters);
2565                                 break;
2566
2567                         case COUNTER_MAP_SET:
2568                                 counters_map_set(newcounters, r->index,
2569                                                  &r->entry->counters);
2570                                 break;
2571                         }
2572                 }
2573         }
2574
2575 #ifdef IPTC_DEBUG2
2576         {
2577                 int fd = open("/tmp/libiptc-so_set_add_counters.blob",
2578                                 O_CREAT|O_WRONLY);
2579                 if (fd >= 0) {
2580                         write(fd, newcounters, counterlen);
2581                         close(fd);
2582                 }
2583         }
2584 #endif
2585
2586         ret = setsockopt(sockfd, TC_IPPROTO, SO_SET_ADD_COUNTERS,
2587                          newcounters, counterlen);
2588         if (ret < 0)
2589                 goto out_free_newcounters;
2590
2591         free(repl->counters);
2592         free(repl);
2593         free(newcounters);
2594
2595 finished:
2596         TC_FREE(handle);
2597         return 1;
2598
2599 out_free_newcounters:
2600         free(newcounters);
2601 out_free_repl_counters:
2602         free(repl->counters);
2603 out_free_repl:
2604         free(repl);
2605 out_zero:
2606         return 0;
2607 }
2608
2609 /* Get raw socket. */
2610 int
2611 TC_GET_RAW_SOCKET(void)
2612 {
2613         return sockfd;
2614 }
2615
2616 /* Translates errno numbers into more human-readable form than strerror. */
2617 const char *
2618 TC_STRERROR(int err)
2619 {
2620         unsigned int i;
2621         struct table_struct {
2622                 void *fn;
2623                 int err;
2624                 const char *message;
2625         } table [] =
2626           { { TC_INIT, EPERM, "Permission denied (you must be root)" },
2627             { TC_INIT, EINVAL, "Module is wrong version" },
2628             { TC_INIT, ENOENT,
2629                     "Table does not exist (do you need to insmod?)" },
2630             { TC_DELETE_CHAIN, ENOTEMPTY, "Chain is not empty" },
2631             { TC_DELETE_CHAIN, EINVAL, "Can't delete built-in chain" },
2632             { TC_DELETE_CHAIN, EMLINK,
2633               "Can't delete chain with references left" },
2634             { TC_CREATE_CHAIN, EEXIST, "Chain already exists" },
2635             { TC_INSERT_ENTRY, E2BIG, "Index of insertion too big" },
2636             { TC_REPLACE_ENTRY, E2BIG, "Index of replacement too big" },
2637             { TC_DELETE_NUM_ENTRY, E2BIG, "Index of deletion too big" },
2638             { TC_READ_COUNTER, E2BIG, "Index of counter too big" },
2639             { TC_ZERO_COUNTER, E2BIG, "Index of counter too big" },
2640             { TC_INSERT_ENTRY, ELOOP, "Loop found in table" },
2641             { TC_INSERT_ENTRY, EINVAL, "Target problem" },
2642             /* EINVAL for CHECK probably means bad interface. */
2643             { TC_CHECK_PACKET, EINVAL,
2644               "Bad arguments (does that interface exist?)" },
2645             { TC_CHECK_PACKET, ENOSYS,
2646               "Checking will most likely never get implemented" },
2647             /* ENOENT for DELETE probably means no matching rule */
2648             { TC_DELETE_ENTRY, ENOENT,
2649               "Bad rule (does a matching rule exist in that chain?)" },
2650             { TC_SET_POLICY, ENOENT,
2651               "Bad built-in chain name" },
2652             { TC_SET_POLICY, EINVAL,
2653               "Bad policy name" },
2654
2655             { NULL, 0, "Incompatible with this kernel" },
2656             { NULL, ENOPROTOOPT, "iptables who? (do you need to insmod?)" },
2657             { NULL, ENOSYS, "Will be implemented real soon.  I promise ;)" },
2658             { NULL, ENOMEM, "Memory allocation problem" },
2659             { NULL, ENOENT, "No chain/target/match by that name" },
2660           };
2661
2662         for (i = 0; i < sizeof(table)/sizeof(struct table_struct); i++) {
2663                 if ((!table[i].fn || table[i].fn == iptc_fn)
2664                     && table[i].err == err)
2665                         return table[i].message;
2666         }
2667
2668         return strerror(err);
2669 }