offload.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600
  1. /*
  2. * Copyright (C) 2016-2018 Netronome Systems, Inc.
  3. *
  4. * This software is dual licensed under the GNU General License Version 2,
  5. * June 1991 as shown in the file COPYING in the top-level directory of this
  6. * source tree or the BSD 2-Clause License provided below. You have the
  7. * option to license this software under the complete terms of either license.
  8. *
  9. * The BSD 2-Clause License:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * 1. Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * 2. Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. /*
  34. * nfp_net_offload.c
  35. * Netronome network device driver: TC offload functions for PF and VF
  36. */
  37. #define pr_fmt(fmt) "NFP net bpf: " fmt
  38. #include <linux/bpf.h>
  39. #include <linux/kernel.h>
  40. #include <linux/netdevice.h>
  41. #include <linux/pci.h>
  42. #include <linux/jiffies.h>
  43. #include <linux/timer.h>
  44. #include <linux/list.h>
  45. #include <linux/mm.h>
  46. #include <net/pkt_cls.h>
  47. #include <net/tc_act/tc_gact.h>
  48. #include <net/tc_act/tc_mirred.h>
  49. #include "main.h"
  50. #include "../nfp_app.h"
  51. #include "../nfp_net_ctrl.h"
  52. #include "../nfp_net.h"
  53. static int
  54. nfp_map_ptr_record(struct nfp_app_bpf *bpf, struct nfp_prog *nfp_prog,
  55. struct bpf_map *map)
  56. {
  57. struct nfp_bpf_neutral_map *record;
  58. int err;
  59. /* Map record paths are entered via ndo, update side is protected. */
  60. ASSERT_RTNL();
  61. /* Reuse path - other offloaded program is already tracking this map. */
  62. record = rhashtable_lookup_fast(&bpf->maps_neutral, &map,
  63. nfp_bpf_maps_neutral_params);
  64. if (record) {
  65. nfp_prog->map_records[nfp_prog->map_records_cnt++] = record;
  66. record->count++;
  67. return 0;
  68. }
  69. /* Grab a single ref to the map for our record. The prog destroy ndo
  70. * happens after free_used_maps().
  71. */
  72. map = bpf_map_inc(map, false);
  73. if (IS_ERR(map))
  74. return PTR_ERR(map);
  75. record = kmalloc(sizeof(*record), GFP_KERNEL);
  76. if (!record) {
  77. err = -ENOMEM;
  78. goto err_map_put;
  79. }
  80. record->ptr = map;
  81. record->count = 1;
  82. err = rhashtable_insert_fast(&bpf->maps_neutral, &record->l,
  83. nfp_bpf_maps_neutral_params);
  84. if (err)
  85. goto err_free_rec;
  86. nfp_prog->map_records[nfp_prog->map_records_cnt++] = record;
  87. return 0;
  88. err_free_rec:
  89. kfree(record);
  90. err_map_put:
  91. bpf_map_put(map);
  92. return err;
  93. }
  94. static void
  95. nfp_map_ptrs_forget(struct nfp_app_bpf *bpf, struct nfp_prog *nfp_prog)
  96. {
  97. bool freed = false;
  98. int i;
  99. ASSERT_RTNL();
  100. for (i = 0; i < nfp_prog->map_records_cnt; i++) {
  101. if (--nfp_prog->map_records[i]->count) {
  102. nfp_prog->map_records[i] = NULL;
  103. continue;
  104. }
  105. WARN_ON(rhashtable_remove_fast(&bpf->maps_neutral,
  106. &nfp_prog->map_records[i]->l,
  107. nfp_bpf_maps_neutral_params));
  108. freed = true;
  109. }
  110. if (freed) {
  111. synchronize_rcu();
  112. for (i = 0; i < nfp_prog->map_records_cnt; i++)
  113. if (nfp_prog->map_records[i]) {
  114. bpf_map_put(nfp_prog->map_records[i]->ptr);
  115. kfree(nfp_prog->map_records[i]);
  116. }
  117. }
  118. kfree(nfp_prog->map_records);
  119. nfp_prog->map_records = NULL;
  120. nfp_prog->map_records_cnt = 0;
  121. }
  122. static int
  123. nfp_map_ptrs_record(struct nfp_app_bpf *bpf, struct nfp_prog *nfp_prog,
  124. struct bpf_prog *prog)
  125. {
  126. int i, cnt, err;
  127. /* Quickly count the maps we will have to remember */
  128. cnt = 0;
  129. for (i = 0; i < prog->aux->used_map_cnt; i++)
  130. if (bpf_map_offload_neutral(prog->aux->used_maps[i]))
  131. cnt++;
  132. if (!cnt)
  133. return 0;
  134. nfp_prog->map_records = kmalloc_array(cnt,
  135. sizeof(nfp_prog->map_records[0]),
  136. GFP_KERNEL);
  137. if (!nfp_prog->map_records)
  138. return -ENOMEM;
  139. for (i = 0; i < prog->aux->used_map_cnt; i++)
  140. if (bpf_map_offload_neutral(prog->aux->used_maps[i])) {
  141. err = nfp_map_ptr_record(bpf, nfp_prog,
  142. prog->aux->used_maps[i]);
  143. if (err) {
  144. nfp_map_ptrs_forget(bpf, nfp_prog);
  145. return err;
  146. }
  147. }
  148. WARN_ON(cnt != nfp_prog->map_records_cnt);
  149. return 0;
  150. }
  151. static int
  152. nfp_prog_prepare(struct nfp_prog *nfp_prog, const struct bpf_insn *prog,
  153. unsigned int cnt)
  154. {
  155. struct nfp_insn_meta *meta;
  156. unsigned int i;
  157. for (i = 0; i < cnt; i++) {
  158. meta = kzalloc(sizeof(*meta), GFP_KERNEL);
  159. if (!meta)
  160. return -ENOMEM;
  161. meta->insn = prog[i];
  162. meta->n = i;
  163. list_add_tail(&meta->l, &nfp_prog->insns);
  164. }
  165. nfp_bpf_jit_prepare(nfp_prog, cnt);
  166. return 0;
  167. }
  168. static void nfp_prog_free(struct nfp_prog *nfp_prog)
  169. {
  170. struct nfp_insn_meta *meta, *tmp;
  171. list_for_each_entry_safe(meta, tmp, &nfp_prog->insns, l) {
  172. list_del(&meta->l);
  173. kfree(meta);
  174. }
  175. kfree(nfp_prog);
  176. }
  177. static int
  178. nfp_bpf_verifier_prep(struct nfp_app *app, struct nfp_net *nn,
  179. struct netdev_bpf *bpf)
  180. {
  181. struct bpf_prog *prog = bpf->verifier.prog;
  182. struct nfp_prog *nfp_prog;
  183. int ret;
  184. nfp_prog = kzalloc(sizeof(*nfp_prog), GFP_KERNEL);
  185. if (!nfp_prog)
  186. return -ENOMEM;
  187. prog->aux->offload->dev_priv = nfp_prog;
  188. INIT_LIST_HEAD(&nfp_prog->insns);
  189. nfp_prog->type = prog->type;
  190. nfp_prog->bpf = app->priv;
  191. ret = nfp_prog_prepare(nfp_prog, prog->insnsi, prog->len);
  192. if (ret)
  193. goto err_free;
  194. nfp_prog->verifier_meta = nfp_prog_first_meta(nfp_prog);
  195. bpf->verifier.ops = &nfp_bpf_analyzer_ops;
  196. return 0;
  197. err_free:
  198. nfp_prog_free(nfp_prog);
  199. return ret;
  200. }
  201. static int nfp_bpf_translate(struct nfp_net *nn, struct bpf_prog *prog)
  202. {
  203. struct nfp_prog *nfp_prog = prog->aux->offload->dev_priv;
  204. unsigned int stack_size;
  205. unsigned int max_instr;
  206. int err;
  207. stack_size = nn_readb(nn, NFP_NET_CFG_BPF_STACK_SZ) * 64;
  208. if (prog->aux->stack_depth > stack_size) {
  209. nn_info(nn, "stack too large: program %dB > FW stack %dB\n",
  210. prog->aux->stack_depth, stack_size);
  211. return -EOPNOTSUPP;
  212. }
  213. nfp_prog->stack_depth = round_up(prog->aux->stack_depth, 4);
  214. max_instr = nn_readw(nn, NFP_NET_CFG_BPF_MAX_LEN);
  215. nfp_prog->__prog_alloc_len = max_instr * sizeof(u64);
  216. nfp_prog->prog = kvmalloc(nfp_prog->__prog_alloc_len, GFP_KERNEL);
  217. if (!nfp_prog->prog)
  218. return -ENOMEM;
  219. err = nfp_bpf_jit(nfp_prog);
  220. if (err)
  221. return err;
  222. prog->aux->offload->jited_len = nfp_prog->prog_len * sizeof(u64);
  223. prog->aux->offload->jited_image = nfp_prog->prog;
  224. return nfp_map_ptrs_record(nfp_prog->bpf, nfp_prog, prog);
  225. }
  226. static int nfp_bpf_destroy(struct nfp_net *nn, struct bpf_prog *prog)
  227. {
  228. struct nfp_prog *nfp_prog = prog->aux->offload->dev_priv;
  229. kvfree(nfp_prog->prog);
  230. nfp_map_ptrs_forget(nfp_prog->bpf, nfp_prog);
  231. nfp_prog_free(nfp_prog);
  232. return 0;
  233. }
  234. /* Atomic engine requires values to be in big endian, we need to byte swap
  235. * the value words used with xadd.
  236. */
  237. static void nfp_map_bpf_byte_swap(struct nfp_bpf_map *nfp_map, void *value)
  238. {
  239. u32 *word = value;
  240. unsigned int i;
  241. for (i = 0; i < DIV_ROUND_UP(nfp_map->offmap->map.value_size, 4); i++)
  242. if (nfp_map->use_map[i] == NFP_MAP_USE_ATOMIC_CNT)
  243. word[i] = (__force u32)cpu_to_be32(word[i]);
  244. }
  245. static int
  246. nfp_bpf_map_lookup_entry(struct bpf_offloaded_map *offmap,
  247. void *key, void *value)
  248. {
  249. int err;
  250. err = nfp_bpf_ctrl_lookup_entry(offmap, key, value);
  251. if (err)
  252. return err;
  253. nfp_map_bpf_byte_swap(offmap->dev_priv, value);
  254. return 0;
  255. }
  256. static int
  257. nfp_bpf_map_update_entry(struct bpf_offloaded_map *offmap,
  258. void *key, void *value, u64 flags)
  259. {
  260. nfp_map_bpf_byte_swap(offmap->dev_priv, value);
  261. return nfp_bpf_ctrl_update_entry(offmap, key, value, flags);
  262. }
  263. static int
  264. nfp_bpf_map_get_next_key(struct bpf_offloaded_map *offmap,
  265. void *key, void *next_key)
  266. {
  267. if (!key)
  268. return nfp_bpf_ctrl_getfirst_entry(offmap, next_key);
  269. return nfp_bpf_ctrl_getnext_entry(offmap, key, next_key);
  270. }
  271. static int
  272. nfp_bpf_map_delete_elem(struct bpf_offloaded_map *offmap, void *key)
  273. {
  274. if (offmap->map.map_type == BPF_MAP_TYPE_ARRAY)
  275. return -EINVAL;
  276. return nfp_bpf_ctrl_del_entry(offmap, key);
  277. }
  278. static const struct bpf_map_dev_ops nfp_bpf_map_ops = {
  279. .map_get_next_key = nfp_bpf_map_get_next_key,
  280. .map_lookup_elem = nfp_bpf_map_lookup_entry,
  281. .map_update_elem = nfp_bpf_map_update_entry,
  282. .map_delete_elem = nfp_bpf_map_delete_elem,
  283. };
  284. static int
  285. nfp_bpf_map_alloc(struct nfp_app_bpf *bpf, struct bpf_offloaded_map *offmap)
  286. {
  287. struct nfp_bpf_map *nfp_map;
  288. unsigned int use_map_size;
  289. long long int res;
  290. if (!bpf->maps.types)
  291. return -EOPNOTSUPP;
  292. if (offmap->map.map_flags ||
  293. offmap->map.numa_node != NUMA_NO_NODE) {
  294. pr_info("map flags are not supported\n");
  295. return -EINVAL;
  296. }
  297. if (!(bpf->maps.types & 1 << offmap->map.map_type)) {
  298. pr_info("map type not supported\n");
  299. return -EOPNOTSUPP;
  300. }
  301. if (bpf->maps.max_maps == bpf->maps_in_use) {
  302. pr_info("too many maps for a device\n");
  303. return -ENOMEM;
  304. }
  305. if (bpf->maps.max_elems - bpf->map_elems_in_use <
  306. offmap->map.max_entries) {
  307. pr_info("map with too many elements: %u, left: %u\n",
  308. offmap->map.max_entries,
  309. bpf->maps.max_elems - bpf->map_elems_in_use);
  310. return -ENOMEM;
  311. }
  312. if (offmap->map.key_size > bpf->maps.max_key_sz ||
  313. offmap->map.value_size > bpf->maps.max_val_sz ||
  314. round_up(offmap->map.key_size, 8) +
  315. round_up(offmap->map.value_size, 8) > bpf->maps.max_elem_sz) {
  316. pr_info("elements don't fit in device constraints\n");
  317. return -ENOMEM;
  318. }
  319. use_map_size = DIV_ROUND_UP(offmap->map.value_size, 4) *
  320. FIELD_SIZEOF(struct nfp_bpf_map, use_map[0]);
  321. nfp_map = kzalloc(sizeof(*nfp_map) + use_map_size, GFP_USER);
  322. if (!nfp_map)
  323. return -ENOMEM;
  324. offmap->dev_priv = nfp_map;
  325. nfp_map->offmap = offmap;
  326. nfp_map->bpf = bpf;
  327. res = nfp_bpf_ctrl_alloc_map(bpf, &offmap->map);
  328. if (res < 0) {
  329. kfree(nfp_map);
  330. return res;
  331. }
  332. nfp_map->tid = res;
  333. offmap->dev_ops = &nfp_bpf_map_ops;
  334. bpf->maps_in_use++;
  335. bpf->map_elems_in_use += offmap->map.max_entries;
  336. list_add_tail(&nfp_map->l, &bpf->map_list);
  337. return 0;
  338. }
  339. static int
  340. nfp_bpf_map_free(struct nfp_app_bpf *bpf, struct bpf_offloaded_map *offmap)
  341. {
  342. struct nfp_bpf_map *nfp_map = offmap->dev_priv;
  343. nfp_bpf_ctrl_free_map(bpf, nfp_map);
  344. list_del_init(&nfp_map->l);
  345. bpf->map_elems_in_use -= offmap->map.max_entries;
  346. bpf->maps_in_use--;
  347. kfree(nfp_map);
  348. return 0;
  349. }
  350. int nfp_ndo_bpf(struct nfp_app *app, struct nfp_net *nn, struct netdev_bpf *bpf)
  351. {
  352. switch (bpf->command) {
  353. case BPF_OFFLOAD_VERIFIER_PREP:
  354. return nfp_bpf_verifier_prep(app, nn, bpf);
  355. case BPF_OFFLOAD_TRANSLATE:
  356. return nfp_bpf_translate(nn, bpf->offload.prog);
  357. case BPF_OFFLOAD_DESTROY:
  358. return nfp_bpf_destroy(nn, bpf->offload.prog);
  359. case BPF_OFFLOAD_MAP_ALLOC:
  360. return nfp_bpf_map_alloc(app->priv, bpf->offmap);
  361. case BPF_OFFLOAD_MAP_FREE:
  362. return nfp_bpf_map_free(app->priv, bpf->offmap);
  363. default:
  364. return -EINVAL;
  365. }
  366. }
  367. static unsigned long
  368. nfp_bpf_perf_event_copy(void *dst, const void *src,
  369. unsigned long off, unsigned long len)
  370. {
  371. memcpy(dst, src + off, len);
  372. return 0;
  373. }
  374. int nfp_bpf_event_output(struct nfp_app_bpf *bpf, struct sk_buff *skb)
  375. {
  376. struct cmsg_bpf_event *cbe = (void *)skb->data;
  377. u32 pkt_size, data_size;
  378. struct bpf_map *map;
  379. if (skb->len < sizeof(struct cmsg_bpf_event))
  380. goto err_drop;
  381. pkt_size = be32_to_cpu(cbe->pkt_size);
  382. data_size = be32_to_cpu(cbe->data_size);
  383. map = (void *)(unsigned long)be64_to_cpu(cbe->map_ptr);
  384. if (skb->len < sizeof(struct cmsg_bpf_event) + pkt_size + data_size)
  385. goto err_drop;
  386. if (cbe->hdr.ver != CMSG_MAP_ABI_VERSION)
  387. goto err_drop;
  388. rcu_read_lock();
  389. if (!rhashtable_lookup_fast(&bpf->maps_neutral, &map,
  390. nfp_bpf_maps_neutral_params)) {
  391. rcu_read_unlock();
  392. pr_warn("perf event: dest map pointer %px not recognized, dropping event\n",
  393. map);
  394. goto err_drop;
  395. }
  396. bpf_event_output(map, be32_to_cpu(cbe->cpu_id),
  397. &cbe->data[round_up(pkt_size, 4)], data_size,
  398. cbe->data, pkt_size, nfp_bpf_perf_event_copy);
  399. rcu_read_unlock();
  400. dev_consume_skb_any(skb);
  401. return 0;
  402. err_drop:
  403. dev_kfree_skb_any(skb);
  404. return -EINVAL;
  405. }
  406. static int
  407. nfp_net_bpf_load(struct nfp_net *nn, struct bpf_prog *prog,
  408. struct netlink_ext_ack *extack)
  409. {
  410. struct nfp_prog *nfp_prog = prog->aux->offload->dev_priv;
  411. unsigned int max_mtu;
  412. dma_addr_t dma_addr;
  413. void *img;
  414. int err;
  415. max_mtu = nn_readb(nn, NFP_NET_CFG_BPF_INL_MTU) * 64 - 32;
  416. if (max_mtu < nn->dp.netdev->mtu) {
  417. NL_SET_ERR_MSG_MOD(extack, "BPF offload not supported with MTU larger than HW packet split boundary");
  418. return -EOPNOTSUPP;
  419. }
  420. img = nfp_bpf_relo_for_vnic(nfp_prog, nn->app_priv);
  421. if (IS_ERR(img))
  422. return PTR_ERR(img);
  423. dma_addr = dma_map_single(nn->dp.dev, img,
  424. nfp_prog->prog_len * sizeof(u64),
  425. DMA_TO_DEVICE);
  426. if (dma_mapping_error(nn->dp.dev, dma_addr)) {
  427. kfree(img);
  428. return -ENOMEM;
  429. }
  430. nn_writew(nn, NFP_NET_CFG_BPF_SIZE, nfp_prog->prog_len);
  431. nn_writeq(nn, NFP_NET_CFG_BPF_ADDR, dma_addr);
  432. /* Load up the JITed code */
  433. err = nfp_net_reconfig(nn, NFP_NET_CFG_UPDATE_BPF);
  434. if (err)
  435. NL_SET_ERR_MSG_MOD(extack,
  436. "FW command error while loading BPF");
  437. dma_unmap_single(nn->dp.dev, dma_addr, nfp_prog->prog_len * sizeof(u64),
  438. DMA_TO_DEVICE);
  439. kfree(img);
  440. return err;
  441. }
  442. static void
  443. nfp_net_bpf_start(struct nfp_net *nn, struct netlink_ext_ack *extack)
  444. {
  445. int err;
  446. /* Enable passing packets through BPF function */
  447. nn->dp.ctrl |= NFP_NET_CFG_CTRL_BPF;
  448. nn_writel(nn, NFP_NET_CFG_CTRL, nn->dp.ctrl);
  449. err = nfp_net_reconfig(nn, NFP_NET_CFG_UPDATE_GEN);
  450. if (err)
  451. NL_SET_ERR_MSG_MOD(extack,
  452. "FW command error while enabling BPF");
  453. }
  454. static int nfp_net_bpf_stop(struct nfp_net *nn)
  455. {
  456. if (!(nn->dp.ctrl & NFP_NET_CFG_CTRL_BPF))
  457. return 0;
  458. nn->dp.ctrl &= ~NFP_NET_CFG_CTRL_BPF;
  459. nn_writel(nn, NFP_NET_CFG_CTRL, nn->dp.ctrl);
  460. return nfp_net_reconfig(nn, NFP_NET_CFG_UPDATE_GEN);
  461. }
  462. int nfp_net_bpf_offload(struct nfp_net *nn, struct bpf_prog *prog,
  463. bool old_prog, struct netlink_ext_ack *extack)
  464. {
  465. int err;
  466. if (prog) {
  467. struct bpf_prog_offload *offload = prog->aux->offload;
  468. if (!offload)
  469. return -EINVAL;
  470. if (offload->netdev != nn->dp.netdev)
  471. return -EINVAL;
  472. }
  473. if (prog && old_prog) {
  474. u8 cap;
  475. cap = nn_readb(nn, NFP_NET_CFG_BPF_CAP);
  476. if (!(cap & NFP_NET_BPF_CAP_RELO)) {
  477. NL_SET_ERR_MSG_MOD(extack,
  478. "FW does not support live reload");
  479. return -EBUSY;
  480. }
  481. }
  482. /* Something else is loaded, different program type? */
  483. if (!old_prog && nn->dp.ctrl & NFP_NET_CFG_CTRL_BPF)
  484. return -EBUSY;
  485. if (old_prog && !prog)
  486. return nfp_net_bpf_stop(nn);
  487. err = nfp_net_bpf_load(nn, prog, extack);
  488. if (err)
  489. return err;
  490. if (!old_prog)
  491. nfp_net_bpf_start(nn, extack);
  492. return 0;
  493. }