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