act_pedit.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267
  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 <linux/types.h>
  12. #include <linux/kernel.h>
  13. #include <linux/string.h>
  14. #include <linux/errno.h>
  15. #include <linux/skbuff.h>
  16. #include <linux/rtnetlink.h>
  17. #include <linux/module.h>
  18. #include <linux/init.h>
  19. #include <linux/slab.h>
  20. #include <net/netlink.h>
  21. #include <net/pkt_sched.h>
  22. #include <linux/tc_act/tc_pedit.h>
  23. #include <net/tc_act/tc_pedit.h>
  24. #define PEDIT_TAB_MASK 15
  25. static struct tcf_common *tcf_pedit_ht[PEDIT_TAB_MASK + 1];
  26. static u32 pedit_idx_gen;
  27. static DEFINE_RWLOCK(pedit_lock);
  28. static struct tcf_hashinfo pedit_hash_info = {
  29. .htab = tcf_pedit_ht,
  30. .hmask = PEDIT_TAB_MASK,
  31. .lock = &pedit_lock,
  32. };
  33. static const struct nla_policy pedit_policy[TCA_PEDIT_MAX + 1] = {
  34. [TCA_PEDIT_PARMS] = { .len = sizeof(struct tc_pedit) },
  35. };
  36. static int tcf_pedit_init(struct net *net, struct nlattr *nla,
  37. struct nlattr *est, struct tc_action *a,
  38. int ovr, int bind)
  39. {
  40. struct nlattr *tb[TCA_PEDIT_MAX + 1];
  41. struct tc_pedit *parm;
  42. int ret = 0, err;
  43. struct tcf_pedit *p;
  44. struct tcf_common *pc;
  45. struct tc_pedit_key *keys = NULL;
  46. int ksize;
  47. if (nla == NULL)
  48. return -EINVAL;
  49. err = nla_parse_nested(tb, TCA_PEDIT_MAX, nla, pedit_policy);
  50. if (err < 0)
  51. return err;
  52. if (tb[TCA_PEDIT_PARMS] == NULL)
  53. return -EINVAL;
  54. parm = nla_data(tb[TCA_PEDIT_PARMS]);
  55. ksize = parm->nkeys * sizeof(struct tc_pedit_key);
  56. if (nla_len(tb[TCA_PEDIT_PARMS]) < sizeof(*parm) + ksize)
  57. return -EINVAL;
  58. pc = tcf_hash_check(parm->index, a, bind, &pedit_hash_info);
  59. if (!pc) {
  60. if (!parm->nkeys)
  61. return -EINVAL;
  62. pc = tcf_hash_create(parm->index, est, a, sizeof(*p), bind,
  63. &pedit_idx_gen, &pedit_hash_info);
  64. if (IS_ERR(pc))
  65. return PTR_ERR(pc);
  66. p = to_pedit(pc);
  67. keys = kmalloc(ksize, GFP_KERNEL);
  68. if (keys == NULL) {
  69. if (est)
  70. gen_kill_estimator(&pc->tcfc_bstats,
  71. &pc->tcfc_rate_est);
  72. kfree_rcu(pc, tcfc_rcu);
  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, const struct tc_action *a,
  115. struct tcf_result *res)
  116. {
  117. struct tcf_pedit *p = a->priv;
  118. int i, munged = 0;
  119. unsigned int off;
  120. if (skb_unclone(skb, GFP_ATOMIC))
  121. return p->tcf_action;
  122. off = skb_network_offset(skb);
  123. spin_lock(&p->tcf_lock);
  124. p->tcf_tm.lastuse = jiffies;
  125. if (p->tcfp_nkeys > 0) {
  126. struct tc_pedit_key *tkey = p->tcfp_keys;
  127. for (i = p->tcfp_nkeys; i > 0; i--, tkey++) {
  128. u32 *ptr, _data;
  129. int offset = tkey->off;
  130. if (tkey->offmask) {
  131. char *d, _d;
  132. d = skb_header_pointer(skb, off + tkey->at, 1,
  133. &_d);
  134. if (!d)
  135. goto bad;
  136. offset += (*d & tkey->offmask) >> tkey->shift;
  137. }
  138. if (offset % 4) {
  139. pr_info("tc filter pedit"
  140. " offset must be on 32 bit boundaries\n");
  141. goto bad;
  142. }
  143. if (offset > 0 && offset > skb->len) {
  144. pr_info("tc filter pedit"
  145. " offset %d can't exceed pkt length %d\n",
  146. offset, skb->len);
  147. goto bad;
  148. }
  149. ptr = skb_header_pointer(skb, off + offset, 4, &_data);
  150. if (!ptr)
  151. goto bad;
  152. /* just do it, baby */
  153. *ptr = ((*ptr & tkey->mask) ^ tkey->val);
  154. if (ptr == &_data)
  155. skb_store_bits(skb, off + offset, ptr, 4);
  156. munged++;
  157. }
  158. if (munged)
  159. skb->tc_verd = SET_TC_MUNGED(skb->tc_verd);
  160. goto done;
  161. } else
  162. WARN(1, "pedit BUG: index %d\n", p->tcf_index);
  163. bad:
  164. p->tcf_qstats.overlimits++;
  165. done:
  166. bstats_update(&p->tcf_bstats, skb);
  167. spin_unlock(&p->tcf_lock);
  168. return p->tcf_action;
  169. }
  170. static int tcf_pedit_dump(struct sk_buff *skb, struct tc_action *a,
  171. int bind, int ref)
  172. {
  173. unsigned char *b = skb_tail_pointer(skb);
  174. struct tcf_pedit *p = a->priv;
  175. struct tc_pedit *opt;
  176. struct tcf_t t;
  177. int s;
  178. s = sizeof(*opt) + p->tcfp_nkeys * sizeof(struct tc_pedit_key);
  179. /* netlink spinlocks held above us - must use ATOMIC */
  180. opt = kzalloc(s, GFP_ATOMIC);
  181. if (unlikely(!opt))
  182. return -ENOBUFS;
  183. memcpy(opt->keys, p->tcfp_keys,
  184. p->tcfp_nkeys * sizeof(struct tc_pedit_key));
  185. opt->index = p->tcf_index;
  186. opt->nkeys = p->tcfp_nkeys;
  187. opt->flags = p->tcfp_flags;
  188. opt->action = p->tcf_action;
  189. opt->refcnt = p->tcf_refcnt - ref;
  190. opt->bindcnt = p->tcf_bindcnt - bind;
  191. if (nla_put(skb, TCA_PEDIT_PARMS, s, opt))
  192. goto nla_put_failure;
  193. t.install = jiffies_to_clock_t(jiffies - p->tcf_tm.install);
  194. t.lastuse = jiffies_to_clock_t(jiffies - p->tcf_tm.lastuse);
  195. t.expires = jiffies_to_clock_t(p->tcf_tm.expires);
  196. if (nla_put(skb, TCA_PEDIT_TM, sizeof(t), &t))
  197. goto nla_put_failure;
  198. kfree(opt);
  199. return skb->len;
  200. nla_put_failure:
  201. nlmsg_trim(skb, b);
  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);