act_pedit.c 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264
  1. /*
  2. * net/sched/pedit.c Generic packet editor
  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 (2002-4)
  10. */
  11. #include <asm/uaccess.h>
  12. #include <asm/system.h>
  13. #include <asm/bitops.h>
  14. #include <linux/types.h>
  15. #include <linux/kernel.h>
  16. #include <linux/string.h>
  17. #include <linux/mm.h>
  18. #include <linux/socket.h>
  19. #include <linux/sockios.h>
  20. #include <linux/in.h>
  21. #include <linux/errno.h>
  22. #include <linux/interrupt.h>
  23. #include <linux/netdevice.h>
  24. #include <linux/skbuff.h>
  25. #include <linux/rtnetlink.h>
  26. #include <linux/module.h>
  27. #include <linux/init.h>
  28. #include <linux/proc_fs.h>
  29. #include <net/sock.h>
  30. #include <net/pkt_sched.h>
  31. #include <linux/tc_act/tc_pedit.h>
  32. #include <net/tc_act/tc_pedit.h>
  33. #define PEDIT_TAB_MASK 15
  34. static struct tcf_common *tcf_pedit_ht[PEDIT_TAB_MASK + 1];
  35. static u32 pedit_idx_gen;
  36. static DEFINE_RWLOCK(pedit_lock);
  37. static struct tcf_hashinfo pedit_hash_info = {
  38. .htab = tcf_pedit_ht,
  39. .hmask = PEDIT_TAB_MASK,
  40. .lock = &pedit_lock,
  41. };
  42. static int tcf_pedit_init(struct rtattr *rta, struct rtattr *est,
  43. struct tc_action *a, int ovr, int bind)
  44. {
  45. struct rtattr *tb[TCA_PEDIT_MAX];
  46. struct tc_pedit *parm;
  47. int ret = 0;
  48. struct tcf_pedit *p;
  49. struct tcf_common *pc;
  50. struct tc_pedit_key *keys = NULL;
  51. int ksize;
  52. if (rta == NULL || rtattr_parse_nested(tb, TCA_PEDIT_MAX, rta) < 0)
  53. return -EINVAL;
  54. if (tb[TCA_PEDIT_PARMS - 1] == NULL ||
  55. RTA_PAYLOAD(tb[TCA_PEDIT_PARMS-1]) < sizeof(*parm))
  56. return -EINVAL;
  57. parm = RTA_DATA(tb[TCA_PEDIT_PARMS-1]);
  58. ksize = parm->nkeys * sizeof(struct tc_pedit_key);
  59. if (RTA_PAYLOAD(tb[TCA_PEDIT_PARMS-1]) < sizeof(*parm) + ksize)
  60. return -EINVAL;
  61. pc = tcf_hash_check(parm->index, a, bind, &pedit_hash_info);
  62. if (!pc) {
  63. if (!parm->nkeys)
  64. return -EINVAL;
  65. pc = tcf_hash_create(parm->index, est, a, sizeof(*p), bind,
  66. &pedit_idx_gen, &pedit_hash_info);
  67. if (unlikely(!pc))
  68. return -ENOMEM;
  69. p = to_pedit(pc);
  70. keys = kmalloc(ksize, GFP_KERNEL);
  71. if (keys == NULL) {
  72. kfree(pc);
  73. return -ENOMEM;
  74. }
  75. ret = ACT_P_CREATED;
  76. } else {
  77. p = to_pedit(pc);
  78. if (!ovr) {
  79. tcf_hash_release(pc, bind, &pedit_hash_info);
  80. return -EEXIST;
  81. }
  82. if (p->tcfp_nkeys && p->tcfp_nkeys != parm->nkeys) {
  83. keys = kmalloc(ksize, GFP_KERNEL);
  84. if (keys == NULL)
  85. return -ENOMEM;
  86. }
  87. }
  88. spin_lock_bh(&p->tcf_lock);
  89. p->tcfp_flags = parm->flags;
  90. p->tcf_action = parm->action;
  91. if (keys) {
  92. kfree(p->tcfp_keys);
  93. p->tcfp_keys = keys;
  94. p->tcfp_nkeys = parm->nkeys;
  95. }
  96. memcpy(p->tcfp_keys, parm->keys, ksize);
  97. spin_unlock_bh(&p->tcf_lock);
  98. if (ret == ACT_P_CREATED)
  99. tcf_hash_insert(pc, &pedit_hash_info);
  100. return ret;
  101. }
  102. static int tcf_pedit_cleanup(struct tc_action *a, int bind)
  103. {
  104. struct tcf_pedit *p = a->priv;
  105. if (p) {
  106. struct tc_pedit_key *keys = p->tcfp_keys;
  107. if (tcf_hash_release(&p->common, bind, &pedit_hash_info)) {
  108. kfree(keys);
  109. return 1;
  110. }
  111. }
  112. return 0;
  113. }
  114. static int tcf_pedit(struct sk_buff *skb, struct tc_action *a,
  115. struct tcf_result *res)
  116. {
  117. struct tcf_pedit *p = a->priv;
  118. int i, munged = 0;
  119. u8 *pptr;
  120. if (!(skb->tc_verd & TC_OK2MUNGE)) {
  121. /* should we set skb->cloned? */
  122. if (pskb_expand_head(skb, 0, 0, GFP_ATOMIC)) {
  123. return p->tcf_action;
  124. }
  125. }
  126. pptr = skb->nh.raw;
  127. spin_lock(&p->tcf_lock);
  128. p->tcf_tm.lastuse = jiffies;
  129. if (p->tcfp_nkeys > 0) {
  130. struct tc_pedit_key *tkey = p->tcfp_keys;
  131. for (i = p->tcfp_nkeys; i > 0; i--, tkey++) {
  132. u32 *ptr;
  133. int offset = tkey->off;
  134. if (tkey->offmask) {
  135. if (skb->len > tkey->at) {
  136. char *j = pptr + tkey->at;
  137. offset += ((*j & tkey->offmask) >>
  138. tkey->shift);
  139. } else {
  140. goto bad;
  141. }
  142. }
  143. if (offset % 4) {
  144. printk("offset must be on 32 bit boundaries\n");
  145. goto bad;
  146. }
  147. if (skb->len < 0 ||
  148. (offset > 0 && offset > skb->len)) {
  149. printk("offset %d cant exceed pkt length %d\n",
  150. offset, skb->len);
  151. goto bad;
  152. }
  153. ptr = (u32 *)(pptr+offset);
  154. /* just do it, baby */
  155. *ptr = ((*ptr & tkey->mask) ^ tkey->val);
  156. munged++;
  157. }
  158. if (munged)
  159. skb->tc_verd = SET_TC_MUNGED(skb->tc_verd);
  160. goto done;
  161. } else {
  162. printk("pedit BUG: index %d\n", p->tcf_index);
  163. }
  164. bad:
  165. p->tcf_qstats.overlimits++;
  166. done:
  167. p->tcf_bstats.bytes += skb->len;
  168. p->tcf_bstats.packets++;
  169. spin_unlock(&p->tcf_lock);
  170. return p->tcf_action;
  171. }
  172. static int tcf_pedit_dump(struct sk_buff *skb, struct tc_action *a,
  173. int bind, int ref)
  174. {
  175. unsigned char *b = skb->tail;
  176. struct tcf_pedit *p = a->priv;
  177. struct tc_pedit *opt;
  178. struct tcf_t t;
  179. int s;
  180. s = sizeof(*opt) + p->tcfp_nkeys * sizeof(struct tc_pedit_key);
  181. /* netlink spinlocks held above us - must use ATOMIC */
  182. opt = kzalloc(s, GFP_ATOMIC);
  183. if (unlikely(!opt))
  184. return -ENOBUFS;
  185. memcpy(opt->keys, p->tcfp_keys,
  186. p->tcfp_nkeys * sizeof(struct tc_pedit_key));
  187. opt->index = p->tcf_index;
  188. opt->nkeys = p->tcfp_nkeys;
  189. opt->flags = p->tcfp_flags;
  190. opt->action = p->tcf_action;
  191. opt->refcnt = p->tcf_refcnt - ref;
  192. opt->bindcnt = p->tcf_bindcnt - bind;
  193. RTA_PUT(skb, TCA_PEDIT_PARMS, s, opt);
  194. t.install = jiffies_to_clock_t(jiffies - p->tcf_tm.install);
  195. t.lastuse = jiffies_to_clock_t(jiffies - p->tcf_tm.lastuse);
  196. t.expires = jiffies_to_clock_t(p->tcf_tm.expires);
  197. RTA_PUT(skb, TCA_PEDIT_TM, sizeof(t), &t);
  198. kfree(opt);
  199. return skb->len;
  200. rtattr_failure:
  201. skb_trim(skb, b - skb->data);
  202. kfree(opt);
  203. return -1;
  204. }
  205. static struct tc_action_ops act_pedit_ops = {
  206. .kind = "pedit",
  207. .hinfo = &pedit_hash_info,
  208. .type = TCA_ACT_PEDIT,
  209. .capab = TCA_CAP_NONE,
  210. .owner = THIS_MODULE,
  211. .act = tcf_pedit,
  212. .dump = tcf_pedit_dump,
  213. .cleanup = tcf_pedit_cleanup,
  214. .lookup = tcf_hash_search,
  215. .init = tcf_pedit_init,
  216. .walk = tcf_generic_walker
  217. };
  218. MODULE_AUTHOR("Jamal Hadi Salim(2002-4)");
  219. MODULE_DESCRIPTION("Generic Packet Editor actions");
  220. MODULE_LICENSE("GPL");
  221. static int __init pedit_init_module(void)
  222. {
  223. return tcf_register_action(&act_pedit_ops);
  224. }
  225. static void __exit pedit_cleanup_module(void)
  226. {
  227. tcf_unregister_action(&act_pedit_ops);
  228. }
  229. module_init(pedit_init_module);
  230. module_exit(pedit_cleanup_module);