4 * Copyright (C) 2007-2010 Intel Corporation. All rights reserved.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 2 as
8 * published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
26 #include <sys/errno.h>
27 #include <sys/socket.h>
30 #include <linux/netfilter_ipv4/ip_tables.h>
34 static const char *hooknames[] = {
35 [NF_IP_PRE_ROUTING] = "PREROUTING",
36 [NF_IP_LOCAL_IN] = "INPUT",
37 [NF_IP_FORWARD] = "FORWARD",
38 [NF_IP_LOCAL_OUT] = "OUTPUT",
39 [NF_IP_POST_ROUTING] = "POSTROUTING",
42 #define LABEL_ACCEPT "ACCEPT"
43 #define LABEL_DROP "DROP"
44 #define LABEL_QUEUE "QUEUE"
45 #define LABEL_RETURN "RETURN"
47 /* fn returns 0 to continue iteration */
48 #define _XT_ENTRY_ITERATE_CONTINUE(type, entries, size, n, fn, args...) \
55 for (__i = 0, __n = 0; __i < (size); \
56 __i += __entry->next_offset, __n++) { \
57 __entry = (void *)(entries) + __i; \
61 __ret = fn(__entry, ## args); \
68 /* fn returns 0 to continue iteration */
69 #define _XT_ENTRY_ITERATE(type, entries, size, fn, args...) \
70 _XT_ENTRY_ITERATE_CONTINUE(type, entries, size, 0, fn, args)
72 #define ENTRY_ITERATE(entries, size, fn, args...) \
73 _XT_ENTRY_ITERATE(struct ipt_entry, entries, size, fn, ## args)
75 #define MIN_ALIGN (__alignof__(struct ipt_entry))
77 #define ALIGN(s) (((s) + ((MIN_ALIGN)-1)) & ~((MIN_ALIGN)-1))
80 struct xt_entry_target t;
81 char error[IPT_TABLE_MAXNAMELEN];
84 struct connman_iptables_entry {
88 struct ipt_entry *entry;
91 struct connman_iptables {
94 struct ipt_getinfo *info;
95 struct ipt_get_entries *blob_entries;
97 unsigned int num_entries;
98 unsigned int old_entries;
101 unsigned int underflow[NF_INET_NUMHOOKS];
102 unsigned int hook_entry[NF_INET_NUMHOOKS];
108 static struct ipt_entry *get_entry(struct connman_iptables *table,
111 return (struct ipt_entry *)((char *)table->blob_entries->entrytable +
115 static int is_hook_entry(struct connman_iptables *table,
116 struct ipt_entry *entry)
120 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
121 if ((table->info->valid_hooks & (1 << i))
122 && get_entry(table, table->info->hook_entry[i]) == entry)
129 static unsigned long entry_to_offset(struct connman_iptables *table,
130 struct ipt_entry *entry)
132 return (void *)entry - (void *)table->blob_entries->entrytable;
135 static int target_to_verdict(char *target_name)
137 if (!strcmp(target_name, LABEL_ACCEPT))
138 return -NF_ACCEPT - 1;
140 if (!strcmp(target_name, LABEL_DROP))
143 if (!strcmp(target_name, LABEL_QUEUE))
144 return -NF_QUEUE - 1;
146 if (!strcmp(target_name, LABEL_RETURN))
152 static gboolean is_builtin_target(char *target_name)
154 if (!strcmp(target_name, LABEL_ACCEPT) ||
155 !strcmp(target_name, LABEL_DROP) ||
156 !strcmp(target_name, LABEL_QUEUE) ||
157 !strcmp(target_name, LABEL_RETURN))
163 static gboolean is_jump(struct connman_iptables_entry *e)
165 struct xt_entry_target *target;
167 target = ipt_get_target(e->entry);
169 if (!strcmp(target->u.user.name, IPT_STANDARD_TARGET)) {
170 struct xt_standard_target *t;
172 t = (struct xt_standard_target *)target;
174 switch (t->verdict) {
190 static gboolean is_chain(struct connman_iptables *table,
191 struct connman_iptables_entry *e)
193 struct ipt_entry *entry;
194 struct xt_entry_target *target;
200 target = ipt_get_target(entry);
201 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET))
207 static GList *find_chain_head(struct connman_iptables *table,
211 struct connman_iptables_entry *head;
212 struct ipt_entry *entry;
213 struct xt_entry_target *target;
216 for (list = table->entries; list; list = list->next) {
221 builtin = head->builtin;
222 if (builtin >= 0 && !strcmp(hooknames[builtin], chain_name))
225 /* User defined chain */
226 target = ipt_get_target(entry);
227 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET) &&
228 !strcmp((char *)target->data, chain_name))
235 static GList *find_chain_tail(struct connman_iptables *table,
238 GList *chain_head, *list;
239 struct connman_iptables_entry *tail;
241 chain_head = find_chain_head(table, chain_name);
242 if (chain_head == NULL)
245 /* Then we look for the next chain */
246 for (list = chain_head->next; list; list = list->next) {
249 if (is_chain(table, tail))
253 /* Nothing found, we return the table end */
254 return g_list_last(table->entries);
257 static void update_offsets(struct connman_iptables *table)
260 struct connman_iptables_entry *entry, *prev_entry;
262 for (list = table->entries; list; list = list->next) {
265 if (list == table->entries) {
272 prev_entry = prev->data;
274 entry->offset = prev_entry->offset +
275 prev_entry->entry->next_offset;
279 static int connman_add_entry(struct connman_iptables *table,
280 struct ipt_entry *entry, GList *before,
284 struct connman_iptables_entry *e, *tmp, *entry_before;
285 struct xt_standard_target *t;
290 e = g_try_malloc0(sizeof(struct connman_iptables_entry));
295 e->builtin = builtin;
297 table->entries = g_list_insert_before(table->entries, before, e);
298 table->num_entries++;
299 table->size += entry->next_offset;
301 if (before == NULL) {
302 e->offset = table->size - entry->next_offset;
307 entry_before = before->data;
310 * We've just insterted a new entry. All references before it
311 * should be bumped accordingly.
313 for (list = table->entries; list != before; list = list->next) {
319 t = (struct xt_standard_target *)ipt_get_target(tmp->entry);
321 if (t->verdict >= entry_before->offset)
322 t->verdict += entry->next_offset;
325 update_offsets(table);
330 static int remove_table_entry(struct connman_iptables *table,
331 struct connman_iptables_entry *entry)
335 table->num_entries--;
336 table->size -= entry->entry->next_offset;
337 removed = entry->entry->next_offset;
339 g_free(entry->entry);
341 table->entries = g_list_remove(table->entries, entry);
346 static int connman_iptables_flush_chain(struct connman_iptables *table,
349 GList *chain_head, *chain_tail, *list, *next;
350 struct connman_iptables_entry *entry;
351 int builtin, removed = 0;
353 chain_head = find_chain_head(table, name);
354 if (chain_head == NULL)
357 chain_tail = find_chain_tail(table, name);
358 if (chain_tail == NULL)
361 entry = chain_head->data;
362 builtin = entry->builtin;
367 list = chain_head->next;
369 if (list == chain_tail->prev)
372 while (list != chain_tail->prev) {
374 next = g_list_next(list);
376 removed += remove_table_entry(table, entry);
382 struct connman_iptables_entry *e;
386 entry->builtin = builtin;
388 table->underflow[builtin] -= removed;
390 for (list = chain_tail; list; list = list->next) {
393 builtin = e->builtin;
397 table->hook_entry[builtin] -= removed;
398 table->underflow[builtin] -= removed;
402 update_offsets(table);
407 static int connman_iptables_delete_chain(struct connman_iptables *table,
410 GList *chain_head, *chain_tail;
411 struct connman_iptables_entry *entry;
413 chain_head = find_chain_head(table, name);
414 if (chain_head == NULL)
417 entry = chain_head->data;
419 /* We cannot remove builtin chain */
420 if (entry->builtin >= 0)
423 chain_tail = find_chain_tail(table, name);
424 if (chain_tail == NULL)
427 /* Chain must be flushed */
428 if (chain_head->next != chain_tail->prev)
431 remove_table_entry(table, entry);
433 entry = chain_tail->prev->data;
434 remove_table_entry(table, entry);
436 update_offsets(table);
441 static int connman_iptables_add_chain(struct connman_iptables *table,
445 struct ipt_entry *entry_head;
446 struct ipt_entry *entry_return;
447 struct error_target *error;
448 struct ipt_standard_target *standard;
449 u_int16_t entry_head_size, entry_return_size;
451 last = g_list_last(table->entries);
454 * An empty chain is composed of:
455 * - A head entry, with no match and an error target.
456 * The error target data is the chain name.
457 * - A tail entry, with no match and a standard target.
458 * The standard target verdict is XT_RETURN (return to the
463 entry_head_size = sizeof(struct ipt_entry) +
464 sizeof(struct error_target);
465 entry_head = g_try_malloc0(entry_head_size);
466 if (entry_head == NULL)
469 memset(entry_head, 0, entry_head_size);
471 entry_head->target_offset = sizeof(struct ipt_entry);
472 entry_head->next_offset = entry_head_size;
474 error = (struct error_target *) entry_head->elems;
475 strcpy(error->t.u.user.name, IPT_ERROR_TARGET);
476 error->t.u.user.target_size = ALIGN(sizeof(struct error_target));
477 strcpy(error->error, name);
479 if (connman_add_entry(table, entry_head, last, -1) < 0)
483 entry_return_size = sizeof(struct ipt_entry) +
484 sizeof(struct ipt_standard_target);
485 entry_return = g_try_malloc0(entry_return_size);
486 if (entry_return == NULL)
489 memset(entry_return, 0, entry_return_size);
491 entry_return->target_offset = sizeof(struct ipt_entry);
492 entry_return->next_offset = entry_return_size;
494 standard = (struct ipt_standard_target *) entry_return->elems;
495 standard->target.u.user.target_size =
496 ALIGN(sizeof(struct ipt_standard_target));
497 standard->verdict = XT_RETURN;
499 if (connman_add_entry(table, entry_return, last, -1) < 0)
505 g_free(entry_return);
512 static struct ipt_entry *
513 new_rule(struct connman_iptables *table,
514 char *target_name, struct xtables_target *xt_t,
515 char *match_name, struct xtables_match *xt_m)
517 struct ipt_entry *new_entry;
518 size_t match_size, target_size;
519 int is_builtin = is_builtin_target(target_name);
522 match_size = xt_m->m->u.match_size;
527 target_size = ALIGN(xt_t->t->u.target_size);
529 target_size = ALIGN(sizeof(struct xt_standard_target));
531 new_entry = g_try_malloc0(sizeof(struct ipt_entry) + target_size +
533 if (new_entry == NULL)
536 new_entry->target_offset = sizeof(struct ipt_entry) + match_size;
537 new_entry->next_offset = sizeof(struct ipt_entry) + target_size +
540 struct xt_entry_match *entry_match;
542 entry_match = (struct xt_entry_match *)new_entry->elems;
543 memcpy(entry_match, xt_m->m, match_size);
547 struct xt_entry_target *entry_target;
550 struct xt_standard_target *target;
552 target = (struct xt_standard_target *)(xt_t->t);
553 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
554 target->verdict = target_to_verdict(target_name);
557 entry_target = ipt_get_target(new_entry);
558 memcpy(entry_target, xt_t->t, target_size);
560 struct connman_iptables_entry *target_rule;
561 struct xt_standard_target *target;
565 * This is a user defined target, i.e. a chain jump.
566 * We search for the chain head, and the target verdict
567 * is the first rule's offset on this chain.
568 * The offset is from the beginning of the table.
571 chain_head = find_chain_head(table, target_name);
572 if (chain_head == NULL || chain_head->next == NULL) {
577 target_rule = chain_head->next->data;
579 target = (struct xt_standard_target *)ipt_get_target(new_entry);
580 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
581 target->target.u.user.target_size = target_size;
582 target->verdict = target_rule->offset;
588 static void update_hooks(struct connman_iptables *table, GList *chain_head, struct ipt_entry *entry)
591 struct connman_iptables_entry *head, *e;
594 if (chain_head == NULL)
597 head = chain_head->data;
599 builtin = head->builtin;
603 table->underflow[builtin] += entry->next_offset;
605 for (list = chain_head->next; list; list = list->next) {
608 builtin = e->builtin;
612 table->hook_entry[builtin] += entry->next_offset;
613 table->underflow[builtin] += entry->next_offset;
618 connman_iptables_add_rule(struct connman_iptables *table, char *chain_name,
619 char *target_name, struct xtables_target *xt_t,
620 char *match_name, struct xtables_match *xt_m)
622 GList *chain_tail, *chain_head;
623 struct ipt_entry *new_entry;
624 struct connman_iptables_entry *head;
627 chain_head = find_chain_head(table, chain_name);
628 if (chain_head == NULL)
631 chain_tail = find_chain_tail(table, chain_name);
632 if (chain_tail == NULL)
635 new_entry = new_rule(table,
638 if (new_entry == NULL)
641 update_hooks(table, chain_head, new_entry);
644 * If the chain is builtin, and does not have any rule,
645 * then the one that we're inserting is becoming the head
646 * and thus needs the builtin flag.
648 head = chain_head->data;
649 if (head->builtin < 0)
651 else if (chain_head == chain_tail->prev) {
652 builtin = head->builtin;
656 return connman_add_entry(table, new_entry, chain_tail->prev, builtin);
659 static struct ipt_replace *
660 connman_iptables_blob(struct connman_iptables *table)
662 struct ipt_replace *r;
664 struct connman_iptables_entry *e;
665 unsigned char *entry_index;
667 r = g_try_malloc0(sizeof(struct ipt_replace) + table->size);
671 memset(r, 0, sizeof(*r) + table->size);
673 r->counters = g_try_malloc0(sizeof(struct xt_counters)
674 * table->old_entries);
675 if (r->counters == NULL) {
680 strcpy(r->name, table->info->name);
681 r->num_entries = table->num_entries;
682 r->size = table->size;
684 r->num_counters = table->old_entries;
685 r->valid_hooks = table->info->valid_hooks;
687 memcpy(r->hook_entry, table->hook_entry, sizeof(table->hook_entry));
688 memcpy(r->underflow, table->underflow, sizeof(table->underflow));
690 entry_index = (unsigned char *)r->entries;
691 for (list = table->entries; list; list = list->next) {
694 memcpy(entry_index, e->entry, e->entry->next_offset);
695 entry_index += e->entry->next_offset;
701 static void dump_target(struct connman_iptables *table,
702 struct ipt_entry *entry)
705 struct xtables_target *xt_t;
706 struct xt_entry_target *target;
708 target = ipt_get_target(entry);
710 if (!strcmp(target->u.user.name, IPT_STANDARD_TARGET)) {
711 struct xt_standard_target *t;
713 t = (struct xt_standard_target *)target;
715 switch (t->verdict) {
717 printf("\ttarget RETURN\n");
721 printf("\ttarget ACCEPT\n");
725 printf("\ttarget DROP\n");
729 printf("\ttarget QUEUE\n");
733 printf("\ttarget STOP\n");
737 printf("\tJUMP @%p (0x%x)\n",
738 (char*)table->blob_entries->entrytable +
739 t->verdict, t->verdict);
743 xt_t = xtables_find_target(IPT_STANDARD_TARGET,
744 XTF_LOAD_MUST_SUCCEED);
746 if(xt_t->print != NULL)
747 xt_t->print(NULL, target, 1);
749 xt_t = xtables_find_target(target->u.user.name, XTF_TRY_LOAD);
751 printf("\ttarget %s\n", target->u.user.name);
755 if(xt_t->print != NULL) {
757 xt_t->print(NULL, target, 1);
763 static void dump_match(struct connman_iptables *table, struct ipt_entry *entry)
765 struct xtables_match *xt_m;
766 struct xt_entry_match *match;
768 if (entry->elems == (unsigned char *)entry + entry->target_offset)
771 match = (struct xt_entry_match *) entry->elems;
773 if (!strlen(match->u.user.name))
776 xt_m = xtables_find_match(match->u.user.name, XTF_TRY_LOAD, NULL);
780 if(xt_m->print != NULL) {
782 xt_m->print(NULL, match, 1);
789 printf("\tmatch %s\n", match->u.user.name);
793 static int connman_iptables_dump_entry(struct ipt_entry *entry,
794 struct connman_iptables *table)
796 struct xt_entry_target *target;
800 offset = (char *)entry - (char *)table->blob_entries->entrytable;
801 target = ipt_get_target(entry);
802 builtin = is_hook_entry(table, entry);
804 if (entry_to_offset(table, entry) + entry->next_offset ==
805 table->blob_entries->size) {
806 printf("End of CHAIN 0x%x\n", offset);
810 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET)) {
811 printf("USER CHAIN (%s) %p match %p target %p size %d\n",
812 target->data, entry, entry->elems,
813 (char *)entry + entry->target_offset,
817 } else if (builtin >= 0) {
818 printf("CHAIN (%s) %p match %p target %p size %d\n",
819 hooknames[builtin], entry, entry->elems,
820 (char *)entry + entry->target_offset,
823 printf("RULE %p match %p target %p size %d\n", entry,
825 (char *)entry + entry->target_offset,
829 dump_match(table, entry);
830 dump_target(table, entry);
835 static void connman_iptables_dump_hook(struct connman_iptables *table)
839 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
840 if ((table->info->valid_hooks & (1 << i)))
841 printf("%s entry %p underflow %p (%#x)\n",
843 table->blob_entries->entrytable +
844 table->info->hook_entry[i],
845 table->blob_entries->entrytable +
846 table->info->underflow[i],
847 table->info->underflow[i]);
851 static void connman_iptables_dump(struct connman_iptables *table)
853 printf("%s valid_hooks=0x%08x, num_entries=%u, size=%u\n",
855 table->info->valid_hooks, table->info->num_entries,
858 connman_iptables_dump_hook(table);
860 ENTRY_ITERATE(table->blob_entries->entrytable,
861 table->blob_entries->size,
862 connman_iptables_dump_entry, table);
866 static int connman_iptables_get_entries(struct connman_iptables *table)
868 socklen_t entry_size;
870 entry_size = sizeof(struct ipt_get_entries) + table->info->size;
872 return getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_ENTRIES,
873 table->blob_entries, &entry_size);
876 static int connman_iptables_replace(struct connman_iptables *table,
877 struct ipt_replace *r)
879 return setsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_SET_REPLACE, r,
880 sizeof(*r) + r->size);
883 static void connman_iptables_cleanup(struct connman_iptables *table)
886 struct connman_iptables_entry *entry;
888 close(table->ipt_sock);
890 for (list = table->entries; list; list = list->next) {
893 g_free(entry->entry);
897 g_free(table->blob_entries);
900 xtables_free_opts(1);
903 static int connman_iptables_commit(struct connman_iptables *table)
905 struct ipt_replace *repl;
907 repl = connman_iptables_blob(table);
909 return connman_iptables_replace(table, repl);
912 static int add_entry(struct ipt_entry *entry, struct connman_iptables *table)
914 struct ipt_entry *new_entry;
917 new_entry = g_try_malloc0(entry->next_offset);
918 if (new_entry == NULL)
921 memcpy(new_entry, entry, entry->next_offset);
923 builtin = is_hook_entry(table, entry);
925 return connman_add_entry(table, new_entry, NULL, builtin);
928 static struct connman_iptables *connman_iptables_init(const char *table_name)
930 struct connman_iptables *table;
933 table = g_try_new0(struct connman_iptables, 1);
937 table->info = g_try_new0(struct ipt_getinfo, 1);
938 if (table->info == NULL)
941 table->ipt_sock = socket(AF_INET, SOCK_RAW, IPPROTO_RAW);
942 if (table->ipt_sock < 0)
945 s = sizeof(*table->info);
946 strcpy(table->info->name, table_name);
947 if (getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_INFO,
948 table->info, &s) < 0)
951 table->blob_entries = g_try_malloc0(sizeof(struct ipt_get_entries) +
953 if (table->blob_entries == NULL)
956 strcpy(table->blob_entries->name, table_name);
957 table->blob_entries->size = table->info->size;
959 if (connman_iptables_get_entries(table) < 0)
962 table->num_entries = 0;
963 table->old_entries = table->info->num_entries;
966 memcpy(table->underflow, table->info->underflow,
967 sizeof(table->info->underflow));
968 memcpy(table->hook_entry, table->info->hook_entry,
969 sizeof(table->info->hook_entry));
971 ENTRY_ITERATE(table->blob_entries->entrytable,
972 table->blob_entries->size,
980 connman_iptables_cleanup(table);
986 static struct option connman_iptables_opts[] = {
987 {.name = "append", .has_arg = 1, .val = 'A'},
988 {.name = "flush-chain", .has_arg = 1, .val = 'F'},
989 {.name = "list", .has_arg = 2, .val = 'L'},
990 {.name = "new-chain", .has_arg = 1, .val = 'N'},
991 {.name = "delete-chain", .has_arg = 1, .val = 'X'},
992 {.name = "in-interface", .has_arg = 1, .val = 'i'},
993 {.name = "jump", .has_arg = 1, .val = 'j'},
994 {.name = "match", .has_arg = 1, .val = 'm'},
995 {.name = "out-interface", .has_arg = 1, .val = 'o'},
996 {.name = "table", .has_arg = 1, .val = 't'},
1000 struct xtables_globals connman_iptables_globals = {
1002 .opts = connman_iptables_opts,
1003 .orig_opts = connman_iptables_opts,
1006 int main(int argc, char *argv[])
1008 struct connman_iptables *table;
1009 struct xtables_match *xt_m;
1010 struct xtables_target *xt_t;
1011 char *table_name, *chain, *new_chain, *match_name, *target_name;
1012 char *delete_chain, *flush_chain;
1015 gboolean dump, invert, delete;
1017 xtables_init_all(&connman_iptables_globals, NFPROTO_IPV4);
1022 table_name = chain = new_chain = match_name = target_name = NULL;
1023 delete_chain = flush_chain = NULL;
1028 while ((c = getopt_long(argc, argv,
1029 "-A:F:L::N:X:j:i:m:o:t:", connman_iptables_globals.opts, NULL)) != -1) {
1036 flush_chain = optarg;
1049 delete_chain = optarg;
1053 target_name = optarg;
1054 xt_t = xtables_find_target(target_name, XTF_TRY_LOAD);
1059 size = ALIGN(sizeof(struct ipt_entry_target)) + xt_t->size;
1061 xt_t->t = g_try_malloc0(size);
1062 if (xt_t->t == NULL)
1064 xt_t->t->u.target_size = size;
1065 strcpy(xt_t->t->u.user.name, target_name);
1066 xt_t->t->u.user.revision = xt_t->revision;
1067 if (xt_t->init != NULL)
1068 xt_t->init(xt_t->t);
1069 connman_iptables_globals.opts =
1070 xtables_merge_options(
1071 #if XTABLES_VERSION_CODE > 5
1072 connman_iptables_globals.orig_opts,
1074 connman_iptables_globals.opts,
1076 &xt_t->option_offset);
1077 if (connman_iptables_globals.opts == NULL)
1086 match_name = optarg;
1088 xt_m = xtables_find_match(optarg, XTF_LOAD_MUST_SUCCEED, NULL);
1089 size = ALIGN(sizeof(struct ipt_entry_match)) + xt_m->size;
1090 xt_m->m = g_try_malloc0(size);
1093 xt_m->m->u.match_size = size;
1094 strcpy(xt_m->m->u.user.name, xt_m->name);
1095 xt_m->m->u.user.revision = xt_m->revision;
1096 if (xt_m->init != NULL)
1097 xt_m->init(xt_m->m);
1098 if (xt_m != xt_m->next) {
1099 connman_iptables_globals.opts =
1100 xtables_merge_options(
1101 #if XTABLES_VERSION_CODE > 5
1102 connman_iptables_globals.orig_opts,
1104 connman_iptables_globals.opts,
1106 &xt_m->option_offset);
1107 if (connman_iptables_globals.opts == NULL)
1117 table_name = optarg;
1121 if (optarg[0] == '!' && optarg[1] == '\0') {
1123 printf("Consecutive ! not allowed\n");
1130 printf("Invalid option\n");
1135 if (xt_t == NULL || xt_t->parse == NULL ||
1136 !xt_t->parse(c - xt_t->option_offset, argv, invert,
1137 &xt_t->tflags, NULL, &xt_t->t)) {
1138 if (xt_m == NULL || xt_m->parse == NULL)
1141 xt_m->parse(c - xt_m->option_offset, argv,
1142 invert, &xt_m->mflags, NULL, &xt_m->m);
1149 if (table_name == NULL)
1150 table_name = "filter";
1152 table = connman_iptables_init(table_name);
1157 if (delete_chain == NULL)
1160 printf("Delete chain %s\n", delete_chain);
1162 connman_iptables_delete_chain(table, delete_chain);
1168 printf("Flush chain %s\n", flush_chain);
1170 connman_iptables_flush_chain(table, flush_chain);
1176 connman_iptables_dump(table);
1181 if (chain && new_chain)
1185 printf("New chain %s\n", new_chain);
1187 connman_iptables_add_chain(table, new_chain);
1193 if (target_name == NULL)
1196 printf("Adding %s to %s (match %s)\n", target_name, chain, match_name);
1198 connman_iptables_add_rule(table, chain, target_name, xt_t,
1206 connman_iptables_commit(table);
1209 connman_iptables_cleanup(table);