syscall.c 48.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 */
#include <linux/bpf.h>
13
#include <linux/bpf_trace.h>
14
#include <linux/btf.h>
15 16
#include <linux/syscalls.h>
#include <linux/slab.h>
17
#include <linux/sched/signal.h>
18 19
#include <linux/vmalloc.h>
#include <linux/mmzone.h>
20
#include <linux/anon_inodes.h>
21
#include <linux/file.h>
22 23
#include <linux/license.h>
#include <linux/filter.h>
24
#include <linux/version.h>
M
Mickaël Salaün 已提交
25
#include <linux/kernel.h>
M
Martin KaFai Lau 已提交
26
#include <linux/idr.h>
27 28 29
#include <linux/cred.h>
#include <linux/timekeeping.h>
#include <linux/ctype.h>
30
#include <linux/btf.h>
31

32 33 34 35 36 37 38
#define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY || \
			   (map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
			   (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
			   (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
#define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
#define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_HASH(map))

39 40
#define BPF_OBJ_FLAG_MASK   (BPF_F_RDONLY | BPF_F_WRONLY)

41
DEFINE_PER_CPU(int, bpf_prog_active);
M
Martin KaFai Lau 已提交
42 43
static DEFINE_IDR(prog_idr);
static DEFINE_SPINLOCK(prog_idr_lock);
M
Martin KaFai Lau 已提交
44 45
static DEFINE_IDR(map_idr);
static DEFINE_SPINLOCK(map_idr_lock);
46

47 48
int sysctl_unprivileged_bpf_disabled __read_mostly;

49 50 51 52 53 54 55 56
static const struct bpf_map_ops * const bpf_map_types[] = {
#define BPF_PROG_TYPE(_id, _ops)
#define BPF_MAP_TYPE(_id, _ops) \
	[_id] = &_ops,
#include <linux/bpf_types.h>
#undef BPF_PROG_TYPE
#undef BPF_MAP_TYPE
};
57

58 59 60 61 62 63 64 65 66
/*
 * If we're handed a bigger struct than we know of, ensure all the unknown bits
 * are 0 - i.e. new user-space does not rely on any kernel feature extensions
 * we don't know about yet.
 *
 * There is a ToCToU between this function call and the following
 * copy_from_user() call. However, this is not a concern since this function is
 * meant to be a future-proofing of bits.
 */
67 68 69 70 71 72 73 74 75
static int check_uarg_tail_zero(void __user *uaddr,
				size_t expected_size,
				size_t actual_size)
{
	unsigned char __user *addr;
	unsigned char __user *end;
	unsigned char val;
	int err;

76 77 78 79 80 81
	if (unlikely(actual_size > PAGE_SIZE))	/* silly large */
		return -E2BIG;

	if (unlikely(!access_ok(VERIFY_READ, uaddr, actual_size)))
		return -EFAULT;

82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
	if (actual_size <= expected_size)
		return 0;

	addr = uaddr + expected_size;
	end  = uaddr + actual_size;

	for (; addr < end; addr++) {
		err = get_user(val, addr);
		if (err)
			return err;
		if (val)
			return -E2BIG;
	}

	return 0;
}

99 100 101 102 103
const struct bpf_map_ops bpf_map_offload_ops = {
	.map_alloc = bpf_map_offload_map_alloc,
	.map_free = bpf_map_offload_map_free,
};

104 105
static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
{
106
	const struct bpf_map_ops *ops;
107
	struct bpf_map *map;
108
	int err;
109

110 111 112 113
	if (attr->map_type >= ARRAY_SIZE(bpf_map_types))
		return ERR_PTR(-EINVAL);
	ops = bpf_map_types[attr->map_type];
	if (!ops)
114
		return ERR_PTR(-EINVAL);
115

116 117 118 119 120
	if (ops->map_alloc_check) {
		err = ops->map_alloc_check(attr);
		if (err)
			return ERR_PTR(err);
	}
121 122
	if (attr->map_ifindex)
		ops = &bpf_map_offload_ops;
123
	map = ops->map_alloc(attr);
124 125
	if (IS_ERR(map))
		return map;
126
	map->ops = ops;
127 128
	map->map_type = attr->map_type;
	return map;
129 130
}

131
void *bpf_map_area_alloc(size_t size, int numa_node)
132 133 134 135 136 137 138 139 140
{
	/* We definitely need __GFP_NORETRY, so OOM killer doesn't
	 * trigger under memory pressure as we really just want to
	 * fail instead.
	 */
	const gfp_t flags = __GFP_NOWARN | __GFP_NORETRY | __GFP_ZERO;
	void *area;

	if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
141
		area = kmalloc_node(size, GFP_USER | flags, numa_node);
142 143 144 145
		if (area != NULL)
			return area;
	}

146 147
	return __vmalloc_node_flags_caller(size, numa_node, GFP_KERNEL | flags,
					   __builtin_return_address(0));
148 149 150 151 152 153 154
}

void bpf_map_area_free(void *area)
{
	kvfree(area);
}

155 156 157 158 159 160 161 162 163 164
void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
{
	map->map_type = attr->map_type;
	map->key_size = attr->key_size;
	map->value_size = attr->value_size;
	map->max_entries = attr->max_entries;
	map->map_flags = attr->map_flags;
	map->numa_node = bpf_map_attr_numa_node(attr);
}

165 166 167 168 169 170 171 172 173 174 175 176 177
int bpf_map_precharge_memlock(u32 pages)
{
	struct user_struct *user = get_current_user();
	unsigned long memlock_limit, cur;

	memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
	cur = atomic_long_read(&user->locked_vm);
	free_uid(user);
	if (cur + pages > memlock_limit)
		return -EPERM;
	return 0;
}

178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203
static int bpf_map_charge_memlock(struct bpf_map *map)
{
	struct user_struct *user = get_current_user();
	unsigned long memlock_limit;

	memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;

	atomic_long_add(map->pages, &user->locked_vm);

	if (atomic_long_read(&user->locked_vm) > memlock_limit) {
		atomic_long_sub(map->pages, &user->locked_vm);
		free_uid(user);
		return -EPERM;
	}
	map->user = user;
	return 0;
}

static void bpf_map_uncharge_memlock(struct bpf_map *map)
{
	struct user_struct *user = map->user;

	atomic_long_sub(map->pages, &user->locked_vm);
	free_uid(user);
}

M
Martin KaFai Lau 已提交
204 205 206 207
static int bpf_map_alloc_id(struct bpf_map *map)
{
	int id;

S
Shaohua Li 已提交
208
	idr_preload(GFP_KERNEL);
M
Martin KaFai Lau 已提交
209 210 211 212 213
	spin_lock_bh(&map_idr_lock);
	id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
	if (id > 0)
		map->id = id;
	spin_unlock_bh(&map_idr_lock);
S
Shaohua Li 已提交
214
	idr_preload_end();
M
Martin KaFai Lau 已提交
215 216 217 218 219 220 221

	if (WARN_ON_ONCE(!id))
		return -ENOSPC;

	return id > 0 ? 0 : id;
}

222
void bpf_map_free_id(struct bpf_map *map, bool do_idr_lock)
M
Martin KaFai Lau 已提交
223
{
224 225
	unsigned long flags;

226 227 228 229 230 231 232 233
	/* Offloaded maps are removed from the IDR store when their device
	 * disappears - even if someone holds an fd to them they are unusable,
	 * the memory is gone, all ops will fail; they are simply waiting for
	 * refcnt to drop to be freed.
	 */
	if (!map->id)
		return;

M
Martin KaFai Lau 已提交
234
	if (do_idr_lock)
235
		spin_lock_irqsave(&map_idr_lock, flags);
M
Martin KaFai Lau 已提交
236 237 238
	else
		__acquire(&map_idr_lock);

M
Martin KaFai Lau 已提交
239
	idr_remove(&map_idr, map->id);
240
	map->id = 0;
M
Martin KaFai Lau 已提交
241 242

	if (do_idr_lock)
243
		spin_unlock_irqrestore(&map_idr_lock, flags);
M
Martin KaFai Lau 已提交
244 245
	else
		__release(&map_idr_lock);
M
Martin KaFai Lau 已提交
246 247
}

248 249 250 251 252
/* called from workqueue */
static void bpf_map_free_deferred(struct work_struct *work)
{
	struct bpf_map *map = container_of(work, struct bpf_map, work);

253
	bpf_map_uncharge_memlock(map);
254
	security_bpf_map_free(map);
255
	btf_put(map->btf);
256 257 258 259
	/* implementation dependent freeing */
	map->ops->map_free(map);
}

260 261 262
static void bpf_map_put_uref(struct bpf_map *map)
{
	if (atomic_dec_and_test(&map->usercnt)) {
263 264
		if (map->ops->map_release_uref)
			map->ops->map_release_uref(map);
265 266 267
	}
}

268 269 270
/* decrement map refcnt and schedule it for freeing via workqueue
 * (unrelying map implementation ops->map_free() might sleep)
 */
M
Martin KaFai Lau 已提交
271
static void __bpf_map_put(struct bpf_map *map, bool do_idr_lock)
272 273
{
	if (atomic_dec_and_test(&map->refcnt)) {
274
		/* bpf_map_free_id() must be called first */
M
Martin KaFai Lau 已提交
275
		bpf_map_free_id(map, do_idr_lock);
276 277 278 279 280
		INIT_WORK(&map->work, bpf_map_free_deferred);
		schedule_work(&map->work);
	}
}

M
Martin KaFai Lau 已提交
281 282 283 284 285
void bpf_map_put(struct bpf_map *map)
{
	__bpf_map_put(map, true);
}

286
void bpf_map_put_with_uref(struct bpf_map *map)
287
{
288
	bpf_map_put_uref(map);
289
	bpf_map_put(map);
290 291 292 293
}

static int bpf_map_release(struct inode *inode, struct file *filp)
{
294 295 296 297 298 299
	struct bpf_map *map = filp->private_data;

	if (map->ops->map_release)
		map->ops->map_release(map, filp);

	bpf_map_put_with_uref(map);
300 301 302
	return 0;
}

303 304 305 306
#ifdef CONFIG_PROC_FS
static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
{
	const struct bpf_map *map = filp->private_data;
307 308
	const struct bpf_array *array;
	u32 owner_prog_type = 0;
309
	u32 owner_jited = 0;
310 311 312 313

	if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
		array = container_of(map, struct bpf_array, map);
		owner_prog_type = array->owner_prog_type;
314
		owner_jited = array->owner_jited;
315
	}
316 317 318 319 320

	seq_printf(m,
		   "map_type:\t%u\n"
		   "key_size:\t%u\n"
		   "value_size:\t%u\n"
321
		   "max_entries:\t%u\n"
322 323
		   "map_flags:\t%#x\n"
		   "memlock:\t%llu\n",
324 325 326
		   map->map_type,
		   map->key_size,
		   map->value_size,
327
		   map->max_entries,
328 329 330
		   map->map_flags,
		   map->pages * 1ULL << PAGE_SHIFT);

331
	if (owner_prog_type) {
332 333
		seq_printf(m, "owner_prog_type:\t%u\n",
			   owner_prog_type);
334 335 336
		seq_printf(m, "owner_jited:\t%u\n",
			   owner_jited);
	}
337 338 339
}
#endif

340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357
static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
			      loff_t *ppos)
{
	/* We need this handler such that alloc_file() enables
	 * f_mode with FMODE_CAN_READ.
	 */
	return -EINVAL;
}

