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 *head, *tail;
240 struct ipt_entry *entry;
241 struct xt_entry_target *target;
244 /* First we look for the head */
245 for (list = table->entries; list; list = list->next) {
250 builtin = head->builtin;
251 if (builtin >= 0 && !strcmp(hooknames[builtin], chain_name))
254 /* User defined chain */
255 target = ipt_get_target(entry);
256 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET) &&
257 !strcmp((char *)target->data, chain_name))
266 /* Then we look for the next chain */
267 for (list = chain_head->next; list; list = list->next) {
271 if (is_chain(table, tail))
275 /* Nothing found, we return the table end */
276 return g_list_last(table->entries);
279 static void update_offsets(struct connman_iptables *table)
282 struct connman_iptables_entry *entry, *prev_entry;
284 for (list = table->entries; list; list = list->next) {
287 if (list == table->entries) {
294 prev_entry = prev->data;
296 entry->offset = prev_entry->offset +
297 prev_entry->entry->next_offset;
301 static int connman_add_entry(struct connman_iptables *table,
302 struct ipt_entry *entry, GList *before,
306 struct connman_iptables_entry *e, *tmp, *entry_before;
307 struct xt_standard_target *t;
312 e = g_try_malloc0(sizeof(struct connman_iptables_entry));
317 e->builtin = builtin;
319 table->entries = g_list_insert_before(table->entries, before, e);
320 table->num_entries++;
321 table->size += entry->next_offset;
323 if (before == NULL) {
324 e->offset = table->size - entry->next_offset;
329 entry_before = before->data;
332 * We've just insterted a new entry. All references before it
333 * should be bumped accordingly.
335 for (list = table->entries; list != before; list = list->next) {
341 t = (struct xt_standard_target *)ipt_get_target(tmp->entry);
343 if (t->verdict >= entry_before->offset)
344 t->verdict += entry->next_offset;
347 update_offsets(table);
352 static int connman_iptables_flush_chain(struct connman_iptables *table,
355 GList *chain_head, *chain_tail, *list, *next;
356 struct connman_iptables_entry *entry;
357 int builtin, removed = 0;
359 chain_head = find_chain_head(table, name);
360 if (chain_head == NULL)
363 chain_tail = find_chain_tail(table, name);
364 if (chain_tail == NULL)
367 entry = chain_head->data;
368 builtin = entry->builtin;
373 list = chain_head->next;
375 if (list == chain_tail->prev)
378 while (list != chain_tail->prev) {
380 next = g_list_next(list);
382 table->num_entries--;
383 table->size -= entry->entry->next_offset;
384 removed += entry->entry->next_offset;
386 table->entries = g_list_remove(table->entries, list->data);
392 struct connman_iptables_entry *e;
396 entry->builtin = builtin;
398 table->underflow[builtin] -= removed;
400 for (list = chain_tail; list; list = list->next) {
403 builtin = e->builtin;
407 table->hook_entry[builtin] -= removed;
408 table->underflow[builtin] -= removed;
412 update_offsets(table);
417 static int connman_iptables_delete_chain(struct connman_iptables *table,
420 GList *chain_head, *chain_tail, *list, *next;
421 struct connman_iptables_entry *entry;
423 chain_head = find_chain_head(table, name);
424 if (chain_head == NULL)
427 chain_tail = find_chain_tail(table, name);
428 if (chain_tail == NULL)
433 while (list != chain_tail) {
435 next = g_list_next(list);
437 table->num_entries--;
438 table->size -= entry->entry->next_offset;
440 table->entries = g_list_remove(table->entries, list->data);
445 update_offsets(table);
450 static int connman_iptables_add_chain(struct connman_iptables *table,
454 struct ipt_entry *entry_head;
455 struct ipt_entry *entry_return;
456 struct error_target *error;
457 struct ipt_standard_target *standard;
458 u_int16_t entry_head_size, entry_return_size;
460 last = g_list_last(table->entries);
463 * An empty chain is composed of:
464 * - A head entry, with no match and an error target.
465 * The error target data is the chain name.
466 * - A tail entry, with no match and a standard target.
467 * The standard target verdict is XT_RETURN (return to the
472 entry_head_size = sizeof(struct ipt_entry) +
473 sizeof(struct error_target);
474 entry_head = g_try_malloc0(entry_head_size);
475 if (entry_head == NULL)
478 memset(entry_head, 0, entry_head_size);
480 entry_head->target_offset = sizeof(struct ipt_entry);
481 entry_head->next_offset = entry_head_size;
483 error = (struct error_target *) entry_head->elems;
484 strcpy(error->t.u.user.name, IPT_ERROR_TARGET);
485 error->t.u.user.target_size = ALIGN(sizeof(struct error_target));
486 strcpy(error->error, name);
488 if (connman_add_entry(table, entry_head, last, -1) < 0)
492 entry_return_size = sizeof(struct ipt_entry) +
493 sizeof(struct ipt_standard_target);
494 entry_return = g_try_malloc0(entry_return_size);
495 if (entry_return == NULL)
498 memset(entry_return, 0, entry_return_size);
500 entry_return->target_offset = sizeof(struct ipt_entry);
501 entry_return->next_offset = entry_return_size;
503 standard = (struct ipt_standard_target *) entry_return->elems;
504 standard->target.u.user.target_size =
505 ALIGN(sizeof(struct ipt_standard_target));
506 standard->verdict = XT_RETURN;
508 if (connman_add_entry(table, entry_return, last, -1) < 0)
514 g_free(entry_return);
521 static struct ipt_entry *
522 new_rule(struct connman_iptables *table,
523 char *target_name, struct xtables_target *xt_t,
524 char *match_name, struct xtables_match *xt_m)
526 struct ipt_entry *new_entry;
527 size_t match_size, target_size;
528 int is_builtin = is_builtin_target(target_name);
531 match_size = xt_m->m->u.match_size;
536 target_size = ALIGN(xt_t->t->u.target_size);
538 target_size = ALIGN(sizeof(struct xt_standard_target));
540 new_entry = g_try_malloc0(sizeof(struct ipt_entry) + target_size +
542 if (new_entry == NULL)
545 new_entry->target_offset = sizeof(struct ipt_entry) + match_size;
546 new_entry->next_offset = sizeof(struct ipt_entry) + target_size +
549 struct xt_entry_match *entry_match;
551 entry_match = (struct xt_entry_match *)new_entry->elems;
552 memcpy(entry_match, xt_m->m, match_size);
556 struct xt_entry_target *entry_target;
559 struct xt_standard_target *target;
561 target = (struct xt_standard_target *)(xt_t->t);
562 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
563 target->verdict = target_to_verdict(target_name);
566 entry_target = ipt_get_target(new_entry);
567 memcpy(entry_target, xt_t->t, target_size);
569 struct connman_iptables_entry *target_rule;
570 struct xt_standard_target *target;
574 * This is a user defined target, i.e. a chain jump.
575 * We search for the chain head, and the target verdict
576 * is the first rule's offset on this chain.
577 * The offset is from the beginning of the table.
580 chain_head = find_chain_head(table, target_name);
581 if (chain_head == NULL || chain_head->next == NULL) {
586 target_rule = chain_head->next->data;
588 target = (struct xt_standard_target *)ipt_get_target(new_entry);
589 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
590 target->target.u.user.target_size = target_size;
591 target->verdict = target_rule->offset;
597 static void update_hooks(struct connman_iptables *table, GList *chain_head, struct ipt_entry *entry)
600 struct connman_iptables_entry *head, *e;
603 if (chain_head == NULL)
606 head = chain_head->data;
608 builtin = head->builtin;
612 table->underflow[builtin] += entry->next_offset;
614 for (list = chain_head->next; list; list = list->next) {
617 builtin = e->builtin;
621 table->hook_entry[builtin] += entry->next_offset;
622 table->underflow[builtin] += entry->next_offset;
627 connman_iptables_add_rule(struct connman_iptables *table, char *chain_name,
628 char *target_name, struct xtables_target *xt_t,
629 char *match_name, struct xtables_match *xt_m)
631 GList *chain_tail, *chain_head;
632 struct ipt_entry *new_entry;
633 struct connman_iptables_entry *head;
636 chain_head = find_chain_head(table, chain_name);
637 if (chain_head == NULL)
640 chain_tail = find_chain_tail(table, chain_name);
641 if (chain_tail == NULL)
644 new_entry = new_rule(table,
647 if (new_entry == NULL)
650 update_hooks(table, chain_head, new_entry);
653 * If the chain is builtin, and does not have any rule,
654 * then the one that we're inserting is becoming the head
655 * and thus needs the builtin flag.
657 head = chain_head->data;
658 if (head->builtin < 0)
660 else if (chain_head == chain_tail->prev) {
661 builtin = head->builtin;
665 return connman_add_entry(table, new_entry, chain_tail->prev, builtin);
668 static struct ipt_replace *
669 connman_iptables_blob(struct connman_iptables *table)
671 struct ipt_replace *r;
673 struct connman_iptables_entry *e;
674 unsigned char *entry_index;
676 r = g_try_malloc0(sizeof(struct ipt_replace) + table->size);
680 memset(r, 0, sizeof(*r) + table->size);
682 r->counters = g_try_malloc0(sizeof(struct xt_counters)
683 * table->old_entries);
684 if (r->counters == NULL) {
689 strcpy(r->name, table->info->name);
690 r->num_entries = table->num_entries;
691 r->size = table->size;
693 r->num_counters = table->old_entries;
694 r->valid_hooks = table->info->valid_hooks;
696 memcpy(r->hook_entry, table->hook_entry, sizeof(table->hook_entry));
697 memcpy(r->underflow, table->underflow, sizeof(table->underflow));
699 entry_index = (unsigned char *)r->entries;
700 for (list = table->entries; list; list = list->next) {
703 memcpy(entry_index, e->entry, e->entry->next_offset);
704 entry_index += e->entry->next_offset;
710 static void dump_target(struct connman_iptables *table,
711 struct ipt_entry *entry)
714 struct xtables_target *xt_t;
715 struct xt_entry_target *target;
717 target = ipt_get_target(entry);
719 if (!strcmp(target->u.user.name, IPT_STANDARD_TARGET)) {
720 struct xt_standard_target *t;
722 t = (struct xt_standard_target *)target;
724 switch (t->verdict) {
726 printf("\ttarget RETURN\n");
730 printf("\ttarget ACCEPT\n");
734 printf("\ttarget DROP\n");
738 printf("\ttarget QUEUE\n");
742 printf("\ttarget STOP\n");
746 printf("\tJUMP @%p (0x%x)\n",
747 (char*)table->blob_entries->entrytable +
748 t->verdict, t->verdict);
752 xt_t = xtables_find_target(IPT_STANDARD_TARGET,
753 XTF_LOAD_MUST_SUCCEED);
755 if(xt_t->print != NULL)
756 xt_t->print(NULL, target, 1);
758 xt_t = xtables_find_target(target->u.user.name, XTF_TRY_LOAD);
760 printf("\ttarget %s\n", target->u.user.name);
764 if(xt_t->print != NULL) {
766 xt_t->print(NULL, target, 1);
772 static void dump_match(struct connman_iptables *table, struct ipt_entry *entry)
774 struct xtables_match *xt_m;
775 struct xt_entry_match *match;
777 if (entry->elems == (unsigned char *)entry + entry->target_offset)
780 match = (struct xt_entry_match *) entry->elems;
782 if (!strlen(match->u.user.name))
785 xt_m = xtables_find_match(match->u.user.name, XTF_TRY_LOAD, NULL);
789 if(xt_m->print != NULL) {
791 xt_m->print(NULL, match, 1);
798 printf("\tmatch %s\n", match->u.user.name);
802 static int connman_iptables_dump_entry(struct ipt_entry *entry,
803 struct connman_iptables *table)
805 struct xt_entry_target *target;
809 offset = (char *)entry - (char *)table->blob_entries->entrytable;
810 target = ipt_get_target(entry);
811 builtin = is_hook_entry(table, entry);
813 if (entry_to_offset(table, entry) + entry->next_offset ==
814 table->blob_entries->size) {
815 printf("End of CHAIN 0x%x\n", offset);
819 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET)) {
820 printf("USER CHAIN (%s) %p match %p target %p size %d\n",
821 target->data, entry, entry->elems,
822 (char *)entry + entry->target_offset,
826 } else if (builtin >= 0) {
827 printf("CHAIN (%s) %p match %p target %p size %d\n",
828 hooknames[builtin], entry, entry->elems,
829 (char *)entry + entry->target_offset,
832 printf("RULE %p match %p target %p size %d\n", entry,
834 (char *)entry + entry->target_offset,
838 dump_match(table, entry);
839 dump_target(table, entry);
844 static void connman_iptables_dump_hook(struct connman_iptables *table)
848 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
849 if ((table->info->valid_hooks & (1 << i)))
850 printf("%s entry %p underflow %p (%#x)\n",
852 table->blob_entries->entrytable +
853 table->info->hook_entry[i],
854 table->blob_entries->entrytable +
855 table->info->underflow[i],
856 table->info->underflow[i]);
860 static void connman_iptables_dump(struct connman_iptables *table)
862 printf("%s valid_hooks=0x%08x, num_entries=%u, size=%u\n",
864 table->info->valid_hooks, table->info->num_entries,
867 connman_iptables_dump_hook(table);
869 ENTRY_ITERATE(table->blob_entries->entrytable,
870 table->blob_entries->size,
871 connman_iptables_dump_entry, table);
875 static int connman_iptables_get_entries(struct connman_iptables *table)
877 socklen_t entry_size;
879 entry_size = sizeof(struct ipt_get_entries) + table->info->size;
881 return getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_ENTRIES,
882 table->blob_entries, &entry_size);
885 static int connman_iptables_replace(struct connman_iptables *table,
886 struct ipt_replace *r)
888 return setsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_SET_REPLACE, r,
889 sizeof(*r) + r->size);
892 static void connman_iptables_cleanup(struct connman_iptables *table)
895 struct connman_iptables_entry *entry;
897 close(table->ipt_sock);
899 for (list = table->entries; list; list = list->next) {
902 g_free(entry->entry);
906 g_free(table->blob_entries);
909 xtables_free_opts(1);
912 static int connman_iptables_commit(struct connman_iptables *table)
914 struct ipt_replace *repl;
916 repl = connman_iptables_blob(table);
918 return connman_iptables_replace(table, repl);
921 static int add_entry(struct ipt_entry *entry, struct connman_iptables *table)
923 struct ipt_entry *new_entry;
926 new_entry = g_try_malloc0(entry->next_offset);
927 if (new_entry == NULL)
930 memcpy(new_entry, entry, entry->next_offset);
932 builtin = is_hook_entry(table, entry);
934 return connman_add_entry(table, new_entry, NULL, builtin);
937 static struct connman_iptables *connman_iptables_init(const char *table_name)
939 struct connman_iptables *table;
942 table = g_try_new0(struct connman_iptables, 1);
946 table->info = g_try_new0(struct ipt_getinfo, 1);
947 if (table->info == NULL)
950 table->ipt_sock = socket(AF_INET, SOCK_RAW, IPPROTO_RAW);
951 if (table->ipt_sock < 0)
954 s = sizeof(*table->info);
955 strcpy(table->info->name, table_name);
956 if (getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_INFO,
957 table->info, &s) < 0)
960 table->blob_entries = g_try_malloc0(sizeof(struct ipt_get_entries) +
962 if (table->blob_entries == NULL)
965 strcpy(table->blob_entries->name, table_name);
966 table->blob_entries->size = table->info->size;
968 if (connman_iptables_get_entries(table) < 0)
971 table->num_entries = 0;
972 table->old_entries = table->info->num_entries;
975 memcpy(table->underflow, table->info->underflow,
976 sizeof(table->info->underflow));
977 memcpy(table->hook_entry, table->info->hook_entry,
978 sizeof(table->info->hook_entry));
980 ENTRY_ITERATE(table->blob_entries->entrytable,
981 table->blob_entries->size,
989 connman_iptables_cleanup(table);
995 static struct option connman_iptables_opts[] = {
996 {.name = "append", .has_arg = 1, .val = 'A'},
997 {.name = "flush-chain", .has_arg = 1, .val = 'F'},
998 {.name = "list", .has_arg = 2, .val = 'L'},
999 {.name = "new-chain", .has_arg = 1, .val = 'N'},
1000 {.name = "delete-chain", .has_arg = 1, .val = 'X'},
1001 {.name = "in-interface", .has_arg = 1, .val = 'i'},
1002 {.name = "jump", .has_arg = 1, .val = 'j'},
1003 {.name = "match", .has_arg = 1, .val = 'm'},
1004 {.name = "out-interface", .has_arg = 1, .val = 'o'},
1005 {.name = "table", .has_arg = 1, .val = 't'},
1009 struct xtables_globals connman_iptables_globals = {
1011 .opts = connman_iptables_opts,
1012 .orig_opts = connman_iptables_opts,
1015 int main(int argc, char *argv[])
1017 struct connman_iptables *table;
1018 struct xtables_match *xt_m;
1019 struct xtables_target *xt_t;
1020 char *table_name, *chain, *new_chain, *match_name, *target_name;
1021 char *delete_chain, *flush_chain;
1024 gboolean dump, invert, delete;
1026 xtables_init_all(&connman_iptables_globals, NFPROTO_IPV4);
1031 table_name = chain = new_chain = match_name = target_name = NULL;
1032 delete_chain = flush_chain = NULL;
1037 while ((c = getopt_long(argc, argv,
1038 "-A:F:L::N:X:j:i:m:o:t:", connman_iptables_globals.opts, NULL)) != -1) {
1045 flush_chain = optarg;
1058 delete_chain = optarg;
1062 target_name = optarg;
1063 xt_t = xtables_find_target(target_name, XTF_TRY_LOAD);
1068 size = ALIGN(sizeof(struct ipt_entry_target)) + xt_t->size;
1070 xt_t->t = g_try_malloc0(size);
1071 if (xt_t->t == NULL)
1073 xt_t->t->u.target_size = size;
1074 strcpy(xt_t->t->u.user.name, target_name);
1075 xt_t->t->u.user.revision = xt_t->revision;
1076 if (xt_t->init != NULL)
1077 xt_t->init(xt_t->t);
1078 connman_iptables_globals.opts =
1079 xtables_merge_options(
1080 #if XTABLES_VERSION_CODE > 5
1081 connman_iptables_globals.orig_opts,
1083 connman_iptables_globals.opts,
1085 &xt_t->option_offset);
1086 if (connman_iptables_globals.opts == NULL)
1095 match_name = optarg;
1097 xt_m = xtables_find_match(optarg, XTF_LOAD_MUST_SUCCEED, NULL);
1098 size = ALIGN(sizeof(struct ipt_entry_match)) + xt_m->size;
1099 xt_m->m = g_try_malloc0(size);
1102 xt_m->m->u.match_size = size;
1103 strcpy(xt_m->m->u.user.name, xt_m->name);
1104 xt_m->m->u.user.revision = xt_m->revision;
1105 if (xt_m->init != NULL)
1106 xt_m->init(xt_m->m);
1107 if (xt_m != xt_m->next) {
1108 connman_iptables_globals.opts =
1109 xtables_merge_options(
1110 #if XTABLES_VERSION_CODE > 5
1111 connman_iptables_globals.orig_opts,
1113 connman_iptables_globals.opts,
1115 &xt_m->option_offset);
1116 if (connman_iptables_globals.opts == NULL)
1126 table_name = optarg;
1130 if (optarg[0] == '!' && optarg[1] == '\0') {
1132 printf("Consecutive ! not allowed\n");
1139 printf("Invalid option\n");
1144 if (xt_t == NULL || xt_t->parse == NULL ||
1145 !xt_t->parse(c - xt_t->option_offset, argv, invert,
1146 &xt_t->tflags, NULL, &xt_t->t)) {
1147 if (xt_m == NULL || xt_m->parse == NULL)
1150 xt_m->parse(c - xt_m->option_offset, argv,
1151 invert, &xt_m->mflags, NULL, &xt_m->m);
1158 if (table_name == NULL)
1159 table_name = "filter";
1161 table = connman_iptables_init(table_name);
1166 if (delete_chain == NULL)
1169 printf("Delete chain %s\n", delete_chain);
1171 connman_iptables_delete_chain(table, delete_chain);
1177 printf("Flush chain %s\n", flush_chain);
1179 connman_iptables_flush_chain(table, flush_chain);
1185 connman_iptables_dump(table);
1190 if (chain && new_chain)
1194 printf("New chain %s\n", new_chain);
1196 connman_iptables_add_chain(table, new_chain);
1202 if (target_name == NULL)
1205 printf("Adding %s to %s (match %s)\n", target_name, chain, match_name);
1207 connman_iptables_add_rule(table, chain, target_name, xt_t,
1215 connman_iptables_commit(table);
1218 connman_iptables_cleanup(table);