syscall.c 44.7 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 15
#include <linux/syscalls.h>
#include <linux/slab.h>
16
#include <linux/sched/signal.h>
17 18
#include <linux/vmalloc.h>
#include <linux/mmzone.h>
19
#include <linux/anon_inodes.h>
20
#include <linux/file.h>
21 22
#include <linux/license.h>
#include <linux/filter.h>
23
#include <linux/version.h>
M
Mickaël Salaün 已提交
24
#include <linux/kernel.h>
M
Martin KaFai Lau 已提交
25
#include <linux/idr.h>
26 27 28
#include <linux/cred.h>
#include <linux/timekeeping.h>
#include <linux/ctype.h>
29

30 31 32 33 34 35 36
#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))

37 38
#define BPF_OBJ_FLAG_MASK   (BPF_F_RDONLY | BPF_F_WRONLY)

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

45 46
int sysctl_unprivileged_bpf_disabled __read_mostly;

47 48 49 50 51 52 53 54
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
};
55

56 57 58 59 60 61 62 63 64
/*
 * 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.
 */
65 66 67 68 69 70 71 72 73
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;

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

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

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

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

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

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

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

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

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

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

153 154 155 156 157 158 159 160 161 162
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);
}

163 164 165 166 167 168 169 170 171 172 173 174 175
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;
}

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

S
Shaohua Li 已提交
206
	idr_preload(GFP_KERNEL);
M
Martin KaFai Lau 已提交
207 208 209 210 211
	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 已提交
212
	idr_preload_end();
M
Martin KaFai Lau 已提交
213 214 215 216 217 218 219

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

	return id > 0 ? 0 : id;
}

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

224 225 226 227 228 229 230 231
	/* 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 已提交
232
	if (do_idr_lock)
233
		spin_lock_irqsave(&map_idr_lock, flags);
M
Martin KaFai Lau 已提交
234 235 236
	else
		__acquire(&map_idr_lock);

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

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

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

251
	bpf_map_uncharge_memlock(map);
252
	security_bpf_map_free(map);
253 254 255 256
	/* implementation dependent freeing */
	map->ops->map_free(map);
}

257 258 259 260 261 262 263 264
static void bpf_map_put_uref(struct bpf_map *map)
{
	if (atomic_dec_and_test(&map->usercnt)) {
		if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY)
			bpf_fd_array_map_clear(map);
	}
}

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

M
Martin KaFai Lau 已提交
278 279 280 281 282
void bpf_map_put(struct bpf_map *map)
{
	__bpf_map_put(map, true);
}

283
void bpf_map_put_with_uref(struct bpf_map *map)
284
{
285
	bpf_map_put_uref(map);
286
	bpf_map_put(map);
287 288 289 290
}

static int bpf_map_release(struct inode *inode, struct file *filp)
{
291 292 293 294 295 296
	struct bpf_map *map = filp->private_data;

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

	bpf_map_put_with_uref(map);
297 298 299
	return 0;
}

300 301 302 303
#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;
304 305
	const struct bpf_array *array;
	u32 owner_prog_type = 0;
306
	u32 owner_jited = 0;
307 308 309 310

	if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
		array = container_of(map, struct bpf_array, map);
		owner_prog_type = array->owner_prog_type;
311
		owner_jited = array->owner_jited;
312
	}
313 314 315 316 317

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

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

337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354
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;
}

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

364
int bpf_map_new_fd(struct bpf_map *map, int flags)
365
{
366 367 368 369 370 371
	int ret;

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

372
	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
373 374 375 376 377 378 379 380 381 382 383 384
				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;
385 386
}