static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
			       size_t siz, loff_t *ppos)
{
	/* We need this handler such that alloc_file() enables
	 * f_mode with FMODE_CAN_WRITE.
	 */
	return -EINVAL;
}

358
const struct file_operations bpf_map_fops = {
359 360 361 362
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_map_show_fdinfo,
#endif
	.release	= bpf_map_release,
363 364
	.read		= bpf_dummy_read,
	.write		= bpf_dummy_write,
365 366
};

367
int bpf_map_new_fd(struct bpf_map *map, int flags)
368
{
369 370 371 372 373 374
	int ret;

	ret = security_bpf_map(map, OPEN_FMODE(flags));
	if (ret < 0)
		return ret;

375
	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
376 377 378 379 380 381 382 383 384 385 386 387
				flags | O_CLOEXEC);
}

int bpf_get_file_flag(int flags)
{
	if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
		return -EINVAL;
	if (flags & BPF_F_RDONLY)
		return O_RDONLY;
	if (flags & BPF_F_WRONLY)
		return O_WRONLY;
	return O_RDWR;
388 389
}

390 391 392 393 394 395 396 397
/* helper macro to check that unused fields 'union bpf_attr' are zero */
#define CHECK_ATTR(CMD) \
	memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
		   sizeof(attr->CMD##_LAST_FIELD), 0, \
		   sizeof(*attr) - \
		   offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
		   sizeof(attr->CMD##_LAST_FIELD)) != NULL

398 399 400 401 402 403 404
/* dst and src must have at least BPF_OBJ_NAME_LEN number of bytes.
 * Return 0 on success and < 0 on error.
 */
static int bpf_obj_name_cpy(char *dst, const char *src)
{
	const char *end = src + BPF_OBJ_NAME_LEN;

405 406
	memset(dst, 0, BPF_OBJ_NAME_LEN);

407 408 409 410 411 412 413 414 415 416 417 418 419 420
	/* Copy all isalnum() and '_' char */
	while (src < end && *src) {
		if (!isalnum(*src) && *src != '_')
			return -EINVAL;
		*dst++ = *src++;
	}

	/* No '\0' found in BPF_OBJ_NAME_LEN number of bytes */
	if (src == end)
		return -EINVAL;

	return 0;
}

421
#define BPF_MAP_CREATE_LAST_FIELD btf_value_id
422 423 424
/* called via syscall */
static int map_create(union bpf_attr *attr)
{
425
	int numa_node = bpf_map_attr_numa_node(attr);
426
	struct bpf_map *map;
427
	int f_flags;
428 429 430 431 432 433
	int err;

	err = CHECK_ATTR(BPF_MAP_CREATE);
	if (err)
		return -EINVAL;

434 435 436 437
	f_flags = bpf_get_file_flag(attr->map_flags);
	if (f_flags < 0)
		return f_flags;

438
	if (numa_node != NUMA_NO_NODE &&
E
Eric Dumazet 已提交
439 440
	    ((unsigned int)numa_node >= nr_node_ids ||
	     !node_online(numa_node)))
441 442
		return -EINVAL;

443 444 445 446 447
	/* find map type and init map: hashtable vs rbtree vs bloom vs ... */
	map = find_and_alloc_map(attr);
	if (IS_ERR(map))
		return PTR_ERR(map);

448 449 450 451
	err = bpf_obj_name_cpy(map->name, attr->map_name);
	if (err)
		goto free_map_nouncharge;

452
	atomic_set(&map->refcnt, 1);
453
	atomic_set(&map->usercnt, 1);
454

455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481
	if (bpf_map_support_seq_show(map) &&
	    (attr->btf_key_id || attr->btf_value_id)) {
		struct btf *btf;

		if (!attr->btf_key_id || !attr->btf_value_id) {
			err = -EINVAL;
			goto free_map_nouncharge;
		}

		btf = btf_get_by_fd(attr->btf_fd);
		if (IS_ERR(btf)) {
			err = PTR_ERR(btf);
			goto free_map_nouncharge;
		}

		err = map->ops->map_check_btf(map, btf, attr->btf_key_id,
					      attr->btf_value_id);
		if (err) {
			btf_put(btf);
			goto free_map_nouncharge;
		}

		map->btf = btf;
		map->btf_key_id = attr->btf_key_id;
		map->btf_value_id = attr->btf_value_id;
	}

482
	err = security_bpf_map_alloc(map);
483
	if (err)
484
		goto free_map_nouncharge;
485

486 487 488 489
	err = bpf_map_charge_memlock(map);
	if (err)
		goto free_map_sec;

M
Martin KaFai Lau 已提交
490 491 492 493
	err = bpf_map_alloc_id(map);
	if (err)
		goto free_map;

494
	err = bpf_map_new_fd(map, f_flags);
M
Martin KaFai Lau 已提交
495 496 497 498 499 500 501 502 503 504
	if (err < 0) {
		/* failed to allocate fd.
		 * bpf_map_put() is needed because the above
		 * bpf_map_alloc_id() has published the map
		 * to the userspace and the userspace may
		 * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
		 */
		bpf_map_put(map);
		return err;
	}
505 506 507 508

	return err;

free_map:
509
	bpf_map_uncharge_memlock(map);
510 511
free_map_sec:
	security_bpf_map_free(map);
512
free_map_nouncharge:
513
	btf_put(map->btf);
514 515 516 517
	map->ops->map_free(map);
	return err;
}

518 519 520
/* if error is returned, fd is released.
 * On success caller should complete fd access with matching fdput()
 */
521
struct bpf_map *__bpf_map_get(struct fd f)
522 523 524 525 526 527 528 529
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_map_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

530 531 532
	return f.file->private_data;
}

A
Alexei Starovoitov 已提交
533 534 535 536
/* prog's and map's refcnt limit */
#define BPF_MAX_REFCNT 32768

struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
537
{
A
Alexei Starovoitov 已提交
538 539 540 541
	if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
		atomic_dec(&map->refcnt);
		return ERR_PTR(-EBUSY);
	}
542 543
	if (uref)
		atomic_inc(&map->usercnt);
A
Alexei Starovoitov 已提交
544
	return map;
545 546 547
}

