act_simple.c 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239
  1. /*
  2. * net/sched/act_simple.c Simple example of an action
  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: Jamal Hadi Salim (2005-8)
  10. *
  11. */
  12. #include <linux/module.h>
  13. #include <linux/slab.h>
  14. #include <linux/init.h>
  15. #include <linux/kernel.h>
  16. #include <linux/skbuff.h>
  17. #include <linux/rtnetlink.h>
  18. #include <net/netlink.h>
  19. #include <net/pkt_sched.h>
  20. #define TCA_ACT_SIMP 22
  21. #include <linux/tc_act/tc_defact.h>
  22. #include <net/tc_act/tc_defact.h>
  23. static unsigned int simp_net_id;
  24. static struct tc_action_ops act_simp_ops;
  25. #define SIMP_MAX_DATA 32
  26. static int tcf_simp(struct sk_buff *skb, const struct tc_action *a,
  27. struct tcf_result *res)
  28. {
  29. struct tcf_defact *d = to_defact(a);
  30. spin_lock(&d->tcf_lock);
  31. tcf_lastuse_update(&d->tcf_tm);
  32. bstats_update(&d->tcf_bstats, skb);
  33. /* print policy string followed by _ then packet count
  34. * Example if this was the 3rd packet and the string was "hello"
  35. * then it would look like "hello_3" (without quotes)
  36. */
  37. pr_info("simple: %s_%d\n",
  38. (char *)d->tcfd_defdata, d->tcf_bstats.packets);
  39. spin_unlock(&d->tcf_lock);
  40. return d->tcf_action;
  41. }
  42. static void tcf_simp_release(struct tc_action *a, int bind)
  43. {
  44. struct tcf_defact *d = to_defact(a);
  45. kfree(d->tcfd_defdata);
  46. }
  47. static int alloc_defdata(struct tcf_defact *d, char *defdata)
  48. {
  49. d->tcfd_defdata = kzalloc(SIMP_MAX_DATA, GFP_KERNEL);
  50. if (unlikely(!d->tcfd_defdata))
  51. return -ENOMEM;
  52. strlcpy(d->tcfd_defdata, defdata, SIMP_MAX_DATA);
  53. return 0;
  54. }
  55. static void reset_policy(struct tcf_defact *d, char *defdata,
  56. struct tc_defact *p)
  57. {
  58. spin_lock_bh(&d->tcf_lock);
  59. d->tcf_action = p->action;
  60. memset(d->tcfd_defdata, 0, SIMP_MAX_DATA);
  61. strlcpy(d->tcfd_defdata, defdata, SIMP_MAX_DATA);
  62. spin_unlock_bh(&d->tcf_lock);
  63. }
  64. static const struct nla_policy simple_policy[TCA_DEF_MAX + 1] = {
  65. [TCA_DEF_PARMS] = { .len = sizeof(struct tc_defact) },
  66. [TCA_DEF_DATA] = { .type = NLA_STRING, .len = SIMP_MAX_DATA },
  67. };
  68. static int tcf_simp_init(struct net *net, struct nlattr *nla,
  69. struct nlattr *est, struct tc_action **a,
  70. int ovr, int bind)
  71. {
  72. struct tc_action_net *tn = net_generic(net, simp_net_id);
  73. struct nlattr *tb[TCA_DEF_MAX + 1];
  74. struct tc_defact *parm;
  75. struct tcf_defact *d;
  76. bool exists = false;
  77. int ret = 0, err;
  78. char *defdata;
  79. if (nla == NULL)
  80. return -EINVAL;
  81. err = nla_parse_nested(tb, TCA_DEF_MAX, nla, simple_policy, NULL);
  82. if (err < 0)
  83. return err;
  84. if (tb[TCA_DEF_PARMS] == NULL)
  85. return -EINVAL;
  86. parm = nla_data(tb[TCA_DEF_PARMS]);
  87. exists = tcf_idr_check(tn, parm->index, a, bind);
  88. if (exists && bind)
  89. return 0;
  90. if (tb[TCA_DEF_DATA] == NULL) {
  91. if (exists)
  92. tcf_idr_release(*a, bind);
  93. return -EINVAL;
  94. }
  95. defdata = nla_data(tb[TCA_DEF_DATA]);
  96. if (!exists) {
  97. ret = tcf_idr_create(tn, parm->index, est, a,
  98. &act_simp_ops, bind, false);
  99. if (ret)
  100. return ret;
  101. d = to_defact(*a);
  102. ret = alloc_defdata(d, defdata);
  103. if (ret < 0) {
  104. tcf_idr_cleanup(*a, est);
  105. return ret;
  106. }
  107. d->tcf_action = parm->action;
  108. ret = ACT_P_CREATED;
  109. } else {
  110. d = to_defact(*a);
  111. tcf_idr_release(*a, bind);
  112. if (!ovr)
  113. return -EEXIST;
  114. reset_policy(d, defdata, parm);
  115. }
  116. if (ret == ACT_P_CREATED)
  117. tcf_idr_insert(tn, *a);
  118. return ret;
  119. }
  120. static int tcf_simp_dump(struct sk_buff *skb, struct tc_action *a,
  121. int bind, int ref)
  122. {
  123. unsigned char *b = skb_tail_pointer(skb);
  124. struct tcf_defact *d = to_defact(a);
  125. struct tc_defact opt = {
  126. .index = d->tcf_index,
  127. .refcnt = d->tcf_refcnt - ref,
  128. .bindcnt = d->tcf_bindcnt - bind,
  129. .action = d->tcf_action,
  130. };
  131. struct tcf_t t;
  132. if (nla_put(skb, TCA_DEF_PARMS, sizeof(opt), &opt) ||
  133. nla_put_string(skb, TCA_DEF_DATA, d->tcfd_defdata))
  134. goto nla_put_failure;
  135. tcf_tm_dump(&t, &d->tcf_tm);
  136. if (nla_put_64bit(skb, TCA_DEF_TM, sizeof(t), &t, TCA_DEF_PAD))
  137. goto nla_put_failure;
  138. return skb->len;
  139. nla_put_failure:
  140. nlmsg_trim(skb, b);
  141. return -1;
  142. }
  143. static int tcf_simp_walker(struct net *net, struct sk_buff *skb,
  144. struct netlink_callback *cb, int type,
  145. const struct tc_action_ops *ops)
  146. {
  147. struct tc_action_net *tn = net_generic(net, simp_net_id);
  148. return tcf_generic_walker(tn, skb, cb, type, ops);
  149. }
  150. static int tcf_simp_search(struct net *net, struct tc_action **a, u32 index)
  151. {
  152. struct tc_action_net *tn = net_generic(net, simp_net_id);
  153. return tcf_idr_search(tn, a, index);
  154. }
  155. static struct tc_action_ops act_simp_ops = {
  156. .kind = "simple",
  157. .type = TCA_ACT_SIMP,
  158. .owner = THIS_MODULE,
  159. .act = tcf_simp,
  160. .dump = tcf_simp_dump,
  161. .cleanup = tcf_simp_release,
  162. .init = tcf_simp_init,
  163. .walk = tcf_simp_walker,
  164. .lookup = tcf_simp_search,
  165. .size = sizeof(struct tcf_defact),
  166. };
  167. static __net_init int simp_init_net(struct net *net)
  168. {
  169. struct tc_action_net *tn = net_generic(net, simp_net_id);
  170. return tc_action_net_init(tn, &act_simp_ops);
  171. }
  172. static void __net_exit simp_exit_net(struct net *net)
  173. {
  174. struct tc_action_net *tn = net_generic(net, simp_net_id);
  175. tc_action_net_exit(tn);
  176. }
  177. static struct pernet_operations simp_net_ops = {
  178. .init = simp_init_net,
  179. .exit = simp_exit_net,
  180. .id = &simp_net_id,
  181. .size = sizeof(struct tc_action_net),
  182. };
  183. MODULE_AUTHOR("Jamal Hadi Salim(2005)");
  184. MODULE_DESCRIPTION("Simple example action");
  185. MODULE_LICENSE("GPL");
  186. static int __init simp_init_module(void)
  187. {
  188. int ret = tcf_register_action(&act_simp_ops, &simp_net_ops);
  189. if (!ret)
  190. pr_info("Simple TC action Loaded\n");
  191. return ret;
  192. }
  193. static void __exit simp_cleanup_module(void)
  194. {
  195. tcf_unregister_action(&act_simp_ops, &simp_net_ops);
  196. }
  197. module_init(simp_init_module);
  198. module_exit(simp_cleanup_module);