Loading...
1/*
2 * net/sched/cls_basic.c Basic Packet Classifier.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public License
6 * as published by the Free Software Foundation; either version
7 * 2 of the License, or (at your option) any later version.
8 *
9 * Authors: Thomas Graf <tgraf@suug.ch>
10 */
11
12#include <linux/module.h>
13#include <linux/slab.h>
14#include <linux/types.h>
15#include <linux/kernel.h>
16#include <linux/string.h>
17#include <linux/errno.h>
18#include <linux/rtnetlink.h>
19#include <linux/skbuff.h>
20#include <net/netlink.h>
21#include <net/act_api.h>
22#include <net/pkt_cls.h>
23
24struct basic_head {
25 u32 hgenerator;
26 struct list_head flist;
27};
28
29struct basic_filter {
30 u32 handle;
31 struct tcf_exts exts;
32 struct tcf_ematch_tree ematches;
33 struct tcf_result res;
34 struct list_head link;
35};
36
37static const struct tcf_ext_map basic_ext_map = {
38 .action = TCA_BASIC_ACT,
39 .police = TCA_BASIC_POLICE
40};
41
42static int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
43 struct tcf_result *res)
44{
45 int r;
46 struct basic_head *head = (struct basic_head *) tp->root;
47 struct basic_filter *f;
48
49 list_for_each_entry(f, &head->flist, link) {
50 if (!tcf_em_tree_match(skb, &f->ematches, NULL))
51 continue;
52 *res = f->res;
53 r = tcf_exts_exec(skb, &f->exts, res);
54 if (r < 0)
55 continue;
56 return r;
57 }
58 return -1;
59}
60
61static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
62{
63 unsigned long l = 0UL;
64 struct basic_head *head = (struct basic_head *) tp->root;
65 struct basic_filter *f;
66
67 if (head == NULL)
68 return 0UL;
69
70 list_for_each_entry(f, &head->flist, link)
71 if (f->handle == handle)
72 l = (unsigned long) f;
73
74 return l;
75}
76
77static void basic_put(struct tcf_proto *tp, unsigned long f)
78{
79}
80
81static int basic_init(struct tcf_proto *tp)
82{
83 struct basic_head *head;
84
85 head = kzalloc(sizeof(*head), GFP_KERNEL);
86 if (head == NULL)
87 return -ENOBUFS;
88 INIT_LIST_HEAD(&head->flist);
89 tp->root = head;
90 return 0;
91}
92
93static void basic_delete_filter(struct tcf_proto *tp, struct basic_filter *f)
94{
95 tcf_unbind_filter(tp, &f->res);
96 tcf_exts_destroy(tp, &f->exts);
97 tcf_em_tree_destroy(tp, &f->ematches);
98 kfree(f);
99}
100
101static void basic_destroy(struct tcf_proto *tp)
102{
103 struct basic_head *head = tp->root;
104 struct basic_filter *f, *n;
105
106 list_for_each_entry_safe(f, n, &head->flist, link) {
107 list_del(&f->link);
108 basic_delete_filter(tp, f);
109 }
110 kfree(head);
111}
112
113static int basic_delete(struct tcf_proto *tp, unsigned long arg)
114{
115 struct basic_head *head = (struct basic_head *) tp->root;
116 struct basic_filter *t, *f = (struct basic_filter *) arg;
117
118 list_for_each_entry(t, &head->flist, link)
119 if (t == f) {
120 tcf_tree_lock(tp);
121 list_del(&t->link);
122 tcf_tree_unlock(tp);
123 basic_delete_filter(tp, t);
124 return 0;
125 }
126
127 return -ENOENT;
128}
129
130static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
131 [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
132 [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
133};
134
135static int basic_set_parms(struct tcf_proto *tp, struct basic_filter *f,
136 unsigned long base, struct nlattr **tb,
137 struct nlattr *est)
138{
139 int err = -EINVAL;
140 struct tcf_exts e;
141 struct tcf_ematch_tree t;
142
143 err = tcf_exts_validate(tp, tb, est, &e, &basic_ext_map);
144 if (err < 0)
145 return err;
146
147 err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &t);
148 if (err < 0)
149 goto errout;
150
151 if (tb[TCA_BASIC_CLASSID]) {
152 f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
153 tcf_bind_filter(tp, &f->res, base);
154 }
155
156 tcf_exts_change(tp, &f->exts, &e);
157 tcf_em_tree_change(tp, &f->ematches, &t);
158
159 return 0;
160errout:
161 tcf_exts_destroy(tp, &e);
162 return err;
163}
164
165static int basic_change(struct tcf_proto *tp, unsigned long base, u32 handle,
166 struct nlattr **tca, unsigned long *arg)
167{
168 int err;
169 struct basic_head *head = (struct basic_head *) tp->root;
170 struct nlattr *tb[TCA_BASIC_MAX + 1];
171 struct basic_filter *f = (struct basic_filter *) *arg;
172
173 if (tca[TCA_OPTIONS] == NULL)
174 return -EINVAL;
175
176 err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
177 basic_policy);
178 if (err < 0)
179 return err;
180
181 if (f != NULL) {
182 if (handle && f->handle != handle)
183 return -EINVAL;
184 return basic_set_parms(tp, f, base, tb, tca[TCA_RATE]);
185 }
186
187 err = -ENOBUFS;
188 f = kzalloc(sizeof(*f), GFP_KERNEL);
189 if (f == NULL)
190 goto errout;
191
192 err = -EINVAL;
193 if (handle)
194 f->handle = handle;
195 else {
196 unsigned int i = 0x80000000;
197 do {
198 if (++head->hgenerator == 0x7FFFFFFF)
199 head->hgenerator = 1;
200 } while (--i > 0 && basic_get(tp, head->hgenerator));
201
202 if (i <= 0) {
203 pr_err("Insufficient number of handles\n");
204 goto errout;
205 }
206
207 f->handle = head->hgenerator;
208 }
209
210 err = basic_set_parms(tp, f, base, tb, tca[TCA_RATE]);
211 if (err < 0)
212 goto errout;
213
214 tcf_tree_lock(tp);
215 list_add(&f->link, &head->flist);
216 tcf_tree_unlock(tp);
217 *arg = (unsigned long) f;
218
219 return 0;
220errout:
221 if (*arg == 0UL && f)
222 kfree(f);
223
224 return err;
225}
226
227static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
228{
229 struct basic_head *head = (struct basic_head *) tp->root;
230 struct basic_filter *f;
231
232 list_for_each_entry(f, &head->flist, link) {
233 if (arg->count < arg->skip)
234 goto skip;
235
236 if (arg->fn(tp, (unsigned long) f, arg) < 0) {
237 arg->stop = 1;
238 break;
239 }
240skip:
241 arg->count++;
242 }
243}
244
245static int basic_dump(struct tcf_proto *tp, unsigned long fh,
246 struct sk_buff *skb, struct tcmsg *t)
247{
248 struct basic_filter *f = (struct basic_filter *) fh;
249 struct nlattr *nest;
250
251 if (f == NULL)
252 return skb->len;
253
254 t->tcm_handle = f->handle;
255
256 nest = nla_nest_start(skb, TCA_OPTIONS);
257 if (nest == NULL)
258 goto nla_put_failure;
259
260 if (f->res.classid)
261 NLA_PUT_U32(skb, TCA_BASIC_CLASSID, f->res.classid);
262
263 if (tcf_exts_dump(skb, &f->exts, &basic_ext_map) < 0 ||
264 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
265 goto nla_put_failure;
266
267 nla_nest_end(skb, nest);
268
269 if (tcf_exts_dump_stats(skb, &f->exts, &basic_ext_map) < 0)
270 goto nla_put_failure;
271
272 return skb->len;
273
274nla_put_failure:
275 nla_nest_cancel(skb, nest);
276 return -1;
277}
278
279static struct tcf_proto_ops cls_basic_ops __read_mostly = {
280 .kind = "basic",
281 .classify = basic_classify,
282 .init = basic_init,
283 .destroy = basic_destroy,
284 .get = basic_get,
285 .put = basic_put,
286 .change = basic_change,
287 .delete = basic_delete,
288 .walk = basic_walk,
289 .dump = basic_dump,
290 .owner = THIS_MODULE,
291};
292
293static int __init init_basic(void)
294{
295 return register_tcf_proto_ops(&cls_basic_ops);
296}
297
298static void __exit exit_basic(void)
299{
300 unregister_tcf_proto_ops(&cls_basic_ops);
301}
302
303module_init(init_basic)
304module_exit(exit_basic)
305MODULE_LICENSE("GPL");
306
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * net/sched/cls_basic.c Basic Packet Classifier.
4 *
5 * Authors: Thomas Graf <tgraf@suug.ch>
6 */
7
8#include <linux/module.h>
9#include <linux/slab.h>
10#include <linux/types.h>
11#include <linux/kernel.h>
12#include <linux/string.h>
13#include <linux/errno.h>
14#include <linux/rtnetlink.h>
15#include <linux/skbuff.h>
16#include <linux/idr.h>
17#include <linux/percpu.h>
18#include <net/netlink.h>
19#include <net/act_api.h>
20#include <net/pkt_cls.h>
21#include <net/tc_wrapper.h>
22
23struct basic_head {
24 struct list_head flist;
25 struct idr handle_idr;
26 struct rcu_head rcu;
27};
28
29struct basic_filter {
30 u32 handle;
31 struct tcf_exts exts;
32 struct tcf_ematch_tree ematches;
33 struct tcf_result res;
34 struct tcf_proto *tp;
35 struct list_head link;
36 struct tc_basic_pcnt __percpu *pf;
37 struct rcu_work rwork;
38};
39
40TC_INDIRECT_SCOPE int basic_classify(struct sk_buff *skb,
41 const struct tcf_proto *tp,
42 struct tcf_result *res)
43{
44 int r;
45 struct basic_head *head = rcu_dereference_bh(tp->root);
46 struct basic_filter *f;
47
48 list_for_each_entry_rcu(f, &head->flist, link) {
49 __this_cpu_inc(f->pf->rcnt);
50 if (!tcf_em_tree_match(skb, &f->ematches, NULL))
51 continue;
52 __this_cpu_inc(f->pf->rhit);
53 *res = f->res;
54 r = tcf_exts_exec(skb, &f->exts, res);
55 if (r < 0)
56 continue;
57 return r;
58 }
59 return -1;
60}
61
62static void *basic_get(struct tcf_proto *tp, u32 handle)
63{
64 struct basic_head *head = rtnl_dereference(tp->root);
65 struct basic_filter *f;
66
67 list_for_each_entry(f, &head->flist, link) {
68 if (f->handle == handle) {
69 return f;
70 }
71 }
72
73 return NULL;
74}
75
76static int basic_init(struct tcf_proto *tp)
77{
78 struct basic_head *head;
79
80 head = kzalloc(sizeof(*head), GFP_KERNEL);
81 if (head == NULL)
82 return -ENOBUFS;
83 INIT_LIST_HEAD(&head->flist);
84 idr_init(&head->handle_idr);
85 rcu_assign_pointer(tp->root, head);
86 return 0;
87}
88
89static void __basic_delete_filter(struct basic_filter *f)
90{
91 tcf_exts_destroy(&f->exts);
92 tcf_em_tree_destroy(&f->ematches);
93 tcf_exts_put_net(&f->exts);
94 free_percpu(f->pf);
95 kfree(f);
96}
97
98static void basic_delete_filter_work(struct work_struct *work)
99{
100 struct basic_filter *f = container_of(to_rcu_work(work),
101 struct basic_filter,
102 rwork);
103 rtnl_lock();
104 __basic_delete_filter(f);
105 rtnl_unlock();
106}
107
108static void basic_destroy(struct tcf_proto *tp, bool rtnl_held,
109 struct netlink_ext_ack *extack)
110{
111 struct basic_head *head = rtnl_dereference(tp->root);
112 struct basic_filter *f, *n;
113
114 list_for_each_entry_safe(f, n, &head->flist, link) {
115 list_del_rcu(&f->link);
116 tcf_unbind_filter(tp, &f->res);
117 idr_remove(&head->handle_idr, f->handle);
118 if (tcf_exts_get_net(&f->exts))
119 tcf_queue_work(&f->rwork, basic_delete_filter_work);
120 else
121 __basic_delete_filter(f);
122 }
123 idr_destroy(&head->handle_idr);
124 kfree_rcu(head, rcu);
125}
126
127static int basic_delete(struct tcf_proto *tp, void *arg, bool *last,
128 bool rtnl_held, struct netlink_ext_ack *extack)
129{
130 struct basic_head *head = rtnl_dereference(tp->root);
131 struct basic_filter *f = arg;
132
133 list_del_rcu(&f->link);
134 tcf_unbind_filter(tp, &f->res);
135 idr_remove(&head->handle_idr, f->handle);
136 tcf_exts_get_net(&f->exts);
137 tcf_queue_work(&f->rwork, basic_delete_filter_work);
138 *last = list_empty(&head->flist);
139 return 0;
140}
141
142static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
143 [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
144 [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
145};
146
147static int basic_set_parms(struct net *net, struct tcf_proto *tp,
148 struct basic_filter *f, unsigned long base,
149 struct nlattr **tb,
150 struct nlattr *est, u32 flags,
151 struct netlink_ext_ack *extack)
152{
153 int err;
154
155 err = tcf_exts_validate(net, tp, tb, est, &f->exts, flags, extack);
156 if (err < 0)
157 return err;
158
159 err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &f->ematches);
160 if (err < 0)
161 return err;
162
163 if (tb[TCA_BASIC_CLASSID]) {
164 f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
165 tcf_bind_filter(tp, &f->res, base);
166 }
167
168 f->tp = tp;
169 return 0;
170}
171
172static int basic_change(struct net *net, struct sk_buff *in_skb,
173 struct tcf_proto *tp, unsigned long base, u32 handle,
174 struct nlattr **tca, void **arg,
175 u32 flags, struct netlink_ext_ack *extack)
176{
177 int err;
178 struct basic_head *head = rtnl_dereference(tp->root);
179 struct nlattr *tb[TCA_BASIC_MAX + 1];
180 struct basic_filter *fold = (struct basic_filter *) *arg;
181 struct basic_filter *fnew;
182
183 if (tca[TCA_OPTIONS] == NULL)
184 return -EINVAL;
185
186 err = nla_parse_nested_deprecated(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
187 basic_policy, NULL);
188 if (err < 0)
189 return err;
190
191 if (fold != NULL) {
192 if (handle && fold->handle != handle)
193 return -EINVAL;
194 }
195
196 fnew = kzalloc(sizeof(*fnew), GFP_KERNEL);
197 if (!fnew)
198 return -ENOBUFS;
199
200 err = tcf_exts_init(&fnew->exts, net, TCA_BASIC_ACT, TCA_BASIC_POLICE);
201 if (err < 0)
202 goto errout;
203
204 if (!handle) {
205 handle = 1;
206 err = idr_alloc_u32(&head->handle_idr, fnew, &handle,
207 INT_MAX, GFP_KERNEL);
208 } else if (!fold) {
209 err = idr_alloc_u32(&head->handle_idr, fnew, &handle,
210 handle, GFP_KERNEL);
211 }
212 if (err)
213 goto errout;
214 fnew->handle = handle;
215 fnew->pf = alloc_percpu(struct tc_basic_pcnt);
216 if (!fnew->pf) {
217 err = -ENOMEM;
218 goto errout;
219 }
220
221 err = basic_set_parms(net, tp, fnew, base, tb, tca[TCA_RATE], flags,
222 extack);
223 if (err < 0) {
224 if (!fold)
225 idr_remove(&head->handle_idr, fnew->handle);
226 goto errout;
227 }
228
229 *arg = fnew;
230
231 if (fold) {
232 idr_replace(&head->handle_idr, fnew, fnew->handle);
233 list_replace_rcu(&fold->link, &fnew->link);
234 tcf_unbind_filter(tp, &fold->res);
235 tcf_exts_get_net(&fold->exts);
236 tcf_queue_work(&fold->rwork, basic_delete_filter_work);
237 } else {
238 list_add_rcu(&fnew->link, &head->flist);
239 }
240
241 return 0;
242errout:
243 free_percpu(fnew->pf);
244 tcf_exts_destroy(&fnew->exts);
245 kfree(fnew);
246 return err;
247}
248
249static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg,
250 bool rtnl_held)
251{
252 struct basic_head *head = rtnl_dereference(tp->root);
253 struct basic_filter *f;
254
255 list_for_each_entry(f, &head->flist, link) {
256 if (!tc_cls_stats_dump(tp, arg, f))
257 break;
258 }
259}
260
261static void basic_bind_class(void *fh, u32 classid, unsigned long cl, void *q,
262 unsigned long base)
263{
264 struct basic_filter *f = fh;
265
266 tc_cls_bind_class(classid, cl, q, &f->res, base);
267}
268
269static int basic_dump(struct net *net, struct tcf_proto *tp, void *fh,
270 struct sk_buff *skb, struct tcmsg *t, bool rtnl_held)
271{
272 struct tc_basic_pcnt gpf = {};
273 struct basic_filter *f = fh;
274 struct nlattr *nest;
275 int cpu;
276
277 if (f == NULL)
278 return skb->len;
279
280 t->tcm_handle = f->handle;
281
282 nest = nla_nest_start_noflag(skb, TCA_OPTIONS);
283 if (nest == NULL)
284 goto nla_put_failure;
285
286 if (f->res.classid &&
287 nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
288 goto nla_put_failure;
289
290 for_each_possible_cpu(cpu) {
291 struct tc_basic_pcnt *pf = per_cpu_ptr(f->pf, cpu);
292
293 gpf.rcnt += pf->rcnt;
294 gpf.rhit += pf->rhit;
295 }
296
297 if (nla_put_64bit(skb, TCA_BASIC_PCNT,
298 sizeof(struct tc_basic_pcnt),
299 &gpf, TCA_BASIC_PAD))
300 goto nla_put_failure;
301
302 if (tcf_exts_dump(skb, &f->exts) < 0 ||
303 tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
304 goto nla_put_failure;
305
306 nla_nest_end(skb, nest);
307
308 if (tcf_exts_dump_stats(skb, &f->exts) < 0)
309 goto nla_put_failure;
310
311 return skb->len;
312
313nla_put_failure:
314 nla_nest_cancel(skb, nest);
315 return -1;
316}
317
318static struct tcf_proto_ops cls_basic_ops __read_mostly = {
319 .kind = "basic",
320 .classify = basic_classify,
321 .init = basic_init,
322 .destroy = basic_destroy,
323 .get = basic_get,
324 .change = basic_change,
325 .delete = basic_delete,
326 .walk = basic_walk,
327 .dump = basic_dump,
328 .bind_class = basic_bind_class,
329 .owner = THIS_MODULE,
330};
331
332static int __init init_basic(void)
333{
334 return register_tcf_proto_ops(&cls_basic_ops);
335}
336
337static void __exit exit_basic(void)
338{
339 unregister_tcf_proto_ops(&cls_basic_ops);
340}
341
342module_init(init_basic)
343module_exit(exit_basic)
344MODULE_LICENSE("GPL");