struct bpf_map *bpf_map_get_with_uref(u32 ufd)
548 549 550 551 552 553 554 555
{
	struct fd f = fdget(ufd);
	struct bpf_map *map;

	map = __bpf_map_get(f);
	if (IS_ERR(map))
		return map;

A
Alexei Starovoitov 已提交
556
	map = bpf_map_inc(map, true);
557
	fdput(f);
558 559 560 561

	return map;
}

M
Martin KaFai Lau 已提交
562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583
/* map_idr_lock should have been held */
static struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map,
					    bool uref)
{
	int refold;

	refold = __atomic_add_unless(&map->refcnt, 1, 0);

	if (refold >= BPF_MAX_REFCNT) {
		__bpf_map_put(map, false);
		return ERR_PTR(-EBUSY);
	}

	if (!refold)
		return ERR_PTR(-ENOENT);

	if (uref)
		atomic_inc(&map->usercnt);

	return map;
}

584 585 586 587 588
int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
{
	return -ENOTSUPP;
}

589 590 591 592 593
/* last field in 'union bpf_attr' used by this command */
#define BPF_MAP_LOOKUP_ELEM_LAST_FIELD value

static int map_lookup_elem(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
594 595
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
596 597
	int ufd = attr->map_fd;
	struct bpf_map *map;
598
	void *key, *value, *ptr;
599
	u32 value_size;
600
	struct fd f;
601 602 603 604 605
	int err;

	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
		return -EINVAL;

606
	f = fdget(ufd);
607
	map = __bpf_map_get(f);
608 609 610
	if (IS_ERR(map))
		return PTR_ERR(map);

611 612 613 614 615
	if (!(f.file->f_mode & FMODE_CAN_READ)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
616 617 618
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
619
		goto err_put;
A
Al Viro 已提交
620
	}
621

622
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
623
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
624 625
	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
		value_size = round_up(map->value_size, 8) * num_possible_cpus();
626 627
	else if (IS_FD_MAP(map))
		value_size = sizeof(u32);
628 629 630
	else
		value_size = map->value_size;

631
	err = -ENOMEM;
632
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
633
	if (!value)
634 635
		goto free_key;

636 637 638 639
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_lookup_elem(map, key, value);
	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
		   map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
640 641 642
		err = bpf_percpu_hash_copy(map, key, value);
	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
		err = bpf_percpu_array_copy(map, key, value);
643 644
	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
		err = bpf_stackmap_copy(map, key, value);
645 646 647 648
	} else if (IS_FD_ARRAY(map)) {
		err = bpf_fd_array_map_lookup_elem(map, key, value);
	} else if (IS_FD_HASH(map)) {
		err = bpf_fd_htab_map_lookup_elem(map, key, value);
649 650 651 652 653 654 655 656
	} else {
		rcu_read_lock();
		ptr = map->ops->map_lookup_elem(map, key);
		if (ptr)
			memcpy(value, ptr, value_size);
		rcu_read_unlock();
		err = ptr ? 0 : -ENOENT;
	}
657

658
	if (err)
659
		goto free_value;
660 661

	err = -EFAULT;
662
	if (copy_to_user(uvalue, value, value_size) != 0)
663
		goto free_value;
664 665 666

	err = 0;

667 668
free_value:
	kfree(value);
669 670 671 672 673 674 675
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

676
#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
677 678 679

static int map_update_elem(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
680 681
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
682 683 684
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *value;
685
	u32 value_size;
686
	struct fd f;
687 688 689 690 691
	int err;

	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
		return -EINVAL;

692
	f = fdget(ufd);
693
	map = __bpf_map_get(f);
694 695 696
	if (IS_ERR(map))
		return PTR_ERR(map);

697 698 699 700 701
	if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
702 703 704
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
705
		goto err_put;
A
Al Viro 已提交
706
	}
707

708
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
709
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
710 711 712 713 714
	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
		value_size = round_up(map->value_size, 8) * num_possible_cpus();
	else
		value_size = map->value_size;

715
	err = -ENOMEM;
716
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
717 718 719 720
	if (!value)
		goto free_key;

	err = -EFAULT;
721
	if (copy_from_user(value, uvalue, value_size) != 0)
722 723
		goto free_value;

724
	/* Need to create a kthread, thus must support schedule */
725 726 727 728
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_update_elem(map, key, value, attr->flags);
		goto out;
	} else if (map->map_type == BPF_MAP_TYPE_CPUMAP) {
729 730 731 732
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		goto out;
	}

733 734 735 736 737
	/* must increment bpf_prog_active to avoid kprobe+bpf triggering from
	 * inside bpf map update or delete otherwise deadlocks are possible
	 */
	preempt_disable();
	__this_cpu_inc(bpf_prog_active);
738 739
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
740 741 742
		err = bpf_percpu_hash_update(map, key, value, attr->flags);
	} else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
		err = bpf_percpu_array_update(map, key, value, attr->flags);
743
	} else if (IS_FD_ARRAY(map)) {
744 745 746 747
		rcu_read_lock();
		err = bpf_fd_array_map_update_elem(map, f.file, key, value,
						   attr->flags);
		rcu_read_unlock();
M
Martin KaFai Lau 已提交
748 749 750 751 752
	} else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
		rcu_read_lock();
		err = bpf_fd_htab_map_update_elem(map, f.file, key, value,
						  attr->flags);
		rcu_read_unlock();
753 754 755 756 757
	} else {
		rcu_read_lock();
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		rcu_read_unlock();
	}
758 759
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
760
out:
761 762 763 764 765 766 767 768 769 770 771 772 773
free_value:
	kfree(value);
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

#define BPF_MAP_DELETE_ELEM_LAST_FIELD key

static int map_delete_elem(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
774
	void __user *ukey = u64_to_user_ptr(attr->key);
775 776
	int ufd = attr->map_fd;
	struct bpf_map *map;
777
	struct fd f;
778 779 780 781 782 783
	void *key;
	int err;

	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
		return -EINVAL;

784
	f = fdget(ufd);
785
	map = __bpf_map_get(f);
786 787 788
	if (IS_ERR(map))
		return PTR_ERR(map);

789 790 791 792 793
	if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
794 795 796
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
797
		goto err_put;
A
Al Viro 已提交
798
	}
799

800 801 802 803 804
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_delete_elem(map, key);
		goto out;
	}

805 806
	preempt_disable();
	__this_cpu_inc(bpf_prog_active);
807 808 809
	rcu_read_lock();
	err = map->ops->map_delete_elem(map, key);
	rcu_read_unlock();
810 811
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
812
out:
813 814 815 816 817 818 819 820 821 822 823
	kfree(key);
err_put:
	fdput(f);
	return err;
}

/* last field in 'union bpf_attr' used by this command */
#define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key

static int map_get_next_key(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
824 825
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *unext_key = u64_to_user_ptr(attr->next_key);
826 827 828
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *next_key;
829
	struct fd f;
830 831 832 833 834
	int err;

	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
		return -EINVAL;

835
	f = fdget(ufd);
836
	map = __bpf_map_get(f);
837 838 839
	if (IS_ERR(map))
		return PTR_ERR(map);

840 841 842 843 844
	if (!(f.file->f_mode & FMODE_CAN_READ)) {
		err = -EPERM;
		goto err_put;
	}

845
	if (ukey) {
A
Al Viro 已提交
846 847 848
		key = memdup_user(ukey, map->key_size);
		if (IS_ERR(key)) {
			err = PTR_ERR(key);
849
			goto err_put;
A
Al Viro 已提交
850
		}
851 852 853
	} else {
		key = NULL;
	}
854 855 856 857 858 859

	err = -ENOMEM;
	next_key = kmalloc(map->key_size, GFP_USER);
	if (!next_key)
		goto free_key;

860 861 862 863 864
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_get_next_key(map, key, next_key);
		goto out;
	}

