bpf.c 15 KB

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