xref: /linux/kernel/bpf/syscall.c (revision 4d374ba0bf30a2a372167ee4b7cdd527e7b47b3b)
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_trace.h>
6 #include <linux/bpf_lirc.h>
7 #include <linux/btf.h>
8 #include <linux/syscalls.h>
9 #include <linux/slab.h>
10 #include <linux/sched/signal.h>
11 #include <linux/vmalloc.h>
12 #include <linux/mmzone.h>
13 #include <linux/anon_inodes.h>
14 #include <linux/fdtable.h>
15 #include <linux/file.h>
16 #include <linux/fs.h>
17 #include <linux/license.h>
18 #include <linux/filter.h>
19 #include <linux/version.h>
20 #include <linux/kernel.h>
21 #include <linux/idr.h>
22 #include <linux/cred.h>
23 #include <linux/timekeeping.h>
24 #include <linux/ctype.h>
25 #include <linux/nospec.h>
26 
27 #define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \
28 			   (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
29 			   (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
30 			   (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
31 #define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
32 #define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_HASH(map))
33 
34 #define BPF_OBJ_FLAG_MASK   (BPF_F_RDONLY | BPF_F_WRONLY)
35 
36 DEFINE_PER_CPU(int, bpf_prog_active);
37 static DEFINE_IDR(prog_idr);
38 static DEFINE_SPINLOCK(prog_idr_lock);
39 static DEFINE_IDR(map_idr);
40 static DEFINE_SPINLOCK(map_idr_lock);
41 
42 int sysctl_unprivileged_bpf_disabled __read_mostly;
43 
44 static const struct bpf_map_ops * const bpf_map_types[] = {
45 #define BPF_PROG_TYPE(_id, _ops)
46 #define BPF_MAP_TYPE(_id, _ops) \
47 	[_id] = &_ops,
48 #include <linux/bpf_types.h>
49 #undef BPF_PROG_TYPE
50 #undef BPF_MAP_TYPE
51 };
52 
53 /*
54  * If we're handed a bigger struct than we know of, ensure all the unknown bits
55  * are 0 - i.e. new user-space does not rely on any kernel feature extensions
56  * we don't know about yet.
57  *
58  * There is a ToCToU between this function call and the following
59  * copy_from_user() call. However, this is not a concern since this function is
60  * meant to be a future-proofing of bits.
61  */
62 int bpf_check_uarg_tail_zero(void __user *uaddr,
63 			     size_t expected_size,
64 			     size_t actual_size)
65 {
66 	unsigned char __user *addr;
67 	unsigned char __user *end;
68 	unsigned char val;
69 	int err;
70 
71 	if (unlikely(actual_size > PAGE_SIZE))	/* silly large */
72 		return -E2BIG;
73 
74 	if (unlikely(!access_ok(uaddr, actual_size)))
75 		return -EFAULT;
76 
77 	if (actual_size <= expected_size)
78 		return 0;
79 
80 	addr = uaddr + expected_size;
81 	end  = uaddr + actual_size;
82 
83 	for (; addr < end; addr++) {
84 		err = get_user(val, addr);
85 		if (err)
86 			return err;
87 		if (val)
88 			return -E2BIG;
89 	}
90 
91 	return 0;
92 }
93 
94 const struct bpf_map_ops bpf_map_offload_ops = {
95 	.map_alloc = bpf_map_offload_map_alloc,
96 	.map_free = bpf_map_offload_map_free,
97 	.map_check_btf = map_check_no_btf,
98 };
99 
100 static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
101 {
102 	const struct bpf_map_ops *ops;
103 	u32 type = attr->map_type;
104 	struct bpf_map *map;
105 	int err;
106 
107 	if (type >= ARRAY_SIZE(bpf_map_types))
108 		return ERR_PTR(-EINVAL);
109 	type = array_index_nospec(type, ARRAY_SIZE(bpf_map_types));
110 	ops = bpf_map_types[type];
111 	if (!ops)
112 		return ERR_PTR(-EINVAL);
113 
114 	if (ops->map_alloc_check) {
115 		err = ops->map_alloc_check(attr);
116 		if (err)
117 			return ERR_PTR(err);
118 	}
119 	if (attr->map_ifindex)
120 		ops = &bpf_map_offload_ops;
121 	map = ops->map_alloc(attr);
122 	if (IS_ERR(map))
123 		return map;
124 	map->ops = ops;
125 	map->map_type = type;
126 	return map;
127 }
128 
129 void *bpf_map_area_alloc(size_t size, int numa_node)
130 {
131 	/* We really just want to fail instead of triggering OOM killer
132 	 * under memory pressure, therefore we set __GFP_NORETRY to kmalloc,
133 	 * which is used for lower order allocation requests.
134 	 *
135 	 * It has been observed that higher order allocation requests done by
136 	 * vmalloc with __GFP_NORETRY being set might fail due to not trying
137 	 * to reclaim memory from the page cache, thus we set
138 	 * __GFP_RETRY_MAYFAIL to avoid such situations.
139 	 */
140 
141 	const gfp_t flags = __GFP_NOWARN | __GFP_ZERO;
142 	void *area;
143 
144 	if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
145 		area = kmalloc_node(size, GFP_USER | __GFP_NORETRY | flags,
146 				    numa_node);
147 		if (area != NULL)
148 			return area;
149 	}
150 
151 	return __vmalloc_node_flags_caller(size, numa_node,
152 					   GFP_KERNEL | __GFP_RETRY_MAYFAIL |
153 					   flags, __builtin_return_address(0));
154 }
155 
156 void bpf_map_area_free(void *area)
157 {
158 	kvfree(area);
159 }
160 
161 static u32 bpf_map_flags_retain_permanent(u32 flags)
162 {
163 	/* Some map creation flags are not tied to the map object but
164 	 * rather to the map fd instead, so they have no meaning upon
165 	 * map object inspection since multiple file descriptors with
166 	 * different (access) properties can exist here. Thus, given
167 	 * this has zero meaning for the map itself, lets clear these
168 	 * from here.
169 	 */
170 	return flags & ~(BPF_F_RDONLY | BPF_F_WRONLY);
171 }
172 
173 void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
174 {
175 	map->map_type = attr->map_type;
176 	map->key_size = attr->key_size;
177 	map->value_size = attr->value_size;
178 	map->max_entries = attr->max_entries;
179 	map->map_flags = bpf_map_flags_retain_permanent(attr->map_flags);
180 	map->numa_node = bpf_map_attr_numa_node(attr);
181 }
182 
183 static int bpf_charge_memlock(struct user_struct *user, u32 pages)
184 {
185 	unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
186 
187 	if (atomic_long_add_return(pages, &user->locked_vm) > memlock_limit) {
188 		atomic_long_sub(pages, &user->locked_vm);
189 		return -EPERM;
190 	}
191 	return 0;
192 }
193 
194 static void bpf_uncharge_memlock(struct user_struct *user, u32 pages)
195 {
196 	if (user)
197 		atomic_long_sub(pages, &user->locked_vm);
198 }
199 
200 int bpf_map_charge_init(struct bpf_map_memory *mem, size_t size)
201 {
202 	u32 pages = round_up(size, PAGE_SIZE) >> PAGE_SHIFT;
203 	struct user_struct *user;
204 	int ret;
205 
206 	if (size >= U32_MAX - PAGE_SIZE)
207 		return -E2BIG;
208 
209 	user = get_current_user();
210 	ret = bpf_charge_memlock(user, pages);
211 	if (ret) {
212 		free_uid(user);
213 		return ret;
214 	}
215 
216 	mem->pages = pages;
217 	mem->user = user;
218 
219 	return 0;
220 }
221 
222 void bpf_map_charge_finish(struct bpf_map_memory *mem)
223 {
224 	bpf_uncharge_memlock(mem->user, mem->pages);
225 	free_uid(mem->user);
226 }
227 
228 void bpf_map_charge_move(struct bpf_map_memory *dst,
229 			 struct bpf_map_memory *src)
230 {
231 	*dst = *src;
232 
233 	/* Make sure src will not be used for the redundant uncharging. */
234 	memset(src, 0, sizeof(struct bpf_map_memory));
235 }
236 
237 int bpf_map_charge_memlock(struct bpf_map *map, u32 pages)
238 {
239 	int ret;
240 
241 	ret = bpf_charge_memlock(map->memory.user, pages);
242 	if (ret)
243 		return ret;
244 	map->memory.pages += pages;
245 	return ret;
246 }
247 
248 void bpf_map_uncharge_memlock(struct bpf_map *map, u32 pages)
249 {
250 	bpf_uncharge_memlock(map->memory.user, pages);
251 	map->memory.pages -= pages;
252 }
253 
254 static int bpf_map_alloc_id(struct bpf_map *map)
255 {
256 	int id;
257 
258 	idr_preload(GFP_KERNEL);
259 	spin_lock_bh(&map_idr_lock);
260 	id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
261 	if (id > 0)
262 		map->id = id;
263 	spin_unlock_bh(&map_idr_lock);
264 	idr_preload_end();
265 
266 	if (WARN_ON_ONCE(!id))
267 		return -ENOSPC;
268 
269 	return id > 0 ? 0 : id;
270 }
271 
272 void bpf_map_free_id(struct bpf_map *map, bool do_idr_lock)
273 {
274 	unsigned long flags;
275 
276 	/* Offloaded maps are removed from the IDR store when their device
277 	 * disappears - even if someone holds an fd to them they are unusable,
278 	 * the memory is gone, all ops will fail; they are simply waiting for
279 	 * refcnt to drop to be freed.
280 	 */
281 	if (!map->id)
282 		return;
283 
284 	if (do_idr_lock)
285 		spin_lock_irqsave(&map_idr_lock, flags);
286 	else
287 		__acquire(&map_idr_lock);
288 
289 	idr_remove(&map_idr, map->id);
290 	map->id = 0;
291 
292 	if (do_idr_lock)
293 		spin_unlock_irqrestore(&map_idr_lock, flags);
294 	else
295 		__release(&map_idr_lock);
296 }
297 
298 /* called from workqueue */
299 static void bpf_map_free_deferred(struct work_struct *work)
300 {
301 	struct bpf_map *map = container_of(work, struct bpf_map, work);
302 	struct bpf_map_memory mem;
303 
304 	bpf_map_charge_move(&mem, &map->memory);
305 	security_bpf_map_free(map);
306 	/* implementation dependent freeing */
307 	map->ops->map_free(map);
308 	bpf_map_charge_finish(&mem);
309 }
310 
311 static void bpf_map_put_uref(struct bpf_map *map)
312 {
313 	if (atomic_dec_and_test(&map->usercnt)) {
314 		if (map->ops->map_release_uref)
315 			map->ops->map_release_uref(map);
316 	}
317 }
318 
319 /* decrement map refcnt and schedule it for freeing via workqueue
320  * (unrelying map implementation ops->map_free() might sleep)
321  */
322 static void __bpf_map_put(struct bpf_map *map, bool do_idr_lock)
323 {
324 	if (atomic_dec_and_test(&map->refcnt)) {
325 		/* bpf_map_free_id() must be called first */
326 		bpf_map_free_id(map, do_idr_lock);
327 		btf_put(map->btf);
328 		INIT_WORK(&map->work, bpf_map_free_deferred);
329 		schedule_work(&map->work);
330 	}
331 }
332 
333 void bpf_map_put(struct bpf_map *map)
334 {
335 	__bpf_map_put(map, true);
336 }
337 EXPORT_SYMBOL_GPL(bpf_map_put);
338 
339 void bpf_map_put_with_uref(struct bpf_map *map)
340 {
341 	bpf_map_put_uref(map);
342 	bpf_map_put(map);
343 }
344 
345 static int bpf_map_release(struct inode *inode, struct file *filp)
346 {
347 	struct bpf_map *map = filp->private_data;
348 
349 	if (map->ops->map_release)
350 		map->ops->map_release(map, filp);
351 
352 	bpf_map_put_with_uref(map);
353 	return 0;
354 }
355 
356 static fmode_t map_get_sys_perms(struct bpf_map *map, struct fd f)
357 {
358 	fmode_t mode = f.file->f_mode;
359 
360 	/* Our file permissions may have been overridden by global
361 	 * map permissions facing syscall side.
362 	 */
363 	if (READ_ONCE(map->frozen))
364 		mode &= ~FMODE_CAN_WRITE;
365 	return mode;
366 }
367 
368 #ifdef CONFIG_PROC_FS
369 static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
370 {
371 	const struct bpf_map *map = filp->private_data;
372 	const struct bpf_array *array;
373 	u32 owner_prog_type = 0;
374 	u32 owner_jited = 0;
375 
376 	if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
377 		array = container_of(map, struct bpf_array, map);
378 		owner_prog_type = array->owner_prog_type;
379 		owner_jited = array->owner_jited;
380 	}
381 
382 	seq_printf(m,
383 		   "map_type:\t%u\n"
384 		   "key_size:\t%u\n"
385 		   "value_size:\t%u\n"
386 		   "max_entries:\t%u\n"
387 		   "map_flags:\t%#x\n"
388 		   "memlock:\t%llu\n"
389 		   "map_id:\t%u\n"
390 		   "frozen:\t%u\n",
391 		   map->map_type,
392 		   map->key_size,
393 		   map->value_size,
394 		   map->max_entries,
395 		   map->map_flags,
396 		   map->memory.pages * 1ULL << PAGE_SHIFT,
397 		   map->id,
398 		   READ_ONCE(map->frozen));
399 
400 	if (owner_prog_type) {
401 		seq_printf(m, "owner_prog_type:\t%u\n",
402 			   owner_prog_type);
403 		seq_printf(m, "owner_jited:\t%u\n",
404 			   owner_jited);
405 	}
406 }
407 #endif
408 
409 static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
410 			      loff_t *ppos)
411 {
412 	/* We need this handler such that alloc_file() enables
413 	 * f_mode with FMODE_CAN_READ.
414 	 */
415 	return -EINVAL;
416 }
417 
418 static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
419 			       size_t siz, loff_t *ppos)
420 {
421 	/* We need this handler such that alloc_file() enables
422 	 * f_mode with FMODE_CAN_WRITE.
423 	 */
424 	return -EINVAL;
425 }
426 
427 const struct file_operations bpf_map_fops = {
428 #ifdef CONFIG_PROC_FS
429 	.show_fdinfo	= bpf_map_show_fdinfo,
430 #endif
431 	.release	= bpf_map_release,
432 	.read		= bpf_dummy_read,
433 	.write		= bpf_dummy_write,
434 };
435 
436 int bpf_map_new_fd(struct bpf_map *map, int flags)
437 {
438 	int ret;
439 
440 	ret = security_bpf_map(map, OPEN_FMODE(flags));
441 	if (ret < 0)
442 		return ret;
443 
444 	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
445 				flags | O_CLOEXEC);
446 }
447 
448 int bpf_get_file_flag(int flags)
449 {
450 	if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
451 		return -EINVAL;
452 	if (flags & BPF_F_RDONLY)
453 		return O_RDONLY;
454 	if (flags & BPF_F_WRONLY)
455 		return O_WRONLY;
456 	return O_RDWR;
457 }
458 
459 /* helper macro to check that unused fields 'union bpf_attr' are zero */
460 #define CHECK_ATTR(CMD) \
461 	memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
462 		   sizeof(attr->CMD##_LAST_FIELD), 0, \
463 		   sizeof(*attr) - \
464 		   offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
465 		   sizeof(attr->CMD##_LAST_FIELD)) != NULL
466 
467 /* dst and src must have at least BPF_OBJ_NAME_LEN number of bytes.
468  * Return 0 on success and < 0 on error.
469  */
470 static int bpf_obj_name_cpy(char *dst, const char *src)
471 {
472 	const char *end = src + BPF_OBJ_NAME_LEN;
473 
474 	memset(dst, 0, BPF_OBJ_NAME_LEN);
475 	/* Copy all isalnum(), '_' and '.' chars. */
476 	while (src < end && *src) {
477 		if (!isalnum(*src) &&
478 		    *src != '_' && *src != '.')
479 			return -EINVAL;
480 		*dst++ = *src++;
481 	}
482 
483 	/* No '\0' found in BPF_OBJ_NAME_LEN number of bytes */
484 	if (src == end)
485 		return -EINVAL;
486 
487 	return 0;
488 }
489 
490 int map_check_no_btf(const struct bpf_map *map,
491 		     const struct btf *btf,
492 		     const struct btf_type *key_type,
493 		     const struct btf_type *value_type)
494 {
495 	return -ENOTSUPP;
496 }
497 
498 static int map_check_btf(struct bpf_map *map, const struct btf *btf,
499 			 u32 btf_key_id, u32 btf_value_id)
500 {
501 	const struct btf_type *key_type, *value_type;
502 	u32 key_size, value_size;
503 	int ret = 0;
504 
505 	/* Some maps allow key to be unspecified. */
506 	if (btf_key_id) {
507 		key_type = btf_type_id_size(btf, &btf_key_id, &key_size);
508 		if (!key_type || key_size != map->key_size)
509 			return -EINVAL;
510 	} else {
511 		key_type = btf_type_by_id(btf, 0);
512 		if (!map->ops->map_check_btf)
513 			return -EINVAL;
514 	}
515 
516 	value_type = btf_type_id_size(btf, &btf_value_id, &value_size);
517 	if (!value_type || value_size != map->value_size)
518 		return -EINVAL;
519 
520 	map->spin_lock_off = btf_find_spin_lock(btf, value_type);
521 
522 	if (map_value_has_spin_lock(map)) {
523 		if (map->map_flags & BPF_F_RDONLY_PROG)
524 			return -EACCES;
525 		if (map->map_type != BPF_MAP_TYPE_HASH &&
526 		    map->map_type != BPF_MAP_TYPE_ARRAY &&
527 		    map->map_type != BPF_MAP_TYPE_CGROUP_STORAGE &&
528 		    map->map_type != BPF_MAP_TYPE_SK_STORAGE)
529 			return -ENOTSUPP;
530 		if (map->spin_lock_off + sizeof(struct bpf_spin_lock) >
531 		    map->value_size) {
532 			WARN_ONCE(1,
533 				  "verifier bug spin_lock_off %d value_size %d\n",
534 				  map->spin_lock_off, map->value_size);
535 			return -EFAULT;
536 		}
537 	}
538 
539 	if (map->ops->map_check_btf)
540 		ret = map->ops->map_check_btf(map, btf, key_type, value_type);
541 
542 	return ret;
543 }
544 
545 #define BPF_MAP_CREATE_LAST_FIELD btf_value_type_id
546 /* called via syscall */
547 static int map_create(union bpf_attr *attr)
548 {
549 	int numa_node = bpf_map_attr_numa_node(attr);
550 	struct bpf_map_memory mem;
551 	struct bpf_map *map;
552 	int f_flags;
553 	int err;
554 
555 	err = CHECK_ATTR(BPF_MAP_CREATE);
556 	if (err)
557 		return -EINVAL;
558 
559 	f_flags = bpf_get_file_flag(attr->map_flags);
560 	if (f_flags < 0)
561 		return f_flags;
562 
563 	if (numa_node != NUMA_NO_NODE &&
564 	    ((unsigned int)numa_node >= nr_node_ids ||
565 	     !node_online(numa_node)))
566 		return -EINVAL;
567 
568 	/* find map type and init map: hashtable vs rbtree vs bloom vs ... */
569 	map = find_and_alloc_map(attr);
570 	if (IS_ERR(map))
571 		return PTR_ERR(map);
572 
573 	err = bpf_obj_name_cpy(map->name, attr->map_name);
574 	if (err)
575 		goto free_map;
576 
577 	atomic_set(&map->refcnt, 1);
578 	atomic_set(&map->usercnt, 1);
579 
580 	if (attr->btf_key_type_id || attr->btf_value_type_id) {
581 		struct btf *btf;
582 
583 		if (!attr->btf_value_type_id) {
584 			err = -EINVAL;
585 			goto free_map;
586 		}
587 
588 		btf = btf_get_by_fd(attr->btf_fd);
589 		if (IS_ERR(btf)) {
590 			err = PTR_ERR(btf);
591 			goto free_map;
592 		}
593 
594 		err = map_check_btf(map, btf, attr->btf_key_type_id,
595 				    attr->btf_value_type_id);
596 		if (err) {
597 			btf_put(btf);
598 			goto free_map;
599 		}
600 
601 		map->btf = btf;
602 		map->btf_key_type_id = attr->btf_key_type_id;
603 		map->btf_value_type_id = attr->btf_value_type_id;
604 	} else {
605 		map->spin_lock_off = -EINVAL;
606 	}
607 
608 	err = security_bpf_map_alloc(map);
609 	if (err)
610 		goto free_map;
611 
612 	err = bpf_map_alloc_id(map);
613 	if (err)
614 		goto free_map_sec;
615 
616 	err = bpf_map_new_fd(map, f_flags);
617 	if (err < 0) {
618 		/* failed to allocate fd.
619 		 * bpf_map_put_with_uref() is needed because the above
620 		 * bpf_map_alloc_id() has published the map
621 		 * to the userspace and the userspace may
622 		 * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
623 		 */
624 		bpf_map_put_with_uref(map);
625 		return err;
626 	}
627 
628 	return err;
629 
630 free_map_sec:
631 	security_bpf_map_free(map);
632 free_map:
633 	btf_put(map->btf);
634 	bpf_map_charge_move(&mem, &map->memory);
635 	map->ops->map_free(map);
636 	bpf_map_charge_finish(&mem);
637 	return err;
638 }
639 
640 /* if error is returned, fd is released.
641  * On success caller should complete fd access with matching fdput()
642  */
643 struct bpf_map *__bpf_map_get(struct fd f)
644 {
645 	if (!f.file)
646 		return ERR_PTR(-EBADF);
647 	if (f.file->f_op != &bpf_map_fops) {
648 		fdput(f);
649 		return ERR_PTR(-EINVAL);
650 	}
651 
652 	return f.file->private_data;
653 }
654 
655 /* prog's and map's refcnt limit */
656 #define BPF_MAX_REFCNT 32768
657 
658 struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
659 {
660 	if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
661 		atomic_dec(&map->refcnt);
662 		return ERR_PTR(-EBUSY);
663 	}
664 	if (uref)
665 		atomic_inc(&map->usercnt);
666 	return map;
667 }
668 EXPORT_SYMBOL_GPL(bpf_map_inc);
669 
670 struct bpf_map *bpf_map_get_with_uref(u32 ufd)
671 {
672 	struct fd f = fdget(ufd);
673 	struct bpf_map *map;
674 
675 	map = __bpf_map_get(f);
676 	if (IS_ERR(map))
677 		return map;
678 
679 	map = bpf_map_inc(map, true);
680 	fdput(f);
681 
682 	return map;
683 }
684 
685 /* map_idr_lock should have been held */
686 static struct bpf_map *__bpf_map_inc_not_zero(struct bpf_map *map,
687 					      bool uref)
688 {
689 	int refold;
690 
691 	refold = atomic_fetch_add_unless(&map->refcnt, 1, 0);
692 
693 	if (refold >= BPF_MAX_REFCNT) {
694 		__bpf_map_put(map, false);
695 		return ERR_PTR(-EBUSY);
696 	}
697 
698 	if (!refold)
699 		return ERR_PTR(-ENOENT);
700 
701 	if (uref)
702 		atomic_inc(&map->usercnt);
703 
704 	return map;
705 }
706 
707 struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map, bool uref)
708 {
709 	spin_lock_bh(&map_idr_lock);
710 	map = __bpf_map_inc_not_zero(map, uref);
711 	spin_unlock_bh(&map_idr_lock);
712 
713 	return map;
714 }
715 EXPORT_SYMBOL_GPL(bpf_map_inc_not_zero);
716 
717 int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
718 {
719 	return -ENOTSUPP;
720 }
721 
722 static void *__bpf_copy_key(void __user *ukey, u64 key_size)
723 {
724 	if (key_size)
725 		return memdup_user(ukey, key_size);
726 
727 	if (ukey)
728 		return ERR_PTR(-EINVAL);
729 
730 	return NULL;
731 }
732 
733 /* last field in 'union bpf_attr' used by this command */
734 #define BPF_MAP_LOOKUP_ELEM_LAST_FIELD flags
735 
736 static int map_lookup_elem(union bpf_attr *attr)
737 {
738 	void __user *ukey = u64_to_user_ptr(attr->key);
739 	void __user *uvalue = u64_to_user_ptr(attr->value);
740 	int ufd = attr->map_fd;
741 	struct bpf_map *map;
742 	void *key, *value, *ptr;
743 	u32 value_size;
744 	struct fd f;
745 	int err;
746 
747 	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
748 		return -EINVAL;
749 
750 	if (attr->flags & ~BPF_F_LOCK)
751 		return -EINVAL;
752 
753 	f = fdget(ufd);
754 	map = __bpf_map_get(f);
755 	if (IS_ERR(map))
756 		return PTR_ERR(map);
757 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
758 		err = -EPERM;
759 		goto err_put;
760 	}
761 
762 	if ((attr->flags & BPF_F_LOCK) &&
763 	    !map_value_has_spin_lock(map)) {
764 		err = -EINVAL;
765 		goto err_put;
766 	}
767 
768 	key = __bpf_copy_key(ukey, map->key_size);
769 	if (IS_ERR(key)) {
770 		err = PTR_ERR(key);
771 		goto err_put;
772 	}
773 
774 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
775 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
776 	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
777 	    map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
778 		value_size = round_up(map->value_size, 8) * num_possible_cpus();
779 	else if (IS_FD_MAP(map))
780 		value_size = sizeof(u32);
781 	else
782 		value_size = map->value_size;
783 
784 	err = -ENOMEM;
785 	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
786 	if (!value)
787 		goto free_key;
788 
789 	if (bpf_map_is_dev_bound(map)) {
790 		err = bpf_map_offload_lookup_elem(map, key, value);
791 		goto done;
792 	}
793 
794 	preempt_disable();
795 	this_cpu_inc(bpf_prog_active);
796 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
797 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
798 		err = bpf_percpu_hash_copy(map, key, value);
799 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
800 		err = bpf_percpu_array_copy(map, key, value);
801 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
802 		err = bpf_percpu_cgroup_storage_copy(map, key, value);
803 	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
804 		err = bpf_stackmap_copy(map, key, value);
805 	} else if (IS_FD_ARRAY(map)) {
806 		err = bpf_fd_array_map_lookup_elem(map, key, value);
807 	} else if (IS_FD_HASH(map)) {
808 		err = bpf_fd_htab_map_lookup_elem(map, key, value);
809 	} else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
810 		err = bpf_fd_reuseport_array_lookup_elem(map, key, value);
811 	} else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
812 		   map->map_type == BPF_MAP_TYPE_STACK) {
813 		err = map->ops->map_peek_elem(map, value);
814 	} else {
815 		rcu_read_lock();
816 		if (map->ops->map_lookup_elem_sys_only)
817 			ptr = map->ops->map_lookup_elem_sys_only(map, key);
818 		else
819 			ptr = map->ops->map_lookup_elem(map, key);
820 		if (IS_ERR(ptr)) {
821 			err = PTR_ERR(ptr);
822 		} else if (!ptr) {
823 			err = -ENOENT;
824 		} else {
825 			err = 0;
826 			if (attr->flags & BPF_F_LOCK)
827 				/* lock 'ptr' and copy everything but lock */
828 				copy_map_value_locked(map, value, ptr, true);
829 			else
830 				copy_map_value(map, value, ptr);
831 			/* mask lock, since value wasn't zero inited */
832 			check_and_init_map_lock(map, value);
833 		}
834 		rcu_read_unlock();
835 	}
836 	this_cpu_dec(bpf_prog_active);
837 	preempt_enable();
838 
839 done:
840 	if (err)
841 		goto free_value;
842 
843 	err = -EFAULT;
844 	if (copy_to_user(uvalue, value, value_size) != 0)
845 		goto free_value;
846 
847 	err = 0;
848 
849 free_value:
850 	kfree(value);
851 free_key:
852 	kfree(key);
853 err_put:
854 	fdput(f);
855 	return err;
856 }
857 
858 static void maybe_wait_bpf_programs(struct bpf_map *map)
859 {
860 	/* Wait for any running BPF programs to complete so that
861 	 * userspace, when we return to it, knows that all programs
862 	 * that could be running use the new map value.
863 	 */
864 	if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS ||
865 	    map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
866 		synchronize_rcu();
867 }
868 
869 #define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
870 
871 static int map_update_elem(union bpf_attr *attr)
872 {
873 	void __user *ukey = u64_to_user_ptr(attr->key);
874 	void __user *uvalue = u64_to_user_ptr(attr->value);
875 	int ufd = attr->map_fd;
876 	struct bpf_map *map;
877 	void *key, *value;
878 	u32 value_size;
879 	struct fd f;
880 	int err;
881 
882 	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
883 		return -EINVAL;
884 
885 	f = fdget(ufd);
886 	map = __bpf_map_get(f);
887 	if (IS_ERR(map))
888 		return PTR_ERR(map);
889 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
890 		err = -EPERM;
891 		goto err_put;
892 	}
893 
894 	if ((attr->flags & BPF_F_LOCK) &&
895 	    !map_value_has_spin_lock(map)) {
896 		err = -EINVAL;
897 		goto err_put;
898 	}
899 
900 	key = __bpf_copy_key(ukey, map->key_size);
901 	if (IS_ERR(key)) {
902 		err = PTR_ERR(key);
903 		goto err_put;
904 	}
905 
906 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
907 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
908 	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
909 	    map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
910 		value_size = round_up(map->value_size, 8) * num_possible_cpus();
911 	else
912 		value_size = map->value_size;
913 
914 	err = -ENOMEM;
915 	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
916 	if (!value)
917 		goto free_key;
918 
919 	err = -EFAULT;
920 	if (copy_from_user(value, uvalue, value_size) != 0)
921 		goto free_value;
922 
923 	/* Need to create a kthread, thus must support schedule */
924 	if (bpf_map_is_dev_bound(map)) {
925 		err = bpf_map_offload_update_elem(map, key, value, attr->flags);
926 		goto out;
927 	} else if (map->map_type == BPF_MAP_TYPE_CPUMAP ||
928 		   map->map_type == BPF_MAP_TYPE_SOCKHASH ||
929 		   map->map_type == BPF_MAP_TYPE_SOCKMAP) {
930 		err = map->ops->map_update_elem(map, key, value, attr->flags);
931 		goto out;
932 	}
933 
934 	/* must increment bpf_prog_active to avoid kprobe+bpf triggering from
935 	 * inside bpf map update or delete otherwise deadlocks are possible
936 	 */
937 	preempt_disable();
938 	__this_cpu_inc(bpf_prog_active);
939 	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
940 	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
941 		err = bpf_percpu_hash_update(map, key, value, attr->flags);
942 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
943 		err = bpf_percpu_array_update(map, key, value, attr->flags);
944 	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
945 		err = bpf_percpu_cgroup_storage_update(map, key, value,
946 						       attr->flags);
947 	} else if (IS_FD_ARRAY(map)) {
948 		rcu_read_lock();
949 		err = bpf_fd_array_map_update_elem(map, f.file, key, value,
950 						   attr->flags);
951 		rcu_read_unlock();
952 	} else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
953 		rcu_read_lock();
954 		err = bpf_fd_htab_map_update_elem(map, f.file, key, value,
955 						  attr->flags);
956 		rcu_read_unlock();
957 	} else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
958 		/* rcu_read_lock() is not needed */
959 		err = bpf_fd_reuseport_array_update_elem(map, key, value,
960 							 attr->flags);
961 	} else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
962 		   map->map_type == BPF_MAP_TYPE_STACK) {
963 		err = map->ops->map_push_elem(map, value, attr->flags);
964 	} else {
965 		rcu_read_lock();
966 		err = map->ops->map_update_elem(map, key, value, attr->flags);
967 		rcu_read_unlock();
968 	}
969 	__this_cpu_dec(bpf_prog_active);
970 	preempt_enable();
971 	maybe_wait_bpf_programs(map);
972 out:
973 free_value:
974 	kfree(value);
975 free_key:
976 	kfree(key);
977 err_put:
978 	fdput(f);
979 	return err;
980 }
981 
982 #define BPF_MAP_DELETE_ELEM_LAST_FIELD key
983 
984 static int map_delete_elem(union bpf_attr *attr)
985 {
986 	void __user *ukey = u64_to_user_ptr(attr->key);
987 	int ufd = attr->map_fd;
988 	struct bpf_map *map;
989 	struct fd f;
990 	void *key;
991 	int err;
992 
993 	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
994 		return -EINVAL;
995 
996 	f = fdget(ufd);
997 	map = __bpf_map_get(f);
998 	if (IS_ERR(map))
999 		return PTR_ERR(map);
1000 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1001 		err = -EPERM;
1002 		goto err_put;
1003 	}
1004 
1005 	key = __bpf_copy_key(ukey, map->key_size);
1006 	if (IS_ERR(key)) {
1007 		err = PTR_ERR(key);
1008 		goto err_put;
1009 	}
1010 
1011 	if (bpf_map_is_dev_bound(map)) {
1012 		err = bpf_map_offload_delete_elem(map, key);
1013 		goto out;
1014 	}
1015 
1016 	preempt_disable();
1017 	__this_cpu_inc(bpf_prog_active);
1018 	rcu_read_lock();
1019 	err = map->ops->map_delete_elem(map, key);
1020 	rcu_read_unlock();
1021 	__this_cpu_dec(bpf_prog_active);
1022 	preempt_enable();
1023 	maybe_wait_bpf_programs(map);
1024 out:
1025 	kfree(key);
1026 err_put:
1027 	fdput(f);
1028 	return err;
1029 }
1030 
1031 /* last field in 'union bpf_attr' used by this command */
1032 #define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
1033 
1034 static int map_get_next_key(union bpf_attr *attr)
1035 {
1036 	void __user *ukey = u64_to_user_ptr(attr->key);
1037 	void __user *unext_key = u64_to_user_ptr(attr->next_key);
1038 	int ufd = attr->map_fd;
1039 	struct bpf_map *map;
1040 	void *key, *next_key;
1041 	struct fd f;
1042 	int err;
1043 
1044 	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
1045 		return -EINVAL;
1046 
1047 	f = fdget(ufd);
1048 	map = __bpf_map_get(f);
1049 	if (IS_ERR(map))
1050 		return PTR_ERR(map);
1051 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
1052 		err = -EPERM;
1053 		goto err_put;
1054 	}
1055 
1056 	if (ukey) {
1057 		key = __bpf_copy_key(ukey, map->key_size);
1058 		if (IS_ERR(key)) {
1059 			err = PTR_ERR(key);
1060 			goto err_put;
1061 		}
1062 	} else {
1063 		key = NULL;
1064 	}
1065 
1066 	err = -ENOMEM;
1067 	next_key = kmalloc(map->key_size, GFP_USER);
1068 	if (!next_key)
1069 		goto free_key;
1070 
1071 	if (bpf_map_is_dev_bound(map)) {
1072 		err = bpf_map_offload_get_next_key(map, key, next_key);
1073 		goto out;
1074 	}
1075 
1076 	rcu_read_lock();
1077 	err = map->ops->map_get_next_key(map, key, next_key);
1078 	rcu_read_unlock();
1079 out:
1080 	if (err)
1081 		goto free_next_key;
1082 
1083 	err = -EFAULT;
1084 	if (copy_to_user(unext_key, next_key, map->key_size) != 0)
1085 		goto free_next_key;
1086 
1087 	err = 0;
1088 
1089 free_next_key:
1090 	kfree(next_key);
1091 free_key:
1092 	kfree(key);
1093 err_put:
1094 	fdput(f);
1095 	return err;
1096 }
1097 
1098 #define BPF_MAP_LOOKUP_AND_DELETE_ELEM_LAST_FIELD value
1099 
1100 static int map_lookup_and_delete_elem(union bpf_attr *attr)
1101 {
1102 	void __user *ukey = u64_to_user_ptr(attr->key);
1103 	void __user *uvalue = u64_to_user_ptr(attr->value);
1104 	int ufd = attr->map_fd;
1105 	struct bpf_map *map;
1106 	void *key, *value;
1107 	u32 value_size;
1108 	struct fd f;
1109 	int err;
1110 
1111 	if (CHECK_ATTR(BPF_MAP_LOOKUP_AND_DELETE_ELEM))
1112 		return -EINVAL;
1113 
1114 	f = fdget(ufd);
1115 	map = __bpf_map_get(f);
1116 	if (IS_ERR(map))
1117 		return PTR_ERR(map);
1118 	if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1119 		err = -EPERM;
1120 		goto err_put;
1121 	}
1122 
1123 	key = __bpf_copy_key(ukey, map->key_size);
1124 	if (IS_ERR(key)) {
1125 		err = PTR_ERR(key);
1126 		goto err_put;
1127 	}
1128 
1129 	value_size = map->value_size;
1130 
1131 	err = -ENOMEM;
1132 	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
1133 	if (!value)
1134 		goto free_key;
1135 
1136 	if (map->map_type == BPF_MAP_TYPE_QUEUE ||
1137 	    map->map_type == BPF_MAP_TYPE_STACK) {
1138 		err = map->ops->map_pop_elem(map, value);
1139 	} else {
1140 		err = -ENOTSUPP;
1141 	}
1142 
1143 	if (err)
1144 		goto free_value;
1145 
1146 	if (copy_to_user(uvalue, value, value_size) != 0)
1147 		goto free_value;
1148 
1149 	err = 0;
1150 
1151 free_value:
1152 	kfree(value);
1153 free_key:
1154 	kfree(key);
1155 err_put:
1156 	fdput(f);
1157 	return err;
1158 }
1159 
1160 #define BPF_MAP_FREEZE_LAST_FIELD map_fd
1161 
1162 static int map_freeze(const union bpf_attr *attr)
1163 {
1164 	int err = 0, ufd = attr->map_fd;
1165 	struct bpf_map *map;
1166 	struct fd f;
1167 
1168 	if (CHECK_ATTR(BPF_MAP_FREEZE))
1169 		return -EINVAL;
1170 
1171 	f = fdget(ufd);
1172 	map = __bpf_map_get(f);
1173 	if (IS_ERR(map))
1174 		return PTR_ERR(map);
1175 	if (READ_ONCE(map->frozen)) {
1176 		err = -EBUSY;
1177 		goto err_put;
1178 	}
1179 	if (!capable(CAP_SYS_ADMIN)) {
1180 		err = -EPERM;
1181 		goto err_put;
1182 	}
1183 
1184 	WRITE_ONCE(map->frozen, true);
1185 err_put:
1186 	fdput(f);
1187 	return err;
1188 }
1189 
1190 static const struct bpf_prog_ops * const bpf_prog_types[] = {
1191 #define BPF_PROG_TYPE(_id, _name) \
1192 	[_id] = & _name ## _prog_ops,
1193 #define BPF_MAP_TYPE(_id, _ops)
1194 #include <linux/bpf_types.h>
1195 #undef BPF_PROG_TYPE
1196 #undef BPF_MAP_TYPE
1197 };
1198 
1199 static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
1200 {
1201 	const struct bpf_prog_ops *ops;
1202 
1203 	if (type >= ARRAY_SIZE(bpf_prog_types))
1204 		return -EINVAL;
1205 	type = array_index_nospec(type, ARRAY_SIZE(bpf_prog_types));
1206 	ops = bpf_prog_types[type];
1207 	if (!ops)
1208 		return -EINVAL;
1209 
1210 	if (!bpf_prog_is_dev_bound(prog->aux))
1211 		prog->aux->ops = ops;
1212 	else
1213 		prog->aux->ops = &bpf_offload_prog_ops;
1214 	prog->type = type;
1215 	return 0;
1216 }
1217 
1218 /* drop refcnt on maps used by eBPF program and free auxilary data */
1219 static void free_used_maps(struct bpf_prog_aux *aux)
1220 {
1221 	enum bpf_cgroup_storage_type stype;
1222 	int i;
1223 
1224 	for_each_cgroup_storage_type(stype) {
1225 		if (!aux->cgroup_storage[stype])
1226 			continue;
1227 		bpf_cgroup_storage_release(aux->prog,
1228 					   aux->cgroup_storage[stype]);
1229 	}
1230 
1231 	for (i = 0; i < aux->used_map_cnt; i++)
1232 		bpf_map_put(aux->used_maps[i]);
1233 
1234 	kfree(aux->used_maps);
1235 }
1236 
1237 int __bpf_prog_charge(struct user_struct *user, u32 pages)
1238 {
1239 	unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
1240 	unsigned long user_bufs;
1241 
1242 	if (user) {
1243 		user_bufs = atomic_long_add_return(pages, &user->locked_vm);
1244 		if (user_bufs > memlock_limit) {
1245 			atomic_long_sub(pages, &user->locked_vm);
1246 			return -EPERM;
1247 		}
1248 	}
1249 
1250 	return 0;
1251 }
1252 
1253 void __bpf_prog_uncharge(struct user_struct *user, u32 pages)
1254 {
1255 	if (user)
1256 		atomic_long_sub(pages, &user->locked_vm);
1257 }
1258 
1259 static int bpf_prog_charge_memlock(struct bpf_prog *prog)
1260 {
1261 	struct user_struct *user = get_current_user();
1262 	int ret;
1263 
1264 	ret = __bpf_prog_charge(user, prog->pages);
1265 	if (ret) {
1266 		free_uid(user);
1267 		return ret;
1268 	}
1269 
1270 	prog->aux->user = user;
1271 	return 0;
1272 }
1273 
1274 static void bpf_prog_uncharge_memlock(struct bpf_prog *prog)
1275 {
1276 	struct user_struct *user = prog->aux->user;
1277 
1278 	__bpf_prog_uncharge(user, prog->pages);
1279 	free_uid(user);
1280 }
1281 
1282 static int bpf_prog_alloc_id(struct bpf_prog *prog)
1283 {
1284 	int id;
1285 
1286 	idr_preload(GFP_KERNEL);
1287 	spin_lock_bh(&prog_idr_lock);
1288 	id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
1289 	if (id > 0)
1290 		prog->aux->id = id;
1291 	spin_unlock_bh(&prog_idr_lock);
1292 	idr_preload_end();
1293 
1294 	/* id is in [1, INT_MAX) */
1295 	if (WARN_ON_ONCE(!id))
1296 		return -ENOSPC;
1297 
1298 	return id > 0 ? 0 : id;
1299 }
1300 
1301 void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
1302 {
1303 	/* cBPF to eBPF migrations are currently not in the idr store.
1304 	 * Offloaded programs are removed from the store when their device
1305 	 * disappears - even if someone grabs an fd to them they are unusable,
1306 	 * simply waiting for refcnt to drop to be freed.
1307 	 */
1308 	if (!prog->aux->id)
1309 		return;
1310 
1311 	if (do_idr_lock)
1312 		spin_lock_bh(&prog_idr_lock);
1313 	else
1314 		__acquire(&prog_idr_lock);
1315 
1316 	idr_remove(&prog_idr, prog->aux->id);
1317 	prog->aux->id = 0;
1318 
1319 	if (do_idr_lock)
1320 		spin_unlock_bh(&prog_idr_lock);
1321 	else
1322 		__release(&prog_idr_lock);
1323 }
1324 
1325 static void __bpf_prog_put_rcu(struct rcu_head *rcu)
1326 {
1327 	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
1328 
1329 	free_used_maps(aux);
1330 	bpf_prog_uncharge_memlock(aux->prog);
1331 	security_bpf_prog_free(aux);
1332 	bpf_prog_free(aux->prog);
1333 }
1334 
1335 static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
1336 {
1337 	if (atomic_dec_and_test(&prog->aux->refcnt)) {
1338 		perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_UNLOAD, 0);
1339 		/* bpf_prog_free_id() must be called first */
1340 		bpf_prog_free_id(prog, do_idr_lock);
1341 		bpf_prog_kallsyms_del_all(prog);
1342 		btf_put(prog->aux->btf);
1343 		kvfree(prog->aux->func_info);
1344 		bpf_prog_free_linfo(prog);
1345 
1346 		call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
1347 	}
1348 }
1349 
1350 void bpf_prog_put(struct bpf_prog *prog)
1351 {
1352 	__bpf_prog_put(prog, true);
1353 }
1354 EXPORT_SYMBOL_GPL(bpf_prog_put);
1355 
1356 static int bpf_prog_release(struct inode *inode, struct file *filp)
1357 {
1358 	struct bpf_prog *prog = filp->private_data;
1359 
1360 	bpf_prog_put(prog);
1361 	return 0;
1362 }
1363 
1364 static void bpf_prog_get_stats(const struct bpf_prog *prog,
1365 			       struct bpf_prog_stats *stats)
1366 {
1367 	u64 nsecs = 0, cnt = 0;
1368 	int cpu;
1369 
1370 	for_each_possible_cpu(cpu) {
1371 		const struct bpf_prog_stats *st;
1372 		unsigned int start;
1373 		u64 tnsecs, tcnt;
1374 
1375 		st = per_cpu_ptr(prog->aux->stats, cpu);
1376 		do {
1377 			start = u64_stats_fetch_begin_irq(&st->syncp);
1378 			tnsecs = st->nsecs;
1379 			tcnt = st->cnt;
1380 		} while (u64_stats_fetch_retry_irq(&st->syncp, start));
1381 		nsecs += tnsecs;
1382 		cnt += tcnt;
1383 	}
1384 	stats->nsecs = nsecs;
1385 	stats->cnt = cnt;
1386 }
1387 
1388 #ifdef CONFIG_PROC_FS
1389 static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
1390 {
1391 	const struct bpf_prog *prog = filp->private_data;
1392 	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
1393 	struct bpf_prog_stats stats;
1394 
1395 	bpf_prog_get_stats(prog, &stats);
1396 	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
1397 	seq_printf(m,
1398 		   "prog_type:\t%u\n"
1399 		   "prog_jited:\t%u\n"
1400 		   "prog_tag:\t%s\n"
1401 		   "memlock:\t%llu\n"
1402 		   "prog_id:\t%u\n"
1403 		   "run_time_ns:\t%llu\n"
1404 		   "run_cnt:\t%llu\n",
1405 		   prog->type,
1406 		   prog->jited,
1407 		   prog_tag,
1408 		   prog->pages * 1ULL << PAGE_SHIFT,
1409 		   prog->aux->id,
1410 		   stats.nsecs,
1411 		   stats.cnt);
1412 }
1413 #endif
1414 
1415 const struct file_operations bpf_prog_fops = {
1416 #ifdef CONFIG_PROC_FS
1417 	.show_fdinfo	= bpf_prog_show_fdinfo,
1418 #endif
1419 	.release	= bpf_prog_release,
1420 	.read		= bpf_dummy_read,
1421 	.write		= bpf_dummy_write,
1422 };
1423 
1424 int bpf_prog_new_fd(struct bpf_prog *prog)
1425 {
1426 	int ret;
1427 
1428 	ret = security_bpf_prog(prog);
1429 	if (ret < 0)
1430 		return ret;
1431 
1432 	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
1433 				O_RDWR | O_CLOEXEC);
1434 }
1435 
1436 static struct bpf_prog *____bpf_prog_get(struct fd f)
1437 {
1438 	if (!f.file)
1439 		return ERR_PTR(-EBADF);
1440 	if (f.file->f_op != &bpf_prog_fops) {
1441 		fdput(f);
1442 		return ERR_PTR(-EINVAL);
1443 	}
1444 
1445 	return f.file->private_data;
1446 }
1447 
1448 struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
1449 {
1450 	if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
1451 		atomic_sub(i, &prog->aux->refcnt);
1452 		return ERR_PTR(-EBUSY);
1453 	}
1454 	return prog;
1455 }
1456 EXPORT_SYMBOL_GPL(bpf_prog_add);
1457 
1458 void bpf_prog_sub(struct bpf_prog *prog, int i)
1459 {
1460 	/* Only to be used for undoing previous bpf_prog_add() in some
1461 	 * error path. We still know that another entity in our call
1462 	 * path holds a reference to the program, thus atomic_sub() can
1463 	 * be safely used in such cases!
1464 	 */
1465 	WARN_ON(atomic_sub_return(i, &prog->aux->refcnt) == 0);
1466 }
1467 EXPORT_SYMBOL_GPL(bpf_prog_sub);
1468 
1469 struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
1470 {
1471 	return bpf_prog_add(prog, 1);
1472 }
1473 EXPORT_SYMBOL_GPL(bpf_prog_inc);
1474 
1475 /* prog_idr_lock should have been held */
1476 struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
1477 {
1478 	int refold;
1479 
1480 	refold = atomic_fetch_add_unless(&prog->aux->refcnt, 1, 0);
1481 
1482 	if (refold >= BPF_MAX_REFCNT) {
1483 		__bpf_prog_put(prog, false);
1484 		return ERR_PTR(-EBUSY);
1485 	}
1486 
1487 	if (!refold)
1488 		return ERR_PTR(-ENOENT);
1489 
1490 	return prog;
1491 }
1492 EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
1493 
1494 bool bpf_prog_get_ok(struct bpf_prog *prog,
1495 			    enum bpf_prog_type *attach_type, bool attach_drv)
1496 {
1497 	/* not an attachment, just a refcount inc, always allow */
1498 	if (!attach_type)
1499 		return true;
1500 
1501 	if (prog->type != *attach_type)
1502 		return false;
1503 	if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
1504 		return false;
1505 
1506 	return true;
1507 }
1508 
1509 static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
1510 				       bool attach_drv)
1511 {
1512 	struct fd f = fdget(ufd);
1513 	struct bpf_prog *prog;
1514 
1515 	prog = ____bpf_prog_get(f);
1516 	if (IS_ERR(prog))
1517 		return prog;
1518 	if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
1519 		prog = ERR_PTR(-EINVAL);
1520 		goto out;
1521 	}
1522 
1523 	prog = bpf_prog_inc(prog);
1524 out:
1525 	fdput(f);
1526 	return prog;
1527 }
1528 
1529 struct bpf_prog *bpf_prog_get(u32 ufd)
1530 {
1531 	return __bpf_prog_get(ufd, NULL, false);
1532 }
1533 
1534 struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
1535 				       bool attach_drv)
1536 {
1537 	return __bpf_prog_get(ufd, &type, attach_drv);
1538 }
1539 EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
1540 
1541 /* Initially all BPF programs could be loaded w/o specifying
1542  * expected_attach_type. Later for some of them specifying expected_attach_type
1543  * at load time became required so that program could be validated properly.
1544  * Programs of types that are allowed to be loaded both w/ and w/o (for
1545  * backward compatibility) expected_attach_type, should have the default attach
1546  * type assigned to expected_attach_type for the latter case, so that it can be
1547  * validated later at attach time.
1548  *
1549  * bpf_prog_load_fixup_attach_type() sets expected_attach_type in @attr if
1550  * prog type requires it but has some attach types that have to be backward
1551  * compatible.
1552  */
1553 static void bpf_prog_load_fixup_attach_type(union bpf_attr *attr)
1554 {
1555 	switch (attr->prog_type) {
1556 	case BPF_PROG_TYPE_CGROUP_SOCK:
1557 		/* Unfortunately BPF_ATTACH_TYPE_UNSPEC enumeration doesn't
1558 		 * exist so checking for non-zero is the way to go here.
1559 		 */
1560 		if (!attr->expected_attach_type)
1561 			attr->expected_attach_type =
1562 				BPF_CGROUP_INET_SOCK_CREATE;
1563 		break;
1564 	}
1565 }
1566 
1567 static int
1568 bpf_prog_load_check_attach_type(enum bpf_prog_type prog_type,
1569 				enum bpf_attach_type expected_attach_type)
1570 {
1571 	switch (prog_type) {
1572 	case BPF_PROG_TYPE_CGROUP_SOCK:
1573 		switch (expected_attach_type) {
1574 		case BPF_CGROUP_INET_SOCK_CREATE:
1575 		case BPF_CGROUP_INET4_POST_BIND:
1576 		case BPF_CGROUP_INET6_POST_BIND:
1577 			return 0;
1578 		default:
1579 			return -EINVAL;
1580 		}
1581 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
1582 		switch (expected_attach_type) {
1583 		case BPF_CGROUP_INET4_BIND:
1584 		case BPF_CGROUP_INET6_BIND:
1585 		case BPF_CGROUP_INET4_CONNECT:
1586 		case BPF_CGROUP_INET6_CONNECT:
1587 		case BPF_CGROUP_UDP4_SENDMSG:
1588 		case BPF_CGROUP_UDP6_SENDMSG:
1589 		case BPF_CGROUP_UDP4_RECVMSG:
1590 		case BPF_CGROUP_UDP6_RECVMSG:
1591 			return 0;
1592 		default:
1593 			return -EINVAL;
1594 		}
1595 	case BPF_PROG_TYPE_CGROUP_SKB:
1596 		switch (expected_attach_type) {
1597 		case BPF_CGROUP_INET_INGRESS:
1598 		case BPF_CGROUP_INET_EGRESS:
1599 			return 0;
1600 		default:
1601 			return -EINVAL;
1602 		}
1603 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
1604 		switch (expected_attach_type) {
1605 		case BPF_CGROUP_SETSOCKOPT:
1606 		case BPF_CGROUP_GETSOCKOPT:
1607 			return 0;
1608 		default:
1609 			return -EINVAL;
1610 		}
1611 	default:
1612 		return 0;
1613 	}
1614 }
1615 
1616 /* last field in 'union bpf_attr' used by this command */
1617 #define	BPF_PROG_LOAD_LAST_FIELD line_info_cnt
1618 
1619 static int bpf_prog_load(union bpf_attr *attr, union bpf_attr __user *uattr)
1620 {
1621 	enum bpf_prog_type type = attr->prog_type;
1622 	struct bpf_prog *prog;
1623 	int err;
1624 	char license[128];
1625 	bool is_gpl;
1626 
1627 	if (CHECK_ATTR(BPF_PROG_LOAD))
1628 		return -EINVAL;
1629 
1630 	if (attr->prog_flags & ~(BPF_F_STRICT_ALIGNMENT |
1631 				 BPF_F_ANY_ALIGNMENT |
1632 				 BPF_F_TEST_RND_HI32))
1633 		return -EINVAL;
1634 
1635 	if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) &&
1636 	    (attr->prog_flags & BPF_F_ANY_ALIGNMENT) &&
1637 	    !capable(CAP_SYS_ADMIN))
1638 		return -EPERM;
1639 
1640 	/* copy eBPF program license from user space */
1641 	if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
1642 			      sizeof(license) - 1) < 0)
1643 		return -EFAULT;
1644 	license[sizeof(license) - 1] = 0;
1645 
1646 	/* eBPF programs must be GPL compatible to use GPL-ed functions */
1647 	is_gpl = license_is_gpl_compatible(license);
1648 
1649 	if (attr->insn_cnt == 0 ||
1650 	    attr->insn_cnt > (capable(CAP_SYS_ADMIN) ? BPF_COMPLEXITY_LIMIT_INSNS : BPF_MAXINSNS))
1651 		return -E2BIG;
1652 	if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
1653 	    type != BPF_PROG_TYPE_CGROUP_SKB &&
1654 	    !capable(CAP_SYS_ADMIN))
1655 		return -EPERM;
1656 
1657 	bpf_prog_load_fixup_attach_type(attr);
1658 	if (bpf_prog_load_check_attach_type(type, attr->expected_attach_type))
1659 		return -EINVAL;
1660 
1661 	/* plain bpf_prog allocation */
1662 	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
1663 	if (!prog)
1664 		return -ENOMEM;
1665 
1666 	prog->expected_attach_type = attr->expected_attach_type;
1667 
1668 	prog->aux->offload_requested = !!attr->prog_ifindex;
1669 
1670 	err = security_bpf_prog_alloc(prog->aux);
1671 	if (err)
1672 		goto free_prog_nouncharge;
1673 
1674 	err = bpf_prog_charge_memlock(prog);
1675 	if (err)
1676 		goto free_prog_sec;
1677 
1678 	prog->len = attr->insn_cnt;
1679 
1680 	err = -EFAULT;
1681 	if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
1682 			   bpf_prog_insn_size(prog)) != 0)
1683 		goto free_prog;
1684 
1685 	prog->orig_prog = NULL;
1686 	prog->jited = 0;
1687 
1688 	atomic_set(&prog->aux->refcnt, 1);
1689 	prog->gpl_compatible = is_gpl ? 1 : 0;
1690 
1691 	if (bpf_prog_is_dev_bound(prog->aux)) {
1692 		err = bpf_prog_offload_init(prog, attr);
1693 		if (err)
1694 			goto free_prog;
1695 	}
1696 
1697 	/* find program type: socket_filter vs tracing_filter */
1698 	err = find_prog_type(type, prog);
1699 	if (err < 0)
1700 		goto free_prog;
1701 
1702 	prog->aux->load_time = ktime_get_boottime_ns();
1703 	err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
1704 	if (err)
1705 		goto free_prog;
1706 
1707 	/* run eBPF verifier */
1708 	err = bpf_check(&prog, attr, uattr);
1709 	if (err < 0)
1710 		goto free_used_maps;
1711 
1712 	prog = bpf_prog_select_runtime(prog, &err);
1713 	if (err < 0)
1714 		goto free_used_maps;
1715 
1716 	err = bpf_prog_alloc_id(prog);
1717 	if (err)
1718 		goto free_used_maps;
1719 
1720 	err = bpf_prog_new_fd(prog);
1721 	if (err < 0) {
1722 		/* failed to allocate fd.
1723 		 * bpf_prog_put() is needed because the above
1724 		 * bpf_prog_alloc_id() has published the prog
1725 		 * to the userspace and the userspace may
1726 		 * have refcnt-ed it through BPF_PROG_GET_FD_BY_ID.
1727 		 */
1728 		bpf_prog_put(prog);
1729 		return err;
1730 	}
1731 
1732 	bpf_prog_kallsyms_add(prog);
1733 	perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_LOAD, 0);
1734 	return err;
1735 
1736 free_used_maps:
1737 	bpf_prog_free_linfo(prog);
1738 	kvfree(prog->aux->func_info);
1739 	btf_put(prog->aux->btf);
1740 	bpf_prog_kallsyms_del_subprogs(prog);
1741 	free_used_maps(prog->aux);
1742 free_prog:
1743 	bpf_prog_uncharge_memlock(prog);
1744 free_prog_sec:
1745 	security_bpf_prog_free(prog->aux);
1746 free_prog_nouncharge:
1747 	bpf_prog_free(prog);
1748 	return err;
1749 }
1750 
1751 #define BPF_OBJ_LAST_FIELD file_flags
1752 
1753 static int bpf_obj_pin(const union bpf_attr *attr)
1754 {
1755 	if (CHECK_ATTR(BPF_OBJ) || attr->file_flags != 0)
1756 		return -EINVAL;
1757 
1758 	return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
1759 }
1760 
1761 static int bpf_obj_get(const union bpf_attr *attr)
1762 {
1763 	if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
1764 	    attr->file_flags & ~BPF_OBJ_FLAG_MASK)
1765 		return -EINVAL;
1766 
1767 	return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
1768 				attr->file_flags);
1769 }
1770 
1771 struct bpf_raw_tracepoint {
1772 	struct bpf_raw_event_map *btp;
1773 	struct bpf_prog *prog;
1774 };
1775 
1776 static int bpf_raw_tracepoint_release(struct inode *inode, struct file *filp)
1777 {
1778 	struct bpf_raw_tracepoint *raw_tp = filp->private_data;
1779 
1780 	if (raw_tp->prog) {
1781 		bpf_probe_unregister(raw_tp->btp, raw_tp->prog);
1782 		bpf_prog_put(raw_tp->prog);
1783 	}
1784 	bpf_put_raw_tracepoint(raw_tp->btp);
1785 	kfree(raw_tp);
1786 	return 0;
1787 }
1788 
1789 static const struct file_operations bpf_raw_tp_fops = {
1790 	.release	= bpf_raw_tracepoint_release,
1791 	.read		= bpf_dummy_read,
1792 	.write		= bpf_dummy_write,
1793 };
1794 
1795 #define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd
1796 
1797 static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
1798 {
1799 	struct bpf_raw_tracepoint *raw_tp;
1800 	struct bpf_raw_event_map *btp;
1801 	struct bpf_prog *prog;
1802 	char tp_name[128];
1803 	int tp_fd, err;
1804 
1805 	if (strncpy_from_user(tp_name, u64_to_user_ptr(attr->raw_tracepoint.name),
1806 			      sizeof(tp_name) - 1) < 0)
1807 		return -EFAULT;
1808 	tp_name[sizeof(tp_name) - 1] = 0;
1809 
1810 	btp = bpf_get_raw_tracepoint(tp_name);
1811 	if (!btp)
1812 		return -ENOENT;
1813 
1814 	raw_tp = kzalloc(sizeof(*raw_tp), GFP_USER);
1815 	if (!raw_tp) {
1816 		err = -ENOMEM;
1817 		goto out_put_btp;
1818 	}
1819 	raw_tp->btp = btp;
1820 
1821 	prog = bpf_prog_get(attr->raw_tracepoint.prog_fd);
1822 	if (IS_ERR(prog)) {
1823 		err = PTR_ERR(prog);
1824 		goto out_free_tp;
1825 	}
1826 	if (prog->type != BPF_PROG_TYPE_RAW_TRACEPOINT &&
1827 	    prog->type != BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE) {
1828 		err = -EINVAL;
1829 		goto out_put_prog;
1830 	}
1831 
1832 	err = bpf_probe_register(raw_tp->btp, prog);
1833 	if (err)
1834 		goto out_put_prog;
1835 
1836 	raw_tp->prog = prog;
1837 	tp_fd = anon_inode_getfd("bpf-raw-tracepoint", &bpf_raw_tp_fops, raw_tp,
1838 				 O_CLOEXEC);
1839 	if (tp_fd < 0) {
1840 		bpf_probe_unregister(raw_tp->btp, prog);
1841 		err = tp_fd;
1842 		goto out_put_prog;
1843 	}
1844 	return tp_fd;
1845 
1846 out_put_prog:
1847 	bpf_prog_put(prog);
1848 out_free_tp:
1849 	kfree(raw_tp);
1850 out_put_btp:
1851 	bpf_put_raw_tracepoint(btp);
1852 	return err;
1853 }
1854 
1855 static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
1856 					     enum bpf_attach_type attach_type)
1857 {
1858 	switch (prog->type) {
1859 	case BPF_PROG_TYPE_CGROUP_SOCK:
1860 	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
1861 	case BPF_PROG_TYPE_CGROUP_SOCKOPT:
1862 		return attach_type == prog->expected_attach_type ? 0 : -EINVAL;
1863 	case BPF_PROG_TYPE_CGROUP_SKB:
1864 		return prog->enforce_expected_attach_type &&
1865 			prog->expected_attach_type != attach_type ?
1866 			-EINVAL : 0;
1867 	default:
1868 		return 0;
1869 	}
1870 }
1871 
1872 #define BPF_PROG_ATTACH_LAST_FIELD attach_flags
1873 
1874 #define BPF_F_ATTACH_MASK \
1875 	(BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)
1876 
1877 static int bpf_prog_attach(const union bpf_attr *attr)
1878 {
1879 	enum bpf_prog_type ptype;
1880 	struct bpf_prog *prog;
1881 	int ret;
1882 
1883 	if (!capable(CAP_NET_ADMIN))
1884 		return -EPERM;
1885 
1886 	if (CHECK_ATTR(BPF_PROG_ATTACH))
1887 		return -EINVAL;
1888 
1889 	if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
1890 		return -EINVAL;
1891 
1892 	switch (attr->attach_type) {
1893 	case BPF_CGROUP_INET_INGRESS:
1894 	case BPF_CGROUP_INET_EGRESS:
1895 		ptype = BPF_PROG_TYPE_CGROUP_SKB;
1896 		break;
1897 	case BPF_CGROUP_INET_SOCK_CREATE:
1898 	case BPF_CGROUP_INET4_POST_BIND:
1899 	case BPF_CGROUP_INET6_POST_BIND:
1900 		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
1901 		break;
1902 	case BPF_CGROUP_INET4_BIND:
1903 	case BPF_CGROUP_INET6_BIND:
1904 	case BPF_CGROUP_INET4_CONNECT:
1905 	case BPF_CGROUP_INET6_CONNECT:
1906 	case BPF_CGROUP_UDP4_SENDMSG:
1907 	case BPF_CGROUP_UDP6_SENDMSG:
1908 	case BPF_CGROUP_UDP4_RECVMSG:
1909 	case BPF_CGROUP_UDP6_RECVMSG:
1910 		ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
1911 		break;
1912 	case BPF_CGROUP_SOCK_OPS:
1913 		ptype = BPF_PROG_TYPE_SOCK_OPS;
1914 		break;
1915 	case BPF_CGROUP_DEVICE:
1916 		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
1917 		break;
1918 	case BPF_SK_MSG_VERDICT:
1919 		ptype = BPF_PROG_TYPE_SK_MSG;
1920 		break;
1921 	case BPF_SK_SKB_STREAM_PARSER:
1922 	case BPF_SK_SKB_STREAM_VERDICT:
1923 		ptype = BPF_PROG_TYPE_SK_SKB;
1924 		break;
1925 	case BPF_LIRC_MODE2:
1926 		ptype = BPF_PROG_TYPE_LIRC_MODE2;
1927 		break;
1928 	case BPF_FLOW_DISSECTOR:
1929 		ptype = BPF_PROG_TYPE_FLOW_DISSECTOR;
1930 		break;
1931 	case BPF_CGROUP_SYSCTL:
1932 		ptype = BPF_PROG_TYPE_CGROUP_SYSCTL;
1933 		break;
1934 	case BPF_CGROUP_GETSOCKOPT:
1935 	case BPF_CGROUP_SETSOCKOPT:
1936 		ptype = BPF_PROG_TYPE_CGROUP_SOCKOPT;
1937 		break;
1938 	default:
1939 		return -EINVAL;
1940 	}
1941 
1942 	prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
1943 	if (IS_ERR(prog))
1944 		return PTR_ERR(prog);
1945 
1946 	if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
1947 		bpf_prog_put(prog);
1948 		return -EINVAL;
1949 	}
1950 
1951 	switch (ptype) {
1952 	case BPF_PROG_TYPE_SK_SKB:
1953 	case BPF_PROG_TYPE_SK_MSG:
1954 		ret = sock_map_get_from_fd(attr, prog);
1955 		break;
1956 	case BPF_PROG_TYPE_LIRC_MODE2:
1957 		ret = lirc_prog_attach(attr, prog);
1958 		break;
1959 	case BPF_PROG_TYPE_FLOW_DISSECTOR:
1960 		ret = skb_flow_dissector_bpf_prog_attach(attr, prog);
1961 		break;
1962 	default:
1963 		ret = cgroup_bpf_prog_attach(attr, ptype, prog);
1964 	}
1965 
1966 	if (ret)
1967 		bpf_prog_put(prog);
1968 	return ret;
1969 }
1970 
1971 #define BPF_PROG_DETACH_LAST_FIELD attach_type
1972 
1973 static int bpf_prog_detach(const union bpf_attr *attr)
1974 {
1975 	enum bpf_prog_type ptype;
1976 
1977 	if (!capable(CAP_NET_ADMIN))
1978 		return -EPERM;
1979 
1980 	if (CHECK_ATTR(BPF_PROG_DETACH))
1981 		return -EINVAL;
1982 
1983 	switch (attr->attach_type) {
1984 	case BPF_CGROUP_INET_INGRESS:
1985 	case BPF_CGROUP_INET_EGRESS:
1986 		ptype = BPF_PROG_TYPE_CGROUP_SKB;
1987 		break;
1988 	case BPF_CGROUP_INET_SOCK_CREATE:
1989 	case BPF_CGROUP_INET4_POST_BIND:
1990 	case BPF_CGROUP_INET6_POST_BIND:
1991 		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
1992 		break;
1993 	case BPF_CGROUP_INET4_BIND:
1994 	case BPF_CGROUP_INET6_BIND:
1995 	case BPF_CGROUP_INET4_CONNECT:
1996 	case BPF_CGROUP_INET6_CONNECT:
1997 	case BPF_CGROUP_UDP4_SENDMSG:
1998 	case BPF_CGROUP_UDP6_SENDMSG:
1999 	case BPF_CGROUP_UDP4_RECVMSG:
2000 	case BPF_CGROUP_UDP6_RECVMSG:
2001 		ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
2002 		break;
2003 	case BPF_CGROUP_SOCK_OPS:
2004 		ptype = BPF_PROG_TYPE_SOCK_OPS;
2005 		break;
2006 	case BPF_CGROUP_DEVICE:
2007 		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
2008 		break;
2009 	case BPF_SK_MSG_VERDICT:
2010 		return sock_map_get_from_fd(attr, NULL);
2011 	case BPF_SK_SKB_STREAM_PARSER:
2012 	case BPF_SK_SKB_STREAM_VERDICT:
2013 		return sock_map_get_from_fd(attr, NULL);
2014 	case BPF_LIRC_MODE2:
2015 		return lirc_prog_detach(attr);
2016 	case BPF_FLOW_DISSECTOR:
2017 		return skb_flow_dissector_bpf_prog_detach(attr);
2018 	case BPF_CGROUP_SYSCTL:
2019 		ptype = BPF_PROG_TYPE_CGROUP_SYSCTL;
2020 		break;
2021 	case BPF_CGROUP_GETSOCKOPT:
2022 	case BPF_CGROUP_SETSOCKOPT:
2023 		ptype = BPF_PROG_TYPE_CGROUP_SOCKOPT;
2024 		break;
2025 	default:
2026 		return -EINVAL;
2027 	}
2028 
2029 	return cgroup_bpf_prog_detach(attr, ptype);
2030 }
2031 
2032 #define BPF_PROG_QUERY_LAST_FIELD query.prog_cnt
2033 
2034 static int bpf_prog_query(const union bpf_attr *attr,
2035 			  union bpf_attr __user *uattr)
2036 {
2037 	if (!capable(CAP_NET_ADMIN))
2038 		return -EPERM;
2039 	if (CHECK_ATTR(BPF_PROG_QUERY))
2040 		return -EINVAL;
2041 	if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
2042 		return -EINVAL;
2043 
2044 	switch (attr->query.attach_type) {
2045 	case BPF_CGROUP_INET_INGRESS:
2046 	case BPF_CGROUP_INET_EGRESS:
2047 	case BPF_CGROUP_INET_SOCK_CREATE:
2048 	case BPF_CGROUP_INET4_BIND:
2049 	case BPF_CGROUP_INET6_BIND:
2050 	case BPF_CGROUP_INET4_POST_BIND:
2051 	case BPF_CGROUP_INET6_POST_BIND:
2052 	case BPF_CGROUP_INET4_CONNECT:
2053 	case BPF_CGROUP_INET6_CONNECT:
2054 	case BPF_CGROUP_UDP4_SENDMSG:
2055 	case BPF_CGROUP_UDP6_SENDMSG:
2056 	case BPF_CGROUP_UDP4_RECVMSG:
2057 	case BPF_CGROUP_UDP6_RECVMSG:
2058 	case BPF_CGROUP_SOCK_OPS:
2059 	case BPF_CGROUP_DEVICE:
2060 	case BPF_CGROUP_SYSCTL:
2061 	case BPF_CGROUP_GETSOCKOPT:
2062 	case BPF_CGROUP_SETSOCKOPT:
2063 		break;
2064 	case BPF_LIRC_MODE2:
2065 		return lirc_prog_query(attr, uattr);
2066 	case BPF_FLOW_DISSECTOR:
2067 		return skb_flow_dissector_prog_query(attr, uattr);
2068 	default:
2069 		return -EINVAL;
2070 	}
2071 
2072 	return cgroup_bpf_prog_query(attr, uattr);
2073 }
2074 
2075 #define BPF_PROG_TEST_RUN_LAST_FIELD test.ctx_out
2076 
2077 static int bpf_prog_test_run(const union bpf_attr *attr,
2078 			     union bpf_attr __user *uattr)
2079 {
2080 	struct bpf_prog *prog;
2081 	int ret = -ENOTSUPP;
2082 
2083 	if (!capable(CAP_SYS_ADMIN))
2084 		return -EPERM;
2085 	if (CHECK_ATTR(BPF_PROG_TEST_RUN))
2086 		return -EINVAL;
2087 
2088 	if ((attr->test.ctx_size_in && !attr->test.ctx_in) ||
2089 	    (!attr->test.ctx_size_in && attr->test.ctx_in))
2090 		return -EINVAL;
2091 
2092 	if ((attr->test.ctx_size_out && !attr->test.ctx_out) ||
2093 	    (!attr->test.ctx_size_out && attr->test.ctx_out))
2094 		return -EINVAL;
2095 
2096 	prog = bpf_prog_get(attr->test.prog_fd);
2097 	if (IS_ERR(prog))
2098 		return PTR_ERR(prog);
2099 
2100 	if (prog->aux->ops->test_run)
2101 		ret = prog->aux->ops->test_run(prog, attr, uattr);
2102 
2103 	bpf_prog_put(prog);
2104 	return ret;
2105 }
2106 
2107 #define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
2108 
2109 static int bpf_obj_get_next_id(const union bpf_attr *attr,
2110 			       union bpf_attr __user *uattr,
2111 			       struct idr *idr,
2112 			       spinlock_t *lock)
2113 {
2114 	u32 next_id = attr->start_id;
2115 	int err = 0;
2116 
2117 	if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
2118 		return -EINVAL;
2119 
2120 	if (!capable(CAP_SYS_ADMIN))
2121 		return -EPERM;
2122 
2123 	next_id++;
2124 	spin_lock_bh(lock);
2125 	if (!idr_get_next(idr, &next_id))
2126 		err = -ENOENT;
2127 	spin_unlock_bh(lock);
2128 
2129 	if (!err)
2130 		err = put_user(next_id, &uattr->next_id);
2131 
2132 	return err;
2133 }
2134 
2135 #define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
2136 
2137 static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
2138 {
2139 	struct bpf_prog *prog;
2140 	u32 id = attr->prog_id;
2141 	int fd;
2142 
2143 	if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
2144 		return -EINVAL;
2145 
2146 	if (!capable(CAP_SYS_ADMIN))
2147 		return -EPERM;
2148 
2149 	spin_lock_bh(&prog_idr_lock);
2150 	prog = idr_find(&prog_idr, id);
2151 	if (prog)
2152 		prog = bpf_prog_inc_not_zero(prog);
2153 	else
2154 		prog = ERR_PTR(-ENOENT);
2155 	spin_unlock_bh(&prog_idr_lock);
2156 
2157 	if (IS_ERR(prog))
2158 		return PTR_ERR(prog);
2159 
2160 	fd = bpf_prog_new_fd(prog);
2161 	if (fd < 0)
2162 		bpf_prog_put(prog);
2163 
2164 	return fd;
2165 }
2166 
2167 #define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
2168 
2169 static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
2170 {
2171 	struct bpf_map *map;
2172 	u32 id = attr->map_id;
2173 	int f_flags;
2174 	int fd;
2175 
2176 	if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
2177 	    attr->open_flags & ~BPF_OBJ_FLAG_MASK)
2178 		return -EINVAL;
2179 
2180 	if (!capable(CAP_SYS_ADMIN))
2181 		return -EPERM;
2182 
2183 	f_flags = bpf_get_file_flag(attr->open_flags);
2184 	if (f_flags < 0)
2185 		return f_flags;
2186 
2187 	spin_lock_bh(&map_idr_lock);
2188 	map = idr_find(&map_idr, id);
2189 	if (map)
2190 		map = __bpf_map_inc_not_zero(map, true);
2191 	else
2192 		map = ERR_PTR(-ENOENT);
2193 	spin_unlock_bh(&map_idr_lock);
2194 
2195 	if (IS_ERR(map))
2196 		return PTR_ERR(map);
2197 
2198 	fd = bpf_map_new_fd(map, f_flags);
2199 	if (fd < 0)
2200 		bpf_map_put_with_uref(map);
2201 
2202 	return fd;
2203 }
2204 
2205 static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
2206 					      unsigned long addr, u32 *off,
2207 					      u32 *type)
2208 {
2209 	const struct bpf_map *map;
2210 	int i;
2211 
2212 	for (i = 0, *off = 0; i < prog->aux->used_map_cnt; i++) {
2213 		map = prog->aux->used_maps[i];
2214 		if (map == (void *)addr) {
2215 			*type = BPF_PSEUDO_MAP_FD;
2216 			return map;
2217 		}
2218 		if (!map->ops->map_direct_value_meta)
2219 			continue;
2220 		if (!map->ops->map_direct_value_meta(map, addr, off)) {
2221 			*type = BPF_PSEUDO_MAP_VALUE;
2222 			return map;
2223 		}
2224 	}
2225 
2226 	return NULL;
2227 }
2228 
2229 static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog)
2230 {
2231 	const struct bpf_map *map;
2232 	struct bpf_insn *insns;
2233 	u32 off, type;
2234 	u64 imm;
2235 	int i;
2236 
2237 	insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
2238 			GFP_USER);
2239 	if (!insns)
2240 		return insns;
2241 
2242 	for (i = 0; i < prog->len; i++) {
2243 		if (insns[i].code == (BPF_JMP | BPF_TAIL_CALL)) {
2244 			insns[i].code = BPF_JMP | BPF_CALL;
2245 			insns[i].imm = BPF_FUNC_tail_call;
2246 			/* fall-through */
2247 		}
2248 		if (insns[i].code == (BPF_JMP | BPF_CALL) ||
2249 		    insns[i].code == (BPF_JMP | BPF_CALL_ARGS)) {
2250 			if (insns[i].code == (BPF_JMP | BPF_CALL_ARGS))
2251 				insns[i].code = BPF_JMP | BPF_CALL;
2252 			if (!bpf_dump_raw_ok())
2253 				insns[i].imm = 0;
2254 			continue;
2255 		}
2256 
2257 		if (insns[i].code != (BPF_LD | BPF_IMM | BPF_DW))
2258 			continue;
2259 
2260 		imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
2261 		map = bpf_map_from_imm(prog, imm, &off, &type);
2262 		if (map) {
2263 			insns[i].src_reg = type;
2264 			insns[i].imm = map->id;
2265 			insns[i + 1].imm = off;
2266 			continue;
2267 		}
2268 	}
2269 
2270 	return insns;
2271 }
2272 
2273 static int set_info_rec_size(struct bpf_prog_info *info)
2274 {
2275 	/*
2276 	 * Ensure info.*_rec_size is the same as kernel expected size
2277 	 *
2278 	 * or
2279 	 *
2280 	 * Only allow zero *_rec_size if both _rec_size and _cnt are
2281 	 * zero.  In this case, the kernel will set the expected
2282 	 * _rec_size back to the info.
2283 	 */
2284 
2285 	if ((info->nr_func_info || info->func_info_rec_size) &&
2286 	    info->func_info_rec_size != sizeof(struct bpf_func_info))
2287 		return -EINVAL;
2288 
2289 	if ((info->nr_line_info || info->line_info_rec_size) &&
2290 	    info->line_info_rec_size != sizeof(struct bpf_line_info))
2291 		return -EINVAL;
2292 
2293 	if ((info->nr_jited_line_info || info->jited_line_info_rec_size) &&
2294 	    info->jited_line_info_rec_size != sizeof(__u64))
2295 		return -EINVAL;
2296 
2297 	info->func_info_rec_size = sizeof(struct bpf_func_info);
2298 	info->line_info_rec_size = sizeof(struct bpf_line_info);
2299 	info->jited_line_info_rec_size = sizeof(__u64);
2300 
2301 	return 0;
2302 }
2303 
2304 static int bpf_prog_get_info_by_fd(struct bpf_prog *prog,
2305 				   const union bpf_attr *attr,
2306 				   union bpf_attr __user *uattr)
2307 {
2308 	struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
2309 	struct bpf_prog_info info = {};
2310 	u32 info_len = attr->info.info_len;
2311 	struct bpf_prog_stats stats;
2312 	char __user *uinsns;
2313 	u32 ulen;
2314 	int err;
2315 
2316 	err = bpf_check_uarg_tail_zero(uinfo, sizeof(info), info_len);
2317 	if (err)
2318 		return err;
2319 	info_len = min_t(u32, sizeof(info), info_len);
2320 
2321 	if (copy_from_user(&info, uinfo, info_len))
2322 		return -EFAULT;
2323 
2324 	info.type = prog->type;
2325 	info.id = prog->aux->id;
2326 	info.load_time = prog->aux->load_time;
2327 	info.created_by_uid = from_kuid_munged(current_user_ns(),
2328 					       prog->aux->user->uid);
2329 	info.gpl_compatible = prog->gpl_compatible;
2330 
2331 	memcpy(info.tag, prog->tag, sizeof(prog->tag));
2332 	memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
2333 
2334 	ulen = info.nr_map_ids;
2335 	info.nr_map_ids = prog->aux->used_map_cnt;
2336 	ulen = min_t(u32, info.nr_map_ids, ulen);
2337 	if (ulen) {
2338 		u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
2339 		u32 i;
2340 
2341 		for (i = 0; i < ulen; i++)
2342 			if (put_user(prog->aux->used_maps[i]->id,
2343 				     &user_map_ids[i]))
2344 				return -EFAULT;
2345 	}
2346 
2347 	err = set_info_rec_size(&info);
2348 	if (err)
2349 		return err;
2350 
2351 	bpf_prog_get_stats(prog, &stats);
2352 	info.run_time_ns = stats.nsecs;
2353 	info.run_cnt = stats.cnt;
2354 
2355 	if (!capable(CAP_SYS_ADMIN)) {
2356 		info.jited_prog_len = 0;
2357 		info.xlated_prog_len = 0;
2358 		info.nr_jited_ksyms = 0;
2359 		info.nr_jited_func_lens = 0;
2360 		info.nr_func_info = 0;
2361 		info.nr_line_info = 0;
2362 		info.nr_jited_line_info = 0;
2363 		goto done;
2364 	}
2365 
2366 	ulen = info.xlated_prog_len;
2367 	info.xlated_prog_len = bpf_prog_insn_size(prog);
2368 	if (info.xlated_prog_len && ulen) {
2369 		struct bpf_insn *insns_sanitized;
2370 		bool fault;
2371 
2372 		if (prog->blinded && !bpf_dump_raw_ok()) {
2373 			info.xlated_prog_insns = 0;
2374 			goto done;
2375 		}
2376 		insns_sanitized = bpf_insn_prepare_dump(prog);
2377 		if (!insns_sanitized)
2378 			return -ENOMEM;
2379 		uinsns = u64_to_user_ptr(info.xlated_prog_insns);
2380 		ulen = min_t(u32, info.xlated_prog_len, ulen);
2381 		fault = copy_to_user(uinsns, insns_sanitized, ulen);
2382 		kfree(insns_sanitized);
2383 		if (fault)
2384 			return -EFAULT;
2385 	}
2386 
2387 	if (bpf_prog_is_dev_bound(prog->aux)) {
2388 		err = bpf_prog_offload_info_fill(&info, prog);
2389 		if (err)
2390 			return err;
2391 		goto done;
2392 	}
2393 
2394 	/* NOTE: the following code is supposed to be skipped for offload.
2395 	 * bpf_prog_offload_info_fill() is the place to fill similar fields
2396 	 * for offload.
2397 	 */
2398 	ulen = info.jited_prog_len;
2399 	if (prog->aux->func_cnt) {
2400 		u32 i;
2401 
2402 		info.jited_prog_len = 0;
2403 		for (i = 0; i < prog->aux->func_cnt; i++)
2404 			info.jited_prog_len += prog->aux->func[i]->jited_len;
2405 	} else {
2406 		info.jited_prog_len = prog->jited_len;
2407 	}
2408 
2409 	if (info.jited_prog_len && ulen) {
2410 		if (bpf_dump_raw_ok()) {
2411 			uinsns = u64_to_user_ptr(info.jited_prog_insns);
2412 			ulen = min_t(u32, info.jited_prog_len, ulen);
2413 
2414 			/* for multi-function programs, copy the JITed
2415 			 * instructions for all the functions
2416 			 */
2417 			if (prog->aux->func_cnt) {
2418 				u32 len, free, i;
2419 				u8 *img;
2420 
2421 				free = ulen;
2422 				for (i = 0; i < prog->aux->func_cnt; i++) {
2423 					len = prog->aux->func[i]->jited_len;
2424 					len = min_t(u32, len, free);
2425 					img = (u8 *) prog->aux->func[i]->bpf_func;
2426 					if (copy_to_user(uinsns, img, len))
2427 						return -EFAULT;
2428 					uinsns += len;
2429 					free -= len;
2430 					if (!free)
2431 						break;
2432 				}
2433 			} else {
2434 				if (copy_to_user(uinsns, prog->bpf_func, ulen))
2435 					return -EFAULT;
2436 			}
2437 		} else {
2438 			info.jited_prog_insns = 0;
2439 		}
2440 	}
2441 
2442 	ulen = info.nr_jited_ksyms;
2443 	info.nr_jited_ksyms = prog->aux->func_cnt ? : 1;
2444 	if (ulen) {
2445 		if (bpf_dump_raw_ok()) {
2446 			unsigned long ksym_addr;
2447 			u64 __user *user_ksyms;
2448 			u32 i;
2449 
2450 			/* copy the address of the kernel symbol
2451 			 * corresponding to each function
2452 			 */
2453 			ulen = min_t(u32, info.nr_jited_ksyms, ulen);
2454 			user_ksyms = u64_to_user_ptr(info.jited_ksyms);
2455 			if (prog->aux->func_cnt) {
2456 				for (i = 0; i < ulen; i++) {
2457 					ksym_addr = (unsigned long)
2458 						prog->aux->func[i]->bpf_func;
2459 					if (put_user((u64) ksym_addr,
2460 						     &user_ksyms[i]))
2461 						return -EFAULT;
2462 				}
2463 			} else {
2464 				ksym_addr = (unsigned long) prog->bpf_func;
2465 				if (put_user((u64) ksym_addr, &user_ksyms[0]))
2466 					return -EFAULT;
2467 			}
2468 		} else {
2469 			info.jited_ksyms = 0;
2470 		}
2471 	}
2472 
2473 	ulen = info.nr_jited_func_lens;
2474 	info.nr_jited_func_lens = prog->aux->func_cnt ? : 1;
2475 	if (ulen) {
2476 		if (bpf_dump_raw_ok()) {
2477 			u32 __user *user_lens;
2478 			u32 func_len, i;
2479 
2480 			/* copy the JITed image lengths for each function */
2481 			ulen = min_t(u32, info.nr_jited_func_lens, ulen);
2482 			user_lens = u64_to_user_ptr(info.jited_func_lens);
2483 			if (prog->aux->func_cnt) {
2484 				for (i = 0; i < ulen; i++) {
2485 					func_len =
2486 						prog->aux->func[i]->jited_len;
2487 					if (put_user(func_len, &user_lens[i]))
2488 						return -EFAULT;
2489 				}
2490 			} else {
2491 				func_len = prog->jited_len;
2492 				if (put_user(func_len, &user_lens[0]))
2493 					return -EFAULT;
2494 			}
2495 		} else {
2496 			info.jited_func_lens = 0;
2497 		}
2498 	}
2499 
2500 	if (prog->aux->btf)
2501 		info.btf_id = btf_id(prog->aux->btf);
2502 
2503 	ulen = info.nr_func_info;
2504 	info.nr_func_info = prog->aux->func_info_cnt;
2505 	if (info.nr_func_info && ulen) {
2506 		char __user *user_finfo;
2507 
2508 		user_finfo = u64_to_user_ptr(info.func_info);
2509 		ulen = min_t(u32, info.nr_func_info, ulen);
2510 		if (copy_to_user(user_finfo, prog->aux->func_info,
2511 				 info.func_info_rec_size * ulen))
2512 			return -EFAULT;
2513 	}
2514 
2515 	ulen = info.nr_line_info;
2516 	info.nr_line_info = prog->aux->nr_linfo;
2517 	if (info.nr_line_info && ulen) {
2518 		__u8 __user *user_linfo;
2519 
2520 		user_linfo = u64_to_user_ptr(info.line_info);
2521 		ulen = min_t(u32, info.nr_line_info, ulen);
2522 		if (copy_to_user(user_linfo, prog->aux->linfo,
2523 				 info.line_info_rec_size * ulen))
2524 			return -EFAULT;
2525 	}
2526 
2527 	ulen = info.nr_jited_line_info;
2528 	if (prog->aux->jited_linfo)
2529 		info.nr_jited_line_info = prog->aux->nr_linfo;
2530 	else
2531 		info.nr_jited_line_info = 0;
2532 	if (info.nr_jited_line_info && ulen) {
2533 		if (bpf_dump_raw_ok()) {
2534 			__u64 __user *user_linfo;
2535 			u32 i;
2536 
2537 			user_linfo = u64_to_user_ptr(info.jited_line_info);
2538 			ulen = min_t(u32, info.nr_jited_line_info, ulen);
2539 			for (i = 0; i < ulen; i++) {
2540 				if (put_user((__u64)(long)prog->aux->jited_linfo[i],
2541 					     &user_linfo[i]))
2542 					return -EFAULT;
2543 			}
2544 		} else {
2545 			info.jited_line_info = 0;
2546 		}
2547 	}
2548 
2549 	ulen = info.nr_prog_tags;
2550 	info.nr_prog_tags = prog->aux->func_cnt ? : 1;
2551 	if (ulen) {
2552 		__u8 __user (*user_prog_tags)[BPF_TAG_SIZE];
2553 		u32 i;
2554 
2555 		user_prog_tags = u64_to_user_ptr(info.prog_tags);
2556 		ulen = min_t(u32, info.nr_prog_tags, ulen);
2557 		if (prog->aux->func_cnt) {
2558 			for (i = 0; i < ulen; i++) {
2559 				if (copy_to_user(user_prog_tags[i],
2560 						 prog->aux->func[i]->tag,
2561 						 BPF_TAG_SIZE))
2562 					return -EFAULT;
2563 			}
2564 		} else {
2565 			if (copy_to_user(user_prog_tags[0],
2566 					 prog->tag, BPF_TAG_SIZE))
2567 				return -EFAULT;
2568 		}
2569 	}
2570 
2571 done:
2572 	if (copy_to_user(uinfo, &info, info_len) ||
2573 	    put_user(info_len, &uattr->info.info_len))
2574 		return -EFAULT;
2575 
2576 	return 0;
2577 }
2578 
2579 static int bpf_map_get_info_by_fd(struct bpf_map *map,
2580 				  const union bpf_attr *attr,
2581 				  union bpf_attr __user *uattr)
2582 {
2583 	struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
2584 	struct bpf_map_info info = {};
2585 	u32 info_len = attr->info.info_len;
2586 	int err;
2587 
2588 	err = bpf_check_uarg_tail_zero(uinfo, sizeof(info), info_len);
2589 	if (err)
2590 		return err;
2591 	info_len = min_t(u32, sizeof(info), info_len);
2592 
2593 	info.type = map->map_type;
2594 	info.id = map->id;
2595 	info.key_size = map->key_size;
2596 	info.value_size = map->value_size;
2597 	info.max_entries = map->max_entries;
2598 	info.map_flags = map->map_flags;
2599 	memcpy(info.name, map->name, sizeof(map->name));
2600 
2601 	if (map->btf) {
2602 		info.btf_id = btf_id(map->btf);
2603 		info.btf_key_type_id = map->btf_key_type_id;
2604 		info.btf_value_type_id = map->btf_value_type_id;
2605 	}
2606 
2607 	if (bpf_map_is_dev_bound(map)) {
2608 		err = bpf_map_offload_info_fill(&info, map);
2609 		if (err)
2610 			return err;
2611 	}
2612 
2613 	if (copy_to_user(uinfo, &info, info_len) ||
2614 	    put_user(info_len, &uattr->info.info_len))
2615 		return -EFAULT;
2616 
2617 	return 0;
2618 }
2619 
2620 static int bpf_btf_get_info_by_fd(struct btf *btf,
2621 				  const union bpf_attr *attr,
2622 				  union bpf_attr __user *uattr)
2623 {
2624 	struct bpf_btf_info __user *uinfo = u64_to_user_ptr(attr->info.info);
2625 	u32 info_len = attr->info.info_len;
2626 	int err;
2627 
2628 	err = bpf_check_uarg_tail_zero(uinfo, sizeof(*uinfo), info_len);
2629 	if (err)
2630 		return err;
2631 
2632 	return btf_get_info_by_fd(btf, attr, uattr);
2633 }
2634 
2635 #define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
2636 
2637 static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
2638 				  union bpf_attr __user *uattr)
2639 {
2640 	int ufd = attr->info.bpf_fd;
2641 	struct fd f;
2642 	int err;
2643 
2644 	if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
2645 		return -EINVAL;
2646 
2647 	f = fdget(ufd);
2648 	if (!f.file)
2649 		return -EBADFD;
2650 
2651 	if (f.file->f_op == &bpf_prog_fops)
2652 		err = bpf_prog_get_info_by_fd(f.file->private_data, attr,
2653 					      uattr);
2654 	else if (f.file->f_op == &bpf_map_fops)
2655 		err = bpf_map_get_info_by_fd(f.file->private_data, attr,
2656 					     uattr);
2657 	else if (f.file->f_op == &btf_fops)
2658 		err = bpf_btf_get_info_by_fd(f.file->private_data, attr, uattr);
2659 	else
2660 		err = -EINVAL;
2661 
2662 	fdput(f);
2663 	return err;
2664 }
2665 
2666 #define BPF_BTF_LOAD_LAST_FIELD btf_log_level
2667 
2668 static int bpf_btf_load(const union bpf_attr *attr)
2669 {
2670 	if (CHECK_ATTR(BPF_BTF_LOAD))
2671 		return -EINVAL;
2672 
2673 	if (!capable(CAP_SYS_ADMIN))
2674 		return -EPERM;
2675 
2676 	return btf_new_fd(attr);
2677 }
2678 
2679 #define BPF_BTF_GET_FD_BY_ID_LAST_FIELD btf_id
2680 
2681 static int bpf_btf_get_fd_by_id(const union bpf_attr *attr)
2682 {
2683 	if (CHECK_ATTR(BPF_BTF_GET_FD_BY_ID))
2684 		return -EINVAL;
2685 
2686 	if (!capable(CAP_SYS_ADMIN))
2687 		return -EPERM;
2688 
2689 	return btf_get_fd_by_id(attr->btf_id);
2690 }
2691 
2692 static int bpf_task_fd_query_copy(const union bpf_attr *attr,
2693 				    union bpf_attr __user *uattr,
2694 				    u32 prog_id, u32 fd_type,
2695 				    const char *buf, u64 probe_offset,
2696 				    u64 probe_addr)
2697 {
2698 	char __user *ubuf = u64_to_user_ptr(attr->task_fd_query.buf);
2699 	u32 len = buf ? strlen(buf) : 0, input_len;
2700 	int err = 0;
2701 
2702 	if (put_user(len, &uattr->task_fd_query.buf_len))
2703 		return -EFAULT;
2704 	input_len = attr->task_fd_query.buf_len;
2705 	if (input_len && ubuf) {
2706 		if (!len) {
2707 			/* nothing to copy, just make ubuf NULL terminated */
2708 			char zero = '\0';
2709 
2710 			if (put_user(zero, ubuf))
2711 				return -EFAULT;
2712 		} else if (input_len >= len + 1) {
2713 			/* ubuf can hold the string with NULL terminator */
2714 			if (copy_to_user(ubuf, buf, len + 1))
2715 				return -EFAULT;
2716 		} else {
2717 			/* ubuf cannot hold the string with NULL terminator,
2718 			 * do a partial copy with NULL terminator.
2719 			 */
2720 			char zero = '\0';
2721 
2722 			err = -ENOSPC;
2723 			if (copy_to_user(ubuf, buf, input_len - 1))
2724 				return -EFAULT;
2725 			if (put_user(zero, ubuf + input_len - 1))
2726 				return -EFAULT;
2727 		}
2728 	}
2729 
2730 	if (put_user(prog_id, &uattr->task_fd_query.prog_id) ||
2731 	    put_user(fd_type, &uattr->task_fd_query.fd_type) ||
2732 	    put_user(probe_offset, &uattr->task_fd_query.probe_offset) ||
2733 	    put_user(probe_addr, &uattr->task_fd_query.probe_addr))
2734 		return -EFAULT;
2735 
2736 	return err;
2737 }
2738 
2739 #define BPF_TASK_FD_QUERY_LAST_FIELD task_fd_query.probe_addr
2740 
2741 static int bpf_task_fd_query(const union bpf_attr *attr,
2742 			     union bpf_attr __user *uattr)
2743 {
2744 	pid_t pid = attr->task_fd_query.pid;
2745 	u32 fd = attr->task_fd_query.fd;
2746 	const struct perf_event *event;
2747 	struct files_struct *files;
2748 	struct task_struct *task;
2749 	struct file *file;
2750 	int err;
2751 
2752 	if (CHECK_ATTR(BPF_TASK_FD_QUERY))
2753 		return -EINVAL;
2754 
2755 	if (!capable(CAP_SYS_ADMIN))
2756 		return -EPERM;
2757 
2758 	if (attr->task_fd_query.flags != 0)
2759 		return -EINVAL;
2760 
2761 	task = get_pid_task(find_vpid(pid), PIDTYPE_PID);
2762 	if (!task)
2763 		return -ENOENT;
2764 
2765 	files = get_files_struct(task);
2766 	put_task_struct(task);
2767 	if (!files)
2768 		return -ENOENT;
2769 
2770 	err = 0;
2771 	spin_lock(&files->file_lock);
2772 	file = fcheck_files(files, fd);
2773 	if (!file)
2774 		err = -EBADF;
2775 	else
2776 		get_file(file);
2777 	spin_unlock(&files->file_lock);
2778 	put_files_struct(files);
2779 
2780 	if (err)
2781 		goto out;
2782 
2783 	if (file->f_op == &bpf_raw_tp_fops) {
2784 		struct bpf_raw_tracepoint *raw_tp = file->private_data;
2785 		struct bpf_raw_event_map *btp = raw_tp->btp;
2786 
2787 		err = bpf_task_fd_query_copy(attr, uattr,
2788 					     raw_tp->prog->aux->id,
2789 					     BPF_FD_TYPE_RAW_TRACEPOINT,
2790 					     btp->tp->name, 0, 0);
2791 		goto put_file;
2792 	}
2793 
2794 	event = perf_get_event(file);
2795 	if (!IS_ERR(event)) {
2796 		u64 probe_offset, probe_addr;
2797 		u32 prog_id, fd_type;
2798 		const char *buf;
2799 
2800 		err = bpf_get_perf_event_info(event, &prog_id, &fd_type,
2801 					      &buf, &probe_offset,
2802 					      &probe_addr);
2803 		if (!err)
2804 			err = bpf_task_fd_query_copy(attr, uattr, prog_id,
2805 						     fd_type, buf,
2806 						     probe_offset,
2807 						     probe_addr);
2808 		goto put_file;
2809 	}
2810 
2811 	err = -ENOTSUPP;
2812 put_file:
2813 	fput(file);
2814 out:
2815 	return err;
2816 }
2817 
2818 SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
2819 {
2820 	union bpf_attr attr = {};
2821 	int err;
2822 
2823 	if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
2824 		return -EPERM;
2825 
2826 	err = bpf_check_uarg_tail_zero(uattr, sizeof(attr), size);
2827 	if (err)
2828 		return err;
2829 	size = min_t(u32, size, sizeof(attr));
2830 
2831 	/* copy attributes from user space, may be less than sizeof(bpf_attr) */
2832 	if (copy_from_user(&attr, uattr, size) != 0)
2833 		return -EFAULT;
2834 
2835 	err = security_bpf(cmd, &attr, size);
2836 	if (err < 0)
2837 		return err;
2838 
2839 	switch (cmd) {
2840 	case BPF_MAP_CREATE:
2841 		err = map_create(&attr);
2842 		break;
2843 	case BPF_MAP_LOOKUP_ELEM:
2844 		err = map_lookup_elem(&attr);
2845 		break;
2846 	case BPF_MAP_UPDATE_ELEM:
2847 		err = map_update_elem(&attr);
2848 		break;
2849 	case BPF_MAP_DELETE_ELEM:
2850 		err = map_delete_elem(&attr);
2851 		break;
2852 	case BPF_MAP_GET_NEXT_KEY:
2853 		err = map_get_next_key(&attr);
2854 		break;
2855 	case BPF_MAP_FREEZE:
2856 		err = map_freeze(&attr);
2857 		break;
2858 	case BPF_PROG_LOAD:
2859 		err = bpf_prog_load(&attr, uattr);
2860 		break;
2861 	case BPF_OBJ_PIN:
2862 		err = bpf_obj_pin(&attr);
2863 		break;
2864 	case BPF_OBJ_GET:
2865 		err = bpf_obj_get(&attr);
2866 		break;
2867 	case BPF_PROG_ATTACH:
2868 		err = bpf_prog_attach(&attr);
2869 		break;
2870 	case BPF_PROG_DETACH:
2871 		err = bpf_prog_detach(&attr);
2872 		break;
2873 	case BPF_PROG_QUERY:
2874 		err = bpf_prog_query(&attr, uattr);
2875 		break;
2876 	case BPF_PROG_TEST_RUN:
2877 		err = bpf_prog_test_run(&attr, uattr);
2878 		break;
2879 	case BPF_PROG_GET_NEXT_ID:
2880 		err = bpf_obj_get_next_id(&attr, uattr,
2881 					  &prog_idr, &prog_idr_lock);
2882 		break;
2883 	case BPF_MAP_GET_NEXT_ID:
2884 		err = bpf_obj_get_next_id(&attr, uattr,
2885 					  &map_idr, &map_idr_lock);
2886 		break;
2887 	case BPF_BTF_GET_NEXT_ID:
2888 		err = bpf_obj_get_next_id(&attr, uattr,
2889 					  &btf_idr, &btf_idr_lock);
2890 		break;
2891 	case BPF_PROG_GET_FD_BY_ID:
2892 		err = bpf_prog_get_fd_by_id(&attr);
2893 		break;
2894 	case BPF_MAP_GET_FD_BY_ID:
2895 		err = bpf_map_get_fd_by_id(&attr);
2896 		break;
2897 	case BPF_OBJ_GET_INFO_BY_FD:
2898 		err = bpf_obj_get_info_by_fd(&attr, uattr);
2899 		break;
2900 	case BPF_RAW_TRACEPOINT_OPEN:
2901 		err = bpf_raw_tracepoint_open(&attr);
2902 		break;
2903 	case BPF_BTF_LOAD:
2904 		err = bpf_btf_load(&attr);
2905 		break;
2906 	case BPF_BTF_GET_FD_BY_ID:
2907 		err = bpf_btf_get_fd_by_id(&attr);
2908 		break;
2909 	case BPF_TASK_FD_QUERY:
2910 		err = bpf_task_fd_query(&attr, uattr);
2911 		break;
2912 	case BPF_MAP_LOOKUP_AND_DELETE_ELEM:
2913 		err = map_lookup_and_delete_elem(&attr);
2914 		break;
2915 	default:
2916 		err = -EINVAL;
2917 		break;
2918 	}
2919 
2920 	return err;
2921 }
2922