865 866 867
	rcu_read_lock();
	err = map->ops->map_get_next_key(map, key, next_key);
	rcu_read_unlock();
868
out:
869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886
	if (err)
		goto free_next_key;

	err = -EFAULT;
	if (copy_to_user(unext_key, next_key, map->key_size) != 0)
		goto free_next_key;

	err = 0;

free_next_key:
	kfree(next_key);
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

887 888 889 890 891 892 893 894 895
static const struct bpf_prog_ops * const bpf_prog_types[] = {
#define BPF_PROG_TYPE(_id, _name) \
	[_id] = & _name ## _prog_ops,
#define BPF_MAP_TYPE(_id, _ops)
#include <linux/bpf_types.h>
#undef BPF_PROG_TYPE
#undef BPF_MAP_TYPE
};

896 897
static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
{
898 899
	if (type >= ARRAY_SIZE(bpf_prog_types) || !bpf_prog_types[type])
		return -EINVAL;
900

901 902 903 904
	if (!bpf_prog_is_dev_bound(prog->aux))
		prog->aux->ops = bpf_prog_types[type];
	else
		prog->aux->ops = &bpf_offload_prog_ops;
905 906
	prog->type = type;
	return 0;
907 908 909 910 911 912 913 914 915 916 917 918 919
}

/* drop refcnt on maps used by eBPF program and free auxilary data */
static void free_used_maps(struct bpf_prog_aux *aux)
{
	int i;

	for (i = 0; i < aux->used_map_cnt; i++)
		bpf_map_put(aux->used_maps[i]);

	kfree(aux->used_maps);
}

920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941
int __bpf_prog_charge(struct user_struct *user, u32 pages)
{
	unsigned long memlock_limit = rlimit(RLIMIT_MEMLOCK) >> PAGE_SHIFT;
	unsigned long user_bufs;

	if (user) {
		user_bufs = atomic_long_add_return(pages, &user->locked_vm);
		if (user_bufs > memlock_limit) {
			atomic_long_sub(pages, &user->locked_vm);
			return -EPERM;
		}
	}

	return 0;
}

void __bpf_prog_uncharge(struct user_struct *user, u32 pages)
{
	if (user)
		atomic_long_sub(pages, &user->locked_vm);
}

942 943 944
static int bpf_prog_charge_memlock(struct bpf_prog *prog)
{
	struct user_struct *user = get_current_user();
945
	int ret;
946

947 948
	ret = __bpf_prog_charge(user, prog->pages);
	if (ret) {
949
		free_uid(user);
950
		return ret;
951
	}
952

953 954 955 956 957 958 959 960
	prog->aux->user = user;
	return 0;
}

static void bpf_prog_uncharge_memlock(struct bpf_prog *prog)
{
	struct user_struct *user = prog->aux->user;

961
	__bpf_prog_uncharge(user, prog->pages);
962 963 964
	free_uid(user);
}

M
Martin KaFai Lau 已提交
965 966 967 968
static int bpf_prog_alloc_id(struct bpf_prog *prog)
{
	int id;

S
Shaohua Li 已提交
969
	idr_preload(GFP_KERNEL);
M
Martin KaFai Lau 已提交
970 971 972 973 974
	spin_lock_bh(&prog_idr_lock);
	id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
	if (id > 0)
		prog->aux->id = id;
	spin_unlock_bh(&prog_idr_lock);
S
Shaohua Li 已提交
975
	idr_preload_end();
M
Martin KaFai Lau 已提交
976 977 978 979 980 981 982 983

	/* id is in [1, INT_MAX) */
	if (WARN_ON_ONCE(!id))
		return -ENOSPC;

	return id > 0 ? 0 : id;
}

984
void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
M
Martin KaFai Lau 已提交
985
{
986 987 988 989 990
	/* cBPF to eBPF migrations are currently not in the idr store.
	 * Offloaded programs are removed from the store when their device
	 * disappears - even if someone grabs an fd to them they are unusable,
	 * simply waiting for refcnt to drop to be freed.
	 */
M
Martin KaFai Lau 已提交
991 992 993
	if (!prog->aux->id)
		return;

994 995 996 997 998
	if (do_idr_lock)
		spin_lock_bh(&prog_idr_lock);
	else
		__acquire(&prog_idr_lock);

M
Martin KaFai Lau 已提交
999
	idr_remove(&prog_idr, prog->aux->id);
1000
	prog->aux->id = 0;
1001 1002 1003 1004 1005

	if (do_idr_lock)
		spin_unlock_bh(&prog_idr_lock);
	else
		__release(&prog_idr_lock);
M
Martin KaFai Lau 已提交
1006 1007
}

1008
static void __bpf_prog_put_rcu(struct rcu_head *rcu)
1009 1010 1011 1012
{
	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);

	free_used_maps(aux);
1013
	bpf_prog_uncharge_memlock(aux->prog);
1014
	security_bpf_prog_free(aux);
1015 1016 1017
	bpf_prog_free(aux->prog);
}

1018
static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
1019
{
1020
	if (atomic_dec_and_test(&prog->aux->refcnt)) {
1021 1022
		int i;

1023
		/* bpf_prog_free_id() must be called first */
1024
		bpf_prog_free_id(prog, do_idr_lock);
1025 1026 1027

		for (i = 0; i < prog->aux->func_cnt; i++)
			bpf_prog_kallsyms_del(prog->aux->func[i]);
1028
		bpf_prog_kallsyms_del(prog);
1029

1030
		call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
1031
	}
1032
}
1033 1034 1035 1036 1037

void bpf_prog_put(struct bpf_prog *prog)
{
	__bpf_prog_put(prog, true);
}
1038
EXPORT_SYMBOL_GPL(bpf_prog_put);
1039 1040 1041 1042 1043

static int bpf_prog_release(struct inode *inode, struct file *filp)
{
	struct bpf_prog *prog = filp->private_data;

1044
	bpf_prog_put(prog);
1045 1046 1047
	return 0;
}

1048 1049 1050 1051
#ifdef CONFIG_PROC_FS
static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
{
	const struct bpf_prog *prog = filp->private_data;
1052
	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
1053

1054
	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
1055 1056 1057
	seq_printf(m,
		   "prog_type:\t%u\n"
		   "prog_jited:\t%u\n"
1058
		   "prog_tag:\t%s\n"
1059 1060 1061
		   "memlock:\t%llu\n",
		   prog->type,
		   prog->jited,
1062
		   prog_tag,
1063 1064 1065 1066
		   prog->pages * 1ULL << PAGE_SHIFT);
}
#endif

1067
const struct file_operations bpf_prog_fops = {
1068 1069 1070 1071
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_prog_show_fdinfo,
#endif
	.release	= bpf_prog_release,
1072 1073
	.read		= bpf_dummy_read,
	.write		= bpf_dummy_write,
1074 1075
};

1076
int bpf_prog_new_fd(struct bpf_prog *prog)
1077
{
1078 1079 1080 1081 1082 1083
	int ret;

	ret = security_bpf_prog(prog);
	if (ret < 0)
		return ret;

1084 1085 1086 1087
	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
				O_RDWR | O_CLOEXEC);
}

1088
static struct bpf_prog *____bpf_prog_get(struct fd f)
1089 1090 1091 1092 1093 1094 1095 1096
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_prog_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

1097
	return f.file->private_data;
1098 1099
}

1100
struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
A
Alexei Starovoitov 已提交
1101
{
1102 1103
	if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
		atomic_sub(i, &prog->aux->refcnt);
A
Alexei Starovoitov 已提交
1104 1105 1106 1107
		return ERR_PTR(-EBUSY);
	}
	return prog;
}
1108 1109
EXPORT_SYMBOL_GPL(bpf_prog_add);

1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120
void bpf_prog_sub(struct bpf_prog *prog, int i)
{
	/* Only to be used for undoing previous bpf_prog_add() in some
	 * error path. We still know that another entity in our call
	 * path holds a reference to the program, thus atomic_sub() can
	 * be safely used in such cases!
	 */
	WARN_ON(atomic_sub_return(i, &prog->aux->refcnt) == 0);
}
EXPORT_SYMBOL_GPL(bpf_prog_sub);

1121 1122 1123 1124
struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
{
	return bpf_prog_add(prog, 1);
}
1125
EXPORT_SYMBOL_GPL(bpf_prog_inc);
A
Alexei Starovoitov 已提交
1126

