cls_basic.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301
  1. /*
  2. * net/sched/cls_basic.c Basic Packet Classifier.
  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. * Authors: Thomas Graf <tgraf@suug.ch>
  10. */
  11. #include <linux/module.h>
  12. #include <linux/slab.h>
  13. #include <linux/types.h>
  14. #include <linux/kernel.h>
  15. #include <linux/string.h>
  16. #include <linux/errno.h>
  17. #include <linux/rtnetlink.h>
  18. #include <linux/skbuff.h>
  19. #include <net/netlink.h>
  20. #include <net/act_api.h>
  21. #include <net/pkt_cls.h>
  22. struct basic_head {
  23. u32 hgenerator;
  24. struct list_head flist;
  25. struct rcu_head rcu;
  26. };
  27. struct basic_filter {
  28. u32 handle;
  29. struct tcf_exts exts;
  30. struct tcf_ematch_tree ematches;
  31. struct tcf_result res;
  32. struct tcf_proto *tp;
  33. struct list_head link;
  34. struct rcu_head rcu;
  35. };
  36. static int basic_classify(struct sk_buff *skb, const struct tcf_proto *tp,
  37. struct tcf_result *res)
  38. {
  39. int r;
  40. struct basic_head *head = rcu_dereference_bh(tp->root);
  41. struct basic_filter *f;
  42. list_for_each_entry_rcu(f, &head->flist, link) {
  43. if (!tcf_em_tree_match(skb, &f->ematches, NULL))
  44. continue;
  45. *res = f->res;
  46. r = tcf_exts_exec(skb, &f->exts, res);
  47. if (r < 0)
  48. continue;
  49. return r;
  50. }
  51. return -1;
  52. }
  53. static unsigned long basic_get(struct tcf_proto *tp, u32 handle)
  54. {
  55. unsigned long l = 0UL;
  56. struct basic_head *head = rtnl_dereference(tp->root);
  57. struct basic_filter *f;
  58. list_for_each_entry(f, &head->flist, link) {
  59. if (f->handle == handle) {
  60. l = (unsigned long) f;
  61. break;
  62. }
  63. }
  64. return l;
  65. }
  66. static int basic_init(struct tcf_proto *tp)
  67. {
  68. struct basic_head *head;
  69. head = kzalloc(sizeof(*head), GFP_KERNEL);
  70. if (head == NULL)
  71. return -ENOBUFS;
  72. INIT_LIST_HEAD(&head->flist);
  73. rcu_assign_pointer(tp->root, head);
  74. return 0;
  75. }
  76. static void basic_delete_filter(struct rcu_head *head)
  77. {
  78. struct basic_filter *f = container_of(head, struct basic_filter, rcu);
  79. tcf_exts_destroy(&f->exts);
  80. tcf_em_tree_destroy(&f->ematches);
  81. kfree(f);
  82. }
  83. static void basic_destroy(struct tcf_proto *tp)
  84. {
  85. struct basic_head *head = rtnl_dereference(tp->root);
  86. struct basic_filter *f, *n;
  87. list_for_each_entry_safe(f, n, &head->flist, link) {
  88. list_del_rcu(&f->link);
  89. tcf_unbind_filter(tp, &f->res);
  90. call_rcu(&f->rcu, basic_delete_filter);
  91. }
  92. kfree_rcu(head, rcu);
  93. }
  94. static int basic_delete(struct tcf_proto *tp, unsigned long arg, bool *last)
  95. {
  96. struct basic_head *head = rtnl_dereference(tp->root);
  97. struct basic_filter *f = (struct basic_filter *) arg;
  98. list_del_rcu(&f->link);
  99. tcf_unbind_filter(tp, &f->res);
  100. call_rcu(&f->rcu, basic_delete_filter);
  101. *last = list_empty(&head->flist);
  102. return 0;
  103. }
  104. static const struct nla_policy basic_policy[TCA_BASIC_MAX + 1] = {
  105. [TCA_BASIC_CLASSID] = { .type = NLA_U32 },
  106. [TCA_BASIC_EMATCHES] = { .type = NLA_NESTED },
  107. };
  108. static int basic_set_parms(struct net *net, struct tcf_proto *tp,
  109. struct basic_filter *f, unsigned long base,
  110. struct nlattr **tb,
  111. struct nlattr *est, bool ovr)
  112. {
  113. int err;
  114. err = tcf_exts_validate(net, tp, tb, est, &f->exts, ovr);
  115. if (err < 0)
  116. return err;
  117. err = tcf_em_tree_validate(tp, tb[TCA_BASIC_EMATCHES], &f->ematches);
  118. if (err < 0)
  119. return err;
  120. if (tb[TCA_BASIC_CLASSID]) {
  121. f->res.classid = nla_get_u32(tb[TCA_BASIC_CLASSID]);
  122. tcf_bind_filter(tp, &f->res, base);
  123. }
  124. f->tp = tp;
  125. return 0;
  126. }
  127. static int basic_change(struct net *net, struct sk_buff *in_skb,
  128. struct tcf_proto *tp, unsigned long base, u32 handle,
  129. struct nlattr **tca, unsigned long *arg, bool ovr)
  130. {
  131. int err;
  132. struct basic_head *head = rtnl_dereference(tp->root);
  133. struct nlattr *tb[TCA_BASIC_MAX + 1];
  134. struct basic_filter *fold = (struct basic_filter *) *arg;
  135. struct basic_filter *fnew;
  136. if (tca[TCA_OPTIONS] == NULL)
  137. return -EINVAL;
  138. err = nla_parse_nested(tb, TCA_BASIC_MAX, tca[TCA_OPTIONS],
  139. basic_policy, NULL);
  140. if (err < 0)
  141. return err;
  142. if (fold != NULL) {
  143. if (handle && fold->handle != handle)
  144. return -EINVAL;
  145. }
  146. fnew = kzalloc(sizeof(*fnew), GFP_KERNEL);
  147. if (!fnew)
  148. return -ENOBUFS;
  149. err = tcf_exts_init(&fnew->exts, TCA_BASIC_ACT, TCA_BASIC_POLICE);
  150. if (err < 0)
  151. goto errout;
  152. err = -EINVAL;
  153. if (handle) {
  154. fnew->handle = handle;
  155. } else if (fold) {
  156. fnew->handle = fold->handle;
  157. } else {
  158. unsigned int i = 0x80000000;
  159. do {
  160. if (++head->hgenerator == 0x7FFFFFFF)
  161. head->hgenerator = 1;
  162. } while (--i > 0 && basic_get(tp, head->hgenerator));
  163. if (i <= 0) {
  164. pr_err("Insufficient number of handles\n");
  165. goto errout;
  166. }
  167. fnew->handle = head->hgenerator;
  168. }
  169. err = basic_set_parms(net, tp, fnew, base, tb, tca[TCA_RATE], ovr);
  170. if (err < 0)
  171. goto errout;
  172. *arg = (unsigned long)fnew;
  173. if (fold) {
  174. list_replace_rcu(&fold->link, &fnew->link);
  175. tcf_unbind_filter(tp, &fold->res);
  176. call_rcu(&fold->rcu, basic_delete_filter);
  177. } else {
  178. list_add_rcu(&fnew->link, &head->flist);
  179. }
  180. return 0;
  181. errout:
  182. tcf_exts_destroy(&fnew->exts);
  183. kfree(fnew);
  184. return err;
  185. }
  186. static void basic_walk(struct tcf_proto *tp, struct tcf_walker *arg)
  187. {
  188. struct basic_head *head = rtnl_dereference(tp->root);
  189. struct basic_filter *f;
  190. list_for_each_entry(f, &head->flist, link) {
  191. if (arg->count < arg->skip)
  192. goto skip;
  193. if (arg->fn(tp, (unsigned long) f, arg) < 0) {
  194. arg->stop = 1;
  195. break;
  196. }
  197. skip:
  198. arg->count++;
  199. }
  200. }
  201. static int basic_dump(struct net *net, struct tcf_proto *tp, unsigned long fh,
  202. struct sk_buff *skb, struct tcmsg *t)
  203. {
  204. struct basic_filter *f = (struct basic_filter *) fh;
  205. struct nlattr *nest;
  206. if (f == NULL)
  207. return skb->len;
  208. t->tcm_handle = f->handle;
  209. nest = nla_nest_start(skb, TCA_OPTIONS);
  210. if (nest == NULL)
  211. goto nla_put_failure;
  212. if (f->res.classid &&
  213. nla_put_u32(skb, TCA_BASIC_CLASSID, f->res.classid))
  214. goto nla_put_failure;
  215. if (tcf_exts_dump(skb, &f->exts) < 0 ||
  216. tcf_em_tree_dump(skb, &f->ematches, TCA_BASIC_EMATCHES) < 0)
  217. goto nla_put_failure;
  218. nla_nest_end(skb, nest);
  219. if (tcf_exts_dump_stats(skb, &f->exts) < 0)
  220. goto nla_put_failure;
  221. return skb->len;
  222. nla_put_failure:
  223. nla_nest_cancel(skb, nest);
  224. return -1;
  225. }
  226. static struct tcf_proto_ops cls_basic_ops __read_mostly = {
  227. .kind = "basic",
  228. .classify = basic_classify,
  229. .init = basic_init,
  230. .destroy = basic_destroy,
  231. .get = basic_get,
  232. .change = basic_change,
  233. .delete = basic_delete,
  234. .walk = basic_walk,
  235. .dump = basic_dump,
  236. .owner = THIS_MODULE,
  237. };
  238. static int __init init_basic(void)
  239. {
  240. return register_tcf_proto_ops(&cls_basic_ops);
  241. }
  242. static void __exit exit_basic(void)
  243. {
  244. unregister_tcf_proto_ops(&cls_basic_ops);
  245. }
  246. module_init(init_basic)
  247. module_exit(exit_basic)
  248. MODULE_LICENSE("GPL");