act_bpf.c 9.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435
  1. /*
  2. * Copyright (c) 2015 Jiri Pirko <jiri@resnulli.us>
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  8. */
  9. #include <linux/module.h>
  10. #include <linux/init.h>
  11. #include <linux/kernel.h>
  12. #include <linux/skbuff.h>
  13. #include <linux/rtnetlink.h>
  14. #include <linux/filter.h>
  15. #include <linux/bpf.h>
  16. #include <net/netlink.h>
  17. #include <net/pkt_sched.h>
  18. #include <linux/tc_act/tc_bpf.h>
  19. #include <net/tc_act/tc_bpf.h>
  20. #define BPF_TAB_MASK 15
  21. #define ACT_BPF_NAME_LEN 256
  22. struct tcf_bpf_cfg {
  23. struct bpf_prog *filter;
  24. struct sock_filter *bpf_ops;
  25. const char *bpf_name;
  26. u32 bpf_fd;
  27. u16 bpf_num_ops;
  28. bool is_ebpf;
  29. };
  30. static int bpf_net_id;
  31. static struct tc_action_ops act_bpf_ops;
  32. static int tcf_bpf(struct sk_buff *skb, const struct tc_action *act,
  33. struct tcf_result *res)
  34. {
  35. struct tcf_bpf *prog = to_bpf(act);
  36. struct bpf_prog *filter;
  37. int action, filter_res;
  38. bool at_ingress = G_TC_AT(skb->tc_verd) & AT_INGRESS;
  39. if (unlikely(!skb_mac_header_was_set(skb)))
  40. return TC_ACT_UNSPEC;
  41. tcf_lastuse_update(&prog->tcf_tm);
  42. bstats_cpu_update(this_cpu_ptr(prog->common.cpu_bstats), skb);
  43. rcu_read_lock();
  44. filter = rcu_dereference(prog->filter);
  45. if (at_ingress) {
  46. __skb_push(skb, skb->mac_len);
  47. bpf_compute_data_end(skb);
  48. filter_res = BPF_PROG_RUN(filter, skb);
  49. __skb_pull(skb, skb->mac_len);
  50. } else {
  51. bpf_compute_data_end(skb);
  52. filter_res = BPF_PROG_RUN(filter, skb);
  53. }
  54. rcu_read_unlock();
  55. /* A BPF program may overwrite the default action opcode.
  56. * Similarly as in cls_bpf, if filter_res == -1 we use the
  57. * default action specified from tc.
  58. *
  59. * In case a different well-known TC_ACT opcode has been
  60. * returned, it will overwrite the default one.
  61. *
  62. * For everything else that is unkown, TC_ACT_UNSPEC is
  63. * returned.
  64. */
  65. switch (filter_res) {
  66. case TC_ACT_PIPE:
  67. case TC_ACT_RECLASSIFY:
  68. case TC_ACT_OK:
  69. case TC_ACT_REDIRECT:
  70. action = filter_res;
  71. break;
  72. case TC_ACT_SHOT:
  73. action = filter_res;
  74. qstats_drop_inc(this_cpu_ptr(prog->common.cpu_qstats));
  75. break;
  76. case TC_ACT_UNSPEC:
  77. action = prog->tcf_action;
  78. break;
  79. default:
  80. action = TC_ACT_UNSPEC;
  81. break;
  82. }
  83. return action;
  84. }
  85. static bool tcf_bpf_is_ebpf(const struct tcf_bpf *prog)
  86. {
  87. return !prog->bpf_ops;
  88. }
  89. static int tcf_bpf_dump_bpf_info(const struct tcf_bpf *prog,
  90. struct sk_buff *skb)
  91. {
  92. struct nlattr *nla;
  93. if (nla_put_u16(skb, TCA_ACT_BPF_OPS_LEN, prog->bpf_num_ops))
  94. return -EMSGSIZE;
  95. nla = nla_reserve(skb, TCA_ACT_BPF_OPS, prog->bpf_num_ops *
  96. sizeof(struct sock_filter));
  97. if (nla == NULL)
  98. return -EMSGSIZE;
  99. memcpy(nla_data(nla), prog->bpf_ops, nla_len(nla));
  100. return 0;
  101. }
  102. static int tcf_bpf_dump_ebpf_info(const struct tcf_bpf *prog,
  103. struct sk_buff *skb)
  104. {
  105. if (nla_put_u32(skb, TCA_ACT_BPF_FD, prog->bpf_fd))
  106. return -EMSGSIZE;
  107. if (prog->bpf_name &&
  108. nla_put_string(skb, TCA_ACT_BPF_NAME, prog->bpf_name))
  109. return -EMSGSIZE;
  110. return 0;
  111. }
  112. static int tcf_bpf_dump(struct sk_buff *skb, struct tc_action *act,
  113. int bind, int ref)
  114. {
  115. unsigned char *tp = skb_tail_pointer(skb);
  116. struct tcf_bpf *prog = to_bpf(act);
  117. struct tc_act_bpf opt = {
  118. .index = prog->tcf_index,
  119. .refcnt = prog->tcf_refcnt - ref,
  120. .bindcnt = prog->tcf_bindcnt - bind,
  121. .action = prog->tcf_action,
  122. };
  123. struct tcf_t tm;
  124. int ret;
  125. if (nla_put(skb, TCA_ACT_BPF_PARMS, sizeof(opt), &opt))
  126. goto nla_put_failure;
  127. if (tcf_bpf_is_ebpf(prog))
  128. ret = tcf_bpf_dump_ebpf_info(prog, skb);
  129. else
  130. ret = tcf_bpf_dump_bpf_info(prog, skb);
  131. if (ret)
  132. goto nla_put_failure;
  133. tcf_tm_dump(&tm, &prog->tcf_tm);
  134. if (nla_put_64bit(skb, TCA_ACT_BPF_TM, sizeof(tm), &tm,
  135. TCA_ACT_BPF_PAD))
  136. goto nla_put_failure;
  137. return skb->len;
  138. nla_put_failure:
  139. nlmsg_trim(skb, tp);
  140. return -1;
  141. }
  142. static const struct nla_policy act_bpf_policy[TCA_ACT_BPF_MAX + 1] = {
  143. [TCA_ACT_BPF_PARMS] = { .len = sizeof(struct tc_act_bpf) },
  144. [TCA_ACT_BPF_FD] = { .type = NLA_U32 },
  145. [TCA_ACT_BPF_NAME] = { .type = NLA_NUL_STRING,
  146. .len = ACT_BPF_NAME_LEN },
  147. [TCA_ACT_BPF_OPS_LEN] = { .type = NLA_U16 },
  148. [TCA_ACT_BPF_OPS] = { .type = NLA_BINARY,
  149. .len = sizeof(struct sock_filter) * BPF_MAXINSNS },
  150. };
  151. static int tcf_bpf_init_from_ops(struct nlattr **tb, struct tcf_bpf_cfg *cfg)
  152. {
  153. struct sock_filter *bpf_ops;
  154. struct sock_fprog_kern fprog_tmp;
  155. struct bpf_prog *fp;
  156. u16 bpf_size, bpf_num_ops;
  157. int ret;
  158. bpf_num_ops = nla_get_u16(tb[TCA_ACT_BPF_OPS_LEN]);
  159. if (bpf_num_ops > BPF_MAXINSNS || bpf_num_ops == 0)
  160. return -EINVAL;
  161. bpf_size = bpf_num_ops * sizeof(*bpf_ops);
  162. if (bpf_size != nla_len(tb[TCA_ACT_BPF_OPS]))
  163. return -EINVAL;
  164. bpf_ops = kzalloc(bpf_size, GFP_KERNEL);
  165. if (bpf_ops == NULL)
  166. return -ENOMEM;
  167. memcpy(bpf_ops, nla_data(tb[TCA_ACT_BPF_OPS]), bpf_size);
  168. fprog_tmp.len = bpf_num_ops;
  169. fprog_tmp.filter = bpf_ops;
  170. ret = bpf_prog_create(&fp, &fprog_tmp);
  171. if (ret < 0) {
  172. kfree(bpf_ops);
  173. return ret;
  174. }
  175. cfg->bpf_ops = bpf_ops;
  176. cfg->bpf_num_ops = bpf_num_ops;
  177. cfg->filter = fp;
  178. cfg->is_ebpf = false;
  179. return 0;
  180. }
  181. static int tcf_bpf_init_from_efd(struct nlattr **tb, struct tcf_bpf_cfg *cfg)
  182. {
  183. struct bpf_prog *fp;
  184. char *name = NULL;
  185. u32 bpf_fd;
  186. bpf_fd = nla_get_u32(tb[TCA_ACT_BPF_FD]);
  187. fp = bpf_prog_get_type(bpf_fd, BPF_PROG_TYPE_SCHED_ACT);
  188. if (IS_ERR(fp))
  189. return PTR_ERR(fp);
  190. if (tb[TCA_ACT_BPF_NAME]) {
  191. name = kmemdup(nla_data(tb[TCA_ACT_BPF_NAME]),
  192. nla_len(tb[TCA_ACT_BPF_NAME]),
  193. GFP_KERNEL);
  194. if (!name) {
  195. bpf_prog_put(fp);
  196. return -ENOMEM;
  197. }
  198. }
  199. cfg->bpf_fd = bpf_fd;
  200. cfg->bpf_name = name;
  201. cfg->filter = fp;
  202. cfg->is_ebpf = true;
  203. return 0;
  204. }
  205. static void tcf_bpf_cfg_cleanup(const struct tcf_bpf_cfg *cfg)
  206. {
  207. if (cfg->is_ebpf)
  208. bpf_prog_put(cfg->filter);
  209. else
  210. bpf_prog_destroy(cfg->filter);
  211. kfree(cfg->bpf_ops);
  212. kfree(cfg->bpf_name);
  213. }
  214. static void tcf_bpf_prog_fill_cfg(const struct tcf_bpf *prog,
  215. struct tcf_bpf_cfg *cfg)
  216. {
  217. cfg->is_ebpf = tcf_bpf_is_ebpf(prog);
  218. /* updates to prog->filter are prevented, since it's called either
  219. * with rtnl lock or during final cleanup in rcu callback
  220. */
  221. cfg->filter = rcu_dereference_protected(prog->filter, 1);
  222. cfg->bpf_ops = prog->bpf_ops;
  223. cfg->bpf_name = prog->bpf_name;
  224. }
  225. static int tcf_bpf_init(struct net *net, struct nlattr *nla,
  226. struct nlattr *est, struct tc_action **act,
  227. int replace, int bind)
  228. {
  229. struct tc_action_net *tn = net_generic(net, bpf_net_id);
  230. struct nlattr *tb[TCA_ACT_BPF_MAX + 1];
  231. struct tcf_bpf_cfg cfg, old;
  232. struct tc_act_bpf *parm;
  233. struct tcf_bpf *prog;
  234. bool is_bpf, is_ebpf;
  235. int ret, res = 0;
  236. if (!nla)
  237. return -EINVAL;
  238. ret = nla_parse_nested(tb, TCA_ACT_BPF_MAX, nla, act_bpf_policy);
  239. if (ret < 0)
  240. return ret;
  241. if (!tb[TCA_ACT_BPF_PARMS])
  242. return -EINVAL;
  243. parm = nla_data(tb[TCA_ACT_BPF_PARMS]);
  244. if (!tcf_hash_check(tn, parm->index, act, bind)) {
  245. ret = tcf_hash_create(tn, parm->index, est, act,
  246. &act_bpf_ops, bind, true);
  247. if (ret < 0)
  248. return ret;
  249. res = ACT_P_CREATED;
  250. } else {
  251. /* Don't override defaults. */
  252. if (bind)
  253. return 0;
  254. tcf_hash_release(*act, bind);
  255. if (!replace)
  256. return -EEXIST;
  257. }
  258. is_bpf = tb[TCA_ACT_BPF_OPS_LEN] && tb[TCA_ACT_BPF_OPS];
  259. is_ebpf = tb[TCA_ACT_BPF_FD];
  260. if ((!is_bpf && !is_ebpf) || (is_bpf && is_ebpf)) {
  261. ret = -EINVAL;
  262. goto out;
  263. }
  264. memset(&cfg, 0, sizeof(cfg));
  265. ret = is_bpf ? tcf_bpf_init_from_ops(tb, &cfg) :
  266. tcf_bpf_init_from_efd(tb, &cfg);
  267. if (ret < 0)
  268. goto out;
  269. prog = to_bpf(*act);
  270. ASSERT_RTNL();
  271. if (res != ACT_P_CREATED)
  272. tcf_bpf_prog_fill_cfg(prog, &old);
  273. prog->bpf_ops = cfg.bpf_ops;
  274. prog->bpf_name = cfg.bpf_name;
  275. if (cfg.bpf_num_ops)
  276. prog->bpf_num_ops = cfg.bpf_num_ops;
  277. if (cfg.bpf_fd)
  278. prog->bpf_fd = cfg.bpf_fd;
  279. prog->tcf_action = parm->action;
  280. rcu_assign_pointer(prog->filter, cfg.filter);
  281. if (res == ACT_P_CREATED) {
  282. tcf_hash_insert(tn, *act);
  283. } else {
  284. /* make sure the program being replaced is no longer executing */
  285. synchronize_rcu();
  286. tcf_bpf_cfg_cleanup(&old);
  287. }
  288. return res;
  289. out:
  290. if (res == ACT_P_CREATED)
  291. tcf_hash_cleanup(*act, est);
  292. return ret;
  293. }
  294. static void tcf_bpf_cleanup(struct tc_action *act, int bind)
  295. {
  296. struct tcf_bpf_cfg tmp;
  297. tcf_bpf_prog_fill_cfg(to_bpf(act), &tmp);
  298. tcf_bpf_cfg_cleanup(&tmp);
  299. }
  300. static int tcf_bpf_walker(struct net *net, struct sk_buff *skb,
  301. struct netlink_callback *cb, int type,
  302. const struct tc_action_ops *ops)
  303. {
  304. struct tc_action_net *tn = net_generic(net, bpf_net_id);
  305. return tcf_generic_walker(tn, skb, cb, type, ops);
  306. }
  307. static int tcf_bpf_search(struct net *net, struct tc_action **a, u32 index)
  308. {
  309. struct tc_action_net *tn = net_generic(net, bpf_net_id);
  310. return tcf_hash_search(tn, a, index);
  311. }
  312. static struct tc_action_ops act_bpf_ops __read_mostly = {
  313. .kind = "bpf",
  314. .type = TCA_ACT_BPF,
  315. .owner = THIS_MODULE,
  316. .act = tcf_bpf,
  317. .dump = tcf_bpf_dump,
  318. .cleanup = tcf_bpf_cleanup,
  319. .init = tcf_bpf_init,
  320. .walk = tcf_bpf_walker,
  321. .lookup = tcf_bpf_search,
  322. .size = sizeof(struct tcf_bpf),
  323. };
  324. static __net_init int bpf_init_net(struct net *net)
  325. {
  326. struct tc_action_net *tn = net_generic(net, bpf_net_id);
  327. return tc_action_net_init(tn, &act_bpf_ops, BPF_TAB_MASK);
  328. }
  329. static void __net_exit bpf_exit_net(struct net *net)
  330. {
  331. struct tc_action_net *tn = net_generic(net, bpf_net_id);
  332. tc_action_net_exit(tn);
  333. }
  334. static struct pernet_operations bpf_net_ops = {
  335. .init = bpf_init_net,
  336. .exit = bpf_exit_net,
  337. .id = &bpf_net_id,
  338. .size = sizeof(struct tc_action_net),
  339. };
  340. static int __init bpf_init_module(void)
  341. {
  342. return tcf_register_action(&act_bpf_ops, &bpf_net_ops);
  343. }
  344. static void __exit bpf_cleanup_module(void)
  345. {
  346. tcf_unregister_action(&act_bpf_ops, &bpf_net_ops);
  347. }
  348. module_init(bpf_init_module);
  349. module_exit(bpf_cleanup_module);
  350. MODULE_AUTHOR("Jiri Pirko <jiri@resnulli.us>");
  351. MODULE_DESCRIPTION("TC BPF based action");
  352. MODULE_LICENSE("GPL v2");