1 /*
2 * m_connmark.c Connection tracking marking import
3 *
4 * Copyright (c) 2011 Felix Fietkau <nbd@openwrt.org>
5 *
6 * This program is free software; you can redistribute it and/or modify it
7 * under the terms and conditions of the GNU General Public License,
8 * version 2, as published by the Free Software Foundation.
9 *
10 * This program is distributed in the hope it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
13 * more details.
14 *
15 * You should have received a copy of the GNU General Public License along with
16 * this program; if not, see <http://www.gnu.org/licenses>.
17 */
18
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include <unistd.h>
22 #include <string.h>
23 #include "utils.h"
24 #include "tc_util.h"
25 #include <linux/tc_act/tc_connmark.h>
26
27 static void
explain(void)28 explain(void)
29 {
30 fprintf(stderr, "Usage: ... connmark [zone ZONE] [BRANCH] [index <INDEX>]\n");
31 fprintf(stderr, "where :\n"
32 "\tZONE is the conntrack zone\n"
33 "\tBRANCH := reclassify|pipe|drop|continue|ok\n");
34 }
35
36 static void
usage(void)37 usage(void)
38 {
39 explain();
40 exit(-1);
41 }
42
43 static int
parse_connmark(struct action_util * a,int * argc_p,char *** argv_p,int tca_id,struct nlmsghdr * n)44 parse_connmark(struct action_util *a, int *argc_p, char ***argv_p, int tca_id,
45 struct nlmsghdr *n)
46 {
47 struct tc_connmark sel = {};
48 char **argv = *argv_p;
49 int argc = *argc_p;
50 int ok = 0;
51 struct rtattr *tail;
52
53 while (argc > 0) {
54 if (matches(*argv, "connmark") == 0) {
55 ok = 1;
56 argc--;
57 argv++;
58 } else if (matches(*argv, "help") == 0) {
59 usage();
60 } else {
61 break;
62 }
63
64 }
65
66 if (!ok) {
67 explain();
68 return -1;
69 }
70
71 if (argc) {
72 if (matches(*argv, "zone") == 0) {
73 NEXT_ARG();
74 if (get_u16(&sel.zone, *argv, 10)) {
75 fprintf(stderr, "simple: Illegal \"index\"\n");
76 return -1;
77 }
78 argc--;
79 argv++;
80 }
81 }
82
83 sel.action = TC_ACT_PIPE;
84 if (argc) {
85 if (matches(*argv, "reclassify") == 0) {
86 sel.action = TC_ACT_RECLASSIFY;
87 argc--;
88 argv++;
89 } else if (matches(*argv, "pipe") == 0) {
90 sel.action = TC_ACT_PIPE;
91 argc--;
92 argv++;
93 } else if (matches(*argv, "drop") == 0 ||
94 matches(*argv, "shot") == 0) {
95 sel.action = TC_ACT_SHOT;
96 argc--;
97 argv++;
98 } else if (matches(*argv, "continue") == 0) {
99 sel.action = TC_ACT_UNSPEC;
100 argc--;
101 argv++;
102 } else if (matches(*argv, "pass") == 0) {
103 sel.action = TC_ACT_OK;
104 argc--;
105 argv++;
106 }
107 }
108
109 if (argc) {
110 if (matches(*argv, "index") == 0) {
111 NEXT_ARG();
112 if (get_u32(&sel.index, *argv, 10)) {
113 fprintf(stderr, "simple: Illegal \"index\"\n");
114 return -1;
115 }
116 argc--;
117 argv++;
118 }
119 }
120
121 tail = NLMSG_TAIL(n);
122 addattr_l(n, MAX_MSG, tca_id, NULL, 0);
123 addattr_l(n, MAX_MSG, TCA_CONNMARK_PARMS, &sel, sizeof(sel));
124 tail->rta_len = (char *)NLMSG_TAIL(n) - (char *)tail;
125
126 *argc_p = argc;
127 *argv_p = argv;
128 return 0;
129 }
130
print_connmark(struct action_util * au,FILE * f,struct rtattr * arg)131 static int print_connmark(struct action_util *au, FILE *f, struct rtattr *arg)
132 {
133 struct rtattr *tb[TCA_CONNMARK_MAX + 1];
134 struct tc_connmark *ci;
135
136 if (arg == NULL)
137 return -1;
138
139 parse_rtattr_nested(tb, TCA_CONNMARK_MAX, arg);
140 if (tb[TCA_CONNMARK_PARMS] == NULL) {
141 fprintf(f, "[NULL connmark parameters]");
142 return -1;
143 }
144
145 ci = RTA_DATA(tb[TCA_CONNMARK_PARMS]);
146
147 fprintf(f, " connmark zone %d\n", ci->zone);
148 fprintf(f, "\t index %d ref %d bind %d", ci->index,
149 ci->refcnt, ci->bindcnt);
150
151 if (show_stats) {
152 if (tb[TCA_CONNMARK_TM]) {
153 struct tcf_t *tm = RTA_DATA(tb[TCA_CONNMARK_TM]);
154 print_tm(f, tm);
155 }
156 }
157 fprintf(f, "\n");
158
159 return 0;
160 }
161
162 struct action_util connmark_action_util = {
163 .id = "connmark",
164 .parse_aopt = parse_connmark,
165 .print_aopt = print_connmark,
166 };
167