syscall.c 50.1 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
#include <linux/nospec.h>
32

33 34 35 36 37 38 39
#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))

40 41
#define BPF_OBJ_FLAG_MASK   (BPF_F_RDONLY | BPF_F_WRONLY)

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

48 49
int sysctl_unprivileged_bpf_disabled __read_mostly;

50 51 52 53 54 55 56 57
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
};
58

59 60 61 62 63 64 65 66 67
/*
 * 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.
 */
68 69 70
int bpf_check_uarg_tail_zero(void __user *uaddr,
			     size_t expected_size,
			     size_t actual_size)
71 72 73 74 75 76
{
	unsigned char __user *addr;
	unsigned char __user *end;
	unsigned char val;
	int err;

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

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

83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99
	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;
}

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

105 106
static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
{
107
	const struct bpf_map_ops *ops;
108
	u32 type = attr->map_type;
109
	struct bpf_map *map;
110
	int err;
111

112
	if (type >= ARRAY_SIZE(bpf_map_types))
113
		return ERR_PTR(-EINVAL);
114 115
	type = array_index_nospec(type, ARRAY_SIZE(bpf_map_types));
	ops = bpf_map_types[type];
116
	if (!ops)
117
		return ERR_PTR(-EINVAL);
118

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

134
void *bpf_map_area_alloc(size_t size, int numa_node)
135 136 137 138 139 140 141 142 143
{
	/* 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)) {
144
		area = kmalloc_node(size, GFP_USER | flags, numa_node);
145 146 147 148
		if (area != NULL)
			return area;
	}

149 150
	return __vmalloc_node_flags_caller(size, numa_node, GFP_KERNEL | flags,
					   __builtin_return_address(0));
151 152 153 154 155 156 157
}

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

158 159 160 161 162 163 164 165 166 167
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);
}

168 169 170 171 172 173 174 175 176 177 178 179 180
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;
}

181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206
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 已提交
207 208 209 210
static int bpf_map_alloc_id(struct bpf_map *map)
{
	int id;

S
Shaohua Li 已提交
211
	idr_preload(GFP_KERNEL);
M
Martin KaFai Lau 已提交
212 213 214 215 216
	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 已提交
217
	idr_preload_end();
M
Martin KaFai Lau 已提交
218 219 220 221 222 223 224

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

	return id > 0 ? 0 : id;
}

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

229 230 231 232 233 234 235 236
	/* 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 已提交
237
	if (do_idr_lock)
238
		spin_lock_irqsave(&map_idr_lock, flags);
M
Martin KaFai Lau 已提交
239 240 241
	else
		__acquire(&map_idr_lock);

M
Martin KaFai Lau 已提交
242
	idr_remove(&map_idr, map->id);
243
	map->id = 0;
M
Martin KaFai Lau 已提交
244 245

	if (do_idr_lock)
246
		spin_unlock_irqrestore(&map_idr_lock, flags);
M
Martin KaFai Lau 已提交
247 248
	else
		__release(&map_idr_lock);
M
Martin KaFai Lau 已提交
249 250
}

251 252 253 254 255
/* called from workqueue */
static void bpf_map_free_deferred(struct work_struct *work)
{
	struct bpf_map *map = container_of(work, struct bpf_map, work);

256
	bpf_map_uncharge_memlock(map);
257
	security_bpf_map_free(map);
258 259 260 261
	/* implementation dependent freeing */
	map->ops->map_free(map);
}

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

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

M
Martin KaFai Lau 已提交
284 285 286 287
void bpf_map_put(struct bpf_map *map)
{
	__bpf_map_put(map, true);
}
288
EXPORT_SYMBOL_GPL(bpf_map_put);
M
Martin KaFai Lau 已提交
289

290
void bpf_map_put_with_uref(struct bpf_map *map)
291
{
292
	bpf_map_put_uref(map);
293
	bpf_map_put(map);
294 295 296 297
}

static int bpf_map_release(struct inode *inode, struct file *filp)
{
298 299 300 301 302 303
	struct bpf_map *map = filp->private_data;

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

	bpf_map_put_with_uref(map);
304 305 306
	return 0;
}

307 308 309 310
#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;
311 312
	const struct bpf_array *array;
	u32 owner_prog_type = 0;
313
	u32 owner_jited = 0;
314 315 316 317

	if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
		array = container_of(map, struct bpf_array, map);
		owner_prog_type = array->owner_prog_type;
318
		owner_jited = array->owner_jited;
319
	}
320 321 322 323 324

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

335
	if (owner_prog_type) {
336 337
		seq_printf(m, "owner_prog_type:\t%u\n",
			   owner_prog_type);
338 339 340
		seq_printf(m, "owner_jited:\t%u\n",
			   owner_jited);
	}
341 342 343
}
#endif

344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361
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;
}

362
const struct file_operations bpf_map_fops = {
363 364 365 366
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_map_show_fdinfo,
#endif
	.release	= bpf_map_release,
367 368
	.read		= bpf_dummy_read,
	.write		= bpf_dummy_write,
369 370
};

