xref: /linux/kernel/bpf/syscall.c (revision b725441f02c2b31c04a95d0e9ca5420fa029a767)
1 // SPDX-License-Identifier: GPL-2.0-only
2 /* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3  */
4 #include <linux/bpf.h>
5 #include <linux/bpf-cgroup.h>
6 #include <linux/bpf_trace.h>
7 #include <linux/bpf_lirc.h>
8 #include <linux/bpf_verifier.h>
9 #include <linux/bsearch.h>
10 #include <linux/btf.h>
11 #include <linux/syscalls.h>
12 #include <linux/slab.h>
13 #include <linux/sched/signal.h>
14 #include <linux/vmalloc.h>
15 #include <linux/mmzone.h>
16 #include <linux/anon_inodes.h>
17 #include <linux/fdtable.h>
18 #include <linux/file.h>
19 #include <linux/fs.h>
20 #include <linux/license.h>
21 #include <linux/filter.h>
22 #include <linux/kernel.h>
23 #include <linux/idr.h>
24 #include <linux/cred.h>
25 #include <linux/timekeeping.h>
26 #include <linux/ctype.h>
27 #include <linux/nospec.h>
28 #include <linux/audit.h>
29 #include <uapi/linux/btf.h>
30 #include <linux/pgtable.h>
31 #include <linux/bpf_lsm.h>
32 #include <linux/poll.h>
33 #include <linux/sort.h>
34 #include <linux/bpf-netns.h>
35 #include <linux/rcupdate_trace.h>
36 #include <linux/memcontrol.h>
37 #include <linux/trace_events.h>
38 #include <linux/tracepoint.h>
39 #include <linux/overflow.h>
40 
41 #include <net/netfilter/nf_bpf_link.h>
42 #include <net/netkit.h>
43 #include <net/tcx.h>
44 
45 #define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
46 			  (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
47 			  (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
48 #define IS_FD_PROG_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)
49 #define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
50 #define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \
51 			IS_FD_HASH(map))
52 
53 #define BPF_OBJ_FLAG_MASK   (BPF_F_RDONLY | BPF_F_WRONLY)
54 
55 DEFINE_PER_CPU(int, bpf_prog_active);
56 static DEFINE_IDR(prog_idr);
57 static DEFINE_SPINLOCK(prog_idr_lock);
58 static DEFINE_IDR(map_idr);
59 static DEFINE_SPINLOCK(map_idr_lock);
60 static DEFINE_IDR(link_idr);
61 static DEFINE_SPINLOCK(link_idr_lock);
62 
63 int sysctl_unprivileged_bpf_disabled __read_mostly =
64 	IS_BUILTIN(CONFIG_BPF_UNPRIV_DEFAULT_OFF) ? 2 : 0;
65 
66 static const struct bpf_map_ops * const bpf_map_types[] = {
67 #define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type)
68 #define BPF_MAP_TYPE(_id, _ops) \
69 	[_id] = &_ops,
70 #define BPF_LINK_TYPE(_id, _name)
71 #include <linux/bpf_types.h>
72 #undef BPF_PROG_TYPE
73 #undef BPF_MAP_TYPE
74 #undef BPF_LINK_TYPE
75 };
76 
77 /*
78  * If we're handed a bigger struct than we know of, ensure all the unknown bits
79  * are 0 - i.e. new user-space does not rely on any kernel feature extensions
80  * we don't know about yet.
81  *
82  * There is a ToCToU between this function call and the following
83  * copy_from_user() call. However, this is not a concern since this function is
84  * meant to be a future-proofing of bits.
85  */
86 int bpf_check_uarg_tail_zero(bpfptr_t uaddr,
87 			     size_t expected_size,
88 			     size_t actual_size)
89 {
90 	int res;
91 
92 	if (unlikely(actual_size > PAGE_SIZE))	/* silly large */
93 		return -E2BIG;
94 
95 	if (actual_size <= expected_size)
96 		return 0;
97 
98 	if (uaddr.is_kernel)
99 		res = memchr_inv(uaddr.kernel + expected_size, 0,
100 				 actual_size - expected_size) == NULL;
101 	else
102 		res = check_zeroed_user(uaddr.user + expected_size,
103 					actual_size - expected_size);
104 	if (res < 0)
105 		return res;
106 	return res ? 0 : -E2BIG;
107 }
108 
109 const struct bpf_map_ops bpf_map_offload_ops = {
110 	.map_meta_equal = bpf_map_meta_equal,
111 	.map_alloc = bpf_map_offload_map_alloc,
112 	.map_free = bpf_map_offload_map_free,
113 	.map_check_btf = map_check_no_btf,
114 	.map_mem_usage = bpf_map_offload_map_mem_usage,
115 };
116 
117 static void bpf_map_write_active_inc(struct bpf_map *map)
118 {
119 	atomic64_inc(&map->writecnt);
120 }
121 
122 static void bpf_map_write_active_dec(struct bpf_map *map)
123 {
124 	atomic64_dec(&map->writecnt);
125 }
126 
127 bool bpf_map_write_active(const struct bpf_map *map)
128 {
129 	return atomic64_read(&map->writecnt) != 0;
130 }
131 
132 static u32 bpf_map_value_size(const struct bpf_map *map)
133 {
134 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
135 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
136 	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
137 	    map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
138 		return round_up(map->value_size, 8) * num_possible_cpus();
139 	else if (IS_FD_MAP(map))
140 		return sizeof(u32);
141 	else
142 		return  map->value_size;
143 }
144 
145 static void maybe_wait_bpf_programs(struct bpf_map *map)
146 {
147 	/* Wait for any running non-sleepable BPF programs to complete so that
148 	 * userspace, when we return to it, knows that all non-sleepable
149 	 * programs that could be running use the new map value. For sleepable
150 	 * BPF programs, synchronize_rcu_tasks_trace() should be used to wait
151 	 * for the completions of these programs, but considering the waiting
152 	 * time can be very long and userspace may think it will hang forever,
153 	 * so don't handle sleepable BPF programs now.
154 	 */
155 	if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS ||
156 	    map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
157 		synchronize_rcu();
158 }
159 
160 static void unpin_uptr_kaddr(void *kaddr)
161 {
162 	if (kaddr)
163 		unpin_user_page(virt_to_page(kaddr));
164 }
165 
166 static void __bpf_obj_unpin_uptrs(struct btf_record *rec, u32 cnt, void *obj)
167 {
168 	const struct btf_field *field;
169 	void **uptr_addr;
170 	int i;
171 
172 	for (i = 0, field = rec->fields; i < cnt; i++, field++) {
173 		if (field->type != BPF_UPTR)
174 			continue;
175 
176 		uptr_addr = obj + field->offset;
177 		unpin_uptr_kaddr(*uptr_addr);
178 	}
179 }
180 
181 static void bpf_obj_unpin_uptrs(struct btf_record *rec, void *obj)
182 {
183 	if (!btf_record_has_field(rec, BPF_UPTR))
184 		return;
185 
186 	__bpf_obj_unpin_uptrs(rec, rec->cnt, obj);
187 }
188 
189 static int bpf_obj_pin_uptrs(struct btf_record *rec, void *obj)
190 {
191 	const struct btf_field *field;
192 	const struct btf_type *t;
193 	unsigned long start, end;
194 	struct page *page;
195 	void **uptr_addr;
196 	int i, err;
197 
198 	if (!btf_record_has_field(rec, BPF_UPTR))
199 		return 0;
200 
201 	for (i = 0, field = rec->fields; i < rec->cnt; i++, field++) {
202 		if (field->type != BPF_UPTR)
203 			continue;
204 
205 		uptr_addr = obj + field->offset;
206 		start = *(unsigned long *)uptr_addr;
207 		if (!start)
208 			continue;
209 
210 		t = btf_type_by_id(field->kptr.btf, field->kptr.btf_id);
211 		/* t->size was checked for zero before */
212 		if (check_add_overflow(start, t->size - 1, &end)) {
213 			err = -EFAULT;
214 			goto unpin_all;
215 		}
216 
217 		/* The uptr's struct cannot span across two pages */
218 		if ((start & PAGE_MASK) != (end & PAGE_MASK)) {
219 			err = -EOPNOTSUPP;
220 			goto unpin_all;
221 		}
222 
223 		err = pin_user_pages_fast(start, 1, FOLL_LONGTERM | FOLL_WRITE, &page);
224 		if (err != 1)
225 			goto unpin_all;
226 
227 		if (PageHighMem(page)) {
228 			err = -EOPNOTSUPP;
229 			unpin_user_page(page);
230 			goto unpin_all;
231 		}
232 
233 		*uptr_addr = page_address(page) + offset_in_page(start);
234 	}
235 
236 	return 0;
237 
238 unpin_all:
239 	__bpf_obj_unpin_uptrs(rec, i, obj);
240 	return err;
241 }
242 
243 static int bpf_map_update_value(struct bpf_map *map, struct file *map_file,
244 				void *key, void *value, __u64 flags)
245 {
246 	int err;
247 
248 	/* Need to create a kthread, thus must support schedule */
249 	if (bpf_map_is_offloaded(map)) {
250 		return bpf_map_offload_update_elem(map, key, value, flags);
251 	} else if (map->map_type == BPF_MAP_TYPE_CPUMAP ||
252 		   map->map_type == BPF_MAP_TYPE_ARENA ||
253 		   map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
254 		return map->ops->map_update_elem(map, key, value, flags);
255 	} else if (map->map_type == BPF_MAP_TYPE_SOCKHASH ||
256 		   map->map_type == BPF_MAP_TYPE_SOCKMAP) {
257 		return sock_map_update_elem_sys(map, key, value, flags);
258 	} else if (IS_FD_PROG_ARRAY(map)) {
259 		return bpf_fd_array_map_update_elem(map, map_file, key, value,
260 						    flags);
261 	}
262 
263 	bpf_disable_instrumentation();
264 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
265 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
266 		err = bpf_percpu_hash_update(map, key, value, flags);
267 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
268 		err = bpf_percpu_array_update(map, key, value, flags);
269 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
270 		err = bpf_percpu_cgroup_storage_update(map, key, value,
271 						       flags);
272 	} else if (IS_FD_ARRAY(map)) {
273 		err = bpf_fd_array_map_update_elem(map, map_file, key, value,
274 						   flags);
275 	} else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
276 		err = bpf_fd_htab_map_update_elem(map, map_file, key, value,
277 						  flags);
278 	} else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
279 		/* rcu_read_lock() is not needed */
280 		err = bpf_fd_reuseport_array_update_elem(map, key, value,
281 							 flags);
282 	} else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
283 		   map->map_type == BPF_MAP_TYPE_STACK ||
284 		   map->map_type == BPF_MAP_TYPE_BLOOM_FILTER) {
285 		err = map->ops->map_push_elem(map, value, flags);
286 	} else {
287 		err = bpf_obj_pin_uptrs(map->record, value);
288 		if (!err) {
289 			rcu_read_lock();
290 			err = map->ops->map_update_elem(map, key, value, flags);
291 			rcu_read_unlock();
292 			if (err)
293 				bpf_obj_unpin_uptrs(map->record, value);
294 		}
295 	}
296 	bpf_enable_instrumentation();
297 
298 	return err;
299 }
300 
301 static int bpf_map_copy_value(struct bpf_map *map, void *key, void *value,
302 			      __u64 flags)
303 {
304 	void *ptr;
305 	int err;
306 
307 	if (bpf_map_is_offloaded(map))
308 		return bpf_map_offload_lookup_elem(map, key, value);
309 
310 	bpf_disable_instrumentation();
311 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
312 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
313 		err = bpf_percpu_hash_copy(map, key, value);
314 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
315 		err = bpf_percpu_array_copy(map, key, value);
316 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
317 		err = bpf_percpu_cgroup_storage_copy(map, key, value);
318 	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
319 		err = bpf_stackmap_copy(map, key, value);
320 	} else if (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map)) {
321 		err = bpf_fd_array_map_lookup_elem(map, key, value);
322 	} else if (IS_FD_HASH(map)) {
323 		err = bpf_fd_htab_map_lookup_elem(map, key, value);
324 	} else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
325 		err = bpf_fd_reuseport_array_lookup_elem(map, key, value);
326 	} else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
327 		   map->map_type == BPF_MAP_TYPE_STACK ||
328 		   map->map_type == BPF_MAP_TYPE_BLOOM_FILTER) {
329 		err = map->ops->map_peek_elem(map, value);
330 	} else if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
331 		/* struct_ops map requires directly updating "value" */
332 		err = bpf_struct_ops_map_sys_lookup_elem(map, key, value);
333 	} else {
334 		rcu_read_lock();
335 		if (map->ops->map_lookup_elem_sys_only)
336 			ptr = map->ops->map_lookup_elem_sys_only(map, key);
337 		else
338 			ptr = map->ops->map_lookup_elem(map, key);
339 		if (IS_ERR(ptr)) {
340 			err = PTR_ERR(ptr);
341 		} else if (!ptr) {
342 			err = -ENOENT;
343 		} else {
344 			err = 0;
345 			if (flags & BPF_F_LOCK)
346 				/* lock 'ptr' and copy everything but lock */
347 				copy_map_value_locked(map, value, ptr, true);
348 			else
349 				copy_map_value(map, value, ptr);
350 			/* mask lock and timer, since value wasn't zero inited */
351 			check_and_init_map_value(map, value);
352 		}
353 		rcu_read_unlock();
354 	}
355 
356 	bpf_enable_instrumentation();
357 
358 	return err;
359 }
360 
361 /* Please, do not use this function outside from the map creation path
362  * (e.g. in map update path) without taking care of setting the active
363  * memory cgroup (see at bpf_map_kmalloc_node() for example).
364  */
365 static void *__bpf_map_area_alloc(u64 size, int numa_node, bool mmapable)
366 {
367 	/* We really just want to fail instead of triggering OOM killer
368 	 * under memory pressure, therefore we set __GFP_NORETRY to kmalloc,
369 	 * which is used for lower order allocation requests.
370 	 *
371 	 * It has been observed that higher order allocation requests done by
372 	 * vmalloc with __GFP_NORETRY being set might fail due to not trying
373 	 * to reclaim memory from the page cache, thus we set
374 	 * __GFP_RETRY_MAYFAIL to avoid such situations.
375 	 */
376 
377 	gfp_t gfp = bpf_memcg_flags(__GFP_NOWARN | __GFP_ZERO);
378 	unsigned int flags = 0;
379 	unsigned long align = 1;
380 	void *area;
381 
382 	if (size >= SIZE_MAX)
383 		return NULL;
384 
385 	/* kmalloc()'ed memory can't be mmap()'ed */
386 	if (mmapable) {
387 		BUG_ON(!PAGE_ALIGNED(size));
388 		align = SHMLBA;
389 		flags = VM_USERMAP;
390 	} else if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
391 		area = kmalloc_node(size, gfp | GFP_USER | __GFP_NORETRY,
392 				    numa_node);
393 		if (area != NULL)
394 			return area;
395 	}
396 
397 	return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END,
398 			gfp | GFP_KERNEL | __GFP_RETRY_MAYFAIL, PAGE_KERNEL,
399 			flags, numa_node, __builtin_return_address(0));
400 }
401 
402 void *bpf_map_area_alloc(u64 size, int numa_node)
403 {
404 	return __bpf_map_area_alloc(size, numa_node, false);
405 }
406 
407 void *bpf_map_area_mmapable_alloc(u64 size, int numa_node)
408 {
409 	return __bpf_map_area_alloc(size, numa_node, true);
410 }
411 
412 void bpf_map_area_free(void *area)
413 {
414 	kvfree(area);
415 }
416 
417 static u32 bpf_map_flags_retain_permanent(u32 flags)
418 {
419 	/* Some map creation flags are not tied to the map object but
420 	 * rather to the map fd instead, so they have no meaning upon
421 	 * map object inspection since multiple file descriptors with
422 	 * different (access) properties can exist here. Thus, given
423 	 * this has zero meaning for the map itself, lets clear these
424 	 * from here.
425 	 */
426 	return flags & ~(BPF_F_RDONLY | BPF_F_WRONLY);
427 }
428 
429 void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
430 {
431 	map->map_type = attr->map_type;
432 	map->key_size = attr->key_size;
433 	map->value_size = attr->value_size;
434 	map->max_entries = attr->max_entries;
435 	map->map_flags = bpf_map_flags_retain_permanent(attr->map_flags);
436 	map->numa_node = bpf_map_attr_numa_node(attr);
437 	map->map_extra = attr->map_extra;
438 }
439 
440 static int bpf_map_alloc_id(struct bpf_map *map)
441 {
442 	int id;
443 
444 	idr_preload(GFP_KERNEL);
445 	spin_lock_bh(&map_idr_lock);
446 	id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
447 	if (id > 0)
448 		map->id = id;
449 	spin_unlock_bh(&map_idr_lock);
450 	idr_preload_end();
451 
452 	if (WARN_ON_ONCE(!id))
453 		return -ENOSPC;
454 
455 	return id > 0 ? 0 : id;
456 }
457 
458 void bpf_map_free_id(struct bpf_map *map)
459 {
460 	unsigned long flags;
461 
462 	/* Offloaded maps are removed from the IDR store when their device
463 	 * disappears - even if someone holds an fd to them they are unusable,
464 	 * the memory is gone, all ops will fail; they are simply waiting for
465 	 * refcnt to drop to be freed.
466 	 */
467 	if (!map->id)
468 		return;
469 
470 	spin_lock_irqsave(&map_idr_lock, flags);
471 
472 	idr_remove(&map_idr, map->id);
473 	map->id = 0;
474 
475 	spin_unlock_irqrestore(&map_idr_lock, flags);
476 }
477 
478 #ifdef CONFIG_MEMCG
479 static void bpf_map_save_memcg(struct bpf_map *map)
480 {
481 	/* Currently if a map is created by a process belonging to the root
482 	 * memory cgroup, get_obj_cgroup_from_current() will return NULL.
483 	 * So we have to check map->objcg for being NULL each time it's
484 	 * being used.
485 	 */
486 	if (memcg_bpf_enabled())
487 		map->objcg = get_obj_cgroup_from_current();
488 }
489 
490 static void bpf_map_release_memcg(struct bpf_map *map)
491 {
492 	if (map->objcg)
493 		obj_cgroup_put(map->objcg);
494 }
495 
496 static struct mem_cgroup *bpf_map_get_memcg(const struct bpf_map *map)
497 {
498 	if (map->objcg)
499 		return get_mem_cgroup_from_objcg(map->objcg);
500 
501 	return root_mem_cgroup;
502 }
503 
504 void *bpf_map_kmalloc_node(const struct bpf_map *map, size_t size, gfp_t flags,
505 			   int node)
506 {
507 	struct mem_cgroup *memcg, *old_memcg;
508 	void *ptr;
509 
510 	memcg = bpf_map_get_memcg(map);
511 	old_memcg = set_active_memcg(memcg);
512 	ptr = kmalloc_node(size, flags | __GFP_ACCOUNT, node);
513 	set_active_memcg(old_memcg);
514 	mem_cgroup_put(memcg);
515 
516 	return ptr;
517 }
518 
519 void *bpf_map_kzalloc(const struct bpf_map *map, size_t size, gfp_t flags)
520 {
521 	struct mem_cgroup *memcg, *old_memcg;
522 	void *ptr;
523 
524 	memcg = bpf_map_get_memcg(map);
525 	old_memcg = set_active_memcg(memcg);
526 	ptr = kzalloc(size, flags | __GFP_ACCOUNT);
527 	set_active_memcg(old_memcg);
528 	mem_cgroup_put(memcg);
529 
530 	return ptr;
531 }
532 
533 void *bpf_map_kvcalloc(struct bpf_map *map, size_t n, size_t size,
534 		       gfp_t flags)
535 {
536 	struct mem_cgroup *memcg, *old_memcg;
537 	void *ptr;
538 
539 	memcg = bpf_map_get_memcg(map);
540 	old_memcg = set_active_memcg(memcg);
541 	ptr = kvcalloc(n, size, flags | __GFP_ACCOUNT);
542 	set_active_memcg(old_memcg);
543 	mem_cgroup_put(memcg);
544 
545 	return ptr;
546 }
547 
548 void __percpu *bpf_map_alloc_percpu(const struct bpf_map *map, size_t size,
549 				    size_t align, gfp_t flags)
550 {
551 	struct mem_cgroup *memcg, *old_memcg;
552 	void __percpu *ptr;
553 
554 	memcg = bpf_map_get_memcg(map);
555 	old_memcg = set_active_memcg(memcg);
556 	ptr = __alloc_percpu_gfp(size, align, flags | __GFP_ACCOUNT);
557 	set_active_memcg(old_memcg);
558 	mem_cgroup_put(memcg);
559 
560 	return ptr;
561 }
562 
563 #else
564 static void bpf_map_save_memcg(struct bpf_map *map)
565 {
566 }
567 
568 static void bpf_map_release_memcg(struct bpf_map *map)
569 {
570 }
571 #endif
572 
573 static bool can_alloc_pages(void)
574 {
575 	return preempt_count() == 0 && !irqs_disabled() &&
576 		!IS_ENABLED(CONFIG_PREEMPT_RT);
577 }
578 
579 static struct page *__bpf_alloc_page(int nid)
580 {
581 	if (!can_alloc_pages())
582 		return alloc_pages_nolock(nid, 0);
583 
584 	return alloc_pages_node(nid,
585 				GFP_KERNEL | __GFP_ZERO | __GFP_ACCOUNT
586 				| __GFP_NOWARN,
587 				0);
588 }
589 
590 int bpf_map_alloc_pages(const struct bpf_map *map, int nid,
591 			unsigned long nr_pages, struct page **pages)
592 {
593 	unsigned long i, j;
594 	struct page *pg;
595 	int ret = 0;
596 #ifdef CONFIG_MEMCG
597 	struct mem_cgroup *memcg, *old_memcg;
598 
599 	memcg = bpf_map_get_memcg(map);
600 	old_memcg = set_active_memcg(memcg);
601 #endif
602 	for (i = 0; i < nr_pages; i++) {
603 		pg = __bpf_alloc_page(nid);
604 
605 		if (pg) {
606 			pages[i] = pg;
607 			continue;
608 		}
609 		for (j = 0; j < i; j++)
610 			free_pages_nolock(pages[j], 0);
611 		ret = -ENOMEM;
612 		break;
613 	}
614 
615 #ifdef CONFIG_MEMCG
616 	set_active_memcg(old_memcg);
617 	mem_cgroup_put(memcg);
618 #endif
619 	return ret;
620 }
621 
622 
623 static int btf_field_cmp(const void *a, const void *b)
624 {
625 	const struct btf_field *f1 = a, *f2 = b;
626 
627 	if (f1->offset < f2->offset)
628 		return -1;
629 	else if (f1->offset > f2->offset)
630 		return 1;
631 	return 0;
632 }
633 
634 struct btf_field *btf_record_find(const struct btf_record *rec, u32 offset,
635 				  u32 field_mask)
636 {
637 	struct btf_field *field;
638 
639 	if (IS_ERR_OR_NULL(rec) || !(rec->field_mask & field_mask))
640 		return NULL;
641 	field = bsearch(&offset, rec->fields, rec->cnt, sizeof(rec->fields[0]), btf_field_cmp);
642 	if (!field || !(field->type & field_mask))
643 		return NULL;
644 	return field;
645 }
646 
647 void btf_record_free(struct btf_record *rec)
648 {
649 	int i;
650 
651 	if (IS_ERR_OR_NULL(rec))
652 		return;
653 	for (i = 0; i < rec->cnt; i++) {
654 		switch (rec->fields[i].type) {
655 		case BPF_KPTR_UNREF:
656 		case BPF_KPTR_REF:
657 		case BPF_KPTR_PERCPU:
658 		case BPF_UPTR:
659 			if (rec->fields[i].kptr.module)
660 				module_put(rec->fields[i].kptr.module);
661 			if (btf_is_kernel(rec->fields[i].kptr.btf))
662 				btf_put(rec->fields[i].kptr.btf);
663 			break;
664 		case BPF_LIST_HEAD:
665 		case BPF_LIST_NODE:
666 		case BPF_RB_ROOT:
667 		case BPF_RB_NODE:
668 		case BPF_SPIN_LOCK:
669 		case BPF_RES_SPIN_LOCK:
670 		case BPF_TIMER:
671 		case BPF_REFCOUNT:
672 		case BPF_WORKQUEUE:
673 			/* Nothing to release */
674 			break;
675 		default:
676 			WARN_ON_ONCE(1);
677 			continue;
678 		}
679 	}
680 	kfree(rec);
681 }
682 
683 void bpf_map_free_record(struct bpf_map *map)
684 {
685 	btf_record_free(map->record);
686 	map->record = NULL;
687 }
688 
689 struct btf_record *btf_record_dup(const struct btf_record *rec)
690 {
691 	const struct btf_field *fields;
692 	struct btf_record *new_rec;
693 	int ret, size, i;
694 
695 	if (IS_ERR_OR_NULL(rec))
696 		return NULL;
697 	size = struct_size(rec, fields, rec->cnt);
698 	new_rec = kmemdup(rec, size, GFP_KERNEL | __GFP_NOWARN);
699 	if (!new_rec)
700 		return ERR_PTR(-ENOMEM);
701 	/* Do a deep copy of the btf_record */
702 	fields = rec->fields;
703 	new_rec->cnt = 0;
704 	for (i = 0; i < rec->cnt; i++) {
705 		switch (fields[i].type) {
706 		case BPF_KPTR_UNREF:
707 		case BPF_KPTR_REF:
708 		case BPF_KPTR_PERCPU:
709 		case BPF_UPTR:
710 			if (btf_is_kernel(fields[i].kptr.btf))
711 				btf_get(fields[i].kptr.btf);
712 			if (fields[i].kptr.module && !try_module_get(fields[i].kptr.module)) {
713 				ret = -ENXIO;
714 				goto free;
715 			}
716 			break;
717 		case BPF_LIST_HEAD:
718 		case BPF_LIST_NODE:
719 		case BPF_RB_ROOT:
720 		case BPF_RB_NODE:
721 		case BPF_SPIN_LOCK:
722 		case BPF_RES_SPIN_LOCK:
723 		case BPF_TIMER:
724 		case BPF_REFCOUNT:
725 		case BPF_WORKQUEUE:
726 			/* Nothing to acquire */
727 			break;
728 		default:
729 			ret = -EFAULT;
730 			WARN_ON_ONCE(1);
731 			goto free;
732 		}
733 		new_rec->cnt++;
734 	}
735 	return new_rec;
736 free:
737 	btf_record_free(new_rec);
738 	return ERR_PTR(ret);
739 }
740 
741 bool btf_record_equal(const struct btf_record *rec_a, const struct btf_record *rec_b)
742 {
743 	bool a_has_fields = !IS_ERR_OR_NULL(rec_a), b_has_fields = !IS_ERR_OR_NULL(rec_b);
744 	int size;
745 
746 	if (!a_has_fields && !b_has_fields)
747 		return true;
748 	if (a_has_fields != b_has_fields)
749 		return false;
750 	if (rec_a->cnt != rec_b->cnt)
751 		return false;
752 	size = struct_size(rec_a, fields, rec_a->cnt);
753 	/* btf_parse_fields uses kzalloc to allocate a btf_record, so unused
754 	 * members are zeroed out. So memcmp is safe to do without worrying
755 	 * about padding/unused fields.
756 	 *
757 	 * While spin_lock, timer, and kptr have no relation to map BTF,
758 	 * list_head metadata is specific to map BTF, the btf and value_rec
759 	 * members in particular. btf is the map BTF, while value_rec points to
760 	 * btf_record in that map BTF.
761 	 *
762 	 * So while by default, we don't rely on the map BTF (which the records
763 	 * were parsed from) matching for both records, which is not backwards
764 	 * compatible, in case list_head is part of it, we implicitly rely on
765 	 * that by way of depending on memcmp succeeding for it.
766 	 */
767 	return !memcmp(rec_a, rec_b, size);
768 }
769 
770 void bpf_obj_free_timer(const struct btf_record *rec, void *obj)
771 {
772 	if (WARN_ON_ONCE(!btf_record_has_field(rec, BPF_TIMER)))
773 		return;
774 	bpf_timer_cancel_and_free(obj + rec->timer_off);
775 }
776 
777 void bpf_obj_free_workqueue(const struct btf_record *rec, void *obj)
778 {
779 	if (WARN_ON_ONCE(!btf_record_has_field(rec, BPF_WORKQUEUE)))
780 		return;
781 	bpf_wq_cancel_and_free(obj + rec->wq_off);
782 }
783 
784 void bpf_obj_free_fields(const struct btf_record *rec, void *obj)
785 {
786 	const struct btf_field *fields;
787 	int i;
788 
789 	if (IS_ERR_OR_NULL(rec))
790 		return;
791 	fields = rec->fields;
792 	for (i = 0; i < rec->cnt; i++) {
793 		struct btf_struct_meta *pointee_struct_meta;
794 		const struct btf_field *field = &fields[i];
795 		void *field_ptr = obj + field->offset;
796 		void *xchgd_field;
797 
798 		switch (fields[i].type) {
799 		case BPF_SPIN_LOCK:
800 		case BPF_RES_SPIN_LOCK:
801 			break;
802 		case BPF_TIMER:
803 			bpf_timer_cancel_and_free(field_ptr);
804 			break;
805 		case BPF_WORKQUEUE:
806 			bpf_wq_cancel_and_free(field_ptr);
807 			break;
808 		case BPF_KPTR_UNREF:
809 			WRITE_ONCE(*(u64 *)field_ptr, 0);
810 			break;
811 		case BPF_KPTR_REF:
812 		case BPF_KPTR_PERCPU:
813 			xchgd_field = (void *)xchg((unsigned long *)field_ptr, 0);
814 			if (!xchgd_field)
815 				break;
816 
817 			if (!btf_is_kernel(field->kptr.btf)) {
818 				pointee_struct_meta = btf_find_struct_meta(field->kptr.btf,
819 									   field->kptr.btf_id);
820 				__bpf_obj_drop_impl(xchgd_field, pointee_struct_meta ?
821 								 pointee_struct_meta->record : NULL,
822 								 fields[i].type == BPF_KPTR_PERCPU);
823 			} else {
824 				field->kptr.dtor(xchgd_field);
825 			}
826 			break;
827 		case BPF_UPTR:
828 			/* The caller ensured that no one is using the uptr */
829 			unpin_uptr_kaddr(*(void **)field_ptr);
830 			break;
831 		case BPF_LIST_HEAD:
832 			if (WARN_ON_ONCE(rec->spin_lock_off < 0))
833 				continue;
834 			bpf_list_head_free(field, field_ptr, obj + rec->spin_lock_off);
835 			break;
836 		case BPF_RB_ROOT:
837 			if (WARN_ON_ONCE(rec->spin_lock_off < 0))
838 				continue;
839 			bpf_rb_root_free(field, field_ptr, obj + rec->spin_lock_off);
840 			break;
841 		case BPF_LIST_NODE:
842 		case BPF_RB_NODE:
843 		case BPF_REFCOUNT:
844 			break;
845 		default:
846 			WARN_ON_ONCE(1);
847 			continue;
848 		}
849 	}
850 }
851 
852 static void bpf_map_free(struct bpf_map *map)
853 {
854 	struct btf_record *rec = map->record;
855 	struct btf *btf = map->btf;
856 
857 	/* implementation dependent freeing. Disabling migration to simplify
858 	 * the free of values or special fields allocated from bpf memory
859 	 * allocator.
860 	 */
861 	migrate_disable();
862 	map->ops->map_free(map);
863 	migrate_enable();
864 
865 	/* Delay freeing of btf_record for maps, as map_free
866 	 * callback usually needs access to them. It is better to do it here
867 	 * than require each callback to do the free itself manually.
868 	 *
869 	 * Note that the btf_record stashed in map->inner_map_meta->record was
870 	 * already freed using the map_free callback for map in map case which
871 	 * eventually calls bpf_map_free_meta, since inner_map_meta is only a
872 	 * template bpf_map struct used during verification.
873 	 */
874 	btf_record_free(rec);
875 	/* Delay freeing of btf for maps, as map_free callback may need
876 	 * struct_meta info which will be freed with btf_put().
877 	 */
878 	btf_put(btf);
879 }
880 
881 /* called from workqueue */
882 static void bpf_map_free_deferred(struct work_struct *work)
883 {
884 	struct bpf_map *map = container_of(work, struct bpf_map, work);
885 
886 	security_bpf_map_free(map);
887 	bpf_map_release_memcg(map);
888 	bpf_map_free(map);
889 }
890 
891 static void bpf_map_put_uref(struct bpf_map *map)
892 {
893 	if (atomic64_dec_and_test(&map->usercnt)) {
894 		if (map->ops->map_release_uref)
895 			map->ops->map_release_uref(map);
896 	}
897 }
898 
899 static void bpf_map_free_in_work(struct bpf_map *map)
900 {
901 	INIT_WORK(&map->work, bpf_map_free_deferred);
902 	/* Avoid spawning kworkers, since they all might contend
903 	 * for the same mutex like slab_mutex.
904 	 */
905 	queue_work(system_unbound_wq, &map->work);
906 }
907 
908 static void bpf_map_free_rcu_gp(struct rcu_head *rcu)
909 {
910 	bpf_map_free_in_work(container_of(rcu, struct bpf_map, rcu));
911 }
912 
913 static void bpf_map_free_mult_rcu_gp(struct rcu_head *rcu)
914 {
915 	if (rcu_trace_implies_rcu_gp())
916 		bpf_map_free_rcu_gp(rcu);
917 	else
918 		call_rcu(rcu, bpf_map_free_rcu_gp);
919 }
920 
921 /* decrement map refcnt and schedule it for freeing via workqueue
922  * (underlying map implementation ops->map_free() might sleep)
923  */
924 void bpf_map_put(struct bpf_map *map)
925 {
926 	if (atomic64_dec_and_test(&map->refcnt)) {
927 		/* bpf_map_free_id() must be called first */
928 		bpf_map_free_id(map);
929 
930 		WARN_ON_ONCE(atomic64_read(&map->sleepable_refcnt));
931 		if (READ_ONCE(map->free_after_mult_rcu_gp))
932 			call_rcu_tasks_trace(&map->rcu, bpf_map_free_mult_rcu_gp);
933 		else if (READ_ONCE(map->free_after_rcu_gp))
934 			call_rcu(&map->rcu, bpf_map_free_rcu_gp);
935 		else
936 			bpf_map_free_in_work(map);
937 	}
938 }
939 EXPORT_SYMBOL_GPL(bpf_map_put);
940 
941 void bpf_map_put_with_uref(struct bpf_map *map)
942 {
943 	bpf_map_put_uref(map);
944 	bpf_map_put(map);
945 }
946 
947 static int bpf_map_release(struct inode *inode, struct file *filp)
948 {
949 	struct bpf_map *map = filp->private_data;
950 
951 	if (map->ops->map_release)
952 		map->ops->map_release(map, filp);
953 
954 	bpf_map_put_with_uref(map);
955 	return 0;
956 }
957 
958 static fmode_t map_get_sys_perms(struct bpf_map *map, struct fd f)
959 {
960 	fmode_t mode = fd_file(f)->f_mode;
961 
962 	/* Our file permissions may have been overridden by global
963 	 * map permissions facing syscall side.
964 	 */
965 	if (READ_ONCE(map->frozen))
966 		mode &= ~FMODE_CAN_WRITE;
967 	return mode;
968 }
969 
970 #ifdef CONFIG_PROC_FS
971 /* Show the memory usage of a bpf map */
972 static u64 bpf_map_memory_usage(const struct bpf_map *map)
973 {
974 	return map->ops->map_mem_usage(map);
975 }
976 
977 static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
978 {
979 	struct bpf_map *map = filp->private_data;
980 	u32 type = 0, jited = 0;
981 
982 	if (map_type_contains_progs(map)) {
983 		spin_lock(&map->owner.lock);
984 		type  = map->owner.type;
985 		jited = map->owner.jited;
986 		spin_unlock(&map->owner.lock);
987 	}
988 
989 	seq_printf(m,
990 		   "map_type:\t%u\n"
991 		   "key_size:\t%u\n"
992 		   "value_size:\t%u\n"
993 		   "max_entries:\t%u\n"
994 		   "map_flags:\t%#x\n"
995 		   "map_extra:\t%#llx\n"
996 		   "memlock:\t%llu\n"
997 		   "map_id:\t%u\n"
998 		   "frozen:\t%u\n",
999 		   map->map_type,
1000 		   map->key_size,
1001 		   map->value_size,
1002 		   map->max_entries,
1003 		   map->map_flags,
1004 		   (unsigned long long)map->map_extra,
1005 		   bpf_map_memory_usage(map),
1006 		   map->id,
1007 		   READ_ONCE(map->frozen));
1008 	if (type) {
1009 		seq_printf(m, "owner_prog_type:\t%u\n", type);
1010 		seq_printf(m, "owner_jited:\t%u\n", jited);
1011 	}
1012 }
1013 #endif
1014 
1015 static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
1016 			      loff_t *ppos)
1017 {
1018 	/* We need this handler such that alloc_file() enables
1019 	 * f_mode with FMODE_CAN_READ.
1020 	 */
1021 	return -EINVAL;
1022 }
1023 
1024 static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
1025 			       size_t siz, loff_t *ppos)
1026 {
1027 	/* We need this handler such that alloc_file() enables
1028 	 * f_mode with FMODE_CAN_WRITE.
1029 	 */
1030 	return -EINVAL;
1031 }
1032 
1033 /* called for any extra memory-mapped regions (except initial) */
1034 static void bpf_map_mmap_open(struct vm_area_struct *vma)
1035 {
1036 	struct bpf_map *map = vma->vm_file->private_data;
1037 
1038 	if (vma->vm_flags & VM_MAYWRITE)
1039 		bpf_map_write_active_inc(map);
1040 }
1041 
1042 /* called for all unmapped memory region (including initial) */
1043 static void bpf_map_mmap_close(struct vm_area_struct *vma)
1044 {
1045 	struct bpf_map *map = vma->vm_file->private_data;
1046 
1047 	if (vma->vm_flags & VM_MAYWRITE)
1048 		bpf_map_write_active_dec(map);
1049 }
1050 
1051 static const struct vm_operations_struct bpf_map_default_vmops = {
1052 	.open		= bpf_map_mmap_open,
1053 	.close		= bpf_map_mmap_close,
1054 };
1055 
1056 static int bpf_map_mmap(struct file *filp, struct vm_area_struct *vma)
1057 {
1058 	struct bpf_map *map = filp->private_data;
1059 	int err = 0;
1060 
1061 	if (!map->ops->map_mmap || !IS_ERR_OR_NULL(map->record))
1062 		return -ENOTSUPP;
1063 
1064 	if (!(vma->vm_flags & VM_SHARED))
1065 		return -EINVAL;
1066 
1067 	mutex_lock(&map->freeze_mutex);
1068 
1069 	if (vma->vm_flags & VM_WRITE) {
1070 		if (map->frozen) {
1071 			err = -EPERM;
1072 			goto out;
1073 		}
1074 		/* map is meant to be read-only, so do not allow mapping as
1075 		 * writable, because it's possible to leak a writable page
1076 		 * reference and allows user-space to still modify it after
1077 		 * freezing, while verifier will assume contents do not change
1078 		 */
1079 		if (map->map_flags & BPF_F_RDONLY_PROG) {
1080 			err = -EACCES;
1081 			goto out;
1082 		}
1083 		bpf_map_write_active_inc(map);
1084 	}
1085 out:
1086 	mutex_unlock(&map->freeze_mutex);
1087 	if (err)
1088 		return err;
1089 
1090 	/* set default open/close callbacks */
1091 	vma->vm_ops = &bpf_map_default_vmops;
1092 	vma->vm_private_data = map;
1093 	vm_flags_clear(vma, VM_MAYEXEC);
1094 	/* If mapping is read-only, then disallow potentially re-mapping with
1095 	 * PROT_WRITE by dropping VM_MAYWRITE flag. This VM_MAYWRITE clearing
1096 	 * means that as far as BPF map's memory-mapped VMAs are concerned,
1097 	 * VM_WRITE and VM_MAYWRITE and equivalent, if one of them is set,
1098 	 * both should be set, so we can forget about VM_MAYWRITE and always
1099 	 * check just VM_WRITE
1100 	 */
1101 	if (!(vma->vm_flags & VM_WRITE))
1102 		vm_flags_clear(vma, VM_MAYWRITE);
1103 
1104 	err = map->ops->map_mmap(map, vma);
1105 	if (err) {
1106 		if (vma->vm_flags & VM_WRITE)
1107 			bpf_map_write_active_dec(map);
1108 	}
1109 
1110 	return err;
1111 }
1112 
1113 static __poll_t bpf_map_poll(struct file *filp, struct poll_table_struct *pts)
1114 {
1115 	struct bpf_map *map = filp->private_data;
1116 
1117 	if (map->ops->map_poll)
1118 		return map->ops->map_poll(map, filp, pts);
1119 
1120 	return EPOLLERR;
1121 }
1122 
1123 static unsigned long bpf_get_unmapped_area(struct file *filp, unsigned long addr,
1124 					   unsigned long len, unsigned long pgoff,
1125 					   unsigned long flags)
1126 {
1127 	struct bpf_map *map = filp->private_data;
1128 
1129 	if (map->ops->map_get_unmapped_area)
1130 		return map->ops->map_get_unmapped_area(filp, addr, len, pgoff, flags);
1131 #ifdef CONFIG_MMU
1132 	return mm_get_unmapped_area(current->mm, filp, addr, len, pgoff, flags);
1133 #else
1134 	return addr;
1135 #endif
1136 }
1137 
1138 const struct file_operations bpf_map_fops = {
1139 #ifdef CONFIG_PROC_FS
1140 	.show_fdinfo	= bpf_map_show_fdinfo,
1141 #endif
1142 	.release	= bpf_map_release,
1143 	.read		= bpf_dummy_read,
1144 	.write		= bpf_dummy_write,
1145 	.mmap		= bpf_map_mmap,
1146 	.poll		= bpf_map_poll,
1147 	.get_unmapped_area = bpf_get_unmapped_area,
1148 };
1149 
1150 int bpf_map_new_fd(struct bpf_map *map, int flags)
1151 {
1152 	int ret;
1153 
1154 	ret = security_bpf_map(map, OPEN_FMODE(flags));
1155 	if (ret < 0)
1156 		return ret;
1157 
1158 	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
1159 				flags | O_CLOEXEC);
1160 }
1161 
1162 int bpf_get_file_flag(int flags)
1163 {
1164 	if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
1165 		return -EINVAL;
1166 	if (flags & BPF_F_RDONLY)
1167 		return O_RDONLY;
1168 	if (flags & BPF_F_WRONLY)
1169 		return O_WRONLY;
1170 	return O_RDWR;
1171 }
1172 
1173 /* helper macro to check that unused fields 'union bpf_attr' are zero */
1174 #define CHECK_ATTR(CMD) \
1175 	memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
1176 		   sizeof(attr->CMD##_LAST_FIELD), 0, \
1177 		   sizeof(*attr) - \
1178 		   offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
1179 		   sizeof(attr->CMD##_LAST_FIELD)) != NULL
1180 
1181 /* dst and src must have at least "size" number of bytes.
1182  * Return strlen on success and < 0 on error.
1183  */
1184 int bpf_obj_name_cpy(char *dst, const char *src, unsigned int size)
1185 {
1186 	const char *end = src + size;
1187 	const char *orig_src = src;
1188 
1189 	memset(dst, 0, size);
1190 	/* Copy all isalnum(), '_' and '.' chars. */
1191 	while (src < end && *src) {
1192 		if (!isalnum(*src) &&
1193 		    *src != '_' && *src != '.')
1194 			return -EINVAL;
1195 		*dst++ = *src++;
1196 	}
1197 
1198 	/* No '\0' found in "size" number of bytes */
1199 	if (src == end)
1200 		return -EINVAL;
1201 
1202 	return src - orig_src;
1203 }
1204 
1205 int map_check_no_btf(const struct bpf_map *map,
1206 		     const struct btf *btf,
1207 		     const struct btf_type *key_type,
1208 		     const struct btf_type *value_type)
1209 {
1210 	return -ENOTSUPP;
1211 }
1212 
1213 static int map_check_btf(struct bpf_map *map, struct bpf_token *token,
1214 			 const struct btf *btf, u32 btf_key_id, u32 btf_value_id)
1215 {
1216 	const struct btf_type *key_type, *value_type;
1217 	u32 key_size, value_size;
1218 	int ret = 0;
1219 
1220 	/* Some maps allow key to be unspecified. */
1221 	if (btf_key_id) {
1222 		key_type = btf_type_id_size(btf, &btf_key_id, &key_size);
1223 		if (!key_type || key_size != map->key_size)
1224 			return -EINVAL;
1225 	} else {
1226 		key_type = btf_type_by_id(btf, 0);
1227 		if (!map->ops->map_check_btf)
1228 			return -EINVAL;
1229 	}
1230 
1231 	value_type = btf_type_id_size(btf, &btf_value_id, &value_size);
1232 	if (!value_type || value_size != map->value_size)
1233 		return -EINVAL;
1234 
1235 	map->record = btf_parse_fields(btf, value_type,
1236 				       BPF_SPIN_LOCK | BPF_RES_SPIN_LOCK | BPF_TIMER | BPF_KPTR | BPF_LIST_HEAD |
1237 				       BPF_RB_ROOT | BPF_REFCOUNT | BPF_WORKQUEUE | BPF_UPTR,
1238 				       map->value_size);
1239 	if (!IS_ERR_OR_NULL(map->record)) {
1240 		int i;
1241 
1242 		if (!bpf_token_capable(token, CAP_BPF)) {
1243 			ret = -EPERM;
1244 			goto free_map_tab;
1245 		}
1246 		if (map->map_flags & (BPF_F_RDONLY_PROG | BPF_F_WRONLY_PROG)) {
1247 			ret = -EACCES;
1248 			goto free_map_tab;
1249 		}
1250 		for (i = 0; i < sizeof(map->record->field_mask) * 8; i++) {
1251 			switch (map->record->field_mask & (1 << i)) {
1252 			case 0:
1253 				continue;
1254 			case BPF_SPIN_LOCK:
1255 			case BPF_RES_SPIN_LOCK:
1256 				if (map->map_type != BPF_MAP_TYPE_HASH &&
1257 				    map->map_type != BPF_MAP_TYPE_ARRAY &&
1258 				    map->map_type != BPF_MAP_TYPE_CGROUP_STORAGE &&
1259 				    map->map_type != BPF_MAP_TYPE_SK_STORAGE &&
1260 				    map->map_type != BPF_MAP_TYPE_INODE_STORAGE &&
1261 				    map->map_type != BPF_MAP_TYPE_TASK_STORAGE &&
1262 				    map->map_type != BPF_MAP_TYPE_CGRP_STORAGE) {
1263 					ret = -EOPNOTSUPP;
1264 					goto free_map_tab;
1265 				}
1266 				break;
1267 			case BPF_TIMER:
1268 			case BPF_WORKQUEUE:
1269 				if (map->map_type != BPF_MAP_TYPE_HASH &&
1270 				    map->map_type != BPF_MAP_TYPE_LRU_HASH &&
1271 				    map->map_type != BPF_MAP_TYPE_ARRAY) {
1272 					ret = -EOPNOTSUPP;
1273 					goto free_map_tab;
1274 				}
1275 				break;
1276 			case BPF_KPTR_UNREF:
1277 			case BPF_KPTR_REF:
1278 			case BPF_KPTR_PERCPU:
1279 			case BPF_REFCOUNT:
1280 				if (map->map_type != BPF_MAP_TYPE_HASH &&
1281 				    map->map_type != BPF_MAP_TYPE_PERCPU_HASH &&
1282 				    map->map_type != BPF_MAP_TYPE_LRU_HASH &&
1283 				    map->map_type != BPF_MAP_TYPE_LRU_PERCPU_HASH &&
1284 				    map->map_type != BPF_MAP_TYPE_ARRAY &&
1285 				    map->map_type != BPF_MAP_TYPE_PERCPU_ARRAY &&
1286 				    map->map_type != BPF_MAP_TYPE_SK_STORAGE &&
1287 				    map->map_type != BPF_MAP_TYPE_INODE_STORAGE &&
1288 				    map->map_type != BPF_MAP_TYPE_TASK_STORAGE &&
1289 				    map->map_type != BPF_MAP_TYPE_CGRP_STORAGE) {
1290 					ret = -EOPNOTSUPP;
1291 					goto free_map_tab;
1292 				}
1293 				break;
1294 			case BPF_UPTR:
1295 				if (map->map_type != BPF_MAP_TYPE_TASK_STORAGE) {
1296 					ret = -EOPNOTSUPP;
1297 					goto free_map_tab;
1298 				}
1299 				break;
1300 			case BPF_LIST_HEAD:
1301 			case BPF_RB_ROOT:
1302 				if (map->map_type != BPF_MAP_TYPE_HASH &&
1303 				    map->map_type != BPF_MAP_TYPE_LRU_HASH &&
1304 				    map->map_type != BPF_MAP_TYPE_ARRAY) {
1305 					ret = -EOPNOTSUPP;
1306 					goto free_map_tab;
1307 				}
1308 				break;
1309 			default:
1310 				/* Fail if map_type checks are missing for a field type */
1311 				ret = -EOPNOTSUPP;
1312 				goto free_map_tab;
1313 			}
1314 		}
1315 	}
1316 
1317 	ret = btf_check_and_fixup_fields(btf, map->record);
1318 	if (ret < 0)
1319 		goto free_map_tab;
1320 
1321 	if (map->ops->map_check_btf) {
1322 		ret = map->ops->map_check_btf(map, btf, key_type, value_type);
1323 		if (ret < 0)
1324 			goto free_map_tab;
1325 	}
1326 
1327 	return ret;
1328 free_map_tab:
1329 	bpf_map_free_record(map);
1330 	return ret;
1331 }
1332 
1333 static bool bpf_net_capable(void)
1334 {
1335 	return capable(CAP_NET_ADMIN) || capable(CAP_SYS_ADMIN);
1336 }
1337 
1338 #define BPF_MAP_CREATE_LAST_FIELD map_token_fd
1339 /* called via syscall */
1340 static int map_create(union bpf_attr *attr, bool kernel)
1341 {
1342 	const struct bpf_map_ops *ops;
1343 	struct bpf_token *token = NULL;
1344 	int numa_node = bpf_map_attr_numa_node(attr);
1345 	u32 map_type = attr->map_type;
1346 	struct bpf_map *map;
1347 	bool token_flag;
1348 	int f_flags;
1349 	int err;
1350 
1351 	err = CHECK_ATTR(BPF_MAP_CREATE);
1352 	if (err)
1353 		return -EINVAL;
1354 
1355 	/* check BPF_F_TOKEN_FD flag, remember if it's set, and then clear it
1356 	 * to avoid per-map type checks tripping on unknown flag
1357 	 */
1358 	token_flag = attr->map_flags & BPF_F_TOKEN_FD;
1359 	attr->map_flags &= ~BPF_F_TOKEN_FD;
1360 
1361 	if (attr->btf_vmlinux_value_type_id) {
1362 		if (attr->map_type != BPF_MAP_TYPE_STRUCT_OPS ||
1363 		    attr->btf_key_type_id || attr->btf_value_type_id)
1364 			return -EINVAL;
1365 	} else if (attr->btf_key_type_id && !attr->btf_value_type_id) {
1366 		return -EINVAL;
1367 	}
1368 
1369 	if (attr->map_type != BPF_MAP_TYPE_BLOOM_FILTER &&
1370 	    attr->map_type != BPF_MAP_TYPE_ARENA &&
1371 	    attr->map_extra != 0)
1372 		return -EINVAL;
1373 
1374 	f_flags = bpf_get_file_flag(attr->map_flags);
1375 	if (f_flags < 0)
1376 		return f_flags;
1377 
1378 	if (numa_node != NUMA_NO_NODE &&
1379 	    ((unsigned int)numa_node >= nr_node_ids ||
1380 	     !node_online(numa_node)))
1381 		return -EINVAL;
1382 
1383 	/* find map type and init map: hashtable vs rbtree vs bloom vs ... */
1384 	map_type = attr->map_type;
1385 	if (map_type >= ARRAY_SIZE(bpf_map_types))
1386 		return -EINVAL;
1387 	map_type = array_index_nospec(map_type, ARRAY_SIZE(bpf_map_types));
1388 	ops = bpf_map_types[map_type];
1389 	if (!ops)
1390 		return -EINVAL;
1391 
1392 	if (ops->map_alloc_check) {
1393 		err = ops->map_alloc_check(attr);
1394 		if (err)
1395 			return err;
1396 	}
1397 	if (attr->map_ifindex)
1398 		ops = &bpf_map_offload_ops;
1399 	if (!ops->map_mem_usage)
1400 		return -EINVAL;
1401 
1402 	if (token_flag) {
1403 		token = bpf_token_get_from_fd(attr->map_token_fd);
1404 		if (IS_ERR(token))
1405 			return PTR_ERR(token);
1406 
1407 		/* if current token doesn't grant map creation permissions,
1408 		 * then we can't use this token, so ignore it and rely on
1409 		 * system-wide capabilities checks
1410 		 */
1411 		if (!bpf_token_allow_cmd(token, BPF_MAP_CREATE) ||
1412 		    !bpf_token_allow_map_type(token, attr->map_type)) {
1413 			bpf_token_put(token);
1414 			token = NULL;
1415 		}
1416 	}
1417 
1418 	err = -EPERM;
1419 
1420 	/* Intent here is for unprivileged_bpf_disabled to block BPF map
1421 	 * creation for unprivileged users; other actions depend
1422 	 * on fd availability and access to bpffs, so are dependent on
1423 	 * object creation success. Even with unprivileged BPF disabled,
1424 	 * capability checks are still carried out.
1425 	 */
1426 	if (sysctl_unprivileged_bpf_disabled && !bpf_token_capable(token, CAP_BPF))
1427 		goto put_token;
1428 
1429 	/* check privileged map type permissions */
1430 	switch (map_type) {
1431 	case BPF_MAP_TYPE_ARRAY:
1432 	case BPF_MAP_TYPE_PERCPU_ARRAY:
1433 	case BPF_MAP_TYPE_PROG_ARRAY:
1434 	case BPF_MAP_TYPE_PERF_EVENT_ARRAY:
1435 	case BPF_MAP_TYPE_CGROUP_ARRAY:
1436 	case BPF_MAP_TYPE_ARRAY_OF_MAPS:
1437 	case BPF_MAP_TYPE_HASH:
1438 	case BPF_MAP_TYPE_PERCPU_HASH:
1439 	case BPF_MAP_TYPE_HASH_OF_MAPS:
1440 	case BPF_MAP_TYPE_RINGBUF:
1441 	case BPF_MAP_TYPE_USER_RINGBUF:
1442 	case BPF_MAP_TYPE_CGROUP_STORAGE:
1443 	case BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE:
1444 		/* unprivileged */
1445 		break;
1446 	case BPF_MAP_TYPE_SK_STORAGE:
1447 	case BPF_MAP_TYPE_INODE_STORAGE:
1448 	case BPF_MAP_TYPE_TASK_STORAGE:
1449 	case BPF_MAP_TYPE_CGRP_STORAGE:
1450 	case BPF_MAP_TYPE_BLOOM_FILTER:
1451 	case BPF_MAP_TYPE_LPM_TRIE:
1452 	case BPF_MAP_TYPE_REUSEPORT_SOCKARRAY:
1453 	case BPF_MAP_TYPE_STACK_TRACE:
1454 	case BPF_MAP_TYPE_QUEUE:
1455 	case BPF_MAP_TYPE_STACK:
1456 	case BPF_MAP_TYPE_LRU_HASH:
1457 	case BPF_MAP_TYPE_LRU_PERCPU_HASH:
1458 	case BPF_MAP_TYPE_STRUCT_OPS:
1459 	case BPF_MAP_TYPE_CPUMAP:
1460 	case BPF_MAP_TYPE_ARENA:
1461 		if (!bpf_token_capable(token, CAP_BPF))
1462 			goto put_token;
1463 		break;
1464 	case BPF_MAP_TYPE_SOCKMAP:
1465 	case BPF_MAP_TYPE_SOCKHASH:
1466 	case BPF_MAP_TYPE_DEVMAP:
1467 	case BPF_MAP_TYPE_DEVMAP_HASH:
1468 	case BPF_MAP_TYPE_XSKMAP:
1469 		if (!bpf_token_capable(token, CAP_NET_ADMIN))
1470 			goto put_token;
1471 		break;
1472 	default:
1473 		WARN(1, "unsupported map type %d", map_type);
1474 		goto put_token;
1475 	}
1476 
1477 	map = ops->map_alloc(attr);
1478 	if (IS_ERR(map)) {
1479 		err = PTR_ERR(map);
1480 		goto put_token;
1481 	}
1482 	map->ops = ops;
1483 	map->map_type = map_type;
1484 
1485 	err = bpf_obj_name_cpy(map->name, attr->map_name,
1486 			       sizeof(attr->map_name));
1487 	if (err < 0)
1488 		goto free_map;
1489 
1490 	atomic64_set(&map->refcnt, 1);
1491 	atomic64_set(&map->usercnt, 1);
1492 	mutex_init(&map->freeze_mutex);
1493 	spin_lock_init(&map->owner.lock);
1494 
1495 	if (attr->btf_key_type_id || attr->btf_value_type_id ||
1496 	    /* Even the map's value is a kernel's struct,
1497 	     * the bpf_prog.o must have BTF to begin with
1498 	     * to figure out the corresponding kernel's
1499 	     * counter part.  Thus, attr->btf_fd has
1500 	     * to be valid also.
1501 	     */
1502 	    attr->btf_vmlinux_value_type_id) {
1503 		struct btf *btf;
1504 
1505 		btf = btf_get_by_fd(attr->btf_fd);
1506 		if (IS_ERR(btf)) {
1507 			err = PTR_ERR(btf);
1508 			goto free_map;
1509 		}
1510 		if (btf_is_kernel(btf)) {
1511 			btf_put(btf);
1512 			err = -EACCES;
1513 			goto free_map;
1514 		}
1515 		map->btf = btf;
1516 
1517 		if (attr->btf_value_type_id) {
1518 			err = map_check_btf(map, token, btf, attr->btf_key_type_id,
1519 					    attr->btf_value_type_id);
1520 			if (err)
1521 				goto free_map;
1522 		}
1523 
1524 		map->btf_key_type_id = attr->btf_key_type_id;
1525 		map->btf_value_type_id = attr->btf_value_type_id;
1526 		map->btf_vmlinux_value_type_id =
1527 			attr->btf_vmlinux_value_type_id;
1528 	}
1529 
1530 	err = security_bpf_map_create(map, attr, token, kernel);
1531 	if (err)
1532 		goto free_map_sec;
1533 
1534 	err = bpf_map_alloc_id(map);
1535 	if (err)
1536 		goto free_map_sec;
1537 
1538 	bpf_map_save_memcg(map);
1539 	bpf_token_put(token);
1540 
1541 	err = bpf_map_new_fd(map, f_flags);
1542 	if (err < 0) {
1543 		/* failed to allocate fd.
1544 		 * bpf_map_put_with_uref() is needed because the above
1545 		 * bpf_map_alloc_id() has published the map
1546 		 * to the userspace and the userspace may
1547 		 * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
1548 		 */
1549 		bpf_map_put_with_uref(map);
1550 		return err;
1551 	}
1552 
1553 	return err;
1554 
1555 free_map_sec:
1556 	security_bpf_map_free(map);
1557 free_map:
1558 	bpf_map_free(map);
1559 put_token:
1560 	bpf_token_put(token);
1561 	return err;
1562 }
1563 
1564 void bpf_map_inc(struct bpf_map *map)
1565 {
1566 	atomic64_inc(&map->refcnt);
1567 }
1568 EXPORT_SYMBOL_GPL(bpf_map_inc);
1569 
1570 void bpf_map_inc_with_uref(struct bpf_map *map)
1571 {
1572 	atomic64_inc(&map->refcnt);
1573 	atomic64_inc(&map->usercnt);
1574 }
1575 EXPORT_SYMBOL_GPL(bpf_map_inc_with_uref);
1576 
1577 struct bpf_map *bpf_map_get(u32 ufd)
1578 {
1579 	CLASS(fd, f)(ufd);
1580 	struct bpf_map *map = __bpf_map_get(f);
1581 
1582 	if (!IS_ERR(map))
1583 		bpf_map_inc(map);
1584 
1585 	return map;
1586 }
1587 EXPORT_SYMBOL_NS(bpf_map_get, "BPF_INTERNAL");
1588 
1589 struct bpf_map *bpf_map_get_with_uref(u32 ufd)
1590 {
1591 	CLASS(fd, f)(ufd);
1592 	struct bpf_map *map = __bpf_map_get(f);
1593 
1594 	if (!IS_ERR(map))
1595 		bpf_map_inc_with_uref(map);
1596 
1597 	return map;
1598 }
1599 
1600 /* map_idr_lock should have been held or the map should have been
1601  * protected by rcu read lock.
1602  */
1603 struct bpf_map *__bpf_map_inc_not_zero(struct bpf_map *map, bool uref)
1604 {
1605 	int refold;
1606 
1607 	refold = atomic64_fetch_add_unless(&map->refcnt, 1, 0);
1608 	if (!refold)
1609 		return ERR_PTR(-ENOENT);
1610 	if (uref)
1611 		atomic64_inc(&map->usercnt);
1612 
1613 	return map;
1614 }
1615 
1616 struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map)
1617 {
1618 	lockdep_assert(rcu_read_lock_held());
1619 	return __bpf_map_inc_not_zero(map, false);
1620 }
1621 EXPORT_SYMBOL_GPL(bpf_map_inc_not_zero);
1622 
1623 int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
1624 {
1625 	return -ENOTSUPP;
1626 }
1627 
1628 static void *__bpf_copy_key(void __user *ukey, u64 key_size)
1629 {
1630 	if (key_size)
1631 		return vmemdup_user(ukey, key_size);
1632 
1633 	if (ukey)
1634 		return ERR_PTR(-EINVAL);
1635 
1636 	return NULL;
1637 }
1638 
1639 static void *___bpf_copy_key(bpfptr_t ukey, u64 key_size)
1640 {
1641 	if (key_size)
1642 		return kvmemdup_bpfptr(ukey, key_size);
1643 
1644 	if (!bpfptr_is_null(ukey))
1645 		return ERR_PTR(-EINVAL);
1646 
1647 	return NULL;
1648 }
1649 
1650 /* last field in 'union bpf_attr' used by this command */
1651 #define BPF_MAP_LOOKUP_ELEM_LAST_FIELD flags
1652 
1653 static int map_lookup_elem(union bpf_attr *attr)
1654 {
1655 	void __user *ukey = u64_to_user_ptr(attr->key);
1656 	void __user *uvalue = u64_to_user_ptr(attr->value);
1657 	struct bpf_map *map;
1658 	void *key, *value;
1659 	u32 value_size;
1660 	int err;
1661 
1662 	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
1663 		return -EINVAL;
1664 
1665 	if (attr->flags & ~BPF_F_LOCK)
1666 		return -EINVAL;
1667 
1668 	CLASS(fd, f)(attr->map_fd);
1669 	map = __bpf_map_get(f);
1670 	if (IS_ERR(map))
1671 		return PTR_ERR(map);
1672 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ))
1673 		return -EPERM;
1674 
1675 	if ((attr->flags & BPF_F_LOCK) &&
1676 	    !btf_record_has_field(map->record, BPF_SPIN_LOCK))
1677 		return -EINVAL;
1678 
1679 	key = __bpf_copy_key(ukey, map->key_size);
1680 	if (IS_ERR(key))
1681 		return PTR_ERR(key);
1682 
1683 	value_size = bpf_map_value_size(map);
1684 
1685 	err = -ENOMEM;
1686 	value = kvmalloc(value_size, GFP_USER | __GFP_NOWARN);
1687 	if (!value)
1688 		goto free_key;
1689 
1690 	if (map->map_type == BPF_MAP_TYPE_BLOOM_FILTER) {
1691 		if (copy_from_user(value, uvalue, value_size))
1692 			err = -EFAULT;
1693 		else
1694 			err = bpf_map_copy_value(map, key, value, attr->flags);
1695 		goto free_value;
1696 	}
1697 
1698 	err = bpf_map_copy_value(map, key, value, attr->flags);
1699 	if (err)
1700 		goto free_value;
1701 
1702 	err = -EFAULT;
1703 	if (copy_to_user(uvalue, value, value_size) != 0)
1704 		goto free_value;
1705 
1706 	err = 0;
1707 
1708 free_value:
1709 	kvfree(value);
1710 free_key:
1711 	kvfree(key);
1712 	return err;
1713 }
1714 
1715 
1716 #define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
1717 
1718 static int map_update_elem(union bpf_attr *attr, bpfptr_t uattr)
1719 {
1720 	bpfptr_t ukey = make_bpfptr(attr->key, uattr.is_kernel);
1721 	bpfptr_t uvalue = make_bpfptr(attr->value, uattr.is_kernel);
1722 	struct bpf_map *map;
1723 	void *key, *value;
1724 	u32 value_size;
1725 	int err;
1726 
1727 	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
1728 		return -EINVAL;
1729 
1730 	CLASS(fd, f)(attr->map_fd);
1731 	map = __bpf_map_get(f);
1732 	if (IS_ERR(map))
1733 		return PTR_ERR(map);
1734 	bpf_map_write_active_inc(map);
1735 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1736 		err = -EPERM;
1737 		goto err_put;
1738 	}
1739 
1740 	if ((attr->flags & BPF_F_LOCK) &&
1741 	    !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1742 		err = -EINVAL;
1743 		goto err_put;
1744 	}
1745 
1746 	key = ___bpf_copy_key(ukey, map->key_size);
1747 	if (IS_ERR(key)) {
1748 		err = PTR_ERR(key);
1749 		goto err_put;
1750 	}
1751 
1752 	value_size = bpf_map_value_size(map);
1753 	value = kvmemdup_bpfptr(uvalue, value_size);
1754 	if (IS_ERR(value)) {
1755 		err = PTR_ERR(value);
1756 		goto free_key;
1757 	}
1758 
1759 	err = bpf_map_update_value(map, fd_file(f), key, value, attr->flags);
1760 	if (!err)
1761 		maybe_wait_bpf_programs(map);
1762 
1763 	kvfree(value);
1764 free_key:
1765 	kvfree(key);
1766 err_put:
1767 	bpf_map_write_active_dec(map);
1768 	return err;
1769 }
1770 
1771 #define BPF_MAP_DELETE_ELEM_LAST_FIELD key
1772 
1773 static int map_delete_elem(union bpf_attr *attr, bpfptr_t uattr)
1774 {
1775 	bpfptr_t ukey = make_bpfptr(attr->key, uattr.is_kernel);
1776 	struct bpf_map *map;
1777 	void *key;
1778 	int err;
1779 
1780 	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
1781 		return -EINVAL;
1782 
1783 	CLASS(fd, f)(attr->map_fd);
1784 	map = __bpf_map_get(f);
1785 	if (IS_ERR(map))
1786 		return PTR_ERR(map);
1787 	bpf_map_write_active_inc(map);
1788 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1789 		err = -EPERM;
1790 		goto err_put;
1791 	}
1792 
1793 	key = ___bpf_copy_key(ukey, map->key_size);
1794 	if (IS_ERR(key)) {
1795 		err = PTR_ERR(key);
1796 		goto err_put;
1797 	}
1798 
1799 	if (bpf_map_is_offloaded(map)) {
1800 		err = bpf_map_offload_delete_elem(map, key);
1801 		goto out;
1802 	} else if (IS_FD_PROG_ARRAY(map) ||
1803 		   map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
1804 		/* These maps require sleepable context */
1805 		err = map->ops->map_delete_elem(map, key);
1806 		goto out;
1807 	}
1808 
1809 	bpf_disable_instrumentation();
1810 	rcu_read_lock();
1811 	err = map->ops->map_delete_elem(map, key);
1812 	rcu_read_unlock();
1813 	bpf_enable_instrumentation();
1814 	if (!err)
1815 		maybe_wait_bpf_programs(map);
1816 out:
1817 	kvfree(key);
1818 err_put:
1819 	bpf_map_write_active_dec(map);
1820 	return err;
1821 }
1822 
1823 /* last field in 'union bpf_attr' used by this command */
1824 #define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
1825 
1826 static int map_get_next_key(union bpf_attr *attr)
1827 {
1828 	void __user *ukey = u64_to_user_ptr(attr->key);
1829 	void __user *unext_key = u64_to_user_ptr(attr->next_key);
1830 	struct bpf_map *map;
1831 	void *key, *next_key;
1832 	int err;
1833 
1834 	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
1835 		return -EINVAL;
1836 
1837 	CLASS(fd, f)(attr->map_fd);
1838 	map = __bpf_map_get(f);
1839 	if (IS_ERR(map))
1840 		return PTR_ERR(map);
1841 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ))
1842 		return -EPERM;
1843 
1844 	if (ukey) {
1845 		key = __bpf_copy_key(ukey, map->key_size);
1846 		if (IS_ERR(key))
1847 			return PTR_ERR(key);
1848 	} else {
1849 		key = NULL;
1850 	}
1851 
1852 	err = -ENOMEM;
1853 	next_key = kvmalloc(map->key_size, GFP_USER);
1854 	if (!next_key)
1855 		goto free_key;
1856 
1857 	if (bpf_map_is_offloaded(map)) {
1858 		err = bpf_map_offload_get_next_key(map, key, next_key);
1859 		goto out;
1860 	}
1861 
1862 	rcu_read_lock();
1863 	err = map->ops->map_get_next_key(map, key, next_key);
1864 	rcu_read_unlock();
1865 out:
1866 	if (err)
1867 		goto free_next_key;
1868 
1869 	err = -EFAULT;
1870 	if (copy_to_user(unext_key, next_key, map->key_size) != 0)
1871 		goto free_next_key;
1872 
1873 	err = 0;
1874 
1875 free_next_key:
1876 	kvfree(next_key);
1877 free_key:
1878 	kvfree(key);
1879 	return err;
1880 }
1881 
1882 int generic_map_delete_batch(struct bpf_map *map,
1883 			     const union bpf_attr *attr,
1884 			     union bpf_attr __user *uattr)
1885 {
1886 	void __user *keys = u64_to_user_ptr(attr->batch.keys);
1887 	u32 cp, max_count;
1888 	int err = 0;
1889 	void *key;
1890 
1891 	if (attr->batch.elem_flags & ~BPF_F_LOCK)
1892 		return -EINVAL;
1893 
1894 	if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1895 	    !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1896 		return -EINVAL;
1897 	}
1898 
1899 	max_count = attr->batch.count;
1900 	if (!max_count)
1901 		return 0;
1902 
1903 	if (put_user(0, &uattr->batch.count))
1904 		return -EFAULT;
1905 
1906 	key = kvmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1907 	if (!key)
1908 		return -ENOMEM;
1909 
1910 	for (cp = 0; cp < max_count; cp++) {
1911 		err = -EFAULT;
1912 		if (copy_from_user(key, keys + cp * map->key_size,
1913 				   map->key_size))
1914 			break;
1915 
1916 		if (bpf_map_is_offloaded(map)) {
1917 			err = bpf_map_offload_delete_elem(map, key);
1918 			break;
1919 		}
1920 
1921 		bpf_disable_instrumentation();
1922 		rcu_read_lock();
1923 		err = map->ops->map_delete_elem(map, key);
1924 		rcu_read_unlock();
1925 		bpf_enable_instrumentation();
1926 		if (err)
1927 			break;
1928 		cond_resched();
1929 	}
1930 	if (copy_to_user(&uattr->batch.count, &cp, sizeof(cp)))
1931 		err = -EFAULT;
1932 
1933 	kvfree(key);
1934 
1935 	return err;
1936 }
1937 
1938 int generic_map_update_batch(struct bpf_map *map, struct file *map_file,
1939 			     const union bpf_attr *attr,
1940 			     union bpf_attr __user *uattr)
1941 {
1942 	void __user *values = u64_to_user_ptr(attr->batch.values);
1943 	void __user *keys = u64_to_user_ptr(attr->batch.keys);
1944 	u32 value_size, cp, max_count;
1945 	void *key, *value;
1946 	int err = 0;
1947 
1948 	if (attr->batch.elem_flags & ~BPF_F_LOCK)
1949 		return -EINVAL;
1950 
1951 	if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1952 	    !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1953 		return -EINVAL;
1954 	}
1955 
1956 	value_size = bpf_map_value_size(map);
1957 
1958 	max_count = attr->batch.count;
1959 	if (!max_count)
1960 		return 0;
1961 
1962 	if (put_user(0, &uattr->batch.count))
1963 		return -EFAULT;
1964 
1965 	key = kvmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1966 	if (!key)
1967 		return -ENOMEM;
1968 
1969 	value = kvmalloc(value_size, GFP_USER | __GFP_NOWARN);
1970 	if (!value) {
1971 		kvfree(key);
1972 		return -ENOMEM;
1973 	}
1974 
1975 	for (cp = 0; cp < max_count; cp++) {
1976 		err = -EFAULT;
1977 		if (copy_from_user(key, keys + cp * map->key_size,
1978 		    map->key_size) ||
1979 		    copy_from_user(value, values + cp * value_size, value_size))
1980 			break;
1981 
1982 		err = bpf_map_update_value(map, map_file, key, value,
1983 					   attr->batch.elem_flags);
1984 
1985 		if (err)
1986 			break;
1987 		cond_resched();
1988 	}
1989 
1990 	if (copy_to_user(&uattr->batch.count, &cp, sizeof(cp)))
1991 		err = -EFAULT;
1992 
1993 	kvfree(value);
1994 	kvfree(key);
1995 
1996 	return err;
1997 }
1998 
1999 int generic_map_lookup_batch(struct bpf_map *map,
2000 				    const union bpf_attr *attr,
2001 				    union bpf_attr __user *uattr)
2002 {
2003 	void __user *uobatch = u64_to_user_ptr(attr->batch.out_batch);
2004 	void __user *ubatch = u64_to_user_ptr(attr->batch.in_batch);
2005 	void __user *values = u64_to_user_ptr(attr->batch.values);
2006 	void __user *keys = u64_to_user_ptr(attr->batch.keys);
2007 	void *buf, *buf_prevkey, *prev_key, *key, *value;
2008 	u32 value_size, cp, max_count;
2009 	int err;
2010 
2011 	if (attr->batch.elem_flags & ~BPF_F_LOCK)
2012 		return -EINVAL;
2013 
2014 	if ((attr->batch.elem_flags & BPF_F_LOCK) &&
2015 	    !btf_record_has_field(map->record, BPF_SPIN_LOCK))
2016 		return -EINVAL;
2017 
2018 	value_size = bpf_map_value_size(map);
2019 
2020 	max_count = attr->batch.count;
2021 	if (!max_count)
2022 		return 0;
2023 
2024 	if (put_user(0, &uattr->batch.count))
2025 		return -EFAULT;
2026 
2027 	buf_prevkey = kvmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
2028 	if (!buf_prevkey)
2029 		return -ENOMEM;
2030 
2031 	buf = kvmalloc(map->key_size + value_size, GFP_USER | __GFP_NOWARN);
2032 	if (!buf) {
2033 		kvfree(buf_prevkey);
2034 		return -ENOMEM;
2035 	}
2036 
2037 	err = -EFAULT;
2038 	prev_key = NULL;
2039 	if (ubatch && copy_from_user(buf_prevkey, ubatch, map->key_size))
2040 		goto free_buf;
2041 	key = buf;
2042 	value = key + map->key_size;
2043 	if (ubatch)
2044 		prev_key = buf_prevkey;
2045 
2046 	for (cp = 0; cp < max_count;) {
2047 		rcu_read_lock();
2048 		err = map->ops->map_get_next_key(map, prev_key, key);
2049 		rcu_read_unlock();
2050 		if (err)
2051 			break;
2052 		err = bpf_map_copy_value(map, key, value,
2053 					 attr->batch.elem_flags);
2054 
2055 		if (err == -ENOENT)
2056 			goto next_key;
2057 
2058 		if (err)
2059 			goto free_buf;
2060 
2061 		if (copy_to_user(keys + cp * map->key_size, key,
2062 				 map->key_size)) {
2063 			err = -EFAULT;
2064 			goto free_buf;
2065 		}
2066 		if (copy_to_user(values + cp * value_size, value, value_size)) {
2067 			err = -EFAULT;
2068 			goto free_buf;
2069 		}
2070 
2071 		cp++;
2072 next_key:
2073 		if (!prev_key)
2074 			prev_key = buf_prevkey;
2075 
2076 		swap(prev_key, key);
2077 		cond_resched();
2078 	}
2079 
2080 	if (err == -EFAULT)
2081 		goto free_buf;
2082 
2083 	if ((copy_to_user(&uattr->batch.count, &cp, sizeof(cp)) ||
2084 		    (cp && copy_to_user(uobatch, prev_key, map->key_size))))
2085 		err = -EFAULT;
2086 
2087 free_buf:
2088 	kvfree(buf_prevkey);
2089 	kvfree(buf);
2090 	return err;
2091 }
2092 
2093 #define BPF_MAP_LOOKUP_AND_DELETE_ELEM_LAST_FIELD flags
2094 
2095 static int map_lookup_and_delete_elem(union bpf_attr *attr)
2096 {
2097 	void __user *ukey = u64_to_user_ptr(attr->key);
2098 	void __user *uvalue = u64_to_user_ptr(attr->value);
2099 	struct bpf_map *map;
2100 	void *key, *value;
2101 	u32 value_size;
2102 	int err;
2103 
2104 	if (CHECK_ATTR(BPF_MAP_LOOKUP_AND_DELETE_ELEM))
2105 		return -EINVAL;
2106 
2107 	if (attr->flags & ~BPF_F_LOCK)
2108 		return -EINVAL;
2109 
2110 	CLASS(fd, f)(attr->map_fd);
2111 	map = __bpf_map_get(f);
2112 	if (IS_ERR(map))
2113 		return PTR_ERR(map);
2114 	bpf_map_write_active_inc(map);
2115 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ) ||
2116 	    !(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
2117 		err = -EPERM;
2118 		goto err_put;
2119 	}
2120 
2121 	if (attr->flags &&
2122 	    (map->map_type == BPF_MAP_TYPE_QUEUE ||
2123 	     map->map_type == BPF_MAP_TYPE_STACK)) {
2124 		err = -EINVAL;
2125 		goto err_put;
2126 	}
2127 
2128 	if ((attr->flags & BPF_F_LOCK) &&
2129 	    !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
2130 		err = -EINVAL;
2131 		goto err_put;
2132 	}
2133 
2134 	key = __bpf_copy_key(ukey, map->key_size);
2135 	if (IS_ERR(key)) {
2136 		err = PTR_ERR(key);
2137 		goto err_put;
2138 	}
2139 
2140 	value_size = bpf_map_value_size(map);
2141 
2142 	err = -ENOMEM;
2143 	value = kvmalloc(value_size, GFP_USER | __GFP_NOWARN);
2144 	if (!value)
2145 		goto free_key;
2146 
2147 	err = -ENOTSUPP;
2148 	if (map->map_type == BPF_MAP_TYPE_QUEUE ||
2149 	    map->map_type == BPF_MAP_TYPE_STACK) {
2150 		err = map->ops->map_pop_elem(map, value);
2151 	} else if (map->map_type == BPF_MAP_TYPE_HASH ||
2152 		   map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
2153 		   map->map_type == BPF_MAP_TYPE_LRU_HASH ||
2154 		   map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
2155 		if (!bpf_map_is_offloaded(map)) {
2156 			bpf_disable_instrumentation();
2157 			rcu_read_lock();
2158 			err = map->ops->map_lookup_and_delete_elem(map, key, value, attr->flags);
2159 			rcu_read_unlock();
2160 			bpf_enable_instrumentation();
2161 		}
2162 	}
2163 
2164 	if (err)
2165 		goto free_value;
2166 
2167 	if (copy_to_user(uvalue, value, value_size) != 0) {
2168 		err = -EFAULT;
2169 		goto free_value;
2170 	}
2171 
2172 	err = 0;
2173 
2174 free_value:
2175 	kvfree(value);
2176 free_key:
2177 	kvfree(key);
2178 err_put:
2179 	bpf_map_write_active_dec(map);
2180 	return err;
2181 }
2182 
2183 #define BPF_MAP_FREEZE_LAST_FIELD map_fd
2184 
2185 static int map_freeze(const union bpf_attr *attr)
2186 {
2187 	int err = 0;
2188 	struct bpf_map *map;
2189 
2190 	if (CHECK_ATTR(BPF_MAP_FREEZE))
2191 		return -EINVAL;
2192 
2193 	CLASS(fd, f)(attr->map_fd);
2194 	map = __bpf_map_get(f);
2195 	if (IS_ERR(map))
2196 		return PTR_ERR(map);
2197 
2198 	if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS || !IS_ERR_OR_NULL(map->record))
2199 		return -ENOTSUPP;
2200 
2201 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE))
2202 		return -EPERM;
2203 
2204 	mutex_lock(&map->freeze_mutex);
2205 	if (bpf_map_write_active(map)) {
2206 		err = -EBUSY;
2207 		goto err_put;
2208 	}
2209 	if (READ_ONCE(map->frozen)) {
2210 		err = -EBUSY;
2211 		goto err_put;
2212 	}
2213 
2214 	WRITE_ONCE(map->frozen, true);
2215 err_put:
2216 	mutex_unlock(&map->freeze_mutex);
2217 	return err;
2218 }
2219 
2220 static const struct bpf_prog_ops * const bpf_prog_types[] = {
2221 #define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type) \
2222 	[_id] = & _name ## _prog_ops,
2223 #define BPF_MAP_TYPE(_id, _ops)
2224 #define BPF_LINK_TYPE(_id, _name)
2225 #include <linux/bpf_types.h>
2226 #undef BPF_PROG_TYPE
2227 #undef BPF_MAP_TYPE
2228 #undef BPF_LINK_TYPE
2229 };
2230 
2231 static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
2232 {
2233 	const struct bpf_prog_ops *ops;
2234 
2235 	if (type >= ARRAY_SIZE(bpf_prog_types))
2236 		return -EINVAL;
2237 	type = array_index_nospec(type, ARRAY_SIZE(bpf_prog_types));
2238 	ops = bpf_prog_types[type];
2239 	if (!ops)
2240 		return -EINVAL;
2241 
2242 	if (!bpf_prog_is_offloaded(prog->aux))
2243 		prog->aux->ops = ops;
2244 	else
2245 		prog->aux->ops = &bpf_offload_prog_ops;
2246 	prog->type = type;
2247 	return 0;
2248 }
2249 
2250 enum bpf_audit {
2251 	BPF_AUDIT_LOAD,
2252 	BPF_AUDIT_UNLOAD,
2253 	BPF_AUDIT_MAX,
2254 };
2255 
2256 static const char * const bpf_audit_str[BPF_AUDIT_MAX] = {
2257 	[BPF_AUDIT_LOAD]   = "LOAD",
2258 	[BPF_AUDIT_UNLOAD] = "UNLOAD",
2259 };
2260 
2261 static void bpf_audit_prog(const struct bpf_prog *prog, unsigned int op)
2262 {
2263 	struct audit_context *ctx = NULL;
2264 	struct audit_buffer *ab;
2265 
2266 	if (WARN_ON_ONCE(op >= BPF_AUDIT_MAX))
2267 		return;
2268 	if (audit_enabled == AUDIT_OFF)
2269 		return;
2270 	if (!in_irq() && !irqs_disabled())
2271 		ctx = audit_context();
2272 	ab = audit_log_start(ctx, GFP_ATOMIC, AUDIT_BPF);
2273 	if (unlikely(!ab))
2274 		return;
2275 	audit_log_format(ab, "prog-id=%u op=%s",
2276 			 prog->aux->id, bpf_audit_str[op]);
2277 	audit_log_end(ab);
2278 }
2279 
2280 static int bpf_prog_alloc_id(struct bpf_prog *prog)
2281 {
2282 	int id;
2283 
2284 	idr_preload(GFP_KERNEL);
2285 	spin_lock_bh(&prog_idr_lock);
2286 	id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
2287 	if (id > 0)
2288 		prog->aux->id = id;
2289 	spin_unlock_bh(&prog_idr_lock);
2290 	idr_preload_end();
2291 
2292 	/* id is in [1, INT_MAX) */
2293 	if (WARN_ON_ONCE(!id))
2294 		return -ENOSPC;
2295 
2296 	return id > 0 ? 0 : id;
2297 }
2298 
2299 void bpf_prog_free_id(struct bpf_prog *prog)
2300 {
2301 	unsigned long flags;
2302 
2303 	/* cBPF to eBPF migrations are currently not in the idr store.
2304 	 * Offloaded programs are removed from the store when their device
2305 	 * disappears - even if someone grabs an fd to them they are unusable,
2306 	 * simply waiting for refcnt to drop to be freed.
2307 	 */
2308 	if (!prog->aux->id)
2309 		return;
2310 
2311 	spin_lock_irqsave(&prog_idr_lock, flags);
2312 	idr_remove(&prog_idr, prog->aux->id);
2313 	prog->aux->id = 0;
2314 	spin_unlock_irqrestore(&prog_idr_lock, flags);
2315 }
2316 
2317 static void __bpf_prog_put_rcu(struct rcu_head *rcu)
2318 {
2319 	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
2320 
2321 	kvfree(aux->func_info);
2322 	kfree(aux->func_info_aux);
2323 	free_uid(aux->user);
2324 	security_bpf_prog_free(aux->prog);
2325 	bpf_prog_free(aux->prog);
2326 }
2327 
2328 static void __bpf_prog_put_noref(struct bpf_prog *prog, bool deferred)
2329 {
2330 	bpf_prog_kallsyms_del_all(prog);
2331 	btf_put(prog->aux->btf);
2332 	module_put(prog->aux->mod);
2333 	kvfree(prog->aux->jited_linfo);
2334 	kvfree(prog->aux->linfo);
2335 	kfree(prog->aux->kfunc_tab);
2336 	kfree(prog->aux->ctx_arg_info);
2337 	if (prog->aux->attach_btf)
2338 		btf_put(prog->aux->attach_btf);
2339 
2340 	if (deferred) {
2341 		if (prog->sleepable)
2342 			call_rcu_tasks_trace(&prog->aux->rcu, __bpf_prog_put_rcu);
2343 		else
2344 			call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
2345 	} else {
2346 		__bpf_prog_put_rcu(&prog->aux->rcu);
2347 	}
2348 }
2349 
2350 static void bpf_prog_put_deferred(struct work_struct *work)
2351 {
2352 	struct bpf_prog_aux *aux;
2353 	struct bpf_prog *prog;
2354 
2355 	aux = container_of(work, struct bpf_prog_aux, work);
2356 	prog = aux->prog;
2357 	perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_UNLOAD, 0);
2358 	bpf_audit_prog(prog, BPF_AUDIT_UNLOAD);
2359 	bpf_prog_free_id(prog);
2360 	__bpf_prog_put_noref(prog, true);
2361 }
2362 
2363 static void __bpf_prog_put(struct bpf_prog *prog)
2364 {
2365 	struct bpf_prog_aux *aux = prog->aux;
2366 
2367 	if (atomic64_dec_and_test(&aux->refcnt)) {
2368 		if (in_irq() || irqs_disabled()) {
2369 			INIT_WORK(&aux->work, bpf_prog_put_deferred);
2370 			schedule_work(&aux->work);
2371 		} else {
2372 			bpf_prog_put_deferred(&aux->work);
2373 		}
2374 	}
2375 }
2376 
2377 void bpf_prog_put(struct bpf_prog *prog)
2378 {
2379 	__bpf_prog_put(prog);
2380 }
2381 EXPORT_SYMBOL_GPL(bpf_prog_put);
2382 
2383 static int bpf_prog_release(struct inode *inode, struct file *filp)
2384 {
2385 	struct bpf_prog *prog = filp->private_data;
2386 
2387 	bpf_prog_put(prog);
2388 	return 0;
2389 }
2390 
2391 struct bpf_prog_kstats {
2392 	u64 nsecs;
2393 	u64 cnt;
2394 	u64 misses;
2395 };
2396 
2397 void notrace bpf_prog_inc_misses_counter(struct bpf_prog *prog)
2398 {
2399 	struct bpf_prog_stats *stats;
2400 	unsigned int flags;
2401 
2402 	stats = this_cpu_ptr(prog->stats);
2403 	flags = u64_stats_update_begin_irqsave(&stats->syncp);
2404 	u64_stats_inc(&stats->misses);
2405 	u64_stats_update_end_irqrestore(&stats->syncp, flags);
2406 }
2407 
2408 static void bpf_prog_get_stats(const struct bpf_prog *prog,
2409 			       struct bpf_prog_kstats *stats)
2410 {
2411 	u64 nsecs = 0, cnt = 0, misses = 0;
2412 	int cpu;
2413 
2414 	for_each_possible_cpu(cpu) {
2415 		const struct bpf_prog_stats *st;
2416 		unsigned int start;
2417 		u64 tnsecs, tcnt, tmisses;
2418 
2419 		st = per_cpu_ptr(prog->stats, cpu);
2420 		do {
2421 			start = u64_stats_fetch_begin(&st->syncp);
2422 			tnsecs = u64_stats_read(&st->nsecs);
2423 			tcnt = u64_stats_read(&st->cnt);
2424 			tmisses = u64_stats_read(&st->misses);
2425 		} while (u64_stats_fetch_retry(&st->syncp, start));
2426 		nsecs += tnsecs;
2427 		cnt += tcnt;
2428 		misses += tmisses;
2429 	}
2430 	stats->nsecs = nsecs;
2431 	stats->cnt = cnt;
2432 	stats->misses = misses;
2433 }
2434 
2435 #ifdef CONFIG_PROC_FS
2436 static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
2437 {
2438 	const struct bpf_prog *prog = filp->private_data;
2439 	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
2440 	struct bpf_prog_kstats stats;
2441 
2442 	bpf_prog_get_stats(prog, &stats);
2443 	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
2444 	seq_printf(m,
2445 		   "prog_type:\t%u\n"
2446 		   "prog_jited:\t%u\n"
2447 		   "prog_tag:\t%s\n"
2448 		   "memlock:\t%llu\n"
2449 		   "prog_id:\t%u\n"
2450 		   "run_time_ns:\t%llu\n"
2451 		   "run_cnt:\t%llu\n"
2452 		   "recursion_misses:\t%llu\n"
2453 		   "verified_insns:\t%u\n",
2454 		   prog->type,
2455 		   prog->jited,
2456 		   prog_tag,
2457 		   prog->pages * 1ULL << PAGE_SHIFT,
2458 		   prog->aux->id,
2459 		   stats.nsecs,
2460 		   stats.cnt,
2461 		   stats.misses,
2462 		   prog->aux->verified_insns);
2463 }
2464 #endif
2465 
2466 const struct file_operations bpf_prog_fops = {
2467 #ifdef CONFIG_PROC_FS
2468 	.show_fdinfo	= bpf_prog_show_fdinfo,
2469 #endif
2470 	.release	= bpf_prog_release,
2471 	.read		= bpf_dummy_read,
2472 	.write		= bpf_dummy_write,
2473 };
2474 
2475 int bpf_prog_new_fd(struct bpf_prog *prog)
2476 {
2477 	int ret;
2478 
2479 	ret = security_bpf_prog(prog);
2480 	if (ret < 0)
2481 		return ret;
2482 
2483 	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
2484 				O_RDWR | O_CLOEXEC);
2485 }
2486 
2487 void bpf_prog_add(struct bpf_prog *prog, int i)
2488 {
2489 	atomic64_add(i, &prog->aux->refcnt);
2490 }
2491 EXPORT_SYMBOL_GPL(bpf_prog_add);
2492 
2493 void bpf_prog_sub(struct bpf_prog *prog, int i)
2494 {
2495 	/* Only to be used for undoing previous bpf_prog_add() in some
2496 	 * error path. We still know that another entity in our call
2497 	 * path holds a reference to the program, thus atomic_sub() can
2498 	 * be safely used in such cases!
2499 	 */
2500 	WARN_ON(atomic64_sub_return(i, &prog->aux->refcnt) == 0);
2501 }
2502 EXPORT_SYMBOL_GPL(bpf_prog_sub);
2503 
2504 void bpf_prog_inc(struct bpf_prog *prog)
2505 {
2506 	atomic64_inc(&prog->aux->refcnt);
2507 }
2508 EXPORT_SYMBOL_GPL(bpf_prog_inc);
2509 
2510 /* prog_idr_lock should have been held */
2511 struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
2512 {
2513 	int refold;
2514 
2515 	refold = atomic64_fetch_add_unless(&prog->aux->refcnt, 1, 0);
2516 
2517 	if (!refold)
2518 		return ERR_PTR(-ENOENT);
2519 
2520 	return prog;
2521 }
2522 EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
2523 
2524 bool bpf_prog_get_ok(struct bpf_prog *prog,
2525 			    enum bpf_prog_type *attach_type, bool attach_drv)
2526 {
2527 	/* not an attachment, just a refcount inc, always allow */
2528 	if (!attach_type)
2529 		return true;
2530 
2531 	if (prog->type != *attach_type)
2532 		return false;
2533 	if (bpf_prog_is_offloaded(prog->aux) && !attach_drv)
2534 		return false;
2535 
2536 	return true;
2537 }
2538 
2539 static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
2540 				       bool attach_drv)
2541 {
2542 	CLASS(fd, f)(ufd);
2543 	struct bpf_prog *prog;
2544 
2545 	if (fd_empty(f))
2546 		return ERR_PTR(-EBADF);
2547 	if (fd_file(f)->f_op != &bpf_prog_fops)
2548 		return ERR_PTR(-EINVAL);
2549 
2550 	prog = fd_file(f)->private_data;
2551 	if (!bpf_prog_get_ok(prog, attach_type, attach_drv))
2552 		return ERR_PTR(-EINVAL);
2553 
2554 	bpf_prog_inc(prog);
2555 	return prog;
2556 }
2557 
2558 struct bpf_prog *bpf_prog_get(u32 ufd)
2559 {
2560 	return __bpf_prog_get(ufd, NULL, false);
2561 }
2562 
2563 struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
2564 				       bool attach_drv)
2565 {
2566 	return __bpf_prog_get(ufd, &type, attach_drv);
2567 }
2568 EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
2569 
2570 /* Initially all BPF programs could be loaded w/o specifying
2571  * expected_attach_type. Later for some of them specifying expected_attach_type
2572  * at load time became required so that program could be validated properly.
2573  * Programs of types that are allowed to be loaded both w/ and w/o (for
2574  * backward compatibility) expected_attach_type, should have the default attach
2575  * type assigned to expected_attach_type for the latter case, so that it can be
2576  * validated later at attach time.
2577  *
2578  * bpf_prog_load_fixup_attach_type() sets expected_attach_type in @attr if
2579  * prog type requires it but has some attach types that have to be backward
2580  * compatible.
2581  */
2582 static void bpf_prog_load_fixup_attach_type(union bpf_attr *attr)
2583 {
2584 	switch (attr->prog_type) {
2585 	case BPF_PROG_TYPE_CGROUP_SOCK:
2586 		/* Unfortunately BPF_ATTACH_TYPE_UNSPEC enumeration doesn't
2587 		 * exist so checking for non-zero is the way to go here.
2588 		 */
2589 		if (!attr->expected_attach_type)
2590 			attr->expected_attach_type =
2591 				BPF_CGROUP_INET_SOCK_CREATE;
2592 		break;
2593 	case BPF_PROG_TYPE_SK_REUSEPORT:
2594 		if (!attr->expected_attach_type)
2595 			attr->expected_attach_type =
2596 				BPF_SK_REUSEPORT_SELECT;
2597 		break;
2598 	}
2599 }
2600 
2601 static int
2602 bpf_prog_load_check_attach(enum bpf_prog_type prog_type,
2603 			   enum bpf_attach_type expected_attach_type,
2604 			   struct btf *attach_btf, u32 btf_id,
2605 			   struct bpf_prog *dst_prog)
2606 {
2607 	if (btf_id) {
2608 		if (btf_id > BTF_MAX_TYPE)
2609 			return -EINVAL;
2610 
2611 		if (!attach_btf && !dst_prog)
2612 			return -EINVAL;
2613 
2614 		switch (prog_type) {
2615 		case BPF_PROG_TYPE_TRACING:
2616 		case BPF_PROG_TYPE_LSM:
2617 		case BPF_PROG_TYPE_STRUCT_OPS:
2618 		case BPF_PROG_TYPE_EXT:
2619 			break;
2620 		default:
2621 			return -EINVAL;
2622 		}
2623 	}
2624 
2625 	if (attach_btf && (!btf_id || dst_prog))
2626 		return -EINVAL;
2627 
2628 	if (dst_prog && prog_type != BPF_PROG_TYPE_TRACING &&
2629 	    prog_type != BPF_PROG_TYPE_EXT)
2630 		return -EINVAL;
2631 
2632 	switch (prog_type) {
2633 	case BPF_PROG_TYPE_CGROUP_SOCK:
2634 		switch (expected_attach_type) {
2635 		case BPF_CGROUP_INET_SOCK_CREATE:
2636 		case BPF_CGROUP_INET_SOCK_RELEASE:
2637 		case BPF_CGROUP_INET4_POST_BIND:
2638 		case BPF_CGROUP_INET6_POST_BIND:
2639 			return 0;
2640 		default:
2641 			return -EINVAL;
2642 		}
2643 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2644 		switch (expected_attach_type) {
2645 		case BPF_CGROUP_INET4_BIND:
2646 		case BPF_CGROUP_INET6_BIND:
2647 		case BPF_CGROUP_INET4_CONNECT:
2648 		case BPF_CGROUP_INET6_CONNECT:
2649 		case BPF_CGROUP_UNIX_CONNECT:
2650 		case BPF_CGROUP_INET4_GETPEERNAME:
2651 		case BPF_CGROUP_INET6_GETPEERNAME:
2652 		case BPF_CGROUP_UNIX_GETPEERNAME:
2653 		case BPF_CGROUP_INET4_GETSOCKNAME:
2654 		case BPF_CGROUP_INET6_GETSOCKNAME:
2655 		case BPF_CGROUP_UNIX_GETSOCKNAME:
2656 		case BPF_CGROUP_UDP4_SENDMSG:
2657 		case BPF_CGROUP_UDP6_SENDMSG:
2658 		case BPF_CGROUP_UNIX_SENDMSG:
2659 		case BPF_CGROUP_UDP4_RECVMSG:
2660 		case BPF_CGROUP_UDP6_RECVMSG:
2661 		case BPF_CGROUP_UNIX_RECVMSG:
2662 			return 0;
2663 		default:
2664 			return -EINVAL;
2665 		}
2666 	case BPF_PROG_TYPE_CGROUP_SKB:
2667 		switch (expected_attach_type) {
2668 		case BPF_CGROUP_INET_INGRESS:
2669 		case BPF_CGROUP_INET_EGRESS:
2670 			return 0;
2671 		default:
2672 			return -EINVAL;
2673 		}
2674 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2675 		switch (expected_attach_type) {
2676 		case BPF_CGROUP_SETSOCKOPT:
2677 		case BPF_CGROUP_GETSOCKOPT:
2678 			return 0;
2679 		default:
2680 			return -EINVAL;
2681 		}
2682 	case BPF_PROG_TYPE_SK_LOOKUP:
2683 		if (expected_attach_type == BPF_SK_LOOKUP)
2684 			return 0;
2685 		return -EINVAL;
2686 	case BPF_PROG_TYPE_SK_REUSEPORT:
2687 		switch (expected_attach_type) {
2688 		case BPF_SK_REUSEPORT_SELECT:
2689 		case BPF_SK_REUSEPORT_SELECT_OR_MIGRATE:
2690 			return 0;
2691 		default:
2692 			return -EINVAL;
2693 		}
2694 	case BPF_PROG_TYPE_NETFILTER:
2695 		if (expected_attach_type == BPF_NETFILTER)
2696 			return 0;
2697 		return -EINVAL;
2698 	case BPF_PROG_TYPE_SYSCALL:
2699 	case BPF_PROG_TYPE_EXT:
2700 		if (expected_attach_type)
2701 			return -EINVAL;
2702 		fallthrough;
2703 	default:
2704 		return 0;
2705 	}
2706 }
2707 
2708 static bool is_net_admin_prog_type(enum bpf_prog_type prog_type)
2709 {
2710 	switch (prog_type) {
2711 	case BPF_PROG_TYPE_SCHED_CLS:
2712 	case BPF_PROG_TYPE_SCHED_ACT:
2713 	case BPF_PROG_TYPE_XDP:
2714 	case BPF_PROG_TYPE_LWT_IN:
2715 	case BPF_PROG_TYPE_LWT_OUT:
2716 	case BPF_PROG_TYPE_LWT_XMIT:
2717 	case BPF_PROG_TYPE_LWT_SEG6LOCAL:
2718 	case BPF_PROG_TYPE_SK_SKB:
2719 	case BPF_PROG_TYPE_SK_MSG:
2720 	case BPF_PROG_TYPE_FLOW_DISSECTOR:
2721 	case BPF_PROG_TYPE_CGROUP_DEVICE:
2722 	case BPF_PROG_TYPE_CGROUP_SOCK:
2723 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2724 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2725 	case BPF_PROG_TYPE_CGROUP_SYSCTL:
2726 	case BPF_PROG_TYPE_SOCK_OPS:
2727 	case BPF_PROG_TYPE_EXT: /* extends any prog */
2728 	case BPF_PROG_TYPE_NETFILTER:
2729 		return true;
2730 	case BPF_PROG_TYPE_CGROUP_SKB:
2731 		/* always unpriv */
2732 	case BPF_PROG_TYPE_SK_REUSEPORT:
2733 		/* equivalent to SOCKET_FILTER. need CAP_BPF only */
2734 	default:
2735 		return false;
2736 	}
2737 }
2738 
2739 static bool is_perfmon_prog_type(enum bpf_prog_type prog_type)
2740 {
2741 	switch (prog_type) {
2742 	case BPF_PROG_TYPE_KPROBE:
2743 	case BPF_PROG_TYPE_TRACEPOINT:
2744 	case BPF_PROG_TYPE_PERF_EVENT:
2745 	case BPF_PROG_TYPE_RAW_TRACEPOINT:
2746 	case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
2747 	case BPF_PROG_TYPE_TRACING:
2748 	case BPF_PROG_TYPE_LSM:
2749 	case BPF_PROG_TYPE_STRUCT_OPS: /* has access to struct sock */
2750 	case BPF_PROG_TYPE_EXT: /* extends any prog */
2751 		return true;
2752 	default:
2753 		return false;
2754 	}
2755 }
2756 
2757 /* last field in 'union bpf_attr' used by this command */
2758 #define BPF_PROG_LOAD_LAST_FIELD fd_array_cnt
2759 
2760 static int bpf_prog_load(union bpf_attr *attr, bpfptr_t uattr, u32 uattr_size)
2761 {
2762 	enum bpf_prog_type type = attr->prog_type;
2763 	struct bpf_prog *prog, *dst_prog = NULL;
2764 	struct btf *attach_btf = NULL;
2765 	struct bpf_token *token = NULL;
2766 	bool bpf_cap;
2767 	int err;
2768 	char license[128];
2769 
2770 	if (CHECK_ATTR(BPF_PROG_LOAD))
2771 		return -EINVAL;
2772 
2773 	if (attr->prog_flags & ~(BPF_F_STRICT_ALIGNMENT |
2774 				 BPF_F_ANY_ALIGNMENT |
2775 				 BPF_F_TEST_STATE_FREQ |
2776 				 BPF_F_SLEEPABLE |
2777 				 BPF_F_TEST_RND_HI32 |
2778 				 BPF_F_XDP_HAS_FRAGS |
2779 				 BPF_F_XDP_DEV_BOUND_ONLY |
2780 				 BPF_F_TEST_REG_INVARIANTS |
2781 				 BPF_F_TOKEN_FD))
2782 		return -EINVAL;
2783 
2784 	bpf_prog_load_fixup_attach_type(attr);
2785 
2786 	if (attr->prog_flags & BPF_F_TOKEN_FD) {
2787 		token = bpf_token_get_from_fd(attr->prog_token_fd);
2788 		if (IS_ERR(token))
2789 			return PTR_ERR(token);
2790 		/* if current token doesn't grant prog loading permissions,
2791 		 * then we can't use this token, so ignore it and rely on
2792 		 * system-wide capabilities checks
2793 		 */
2794 		if (!bpf_token_allow_cmd(token, BPF_PROG_LOAD) ||
2795 		    !bpf_token_allow_prog_type(token, attr->prog_type,
2796 					       attr->expected_attach_type)) {
2797 			bpf_token_put(token);
2798 			token = NULL;
2799 		}
2800 	}
2801 
2802 	bpf_cap = bpf_token_capable(token, CAP_BPF);
2803 	err = -EPERM;
2804 
2805 	if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) &&
2806 	    (attr->prog_flags & BPF_F_ANY_ALIGNMENT) &&
2807 	    !bpf_cap)
2808 		goto put_token;
2809 
2810 	/* Intent here is for unprivileged_bpf_disabled to block BPF program
2811 	 * creation for unprivileged users; other actions depend
2812 	 * on fd availability and access to bpffs, so are dependent on
2813 	 * object creation success. Even with unprivileged BPF disabled,
2814 	 * capability checks are still carried out for these
2815 	 * and other operations.
2816 	 */
2817 	if (sysctl_unprivileged_bpf_disabled && !bpf_cap)
2818 		goto put_token;
2819 
2820 	if (attr->insn_cnt == 0 ||
2821 	    attr->insn_cnt > (bpf_cap ? BPF_COMPLEXITY_LIMIT_INSNS : BPF_MAXINSNS)) {
2822 		err = -E2BIG;
2823 		goto put_token;
2824 	}
2825 	if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
2826 	    type != BPF_PROG_TYPE_CGROUP_SKB &&
2827 	    !bpf_cap)
2828 		goto put_token;
2829 
2830 	if (is_net_admin_prog_type(type) && !bpf_token_capable(token, CAP_NET_ADMIN))
2831 		goto put_token;
2832 	if (is_perfmon_prog_type(type) && !bpf_token_capable(token, CAP_PERFMON))
2833 		goto put_token;
2834 
2835 	/* attach_prog_fd/attach_btf_obj_fd can specify fd of either bpf_prog
2836 	 * or btf, we need to check which one it is
2837 	 */
2838 	if (attr->attach_prog_fd) {
2839 		dst_prog = bpf_prog_get(attr->attach_prog_fd);
2840 		if (IS_ERR(dst_prog)) {
2841 			dst_prog = NULL;
2842 			attach_btf = btf_get_by_fd(attr->attach_btf_obj_fd);
2843 			if (IS_ERR(attach_btf)) {
2844 				err = -EINVAL;
2845 				goto put_token;
2846 			}
2847 			if (!btf_is_kernel(attach_btf)) {
2848 				/* attaching through specifying bpf_prog's BTF
2849 				 * objects directly might be supported eventually
2850 				 */
2851 				btf_put(attach_btf);
2852 				err = -ENOTSUPP;
2853 				goto put_token;
2854 			}
2855 		}
2856 	} else if (attr->attach_btf_id) {
2857 		/* fall back to vmlinux BTF, if BTF type ID is specified */
2858 		attach_btf = bpf_get_btf_vmlinux();
2859 		if (IS_ERR(attach_btf)) {
2860 			err = PTR_ERR(attach_btf);
2861 			goto put_token;
2862 		}
2863 		if (!attach_btf) {
2864 			err = -EINVAL;
2865 			goto put_token;
2866 		}
2867 		btf_get(attach_btf);
2868 	}
2869 
2870 	if (bpf_prog_load_check_attach(type, attr->expected_attach_type,
2871 				       attach_btf, attr->attach_btf_id,
2872 				       dst_prog)) {
2873 		if (dst_prog)
2874 			bpf_prog_put(dst_prog);
2875 		if (attach_btf)
2876 			btf_put(attach_btf);
2877 		err = -EINVAL;
2878 		goto put_token;
2879 	}
2880 
2881 	/* plain bpf_prog allocation */
2882 	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
2883 	if (!prog) {
2884 		if (dst_prog)
2885 			bpf_prog_put(dst_prog);
2886 		if (attach_btf)
2887 			btf_put(attach_btf);
2888 		err = -EINVAL;
2889 		goto put_token;
2890 	}
2891 
2892 	prog->expected_attach_type = attr->expected_attach_type;
2893 	prog->sleepable = !!(attr->prog_flags & BPF_F_SLEEPABLE);
2894 	prog->aux->attach_btf = attach_btf;
2895 	prog->aux->attach_btf_id = attr->attach_btf_id;
2896 	prog->aux->dst_prog = dst_prog;
2897 	prog->aux->dev_bound = !!attr->prog_ifindex;
2898 	prog->aux->xdp_has_frags = attr->prog_flags & BPF_F_XDP_HAS_FRAGS;
2899 
2900 	/* move token into prog->aux, reuse taken refcnt */
2901 	prog->aux->token = token;
2902 	token = NULL;
2903 
2904 	prog->aux->user = get_current_user();
2905 	prog->len = attr->insn_cnt;
2906 
2907 	err = -EFAULT;
2908 	if (copy_from_bpfptr(prog->insns,
2909 			     make_bpfptr(attr->insns, uattr.is_kernel),
2910 			     bpf_prog_insn_size(prog)) != 0)
2911 		goto free_prog;
2912 	/* copy eBPF program license from user space */
2913 	if (strncpy_from_bpfptr(license,
2914 				make_bpfptr(attr->license, uattr.is_kernel),
2915 				sizeof(license) - 1) < 0)
2916 		goto free_prog;
2917 	license[sizeof(license) - 1] = 0;
2918 
2919 	/* eBPF programs must be GPL compatible to use GPL-ed functions */
2920 	prog->gpl_compatible = license_is_gpl_compatible(license) ? 1 : 0;
2921 
2922 	prog->orig_prog = NULL;
2923 	prog->jited = 0;
2924 
2925 	atomic64_set(&prog->aux->refcnt, 1);
2926 
2927 	if (bpf_prog_is_dev_bound(prog->aux)) {
2928 		err = bpf_prog_dev_bound_init(prog, attr);
2929 		if (err)
2930 			goto free_prog;
2931 	}
2932 
2933 	if (type == BPF_PROG_TYPE_EXT && dst_prog &&
2934 	    bpf_prog_is_dev_bound(dst_prog->aux)) {
2935 		err = bpf_prog_dev_bound_inherit(prog, dst_prog);
2936 		if (err)
2937 			goto free_prog;
2938 	}
2939 
2940 	/*
2941 	 * Bookkeeping for managing the program attachment chain.
2942 	 *
2943 	 * It might be tempting to set attach_tracing_prog flag at the attachment
2944 	 * time, but this will not prevent from loading bunch of tracing prog
2945 	 * first, then attach them one to another.
2946 	 *
2947 	 * The flag attach_tracing_prog is set for the whole program lifecycle, and
2948 	 * doesn't have to be cleared in bpf_tracing_link_release, since tracing
2949 	 * programs cannot change attachment target.
2950 	 */
2951 	if (type == BPF_PROG_TYPE_TRACING && dst_prog &&
2952 	    dst_prog->type == BPF_PROG_TYPE_TRACING) {
2953 		prog->aux->attach_tracing_prog = true;
2954 	}
2955 
2956 	/* find program type: socket_filter vs tracing_filter */
2957 	err = find_prog_type(type, prog);
2958 	if (err < 0)
2959 		goto free_prog;
2960 
2961 	prog->aux->load_time = ktime_get_boottime_ns();
2962 	err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name,
2963 			       sizeof(attr->prog_name));
2964 	if (err < 0)
2965 		goto free_prog;
2966 
2967 	err = security_bpf_prog_load(prog, attr, token, uattr.is_kernel);
2968 	if (err)
2969 		goto free_prog_sec;
2970 
2971 	/* run eBPF verifier */
2972 	err = bpf_check(&prog, attr, uattr, uattr_size);
2973 	if (err < 0)
2974 		goto free_used_maps;
2975 
2976 	prog = bpf_prog_select_runtime(prog, &err);
2977 	if (err < 0)
2978 		goto free_used_maps;
2979 
2980 	err = bpf_prog_alloc_id(prog);
2981 	if (err)
2982 		goto free_used_maps;
2983 
2984 	/* Upon success of bpf_prog_alloc_id(), the BPF prog is
2985 	 * effectively publicly exposed. However, retrieving via
2986 	 * bpf_prog_get_fd_by_id() will take another reference,
2987 	 * therefore it cannot be gone underneath us.
2988 	 *
2989 	 * Only for the time /after/ successful bpf_prog_new_fd()
2990 	 * and before returning to userspace, we might just hold
2991 	 * one reference and any parallel close on that fd could
2992 	 * rip everything out. Hence, below notifications must
2993 	 * happen before bpf_prog_new_fd().
2994 	 *
2995 	 * Also, any failure handling from this point onwards must
2996 	 * be using bpf_prog_put() given the program is exposed.
2997 	 */
2998 	bpf_prog_kallsyms_add(prog);
2999 	perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_LOAD, 0);
3000 	bpf_audit_prog(prog, BPF_AUDIT_LOAD);
3001 
3002 	err = bpf_prog_new_fd(prog);
3003 	if (err < 0)
3004 		bpf_prog_put(prog);
3005 	return err;
3006 
3007 free_used_maps:
3008 	/* In case we have subprogs, we need to wait for a grace
3009 	 * period before we can tear down JIT memory since symbols
3010 	 * are already exposed under kallsyms.
3011 	 */
3012 	__bpf_prog_put_noref(prog, prog->aux->real_func_cnt);
3013 	return err;
3014 
3015 free_prog_sec:
3016 	security_bpf_prog_free(prog);
3017 free_prog:
3018 	free_uid(prog->aux->user);
3019 	if (prog->aux->attach_btf)
3020 		btf_put(prog->aux->attach_btf);
3021 	bpf_prog_free(prog);
3022 put_token:
3023 	bpf_token_put(token);
3024 	return err;
3025 }
3026 
3027 #define BPF_OBJ_LAST_FIELD path_fd
3028 
3029 static int bpf_obj_pin(const union bpf_attr *attr)
3030 {
3031 	int path_fd;
3032 
3033 	if (CHECK_ATTR(BPF_OBJ) || attr->file_flags & ~BPF_F_PATH_FD)
3034 		return -EINVAL;
3035 
3036 	/* path_fd has to be accompanied by BPF_F_PATH_FD flag */
3037 	if (!(attr->file_flags & BPF_F_PATH_FD) && attr->path_fd)
3038 		return -EINVAL;
3039 
3040 	path_fd = attr->file_flags & BPF_F_PATH_FD ? attr->path_fd : AT_FDCWD;
3041 	return bpf_obj_pin_user(attr->bpf_fd, path_fd,
3042 				u64_to_user_ptr(attr->pathname));
3043 }
3044 
3045 static int bpf_obj_get(const union bpf_attr *attr)
3046 {
3047 	int path_fd;
3048 
3049 	if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
3050 	    attr->file_flags & ~(BPF_OBJ_FLAG_MASK | BPF_F_PATH_FD))
3051 		return -EINVAL;
3052 
3053 	/* path_fd has to be accompanied by BPF_F_PATH_FD flag */
3054 	if (!(attr->file_flags & BPF_F_PATH_FD) && attr->path_fd)
3055 		return -EINVAL;
3056 
3057 	path_fd = attr->file_flags & BPF_F_PATH_FD ? attr->path_fd : AT_FDCWD;
3058 	return bpf_obj_get_user(path_fd, u64_to_user_ptr(attr->pathname),
3059 				attr->file_flags);
3060 }
3061 
3062 /* bpf_link_init_sleepable() allows to specify whether BPF link itself has
3063  * "sleepable" semantics, which normally would mean that BPF link's attach
3064  * hook can dereference link or link's underlying program for some time after
3065  * detachment due to RCU Tasks Trace-based lifetime protection scheme.
3066  * BPF program itself can be non-sleepable, yet, because it's transitively
3067  * reachable through BPF link, its freeing has to be delayed until after RCU
3068  * Tasks Trace GP.
3069  */
3070 void bpf_link_init_sleepable(struct bpf_link *link, enum bpf_link_type type,
3071 			     const struct bpf_link_ops *ops, struct bpf_prog *prog,
3072 			     enum bpf_attach_type attach_type, bool sleepable)
3073 {
3074 	WARN_ON(ops->dealloc && ops->dealloc_deferred);
3075 	atomic64_set(&link->refcnt, 1);
3076 	link->type = type;
3077 	link->sleepable = sleepable;
3078 	link->id = 0;
3079 	link->ops = ops;
3080 	link->prog = prog;
3081 	link->attach_type = attach_type;
3082 }
3083 
3084 void bpf_link_init(struct bpf_link *link, enum bpf_link_type type,
3085 		   const struct bpf_link_ops *ops, struct bpf_prog *prog,
3086 		   enum bpf_attach_type attach_type)
3087 {
3088 	bpf_link_init_sleepable(link, type, ops, prog, attach_type, false);
3089 }
3090 
3091 static void bpf_link_free_id(int id)
3092 {
3093 	if (!id)
3094 		return;
3095 
3096 	spin_lock_bh(&link_idr_lock);
3097 	idr_remove(&link_idr, id);
3098 	spin_unlock_bh(&link_idr_lock);
3099 }
3100 
3101 /* Clean up bpf_link and corresponding anon_inode file and FD. After
3102  * anon_inode is created, bpf_link can't be just kfree()'d due to deferred
3103  * anon_inode's release() call. This helper marks bpf_link as
3104  * defunct, releases anon_inode file and puts reserved FD. bpf_prog's refcnt
3105  * is not decremented, it's the responsibility of a calling code that failed
3106  * to complete bpf_link initialization.
3107  * This helper eventually calls link's dealloc callback, but does not call
3108  * link's release callback.
3109  */
3110 void bpf_link_cleanup(struct bpf_link_primer *primer)
3111 {
3112 	primer->link->prog = NULL;
3113 	bpf_link_free_id(primer->id);
3114 	fput(primer->file);
3115 	put_unused_fd(primer->fd);
3116 }
3117 
3118 void bpf_link_inc(struct bpf_link *link)
3119 {
3120 	atomic64_inc(&link->refcnt);
3121 }
3122 
3123 static void bpf_link_dealloc(struct bpf_link *link)
3124 {
3125 	/* now that we know that bpf_link itself can't be reached, put underlying BPF program */
3126 	if (link->prog)
3127 		bpf_prog_put(link->prog);
3128 
3129 	/* free bpf_link and its containing memory */
3130 	if (link->ops->dealloc_deferred)
3131 		link->ops->dealloc_deferred(link);
3132 	else
3133 		link->ops->dealloc(link);
3134 }
3135 
3136 static void bpf_link_defer_dealloc_rcu_gp(struct rcu_head *rcu)
3137 {
3138 	struct bpf_link *link = container_of(rcu, struct bpf_link, rcu);
3139 
3140 	bpf_link_dealloc(link);
3141 }
3142 
3143 static void bpf_link_defer_dealloc_mult_rcu_gp(struct rcu_head *rcu)
3144 {
3145 	if (rcu_trace_implies_rcu_gp())
3146 		bpf_link_defer_dealloc_rcu_gp(rcu);
3147 	else
3148 		call_rcu(rcu, bpf_link_defer_dealloc_rcu_gp);
3149 }
3150 
3151 /* bpf_link_free is guaranteed to be called from process context */
3152 static void bpf_link_free(struct bpf_link *link)
3153 {
3154 	const struct bpf_link_ops *ops = link->ops;
3155 
3156 	bpf_link_free_id(link->id);
3157 	/* detach BPF program, clean up used resources */
3158 	if (link->prog)
3159 		ops->release(link);
3160 	if (ops->dealloc_deferred) {
3161 		/* Schedule BPF link deallocation, which will only then
3162 		 * trigger putting BPF program refcount.
3163 		 * If underlying BPF program is sleepable or BPF link's target
3164 		 * attach hookpoint is sleepable or otherwise requires RCU GPs
3165 		 * to ensure link and its underlying BPF program is not
3166 		 * reachable anymore, we need to first wait for RCU tasks
3167 		 * trace sync, and then go through "classic" RCU grace period
3168 		 */
3169 		if (link->sleepable || (link->prog && link->prog->sleepable))
3170 			call_rcu_tasks_trace(&link->rcu, bpf_link_defer_dealloc_mult_rcu_gp);
3171 		else
3172 			call_rcu(&link->rcu, bpf_link_defer_dealloc_rcu_gp);
3173 	} else if (ops->dealloc) {
3174 		bpf_link_dealloc(link);
3175 	}
3176 }
3177 
3178 static void bpf_link_put_deferred(struct work_struct *work)
3179 {
3180 	struct bpf_link *link = container_of(work, struct bpf_link, work);
3181 
3182 	bpf_link_free(link);
3183 }
3184 
3185 /* bpf_link_put might be called from atomic context. It needs to be called
3186  * from sleepable context in order to acquire sleeping locks during the process.
3187  */
3188 void bpf_link_put(struct bpf_link *link)
3189 {
3190 	if (!atomic64_dec_and_test(&link->refcnt))
3191 		return;
3192 
3193 	INIT_WORK(&link->work, bpf_link_put_deferred);
3194 	schedule_work(&link->work);
3195 }
3196 EXPORT_SYMBOL(bpf_link_put);
3197 
3198 static void bpf_link_put_direct(struct bpf_link *link)
3199 {
3200 	if (!atomic64_dec_and_test(&link->refcnt))
3201 		return;
3202 	bpf_link_free(link);
3203 }
3204 
3205 static int bpf_link_release(struct inode *inode, struct file *filp)
3206 {
3207 	struct bpf_link *link = filp->private_data;
3208 
3209 	bpf_link_put_direct(link);
3210 	return 0;
3211 }
3212 
3213 #ifdef CONFIG_PROC_FS
3214 #define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type)
3215 #define BPF_MAP_TYPE(_id, _ops)
3216 #define BPF_LINK_TYPE(_id, _name) [_id] = #_name,
3217 static const char *bpf_link_type_strs[] = {
3218 	[BPF_LINK_TYPE_UNSPEC] = "<invalid>",
3219 #include <linux/bpf_types.h>
3220 };
3221 #undef BPF_PROG_TYPE
3222 #undef BPF_MAP_TYPE
3223 #undef BPF_LINK_TYPE
3224 
3225 static void bpf_link_show_fdinfo(struct seq_file *m, struct file *filp)
3226 {
3227 	const struct bpf_link *link = filp->private_data;
3228 	const struct bpf_prog *prog = link->prog;
3229 	enum bpf_link_type type = link->type;
3230 	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
3231 
3232 	if (type < ARRAY_SIZE(bpf_link_type_strs) && bpf_link_type_strs[type]) {
3233 		if (link->type == BPF_LINK_TYPE_KPROBE_MULTI)
3234 			seq_printf(m, "link_type:\t%s\n", link->flags == BPF_F_KPROBE_MULTI_RETURN ?
3235 				   "kretprobe_multi" : "kprobe_multi");
3236 		else if (link->type == BPF_LINK_TYPE_UPROBE_MULTI)
3237 			seq_printf(m, "link_type:\t%s\n", link->flags == BPF_F_UPROBE_MULTI_RETURN ?
3238 				   "uretprobe_multi" : "uprobe_multi");
3239 		else
3240 			seq_printf(m, "link_type:\t%s\n", bpf_link_type_strs[type]);
3241 	} else {
3242 		WARN_ONCE(1, "missing BPF_LINK_TYPE(...) for link type %u\n", type);
3243 		seq_printf(m, "link_type:\t<%u>\n", type);
3244 	}
3245 	seq_printf(m, "link_id:\t%u\n", link->id);
3246 
3247 	if (prog) {
3248 		bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
3249 		seq_printf(m,
3250 			   "prog_tag:\t%s\n"
3251 			   "prog_id:\t%u\n",
3252 			   prog_tag,
3253 			   prog->aux->id);
3254 	}
3255 	if (link->ops->show_fdinfo)
3256 		link->ops->show_fdinfo(link, m);
3257 }
3258 #endif
3259 
3260 static __poll_t bpf_link_poll(struct file *file, struct poll_table_struct *pts)
3261 {
3262 	struct bpf_link *link = file->private_data;
3263 
3264 	return link->ops->poll(file, pts);
3265 }
3266 
3267 static const struct file_operations bpf_link_fops = {
3268 #ifdef CONFIG_PROC_FS
3269 	.show_fdinfo	= bpf_link_show_fdinfo,
3270 #endif
3271 	.release	= bpf_link_release,
3272 	.read		= bpf_dummy_read,
3273 	.write		= bpf_dummy_write,
3274 };
3275 
3276 static const struct file_operations bpf_link_fops_poll = {
3277 #ifdef CONFIG_PROC_FS
3278 	.show_fdinfo	= bpf_link_show_fdinfo,
3279 #endif
3280 	.release	= bpf_link_release,
3281 	.read		= bpf_dummy_read,
3282 	.write		= bpf_dummy_write,
3283 	.poll		= bpf_link_poll,
3284 };
3285 
3286 static int bpf_link_alloc_id(struct bpf_link *link)
3287 {
3288 	int id;
3289 
3290 	idr_preload(GFP_KERNEL);
3291 	spin_lock_bh(&link_idr_lock);
3292 	id = idr_alloc_cyclic(&link_idr, link, 1, INT_MAX, GFP_ATOMIC);
3293 	spin_unlock_bh(&link_idr_lock);
3294 	idr_preload_end();
3295 
3296 	return id;
3297 }
3298 
3299 /* Prepare bpf_link to be exposed to user-space by allocating anon_inode file,
3300  * reserving unused FD and allocating ID from link_idr. This is to be paired
3301  * with bpf_link_settle() to install FD and ID and expose bpf_link to
3302  * user-space, if bpf_link is successfully attached. If not, bpf_link and
3303  * pre-allocated resources are to be freed with bpf_cleanup() call. All the
3304  * transient state is passed around in struct bpf_link_primer.
3305  * This is preferred way to create and initialize bpf_link, especially when
3306  * there are complicated and expensive operations in between creating bpf_link
3307  * itself and attaching it to BPF hook. By using bpf_link_prime() and
3308  * bpf_link_settle() kernel code using bpf_link doesn't have to perform
3309  * expensive (and potentially failing) roll back operations in a rare case
3310  * that file, FD, or ID can't be allocated.
3311  */
3312 int bpf_link_prime(struct bpf_link *link, struct bpf_link_primer *primer)
3313 {
3314 	struct file *file;
3315 	int fd, id;
3316 
3317 	fd = get_unused_fd_flags(O_CLOEXEC);
3318 	if (fd < 0)
3319 		return fd;
3320 
3321 
3322 	id = bpf_link_alloc_id(link);
3323 	if (id < 0) {
3324 		put_unused_fd(fd);
3325 		return id;
3326 	}
3327 
3328 	file = anon_inode_getfile("bpf_link",
3329 				  link->ops->poll ? &bpf_link_fops_poll : &bpf_link_fops,
3330 				  link, O_CLOEXEC);
3331 	if (IS_ERR(file)) {
3332 		bpf_link_free_id(id);
3333 		put_unused_fd(fd);
3334 		return PTR_ERR(file);
3335 	}
3336 
3337 	primer->link = link;
3338 	primer->file = file;
3339 	primer->fd = fd;
3340 	primer->id = id;
3341 	return 0;
3342 }
3343 
3344 int bpf_link_settle(struct bpf_link_primer *primer)
3345 {
3346 	/* make bpf_link fetchable by ID */
3347 	spin_lock_bh(&link_idr_lock);
3348 	primer->link->id = primer->id;
3349 	spin_unlock_bh(&link_idr_lock);
3350 	/* make bpf_link fetchable by FD */
3351 	fd_install(primer->fd, primer->file);
3352 	/* pass through installed FD */
3353 	return primer->fd;
3354 }
3355 
3356 int bpf_link_new_fd(struct bpf_link *link)
3357 {
3358 	return anon_inode_getfd("bpf-link",
3359 				link->ops->poll ? &bpf_link_fops_poll : &bpf_link_fops,
3360 				link, O_CLOEXEC);
3361 }
3362 
3363 struct bpf_link *bpf_link_get_from_fd(u32 ufd)
3364 {
3365 	CLASS(fd, f)(ufd);
3366 	struct bpf_link *link;
3367 
3368 	if (fd_empty(f))
3369 		return ERR_PTR(-EBADF);
3370 	if (fd_file(f)->f_op != &bpf_link_fops && fd_file(f)->f_op != &bpf_link_fops_poll)
3371 		return ERR_PTR(-EINVAL);
3372 
3373 	link = fd_file(f)->private_data;
3374 	bpf_link_inc(link);
3375 	return link;
3376 }
3377 EXPORT_SYMBOL_NS(bpf_link_get_from_fd, "BPF_INTERNAL");
3378 
3379 static void bpf_tracing_link_release(struct bpf_link *link)
3380 {
3381 	struct bpf_tracing_link *tr_link =
3382 		container_of(link, struct bpf_tracing_link, link.link);
3383 
3384 	WARN_ON_ONCE(bpf_trampoline_unlink_prog(&tr_link->link,
3385 						tr_link->trampoline,
3386 						tr_link->tgt_prog));
3387 
3388 	bpf_trampoline_put(tr_link->trampoline);
3389 
3390 	/* tgt_prog is NULL if target is a kernel function */
3391 	if (tr_link->tgt_prog)
3392 		bpf_prog_put(tr_link->tgt_prog);
3393 }
3394 
3395 static void bpf_tracing_link_dealloc(struct bpf_link *link)
3396 {
3397 	struct bpf_tracing_link *tr_link =
3398 		container_of(link, struct bpf_tracing_link, link.link);
3399 
3400 	kfree(tr_link);
3401 }
3402 
3403 static void bpf_tracing_link_show_fdinfo(const struct bpf_link *link,
3404 					 struct seq_file *seq)
3405 {
3406 	struct bpf_tracing_link *tr_link =
3407 		container_of(link, struct bpf_tracing_link, link.link);
3408 	u32 target_btf_id, target_obj_id;
3409 
3410 	bpf_trampoline_unpack_key(tr_link->trampoline->key,
3411 				  &target_obj_id, &target_btf_id);
3412 	seq_printf(seq,
3413 		   "attach_type:\t%d\n"
3414 		   "target_obj_id:\t%u\n"
3415 		   "target_btf_id:\t%u\n"
3416 		   "cookie:\t%llu\n",
3417 		   tr_link->attach_type,
3418 		   target_obj_id,
3419 		   target_btf_id,
3420 		   tr_link->link.cookie);
3421 }
3422 
3423 static int bpf_tracing_link_fill_link_info(const struct bpf_link *link,
3424 					   struct bpf_link_info *info)
3425 {
3426 	struct bpf_tracing_link *tr_link =
3427 		container_of(link, struct bpf_tracing_link, link.link);
3428 
3429 	info->tracing.attach_type = tr_link->attach_type;
3430 	info->tracing.cookie = tr_link->link.cookie;
3431 	bpf_trampoline_unpack_key(tr_link->trampoline->key,
3432 				  &info->tracing.target_obj_id,
3433 				  &info->tracing.target_btf_id);
3434 
3435 	return 0;
3436 }
3437 
3438 static const struct bpf_link_ops bpf_tracing_link_lops = {
3439 	.release = bpf_tracing_link_release,
3440 	.dealloc = bpf_tracing_link_dealloc,
3441 	.show_fdinfo = bpf_tracing_link_show_fdinfo,
3442 	.fill_link_info = bpf_tracing_link_fill_link_info,
3443 };
3444 
3445 static int bpf_tracing_prog_attach(struct bpf_prog *prog,
3446 				   int tgt_prog_fd,
3447 				   u32 btf_id,
3448 				   u64 bpf_cookie,
3449 				   enum bpf_attach_type attach_type)
3450 {
3451 	struct bpf_link_primer link_primer;
3452 	struct bpf_prog *tgt_prog = NULL;
3453 	struct bpf_trampoline *tr = NULL;
3454 	struct bpf_tracing_link *link;
3455 	u64 key = 0;
3456 	int err;
3457 
3458 	switch (prog->type) {
3459 	case BPF_PROG_TYPE_TRACING:
3460 		if (prog->expected_attach_type != BPF_TRACE_FENTRY &&
3461 		    prog->expected_attach_type != BPF_TRACE_FEXIT &&
3462 		    prog->expected_attach_type != BPF_MODIFY_RETURN) {
3463 			err = -EINVAL;
3464 			goto out_put_prog;
3465 		}
3466 		break;
3467 	case BPF_PROG_TYPE_EXT:
3468 		if (prog->expected_attach_type != 0) {
3469 			err = -EINVAL;
3470 			goto out_put_prog;
3471 		}
3472 		break;
3473 	case BPF_PROG_TYPE_LSM:
3474 		if (prog->expected_attach_type != BPF_LSM_MAC) {
3475 			err = -EINVAL;
3476 			goto out_put_prog;
3477 		}
3478 		break;
3479 	default:
3480 		err = -EINVAL;
3481 		goto out_put_prog;
3482 	}
3483 
3484 	if (!!tgt_prog_fd != !!btf_id) {
3485 		err = -EINVAL;
3486 		goto out_put_prog;
3487 	}
3488 
3489 	if (tgt_prog_fd) {
3490 		/*
3491 		 * For now we only allow new targets for BPF_PROG_TYPE_EXT. If this
3492 		 * part would be changed to implement the same for
3493 		 * BPF_PROG_TYPE_TRACING, do not forget to update the way how
3494 		 * attach_tracing_prog flag is set.
3495 		 */
3496 		if (prog->type != BPF_PROG_TYPE_EXT) {
3497 			err = -EINVAL;
3498 			goto out_put_prog;
3499 		}
3500 
3501 		tgt_prog = bpf_prog_get(tgt_prog_fd);
3502 		if (IS_ERR(tgt_prog)) {
3503 			err = PTR_ERR(tgt_prog);
3504 			tgt_prog = NULL;
3505 			goto out_put_prog;
3506 		}
3507 
3508 		key = bpf_trampoline_compute_key(tgt_prog, NULL, btf_id);
3509 	}
3510 
3511 	link = kzalloc(sizeof(*link), GFP_USER);
3512 	if (!link) {
3513 		err = -ENOMEM;
3514 		goto out_put_prog;
3515 	}
3516 	bpf_link_init(&link->link.link, BPF_LINK_TYPE_TRACING,
3517 		      &bpf_tracing_link_lops, prog, attach_type);
3518 
3519 	link->attach_type = prog->expected_attach_type;
3520 	link->link.cookie = bpf_cookie;
3521 
3522 	mutex_lock(&prog->aux->dst_mutex);
3523 
3524 	/* There are a few possible cases here:
3525 	 *
3526 	 * - if prog->aux->dst_trampoline is set, the program was just loaded
3527 	 *   and not yet attached to anything, so we can use the values stored
3528 	 *   in prog->aux
3529 	 *
3530 	 * - if prog->aux->dst_trampoline is NULL, the program has already been
3531 	 *   attached to a target and its initial target was cleared (below)
3532 	 *
3533 	 * - if tgt_prog != NULL, the caller specified tgt_prog_fd +
3534 	 *   target_btf_id using the link_create API.
3535 	 *
3536 	 * - if tgt_prog == NULL when this function was called using the old
3537 	 *   raw_tracepoint_open API, and we need a target from prog->aux
3538 	 *
3539 	 * - if prog->aux->dst_trampoline and tgt_prog is NULL, the program
3540 	 *   was detached and is going for re-attachment.
3541 	 *
3542 	 * - if prog->aux->dst_trampoline is NULL and tgt_prog and prog->aux->attach_btf
3543 	 *   are NULL, then program was already attached and user did not provide
3544 	 *   tgt_prog_fd so we have no way to find out or create trampoline
3545 	 */
3546 	if (!prog->aux->dst_trampoline && !tgt_prog) {
3547 		/*
3548 		 * Allow re-attach for TRACING and LSM programs. If it's
3549 		 * currently linked, bpf_trampoline_link_prog will fail.
3550 		 * EXT programs need to specify tgt_prog_fd, so they
3551 		 * re-attach in separate code path.
3552 		 */
3553 		if (prog->type != BPF_PROG_TYPE_TRACING &&
3554 		    prog->type != BPF_PROG_TYPE_LSM) {
3555 			err = -EINVAL;
3556 			goto out_unlock;
3557 		}
3558 		/* We can allow re-attach only if we have valid attach_btf. */
3559 		if (!prog->aux->attach_btf) {
3560 			err = -EINVAL;
3561 			goto out_unlock;
3562 		}
3563 		btf_id = prog->aux->attach_btf_id;
3564 		key = bpf_trampoline_compute_key(NULL, prog->aux->attach_btf, btf_id);
3565 	}
3566 
3567 	if (!prog->aux->dst_trampoline ||
3568 	    (key && key != prog->aux->dst_trampoline->key)) {
3569 		/* If there is no saved target, or the specified target is
3570 		 * different from the destination specified at load time, we
3571 		 * need a new trampoline and a check for compatibility
3572 		 */
3573 		struct bpf_attach_target_info tgt_info = {};
3574 
3575 		err = bpf_check_attach_target(NULL, prog, tgt_prog, btf_id,
3576 					      &tgt_info);
3577 		if (err)
3578 			goto out_unlock;
3579 
3580 		if (tgt_info.tgt_mod) {
3581 			module_put(prog->aux->mod);
3582 			prog->aux->mod = tgt_info.tgt_mod;
3583 		}
3584 
3585 		tr = bpf_trampoline_get(key, &tgt_info);
3586 		if (!tr) {
3587 			err = -ENOMEM;
3588 			goto out_unlock;
3589 		}
3590 	} else {
3591 		/* The caller didn't specify a target, or the target was the
3592 		 * same as the destination supplied during program load. This
3593 		 * means we can reuse the trampoline and reference from program
3594 		 * load time, and there is no need to allocate a new one. This
3595 		 * can only happen once for any program, as the saved values in
3596 		 * prog->aux are cleared below.
3597 		 */
3598 		tr = prog->aux->dst_trampoline;
3599 		tgt_prog = prog->aux->dst_prog;
3600 	}
3601 
3602 	err = bpf_link_prime(&link->link.link, &link_primer);
3603 	if (err)
3604 		goto out_unlock;
3605 
3606 	err = bpf_trampoline_link_prog(&link->link, tr, tgt_prog);
3607 	if (err) {
3608 		bpf_link_cleanup(&link_primer);
3609 		link = NULL;
3610 		goto out_unlock;
3611 	}
3612 
3613 	link->tgt_prog = tgt_prog;
3614 	link->trampoline = tr;
3615 
3616 	/* Always clear the trampoline and target prog from prog->aux to make
3617 	 * sure the original attach destination is not kept alive after a
3618 	 * program is (re-)attached to another target.
3619 	 */
3620 	if (prog->aux->dst_prog &&
3621 	    (tgt_prog_fd || tr != prog->aux->dst_trampoline))
3622 		/* got extra prog ref from syscall, or attaching to different prog */
3623 		bpf_prog_put(prog->aux->dst_prog);
3624 	if (prog->aux->dst_trampoline && tr != prog->aux->dst_trampoline)
3625 		/* we allocated a new trampoline, so free the old one */
3626 		bpf_trampoline_put(prog->aux->dst_trampoline);
3627 
3628 	prog->aux->dst_prog = NULL;
3629 	prog->aux->dst_trampoline = NULL;
3630 	mutex_unlock(&prog->aux->dst_mutex);
3631 
3632 	return bpf_link_settle(&link_primer);
3633 out_unlock:
3634 	if (tr && tr != prog->aux->dst_trampoline)
3635 		bpf_trampoline_put(tr);
3636 	mutex_unlock(&prog->aux->dst_mutex);
3637 	kfree(link);
3638 out_put_prog:
3639 	if (tgt_prog_fd && tgt_prog)
3640 		bpf_prog_put(tgt_prog);
3641 	return err;
3642 }
3643 
3644 static void bpf_raw_tp_link_release(struct bpf_link *link)
3645 {
3646 	struct bpf_raw_tp_link *raw_tp =
3647 		container_of(link, struct bpf_raw_tp_link, link);
3648 
3649 	bpf_probe_unregister(raw_tp->btp, raw_tp);
3650 	bpf_put_raw_tracepoint(raw_tp->btp);
3651 }
3652 
3653 static void bpf_raw_tp_link_dealloc(struct bpf_link *link)
3654 {
3655 	struct bpf_raw_tp_link *raw_tp =
3656 		container_of(link, struct bpf_raw_tp_link, link);
3657 
3658 	kfree(raw_tp);
3659 }
3660 
3661 static void bpf_raw_tp_link_show_fdinfo(const struct bpf_link *link,
3662 					struct seq_file *seq)
3663 {
3664 	struct bpf_raw_tp_link *raw_tp_link =
3665 		container_of(link, struct bpf_raw_tp_link, link);
3666 
3667 	seq_printf(seq,
3668 		   "tp_name:\t%s\n"
3669 		   "cookie:\t%llu\n",
3670 		   raw_tp_link->btp->tp->name,
3671 		   raw_tp_link->cookie);
3672 }
3673 
3674 static int bpf_copy_to_user(char __user *ubuf, const char *buf, u32 ulen,
3675 			    u32 len)
3676 {
3677 	if (ulen >= len + 1) {
3678 		if (copy_to_user(ubuf, buf, len + 1))
3679 			return -EFAULT;
3680 	} else {
3681 		char zero = '\0';
3682 
3683 		if (copy_to_user(ubuf, buf, ulen - 1))
3684 			return -EFAULT;
3685 		if (put_user(zero, ubuf + ulen - 1))
3686 			return -EFAULT;
3687 		return -ENOSPC;
3688 	}
3689 
3690 	return 0;
3691 }
3692 
3693 static int bpf_raw_tp_link_fill_link_info(const struct bpf_link *link,
3694 					  struct bpf_link_info *info)
3695 {
3696 	struct bpf_raw_tp_link *raw_tp_link =
3697 		container_of(link, struct bpf_raw_tp_link, link);
3698 	char __user *ubuf = u64_to_user_ptr(info->raw_tracepoint.tp_name);
3699 	const char *tp_name = raw_tp_link->btp->tp->name;
3700 	u32 ulen = info->raw_tracepoint.tp_name_len;
3701 	size_t tp_len = strlen(tp_name);
3702 
3703 	if (!ulen ^ !ubuf)
3704 		return -EINVAL;
3705 
3706 	info->raw_tracepoint.tp_name_len = tp_len + 1;
3707 	info->raw_tracepoint.cookie = raw_tp_link->cookie;
3708 
3709 	if (!ubuf)
3710 		return 0;
3711 
3712 	return bpf_copy_to_user(ubuf, tp_name, ulen, tp_len);
3713 }
3714 
3715 static const struct bpf_link_ops bpf_raw_tp_link_lops = {
3716 	.release = bpf_raw_tp_link_release,
3717 	.dealloc_deferred = bpf_raw_tp_link_dealloc,
3718 	.show_fdinfo = bpf_raw_tp_link_show_fdinfo,
3719 	.fill_link_info = bpf_raw_tp_link_fill_link_info,
3720 };
3721 
3722 #ifdef CONFIG_PERF_EVENTS
3723 struct bpf_perf_link {
3724 	struct bpf_link link;
3725 	struct file *perf_file;
3726 };
3727 
3728 static void bpf_perf_link_release(struct bpf_link *link)
3729 {
3730 	struct bpf_perf_link *perf_link = container_of(link, struct bpf_perf_link, link);
3731 	struct perf_event *event = perf_link->perf_file->private_data;
3732 
3733 	perf_event_free_bpf_prog(event);
3734 	fput(perf_link->perf_file);
3735 }
3736 
3737 static void bpf_perf_link_dealloc(struct bpf_link *link)
3738 {
3739 	struct bpf_perf_link *perf_link = container_of(link, struct bpf_perf_link, link);
3740 
3741 	kfree(perf_link);
3742 }
3743 
3744 static int bpf_perf_link_fill_common(const struct perf_event *event,
3745 				     char __user *uname, u32 *ulenp,
3746 				     u64 *probe_offset, u64 *probe_addr,
3747 				     u32 *fd_type, unsigned long *missed)
3748 {
3749 	const char *buf;
3750 	u32 prog_id, ulen;
3751 	size_t len;
3752 	int err;
3753 
3754 	ulen = *ulenp;
3755 	if (!ulen ^ !uname)
3756 		return -EINVAL;
3757 
3758 	err = bpf_get_perf_event_info(event, &prog_id, fd_type, &buf,
3759 				      probe_offset, probe_addr, missed);
3760 	if (err)
3761 		return err;
3762 
3763 	if (buf) {
3764 		len = strlen(buf);
3765 		*ulenp = len + 1;
3766 	} else {
3767 		*ulenp = 1;
3768 	}
3769 	if (!uname)
3770 		return 0;
3771 
3772 	if (buf) {
3773 		err = bpf_copy_to_user(uname, buf, ulen, len);
3774 		if (err)
3775 			return err;
3776 	} else {
3777 		char zero = '\0';
3778 
3779 		if (put_user(zero, uname))
3780 			return -EFAULT;
3781 	}
3782 	return 0;
3783 }
3784 
3785 #ifdef CONFIG_KPROBE_EVENTS
3786 static int bpf_perf_link_fill_kprobe(const struct perf_event *event,
3787 				     struct bpf_link_info *info)
3788 {
3789 	unsigned long missed;
3790 	char __user *uname;
3791 	u64 addr, offset;
3792 	u32 ulen, type;
3793 	int err;
3794 
3795 	uname = u64_to_user_ptr(info->perf_event.kprobe.func_name);
3796 	ulen = info->perf_event.kprobe.name_len;
3797 	err = bpf_perf_link_fill_common(event, uname, &ulen, &offset, &addr,
3798 					&type, &missed);
3799 	if (err)
3800 		return err;
3801 	if (type == BPF_FD_TYPE_KRETPROBE)
3802 		info->perf_event.type = BPF_PERF_EVENT_KRETPROBE;
3803 	else
3804 		info->perf_event.type = BPF_PERF_EVENT_KPROBE;
3805 	info->perf_event.kprobe.name_len = ulen;
3806 	info->perf_event.kprobe.offset = offset;
3807 	info->perf_event.kprobe.missed = missed;
3808 	if (!kallsyms_show_value(current_cred()))
3809 		addr = 0;
3810 	info->perf_event.kprobe.addr = addr;
3811 	info->perf_event.kprobe.cookie = event->bpf_cookie;
3812 	return 0;
3813 }
3814 
3815 static void bpf_perf_link_fdinfo_kprobe(const struct perf_event *event,
3816 					struct seq_file *seq)
3817 {
3818 	const char *name;
3819 	int err;
3820 	u32 prog_id, type;
3821 	u64 offset, addr;
3822 	unsigned long missed;
3823 
3824 	err = bpf_get_perf_event_info(event, &prog_id, &type, &name,
3825 				      &offset, &addr, &missed);
3826 	if (err)
3827 		return;
3828 
3829 	seq_printf(seq,
3830 		   "name:\t%s\n"
3831 		   "offset:\t%#llx\n"
3832 		   "missed:\t%lu\n"
3833 		   "addr:\t%#llx\n"
3834 		   "event_type:\t%s\n"
3835 		   "cookie:\t%llu\n",
3836 		   name, offset, missed, addr,
3837 		   type == BPF_FD_TYPE_KRETPROBE ?  "kretprobe" : "kprobe",
3838 		   event->bpf_cookie);
3839 }
3840 #endif
3841 
3842 #ifdef CONFIG_UPROBE_EVENTS
3843 static int bpf_perf_link_fill_uprobe(const struct perf_event *event,
3844 				     struct bpf_link_info *info)
3845 {
3846 	u64 ref_ctr_offset, offset;
3847 	char __user *uname;
3848 	u32 ulen, type;
3849 	int err;
3850 
3851 	uname = u64_to_user_ptr(info->perf_event.uprobe.file_name);
3852 	ulen = info->perf_event.uprobe.name_len;
3853 	err = bpf_perf_link_fill_common(event, uname, &ulen, &offset, &ref_ctr_offset,
3854 					&type, NULL);
3855 	if (err)
3856 		return err;
3857 
3858 	if (type == BPF_FD_TYPE_URETPROBE)
3859 		info->perf_event.type = BPF_PERF_EVENT_URETPROBE;
3860 	else
3861 		info->perf_event.type = BPF_PERF_EVENT_UPROBE;
3862 	info->perf_event.uprobe.name_len = ulen;
3863 	info->perf_event.uprobe.offset = offset;
3864 	info->perf_event.uprobe.cookie = event->bpf_cookie;
3865 	info->perf_event.uprobe.ref_ctr_offset = ref_ctr_offset;
3866 	return 0;
3867 }
3868 
3869 static void bpf_perf_link_fdinfo_uprobe(const struct perf_event *event,
3870 					struct seq_file *seq)
3871 {
3872 	const char *name;
3873 	int err;
3874 	u32 prog_id, type;
3875 	u64 offset, ref_ctr_offset;
3876 	unsigned long missed;
3877 
3878 	err = bpf_get_perf_event_info(event, &prog_id, &type, &name,
3879 				      &offset, &ref_ctr_offset, &missed);
3880 	if (err)
3881 		return;
3882 
3883 	seq_printf(seq,
3884 		   "name:\t%s\n"
3885 		   "offset:\t%#llx\n"
3886 		   "ref_ctr_offset:\t%#llx\n"
3887 		   "event_type:\t%s\n"
3888 		   "cookie:\t%llu\n",
3889 		   name, offset, ref_ctr_offset,
3890 		   type == BPF_FD_TYPE_URETPROBE ?  "uretprobe" : "uprobe",
3891 		   event->bpf_cookie);
3892 }
3893 #endif
3894 
3895 static int bpf_perf_link_fill_probe(const struct perf_event *event,
3896 				    struct bpf_link_info *info)
3897 {
3898 #ifdef CONFIG_KPROBE_EVENTS
3899 	if (event->tp_event->flags & TRACE_EVENT_FL_KPROBE)
3900 		return bpf_perf_link_fill_kprobe(event, info);
3901 #endif
3902 #ifdef CONFIG_UPROBE_EVENTS
3903 	if (event->tp_event->flags & TRACE_EVENT_FL_UPROBE)
3904 		return bpf_perf_link_fill_uprobe(event, info);
3905 #endif
3906 	return -EOPNOTSUPP;
3907 }
3908 
3909 static int bpf_perf_link_fill_tracepoint(const struct perf_event *event,
3910 					 struct bpf_link_info *info)
3911 {
3912 	char __user *uname;
3913 	u32 ulen;
3914 	int err;
3915 
3916 	uname = u64_to_user_ptr(info->perf_event.tracepoint.tp_name);
3917 	ulen = info->perf_event.tracepoint.name_len;
3918 	err = bpf_perf_link_fill_common(event, uname, &ulen, NULL, NULL, NULL, NULL);
3919 	if (err)
3920 		return err;
3921 
3922 	info->perf_event.type = BPF_PERF_EVENT_TRACEPOINT;
3923 	info->perf_event.tracepoint.name_len = ulen;
3924 	info->perf_event.tracepoint.cookie = event->bpf_cookie;
3925 	return 0;
3926 }
3927 
3928 static int bpf_perf_link_fill_perf_event(const struct perf_event *event,
3929 					 struct bpf_link_info *info)
3930 {
3931 	info->perf_event.event.type = event->attr.type;
3932 	info->perf_event.event.config = event->attr.config;
3933 	info->perf_event.event.cookie = event->bpf_cookie;
3934 	info->perf_event.type = BPF_PERF_EVENT_EVENT;
3935 	return 0;
3936 }
3937 
3938 static int bpf_perf_link_fill_link_info(const struct bpf_link *link,
3939 					struct bpf_link_info *info)
3940 {
3941 	struct bpf_perf_link *perf_link;
3942 	const struct perf_event *event;
3943 
3944 	perf_link = container_of(link, struct bpf_perf_link, link);
3945 	event = perf_get_event(perf_link->perf_file);
3946 	if (IS_ERR(event))
3947 		return PTR_ERR(event);
3948 
3949 	switch (event->prog->type) {
3950 	case BPF_PROG_TYPE_PERF_EVENT:
3951 		return bpf_perf_link_fill_perf_event(event, info);
3952 	case BPF_PROG_TYPE_TRACEPOINT:
3953 		return bpf_perf_link_fill_tracepoint(event, info);
3954 	case BPF_PROG_TYPE_KPROBE:
3955 		return bpf_perf_link_fill_probe(event, info);
3956 	default:
3957 		return -EOPNOTSUPP;
3958 	}
3959 }
3960 
3961 static void bpf_perf_event_link_show_fdinfo(const struct perf_event *event,
3962 					    struct seq_file *seq)
3963 {
3964 	seq_printf(seq,
3965 		   "type:\t%u\n"
3966 		   "config:\t%llu\n"
3967 		   "event_type:\t%s\n"
3968 		   "cookie:\t%llu\n",
3969 		   event->attr.type, event->attr.config,
3970 		   "event", event->bpf_cookie);
3971 }
3972 
3973 static void bpf_tracepoint_link_show_fdinfo(const struct perf_event *event,
3974 					    struct seq_file *seq)
3975 {
3976 	int err;
3977 	const char *name;
3978 	u32 prog_id;
3979 
3980 	err = bpf_get_perf_event_info(event, &prog_id, NULL, &name, NULL,
3981 				      NULL, NULL);
3982 	if (err)
3983 		return;
3984 
3985 	seq_printf(seq,
3986 		   "tp_name:\t%s\n"
3987 		   "event_type:\t%s\n"
3988 		   "cookie:\t%llu\n",
3989 		   name, "tracepoint", event->bpf_cookie);
3990 }
3991 
3992 static void bpf_probe_link_show_fdinfo(const struct perf_event *event,
3993 				       struct seq_file *seq)
3994 {
3995 #ifdef CONFIG_KPROBE_EVENTS
3996 	if (event->tp_event->flags & TRACE_EVENT_FL_KPROBE)
3997 		return bpf_perf_link_fdinfo_kprobe(event, seq);
3998 #endif
3999 
4000 #ifdef CONFIG_UPROBE_EVENTS
4001 	if (event->tp_event->flags & TRACE_EVENT_FL_UPROBE)
4002 		return bpf_perf_link_fdinfo_uprobe(event, seq);
4003 #endif
4004 }
4005 
4006 static void bpf_perf_link_show_fdinfo(const struct bpf_link *link,
4007 				      struct seq_file *seq)
4008 {
4009 	struct bpf_perf_link *perf_link;
4010 	const struct perf_event *event;
4011 
4012 	perf_link = container_of(link, struct bpf_perf_link, link);
4013 	event = perf_get_event(perf_link->perf_file);
4014 	if (IS_ERR(event))
4015 		return;
4016 
4017 	switch (event->prog->type) {
4018 	case BPF_PROG_TYPE_PERF_EVENT:
4019 		return bpf_perf_event_link_show_fdinfo(event, seq);
4020 	case BPF_PROG_TYPE_TRACEPOINT:
4021 		return bpf_tracepoint_link_show_fdinfo(event, seq);
4022 	case BPF_PROG_TYPE_KPROBE:
4023 		return bpf_probe_link_show_fdinfo(event, seq);
4024 	default:
4025 		return;
4026 	}
4027 }
4028 
4029 static const struct bpf_link_ops bpf_perf_link_lops = {
4030 	.release = bpf_perf_link_release,
4031 	.dealloc = bpf_perf_link_dealloc,
4032 	.fill_link_info = bpf_perf_link_fill_link_info,
4033 	.show_fdinfo = bpf_perf_link_show_fdinfo,
4034 };
4035 
4036 static int bpf_perf_link_attach(const union bpf_attr *attr, struct bpf_prog *prog)
4037 {
4038 	struct bpf_link_primer link_primer;
4039 	struct bpf_perf_link *link;
4040 	struct perf_event *event;
4041 	struct file *perf_file;
4042 	int err;
4043 
4044 	if (attr->link_create.flags)
4045 		return -EINVAL;
4046 
4047 	perf_file = perf_event_get(attr->link_create.target_fd);
4048 	if (IS_ERR(perf_file))
4049 		return PTR_ERR(perf_file);
4050 
4051 	link = kzalloc(sizeof(*link), GFP_USER);
4052 	if (!link) {
4053 		err = -ENOMEM;
4054 		goto out_put_file;
4055 	}
4056 	bpf_link_init(&link->link, BPF_LINK_TYPE_PERF_EVENT, &bpf_perf_link_lops, prog,
4057 		      attr->link_create.attach_type);
4058 	link->perf_file = perf_file;
4059 
4060 	err = bpf_link_prime(&link->link, &link_primer);
4061 	if (err) {
4062 		kfree(link);
4063 		goto out_put_file;
4064 	}
4065 
4066 	event = perf_file->private_data;
4067 	err = perf_event_set_bpf_prog(event, prog, attr->link_create.perf_event.bpf_cookie);
4068 	if (err) {
4069 		bpf_link_cleanup(&link_primer);
4070 		goto out_put_file;
4071 	}
4072 	/* perf_event_set_bpf_prog() doesn't take its own refcnt on prog */
4073 	bpf_prog_inc(prog);
4074 
4075 	return bpf_link_settle(&link_primer);
4076 
4077 out_put_file:
4078 	fput(perf_file);
4079 	return err;
4080 }
4081 #else
4082 static int bpf_perf_link_attach(const union bpf_attr *attr, struct bpf_prog *prog)
4083 {
4084 	return -EOPNOTSUPP;
4085 }
4086 #endif /* CONFIG_PERF_EVENTS */
4087 
4088 static int bpf_raw_tp_link_attach(struct bpf_prog *prog,
4089 				  const char __user *user_tp_name, u64 cookie,
4090 				  enum bpf_attach_type attach_type)
4091 {
4092 	struct bpf_link_primer link_primer;
4093 	struct bpf_raw_tp_link *link;
4094 	struct bpf_raw_event_map *btp;
4095 	const char *tp_name;
4096 	char buf[128];
4097 	int err;
4098 
4099 	switch (prog->type) {
4100 	case BPF_PROG_TYPE_TRACING:
4101 	case BPF_PROG_TYPE_EXT:
4102 	case BPF_PROG_TYPE_LSM:
4103 		if (user_tp_name)
4104 			/* The attach point for this category of programs
4105 			 * should be specified via btf_id during program load.
4106 			 */
4107 			return -EINVAL;
4108 		if (prog->type == BPF_PROG_TYPE_TRACING &&
4109 		    prog->expected_attach_type == BPF_TRACE_RAW_TP) {
4110 			tp_name = prog->aux->attach_func_name;
4111 			break;
4112 		}
4113 		return bpf_tracing_prog_attach(prog, 0, 0, 0, attach_type);
4114 	case BPF_PROG_TYPE_RAW_TRACEPOINT:
4115 	case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
4116 		if (strncpy_from_user(buf, user_tp_name, sizeof(buf) - 1) < 0)
4117 			return -EFAULT;
4118 		buf[sizeof(buf) - 1] = 0;
4119 		tp_name = buf;
4120 		break;
4121 	default:
4122 		return -EINVAL;
4123 	}
4124 
4125 	btp = bpf_get_raw_tracepoint(tp_name);
4126 	if (!btp)
4127 		return -ENOENT;
4128 
4129 	link = kzalloc(sizeof(*link), GFP_USER);
4130 	if (!link) {
4131 		err = -ENOMEM;
4132 		goto out_put_btp;
4133 	}
4134 	bpf_link_init_sleepable(&link->link, BPF_LINK_TYPE_RAW_TRACEPOINT,
4135 				&bpf_raw_tp_link_lops, prog, attach_type,
4136 				tracepoint_is_faultable(btp->tp));
4137 	link->btp = btp;
4138 	link->cookie = cookie;
4139 
4140 	err = bpf_link_prime(&link->link, &link_primer);
4141 	if (err) {
4142 		kfree(link);
4143 		goto out_put_btp;
4144 	}
4145 
4146 	err = bpf_probe_register(link->btp, link);
4147 	if (err) {
4148 		bpf_link_cleanup(&link_primer);
4149 		goto out_put_btp;
4150 	}
4151 
4152 	return bpf_link_settle(&link_primer);
4153 
4154 out_put_btp:
4155 	bpf_put_raw_tracepoint(btp);
4156 	return err;
4157 }
4158 
4159 #define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.cookie
4160 
4161 static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
4162 {
4163 	struct bpf_prog *prog;
4164 	void __user *tp_name;
4165 	__u64 cookie;
4166 	int fd;
4167 
4168 	if (CHECK_ATTR(BPF_RAW_TRACEPOINT_OPEN))
4169 		return -EINVAL;
4170 
4171 	prog = bpf_prog_get(attr->raw_tracepoint.prog_fd);
4172 	if (IS_ERR(prog))
4173 		return PTR_ERR(prog);
4174 
4175 	tp_name = u64_to_user_ptr(attr->raw_tracepoint.name);
4176 	cookie = attr->raw_tracepoint.cookie;
4177 	fd = bpf_raw_tp_link_attach(prog, tp_name, cookie, prog->expected_attach_type);
4178 	if (fd < 0)
4179 		bpf_prog_put(prog);
4180 	return fd;
4181 }
4182 
4183 static enum bpf_prog_type
4184 attach_type_to_prog_type(enum bpf_attach_type attach_type)
4185 {
4186 	switch (attach_type) {
4187 	case BPF_CGROUP_INET_INGRESS:
4188 	case BPF_CGROUP_INET_EGRESS:
4189 		return BPF_PROG_TYPE_CGROUP_SKB;
4190 	case BPF_CGROUP_INET_SOCK_CREATE:
4191 	case BPF_CGROUP_INET_SOCK_RELEASE:
4192 	case BPF_CGROUP_INET4_POST_BIND:
4193 	case BPF_CGROUP_INET6_POST_BIND:
4194 		return BPF_PROG_TYPE_CGROUP_SOCK;
4195 	case BPF_CGROUP_INET4_BIND:
4196 	case BPF_CGROUP_INET6_BIND:
4197 	case BPF_CGROUP_INET4_CONNECT:
4198 	case BPF_CGROUP_INET6_CONNECT:
4199 	case BPF_CGROUP_UNIX_CONNECT:
4200 	case BPF_CGROUP_INET4_GETPEERNAME:
4201 	case BPF_CGROUP_INET6_GETPEERNAME:
4202 	case BPF_CGROUP_UNIX_GETPEERNAME:
4203 	case BPF_CGROUP_INET4_GETSOCKNAME:
4204 	case BPF_CGROUP_INET6_GETSOCKNAME:
4205 	case BPF_CGROUP_UNIX_GETSOCKNAME:
4206 	case BPF_CGROUP_UDP4_SENDMSG:
4207 	case BPF_CGROUP_UDP6_SENDMSG:
4208 	case BPF_CGROUP_UNIX_SENDMSG:
4209 	case BPF_CGROUP_UDP4_RECVMSG:
4210 	case BPF_CGROUP_UDP6_RECVMSG:
4211 	case BPF_CGROUP_UNIX_RECVMSG:
4212 		return BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
4213 	case BPF_CGROUP_SOCK_OPS:
4214 		return BPF_PROG_TYPE_SOCK_OPS;
4215 	case BPF_CGROUP_DEVICE:
4216 		return BPF_PROG_TYPE_CGROUP_DEVICE;
4217 	case BPF_SK_MSG_VERDICT:
4218 		return BPF_PROG_TYPE_SK_MSG;
4219 	case BPF_SK_SKB_STREAM_PARSER:
4220 	case BPF_SK_SKB_STREAM_VERDICT:
4221 	case BPF_SK_SKB_VERDICT:
4222 		return BPF_PROG_TYPE_SK_SKB;
4223 	case BPF_LIRC_MODE2:
4224 		return BPF_PROG_TYPE_LIRC_MODE2;
4225 	case BPF_FLOW_DISSECTOR:
4226 		return BPF_PROG_TYPE_FLOW_DISSECTOR;
4227 	case BPF_CGROUP_SYSCTL:
4228 		return BPF_PROG_TYPE_CGROUP_SYSCTL;
4229 	case BPF_CGROUP_GETSOCKOPT:
4230 	case BPF_CGROUP_SETSOCKOPT:
4231 		return BPF_PROG_TYPE_CGROUP_SOCKOPT;
4232 	case BPF_TRACE_ITER:
4233 	case BPF_TRACE_RAW_TP:
4234 	case BPF_TRACE_FENTRY:
4235 	case BPF_TRACE_FEXIT:
4236 	case BPF_MODIFY_RETURN:
4237 		return BPF_PROG_TYPE_TRACING;
4238 	case BPF_LSM_MAC:
4239 		return BPF_PROG_TYPE_LSM;
4240 	case BPF_SK_LOOKUP:
4241 		return BPF_PROG_TYPE_SK_LOOKUP;
4242 	case BPF_XDP:
4243 		return BPF_PROG_TYPE_XDP;
4244 	case BPF_LSM_CGROUP:
4245 		return BPF_PROG_TYPE_LSM;
4246 	case BPF_TCX_INGRESS:
4247 	case BPF_TCX_EGRESS:
4248 	case BPF_NETKIT_PRIMARY:
4249 	case BPF_NETKIT_PEER:
4250 		return BPF_PROG_TYPE_SCHED_CLS;
4251 	default:
4252 		return BPF_PROG_TYPE_UNSPEC;
4253 	}
4254 }
4255 
4256 static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
4257 					     enum bpf_attach_type attach_type)
4258 {
4259 	enum bpf_prog_type ptype;
4260 
4261 	switch (prog->type) {
4262 	case BPF_PROG_TYPE_CGROUP_SOCK:
4263 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
4264 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
4265 	case BPF_PROG_TYPE_SK_LOOKUP:
4266 		return attach_type == prog->expected_attach_type ? 0 : -EINVAL;
4267 	case BPF_PROG_TYPE_CGROUP_SKB:
4268 		if (!bpf_token_capable(prog->aux->token, CAP_NET_ADMIN))
4269 			/* cg-skb progs can be loaded by unpriv user.
4270 			 * check permissions at attach time.
4271 			 */
4272 			return -EPERM;
4273 
4274 		ptype = attach_type_to_prog_type(attach_type);
4275 		if (prog->type != ptype)
4276 			return -EINVAL;
4277 
4278 		return prog->enforce_expected_attach_type &&
4279 			prog->expected_attach_type != attach_type ?
4280 			-EINVAL : 0;
4281 	case BPF_PROG_TYPE_EXT:
4282 		return 0;
4283 	case BPF_PROG_TYPE_NETFILTER:
4284 		if (attach_type != BPF_NETFILTER)
4285 			return -EINVAL;
4286 		return 0;
4287 	case BPF_PROG_TYPE_PERF_EVENT:
4288 	case BPF_PROG_TYPE_TRACEPOINT:
4289 		if (attach_type != BPF_PERF_EVENT)
4290 			return -EINVAL;
4291 		return 0;
4292 	case BPF_PROG_TYPE_KPROBE:
4293 		if (prog->expected_attach_type == BPF_TRACE_KPROBE_MULTI &&
4294 		    attach_type != BPF_TRACE_KPROBE_MULTI)
4295 			return -EINVAL;
4296 		if (prog->expected_attach_type == BPF_TRACE_KPROBE_SESSION &&
4297 		    attach_type != BPF_TRACE_KPROBE_SESSION)
4298 			return -EINVAL;
4299 		if (prog->expected_attach_type == BPF_TRACE_UPROBE_MULTI &&
4300 		    attach_type != BPF_TRACE_UPROBE_MULTI)
4301 			return -EINVAL;
4302 		if (prog->expected_attach_type == BPF_TRACE_UPROBE_SESSION &&
4303 		    attach_type != BPF_TRACE_UPROBE_SESSION)
4304 			return -EINVAL;
4305 		if (attach_type != BPF_PERF_EVENT &&
4306 		    attach_type != BPF_TRACE_KPROBE_MULTI &&
4307 		    attach_type != BPF_TRACE_KPROBE_SESSION &&
4308 		    attach_type != BPF_TRACE_UPROBE_MULTI &&
4309 		    attach_type != BPF_TRACE_UPROBE_SESSION)
4310 			return -EINVAL;
4311 		return 0;
4312 	case BPF_PROG_TYPE_SCHED_CLS:
4313 		if (attach_type != BPF_TCX_INGRESS &&
4314 		    attach_type != BPF_TCX_EGRESS &&
4315 		    attach_type != BPF_NETKIT_PRIMARY &&
4316 		    attach_type != BPF_NETKIT_PEER)
4317 			return -EINVAL;
4318 		return 0;
4319 	default:
4320 		ptype = attach_type_to_prog_type(attach_type);
4321 		if (ptype == BPF_PROG_TYPE_UNSPEC || ptype != prog->type)
4322 			return -EINVAL;
4323 		return 0;
4324 	}
4325 }
4326 
4327 static bool is_cgroup_prog_type(enum bpf_prog_type ptype, enum bpf_attach_type atype,
4328 				bool check_atype)
4329 {
4330 	switch (ptype) {
4331 	case BPF_PROG_TYPE_CGROUP_DEVICE:
4332 	case BPF_PROG_TYPE_CGROUP_SKB:
4333 	case BPF_PROG_TYPE_CGROUP_SOCK:
4334 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
4335 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
4336 	case BPF_PROG_TYPE_CGROUP_SYSCTL:
4337 	case BPF_PROG_TYPE_SOCK_OPS:
4338 		return true;
4339 	case BPF_PROG_TYPE_LSM:
4340 		return check_atype ? atype == BPF_LSM_CGROUP : true;
4341 	default:
4342 		return false;
4343 	}
4344 }
4345 
4346 #define BPF_PROG_ATTACH_LAST_FIELD expected_revision
4347 
4348 #define BPF_F_ATTACH_MASK_BASE	\
4349 	(BPF_F_ALLOW_OVERRIDE |	\
4350 	 BPF_F_ALLOW_MULTI |	\
4351 	 BPF_F_REPLACE |	\
4352 	 BPF_F_PREORDER)
4353 
4354 #define BPF_F_ATTACH_MASK_MPROG	\
4355 	(BPF_F_REPLACE |	\
4356 	 BPF_F_BEFORE |		\
4357 	 BPF_F_AFTER |		\
4358 	 BPF_F_ID |		\
4359 	 BPF_F_LINK)
4360 
4361 static int bpf_prog_attach(const union bpf_attr *attr)
4362 {
4363 	enum bpf_prog_type ptype;
4364 	struct bpf_prog *prog;
4365 	int ret;
4366 
4367 	if (CHECK_ATTR(BPF_PROG_ATTACH))
4368 		return -EINVAL;
4369 
4370 	ptype = attach_type_to_prog_type(attr->attach_type);
4371 	if (ptype == BPF_PROG_TYPE_UNSPEC)
4372 		return -EINVAL;
4373 	if (bpf_mprog_supported(ptype)) {
4374 		if (attr->attach_flags & ~BPF_F_ATTACH_MASK_MPROG)
4375 			return -EINVAL;
4376 	} else if (is_cgroup_prog_type(ptype, 0, false)) {
4377 		if (attr->attach_flags & ~(BPF_F_ATTACH_MASK_BASE | BPF_F_ATTACH_MASK_MPROG))
4378 			return -EINVAL;
4379 	} else {
4380 		if (attr->attach_flags & ~BPF_F_ATTACH_MASK_BASE)
4381 			return -EINVAL;
4382 		if (attr->relative_fd ||
4383 		    attr->expected_revision)
4384 			return -EINVAL;
4385 	}
4386 
4387 	prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
4388 	if (IS_ERR(prog))
4389 		return PTR_ERR(prog);
4390 
4391 	if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
4392 		bpf_prog_put(prog);
4393 		return -EINVAL;
4394 	}
4395 
4396 	if (is_cgroup_prog_type(ptype, prog->expected_attach_type, true)) {
4397 		ret = cgroup_bpf_prog_attach(attr, ptype, prog);
4398 		goto out;
4399 	}
4400 
4401 	switch (ptype) {
4402 	case BPF_PROG_TYPE_SK_SKB:
4403 	case BPF_PROG_TYPE_SK_MSG:
4404 		ret = sock_map_get_from_fd(attr, prog);
4405 		break;
4406 	case BPF_PROG_TYPE_LIRC_MODE2:
4407 		ret = lirc_prog_attach(attr, prog);
4408 		break;
4409 	case BPF_PROG_TYPE_FLOW_DISSECTOR:
4410 		ret = netns_bpf_prog_attach(attr, prog);
4411 		break;
4412 	case BPF_PROG_TYPE_SCHED_CLS:
4413 		if (attr->attach_type == BPF_TCX_INGRESS ||
4414 		    attr->attach_type == BPF_TCX_EGRESS)
4415 			ret = tcx_prog_attach(attr, prog);
4416 		else
4417 			ret = netkit_prog_attach(attr, prog);
4418 		break;
4419 	default:
4420 		ret = -EINVAL;
4421 	}
4422 out:
4423 	if (ret)
4424 		bpf_prog_put(prog);
4425 	return ret;
4426 }
4427 
4428 #define BPF_PROG_DETACH_LAST_FIELD expected_revision
4429 
4430 static int bpf_prog_detach(const union bpf_attr *attr)
4431 {
4432 	struct bpf_prog *prog = NULL;
4433 	enum bpf_prog_type ptype;
4434 	int ret;
4435 
4436 	if (CHECK_ATTR(BPF_PROG_DETACH))
4437 		return -EINVAL;
4438 
4439 	ptype = attach_type_to_prog_type(attr->attach_type);
4440 	if (bpf_mprog_supported(ptype)) {
4441 		if (ptype == BPF_PROG_TYPE_UNSPEC)
4442 			return -EINVAL;
4443 		if (attr->attach_flags & ~BPF_F_ATTACH_MASK_MPROG)
4444 			return -EINVAL;
4445 		if (attr->attach_bpf_fd) {
4446 			prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
4447 			if (IS_ERR(prog))
4448 				return PTR_ERR(prog);
4449 		}
4450 	} else if (is_cgroup_prog_type(ptype, 0, false)) {
4451 		if (attr->attach_flags || attr->relative_fd)
4452 			return -EINVAL;
4453 	} else if (attr->attach_flags ||
4454 		   attr->relative_fd ||
4455 		   attr->expected_revision) {
4456 		return -EINVAL;
4457 	}
4458 
4459 	switch (ptype) {
4460 	case BPF_PROG_TYPE_SK_MSG:
4461 	case BPF_PROG_TYPE_SK_SKB:
4462 		ret = sock_map_prog_detach(attr, ptype);
4463 		break;
4464 	case BPF_PROG_TYPE_LIRC_MODE2:
4465 		ret = lirc_prog_detach(attr);
4466 		break;
4467 	case BPF_PROG_TYPE_FLOW_DISSECTOR:
4468 		ret = netns_bpf_prog_detach(attr, ptype);
4469 		break;
4470 	case BPF_PROG_TYPE_CGROUP_DEVICE:
4471 	case BPF_PROG_TYPE_CGROUP_SKB:
4472 	case BPF_PROG_TYPE_CGROUP_SOCK:
4473 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
4474 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
4475 	case BPF_PROG_TYPE_CGROUP_SYSCTL:
4476 	case BPF_PROG_TYPE_SOCK_OPS:
4477 	case BPF_PROG_TYPE_LSM:
4478 		ret = cgroup_bpf_prog_detach(attr, ptype);
4479 		break;
4480 	case BPF_PROG_TYPE_SCHED_CLS:
4481 		if (attr->attach_type == BPF_TCX_INGRESS ||
4482 		    attr->attach_type == BPF_TCX_EGRESS)
4483 			ret = tcx_prog_detach(attr, prog);
4484 		else
4485 			ret = netkit_prog_detach(attr, prog);
4486 		break;
4487 	default:
4488 		ret = -EINVAL;
4489 	}
4490 
4491 	if (prog)
4492 		bpf_prog_put(prog);
4493 	return ret;
4494 }
4495 
4496 #define BPF_PROG_QUERY_LAST_FIELD query.revision
4497 
4498 static int bpf_prog_query(const union bpf_attr *attr,
4499 			  union bpf_attr __user *uattr)
4500 {
4501 	if (!bpf_net_capable())
4502 		return -EPERM;
4503 	if (CHECK_ATTR(BPF_PROG_QUERY))
4504 		return -EINVAL;
4505 	if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
4506 		return -EINVAL;
4507 
4508 	switch (attr->query.attach_type) {
4509 	case BPF_CGROUP_INET_INGRESS:
4510 	case BPF_CGROUP_INET_EGRESS:
4511 	case BPF_CGROUP_INET_SOCK_CREATE:
4512 	case BPF_CGROUP_INET_SOCK_RELEASE:
4513 	case BPF_CGROUP_INET4_BIND:
4514 	case BPF_CGROUP_INET6_BIND:
4515 	case BPF_CGROUP_INET4_POST_BIND:
4516 	case BPF_CGROUP_INET6_POST_BIND:
4517 	case BPF_CGROUP_INET4_CONNECT:
4518 	case BPF_CGROUP_INET6_CONNECT:
4519 	case BPF_CGROUP_UNIX_CONNECT:
4520 	case BPF_CGROUP_INET4_GETPEERNAME:
4521 	case BPF_CGROUP_INET6_GETPEERNAME:
4522 	case BPF_CGROUP_UNIX_GETPEERNAME:
4523 	case BPF_CGROUP_INET4_GETSOCKNAME:
4524 	case BPF_CGROUP_INET6_GETSOCKNAME:
4525 	case BPF_CGROUP_UNIX_GETSOCKNAME:
4526 	case BPF_CGROUP_UDP4_SENDMSG:
4527 	case BPF_CGROUP_UDP6_SENDMSG:
4528 	case BPF_CGROUP_UNIX_SENDMSG:
4529 	case BPF_CGROUP_UDP4_RECVMSG:
4530 	case BPF_CGROUP_UDP6_RECVMSG:
4531 	case BPF_CGROUP_UNIX_RECVMSG:
4532 	case BPF_CGROUP_SOCK_OPS:
4533 	case BPF_CGROUP_DEVICE:
4534 	case BPF_CGROUP_SYSCTL:
4535 	case BPF_CGROUP_GETSOCKOPT:
4536 	case BPF_CGROUP_SETSOCKOPT:
4537 	case BPF_LSM_CGROUP:
4538 		return cgroup_bpf_prog_query(attr, uattr);
4539 	case BPF_LIRC_MODE2:
4540 		return lirc_prog_query(attr, uattr);
4541 	case BPF_FLOW_DISSECTOR:
4542 	case BPF_SK_LOOKUP:
4543 		return netns_bpf_prog_query(attr, uattr);
4544 	case BPF_SK_SKB_STREAM_PARSER:
4545 	case BPF_SK_SKB_STREAM_VERDICT:
4546 	case BPF_SK_MSG_VERDICT:
4547 	case BPF_SK_SKB_VERDICT:
4548 		return sock_map_bpf_prog_query(attr, uattr);
4549 	case BPF_TCX_INGRESS:
4550 	case BPF_TCX_EGRESS:
4551 		return tcx_prog_query(attr, uattr);
4552 	case BPF_NETKIT_PRIMARY:
4553 	case BPF_NETKIT_PEER:
4554 		return netkit_prog_query(attr, uattr);
4555 	default:
4556 		return -EINVAL;
4557 	}
4558 }
4559 
4560 #define BPF_PROG_TEST_RUN_LAST_FIELD test.batch_size
4561 
4562 static int bpf_prog_test_run(const union bpf_attr *attr,
4563 			     union bpf_attr __user *uattr)
4564 {
4565 	struct bpf_prog *prog;
4566 	int ret = -ENOTSUPP;
4567 
4568 	if (CHECK_ATTR(BPF_PROG_TEST_RUN))
4569 		return -EINVAL;
4570 
4571 	if ((attr->test.ctx_size_in && !attr->test.ctx_in) ||
4572 	    (!attr->test.ctx_size_in && attr->test.ctx_in))
4573 		return -EINVAL;
4574 
4575 	if ((attr->test.ctx_size_out && !attr->test.ctx_out) ||
4576 	    (!attr->test.ctx_size_out && attr->test.ctx_out))
4577 		return -EINVAL;
4578 
4579 	prog = bpf_prog_get(attr->test.prog_fd);
4580 	if (IS_ERR(prog))
4581 		return PTR_ERR(prog);
4582 
4583 	if (prog->aux->ops->test_run)
4584 		ret = prog->aux->ops->test_run(prog, attr, uattr);
4585 
4586 	bpf_prog_put(prog);
4587 	return ret;
4588 }
4589 
4590 #define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
4591 
4592 static int bpf_obj_get_next_id(const union bpf_attr *attr,
4593 			       union bpf_attr __user *uattr,
4594 			       struct idr *idr,
4595 			       spinlock_t *lock)
4596 {
4597 	u32 next_id = attr->start_id;
4598 	int err = 0;
4599 
4600 	if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
4601 		return -EINVAL;
4602 
4603 	if (!capable(CAP_SYS_ADMIN))
4604 		return -EPERM;
4605 
4606 	next_id++;
4607 	spin_lock_bh(lock);
4608 	if (!idr_get_next(idr, &next_id))
4609 		err = -ENOENT;
4610 	spin_unlock_bh(lock);
4611 
4612 	if (!err)
4613 		err = put_user(next_id, &uattr->next_id);
4614 
4615 	return err;
4616 }
4617 
4618 struct bpf_map *bpf_map_get_curr_or_next(u32 *id)
4619 {
4620 	struct bpf_map *map;
4621 
4622 	spin_lock_bh(&map_idr_lock);
4623 again:
4624 	map = idr_get_next(&map_idr, id);
4625 	if (map) {
4626 		map = __bpf_map_inc_not_zero(map, false);
4627 		if (IS_ERR(map)) {
4628 			(*id)++;
4629 			goto again;
4630 		}
4631 	}
4632 	spin_unlock_bh(&map_idr_lock);
4633 
4634 	return map;
4635 }
4636 
4637 struct bpf_prog *bpf_prog_get_curr_or_next(u32 *id)
4638 {
4639 	struct bpf_prog *prog;
4640 
4641 	spin_lock_bh(&prog_idr_lock);
4642 again:
4643 	prog = idr_get_next(&prog_idr, id);
4644 	if (prog) {
4645 		prog = bpf_prog_inc_not_zero(prog);
4646 		if (IS_ERR(prog)) {
4647 			(*id)++;
4648 			goto again;
4649 		}
4650 	}
4651 	spin_unlock_bh(&prog_idr_lock);
4652 
4653 	return prog;
4654 }
4655 
4656 #define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
4657 
4658 struct bpf_prog *bpf_prog_by_id(u32 id)
4659 {
4660 	struct bpf_prog *prog;
4661 
4662 	if (!id)
4663 		return ERR_PTR(-ENOENT);
4664 
4665 	spin_lock_bh(&prog_idr_lock);
4666 	prog = idr_find(&prog_idr, id);
4667 	if (prog)
4668 		prog = bpf_prog_inc_not_zero(prog);
4669 	else
4670 		prog = ERR_PTR(-ENOENT);
4671 	spin_unlock_bh(&prog_idr_lock);
4672 	return prog;
4673 }
4674 
4675 static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
4676 {
4677 	struct bpf_prog *prog;
4678 	u32 id = attr->prog_id;
4679 	int fd;
4680 
4681 	if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
4682 		return -EINVAL;
4683 
4684 	if (!capable(CAP_SYS_ADMIN))
4685 		return -EPERM;
4686 
4687 	prog = bpf_prog_by_id(id);
4688 	if (IS_ERR(prog))
4689 		return PTR_ERR(prog);
4690 
4691 	fd = bpf_prog_new_fd(prog);
4692 	if (fd < 0)
4693 		bpf_prog_put(prog);
4694 
4695 	return fd;
4696 }
4697 
4698 #define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
4699 
4700 static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
4701 {
4702 	struct bpf_map *map;
4703 	u32 id = attr->map_id;
4704 	int f_flags;
4705 	int fd;
4706 
4707 	if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
4708 	    attr->open_flags & ~BPF_OBJ_FLAG_MASK)
4709 		return -EINVAL;
4710 
4711 	if (!capable(CAP_SYS_ADMIN))
4712 		return -EPERM;
4713 
4714 	f_flags = bpf_get_file_flag(attr->open_flags);
4715 	if (f_flags < 0)
4716 		return f_flags;
4717 
4718 	spin_lock_bh(&map_idr_lock);
4719 	map = idr_find(&map_idr, id);
4720 	if (map)
4721 		map = __bpf_map_inc_not_zero(map, true);
4722 	else
4723 		map = ERR_PTR(-ENOENT);
4724 	spin_unlock_bh(&map_idr_lock);
4725 
4726 	if (IS_ERR(map))
4727 		return PTR_ERR(map);
4728 
4729 	fd = bpf_map_new_fd(map, f_flags);
4730 	if (fd < 0)
4731 		bpf_map_put_with_uref(map);
4732 
4733 	return fd;
4734 }
4735 
4736 static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
4737 					      unsigned long addr, u32 *off,
4738 					      u32 *type)
4739 {
4740 	const struct bpf_map *map;
4741 	int i;
4742 
4743 	mutex_lock(&prog->aux->used_maps_mutex);
4744 	for (i = 0, *off = 0; i < prog->aux->used_map_cnt; i++) {
4745 		map = prog->aux->used_maps[i];
4746 		if (map == (void *)addr) {
4747 			*type = BPF_PSEUDO_MAP_FD;
4748 			goto out;
4749 		}
4750 		if (!map->ops->map_direct_value_meta)
4751 			continue;
4752 		if (!map->ops->map_direct_value_meta(map, addr, off)) {
4753 			*type = BPF_PSEUDO_MAP_VALUE;
4754 			goto out;
4755 		}
4756 	}
4757 	map = NULL;
4758 
4759 out:
4760 	mutex_unlock(&prog->aux->used_maps_mutex);
4761 	return map;
4762 }
4763 
4764 static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog,
4765 					      const struct cred *f_cred)
4766 {
4767 	const struct bpf_map *map;
4768 	struct bpf_insn *insns;
4769 	u32 off, type;
4770 	u64 imm;
4771 	u8 code;
4772 	int i;
4773 
4774 	insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
4775 			GFP_USER);
4776 	if (!insns)
4777 		return insns;
4778 
4779 	for (i = 0; i < prog->len; i++) {
4780 		code = insns[i].code;
4781 
4782 		if (code == (BPF_JMP | BPF_TAIL_CALL)) {
4783 			insns[i].code = BPF_JMP | BPF_CALL;
4784 			insns[i].imm = BPF_FUNC_tail_call;
4785 			/* fall-through */
4786 		}
4787 		if (code == (BPF_JMP | BPF_CALL) ||
4788 		    code == (BPF_JMP | BPF_CALL_ARGS)) {
4789 			if (code == (BPF_JMP | BPF_CALL_ARGS))
4790 				insns[i].code = BPF_JMP | BPF_CALL;
4791 			if (!bpf_dump_raw_ok(f_cred))
4792 				insns[i].imm = 0;
4793 			continue;
4794 		}
4795 		if (BPF_CLASS(code) == BPF_LDX && BPF_MODE(code) == BPF_PROBE_MEM) {
4796 			insns[i].code = BPF_LDX | BPF_SIZE(code) | BPF_MEM;
4797 			continue;
4798 		}
4799 
4800 		if ((BPF_CLASS(code) == BPF_LDX || BPF_CLASS(code) == BPF_STX ||
4801 		     BPF_CLASS(code) == BPF_ST) && BPF_MODE(code) == BPF_PROBE_MEM32) {
4802 			insns[i].code = BPF_CLASS(code) | BPF_SIZE(code) | BPF_MEM;
4803 			continue;
4804 		}
4805 
4806 		if (code != (BPF_LD | BPF_IMM | BPF_DW))
4807 			continue;
4808 
4809 		imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
4810 		map = bpf_map_from_imm(prog, imm, &off, &type);
4811 		if (map) {
4812 			insns[i].src_reg = type;
4813 			insns[i].imm = map->id;
4814 			insns[i + 1].imm = off;
4815 			continue;
4816 		}
4817 	}
4818 
4819 	return insns;
4820 }
4821 
4822 static int set_info_rec_size(struct bpf_prog_info *info)
4823 {
4824 	/*
4825 	 * Ensure info.*_rec_size is the same as kernel expected size
4826 	 *
4827 	 * or
4828 	 *
4829 	 * Only allow zero *_rec_size if both _rec_size and _cnt are
4830 	 * zero.  In this case, the kernel will set the expected
4831 	 * _rec_size back to the info.
4832 	 */
4833 
4834 	if ((info->nr_func_info || info->func_info_rec_size) &&
4835 	    info->func_info_rec_size != sizeof(struct bpf_func_info))
4836 		return -EINVAL;
4837 
4838 	if ((info->nr_line_info || info->line_info_rec_size) &&
4839 	    info->line_info_rec_size != sizeof(struct bpf_line_info))
4840 		return -EINVAL;
4841 
4842 	if ((info->nr_jited_line_info || info->jited_line_info_rec_size) &&
4843 	    info->jited_line_info_rec_size != sizeof(__u64))
4844 		return -EINVAL;
4845 
4846 	info->func_info_rec_size = sizeof(struct bpf_func_info);
4847 	info->line_info_rec_size = sizeof(struct bpf_line_info);
4848 	info->jited_line_info_rec_size = sizeof(__u64);
4849 
4850 	return 0;
4851 }
4852 
4853 static int bpf_prog_get_info_by_fd(struct file *file,
4854 				   struct bpf_prog *prog,
4855 				   const union bpf_attr *attr,
4856 				   union bpf_attr __user *uattr)
4857 {
4858 	struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
4859 	struct btf *attach_btf = bpf_prog_get_target_btf(prog);
4860 	struct bpf_prog_info info;
4861 	u32 info_len = attr->info.info_len;
4862 	struct bpf_prog_kstats stats;
4863 	char __user *uinsns;
4864 	u32 ulen;
4865 	int err;
4866 
4867 	err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
4868 	if (err)
4869 		return err;
4870 	info_len = min_t(u32, sizeof(info), info_len);
4871 
4872 	memset(&info, 0, sizeof(info));
4873 	if (copy_from_user(&info, uinfo, info_len))
4874 		return -EFAULT;
4875 
4876 	info.type = prog->type;
4877 	info.id = prog->aux->id;
4878 	info.load_time = prog->aux->load_time;
4879 	info.created_by_uid = from_kuid_munged(current_user_ns(),
4880 					       prog->aux->user->uid);
4881 	info.gpl_compatible = prog->gpl_compatible;
4882 
4883 	memcpy(info.tag, prog->tag, sizeof(prog->tag));
4884 	memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
4885 
4886 	mutex_lock(&prog->aux->used_maps_mutex);
4887 	ulen = info.nr_map_ids;
4888 	info.nr_map_ids = prog->aux->used_map_cnt;
4889 	ulen = min_t(u32, info.nr_map_ids, ulen);
4890 	if (ulen) {
4891 		u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
4892 		u32 i;
4893 
4894 		for (i = 0; i < ulen; i++)
4895 			if (put_user(prog->aux->used_maps[i]->id,
4896 				     &user_map_ids[i])) {
4897 				mutex_unlock(&prog->aux->used_maps_mutex);
4898 				return -EFAULT;
4899 			}
4900 	}
4901 	mutex_unlock(&prog->aux->used_maps_mutex);
4902 
4903 	err = set_info_rec_size(&info);
4904 	if (err)
4905 		return err;
4906 
4907 	bpf_prog_get_stats(prog, &stats);
4908 	info.run_time_ns = stats.nsecs;
4909 	info.run_cnt = stats.cnt;
4910 	info.recursion_misses = stats.misses;
4911 
4912 	info.verified_insns = prog->aux->verified_insns;
4913 	if (prog->aux->btf)
4914 		info.btf_id = btf_obj_id(prog->aux->btf);
4915 
4916 	if (!bpf_capable()) {
4917 		info.jited_prog_len = 0;
4918 		info.xlated_prog_len = 0;
4919 		info.nr_jited_ksyms = 0;
4920 		info.nr_jited_func_lens = 0;
4921 		info.nr_func_info = 0;
4922 		info.nr_line_info = 0;
4923 		info.nr_jited_line_info = 0;
4924 		goto done;
4925 	}
4926 
4927 	ulen = info.xlated_prog_len;
4928 	info.xlated_prog_len = bpf_prog_insn_size(prog);
4929 	if (info.xlated_prog_len && ulen) {
4930 		struct bpf_insn *insns_sanitized;
4931 		bool fault;
4932 
4933 		if (prog->blinded && !bpf_dump_raw_ok(file->f_cred)) {
4934 			info.xlated_prog_insns = 0;
4935 			goto done;
4936 		}
4937 		insns_sanitized = bpf_insn_prepare_dump(prog, file->f_cred);
4938 		if (!insns_sanitized)
4939 			return -ENOMEM;
4940 		uinsns = u64_to_user_ptr(info.xlated_prog_insns);
4941 		ulen = min_t(u32, info.xlated_prog_len, ulen);
4942 		fault = copy_to_user(uinsns, insns_sanitized, ulen);
4943 		kfree(insns_sanitized);
4944 		if (fault)
4945 			return -EFAULT;
4946 	}
4947 
4948 	if (bpf_prog_is_offloaded(prog->aux)) {
4949 		err = bpf_prog_offload_info_fill(&info, prog);
4950 		if (err)
4951 			return err;
4952 		goto done;
4953 	}
4954 
4955 	/* NOTE: the following code is supposed to be skipped for offload.
4956 	 * bpf_prog_offload_info_fill() is the place to fill similar fields
4957 	 * for offload.
4958 	 */
4959 	ulen = info.jited_prog_len;
4960 	if (prog->aux->func_cnt) {
4961 		u32 i;
4962 
4963 		info.jited_prog_len = 0;
4964 		for (i = 0; i < prog->aux->func_cnt; i++)
4965 			info.jited_prog_len += prog->aux->func[i]->jited_len;
4966 	} else {
4967 		info.jited_prog_len = prog->jited_len;
4968 	}
4969 
4970 	if (info.jited_prog_len && ulen) {
4971 		if (bpf_dump_raw_ok(file->f_cred)) {
4972 			uinsns = u64_to_user_ptr(info.jited_prog_insns);
4973 			ulen = min_t(u32, info.jited_prog_len, ulen);
4974 
4975 			/* for multi-function programs, copy the JITed
4976 			 * instructions for all the functions
4977 			 */
4978 			if (prog->aux->func_cnt) {
4979 				u32 len, free, i;
4980 				u8 *img;
4981 
4982 				free = ulen;
4983 				for (i = 0; i < prog->aux->func_cnt; i++) {
4984 					len = prog->aux->func[i]->jited_len;
4985 					len = min_t(u32, len, free);
4986 					img = (u8 *) prog->aux->func[i]->bpf_func;
4987 					if (copy_to_user(uinsns, img, len))
4988 						return -EFAULT;
4989 					uinsns += len;
4990 					free -= len;
4991 					if (!free)
4992 						break;
4993 				}
4994 			} else {
4995 				if (copy_to_user(uinsns, prog->bpf_func, ulen))
4996 					return -EFAULT;
4997 			}
4998 		} else {
4999 			info.jited_prog_insns = 0;
5000 		}
5001 	}
5002 
5003 	ulen = info.nr_jited_ksyms;
5004 	info.nr_jited_ksyms = prog->aux->func_cnt ? : 1;
5005 	if (ulen) {
5006 		if (bpf_dump_raw_ok(file->f_cred)) {
5007 			unsigned long ksym_addr;
5008 			u64 __user *user_ksyms;
5009 			u32 i;
5010 
5011 			/* copy the address of the kernel symbol
5012 			 * corresponding to each function
5013 			 */
5014 			ulen = min_t(u32, info.nr_jited_ksyms, ulen);
5015 			user_ksyms = u64_to_user_ptr(info.jited_ksyms);
5016 			if (prog->aux->func_cnt) {
5017 				for (i = 0; i < ulen; i++) {
5018 					ksym_addr = (unsigned long)
5019 						prog->aux->func[i]->bpf_func;
5020 					if (put_user((u64) ksym_addr,
5021 						     &user_ksyms[i]))
5022 						return -EFAULT;
5023 				}
5024 			} else {
5025 				ksym_addr = (unsigned long) prog->bpf_func;
5026 				if (put_user((u64) ksym_addr, &user_ksyms[0]))
5027 					return -EFAULT;
5028 			}
5029 		} else {
5030 			info.jited_ksyms = 0;
5031 		}
5032 	}
5033 
5034 	ulen = info.nr_jited_func_lens;
5035 	info.nr_jited_func_lens = prog->aux->func_cnt ? : 1;
5036 	if (ulen) {
5037 		if (bpf_dump_raw_ok(file->f_cred)) {
5038 			u32 __user *user_lens;
5039 			u32 func_len, i;
5040 
5041 			/* copy the JITed image lengths for each function */
5042 			ulen = min_t(u32, info.nr_jited_func_lens, ulen);
5043 			user_lens = u64_to_user_ptr(info.jited_func_lens);
5044 			if (prog->aux->func_cnt) {
5045 				for (i = 0; i < ulen; i++) {
5046 					func_len =
5047 						prog->aux->func[i]->jited_len;
5048 					if (put_user(func_len, &user_lens[i]))
5049 						return -EFAULT;
5050 				}
5051 			} else {
5052 				func_len = prog->jited_len;
5053 				if (put_user(func_len, &user_lens[0]))
5054 					return -EFAULT;
5055 			}
5056 		} else {
5057 			info.jited_func_lens = 0;
5058 		}
5059 	}
5060 
5061 	info.attach_btf_id = prog->aux->attach_btf_id;
5062 	if (attach_btf)
5063 		info.attach_btf_obj_id = btf_obj_id(attach_btf);
5064 
5065 	ulen = info.nr_func_info;
5066 	info.nr_func_info = prog->aux->func_info_cnt;
5067 	if (info.nr_func_info && ulen) {
5068 		char __user *user_finfo;
5069 
5070 		user_finfo = u64_to_user_ptr(info.func_info);
5071 		ulen = min_t(u32, info.nr_func_info, ulen);
5072 		if (copy_to_user(user_finfo, prog->aux->func_info,
5073 				 info.func_info_rec_size * ulen))
5074 			return -EFAULT;
5075 	}
5076 
5077 	ulen = info.nr_line_info;
5078 	info.nr_line_info = prog->aux->nr_linfo;
5079 	if (info.nr_line_info && ulen) {
5080 		__u8 __user *user_linfo;
5081 
5082 		user_linfo = u64_to_user_ptr(info.line_info);
5083 		ulen = min_t(u32, info.nr_line_info, ulen);
5084 		if (copy_to_user(user_linfo, prog->aux->linfo,
5085 				 info.line_info_rec_size * ulen))
5086 			return -EFAULT;
5087 	}
5088 
5089 	ulen = info.nr_jited_line_info;
5090 	if (prog->aux->jited_linfo)
5091 		info.nr_jited_line_info = prog->aux->nr_linfo;
5092 	else
5093 		info.nr_jited_line_info = 0;
5094 	if (info.nr_jited_line_info && ulen) {
5095 		if (bpf_dump_raw_ok(file->f_cred)) {
5096 			unsigned long line_addr;
5097 			__u64 __user *user_linfo;
5098 			u32 i;
5099 
5100 			user_linfo = u64_to_user_ptr(info.jited_line_info);
5101 			ulen = min_t(u32, info.nr_jited_line_info, ulen);
5102 			for (i = 0; i < ulen; i++) {
5103 				line_addr = (unsigned long)prog->aux->jited_linfo[i];
5104 				if (put_user((__u64)line_addr, &user_linfo[i]))
5105 					return -EFAULT;
5106 			}
5107 		} else {
5108 			info.jited_line_info = 0;
5109 		}
5110 	}
5111 
5112 	ulen = info.nr_prog_tags;
5113 	info.nr_prog_tags = prog->aux->func_cnt ? : 1;
5114 	if (ulen) {
5115 		__u8 __user (*user_prog_tags)[BPF_TAG_SIZE];
5116 		u32 i;
5117 
5118 		user_prog_tags = u64_to_user_ptr(info.prog_tags);
5119 		ulen = min_t(u32, info.nr_prog_tags, ulen);
5120 		if (prog->aux->func_cnt) {
5121 			for (i = 0; i < ulen; i++) {
5122 				if (copy_to_user(user_prog_tags[i],
5123 						 prog->aux->func[i]->tag,
5124 						 BPF_TAG_SIZE))
5125 					return -EFAULT;
5126 			}
5127 		} else {
5128 			if (copy_to_user(user_prog_tags[0],
5129 					 prog->tag, BPF_TAG_SIZE))
5130 				return -EFAULT;
5131 		}
5132 	}
5133 
5134 done:
5135 	if (copy_to_user(uinfo, &info, info_len) ||
5136 	    put_user(info_len, &uattr->info.info_len))
5137 		return -EFAULT;
5138 
5139 	return 0;
5140 }
5141 
5142 static int bpf_map_get_info_by_fd(struct file *file,
5143 				  struct bpf_map *map,
5144 				  const union bpf_attr *attr,
5145 				  union bpf_attr __user *uattr)
5146 {
5147 	struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
5148 	struct bpf_map_info info;
5149 	u32 info_len = attr->info.info_len;
5150 	int err;
5151 
5152 	err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
5153 	if (err)
5154 		return err;
5155 	info_len = min_t(u32, sizeof(info), info_len);
5156 
5157 	memset(&info, 0, sizeof(info));
5158 	info.type = map->map_type;
5159 	info.id = map->id;
5160 	info.key_size = map->key_size;
5161 	info.value_size = map->value_size;
5162 	info.max_entries = map->max_entries;
5163 	info.map_flags = map->map_flags;
5164 	info.map_extra = map->map_extra;
5165 	memcpy(info.name, map->name, sizeof(map->name));
5166 
5167 	if (map->btf) {
5168 		info.btf_id = btf_obj_id(map->btf);
5169 		info.btf_key_type_id = map->btf_key_type_id;
5170 		info.btf_value_type_id = map->btf_value_type_id;
5171 	}
5172 	info.btf_vmlinux_value_type_id = map->btf_vmlinux_value_type_id;
5173 	if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS)
5174 		bpf_map_struct_ops_info_fill(&info, map);
5175 
5176 	if (bpf_map_is_offloaded(map)) {
5177 		err = bpf_map_offload_info_fill(&info, map);
5178 		if (err)
5179 			return err;
5180 	}
5181 
5182 	if (copy_to_user(uinfo, &info, info_len) ||
5183 	    put_user(info_len, &uattr->info.info_len))
5184 		return -EFAULT;
5185 
5186 	return 0;
5187 }
5188 
5189 static int bpf_btf_get_info_by_fd(struct file *file,
5190 				  struct btf *btf,
5191 				  const union bpf_attr *attr,
5192 				  union bpf_attr __user *uattr)
5193 {
5194 	struct bpf_btf_info __user *uinfo = u64_to_user_ptr(attr->info.info);
5195 	u32 info_len = attr->info.info_len;
5196 	int err;
5197 
5198 	err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(*uinfo), info_len);
5199 	if (err)
5200 		return err;
5201 
5202 	return btf_get_info_by_fd(btf, attr, uattr);
5203 }
5204 
5205 static int bpf_link_get_info_by_fd(struct file *file,
5206 				  struct bpf_link *link,
5207 				  const union bpf_attr *attr,
5208 				  union bpf_attr __user *uattr)
5209 {
5210 	struct bpf_link_info __user *uinfo = u64_to_user_ptr(attr->info.info);
5211 	struct bpf_link_info info;
5212 	u32 info_len = attr->info.info_len;
5213 	int err;
5214 
5215 	err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
5216 	if (err)
5217 		return err;
5218 	info_len = min_t(u32, sizeof(info), info_len);
5219 
5220 	memset(&info, 0, sizeof(info));
5221 	if (copy_from_user(&info, uinfo, info_len))
5222 		return -EFAULT;
5223 
5224 	info.type = link->type;
5225 	info.id = link->id;
5226 	if (link->prog)
5227 		info.prog_id = link->prog->aux->id;
5228 
5229 	if (link->ops->fill_link_info) {
5230 		err = link->ops->fill_link_info(link, &info);
5231 		if (err)
5232 			return err;
5233 	}
5234 
5235 	if (copy_to_user(uinfo, &info, info_len) ||
5236 	    put_user(info_len, &uattr->info.info_len))
5237 		return -EFAULT;
5238 
5239 	return 0;
5240 }
5241 
5242 
5243 #define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
5244 
5245 static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
5246 				  union bpf_attr __user *uattr)
5247 {
5248 	if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
5249 		return -EINVAL;
5250 
5251 	CLASS(fd, f)(attr->info.bpf_fd);
5252 	if (fd_empty(f))
5253 		return -EBADFD;
5254 
5255 	if (fd_file(f)->f_op == &bpf_prog_fops)
5256 		return bpf_prog_get_info_by_fd(fd_file(f), fd_file(f)->private_data, attr,
5257 					      uattr);
5258 	else if (fd_file(f)->f_op == &bpf_map_fops)
5259 		return bpf_map_get_info_by_fd(fd_file(f), fd_file(f)->private_data, attr,
5260 					     uattr);
5261 	else if (fd_file(f)->f_op == &btf_fops)
5262 		return bpf_btf_get_info_by_fd(fd_file(f), fd_file(f)->private_data, attr, uattr);
5263 	else if (fd_file(f)->f_op == &bpf_link_fops || fd_file(f)->f_op == &bpf_link_fops_poll)
5264 		return bpf_link_get_info_by_fd(fd_file(f), fd_file(f)->private_data,
5265 					      attr, uattr);
5266 	return -EINVAL;
5267 }
5268 
5269 #define BPF_BTF_LOAD_LAST_FIELD btf_token_fd
5270 
5271 static int bpf_btf_load(const union bpf_attr *attr, bpfptr_t uattr, __u32 uattr_size)
5272 {
5273 	struct bpf_token *token = NULL;
5274 
5275 	if (CHECK_ATTR(BPF_BTF_LOAD))
5276 		return -EINVAL;
5277 
5278 	if (attr->btf_flags & ~BPF_F_TOKEN_FD)
5279 		return -EINVAL;
5280 
5281 	if (attr->btf_flags & BPF_F_TOKEN_FD) {
5282 		token = bpf_token_get_from_fd(attr->btf_token_fd);
5283 		if (IS_ERR(token))
5284 			return PTR_ERR(token);
5285 		if (!bpf_token_allow_cmd(token, BPF_BTF_LOAD)) {
5286 			bpf_token_put(token);
5287 			token = NULL;
5288 		}
5289 	}
5290 
5291 	if (!bpf_token_capable(token, CAP_BPF)) {
5292 		bpf_token_put(token);
5293 		return -EPERM;
5294 	}
5295 
5296 	bpf_token_put(token);
5297 
5298 	return btf_new_fd(attr, uattr, uattr_size);
5299 }
5300 
5301 #define BPF_BTF_GET_FD_BY_ID_LAST_FIELD fd_by_id_token_fd
5302 
5303 static int bpf_btf_get_fd_by_id(const union bpf_attr *attr)
5304 {
5305 	struct bpf_token *token = NULL;
5306 
5307 	if (CHECK_ATTR(BPF_BTF_GET_FD_BY_ID))
5308 		return -EINVAL;
5309 
5310 	if (attr->open_flags & ~BPF_F_TOKEN_FD)
5311 		return -EINVAL;
5312 
5313 	if (attr->open_flags & BPF_F_TOKEN_FD) {
5314 		token = bpf_token_get_from_fd(attr->fd_by_id_token_fd);
5315 		if (IS_ERR(token))
5316 			return PTR_ERR(token);
5317 		if (!bpf_token_allow_cmd(token, BPF_BTF_GET_FD_BY_ID)) {
5318 			bpf_token_put(token);
5319 			token = NULL;
5320 		}
5321 	}
5322 
5323 	if (!bpf_token_capable(token, CAP_SYS_ADMIN)) {
5324 		bpf_token_put(token);
5325 		return -EPERM;
5326 	}
5327 
5328 	bpf_token_put(token);
5329 
5330 	return btf_get_fd_by_id(attr->btf_id);
5331 }
5332 
5333 static int bpf_task_fd_query_copy(const union bpf_attr *attr,
5334 				    union bpf_attr __user *uattr,
5335 				    u32 prog_id, u32 fd_type,
5336 				    const char *buf, u64 probe_offset,
5337 				    u64 probe_addr)
5338 {
5339 	char __user *ubuf = u64_to_user_ptr(attr->task_fd_query.buf);
5340 	u32 len = buf ? strlen(buf) : 0, input_len;
5341 	int err = 0;
5342 
5343 	if (put_user(len, &uattr->task_fd_query.buf_len))
5344 		return -EFAULT;
5345 	input_len = attr->task_fd_query.buf_len;
5346 	if (input_len && ubuf) {
5347 		if (!len) {
5348 			/* nothing to copy, just make ubuf NULL terminated */
5349 			char zero = '\0';
5350 
5351 			if (put_user(zero, ubuf))
5352 				return -EFAULT;
5353 		} else {
5354 			err = bpf_copy_to_user(ubuf, buf, input_len, len);
5355 			if (err == -EFAULT)
5356 				return err;
5357 		}
5358 	}
5359 
5360 	if (put_user(prog_id, &uattr->task_fd_query.prog_id) ||
5361 	    put_user(fd_type, &uattr->task_fd_query.fd_type) ||
5362 	    put_user(probe_offset, &uattr->task_fd_query.probe_offset) ||
5363 	    put_user(probe_addr, &uattr->task_fd_query.probe_addr))
5364 		return -EFAULT;
5365 
5366 	return err;
5367 }
5368 
5369 #define BPF_TASK_FD_QUERY_LAST_FIELD task_fd_query.probe_addr
5370 
5371 static int bpf_task_fd_query(const union bpf_attr *attr,
5372 			     union bpf_attr __user *uattr)
5373 {
5374 	pid_t pid = attr->task_fd_query.pid;
5375 	u32 fd = attr->task_fd_query.fd;
5376 	const struct perf_event *event;
5377 	struct task_struct *task;
5378 	struct file *file;
5379 	int err;
5380 
5381 	if (CHECK_ATTR(BPF_TASK_FD_QUERY))
5382 		return -EINVAL;
5383 
5384 	if (!capable(CAP_SYS_ADMIN))
5385 		return -EPERM;
5386 
5387 	if (attr->task_fd_query.flags != 0)
5388 		return -EINVAL;
5389 
5390 	rcu_read_lock();
5391 	task = get_pid_task(find_vpid(pid), PIDTYPE_PID);
5392 	rcu_read_unlock();
5393 	if (!task)
5394 		return -ENOENT;
5395 
5396 	err = 0;
5397 	file = fget_task(task, fd);
5398 	put_task_struct(task);
5399 	if (!file)
5400 		return -EBADF;
5401 
5402 	if (file->f_op == &bpf_link_fops || file->f_op == &bpf_link_fops_poll) {
5403 		struct bpf_link *link = file->private_data;
5404 
5405 		if (link->ops == &bpf_raw_tp_link_lops) {
5406 			struct bpf_raw_tp_link *raw_tp =
5407 				container_of(link, struct bpf_raw_tp_link, link);
5408 			struct bpf_raw_event_map *btp = raw_tp->btp;
5409 
5410 			err = bpf_task_fd_query_copy(attr, uattr,
5411 						     raw_tp->link.prog->aux->id,
5412 						     BPF_FD_TYPE_RAW_TRACEPOINT,
5413 						     btp->tp->name, 0, 0);
5414 			goto put_file;
5415 		}
5416 		goto out_not_supp;
5417 	}
5418 
5419 	event = perf_get_event(file);
5420 	if (!IS_ERR(event)) {
5421 		u64 probe_offset, probe_addr;
5422 		u32 prog_id, fd_type;
5423 		const char *buf;
5424 
5425 		err = bpf_get_perf_event_info(event, &prog_id, &fd_type,
5426 					      &buf, &probe_offset,
5427 					      &probe_addr, NULL);
5428 		if (!err)
5429 			err = bpf_task_fd_query_copy(attr, uattr, prog_id,
5430 						     fd_type, buf,
5431 						     probe_offset,
5432 						     probe_addr);
5433 		goto put_file;
5434 	}
5435 
5436 out_not_supp:
5437 	err = -ENOTSUPP;
5438 put_file:
5439 	fput(file);
5440 	return err;
5441 }
5442 
5443 #define BPF_MAP_BATCH_LAST_FIELD batch.flags
5444 
5445 #define BPF_DO_BATCH(fn, ...)			\
5446 	do {					\
5447 		if (!fn) {			\
5448 			err = -ENOTSUPP;	\
5449 			goto err_put;		\
5450 		}				\
5451 		err = fn(__VA_ARGS__);		\
5452 	} while (0)
5453 
5454 static int bpf_map_do_batch(const union bpf_attr *attr,
5455 			    union bpf_attr __user *uattr,
5456 			    int cmd)
5457 {
5458 	bool has_read  = cmd == BPF_MAP_LOOKUP_BATCH ||
5459 			 cmd == BPF_MAP_LOOKUP_AND_DELETE_BATCH;
5460 	bool has_write = cmd != BPF_MAP_LOOKUP_BATCH;
5461 	struct bpf_map *map;
5462 	int err;
5463 
5464 	if (CHECK_ATTR(BPF_MAP_BATCH))
5465 		return -EINVAL;
5466 
5467 	CLASS(fd, f)(attr->batch.map_fd);
5468 
5469 	map = __bpf_map_get(f);
5470 	if (IS_ERR(map))
5471 		return PTR_ERR(map);
5472 	if (has_write)
5473 		bpf_map_write_active_inc(map);
5474 	if (has_read && !(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
5475 		err = -EPERM;
5476 		goto err_put;
5477 	}
5478 	if (has_write && !(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
5479 		err = -EPERM;
5480 		goto err_put;
5481 	}
5482 
5483 	if (cmd == BPF_MAP_LOOKUP_BATCH)
5484 		BPF_DO_BATCH(map->ops->map_lookup_batch, map, attr, uattr);
5485 	else if (cmd == BPF_MAP_LOOKUP_AND_DELETE_BATCH)
5486 		BPF_DO_BATCH(map->ops->map_lookup_and_delete_batch, map, attr, uattr);
5487 	else if (cmd == BPF_MAP_UPDATE_BATCH)
5488 		BPF_DO_BATCH(map->ops->map_update_batch, map, fd_file(f), attr, uattr);
5489 	else
5490 		BPF_DO_BATCH(map->ops->map_delete_batch, map, attr, uattr);
5491 err_put:
5492 	if (has_write) {
5493 		maybe_wait_bpf_programs(map);
5494 		bpf_map_write_active_dec(map);
5495 	}
5496 	return err;
5497 }
5498 
5499 #define BPF_LINK_CREATE_LAST_FIELD link_create.uprobe_multi.pid
5500 static int link_create(union bpf_attr *attr, bpfptr_t uattr)
5501 {
5502 	struct bpf_prog *prog;
5503 	int ret;
5504 
5505 	if (CHECK_ATTR(BPF_LINK_CREATE))
5506 		return -EINVAL;
5507 
5508 	if (attr->link_create.attach_type == BPF_STRUCT_OPS)
5509 		return bpf_struct_ops_link_create(attr);
5510 
5511 	prog = bpf_prog_get(attr->link_create.prog_fd);
5512 	if (IS_ERR(prog))
5513 		return PTR_ERR(prog);
5514 
5515 	ret = bpf_prog_attach_check_attach_type(prog,
5516 						attr->link_create.attach_type);
5517 	if (ret)
5518 		goto out;
5519 
5520 	switch (prog->type) {
5521 	case BPF_PROG_TYPE_CGROUP_SKB:
5522 	case BPF_PROG_TYPE_CGROUP_SOCK:
5523 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
5524 	case BPF_PROG_TYPE_SOCK_OPS:
5525 	case BPF_PROG_TYPE_CGROUP_DEVICE:
5526 	case BPF_PROG_TYPE_CGROUP_SYSCTL:
5527 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
5528 		ret = cgroup_bpf_link_attach(attr, prog);
5529 		break;
5530 	case BPF_PROG_TYPE_EXT:
5531 		ret = bpf_tracing_prog_attach(prog,
5532 					      attr->link_create.target_fd,
5533 					      attr->link_create.target_btf_id,
5534 					      attr->link_create.tracing.cookie,
5535 					      attr->link_create.attach_type);
5536 		break;
5537 	case BPF_PROG_TYPE_LSM:
5538 	case BPF_PROG_TYPE_TRACING:
5539 		if (attr->link_create.attach_type != prog->expected_attach_type) {
5540 			ret = -EINVAL;
5541 			goto out;
5542 		}
5543 		if (prog->expected_attach_type == BPF_TRACE_RAW_TP)
5544 			ret = bpf_raw_tp_link_attach(prog, NULL, attr->link_create.tracing.cookie,
5545 						     attr->link_create.attach_type);
5546 		else if (prog->expected_attach_type == BPF_TRACE_ITER)
5547 			ret = bpf_iter_link_attach(attr, uattr, prog);
5548 		else if (prog->expected_attach_type == BPF_LSM_CGROUP)
5549 			ret = cgroup_bpf_link_attach(attr, prog);
5550 		else
5551 			ret = bpf_tracing_prog_attach(prog,
5552 						      attr->link_create.target_fd,
5553 						      attr->link_create.target_btf_id,
5554 						      attr->link_create.tracing.cookie,
5555 						      attr->link_create.attach_type);
5556 		break;
5557 	case BPF_PROG_TYPE_FLOW_DISSECTOR:
5558 	case BPF_PROG_TYPE_SK_LOOKUP:
5559 		ret = netns_bpf_link_create(attr, prog);
5560 		break;
5561 	case BPF_PROG_TYPE_SK_MSG:
5562 	case BPF_PROG_TYPE_SK_SKB:
5563 		ret = sock_map_link_create(attr, prog);
5564 		break;
5565 #ifdef CONFIG_NET
5566 	case BPF_PROG_TYPE_XDP:
5567 		ret = bpf_xdp_link_attach(attr, prog);
5568 		break;
5569 	case BPF_PROG_TYPE_SCHED_CLS:
5570 		if (attr->link_create.attach_type == BPF_TCX_INGRESS ||
5571 		    attr->link_create.attach_type == BPF_TCX_EGRESS)
5572 			ret = tcx_link_attach(attr, prog);
5573 		else
5574 			ret = netkit_link_attach(attr, prog);
5575 		break;
5576 	case BPF_PROG_TYPE_NETFILTER:
5577 		ret = bpf_nf_link_attach(attr, prog);
5578 		break;
5579 #endif
5580 	case BPF_PROG_TYPE_PERF_EVENT:
5581 	case BPF_PROG_TYPE_TRACEPOINT:
5582 		ret = bpf_perf_link_attach(attr, prog);
5583 		break;
5584 	case BPF_PROG_TYPE_KPROBE:
5585 		if (attr->link_create.attach_type == BPF_PERF_EVENT)
5586 			ret = bpf_perf_link_attach(attr, prog);
5587 		else if (attr->link_create.attach_type == BPF_TRACE_KPROBE_MULTI ||
5588 			 attr->link_create.attach_type == BPF_TRACE_KPROBE_SESSION)
5589 			ret = bpf_kprobe_multi_link_attach(attr, prog);
5590 		else if (attr->link_create.attach_type == BPF_TRACE_UPROBE_MULTI ||
5591 			 attr->link_create.attach_type == BPF_TRACE_UPROBE_SESSION)
5592 			ret = bpf_uprobe_multi_link_attach(attr, prog);
5593 		break;
5594 	default:
5595 		ret = -EINVAL;
5596 	}
5597 
5598 out:
5599 	if (ret < 0)
5600 		bpf_prog_put(prog);
5601 	return ret;
5602 }
5603 
5604 static int link_update_map(struct bpf_link *link, union bpf_attr *attr)
5605 {
5606 	struct bpf_map *new_map, *old_map = NULL;
5607 	int ret;
5608 
5609 	new_map = bpf_map_get(attr->link_update.new_map_fd);
5610 	if (IS_ERR(new_map))
5611 		return PTR_ERR(new_map);
5612 
5613 	if (attr->link_update.flags & BPF_F_REPLACE) {
5614 		old_map = bpf_map_get(attr->link_update.old_map_fd);
5615 		if (IS_ERR(old_map)) {
5616 			ret = PTR_ERR(old_map);
5617 			goto out_put;
5618 		}
5619 	} else if (attr->link_update.old_map_fd) {
5620 		ret = -EINVAL;
5621 		goto out_put;
5622 	}
5623 
5624 	ret = link->ops->update_map(link, new_map, old_map);
5625 
5626 	if (old_map)
5627 		bpf_map_put(old_map);
5628 out_put:
5629 	bpf_map_put(new_map);
5630 	return ret;
5631 }
5632 
5633 #define BPF_LINK_UPDATE_LAST_FIELD link_update.old_prog_fd
5634 
5635 static int link_update(union bpf_attr *attr)
5636 {
5637 	struct bpf_prog *old_prog = NULL, *new_prog;
5638 	struct bpf_link *link;
5639 	u32 flags;
5640 	int ret;
5641 
5642 	if (CHECK_ATTR(BPF_LINK_UPDATE))
5643 		return -EINVAL;
5644 
5645 	flags = attr->link_update.flags;
5646 	if (flags & ~BPF_F_REPLACE)
5647 		return -EINVAL;
5648 
5649 	link = bpf_link_get_from_fd(attr->link_update.link_fd);
5650 	if (IS_ERR(link))
5651 		return PTR_ERR(link);
5652 
5653 	if (link->ops->update_map) {
5654 		ret = link_update_map(link, attr);
5655 		goto out_put_link;
5656 	}
5657 
5658 	new_prog = bpf_prog_get(attr->link_update.new_prog_fd);
5659 	if (IS_ERR(new_prog)) {
5660 		ret = PTR_ERR(new_prog);
5661 		goto out_put_link;
5662 	}
5663 
5664 	if (flags & BPF_F_REPLACE) {
5665 		old_prog = bpf_prog_get(attr->link_update.old_prog_fd);
5666 		if (IS_ERR(old_prog)) {
5667 			ret = PTR_ERR(old_prog);
5668 			old_prog = NULL;
5669 			goto out_put_progs;
5670 		}
5671 	} else if (attr->link_update.old_prog_fd) {
5672 		ret = -EINVAL;
5673 		goto out_put_progs;
5674 	}
5675 
5676 	if (link->ops->update_prog)
5677 		ret = link->ops->update_prog(link, new_prog, old_prog);
5678 	else
5679 		ret = -EINVAL;
5680 
5681 out_put_progs:
5682 	if (old_prog)
5683 		bpf_prog_put(old_prog);
5684 	if (ret)
5685 		bpf_prog_put(new_prog);
5686 out_put_link:
5687 	bpf_link_put_direct(link);
5688 	return ret;
5689 }
5690 
5691 #define BPF_LINK_DETACH_LAST_FIELD link_detach.link_fd
5692 
5693 static int link_detach(union bpf_attr *attr)
5694 {
5695 	struct bpf_link *link;
5696 	int ret;
5697 
5698 	if (CHECK_ATTR(BPF_LINK_DETACH))
5699 		return -EINVAL;
5700 
5701 	link = bpf_link_get_from_fd(attr->link_detach.link_fd);
5702 	if (IS_ERR(link))
5703 		return PTR_ERR(link);
5704 
5705 	if (link->ops->detach)
5706 		ret = link->ops->detach(link);
5707 	else
5708 		ret = -EOPNOTSUPP;
5709 
5710 	bpf_link_put_direct(link);
5711 	return ret;
5712 }
5713 
5714 struct bpf_link *bpf_link_inc_not_zero(struct bpf_link *link)
5715 {
5716 	return atomic64_fetch_add_unless(&link->refcnt, 1, 0) ? link : ERR_PTR(-ENOENT);
5717 }
5718 EXPORT_SYMBOL(bpf_link_inc_not_zero);
5719 
5720 struct bpf_link *bpf_link_by_id(u32 id)
5721 {
5722 	struct bpf_link *link;
5723 
5724 	if (!id)
5725 		return ERR_PTR(-ENOENT);
5726 
5727 	spin_lock_bh(&link_idr_lock);
5728 	/* before link is "settled", ID is 0, pretend it doesn't exist yet */
5729 	link = idr_find(&link_idr, id);
5730 	if (link) {
5731 		if (link->id)
5732 			link = bpf_link_inc_not_zero(link);
5733 		else
5734 			link = ERR_PTR(-EAGAIN);
5735 	} else {
5736 		link = ERR_PTR(-ENOENT);
5737 	}
5738 	spin_unlock_bh(&link_idr_lock);
5739 	return link;
5740 }
5741 
5742 struct bpf_link *bpf_link_get_curr_or_next(u32 *id)
5743 {
5744 	struct bpf_link *link;
5745 
5746 	spin_lock_bh(&link_idr_lock);
5747 again:
5748 	link = idr_get_next(&link_idr, id);
5749 	if (link) {
5750 		link = bpf_link_inc_not_zero(link);
5751 		if (IS_ERR(link)) {
5752 			(*id)++;
5753 			goto again;
5754 		}
5755 	}
5756 	spin_unlock_bh(&link_idr_lock);
5757 
5758 	return link;
5759 }
5760 
5761 #define BPF_LINK_GET_FD_BY_ID_LAST_FIELD link_id
5762 
5763 static int bpf_link_get_fd_by_id(const union bpf_attr *attr)
5764 {
5765 	struct bpf_link *link;
5766 	u32 id = attr->link_id;
5767 	int fd;
5768 
5769 	if (CHECK_ATTR(BPF_LINK_GET_FD_BY_ID))
5770 		return -EINVAL;
5771 
5772 	if (!capable(CAP_SYS_ADMIN))
5773 		return -EPERM;
5774 
5775 	link = bpf_link_by_id(id);
5776 	if (IS_ERR(link))
5777 		return PTR_ERR(link);
5778 
5779 	fd = bpf_link_new_fd(link);
5780 	if (fd < 0)
5781 		bpf_link_put_direct(link);
5782 
5783 	return fd;
5784 }
5785 
5786 DEFINE_MUTEX(bpf_stats_enabled_mutex);
5787 
5788 static int bpf_stats_release(struct inode *inode, struct file *file)
5789 {
5790 	mutex_lock(&bpf_stats_enabled_mutex);
5791 	static_key_slow_dec(&bpf_stats_enabled_key.key);
5792 	mutex_unlock(&bpf_stats_enabled_mutex);
5793 	return 0;
5794 }
5795 
5796 static const struct file_operations bpf_stats_fops = {
5797 	.release = bpf_stats_release,
5798 };
5799 
5800 static int bpf_enable_runtime_stats(void)
5801 {
5802 	int fd;
5803 
5804 	mutex_lock(&bpf_stats_enabled_mutex);
5805 
5806 	/* Set a very high limit to avoid overflow */
5807 	if (static_key_count(&bpf_stats_enabled_key.key) > INT_MAX / 2) {
5808 		mutex_unlock(&bpf_stats_enabled_mutex);
5809 		return -EBUSY;
5810 	}
5811 
5812 	fd = anon_inode_getfd("bpf-stats", &bpf_stats_fops, NULL, O_CLOEXEC);
5813 	if (fd >= 0)
5814 		static_key_slow_inc(&bpf_stats_enabled_key.key);
5815 
5816 	mutex_unlock(&bpf_stats_enabled_mutex);
5817 	return fd;
5818 }
5819 
5820 #define BPF_ENABLE_STATS_LAST_FIELD enable_stats.type
5821 
5822 static int bpf_enable_stats(union bpf_attr *attr)
5823 {
5824 
5825 	if (CHECK_ATTR(BPF_ENABLE_STATS))
5826 		return -EINVAL;
5827 
5828 	if (!capable(CAP_SYS_ADMIN))
5829 		return -EPERM;
5830 
5831 	switch (attr->enable_stats.type) {
5832 	case BPF_STATS_RUN_TIME:
5833 		return bpf_enable_runtime_stats();
5834 	default:
5835 		break;
5836 	}
5837 	return -EINVAL;
5838 }
5839 
5840 #define BPF_ITER_CREATE_LAST_FIELD iter_create.flags
5841 
5842 static int bpf_iter_create(union bpf_attr *attr)
5843 {
5844 	struct bpf_link *link;
5845 	int err;
5846 
5847 	if (CHECK_ATTR(BPF_ITER_CREATE))
5848 		return -EINVAL;
5849 
5850 	if (attr->iter_create.flags)
5851 		return -EINVAL;
5852 
5853 	link = bpf_link_get_from_fd(attr->iter_create.link_fd);
5854 	if (IS_ERR(link))
5855 		return PTR_ERR(link);
5856 
5857 	err = bpf_iter_new_fd(link);
5858 	bpf_link_put_direct(link);
5859 
5860 	return err;
5861 }
5862 
5863 #define BPF_PROG_BIND_MAP_LAST_FIELD prog_bind_map.flags
5864 
5865 static int bpf_prog_bind_map(union bpf_attr *attr)
5866 {
5867 	struct bpf_prog *prog;
5868 	struct bpf_map *map;
5869 	struct bpf_map **used_maps_old, **used_maps_new;
5870 	int i, ret = 0;
5871 
5872 	if (CHECK_ATTR(BPF_PROG_BIND_MAP))
5873 		return -EINVAL;
5874 
5875 	if (attr->prog_bind_map.flags)
5876 		return -EINVAL;
5877 
5878 	prog = bpf_prog_get(attr->prog_bind_map.prog_fd);
5879 	if (IS_ERR(prog))
5880 		return PTR_ERR(prog);
5881 
5882 	map = bpf_map_get(attr->prog_bind_map.map_fd);
5883 	if (IS_ERR(map)) {
5884 		ret = PTR_ERR(map);
5885 		goto out_prog_put;
5886 	}
5887 
5888 	mutex_lock(&prog->aux->used_maps_mutex);
5889 
5890 	used_maps_old = prog->aux->used_maps;
5891 
5892 	for (i = 0; i < prog->aux->used_map_cnt; i++)
5893 		if (used_maps_old[i] == map) {
5894 			bpf_map_put(map);
5895 			goto out_unlock;
5896 		}
5897 
5898 	used_maps_new = kmalloc_array(prog->aux->used_map_cnt + 1,
5899 				      sizeof(used_maps_new[0]),
5900 				      GFP_KERNEL);
5901 	if (!used_maps_new) {
5902 		ret = -ENOMEM;
5903 		goto out_unlock;
5904 	}
5905 
5906 	/* The bpf program will not access the bpf map, but for the sake of
5907 	 * simplicity, increase sleepable_refcnt for sleepable program as well.
5908 	 */
5909 	if (prog->sleepable)
5910 		atomic64_inc(&map->sleepable_refcnt);
5911 	memcpy(used_maps_new, used_maps_old,
5912 	       sizeof(used_maps_old[0]) * prog->aux->used_map_cnt);
5913 	used_maps_new[prog->aux->used_map_cnt] = map;
5914 
5915 	prog->aux->used_map_cnt++;
5916 	prog->aux->used_maps = used_maps_new;
5917 
5918 	kfree(used_maps_old);
5919 
5920 out_unlock:
5921 	mutex_unlock(&prog->aux->used_maps_mutex);
5922 
5923 	if (ret)
5924 		bpf_map_put(map);
5925 out_prog_put:
5926 	bpf_prog_put(prog);
5927 	return ret;
5928 }
5929 
5930 #define BPF_TOKEN_CREATE_LAST_FIELD token_create.bpffs_fd
5931 
5932 static int token_create(union bpf_attr *attr)
5933 {
5934 	if (CHECK_ATTR(BPF_TOKEN_CREATE))
5935 		return -EINVAL;
5936 
5937 	/* no flags are supported yet */
5938 	if (attr->token_create.flags)
5939 		return -EINVAL;
5940 
5941 	return bpf_token_create(attr);
5942 }
5943 
5944 #define BPF_PROG_STREAM_READ_BY_FD_LAST_FIELD prog_stream_read.prog_fd
5945 
5946 static int prog_stream_read(union bpf_attr *attr)
5947 {
5948 	char __user *buf = u64_to_user_ptr(attr->prog_stream_read.stream_buf);
5949 	u32 len = attr->prog_stream_read.stream_buf_len;
5950 	struct bpf_prog *prog;
5951 	int ret;
5952 
5953 	if (CHECK_ATTR(BPF_PROG_STREAM_READ_BY_FD))
5954 		return -EINVAL;
5955 
5956 	prog = bpf_prog_get(attr->prog_stream_read.prog_fd);
5957 	if (IS_ERR(prog))
5958 		return PTR_ERR(prog);
5959 
5960 	ret = bpf_prog_stream_read(prog, attr->prog_stream_read.stream_id, buf, len);
5961 	bpf_prog_put(prog);
5962 
5963 	return ret;
5964 }
5965 
5966 static int __sys_bpf(enum bpf_cmd cmd, bpfptr_t uattr, unsigned int size)
5967 {
5968 	union bpf_attr attr;
5969 	int err;
5970 
5971 	err = bpf_check_uarg_tail_zero(uattr, sizeof(attr), size);
5972 	if (err)
5973 		return err;
5974 	size = min_t(u32, size, sizeof(attr));
5975 
5976 	/* copy attributes from user space, may be less than sizeof(bpf_attr) */
5977 	memset(&attr, 0, sizeof(attr));
5978 	if (copy_from_bpfptr(&attr, uattr, size) != 0)
5979 		return -EFAULT;
5980 
5981 	err = security_bpf(cmd, &attr, size, uattr.is_kernel);
5982 	if (err < 0)
5983 		return err;
5984 
5985 	switch (cmd) {
5986 	case BPF_MAP_CREATE:
5987 		err = map_create(&attr, uattr.is_kernel);
5988 		break;
5989 	case BPF_MAP_LOOKUP_ELEM:
5990 		err = map_lookup_elem(&attr);
5991 		break;
5992 	case BPF_MAP_UPDATE_ELEM:
5993 		err = map_update_elem(&attr, uattr);
5994 		break;
5995 	case BPF_MAP_DELETE_ELEM:
5996 		err = map_delete_elem(&attr, uattr);
5997 		break;
5998 	case BPF_MAP_GET_NEXT_KEY:
5999 		err = map_get_next_key(&attr);
6000 		break;
6001 	case BPF_MAP_FREEZE:
6002 		err = map_freeze(&attr);
6003 		break;
6004 	case BPF_PROG_LOAD:
6005 		err = bpf_prog_load(&attr, uattr, size);
6006 		break;
6007 	case BPF_OBJ_PIN:
6008 		err = bpf_obj_pin(&attr);
6009 		break;
6010 	case BPF_OBJ_GET:
6011 		err = bpf_obj_get(&attr);
6012 		break;
6013 	case BPF_PROG_ATTACH:
6014 		err = bpf_prog_attach(&attr);
6015 		break;
6016 	case BPF_PROG_DETACH:
6017 		err = bpf_prog_detach(&attr);
6018 		break;
6019 	case BPF_PROG_QUERY:
6020 		err = bpf_prog_query(&attr, uattr.user);
6021 		break;
6022 	case BPF_PROG_TEST_RUN:
6023 		err = bpf_prog_test_run(&attr, uattr.user);
6024 		break;
6025 	case BPF_PROG_GET_NEXT_ID:
6026 		err = bpf_obj_get_next_id(&attr, uattr.user,
6027 					  &prog_idr, &prog_idr_lock);
6028 		break;
6029 	case BPF_MAP_GET_NEXT_ID:
6030 		err = bpf_obj_get_next_id(&attr, uattr.user,
6031 					  &map_idr, &map_idr_lock);
6032 		break;
6033 	case BPF_BTF_GET_NEXT_ID:
6034 		err = bpf_obj_get_next_id(&attr, uattr.user,
6035 					  &btf_idr, &btf_idr_lock);
6036 		break;
6037 	case BPF_PROG_GET_FD_BY_ID:
6038 		err = bpf_prog_get_fd_by_id(&attr);
6039 		break;
6040 	case BPF_MAP_GET_FD_BY_ID:
6041 		err = bpf_map_get_fd_by_id(&attr);
6042 		break;
6043 	case BPF_OBJ_GET_INFO_BY_FD:
6044 		err = bpf_obj_get_info_by_fd(&attr, uattr.user);
6045 		break;
6046 	case BPF_RAW_TRACEPOINT_OPEN:
6047 		err = bpf_raw_tracepoint_open(&attr);
6048 		break;
6049 	case BPF_BTF_LOAD:
6050 		err = bpf_btf_load(&attr, uattr, size);
6051 		break;
6052 	case BPF_BTF_GET_FD_BY_ID:
6053 		err = bpf_btf_get_fd_by_id(&attr);
6054 		break;
6055 	case BPF_TASK_FD_QUERY:
6056 		err = bpf_task_fd_query(&attr, uattr.user);
6057 		break;
6058 	case BPF_MAP_LOOKUP_AND_DELETE_ELEM:
6059 		err = map_lookup_and_delete_elem(&attr);
6060 		break;
6061 	case BPF_MAP_LOOKUP_BATCH:
6062 		err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_LOOKUP_BATCH);
6063 		break;
6064 	case BPF_MAP_LOOKUP_AND_DELETE_BATCH:
6065 		err = bpf_map_do_batch(&attr, uattr.user,
6066 				       BPF_MAP_LOOKUP_AND_DELETE_BATCH);
6067 		break;
6068 	case BPF_MAP_UPDATE_BATCH:
6069 		err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_UPDATE_BATCH);
6070 		break;
6071 	case BPF_MAP_DELETE_BATCH:
6072 		err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_DELETE_BATCH);
6073 		break;
6074 	case BPF_LINK_CREATE:
6075 		err = link_create(&attr, uattr);
6076 		break;
6077 	case BPF_LINK_UPDATE:
6078 		err = link_update(&attr);
6079 		break;
6080 	case BPF_LINK_GET_FD_BY_ID:
6081 		err = bpf_link_get_fd_by_id(&attr);
6082 		break;
6083 	case BPF_LINK_GET_NEXT_ID:
6084 		err = bpf_obj_get_next_id(&attr, uattr.user,
6085 					  &link_idr, &link_idr_lock);
6086 		break;
6087 	case BPF_ENABLE_STATS:
6088 		err = bpf_enable_stats(&attr);
6089 		break;
6090 	case BPF_ITER_CREATE:
6091 		err = bpf_iter_create(&attr);
6092 		break;
6093 	case BPF_LINK_DETACH:
6094 		err = link_detach(&attr);
6095 		break;
6096 	case BPF_PROG_BIND_MAP:
6097 		err = bpf_prog_bind_map(&attr);
6098 		break;
6099 	case BPF_TOKEN_CREATE:
6100 		err = token_create(&attr);
6101 		break;
6102 	case BPF_PROG_STREAM_READ_BY_FD:
6103 		err = prog_stream_read(&attr);
6104 		break;
6105 	default:
6106 		err = -EINVAL;
6107 		break;
6108 	}
6109 
6110 	return err;
6111 }
6112 
6113 SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
6114 {
6115 	return __sys_bpf(cmd, USER_BPFPTR(uattr), size);
6116 }
6117 
6118 static bool syscall_prog_is_valid_access(int off, int size,
6119 					 enum bpf_access_type type,
6120 					 const struct bpf_prog *prog,
6121 					 struct bpf_insn_access_aux *info)
6122 {
6123 	if (off < 0 || off >= U16_MAX)
6124 		return false;
6125 	if (off % size != 0)
6126 		return false;
6127 	return true;
6128 }
6129 
6130 BPF_CALL_3(bpf_sys_bpf, int, cmd, union bpf_attr *, attr, u32, attr_size)
6131 {
6132 	switch (cmd) {
6133 	case BPF_MAP_CREATE:
6134 	case BPF_MAP_DELETE_ELEM:
6135 	case BPF_MAP_UPDATE_ELEM:
6136 	case BPF_MAP_FREEZE:
6137 	case BPF_MAP_GET_FD_BY_ID:
6138 	case BPF_PROG_LOAD:
6139 	case BPF_BTF_LOAD:
6140 	case BPF_LINK_CREATE:
6141 	case BPF_RAW_TRACEPOINT_OPEN:
6142 		break;
6143 	default:
6144 		return -EINVAL;
6145 	}
6146 	return __sys_bpf(cmd, KERNEL_BPFPTR(attr), attr_size);
6147 }
6148 
6149 
6150 /* To shut up -Wmissing-prototypes.
6151  * This function is used by the kernel light skeleton
6152  * to load bpf programs when modules are loaded or during kernel boot.
6153  * See tools/lib/bpf/skel_internal.h
6154  */
6155 int kern_sys_bpf(int cmd, union bpf_attr *attr, unsigned int size);
6156 
6157 int kern_sys_bpf(int cmd, union bpf_attr *attr, unsigned int size)
6158 {
6159 	struct bpf_prog * __maybe_unused prog;
6160 	struct bpf_tramp_run_ctx __maybe_unused run_ctx;
6161 
6162 	switch (cmd) {
6163 #ifdef CONFIG_BPF_JIT /* __bpf_prog_enter_sleepable used by trampoline and JIT */
6164 	case BPF_PROG_TEST_RUN:
6165 		if (attr->test.data_in || attr->test.data_out ||
6166 		    attr->test.ctx_out || attr->test.duration ||
6167 		    attr->test.repeat || attr->test.flags)
6168 			return -EINVAL;
6169 
6170 		prog = bpf_prog_get_type(attr->test.prog_fd, BPF_PROG_TYPE_SYSCALL);
6171 		if (IS_ERR(prog))
6172 			return PTR_ERR(prog);
6173 
6174 		if (attr->test.ctx_size_in < prog->aux->max_ctx_offset ||
6175 		    attr->test.ctx_size_in > U16_MAX) {
6176 			bpf_prog_put(prog);
6177 			return -EINVAL;
6178 		}
6179 
6180 		run_ctx.bpf_cookie = 0;
6181 		if (!__bpf_prog_enter_sleepable_recur(prog, &run_ctx)) {
6182 			/* recursion detected */
6183 			__bpf_prog_exit_sleepable_recur(prog, 0, &run_ctx);
6184 			bpf_prog_put(prog);
6185 			return -EBUSY;
6186 		}
6187 		attr->test.retval = bpf_prog_run(prog, (void *) (long) attr->test.ctx_in);
6188 		__bpf_prog_exit_sleepable_recur(prog, 0 /* bpf_prog_run does runtime stats */,
6189 						&run_ctx);
6190 		bpf_prog_put(prog);
6191 		return 0;
6192 #endif
6193 	default:
6194 		return ____bpf_sys_bpf(cmd, attr, size);
6195 	}
6196 }
6197 EXPORT_SYMBOL_NS(kern_sys_bpf, "BPF_INTERNAL");
6198 
6199 static const struct bpf_func_proto bpf_sys_bpf_proto = {
6200 	.func		= bpf_sys_bpf,
6201 	.gpl_only	= false,
6202 	.ret_type	= RET_INTEGER,
6203 	.arg1_type	= ARG_ANYTHING,
6204 	.arg2_type	= ARG_PTR_TO_MEM | MEM_RDONLY,
6205 	.arg3_type	= ARG_CONST_SIZE,
6206 };
6207 
6208 const struct bpf_func_proto * __weak
6209 tracing_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
6210 {
6211 	return bpf_base_func_proto(func_id, prog);
6212 }
6213 
6214 BPF_CALL_1(bpf_sys_close, u32, fd)
6215 {
6216 	/* When bpf program calls this helper there should not be
6217 	 * an fdget() without matching completed fdput().
6218 	 * This helper is allowed in the following callchain only:
6219 	 * sys_bpf->prog_test_run->bpf_prog->bpf_sys_close
6220 	 */
6221 	return close_fd(fd);
6222 }
6223 
6224 static const struct bpf_func_proto bpf_sys_close_proto = {
6225 	.func		= bpf_sys_close,
6226 	.gpl_only	= false,
6227 	.ret_type	= RET_INTEGER,
6228 	.arg1_type	= ARG_ANYTHING,
6229 };
6230 
6231 BPF_CALL_4(bpf_kallsyms_lookup_name, const char *, name, int, name_sz, int, flags, u64 *, res)
6232 {
6233 	*res = 0;
6234 	if (flags)
6235 		return -EINVAL;
6236 
6237 	if (name_sz <= 1 || name[name_sz - 1])
6238 		return -EINVAL;
6239 
6240 	if (!bpf_dump_raw_ok(current_cred()))
6241 		return -EPERM;
6242 
6243 	*res = kallsyms_lookup_name(name);
6244 	return *res ? 0 : -ENOENT;
6245 }
6246 
6247 static const struct bpf_func_proto bpf_kallsyms_lookup_name_proto = {
6248 	.func		= bpf_kallsyms_lookup_name,
6249 	.gpl_only	= false,
6250 	.ret_type	= RET_INTEGER,
6251 	.arg1_type	= ARG_PTR_TO_MEM,
6252 	.arg2_type	= ARG_CONST_SIZE_OR_ZERO,
6253 	.arg3_type	= ARG_ANYTHING,
6254 	.arg4_type	= ARG_PTR_TO_FIXED_SIZE_MEM | MEM_UNINIT | MEM_WRITE | MEM_ALIGNED,
6255 	.arg4_size	= sizeof(u64),
6256 };
6257 
6258 static const struct bpf_func_proto *
6259 syscall_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
6260 {
6261 	switch (func_id) {
6262 	case BPF_FUNC_sys_bpf:
6263 		return !bpf_token_capable(prog->aux->token, CAP_PERFMON)
6264 		       ? NULL : &bpf_sys_bpf_proto;
6265 	case BPF_FUNC_btf_find_by_name_kind:
6266 		return &bpf_btf_find_by_name_kind_proto;
6267 	case BPF_FUNC_sys_close:
6268 		return &bpf_sys_close_proto;
6269 	case BPF_FUNC_kallsyms_lookup_name:
6270 		return &bpf_kallsyms_lookup_name_proto;
6271 	default:
6272 		return tracing_prog_func_proto(func_id, prog);
6273 	}
6274 }
6275 
6276 const struct bpf_verifier_ops bpf_syscall_verifier_ops = {
6277 	.get_func_proto  = syscall_prog_func_proto,
6278 	.is_valid_access = syscall_prog_is_valid_access,
6279 };
6280 
6281 const struct bpf_prog_ops bpf_syscall_prog_ops = {
6282 	.test_run = bpf_prog_test_run_syscall,
6283 };
6284 
6285 #ifdef CONFIG_SYSCTL
6286 static int bpf_stats_handler(const struct ctl_table *table, int write,
6287 			     void *buffer, size_t *lenp, loff_t *ppos)
6288 {
6289 	struct static_key *key = (struct static_key *)table->data;
6290 	static int saved_val;
6291 	int val, ret;
6292 	struct ctl_table tmp = {
6293 		.data   = &val,
6294 		.maxlen = sizeof(val),
6295 		.mode   = table->mode,
6296 		.extra1 = SYSCTL_ZERO,
6297 		.extra2 = SYSCTL_ONE,
6298 	};
6299 
6300 	if (write && !capable(CAP_SYS_ADMIN))
6301 		return -EPERM;
6302 
6303 	mutex_lock(&bpf_stats_enabled_mutex);
6304 	val = saved_val;
6305 	ret = proc_dointvec_minmax(&tmp, write, buffer, lenp, ppos);
6306 	if (write && !ret && val != saved_val) {
6307 		if (val)
6308 			static_key_slow_inc(key);
6309 		else
6310 			static_key_slow_dec(key);
6311 		saved_val = val;
6312 	}
6313 	mutex_unlock(&bpf_stats_enabled_mutex);
6314 	return ret;
6315 }
6316 
6317 void __weak unpriv_ebpf_notify(int new_state)
6318 {
6319 }
6320 
6321 static int bpf_unpriv_handler(const struct ctl_table *table, int write,
6322 			      void *buffer, size_t *lenp, loff_t *ppos)
6323 {
6324 	int ret, unpriv_enable = *(int *)table->data;
6325 	bool locked_state = unpriv_enable == 1;
6326 	struct ctl_table tmp = *table;
6327 
6328 	if (write && !capable(CAP_SYS_ADMIN))
6329 		return -EPERM;
6330 
6331 	tmp.data = &unpriv_enable;
6332 	ret = proc_dointvec_minmax(&tmp, write, buffer, lenp, ppos);
6333 	if (write && !ret) {
6334 		if (locked_state && unpriv_enable != 1)
6335 			return -EPERM;
6336 		*(int *)table->data = unpriv_enable;
6337 	}
6338 
6339 	if (write)
6340 		unpriv_ebpf_notify(unpriv_enable);
6341 
6342 	return ret;
6343 }
6344 
6345 static const struct ctl_table bpf_syscall_table[] = {
6346 	{
6347 		.procname	= "unprivileged_bpf_disabled",
6348 		.data		= &sysctl_unprivileged_bpf_disabled,
6349 		.maxlen		= sizeof(sysctl_unprivileged_bpf_disabled),
6350 		.mode		= 0644,
6351 		.proc_handler	= bpf_unpriv_handler,
6352 		.extra1		= SYSCTL_ZERO,
6353 		.extra2		= SYSCTL_TWO,
6354 	},
6355 	{
6356 		.procname	= "bpf_stats_enabled",
6357 		.data		= &bpf_stats_enabled_key.key,
6358 		.mode		= 0644,
6359 		.proc_handler	= bpf_stats_handler,
6360 	},
6361 };
6362 
6363 static int __init bpf_syscall_sysctl_init(void)
6364 {
6365 	register_sysctl_init("kernel", bpf_syscall_table);
6366 	return 0;
6367 }
6368 late_initcall(bpf_syscall_sysctl_init);
6369 #endif /* CONFIG_SYSCTL */
6370