Loading...
1/*
2 * net/sched/cls_tcindex.c Packet classifier for skb->tc_index
3 *
4 * Written 1998,1999 by Werner Almesberger, EPFL ICA
5 */
6
7#include <linux/module.h>
8#include <linux/types.h>
9#include <linux/kernel.h>
10#include <linux/skbuff.h>
11#include <linux/errno.h>
12#include <linux/slab.h>
13#include <net/act_api.h>
14#include <net/netlink.h>
15#include <net/pkt_cls.h>
16
17/*
18 * Passing parameters to the root seems to be done more awkwardly than really
19 * necessary. At least, u32 doesn't seem to use such dirty hacks. To be
20 * verified. FIXME.
21 */
22
23#define PERFECT_HASH_THRESHOLD 64 /* use perfect hash if not bigger */
24#define DEFAULT_HASH_SIZE 64 /* optimized for diffserv */
25
26
27#define PRIV(tp) ((struct tcindex_data *) (tp)->root)
28
29
30struct tcindex_filter_result {
31 struct tcf_exts exts;
32 struct tcf_result res;
33};
34
35struct tcindex_filter {
36 u16 key;
37 struct tcindex_filter_result result;
38 struct tcindex_filter *next;
39};
40
41
42struct tcindex_data {
43 struct tcindex_filter_result *perfect; /* perfect hash; NULL if none */
44 struct tcindex_filter **h; /* imperfect hash; only used if !perfect;
45 NULL if unused */
46 u16 mask; /* AND key with mask */
47 int shift; /* shift ANDed key to the right */
48 int hash; /* hash table size; 0 if undefined */
49 int alloc_hash; /* allocated size */
50 int fall_through; /* 0: only classify if explicit match */
51};
52
53static const struct tcf_ext_map tcindex_ext_map = {
54 .police = TCA_TCINDEX_POLICE,
55 .action = TCA_TCINDEX_ACT
56};
57
58static inline int
59tcindex_filter_is_set(struct tcindex_filter_result *r)
60{
61 return tcf_exts_is_predicative(&r->exts) || r->res.classid;
62}
63
64static struct tcindex_filter_result *
65tcindex_lookup(struct tcindex_data *p, u16 key)
66{
67 struct tcindex_filter *f;
68
69 if (p->perfect)
70 return tcindex_filter_is_set(p->perfect + key) ?
71 p->perfect + key : NULL;
72 else if (p->h) {
73 for (f = p->h[key % p->hash]; f; f = f->next)
74 if (f->key == key)
75 return &f->result;
76 }
77
78 return NULL;
79}
80
81
82static int tcindex_classify(struct sk_buff *skb, const struct tcf_proto *tp,
83 struct tcf_result *res)
84{
85 struct tcindex_data *p = PRIV(tp);
86 struct tcindex_filter_result *f;
87 int key = (skb->tc_index & p->mask) >> p->shift;
88
89 pr_debug("tcindex_classify(skb %p,tp %p,res %p),p %p\n",
90 skb, tp, res, p);
91
92 f = tcindex_lookup(p, key);
93 if (!f) {
94 if (!p->fall_through)
95 return -1;
96 res->classid = TC_H_MAKE(TC_H_MAJ(tp->q->handle), key);
97 res->class = 0;
98 pr_debug("alg 0x%x\n", res->classid);
99 return 0;
100 }
101 *res = f->res;
102 pr_debug("map 0x%x\n", res->classid);
103
104 return tcf_exts_exec(skb, &f->exts, res);
105}
106
107
108static unsigned long tcindex_get(struct tcf_proto *tp, u32 handle)
109{
110 struct tcindex_data *p = PRIV(tp);
111 struct tcindex_filter_result *r;
112
113 pr_debug("tcindex_get(tp %p,handle 0x%08x)\n", tp, handle);
114 if (p->perfect && handle >= p->alloc_hash)
115 return 0;
116 r = tcindex_lookup(p, handle);
117 return r && tcindex_filter_is_set(r) ? (unsigned long) r : 0UL;
118}
119
120
121static void tcindex_put(struct tcf_proto *tp, unsigned long f)
122{
123 pr_debug("tcindex_put(tp %p,f 0x%lx)\n", tp, f);
124}
125
126
127static int tcindex_init(struct tcf_proto *tp)
128{
129 struct tcindex_data *p;
130
131 pr_debug("tcindex_init(tp %p)\n", tp);
132 p = kzalloc(sizeof(struct tcindex_data), GFP_KERNEL);
133 if (!p)
134 return -ENOMEM;
135
136 p->mask = 0xffff;
137 p->hash = DEFAULT_HASH_SIZE;
138 p->fall_through = 1;
139
140 tp->root = p;
141 return 0;
142}
143
144
145static int
146__tcindex_delete(struct tcf_proto *tp, unsigned long arg, int lock)
147{
148 struct tcindex_data *p = PRIV(tp);
149 struct tcindex_filter_result *r = (struct tcindex_filter_result *) arg;
150 struct tcindex_filter *f = NULL;
151
152 pr_debug("tcindex_delete(tp %p,arg 0x%lx),p %p,f %p\n", tp, arg, p, f);
153 if (p->perfect) {
154 if (!r->res.class)
155 return -ENOENT;
156 } else {
157 int i;
158 struct tcindex_filter **walk = NULL;
159
160 for (i = 0; i < p->hash; i++)
161 for (walk = p->h+i; *walk; walk = &(*walk)->next)
162 if (&(*walk)->result == r)
163 goto found;
164 return -ENOENT;
165
166found:
167 f = *walk;
168 if (lock)
169 tcf_tree_lock(tp);
170 *walk = f->next;
171 if (lock)
172 tcf_tree_unlock(tp);
173 }
174 tcf_unbind_filter(tp, &r->res);
175 tcf_exts_destroy(tp, &r->exts);
176 kfree(f);
177 return 0;
178}
179
180static int tcindex_delete(struct tcf_proto *tp, unsigned long arg)
181{
182 return __tcindex_delete(tp, arg, 1);
183}
184
185static inline int
186valid_perfect_hash(struct tcindex_data *p)
187{
188 return p->hash > (p->mask >> p->shift);
189}
190
191static const struct nla_policy tcindex_policy[TCA_TCINDEX_MAX + 1] = {
192 [TCA_TCINDEX_HASH] = { .type = NLA_U32 },
193 [TCA_TCINDEX_MASK] = { .type = NLA_U16 },
194 [TCA_TCINDEX_SHIFT] = { .type = NLA_U32 },
195 [TCA_TCINDEX_FALL_THROUGH] = { .type = NLA_U32 },
196 [TCA_TCINDEX_CLASSID] = { .type = NLA_U32 },
197};
198
199static int
200tcindex_set_parms(struct tcf_proto *tp, unsigned long base, u32 handle,
201 struct tcindex_data *p, struct tcindex_filter_result *r,
202 struct nlattr **tb, struct nlattr *est)
203{
204 int err, balloc = 0;
205 struct tcindex_filter_result new_filter_result, *old_r = r;
206 struct tcindex_filter_result cr;
207 struct tcindex_data cp;
208 struct tcindex_filter *f = NULL; /* make gcc behave */
209 struct tcf_exts e;
210
211 err = tcf_exts_validate(tp, tb, est, &e, &tcindex_ext_map);
212 if (err < 0)
213 return err;
214
215 memcpy(&cp, p, sizeof(cp));
216 memset(&new_filter_result, 0, sizeof(new_filter_result));
217
218 if (old_r)
219 memcpy(&cr, r, sizeof(cr));
220 else
221 memset(&cr, 0, sizeof(cr));
222
223 if (tb[TCA_TCINDEX_HASH])
224 cp.hash = nla_get_u32(tb[TCA_TCINDEX_HASH]);
225
226 if (tb[TCA_TCINDEX_MASK])
227 cp.mask = nla_get_u16(tb[TCA_TCINDEX_MASK]);
228
229 if (tb[TCA_TCINDEX_SHIFT])
230 cp.shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);
231
232 err = -EBUSY;
233 /* Hash already allocated, make sure that we still meet the
234 * requirements for the allocated hash.
235 */
236 if (cp.perfect) {
237 if (!valid_perfect_hash(&cp) ||
238 cp.hash > cp.alloc_hash)
239 goto errout;
240 } else if (cp.h && cp.hash != cp.alloc_hash)
241 goto errout;
242
243 err = -EINVAL;
244 if (tb[TCA_TCINDEX_FALL_THROUGH])
245 cp.fall_through = nla_get_u32(tb[TCA_TCINDEX_FALL_THROUGH]);
246
247 if (!cp.hash) {
248 /* Hash not specified, use perfect hash if the upper limit
249 * of the hashing index is below the threshold.
250 */
251 if ((cp.mask >> cp.shift) < PERFECT_HASH_THRESHOLD)
252 cp.hash = (cp.mask >> cp.shift) + 1;
253 else
254 cp.hash = DEFAULT_HASH_SIZE;
255 }
256
257 if (!cp.perfect && !cp.h)
258 cp.alloc_hash = cp.hash;
259
260 /* Note: this could be as restrictive as if (handle & ~(mask >> shift))
261 * but then, we'd fail handles that may become valid after some future
262 * mask change. While this is extremely unlikely to ever matter,
263 * the check below is safer (and also more backwards-compatible).
264 */
265 if (cp.perfect || valid_perfect_hash(&cp))
266 if (handle >= cp.alloc_hash)
267 goto errout;
268
269
270 err = -ENOMEM;
271 if (!cp.perfect && !cp.h) {
272 if (valid_perfect_hash(&cp)) {
273 cp.perfect = kcalloc(cp.hash, sizeof(*r), GFP_KERNEL);
274 if (!cp.perfect)
275 goto errout;
276 balloc = 1;
277 } else {
278 cp.h = kcalloc(cp.hash, sizeof(f), GFP_KERNEL);
279 if (!cp.h)
280 goto errout;
281 balloc = 2;
282 }
283 }
284
285 if (cp.perfect)
286 r = cp.perfect + handle;
287 else
288 r = tcindex_lookup(&cp, handle) ? : &new_filter_result;
289
290 if (r == &new_filter_result) {
291 f = kzalloc(sizeof(*f), GFP_KERNEL);
292 if (!f)
293 goto errout_alloc;
294 }
295
296 if (tb[TCA_TCINDEX_CLASSID]) {
297 cr.res.classid = nla_get_u32(tb[TCA_TCINDEX_CLASSID]);
298 tcf_bind_filter(tp, &cr.res, base);
299 }
300
301 tcf_exts_change(tp, &cr.exts, &e);
302
303 tcf_tree_lock(tp);
304 if (old_r && old_r != r)
305 memset(old_r, 0, sizeof(*old_r));
306
307 memcpy(p, &cp, sizeof(cp));
308 memcpy(r, &cr, sizeof(cr));
309
310 if (r == &new_filter_result) {
311 struct tcindex_filter **fp;
312
313 f->key = handle;
314 f->result = new_filter_result;
315 f->next = NULL;
316 for (fp = p->h+(handle % p->hash); *fp; fp = &(*fp)->next)
317 /* nothing */;
318 *fp = f;
319 }
320 tcf_tree_unlock(tp);
321
322 return 0;
323
324errout_alloc:
325 if (balloc == 1)
326 kfree(cp.perfect);
327 else if (balloc == 2)
328 kfree(cp.h);
329errout:
330 tcf_exts_destroy(tp, &e);
331 return err;
332}
333
334static int
335tcindex_change(struct tcf_proto *tp, unsigned long base, u32 handle,
336 struct nlattr **tca, unsigned long *arg)
337{
338 struct nlattr *opt = tca[TCA_OPTIONS];
339 struct nlattr *tb[TCA_TCINDEX_MAX + 1];
340 struct tcindex_data *p = PRIV(tp);
341 struct tcindex_filter_result *r = (struct tcindex_filter_result *) *arg;
342 int err;
343
344 pr_debug("tcindex_change(tp %p,handle 0x%08x,tca %p,arg %p),opt %p,"
345 "p %p,r %p,*arg 0x%lx\n",
346 tp, handle, tca, arg, opt, p, r, arg ? *arg : 0L);
347
348 if (!opt)
349 return 0;
350
351 err = nla_parse_nested(tb, TCA_TCINDEX_MAX, opt, tcindex_policy);
352 if (err < 0)
353 return err;
354
355 return tcindex_set_parms(tp, base, handle, p, r, tb, tca[TCA_RATE]);
356}
357
358
359static void tcindex_walk(struct tcf_proto *tp, struct tcf_walker *walker)
360{
361 struct tcindex_data *p = PRIV(tp);
362 struct tcindex_filter *f, *next;
363 int i;
364
365 pr_debug("tcindex_walk(tp %p,walker %p),p %p\n", tp, walker, p);
366 if (p->perfect) {
367 for (i = 0; i < p->hash; i++) {
368 if (!p->perfect[i].res.class)
369 continue;
370 if (walker->count >= walker->skip) {
371 if (walker->fn(tp,
372 (unsigned long) (p->perfect+i), walker)
373 < 0) {
374 walker->stop = 1;
375 return;
376 }
377 }
378 walker->count++;
379 }
380 }
381 if (!p->h)
382 return;
383 for (i = 0; i < p->hash; i++) {
384 for (f = p->h[i]; f; f = next) {
385 next = f->next;
386 if (walker->count >= walker->skip) {
387 if (walker->fn(tp, (unsigned long) &f->result,
388 walker) < 0) {
389 walker->stop = 1;
390 return;
391 }
392 }
393 walker->count++;
394 }
395 }
396}
397
398
399static int tcindex_destroy_element(struct tcf_proto *tp,
400 unsigned long arg, struct tcf_walker *walker)
401{
402 return __tcindex_delete(tp, arg, 0);
403}
404
405
406static void tcindex_destroy(struct tcf_proto *tp)
407{
408 struct tcindex_data *p = PRIV(tp);
409 struct tcf_walker walker;
410
411 pr_debug("tcindex_destroy(tp %p),p %p\n", tp, p);
412 walker.count = 0;
413 walker.skip = 0;
414 walker.fn = &tcindex_destroy_element;
415 tcindex_walk(tp, &walker);
416 kfree(p->perfect);
417 kfree(p->h);
418 kfree(p);
419 tp->root = NULL;
420}
421
422
423static int tcindex_dump(struct tcf_proto *tp, unsigned long fh,
424 struct sk_buff *skb, struct tcmsg *t)
425{
426 struct tcindex_data *p = PRIV(tp);
427 struct tcindex_filter_result *r = (struct tcindex_filter_result *) fh;
428 unsigned char *b = skb_tail_pointer(skb);
429 struct nlattr *nest;
430
431 pr_debug("tcindex_dump(tp %p,fh 0x%lx,skb %p,t %p),p %p,r %p,b %p\n",
432 tp, fh, skb, t, p, r, b);
433 pr_debug("p->perfect %p p->h %p\n", p->perfect, p->h);
434
435 nest = nla_nest_start(skb, TCA_OPTIONS);
436 if (nest == NULL)
437 goto nla_put_failure;
438
439 if (!fh) {
440 t->tcm_handle = ~0; /* whatever ... */
441 if (nla_put_u32(skb, TCA_TCINDEX_HASH, p->hash) ||
442 nla_put_u16(skb, TCA_TCINDEX_MASK, p->mask) ||
443 nla_put_u32(skb, TCA_TCINDEX_SHIFT, p->shift) ||
444 nla_put_u32(skb, TCA_TCINDEX_FALL_THROUGH, p->fall_through))
445 goto nla_put_failure;
446 nla_nest_end(skb, nest);
447 } else {
448 if (p->perfect) {
449 t->tcm_handle = r-p->perfect;
450 } else {
451 struct tcindex_filter *f;
452 int i;
453
454 t->tcm_handle = 0;
455 for (i = 0; !t->tcm_handle && i < p->hash; i++) {
456 for (f = p->h[i]; !t->tcm_handle && f;
457 f = f->next) {
458 if (&f->result == r)
459 t->tcm_handle = f->key;
460 }
461 }
462 }
463 pr_debug("handle = %d\n", t->tcm_handle);
464 if (r->res.class &&
465 nla_put_u32(skb, TCA_TCINDEX_CLASSID, r->res.classid))
466 goto nla_put_failure;
467
468 if (tcf_exts_dump(skb, &r->exts, &tcindex_ext_map) < 0)
469 goto nla_put_failure;
470 nla_nest_end(skb, nest);
471
472 if (tcf_exts_dump_stats(skb, &r->exts, &tcindex_ext_map) < 0)
473 goto nla_put_failure;
474 }
475
476 return skb->len;
477
478nla_put_failure:
479 nlmsg_trim(skb, b);
480 return -1;
481}
482
483static struct tcf_proto_ops cls_tcindex_ops __read_mostly = {
484 .kind = "tcindex",
485 .classify = tcindex_classify,
486 .init = tcindex_init,
487 .destroy = tcindex_destroy,
488 .get = tcindex_get,
489 .put = tcindex_put,
490 .change = tcindex_change,
491 .delete = tcindex_delete,
492 .walk = tcindex_walk,
493 .dump = tcindex_dump,
494 .owner = THIS_MODULE,
495};
496
497static int __init init_tcindex(void)
498{
499 return register_tcf_proto_ops(&cls_tcindex_ops);
500}
501
502static void __exit exit_tcindex(void)
503{
504 unregister_tcf_proto_ops(&cls_tcindex_ops);
505}
506
507module_init(init_tcindex)
508module_exit(exit_tcindex)
509MODULE_LICENSE("GPL");
1// SPDX-License-Identifier: GPL-2.0-only
2/*
3 * net/sched/cls_tcindex.c Packet classifier for skb->tc_index
4 *
5 * Written 1998,1999 by Werner Almesberger, EPFL ICA
6 */
7
8#include <linux/module.h>
9#include <linux/types.h>
10#include <linux/kernel.h>
11#include <linux/skbuff.h>
12#include <linux/errno.h>
13#include <linux/slab.h>
14#include <linux/refcount.h>
15#include <linux/rcupdate.h>
16#include <net/act_api.h>
17#include <net/netlink.h>
18#include <net/pkt_cls.h>
19#include <net/sch_generic.h>
20#include <net/tc_wrapper.h>
21
22/*
23 * Passing parameters to the root seems to be done more awkwardly than really
24 * necessary. At least, u32 doesn't seem to use such dirty hacks. To be
25 * verified. FIXME.
26 */
27
28#define PERFECT_HASH_THRESHOLD 64 /* use perfect hash if not bigger */
29#define DEFAULT_HASH_SIZE 64 /* optimized for diffserv */
30
31
32struct tcindex_data;
33
34struct tcindex_filter_result {
35 struct tcf_exts exts;
36 struct tcf_result res;
37 struct tcindex_data *p;
38 struct rcu_work rwork;
39};
40
41struct tcindex_filter {
42 u16 key;
43 struct tcindex_filter_result result;
44 struct tcindex_filter __rcu *next;
45 struct rcu_work rwork;
46};
47
48
49struct tcindex_data {
50 struct tcindex_filter_result *perfect; /* perfect hash; NULL if none */
51 struct tcindex_filter __rcu **h; /* imperfect hash; */
52 struct tcf_proto *tp;
53 u16 mask; /* AND key with mask */
54 u32 shift; /* shift ANDed key to the right */
55 u32 hash; /* hash table size; 0 if undefined */
56 u32 alloc_hash; /* allocated size */
57 u32 fall_through; /* 0: only classify if explicit match */
58 refcount_t refcnt; /* a temporary refcnt for perfect hash */
59 struct rcu_work rwork;
60};
61
62static inline int tcindex_filter_is_set(struct tcindex_filter_result *r)
63{
64 return tcf_exts_has_actions(&r->exts) || r->res.classid;
65}
66
67static void tcindex_data_get(struct tcindex_data *p)
68{
69 refcount_inc(&p->refcnt);
70}
71
72static void tcindex_data_put(struct tcindex_data *p)
73{
74 if (refcount_dec_and_test(&p->refcnt)) {
75 kfree(p->perfect);
76 kfree(p->h);
77 kfree(p);
78 }
79}
80
81static struct tcindex_filter_result *tcindex_lookup(struct tcindex_data *p,
82 u16 key)
83{
84 if (p->perfect) {
85 struct tcindex_filter_result *f = p->perfect + key;
86
87 return tcindex_filter_is_set(f) ? f : NULL;
88 } else if (p->h) {
89 struct tcindex_filter __rcu **fp;
90 struct tcindex_filter *f;
91
92 fp = &p->h[key % p->hash];
93 for (f = rcu_dereference_bh_rtnl(*fp);
94 f;
95 fp = &f->next, f = rcu_dereference_bh_rtnl(*fp))
96 if (f->key == key)
97 return &f->result;
98 }
99
100 return NULL;
101}
102
103TC_INDIRECT_SCOPE int tcindex_classify(struct sk_buff *skb,
104 const struct tcf_proto *tp,
105 struct tcf_result *res)
106{
107 struct tcindex_data *p = rcu_dereference_bh(tp->root);
108 struct tcindex_filter_result *f;
109 int key = (skb->tc_index & p->mask) >> p->shift;
110
111 pr_debug("tcindex_classify(skb %p,tp %p,res %p),p %p\n",
112 skb, tp, res, p);
113
114 f = tcindex_lookup(p, key);
115 if (!f) {
116 struct Qdisc *q = tcf_block_q(tp->chain->block);
117
118 if (!p->fall_through)
119 return -1;
120 res->classid = TC_H_MAKE(TC_H_MAJ(q->handle), key);
121 res->class = 0;
122 pr_debug("alg 0x%x\n", res->classid);
123 return 0;
124 }
125 *res = f->res;
126 pr_debug("map 0x%x\n", res->classid);
127
128 return tcf_exts_exec(skb, &f->exts, res);
129}
130
131
132static void *tcindex_get(struct tcf_proto *tp, u32 handle)
133{
134 struct tcindex_data *p = rtnl_dereference(tp->root);
135 struct tcindex_filter_result *r;
136
137 pr_debug("tcindex_get(tp %p,handle 0x%08x)\n", tp, handle);
138 if (p->perfect && handle >= p->alloc_hash)
139 return NULL;
140 r = tcindex_lookup(p, handle);
141 return r && tcindex_filter_is_set(r) ? r : NULL;
142}
143
144static int tcindex_init(struct tcf_proto *tp)
145{
146 struct tcindex_data *p;
147
148 pr_debug("tcindex_init(tp %p)\n", tp);
149 p = kzalloc(sizeof(struct tcindex_data), GFP_KERNEL);
150 if (!p)
151 return -ENOMEM;
152
153 p->mask = 0xffff;
154 p->hash = DEFAULT_HASH_SIZE;
155 p->fall_through = 1;
156 refcount_set(&p->refcnt, 1); /* Paired with tcindex_destroy_work() */
157
158 rcu_assign_pointer(tp->root, p);
159 return 0;
160}
161
162static void __tcindex_destroy_rexts(struct tcindex_filter_result *r)
163{
164 tcf_exts_destroy(&r->exts);
165 tcf_exts_put_net(&r->exts);
166 tcindex_data_put(r->p);
167}
168
169static void tcindex_destroy_rexts_work(struct work_struct *work)
170{
171 struct tcindex_filter_result *r;
172
173 r = container_of(to_rcu_work(work),
174 struct tcindex_filter_result,
175 rwork);
176 rtnl_lock();
177 __tcindex_destroy_rexts(r);
178 rtnl_unlock();
179}
180
181static void __tcindex_destroy_fexts(struct tcindex_filter *f)
182{
183 tcf_exts_destroy(&f->result.exts);
184 tcf_exts_put_net(&f->result.exts);
185 kfree(f);
186}
187
188static void tcindex_destroy_fexts_work(struct work_struct *work)
189{
190 struct tcindex_filter *f = container_of(to_rcu_work(work),
191 struct tcindex_filter,
192 rwork);
193
194 rtnl_lock();
195 __tcindex_destroy_fexts(f);
196 rtnl_unlock();
197}
198
199static int tcindex_delete(struct tcf_proto *tp, void *arg, bool *last,
200 bool rtnl_held, struct netlink_ext_ack *extack)
201{
202 struct tcindex_data *p = rtnl_dereference(tp->root);
203 struct tcindex_filter_result *r = arg;
204 struct tcindex_filter __rcu **walk;
205 struct tcindex_filter *f = NULL;
206
207 pr_debug("tcindex_delete(tp %p,arg %p),p %p\n", tp, arg, p);
208 if (p->perfect) {
209 if (!r->res.class)
210 return -ENOENT;
211 } else {
212 int i;
213
214 for (i = 0; i < p->hash; i++) {
215 walk = p->h + i;
216 for (f = rtnl_dereference(*walk); f;
217 walk = &f->next, f = rtnl_dereference(*walk)) {
218 if (&f->result == r)
219 goto found;
220 }
221 }
222 return -ENOENT;
223
224found:
225 rcu_assign_pointer(*walk, rtnl_dereference(f->next));
226 }
227 tcf_unbind_filter(tp, &r->res);
228 /* all classifiers are required to call tcf_exts_destroy() after rcu
229 * grace period, since converted-to-rcu actions are relying on that
230 * in cleanup() callback
231 */
232 if (f) {
233 if (tcf_exts_get_net(&f->result.exts))
234 tcf_queue_work(&f->rwork, tcindex_destroy_fexts_work);
235 else
236 __tcindex_destroy_fexts(f);
237 } else {
238 tcindex_data_get(p);
239
240 if (tcf_exts_get_net(&r->exts))
241 tcf_queue_work(&r->rwork, tcindex_destroy_rexts_work);
242 else
243 __tcindex_destroy_rexts(r);
244 }
245
246 *last = false;
247 return 0;
248}
249
250static void tcindex_destroy_work(struct work_struct *work)
251{
252 struct tcindex_data *p = container_of(to_rcu_work(work),
253 struct tcindex_data,
254 rwork);
255
256 tcindex_data_put(p);
257}
258
259static inline int
260valid_perfect_hash(struct tcindex_data *p)
261{
262 return p->hash > (p->mask >> p->shift);
263}
264
265static const struct nla_policy tcindex_policy[TCA_TCINDEX_MAX + 1] = {
266 [TCA_TCINDEX_HASH] = { .type = NLA_U32 },
267 [TCA_TCINDEX_MASK] = { .type = NLA_U16 },
268 [TCA_TCINDEX_SHIFT] = { .type = NLA_U32 },
269 [TCA_TCINDEX_FALL_THROUGH] = { .type = NLA_U32 },
270 [TCA_TCINDEX_CLASSID] = { .type = NLA_U32 },
271};
272
273static int tcindex_filter_result_init(struct tcindex_filter_result *r,
274 struct tcindex_data *p,
275 struct net *net)
276{
277 memset(r, 0, sizeof(*r));
278 r->p = p;
279 return tcf_exts_init(&r->exts, net, TCA_TCINDEX_ACT,
280 TCA_TCINDEX_POLICE);
281}
282
283static void tcindex_free_perfect_hash(struct tcindex_data *cp);
284
285static void tcindex_partial_destroy_work(struct work_struct *work)
286{
287 struct tcindex_data *p = container_of(to_rcu_work(work),
288 struct tcindex_data,
289 rwork);
290
291 rtnl_lock();
292 if (p->perfect)
293 tcindex_free_perfect_hash(p);
294 kfree(p);
295 rtnl_unlock();
296}
297
298static void tcindex_free_perfect_hash(struct tcindex_data *cp)
299{
300 int i;
301
302 for (i = 0; i < cp->hash; i++)
303 tcf_exts_destroy(&cp->perfect[i].exts);
304 kfree(cp->perfect);
305}
306
307static int tcindex_alloc_perfect_hash(struct net *net, struct tcindex_data *cp)
308{
309 int i, err = 0;
310
311 cp->perfect = kcalloc(cp->hash, sizeof(struct tcindex_filter_result),
312 GFP_KERNEL | __GFP_NOWARN);
313 if (!cp->perfect)
314 return -ENOMEM;
315
316 for (i = 0; i < cp->hash; i++) {
317 err = tcf_exts_init(&cp->perfect[i].exts, net,
318 TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
319 if (err < 0)
320 goto errout;
321 cp->perfect[i].p = cp;
322 }
323
324 return 0;
325
326errout:
327 tcindex_free_perfect_hash(cp);
328 return err;
329}
330
331static int
332tcindex_set_parms(struct net *net, struct tcf_proto *tp, unsigned long base,
333 u32 handle, struct tcindex_data *p,
334 struct tcindex_filter_result *r, struct nlattr **tb,
335 struct nlattr *est, u32 flags, struct netlink_ext_ack *extack)
336{
337 struct tcindex_filter_result new_filter_result;
338 struct tcindex_data *cp = NULL, *oldp;
339 struct tcindex_filter *f = NULL; /* make gcc behave */
340 struct tcf_result cr = {};
341 int err, balloc = 0;
342 struct tcf_exts e;
343 bool update_h = false;
344
345 err = tcf_exts_init(&e, net, TCA_TCINDEX_ACT, TCA_TCINDEX_POLICE);
346 if (err < 0)
347 return err;
348 err = tcf_exts_validate(net, tp, tb, est, &e, flags, extack);
349 if (err < 0)
350 goto errout;
351
352 err = -ENOMEM;
353 /* tcindex_data attributes must look atomic to classifier/lookup so
354 * allocate new tcindex data and RCU assign it onto root. Keeping
355 * perfect hash and hash pointers from old data.
356 */
357 cp = kzalloc(sizeof(*cp), GFP_KERNEL);
358 if (!cp)
359 goto errout;
360
361 cp->mask = p->mask;
362 cp->shift = p->shift;
363 cp->hash = p->hash;
364 cp->alloc_hash = p->alloc_hash;
365 cp->fall_through = p->fall_through;
366 cp->tp = tp;
367 refcount_set(&cp->refcnt, 1); /* Paired with tcindex_destroy_work() */
368
369 if (tb[TCA_TCINDEX_HASH])
370 cp->hash = nla_get_u32(tb[TCA_TCINDEX_HASH]);
371
372 if (tb[TCA_TCINDEX_MASK])
373 cp->mask = nla_get_u16(tb[TCA_TCINDEX_MASK]);
374
375 if (tb[TCA_TCINDEX_SHIFT]) {
376 cp->shift = nla_get_u32(tb[TCA_TCINDEX_SHIFT]);
377 if (cp->shift > 16) {
378 err = -EINVAL;
379 goto errout;
380 }
381 }
382 if (!cp->hash) {
383 /* Hash not specified, use perfect hash if the upper limit
384 * of the hashing index is below the threshold.
385 */
386 if ((cp->mask >> cp->shift) < PERFECT_HASH_THRESHOLD)
387 cp->hash = (cp->mask >> cp->shift) + 1;
388 else
389 cp->hash = DEFAULT_HASH_SIZE;
390 }
391
392 if (p->perfect) {
393 int i;
394
395 if (tcindex_alloc_perfect_hash(net, cp) < 0)
396 goto errout;
397 cp->alloc_hash = cp->hash;
398 for (i = 0; i < min(cp->hash, p->hash); i++)
399 cp->perfect[i].res = p->perfect[i].res;
400 balloc = 1;
401 }
402 cp->h = p->h;
403
404 err = tcindex_filter_result_init(&new_filter_result, cp, net);
405 if (err < 0)
406 goto errout_alloc;
407 if (r)
408 cr = r->res;
409
410 err = -EBUSY;
411
412 /* Hash already allocated, make sure that we still meet the
413 * requirements for the allocated hash.
414 */
415 if (cp->perfect) {
416 if (!valid_perfect_hash(cp) ||
417 cp->hash > cp->alloc_hash)
418 goto errout_alloc;
419 } else if (cp->h && cp->hash != cp->alloc_hash) {
420 goto errout_alloc;
421 }
422
423 err = -EINVAL;
424 if (tb[TCA_TCINDEX_FALL_THROUGH])
425 cp->fall_through = nla_get_u32(tb[TCA_TCINDEX_FALL_THROUGH]);
426
427 if (!cp->perfect && !cp->h)
428 cp->alloc_hash = cp->hash;
429
430 /* Note: this could be as restrictive as if (handle & ~(mask >> shift))
431 * but then, we'd fail handles that may become valid after some future
432 * mask change. While this is extremely unlikely to ever matter,
433 * the check below is safer (and also more backwards-compatible).
434 */
435 if (cp->perfect || valid_perfect_hash(cp))
436 if (handle >= cp->alloc_hash)
437 goto errout_alloc;
438
439
440 err = -ENOMEM;
441 if (!cp->perfect && !cp->h) {
442 if (valid_perfect_hash(cp)) {
443 if (tcindex_alloc_perfect_hash(net, cp) < 0)
444 goto errout_alloc;
445 balloc = 1;
446 } else {
447 struct tcindex_filter __rcu **hash;
448
449 hash = kcalloc(cp->hash,
450 sizeof(struct tcindex_filter *),
451 GFP_KERNEL);
452
453 if (!hash)
454 goto errout_alloc;
455
456 cp->h = hash;
457 balloc = 2;
458 }
459 }
460
461 if (cp->perfect) {
462 r = cp->perfect + handle;
463 } else {
464 /* imperfect area is updated in-place using rcu */
465 update_h = !!tcindex_lookup(cp, handle);
466 r = &new_filter_result;
467 }
468
469 if (r == &new_filter_result) {
470 f = kzalloc(sizeof(*f), GFP_KERNEL);
471 if (!f)
472 goto errout_alloc;
473 f->key = handle;
474 f->next = NULL;
475 err = tcindex_filter_result_init(&f->result, cp, net);
476 if (err < 0) {
477 kfree(f);
478 goto errout_alloc;
479 }
480 }
481
482 if (tb[TCA_TCINDEX_CLASSID]) {
483 cr.classid = nla_get_u32(tb[TCA_TCINDEX_CLASSID]);
484 tcf_bind_filter(tp, &cr, base);
485 }
486
487 oldp = p;
488 r->res = cr;
489 tcf_exts_change(&r->exts, &e);
490
491 rcu_assign_pointer(tp->root, cp);
492
493 if (update_h) {
494 struct tcindex_filter __rcu **fp;
495 struct tcindex_filter *cf;
496
497 f->result.res = r->res;
498 tcf_exts_change(&f->result.exts, &r->exts);
499
500 /* imperfect area bucket */
501 fp = cp->h + (handle % cp->hash);
502
503 /* lookup the filter, guaranteed to exist */
504 for (cf = rcu_dereference_bh_rtnl(*fp); cf;
505 fp = &cf->next, cf = rcu_dereference_bh_rtnl(*fp))
506 if (cf->key == (u16)handle)
507 break;
508
509 f->next = cf->next;
510
511 cf = rcu_replace_pointer(*fp, f, 1);
512 tcf_exts_get_net(&cf->result.exts);
513 tcf_queue_work(&cf->rwork, tcindex_destroy_fexts_work);
514 } else if (r == &new_filter_result) {
515 struct tcindex_filter *nfp;
516 struct tcindex_filter __rcu **fp;
517
518 f->result.res = r->res;
519 tcf_exts_change(&f->result.exts, &r->exts);
520
521 fp = cp->h + (handle % cp->hash);
522 for (nfp = rtnl_dereference(*fp);
523 nfp;
524 fp = &nfp->next, nfp = rtnl_dereference(*fp))
525 ; /* nothing */
526
527 rcu_assign_pointer(*fp, f);
528 } else {
529 tcf_exts_destroy(&new_filter_result.exts);
530 }
531
532 if (oldp)
533 tcf_queue_work(&oldp->rwork, tcindex_partial_destroy_work);
534 return 0;
535
536errout_alloc:
537 if (balloc == 1)
538 tcindex_free_perfect_hash(cp);
539 else if (balloc == 2)
540 kfree(cp->h);
541 tcf_exts_destroy(&new_filter_result.exts);
542errout:
543 kfree(cp);
544 tcf_exts_destroy(&e);
545 return err;
546}
547
548static int
549tcindex_change(struct net *net, struct sk_buff *in_skb,
550 struct tcf_proto *tp, unsigned long base, u32 handle,
551 struct nlattr **tca, void **arg, u32 flags,
552 struct netlink_ext_ack *extack)
553{
554 struct nlattr *opt = tca[TCA_OPTIONS];
555 struct nlattr *tb[TCA_TCINDEX_MAX + 1];
556 struct tcindex_data *p = rtnl_dereference(tp->root);
557 struct tcindex_filter_result *r = *arg;
558 int err;
559
560 pr_debug("tcindex_change(tp %p,handle 0x%08x,tca %p,arg %p),opt %p,"
561 "p %p,r %p,*arg %p\n",
562 tp, handle, tca, arg, opt, p, r, *arg);
563
564 if (!opt)
565 return 0;
566
567 err = nla_parse_nested_deprecated(tb, TCA_TCINDEX_MAX, opt,
568 tcindex_policy, NULL);
569 if (err < 0)
570 return err;
571
572 return tcindex_set_parms(net, tp, base, handle, p, r, tb,
573 tca[TCA_RATE], flags, extack);
574}
575
576static void tcindex_walk(struct tcf_proto *tp, struct tcf_walker *walker,
577 bool rtnl_held)
578{
579 struct tcindex_data *p = rtnl_dereference(tp->root);
580 struct tcindex_filter *f, *next;
581 int i;
582
583 pr_debug("tcindex_walk(tp %p,walker %p),p %p\n", tp, walker, p);
584 if (p->perfect) {
585 for (i = 0; i < p->hash; i++) {
586 if (!p->perfect[i].res.class)
587 continue;
588 if (!tc_cls_stats_dump(tp, walker, p->perfect + i))
589 return;
590 }
591 }
592 if (!p->h)
593 return;
594 for (i = 0; i < p->hash; i++) {
595 for (f = rtnl_dereference(p->h[i]); f; f = next) {
596 next = rtnl_dereference(f->next);
597 if (!tc_cls_stats_dump(tp, walker, &f->result))
598 return;
599 }
600 }
601}
602
603static void tcindex_destroy(struct tcf_proto *tp, bool rtnl_held,
604 struct netlink_ext_ack *extack)
605{
606 struct tcindex_data *p = rtnl_dereference(tp->root);
607 int i;
608
609 pr_debug("tcindex_destroy(tp %p),p %p\n", tp, p);
610
611 if (p->perfect) {
612 for (i = 0; i < p->hash; i++) {
613 struct tcindex_filter_result *r = p->perfect + i;
614
615 /* tcf_queue_work() does not guarantee the ordering we
616 * want, so we have to take this refcnt temporarily to
617 * ensure 'p' is freed after all tcindex_filter_result
618 * here. Imperfect hash does not need this, because it
619 * uses linked lists rather than an array.
620 */
621 tcindex_data_get(p);
622
623 tcf_unbind_filter(tp, &r->res);
624 if (tcf_exts_get_net(&r->exts))
625 tcf_queue_work(&r->rwork,
626 tcindex_destroy_rexts_work);
627 else
628 __tcindex_destroy_rexts(r);
629 }
630 }
631
632 for (i = 0; p->h && i < p->hash; i++) {
633 struct tcindex_filter *f, *next;
634 bool last;
635
636 for (f = rtnl_dereference(p->h[i]); f; f = next) {
637 next = rtnl_dereference(f->next);
638 tcindex_delete(tp, &f->result, &last, rtnl_held, NULL);
639 }
640 }
641
642 tcf_queue_work(&p->rwork, tcindex_destroy_work);
643}
644
645
646static int tcindex_dump(struct net *net, struct tcf_proto *tp, void *fh,
647 struct sk_buff *skb, struct tcmsg *t, bool rtnl_held)
648{
649 struct tcindex_data *p = rtnl_dereference(tp->root);
650 struct tcindex_filter_result *r = fh;
651 struct nlattr *nest;
652
653 pr_debug("tcindex_dump(tp %p,fh %p,skb %p,t %p),p %p,r %p\n",
654 tp, fh, skb, t, p, r);
655 pr_debug("p->perfect %p p->h %p\n", p->perfect, p->h);
656
657 nest = nla_nest_start_noflag(skb, TCA_OPTIONS);
658 if (nest == NULL)
659 goto nla_put_failure;
660
661 if (!fh) {
662 t->tcm_handle = ~0; /* whatever ... */
663 if (nla_put_u32(skb, TCA_TCINDEX_HASH, p->hash) ||
664 nla_put_u16(skb, TCA_TCINDEX_MASK, p->mask) ||
665 nla_put_u32(skb, TCA_TCINDEX_SHIFT, p->shift) ||
666 nla_put_u32(skb, TCA_TCINDEX_FALL_THROUGH, p->fall_through))
667 goto nla_put_failure;
668 nla_nest_end(skb, nest);
669 } else {
670 if (p->perfect) {
671 t->tcm_handle = r - p->perfect;
672 } else {
673 struct tcindex_filter *f;
674 struct tcindex_filter __rcu **fp;
675 int i;
676
677 t->tcm_handle = 0;
678 for (i = 0; !t->tcm_handle && i < p->hash; i++) {
679 fp = &p->h[i];
680 for (f = rtnl_dereference(*fp);
681 !t->tcm_handle && f;
682 fp = &f->next, f = rtnl_dereference(*fp)) {
683 if (&f->result == r)
684 t->tcm_handle = f->key;
685 }
686 }
687 }
688 pr_debug("handle = %d\n", t->tcm_handle);
689 if (r->res.class &&
690 nla_put_u32(skb, TCA_TCINDEX_CLASSID, r->res.classid))
691 goto nla_put_failure;
692
693 if (tcf_exts_dump(skb, &r->exts) < 0)
694 goto nla_put_failure;
695 nla_nest_end(skb, nest);
696
697 if (tcf_exts_dump_stats(skb, &r->exts) < 0)
698 goto nla_put_failure;
699 }
700
701 return skb->len;
702
703nla_put_failure:
704 nla_nest_cancel(skb, nest);
705 return -1;
706}
707
708static void tcindex_bind_class(void *fh, u32 classid, unsigned long cl,
709 void *q, unsigned long base)
710{
711 struct tcindex_filter_result *r = fh;
712
713 tc_cls_bind_class(classid, cl, q, &r->res, base);
714}
715
716static struct tcf_proto_ops cls_tcindex_ops __read_mostly = {
717 .kind = "tcindex",
718 .classify = tcindex_classify,
719 .init = tcindex_init,
720 .destroy = tcindex_destroy,
721 .get = tcindex_get,
722 .change = tcindex_change,
723 .delete = tcindex_delete,
724 .walk = tcindex_walk,
725 .dump = tcindex_dump,
726 .bind_class = tcindex_bind_class,
727 .owner = THIS_MODULE,
728};
729
730static int __init init_tcindex(void)
731{
732 return register_tcf_proto_ops(&cls_tcindex_ops);
733}
734
735static void __exit exit_tcindex(void)
736{
737 unregister_tcf_proto_ops(&cls_tcindex_ops);
738}
739
740module_init(init_tcindex)
741module_exit(exit_tcindex)
742MODULE_LICENSE("GPL");