371
int bpf_map_new_fd(struct bpf_map *map, int flags)
372
{
373 374 375 376 377 378
	int ret;

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

379
	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
380 381 382 383 384 385 386 387 388 389 390 391
				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;
392 393
}

394 395 396 397 398 399 400 401
/* 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

402 403 404 405 406 407 408
/* 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;

409 410
	memset(dst, 0, BPF_OBJ_NAME_LEN);

411 412 413 414 415 416 417 418 419 420 421 422 423 424
	/* 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;
}

425
#define BPF_MAP_CREATE_LAST_FIELD btf_value_type_id
426 427 428
/* called via syscall */
static int map_create(union bpf_attr *attr)
{
429
	int numa_node = bpf_map_attr_numa_node(attr);
430
	struct bpf_map *map;
431
	int f_flags;
432 433 434 435 436 437
	int err;

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

438 439 440 441
	f_flags = bpf_get_file_flag(attr->map_flags);
	if (f_flags < 0)
		return f_flags;

442
	if (numa_node != NUMA_NO_NODE &&
E
Eric Dumazet 已提交
443 444
	    ((unsigned int)numa_node >= nr_node_ids ||
	     !node_online(numa_node)))
445 446
		return -EINVAL;

447 448 449 450 451
	/* 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);

452 453 454 455
	err = bpf_obj_name_cpy(map->name, attr->map_name);
	if (err)
		goto free_map_nouncharge;

456
	atomic_set(&map->refcnt, 1);
457
	atomic_set(&map->usercnt, 1);
458

459
	if (bpf_map_support_seq_show(map) &&
460
	    (attr->btf_key_type_id || attr->btf_value_type_id)) {
461 462
		struct btf *btf;

463
		if (!attr->btf_key_type_id || !attr->btf_value_type_id) {
464 465 466 467 468 469 470 471 472 473
			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;
		}

474 475
		err = map->ops->map_check_btf(map, btf, attr->btf_key_type_id,
					      attr->btf_value_type_id);
476 477 478 479 480 481
		if (err) {
			btf_put(btf);
			goto free_map_nouncharge;
		}

		map->btf = btf;
482 483
		map->btf_key_type_id = attr->btf_key_type_id;
		map->btf_value_type_id = attr->btf_value_type_id;
484 485
	}

486
	err = security_bpf_map_alloc(map);
487
	if (err)
488
		goto free_map_nouncharge;
489

490 491 492 493
	err = bpf_map_charge_memlock(map);
	if (err)
		goto free_map_sec;

M
Martin KaFai Lau 已提交
494 495 496 497
	err = bpf_map_alloc_id(map);
	if (err)
		goto free_map;

498
	err = bpf_map_new_fd(map, f_flags);
M
Martin KaFai Lau 已提交
499 500 501 502 503 504 505 506 507 508
	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;
	}
509 510 511 512

	return err;

free_map:
513
	bpf_map_uncharge_memlock(map);
514 515
free_map_sec:
	security_bpf_map_free(map);
516
free_map_nouncharge:
517
	btf_put(map->btf);
518 519 520 521
	map->ops->map_free(map);
	return err;
}

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

534 535 536
	return f.file->private_data;
}

A
Alexei Starovoitov 已提交
537 538 539 540
/* prog's and map's refcnt limit */
#define BPF_MAX_REFCNT 32768

struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
541
{
A
Alexei Starovoitov 已提交
542 543 544 545
	if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
		atomic_dec(&map->refcnt);
		return ERR_PTR(-EBUSY);
	}
546 547
	if (uref)
		atomic_inc(&map->usercnt);
A
Alexei Starovoitov 已提交
548
	return map;
549
}
550
EXPORT_SYMBOL_GPL(bpf_map_inc);
551 552

struct bpf_map *bpf_map_get_with_uref(u32 ufd)
553 554 555 556 557 558 559 560
{
	struct fd f = fdget(ufd);
	struct bpf_map *map;

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

A
Alexei Starovoitov 已提交
561
	map = bpf_map_inc(map, true);
562
	fdput(f);
563 564 565 566

	return map;
}