387 388 389 390 391 392 393 394
/* 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

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

402 403
	memset(dst, 0, BPF_OBJ_NAME_LEN);

404 405 406 407 408 409 410 411 412 413 414 415 416 417
	/* 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;
}

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

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

431 432 433 434
	f_flags = bpf_get_file_flag(attr->map_flags);
	if (f_flags < 0)
		return f_flags;

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

440 441 442 443 444
	/* 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);

445 446 447 448
	err = bpf_obj_name_cpy(map->name, attr->map_name);
	if (err)
		goto free_map_nouncharge;

449
	atomic_set(&map->refcnt, 1);
450
	atomic_set(&map->usercnt, 1);
451

452
	err = security_bpf_map_alloc(map);
453
	if (err)
454
		goto free_map_nouncharge;
455

456 457 458 459
	err = bpf_map_charge_memlock(map);
	if (err)
		goto free_map_sec;

M
Martin KaFai Lau 已提交
460 461 462 463
	err = bpf_map_alloc_id(map);
	if (err)
		goto free_map;

464
	err = bpf_map_new_fd(map, f_flags);
M
Martin KaFai Lau 已提交
465 466 467 468 469 470 471 472 473 474
	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;
	}
475

476
	trace_bpf_map_create(map, err);
477 478 479
	return err;

free_map:
480
	bpf_map_uncharge_memlock(map);
481 482
free_map_sec:
	security_bpf_map_free(map);
483
free_map_nouncharge:
484 485 486 487
	map->ops->map_free(map);
	return err;
}

488 489 490
/* if error is returned, fd is released.
 * On success caller should complete fd access with matching fdput()
 */
491
struct bpf_map *__bpf_map_get(struct fd f)
492 493 494 495 496 497 498 499
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_map_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

500 501 502
	return f.file->private_data;
}

A
Alexei Starovoitov 已提交
503 504 505 506
/* prog's and map's refcnt limit */
#define BPF_MAX_REFCNT 32768

struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
507
{
A
Alexei Starovoitov 已提交
508 509 510 511
	if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
		atomic_dec(&map->refcnt);
		return ERR_PTR(-EBUSY);
	}
512 513
	if (uref)
		atomic_inc(&map->usercnt);
A
Alexei Starovoitov 已提交
514
	return map;
515 516 517
}

struct bpf_map *bpf_map_get_with_uref(u32 ufd)
518 519 520 521 522 523 524 525
{
	struct fd f = fdget(ufd);
	struct bpf_map *map;

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

A
Alexei Starovoitov 已提交
526
	map = bpf_map_inc(map, true);
527
	fdput(f);
528 529 530 531

	return map;
}

M
Martin KaFai Lau 已提交
532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553
/* 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;
}

554 555 556 557 558
int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
{
	return -ENOTSUPP;
}

559 560 561 562 563
/* 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 已提交
564 565
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
566 567
	int ufd = attr->map_fd;
	struct bpf_map *map;
568
	void *key, *value, *ptr;
569
	u32 value_size;
570
	struct fd f;
571 572 573 574 575
	int err;

	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
		return -EINVAL;

576
	f = fdget(ufd);
577
	map = __bpf_map_get(f);
578 579 580
	if (IS_ERR(map))
		return PTR_ERR(map);

581 582 583 584 585
	if (!(f.file->f_mode & FMODE_CAN_READ)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
586 587 588
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
589
		goto err_put;
A
Al Viro 已提交
590
	}
591

592
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
593
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
594 595
	    map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY)
		value_size = round_up(map->value_size, 8) * num_possible_cpus();
596 597
	else if (IS_FD_MAP(map))
		value_size = sizeof(u32);
598 599 600
	else
		value_size = map->value_size;

601
	err = -ENOMEM;
602
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
603
	if (!value)
604 605
		goto free_key;

606 607 608 609
	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) {
610 611 612
		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);
613 614
	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
		err = bpf_stackmap_copy(map, key, value);
615 616 617 618
	} 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);
619 620 621 622 623 624 625 626
	} 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;
	}
627

628
	if (err)
629
		goto free_value;
630 631

	err = -EFAULT;
632
	if (copy_to_user(uvalue, value, value_size) != 0)
633
		goto free_value;
634

635
	trace_bpf_map_lookup_elem(map, ufd, key, value);
636 637
	err = 0;

638 639
free_value:
	kfree(value);
640 641 642 643 644 645 646
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

647
#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
648 649 650

static int map_update_elem(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
651 652
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
653 654 655
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *value;
656
	u32 value_size;
657
	struct fd f;
658 659 660 661 662
	int err;

	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
		return -EINVAL;

663
	f = fdget(ufd);
664
	map = __bpf_map_get(f);
665 666 667
	if (IS_ERR(map))
		return PTR_ERR(map);

668 669 670 671 672
	if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
673 674 675
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
676
		goto err_put;
A
Al Viro 已提交
677
	}
678

679
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
680
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
681 682 683 684 685
	    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;

686
	err = -ENOMEM;
687
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
688 689 690 691
	if (!value)
		goto free_key;

	err = -EFAULT;
692
	if (copy_from_user(value, uvalue, value_size) != 0)
693 694
		goto free_value;

695
	/* Need to create a kthread, thus must support schedule */
