bpf.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639
  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_prog_mode == XDP_ATTACHED_HW;
  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 nsim_xdp_set_prog(struct netdevsim *ns, struct netdev_bpf *bpf)
  163. {
  164. int err;
  165. if (!xdp_attachment_flags_ok(&ns->xdp, bpf))
  166. return -EBUSY;
  167. if (bpf->command == XDP_SETUP_PROG && !ns->bpf_xdpdrv_accept) {
  168. NSIM_EA(bpf->extack, "driver XDP disabled in DebugFS");
  169. return -EOPNOTSUPP;
  170. }
  171. if (bpf->command == XDP_SETUP_PROG_HW && !ns->bpf_xdpoffload_accept) {
  172. NSIM_EA(bpf->extack, "XDP offload disabled in DebugFS");
  173. return -EOPNOTSUPP;
  174. }
  175. if (bpf->command == XDP_SETUP_PROG_HW) {
  176. err = nsim_xdp_offload_prog(ns, bpf);
  177. if (err)
  178. return err;
  179. }
  180. xdp_attachment_setup(&ns->xdp, bpf);
  181. if (!bpf->prog)
  182. ns->xdp_prog_mode = XDP_ATTACHED_NONE;
  183. else if (bpf->command == XDP_SETUP_PROG)
  184. ns->xdp_prog_mode = XDP_ATTACHED_DRV;
  185. else
  186. ns->xdp_prog_mode = XDP_ATTACHED_HW;
  187. return 0;
  188. }
  189. static int nsim_bpf_create_prog(struct netdevsim *ns, struct bpf_prog *prog)
  190. {
  191. struct nsim_bpf_bound_prog *state;
  192. char name[16];
  193. state = kzalloc(sizeof(*state), GFP_KERNEL);
  194. if (!state)
  195. return -ENOMEM;
  196. state->ns = ns;
  197. state->prog = prog;
  198. state->state = "verify";
  199. /* Program id is not populated yet when we create the state. */
  200. sprintf(name, "%u", ns->prog_id_gen++);
  201. state->ddir = debugfs_create_dir(name, ns->ddir_bpf_bound_progs);
  202. if (IS_ERR_OR_NULL(state->ddir)) {
  203. kfree(state);
  204. return -ENOMEM;
  205. }
  206. debugfs_create_u32("id", 0400, state->ddir, &prog->aux->id);
  207. debugfs_create_file("state", 0400, state->ddir,
  208. &state->state, &nsim_bpf_string_fops);
  209. debugfs_create_bool("loaded", 0400, state->ddir, &state->is_loaded);
  210. list_add_tail(&state->l, &ns->bpf_bound_progs);
  211. prog->aux->offload->dev_priv = state;
  212. return 0;
  213. }
  214. static void nsim_bpf_destroy_prog(struct bpf_prog *prog)
  215. {
  216. struct nsim_bpf_bound_prog *state;
  217. state = prog->aux->offload->dev_priv;
  218. WARN(state->is_loaded,
  219. "offload state destroyed while program still bound");
  220. debugfs_remove_recursive(state->ddir);
  221. list_del(&state->l);
  222. kfree(state);
  223. }
  224. static int nsim_setup_prog_checks(struct netdevsim *ns, struct netdev_bpf *bpf)
  225. {
  226. if (bpf->prog && bpf->prog->aux->offload) {
  227. NSIM_EA(bpf->extack, "attempt to load offloaded prog to drv");
  228. return -EINVAL;
  229. }
  230. if (ns->netdev->mtu > NSIM_XDP_MAX_MTU) {
  231. NSIM_EA(bpf->extack, "MTU too large w/ XDP enabled");
  232. return -EINVAL;
  233. }
  234. if (nsim_xdp_offload_active(ns)) {
  235. NSIM_EA(bpf->extack, "xdp offload active, can't load drv prog");
  236. return -EBUSY;
  237. }
  238. return 0;
  239. }
  240. static int
  241. nsim_setup_prog_hw_checks(struct netdevsim *ns, struct netdev_bpf *bpf)
  242. {
  243. struct nsim_bpf_bound_prog *state;
  244. if (!bpf->prog)
  245. return 0;
  246. if (!bpf->prog->aux->offload) {
  247. NSIM_EA(bpf->extack, "xdpoffload of non-bound program");
  248. return -EINVAL;
  249. }
  250. if (bpf->prog->aux->offload->netdev != ns->netdev) {
  251. NSIM_EA(bpf->extack, "program bound to different dev");
  252. return -EINVAL;
  253. }
  254. state = bpf->prog->aux->offload->dev_priv;
  255. if (WARN_ON(strcmp(state->state, "xlated"))) {
  256. NSIM_EA(bpf->extack, "offloading program in bad state");
  257. return -EINVAL;
  258. }
  259. return 0;
  260. }
  261. static bool
  262. nsim_map_key_match(struct bpf_map *map, struct nsim_map_entry *e, void *key)
  263. {
  264. return e->key && !memcmp(key, e->key, map->key_size);
  265. }
  266. static int nsim_map_key_find(struct bpf_offloaded_map *offmap, void *key)
  267. {
  268. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  269. unsigned int i;
  270. for (i = 0; i < ARRAY_SIZE(nmap->entry); i++)
  271. if (nsim_map_key_match(&offmap->map, &nmap->entry[i], key))
  272. return i;
  273. return -ENOENT;
  274. }
  275. static int
  276. nsim_map_alloc_elem(struct bpf_offloaded_map *offmap, unsigned int idx)
  277. {
  278. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  279. nmap->entry[idx].key = kmalloc(offmap->map.key_size, GFP_USER);
  280. if (!nmap->entry[idx].key)
  281. return -ENOMEM;
  282. nmap->entry[idx].value = kmalloc(offmap->map.value_size, GFP_USER);
  283. if (!nmap->entry[idx].value) {
  284. kfree(nmap->entry[idx].key);
  285. nmap->entry[idx].key = NULL;
  286. return -ENOMEM;
  287. }
  288. return 0;
  289. }
  290. static int
  291. nsim_map_get_next_key(struct bpf_offloaded_map *offmap,
  292. void *key, void *next_key)
  293. {
  294. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  295. int idx = -ENOENT;
  296. mutex_lock(&nmap->mutex);
  297. if (key)
  298. idx = nsim_map_key_find(offmap, key);
  299. if (idx == -ENOENT)
  300. idx = 0;
  301. else
  302. idx++;
  303. for (; idx < ARRAY_SIZE(nmap->entry); idx++) {
  304. if (nmap->entry[idx].key) {
  305. memcpy(next_key, nmap->entry[idx].key,
  306. offmap->map.key_size);
  307. break;
  308. }
  309. }
  310. mutex_unlock(&nmap->mutex);
  311. if (idx == ARRAY_SIZE(nmap->entry))
  312. return -ENOENT;
  313. return 0;
  314. }
  315. static int
  316. nsim_map_lookup_elem(struct bpf_offloaded_map *offmap, void *key, void *value)
  317. {
  318. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  319. int idx;
  320. mutex_lock(&nmap->mutex);
  321. idx = nsim_map_key_find(offmap, key);
  322. if (idx >= 0)
  323. memcpy(value, nmap->entry[idx].value, offmap->map.value_size);
  324. mutex_unlock(&nmap->mutex);
  325. return idx < 0 ? idx : 0;
  326. }
  327. static int
  328. nsim_map_update_elem(struct bpf_offloaded_map *offmap,
  329. void *key, void *value, u64 flags)
  330. {
  331. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  332. int idx, err = 0;
  333. mutex_lock(&nmap->mutex);
  334. idx = nsim_map_key_find(offmap, key);
  335. if (idx < 0 && flags == BPF_EXIST) {
  336. err = idx;
  337. goto exit_unlock;
  338. }
  339. if (idx >= 0 && flags == BPF_NOEXIST) {
  340. err = -EEXIST;
  341. goto exit_unlock;
  342. }
  343. if (idx < 0) {
  344. for (idx = 0; idx < ARRAY_SIZE(nmap->entry); idx++)
  345. if (!nmap->entry[idx].key)
  346. break;
  347. if (idx == ARRAY_SIZE(nmap->entry)) {
  348. err = -E2BIG;
  349. goto exit_unlock;
  350. }
  351. err = nsim_map_alloc_elem(offmap, idx);
  352. if (err)
  353. goto exit_unlock;
  354. }
  355. memcpy(nmap->entry[idx].key, key, offmap->map.key_size);
  356. memcpy(nmap->entry[idx].value, value, offmap->map.value_size);
  357. exit_unlock:
  358. mutex_unlock(&nmap->mutex);
  359. return err;
  360. }
  361. static int nsim_map_delete_elem(struct bpf_offloaded_map *offmap, void *key)
  362. {
  363. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  364. int idx;
  365. if (offmap->map.map_type == BPF_MAP_TYPE_ARRAY)
  366. return -EINVAL;
  367. mutex_lock(&nmap->mutex);
  368. idx = nsim_map_key_find(offmap, key);
  369. if (idx >= 0) {
  370. kfree(nmap->entry[idx].key);
  371. kfree(nmap->entry[idx].value);
  372. memset(&nmap->entry[idx], 0, sizeof(nmap->entry[idx]));
  373. }
  374. mutex_unlock(&nmap->mutex);
  375. return idx < 0 ? idx : 0;
  376. }
  377. static const struct bpf_map_dev_ops nsim_bpf_map_ops = {
  378. .map_get_next_key = nsim_map_get_next_key,
  379. .map_lookup_elem = nsim_map_lookup_elem,
  380. .map_update_elem = nsim_map_update_elem,
  381. .map_delete_elem = nsim_map_delete_elem,
  382. };
  383. static int
  384. nsim_bpf_map_alloc(struct netdevsim *ns, struct bpf_offloaded_map *offmap)
  385. {
  386. struct nsim_bpf_bound_map *nmap;
  387. int i, err;
  388. if (WARN_ON(offmap->map.map_type != BPF_MAP_TYPE_ARRAY &&
  389. offmap->map.map_type != BPF_MAP_TYPE_HASH))
  390. return -EINVAL;
  391. if (offmap->map.max_entries > NSIM_BPF_MAX_KEYS)
  392. return -ENOMEM;
  393. if (offmap->map.map_flags)
  394. return -EINVAL;
  395. nmap = kzalloc(sizeof(*nmap), GFP_USER);
  396. if (!nmap)
  397. return -ENOMEM;
  398. offmap->dev_priv = nmap;
  399. nmap->ns = ns;
  400. nmap->map = offmap;
  401. mutex_init(&nmap->mutex);
  402. if (offmap->map.map_type == BPF_MAP_TYPE_ARRAY) {
  403. for (i = 0; i < ARRAY_SIZE(nmap->entry); i++) {
  404. u32 *key;
  405. err = nsim_map_alloc_elem(offmap, i);
  406. if (err)
  407. goto err_free;
  408. key = nmap->entry[i].key;
  409. *key = i;
  410. }
  411. }
  412. offmap->dev_ops = &nsim_bpf_map_ops;
  413. list_add_tail(&nmap->l, &ns->bpf_bound_maps);
  414. return 0;
  415. err_free:
  416. while (--i >= 0) {
  417. kfree(nmap->entry[i].key);
  418. kfree(nmap->entry[i].value);
  419. }
  420. kfree(nmap);
  421. return err;
  422. }
  423. static void nsim_bpf_map_free(struct bpf_offloaded_map *offmap)
  424. {
  425. struct nsim_bpf_bound_map *nmap = offmap->dev_priv;
  426. unsigned int i;
  427. for (i = 0; i < ARRAY_SIZE(nmap->entry); i++) {
  428. kfree(nmap->entry[i].key);
  429. kfree(nmap->entry[i].value);
  430. }
  431. list_del_init(&nmap->l);
  432. mutex_destroy(&nmap->mutex);
  433. kfree(nmap);
  434. }
  435. int nsim_bpf(struct net_device *dev, struct netdev_bpf *bpf)
  436. {
  437. struct netdevsim *ns = netdev_priv(dev);
  438. struct nsim_bpf_bound_prog *state;
  439. int err;
  440. ASSERT_RTNL();
  441. switch (bpf->command) {
  442. case BPF_OFFLOAD_VERIFIER_PREP:
  443. if (!ns->bpf_bind_accept)
  444. return -EOPNOTSUPP;
  445. err = nsim_bpf_create_prog(ns, bpf->verifier.prog);
  446. if (err)
  447. return err;
  448. bpf->verifier.ops = &nsim_bpf_analyzer_ops;
  449. return 0;
  450. case BPF_OFFLOAD_TRANSLATE:
  451. state = bpf->offload.prog->aux->offload->dev_priv;
  452. state->state = "xlated";
  453. return 0;
  454. case BPF_OFFLOAD_DESTROY:
  455. nsim_bpf_destroy_prog(bpf->offload.prog);
  456. return 0;
  457. case XDP_QUERY_PROG:
  458. if (ns->xdp_prog_mode != XDP_ATTACHED_DRV)
  459. return 0;
  460. return xdp_attachment_query(&ns->xdp, bpf);
  461. case XDP_QUERY_PROG_HW:
  462. if (ns->xdp_prog_mode != XDP_ATTACHED_HW)
  463. return 0;
  464. return xdp_attachment_query(&ns->xdp, bpf);
  465. case XDP_SETUP_PROG:
  466. err = nsim_setup_prog_checks(ns, bpf);
  467. if (err)
  468. return err;
  469. return nsim_xdp_set_prog(ns, bpf);
  470. case XDP_SETUP_PROG_HW:
  471. err = nsim_setup_prog_hw_checks(ns, bpf);
  472. if (err)
  473. return err;
  474. return nsim_xdp_set_prog(ns, bpf);
  475. case BPF_OFFLOAD_MAP_ALLOC:
  476. if (!ns->bpf_map_accept)
  477. return -EOPNOTSUPP;
  478. return nsim_bpf_map_alloc(ns, bpf->offmap);
  479. case BPF_OFFLOAD_MAP_FREE:
  480. nsim_bpf_map_free(bpf->offmap);
  481. return 0;
  482. default:
  483. return -EINVAL;
  484. }
  485. }
  486. int nsim_bpf_init(struct netdevsim *ns)
  487. {
  488. INIT_LIST_HEAD(&ns->bpf_bound_progs);
  489. INIT_LIST_HEAD(&ns->bpf_bound_maps);
  490. debugfs_create_u32("bpf_offloaded_id", 0400, ns->ddir,
  491. &ns->bpf_offloaded_id);
  492. ns->bpf_bind_accept = true;
  493. debugfs_create_bool("bpf_bind_accept", 0600, ns->ddir,
  494. &ns->bpf_bind_accept);
  495. debugfs_create_u32("bpf_bind_verifier_delay", 0600, ns->ddir,
  496. &ns->bpf_bind_verifier_delay);
  497. ns->ddir_bpf_bound_progs =
  498. debugfs_create_dir("bpf_bound_progs", ns->ddir);
  499. if (IS_ERR_OR_NULL(ns->ddir_bpf_bound_progs))
  500. return -ENOMEM;
  501. ns->bpf_tc_accept = true;
  502. debugfs_create_bool("bpf_tc_accept", 0600, ns->ddir,
  503. &ns->bpf_tc_accept);
  504. debugfs_create_bool("bpf_tc_non_bound_accept", 0600, ns->ddir,
  505. &ns->bpf_tc_non_bound_accept);
  506. ns->bpf_xdpdrv_accept = true;
  507. debugfs_create_bool("bpf_xdpdrv_accept", 0600, ns->ddir,
  508. &ns->bpf_xdpdrv_accept);
  509. ns->bpf_xdpoffload_accept = true;
  510. debugfs_create_bool("bpf_xdpoffload_accept", 0600, ns->ddir,
  511. &ns->bpf_xdpoffload_accept);
  512. ns->bpf_map_accept = true;
  513. debugfs_create_bool("bpf_map_accept", 0600, ns->ddir,
  514. &ns->bpf_map_accept);
  515. return 0;
  516. }
  517. void nsim_bpf_uninit(struct netdevsim *ns)
  518. {
  519. WARN_ON(!list_empty(&ns->bpf_bound_progs));
  520. WARN_ON(!list_empty(&ns->bpf_bound_maps));
  521. WARN_ON(ns->xdp.prog);
  522. WARN_ON(ns->bpf_offloaded);
  523. }