M
Martin KaFai Lau 已提交
567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588
/* 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;
}

589 590 591 592 593
int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
{
	return -ENOTSUPP;
}

594 595 596 597 598
/* 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 已提交
599 600
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
601 602
	int ufd = attr->map_fd;
	struct bpf_map *map;
603
	void *key, *value, *ptr;
604
	u32 value_size;
605
	struct fd f;
606 607 608 609 610
	int err;

	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
		return -EINVAL;

611
	f = fdget(ufd);
612
	map = __bpf_map_get(f);
613 614 615
	if (IS_ERR(map))
		return PTR_ERR(map);

616 617 618 619 620
	if (!(f.file->f_mode & FMODE_CAN_READ)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
621 622 623
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
624
		goto err_put;
A
Al Viro 已提交
625
	}
626

627
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
628
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
629 630
	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
		value_size = round_up(map->value_size, 8) * num_possible_cpus();
631 632
	else if (IS_FD_MAP(map))
		value_size = sizeof(u32);
633 634 635
	else
		value_size = map->value_size;

636
	err = -ENOMEM;
637
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
638
	if (!value)
639 640
		goto free_key;

641 642 643 644
	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) {
645 646 647
		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);
648 649
	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
		err = bpf_stackmap_copy(map, key, value);
650 651 652 653
	} 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);
654 655 656 657 658 659 660 661
	} 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;
	}
662

663
	if (err)
664
		goto free_value;
665 666

	err = -EFAULT;
667
	if (copy_to_user(uvalue, value, value_size) != 0)
668
		goto free_value;
669 670 671

	err = 0;

672 673
free_value:
	kfree(value);
674 675 676 677 678 679 680
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

681
#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
682 683 684

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

	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
		return -EINVAL;

697
	f = fdget(ufd);
698
	map = __bpf_map_get(f);
699 700 701
	if (IS_ERR(map))
		return PTR_ERR(map);

702 703 704 705 706
	if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
707 708 709
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
710
		goto err_put;
A
Al Viro 已提交
711
	}
712

713
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
714
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
715 716 717 718 719
	    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;

720
	err = -ENOMEM;
721
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
722 723 724 725
	if (!value)
		goto free_key;

	err = -EFAULT;
726
	if (copy_from_user(value, uvalue, value_size) != 0)
727 728
		goto free_value;

729
	/* Need to create a kthread, thus must support schedule */
730 731 732 733
	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) {
734 735 736 737
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		goto out;
	}

738 739 740 741 742
	/* 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);
743 744
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
745 746 747
		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);
748
	} else if (IS_FD_ARRAY(map)) {
749 750 751 752
		rcu_read_lock();
		err = bpf_fd_array_map_update_elem(map, f.file, key, value,
						   attr->flags);
		rcu_read_unlock();
M
Martin KaFai Lau 已提交
753 754 755 756 757
	} 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();
758 759 760 761 762
	} else {
		rcu_read_lock();
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		rcu_read_unlock();
	}
763 764
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
765
out:
766 767 768 769 770 771 772 773 774 775 776 777 778
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 已提交
779
	void __user *ukey = u64_to_user_ptr(attr->key);
780 781
	int ufd = attr->map_fd;
	struct bpf_map *map;
782
	struct fd f;
783 784 785 786 787 788
	void *key;
	int err;

	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
		return -EINVAL;

789
	f = fdget(ufd);
790
	map = __bpf_map_get(f);
791 792 793
	if (IS_ERR(map))
		return PTR_ERR(map);

794 795 796 797 798
	if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
799 800 801
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
802
		goto err_put;
A
Al Viro 已提交
803
	}
804

805 806 807 808 809
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_delete_elem(map, key);
		goto out;
	}

810 811
	preempt_disable();
	__this_cpu_inc(bpf_prog_active);
812 813 814
	rcu_read_lock();
	err = map->ops->map_delete_elem(map, key);
	rcu_read_unlock();
815 816
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
817
out:
818 819 820 821 822 823 824 825 826 827 828
	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 已提交
829 830
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *unext_key = u64_to_user_ptr(attr->next_key);
831 832 833
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *next_key;
834
	struct fd f;
835 836 837 838 839
	int err;

	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
		return -EINVAL;

840
	f = fdget(ufd);
841
	map = __bpf_map_get(f);
842 843 844
	if (IS_ERR(map))
		return PTR_ERR(map);

845 846 847 848 849
	if (!(f.file->f_mode & FMODE_CAN_READ)) {
		err = -EPERM;
		goto err_put;
	}

850
	if (ukey) {
A
Al Viro 已提交
851 852 853
		key = memdup_user(ukey, map->key_size);
		if (IS_ERR(key)) {
			err = PTR_ERR(key);
854
			goto err_put;
A
Al Viro 已提交
855
		}
856 857 858
	} else {
		key = NULL;
	}
859 860 861 862 863 864

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

865 866 867 868 869
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_get_next_key(map, key, next_key);
		goto out;
	}

870 871 872
	rcu_read_lock();
	err = map->ops->map_get_next_key(map, key, next_key);
	rcu_read_unlock();
873
out:
874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891
	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;
}

892 893 894 895 896 897 898 899 900
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
};

901 902
static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
{
903 904 905 906 907 908 909
	const struct bpf_prog_ops *ops;

	if (type >= ARRAY_SIZE(bpf_prog_types))
		return -EINVAL;
	type = array_index_nospec(type, ARRAY_SIZE(bpf_prog_types));
	ops = bpf_prog_types[type];
	if (!ops)
910
		return -EINVAL;
911

912
	if (!bpf_prog_is_dev_bound(prog->aux))
913
		prog->aux->ops = ops;
914 915
	else
		prog->aux->ops = &bpf_offload_prog_ops;
916 917
	prog->type = type;
	return 0;
918 919 920 921 922 923 924 925 926 927 928 929 930
}

/* 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);
}

931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952
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);
}

953 954 955
static int bpf_prog_charge_memlock(struct bpf_prog *prog)
{
	struct user_struct *user = get_current_user();
956
	int ret;
957

958 959
	ret = __bpf_prog_charge(user, prog->pages);
	if (ret) {
960
		free_uid(user);
961
		return ret;
962
	}
963

964 965 966 967 968 969 970 971
	prog->aux->user = user;
	return 0;
}

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

972
	__bpf_prog_uncharge(user, prog->pages);
973 974 975
	free_uid(user);
}

M
Martin KaFai Lau 已提交
976 977 978 979
static int bpf_prog_alloc_id(struct bpf_prog *prog)
{
	int id;

S
Shaohua Li 已提交
980
	idr_preload(GFP_KERNEL);
M
Martin KaFai Lau 已提交
981 982 983 984 985
	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 已提交
986
	idr_preload_end();
M
Martin KaFai Lau 已提交
987 988 989 990 991 992 993 994

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

	return id > 0 ? 0 : id;
}

995
void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
M
Martin KaFai Lau 已提交
996
{
997 998 999 1000 1001
	/* 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 已提交
1002 1003 1004
	if (!prog->aux->id)
		return;

1005 1006 1007 1008 1009
	if (do_idr_lock)
		spin_lock_bh(&prog_idr_lock);
	else
		__acquire(&prog_idr_lock);

M
Martin KaFai Lau 已提交
1010
	idr_remove(&prog_idr, prog->aux->id);
1011
	prog->aux->id = 0;
1012 1013 1014 1015 1016

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

1019
static void __bpf_prog_put_rcu(struct rcu_head *rcu)
1020 1021 1022 1023
{
	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);

	free_used_maps(aux);
1024
	bpf_prog_uncharge_memlock(aux->prog);
1025
	security_bpf_prog_free(aux);
1026 1027 1028
	bpf_prog_free(aux->prog);
}

1029
static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
1030
{
1031
	if (atomic_dec_and_test(&prog->aux->refcnt)) {
1032 1033
		int i;

1034
		/* bpf_prog_free_id() must be called first */