696 697 698 699
	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) {
700 701 702 703
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		goto out;
	}

704 705 706 707 708
	/* 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);
709 710
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
711 712 713
		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);
714
	} else if (IS_FD_ARRAY(map)) {
715 716 717 718
		rcu_read_lock();
		err = bpf_fd_array_map_update_elem(map, f.file, key, value,
						   attr->flags);
		rcu_read_unlock();
M
Martin KaFai Lau 已提交
719 720 721 722 723
	} 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();
724 725 726 727 728
	} else {
		rcu_read_lock();
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		rcu_read_unlock();
	}
729 730
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
731
out:
732 733
	if (!err)
		trace_bpf_map_update_elem(map, ufd, key, value);
734 735 736 737 738 739 740 741 742 743 744 745 746
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 已提交
747
	void __user *ukey = u64_to_user_ptr(attr->key);
748 749
	int ufd = attr->map_fd;
	struct bpf_map *map;
750
	struct fd f;
751 752 753 754 755 756
	void *key;
	int err;

	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
		return -EINVAL;

757
	f = fdget(ufd);
758
	map = __bpf_map_get(f);
759 760 761
	if (IS_ERR(map))
		return PTR_ERR(map);

762 763 764 765 766
	if (!(f.file->f_mode & FMODE_CAN_WRITE)) {
		err = -EPERM;
		goto err_put;
	}

A
Al Viro 已提交
767 768 769
	key = memdup_user(ukey, map->key_size);
	if (IS_ERR(key)) {
		err = PTR_ERR(key);
770
		goto err_put;
A
Al Viro 已提交
771
	}
772

773 774 775 776 777
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_delete_elem(map, key);
		goto out;
	}

778 779
	preempt_disable();
	__this_cpu_inc(bpf_prog_active);
780 781 782
	rcu_read_lock();
	err = map->ops->map_delete_elem(map, key);
	rcu_read_unlock();
783 784
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
785
out:
786 787
	if (!err)
		trace_bpf_map_delete_elem(map, ufd, key);
788 789 790 791 792 793 794 795 796 797 798
	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 已提交
799 800
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *unext_key = u64_to_user_ptr(attr->next_key);
801 802 803
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *next_key;
804
	struct fd f;
805 806 807 808 809
	int err;

	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
		return -EINVAL;

810
	f = fdget(ufd);
811
	map = __bpf_map_get(f);
812 813 814
	if (IS_ERR(map))
		return PTR_ERR(map);

815 816 817 818 819
	if (!(f.file->f_mode & FMODE_CAN_READ)) {
		err = -EPERM;
		goto err_put;
	}

820
	if (ukey) {
A
Al Viro 已提交
821 822 823
		key = memdup_user(ukey, map->key_size);
		if (IS_ERR(key)) {
			err = PTR_ERR(key);
824
			goto err_put;
A
Al Viro 已提交
825
		}
826 827 828
	} else {
		key = NULL;
	}
829 830 831 832 833 834

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

835 836 837 838 839
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_get_next_key(map, key, next_key);
		goto out;
	}

840 841 842
	rcu_read_lock();
	err = map->ops->map_get_next_key(map, key, next_key);
	rcu_read_unlock();
843
out:
844 845 846 847 848 849 850
	if (err)
		goto free_next_key;

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

851
	trace_bpf_map_next_key(map, ufd, key, next_key);
852 853 854 855 856 857 858 859 860 861 862
	err = 0;

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

863 864 865 866 867 868 869 870 871
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
};

872 873
static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
{
874 875
	if (type >= ARRAY_SIZE(bpf_prog_types) || !bpf_prog_types[type])
		return -EINVAL;
876

877 878 879 880
	if (!bpf_prog_is_dev_bound(prog->aux))
		prog->aux->ops = bpf_prog_types[type];
	else
		prog->aux->ops = &bpf_offload_prog_ops;
881 882
	prog->type = type;
	return 0;
883 884 885 886 887 888 889 890 891 892 893 894 895
}

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

896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917
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);
}

918 919 920
static int bpf_prog_charge_memlock(struct bpf_prog *prog)
{
	struct user_struct *user = get_current_user();
921
	int ret;
922

923 924
	ret = __bpf_prog_charge(user, prog->pages);
	if (ret) {
925
		free_uid(user);
926
		return ret;
927
	}
928

929 930 931 932 933 934 935 936
	prog->aux->user = user;
	return 0;
}

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

937
	__bpf_prog_uncharge(user, prog->pages);
938 939 940
	free_uid(user);
}

M
Martin KaFai Lau 已提交
941 942 943 944
static int bpf_prog_alloc_id(struct bpf_prog *prog)
{
	int id;

S
Shaohua Li 已提交
945
	idr_preload(GFP_KERNEL);
M
Martin KaFai Lau 已提交
946 947 948 949 950
	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 已提交
951
	idr_preload_end();
M
Martin KaFai Lau 已提交
952 953 954 955 956 957 958 959

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

	return id > 0 ? 0 : id;
}

960
void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
M
Martin KaFai Lau 已提交
961
{
962 963 964 965 966
	/* 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 已提交
967 968 969
	if (!prog->aux->id)
		return;

970 971 972 973 974
	if (do_idr_lock)
		spin_lock_bh(&prog_idr_lock);
	else
		__acquire(&prog_idr_lock);

M
Martin KaFai Lau 已提交
975
	idr_remove(&prog_idr, prog->aux->id);
976
	prog->aux->id = 0;
977 978 979 980 981

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

984
static void __bpf_prog_put_rcu(struct rcu_head *rcu)
985 986 987 988
{
	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);

	free_used_maps(aux);
989
	bpf_prog_uncharge_memlock(aux->prog);
990
	security_bpf_prog_free(aux);
991 992 993
	bpf_prog_free(aux->prog);
}

994
static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
995
{
996
	if (atomic_dec_and_test(&prog->aux->refcnt)) {
997 998
		int i;

999
		trace_bpf_prog_put_rcu(prog);
1000
		/* bpf_prog_free_id() must be called first */