1127
/* prog_idr_lock should have been held */
1128
struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143
{
	int refold;

	refold = __atomic_add_unless(&prog->aux->refcnt, 1, 0);

	if (refold >= BPF_MAX_REFCNT) {
		__bpf_prog_put(prog, false);
		return ERR_PTR(-EBUSY);
	}

	if (!refold)
		return ERR_PTR(-ENOENT);

	return prog;
}
1144
EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
1145

1146
bool bpf_prog_get_ok(struct bpf_prog *prog,
1147
			    enum bpf_prog_type *attach_type, bool attach_drv)
1148
{
1149 1150 1151
	/* not an attachment, just a refcount inc, always allow */
	if (!attach_type)
		return true;
1152 1153 1154

	if (prog->type != *attach_type)
		return false;
1155
	if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
1156 1157 1158 1159 1160 1161
		return false;

	return true;
}

static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
1162
				       bool attach_drv)
1163 1164 1165 1166
{
	struct fd f = fdget(ufd);
	struct bpf_prog *prog;

1167
	prog = ____bpf_prog_get(f);
1168 1169
	if (IS_ERR(prog))
		return prog;
1170
	if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
1171 1172 1173
		prog = ERR_PTR(-EINVAL);
		goto out;
	}
1174

A
Alexei Starovoitov 已提交
1175
	prog = bpf_prog_inc(prog);
1176
out:
1177 1178 1179
	fdput(f);
	return prog;
}
1180 1181 1182

struct bpf_prog *bpf_prog_get(u32 ufd)
{
1183
	return __bpf_prog_get(ufd, NULL, false);
1184 1185
}

1186
struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
1187
				       bool attach_drv)
1188
{
1189
	return __bpf_prog_get(ufd, &type, attach_drv);
1190
}
1191
EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
1192

A
Andrey Ignatov 已提交
1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218
/* Initially all BPF programs could be loaded w/o specifying
 * expected_attach_type. Later for some of them specifying expected_attach_type
 * at load time became required so that program could be validated properly.
 * Programs of types that are allowed to be loaded both w/ and w/o (for
 * backward compatibility) expected_attach_type, should have the default attach
 * type assigned to expected_attach_type for the latter case, so that it can be
 * validated later at attach time.
 *
 * bpf_prog_load_fixup_attach_type() sets expected_attach_type in @attr if
 * prog type requires it but has some attach types that have to be backward
 * compatible.
 */
static void bpf_prog_load_fixup_attach_type(union bpf_attr *attr)
{
	switch (attr->prog_type) {
	case BPF_PROG_TYPE_CGROUP_SOCK:
		/* Unfortunately BPF_ATTACH_TYPE_UNSPEC enumeration doesn't
		 * exist so checking for non-zero is the way to go here.
		 */
		if (!attr->expected_attach_type)
			attr->expected_attach_type =
				BPF_CGROUP_INET_SOCK_CREATE;
		break;
	}
}

1219 1220 1221 1222
static int
bpf_prog_load_check_attach_type(enum bpf_prog_type prog_type,
				enum bpf_attach_type expected_attach_type)
{
A
Andrey Ignatov 已提交
1223
	switch (prog_type) {
A
Andrey Ignatov 已提交
1224 1225 1226 1227 1228 1229 1230 1231 1232
	case BPF_PROG_TYPE_CGROUP_SOCK:
		switch (expected_attach_type) {
		case BPF_CGROUP_INET_SOCK_CREATE:
		case BPF_CGROUP_INET4_POST_BIND:
		case BPF_CGROUP_INET6_POST_BIND:
			return 0;
		default:
			return -EINVAL;
		}
A
Andrey Ignatov 已提交
1233 1234 1235 1236
	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
		switch (expected_attach_type) {
		case BPF_CGROUP_INET4_BIND:
		case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1237 1238
		case BPF_CGROUP_INET4_CONNECT:
		case BPF_CGROUP_INET6_CONNECT:
A
Andrey Ignatov 已提交
1239 1240 1241 1242 1243 1244 1245
			return 0;
		default:
			return -EINVAL;
		}
	default:
		return 0;
	}
1246 1247
}

1248
/* last field in 'union bpf_attr' used by this command */
1249
#define	BPF_PROG_LOAD_LAST_FIELD expected_attach_type
1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261

static int bpf_prog_load(union bpf_attr *attr)
{
	enum bpf_prog_type type = attr->prog_type;
	struct bpf_prog *prog;
	int err;
	char license[128];
	bool is_gpl;

	if (CHECK_ATTR(BPF_PROG_LOAD))
		return -EINVAL;

1262 1263 1264
	if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
		return -EINVAL;

1265
	/* copy eBPF program license from user space */
M
Mickaël Salaün 已提交
1266
	if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
1267 1268 1269 1270 1271 1272 1273
			      sizeof(license) - 1) < 0)
		return -EFAULT;
	license[sizeof(license) - 1] = 0;

	/* eBPF programs must be GPL compatible to use GPL-ed functions */
	is_gpl = license_is_gpl_compatible(license);

1274 1275
	if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
		return -E2BIG;
1276

1277 1278 1279 1280
	if (type == BPF_PROG_TYPE_KPROBE &&
	    attr->kern_version != LINUX_VERSION_CODE)
		return -EINVAL;

1281 1282 1283
	if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
	    type != BPF_PROG_TYPE_CGROUP_SKB &&
	    !capable(CAP_SYS_ADMIN))
1284 1285
		return -EPERM;

A
Andrey Ignatov 已提交
1286
	bpf_prog_load_fixup_attach_type(attr);
1287 1288 1289
	if (bpf_prog_load_check_attach_type(type, attr->expected_attach_type))
		return -EINVAL;

1290 1291 1292 1293 1294
	/* plain bpf_prog allocation */
	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
	if (!prog)
		return -ENOMEM;

1295 1296
	prog->expected_attach_type = attr->expected_attach_type;

1297 1298
	prog->aux->offload_requested = !!attr->prog_ifindex;

1299
	err = security_bpf_prog_alloc(prog->aux);
1300 1301 1302
	if (err)
		goto free_prog_nouncharge;

1303 1304 1305 1306
	err = bpf_prog_charge_memlock(prog);
	if (err)
		goto free_prog_sec;

1307 1308 1309
	prog->len = attr->insn_cnt;

	err = -EFAULT;
M
Mickaël Salaün 已提交
1310
	if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
1311
			   bpf_prog_insn_size(prog)) != 0)
1312 1313 1314
		goto free_prog;

	prog->orig_prog = NULL;
1315
	prog->jited = 0;
1316 1317

	atomic_set(&prog->aux->refcnt, 1);
1318
	prog->gpl_compatible = is_gpl ? 1 : 0;
1319

1320
	if (bpf_prog_is_dev_bound(prog->aux)) {
1321 1322 1323 1324 1325
		err = bpf_prog_offload_init(prog, attr);
		if (err)
			goto free_prog;
	}

1326 1327 1328 1329 1330
	/* find program type: socket_filter vs tracing_filter */
	err = find_prog_type(type, prog);
	if (err < 0)
		goto free_prog;

1331 1332 1333 1334 1335
	prog->aux->load_time = ktime_get_boot_ns();
	err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
	if (err)
		goto free_prog;

1336
	/* run eBPF verifier */
1337
	err = bpf_check(&prog, attr);
1338 1339 1340 1341
	if (err < 0)
		goto free_used_maps;

	/* eBPF program is ready to be JITed */
1342 1343
	if (!prog->bpf_func)
		prog = bpf_prog_select_runtime(prog, &err);
1344 1345
	if (err < 0)
		goto free_used_maps;
1346

M
Martin KaFai Lau 已提交
1347 1348 1349 1350
	err = bpf_prog_alloc_id(prog);
	if (err)
		goto free_used_maps;

1351
	err = bpf_prog_new_fd(prog);
1352 1353 1354 1355 1356 1357 1358 1359 1360 1361
	if (err < 0) {
		/* failed to allocate fd.
		 * bpf_prog_put() is needed because the above
		 * bpf_prog_alloc_id() has published the prog
		 * to the userspace and the userspace may
		 * have refcnt-ed it through BPF_PROG_GET_FD_BY_ID.
		 */
		bpf_prog_put(prog);
		return err;
	}
1362

1363
	bpf_prog_kallsyms_add(prog);