1035
		bpf_prog_free_id(prog, do_idr_lock);
1036 1037 1038

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

1041
		call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
1042
	}
1043
}
1044 1045 1046 1047 1048

void bpf_prog_put(struct bpf_prog *prog)
{
	__bpf_prog_put(prog, true);
}
1049
EXPORT_SYMBOL_GPL(bpf_prog_put);
1050 1051 1052 1053 1054

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

1055
	bpf_prog_put(prog);
1056 1057 1058
	return 0;
}

1059 1060 1061 1062
#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;
1063
	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
1064

1065
	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
1066 1067 1068
	seq_printf(m,
		   "prog_type:\t%u\n"
		   "prog_jited:\t%u\n"
1069
		   "prog_tag:\t%s\n"
1070 1071 1072
		   "memlock:\t%llu\n",
		   prog->type,
		   prog->jited,
1073
		   prog_tag,
1074 1075 1076 1077
		   prog->pages * 1ULL << PAGE_SHIFT);
}
#endif

1078
const struct file_operations bpf_prog_fops = {
1079 1080 1081 1082
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_prog_show_fdinfo,
#endif
	.release	= bpf_prog_release,
1083 1084
	.read		= bpf_dummy_read,
	.write		= bpf_dummy_write,
1085 1086
};

1087
int bpf_prog_new_fd(struct bpf_prog *prog)
1088
{
1089 1090 1091 1092 1093 1094
	int ret;

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

1095 1096 1097 1098
	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
				O_RDWR | O_CLOEXEC);
}

1099
static struct bpf_prog *____bpf_prog_get(struct fd f)
1100 1101 1102 1103 1104 1105 1106 1107
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_prog_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

1108
	return f.file->private_data;
1109 1110
}

1111
struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
A
Alexei Starovoitov 已提交
1112
{
1113 1114
	if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
		atomic_sub(i, &prog->aux->refcnt);
A
Alexei Starovoitov 已提交
1115 1116 1117 1118
		return ERR_PTR(-EBUSY);
	}
	return prog;
}
1119 1120
EXPORT_SYMBOL_GPL(bpf_prog_add);

1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131
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);

1132 1133 1134 1135
struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
{
	return bpf_prog_add(prog, 1);
}
1136
EXPORT_SYMBOL_GPL(bpf_prog_inc);
A
Alexei Starovoitov 已提交
1137

1138
/* prog_idr_lock should have been held */
1139
struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154
{
	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;
}
1155
EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
1156

1157
bool bpf_prog_get_ok(struct bpf_prog *prog,
1158
			    enum bpf_prog_type *attach_type, bool attach_drv)
1159
{
1160 1161 1162
	/* not an attachment, just a refcount inc, always allow */
	if (!attach_type)
		return true;
1163 1164 1165

	if (prog->type != *attach_type)
		return false;
1166
	if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
1167 1168 1169 1170 1171 1172
		return false;

	return true;
}

static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
1173
				       bool attach_drv)
1174 1175 1176 1177
{
	struct fd f = fdget(ufd);
	struct bpf_prog *prog;

1178
	prog = ____bpf_prog_get(f);
1179 1180
	if (IS_ERR(prog))
		return prog;
1181
	if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
1182 1183 1184
		prog = ERR_PTR(-EINVAL);
		goto out;
	}
1185