1001
		bpf_prog_free_id(prog, do_idr_lock);
1002 1003 1004

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

1007
		call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
1008
	}
1009
}
1010 1011 1012 1013 1014

void bpf_prog_put(struct bpf_prog *prog)
{
	__bpf_prog_put(prog, true);
}
1015
EXPORT_SYMBOL_GPL(bpf_prog_put);
1016 1017 1018 1019 1020

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

1021
	bpf_prog_put(prog);
1022 1023 1024
	return 0;
}

1025 1026 1027 1028
#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;
1029
	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
1030

1031
	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
1032 1033 1034
	seq_printf(m,
		   "prog_type:\t%u\n"
		   "prog_jited:\t%u\n"
1035
		   "prog_tag:\t%s\n"
1036 1037 1038
		   "memlock:\t%llu\n",
		   prog->type,
		   prog->jited,
1039
		   prog_tag,
1040 1041 1042 1043
		   prog->pages * 1ULL << PAGE_SHIFT);
}
#endif

1044
const struct file_operations bpf_prog_fops = {
1045 1046 1047 1048
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_prog_show_fdinfo,
#endif
	.release	= bpf_prog_release,
1049 1050
	.read		= bpf_dummy_read,
	.write		= bpf_dummy_write,
1051 1052
};

1053
int bpf_prog_new_fd(struct bpf_prog *prog)
1054
{
1055 1056 1057 1058 1059 1060
	int ret;

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

1061 1062 1063 1064
	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
				O_RDWR | O_CLOEXEC);
}