1364 1365 1366 1367 1368
	return err;

free_used_maps:
	free_used_maps(prog->aux);
free_prog:
1369
	bpf_prog_uncharge_memlock(prog);
1370 1371
free_prog_sec:
	security_bpf_prog_free(prog->aux);
1372
free_prog_nouncharge:
1373 1374 1375 1376
	bpf_prog_free(prog);
	return err;
}

1377
#define BPF_OBJ_LAST_FIELD file_flags
1378 1379 1380

static int bpf_obj_pin(const union bpf_attr *attr)
{
1381
	if (CHECK_ATTR(BPF_OBJ) || attr->file_flags != 0)
1382 1383
		return -EINVAL;

M
Mickaël Salaün 已提交
1384
	return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
1385 1386 1387 1388
}

static int bpf_obj_get(const union bpf_attr *attr)
{
1389 1390
	if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
	    attr->file_flags & ~BPF_OBJ_FLAG_MASK)
1391 1392
		return -EINVAL;

1393 1394
	return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
				attr->file_flags);
1395 1396
}

1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471
struct bpf_raw_tracepoint {
	struct bpf_raw_event_map *btp;
	struct bpf_prog *prog;
};

static int bpf_raw_tracepoint_release(struct inode *inode, struct file *filp)
{
	struct bpf_raw_tracepoint *raw_tp = filp->private_data;

	if (raw_tp->prog) {
		bpf_probe_unregister(raw_tp->btp, raw_tp->prog);
		bpf_prog_put(raw_tp->prog);
	}
	kfree(raw_tp);
	return 0;
}

static const struct file_operations bpf_raw_tp_fops = {
	.release	= bpf_raw_tracepoint_release,
	.read		= bpf_dummy_read,
	.write		= bpf_dummy_write,
};

#define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd

static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
{
	struct bpf_raw_tracepoint *raw_tp;
	struct bpf_raw_event_map *btp;
	struct bpf_prog *prog;
	char tp_name[128];
	int tp_fd, err;

	if (strncpy_from_user(tp_name, u64_to_user_ptr(attr->raw_tracepoint.name),
			      sizeof(tp_name) - 1) < 0)
		return -EFAULT;
	tp_name[sizeof(tp_name) - 1] = 0;

	btp = bpf_find_raw_tracepoint(tp_name);
	if (!btp)
		return -ENOENT;

	raw_tp = kzalloc(sizeof(*raw_tp), GFP_USER);
	if (!raw_tp)
		return -ENOMEM;
	raw_tp->btp = btp;

	prog = bpf_prog_get_type(attr->raw_tracepoint.prog_fd,
				 BPF_PROG_TYPE_RAW_TRACEPOINT);
	if (IS_ERR(prog)) {
		err = PTR_ERR(prog);
		goto out_free_tp;
	}

	err = bpf_probe_register(raw_tp->btp, prog);
	if (err)
		goto out_put_prog;

	raw_tp->prog = prog;
	tp_fd = anon_inode_getfd("bpf-raw-tracepoint", &bpf_raw_tp_fops, raw_tp,
				 O_CLOEXEC);
	if (tp_fd < 0) {
		bpf_probe_unregister(raw_tp->btp, prog);
		err = tp_fd;
		goto out_put_prog;
	}
	return tp_fd;

out_put_prog:
	bpf_prog_put(prog);
out_free_tp:
	kfree(raw_tp);
	return err;
}

1472 1473
#ifdef CONFIG_CGROUP_BPF

1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485
static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
					     enum bpf_attach_type attach_type)
{
	switch (prog->type) {
	case BPF_PROG_TYPE_CGROUP_SOCK:
	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
		return attach_type == prog->expected_attach_type ? 0 : -EINVAL;
	default:
		return 0;
	}
}

1486
#define BPF_PROG_ATTACH_LAST_FIELD attach_flags
1487

1488 1489
static int sockmap_get_from_fd(const union bpf_attr *attr,
			       int type, bool attach)
1490
{
1491
	struct bpf_prog *prog = NULL;
1492 1493 1494 1495 1496 1497 1498 1499 1500 1501
	int ufd = attr->target_fd;
	struct bpf_map *map;
	struct fd f;
	int err;

	f = fdget(ufd);
	map = __bpf_map_get(f);
	if (IS_ERR(map))
		return PTR_ERR(map);

1502
	if (attach) {
1503
		prog = bpf_prog_get_type(attr->attach_bpf_fd, type);
1504 1505 1506 1507
		if (IS_ERR(prog)) {
			fdput(f);
			return PTR_ERR(prog);
		}
1508 1509
	}

1510
	err = sock_map_prog(map, prog, attr->attach_type);
1511 1512
	if (err) {
		fdput(f);
1513 1514
		if (prog)
			bpf_prog_put(prog);
1515
		return err;
1516 1517 1518
	}

	fdput(f);
1519
	return 0;
1520
}
1521

1522 1523 1524
#define BPF_F_ATTACH_MASK \
	(BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)

1525 1526
static int bpf_prog_attach(const union bpf_attr *attr)
{
1527
	enum bpf_prog_type ptype;
1528 1529
	struct bpf_prog *prog;
	struct cgroup *cgrp;
1530
	int ret;
1531 1532 1533 1534 1535 1536 1537

	if (!capable(CAP_NET_ADMIN))
		return -EPERM;

	if (CHECK_ATTR(BPF_PROG_ATTACH))
		return -EINVAL;

1538
	if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
1539 1540
		return -EINVAL;

1541 1542 1543
	switch (attr->attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
1544
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
1545
		break;
1546
	case BPF_CGROUP_INET_SOCK_CREATE:
A
Andrey Ignatov 已提交
1547 1548
	case BPF_CGROUP_INET4_POST_BIND:
	case BPF_CGROUP_INET6_POST_BIND:
1549 1550
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
A
Andrey Ignatov 已提交
1551 1552
	case BPF_CGROUP_INET4_BIND:
	case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1553 1554
	case BPF_CGROUP_INET4_CONNECT:
	case BPF_CGROUP_INET6_CONNECT:
A
Andrey Ignatov 已提交
1555 1556
		ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
		break;
L
Lawrence Brakmo 已提交
1557 1558 1559
	case BPF_CGROUP_SOCK_OPS:
		ptype = BPF_PROG_TYPE_SOCK_OPS;
		break;
1560 1561 1562
	case BPF_CGROUP_DEVICE:
		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
		break;
1563 1564
	case BPF_SK_MSG_VERDICT:
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, true);
1565 1566
	case BPF_SK_SKB_STREAM_PARSER:
	case BPF_SK_SKB_STREAM_VERDICT:
1567
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, true);
1568 1569 1570 1571
	default:
		return -EINVAL;
	}

1572 1573 1574 1575
	prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
	if (IS_ERR(prog))
		return PTR_ERR(prog);

1576 1577 1578 1579 1580
	if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
		bpf_prog_put(prog);
		return -EINVAL;
	}

1581 1582 1583 1584 1585 1586
	cgrp = cgroup_get_from_fd(attr->target_fd);
	if (IS_ERR(cgrp)) {
		bpf_prog_put(prog);
		return PTR_ERR(cgrp);
	}

1587 1588
	ret = cgroup_bpf_attach(cgrp, prog, attr->attach_type,
				attr->attach_flags);
1589 1590
	if (ret)
		bpf_prog_put(prog);
1591 1592
	cgroup_put(cgrp);

1593
	return ret;
1594 1595 1596 1597 1598 1599
}

#define BPF_PROG_DETACH_LAST_FIELD attach_type

static int bpf_prog_detach(const union bpf_attr *attr)
{
1600 1601
	enum bpf_prog_type ptype;
	struct bpf_prog *prog;
1602
	struct cgroup *cgrp;
1603
	int ret;
1604 1605 1606 1607 1608 1609 1610 1611 1612 1613

	if (!capable(CAP_NET_ADMIN))
		return -EPERM;

	if (CHECK_ATTR(BPF_PROG_DETACH))
		return -EINVAL;

	switch (attr->attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
1614 1615
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
		break;
1616
	case BPF_CGROUP_INET_SOCK_CREATE:
A
Andrey Ignatov 已提交
1617 1618
	case BPF_CGROUP_INET4_POST_BIND:
	case BPF_CGROUP_INET6_POST_BIND:
1619 1620
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
A
Andrey Ignatov 已提交
1621 1622
	case BPF_CGROUP_INET4_BIND:
	case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1623 1624
	case BPF_CGROUP_INET4_CONNECT:
	case BPF_CGROUP_INET6_CONNECT:
A
Andrey Ignatov 已提交
1625 1626
		ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
		break;
L
Lawrence Brakmo 已提交
1627
	case BPF_CGROUP_SOCK_OPS:
1628
		ptype = BPF_PROG_TYPE_SOCK_OPS;
1629
		break;
1630 1631 1632
	case BPF_CGROUP_DEVICE:
		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
		break;
1633 1634
	case BPF_SK_MSG_VERDICT:
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, false);
1635 1636
	case BPF_SK_SKB_STREAM_PARSER:
	case BPF_SK_SKB_STREAM_VERDICT:
1637
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, false);
1638 1639 1640 1641
	default:
		return -EINVAL;
	}