A
Alexei Starovoitov 已提交
1186
	prog = bpf_prog_inc(prog);
1187
out:
1188 1189 1190
	fdput(f);
	return prog;
}
1191 1192 1193

struct bpf_prog *bpf_prog_get(u32 ufd)
{
1194
	return __bpf_prog_get(ufd, NULL, false);
1195 1196
}

1197
struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
1198
				       bool attach_drv)
1199
{
1200
	return __bpf_prog_get(ufd, &type, attach_drv);
1201
}
1202
EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
1203

A
Andrey Ignatov 已提交
1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229
/* 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;
	}
}

1230 1231 1232 1233
static int
bpf_prog_load_check_attach_type(enum bpf_prog_type prog_type,
				enum bpf_attach_type expected_attach_type)
{
A
Andrey Ignatov 已提交
1234
	switch (prog_type) {
A
Andrey Ignatov 已提交
1235 1236 1237 1238 1239 1240 1241 1242 1243
	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 已提交
1244 1245 1246 1247
	case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
		switch (expected_attach_type) {
		case BPF_CGROUP_INET4_BIND:
		case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1248 1249
		case BPF_CGROUP_INET4_CONNECT:
		case BPF_CGROUP_INET6_CONNECT:
A
Andrey Ignatov 已提交
1250 1251 1252 1253 1254 1255 1256
			return 0;
		default:
			return -EINVAL;
		}
	default:
		return 0;
	}
1257 1258
}

1259
/* last field in 'union bpf_attr' used by this command */
1260
#define	BPF_PROG_LOAD_LAST_FIELD expected_attach_type
1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272

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;

1273 1274 1275
	if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
		return -EINVAL;

1276
	/* copy eBPF program license from user space */
M
Mickaël Salaün 已提交
1277
	if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
1278 1279 1280 1281 1282 1283 1284
			      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);

1285 1286
	if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
		return -E2BIG;
1287

1288 1289 1290 1291
	if (type == BPF_PROG_TYPE_KPROBE &&
	    attr->kern_version != LINUX_VERSION_CODE)
		return -EINVAL;

1292 1293 1294
	if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
	    type != BPF_PROG_TYPE_CGROUP_SKB &&
	    !capable(CAP_SYS_ADMIN))
1295 1296
		return -EPERM;

A
Andrey Ignatov 已提交
1297
	bpf_prog_load_fixup_attach_type(attr);
1298 1299 1300
	if (bpf_prog_load_check_attach_type(type, attr->expected_attach_type))
		return -EINVAL;

1301 1302 1303 1304 1305
	/* plain bpf_prog allocation */
	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
	if (!prog)
		return -ENOMEM;

1306 1307
	prog->expected_attach_type = attr->expected_attach_type;

1308 1309
	prog->aux->offload_requested = !!attr->prog_ifindex;

1310
	err = security_bpf_prog_alloc(prog->aux);
1311 1312 1313
	if (err)
		goto free_prog_nouncharge;

1314 1315 1316 1317
	err = bpf_prog_charge_memlock(prog);
	if (err)
		goto free_prog_sec;

1318 1319 1320
	prog->len = attr->insn_cnt;

	err = -EFAULT;
M
Mickaël Salaün 已提交
1321
	if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
1322
			   bpf_prog_insn_size(prog)) != 0)
1323 1324 1325
		goto free_prog;

	prog->orig_prog = NULL;
1326
	prog->jited = 0;
1327 1328

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

1331
	if (bpf_prog_is_dev_bound(prog->aux)) {
1332 1333 1334 1335 1336
		err = bpf_prog_offload_init(prog, attr);
		if (err)
			goto free_prog;
	}

1337 1338 1339 1340 1341
	/* find program type: socket_filter vs tracing_filter */
	err = find_prog_type(type, prog);
	if (err < 0)
		goto free_prog;

1342 1343 1344 1345 1346
	prog->aux->load_time = ktime_get_boot_ns();
	err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
	if (err)
		goto free_prog;

1347
	/* run eBPF verifier */
1348
	err = bpf_check(&prog, attr);
1349 1350 1351 1352
	if (err < 0)
		goto free_used_maps;

	/* eBPF program is ready to be JITed */
1353 1354
	if (!prog->bpf_func)
		prog = bpf_prog_select_runtime(prog, &err);
1355 1356
	if (err < 0)
		goto free_used_maps;
1357

M
Martin KaFai Lau 已提交
1358 1359 1360 1361
	err = bpf_prog_alloc_id(prog);
	if (err)
		goto free_used_maps;

1362
	err = bpf_prog_new_fd(prog);
1363 1364 1365 1366 1367 1368 1369 1370 1371 1372
	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;
	}
1373

1374
	bpf_prog_kallsyms_add(prog);
1375 1376 1377 1378 1379
	return err;

free_used_maps:
	free_used_maps(prog->aux);
free_prog:
1380
	bpf_prog_uncharge_memlock(prog);
1381 1382
free_prog_sec:
	security_bpf_prog_free(prog->aux);
1383
free_prog_nouncharge:
1384 1385 1386 1387
	bpf_prog_free(prog);
	return err;
}

