act_police.c 9.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406
  1. /*
  2. * net/sched/police.c Input police filter.
  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: Alexey Kuznetsov, <kuznet@ms2.inr.ac.ru>
  10. * J Hadi Salim (action changes)
  11. */
  12. #include <linux/module.h>
  13. #include <linux/types.h>
  14. #include <linux/kernel.h>
  15. #include <linux/string.h>
  16. #include <linux/errno.h>
  17. #include <linux/skbuff.h>
  18. #include <linux/rtnetlink.h>
  19. #include <linux/init.h>
  20. #include <linux/slab.h>
  21. #include <net/act_api.h>
  22. #include <net/netlink.h>
  23. #define L2T(p, L) qdisc_l2t((p)->tcfp_R_tab, L)
  24. #define L2T_P(p, L) qdisc_l2t((p)->tcfp_P_tab, L)
  25. #define POL_TAB_MASK 15
  26. static struct tcf_common *tcf_police_ht[POL_TAB_MASK + 1];
  27. static u32 police_idx_gen;
  28. static DEFINE_RWLOCK(police_lock);
  29. static struct tcf_hashinfo police_hash_info = {
  30. .htab = tcf_police_ht,
  31. .hmask = POL_TAB_MASK,
  32. .lock = &police_lock,
  33. };
  34. /* old policer structure from before tc actions */
  35. struct tc_police_compat {
  36. u32 index;
  37. int action;
  38. u32 limit;
  39. u32 burst;
  40. u32 mtu;
  41. struct tc_ratespec rate;
  42. struct tc_ratespec peakrate;
  43. };
  44. /* Each policer is serialized by its individual spinlock */
  45. static int tcf_act_police_walker(struct sk_buff *skb, struct netlink_callback *cb,
  46. int type, struct tc_action *a)
  47. {
  48. struct tcf_common *p;
  49. int err = 0, index = -1, i = 0, s_i = 0, n_i = 0;
  50. struct nlattr *nest;
  51. read_lock_bh(&police_lock);
  52. s_i = cb->args[0];
  53. for (i = 0; i < (POL_TAB_MASK + 1); i++) {
  54. p = tcf_police_ht[tcf_hash(i, POL_TAB_MASK)];
  55. for (; p; p = p->tcfc_next) {
  56. index++;
  57. if (index < s_i)
  58. continue;
  59. a->priv = p;
  60. a->order = index;
  61. nest = nla_nest_start(skb, a->order);
  62. if (nest == NULL)
  63. goto nla_put_failure;
  64. if (type == RTM_DELACTION)
  65. err = tcf_action_dump_1(skb, a, 0, 1);
  66. else
  67. err = tcf_action_dump_1(skb, a, 0, 0);
  68. if (err < 0) {
  69. index--;
  70. nla_nest_cancel(skb, nest);
  71. goto done;
  72. }
  73. nla_nest_end(skb, nest);
  74. n_i++;
  75. }
  76. }
  77. done:
  78. read_unlock_bh(&police_lock);
  79. if (n_i)
  80. cb->args[0] += n_i;
  81. return n_i;
  82. nla_put_failure:
  83. nla_nest_cancel(skb, nest);
  84. goto done;
  85. }
  86. static void tcf_police_destroy(struct tcf_police *p)
  87. {
  88. unsigned int h = tcf_hash(p->tcf_index, POL_TAB_MASK);
  89. struct tcf_common **p1p;
  90. for (p1p = &tcf_police_ht[h]; *p1p; p1p = &(*p1p)->tcfc_next) {
  91. if (*p1p == &p->common) {
  92. write_lock_bh(&police_lock);
  93. *p1p = p->tcf_next;
  94. write_unlock_bh(&police_lock);
  95. gen_kill_estimator(&p->tcf_bstats,
  96. &p->tcf_rate_est);
  97. if (p->tcfp_R_tab)
  98. qdisc_put_rtab(p->tcfp_R_tab);
  99. if (p->tcfp_P_tab)
  100. qdisc_put_rtab(p->tcfp_P_tab);
  101. /*
  102. * gen_estimator est_timer() might access p->tcf_lock
  103. * or bstats, wait a RCU grace period before freeing p
  104. */
  105. kfree_rcu(p, tcf_rcu);
  106. return;
  107. }
  108. }
  109. WARN_ON(1);
  110. }
  111. static const struct nla_policy police_policy[TCA_POLICE_MAX + 1] = {
  112. [TCA_POLICE_RATE] = { .len = TC_RTAB_SIZE },
  113. [TCA_POLICE_PEAKRATE] = { .len = TC_RTAB_SIZE },
  114. [TCA_POLICE_AVRATE] = { .type = NLA_U32 },
  115. [TCA_POLICE_RESULT] = { .type = NLA_U32 },
  116. };
  117. static int tcf_act_police_locate(struct net *net, struct nlattr *nla,
  118. struct nlattr *est, struct tc_action *a,
  119. int ovr, int bind)
  120. {
  121. unsigned int h;
  122. int ret = 0, err;
  123. struct nlattr *tb[TCA_POLICE_MAX + 1];
  124. struct tc_police *parm;
  125. struct tcf_police *police;
  126. struct qdisc_rate_table *R_tab = NULL, *P_tab = NULL;
  127. int size;
  128. if (nla == NULL)
  129. return -EINVAL;
  130. err = nla_parse_nested(tb, TCA_POLICE_MAX, nla, police_policy);
  131. if (err < 0)
  132. return err;
  133. if (tb[TCA_POLICE_TBF] == NULL)
  134. return -EINVAL;
  135. size = nla_len(tb[TCA_POLICE_TBF]);
  136. if (size != sizeof(*parm) && size != sizeof(struct tc_police_compat))
  137. return -EINVAL;
  138. parm = nla_data(tb[TCA_POLICE_TBF]);
  139. if (parm->index) {
  140. struct tcf_common *pc;
  141. pc = tcf_hash_lookup(parm->index, &police_hash_info);
  142. if (pc != NULL) {
  143. a->priv = pc;
  144. police = to_police(pc);
  145. if (bind) {
  146. police->tcf_bindcnt += 1;
  147. police->tcf_refcnt += 1;
  148. }
  149. if (ovr)
  150. goto override;
  151. return ret;
  152. }
  153. }
  154. police = kzalloc(sizeof(*police), GFP_KERNEL);
  155. if (police == NULL)
  156. return -ENOMEM;
  157. ret = ACT_P_CREATED;
  158. police->tcf_refcnt = 1;
  159. spin_lock_init(&police->tcf_lock);
  160. if (bind)
  161. police->tcf_bindcnt = 1;
  162. override:
  163. if (parm->rate.rate) {
  164. err = -ENOMEM;
  165. R_tab = qdisc_get_rtab(&parm->rate, tb[TCA_POLICE_RATE]);
  166. if (R_tab == NULL)
  167. goto failure;
  168. if (parm->peakrate.rate) {
  169. P_tab = qdisc_get_rtab(&parm->peakrate,
  170. tb[TCA_POLICE_PEAKRATE]);
  171. if (P_tab == NULL)
  172. goto failure;
  173. }
  174. }
  175. spin_lock_bh(&police->tcf_lock);
  176. if (est) {
  177. err = gen_replace_estimator(&police->tcf_bstats,
  178. &police->tcf_rate_est,
  179. &police->tcf_lock, est);
  180. if (err)
  181. goto failure_unlock;
  182. } else if (tb[TCA_POLICE_AVRATE] &&
  183. (ret == ACT_P_CREATED ||
  184. !gen_estimator_active(&police->tcf_bstats,
  185. &police->tcf_rate_est))) {
  186. err = -EINVAL;
  187. goto failure_unlock;
  188. }
  189. /* No failure allowed after this point */
  190. if (R_tab != NULL) {
  191. qdisc_put_rtab(police->tcfp_R_tab);
  192. police->tcfp_R_tab = R_tab;
  193. }
  194. if (P_tab != NULL) {
  195. qdisc_put_rtab(police->tcfp_P_tab);
  196. police->tcfp_P_tab = P_tab;
  197. }
  198. if (tb[TCA_POLICE_RESULT])
  199. police->tcfp_result = nla_get_u32(tb[TCA_POLICE_RESULT]);
  200. police->tcfp_toks = police->tcfp_burst = parm->burst;
  201. police->tcfp_mtu = parm->mtu;
  202. if (police->tcfp_mtu == 0) {
  203. police->tcfp_mtu = ~0;
  204. if (police->tcfp_R_tab)
  205. police->tcfp_mtu = 255<<police->tcfp_R_tab->rate.cell_log;
  206. }
  207. if (police->tcfp_P_tab)
  208. police->tcfp_ptoks = L2T_P(police, police->tcfp_mtu);
  209. police->tcf_action = parm->action;
  210. if (tb[TCA_POLICE_AVRATE])
  211. police->tcfp_ewma_rate = nla_get_u32(tb[TCA_POLICE_AVRATE]);
  212. spin_unlock_bh(&police->tcf_lock);
  213. if (ret != ACT_P_CREATED)
  214. return ret;
  215. police->tcfp_t_c = psched_get_time();
  216. police->tcf_index = parm->index ? parm->index :
  217. tcf_hash_new_index(&police_idx_gen, &police_hash_info);
  218. h = tcf_hash(police->tcf_index, POL_TAB_MASK);
  219. write_lock_bh(&police_lock);
  220. police->tcf_next = tcf_police_ht[h];
  221. tcf_police_ht[h] = &police->common;
  222. write_unlock_bh(&police_lock);
  223. a->priv = police;
  224. return ret;
  225. failure_unlock:
  226. spin_unlock_bh(&police->tcf_lock);
  227. failure:
  228. if (P_tab)
  229. qdisc_put_rtab(P_tab);
  230. if (R_tab)
  231. qdisc_put_rtab(R_tab);
  232. if (ret == ACT_P_CREATED)
  233. kfree(police);
  234. return err;
  235. }
  236. static int tcf_act_police_cleanup(struct tc_action *a, int bind)
  237. {
  238. struct tcf_police *p = a->priv;
  239. int ret = 0;
  240. if (p != NULL) {
  241. if (bind)
  242. p->tcf_bindcnt--;
  243. p->tcf_refcnt--;
  244. if (p->tcf_refcnt <= 0 && !p->tcf_bindcnt) {
  245. tcf_police_destroy(p);
  246. ret = 1;
  247. }
  248. }
  249. return ret;
  250. }
  251. static int tcf_act_police(struct sk_buff *skb, const struct tc_action *a,
  252. struct tcf_result *res)
  253. {
  254. struct tcf_police *police = a->priv;
  255. psched_time_t now;
  256. long toks;
  257. long ptoks = 0;
  258. spin_lock(&police->tcf_lock);
  259. bstats_update(&police->tcf_bstats, skb);
  260. if (police->tcfp_ewma_rate &&
  261. police->tcf_rate_est.bps >= police->tcfp_ewma_rate) {
  262. police->tcf_qstats.overlimits++;
  263. if (police->tcf_action == TC_ACT_SHOT)
  264. police->tcf_qstats.drops++;
  265. spin_unlock(&police->tcf_lock);
  266. return police->tcf_action;
  267. }
  268. if (qdisc_pkt_len(skb) <= police->tcfp_mtu) {
  269. if (police->tcfp_R_tab == NULL) {
  270. spin_unlock(&police->tcf_lock);
  271. return police->tcfp_result;
  272. }
  273. now = psched_get_time();
  274. toks = psched_tdiff_bounded(now, police->tcfp_t_c,
  275. police->tcfp_burst);
  276. if (police->tcfp_P_tab) {
  277. ptoks = toks + police->tcfp_ptoks;
  278. if (ptoks > (long)L2T_P(police, police->tcfp_mtu))
  279. ptoks = (long)L2T_P(police, police->tcfp_mtu);
  280. ptoks -= L2T_P(police, qdisc_pkt_len(skb));
  281. }
  282. toks += police->tcfp_toks;
  283. if (toks > (long)police->tcfp_burst)
  284. toks = police->tcfp_burst;
  285. toks -= L2T(police, qdisc_pkt_len(skb));
  286. if ((toks|ptoks) >= 0) {
  287. police->tcfp_t_c = now;
  288. police->tcfp_toks = toks;
  289. police->tcfp_ptoks = ptoks;
  290. spin_unlock(&police->tcf_lock);
  291. return police->tcfp_result;
  292. }
  293. }
  294. police->tcf_qstats.overlimits++;
  295. if (police->tcf_action == TC_ACT_SHOT)
  296. police->tcf_qstats.drops++;
  297. spin_unlock(&police->tcf_lock);
  298. return police->tcf_action;
  299. }
  300. static int
  301. tcf_act_police_dump(struct sk_buff *skb, struct tc_action *a, int bind, int ref)
  302. {
  303. unsigned char *b = skb_tail_pointer(skb);
  304. struct tcf_police *police = a->priv;
  305. struct tc_police opt = {
  306. .index = police->tcf_index,
  307. .action = police->tcf_action,
  308. .mtu = police->tcfp_mtu,
  309. .burst = police->tcfp_burst,
  310. .refcnt = police->tcf_refcnt - ref,
  311. .bindcnt = police->tcf_bindcnt - bind,
  312. };
  313. if (police->tcfp_R_tab)
  314. opt.rate = police->tcfp_R_tab->rate;
  315. if (police->tcfp_P_tab)
  316. opt.peakrate = police->tcfp_P_tab->rate;
  317. if (nla_put(skb, TCA_POLICE_TBF, sizeof(opt), &opt))
  318. goto nla_put_failure;
  319. if (police->tcfp_result &&
  320. nla_put_u32(skb, TCA_POLICE_RESULT, police->tcfp_result))
  321. goto nla_put_failure;
  322. if (police->tcfp_ewma_rate &&
  323. nla_put_u32(skb, TCA_POLICE_AVRATE, police->tcfp_ewma_rate))
  324. goto nla_put_failure;
  325. return skb->len;
  326. nla_put_failure:
  327. nlmsg_trim(skb, b);
  328. return -1;
  329. }
  330. MODULE_AUTHOR("Alexey Kuznetsov");
  331. MODULE_DESCRIPTION("Policing actions");
  332. MODULE_LICENSE("GPL");
  333. static struct tc_action_ops act_police_ops = {
  334. .kind = "police",
  335. .hinfo = &police_hash_info,
  336. .type = TCA_ID_POLICE,
  337. .capab = TCA_CAP_NONE,
  338. .owner = THIS_MODULE,
  339. .act = tcf_act_police,
  340. .dump = tcf_act_police_dump,
  341. .cleanup = tcf_act_police_cleanup,
  342. .lookup = tcf_hash_search,
  343. .init = tcf_act_police_locate,
  344. .walk = tcf_act_police_walker
  345. };
  346. static int __init
  347. police_init_module(void)
  348. {
  349. return tcf_register_action(&act_police_ops);
  350. }
  351. static void __exit
  352. police_cleanup_module(void)
  353. {
  354. tcf_unregister_action(&act_police_ops);
  355. }
  356. module_init(police_init_module);
  357. module_exit(police_cleanup_module);