1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653
	cgrp = cgroup_get_from_fd(attr->target_fd);
	if (IS_ERR(cgrp))
		return PTR_ERR(cgrp);

	prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
	if (IS_ERR(prog))
		prog = NULL;

	ret = cgroup_bpf_detach(cgrp, prog, attr->attach_type, 0);
	if (prog)
		bpf_prog_put(prog);
	cgroup_put(cgrp);
1654
	return ret;
1655
}
L
Lawrence Brakmo 已提交
1656

1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675
#define BPF_PROG_QUERY_LAST_FIELD query.prog_cnt

static int bpf_prog_query(const union bpf_attr *attr,
			  union bpf_attr __user *uattr)
{
	struct cgroup *cgrp;
	int ret;

	if (!capable(CAP_NET_ADMIN))
		return -EPERM;
	if (CHECK_ATTR(BPF_PROG_QUERY))
		return -EINVAL;
	if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
		return -EINVAL;

	switch (attr->query.attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
	case BPF_CGROUP_INET_SOCK_CREATE:
A
Andrey Ignatov 已提交
1676 1677
	case BPF_CGROUP_INET4_BIND:
	case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1678 1679
	case BPF_CGROUP_INET4_POST_BIND:
	case BPF_CGROUP_INET6_POST_BIND:
A
Andrey Ignatov 已提交
1680 1681
	case BPF_CGROUP_INET4_CONNECT:
	case BPF_CGROUP_INET6_CONNECT:
1682
	case BPF_CGROUP_SOCK_OPS:
1683
	case BPF_CGROUP_DEVICE:
1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694
		break;
	default:
		return -EINVAL;
	}
	cgrp = cgroup_get_from_fd(attr->query.target_fd);
	if (IS_ERR(cgrp))
		return PTR_ERR(cgrp);
	ret = cgroup_bpf_query(cgrp, attr, uattr);
	cgroup_put(cgrp);
	return ret;
}
1695 1696
#endif /* CONFIG_CGROUP_BPF */

1697 1698 1699 1700 1701 1702 1703 1704
#define BPF_PROG_TEST_RUN_LAST_FIELD test.duration

static int bpf_prog_test_run(const union bpf_attr *attr,
			     union bpf_attr __user *uattr)
{
	struct bpf_prog *prog;
	int ret = -ENOTSUPP;

1705 1706
	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;
1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720
	if (CHECK_ATTR(BPF_PROG_TEST_RUN))
		return -EINVAL;

	prog = bpf_prog_get(attr->test.prog_fd);
	if (IS_ERR(prog))
		return PTR_ERR(prog);

	if (prog->aux->ops->test_run)
		ret = prog->aux->ops->test_run(prog, attr, uattr);

	bpf_prog_put(prog);
	return ret;
}

1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748
#define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id

static int bpf_obj_get_next_id(const union bpf_attr *attr,
			       union bpf_attr __user *uattr,
			       struct idr *idr,
			       spinlock_t *lock)
{
	u32 next_id = attr->start_id;
	int err = 0;

	if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
		return -EINVAL;

	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;

	next_id++;
	spin_lock_bh(lock);
	if (!idr_get_next(idr, &next_id))
		err = -ENOENT;
	spin_unlock_bh(lock);

	if (!err)
		err = put_user(next_id, &uattr->next_id);

	return err;
}

1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780
#define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id

static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
{
	struct bpf_prog *prog;
	u32 id = attr->prog_id;
	int fd;

	if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
		return -EINVAL;

	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;

	spin_lock_bh(&prog_idr_lock);
	prog = idr_find(&prog_idr, id);
	if (prog)
		prog = bpf_prog_inc_not_zero(prog);
	else
		prog = ERR_PTR(-ENOENT);
	spin_unlock_bh(&prog_idr_lock);

	if (IS_ERR(prog))
		return PTR_ERR(prog);

	fd = bpf_prog_new_fd(prog);
	if (fd < 0)
		bpf_prog_put(prog);

	return fd;
}

1781
#define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
M
Martin KaFai Lau 已提交
1782 1783 1784 1785 1786

static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
{
	struct bpf_map *map;
	u32 id = attr->map_id;
1787
	int f_flags;
M
Martin KaFai Lau 已提交
1788 1789
	int fd;

1790 1791
	if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
	    attr->open_flags & ~BPF_OBJ_FLAG_MASK)
M
Martin KaFai Lau 已提交
1792 1793 1794 1795 1796
		return -EINVAL;

	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;

1797 1798 1799 1800
	f_flags = bpf_get_file_flag(attr->open_flags);
	if (f_flags < 0)
		return f_flags;

M
Martin KaFai Lau 已提交
1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811
	spin_lock_bh(&map_idr_lock);
	map = idr_find(&map_idr, id);
	if (map)
		map = bpf_map_inc_not_zero(map, true);
	else
		map = ERR_PTR(-ENOENT);
	spin_unlock_bh(&map_idr_lock);

	if (IS_ERR(map))
		return PTR_ERR(map);

1812
	fd = bpf_map_new_fd(map, f_flags);
M
Martin KaFai Lau 已提交
1813 1814 1815 1816 1817 1818
	if (fd < 0)
		bpf_map_put(map);

	return fd;
}

1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879
static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
					      unsigned long addr)
{
	int i;

	for (i = 0; i < prog->aux->used_map_cnt; i++)
		if (prog->aux->used_maps[i] == (void *)addr)
			return prog->aux->used_maps[i];
	return NULL;
}

static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog)
{
	const struct bpf_map *map;
	struct bpf_insn *insns;
	u64 imm;
	int i;

	insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
			GFP_USER);
	if (!insns)
		return insns;

	for (i = 0; i < prog->len; i++) {
		if (insns[i].code == (BPF_JMP | BPF_TAIL_CALL)) {
			insns[i].code = BPF_JMP | BPF_CALL;
			insns[i].imm = BPF_FUNC_tail_call;
			/* fall-through */
		}
		if (insns[i].code == (BPF_JMP | BPF_CALL) ||
		    insns[i].code == (BPF_JMP | BPF_CALL_ARGS)) {
			if (insns[i].code == (BPF_JMP | BPF_CALL_ARGS))
				insns[i].code = BPF_JMP | BPF_CALL;
			if (!bpf_dump_raw_ok())
				insns[i].imm = 0;
			continue;
		}

		if (insns[i].code != (BPF_LD | BPF_IMM | BPF_DW))
			continue;

		imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
		map = bpf_map_from_imm(prog, imm);
		if (map) {
			insns[i].src_reg = BPF_PSEUDO_MAP_FD;
			insns[i].imm = map->id;
			insns[i + 1].imm = 0;
			continue;
		}

		if (!bpf_dump_raw_ok() &&
		    imm == (unsigned long)prog->aux) {
			insns[i].imm = 0;
			insns[i + 1].imm = 0;
			continue;
		}
	}

	return insns;
}

1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896
static int bpf_prog_get_info_by_fd(struct bpf_prog *prog,
				   const union bpf_attr *attr,
				   union bpf_attr __user *uattr)
{
	struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
	struct bpf_prog_info info = {};
	u32 info_len = attr->info.info_len;
	char __user *uinsns;
	u32 ulen;
	int err;

	err = check_uarg_tail_zero(uinfo, sizeof(info), info_len);
	if (err)
		return err;
	info_len = min_t(u32, sizeof(info), info_len);

	if (copy_from_user(&info, uinfo, info_len))
1897
		return -EFAULT;
1898 1899 1900

	info.type = prog->type;
	info.id = prog->aux->id;
1901 1902 1903
	info.load_time = prog->aux->load_time;
	info.created_by_uid = from_kuid_munged(current_user_ns(),
					       prog->aux->user->uid);
1904
	info.gpl_compatible = prog->gpl_compatible;
1905 1906