1388
#define BPF_OBJ_LAST_FIELD file_flags
1389 1390 1391

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

M
Mickaël Salaün 已提交
1395
	return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
1396 1397 1398 1399
}

static int bpf_obj_get(const union bpf_attr *attr)
{
1400 1401
	if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
	    attr->file_flags & ~BPF_OBJ_FLAG_MASK)
1402 1403
		return -EINVAL;

1404 1405
	return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
				attr->file_flags);
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 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482
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;
}

1483 1484
#ifdef CONFIG_CGROUP_BPF

1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496
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;
	}
}

1497
#define BPF_PROG_ATTACH_LAST_FIELD attach_flags
1498

1499 1500
static int sockmap_get_from_fd(const union bpf_attr *attr,
			       int type, bool attach)
1501
{
1502
	struct bpf_prog *prog = NULL;
1503 1504 1505 1506 1507 1508 1509 1510 1511 1512
	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);

1513
	if (attach) {
1514
		prog = bpf_prog_get_type(attr->attach_bpf_fd, type);
1515 1516 1517 1518
		if (IS_ERR(prog)) {
			fdput(f);
			return PTR_ERR(prog);
		}
1519 1520
	}

1521
	err = sock_map_prog(map, prog, attr->attach_type);
1522 1523
	if (err) {
		fdput(f);
1524 1525
		if (prog)
			bpf_prog_put(prog);
1526
		return err;
1527 1528 1529
	}

	fdput(f);
1530
	return 0;
1531
}
1532

1533 1534 1535
#define BPF_F_ATTACH_MASK \
	(BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)

1536 1537
static int bpf_prog_attach(const union bpf_attr *attr)
{
1538
	enum bpf_prog_type ptype;
1539 1540
	struct bpf_prog *prog;
	struct cgroup *cgrp;
1541
	int ret;
1542 1543 1544 1545 1546 1547 1548

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

	if (CHECK_ATTR(BPF_PROG_ATTACH))
		return -EINVAL;

1549
	if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
1550 1551
		return -EINVAL;

1552 1553 1554
	switch (attr->attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
1555
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
1556
		break;
1557
	case BPF_CGROUP_INET_SOCK_CREATE:
A
Andrey Ignatov 已提交
1558 1559
	case BPF_CGROUP_INET4_POST_BIND:
	case BPF_CGROUP_INET6_POST_BIND:
1560 1561
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
A
Andrey Ignatov 已提交
1562 1563
	case BPF_CGROUP_INET4_BIND:
	case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1564 1565
	case BPF_CGROUP_INET4_CONNECT:
	case BPF_CGROUP_INET6_CONNECT:
A
Andrey Ignatov 已提交
1566 1567
		ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
		break;
L
Lawrence Brakmo 已提交
1568 1569 1570
	case BPF_CGROUP_SOCK_OPS:
		ptype = BPF_PROG_TYPE_SOCK_OPS;
		break;
1571 1572 1573
	case BPF_CGROUP_DEVICE:
		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
		break;
1574 1575
	case BPF_SK_MSG_VERDICT:
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, true);
1576 1577
	case BPF_SK_SKB_STREAM_PARSER:
	case BPF_SK_SKB_STREAM_VERDICT:
1578
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, true);
1579 1580 1581 1582
	default:
		return -EINVAL;
	}

1583 1584 1585 1586
	prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
	if (IS_ERR(prog))
		return PTR_ERR(prog);

1587 1588 1589 1590 1591
	if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
		bpf_prog_put(prog);
		return -EINVAL;
	}

1592 1593 1594 1595 1596 1597
	cgrp = cgroup_get_from_fd(attr->target_fd);
	if (IS_ERR(cgrp)) {
		bpf_prog_put(prog);
		return PTR_ERR(cgrp);
	}

1598 1599
	ret = cgroup_bpf_attach(cgrp, prog, attr->attach_type,
				attr->attach_flags);
1600 1601
	if (ret)
		bpf_prog_put(prog);
1602 1603
	cgroup_put(cgrp);

1604
	return ret;
1605 1606 1607 1608 1609 1610
}

#define BPF_PROG_DETACH_LAST_FIELD attach_type

static int bpf_prog_detach(const union bpf_attr *attr)
{
1611 1612
	enum bpf_prog_type ptype;
	struct bpf_prog *prog;
1613
	struct cgroup *cgrp;
1614
	int ret;
1615 1616 1617 1618 1619 1620 1621 1622 1623 1624

	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:
1625 1626
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
		break;
1627
	case BPF_CGROUP_INET_SOCK_CREATE:
A
Andrey Ignatov 已提交
1628 1629
	case BPF_CGROUP_INET4_POST_BIND:
	case BPF_CGROUP_INET6_POST_BIND:
1630 1631
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
A
Andrey Ignatov 已提交
1632 1633
	case BPF_CGROUP_INET4_BIND:
	case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1634 1635
	case BPF_CGROUP_INET4_CONNECT:
	case BPF_CGROUP_INET6_CONNECT:
A
Andrey Ignatov 已提交
1636 1637
		ptype = BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
		break;
L
Lawrence Brakmo 已提交
1638
	case BPF_CGROUP_SOCK_OPS:
1639
		ptype = BPF_PROG_TYPE_SOCK_OPS;
1640
		break;
1641 1642 1643
	case BPF_CGROUP_DEVICE:
		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
		break;
1644 1645
	case BPF_SK_MSG_VERDICT:
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, false);
1646 1647
	case BPF_SK_SKB_STREAM_PARSER:
	case BPF_SK_SKB_STREAM_VERDICT:
