1 /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3 * This program is free software; you can redistribute it and/or
4 * modify it under the terms of version 2 of the GNU General Public
5 * License as published by the Free Software Foundation.
7 * This program is distributed in the hope that it will be useful, but
8 * WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
10 * General Public License for more details.
12 #include <linux/bpf.h>
13 #include <linux/bpf_trace.h>
14 #include <linux/bpf_lirc.h>
15 #include <linux/btf.h>
16 #include <linux/syscalls.h>
17 #include <linux/slab.h>
18 #include <linux/sched/signal.h>
19 #include <linux/vmalloc.h>
20 #include <linux/mmzone.h>
21 #include <linux/anon_inodes.h>
22 #include <linux/fdtable.h>
23 #include <linux/file.h>
25 #include <linux/license.h>
26 #include <linux/filter.h>
27 #include <linux/version.h>
28 #include <linux/kernel.h>
29 #include <linux/idr.h>
30 #include <linux/cred.h>
31 #include <linux/timekeeping.h>
32 #include <linux/ctype.h>
33 #include <linux/nospec.h>
35 #define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \
36 (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
37 (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
38 (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
39 #define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
40 #define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_HASH(map))
42 #define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
44 DEFINE_PER_CPU(int, bpf_prog_active);
45 static DEFINE_IDR(prog_idr);
46 static DEFINE_SPINLOCK(prog_idr_lock);
47 static DEFINE_IDR(map_idr);
48 static DEFINE_SPINLOCK(map_idr_lock);
50 int sysctl_unprivileged_bpf_disabled __read_mostly;
52 static const struct bpf_map_ops * const bpf_map_types[] = {
53 #define BPF_PROG_TYPE(_id, _ops)
54 #define BPF_MAP_TYPE(_id, _ops) \
56 #include <linux/bpf_types.h>
62 * If we're handed a bigger struct than we know of, ensure all the unknown bits
63 * are 0 - i.e. new user-space does not rely on any kernel feature extensions
64 * we don't know about yet.
66 * There is a ToCToU between this function call and the following
67 * copy_from_user() call. However, this is not a concern since this function is
68 * meant to be a future-proofing of bits.
70 int bpf_check_uarg_tail_zero(void __user *uaddr,
74 unsigned char __user *addr;
75 unsigned char __user *end;
79 if (unlikely(actual_size > PAGE_SIZE)) /* silly large */
82 if (unlikely(!access_ok(uaddr, actual_size)))
85 if (actual_size <= expected_size)
88 addr = uaddr + expected_size;
89 end = uaddr + actual_size;
91 for (; addr < end; addr++) {
92 err = get_user(val, addr);
102 const struct bpf_map_ops bpf_map_offload_ops = {
103 .map_alloc = bpf_map_offload_map_alloc,
104 .map_free = bpf_map_offload_map_free,
105 .map_check_btf = map_check_no_btf,
108 static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
110 const struct bpf_map_ops *ops;
111 u32 type = attr->map_type;
115 if (type >= ARRAY_SIZE(bpf_map_types))
116 return ERR_PTR(-EINVAL);
117 type = array_index_nospec(type, ARRAY_SIZE(bpf_map_types));
118 ops = bpf_map_types[type];
120 return ERR_PTR(-EINVAL);
122 if (ops->map_alloc_check) {
123 err = ops->map_alloc_check(attr);
127 if (attr->map_ifindex)
128 ops = &bpf_map_offload_ops;
129 map = ops->map_alloc(attr);
133 map->map_type = type;
137 void *bpf_map_area_alloc(size_t size, int numa_node)
139 /* We definitely need __GFP_NORETRY, so OOM killer doesn't
140 * trigger under memory pressure as we really just want to
143 const gfp_t flags = __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO;
146 if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
147 area = kmalloc_node(size, GFP_USER | flags, numa_node);
152 return __vmalloc_node_flags_caller(size, numa_node, GFP_KERNEL | flags,
153 __builtin_return_address(0));
156 void bpf_map_area_free(void *area)
161 void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
163 map->map_type = attr->map_type;
164 map->key_size = attr->key_size;
165 map->value_size = attr->value_size;
166 map->max_entries = attr->max_entries;
167 map->map_flags = attr->map_flags;
168 map->numa_node = bpf_map_attr_numa_node(attr);
171 int bpf_map_precharge_memlock(u32 pages)
173 struct user_struct *user = get_current_user();
174 unsigned long memlock_limit, cur;
176 memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
177 cur = atomic_long_read(&user->locked_vm);
179 if (cur + pages > memlock_limit)
184 static int bpf_charge_memlock(struct user_struct *user, u32 pages)
186 unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
188 if (atomic_long_add_return(pages, &user->locked_vm) > memlock_limit) {
189 atomic_long_sub(pages, &user->locked_vm);
195 static void bpf_uncharge_memlock(struct user_struct *user, u32 pages)
197 atomic_long_sub(pages, &user->locked_vm);
200 static int bpf_map_init_memlock(struct bpf_map *map)
202 struct user_struct *user = get_current_user();
205 ret = bpf_charge_memlock(user, map->pages);
214 static void bpf_map_release_memlock(struct bpf_map *map)
216 struct user_struct *user = map->user;
217 bpf_uncharge_memlock(user, map->pages);
221 int bpf_map_charge_memlock(struct bpf_map *map, u32 pages)
225 ret = bpf_charge_memlock(map->user, pages);
232 void bpf_map_uncharge_memlock(struct bpf_map *map, u32 pages)
234 bpf_uncharge_memlock(map->user, pages);
238 static int bpf_map_alloc_id(struct bpf_map *map)
242 idr_preload(GFP_KERNEL);
243 spin_lock_bh(&map_idr_lock);
244 id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
247 spin_unlock_bh(&map_idr_lock);
250 if (WARN_ON_ONCE(!id))
253 return id > 0 ? 0 : id;
256 void bpf_map_free_id(struct bpf_map *map, bool do_idr_lock)
260 /* Offloaded maps are removed from the IDR store when their device
261 * disappears - even if someone holds an fd to them they are unusable,
262 * the memory is gone, all ops will fail; they are simply waiting for
263 * refcnt to drop to be freed.
269 spin_lock_irqsave(&map_idr_lock, flags);
271 __acquire(&map_idr_lock);
273 idr_remove(&map_idr, map->id);
277 spin_unlock_irqrestore(&map_idr_lock, flags);
279 __release(&map_idr_lock);
282 /* called from workqueue */
283 static void bpf_map_free_deferred(struct work_struct *work)
285 struct bpf_map *map = container_of(work, struct bpf_map, work);
287 bpf_map_release_memlock(map);
288 security_bpf_map_free(map);
289 /* implementation dependent freeing */
290 map->ops->map_free(map);
293 static void bpf_map_put_uref(struct bpf_map *map)
295 if (atomic_dec_and_test(&map->usercnt)) {
296 if (map->ops->map_release_uref)
297 map->ops->map_release_uref(map);
301 /* decrement map refcnt and schedule it for freeing via workqueue
302 * (unrelying map implementation ops->map_free() might sleep)
304 static void __bpf_map_put(struct bpf_map *map, bool do_idr_lock)
306 if (atomic_dec_and_test(&map->refcnt)) {
307 /* bpf_map_free_id() must be called first */
308 bpf_map_free_id(map, do_idr_lock);
310 INIT_WORK(&map->work, bpf_map_free_deferred);
311 schedule_work(&map->work);
315 void bpf_map_put(struct bpf_map *map)
317 __bpf_map_put(map, true);
319 EXPORT_SYMBOL_GPL(bpf_map_put);
321 void bpf_map_put_with_uref(struct bpf_map *map)
323 bpf_map_put_uref(map);
327 static int bpf_map_release(struct inode *inode, struct file *filp)
329 struct bpf_map *map = filp->private_data;
331 if (map->ops->map_release)
332 map->ops->map_release(map, filp);
334 bpf_map_put_with_uref(map);
338 #ifdef CONFIG_PROC_FS
339 static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
341 const struct bpf_map *map = filp->private_data;
342 const struct bpf_array *array;
343 u32 owner_prog_type = 0;
346 if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
347 array = container_of(map, struct bpf_array, map);
348 owner_prog_type = array->owner_prog_type;
349 owner_jited = array->owner_jited;
365 map->pages * 1ULL << PAGE_SHIFT,
368 if (owner_prog_type) {
369 seq_printf(m, "owner_prog_type:\t%u\n",
371 seq_printf(m, "owner_jited:\t%u\n",
377 static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
380 /* We need this handler such that alloc_file() enables
381 * f_mode with FMODE_CAN_READ.
386 static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
387 size_t siz, loff_t *ppos)
389 /* We need this handler such that alloc_file() enables
390 * f_mode with FMODE_CAN_WRITE.
395 const struct file_operations bpf_map_fops = {
396 #ifdef CONFIG_PROC_FS
397 .show_fdinfo = bpf_map_show_fdinfo,
399 .release = bpf_map_release,
400 .read = bpf_dummy_read,
401 .write = bpf_dummy_write,
404 int bpf_map_new_fd(struct bpf_map *map, int flags)
408 ret = security_bpf_map(map, OPEN_FMODE(flags));
412 return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
416 int bpf_get_file_flag(int flags)
418 if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
420 if (flags & BPF_F_RDONLY)
422 if (flags & BPF_F_WRONLY)
427 /* helper macro to check that unused fields 'union bpf_attr' are zero */
428 #define CHECK_ATTR(CMD) \
429 memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
430 sizeof(attr->CMD##_LAST_FIELD), 0, \
432 offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
433 sizeof(attr->CMD##_LAST_FIELD)) != NULL
435 /* dst and src must have at least BPF_OBJ_NAME_LEN number of bytes.
436 * Return 0 on success and < 0 on error.
438 static int bpf_obj_name_cpy(char *dst, const char *src)
440 const char *end = src + BPF_OBJ_NAME_LEN;
442 memset(dst, 0, BPF_OBJ_NAME_LEN);
444 /* Copy all isalnum() and '_' char */
445 while (src < end && *src) {
446 if (!isalnum(*src) && *src != '_')
451 /* No '\0' found in BPF_OBJ_NAME_LEN number of bytes */
458 int map_check_no_btf(const struct bpf_map *map,
459 const struct btf *btf,
460 const struct btf_type *key_type,
461 const struct btf_type *value_type)
466 static int map_check_btf(const struct bpf_map *map, const struct btf *btf,
467 u32 btf_key_id, u32 btf_value_id)
469 const struct btf_type *key_type, *value_type;
470 u32 key_size, value_size;
473 key_type = btf_type_id_size(btf, &btf_key_id, &key_size);
474 if (!key_type || key_size != map->key_size)
477 value_type = btf_type_id_size(btf, &btf_value_id, &value_size);
478 if (!value_type || value_size != map->value_size)
481 if (map->ops->map_check_btf)
482 ret = map->ops->map_check_btf(map, btf, key_type, value_type);
487 #define BPF_MAP_CREATE_LAST_FIELD btf_value_type_id
488 /* called via syscall */
489 static int map_create(union bpf_attr *attr)
491 int numa_node = bpf_map_attr_numa_node(attr);
496 err = CHECK_ATTR(BPF_MAP_CREATE);
500 f_flags = bpf_get_file_flag(attr->map_flags);
504 if (numa_node != NUMA_NO_NODE &&
505 ((unsigned int)numa_node >= nr_node_ids ||
506 !node_online(numa_node)))
509 /* find map type and init map: hashtable vs rbtree vs bloom vs ... */
510 map = find_and_alloc_map(attr);
514 err = bpf_obj_name_cpy(map->name, attr->map_name);
516 goto free_map_nouncharge;
518 atomic_set(&map->refcnt, 1);
519 atomic_set(&map->usercnt, 1);
521 if (attr->btf_key_type_id || attr->btf_value_type_id) {
524 if (!attr->btf_key_type_id || !attr->btf_value_type_id) {
526 goto free_map_nouncharge;
529 btf = btf_get_by_fd(attr->btf_fd);
532 goto free_map_nouncharge;
535 err = map_check_btf(map, btf, attr->btf_key_type_id,
536 attr->btf_value_type_id);
539 goto free_map_nouncharge;
543 map->btf_key_type_id = attr->btf_key_type_id;
544 map->btf_value_type_id = attr->btf_value_type_id;
547 err = security_bpf_map_alloc(map);
549 goto free_map_nouncharge;
551 err = bpf_map_init_memlock(map);
555 err = bpf_map_alloc_id(map);
559 err = bpf_map_new_fd(map, f_flags);
561 /* failed to allocate fd.
562 * bpf_map_put() is needed because the above
563 * bpf_map_alloc_id() has published the map
564 * to the userspace and the userspace may
565 * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
574 bpf_map_release_memlock(map);
576 security_bpf_map_free(map);
579 map->ops->map_free(map);
583 /* if error is returned, fd is released.
584 * On success caller should complete fd access with matching fdput()
586 struct bpf_map *__bpf_map_get(struct fd f)
589 return ERR_PTR(-EBADF);
590 if (f.file->f_op != &bpf_map_fops) {
592 return ERR_PTR(-EINVAL);
595 return f.file->private_data;
598 /* prog's and map's refcnt limit */
599 #define BPF_MAX_REFCNT 32768
601 struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
603 if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
604 atomic_dec(&map->refcnt);
605 return ERR_PTR(-EBUSY);
608 atomic_inc(&map->usercnt);
611 EXPORT_SYMBOL_GPL(bpf_map_inc);
613 struct bpf_map *bpf_map_get_with_uref(u32 ufd)
615 struct fd f = fdget(ufd);
618 map = __bpf_map_get(f);
622 map = bpf_map_inc(map, true);
628 /* map_idr_lock should have been held */
629 static struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map,
634 refold = atomic_fetch_add_unless(&map->refcnt, 1, 0);
636 if (refold >= BPF_MAX_REFCNT) {
637 __bpf_map_put(map, false);
638 return ERR_PTR(-EBUSY);
642 return ERR_PTR(-ENOENT);
645 atomic_inc(&map->usercnt);
650 int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
655 static void *__bpf_copy_key(void __user *ukey, u64 key_size)
658 return memdup_user(ukey, key_size);
661 return ERR_PTR(-EINVAL);
666 /* last field in 'union bpf_attr' used by this command */
667 #define BPF_MAP_LOOKUP_ELEM_LAST_FIELD value
669 static int map_lookup_elem(union bpf_attr *attr)
671 void __user *ukey = u64_to_user_ptr(attr->key);
672 void __user *uvalue = u64_to_user_ptr(attr->value);
673 int ufd = attr->map_fd;
675 void *key, *value, *ptr;
680 if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
684 map = __bpf_map_get(f);
688 if (!(f.file->f_mode & FMODE_CAN_READ)) {
693 key = __bpf_copy_key(ukey, map->key_size);
699 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
700 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
701 map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
702 map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
703 value_size = round_up(map->value_size, 8) * num_possible_cpus();
704 else if (IS_FD_MAP(map))
705 value_size = sizeof(u32);
707 value_size = map->value_size;
710 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
714 if (bpf_map_is_dev_bound(map)) {
715 err = bpf_map_offload_lookup_elem(map, key, value);
720 this_cpu_inc(bpf_prog_active);
721 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
722 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
723 err = bpf_percpu_hash_copy(map, key, value);
724 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
725 err = bpf_percpu_array_copy(map, key, value);
726 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
727 err = bpf_percpu_cgroup_storage_copy(map, key, value);
728 } else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
729 err = bpf_stackmap_copy(map, key, value);
730 } else if (IS_FD_ARRAY(map)) {
731 err = bpf_fd_array_map_lookup_elem(map, key, value);
732 } else if (IS_FD_HASH(map)) {
733 err = bpf_fd_htab_map_lookup_elem(map, key, value);
734 } else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
735 err = bpf_fd_reuseport_array_lookup_elem(map, key, value);
736 } else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
737 map->map_type == BPF_MAP_TYPE_STACK) {
738 err = map->ops->map_peek_elem(map, value);
741 ptr = map->ops->map_lookup_elem(map, key);
748 memcpy(value, ptr, value_size);
752 this_cpu_dec(bpf_prog_active);
760 if (copy_to_user(uvalue, value, value_size) != 0)
774 static void maybe_wait_bpf_programs(struct bpf_map *map)
776 /* Wait for any running BPF programs to complete so that
777 * userspace, when we return to it, knows that all programs
778 * that could be running use the new map value.
780 if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS ||
781 map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
785 #define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
787 static int map_update_elem(union bpf_attr *attr)
789 void __user *ukey = u64_to_user_ptr(attr->key);
790 void __user *uvalue = u64_to_user_ptr(attr->value);
791 int ufd = attr->map_fd;
798 if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
802 map = __bpf_map_get(f);
806 if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
811 key = __bpf_copy_key(ukey, map->key_size);
817 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
818 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
819 map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
820 map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
821 value_size = round_up(map->value_size, 8) * num_possible_cpus();
823 value_size = map->value_size;
826 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
831 if (copy_from_user(value, uvalue, value_size) != 0)
834 /* Need to create a kthread, thus must support schedule */
835 if (bpf_map_is_dev_bound(map)) {
836 err = bpf_map_offload_update_elem(map, key, value, attr->flags);
838 } else if (map->map_type == BPF_MAP_TYPE_CPUMAP ||
839 map->map_type == BPF_MAP_TYPE_SOCKHASH ||
840 map->map_type == BPF_MAP_TYPE_SOCKMAP) {
841 err = map->ops->map_update_elem(map, key, value, attr->flags);
845 /* must increment bpf_prog_active to avoid kprobe+bpf triggering from
846 * inside bpf map update or delete otherwise deadlocks are possible
849 __this_cpu_inc(bpf_prog_active);
850 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
851 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
852 err = bpf_percpu_hash_update(map, key, value, attr->flags);
853 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
854 err = bpf_percpu_array_update(map, key, value, attr->flags);
855 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
856 err = bpf_percpu_cgroup_storage_update(map, key, value,
858 } else if (IS_FD_ARRAY(map)) {
860 err = bpf_fd_array_map_update_elem(map, f.file, key, value,
863 } else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
865 err = bpf_fd_htab_map_update_elem(map, f.file, key, value,
868 } else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
869 /* rcu_read_lock() is not needed */
870 err = bpf_fd_reuseport_array_update_elem(map, key, value,
872 } else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
873 map->map_type == BPF_MAP_TYPE_STACK) {
874 err = map->ops->map_push_elem(map, value, attr->flags);
877 err = map->ops->map_update_elem(map, key, value, attr->flags);
880 __this_cpu_dec(bpf_prog_active);
882 maybe_wait_bpf_programs(map);
893 #define BPF_MAP_DELETE_ELEM_LAST_FIELD key
895 static int map_delete_elem(union bpf_attr *attr)
897 void __user *ukey = u64_to_user_ptr(attr->key);
898 int ufd = attr->map_fd;
904 if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
908 map = __bpf_map_get(f);
912 if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
917 key = __bpf_copy_key(ukey, map->key_size);
923 if (bpf_map_is_dev_bound(map)) {
924 err = bpf_map_offload_delete_elem(map, key);
929 __this_cpu_inc(bpf_prog_active);
931 err = map->ops->map_delete_elem(map, key);
933 __this_cpu_dec(bpf_prog_active);
935 maybe_wait_bpf_programs(map);
943 /* last field in 'union bpf_attr' used by this command */
944 #define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
946 static int map_get_next_key(union bpf_attr *attr)
948 void __user *ukey = u64_to_user_ptr(attr->key);
949 void __user *unext_key = u64_to_user_ptr(attr->next_key);
950 int ufd = attr->map_fd;
952 void *key, *next_key;
956 if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
960 map = __bpf_map_get(f);
964 if (!(f.file->f_mode & FMODE_CAN_READ)) {
970 key = __bpf_copy_key(ukey, map->key_size);
980 next_key = kmalloc(map->key_size, GFP_USER);
984 if (bpf_map_is_dev_bound(map)) {
985 err = bpf_map_offload_get_next_key(map, key, next_key);
990 err = map->ops->map_get_next_key(map, key, next_key);
997 if (copy_to_user(unext_key, next_key, map->key_size) != 0)
1011 #define BPF_MAP_LOOKUP_AND_DELETE_ELEM_LAST_FIELD value
1013 static int map_lookup_and_delete_elem(union bpf_attr *attr)
1015 void __user *ukey = u64_to_user_ptr(attr->key);
1016 void __user *uvalue = u64_to_user_ptr(attr->value);
1017 int ufd = attr->map_fd;
1018 struct bpf_map *map;
1024 if (CHECK_ATTR(BPF_MAP_LOOKUP_AND_DELETE_ELEM))
1028 map = __bpf_map_get(f);
1030 return PTR_ERR(map);
1032 if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
1037 key = __bpf_copy_key(ukey, map->key_size);
1043 value_size = map->value_size;
1046 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
1050 if (map->map_type == BPF_MAP_TYPE_QUEUE ||
1051 map->map_type == BPF_MAP_TYPE_STACK) {
1052 err = map->ops->map_pop_elem(map, value);
1060 if (copy_to_user(uvalue, value, value_size) != 0)
1074 static const struct bpf_prog_ops * const bpf_prog_types[] = {
1075 #define BPF_PROG_TYPE(_id, _name) \
1076 [_id] = & _name ## _prog_ops,
1077 #define BPF_MAP_TYPE(_id, _ops)
1078 #include <linux/bpf_types.h>
1079 #undef BPF_PROG_TYPE
1083 static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
1085 const struct bpf_prog_ops *ops;
1087 if (type >= ARRAY_SIZE(bpf_prog_types))
1089 type = array_index_nospec(type, ARRAY_SIZE(bpf_prog_types));
1090 ops = bpf_prog_types[type];
1094 if (!bpf_prog_is_dev_bound(prog->aux))
1095 prog->aux->ops = ops;
1097 prog->aux->ops = &bpf_offload_prog_ops;
1102 /* drop refcnt on maps used by eBPF program and free auxilary data */
1103 static void free_used_maps(struct bpf_prog_aux *aux)
1105 enum bpf_cgroup_storage_type stype;
1108 for_each_cgroup_storage_type(stype) {
1109 if (!aux->cgroup_storage[stype])
1111 bpf_cgroup_storage_release(aux->prog,
1112 aux->cgroup_storage[stype]);
1115 for (i = 0; i < aux->used_map_cnt; i++)
1116 bpf_map_put(aux->used_maps[i]);
1118 kfree(aux->used_maps);
1121 int __bpf_prog_charge(struct user_struct *user, u32 pages)
1123 unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
1124 unsigned long user_bufs;
1127 user_bufs = atomic_long_add_return(pages, &user->locked_vm);
1128 if (user_bufs > memlock_limit) {
1129 atomic_long_sub(pages, &user->locked_vm);
1137 void __bpf_prog_uncharge(struct user_struct *user, u32 pages)
1140 atomic_long_sub(pages, &user->locked_vm);
1143 static int bpf_prog_charge_memlock(struct bpf_prog *prog)
1145 struct user_struct *user = get_current_user();
1148 ret = __bpf_prog_charge(user, prog->pages);
1154 prog->aux->user = user;
1158 static void bpf_prog_uncharge_memlock(struct bpf_prog *prog)
1160 struct user_struct *user = prog->aux->user;
1162 __bpf_prog_uncharge(user, prog->pages);
1166 static int bpf_prog_alloc_id(struct bpf_prog *prog)
1170 idr_preload(GFP_KERNEL);
1171 spin_lock_bh(&prog_idr_lock);
1172 id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
1175 spin_unlock_bh(&prog_idr_lock);
1178 /* id is in [1, INT_MAX) */
1179 if (WARN_ON_ONCE(!id))
1182 return id > 0 ? 0 : id;
1185 void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
1187 /* cBPF to eBPF migrations are currently not in the idr store.
1188 * Offloaded programs are removed from the store when their device
1189 * disappears - even if someone grabs an fd to them they are unusable,
1190 * simply waiting for refcnt to drop to be freed.
1196 spin_lock_bh(&prog_idr_lock);
1198 __acquire(&prog_idr_lock);
1200 idr_remove(&prog_idr, prog->aux->id);
1204 spin_unlock_bh(&prog_idr_lock);
1206 __release(&prog_idr_lock);
1209 static void __bpf_prog_put_rcu(struct rcu_head *rcu)
1211 struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
1213 free_used_maps(aux);
1214 bpf_prog_uncharge_memlock(aux->prog);
1215 security_bpf_prog_free(aux);
1216 bpf_prog_free(aux->prog);
1219 static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
1221 if (atomic_dec_and_test(&prog->aux->refcnt)) {
1222 /* bpf_prog_free_id() must be called first */
1223 bpf_prog_free_id(prog, do_idr_lock);
1224 bpf_prog_kallsyms_del_all(prog);
1225 btf_put(prog->aux->btf);
1226 kvfree(prog->aux->func_info);
1227 bpf_prog_free_linfo(prog);
1229 call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
1233 void bpf_prog_put(struct bpf_prog *prog)
1235 __bpf_prog_put(prog, true);
1237 EXPORT_SYMBOL_GPL(bpf_prog_put);
1239 static int bpf_prog_release(struct inode *inode, struct file *filp)
1241 struct bpf_prog *prog = filp->private_data;
1247 #ifdef CONFIG_PROC_FS
1248 static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
1250 const struct bpf_prog *prog = filp->private_data;
1251 char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
1253 bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
1263 prog->pages * 1ULL << PAGE_SHIFT,
1268 const struct file_operations bpf_prog_fops = {
1269 #ifdef CONFIG_PROC_FS
1270 .show_fdinfo = bpf_prog_show_fdinfo,
1272 .release = bpf_prog_release,
1273 .read = bpf_dummy_read,
1274 .write = bpf_dummy_write,
1277 int bpf_prog_new_fd(struct bpf_prog *prog)
1281 ret = security_bpf_prog(prog);
1285 return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
1286 O_RDWR | O_CLOEXEC);
1289 static struct bpf_prog *____bpf_prog_get(struct fd f)
1292 return ERR_PTR(-EBADF);
1293 if (f.file->f_op != &bpf_prog_fops) {
1295 return ERR_PTR(-EINVAL);
1298 return f.file->private_data;
1301 struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
1303 if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
1304 atomic_sub(i, &prog->aux->refcnt);
1305 return ERR_PTR(-EBUSY);
1309 EXPORT_SYMBOL_GPL(bpf_prog_add);
1311 void bpf_prog_sub(struct bpf_prog *prog, int i)
1313 /* Only to be used for undoing previous bpf_prog_add() in some
1314 * error path. We still know that another entity in our call
1315 * path holds a reference to the program, thus atomic_sub() can
1316 * be safely used in such cases!
1318 WARN_ON(atomic_sub_return(i, &prog->aux->refcnt) == 0);
1320 EXPORT_SYMBOL_GPL(bpf_prog_sub);
1322 struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
1324 return bpf_prog_add(prog, 1);
1326 EXPORT_SYMBOL_GPL(bpf_prog_inc);
1328 /* prog_idr_lock should have been held */
1329 struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
1333 refold = atomic_fetch_add_unless(&prog->aux->refcnt, 1, 0);
1335 if (refold >= BPF_MAX_REFCNT) {
1336 __bpf_prog_put(prog, false);
1337 return ERR_PTR(-EBUSY);
1341 return ERR_PTR(-ENOENT);
1345 EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
1347 bool bpf_prog_get_ok(struct bpf_prog *prog,
1348 enum bpf_prog_type *attach_type, bool attach_drv)
1350 /* not an attachment, just a refcount inc, always allow */
1354 if (prog->type != *attach_type)
1356 if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
1362 static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
1365 struct fd f = fdget(ufd);
1366 struct bpf_prog *prog;
1368 prog = ____bpf_prog_get(f);
1371 if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
1372 prog = ERR_PTR(-EINVAL);
1376 prog = bpf_prog_inc(prog);
1382 struct bpf_prog *bpf_prog_get(u32 ufd)
1384 return __bpf_prog_get(ufd, NULL, false);
1387 struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
1390 return __bpf_prog_get(ufd, &type, attach_drv);
1392 EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
1394 /* Initially all BPF programs could be loaded w/o specifying
1395 * expected_attach_type. Later for some of them specifying expected_attach_type
1396 * at load time became required so that program could be validated properly.
1397 * Programs of types that are allowed to be loaded both w/ and w/o (for
1398 * backward compatibility) expected_attach_type, should have the default attach
1399 * type assigned to expected_attach_type for the latter case, so that it can be
1400 * validated later at attach time.
1402 * bpf_prog_load_fixup_attach_type() sets expected_attach_type in @attr if
1403 * prog type requires it but has some attach types that have to be backward
1406 static void bpf_prog_load_fixup_attach_type(union bpf_attr *attr)
1408 switch (attr->prog_type) {
1409 case BPF_PROG_TYPE_CGROUP_SOCK:
1410 /* Unfortunately BPF_ATTACH_TYPE_UNSPEC enumeration doesn't
1411 * exist so checking for non-zero is the way to go here.
1413 if (!attr->expected_attach_type)
1414 attr->expected_attach_type =
1415 BPF_CGROUP_INET_SOCK_CREATE;
1421 bpf_prog_load_check_attach_type(enum bpf_prog_type prog_type,
1422 enum bpf_attach_type expected_attach_type)
1424 switch (prog_type) {
1425 case BPF_PROG_TYPE_CGROUP_SOCK:
1426 switch (expected_attach_type) {
1427 case BPF_CGROUP_INET_SOCK_CREATE:
1428 case BPF_CGROUP_INET4_POST_BIND:
1429 case BPF_CGROUP_INET6_POST_BIND:
1434 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
1435 switch (expected_attach_type) {
1436 case BPF_CGROUP_INET4_BIND:
1437 case BPF_CGROUP_INET6_BIND:
1438 case BPF_CGROUP_INET4_CONNECT:
1439 case BPF_CGROUP_INET6_CONNECT:
1440 case BPF_CGROUP_UDP4_SENDMSG:
1441 case BPF_CGROUP_UDP6_SENDMSG:
1451 /* last field in 'union bpf_attr' used by this command */
1452 #define BPF_PROG_LOAD_LAST_FIELD line_info_cnt
1454 static int bpf_prog_load(union bpf_attr *attr, union bpf_attr __user *uattr)
1456 enum bpf_prog_type type = attr->prog_type;
1457 struct bpf_prog *prog;
1462 if (CHECK_ATTR(BPF_PROG_LOAD))
1465 if (attr->prog_flags & ~(BPF_F_STRICT_ALIGNMENT | BPF_F_ANY_ALIGNMENT))
1468 if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) &&
1469 (attr->prog_flags & BPF_F_ANY_ALIGNMENT) &&
1470 !capable(CAP_SYS_ADMIN))
1473 /* copy eBPF program license from user space */
1474 if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
1475 sizeof(license) - 1) < 0)
1477 license[sizeof(license) - 1] = 0;
1479 /* eBPF programs must be GPL compatible to use GPL-ed functions */
1480 is_gpl = license_is_gpl_compatible(license);
1482 if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
1484 if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
1485 type != BPF_PROG_TYPE_CGROUP_SKB &&
1486 !capable(CAP_SYS_ADMIN))
1489 bpf_prog_load_fixup_attach_type(attr);
1490 if (bpf_prog_load_check_attach_type(type, attr->expected_attach_type))
1493 /* plain bpf_prog allocation */
1494 prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
1498 prog->expected_attach_type = attr->expected_attach_type;
1500 prog->aux->offload_requested = !!attr->prog_ifindex;
1502 err = security_bpf_prog_alloc(prog->aux);
1504 goto free_prog_nouncharge;
1506 err = bpf_prog_charge_memlock(prog);
1510 prog->len = attr->insn_cnt;
1513 if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
1514 bpf_prog_insn_size(prog)) != 0)
1517 prog->orig_prog = NULL;
1520 atomic_set(&prog->aux->refcnt, 1);
1521 prog->gpl_compatible = is_gpl ? 1 : 0;
1523 if (bpf_prog_is_dev_bound(prog->aux)) {
1524 err = bpf_prog_offload_init(prog, attr);
1529 /* find program type: socket_filter vs tracing_filter */
1530 err = find_prog_type(type, prog);
1534 prog->aux->load_time = ktime_get_boot_ns();
1535 err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
1539 /* run eBPF verifier */
1540 err = bpf_check(&prog, attr, uattr);
1542 goto free_used_maps;
1544 prog = bpf_prog_select_runtime(prog, &err);
1546 goto free_used_maps;
1548 err = bpf_prog_alloc_id(prog);
1550 goto free_used_maps;
1552 err = bpf_prog_new_fd(prog);
1554 /* failed to allocate fd.
1555 * bpf_prog_put() is needed because the above
1556 * bpf_prog_alloc_id() has published the prog
1557 * to the userspace and the userspace may
1558 * have refcnt-ed it through BPF_PROG_GET_FD_BY_ID.
1564 bpf_prog_kallsyms_add(prog);
1568 bpf_prog_free_linfo(prog);
1569 kvfree(prog->aux->func_info);
1570 btf_put(prog->aux->btf);
1571 bpf_prog_kallsyms_del_subprogs(prog);
1572 free_used_maps(prog->aux);
1574 bpf_prog_uncharge_memlock(prog);
1576 security_bpf_prog_free(prog->aux);
1577 free_prog_nouncharge:
1578 bpf_prog_free(prog);
1582 #define BPF_OBJ_LAST_FIELD file_flags
1584 static int bpf_obj_pin(const union bpf_attr *attr)
1586 if (CHECK_ATTR(BPF_OBJ) || attr->file_flags != 0)
1589 return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
1592 static int bpf_obj_get(const union bpf_attr *attr)
1594 if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
1595 attr->file_flags & ~BPF_OBJ_FLAG_MASK)
1598 return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
1602 struct bpf_raw_tracepoint {
1603 struct bpf_raw_event_map *btp;
1604 struct bpf_prog *prog;
1607 static int bpf_raw_tracepoint_release(struct inode *inode, struct file *filp)
1609 struct bpf_raw_tracepoint *raw_tp = filp->private_data;
1612 bpf_probe_unregister(raw_tp->btp, raw_tp->prog);
1613 bpf_prog_put(raw_tp->prog);
1615 bpf_put_raw_tracepoint(raw_tp->btp);
1620 static const struct file_operations bpf_raw_tp_fops = {
1621 .release = bpf_raw_tracepoint_release,
1622 .read = bpf_dummy_read,
1623 .write = bpf_dummy_write,
1626 #define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd
1628 static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
1630 struct bpf_raw_tracepoint *raw_tp;
1631 struct bpf_raw_event_map *btp;
1632 struct bpf_prog *prog;
1636 if (strncpy_from_user(tp_name, u64_to_user_ptr(attr->raw_tracepoint.name),
1637 sizeof(tp_name) - 1) < 0)
1639 tp_name[sizeof(tp_name) - 1] = 0;
1641 btp = bpf_get_raw_tracepoint(tp_name);
1645 raw_tp = kzalloc(sizeof(*raw_tp), GFP_USER);
1652 prog = bpf_prog_get_type(attr->raw_tracepoint.prog_fd,
1653 BPF_PROG_TYPE_RAW_TRACEPOINT);
1655 err = PTR_ERR(prog);
1659 err = bpf_probe_register(raw_tp->btp, prog);
1663 raw_tp->prog = prog;
1664 tp_fd = anon_inode_getfd("bpf-raw-tracepoint", &bpf_raw_tp_fops, raw_tp,
1667 bpf_probe_unregister(raw_tp->btp, prog);
1678 bpf_put_raw_tracepoint(btp);
1682 static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
1683 enum bpf_attach_type attach_type)
1685 switch (prog->type) {
1686 case BPF_PROG_TYPE_CGROUP_SOCK:
1687 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
1688 return attach_type == prog->expected_attach_type ? 0 : -EINVAL;
1694 #define BPF_PROG_ATTACH_LAST_FIELD attach_flags
1696 #define BPF_F_ATTACH_MASK \
1697 (BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)
1699 static int bpf_prog_attach(const union bpf_attr *attr)
1701 enum bpf_prog_type ptype;
1702 struct bpf_prog *prog;
1705 if (!capable(CAP_NET_ADMIN))
1708 if (CHECK_ATTR(BPF_PROG_ATTACH))
1711 if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
1714 switch (attr->attach_type) {
1715 case BPF_CGROUP_INET_INGRESS:
1716 case BPF_CGROUP_INET_EGRESS:
1717 ptype = BPF_PROG_TYPE_CGROUP_SKB;
1719 case BPF_CGROUP_INET_SOCK_CREATE:
1720 case BPF_CGROUP_INET4_POST_BIND:
1721 case BPF_CGROUP_INET6_POST_BIND:
1722 ptype = BPF_PROG_TYPE_CGROUP_SOCK;
1724 case BPF_CGROUP_INET4_BIND:
1725 case BPF_CGROUP_INET6_BIND:
1726 case BPF_CGROUP_INET4_CONNECT:
1727 case BPF_CGROUP_INET6_CONNECT:
1728 case BPF_CGROUP_UDP4_SENDMSG:
1729 case BPF_CGROUP_UDP6_SENDMSG:
1730 ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
1732 case BPF_CGROUP_SOCK_OPS:
1733 ptype = BPF_PROG_TYPE_SOCK_OPS;
1735 case BPF_CGROUP_DEVICE:
1736 ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
1738 case BPF_SK_MSG_VERDICT:
1739 ptype = BPF_PROG_TYPE_SK_MSG;
1741 case BPF_SK_SKB_STREAM_PARSER:
1742 case BPF_SK_SKB_STREAM_VERDICT:
1743 ptype = BPF_PROG_TYPE_SK_SKB;
1745 case BPF_LIRC_MODE2:
1746 ptype = BPF_PROG_TYPE_LIRC_MODE2;
1748 case BPF_FLOW_DISSECTOR:
1749 ptype = BPF_PROG_TYPE_FLOW_DISSECTOR;
1755 prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
1757 return PTR_ERR(prog);
1759 if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
1765 case BPF_PROG_TYPE_SK_SKB:
1766 case BPF_PROG_TYPE_SK_MSG:
1767 ret = sock_map_get_from_fd(attr, prog);
1769 case BPF_PROG_TYPE_LIRC_MODE2:
1770 ret = lirc_prog_attach(attr, prog);
1772 case BPF_PROG_TYPE_FLOW_DISSECTOR:
1773 ret = skb_flow_dissector_bpf_prog_attach(attr, prog);
1776 ret = cgroup_bpf_prog_attach(attr, ptype, prog);
1784 #define BPF_PROG_DETACH_LAST_FIELD attach_type
1786 static int bpf_prog_detach(const union bpf_attr *attr)
1788 enum bpf_prog_type ptype;
1790 if (!capable(CAP_NET_ADMIN))
1793 if (CHECK_ATTR(BPF_PROG_DETACH))
1796 switch (attr->attach_type) {
1797 case BPF_CGROUP_INET_INGRESS:
1798 case BPF_CGROUP_INET_EGRESS:
1799 ptype = BPF_PROG_TYPE_CGROUP_SKB;
1801 case BPF_CGROUP_INET_SOCK_CREATE:
1802 case BPF_CGROUP_INET4_POST_BIND:
1803 case BPF_CGROUP_INET6_POST_BIND:
1804 ptype = BPF_PROG_TYPE_CGROUP_SOCK;
1806 case BPF_CGROUP_INET4_BIND:
1807 case BPF_CGROUP_INET6_BIND:
1808 case BPF_CGROUP_INET4_CONNECT:
1809 case BPF_CGROUP_INET6_CONNECT:
1810 case BPF_CGROUP_UDP4_SENDMSG:
1811 case BPF_CGROUP_UDP6_SENDMSG:
1812 ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
1814 case BPF_CGROUP_SOCK_OPS:
1815 ptype = BPF_PROG_TYPE_SOCK_OPS;
1817 case BPF_CGROUP_DEVICE:
1818 ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
1820 case BPF_SK_MSG_VERDICT:
1821 return sock_map_get_from_fd(attr, NULL);
1822 case BPF_SK_SKB_STREAM_PARSER:
1823 case BPF_SK_SKB_STREAM_VERDICT:
1824 return sock_map_get_from_fd(attr, NULL);
1825 case BPF_LIRC_MODE2:
1826 return lirc_prog_detach(attr);
1827 case BPF_FLOW_DISSECTOR:
1828 return skb_flow_dissector_bpf_prog_detach(attr);
1833 return cgroup_bpf_prog_detach(attr, ptype);
1836 #define BPF_PROG_QUERY_LAST_FIELD query.prog_cnt
1838 static int bpf_prog_query(const union bpf_attr *attr,
1839 union bpf_attr __user *uattr)
1841 if (!capable(CAP_NET_ADMIN))
1843 if (CHECK_ATTR(BPF_PROG_QUERY))
1845 if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
1848 switch (attr->query.attach_type) {
1849 case BPF_CGROUP_INET_INGRESS:
1850 case BPF_CGROUP_INET_EGRESS:
1851 case BPF_CGROUP_INET_SOCK_CREATE:
1852 case BPF_CGROUP_INET4_BIND:
1853 case BPF_CGROUP_INET6_BIND:
1854 case BPF_CGROUP_INET4_POST_BIND:
1855 case BPF_CGROUP_INET6_POST_BIND:
1856 case BPF_CGROUP_INET4_CONNECT:
1857 case BPF_CGROUP_INET6_CONNECT:
1858 case BPF_CGROUP_UDP4_SENDMSG:
1859 case BPF_CGROUP_UDP6_SENDMSG:
1860 case BPF_CGROUP_SOCK_OPS:
1861 case BPF_CGROUP_DEVICE:
1863 case BPF_LIRC_MODE2:
1864 return lirc_prog_query(attr, uattr);
1869 return cgroup_bpf_prog_query(attr, uattr);
1872 #define BPF_PROG_TEST_RUN_LAST_FIELD test.duration
1874 static int bpf_prog_test_run(const union bpf_attr *attr,
1875 union bpf_attr __user *uattr)
1877 struct bpf_prog *prog;
1878 int ret = -ENOTSUPP;
1880 if (!capable(CAP_SYS_ADMIN))
1882 if (CHECK_ATTR(BPF_PROG_TEST_RUN))
1885 prog = bpf_prog_get(attr->test.prog_fd);
1887 return PTR_ERR(prog);
1889 if (prog->aux->ops->test_run)
1890 ret = prog->aux->ops->test_run(prog, attr, uattr);
1896 #define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
1898 static int bpf_obj_get_next_id(const union bpf_attr *attr,
1899 union bpf_attr __user *uattr,
1903 u32 next_id = attr->start_id;
1906 if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
1909 if (!capable(CAP_SYS_ADMIN))
1914 if (!idr_get_next(idr, &next_id))
1916 spin_unlock_bh(lock);
1919 err = put_user(next_id, &uattr->next_id);
1924 #define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
1926 static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
1928 struct bpf_prog *prog;
1929 u32 id = attr->prog_id;
1932 if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
1935 if (!capable(CAP_SYS_ADMIN))
1938 spin_lock_bh(&prog_idr_lock);
1939 prog = idr_find(&prog_idr, id);
1941 prog = bpf_prog_inc_not_zero(prog);
1943 prog = ERR_PTR(-ENOENT);
1944 spin_unlock_bh(&prog_idr_lock);
1947 return PTR_ERR(prog);
1949 fd = bpf_prog_new_fd(prog);
1956 #define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
1958 static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
1960 struct bpf_map *map;
1961 u32 id = attr->map_id;
1965 if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
1966 attr->open_flags & ~BPF_OBJ_FLAG_MASK)
1969 if (!capable(CAP_SYS_ADMIN))
1972 f_flags = bpf_get_file_flag(attr->open_flags);
1976 spin_lock_bh(&map_idr_lock);
1977 map = idr_find(&map_idr, id);
1979 map = bpf_map_inc_not_zero(map, true);
1981 map = ERR_PTR(-ENOENT);
1982 spin_unlock_bh(&map_idr_lock);
1985 return PTR_ERR(map);
1987 fd = bpf_map_new_fd(map, f_flags);
1994 static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
1999 for (i = 0; i < prog->aux->used_map_cnt; i++)
2000 if (prog->aux->used_maps[i] == (void *)addr)
2001 return prog->aux->used_maps[i];
2005 static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog)
2007 const struct bpf_map *map;
2008 struct bpf_insn *insns;
2012 insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
2017 for (i = 0; i < prog->len; i++) {
2018 if (insns[i].code == (BPF_JMP | BPF_TAIL_CALL)) {
2019 insns[i].code = BPF_JMP | BPF_CALL;
2020 insns[i].imm = BPF_FUNC_tail_call;
2023 if (insns[i].code == (BPF_JMP | BPF_CALL) ||
2024 insns[i].code == (BPF_JMP | BPF_CALL_ARGS)) {
2025 if (insns[i].code == (BPF_JMP | BPF_CALL_ARGS))
2026 insns[i].code = BPF_JMP | BPF_CALL;
2027 if (!bpf_dump_raw_ok())
2032 if (insns[i].code != (BPF_LD | BPF_IMM | BPF_DW))
2035 imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
2036 map = bpf_map_from_imm(prog, imm);
2038 insns[i].src_reg = BPF_PSEUDO_MAP_FD;
2039 insns[i].imm = map->id;
2040 insns[i + 1].imm = 0;
2048 static int set_info_rec_size(struct bpf_prog_info *info)
2051 * Ensure info.*_rec_size is the same as kernel expected size
2055 * Only allow zero *_rec_size if both _rec_size and _cnt are
2056 * zero. In this case, the kernel will set the expected
2057 * _rec_size back to the info.
2060 if ((info->nr_func_info || info->func_info_rec_size) &&
2061 info->func_info_rec_size != sizeof(struct bpf_func_info))
2064 if ((info->nr_line_info || info->line_info_rec_size) &&
2065 info->line_info_rec_size != sizeof(struct bpf_line_info))
2068 if ((info->nr_jited_line_info || info->jited_line_info_rec_size) &&
2069 info->jited_line_info_rec_size != sizeof(__u64))
2072 info->func_info_rec_size = sizeof(struct bpf_func_info);
2073 info->line_info_rec_size = sizeof(struct bpf_line_info);
2074 info->jited_line_info_rec_size = sizeof(__u64);
2079 static int bpf_prog_get_info_by_fd(struct bpf_prog *prog,
2080 const union bpf_attr *attr,
2081 union bpf_attr __user *uattr)
2083 struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
2084 struct bpf_prog_info info = {};
2085 u32 info_len = attr->info.info_len;
2086 char __user *uinsns;
2090 err = bpf_check_uarg_tail_zero(uinfo, sizeof(info), info_len);
2093 info_len = min_t(u32, sizeof(info), info_len);
2095 if (copy_from_user(&info, uinfo, info_len))
2098 info.type = prog->type;
2099 info.id = prog->aux->id;
2100 info.load_time = prog->aux->load_time;
2101 info.created_by_uid = from_kuid_munged(current_user_ns(),
2102 prog->aux->user->uid);
2103 info.gpl_compatible = prog->gpl_compatible;
2105 memcpy(info.tag, prog->tag, sizeof(prog->tag));
2106 memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
2108 ulen = info.nr_map_ids;
2109 info.nr_map_ids = prog->aux->used_map_cnt;
2110 ulen = min_t(u32, info.nr_map_ids, ulen);
2112 u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
2115 for (i = 0; i < ulen; i++)
2116 if (put_user(prog->aux->used_maps[i]->id,
2121 err = set_info_rec_size(&info);
2125 if (!capable(CAP_SYS_ADMIN)) {
2126 info.jited_prog_len = 0;
2127 info.xlated_prog_len = 0;
2128 info.nr_jited_ksyms = 0;
2129 info.nr_jited_func_lens = 0;
2130 info.nr_func_info = 0;
2131 info.nr_line_info = 0;
2132 info.nr_jited_line_info = 0;
2136 ulen = info.xlated_prog_len;
2137 info.xlated_prog_len = bpf_prog_insn_size(prog);
2138 if (info.xlated_prog_len && ulen) {
2139 struct bpf_insn *insns_sanitized;
2142 if (prog->blinded && !bpf_dump_raw_ok()) {
2143 info.xlated_prog_insns = 0;
2146 insns_sanitized = bpf_insn_prepare_dump(prog);
2147 if (!insns_sanitized)
2149 uinsns = u64_to_user_ptr(info.xlated_prog_insns);
2150 ulen = min_t(u32, info.xlated_prog_len, ulen);
2151 fault = copy_to_user(uinsns, insns_sanitized, ulen);
2152 kfree(insns_sanitized);
2157 if (bpf_prog_is_dev_bound(prog->aux)) {
2158 err = bpf_prog_offload_info_fill(&info, prog);
2164 /* NOTE: the following code is supposed to be skipped for offload.
2165 * bpf_prog_offload_info_fill() is the place to fill similar fields
2168 ulen = info.jited_prog_len;
2169 if (prog->aux->func_cnt) {
2172 info.jited_prog_len = 0;
2173 for (i = 0; i < prog->aux->func_cnt; i++)
2174 info.jited_prog_len += prog->aux->func[i]->jited_len;
2176 info.jited_prog_len = prog->jited_len;
2179 if (info.jited_prog_len && ulen) {
2180 if (bpf_dump_raw_ok()) {
2181 uinsns = u64_to_user_ptr(info.jited_prog_insns);
2182 ulen = min_t(u32, info.jited_prog_len, ulen);
2184 /* for multi-function programs, copy the JITed
2185 * instructions for all the functions
2187 if (prog->aux->func_cnt) {
2192 for (i = 0; i < prog->aux->func_cnt; i++) {
2193 len = prog->aux->func[i]->jited_len;
2194 len = min_t(u32, len, free);
2195 img = (u8 *) prog->aux->func[i]->bpf_func;
2196 if (copy_to_user(uinsns, img, len))
2204 if (copy_to_user(uinsns, prog->bpf_func, ulen))
2208 info.jited_prog_insns = 0;
2212 ulen = info.nr_jited_ksyms;
2213 info.nr_jited_ksyms = prog->aux->func_cnt ? : 1;
2215 if (bpf_dump_raw_ok()) {
2216 unsigned long ksym_addr;
2217 u64 __user *user_ksyms;
2220 /* copy the address of the kernel symbol
2221 * corresponding to each function
2223 ulen = min_t(u32, info.nr_jited_ksyms, ulen);
2224 user_ksyms = u64_to_user_ptr(info.jited_ksyms);
2225 if (prog->aux->func_cnt) {
2226 for (i = 0; i < ulen; i++) {
2227 ksym_addr = (unsigned long)
2228 prog->aux->func[i]->bpf_func;
2229 if (put_user((u64) ksym_addr,
2234 ksym_addr = (unsigned long) prog->bpf_func;
2235 if (put_user((u64) ksym_addr, &user_ksyms[0]))
2239 info.jited_ksyms = 0;
2243 ulen = info.nr_jited_func_lens;
2244 info.nr_jited_func_lens = prog->aux->func_cnt ? : 1;
2246 if (bpf_dump_raw_ok()) {
2247 u32 __user *user_lens;
2250 /* copy the JITed image lengths for each function */
2251 ulen = min_t(u32, info.nr_jited_func_lens, ulen);
2252 user_lens = u64_to_user_ptr(info.jited_func_lens);
2253 if (prog->aux->func_cnt) {
2254 for (i = 0; i < ulen; i++) {
2256 prog->aux->func[i]->jited_len;
2257 if (put_user(func_len, &user_lens[i]))
2261 func_len = prog->jited_len;
2262 if (put_user(func_len, &user_lens[0]))
2266 info.jited_func_lens = 0;
2271 info.btf_id = btf_id(prog->aux->btf);
2273 ulen = info.nr_func_info;
2274 info.nr_func_info = prog->aux->func_info_cnt;
2275 if (info.nr_func_info && ulen) {
2276 char __user *user_finfo;
2278 user_finfo = u64_to_user_ptr(info.func_info);
2279 ulen = min_t(u32, info.nr_func_info, ulen);
2280 if (copy_to_user(user_finfo, prog->aux->func_info,
2281 info.func_info_rec_size * ulen))
2285 ulen = info.nr_line_info;
2286 info.nr_line_info = prog->aux->nr_linfo;
2287 if (info.nr_line_info && ulen) {
2288 __u8 __user *user_linfo;
2290 user_linfo = u64_to_user_ptr(info.line_info);
2291 ulen = min_t(u32, info.nr_line_info, ulen);
2292 if (copy_to_user(user_linfo, prog->aux->linfo,
2293 info.line_info_rec_size * ulen))
2297 ulen = info.nr_jited_line_info;
2298 if (prog->aux->jited_linfo)
2299 info.nr_jited_line_info = prog->aux->nr_linfo;
2301 info.nr_jited_line_info = 0;
2302 if (info.nr_jited_line_info && ulen) {
2303 if (bpf_dump_raw_ok()) {
2304 __u64 __user *user_linfo;
2307 user_linfo = u64_to_user_ptr(info.jited_line_info);
2308 ulen = min_t(u32, info.nr_jited_line_info, ulen);
2309 for (i = 0; i < ulen; i++) {
2310 if (put_user((__u64)(long)prog->aux->jited_linfo[i],
2315 info.jited_line_info = 0;
2319 ulen = info.nr_prog_tags;
2320 info.nr_prog_tags = prog->aux->func_cnt ? : 1;
2322 __u8 __user (*user_prog_tags)[BPF_TAG_SIZE];
2325 user_prog_tags = u64_to_user_ptr(info.prog_tags);
2326 ulen = min_t(u32, info.nr_prog_tags, ulen);
2327 if (prog->aux->func_cnt) {
2328 for (i = 0; i < ulen; i++) {
2329 if (copy_to_user(user_prog_tags[i],
2330 prog->aux->func[i]->tag,
2335 if (copy_to_user(user_prog_tags[0],
2336 prog->tag, BPF_TAG_SIZE))
2342 if (copy_to_user(uinfo, &info, info_len) ||
2343 put_user(info_len, &uattr->info.info_len))
2349 static int bpf_map_get_info_by_fd(struct bpf_map *map,
2350 const union bpf_attr *attr,
2351 union bpf_attr __user *uattr)
2353 struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
2354 struct bpf_map_info info = {};
2355 u32 info_len = attr->info.info_len;
2358 err = bpf_check_uarg_tail_zero(uinfo, sizeof(info), info_len);
2361 info_len = min_t(u32, sizeof(info), info_len);
2363 info.type = map->map_type;
2365 info.key_size = map->key_size;
2366 info.value_size = map->value_size;
2367 info.max_entries = map->max_entries;
2368 info.map_flags = map->map_flags;
2369 memcpy(info.name, map->name, sizeof(map->name));
2372 info.btf_id = btf_id(map->btf);
2373 info.btf_key_type_id = map->btf_key_type_id;
2374 info.btf_value_type_id = map->btf_value_type_id;
2377 if (bpf_map_is_dev_bound(map)) {
2378 err = bpf_map_offload_info_fill(&info, map);
2383 if (copy_to_user(uinfo, &info, info_len) ||
2384 put_user(info_len, &uattr->info.info_len))
2390 static int bpf_btf_get_info_by_fd(struct btf *btf,
2391 const union bpf_attr *attr,
2392 union bpf_attr __user *uattr)
2394 struct bpf_btf_info __user *uinfo = u64_to_user_ptr(attr->info.info);
2395 u32 info_len = attr->info.info_len;
2398 err = bpf_check_uarg_tail_zero(uinfo, sizeof(*uinfo), info_len);
2402 return btf_get_info_by_fd(btf, attr, uattr);
2405 #define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
2407 static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
2408 union bpf_attr __user *uattr)
2410 int ufd = attr->info.bpf_fd;
2414 if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
2421 if (f.file->f_op == &bpf_prog_fops)
2422 err = bpf_prog_get_info_by_fd(f.file->private_data, attr,
2424 else if (f.file->f_op == &bpf_map_fops)
2425 err = bpf_map_get_info_by_fd(f.file->private_data, attr,
2427 else if (f.file->f_op == &btf_fops)
2428 err = bpf_btf_get_info_by_fd(f.file->private_data, attr, uattr);
2436 #define BPF_BTF_LOAD_LAST_FIELD btf_log_level
2438 static int bpf_btf_load(const union bpf_attr *attr)
2440 if (CHECK_ATTR(BPF_BTF_LOAD))
2443 if (!capable(CAP_SYS_ADMIN))
2446 return btf_new_fd(attr);
2449 #define BPF_BTF_GET_FD_BY_ID_LAST_FIELD btf_id
2451 static int bpf_btf_get_fd_by_id(const union bpf_attr *attr)
2453 if (CHECK_ATTR(BPF_BTF_GET_FD_BY_ID))
2456 if (!capable(CAP_SYS_ADMIN))
2459 return btf_get_fd_by_id(attr->btf_id);
2462 static int bpf_task_fd_query_copy(const union bpf_attr *attr,
2463 union bpf_attr __user *uattr,
2464 u32 prog_id, u32 fd_type,
2465 const char *buf, u64 probe_offset,
2468 char __user *ubuf = u64_to_user_ptr(attr->task_fd_query.buf);
2469 u32 len = buf ? strlen(buf) : 0, input_len;
2472 if (put_user(len, &uattr->task_fd_query.buf_len))
2474 input_len = attr->task_fd_query.buf_len;
2475 if (input_len && ubuf) {
2477 /* nothing to copy, just make ubuf NULL terminated */
2480 if (put_user(zero, ubuf))
2482 } else if (input_len >= len + 1) {
2483 /* ubuf can hold the string with NULL terminator */
2484 if (copy_to_user(ubuf, buf, len + 1))
2487 /* ubuf cannot hold the string with NULL terminator,
2488 * do a partial copy with NULL terminator.
2493 if (copy_to_user(ubuf, buf, input_len - 1))
2495 if (put_user(zero, ubuf + input_len - 1))
2500 if (put_user(prog_id, &uattr->task_fd_query.prog_id) ||
2501 put_user(fd_type, &uattr->task_fd_query.fd_type) ||
2502 put_user(probe_offset, &uattr->task_fd_query.probe_offset) ||
2503 put_user(probe_addr, &uattr->task_fd_query.probe_addr))
2509 #define BPF_TASK_FD_QUERY_LAST_FIELD task_fd_query.probe_addr
2511 static int bpf_task_fd_query(const union bpf_attr *attr,
2512 union bpf_attr __user *uattr)
2514 pid_t pid = attr->task_fd_query.pid;
2515 u32 fd = attr->task_fd_query.fd;
2516 const struct perf_event *event;
2517 struct files_struct *files;
2518 struct task_struct *task;
2522 if (CHECK_ATTR(BPF_TASK_FD_QUERY))
2525 if (!capable(CAP_SYS_ADMIN))
2528 if (attr->task_fd_query.flags != 0)
2531 task = get_pid_task(find_vpid(pid), PIDTYPE_PID);
2535 files = get_files_struct(task);
2536 put_task_struct(task);
2541 spin_lock(&files->file_lock);
2542 file = fcheck_files(files, fd);
2547 spin_unlock(&files->file_lock);
2548 put_files_struct(files);
2553 if (file->f_op == &bpf_raw_tp_fops) {
2554 struct bpf_raw_tracepoint *raw_tp = file->private_data;
2555 struct bpf_raw_event_map *btp = raw_tp->btp;
2557 err = bpf_task_fd_query_copy(attr, uattr,
2558 raw_tp->prog->aux->id,
2559 BPF_FD_TYPE_RAW_TRACEPOINT,
2560 btp->tp->name, 0, 0);
2564 event = perf_get_event(file);
2565 if (!IS_ERR(event)) {
2566 u64 probe_offset, probe_addr;
2567 u32 prog_id, fd_type;
2570 err = bpf_get_perf_event_info(event, &prog_id, &fd_type,
2571 &buf, &probe_offset,
2574 err = bpf_task_fd_query_copy(attr, uattr, prog_id,
2588 SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
2590 union bpf_attr attr = {};
2593 if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
2596 err = bpf_check_uarg_tail_zero(uattr, sizeof(attr), size);
2599 size = min_t(u32, size, sizeof(attr));
2601 /* copy attributes from user space, may be less than sizeof(bpf_attr) */
2602 if (copy_from_user(&attr, uattr, size) != 0)
2605 err = security_bpf(cmd, &attr, size);
2610 case BPF_MAP_CREATE:
2611 err = map_create(&attr);
2613 case BPF_MAP_LOOKUP_ELEM:
2614 err = map_lookup_elem(&attr);
2616 case BPF_MAP_UPDATE_ELEM:
2617 err = map_update_elem(&attr);
2619 case BPF_MAP_DELETE_ELEM:
2620 err = map_delete_elem(&attr);
2622 case BPF_MAP_GET_NEXT_KEY:
2623 err = map_get_next_key(&attr);
2626 err = bpf_prog_load(&attr, uattr);
2629 err = bpf_obj_pin(&attr);
2632 err = bpf_obj_get(&attr);
2634 case BPF_PROG_ATTACH:
2635 err = bpf_prog_attach(&attr);
2637 case BPF_PROG_DETACH:
2638 err = bpf_prog_detach(&attr);
2640 case BPF_PROG_QUERY:
2641 err = bpf_prog_query(&attr, uattr);
2643 case BPF_PROG_TEST_RUN:
2644 err = bpf_prog_test_run(&attr, uattr);
2646 case BPF_PROG_GET_NEXT_ID:
2647 err = bpf_obj_get_next_id(&attr, uattr,
2648 &prog_idr, &prog_idr_lock);
2650 case BPF_MAP_GET_NEXT_ID:
2651 err = bpf_obj_get_next_id(&attr, uattr,
2652 &map_idr, &map_idr_lock);
2654 case BPF_PROG_GET_FD_BY_ID:
2655 err = bpf_prog_get_fd_by_id(&attr);
2657 case BPF_MAP_GET_FD_BY_ID:
2658 err = bpf_map_get_fd_by_id(&attr);
2660 case BPF_OBJ_GET_INFO_BY_FD:
2661 err = bpf_obj_get_info_by_fd(&attr, uattr);
2663 case BPF_RAW_TRACEPOINT_OPEN:
2664 err = bpf_raw_tracepoint_open(&attr);
2667 err = bpf_btf_load(&attr);
2669 case BPF_BTF_GET_FD_BY_ID:
2670 err = bpf_btf_get_fd_by_id(&attr);
2672 case BPF_TASK_FD_QUERY:
2673 err = bpf_task_fd_query(&attr, uattr);
2675 case BPF_MAP_LOOKUP_AND_DELETE_ELEM:
2676 err = map_lookup_and_delete_elem(&attr);