	memcpy(info.tag, prog->tag, sizeof(prog->tag));
1907 1908 1909 1910 1911 1912
	memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));

	ulen = info.nr_map_ids;
	info.nr_map_ids = prog->aux->used_map_cnt;
	ulen = min_t(u32, info.nr_map_ids, ulen);
	if (ulen) {
1913
		u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
1914 1915 1916 1917 1918 1919 1920
		u32 i;

		for (i = 0; i < ulen; i++)
			if (put_user(prog->aux->used_maps[i]->id,
				     &user_map_ids[i]))
				return -EFAULT;
	}
1921 1922 1923 1924 1925 1926 1927 1928

	if (!capable(CAP_SYS_ADMIN)) {
		info.jited_prog_len = 0;
		info.xlated_prog_len = 0;
		goto done;
	}

	ulen = info.xlated_prog_len;
1929
	info.xlated_prog_len = bpf_prog_insn_size(prog);
1930
	if (info.xlated_prog_len && ulen) {
1931 1932 1933 1934 1935 1936 1937 1938 1939 1940
		struct bpf_insn *insns_sanitized;
		bool fault;

		if (prog->blinded && !bpf_dump_raw_ok()) {
			info.xlated_prog_insns = 0;
			goto done;
		}
		insns_sanitized = bpf_insn_prepare_dump(prog);
		if (!insns_sanitized)
			return -ENOMEM;
1941 1942
		uinsns = u64_to_user_ptr(info.xlated_prog_insns);
		ulen = min_t(u32, info.xlated_prog_len, ulen);
1943 1944 1945
		fault = copy_to_user(uinsns, insns_sanitized, ulen);
		kfree(insns_sanitized);
		if (fault)
1946 1947 1948
			return -EFAULT;
	}

1949 1950 1951 1952
	if (bpf_prog_is_dev_bound(prog->aux)) {
		err = bpf_prog_offload_info_fill(&info, prog);
		if (err)
			return err;
1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970
		goto done;
	}

	/* NOTE: the following code is supposed to be skipped for offload.
	 * bpf_prog_offload_info_fill() is the place to fill similar fields
	 * for offload.
	 */
	ulen = info.jited_prog_len;
	info.jited_prog_len = prog->jited_len;
	if (info.jited_prog_len && ulen) {
		if (bpf_dump_raw_ok()) {
			uinsns = u64_to_user_ptr(info.jited_prog_insns);
			ulen = min_t(u32, info.jited_prog_len, ulen);
			if (copy_to_user(uinsns, prog->bpf_func, ulen))
				return -EFAULT;
		} else {
			info.jited_prog_insns = 0;
		}
1971 1972
	}

1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000
done:
	if (copy_to_user(uinfo, &info, info_len) ||
	    put_user(info_len, &uattr->info.info_len))
		return -EFAULT;

	return 0;
}

static int bpf_map_get_info_by_fd(struct bpf_map *map,
				  const union bpf_attr *attr,
				  union bpf_attr __user *uattr)
{
	struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
	struct bpf_map_info info = {};
	u32 info_len = attr->info.info_len;
	int err;

	err = check_uarg_tail_zero(uinfo, sizeof(info), info_len);
	if (err)
		return err;
	info_len = min_t(u32, sizeof(info), info_len);

	info.type = map->map_type;
	info.id = map->id;
	info.key_size = map->key_size;
	info.value_size = map->value_size;
	info.max_entries = map->max_entries;
	info.map_flags = map->map_flags;
2001
	memcpy(info.name, map->name, sizeof(map->name));
2002

2003 2004 2005 2006 2007 2008
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_info_fill(&info, map);
		if (err)
			return err;
	}

2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037
	if (copy_to_user(uinfo, &info, info_len) ||
	    put_user(info_len, &uattr->info.info_len))
		return -EFAULT;

	return 0;
}

#define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info

static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
				  union bpf_attr __user *uattr)
{
	int ufd = attr->info.bpf_fd;
	struct fd f;
	int err;

	if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
		return -EINVAL;

	f = fdget(ufd);
	if (!f.file)
		return -EBADFD;

	if (f.file->f_op == &bpf_prog_fops)
		err = bpf_prog_get_info_by_fd(f.file->private_data, attr,
					      uattr);
	else if (f.file->f_op == &bpf_map_fops)
		err = bpf_map_get_info_by_fd(f.file->private_data, attr,
					     uattr);
2038 2039
	else if (f.file->f_op == &btf_fops)
		err = btf_get_info_by_fd(f.file->private_data, attr, uattr);
2040 2041 2042 2043 2044 2045 2046
	else
		err = -EINVAL;

	fdput(f);
	return err;
}

2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059
#define BPF_BTF_LOAD_LAST_FIELD btf_log_level

static int bpf_btf_load(const union bpf_attr *attr)
{
	if (CHECK_ATTR(BPF_BTF_LOAD))
		return -EINVAL;

	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;

	return btf_new_fd(attr);
}

2060 2061 2062 2063 2064
SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
{
	union bpf_attr attr = {};
	int err;

2065
	if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
2066 2067
		return -EPERM;

2068 2069 2070 2071
	err = check_uarg_tail_zero(uattr, sizeof(attr), size);
	if (err)
		return err;
	size = min_t(u32, size, sizeof(attr));
2072 2073 2074 2075 2076

	/* copy attributes from user space, may be less than sizeof(bpf_attr) */
	if (copy_from_user(&attr, uattr, size) != 0)
		return -EFAULT;

2077 2078 2079 2080
	err = security_bpf(cmd, &attr, size);
	if (err < 0)
		return err;

2081 2082 2083 2084
	switch (cmd) {
	case BPF_MAP_CREATE:
		err = map_create(&attr);
		break;
2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096
	case BPF_MAP_LOOKUP_ELEM:
		err = map_lookup_elem(&attr);
		break;
	case BPF_MAP_UPDATE_ELEM:
		err = map_update_elem(&attr);
		break;
	case BPF_MAP_DELETE_ELEM:
		err = map_delete_elem(&attr);
		break;
	case BPF_MAP_GET_NEXT_KEY:
		err = map_get_next_key(&attr);
		break;
2097 2098 2099
	case BPF_PROG_LOAD:
		err = bpf_prog_load(&attr);
		break;
2100 2101 2102 2103 2104 2105
	case BPF_OBJ_PIN:
		err = bpf_obj_pin(&attr);
		break;
	case BPF_OBJ_GET:
		err = bpf_obj_get(&attr);
		break;
2106 2107 2108 2109 2110 2111 2112
#ifdef CONFIG_CGROUP_BPF
	case BPF_PROG_ATTACH:
		err = bpf_prog_attach(&attr);
		break;
	case BPF_PROG_DETACH:
		err = bpf_prog_detach(&attr);
		break;
2113 2114 2115
	case BPF_PROG_QUERY:
		err = bpf_prog_query(&attr, uattr);
		break;
2116
#endif
2117 2118 2119
	case BPF_PROG_TEST_RUN:
		err = bpf_prog_test_run(&attr, uattr);
		break;
2120 2121 2122 2123 2124 2125 2126 2127
	case BPF_PROG_GET_NEXT_ID:
		err = bpf_obj_get_next_id(&attr, uattr,
					  &prog_idr, &prog_idr_lock);
		break;
	case BPF_MAP_GET_NEXT_ID:
		err = bpf_obj_get_next_id(&attr, uattr,
					  &map_idr, &map_idr_lock);
		break;
2128 2129 2130
	case BPF_PROG_GET_FD_BY_ID:
		err = bpf_prog_get_fd_by_id(&attr);
		break;
M
Martin KaFai Lau 已提交
2131 2132 2133
	case BPF_MAP_GET_FD_BY_ID:
		err = bpf_map_get_fd_by_id(&attr);
		break;
2134 2135 2136
	case BPF_OBJ_GET_INFO_BY_FD:
		err = bpf_obj_get_info_by_fd(&attr, uattr);
		break;
2137 2138 2139
	case BPF_RAW_TRACEPOINT_OPEN:
		err = bpf_raw_tracepoint_open(&attr);
		break;
2140 2141 2142
	case BPF_BTF_LOAD:
		err = bpf_btf_load(&attr);
		break;
2143 2144 2145 2146 2147 2148 2149
	default:
		err = -EINVAL;
		break;
	}

	return err;
}