1648
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, false);
1649 1650 1651 1652
	default:
		return -EINVAL;
	}

1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664
	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);
1665
	return ret;
1666
}
L
Lawrence Brakmo 已提交
1667

1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686
#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 已提交
1687 1688
	case BPF_CGROUP_INET4_BIND:
	case BPF_CGROUP_INET6_BIND:
A
Andrey Ignatov 已提交
1689 1690
	case BPF_CGROUP_INET4_POST_BIND:
	case BPF_CGROUP_INET6_POST_BIND:
A
Andrey Ignatov 已提交
1691 1692
	case BPF_CGROUP_INET4_CONNECT:
	case BPF_CGROUP_INET6_CONNECT:
1693
	case BPF_CGROUP_SOCK_OPS:
1694
	case BPF_CGROUP_DEVICE:
1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705
		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;
}
1706 1707
#endif /* CONFIG_CGROUP_BPF */

1708 1709 1710 1711 1712 1713 1714 1715
#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;

1716 1717
	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;
1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731
	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;
}

1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759
#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;
}

1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791
#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;
}

1792
#define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
M
Martin KaFai Lau 已提交
1793 1794 1795 1796 1797

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

1801 1802
	if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
	    attr->open_flags & ~BPF_OBJ_FLAG_MASK)
M
Martin KaFai Lau 已提交
1803 1804 1805 1806 1807
		return -EINVAL;

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

1808 1809 1810 1811
	f_flags = bpf_get_file_flag(attr->open_flags);
	if (f_flags < 0)
		return f_flags;

M
Martin KaFai Lau 已提交
1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822
	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);

1823
	fd = bpf_map_new_fd(map, f_flags);
M
Martin KaFai Lau 已提交
1824 1825 1826 1827 1828 1829
	if (fd < 0)
		bpf_map_put(map);

	return fd;
}

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 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890
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;
}

1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901
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;

1902
	err = bpf_check_uarg_tail_zero(uinfo, sizeof(info), info_len);
1903 1904 1905 1906 1907
	if (err)
		return err;
	info_len = min_t(u32, sizeof(info), info_len);

	if (copy_from_user(&info, uinfo, info_len))
1908
		return -EFAULT;
1909 1910 1911

	info.type = prog->type;
	info.id = prog->aux->id;
1912 1913 1914
	info.load_time = prog->aux->load_time;
	info.created_by_uid = from_kuid_munged(current_user_ns(),
					       prog->aux->user->uid);
1915
	info.gpl_compatible = prog->gpl_compatible;
1916 1917

	memcpy(info.tag, prog->tag, sizeof(prog->tag));
1918 1919 1920 1921 1922 1923
	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) {
1924
		u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
1925 1926 1927 1928 1929 1930 1931
		u32 i;

		for (i = 0; i < ulen; i++)
			if (put_user(prog->aux->used_maps[i]->id,
				     &user_map_ids[i]))
				return -EFAULT;
	}
1932 1933 1934 1935

	if (!capable(CAP_SYS_ADMIN)) {
		info.jited_prog_len = 0;
		info.xlated_prog_len = 0;
1936
		info.nr_jited_ksyms = 0;
1937 1938 1939 1940
		goto done;
	}

	ulen = info.xlated_prog_len;
1941
	info.xlated_prog_len = bpf_prog_insn_size(prog);
1942
	if (info.xlated_prog_len && ulen) {
1943 1944 1945 1946 1947 1948 1949 1950 1951 1952
		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;
1953 1954
		uinsns = u64_to_user_ptr(info.xlated_prog_insns);
		ulen = min_t(u32, info.xlated_prog_len, ulen);
1955 1956 1957
		fault = copy_to_user(uinsns, insns_sanitized, ulen);
		kfree(insns_sanitized);
		if (fault)
1958 1959 1960
			return -EFAULT;
	}

1961 1962 1963 1964
	if (bpf_prog_is_dev_bound(prog->aux)) {
		err = bpf_prog_offload_info_fill(&info, prog);
		if (err)
			return err;
1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982
		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;
		}
1983 1984
	}

1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008
	ulen = info.nr_jited_ksyms;
	info.nr_jited_ksyms = prog->aux->func_cnt;
	if (info.nr_jited_ksyms && ulen) {
		if (bpf_dump_raw_ok()) {
			u64 __user *user_ksyms;
			ulong ksym_addr;
			u32 i;

			/* copy the address of the kernel symbol
			 * corresponding to each function
			 */
			ulen = min_t(u32, info.nr_jited_ksyms, ulen);
			user_ksyms = u64_to_user_ptr(info.jited_ksyms);
			for (i = 0; i < ulen; i++) {
				ksym_addr = (ulong) prog->aux->func[i]->bpf_func;
				ksym_addr &= PAGE_MASK;
				if (put_user((u64) ksym_addr, &user_ksyms[i]))
					return -EFAULT;
			}
		} else {
			info.jited_ksyms = 0;
		}
	}

