Loading...
1/*
2 * net/sched/act_api.c Packet action API.
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 * Author: Jamal Hadi Salim
10 *
11 *
12 */
13
14#include <linux/types.h>
15#include <linux/kernel.h>
16#include <linux/string.h>
17#include <linux/errno.h>
18#include <linux/slab.h>
19#include <linux/skbuff.h>
20#include <linux/init.h>
21#include <linux/kmod.h>
22#include <linux/err.h>
23#include <linux/module.h>
24#include <net/net_namespace.h>
25#include <net/sock.h>
26#include <net/sch_generic.h>
27#include <net/act_api.h>
28#include <net/netlink.h>
29
30void tcf_hash_destroy(struct tcf_common *p, struct tcf_hashinfo *hinfo)
31{
32 unsigned int h = tcf_hash(p->tcfc_index, hinfo->hmask);
33 struct tcf_common **p1p;
34
35 for (p1p = &hinfo->htab[h]; *p1p; p1p = &(*p1p)->tcfc_next) {
36 if (*p1p == p) {
37 write_lock_bh(hinfo->lock);
38 *p1p = p->tcfc_next;
39 write_unlock_bh(hinfo->lock);
40 gen_kill_estimator(&p->tcfc_bstats,
41 &p->tcfc_rate_est);
42 /*
43 * gen_estimator est_timer() might access p->tcfc_lock
44 * or bstats, wait a RCU grace period before freeing p
45 */
46 kfree_rcu(p, tcfc_rcu);
47 return;
48 }
49 }
50 WARN_ON(1);
51}
52EXPORT_SYMBOL(tcf_hash_destroy);
53
54int tcf_hash_release(struct tcf_common *p, int bind,
55 struct tcf_hashinfo *hinfo)
56{
57 int ret = 0;
58
59 if (p) {
60 if (bind)
61 p->tcfc_bindcnt--;
62
63 p->tcfc_refcnt--;
64 if (p->tcfc_bindcnt <= 0 && p->tcfc_refcnt <= 0) {
65 tcf_hash_destroy(p, hinfo);
66 ret = 1;
67 }
68 }
69 return ret;
70}
71EXPORT_SYMBOL(tcf_hash_release);
72
73static int tcf_dump_walker(struct sk_buff *skb, struct netlink_callback *cb,
74 struct tc_action *a, struct tcf_hashinfo *hinfo)
75{
76 struct tcf_common *p;
77 int err = 0, index = -1, i = 0, s_i = 0, n_i = 0;
78 struct nlattr *nest;
79
80 read_lock_bh(hinfo->lock);
81
82 s_i = cb->args[0];
83
84 for (i = 0; i < (hinfo->hmask + 1); i++) {
85 p = hinfo->htab[tcf_hash(i, hinfo->hmask)];
86
87 for (; p; p = p->tcfc_next) {
88 index++;
89 if (index < s_i)
90 continue;
91 a->priv = p;
92 a->order = n_i;
93
94 nest = nla_nest_start(skb, a->order);
95 if (nest == NULL)
96 goto nla_put_failure;
97 err = tcf_action_dump_1(skb, a, 0, 0);
98 if (err < 0) {
99 index--;
100 nlmsg_trim(skb, nest);
101 goto done;
102 }
103 nla_nest_end(skb, nest);
104 n_i++;
105 if (n_i >= TCA_ACT_MAX_PRIO)
106 goto done;
107 }
108 }
109done:
110 read_unlock_bh(hinfo->lock);
111 if (n_i)
112 cb->args[0] += n_i;
113 return n_i;
114
115nla_put_failure:
116 nla_nest_cancel(skb, nest);
117 goto done;
118}
119
120static int tcf_del_walker(struct sk_buff *skb, struct tc_action *a,
121 struct tcf_hashinfo *hinfo)
122{
123 struct tcf_common *p, *s_p;
124 struct nlattr *nest;
125 int i = 0, n_i = 0;
126
127 nest = nla_nest_start(skb, a->order);
128 if (nest == NULL)
129 goto nla_put_failure;
130 if (nla_put_string(skb, TCA_KIND, a->ops->kind))
131 goto nla_put_failure;
132 for (i = 0; i < (hinfo->hmask + 1); i++) {
133 p = hinfo->htab[tcf_hash(i, hinfo->hmask)];
134
135 while (p != NULL) {
136 s_p = p->tcfc_next;
137 if (ACT_P_DELETED == tcf_hash_release(p, 0, hinfo))
138 module_put(a->ops->owner);
139 n_i++;
140 p = s_p;
141 }
142 }
143 if (nla_put_u32(skb, TCA_FCNT, n_i))
144 goto nla_put_failure;
145 nla_nest_end(skb, nest);
146
147 return n_i;
148nla_put_failure:
149 nla_nest_cancel(skb, nest);
150 return -EINVAL;
151}
152
153int tcf_generic_walker(struct sk_buff *skb, struct netlink_callback *cb,
154 int type, struct tc_action *a)
155{
156 struct tcf_hashinfo *hinfo = a->ops->hinfo;
157
158 if (type == RTM_DELACTION) {
159 return tcf_del_walker(skb, a, hinfo);
160 } else if (type == RTM_GETACTION) {
161 return tcf_dump_walker(skb, cb, a, hinfo);
162 } else {
163 WARN(1, "tcf_generic_walker: unknown action %d\n", type);
164 return -EINVAL;
165 }
166}
167EXPORT_SYMBOL(tcf_generic_walker);
168
169struct tcf_common *tcf_hash_lookup(u32 index, struct tcf_hashinfo *hinfo)
170{
171 struct tcf_common *p;
172
173 read_lock_bh(hinfo->lock);
174 for (p = hinfo->htab[tcf_hash(index, hinfo->hmask)]; p;
175 p = p->tcfc_next) {
176 if (p->tcfc_index == index)
177 break;
178 }
179 read_unlock_bh(hinfo->lock);
180
181 return p;
182}
183EXPORT_SYMBOL(tcf_hash_lookup);
184
185u32 tcf_hash_new_index(u32 *idx_gen, struct tcf_hashinfo *hinfo)
186{
187 u32 val = *idx_gen;
188
189 do {
190 if (++val == 0)
191 val = 1;
192 } while (tcf_hash_lookup(val, hinfo));
193
194 return (*idx_gen = val);
195}
196EXPORT_SYMBOL(tcf_hash_new_index);
197
198int tcf_hash_search(struct tc_action *a, u32 index)
199{
200 struct tcf_hashinfo *hinfo = a->ops->hinfo;
201 struct tcf_common *p = tcf_hash_lookup(index, hinfo);
202
203 if (p) {
204 a->priv = p;
205 return 1;
206 }
207 return 0;
208}
209EXPORT_SYMBOL(tcf_hash_search);
210
211struct tcf_common *tcf_hash_check(u32 index, struct tc_action *a, int bind,
212 struct tcf_hashinfo *hinfo)
213{
214 struct tcf_common *p = NULL;
215 if (index && (p = tcf_hash_lookup(index, hinfo)) != NULL) {
216 if (bind)
217 p->tcfc_bindcnt++;
218 p->tcfc_refcnt++;
219 a->priv = p;
220 }
221 return p;
222}
223EXPORT_SYMBOL(tcf_hash_check);
224
225struct tcf_common *tcf_hash_create(u32 index, struct nlattr *est,
226 struct tc_action *a, int size, int bind,
227 u32 *idx_gen, struct tcf_hashinfo *hinfo)
228{
229 struct tcf_common *p = kzalloc(size, GFP_KERNEL);
230
231 if (unlikely(!p))
232 return ERR_PTR(-ENOMEM);
233 p->tcfc_refcnt = 1;
234 if (bind)
235 p->tcfc_bindcnt = 1;
236
237 spin_lock_init(&p->tcfc_lock);
238 p->tcfc_index = index ? index : tcf_hash_new_index(idx_gen, hinfo);
239 p->tcfc_tm.install = jiffies;
240 p->tcfc_tm.lastuse = jiffies;
241 if (est) {
242 int err = gen_new_estimator(&p->tcfc_bstats, &p->tcfc_rate_est,
243 &p->tcfc_lock, est);
244 if (err) {
245 kfree(p);
246 return ERR_PTR(err);
247 }
248 }
249
250 a->priv = (void *) p;
251 return p;
252}
253EXPORT_SYMBOL(tcf_hash_create);
254
255void tcf_hash_insert(struct tcf_common *p, struct tcf_hashinfo *hinfo)
256{
257 unsigned int h = tcf_hash(p->tcfc_index, hinfo->hmask);
258
259 write_lock_bh(hinfo->lock);
260 p->tcfc_next = hinfo->htab[h];
261 hinfo->htab[h] = p;
262 write_unlock_bh(hinfo->lock);
263}
264EXPORT_SYMBOL(tcf_hash_insert);
265
266static struct tc_action_ops *act_base = NULL;
267static DEFINE_RWLOCK(act_mod_lock);
268
269int tcf_register_action(struct tc_action_ops *act)
270{
271 struct tc_action_ops *a, **ap;
272
273 write_lock(&act_mod_lock);
274 for (ap = &act_base; (a = *ap) != NULL; ap = &a->next) {
275 if (act->type == a->type || (strcmp(act->kind, a->kind) == 0)) {
276 write_unlock(&act_mod_lock);
277 return -EEXIST;
278 }
279 }
280 act->next = NULL;
281 *ap = act;
282 write_unlock(&act_mod_lock);
283 return 0;
284}
285EXPORT_SYMBOL(tcf_register_action);
286
287int tcf_unregister_action(struct tc_action_ops *act)
288{
289 struct tc_action_ops *a, **ap;
290 int err = -ENOENT;
291
292 write_lock(&act_mod_lock);
293 for (ap = &act_base; (a = *ap) != NULL; ap = &a->next)
294 if (a == act)
295 break;
296 if (a) {
297 *ap = a->next;
298 a->next = NULL;
299 err = 0;
300 }
301 write_unlock(&act_mod_lock);
302 return err;
303}
304EXPORT_SYMBOL(tcf_unregister_action);
305
306/* lookup by name */
307static struct tc_action_ops *tc_lookup_action_n(char *kind)
308{
309 struct tc_action_ops *a = NULL;
310
311 if (kind) {
312 read_lock(&act_mod_lock);
313 for (a = act_base; a; a = a->next) {
314 if (strcmp(kind, a->kind) == 0) {
315 if (!try_module_get(a->owner)) {
316 read_unlock(&act_mod_lock);
317 return NULL;
318 }
319 break;
320 }
321 }
322 read_unlock(&act_mod_lock);
323 }
324 return a;
325}
326
327/* lookup by nlattr */
328static struct tc_action_ops *tc_lookup_action(struct nlattr *kind)
329{
330 struct tc_action_ops *a = NULL;
331
332 if (kind) {
333 read_lock(&act_mod_lock);
334 for (a = act_base; a; a = a->next) {
335 if (nla_strcmp(kind, a->kind) == 0) {
336 if (!try_module_get(a->owner)) {
337 read_unlock(&act_mod_lock);
338 return NULL;
339 }
340 break;
341 }
342 }
343 read_unlock(&act_mod_lock);
344 }
345 return a;
346}
347
348#if 0
349/* lookup by id */
350static struct tc_action_ops *tc_lookup_action_id(u32 type)
351{
352 struct tc_action_ops *a = NULL;
353
354 if (type) {
355 read_lock(&act_mod_lock);
356 for (a = act_base; a; a = a->next) {
357 if (a->type == type) {
358 if (!try_module_get(a->owner)) {
359 read_unlock(&act_mod_lock);
360 return NULL;
361 }
362 break;
363 }
364 }
365 read_unlock(&act_mod_lock);
366 }
367 return a;
368}
369#endif
370
371int tcf_action_exec(struct sk_buff *skb, const struct tc_action *act,
372 struct tcf_result *res)
373{
374 const struct tc_action *a;
375 int ret = -1;
376
377 if (skb->tc_verd & TC_NCLS) {
378 skb->tc_verd = CLR_TC_NCLS(skb->tc_verd);
379 ret = TC_ACT_OK;
380 goto exec_done;
381 }
382 while ((a = act) != NULL) {
383repeat:
384 if (a->ops && a->ops->act) {
385 ret = a->ops->act(skb, a, res);
386 if (TC_MUNGED & skb->tc_verd) {
387 /* copied already, allow trampling */
388 skb->tc_verd = SET_TC_OK2MUNGE(skb->tc_verd);
389 skb->tc_verd = CLR_TC_MUNGED(skb->tc_verd);
390 }
391 if (ret == TC_ACT_REPEAT)
392 goto repeat; /* we need a ttl - JHS */
393 if (ret != TC_ACT_PIPE)
394 goto exec_done;
395 }
396 act = a->next;
397 }
398exec_done:
399 return ret;
400}
401EXPORT_SYMBOL(tcf_action_exec);
402
403void tcf_action_destroy(struct tc_action *act, int bind)
404{
405 struct tc_action *a;
406
407 for (a = act; a; a = act) {
408 if (a->ops && a->ops->cleanup) {
409 if (a->ops->cleanup(a, bind) == ACT_P_DELETED)
410 module_put(a->ops->owner);
411 act = act->next;
412 kfree(a);
413 } else {
414 /*FIXME: Remove later - catch insertion bugs*/
415 WARN(1, "tcf_action_destroy: BUG? destroying NULL ops\n");
416 act = act->next;
417 kfree(a);
418 }
419 }
420}
421
422int
423tcf_action_dump_old(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
424{
425 int err = -EINVAL;
426
427 if (a->ops == NULL || a->ops->dump == NULL)
428 return err;
429 return a->ops->dump(skb, a, bind, ref);
430}
431
432int
433tcf_action_dump_1(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
434{
435 int err = -EINVAL;
436 unsigned char *b = skb_tail_pointer(skb);
437 struct nlattr *nest;
438
439 if (a->ops == NULL || a->ops->dump == NULL)
440 return err;
441
442 if (nla_put_string(skb, TCA_KIND, a->ops->kind))
443 goto nla_put_failure;
444 if (tcf_action_copy_stats(skb, a, 0))
445 goto nla_put_failure;
446 nest = nla_nest_start(skb, TCA_OPTIONS);
447 if (nest == NULL)
448 goto nla_put_failure;
449 err = tcf_action_dump_old(skb, a, bind, ref);
450 if (err > 0) {
451 nla_nest_end(skb, nest);
452 return err;
453 }
454
455nla_put_failure:
456 nlmsg_trim(skb, b);
457 return -1;
458}
459EXPORT_SYMBOL(tcf_action_dump_1);
460
461int
462tcf_action_dump(struct sk_buff *skb, struct tc_action *act, int bind, int ref)
463{
464 struct tc_action *a;
465 int err = -EINVAL;
466 struct nlattr *nest;
467
468 while ((a = act) != NULL) {
469 act = a->next;
470 nest = nla_nest_start(skb, a->order);
471 if (nest == NULL)
472 goto nla_put_failure;
473 err = tcf_action_dump_1(skb, a, bind, ref);
474 if (err < 0)
475 goto errout;
476 nla_nest_end(skb, nest);
477 }
478
479 return 0;
480
481nla_put_failure:
482 err = -EINVAL;
483errout:
484 nla_nest_cancel(skb, nest);
485 return err;
486}
487
488struct tc_action *tcf_action_init_1(struct nlattr *nla, struct nlattr *est,
489 char *name, int ovr, int bind)
490{
491 struct tc_action *a;
492 struct tc_action_ops *a_o;
493 char act_name[IFNAMSIZ];
494 struct nlattr *tb[TCA_ACT_MAX + 1];
495 struct nlattr *kind;
496 int err;
497
498 if (name == NULL) {
499 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
500 if (err < 0)
501 goto err_out;
502 err = -EINVAL;
503 kind = tb[TCA_ACT_KIND];
504 if (kind == NULL)
505 goto err_out;
506 if (nla_strlcpy(act_name, kind, IFNAMSIZ) >= IFNAMSIZ)
507 goto err_out;
508 } else {
509 err = -EINVAL;
510 if (strlcpy(act_name, name, IFNAMSIZ) >= IFNAMSIZ)
511 goto err_out;
512 }
513
514 a_o = tc_lookup_action_n(act_name);
515 if (a_o == NULL) {
516#ifdef CONFIG_MODULES
517 rtnl_unlock();
518 request_module("act_%s", act_name);
519 rtnl_lock();
520
521 a_o = tc_lookup_action_n(act_name);
522
523 /* We dropped the RTNL semaphore in order to
524 * perform the module load. So, even if we
525 * succeeded in loading the module we have to
526 * tell the caller to replay the request. We
527 * indicate this using -EAGAIN.
528 */
529 if (a_o != NULL) {
530 err = -EAGAIN;
531 goto err_mod;
532 }
533#endif
534 err = -ENOENT;
535 goto err_out;
536 }
537
538 err = -ENOMEM;
539 a = kzalloc(sizeof(*a), GFP_KERNEL);
540 if (a == NULL)
541 goto err_mod;
542
543 /* backward compatibility for policer */
544 if (name == NULL)
545 err = a_o->init(tb[TCA_ACT_OPTIONS], est, a, ovr, bind);
546 else
547 err = a_o->init(nla, est, a, ovr, bind);
548 if (err < 0)
549 goto err_free;
550
551 /* module count goes up only when brand new policy is created
552 * if it exists and is only bound to in a_o->init() then
553 * ACT_P_CREATED is not returned (a zero is).
554 */
555 if (err != ACT_P_CREATED)
556 module_put(a_o->owner);
557 a->ops = a_o;
558
559 return a;
560
561err_free:
562 kfree(a);
563err_mod:
564 module_put(a_o->owner);
565err_out:
566 return ERR_PTR(err);
567}
568
569struct tc_action *tcf_action_init(struct nlattr *nla, struct nlattr *est,
570 char *name, int ovr, int bind)
571{
572 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
573 struct tc_action *head = NULL, *act, *act_prev = NULL;
574 int err;
575 int i;
576
577 err = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
578 if (err < 0)
579 return ERR_PTR(err);
580
581 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
582 act = tcf_action_init_1(tb[i], est, name, ovr, bind);
583 if (IS_ERR(act))
584 goto err;
585 act->order = i;
586
587 if (head == NULL)
588 head = act;
589 else
590 act_prev->next = act;
591 act_prev = act;
592 }
593 return head;
594
595err:
596 if (head != NULL)
597 tcf_action_destroy(head, bind);
598 return act;
599}
600
601int tcf_action_copy_stats(struct sk_buff *skb, struct tc_action *a,
602 int compat_mode)
603{
604 int err = 0;
605 struct gnet_dump d;
606 struct tcf_act_hdr *h = a->priv;
607
608 if (h == NULL)
609 goto errout;
610
611 /* compat_mode being true specifies a call that is supposed
612 * to add additional backward compatibility statistic TLVs.
613 */
614 if (compat_mode) {
615 if (a->type == TCA_OLD_COMPAT)
616 err = gnet_stats_start_copy_compat(skb, 0,
617 TCA_STATS, TCA_XSTATS, &h->tcf_lock, &d);
618 else
619 return 0;
620 } else
621 err = gnet_stats_start_copy(skb, TCA_ACT_STATS,
622 &h->tcf_lock, &d);
623
624 if (err < 0)
625 goto errout;
626
627 if (a->ops != NULL && a->ops->get_stats != NULL)
628 if (a->ops->get_stats(skb, a) < 0)
629 goto errout;
630
631 if (gnet_stats_copy_basic(&d, &h->tcf_bstats) < 0 ||
632 gnet_stats_copy_rate_est(&d, &h->tcf_bstats,
633 &h->tcf_rate_est) < 0 ||
634 gnet_stats_copy_queue(&d, &h->tcf_qstats) < 0)
635 goto errout;
636
637 if (gnet_stats_finish_copy(&d) < 0)
638 goto errout;
639
640 return 0;
641
642errout:
643 return -1;
644}
645
646static int
647tca_get_fill(struct sk_buff *skb, struct tc_action *a, u32 pid, u32 seq,
648 u16 flags, int event, int bind, int ref)
649{
650 struct tcamsg *t;
651 struct nlmsghdr *nlh;
652 unsigned char *b = skb_tail_pointer(skb);
653 struct nlattr *nest;
654
655 nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*t), flags);
656
657 t = NLMSG_DATA(nlh);
658 t->tca_family = AF_UNSPEC;
659 t->tca__pad1 = 0;
660 t->tca__pad2 = 0;
661
662 nest = nla_nest_start(skb, TCA_ACT_TAB);
663 if (nest == NULL)
664 goto nla_put_failure;
665
666 if (tcf_action_dump(skb, a, bind, ref) < 0)
667 goto nla_put_failure;
668
669 nla_nest_end(skb, nest);
670
671 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
672 return skb->len;
673
674nla_put_failure:
675nlmsg_failure:
676 nlmsg_trim(skb, b);
677 return -1;
678}
679
680static int
681act_get_notify(struct net *net, u32 pid, struct nlmsghdr *n,
682 struct tc_action *a, int event)
683{
684 struct sk_buff *skb;
685
686 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
687 if (!skb)
688 return -ENOBUFS;
689 if (tca_get_fill(skb, a, pid, n->nlmsg_seq, 0, event, 0, 0) <= 0) {
690 kfree_skb(skb);
691 return -EINVAL;
692 }
693
694 return rtnl_unicast(skb, net, pid);
695}
696
697static struct tc_action *
698tcf_action_get_1(struct nlattr *nla, struct nlmsghdr *n, u32 pid)
699{
700 struct nlattr *tb[TCA_ACT_MAX + 1];
701 struct tc_action *a;
702 int index;
703 int err;
704
705 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
706 if (err < 0)
707 goto err_out;
708
709 err = -EINVAL;
710 if (tb[TCA_ACT_INDEX] == NULL ||
711 nla_len(tb[TCA_ACT_INDEX]) < sizeof(index))
712 goto err_out;
713 index = nla_get_u32(tb[TCA_ACT_INDEX]);
714
715 err = -ENOMEM;
716 a = kzalloc(sizeof(struct tc_action), GFP_KERNEL);
717 if (a == NULL)
718 goto err_out;
719
720 err = -EINVAL;
721 a->ops = tc_lookup_action(tb[TCA_ACT_KIND]);
722 if (a->ops == NULL)
723 goto err_free;
724 if (a->ops->lookup == NULL)
725 goto err_mod;
726 err = -ENOENT;
727 if (a->ops->lookup(a, index) == 0)
728 goto err_mod;
729
730 module_put(a->ops->owner);
731 return a;
732
733err_mod:
734 module_put(a->ops->owner);
735err_free:
736 kfree(a);
737err_out:
738 return ERR_PTR(err);
739}
740
741static void cleanup_a(struct tc_action *act)
742{
743 struct tc_action *a;
744
745 for (a = act; a; a = act) {
746 act = a->next;
747 kfree(a);
748 }
749}
750
751static struct tc_action *create_a(int i)
752{
753 struct tc_action *act;
754
755 act = kzalloc(sizeof(*act), GFP_KERNEL);
756 if (act == NULL) {
757 pr_debug("create_a: failed to alloc!\n");
758 return NULL;
759 }
760 act->order = i;
761 return act;
762}
763
764static int tca_action_flush(struct net *net, struct nlattr *nla,
765 struct nlmsghdr *n, u32 pid)
766{
767 struct sk_buff *skb;
768 unsigned char *b;
769 struct nlmsghdr *nlh;
770 struct tcamsg *t;
771 struct netlink_callback dcb;
772 struct nlattr *nest;
773 struct nlattr *tb[TCA_ACT_MAX + 1];
774 struct nlattr *kind;
775 struct tc_action *a = create_a(0);
776 int err = -ENOMEM;
777
778 if (a == NULL) {
779 pr_debug("tca_action_flush: couldnt create tc_action\n");
780 return err;
781 }
782
783 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
784 if (!skb) {
785 pr_debug("tca_action_flush: failed skb alloc\n");
786 kfree(a);
787 return err;
788 }
789
790 b = skb_tail_pointer(skb);
791
792 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
793 if (err < 0)
794 goto err_out;
795
796 err = -EINVAL;
797 kind = tb[TCA_ACT_KIND];
798 a->ops = tc_lookup_action(kind);
799 if (a->ops == NULL)
800 goto err_out;
801
802 nlh = NLMSG_PUT(skb, pid, n->nlmsg_seq, RTM_DELACTION, sizeof(*t));
803 t = NLMSG_DATA(nlh);
804 t->tca_family = AF_UNSPEC;
805 t->tca__pad1 = 0;
806 t->tca__pad2 = 0;
807
808 nest = nla_nest_start(skb, TCA_ACT_TAB);
809 if (nest == NULL)
810 goto nla_put_failure;
811
812 err = a->ops->walk(skb, &dcb, RTM_DELACTION, a);
813 if (err < 0)
814 goto nla_put_failure;
815 if (err == 0)
816 goto noflush_out;
817
818 nla_nest_end(skb, nest);
819
820 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
821 nlh->nlmsg_flags |= NLM_F_ROOT;
822 module_put(a->ops->owner);
823 kfree(a);
824 err = rtnetlink_send(skb, net, pid, RTNLGRP_TC,
825 n->nlmsg_flags & NLM_F_ECHO);
826 if (err > 0)
827 return 0;
828
829 return err;
830
831nla_put_failure:
832nlmsg_failure:
833 module_put(a->ops->owner);
834err_out:
835noflush_out:
836 kfree_skb(skb);
837 kfree(a);
838 return err;
839}
840
841static int
842tca_action_gd(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
843 u32 pid, int event)
844{
845 int i, ret;
846 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
847 struct tc_action *head = NULL, *act, *act_prev = NULL;
848
849 ret = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
850 if (ret < 0)
851 return ret;
852
853 if (event == RTM_DELACTION && n->nlmsg_flags & NLM_F_ROOT) {
854 if (tb[1] != NULL)
855 return tca_action_flush(net, tb[1], n, pid);
856 else
857 return -EINVAL;
858 }
859
860 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
861 act = tcf_action_get_1(tb[i], n, pid);
862 if (IS_ERR(act)) {
863 ret = PTR_ERR(act);
864 goto err;
865 }
866 act->order = i;
867
868 if (head == NULL)
869 head = act;
870 else
871 act_prev->next = act;
872 act_prev = act;
873 }
874
875 if (event == RTM_GETACTION)
876 ret = act_get_notify(net, pid, n, head, event);
877 else { /* delete */
878 struct sk_buff *skb;
879
880 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
881 if (!skb) {
882 ret = -ENOBUFS;
883 goto err;
884 }
885
886 if (tca_get_fill(skb, head, pid, n->nlmsg_seq, 0, event,
887 0, 1) <= 0) {
888 kfree_skb(skb);
889 ret = -EINVAL;
890 goto err;
891 }
892
893 /* now do the delete */
894 tcf_action_destroy(head, 0);
895 ret = rtnetlink_send(skb, net, pid, RTNLGRP_TC,
896 n->nlmsg_flags & NLM_F_ECHO);
897 if (ret > 0)
898 return 0;
899 return ret;
900 }
901err:
902 cleanup_a(head);
903 return ret;
904}
905
906static int tcf_add_notify(struct net *net, struct tc_action *a,
907 u32 pid, u32 seq, int event, u16 flags)
908{
909 struct tcamsg *t;
910 struct nlmsghdr *nlh;
911 struct sk_buff *skb;
912 struct nlattr *nest;
913 unsigned char *b;
914 int err = 0;
915
916 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
917 if (!skb)
918 return -ENOBUFS;
919
920 b = skb_tail_pointer(skb);
921
922 nlh = NLMSG_NEW(skb, pid, seq, event, sizeof(*t), flags);
923 t = NLMSG_DATA(nlh);
924 t->tca_family = AF_UNSPEC;
925 t->tca__pad1 = 0;
926 t->tca__pad2 = 0;
927
928 nest = nla_nest_start(skb, TCA_ACT_TAB);
929 if (nest == NULL)
930 goto nla_put_failure;
931
932 if (tcf_action_dump(skb, a, 0, 0) < 0)
933 goto nla_put_failure;
934
935 nla_nest_end(skb, nest);
936
937 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
938 NETLINK_CB(skb).dst_group = RTNLGRP_TC;
939
940 err = rtnetlink_send(skb, net, pid, RTNLGRP_TC, flags & NLM_F_ECHO);
941 if (err > 0)
942 err = 0;
943 return err;
944
945nla_put_failure:
946nlmsg_failure:
947 kfree_skb(skb);
948 return -1;
949}
950
951
952static int
953tcf_action_add(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
954 u32 pid, int ovr)
955{
956 int ret = 0;
957 struct tc_action *act;
958 struct tc_action *a;
959 u32 seq = n->nlmsg_seq;
960
961 act = tcf_action_init(nla, NULL, NULL, ovr, 0);
962 if (act == NULL)
963 goto done;
964 if (IS_ERR(act)) {
965 ret = PTR_ERR(act);
966 goto done;
967 }
968
969 /* dump then free all the actions after update; inserted policy
970 * stays intact
971 */
972 ret = tcf_add_notify(net, act, pid, seq, RTM_NEWACTION, n->nlmsg_flags);
973 for (a = act; a; a = act) {
974 act = a->next;
975 kfree(a);
976 }
977done:
978 return ret;
979}
980
981static int tc_ctl_action(struct sk_buff *skb, struct nlmsghdr *n, void *arg)
982{
983 struct net *net = sock_net(skb->sk);
984 struct nlattr *tca[TCA_ACT_MAX + 1];
985 u32 pid = skb ? NETLINK_CB(skb).pid : 0;
986 int ret = 0, ovr = 0;
987
988 ret = nlmsg_parse(n, sizeof(struct tcamsg), tca, TCA_ACT_MAX, NULL);
989 if (ret < 0)
990 return ret;
991
992 if (tca[TCA_ACT_TAB] == NULL) {
993 pr_notice("tc_ctl_action: received NO action attribs\n");
994 return -EINVAL;
995 }
996
997 /* n->nlmsg_flags & NLM_F_CREATE */
998 switch (n->nlmsg_type) {
999 case RTM_NEWACTION:
1000 /* we are going to assume all other flags
1001 * imply create only if it doesn't exist
1002 * Note that CREATE | EXCL implies that
1003 * but since we want avoid ambiguity (eg when flags
1004 * is zero) then just set this
1005 */
1006 if (n->nlmsg_flags & NLM_F_REPLACE)
1007 ovr = 1;
1008replay:
1009 ret = tcf_action_add(net, tca[TCA_ACT_TAB], n, pid, ovr);
1010 if (ret == -EAGAIN)
1011 goto replay;
1012 break;
1013 case RTM_DELACTION:
1014 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
1015 pid, RTM_DELACTION);
1016 break;
1017 case RTM_GETACTION:
1018 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
1019 pid, RTM_GETACTION);
1020 break;
1021 default:
1022 BUG();
1023 }
1024
1025 return ret;
1026}
1027
1028static struct nlattr *
1029find_dump_kind(const struct nlmsghdr *n)
1030{
1031 struct nlattr *tb1, *tb2[TCA_ACT_MAX + 1];
1032 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
1033 struct nlattr *nla[TCAA_MAX + 1];
1034 struct nlattr *kind;
1035
1036 if (nlmsg_parse(n, sizeof(struct tcamsg), nla, TCAA_MAX, NULL) < 0)
1037 return NULL;
1038 tb1 = nla[TCA_ACT_TAB];
1039 if (tb1 == NULL)
1040 return NULL;
1041
1042 if (nla_parse(tb, TCA_ACT_MAX_PRIO, nla_data(tb1),
1043 NLMSG_ALIGN(nla_len(tb1)), NULL) < 0)
1044 return NULL;
1045
1046 if (tb[1] == NULL)
1047 return NULL;
1048 if (nla_parse(tb2, TCA_ACT_MAX, nla_data(tb[1]),
1049 nla_len(tb[1]), NULL) < 0)
1050 return NULL;
1051 kind = tb2[TCA_ACT_KIND];
1052
1053 return kind;
1054}
1055
1056static int
1057tc_dump_action(struct sk_buff *skb, struct netlink_callback *cb)
1058{
1059 struct nlmsghdr *nlh;
1060 unsigned char *b = skb_tail_pointer(skb);
1061 struct nlattr *nest;
1062 struct tc_action_ops *a_o;
1063 struct tc_action a;
1064 int ret = 0;
1065 struct tcamsg *t = (struct tcamsg *) NLMSG_DATA(cb->nlh);
1066 struct nlattr *kind = find_dump_kind(cb->nlh);
1067
1068 if (kind == NULL) {
1069 pr_info("tc_dump_action: action bad kind\n");
1070 return 0;
1071 }
1072
1073 a_o = tc_lookup_action(kind);
1074 if (a_o == NULL)
1075 return 0;
1076
1077 memset(&a, 0, sizeof(struct tc_action));
1078 a.ops = a_o;
1079
1080 if (a_o->walk == NULL) {
1081 WARN(1, "tc_dump_action: %s !capable of dumping table\n",
1082 a_o->kind);
1083 goto nla_put_failure;
1084 }
1085
1086 nlh = NLMSG_PUT(skb, NETLINK_CB(cb->skb).pid, cb->nlh->nlmsg_seq,
1087 cb->nlh->nlmsg_type, sizeof(*t));
1088 t = NLMSG_DATA(nlh);
1089 t->tca_family = AF_UNSPEC;
1090 t->tca__pad1 = 0;
1091 t->tca__pad2 = 0;
1092
1093 nest = nla_nest_start(skb, TCA_ACT_TAB);
1094 if (nest == NULL)
1095 goto nla_put_failure;
1096
1097 ret = a_o->walk(skb, cb, RTM_GETACTION, &a);
1098 if (ret < 0)
1099 goto nla_put_failure;
1100
1101 if (ret > 0) {
1102 nla_nest_end(skb, nest);
1103 ret = skb->len;
1104 } else
1105 nla_nest_cancel(skb, nest);
1106
1107 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
1108 if (NETLINK_CB(cb->skb).pid && ret)
1109 nlh->nlmsg_flags |= NLM_F_MULTI;
1110 module_put(a_o->owner);
1111 return skb->len;
1112
1113nla_put_failure:
1114nlmsg_failure:
1115 module_put(a_o->owner);
1116 nlmsg_trim(skb, b);
1117 return skb->len;
1118}
1119
1120static int __init tc_action_init(void)
1121{
1122 rtnl_register(PF_UNSPEC, RTM_NEWACTION, tc_ctl_action, NULL, NULL);
1123 rtnl_register(PF_UNSPEC, RTM_DELACTION, tc_ctl_action, NULL, NULL);
1124 rtnl_register(PF_UNSPEC, RTM_GETACTION, tc_ctl_action, tc_dump_action,
1125 NULL);
1126
1127 return 0;
1128}
1129
1130subsys_initcall(tc_action_init);
1/*
2 * net/sched/act_api.c Packet action API.
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 * Author: Jamal Hadi Salim
10 *
11 *
12 */
13
14#include <linux/types.h>
15#include <linux/kernel.h>
16#include <linux/string.h>
17#include <linux/errno.h>
18#include <linux/slab.h>
19#include <linux/skbuff.h>
20#include <linux/init.h>
21#include <linux/kmod.h>
22#include <linux/err.h>
23#include <linux/module.h>
24#include <net/net_namespace.h>
25#include <net/sock.h>
26#include <net/sch_generic.h>
27#include <net/act_api.h>
28#include <net/netlink.h>
29
30static void free_tcf(struct rcu_head *head)
31{
32 struct tc_action *p = container_of(head, struct tc_action, tcfa_rcu);
33
34 free_percpu(p->cpu_bstats);
35 free_percpu(p->cpu_qstats);
36 kfree(p);
37}
38
39static void tcf_hash_destroy(struct tcf_hashinfo *hinfo, struct tc_action *p)
40{
41 spin_lock_bh(&hinfo->lock);
42 hlist_del(&p->tcfa_head);
43 spin_unlock_bh(&hinfo->lock);
44 gen_kill_estimator(&p->tcfa_rate_est);
45 /*
46 * gen_estimator est_timer() might access p->tcfa_lock
47 * or bstats, wait a RCU grace period before freeing p
48 */
49 call_rcu(&p->tcfa_rcu, free_tcf);
50}
51
52int __tcf_hash_release(struct tc_action *p, bool bind, bool strict)
53{
54 int ret = 0;
55
56 if (p) {
57 if (bind)
58 p->tcfa_bindcnt--;
59 else if (strict && p->tcfa_bindcnt > 0)
60 return -EPERM;
61
62 p->tcfa_refcnt--;
63 if (p->tcfa_bindcnt <= 0 && p->tcfa_refcnt <= 0) {
64 if (p->ops->cleanup)
65 p->ops->cleanup(p, bind);
66 tcf_hash_destroy(p->hinfo, p);
67 ret = ACT_P_DELETED;
68 }
69 }
70
71 return ret;
72}
73EXPORT_SYMBOL(__tcf_hash_release);
74
75static int tcf_dump_walker(struct tcf_hashinfo *hinfo, struct sk_buff *skb,
76 struct netlink_callback *cb)
77{
78 int err = 0, index = -1, i = 0, s_i = 0, n_i = 0;
79 struct nlattr *nest;
80
81 spin_lock_bh(&hinfo->lock);
82
83 s_i = cb->args[0];
84
85 for (i = 0; i < (hinfo->hmask + 1); i++) {
86 struct hlist_head *head;
87 struct tc_action *p;
88
89 head = &hinfo->htab[tcf_hash(i, hinfo->hmask)];
90
91 hlist_for_each_entry_rcu(p, head, tcfa_head) {
92 index++;
93 if (index < s_i)
94 continue;
95
96 nest = nla_nest_start(skb, n_i);
97 if (nest == NULL)
98 goto nla_put_failure;
99 err = tcf_action_dump_1(skb, p, 0, 0);
100 if (err < 0) {
101 index--;
102 nlmsg_trim(skb, nest);
103 goto done;
104 }
105 nla_nest_end(skb, nest);
106 n_i++;
107 if (n_i >= TCA_ACT_MAX_PRIO)
108 goto done;
109 }
110 }
111done:
112 spin_unlock_bh(&hinfo->lock);
113 if (n_i)
114 cb->args[0] += n_i;
115 return n_i;
116
117nla_put_failure:
118 nla_nest_cancel(skb, nest);
119 goto done;
120}
121
122static int tcf_del_walker(struct tcf_hashinfo *hinfo, struct sk_buff *skb,
123 const struct tc_action_ops *ops)
124{
125 struct nlattr *nest;
126 int i = 0, n_i = 0;
127 int ret = -EINVAL;
128
129 nest = nla_nest_start(skb, 0);
130 if (nest == NULL)
131 goto nla_put_failure;
132 if (nla_put_string(skb, TCA_KIND, ops->kind))
133 goto nla_put_failure;
134 for (i = 0; i < (hinfo->hmask + 1); i++) {
135 struct hlist_head *head;
136 struct hlist_node *n;
137 struct tc_action *p;
138
139 head = &hinfo->htab[tcf_hash(i, hinfo->hmask)];
140 hlist_for_each_entry_safe(p, n, head, tcfa_head) {
141 ret = __tcf_hash_release(p, false, true);
142 if (ret == ACT_P_DELETED) {
143 module_put(p->ops->owner);
144 n_i++;
145 } else if (ret < 0)
146 goto nla_put_failure;
147 }
148 }
149 if (nla_put_u32(skb, TCA_FCNT, n_i))
150 goto nla_put_failure;
151 nla_nest_end(skb, nest);
152
153 return n_i;
154nla_put_failure:
155 nla_nest_cancel(skb, nest);
156 return ret;
157}
158
159int tcf_generic_walker(struct tc_action_net *tn, struct sk_buff *skb,
160 struct netlink_callback *cb, int type,
161 const struct tc_action_ops *ops)
162{
163 struct tcf_hashinfo *hinfo = tn->hinfo;
164
165 if (type == RTM_DELACTION) {
166 return tcf_del_walker(hinfo, skb, ops);
167 } else if (type == RTM_GETACTION) {
168 return tcf_dump_walker(hinfo, skb, cb);
169 } else {
170 WARN(1, "tcf_generic_walker: unknown action %d\n", type);
171 return -EINVAL;
172 }
173}
174EXPORT_SYMBOL(tcf_generic_walker);
175
176static struct tc_action *tcf_hash_lookup(u32 index, struct tcf_hashinfo *hinfo)
177{
178 struct tc_action *p = NULL;
179 struct hlist_head *head;
180
181 spin_lock_bh(&hinfo->lock);
182 head = &hinfo->htab[tcf_hash(index, hinfo->hmask)];
183 hlist_for_each_entry_rcu(p, head, tcfa_head)
184 if (p->tcfa_index == index)
185 break;
186 spin_unlock_bh(&hinfo->lock);
187
188 return p;
189}
190
191u32 tcf_hash_new_index(struct tc_action_net *tn)
192{
193 struct tcf_hashinfo *hinfo = tn->hinfo;
194 u32 val = hinfo->index;
195
196 do {
197 if (++val == 0)
198 val = 1;
199 } while (tcf_hash_lookup(val, hinfo));
200
201 hinfo->index = val;
202 return val;
203}
204EXPORT_SYMBOL(tcf_hash_new_index);
205
206int tcf_hash_search(struct tc_action_net *tn, struct tc_action **a, u32 index)
207{
208 struct tcf_hashinfo *hinfo = tn->hinfo;
209 struct tc_action *p = tcf_hash_lookup(index, hinfo);
210
211 if (p) {
212 *a = p;
213 return 1;
214 }
215 return 0;
216}
217EXPORT_SYMBOL(tcf_hash_search);
218
219bool tcf_hash_check(struct tc_action_net *tn, u32 index, struct tc_action **a,
220 int bind)
221{
222 struct tcf_hashinfo *hinfo = tn->hinfo;
223 struct tc_action *p = NULL;
224
225 if (index && (p = tcf_hash_lookup(index, hinfo)) != NULL) {
226 if (bind)
227 p->tcfa_bindcnt++;
228 p->tcfa_refcnt++;
229 *a = p;
230 return true;
231 }
232 return false;
233}
234EXPORT_SYMBOL(tcf_hash_check);
235
236void tcf_hash_cleanup(struct tc_action *a, struct nlattr *est)
237{
238 if (est)
239 gen_kill_estimator(&a->tcfa_rate_est);
240 call_rcu(&a->tcfa_rcu, free_tcf);
241}
242EXPORT_SYMBOL(tcf_hash_cleanup);
243
244int tcf_hash_create(struct tc_action_net *tn, u32 index, struct nlattr *est,
245 struct tc_action **a, const struct tc_action_ops *ops,
246 int bind, bool cpustats)
247{
248 struct tc_action *p = kzalloc(ops->size, GFP_KERNEL);
249 struct tcf_hashinfo *hinfo = tn->hinfo;
250 int err = -ENOMEM;
251
252 if (unlikely(!p))
253 return -ENOMEM;
254 p->tcfa_refcnt = 1;
255 if (bind)
256 p->tcfa_bindcnt = 1;
257
258 if (cpustats) {
259 p->cpu_bstats = netdev_alloc_pcpu_stats(struct gnet_stats_basic_cpu);
260 if (!p->cpu_bstats) {
261err1:
262 kfree(p);
263 return err;
264 }
265 p->cpu_qstats = alloc_percpu(struct gnet_stats_queue);
266 if (!p->cpu_qstats) {
267err2:
268 free_percpu(p->cpu_bstats);
269 goto err1;
270 }
271 }
272 spin_lock_init(&p->tcfa_lock);
273 INIT_HLIST_NODE(&p->tcfa_head);
274 p->tcfa_index = index ? index : tcf_hash_new_index(tn);
275 p->tcfa_tm.install = jiffies;
276 p->tcfa_tm.lastuse = jiffies;
277 p->tcfa_tm.firstuse = 0;
278 if (est) {
279 err = gen_new_estimator(&p->tcfa_bstats, p->cpu_bstats,
280 &p->tcfa_rate_est,
281 &p->tcfa_lock, NULL, est);
282 if (err) {
283 free_percpu(p->cpu_qstats);
284 goto err2;
285 }
286 }
287
288 p->hinfo = hinfo;
289 p->ops = ops;
290 INIT_LIST_HEAD(&p->list);
291 *a = p;
292 return 0;
293}
294EXPORT_SYMBOL(tcf_hash_create);
295
296void tcf_hash_insert(struct tc_action_net *tn, struct tc_action *a)
297{
298 struct tcf_hashinfo *hinfo = tn->hinfo;
299 unsigned int h = tcf_hash(a->tcfa_index, hinfo->hmask);
300
301 spin_lock_bh(&hinfo->lock);
302 hlist_add_head(&a->tcfa_head, &hinfo->htab[h]);
303 spin_unlock_bh(&hinfo->lock);
304}
305EXPORT_SYMBOL(tcf_hash_insert);
306
307void tcf_hashinfo_destroy(const struct tc_action_ops *ops,
308 struct tcf_hashinfo *hinfo)
309{
310 int i;
311
312 for (i = 0; i < hinfo->hmask + 1; i++) {
313 struct tc_action *p;
314 struct hlist_node *n;
315
316 hlist_for_each_entry_safe(p, n, &hinfo->htab[i], tcfa_head) {
317 int ret;
318
319 ret = __tcf_hash_release(p, false, true);
320 if (ret == ACT_P_DELETED)
321 module_put(ops->owner);
322 else if (ret < 0)
323 return;
324 }
325 }
326 kfree(hinfo->htab);
327}
328EXPORT_SYMBOL(tcf_hashinfo_destroy);
329
330static LIST_HEAD(act_base);
331static DEFINE_RWLOCK(act_mod_lock);
332
333int tcf_register_action(struct tc_action_ops *act,
334 struct pernet_operations *ops)
335{
336 struct tc_action_ops *a;
337 int ret;
338
339 if (!act->act || !act->dump || !act->init || !act->walk || !act->lookup)
340 return -EINVAL;
341
342 /* We have to register pernet ops before making the action ops visible,
343 * otherwise tcf_action_init_1() could get a partially initialized
344 * netns.
345 */
346 ret = register_pernet_subsys(ops);
347 if (ret)
348 return ret;
349
350 write_lock(&act_mod_lock);
351 list_for_each_entry(a, &act_base, head) {
352 if (act->type == a->type || (strcmp(act->kind, a->kind) == 0)) {
353 write_unlock(&act_mod_lock);
354 unregister_pernet_subsys(ops);
355 return -EEXIST;
356 }
357 }
358 list_add_tail(&act->head, &act_base);
359 write_unlock(&act_mod_lock);
360
361 return 0;
362}
363EXPORT_SYMBOL(tcf_register_action);
364
365int tcf_unregister_action(struct tc_action_ops *act,
366 struct pernet_operations *ops)
367{
368 struct tc_action_ops *a;
369 int err = -ENOENT;
370
371 write_lock(&act_mod_lock);
372 list_for_each_entry(a, &act_base, head) {
373 if (a == act) {
374 list_del(&act->head);
375 err = 0;
376 break;
377 }
378 }
379 write_unlock(&act_mod_lock);
380 if (!err)
381 unregister_pernet_subsys(ops);
382 return err;
383}
384EXPORT_SYMBOL(tcf_unregister_action);
385
386/* lookup by name */
387static struct tc_action_ops *tc_lookup_action_n(char *kind)
388{
389 struct tc_action_ops *a, *res = NULL;
390
391 if (kind) {
392 read_lock(&act_mod_lock);
393 list_for_each_entry(a, &act_base, head) {
394 if (strcmp(kind, a->kind) == 0) {
395 if (try_module_get(a->owner))
396 res = a;
397 break;
398 }
399 }
400 read_unlock(&act_mod_lock);
401 }
402 return res;
403}
404
405/* lookup by nlattr */
406static struct tc_action_ops *tc_lookup_action(struct nlattr *kind)
407{
408 struct tc_action_ops *a, *res = NULL;
409
410 if (kind) {
411 read_lock(&act_mod_lock);
412 list_for_each_entry(a, &act_base, head) {
413 if (nla_strcmp(kind, a->kind) == 0) {
414 if (try_module_get(a->owner))
415 res = a;
416 break;
417 }
418 }
419 read_unlock(&act_mod_lock);
420 }
421 return res;
422}
423
424int tcf_action_exec(struct sk_buff *skb, struct tc_action **actions,
425 int nr_actions, struct tcf_result *res)
426{
427 int ret = -1, i;
428
429 if (skb->tc_verd & TC_NCLS) {
430 skb->tc_verd = CLR_TC_NCLS(skb->tc_verd);
431 ret = TC_ACT_OK;
432 goto exec_done;
433 }
434 for (i = 0; i < nr_actions; i++) {
435 const struct tc_action *a = actions[i];
436
437repeat:
438 ret = a->ops->act(skb, a, res);
439 if (ret == TC_ACT_REPEAT)
440 goto repeat; /* we need a ttl - JHS */
441 if (ret != TC_ACT_PIPE)
442 goto exec_done;
443 }
444exec_done:
445 return ret;
446}
447EXPORT_SYMBOL(tcf_action_exec);
448
449int tcf_action_destroy(struct list_head *actions, int bind)
450{
451 struct tc_action *a, *tmp;
452 int ret = 0;
453
454 list_for_each_entry_safe(a, tmp, actions, list) {
455 ret = __tcf_hash_release(a, bind, true);
456 if (ret == ACT_P_DELETED)
457 module_put(a->ops->owner);
458 else if (ret < 0)
459 return ret;
460 }
461 return ret;
462}
463
464int
465tcf_action_dump_old(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
466{
467 return a->ops->dump(skb, a, bind, ref);
468}
469
470int
471tcf_action_dump_1(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
472{
473 int err = -EINVAL;
474 unsigned char *b = skb_tail_pointer(skb);
475 struct nlattr *nest;
476
477 if (nla_put_string(skb, TCA_KIND, a->ops->kind))
478 goto nla_put_failure;
479 if (tcf_action_copy_stats(skb, a, 0))
480 goto nla_put_failure;
481 nest = nla_nest_start(skb, TCA_OPTIONS);
482 if (nest == NULL)
483 goto nla_put_failure;
484 err = tcf_action_dump_old(skb, a, bind, ref);
485 if (err > 0) {
486 nla_nest_end(skb, nest);
487 return err;
488 }
489
490nla_put_failure:
491 nlmsg_trim(skb, b);
492 return -1;
493}
494EXPORT_SYMBOL(tcf_action_dump_1);
495
496int tcf_action_dump(struct sk_buff *skb, struct list_head *actions,
497 int bind, int ref)
498{
499 struct tc_action *a;
500 int err = -EINVAL;
501 struct nlattr *nest;
502
503 list_for_each_entry(a, actions, list) {
504 nest = nla_nest_start(skb, a->order);
505 if (nest == NULL)
506 goto nla_put_failure;
507 err = tcf_action_dump_1(skb, a, bind, ref);
508 if (err < 0)
509 goto errout;
510 nla_nest_end(skb, nest);
511 }
512
513 return 0;
514
515nla_put_failure:
516 err = -EINVAL;
517errout:
518 nla_nest_cancel(skb, nest);
519 return err;
520}
521
522struct tc_action *tcf_action_init_1(struct net *net, struct nlattr *nla,
523 struct nlattr *est, char *name, int ovr,
524 int bind)
525{
526 struct tc_action *a;
527 struct tc_action_ops *a_o;
528 char act_name[IFNAMSIZ];
529 struct nlattr *tb[TCA_ACT_MAX + 1];
530 struct nlattr *kind;
531 int err;
532
533 if (name == NULL) {
534 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
535 if (err < 0)
536 goto err_out;
537 err = -EINVAL;
538 kind = tb[TCA_ACT_KIND];
539 if (kind == NULL)
540 goto err_out;
541 if (nla_strlcpy(act_name, kind, IFNAMSIZ) >= IFNAMSIZ)
542 goto err_out;
543 } else {
544 err = -EINVAL;
545 if (strlcpy(act_name, name, IFNAMSIZ) >= IFNAMSIZ)
546 goto err_out;
547 }
548
549 a_o = tc_lookup_action_n(act_name);
550 if (a_o == NULL) {
551#ifdef CONFIG_MODULES
552 rtnl_unlock();
553 request_module("act_%s", act_name);
554 rtnl_lock();
555
556 a_o = tc_lookup_action_n(act_name);
557
558 /* We dropped the RTNL semaphore in order to
559 * perform the module load. So, even if we
560 * succeeded in loading the module we have to
561 * tell the caller to replay the request. We
562 * indicate this using -EAGAIN.
563 */
564 if (a_o != NULL) {
565 err = -EAGAIN;
566 goto err_mod;
567 }
568#endif
569 err = -ENOENT;
570 goto err_out;
571 }
572
573 /* backward compatibility for policer */
574 if (name == NULL)
575 err = a_o->init(net, tb[TCA_ACT_OPTIONS], est, &a, ovr, bind);
576 else
577 err = a_o->init(net, nla, est, &a, ovr, bind);
578 if (err < 0)
579 goto err_mod;
580
581 /* module count goes up only when brand new policy is created
582 * if it exists and is only bound to in a_o->init() then
583 * ACT_P_CREATED is not returned (a zero is).
584 */
585 if (err != ACT_P_CREATED)
586 module_put(a_o->owner);
587
588 return a;
589
590err_mod:
591 module_put(a_o->owner);
592err_out:
593 return ERR_PTR(err);
594}
595
596static void cleanup_a(struct list_head *actions, int ovr)
597{
598 struct tc_action *a;
599
600 if (!ovr)
601 return;
602
603 list_for_each_entry(a, actions, list)
604 a->tcfa_refcnt--;
605}
606
607int tcf_action_init(struct net *net, struct nlattr *nla, struct nlattr *est,
608 char *name, int ovr, int bind, struct list_head *actions)
609{
610 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
611 struct tc_action *act;
612 int err;
613 int i;
614
615 err = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
616 if (err < 0)
617 return err;
618
619 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
620 act = tcf_action_init_1(net, tb[i], est, name, ovr, bind);
621 if (IS_ERR(act)) {
622 err = PTR_ERR(act);
623 goto err;
624 }
625 act->order = i;
626 if (ovr)
627 act->tcfa_refcnt++;
628 list_add_tail(&act->list, actions);
629 }
630
631 /* Remove the temp refcnt which was necessary to protect against
632 * destroying an existing action which was being replaced
633 */
634 cleanup_a(actions, ovr);
635 return 0;
636
637err:
638 tcf_action_destroy(actions, bind);
639 return err;
640}
641
642int tcf_action_copy_stats(struct sk_buff *skb, struct tc_action *p,
643 int compat_mode)
644{
645 int err = 0;
646 struct gnet_dump d;
647
648 if (p == NULL)
649 goto errout;
650
651 /* compat_mode being true specifies a call that is supposed
652 * to add additional backward compatibility statistic TLVs.
653 */
654 if (compat_mode) {
655 if (p->type == TCA_OLD_COMPAT)
656 err = gnet_stats_start_copy_compat(skb, 0,
657 TCA_STATS,
658 TCA_XSTATS,
659 &p->tcfa_lock, &d,
660 TCA_PAD);
661 else
662 return 0;
663 } else
664 err = gnet_stats_start_copy(skb, TCA_ACT_STATS,
665 &p->tcfa_lock, &d, TCA_ACT_PAD);
666
667 if (err < 0)
668 goto errout;
669
670 if (gnet_stats_copy_basic(NULL, &d, p->cpu_bstats, &p->tcfa_bstats) < 0 ||
671 gnet_stats_copy_rate_est(&d, &p->tcfa_rate_est) < 0 ||
672 gnet_stats_copy_queue(&d, p->cpu_qstats,
673 &p->tcfa_qstats,
674 p->tcfa_qstats.qlen) < 0)
675 goto errout;
676
677 if (gnet_stats_finish_copy(&d) < 0)
678 goto errout;
679
680 return 0;
681
682errout:
683 return -1;
684}
685
686static int tca_get_fill(struct sk_buff *skb, struct list_head *actions,
687 u32 portid, u32 seq, u16 flags, int event, int bind,
688 int ref)
689{
690 struct tcamsg *t;
691 struct nlmsghdr *nlh;
692 unsigned char *b = skb_tail_pointer(skb);
693 struct nlattr *nest;
694
695 nlh = nlmsg_put(skb, portid, seq, event, sizeof(*t), flags);
696 if (!nlh)
697 goto out_nlmsg_trim;
698 t = nlmsg_data(nlh);
699 t->tca_family = AF_UNSPEC;
700 t->tca__pad1 = 0;
701 t->tca__pad2 = 0;
702
703 nest = nla_nest_start(skb, TCA_ACT_TAB);
704 if (nest == NULL)
705 goto out_nlmsg_trim;
706
707 if (tcf_action_dump(skb, actions, bind, ref) < 0)
708 goto out_nlmsg_trim;
709
710 nla_nest_end(skb, nest);
711
712 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
713 return skb->len;
714
715out_nlmsg_trim:
716 nlmsg_trim(skb, b);
717 return -1;
718}
719
720static int
721act_get_notify(struct net *net, u32 portid, struct nlmsghdr *n,
722 struct list_head *actions, int event)
723{
724 struct sk_buff *skb;
725
726 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
727 if (!skb)
728 return -ENOBUFS;
729 if (tca_get_fill(skb, actions, portid, n->nlmsg_seq, 0, event,
730 0, 0) <= 0) {
731 kfree_skb(skb);
732 return -EINVAL;
733 }
734
735 return rtnl_unicast(skb, net, portid);
736}
737
738static struct tc_action *tcf_action_get_1(struct net *net, struct nlattr *nla,
739 struct nlmsghdr *n, u32 portid)
740{
741 struct nlattr *tb[TCA_ACT_MAX + 1];
742 const struct tc_action_ops *ops;
743 struct tc_action *a;
744 int index;
745 int err;
746
747 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
748 if (err < 0)
749 goto err_out;
750
751 err = -EINVAL;
752 if (tb[TCA_ACT_INDEX] == NULL ||
753 nla_len(tb[TCA_ACT_INDEX]) < sizeof(index))
754 goto err_out;
755 index = nla_get_u32(tb[TCA_ACT_INDEX]);
756
757 err = -EINVAL;
758 ops = tc_lookup_action(tb[TCA_ACT_KIND]);
759 if (!ops) /* could happen in batch of actions */
760 goto err_out;
761 err = -ENOENT;
762 if (ops->lookup(net, &a, index) == 0)
763 goto err_mod;
764
765 module_put(ops->owner);
766 return a;
767
768err_mod:
769 module_put(ops->owner);
770err_out:
771 return ERR_PTR(err);
772}
773
774static int tca_action_flush(struct net *net, struct nlattr *nla,
775 struct nlmsghdr *n, u32 portid)
776{
777 struct sk_buff *skb;
778 unsigned char *b;
779 struct nlmsghdr *nlh;
780 struct tcamsg *t;
781 struct netlink_callback dcb;
782 struct nlattr *nest;
783 struct nlattr *tb[TCA_ACT_MAX + 1];
784 const struct tc_action_ops *ops;
785 struct nlattr *kind;
786 int err = -ENOMEM;
787
788 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
789 if (!skb) {
790 pr_debug("tca_action_flush: failed skb alloc\n");
791 return err;
792 }
793
794 b = skb_tail_pointer(skb);
795
796 err = nla_parse_nested(tb, TCA_ACT_MAX, nla, NULL);
797 if (err < 0)
798 goto err_out;
799
800 err = -EINVAL;
801 kind = tb[TCA_ACT_KIND];
802 ops = tc_lookup_action(kind);
803 if (!ops) /*some idjot trying to flush unknown action */
804 goto err_out;
805
806 nlh = nlmsg_put(skb, portid, n->nlmsg_seq, RTM_DELACTION,
807 sizeof(*t), 0);
808 if (!nlh)
809 goto out_module_put;
810 t = nlmsg_data(nlh);
811 t->tca_family = AF_UNSPEC;
812 t->tca__pad1 = 0;
813 t->tca__pad2 = 0;
814
815 nest = nla_nest_start(skb, TCA_ACT_TAB);
816 if (nest == NULL)
817 goto out_module_put;
818
819 err = ops->walk(net, skb, &dcb, RTM_DELACTION, ops);
820 if (err <= 0)
821 goto out_module_put;
822
823 nla_nest_end(skb, nest);
824
825 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
826 nlh->nlmsg_flags |= NLM_F_ROOT;
827 module_put(ops->owner);
828 err = rtnetlink_send(skb, net, portid, RTNLGRP_TC,
829 n->nlmsg_flags & NLM_F_ECHO);
830 if (err > 0)
831 return 0;
832
833 return err;
834
835out_module_put:
836 module_put(ops->owner);
837err_out:
838 kfree_skb(skb);
839 return err;
840}
841
842static int
843tcf_del_notify(struct net *net, struct nlmsghdr *n, struct list_head *actions,
844 u32 portid)
845{
846 int ret;
847 struct sk_buff *skb;
848
849 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
850 if (!skb)
851 return -ENOBUFS;
852
853 if (tca_get_fill(skb, actions, portid, n->nlmsg_seq, 0, RTM_DELACTION,
854 0, 1) <= 0) {
855 kfree_skb(skb);
856 return -EINVAL;
857 }
858
859 /* now do the delete */
860 ret = tcf_action_destroy(actions, 0);
861 if (ret < 0) {
862 kfree_skb(skb);
863 return ret;
864 }
865
866 ret = rtnetlink_send(skb, net, portid, RTNLGRP_TC,
867 n->nlmsg_flags & NLM_F_ECHO);
868 if (ret > 0)
869 return 0;
870 return ret;
871}
872
873static int
874tca_action_gd(struct net *net, struct nlattr *nla, struct nlmsghdr *n,
875 u32 portid, int event)
876{
877 int i, ret;
878 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
879 struct tc_action *act;
880 LIST_HEAD(actions);
881
882 ret = nla_parse_nested(tb, TCA_ACT_MAX_PRIO, nla, NULL);
883 if (ret < 0)
884 return ret;
885
886 if (event == RTM_DELACTION && n->nlmsg_flags & NLM_F_ROOT) {
887 if (tb[1] != NULL)
888 return tca_action_flush(net, tb[1], n, portid);
889 else
890 return -EINVAL;
891 }
892
893 for (i = 1; i <= TCA_ACT_MAX_PRIO && tb[i]; i++) {
894 act = tcf_action_get_1(net, tb[i], n, portid);
895 if (IS_ERR(act)) {
896 ret = PTR_ERR(act);
897 goto err;
898 }
899 act->order = i;
900 list_add_tail(&act->list, &actions);
901 }
902
903 if (event == RTM_GETACTION)
904 ret = act_get_notify(net, portid, n, &actions, event);
905 else { /* delete */
906 ret = tcf_del_notify(net, n, &actions, portid);
907 if (ret)
908 goto err;
909 return ret;
910 }
911err:
912 if (event != RTM_GETACTION)
913 tcf_action_destroy(&actions, 0);
914 return ret;
915}
916
917static int
918tcf_add_notify(struct net *net, struct nlmsghdr *n, struct list_head *actions,
919 u32 portid)
920{
921 struct sk_buff *skb;
922 int err = 0;
923
924 skb = alloc_skb(NLMSG_GOODSIZE, GFP_KERNEL);
925 if (!skb)
926 return -ENOBUFS;
927
928 if (tca_get_fill(skb, actions, portid, n->nlmsg_seq, n->nlmsg_flags,
929 RTM_NEWACTION, 0, 0) <= 0) {
930 kfree_skb(skb);
931 return -EINVAL;
932 }
933
934 err = rtnetlink_send(skb, net, portid, RTNLGRP_TC,
935 n->nlmsg_flags & NLM_F_ECHO);
936 if (err > 0)
937 err = 0;
938 return err;
939}
940
941static int tcf_action_add(struct net *net, struct nlattr *nla,
942 struct nlmsghdr *n, u32 portid, int ovr)
943{
944 int ret = 0;
945 LIST_HEAD(actions);
946
947 ret = tcf_action_init(net, nla, NULL, NULL, ovr, 0, &actions);
948 if (ret)
949 return ret;
950
951 return tcf_add_notify(net, n, &actions, portid);
952}
953
954static int tc_ctl_action(struct sk_buff *skb, struct nlmsghdr *n)
955{
956 struct net *net = sock_net(skb->sk);
957 struct nlattr *tca[TCA_ACT_MAX + 1];
958 u32 portid = skb ? NETLINK_CB(skb).portid : 0;
959 int ret = 0, ovr = 0;
960
961 if ((n->nlmsg_type != RTM_GETACTION) &&
962 !netlink_capable(skb, CAP_NET_ADMIN))
963 return -EPERM;
964
965 ret = nlmsg_parse(n, sizeof(struct tcamsg), tca, TCA_ACT_MAX, NULL);
966 if (ret < 0)
967 return ret;
968
969 if (tca[TCA_ACT_TAB] == NULL) {
970 pr_notice("tc_ctl_action: received NO action attribs\n");
971 return -EINVAL;
972 }
973
974 /* n->nlmsg_flags & NLM_F_CREATE */
975 switch (n->nlmsg_type) {
976 case RTM_NEWACTION:
977 /* we are going to assume all other flags
978 * imply create only if it doesn't exist
979 * Note that CREATE | EXCL implies that
980 * but since we want avoid ambiguity (eg when flags
981 * is zero) then just set this
982 */
983 if (n->nlmsg_flags & NLM_F_REPLACE)
984 ovr = 1;
985replay:
986 ret = tcf_action_add(net, tca[TCA_ACT_TAB], n, portid, ovr);
987 if (ret == -EAGAIN)
988 goto replay;
989 break;
990 case RTM_DELACTION:
991 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
992 portid, RTM_DELACTION);
993 break;
994 case RTM_GETACTION:
995 ret = tca_action_gd(net, tca[TCA_ACT_TAB], n,
996 portid, RTM_GETACTION);
997 break;
998 default:
999 BUG();
1000 }
1001
1002 return ret;
1003}
1004
1005static struct nlattr *find_dump_kind(const struct nlmsghdr *n)
1006{
1007 struct nlattr *tb1, *tb2[TCA_ACT_MAX + 1];
1008 struct nlattr *tb[TCA_ACT_MAX_PRIO + 1];
1009 struct nlattr *nla[TCAA_MAX + 1];
1010 struct nlattr *kind;
1011
1012 if (nlmsg_parse(n, sizeof(struct tcamsg), nla, TCAA_MAX, NULL) < 0)
1013 return NULL;
1014 tb1 = nla[TCA_ACT_TAB];
1015 if (tb1 == NULL)
1016 return NULL;
1017
1018 if (nla_parse(tb, TCA_ACT_MAX_PRIO, nla_data(tb1),
1019 NLMSG_ALIGN(nla_len(tb1)), NULL) < 0)
1020 return NULL;
1021
1022 if (tb[1] == NULL)
1023 return NULL;
1024 if (nla_parse_nested(tb2, TCA_ACT_MAX, tb[1], NULL) < 0)
1025 return NULL;
1026 kind = tb2[TCA_ACT_KIND];
1027
1028 return kind;
1029}
1030
1031static int tc_dump_action(struct sk_buff *skb, struct netlink_callback *cb)
1032{
1033 struct net *net = sock_net(skb->sk);
1034 struct nlmsghdr *nlh;
1035 unsigned char *b = skb_tail_pointer(skb);
1036 struct nlattr *nest;
1037 struct tc_action_ops *a_o;
1038 int ret = 0;
1039 struct tcamsg *t = (struct tcamsg *) nlmsg_data(cb->nlh);
1040 struct nlattr *kind = find_dump_kind(cb->nlh);
1041
1042 if (kind == NULL) {
1043 pr_info("tc_dump_action: action bad kind\n");
1044 return 0;
1045 }
1046
1047 a_o = tc_lookup_action(kind);
1048 if (a_o == NULL)
1049 return 0;
1050
1051 nlh = nlmsg_put(skb, NETLINK_CB(cb->skb).portid, cb->nlh->nlmsg_seq,
1052 cb->nlh->nlmsg_type, sizeof(*t), 0);
1053 if (!nlh)
1054 goto out_module_put;
1055 t = nlmsg_data(nlh);
1056 t->tca_family = AF_UNSPEC;
1057 t->tca__pad1 = 0;
1058 t->tca__pad2 = 0;
1059
1060 nest = nla_nest_start(skb, TCA_ACT_TAB);
1061 if (nest == NULL)
1062 goto out_module_put;
1063
1064 ret = a_o->walk(net, skb, cb, RTM_GETACTION, a_o);
1065 if (ret < 0)
1066 goto out_module_put;
1067
1068 if (ret > 0) {
1069 nla_nest_end(skb, nest);
1070 ret = skb->len;
1071 } else
1072 nlmsg_trim(skb, b);
1073
1074 nlh->nlmsg_len = skb_tail_pointer(skb) - b;
1075 if (NETLINK_CB(cb->skb).portid && ret)
1076 nlh->nlmsg_flags |= NLM_F_MULTI;
1077 module_put(a_o->owner);
1078 return skb->len;
1079
1080out_module_put:
1081 module_put(a_o->owner);
1082 nlmsg_trim(skb, b);
1083 return skb->len;
1084}
1085
1086static int __init tc_action_init(void)
1087{
1088 rtnl_register(PF_UNSPEC, RTM_NEWACTION, tc_ctl_action, NULL, NULL);
1089 rtnl_register(PF_UNSPEC, RTM_DELACTION, tc_ctl_action, NULL, NULL);
1090 rtnl_register(PF_UNSPEC, RTM_GETACTION, tc_ctl_action, tc_dump_action,
1091 NULL);
1092
1093 return 0;
1094}
1095
1096subsys_initcall(tc_action_init);