1 /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
2 * Copyright (c) 2016,2017 Facebook
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of version 2 of the GNU General Public
6 * License as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful, but
9 * WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 #include <linux/bpf.h>
14 #include <linux/btf.h>
15 #include <linux/err.h>
16 #include <linux/slab.h>
18 #include <linux/filter.h>
19 #include <linux/perf_event.h>
20 #include <uapi/linux/btf.h>
22 #include "map_in_map.h"
24 #define ARRAY_CREATE_FLAG_MASK \
25 (BPF_F_NUMA_NODE | BPF_F_ACCESS_MASK)
27 static void bpf_array_free_percpu(struct bpf_array *array)
31 for (i = 0; i < array->map.max_entries; i++) {
32 free_percpu(array->pptrs[i]);
37 static int bpf_array_alloc_percpu(struct bpf_array *array)
42 for (i = 0; i < array->map.max_entries; i++) {
43 ptr = __alloc_percpu_gfp(array->elem_size, 8,
44 GFP_USER | __GFP_NOWARN);
46 bpf_array_free_percpu(array);
49 array->pptrs[i] = ptr;
56 /* Called from syscall */
57 int array_map_alloc_check(union bpf_attr *attr)
59 bool percpu = attr->map_type == BPF_MAP_TYPE_PERCPU_ARRAY;
60 int numa_node = bpf_map_attr_numa_node(attr);
62 /* check sanity of attributes */
63 if (attr->max_entries == 0 || attr->key_size != 4 ||
64 attr->value_size == 0 ||
65 attr->map_flags & ~ARRAY_CREATE_FLAG_MASK ||
66 !bpf_map_flags_access_ok(attr->map_flags) ||
67 (percpu && numa_node != NUMA_NO_NODE))
70 if (attr->value_size > KMALLOC_MAX_SIZE)
71 /* if value_size is bigger, the user space won't be able to
72 * access the elements.
79 static struct bpf_map *array_map_alloc(union bpf_attr *attr)
81 bool percpu = attr->map_type == BPF_MAP_TYPE_PERCPU_ARRAY;
82 int ret, numa_node = bpf_map_attr_numa_node(attr);
83 u32 elem_size, index_mask, max_entries;
84 bool unpriv = !capable(CAP_SYS_ADMIN);
85 u64 cost, array_size, mask64;
86 struct bpf_map_memory mem;
87 struct bpf_array *array;
89 elem_size = round_up(attr->value_size, 8);
91 max_entries = attr->max_entries;
93 /* On 32 bit archs roundup_pow_of_two() with max_entries that has
94 * upper most bit set in u32 space is undefined behavior due to
95 * resulting 1U << 32, so do it manually here in u64 space.
97 mask64 = fls_long(max_entries - 1);
98 mask64 = 1ULL << mask64;
103 /* round up array size to nearest power of 2,
104 * since cpu will speculate within index_mask limits
106 max_entries = index_mask + 1;
107 /* Check for overflows. */
108 if (max_entries < attr->max_entries)
109 return ERR_PTR(-E2BIG);
112 array_size = sizeof(*array);
114 array_size += (u64) max_entries * sizeof(void *);
116 array_size += (u64) max_entries * elem_size;
118 /* make sure there is no u32 overflow later in round_up() */
121 cost += (u64)attr->max_entries * elem_size * num_possible_cpus();
123 ret = bpf_map_charge_init(&mem, cost);
127 /* allocate all map elements and zero-initialize them */
128 array = bpf_map_area_alloc(array_size, numa_node);
130 bpf_map_charge_finish(&mem);
131 return ERR_PTR(-ENOMEM);
133 array->index_mask = index_mask;
134 array->map.unpriv_array = unpriv;
136 /* copy mandatory map attributes */
137 bpf_map_init_from_attr(&array->map, attr);
138 bpf_map_charge_move(&array->map.memory, &mem);
139 array->elem_size = elem_size;
141 if (percpu && bpf_array_alloc_percpu(array)) {
142 bpf_map_charge_finish(&array->map.memory);
143 bpf_map_area_free(array);
144 return ERR_PTR(-ENOMEM);
150 /* Called from syscall or from eBPF program */
151 static void *array_map_lookup_elem(struct bpf_map *map, void *key)
153 struct bpf_array *array = container_of(map, struct bpf_array, map);
154 u32 index = *(u32 *)key;
156 if (unlikely(index >= array->map.max_entries))
159 return array->value + array->elem_size * (index & array->index_mask);
162 static int array_map_direct_value_addr(const struct bpf_map *map, u64 *imm,
165 struct bpf_array *array = container_of(map, struct bpf_array, map);
167 if (map->max_entries != 1)
169 if (off >= map->value_size)
172 *imm = (unsigned long)array->value;
176 static int array_map_direct_value_meta(const struct bpf_map *map, u64 imm,
179 struct bpf_array *array = container_of(map, struct bpf_array, map);
180 u64 base = (unsigned long)array->value;
181 u64 range = array->elem_size;
183 if (map->max_entries != 1)
185 if (imm < base || imm >= base + range)
192 /* emit BPF instructions equivalent to C code of array_map_lookup_elem() */
193 static u32 array_map_gen_lookup(struct bpf_map *map, struct bpf_insn *insn_buf)
195 struct bpf_array *array = container_of(map, struct bpf_array, map);
196 struct bpf_insn *insn = insn_buf;
197 u32 elem_size = round_up(map->value_size, 8);
198 const int ret = BPF_REG_0;
199 const int map_ptr = BPF_REG_1;
200 const int index = BPF_REG_2;
202 *insn++ = BPF_ALU64_IMM(BPF_ADD, map_ptr, offsetof(struct bpf_array, value));
203 *insn++ = BPF_LDX_MEM(BPF_W, ret, index, 0);
204 if (map->unpriv_array) {
205 *insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 4);
206 *insn++ = BPF_ALU32_IMM(BPF_AND, ret, array->index_mask);
208 *insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 3);
211 if (is_power_of_2(elem_size)) {
212 *insn++ = BPF_ALU64_IMM(BPF_LSH, ret, ilog2(elem_size));
214 *insn++ = BPF_ALU64_IMM(BPF_MUL, ret, elem_size);
216 *insn++ = BPF_ALU64_REG(BPF_ADD, ret, map_ptr);
217 *insn++ = BPF_JMP_IMM(BPF_JA, 0, 0, 1);
218 *insn++ = BPF_MOV64_IMM(ret, 0);
219 return insn - insn_buf;
222 /* Called from eBPF program */
223 static void *percpu_array_map_lookup_elem(struct bpf_map *map, void *key)
225 struct bpf_array *array = container_of(map, struct bpf_array, map);
226 u32 index = *(u32 *)key;
228 if (unlikely(index >= array->map.max_entries))
231 return this_cpu_ptr(array->pptrs[index & array->index_mask]);
234 int bpf_percpu_array_copy(struct bpf_map *map, void *key, void *value)
236 struct bpf_array *array = container_of(map, struct bpf_array, map);
237 u32 index = *(u32 *)key;
242 if (unlikely(index >= array->map.max_entries))
245 /* per_cpu areas are zero-filled and bpf programs can only
246 * access 'value_size' of them, so copying rounded areas
247 * will not leak any kernel data
249 size = round_up(map->value_size, 8);
251 pptr = array->pptrs[index & array->index_mask];
252 for_each_possible_cpu(cpu) {
253 bpf_long_memcpy(value + off, per_cpu_ptr(pptr, cpu), size);
260 /* Called from syscall */
261 static int array_map_get_next_key(struct bpf_map *map, void *key, void *next_key)
263 struct bpf_array *array = container_of(map, struct bpf_array, map);
264 u32 index = key ? *(u32 *)key : U32_MAX;
265 u32 *next = (u32 *)next_key;
267 if (index >= array->map.max_entries) {
272 if (index == array->map.max_entries - 1)
279 /* Called from syscall or from eBPF program */
280 static int array_map_update_elem(struct bpf_map *map, void *key, void *value,
283 struct bpf_array *array = container_of(map, struct bpf_array, map);
284 u32 index = *(u32 *)key;
287 if (unlikely((map_flags & ~BPF_F_LOCK) > BPF_EXIST))
291 if (unlikely(index >= array->map.max_entries))
292 /* all elements were pre-allocated, cannot insert a new one */
295 if (unlikely(map_flags & BPF_NOEXIST))
296 /* all elements already exist */
299 if (unlikely((map_flags & BPF_F_LOCK) &&
300 !map_value_has_spin_lock(map)))
303 if (array->map.map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
304 memcpy(this_cpu_ptr(array->pptrs[index & array->index_mask]),
305 value, map->value_size);
308 array->elem_size * (index & array->index_mask);
309 if (map_flags & BPF_F_LOCK)
310 copy_map_value_locked(map, val, value, false);
312 copy_map_value(map, val, value);
317 int bpf_percpu_array_update(struct bpf_map *map, void *key, void *value,
320 struct bpf_array *array = container_of(map, struct bpf_array, map);
321 u32 index = *(u32 *)key;
326 if (unlikely(map_flags > BPF_EXIST))
330 if (unlikely(index >= array->map.max_entries))
331 /* all elements were pre-allocated, cannot insert a new one */
334 if (unlikely(map_flags == BPF_NOEXIST))
335 /* all elements already exist */
338 /* the user space will provide round_up(value_size, 8) bytes that
339 * will be copied into per-cpu area. bpf programs can only access
340 * value_size of it. During lookup the same extra bytes will be
341 * returned or zeros which were zero-filled by percpu_alloc,
342 * so no kernel data leaks possible
344 size = round_up(map->value_size, 8);
346 pptr = array->pptrs[index & array->index_mask];
347 for_each_possible_cpu(cpu) {
348 bpf_long_memcpy(per_cpu_ptr(pptr, cpu), value + off, size);
355 /* Called from syscall or from eBPF program */
356 static int array_map_delete_elem(struct bpf_map *map, void *key)
361 /* Called when map->refcnt goes to zero, either from workqueue or from syscall */
362 static void array_map_free(struct bpf_map *map)
364 struct bpf_array *array = container_of(map, struct bpf_array, map);
366 /* at this point bpf_prog->aux->refcnt == 0 and this map->refcnt == 0,
367 * so the programs (can be more than one that used this map) were
368 * disconnected from events. Wait for outstanding programs to complete
373 if (array->map.map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
374 bpf_array_free_percpu(array);
376 bpf_map_area_free(array);
379 static void array_map_seq_show_elem(struct bpf_map *map, void *key,
386 value = array_map_lookup_elem(map, key);
392 if (map->btf_key_type_id)
393 seq_printf(m, "%u: ", *(u32 *)key);
394 btf_type_seq_show(map->btf, map->btf_value_type_id, value, m);
400 static void percpu_array_map_seq_show_elem(struct bpf_map *map, void *key,
403 struct bpf_array *array = container_of(map, struct bpf_array, map);
404 u32 index = *(u32 *)key;
410 seq_printf(m, "%u: {\n", *(u32 *)key);
411 pptr = array->pptrs[index & array->index_mask];
412 for_each_possible_cpu(cpu) {
413 seq_printf(m, "\tcpu%d: ", cpu);
414 btf_type_seq_show(map->btf, map->btf_value_type_id,
415 per_cpu_ptr(pptr, cpu), m);
423 static int array_map_check_btf(const struct bpf_map *map,
424 const struct btf *btf,
425 const struct btf_type *key_type,
426 const struct btf_type *value_type)
430 /* One exception for keyless BTF: .bss/.data/.rodata map */
431 if (btf_type_is_void(key_type)) {
432 if (map->map_type != BPF_MAP_TYPE_ARRAY ||
433 map->max_entries != 1)
436 if (BTF_INFO_KIND(value_type->info) != BTF_KIND_DATASEC)
442 if (BTF_INFO_KIND(key_type->info) != BTF_KIND_INT)
445 int_data = *(u32 *)(key_type + 1);
446 /* bpf array can only take a u32 key. This check makes sure
447 * that the btf matches the attr used during map_create.
449 if (BTF_INT_BITS(int_data) != 32 || BTF_INT_OFFSET(int_data))
455 const struct bpf_map_ops array_map_ops = {
456 .map_alloc_check = array_map_alloc_check,
457 .map_alloc = array_map_alloc,
458 .map_free = array_map_free,
459 .map_get_next_key = array_map_get_next_key,
460 .map_lookup_elem = array_map_lookup_elem,
461 .map_update_elem = array_map_update_elem,
462 .map_delete_elem = array_map_delete_elem,
463 .map_gen_lookup = array_map_gen_lookup,
464 .map_direct_value_addr = array_map_direct_value_addr,
465 .map_direct_value_meta = array_map_direct_value_meta,
466 .map_seq_show_elem = array_map_seq_show_elem,
467 .map_check_btf = array_map_check_btf,
470 const struct bpf_map_ops percpu_array_map_ops = {
471 .map_alloc_check = array_map_alloc_check,
472 .map_alloc = array_map_alloc,
473 .map_free = array_map_free,
474 .map_get_next_key = array_map_get_next_key,
475 .map_lookup_elem = percpu_array_map_lookup_elem,
476 .map_update_elem = array_map_update_elem,
477 .map_delete_elem = array_map_delete_elem,
478 .map_seq_show_elem = percpu_array_map_seq_show_elem,
479 .map_check_btf = array_map_check_btf,
482 static int fd_array_map_alloc_check(union bpf_attr *attr)
484 /* only file descriptors can be stored in this type of map */
485 if (attr->value_size != sizeof(u32))
487 /* Program read-only/write-only not supported for special maps yet. */
488 if (attr->map_flags & (BPF_F_RDONLY_PROG | BPF_F_WRONLY_PROG))
490 return array_map_alloc_check(attr);
493 static void fd_array_map_free(struct bpf_map *map)
495 struct bpf_array *array = container_of(map, struct bpf_array, map);
500 /* make sure it's empty */
501 for (i = 0; i < array->map.max_entries; i++)
502 BUG_ON(array->ptrs[i] != NULL);
504 bpf_map_area_free(array);
507 static void *fd_array_map_lookup_elem(struct bpf_map *map, void *key)
509 return ERR_PTR(-EOPNOTSUPP);
512 /* only called from syscall */
513 int bpf_fd_array_map_lookup_elem(struct bpf_map *map, void *key, u32 *value)
518 if (!map->ops->map_fd_sys_lookup_elem)
522 elem = array_map_lookup_elem(map, key);
523 if (elem && (ptr = READ_ONCE(*elem)))
524 *value = map->ops->map_fd_sys_lookup_elem(ptr);
532 /* only called from syscall */
533 int bpf_fd_array_map_update_elem(struct bpf_map *map, struct file *map_file,
534 void *key, void *value, u64 map_flags)
536 struct bpf_array *array = container_of(map, struct bpf_array, map);
537 void *new_ptr, *old_ptr;
538 u32 index = *(u32 *)key, ufd;
540 if (map_flags != BPF_ANY)
543 if (index >= array->map.max_entries)
547 new_ptr = map->ops->map_fd_get_ptr(map, map_file, ufd);
549 return PTR_ERR(new_ptr);
551 old_ptr = xchg(array->ptrs + index, new_ptr);
553 map->ops->map_fd_put_ptr(old_ptr);
558 static int fd_array_map_delete_elem(struct bpf_map *map, void *key)
560 struct bpf_array *array = container_of(map, struct bpf_array, map);
562 u32 index = *(u32 *)key;
564 if (index >= array->map.max_entries)
567 old_ptr = xchg(array->ptrs + index, NULL);
569 map->ops->map_fd_put_ptr(old_ptr);
576 static void *prog_fd_array_get_ptr(struct bpf_map *map,
577 struct file *map_file, int fd)
579 struct bpf_array *array = container_of(map, struct bpf_array, map);
580 struct bpf_prog *prog = bpf_prog_get(fd);
585 if (!bpf_prog_array_compatible(array, prog)) {
587 return ERR_PTR(-EINVAL);
593 static void prog_fd_array_put_ptr(void *ptr)
598 static u32 prog_fd_array_sys_lookup_elem(void *ptr)
600 return ((struct bpf_prog *)ptr)->aux->id;
603 /* decrement refcnt of all bpf_progs that are stored in this map */
604 static void bpf_fd_array_map_clear(struct bpf_map *map)
606 struct bpf_array *array = container_of(map, struct bpf_array, map);
609 for (i = 0; i < array->map.max_entries; i++)
610 fd_array_map_delete_elem(map, &i);
613 static void prog_array_map_seq_show_elem(struct bpf_map *map, void *key,
621 elem = array_map_lookup_elem(map, key);
623 ptr = READ_ONCE(*elem);
625 seq_printf(m, "%u: ", *(u32 *)key);
626 prog_id = prog_fd_array_sys_lookup_elem(ptr);
627 btf_type_seq_show(map->btf, map->btf_value_type_id,
636 const struct bpf_map_ops prog_array_map_ops = {
637 .map_alloc_check = fd_array_map_alloc_check,
638 .map_alloc = array_map_alloc,
639 .map_free = fd_array_map_free,
640 .map_get_next_key = array_map_get_next_key,
641 .map_lookup_elem = fd_array_map_lookup_elem,
642 .map_delete_elem = fd_array_map_delete_elem,
643 .map_fd_get_ptr = prog_fd_array_get_ptr,
644 .map_fd_put_ptr = prog_fd_array_put_ptr,
645 .map_fd_sys_lookup_elem = prog_fd_array_sys_lookup_elem,
646 .map_release_uref = bpf_fd_array_map_clear,
647 .map_seq_show_elem = prog_array_map_seq_show_elem,
650 static struct bpf_event_entry *bpf_event_entry_gen(struct file *perf_file,
651 struct file *map_file)
653 struct bpf_event_entry *ee;
655 ee = kzalloc(sizeof(*ee), GFP_ATOMIC);
657 ee->event = perf_file->private_data;
658 ee->perf_file = perf_file;
659 ee->map_file = map_file;
665 static void __bpf_event_entry_free(struct rcu_head *rcu)
667 struct bpf_event_entry *ee;
669 ee = container_of(rcu, struct bpf_event_entry, rcu);
674 static void bpf_event_entry_free_rcu(struct bpf_event_entry *ee)
676 call_rcu(&ee->rcu, __bpf_event_entry_free);
679 static void *perf_event_fd_array_get_ptr(struct bpf_map *map,
680 struct file *map_file, int fd)
682 struct bpf_event_entry *ee;
683 struct perf_event *event;
684 struct file *perf_file;
687 perf_file = perf_event_get(fd);
688 if (IS_ERR(perf_file))
691 ee = ERR_PTR(-EOPNOTSUPP);
692 event = perf_file->private_data;
693 if (perf_event_read_local(event, &value, NULL, NULL) == -EOPNOTSUPP)
696 ee = bpf_event_entry_gen(perf_file, map_file);
699 ee = ERR_PTR(-ENOMEM);
705 static void perf_event_fd_array_put_ptr(void *ptr)
707 bpf_event_entry_free_rcu(ptr);
710 static void perf_event_fd_array_release(struct bpf_map *map,
711 struct file *map_file)
713 struct bpf_array *array = container_of(map, struct bpf_array, map);
714 struct bpf_event_entry *ee;
718 for (i = 0; i < array->map.max_entries; i++) {
719 ee = READ_ONCE(array->ptrs[i]);
720 if (ee && ee->map_file == map_file)
721 fd_array_map_delete_elem(map, &i);
726 const struct bpf_map_ops perf_event_array_map_ops = {
727 .map_alloc_check = fd_array_map_alloc_check,
728 .map_alloc = array_map_alloc,
729 .map_free = fd_array_map_free,
730 .map_get_next_key = array_map_get_next_key,
731 .map_lookup_elem = fd_array_map_lookup_elem,
732 .map_delete_elem = fd_array_map_delete_elem,
733 .map_fd_get_ptr = perf_event_fd_array_get_ptr,
734 .map_fd_put_ptr = perf_event_fd_array_put_ptr,
735 .map_release = perf_event_fd_array_release,
736 .map_check_btf = map_check_no_btf,
739 #ifdef CONFIG_CGROUPS
740 static void *cgroup_fd_array_get_ptr(struct bpf_map *map,
741 struct file *map_file /* not used */,
744 return cgroup_get_from_fd(fd);
747 static void cgroup_fd_array_put_ptr(void *ptr)
749 /* cgroup_put free cgrp after a rcu grace period */
753 static void cgroup_fd_array_free(struct bpf_map *map)
755 bpf_fd_array_map_clear(map);
756 fd_array_map_free(map);
759 const struct bpf_map_ops cgroup_array_map_ops = {
760 .map_alloc_check = fd_array_map_alloc_check,
761 .map_alloc = array_map_alloc,
762 .map_free = cgroup_fd_array_free,
763 .map_get_next_key = array_map_get_next_key,
764 .map_lookup_elem = fd_array_map_lookup_elem,
765 .map_delete_elem = fd_array_map_delete_elem,
766 .map_fd_get_ptr = cgroup_fd_array_get_ptr,
767 .map_fd_put_ptr = cgroup_fd_array_put_ptr,
768 .map_check_btf = map_check_no_btf,
772 static struct bpf_map *array_of_map_alloc(union bpf_attr *attr)
774 struct bpf_map *map, *inner_map_meta;
776 inner_map_meta = bpf_map_meta_alloc(attr->inner_map_fd);
777 if (IS_ERR(inner_map_meta))
778 return inner_map_meta;
780 map = array_map_alloc(attr);
782 bpf_map_meta_free(inner_map_meta);
786 map->inner_map_meta = inner_map_meta;
791 static void array_of_map_free(struct bpf_map *map)
793 /* map->inner_map_meta is only accessed by syscall which
794 * is protected by fdget/fdput.
796 bpf_map_meta_free(map->inner_map_meta);
797 bpf_fd_array_map_clear(map);
798 fd_array_map_free(map);
801 static void *array_of_map_lookup_elem(struct bpf_map *map, void *key)
803 struct bpf_map **inner_map = array_map_lookup_elem(map, key);
808 return READ_ONCE(*inner_map);
811 static u32 array_of_map_gen_lookup(struct bpf_map *map,
812 struct bpf_insn *insn_buf)
814 struct bpf_array *array = container_of(map, struct bpf_array, map);
815 u32 elem_size = round_up(map->value_size, 8);
816 struct bpf_insn *insn = insn_buf;
817 const int ret = BPF_REG_0;
818 const int map_ptr = BPF_REG_1;
819 const int index = BPF_REG_2;
821 *insn++ = BPF_ALU64_IMM(BPF_ADD, map_ptr, offsetof(struct bpf_array, value));
822 *insn++ = BPF_LDX_MEM(BPF_W, ret, index, 0);
823 if (map->unpriv_array) {
824 *insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 6);
825 *insn++ = BPF_ALU32_IMM(BPF_AND, ret, array->index_mask);
827 *insn++ = BPF_JMP_IMM(BPF_JGE, ret, map->max_entries, 5);
829 if (is_power_of_2(elem_size))
830 *insn++ = BPF_ALU64_IMM(BPF_LSH, ret, ilog2(elem_size));
832 *insn++ = BPF_ALU64_IMM(BPF_MUL, ret, elem_size);
833 *insn++ = BPF_ALU64_REG(BPF_ADD, ret, map_ptr);
834 *insn++ = BPF_LDX_MEM(BPF_DW, ret, ret, 0);
835 *insn++ = BPF_JMP_IMM(BPF_JEQ, ret, 0, 1);
836 *insn++ = BPF_JMP_IMM(BPF_JA, 0, 0, 1);
837 *insn++ = BPF_MOV64_IMM(ret, 0);
839 return insn - insn_buf;
842 const struct bpf_map_ops array_of_maps_map_ops = {
843 .map_alloc_check = fd_array_map_alloc_check,
844 .map_alloc = array_of_map_alloc,
845 .map_free = array_of_map_free,
846 .map_get_next_key = array_map_get_next_key,
847 .map_lookup_elem = array_of_map_lookup_elem,
848 .map_delete_elem = fd_array_map_delete_elem,
849 .map_fd_get_ptr = bpf_map_fd_get_ptr,
850 .map_fd_put_ptr = bpf_map_fd_put_ptr,
851 .map_fd_sys_lookup_elem = bpf_map_fd_sys_lookup_elem,
852 .map_gen_lookup = array_of_map_gen_lookup,
853 .map_check_btf = map_check_no_btf,