1065
static struct bpf_prog *____bpf_prog_get(struct fd f)
1066 1067 1068 1069 1070 1071 1072 1073
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_prog_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

1074
	return f.file->private_data;
1075 1076
}

1077
struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
A
Alexei Starovoitov 已提交
1078
{
1079 1080
	if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
		atomic_sub(i, &prog->aux->refcnt);
A
Alexei Starovoitov 已提交
1081 1082 1083 1084
		return ERR_PTR(-EBUSY);
	}
	return prog;
}
1085 1086
EXPORT_SYMBOL_GPL(bpf_prog_add);

1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097
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);

1098 1099 1100 1101
struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
{
	return bpf_prog_add(prog, 1);
}
1102
EXPORT_SYMBOL_GPL(bpf_prog_inc);
A
Alexei Starovoitov 已提交
1103

1104
/* prog_idr_lock should have been held */
1105
struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120
{
	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;
}
1121
EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
1122

1123
bool bpf_prog_get_ok(struct bpf_prog *prog,
1124
			    enum bpf_prog_type *attach_type, bool attach_drv)
1125
{
1126 1127 1128
	/* not an attachment, just a refcount inc, always allow */
	if (!attach_type)
		return true;
1129 1130 1131

	if (prog->type != *attach_type)
		return false;
1132
	if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
1133 1134 1135 1136 1137 1138
		return false;

	return true;
}

static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
1139
				       bool attach_drv)
1140 1141 1142 1143
{
	struct fd f = fdget(ufd);
	struct bpf_prog *prog;

1144
	prog = ____bpf_prog_get(f);
1145 1146
	if (IS_ERR(prog))
		return prog;
1147
	if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
1148 1149 1150
		prog = ERR_PTR(-EINVAL);
		goto out;
	}
1151

A
Alexei Starovoitov 已提交
1152
	prog = bpf_prog_inc(prog);
1153
out:
1154 1155 1156
	fdput(f);
	return prog;
}
1157 1158 1159

struct bpf_prog *bpf_prog_get(u32 ufd)
{
1160
	return __bpf_prog_get(ufd, NULL, false);
1161 1162
}

1163
struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
1164
				       bool attach_drv)
1165
{
1166
	struct bpf_prog *prog = __bpf_prog_get(ufd, &type, attach_drv);
1167 1168 1169 1170 1171

	if (!IS_ERR(prog))
		trace_bpf_prog_get_type(prog);
	return prog;
}
1172
EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
1173

1174
/* last field in 'union bpf_attr' used by this command */
1175
#define	BPF_PROG_LOAD_LAST_FIELD prog_ifindex
1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187

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;

1188 1189 1190
	if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
		return -EINVAL;

1191
	/* copy eBPF program license from user space */
M
Mickaël Salaün 已提交
1192
	if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
1193 1194 1195 1196 1197 1198 1199
			      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);

1200 1201
	if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
		return -E2BIG;
1202

1203 1204 1205 1206
	if (type == BPF_PROG_TYPE_KPROBE &&
	    attr->kern_version != LINUX_VERSION_CODE)
		return -EINVAL;

1207 1208 1209
	if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
	    type != BPF_PROG_TYPE_CGROUP_SKB &&
	    !capable(CAP_SYS_ADMIN))
1210 1211
		return -EPERM;

1212 1213 1214 1215 1216
	/* plain bpf_prog allocation */
	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
	if (!prog)
		return -ENOMEM;

1217 1218
	prog->aux->offload_requested = !!attr->prog_ifindex;

1219
	err = security_bpf_prog_alloc(prog->aux);
1220 1221 1222
	if (err)
		goto free_prog_nouncharge;

1223 1224 1225 1226
	err = bpf_prog_charge_memlock(prog);
	if (err)
		goto free_prog_sec;

1227 1228 1229
	prog->len = attr->insn_cnt;

	err = -EFAULT;
M
Mickaël Salaün 已提交
1230
	if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
1231
			   bpf_prog_insn_size(prog)) != 0)
1232 1233 1234
		goto free_prog;

	prog->orig_prog = NULL;
1235
	prog->jited = 0;
1236 1237

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

