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