arena.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /* Copyright (c) 2024 Meta Platforms, Inc. and affiliates. */
  3. #include <linux/bpf.h>
  4. #include <linux/btf.h>
  5. #include <linux/err.h>
  6. #include <linux/btf_ids.h>
  7. #include <linux/vmalloc.h>
  8. #include <linux/pagemap.h>
  9. /*
  10. * bpf_arena is a sparsely populated shared memory region between bpf program and
  11. * user space process.
  12. *
  13. * For example on x86-64 the values could be:
  14. * user_vm_start 7f7d26200000 // picked by mmap()
  15. * kern_vm_start ffffc90001e69000 // picked by get_vm_area()
  16. * For user space all pointers within the arena are normal 8-byte addresses.
  17. * In this example 7f7d26200000 is the address of the first page (pgoff=0).
  18. * The bpf program will access it as: kern_vm_start + lower_32bit_of_user_ptr
  19. * (u32)7f7d26200000 -> 26200000
  20. * hence
  21. * ffffc90001e69000 + 26200000 == ffffc90028069000 is "pgoff=0" within 4Gb
  22. * kernel memory region.
  23. *
  24. * BPF JITs generate the following code to access arena:
  25. * mov eax, eax // eax has lower 32-bit of user pointer
  26. * mov word ptr [rax + r12 + off], bx
  27. * where r12 == kern_vm_start and off is s16.
  28. * Hence allocate 4Gb + GUARD_SZ/2 on each side.
  29. *
  30. * Initially kernel vm_area and user vma are not populated.
  31. * User space can fault-in any address which will insert the page
  32. * into kernel and user vma.
  33. * bpf program can allocate a page via bpf_arena_alloc_pages() kfunc
  34. * which will insert it into kernel vm_area.
  35. * The later fault-in from user space will populate that page into user vma.
  36. */
  37. /* number of bytes addressable by LDX/STX insn with 16-bit 'off' field */
  38. #define GUARD_SZ round_up(1ull << sizeof_field(struct bpf_insn, off) * 8, PAGE_SIZE << 1)
  39. #define KERN_VM_SZ (SZ_4G + GUARD_SZ)
  40. struct bpf_arena {
  41. struct bpf_map map;
  42. u64 user_vm_start;
  43. u64 user_vm_end;
  44. struct vm_struct *kern_vm;
  45. struct maple_tree mt;
  46. struct list_head vma_list;
  47. struct mutex lock;
  48. };
  49. u64 bpf_arena_get_kern_vm_start(struct bpf_arena *arena)
  50. {
  51. return arena ? (u64) (long) arena->kern_vm->addr + GUARD_SZ / 2 : 0;
  52. }
  53. u64 bpf_arena_get_user_vm_start(struct bpf_arena *arena)
  54. {
  55. return arena ? arena->user_vm_start : 0;
  56. }
  57. static long arena_map_peek_elem(struct bpf_map *map, void *value)
  58. {
  59. return -EOPNOTSUPP;
  60. }
  61. static long arena_map_push_elem(struct bpf_map *map, void *value, u64 flags)
  62. {
  63. return -EOPNOTSUPP;
  64. }
  65. static long arena_map_pop_elem(struct bpf_map *map, void *value)
  66. {
  67. return -EOPNOTSUPP;
  68. }
  69. static long arena_map_delete_elem(struct bpf_map *map, void *value)
  70. {
  71. return -EOPNOTSUPP;
  72. }
  73. static int arena_map_get_next_key(struct bpf_map *map, void *key, void *next_key)
  74. {
  75. return -EOPNOTSUPP;
  76. }
  77. static long compute_pgoff(struct bpf_arena *arena, long uaddr)
  78. {
  79. return (u32)(uaddr - (u32)arena->user_vm_start) >> PAGE_SHIFT;
  80. }
  81. static struct bpf_map *arena_map_alloc(union bpf_attr *attr)
  82. {
  83. struct vm_struct *kern_vm;
  84. int numa_node = bpf_map_attr_numa_node(attr);
  85. struct bpf_arena *arena;
  86. u64 vm_range;
  87. int err = -ENOMEM;
  88. if (attr->key_size || attr->value_size || attr->max_entries == 0 ||
  89. /* BPF_F_MMAPABLE must be set */
  90. !(attr->map_flags & BPF_F_MMAPABLE) ||
  91. /* No unsupported flags present */
  92. (attr->map_flags & ~(BPF_F_SEGV_ON_FAULT | BPF_F_MMAPABLE | BPF_F_NO_USER_CONV)))
  93. return ERR_PTR(-EINVAL);
  94. if (attr->map_extra & ~PAGE_MASK)
  95. /* If non-zero the map_extra is an expected user VMA start address */
  96. return ERR_PTR(-EINVAL);
  97. vm_range = (u64)attr->max_entries * PAGE_SIZE;
  98. if (vm_range > SZ_4G)
  99. return ERR_PTR(-E2BIG);
  100. if ((attr->map_extra >> 32) != ((attr->map_extra + vm_range - 1) >> 32))
  101. /* user vma must not cross 32-bit boundary */
  102. return ERR_PTR(-ERANGE);
  103. kern_vm = get_vm_area(KERN_VM_SZ, VM_SPARSE | VM_USERMAP);
  104. if (!kern_vm)
  105. return ERR_PTR(-ENOMEM);
  106. arena = bpf_map_area_alloc(sizeof(*arena), numa_node);
  107. if (!arena)
  108. goto err;
  109. arena->kern_vm = kern_vm;
  110. arena->user_vm_start = attr->map_extra;
  111. if (arena->user_vm_start)
  112. arena->user_vm_end = arena->user_vm_start + vm_range;
  113. INIT_LIST_HEAD(&arena->vma_list);
  114. bpf_map_init_from_attr(&arena->map, attr);
  115. mt_init_flags(&arena->mt, MT_FLAGS_ALLOC_RANGE);
  116. mutex_init(&arena->lock);
  117. return &arena->map;
  118. err:
  119. free_vm_area(kern_vm);
  120. return ERR_PTR(err);
  121. }
  122. static int existing_page_cb(pte_t *ptep, unsigned long addr, void *data)
  123. {
  124. struct page *page;
  125. pte_t pte;
  126. pte = ptep_get(ptep);
  127. if (!pte_present(pte)) /* sanity check */
  128. return 0;
  129. page = pte_page(pte);
  130. /*
  131. * We do not update pte here:
  132. * 1. Nobody should be accessing bpf_arena's range outside of a kernel bug
  133. * 2. TLB flushing is batched or deferred. Even if we clear pte,
  134. * the TLB entries can stick around and continue to permit access to
  135. * the freed page. So it all relies on 1.
  136. */
  137. __free_page(page);
  138. return 0;
  139. }
  140. static void arena_map_free(struct bpf_map *map)
  141. {
  142. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  143. /*
  144. * Check that user vma-s are not around when bpf map is freed.
  145. * mmap() holds vm_file which holds bpf_map refcnt.
  146. * munmap() must have happened on vma followed by arena_vm_close()
  147. * which would clear arena->vma_list.
  148. */
  149. if (WARN_ON_ONCE(!list_empty(&arena->vma_list)))
  150. return;
  151. /*
  152. * free_vm_area() calls remove_vm_area() that calls free_unmap_vmap_area().
  153. * It unmaps everything from vmalloc area and clears pgtables.
  154. * Call apply_to_existing_page_range() first to find populated ptes and
  155. * free those pages.
  156. */
  157. apply_to_existing_page_range(&init_mm, bpf_arena_get_kern_vm_start(arena),
  158. KERN_VM_SZ - GUARD_SZ, existing_page_cb, NULL);
  159. free_vm_area(arena->kern_vm);
  160. mtree_destroy(&arena->mt);
  161. bpf_map_area_free(arena);
  162. }
  163. static void *arena_map_lookup_elem(struct bpf_map *map, void *key)
  164. {
  165. return ERR_PTR(-EINVAL);
  166. }
  167. static long arena_map_update_elem(struct bpf_map *map, void *key,
  168. void *value, u64 flags)
  169. {
  170. return -EOPNOTSUPP;
  171. }
  172. static int arena_map_check_btf(const struct bpf_map *map, const struct btf *btf,
  173. const struct btf_type *key_type, const struct btf_type *value_type)
  174. {
  175. return 0;
  176. }
  177. static u64 arena_map_mem_usage(const struct bpf_map *map)
  178. {
  179. return 0;
  180. }
  181. struct vma_list {
  182. struct vm_area_struct *vma;
  183. struct list_head head;
  184. refcount_t mmap_count;
  185. };
  186. static int remember_vma(struct bpf_arena *arena, struct vm_area_struct *vma)
  187. {
  188. struct vma_list *vml;
  189. vml = kmalloc(sizeof(*vml), GFP_KERNEL);
  190. if (!vml)
  191. return -ENOMEM;
  192. refcount_set(&vml->mmap_count, 1);
  193. vma->vm_private_data = vml;
  194. vml->vma = vma;
  195. list_add(&vml->head, &arena->vma_list);
  196. return 0;
  197. }
  198. static void arena_vm_open(struct vm_area_struct *vma)
  199. {
  200. struct vma_list *vml = vma->vm_private_data;
  201. refcount_inc(&vml->mmap_count);
  202. }
  203. static void arena_vm_close(struct vm_area_struct *vma)
  204. {
  205. struct bpf_map *map = vma->vm_file->private_data;
  206. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  207. struct vma_list *vml = vma->vm_private_data;
  208. if (!refcount_dec_and_test(&vml->mmap_count))
  209. return;
  210. guard(mutex)(&arena->lock);
  211. /* update link list under lock */
  212. list_del(&vml->head);
  213. vma->vm_private_data = NULL;
  214. kfree(vml);
  215. }
  216. #define MT_ENTRY ((void *)&arena_map_ops) /* unused. has to be valid pointer */
  217. static vm_fault_t arena_vm_fault(struct vm_fault *vmf)
  218. {
  219. struct bpf_map *map = vmf->vma->vm_file->private_data;
  220. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  221. struct page *page;
  222. long kbase, kaddr;
  223. int ret;
  224. kbase = bpf_arena_get_kern_vm_start(arena);
  225. kaddr = kbase + (u32)(vmf->address);
  226. guard(mutex)(&arena->lock);
  227. page = vmalloc_to_page((void *)kaddr);
  228. if (page)
  229. /* already have a page vmap-ed */
  230. goto out;
  231. if (arena->map.map_flags & BPF_F_SEGV_ON_FAULT)
  232. /* User space requested to segfault when page is not allocated by bpf prog */
  233. return VM_FAULT_SIGSEGV;
  234. ret = mtree_insert(&arena->mt, vmf->pgoff, MT_ENTRY, GFP_KERNEL);
  235. if (ret)
  236. return VM_FAULT_SIGSEGV;
  237. /* Account into memcg of the process that created bpf_arena */
  238. ret = bpf_map_alloc_pages(map, GFP_KERNEL | __GFP_ZERO, NUMA_NO_NODE, 1, &page);
  239. if (ret) {
  240. mtree_erase(&arena->mt, vmf->pgoff);
  241. return VM_FAULT_SIGSEGV;
  242. }
  243. ret = vm_area_map_pages(arena->kern_vm, kaddr, kaddr + PAGE_SIZE, &page);
  244. if (ret) {
  245. mtree_erase(&arena->mt, vmf->pgoff);
  246. __free_page(page);
  247. return VM_FAULT_SIGSEGV;
  248. }
  249. out:
  250. page_ref_add(page, 1);
  251. vmf->page = page;
  252. return 0;
  253. }
  254. static const struct vm_operations_struct arena_vm_ops = {
  255. .open = arena_vm_open,
  256. .close = arena_vm_close,
  257. .fault = arena_vm_fault,
  258. };
  259. static unsigned long arena_get_unmapped_area(struct file *filp, unsigned long addr,
  260. unsigned long len, unsigned long pgoff,
  261. unsigned long flags)
  262. {
  263. struct bpf_map *map = filp->private_data;
  264. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  265. long ret;
  266. if (pgoff)
  267. return -EINVAL;
  268. if (len > SZ_4G)
  269. return -E2BIG;
  270. /* if user_vm_start was specified at arena creation time */
  271. if (arena->user_vm_start) {
  272. if (len > arena->user_vm_end - arena->user_vm_start)
  273. return -E2BIG;
  274. if (len != arena->user_vm_end - arena->user_vm_start)
  275. return -EINVAL;
  276. if (addr != arena->user_vm_start)
  277. return -EINVAL;
  278. }
  279. ret = mm_get_unmapped_area(current->mm, filp, addr, len * 2, 0, flags);
  280. if (IS_ERR_VALUE(ret))
  281. return ret;
  282. if ((ret >> 32) == ((ret + len - 1) >> 32))
  283. return ret;
  284. if (WARN_ON_ONCE(arena->user_vm_start))
  285. /* checks at map creation time should prevent this */
  286. return -EFAULT;
  287. return round_up(ret, SZ_4G);
  288. }
  289. static int arena_map_mmap(struct bpf_map *map, struct vm_area_struct *vma)
  290. {
  291. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  292. guard(mutex)(&arena->lock);
  293. if (arena->user_vm_start && arena->user_vm_start != vma->vm_start)
  294. /*
  295. * If map_extra was not specified at arena creation time then
  296. * 1st user process can do mmap(NULL, ...) to pick user_vm_start
  297. * 2nd user process must pass the same addr to mmap(addr, MAP_FIXED..);
  298. * or
  299. * specify addr in map_extra and
  300. * use the same addr later with mmap(addr, MAP_FIXED..);
  301. */
  302. return -EBUSY;
  303. if (arena->user_vm_end && arena->user_vm_end != vma->vm_end)
  304. /* all user processes must have the same size of mmap-ed region */
  305. return -EBUSY;
  306. /* Earlier checks should prevent this */
  307. if (WARN_ON_ONCE(vma->vm_end - vma->vm_start > SZ_4G || vma->vm_pgoff))
  308. return -EFAULT;
  309. if (remember_vma(arena, vma))
  310. return -ENOMEM;
  311. arena->user_vm_start = vma->vm_start;
  312. arena->user_vm_end = vma->vm_end;
  313. /*
  314. * bpf_map_mmap() checks that it's being mmaped as VM_SHARED and
  315. * clears VM_MAYEXEC. Set VM_DONTEXPAND as well to avoid
  316. * potential change of user_vm_start.
  317. */
  318. vm_flags_set(vma, VM_DONTEXPAND);
  319. vma->vm_ops = &arena_vm_ops;
  320. return 0;
  321. }
  322. static int arena_map_direct_value_addr(const struct bpf_map *map, u64 *imm, u32 off)
  323. {
  324. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  325. if ((u64)off > arena->user_vm_end - arena->user_vm_start)
  326. return -ERANGE;
  327. *imm = (unsigned long)arena->user_vm_start;
  328. return 0;
  329. }
  330. BTF_ID_LIST_SINGLE(bpf_arena_map_btf_ids, struct, bpf_arena)
  331. const struct bpf_map_ops arena_map_ops = {
  332. .map_meta_equal = bpf_map_meta_equal,
  333. .map_alloc = arena_map_alloc,
  334. .map_free = arena_map_free,
  335. .map_direct_value_addr = arena_map_direct_value_addr,
  336. .map_mmap = arena_map_mmap,
  337. .map_get_unmapped_area = arena_get_unmapped_area,
  338. .map_get_next_key = arena_map_get_next_key,
  339. .map_push_elem = arena_map_push_elem,
  340. .map_peek_elem = arena_map_peek_elem,
  341. .map_pop_elem = arena_map_pop_elem,
  342. .map_lookup_elem = arena_map_lookup_elem,
  343. .map_update_elem = arena_map_update_elem,
  344. .map_delete_elem = arena_map_delete_elem,
  345. .map_check_btf = arena_map_check_btf,
  346. .map_mem_usage = arena_map_mem_usage,
  347. .map_btf_id = &bpf_arena_map_btf_ids[0],
  348. };
  349. static u64 clear_lo32(u64 val)
  350. {
  351. return val & ~(u64)~0U;
  352. }
  353. /*
  354. * Allocate pages and vmap them into kernel vmalloc area.
  355. * Later the pages will be mmaped into user space vma.
  356. */
  357. static long arena_alloc_pages(struct bpf_arena *arena, long uaddr, long page_cnt, int node_id)
  358. {
  359. /* user_vm_end/start are fixed before bpf prog runs */
  360. long page_cnt_max = (arena->user_vm_end - arena->user_vm_start) >> PAGE_SHIFT;
  361. u64 kern_vm_start = bpf_arena_get_kern_vm_start(arena);
  362. struct page **pages;
  363. long pgoff = 0;
  364. u32 uaddr32;
  365. int ret, i;
  366. if (page_cnt > page_cnt_max)
  367. return 0;
  368. if (uaddr) {
  369. if (uaddr & ~PAGE_MASK)
  370. return 0;
  371. pgoff = compute_pgoff(arena, uaddr);
  372. if (pgoff > page_cnt_max - page_cnt)
  373. /* requested address will be outside of user VMA */
  374. return 0;
  375. }
  376. /* zeroing is needed, since alloc_pages_bulk_array() only fills in non-zero entries */
  377. pages = kvcalloc(page_cnt, sizeof(struct page *), GFP_KERNEL);
  378. if (!pages)
  379. return 0;
  380. guard(mutex)(&arena->lock);
  381. if (uaddr)
  382. ret = mtree_insert_range(&arena->mt, pgoff, pgoff + page_cnt - 1,
  383. MT_ENTRY, GFP_KERNEL);
  384. else
  385. ret = mtree_alloc_range(&arena->mt, &pgoff, MT_ENTRY,
  386. page_cnt, 0, page_cnt_max - 1, GFP_KERNEL);
  387. if (ret)
  388. goto out_free_pages;
  389. ret = bpf_map_alloc_pages(&arena->map, GFP_KERNEL | __GFP_ZERO,
  390. node_id, page_cnt, pages);
  391. if (ret)
  392. goto out;
  393. uaddr32 = (u32)(arena->user_vm_start + pgoff * PAGE_SIZE);
  394. /* Earlier checks made sure that uaddr32 + page_cnt * PAGE_SIZE - 1
  395. * will not overflow 32-bit. Lower 32-bit need to represent
  396. * contiguous user address range.
  397. * Map these pages at kern_vm_start base.
  398. * kern_vm_start + uaddr32 + page_cnt * PAGE_SIZE - 1 can overflow
  399. * lower 32-bit and it's ok.
  400. */
  401. ret = vm_area_map_pages(arena->kern_vm, kern_vm_start + uaddr32,
  402. kern_vm_start + uaddr32 + page_cnt * PAGE_SIZE, pages);
  403. if (ret) {
  404. for (i = 0; i < page_cnt; i++)
  405. __free_page(pages[i]);
  406. goto out;
  407. }
  408. kvfree(pages);
  409. return clear_lo32(arena->user_vm_start) + uaddr32;
  410. out:
  411. mtree_erase(&arena->mt, pgoff);
  412. out_free_pages:
  413. kvfree(pages);
  414. return 0;
  415. }
  416. /*
  417. * If page is present in vmalloc area, unmap it from vmalloc area,
  418. * unmap it from all user space vma-s,
  419. * and free it.
  420. */
  421. static void zap_pages(struct bpf_arena *arena, long uaddr, long page_cnt)
  422. {
  423. struct vma_list *vml;
  424. list_for_each_entry(vml, &arena->vma_list, head)
  425. zap_page_range_single(vml->vma, uaddr,
  426. PAGE_SIZE * page_cnt, NULL);
  427. }
  428. static void arena_free_pages(struct bpf_arena *arena, long uaddr, long page_cnt)
  429. {
  430. u64 full_uaddr, uaddr_end;
  431. long kaddr, pgoff, i;
  432. struct page *page;
  433. /* only aligned lower 32-bit are relevant */
  434. uaddr = (u32)uaddr;
  435. uaddr &= PAGE_MASK;
  436. full_uaddr = clear_lo32(arena->user_vm_start) + uaddr;
  437. uaddr_end = min(arena->user_vm_end, full_uaddr + (page_cnt << PAGE_SHIFT));
  438. if (full_uaddr >= uaddr_end)
  439. return;
  440. page_cnt = (uaddr_end - full_uaddr) >> PAGE_SHIFT;
  441. guard(mutex)(&arena->lock);
  442. pgoff = compute_pgoff(arena, uaddr);
  443. /* clear range */
  444. mtree_store_range(&arena->mt, pgoff, pgoff + page_cnt - 1, NULL, GFP_KERNEL);
  445. if (page_cnt > 1)
  446. /* bulk zap if multiple pages being freed */
  447. zap_pages(arena, full_uaddr, page_cnt);
  448. kaddr = bpf_arena_get_kern_vm_start(arena) + uaddr;
  449. for (i = 0; i < page_cnt; i++, kaddr += PAGE_SIZE, full_uaddr += PAGE_SIZE) {
  450. page = vmalloc_to_page((void *)kaddr);
  451. if (!page)
  452. continue;
  453. if (page_cnt == 1 && page_mapped(page)) /* mapped by some user process */
  454. /* Optimization for the common case of page_cnt==1:
  455. * If page wasn't mapped into some user vma there
  456. * is no need to call zap_pages which is slow. When
  457. * page_cnt is big it's faster to do the batched zap.
  458. */
  459. zap_pages(arena, full_uaddr, 1);
  460. vm_area_unmap_pages(arena->kern_vm, kaddr, kaddr + PAGE_SIZE);
  461. __free_page(page);
  462. }
  463. }
  464. __bpf_kfunc_start_defs();
  465. __bpf_kfunc void *bpf_arena_alloc_pages(void *p__map, void *addr__ign, u32 page_cnt,
  466. int node_id, u64 flags)
  467. {
  468. struct bpf_map *map = p__map;
  469. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  470. if (map->map_type != BPF_MAP_TYPE_ARENA || flags || !page_cnt)
  471. return NULL;
  472. return (void *)arena_alloc_pages(arena, (long)addr__ign, page_cnt, node_id);
  473. }
  474. __bpf_kfunc void bpf_arena_free_pages(void *p__map, void *ptr__ign, u32 page_cnt)
  475. {
  476. struct bpf_map *map = p__map;
  477. struct bpf_arena *arena = container_of(map, struct bpf_arena, map);
  478. if (map->map_type != BPF_MAP_TYPE_ARENA || !page_cnt || !ptr__ign)
  479. return;
  480. arena_free_pages(arena, (long)ptr__ign, page_cnt);
  481. }
  482. __bpf_kfunc_end_defs();
  483. BTF_KFUNCS_START(arena_kfuncs)
  484. BTF_ID_FLAGS(func, bpf_arena_alloc_pages, KF_TRUSTED_ARGS | KF_SLEEPABLE)
  485. BTF_ID_FLAGS(func, bpf_arena_free_pages, KF_TRUSTED_ARGS | KF_SLEEPABLE)
  486. BTF_KFUNCS_END(arena_kfuncs)
  487. static const struct btf_kfunc_id_set common_kfunc_set = {
  488. .owner = THIS_MODULE,
  489. .set = &arena_kfuncs,
  490. };
  491. static int __init kfunc_init(void)
  492. {
  493. return register_btf_kfunc_id_set(BPF_PROG_TYPE_UNSPEC, &common_kfunc_set);
  494. }
  495. late_initcall(kfunc_init);