1240
	if (bpf_prog_is_dev_bound(prog->aux)) {
1241 1242 1243 1244 1245
		err = bpf_prog_offload_init(prog, attr);
		if (err)
			goto free_prog;
	}

1246 1247 1248 1249 1250
	/* find program type: socket_filter vs tracing_filter */
	err = find_prog_type(type, prog);
	if (err < 0)
		goto free_prog;

1251 1252 1253 1254 1255
	prog->aux->load_time = ktime_get_boot_ns();
	err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name);
	if (err)
		goto free_prog;

1256
	/* run eBPF verifier */
1257
	err = bpf_check(&prog, attr);
1258 1259 1260 1261
	if (err < 0)
		goto free_used_maps;

	/* eBPF program is ready to be JITed */
1262 1263
	if (!prog->bpf_func)
		prog = bpf_prog_select_runtime(prog, &err);
1264 1265
	if (err < 0)
		goto free_used_maps;
1266

M
Martin KaFai Lau 已提交
1267 1268 1269 1270
	err = bpf_prog_alloc_id(prog);
	if (err)
		goto free_used_maps;

1271
	err = bpf_prog_new_fd(prog);
1272 1273 1274 1275 1276 1277 1278 1279 1280 1281
	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;
	}
1282

1283
	bpf_prog_kallsyms_add(prog);
1284
	trace_bpf_prog_load(prog, err);
1285 1286 1287 1288 1289
	return err;

free_used_maps:
	free_used_maps(prog->aux);
free_prog:
1290
	bpf_prog_uncharge_memlock(prog);
1291 1292
free_prog_sec:
	security_bpf_prog_free(prog->aux);
1293
free_prog_nouncharge:
1294 1295 1296 1297
	bpf_prog_free(prog);
	return err;
}

1298
#define BPF_OBJ_LAST_FIELD file_flags
1299 1300 1301

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

M
Mickaël Salaün 已提交
1305
	return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
1306 1307 1308 1309
}

static int bpf_obj_get(const union bpf_attr *attr)
{
1310 1311
	if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
	    attr->file_flags & ~BPF_OBJ_FLAG_MASK)
1312 1313
		return -EINVAL;

1314 1315
	return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
				attr->file_flags);
1316 1317
}

1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392
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;
}

1393 1394
#ifdef CONFIG_CGROUP_BPF

1395
#define BPF_PROG_ATTACH_LAST_FIELD attach_flags
1396

1397 1398
static int sockmap_get_from_fd(const union bpf_attr *attr,
			       int type, bool attach)
1399
{
1400
	struct bpf_prog *prog = NULL;
1401 1402 1403 1404 1405 1406 1407 1408 1409 1410
	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);

1411
	if (attach) {
1412
		prog = bpf_prog_get_type(attr->attach_bpf_fd, type);
1413 1414 1415 1416
		if (IS_ERR(prog)) {
			fdput(f);
			return PTR_ERR(prog);
		}
1417 1418
	}

1419
	err = sock_map_prog(map, prog, attr->attach_type);
1420 1421
	if (err) {
		fdput(f);
1422 1423
		if (prog)
			bpf_prog_put(prog);
1424
		return err;
1425 1426 1427
	}

	fdput(f);
1428
	return 0;
1429
}
1430

1431 1432 1433
#define BPF_F_ATTACH_MASK \
	(BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI)

1434 1435
static int bpf_prog_attach(const union bpf_attr *attr)
{
1436
	enum bpf_prog_type ptype;
1437 1438
	struct bpf_prog *prog;
	struct cgroup *cgrp;
1439
	int ret;
1440 1441 1442 1443 1444 1445 1446

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

	if (CHECK_ATTR(BPF_PROG_ATTACH))
		return -EINVAL;

1447
	if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
1448 1449
		return -EINVAL;

1450 1451 1452
	switch (attr->attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
1453
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
1454
		break;
1455 1456 1457
	case BPF_CGROUP_INET_SOCK_CREATE:
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
L
Lawrence Brakmo 已提交
1458 1459 1460
	case BPF_CGROUP_SOCK_OPS:
		ptype = BPF_PROG_TYPE_SOCK_OPS;
		break;
1461 1462 1463
	case BPF_CGROUP_DEVICE:
		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
		break;
1464 1465
	case BPF_SK_MSG_VERDICT:
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, true);
1466 1467
	case BPF_SK_SKB_STREAM_PARSER:
	case BPF_SK_SKB_STREAM_VERDICT:
1468
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, true);
1469 1470 1471 1472
	default:
		return -EINVAL;
	}

