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, *list, *next;
411 struct connman_iptables_entry *entry;
413 chain_head = find_chain_head(table, name);
414 if (chain_head == NULL)
417 chain_tail = find_chain_tail(table, name);
418 if (chain_tail == NULL)
423 while (list != chain_tail) {
425 next = g_list_next(list);
427 table->num_entries--;
428 table->size -= entry->entry->next_offset;
430 table->entries = g_list_remove(table->entries, list->data);
435 update_offsets(table);
440 static int connman_iptables_add_chain(struct connman_iptables *table,
444 struct ipt_entry *entry_head;
445 struct ipt_entry *entry_return;
446 struct error_target *error;
447 struct ipt_standard_target *standard;
448 u_int16_t entry_head_size, entry_return_size;
450 last = g_list_last(table->entries);
453 * An empty chain is composed of:
454 * - A head entry, with no match and an error target.
455 * The error target data is the chain name.
456 * - A tail entry, with no match and a standard target.
457 * The standard target verdict is XT_RETURN (return to the
462 entry_head_size = sizeof(struct ipt_entry) +
463 sizeof(struct error_target);
464 entry_head = g_try_malloc0(entry_head_size);
465 if (entry_head == NULL)
468 memset(entry_head, 0, entry_head_size);
470 entry_head->target_offset = sizeof(struct ipt_entry);
471 entry_head->next_offset = entry_head_size;
473 error = (struct error_target *) entry_head->elems;
474 strcpy(error->t.u.user.name, IPT_ERROR_TARGET);
475 error->t.u.user.target_size = ALIGN(sizeof(struct error_target));
476 strcpy(error->error, name);
478 if (connman_add_entry(table, entry_head, last, -1) < 0)
482 entry_return_size = sizeof(struct ipt_entry) +
483 sizeof(struct ipt_standard_target);
484 entry_return = g_try_malloc0(entry_return_size);
485 if (entry_return == NULL)
488 memset(entry_return, 0, entry_return_size);
490 entry_return->target_offset = sizeof(struct ipt_entry);
491 entry_return->next_offset = entry_return_size;
493 standard = (struct ipt_standard_target *) entry_return->elems;
494 standard->target.u.user.target_size =
495 ALIGN(sizeof(struct ipt_standard_target));
496 standard->verdict = XT_RETURN;
498 if (connman_add_entry(table, entry_return, last, -1) < 0)
504 g_free(entry_return);
511 static struct ipt_entry *
512 new_rule(struct connman_iptables *table,
513 char *target_name, struct xtables_target *xt_t,
514 char *match_name, struct xtables_match *xt_m)
516 struct ipt_entry *new_entry;
517 size_t match_size, target_size;
518 int is_builtin = is_builtin_target(target_name);
521 match_size = xt_m->m->u.match_size;
526 target_size = ALIGN(xt_t->t->u.target_size);
528 target_size = ALIGN(sizeof(struct xt_standard_target));
530 new_entry = g_try_malloc0(sizeof(struct ipt_entry) + target_size +
532 if (new_entry == NULL)
535 new_entry->target_offset = sizeof(struct ipt_entry) + match_size;
536 new_entry->next_offset = sizeof(struct ipt_entry) + target_size +
539 struct xt_entry_match *entry_match;
541 entry_match = (struct xt_entry_match *)new_entry->elems;
542 memcpy(entry_match, xt_m->m, match_size);
546 struct xt_entry_target *entry_target;
549 struct xt_standard_target *target;
551 target = (struct xt_standard_target *)(xt_t->t);
552 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
553 target->verdict = target_to_verdict(target_name);
556 entry_target = ipt_get_target(new_entry);
557 memcpy(entry_target, xt_t->t, target_size);
559 struct connman_iptables_entry *target_rule;
560 struct xt_standard_target *target;
564 * This is a user defined target, i.e. a chain jump.
565 * We search for the chain head, and the target verdict
566 * is the first rule's offset on this chain.
567 * The offset is from the beginning of the table.
570 chain_head = find_chain_head(table, target_name);
571 if (chain_head == NULL || chain_head->next == NULL) {
576 target_rule = chain_head->next->data;
578 target = (struct xt_standard_target *)ipt_get_target(new_entry);
579 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
580 target->target.u.user.target_size = target_size;
581 target->verdict = target_rule->offset;
587 static void update_hooks(struct connman_iptables *table, GList *chain_head, struct ipt_entry *entry)
590 struct connman_iptables_entry *head, *e;
593 if (chain_head == NULL)
596 head = chain_head->data;
598 builtin = head->builtin;
602 table->underflow[builtin] += entry->next_offset;
604 for (list = chain_head->next; list; list = list->next) {
607 builtin = e->builtin;
611 table->hook_entry[builtin] += entry->next_offset;
612 table->underflow[builtin] += entry->next_offset;
617 connman_iptables_add_rule(struct connman_iptables *table, char *chain_name,
618 char *target_name, struct xtables_target *xt_t,
619 char *match_name, struct xtables_match *xt_m)
621 GList *chain_tail, *chain_head;
622 struct ipt_entry *new_entry;
623 struct connman_iptables_entry *head;
626 chain_head = find_chain_head(table, chain_name);
627 if (chain_head == NULL)
630 chain_tail = find_chain_tail(table, chain_name);
631 if (chain_tail == NULL)
634 new_entry = new_rule(table,
637 if (new_entry == NULL)
640 update_hooks(table, chain_head, new_entry);
643 * If the chain is builtin, and does not have any rule,
644 * then the one that we're inserting is becoming the head
645 * and thus needs the builtin flag.
647 head = chain_head->data;
648 if (head->builtin < 0)
650 else if (chain_head == chain_tail->prev) {
651 builtin = head->builtin;
655 return connman_add_entry(table, new_entry, chain_tail->prev, builtin);
658 static struct ipt_replace *
659 connman_iptables_blob(struct connman_iptables *table)
661 struct ipt_replace *r;
663 struct connman_iptables_entry *e;
664 unsigned char *entry_index;
666 r = g_try_malloc0(sizeof(struct ipt_replace) + table->size);
670 memset(r, 0, sizeof(*r) + table->size);
672 r->counters = g_try_malloc0(sizeof(struct xt_counters)
673 * table->old_entries);
674 if (r->counters == NULL) {
679 strcpy(r->name, table->info->name);
680 r->num_entries = table->num_entries;
681 r->size = table->size;
683 r->num_counters = table->old_entries;
684 r->valid_hooks = table->info->valid_hooks;
686 memcpy(r->hook_entry, table->hook_entry, sizeof(table->hook_entry));
687 memcpy(r->underflow, table->underflow, sizeof(table->underflow));
689 entry_index = (unsigned char *)r->entries;
690 for (list = table->entries; list; list = list->next) {
693 memcpy(entry_index, e->entry, e->entry->next_offset);
694 entry_index += e->entry->next_offset;
700 static void dump_target(struct connman_iptables *table,
701 struct ipt_entry *entry)
704 struct xtables_target *xt_t;
705 struct xt_entry_target *target;
707 target = ipt_get_target(entry);
709 if (!strcmp(target->u.user.name, IPT_STANDARD_TARGET)) {
710 struct xt_standard_target *t;
712 t = (struct xt_standard_target *)target;
714 switch (t->verdict) {
716 printf("\ttarget RETURN\n");
720 printf("\ttarget ACCEPT\n");
724 printf("\ttarget DROP\n");
728 printf("\ttarget QUEUE\n");
732 printf("\ttarget STOP\n");
736 printf("\tJUMP @%p (0x%x)\n",
737 (char*)table->blob_entries->entrytable +
738 t->verdict, t->verdict);
742 xt_t = xtables_find_target(IPT_STANDARD_TARGET,
743 XTF_LOAD_MUST_SUCCEED);
745 if(xt_t->print != NULL)
746 xt_t->print(NULL, target, 1);
748 xt_t = xtables_find_target(target->u.user.name, XTF_TRY_LOAD);
750 printf("\ttarget %s\n", target->u.user.name);
754 if(xt_t->print != NULL) {
756 xt_t->print(NULL, target, 1);
762 static void dump_match(struct connman_iptables *table, struct ipt_entry *entry)
764 struct xtables_match *xt_m;
765 struct xt_entry_match *match;
767 if (entry->elems == (unsigned char *)entry + entry->target_offset)
770 match = (struct xt_entry_match *) entry->elems;
772 if (!strlen(match->u.user.name))
775 xt_m = xtables_find_match(match->u.user.name, XTF_TRY_LOAD, NULL);
779 if(xt_m->print != NULL) {
781 xt_m->print(NULL, match, 1);
788 printf("\tmatch %s\n", match->u.user.name);
792 static int connman_iptables_dump_entry(struct ipt_entry *entry,
793 struct connman_iptables *table)
795 struct xt_entry_target *target;
799 offset = (char *)entry - (char *)table->blob_entries->entrytable;
800 target = ipt_get_target(entry);
801 builtin = is_hook_entry(table, entry);
803 if (entry_to_offset(table, entry) + entry->next_offset ==
804 table->blob_entries->size) {
805 printf("End of CHAIN 0x%x\n", offset);
809 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET)) {
810 printf("USER CHAIN (%s) %p match %p target %p size %d\n",
811 target->data, entry, entry->elems,
812 (char *)entry + entry->target_offset,
816 } else if (builtin >= 0) {
817 printf("CHAIN (%s) %p match %p target %p size %d\n",
818 hooknames[builtin], entry, entry->elems,
819 (char *)entry + entry->target_offset,
822 printf("RULE %p match %p target %p size %d\n", entry,
824 (char *)entry + entry->target_offset,
828 dump_match(table, entry);
829 dump_target(table, entry);
834 static void connman_iptables_dump_hook(struct connman_iptables *table)
838 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
839 if ((table->info->valid_hooks & (1 << i)))
840 printf("%s entry %p underflow %p (%#x)\n",
842 table->blob_entries->entrytable +
843 table->info->hook_entry[i],
844 table->blob_entries->entrytable +
845 table->info->underflow[i],
846 table->info->underflow[i]);
850 static void connman_iptables_dump(struct connman_iptables *table)
852 printf("%s valid_hooks=0x%08x, num_entries=%u, size=%u\n",
854 table->info->valid_hooks, table->info->num_entries,
857 connman_iptables_dump_hook(table);
859 ENTRY_ITERATE(table->blob_entries->entrytable,
860 table->blob_entries->size,
861 connman_iptables_dump_entry, table);
865 static int connman_iptables_get_entries(struct connman_iptables *table)
867 socklen_t entry_size;
869 entry_size = sizeof(struct ipt_get_entries) + table->info->size;
871 return getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_ENTRIES,
872 table->blob_entries, &entry_size);
875 static int connman_iptables_replace(struct connman_iptables *table,
876 struct ipt_replace *r)
878 return setsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_SET_REPLACE, r,
879 sizeof(*r) + r->size);
882 static void connman_iptables_cleanup(struct connman_iptables *table)
885 struct connman_iptables_entry *entry;
887 close(table->ipt_sock);
889 for (list = table->entries; list; list = list->next) {
892 g_free(entry->entry);
896 g_free(table->blob_entries);
899 xtables_free_opts(1);
902 static int connman_iptables_commit(struct connman_iptables *table)
904 struct ipt_replace *repl;
906 repl = connman_iptables_blob(table);
908 return connman_iptables_replace(table, repl);
911 static int add_entry(struct ipt_entry *entry, struct connman_iptables *table)
913 struct ipt_entry *new_entry;
916 new_entry = g_try_malloc0(entry->next_offset);
917 if (new_entry == NULL)
920 memcpy(new_entry, entry, entry->next_offset);
922 builtin = is_hook_entry(table, entry);
924 return connman_add_entry(table, new_entry, NULL, builtin);
927 static struct connman_iptables *connman_iptables_init(const char *table_name)
929 struct connman_iptables *table;
932 table = g_try_new0(struct connman_iptables, 1);
936 table->info = g_try_new0(struct ipt_getinfo, 1);
937 if (table->info == NULL)
940 table->ipt_sock = socket(AF_INET, SOCK_RAW, IPPROTO_RAW);
941 if (table->ipt_sock < 0)
944 s = sizeof(*table->info);
945 strcpy(table->info->name, table_name);
946 if (getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_INFO,
947 table->info, &s) < 0)
950 table->blob_entries = g_try_malloc0(sizeof(struct ipt_get_entries) +
952 if (table->blob_entries == NULL)
955 strcpy(table->blob_entries->name, table_name);
956 table->blob_entries->size = table->info->size;
958 if (connman_iptables_get_entries(table) < 0)
961 table->num_entries = 0;
962 table->old_entries = table->info->num_entries;
965 memcpy(table->underflow, table->info->underflow,
966 sizeof(table->info->underflow));
967 memcpy(table->hook_entry, table->info->hook_entry,
968 sizeof(table->info->hook_entry));
970 ENTRY_ITERATE(table->blob_entries->entrytable,
971 table->blob_entries->size,
979 connman_iptables_cleanup(table);
985 static struct option connman_iptables_opts[] = {
986 {.name = "append", .has_arg = 1, .val = 'A'},
987 {.name = "flush-chain", .has_arg = 1, .val = 'F'},
988 {.name = "list", .has_arg = 2, .val = 'L'},
989 {.name = "new-chain", .has_arg = 1, .val = 'N'},
990 {.name = "delete-chain", .has_arg = 1, .val = 'X'},
991 {.name = "in-interface", .has_arg = 1, .val = 'i'},
992 {.name = "jump", .has_arg = 1, .val = 'j'},
993 {.name = "match", .has_arg = 1, .val = 'm'},
994 {.name = "out-interface", .has_arg = 1, .val = 'o'},
995 {.name = "table", .has_arg = 1, .val = 't'},
999 struct xtables_globals connman_iptables_globals = {
1001 .opts = connman_iptables_opts,
1002 .orig_opts = connman_iptables_opts,
1005 int main(int argc, char *argv[])
1007 struct connman_iptables *table;
1008 struct xtables_match *xt_m;
1009 struct xtables_target *xt_t;
1010 char *table_name, *chain, *new_chain, *match_name, *target_name;
1011 char *delete_chain, *flush_chain;
1014 gboolean dump, invert, delete;
1016 xtables_init_all(&connman_iptables_globals, NFPROTO_IPV4);
1021 table_name = chain = new_chain = match_name = target_name = NULL;
1022 delete_chain = flush_chain = NULL;
1027 while ((c = getopt_long(argc, argv,
1028 "-A:F:L::N:X:j:i:m:o:t:", connman_iptables_globals.opts, NULL)) != -1) {
1035 flush_chain = optarg;
1048 delete_chain = optarg;
1052 target_name = optarg;
1053 xt_t = xtables_find_target(target_name, XTF_TRY_LOAD);
1058 size = ALIGN(sizeof(struct ipt_entry_target)) + xt_t->size;
1060 xt_t->t = g_try_malloc0(size);
1061 if (xt_t->t == NULL)
1063 xt_t->t->u.target_size = size;
1064 strcpy(xt_t->t->u.user.name, target_name);
1065 xt_t->t->u.user.revision = xt_t->revision;
1066 if (xt_t->init != NULL)
1067 xt_t->init(xt_t->t);
1068 connman_iptables_globals.opts =
1069 xtables_merge_options(
1070 #if XTABLES_VERSION_CODE > 5
1071 connman_iptables_globals.orig_opts,
1073 connman_iptables_globals.opts,
1075 &xt_t->option_offset);
1076 if (connman_iptables_globals.opts == NULL)
1085 match_name = optarg;
1087 xt_m = xtables_find_match(optarg, XTF_LOAD_MUST_SUCCEED, NULL);
1088 size = ALIGN(sizeof(struct ipt_entry_match)) + xt_m->size;
1089 xt_m->m = g_try_malloc0(size);
1092 xt_m->m->u.match_size = size;
1093 strcpy(xt_m->m->u.user.name, xt_m->name);
1094 xt_m->m->u.user.revision = xt_m->revision;
1095 if (xt_m->init != NULL)
1096 xt_m->init(xt_m->m);
1097 if (xt_m != xt_m->next) {
1098 connman_iptables_globals.opts =
1099 xtables_merge_options(
1100 #if XTABLES_VERSION_CODE > 5
1101 connman_iptables_globals.orig_opts,
1103 connman_iptables_globals.opts,
1105 &xt_m->option_offset);
1106 if (connman_iptables_globals.opts == NULL)
1116 table_name = optarg;
1120 if (optarg[0] == '!' && optarg[1] == '\0') {
1122 printf("Consecutive ! not allowed\n");
1129 printf("Invalid option\n");
1134 if (xt_t == NULL || xt_t->parse == NULL ||
1135 !xt_t->parse(c - xt_t->option_offset, argv, invert,
1136 &xt_t->tflags, NULL, &xt_t->t)) {
1137 if (xt_m == NULL || xt_m->parse == NULL)
1140 xt_m->parse(c - xt_m->option_offset, argv,
1141 invert, &xt_m->mflags, NULL, &xt_m->m);
1148 if (table_name == NULL)
1149 table_name = "filter";
1151 table = connman_iptables_init(table_name);
1156 if (delete_chain == NULL)
1159 printf("Delete chain %s\n", delete_chain);
1161 connman_iptables_delete_chain(table, delete_chain);
1167 printf("Flush chain %s\n", flush_chain);
1169 connman_iptables_flush_chain(table, flush_chain);
1175 connman_iptables_dump(table);
1180 if (chain && new_chain)
1184 printf("New chain %s\n", new_chain);
1186 connman_iptables_add_chain(table, new_chain);
1192 if (target_name == NULL)
1195 printf("Adding %s to %s (match %s)\n", target_name, chain, match_name);
1197 connman_iptables_add_rule(table, chain, target_name, xt_t,
1205 connman_iptables_commit(table);
1208 connman_iptables_cleanup(table);