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))
79 struct ipt_error_target {
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_delete_chain(struct connman_iptables *table,
355 GList *chain_head, *chain_tail, *list, *next;
356 struct connman_iptables_entry *entry;
358 chain_head = find_chain_head(table, name);
359 if (chain_head == NULL)
362 chain_tail = find_chain_tail(table, name);
363 if (chain_tail == NULL)
368 while (list != chain_tail) {
370 next = g_list_next(list);
372 table->num_entries--;
373 table->size -= entry->entry->next_offset;
375 table->entries = g_list_remove(table->entries, list->data);
380 update_offsets(table);
385 static int connman_iptables_add_chain(struct connman_iptables *table,
389 struct ipt_entry *entry_head;
390 struct ipt_entry *entry_return;
391 struct ipt_error_target *error;
392 struct ipt_standard_target *standard;
393 u_int16_t entry_head_size, entry_return_size;
395 last = g_list_last(table->entries);
398 * An empty chain is composed of:
399 * - A head entry, with no match and an error target.
400 * The error target data is the chain name.
401 * - A tail entry, with no match and a standard target.
402 * The standard target verdict is XT_RETURN (return to the
407 entry_head_size = sizeof(struct ipt_entry) +
408 sizeof(struct ipt_error_target);
409 entry_head = g_try_malloc0(entry_head_size);
410 if (entry_head == NULL)
413 memset(entry_head, 0, entry_head_size);
415 entry_head->target_offset = sizeof(struct ipt_entry);
416 entry_head->next_offset = entry_head_size;
418 error = (struct ipt_error_target *) entry_head->elems;
419 strcpy(error->t.u.user.name, IPT_ERROR_TARGET);
420 error->t.u.user.target_size = ALIGN(sizeof(struct ipt_error_target));
421 strcpy(error->error, name);
423 if (connman_add_entry(table, entry_head, last, -1) < 0)
427 entry_return_size = sizeof(struct ipt_entry) +
428 sizeof(struct ipt_standard_target);
429 entry_return = g_try_malloc0(entry_return_size);
430 if (entry_return == NULL)
433 memset(entry_return, 0, entry_return_size);
435 entry_return->target_offset = sizeof(struct ipt_entry);
436 entry_return->next_offset = entry_return_size;
438 standard = (struct ipt_standard_target *) entry_return->elems;
439 standard->target.u.user.target_size =
440 ALIGN(sizeof(struct ipt_standard_target));
441 standard->verdict = XT_RETURN;
443 if (connman_add_entry(table, entry_return, last, -1) < 0)
450 g_free(entry_return);
455 static struct ipt_entry *
456 new_rule(struct connman_iptables *table,
457 char *target_name, struct xtables_target *xt_t,
458 char *match_name, struct xtables_match *xt_m)
460 struct ipt_entry *new_entry;
461 size_t match_size, target_size;
462 int is_builtin = is_builtin_target(target_name);
465 match_size = xt_m->m->u.match_size;
470 target_size = ALIGN(xt_t->t->u.target_size);
472 target_size = ALIGN(sizeof(struct xt_standard_target));
474 new_entry = g_try_malloc0(sizeof(struct ipt_entry) + target_size +
476 if (new_entry == NULL)
479 new_entry->target_offset = sizeof(struct ipt_entry) + match_size;
480 new_entry->next_offset = sizeof(struct ipt_entry) + target_size +
483 struct xt_entry_match *entry_match;
485 entry_match = (struct xt_entry_match *)new_entry->elems;
486 memcpy(entry_match, xt_m->m, match_size);
490 struct xt_entry_target *entry_target;
493 struct xt_standard_target *target;
495 target = (struct xt_standard_target *)(xt_t->t);
496 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
497 target->verdict = target_to_verdict(target_name);
500 entry_target = ipt_get_target(new_entry);
501 memcpy(entry_target, xt_t->t, target_size);
503 struct connman_iptables_entry *target_rule;
504 struct xt_standard_target *target;
508 * This is a user defined target, i.e. a chain jump.
509 * We search for the chain head, and the target verdict
510 * is the first rule's offset on this chain.
511 * The offset is from the beginning of the table.
514 chain_head = find_chain_head(table, target_name);
515 if (chain_head == NULL || chain_head->next == NULL) {
520 target_rule = chain_head->next->data;
522 target = (struct xt_standard_target *)ipt_get_target(new_entry);
523 strcpy(target->target.u.user.name, IPT_STANDARD_TARGET);
524 target->target.u.user.target_size = target_size;
525 target->verdict = target_rule->offset;
531 static void update_hooks(struct connman_iptables *table, GList *chain_head, struct ipt_entry *entry)
534 struct connman_iptables_entry *head, *e;
537 if (chain_head == NULL)
540 head = chain_head->data;
542 builtin = head->builtin;
546 table->underflow[builtin] += entry->next_offset;
548 for (list = chain_head->next; list; list = list->next) {
551 builtin = e->builtin;
555 table->hook_entry[builtin] += entry->next_offset;
556 table->underflow[builtin] += entry->next_offset;
561 connman_iptables_add_rule(struct connman_iptables *table, char *chain_name,
562 char *target_name, struct xtables_target *xt_t,
563 char *match_name, struct xtables_match *xt_m)
565 GList *chain_tail, *chain_head;
566 struct ipt_entry *new_entry;
567 struct connman_iptables_entry *head;
570 chain_head = find_chain_head(table, chain_name);
571 if (chain_head == NULL)
574 chain_tail = find_chain_tail(table, chain_name);
575 if (chain_tail == NULL)
578 new_entry = new_rule(table,
581 if (new_entry == NULL)
584 update_hooks(table, chain_head, new_entry);
587 * If the chain is builtin, and does not have any rule,
588 * then the one that we're inserting is becoming the head
589 * and thus needs the builtin flag.
591 head = chain_head->data;
592 if (head->builtin < 0)
594 else if (chain_head == chain_tail->prev) {
595 builtin = head->builtin;
599 return connman_add_entry(table, new_entry, chain_tail->prev, builtin);
602 static struct ipt_replace *
603 connman_iptables_blob(struct connman_iptables *table)
605 struct ipt_replace *r;
607 struct connman_iptables_entry *e;
608 unsigned char *entry_index;
610 r = g_try_malloc0(sizeof(struct ipt_replace) + table->size);
614 memset(r, 0, sizeof(*r) + table->size);
616 r->counters = g_try_malloc0(sizeof(struct xt_counters)
617 * table->num_entries);
618 if (r->counters == NULL) {
623 strcpy(r->name, table->info->name);
624 r->num_entries = table->num_entries;
625 r->size = table->size;
627 r->num_counters = table->old_entries;
628 r->valid_hooks = table->info->valid_hooks;
630 memcpy(r->hook_entry, table->hook_entry, sizeof(table->hook_entry));
631 memcpy(r->underflow, table->underflow, sizeof(table->underflow));
633 entry_index = (unsigned char *)r->entries;
634 for (list = table->entries; list; list = list->next) {
637 memcpy(entry_index, e->entry, e->entry->next_offset);
638 entry_index += e->entry->next_offset;
644 static void dump_target(struct connman_iptables *table,
645 struct ipt_entry *entry)
648 struct xtables_target *xt_t;
649 struct xt_entry_target *target;
651 target = ipt_get_target(entry);
653 if (!strcmp(target->u.user.name, IPT_STANDARD_TARGET)) {
654 struct xt_standard_target *t;
656 t = (struct xt_standard_target *)target;
658 switch (t->verdict) {
660 printf("\ttarget RETURN\n");
664 printf("\ttarget ACCEPT\n");
668 printf("\ttarget DROP\n");
672 printf("\ttarget QUEUE\n");
676 printf("\ttarget STOP\n");
680 printf("\tJUMP @%p (0x%x)\n",
681 (char*)table->blob_entries->entrytable +
682 t->verdict, t->verdict);
686 xt_t = xtables_find_target(IPT_STANDARD_TARGET,
687 XTF_LOAD_MUST_SUCCEED);
689 if(xt_t->print != NULL)
690 xt_t->print(NULL, target, 1);
692 xt_t = xtables_find_target(target->u.user.name, XTF_TRY_LOAD);
694 printf("\ttarget %s\n", target->u.user.name);
698 if(xt_t->print != NULL) {
700 xt_t->print(NULL, target, 1);
706 static void dump_match(struct connman_iptables *table, struct ipt_entry *entry)
708 struct xtables_match *xt_m;
709 struct xt_entry_match *match;
711 if (entry->elems == (unsigned char *)entry + entry->target_offset)
714 match = (struct xt_entry_match *) entry->elems;
716 if (!strlen(match->u.user.name))
719 xt_m = xtables_find_match(match->u.user.name, XTF_TRY_LOAD, NULL);
723 if(xt_m->print != NULL) {
725 xt_m->print(NULL, match, 1);
732 printf("\tmatch %s\n", match->u.user.name);
736 static int connman_iptables_dump_entry(struct ipt_entry *entry,
737 struct connman_iptables *table)
739 struct xt_entry_target *target;
743 offset = (char *)entry - (char *)table->blob_entries->entrytable;
744 target = ipt_get_target(entry);
745 builtin = is_hook_entry(table, entry);
747 if (entry_to_offset(table, entry) + entry->next_offset ==
748 table->blob_entries->size) {
749 printf("End of CHAIN 0x%x\n", offset);
753 if (!strcmp(target->u.user.name, IPT_ERROR_TARGET)) {
754 printf("USER CHAIN (%s) %p match %p target %p size %d\n",
755 target->data, entry, entry->elems,
756 (char *)entry + entry->target_offset,
760 } else if (builtin >= 0) {
761 printf("CHAIN (%s) %p match %p target %p size %d\n",
762 hooknames[builtin], entry, entry->elems,
763 (char *)entry + entry->target_offset,
766 printf("RULE %p match %p target %p size %d\n", entry,
768 (char *)entry + entry->target_offset,
772 dump_match(table, entry);
773 dump_target(table, entry);
778 static void connman_iptables_dump_hook(struct connman_iptables *table)
782 for (i = 0; i < NF_INET_NUMHOOKS; i++) {
783 if ((table->info->valid_hooks & (1 << i)))
784 printf("%s entry %p underflow %p (%#x)\n",
786 table->blob_entries->entrytable +
787 table->info->hook_entry[i],
788 table->blob_entries->entrytable +
789 table->info->underflow[i],
790 table->info->underflow[i]);
794 static void connman_iptables_dump(struct connman_iptables *table)
796 printf("%s valid_hooks=0x%08x, num_entries=%u, size=%u\n",
798 table->info->valid_hooks, table->info->num_entries,
801 connman_iptables_dump_hook(table);
803 ENTRY_ITERATE(table->blob_entries->entrytable,
804 table->blob_entries->size,
805 connman_iptables_dump_entry, table);
809 static int connman_iptables_get_entries(struct connman_iptables *table)
811 socklen_t entry_size;
813 entry_size = sizeof(struct ipt_get_entries) + table->info->size;
815 return getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_ENTRIES,
816 table->blob_entries, &entry_size);
819 static int connman_iptables_replace(struct connman_iptables *table,
820 struct ipt_replace *r)
822 return setsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_SET_REPLACE, r,
823 sizeof(*r) + r->size);
826 static void connman_iptables_cleanup(struct connman_iptables *table)
829 struct connman_iptables_entry *entry;
831 close(table->ipt_sock);
833 for (list = table->entries; list; list = list->next) {
836 g_free(entry->entry);
840 g_free(table->blob_entries);
843 xtables_free_opts(1);
846 static int connman_iptables_commit(struct connman_iptables *table)
848 struct ipt_replace *repl;
850 repl = connman_iptables_blob(table);
852 return connman_iptables_replace(table, repl);
855 static int add_entry(struct ipt_entry *entry, struct connman_iptables *table)
857 struct ipt_entry *new_entry;
860 new_entry = g_try_malloc0(entry->next_offset);
861 if (new_entry == NULL)
864 memcpy(new_entry, entry, entry->next_offset);
866 builtin = is_hook_entry(table, entry);
868 return connman_add_entry(table, new_entry, NULL, builtin);
871 static struct connman_iptables *connman_iptables_init(const char *table_name)
873 struct connman_iptables *table;
876 table = g_try_new0(struct connman_iptables, 1);
880 table->info = g_try_new0(struct ipt_getinfo, 1);
881 if (table->info == NULL)
884 table->ipt_sock = socket(AF_INET, SOCK_RAW, IPPROTO_RAW);
885 if (table->ipt_sock < 0)
888 s = sizeof(*table->info);
889 strcpy(table->info->name, table_name);
890 if (getsockopt(table->ipt_sock, IPPROTO_IP, IPT_SO_GET_INFO,
891 table->info, &s) < 0)
894 table->blob_entries = g_try_malloc0(sizeof(struct ipt_get_entries) +
896 if (table->blob_entries == NULL)
899 strcpy(table->blob_entries->name, table_name);
900 table->blob_entries->size = table->info->size;
902 if (connman_iptables_get_entries(table) < 0)
905 table->num_entries = 0;
906 table->old_entries = table->info->num_entries;
909 memcpy(table->underflow, table->info->underflow,
910 sizeof(table->info->underflow));
911 memcpy(table->hook_entry, table->info->hook_entry,
912 sizeof(table->info->hook_entry));
914 ENTRY_ITERATE(table->blob_entries->entrytable,
915 table->blob_entries->size,
923 connman_iptables_cleanup(table);
929 static struct option connman_iptables_opts[] = {
930 {.name = "append", .has_arg = 1, .val = 'A'},
931 {.name = "list", .has_arg = 2, .val = 'L'},
932 {.name = "new-chain", .has_arg = 1, .val = 'N'},
933 {.name = "delete-chain", .has_arg = 1, .val = 'X'},
934 {.name = "in-interface", .has_arg = 1, .val = 'i'},
935 {.name = "jump", .has_arg = 1, .val = 'j'},
936 {.name = "match", .has_arg = 1, .val = 'm'},
937 {.name = "out-interface", .has_arg = 1, .val = 'o'},
938 {.name = "table", .has_arg = 1, .val = 't'},
942 struct xtables_globals connman_iptables_globals = {
944 .opts = connman_iptables_opts,
945 .orig_opts = connman_iptables_opts,
948 int main(int argc, char *argv[])
950 struct connman_iptables *table;
951 struct xtables_match *xt_m;
952 struct xtables_target *xt_t;
953 char *table_name, *chain, *new_chain, *match_name, *target_name;
957 gboolean dump, invert, delete;
959 xtables_init_all(&connman_iptables_globals, NFPROTO_IPV4);
964 table_name = chain = new_chain = match_name = target_name = NULL;
970 while ((c = getopt_long(argc, argv,
971 "-A:L::N:X:j:i:m:o:t:", connman_iptables_globals.opts, NULL)) != -1) {
987 delete_chain = optarg;
991 target_name = optarg;
992 xt_t = xtables_find_target(target_name, XTF_TRY_LOAD);
997 size = ALIGN(sizeof(struct ipt_entry_target)) + xt_t->size;
999 xt_t->t = g_try_malloc0(size);
1000 if (xt_t->t == NULL)
1002 xt_t->t->u.target_size = size;
1003 strcpy(xt_t->t->u.user.name, target_name);
1004 xt_t->t->u.user.revision = xt_t->revision;
1005 if (xt_t->init != NULL)
1006 xt_t->init(xt_t->t);
1007 connman_iptables_globals.opts =
1008 xtables_merge_options(connman_iptables_globals.opts,
1010 &xt_t->option_offset);
1011 if (connman_iptables_globals.opts == NULL)
1020 match_name = optarg;
1022 xt_m = xtables_find_match(optarg, XTF_LOAD_MUST_SUCCEED, NULL);
1023 size = ALIGN(sizeof(struct ipt_entry_match)) + xt_m->size;
1024 xt_m->m = g_try_malloc0(size);
1027 xt_m->m->u.match_size = size;
1028 strcpy(xt_m->m->u.user.name, xt_m->name);
1029 xt_m->m->u.user.revision = xt_m->revision;
1030 if (xt_m->init != NULL)
1031 xt_m->init(xt_m->m);
1032 if (xt_m != xt_m->next) {
1033 connman_iptables_globals.opts =
1034 xtables_merge_options(connman_iptables_globals.opts,
1036 &xt_m->option_offset);
1037 if (connman_iptables_globals.opts == NULL)
1047 table_name = optarg;
1051 if (optarg[0] == '!' && optarg[1] == '\0') {
1053 printf("Consecutive ! not allowed\n");
1060 printf("Invalid option\n");
1065 if (xt_t == NULL || xt_t->parse == NULL ||
1066 !xt_t->parse(c - xt_t->option_offset, argv, invert,
1067 &xt_t->tflags, NULL, &xt_t->t)) {
1068 if (xt_m == NULL || xt_m->parse == NULL)
1071 xt_m->parse(c - xt_m->option_offset, argv,
1072 invert, &xt_m->mflags, NULL, &xt_m->m);
1079 if (table_name == NULL)
1080 table_name = "filter";
1082 table = connman_iptables_init(table_name);
1087 if (delete_chain == NULL)
1090 printf("Delete chain %s\n", delete_chain);
1092 connman_iptables_delete_chain(table, delete_chain);
1098 connman_iptables_dump(table);
1103 if (chain && new_chain)
1107 printf("New chain %s\n", new_chain);
1109 connman_iptables_add_chain(table, new_chain);
1115 if (target_name == NULL)
1118 printf("Adding %s to %s (match %s)\n", target_name, chain, match_name);
1120 connman_iptables_add_rule(table, chain, target_name, xt_t,
1128 connman_iptables_commit(table);
1131 connman_iptables_cleanup(table);