1473 1474 1475 1476 1477 1478 1479 1480 1481 1482
	prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
	if (IS_ERR(prog))
		return PTR_ERR(prog);

	cgrp = cgroup_get_from_fd(attr->target_fd);
	if (IS_ERR(cgrp)) {
		bpf_prog_put(prog);
		return PTR_ERR(cgrp);
	}

1483 1484
	ret = cgroup_bpf_attach(cgrp, prog, attr->attach_type,
				attr->attach_flags);
1485 1486
	if (ret)
		bpf_prog_put(prog);
1487 1488
	cgroup_put(cgrp);

1489
	return ret;
1490 1491 1492 1493 1494 1495
}

#define BPF_PROG_DETACH_LAST_FIELD attach_type

static int bpf_prog_detach(const union bpf_attr *attr)
{
1496 1497
	enum bpf_prog_type ptype;
	struct bpf_prog *prog;
1498
	struct cgroup *cgrp;
1499
	int ret;
1500 1501 1502 1503 1504 1505 1506 1507 1508 1509

	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:
1510 1511
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
		break;
1512
	case BPF_CGROUP_INET_SOCK_CREATE:
1513 1514
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
L
Lawrence Brakmo 已提交
1515
	case BPF_CGROUP_SOCK_OPS:
1516
		ptype = BPF_PROG_TYPE_SOCK_OPS;
1517
		break;
1518 1519 1520
	case BPF_CGROUP_DEVICE:
		ptype = BPF_PROG_TYPE_CGROUP_DEVICE;
		break;
1521 1522
	case BPF_SK_MSG_VERDICT:
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_MSG, false);
1523 1524
	case BPF_SK_SKB_STREAM_PARSER:
	case BPF_SK_SKB_STREAM_VERDICT:
1525
		return sockmap_get_from_fd(attr, BPF_PROG_TYPE_SK_SKB, false);
1526 1527 1528 1529
	default:
		return -EINVAL;
	}

1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541
	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);
1542
	return ret;
1543
}
L
Lawrence Brakmo 已提交
1544

1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564
#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:
	case BPF_CGROUP_SOCK_OPS:
1565
	case BPF_CGROUP_DEVICE:
1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576
		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;
}
1577 1578
#endif /* CONFIG_CGROUP_BPF */

1579 1580 1581 1582 1583 1584 1585 1586
#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;

1587 1588
	if (!capable(CAP_SYS_ADMIN))
		return -EPERM;
1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602
	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;
}

1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630
#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;
}

1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662
#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;
}

1663
#define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
M
Martin KaFai Lau 已提交
1664 1665 1666 1667 1668

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

1672 1673
	if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
	    attr->open_flags & ~BPF_OBJ_FLAG_MASK)
M
Martin KaFai Lau 已提交
1674 1675 1676 1677 1678
		return -EINVAL;

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

1679 1680 1681 1682
	f_flags = bpf_get_file_flag(attr->open_flags);
	if (f_flags < 0)
		return f_flags;

M
Martin KaFai Lau 已提交
1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693
	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);

1694
	fd = bpf_map_new_fd(map, f_flags);
M
Martin KaFai Lau 已提交
1695 1696 1697 1698 1699 1700
	if (fd < 0)
		bpf_map_put(map);

	return fd;
}

1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 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 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761
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;
}

1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778
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))
1779
		return -EFAULT;
1780 1781 1782

	info.type = prog->type;
	info.id = prog->aux->id;
1783 1784 1785
	info.load_time = prog->aux->load_time;
	info.created_by_uid = from_kuid_munged(current_user_ns(),
					       prog->aux->user->uid);
1786 1787

	memcpy(info.tag, prog->tag, sizeof(prog->tag));
