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