bpf.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652
  1. /*
  2. * Copyright (C) 2017 Netronome Systems, Inc.
  3. *
  4. * This software is 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.
  7. *
  8. * THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS"
  9. * WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
  10. * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  11. * FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE
  12. * OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME
  13. * THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
  14. */
  15. #include <linux/bpf.h>
  16. #include <linux/bpf_verifier.h>
  17. #include <linux/debugfs.h>
  18. #include <linux/kernel.h>
  19. #include <linux/mutex.h>
  20. #include <linux/rtnetlink.h>
  21. #include <net/pkt_cls.h>
  22. #include "netdevsim.h"
  23. #define pr_vlog(env, fmt, ...) \
  24. bpf_verifier_log_write(env, "[netdevsim] " fmt, ##__VA_ARGS__)
  25. struct nsim_bpf_bound_prog {
  26. struct netdevsim *ns;
  27. struct bpf_prog *prog;
  28. struct dentry *ddir;
  29. const char *state;
  30. bool is_loaded;
  31. struct list_head l;
  32. };
  33. #define NSIM_BPF_MAX_KEYS 2
  34. struct nsim_bpf_bound_map {
  35. struct netdevsim *ns;
  36. struct bpf_offloaded_map *map;
  37. struct mutex mutex;
  38. struct nsim_map_entry {
  39. void *key;
  40. void *value;
  41. } entry[NSIM_BPF_MAX_KEYS];
  42. struct list_head l;
  43. };
  44. static int nsim_debugfs_bpf_string_read(struct seq_file *file, void *data)
  45. {
  46. const char **str = file->private;
  47. if (*str)
  48. seq_printf(file, "%s\n", *str);
  49. return 0;
  50. }
  51. static int nsim_debugfs_bpf_string_open(struct inode *inode, struct file *f)
  52. {
  53. return single_open(f, nsim_debugfs_bpf_string_read, inode->i_private);
  54. }
  55. static const struct file_operations nsim_bpf_string_fops = {
  56. .owner = THIS_MODULE,
  57. .open = nsim_debugfs_bpf_string_open,
  58. .release = single_release,
  59. .read = seq_read,
  60. .llseek = seq_lseek
  61. };
  62. static int
  63. nsim_bpf_verify_insn(struct bpf_verifier_env *env, int insn_idx, int prev_insn)
  64. {
  65. struct nsim_bpf_bound_prog *state;
  66. state = env->prog->aux->offload->dev_priv;
  67. if (state->ns->bpf_bind_verifier_delay && !insn_idx)
  68. msleep(state->ns->bpf_bind_verifier_delay);
  69. if (insn_idx == env->prog->len - 1)
  70. pr_vlog(env, "Hello from netdevsim!\n");
  71. return 0;
  72. }
  73. static const struct bpf_prog_offload_ops nsim_bpf_analyzer_ops = {
  74. .insn_hook = nsim_bpf_verify_insn,
  75. };
  76. static bool nsim_xdp_offload_active(struct netdevsim *ns)
  77. {
  78. return ns->xdp_hw.prog;
  79. }
  80. static void nsim_prog_set_loaded(struct bpf_prog *prog, bool loaded)
  81. {
  82. struct nsim_bpf_bound_prog *state;
  83. if (!prog || !prog->aux->offload)
  84. return;
  85. state = prog->aux->offload->dev_priv;
  86. state->is_loaded = loaded;
  87. }
  88. static int
  89. nsim_bpf_offload(struct netdevsim *ns, struct bpf_prog *prog, bool oldprog)
  90. {
  91. nsim_prog_set_loaded(ns->bpf_offloaded, false);
  92. WARN(!!ns->bpf_offloaded != oldprog,
  93. "bad offload state, expected offload %sto be active",
  94. oldprog ? "" : "not ");
  95. ns->bpf_offloaded = prog;
  96. ns->bpf_offloaded_id = prog ? prog->aux->id : 0;
  97. nsim_prog_set_loaded(prog, true);
  98. return 0;
  99. }
  100. int nsim_bpf_setup_tc_block_cb(enum tc_setup_type type,
  101. void *type_data, void *cb_priv)
  102. {
  103. struct tc_cls_bpf_offload *cls_bpf = type_data;
  104. struct bpf_prog *prog = cls_bpf->prog;
  105. struct netdevsim *ns = cb_priv;
  106. struct bpf_prog *oldprog;
  107. if (type != TC_SETUP_CLSBPF) {
  108. NSIM_EA(cls_bpf->common.extack,
  109. "only offload of BPF classifiers supported");
  110. return -EOPNOTSUPP;
  111. }
  112. if (!tc_cls_can_offload_and_chain0(ns->netdev, &cls_bpf->common))
  113. return -EOPNOTSUPP;
  114. if (cls_bpf->common.protocol != htons(ETH_P_ALL)) {
  115. NSIM_EA(cls_bpf->common.extack,
  116. "only ETH_P_ALL supported as filter protocol");
  117. return -EOPNOTSUPP;
  118. }
  119. if (!ns->bpf_tc_accept) {
  120. NSIM_EA(cls_bpf->common.extack,
  121. "netdevsim configured to reject BPF TC offload");
  122. return -EOPNOTSUPP;
  123. }
  124. /* Note: progs without skip_sw will probably not be dev bound */
  125. if (prog && !prog->aux->offload && !ns->bpf_tc_non_bound_accept) {
  126. NSIM_EA(cls_bpf->common.extack,
  127. "netdevsim configured to reject unbound programs");
  128. return -EOPNOTSUPP;
  129. }
  130. if (cls_bpf->command != TC_CLSBPF_OFFLOAD)
  131. return -EOPNOTSUPP;
  132. oldprog = cls_bpf->oldprog;
  133. /* Don't remove if oldprog doesn't match driver's state */
  134. if (ns->bpf_offloaded != oldprog) {
  135. oldprog = NULL;
  136. if (!cls_bpf->prog)
  137. return 0;
  138. if (ns->bpf_offloaded) {
  139. NSIM_EA(cls_bpf->common.extack,
  140. "driver and netdev offload states mismatch");
  141. return -EBUSY;
  142. }
  143. }
  144. return nsim_bpf_offload(ns, cls_bpf->prog, oldprog);
  145. }
  146. int nsim_bpf_disable_tc(struct netdevsim *ns)
  147. {
  148. if (ns->bpf_offloaded && !nsim_xdp_offload_active(ns))
  149. return -EBUSY;
  150. return 0;
  151. }
  152. static int nsim_xdp_offload_prog(struct netdevsim *ns, struct netdev_bpf *bpf)
  153. {
  154. if (!nsim_xdp_offload_active(ns) && !bpf->prog)
  155. return 0;
  156. if (!nsim_xdp_offload_active(ns) && bpf->prog && ns->bpf_offloaded) {
  157. NSIM_EA(bpf->extack, "TC program is already loaded");
  158. return -EBUSY;
  159. }
  160. return nsim_bpf_offload(ns, bpf->prog, nsim_xdp_offload_active(ns));
  161. }
  162. static int
  163. nsim_xdp_set_prog(struct netdevsim *ns, struct netdev_bpf *bpf,
  164. struct xdp_attachment_info *xdp)
  165. {
  166. int err;
  167. if (!xdp_attachment_flags_ok(xdp, bpf))
  168. return -EBUSY;
  169. if (bpf->command == XDP_SETUP_PROG && !ns->bpf_xdpdrv_accept) {
  170. NSIM_EA(bpf->extack, "driver XDP disabled in DebugFS");
  171. return -EOPNOTSUPP;
  172. }
  173. if (bpf->command == XDP_SETUP_PROG_HW && !ns->bpf_xdpoffload_accept) {
  174. NSIM_EA(bpf->extack, "XDP offload disabled in DebugFS");
  175. return -EOPNOTSUPP;
  176. }
  177. if (bpf->command == XDP_SETUP_PROG_HW) {
  178. err = nsim_xdp_offload_prog(ns, bpf);
  179. if (err)
  180. return err;
  181. }
  182. xdp_attachment_setup(xdp, bpf);
  183. return 0;
  184. }
  185. static int nsim_bpf_create_prog(struct netdevsim *ns, struct bpf_prog *prog)
  186. {
  187. struct nsim_bpf_bound_prog *state;
  188. char name[16];
  189. state = kzalloc(sizeof(*state), GFP_KERNEL);
  190. if (!state)
  191. return -ENOMEM;
  192. state->ns = ns;
  193. state->prog = prog;
  194. state->state = "verify";
  195. /* Program id is not populated yet when we create the state. */
  196. sprintf(name, "%u", ns->sdev->prog_id_gen++);
  197. state->ddir = debugfs_create_dir(name, ns->sdev->ddir_bpf_bound_progs);
  198. if (IS_ERR_OR_NULL(state->ddir)) {
  199. kfree(state);
  200. return -ENOMEM;
  201. }
  202. debugfs_create_u32("id", 0400, state->ddir, &prog->aux->id);
  203. debugfs_create_file("state", 0400, state->ddir,
  204. &state->state, &nsim_bpf_string_fops);
  205. debugfs_create_bool("loaded", 0400, state->ddir, &state->is_loaded);
  206. list_add_tail(&state->l, &ns->sdev->bpf_bound_progs);
  207. prog->aux->offload->dev_priv = state;
  208. return 0;
  209. }
  210. static void nsim_bpf_destroy_prog(struct bpf_prog *prog)
  211. {
  212. struct nsim_bpf_bound_prog *state;
  213. state = prog->aux->offload->dev_priv;
  214. WARN(state->is_loaded,
  215. "offload state destroyed while program still bound");
  216. debugfs_remove_recursive(state->ddir);
  217. list_del(&state->l);
  218. kfree(state);
  219. }
  220. static int nsim_setup_prog_checks(struct netdevsim *ns, struct netdev_bpf *bpf)
  221. {
  222. if (bpf->prog && bpf->prog->aux->offload) {
  223. NSIM_EA(bpf->extack, "attempt to load offloaded prog to drv");
  224. return -EINVAL;
  225. }
  226. if (ns->netdev->mtu > NSIM_XDP_MAX_MTU) {
  227. NSIM_EA(bpf->extack, "MTU too large w/ XDP enabled");
  228. return -EINVAL;
  229. }
  230. return 0;
  231. }
  232. static int
  233. nsim_setup_prog_hw_checks(struct netdevsim *ns, struct netdev_bpf *bpf)
  234. {
  235. struct nsim_bpf_bound_prog *state;
  236. if (!bpf->prog)
  237. return 0;
  238. if (!bpf->prog->aux->offload) {
  239. NSIM_EA(bpf->extack, "xdpoffload of non-bound program");
  240. return -EINVAL;
  241. }
  242. if (!bpf_offload_dev_match(bpf->prog, ns->netdev)) {
  243. NSIM_EA(bpf->extack, "program bound to different dev");
  244. return -EINVAL;
  245. }
  246. state = bpf->prog->aux->offload->dev_priv;
  247. if (WARN_ON(strcmp(state->state, "xlated"))) {
  248. NSIM_EA(bpf->extack, "offloading program in bad state");
  249. return -EINVAL;
  250. }
  251. return 0;
  252. }
  253. static bool
  254. nsim_map_key_match(struct bpf_map *map, struct nsim_map_entry *e, void *key)
  255. {
  256. return e->key && !memcmp(key, e->key, map->key_size);
  257. }
  258. static int nsim_map_key_find(struct bpf_offloaded_map *offmap, void *key)
  259. {
  260. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  261. unsigned int i;
  262. for (i = 0; i < ARRAY_SIZE(nmap->entry); i++)
  263. if (nsim_map_key_match(&offmap->map, &nmap->entry[i], key))
  264. return i;
  265. return -ENOENT;
  266. }
  267. static int
  268. nsim_map_alloc_elem(struct bpf_offloaded_map *offmap, unsigned int idx)
  269. {
  270. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  271. nmap->entry[idx].key = kmalloc(offmap->map.key_size, GFP_USER);
  272. if (!nmap->entry[idx].key)
  273. return -ENOMEM;
  274. nmap->entry[idx].value = kmalloc(offmap->map.value_size, GFP_USER);
  275. if (!nmap->entry[idx].value) {
  276. kfree(nmap->entry[idx].key);
  277. nmap->entry[idx].key = NULL;
  278. return -ENOMEM;
  279. }
  280. return 0;
  281. }
  282. static int
  283. nsim_map_get_next_key(struct bpf_offloaded_map *offmap,
  284. void *key, void *next_key)
  285. {
  286. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  287. int idx = -ENOENT;
  288. mutex_lock(&nmap->mutex);
  289. if (key)
  290. idx = nsim_map_key_find(offmap, key);
  291. if (idx == -ENOENT)
  292. idx = 0;
  293. else
  294. idx++;
  295. for (; idx < ARRAY_SIZE(nmap->entry); idx++) {
  296. if (nmap->entry[idx].key) {
  297. memcpy(next_key, nmap->entry[idx].key,
  298. offmap->map.key_size);
  299. break;
  300. }
  301. }
  302. mutex_unlock(&nmap->mutex);
  303. if (idx == ARRAY_SIZE(nmap->entry))
  304. return -ENOENT;
  305. return 0;
  306. }
  307. static int
  308. nsim_map_lookup_elem(struct bpf_offloaded_map *offmap, void *key, void *value)
  309. {
  310. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  311. int idx;
  312. mutex_lock(&nmap->mutex);
  313. idx = nsim_map_key_find(offmap, key);
  314. if (idx >= 0)
  315. memcpy(value, nmap->entry[idx].value, offmap->map.value_size);
  316. mutex_unlock(&nmap->mutex);
  317. return idx < 0 ? idx : 0;
  318. }
  319. static int
  320. nsim_map_update_elem(struct bpf_offloaded_map *offmap,
  321. void *key, void *value, u64 flags)
  322. {
  323. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  324. int idx, err = 0;
  325. mutex_lock(&nmap->mutex);
  326. idx = nsim_map_key_find(offmap, key);
  327. if (idx < 0 && flags == BPF_EXIST) {
  328. err = idx;
  329. goto exit_unlock;
  330. }
  331. if (idx >= 0 && flags == BPF_NOEXIST) {
  332. err = -EEXIST;
  333. goto exit_unlock;
  334. }
  335. if (idx < 0) {
  336. for (idx = 0; idx < ARRAY_SIZE(nmap->entry); idx++)
  337. if (!nmap->entry[idx].key)
  338. break;
  339. if (idx == ARRAY_SIZE(nmap->entry)) {
  340. err = -E2BIG;
  341. goto exit_unlock;
  342. }
  343. err = nsim_map_alloc_elem(offmap, idx);
  344. if (err)
  345. goto exit_unlock;
  346. }
  347. memcpy(nmap->entry[idx].key, key, offmap->map.key_size);
  348. memcpy(nmap->entry[idx].value, value, offmap->map.value_size);
  349. exit_unlock:
  350. mutex_unlock(&nmap->mutex);
  351. return err;
  352. }
  353. static int nsim_map_delete_elem(struct bpf_offloaded_map *offmap, void *key)
  354. {
  355. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  356. int idx;
  357. if (offmap->map.map_type == BPF_MAP_TYPE_ARRAY)
  358. return -EINVAL;
  359. mutex_lock(&nmap->mutex);
  360. idx = nsim_map_key_find(offmap, key);
  361. if (idx >= 0) {
  362. kfree(nmap->entry[idx].key);
  363. kfree(nmap->entry[idx].value);
  364. memset(&nmap->entry[idx], 0, sizeof(nmap->entry[idx]));
  365. }
  366. mutex_unlock(&nmap->mutex);
  367. return idx < 0 ? idx : 0;
  368. }
  369. static const struct bpf_map_dev_ops nsim_bpf_map_ops = {
  370. .map_get_next_key = nsim_map_get_next_key,
  371. .map_lookup_elem = nsim_map_lookup_elem,
  372. .map_update_elem = nsim_map_update_elem,
  373. .map_delete_elem = nsim_map_delete_elem,
  374. };
  375. static int
  376. nsim_bpf_map_alloc(struct netdevsim *ns, struct bpf_offloaded_map *offmap)
  377. {
  378. struct nsim_bpf_bound_map *nmap;
  379. int i, err;
  380. if (WARN_ON(offmap->map.map_type != BPF_MAP_TYPE_ARRAY &&
  381. offmap->map.map_type != BPF_MAP_TYPE_HASH))
  382. return -EINVAL;
  383. if (offmap->map.max_entries > NSIM_BPF_MAX_KEYS)
  384. return -ENOMEM;
  385. if (offmap->map.map_flags)
  386. return -EINVAL;
  387. nmap = kzalloc(sizeof(*nmap), GFP_USER);
  388. if (!nmap)
  389. return -ENOMEM;
  390. offmap->dev_priv = nmap;
  391. nmap->ns = ns;
  392. nmap->map = offmap;
  393. mutex_init(&nmap->mutex);
  394. if (offmap->map.map_type == BPF_MAP_TYPE_ARRAY) {
  395. for (i = 0; i < ARRAY_SIZE(nmap->entry); i++) {
  396. u32 *key;
  397. err = nsim_map_alloc_elem(offmap, i);
  398. if (err)
  399. goto err_free;
  400. key = nmap->entry[i].key;
  401. *key = i;
  402. }
  403. }
  404. offmap->dev_ops = &nsim_bpf_map_ops;
  405. list_add_tail(&nmap->l, &ns->sdev->bpf_bound_maps);
  406. return 0;
  407. err_free:
  408. while (--i >= 0) {
  409. kfree(nmap->entry[i].key);
  410. kfree(nmap->entry[i].value);
  411. }
  412. kfree(nmap);
  413. return err;
  414. }
  415. static void nsim_bpf_map_free(struct bpf_offloaded_map *offmap)
  416. {
  417. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  418. unsigned int i;
  419. for (i = 0; i < ARRAY_SIZE(nmap->entry); i++) {
  420. kfree(nmap->entry[i].key);
  421. kfree(nmap->entry[i].value);
  422. }
  423. list_del_init(&nmap->l);
  424. mutex_destroy(&nmap->mutex);
  425. kfree(nmap);
  426. }
  427. int nsim_bpf(struct net_device *dev, struct netdev_bpf *bpf)
  428. {
  429. struct netdevsim *ns = netdev_priv(dev);
  430. struct nsim_bpf_bound_prog *state;
  431. int err;
  432. ASSERT_RTNL();
  433. switch (bpf->command) {
  434. case BPF_OFFLOAD_VERIFIER_PREP:
  435. if (!ns->bpf_bind_accept)
  436. return -EOPNOTSUPP;
  437. err = nsim_bpf_create_prog(ns, bpf->verifier.prog);
  438. if (err)
  439. return err;
  440. bpf->verifier.ops = &nsim_bpf_analyzer_ops;
  441. return 0;
  442. case BPF_OFFLOAD_TRANSLATE:
  443. state = bpf->offload.prog->aux->offload->dev_priv;
  444. state->state = "xlated";
  445. return 0;
  446. case BPF_OFFLOAD_DESTROY:
  447. nsim_bpf_destroy_prog(bpf->offload.prog);
  448. return 0;
  449. case XDP_QUERY_PROG:
  450. return xdp_attachment_query(&ns->xdp, bpf);
  451. case XDP_QUERY_PROG_HW:
  452. return xdp_attachment_query(&ns->xdp_hw, bpf);
  453. case XDP_SETUP_PROG:
  454. err = nsim_setup_prog_checks(ns, bpf);
  455. if (err)
  456. return err;
  457. return nsim_xdp_set_prog(ns, bpf, &ns->xdp);
  458. case XDP_SETUP_PROG_HW:
  459. err = nsim_setup_prog_hw_checks(ns, bpf);
  460. if (err)
  461. return err;
  462. return nsim_xdp_set_prog(ns, bpf, &ns->xdp_hw);
  463. case BPF_OFFLOAD_MAP_ALLOC:
  464. if (!ns->bpf_map_accept)
  465. return -EOPNOTSUPP;
  466. return nsim_bpf_map_alloc(ns, bpf->offmap);
  467. case BPF_OFFLOAD_MAP_FREE:
  468. nsim_bpf_map_free(bpf->offmap);
  469. return 0;
  470. default:
  471. return -EINVAL;
  472. }
  473. }
  474. int nsim_bpf_init(struct netdevsim *ns)
  475. {
  476. int err;
  477. if (ns->sdev->refcnt == 1) {
  478. INIT_LIST_HEAD(&ns->sdev->bpf_bound_progs);
  479. INIT_LIST_HEAD(&ns->sdev->bpf_bound_maps);
  480. ns->sdev->ddir_bpf_bound_progs =
  481. debugfs_create_dir("bpf_bound_progs", ns->sdev->ddir);
  482. if (IS_ERR_OR_NULL(ns->sdev->ddir_bpf_bound_progs))
  483. return -ENOMEM;
  484. ns->sdev->bpf_dev = bpf_offload_dev_create();
  485. err = PTR_ERR_OR_ZERO(ns->sdev->bpf_dev);
  486. if (err)
  487. return err;
  488. }
  489. err = bpf_offload_dev_netdev_register(ns->sdev->bpf_dev, ns->netdev);
  490. if (err)
  491. goto err_destroy_bdev;
  492. debugfs_create_u32("bpf_offloaded_id", 0400, ns->ddir,
  493. &ns->bpf_offloaded_id);
  494. ns->bpf_bind_accept = true;
  495. debugfs_create_bool("bpf_bind_accept", 0600, ns->ddir,
  496. &ns->bpf_bind_accept);
  497. debugfs_create_u32("bpf_bind_verifier_delay", 0600, ns->ddir,
  498. &ns->bpf_bind_verifier_delay);
  499. ns->bpf_tc_accept = true;
  500. debugfs_create_bool("bpf_tc_accept", 0600, ns->ddir,
  501. &ns->bpf_tc_accept);
  502. debugfs_create_bool("bpf_tc_non_bound_accept", 0600, ns->ddir,
  503. &ns->bpf_tc_non_bound_accept);
  504. ns->bpf_xdpdrv_accept = true;
  505. debugfs_create_bool("bpf_xdpdrv_accept", 0600, ns->ddir,
  506. &ns->bpf_xdpdrv_accept);
  507. ns->bpf_xdpoffload_accept = true;
  508. debugfs_create_bool("bpf_xdpoffload_accept", 0600, ns->ddir,
  509. &ns->bpf_xdpoffload_accept);
  510. ns->bpf_map_accept = true;
  511. debugfs_create_bool("bpf_map_accept", 0600, ns->ddir,
  512. &ns->bpf_map_accept);
  513. return 0;
  514. err_destroy_bdev:
  515. if (ns->sdev->refcnt == 1)
  516. bpf_offload_dev_destroy(ns->sdev->bpf_dev);
  517. return err;
  518. }
  519. void nsim_bpf_uninit(struct netdevsim *ns)
  520. {
  521. WARN_ON(ns->xdp.prog);
  522. WARN_ON(ns->xdp_hw.prog);
  523. WARN_ON(ns->bpf_offloaded);
  524. bpf_offload_dev_netdev_unregister(ns->sdev->bpf_dev, ns->netdev);
  525. if (ns->sdev->refcnt == 1) {
  526. WARN_ON(!list_empty(&ns->sdev->bpf_bound_progs));
  527. WARN_ON(!list_empty(&ns->sdev->bpf_bound_maps));
  528. bpf_offload_dev_destroy(ns->sdev->bpf_dev);
  529. }
  530. }