1788 1789 1790 1791 1792 1793
	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) {
1794
		u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
1795 1796 1797 1798 1799 1800 1801
		u32 i;

		for (i = 0; i < ulen; i++)
			if (put_user(prog->aux->used_maps[i]->id,
				     &user_map_ids[i]))
				return -EFAULT;
	}
1802 1803 1804 1805 1806 1807 1808 1809

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

	ulen = info.xlated_prog_len;
1810
	info.xlated_prog_len = bpf_prog_insn_size(prog);
1811
	if (info.xlated_prog_len && ulen) {
1812 1813 1814 1815 1816 1817 1818 1819 1820 1821
		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;
1822 1823
		uinsns = u64_to_user_ptr(info.xlated_prog_insns);
		ulen = min_t(u32, info.xlated_prog_len, ulen);
1824 1825 1826
		fault = copy_to_user(uinsns, insns_sanitized, ulen);
		kfree(insns_sanitized);
		if (fault)
1827 1828 1829
			return -EFAULT;
	}

1830 1831 1832 1833
	if (bpf_prog_is_dev_bound(prog->aux)) {
		err = bpf_prog_offload_info_fill(&info, prog);
		if (err)
			return err;
1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851
		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;
		}
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
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;
1882
	memcpy(info.name, map->name, sizeof(map->name));
1883

1884 1885 1886 1887 1888 1889
	if (bpf_map_is_dev_bound(map)) {
		err = bpf_map_offload_info_fill(&info, map);
		if (err)
			return err;
	}

1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925
	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);
	else
		err = -EINVAL;

	fdput(f);
	return err;
}

1926 1927 1928 1929 1930
SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
{
	union bpf_attr attr = {};
	int err;

1931
	if (sysctl_unprivileged_bpf_disabled && !capable(CAP_SYS_ADMIN))
1932 1933
		return -EPERM;

1934 1935 1936 1937
	err = check_uarg_tail_zero(uattr, sizeof(attr), size);
	if (err)
		return err;
	size = min_t(u32, size, sizeof(attr));
1938 1939 1940 1941 1942

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

1943 1944 1945 1946
	err = security_bpf(cmd, &attr, size);
	if (err < 0)
		return err;

1947 1948 1949 1950
	switch (cmd) {
	case BPF_MAP_CREATE:
		err = map_create(&attr);
		break;
1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962
	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;
1963 1964 1965
	case BPF_PROG_LOAD:
		err = bpf_prog_load(&attr);
		break;
1966 1967 1968 1969 1970 1971
	case BPF_OBJ_PIN:
		err = bpf_obj_pin(&attr);
		break;
	case BPF_OBJ_GET:
		err = bpf_obj_get(&attr);
		break;
1972 1973 1974 1975 1976 1977 1978
#ifdef CONFIG_CGROUP_BPF
	case BPF_PROG_ATTACH:
		err = bpf_prog_attach(&attr);
		break;
	case BPF_PROG_DETACH:
		err = bpf_prog_detach(&attr);
		break;
1979 1980 1981
	case BPF_PROG_QUERY:
		err = bpf_prog_query(&attr, uattr);
		break;
1982
#endif
1983 1984 1985
	case BPF_PROG_TEST_RUN:
		err = bpf_prog_test_run(&attr, uattr);
		break;
1986 1987 1988 1989 1990 1991 1992 1993
	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;
1994 1995 1996
	case BPF_PROG_GET_FD_BY_ID:
		err = bpf_prog_get_fd_by_id(&attr);
		break;
M
Martin KaFai Lau 已提交
1997 1998 1999
	case BPF_MAP_GET_FD_BY_ID:
		err = bpf_map_get_fd_by_id(&attr);
		break;
2000 2001 2002
	case BPF_OBJ_GET_INFO_BY_FD:
		err = bpf_obj_get_info_by_fd(&attr, uattr);
		break;
2003 2004 2005
	case BPF_RAW_TRACEPOINT_OPEN:
		err = bpf_raw_tracepoint_open(&attr);
		break;
2006 2007 2008 2009 2010 2011 2012
	default:
		err = -EINVAL;
		break;
	}

	return err;
}