2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025
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;

2026
	err = bpf_check_uarg_tail_zero(uinfo, sizeof(info), info_len);
2027 2028 2029 2030 2031 2032 2033 2034 2035 2036
	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;
2037
	memcpy(info.name, map->name, sizeof(map->name));
2038

M
Martin KaFai Lau 已提交
2039 2040
	if (map->btf) {
		info.btf_id = btf_id(map->btf);
2041 2042
		info.btf_key_type_id = map->btf_key_type_id;
		info.btf_value_type_id = map->btf_value_type_id;
M
Martin KaFai Lau 已提交
2043 2044
	}

2045 2046 2047 2048 2049 2050
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_info_fill(&info, map);
		if (err)
			return err;
	}

2051 2052 2053 2054 2055 2056 2057
	if (copy_to_user(uinfo, &info, info_len) ||
	    put_user(info_len, &uattr->info.info_len))
		return -EFAULT;

	return 0;
}

2058 2059 2060 2061 2062 2063 2064 2065
static int bpf_btf_get_info_by_fd(struct btf *btf,
				  const union bpf_attr *attr,
				  union bpf_attr __user *uattr)
{
	struct bpf_btf_info __user *uinfo = u64_to_user_ptr(attr->info.info);
	u32 info_len = attr->info.info_len;
	int err;

2066
	err = bpf_check_uarg_tail_zero(uinfo, sizeof(*uinfo), info_len);
2067 2068 2069 2070 2071 2072
	if (err)
		return err;

	return btf_get_info_by_fd(btf, attr, uattr);
}

2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094
#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);
2095
	else if (f.file->f_op == &btf_fops)
2096
		err = bpf_btf_get_info_by_fd(f.file->private_data, attr, uattr);
2097 2098 2099 2100 2101 2102 2103
	else
		err = -EINVAL;

	fdput(f);
	return err;
}

2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116
#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);
}

M
Martin KaFai Lau 已提交
2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129
#define BPF_BTF_GET_FD_BY_ID_LAST_FIELD btf_id

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

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

	return btf_get_fd_by_id(attr->btf_id);
}

2130 2131 2132 2133 2134
SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
{
	union bpf_attr attr = {};
	int err;

2135
	if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
2136 2137
		return -EPERM;

2138
	err = bpf_check_uarg_tail_zero(uattr, sizeof(attr), size);
2139 2140 2141
	if (err)
		return err;
	size = min_t(u32, size, sizeof(attr));
2142 2143 2144 2145 2146

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

2147 2148 2149 2150
	err = security_bpf(cmd, &attr, size);
	if (err < 0)
		return err;

2151 2152 2153 2154
	switch (cmd) {
	case BPF_MAP_CREATE:
		err = map_create(&attr);
		break;
2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166
	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;
2167 2168 2169
	case BPF_PROG_LOAD:
		err = bpf_prog_load(&attr);
		break;
2170 2171 2172 2173 2174 2175
	case BPF_OBJ_PIN:
		err = bpf_obj_pin(&attr);
		break;
	case BPF_OBJ_GET:
		err = bpf_obj_get(&attr);
		break;
2176 2177 2178 2179 2180 2181 2182
#ifdef CONFIG_CGROUP_BPF
	case BPF_PROG_ATTACH:
		err = bpf_prog_attach(&attr);
		break;
	case BPF_PROG_DETACH:
		err = bpf_prog_detach(&attr);
		break;
2183 2184 2185
	case BPF_PROG_QUERY:
		err = bpf_prog_query(&attr, uattr);
		break;
2186
#endif
2187 2188 2189
	case BPF_PROG_TEST_RUN:
		err = bpf_prog_test_run(&attr, uattr);
		break;
2190 2191 2192 2193 2194 2195 2196 2197
	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;
2198 2199 2200
	case BPF_PROG_GET_FD_BY_ID:
		err = bpf_prog_get_fd_by_id(&attr);
		break;
M
Martin KaFai Lau 已提交
2201 2202 2203
	case BPF_MAP_GET_FD_BY_ID:
		err = bpf_map_get_fd_by_id(&attr);
		break;
2204 2205 2206
	case BPF_OBJ_GET_INFO_BY_FD:
		err = bpf_obj_get_info_by_fd(&attr, uattr);
		break;
2207 2208 2209
	case BPF_RAW_TRACEPOINT_OPEN:
		err = bpf_raw_tracepoint_open(&attr);
		break;
2210 2211 2212
	case BPF_BTF_LOAD:
		err = bpf_btf_load(&attr);
		break;
M
Martin KaFai Lau 已提交
2213 2214 2215
	case BPF_BTF_GET_FD_BY_ID:
		err = bpf_btf_get_fd_by_id(&attr);
		break;
2216 2217 2218 2219 2220 2221 2222
	default:
		err = -EINVAL;
		break;
	}

	return err;
}