syscall.c 23.8 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>
25

26 27
DEFINE_PER_CPU(int, bpf_prog_active);

28 29
int sysctl_unprivileged_bpf_disabled __read_mostly;

30 31 32 33 34 35 36 37
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
};
38 39 40 41 42

static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
{
	struct bpf_map *map;

43 44 45
	if (attr->map_type >= ARRAY_SIZE(bpf_map_types) ||
	    !bpf_map_types[attr->map_type])
		return ERR_PTR(-EINVAL);
46

47 48 49 50 51 52
	map = bpf_map_types[attr->map_type]->map_alloc(attr);
	if (IS_ERR(map))
		return map;
	map->ops = bpf_map_types[attr->map_type];
	map->map_type = attr->map_type;
	return map;
53 54
}

55 56 57 58 59 60 61 62 63 64 65 66 67 68 69
void *bpf_map_area_alloc(size_t size)
{
	/* 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)) {
		area = kmalloc(size, GFP_USER | flags);
		if (area != NULL)
			return area;
	}

70
	return __vmalloc(size, GFP_KERNEL | flags, PAGE_KERNEL);
71 72 73 74 75 76 77
}

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

78 79 80 81 82 83 84 85 86 87 88 89 90
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;
}

91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
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);
}

117 118 119 120 121
/* called from workqueue */
static void bpf_map_free_deferred(struct work_struct *work)
{
	struct bpf_map *map = container_of(work, struct bpf_map, work);

122
	bpf_map_uncharge_memlock(map);
123 124 125 126
	/* implementation dependent freeing */
	map->ops->map_free(map);
}

127 128 129 130 131 132 133 134
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);
	}
}

135 136 137 138 139 140 141 142 143 144 145
/* decrement map refcnt and schedule it for freeing via workqueue
 * (unrelying map implementation ops->map_free() might sleep)
 */
void bpf_map_put(struct bpf_map *map)
{
	if (atomic_dec_and_test(&map->refcnt)) {
		INIT_WORK(&map->work, bpf_map_free_deferred);
		schedule_work(&map->work);
	}
}

146
void bpf_map_put_with_uref(struct bpf_map *map)
147
{
148
	bpf_map_put_uref(map);
149
	bpf_map_put(map);
150 151 152 153
}

static int bpf_map_release(struct inode *inode, struct file *filp)
{
154 155 156 157 158 159
	struct bpf_map *map = filp->private_data;

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

	bpf_map_put_with_uref(map);
160 161 162
	return 0;
}

163 164 165 166
#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;
167 168 169 170 171 172 173
	const struct bpf_array *array;
	u32 owner_prog_type = 0;

	if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
		array = container_of(map, struct bpf_array, map);
		owner_prog_type = array->owner_prog_type;
	}
174 175 176 177 178

	seq_printf(m,
		   "map_type:\t%u\n"
		   "key_size:\t%u\n"
		   "value_size:\t%u\n"
179
		   "max_entries:\t%u\n"
180 181
		   "map_flags:\t%#x\n"
		   "memlock:\t%llu\n",
182 183 184
		   map->map_type,
		   map->key_size,
		   map->value_size,
185
		   map->max_entries,
186 187 188 189 190 191
		   map->map_flags,
		   map->pages * 1ULL << PAGE_SHIFT);

	if (owner_prog_type)
		seq_printf(m, "owner_prog_type:\t%u\n",
			   owner_prog_type);
192 193 194
}
#endif

195
static const struct file_operations bpf_map_fops = {
196 197 198 199
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_map_show_fdinfo,
#endif
	.release	= bpf_map_release,
200 201
};

202
int bpf_map_new_fd(struct bpf_map *map)
203 204 205 206 207
{
	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
				O_RDWR | O_CLOEXEC);
}

208 209 210 211 212 213 214 215
/* 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

216
#define BPF_MAP_CREATE_LAST_FIELD inner_map_fd
217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232
/* called via syscall */
static int map_create(union bpf_attr *attr)
{
	struct bpf_map *map;
	int err;

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

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

	atomic_set(&map->refcnt, 1);
233
	atomic_set(&map->usercnt, 1);
234

235 236
	err = bpf_map_charge_memlock(map);
	if (err)
237
		goto free_map_nouncharge;
238

239
	err = bpf_map_new_fd(map);
240 241 242 243
	if (err < 0)
		/* failed to allocate fd */
		goto free_map;

244
	trace_bpf_map_create(map, err);
245 246 247
	return err;

free_map:
248 249
	bpf_map_uncharge_memlock(map);
free_map_nouncharge:
250 251 252 253
	map->ops->map_free(map);
	return err;
}

254 255 256
/* if error is returned, fd is released.
 * On success caller should complete fd access with matching fdput()
 */
257
struct bpf_map *__bpf_map_get(struct fd f)
258 259 260 261 262 263 264 265
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_map_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

266 267 268
	return f.file->private_data;
}

A
Alexei Starovoitov 已提交
269 270 271 272
/* prog's and map's refcnt limit */
#define BPF_MAX_REFCNT 32768

struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
273
{
A
Alexei Starovoitov 已提交
274 275 276 277
	if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
		atomic_dec(&map->refcnt);
		return ERR_PTR(-EBUSY);
	}
278 279
	if (uref)
		atomic_inc(&map->usercnt);
A
Alexei Starovoitov 已提交
280
	return map;
281 282 283
}

struct bpf_map *bpf_map_get_with_uref(u32 ufd)
284 285 286 287 288 289 290 291
{
	struct fd f = fdget(ufd);
	struct bpf_map *map;

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

A
Alexei Starovoitov 已提交
292
	map = bpf_map_inc(map, true);
293
	fdput(f);
294 295 296 297

	return map;
}

298 299 300 301 302
int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
{
	return -ENOTSUPP;
}

303 304 305 306 307
/* 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 已提交
308 309
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
310 311
	int ufd = attr->map_fd;
	struct bpf_map *map;
312
	void *key, *value, *ptr;
313
	u32 value_size;
314
	struct fd f;
315 316 317 318 319
	int err;

	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
		return -EINVAL;

320
	f = fdget(ufd);
321
	map = __bpf_map_get(f);
322 323 324 325 326 327 328 329 330 331 332 333
	if (IS_ERR(map))
		return PTR_ERR(map);

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

	err = -EFAULT;
	if (copy_from_user(key, ukey, map->key_size) != 0)
		goto free_key;

334
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
335
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
336 337 338 339 340
	    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;

341
	err = -ENOMEM;
342
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
343
	if (!value)
344 345
		goto free_key;

346 347
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
348 349 350
		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);
351 352
	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
		err = bpf_stackmap_copy(map, key, value);
M
Martin KaFai Lau 已提交
353 354
	} else if (map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
		   map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
355
		err = -ENOTSUPP;
356 357 358 359 360 361 362 363
	} 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;
	}
364

365
	if (err)
366
		goto free_value;
367 368

	err = -EFAULT;
369
	if (copy_to_user(uvalue, value, value_size) != 0)
370
		goto free_value;
371

372
	trace_bpf_map_lookup_elem(map, ufd, key, value);
373 374
	err = 0;

375 376
free_value:
	kfree(value);
377 378 379 380 381 382 383
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

384
#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
385 386 387

static int map_update_elem(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
388 389
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
390 391 392
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *value;
393
	u32 value_size;
394
	struct fd f;
395 396 397 398 399
	int err;

	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
		return -EINVAL;

400
	f = fdget(ufd);
401
	map = __bpf_map_get(f);
402 403 404 405 406 407 408 409 410 411 412 413
	if (IS_ERR(map))
		return PTR_ERR(map);

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

	err = -EFAULT;
	if (copy_from_user(key, ukey, map->key_size) != 0)
		goto free_key;

414
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
415
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
416 417 418 419 420
	    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;

421
	err = -ENOMEM;
422
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
423 424 425 426
	if (!value)
		goto free_key;

	err = -EFAULT;
427
	if (copy_from_user(value, uvalue, value_size) != 0)
428 429
		goto free_value;

430 431 432 433 434
	/* 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);
435 436
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
437 438 439
		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);
440
	} else if (map->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY ||
441
		   map->map_type == BPF_MAP_TYPE_PROG_ARRAY ||
442 443
		   map->map_type == BPF_MAP_TYPE_CGROUP_ARRAY ||
		   map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) {
444 445 446 447
		rcu_read_lock();
		err = bpf_fd_array_map_update_elem(map, f.file, key, value,
						   attr->flags);
		rcu_read_unlock();
M
Martin KaFai Lau 已提交
448 449 450 451 452
	} 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();
453 454 455 456 457
	} else {
		rcu_read_lock();
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		rcu_read_unlock();
	}
458 459
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
460

461 462
	if (!err)
		trace_bpf_map_update_elem(map, ufd, key, value);
463 464 465 466 467 468 469 470 471 472 473 474 475
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 已提交
476
	void __user *ukey = u64_to_user_ptr(attr->key);
477 478
	int ufd = attr->map_fd;
	struct bpf_map *map;
479
	struct fd f;
480 481 482 483 484 485
	void *key;
	int err;

	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
		return -EINVAL;

486
	f = fdget(ufd);
487
	map = __bpf_map_get(f);
488 489 490 491 492 493 494 495 496 497 498 499
	if (IS_ERR(map))
		return PTR_ERR(map);

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

	err = -EFAULT;
	if (copy_from_user(key, ukey, map->key_size) != 0)
		goto free_key;

500 501
	preempt_disable();
	__this_cpu_inc(bpf_prog_active);
502 503 504
	rcu_read_lock();
	err = map->ops->map_delete_elem(map, key);
	rcu_read_unlock();
505 506
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
507

508 509
	if (!err)
		trace_bpf_map_delete_elem(map, ufd, key);
510 511 512 513 514 515 516 517 518 519 520 521
free_key:
	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 已提交
522 523
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *unext_key = u64_to_user_ptr(attr->next_key);
524 525 526
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *next_key;
527
	struct fd f;
528 529 530 531 532
	int err;

	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
		return -EINVAL;

533
	f = fdget(ufd);
534
	map = __bpf_map_get(f);
535 536 537
	if (IS_ERR(map))
		return PTR_ERR(map);

538 539 540 541 542 543 544 545 546 547 548 549
	if (ukey) {
		err = -ENOMEM;
		key = kmalloc(map->key_size, GFP_USER);
		if (!key)
			goto err_put;

		err = -EFAULT;
		if (copy_from_user(key, ukey, map->key_size) != 0)
			goto free_key;
	} else {
		key = NULL;
	}
550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565

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

	rcu_read_lock();
	err = map->ops->map_get_next_key(map, key, next_key);
	rcu_read_unlock();
	if (err)
		goto free_next_key;

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

566
	trace_bpf_map_next_key(map, ufd, key, next_key);
567 568 569 570 571 572 573 574 575 576 577
	err = 0;

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

578 579 580
static const struct bpf_verifier_ops * const bpf_prog_types[] = {
#define BPF_PROG_TYPE(_id, _ops) \
	[_id] = &_ops,
581
#define BPF_MAP_TYPE(_id, _ops)
582 583
#include <linux/bpf_types.h>
#undef BPF_PROG_TYPE
584
#undef BPF_MAP_TYPE
585
};
586 587 588

static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
{
589 590
	if (type >= ARRAY_SIZE(bpf_prog_types) || !bpf_prog_types[type])
		return -EINVAL;
591

592 593 594
	prog->aux->ops = bpf_prog_types[type];
	prog->type = type;
	return 0;
595 596 597 598 599 600 601 602 603 604 605 606 607
}

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

608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629
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);
}

630 631 632
static int bpf_prog_charge_memlock(struct bpf_prog *prog)
{
	struct user_struct *user = get_current_user();
633
	int ret;
634

635 636
	ret = __bpf_prog_charge(user, prog->pages);
	if (ret) {
637
		free_uid(user);
638
		return ret;
639
	}
640

641 642 643 644 645 646 647 648
	prog->aux->user = user;
	return 0;
}

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

649
	__bpf_prog_uncharge(user, prog->pages);
650 651 652
	free_uid(user);
}

653
static void __bpf_prog_put_rcu(struct rcu_head *rcu)
654 655 656 657
{
	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);

	free_used_maps(aux);
658
	bpf_prog_uncharge_memlock(aux->prog);
659 660 661
	bpf_prog_free(aux->prog);
}

662 663
void bpf_prog_put(struct bpf_prog *prog)
{
664 665
	if (atomic_dec_and_test(&prog->aux->refcnt)) {
		trace_bpf_prog_put_rcu(prog);
666
		bpf_prog_kallsyms_del(prog);
667
		call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
668
	}
669
}
670
EXPORT_SYMBOL_GPL(bpf_prog_put);
671 672 673 674 675

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

676
	bpf_prog_put(prog);
677 678 679
	return 0;
}

680 681 682 683
#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;
684
	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
685

686
	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
687 688 689
	seq_printf(m,
		   "prog_type:\t%u\n"
		   "prog_jited:\t%u\n"
690
		   "prog_tag:\t%s\n"
691 692 693
		   "memlock:\t%llu\n",
		   prog->type,
		   prog->jited,
694
		   prog_tag,
695 696 697 698
		   prog->pages * 1ULL << PAGE_SHIFT);
}
#endif

699
static const struct file_operations bpf_prog_fops = {
700 701 702 703
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_prog_show_fdinfo,
#endif
	.release	= bpf_prog_release,
704 705
};

706
int bpf_prog_new_fd(struct bpf_prog *prog)
707 708 709 710 711
{
	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
				O_RDWR | O_CLOEXEC);
}

712
static struct bpf_prog *____bpf_prog_get(struct fd f)
713 714 715 716 717 718 719 720
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_prog_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

721
	return f.file->private_data;
722 723
}

724
struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
A
Alexei Starovoitov 已提交
725
{
726 727
	if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
		atomic_sub(i, &prog->aux->refcnt);
A
Alexei Starovoitov 已提交
728 729 730 731
		return ERR_PTR(-EBUSY);
	}
	return prog;
}
732 733
EXPORT_SYMBOL_GPL(bpf_prog_add);

734 735 736 737 738 739 740 741 742 743 744
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);

745 746 747 748
struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
{
	return bpf_prog_add(prog, 1);
}
749
EXPORT_SYMBOL_GPL(bpf_prog_inc);
A
Alexei Starovoitov 已提交
750

751
static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *type)
752 753 754 755
{
	struct fd f = fdget(ufd);
	struct bpf_prog *prog;

756
	prog = ____bpf_prog_get(f);
757 758
	if (IS_ERR(prog))
		return prog;
759 760 761 762
	if (type && prog->type != *type) {
		prog = ERR_PTR(-EINVAL);
		goto out;
	}
763

A
Alexei Starovoitov 已提交
764
	prog = bpf_prog_inc(prog);
765
out:
766 767 768
	fdput(f);
	return prog;
}
769 770 771 772 773 774 775 776

struct bpf_prog *bpf_prog_get(u32 ufd)
{
	return __bpf_prog_get(ufd, NULL);
}

struct bpf_prog *bpf_prog_get_type(u32 ufd, enum bpf_prog_type type)
{
777 778 779 780 781
	struct bpf_prog *prog = __bpf_prog_get(ufd, &type);

	if (!IS_ERR(prog))
		trace_bpf_prog_get_type(prog);
	return prog;
782 783
}
EXPORT_SYMBOL_GPL(bpf_prog_get_type);
784 785

/* last field in 'union bpf_attr' used by this command */
786
#define	BPF_PROG_LOAD_LAST_FIELD kern_version
787 788 789 790 791 792 793 794 795 796 797 798 799

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;

	/* copy eBPF program license from user space */
M
Mickaël Salaün 已提交
800
	if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
801 802 803 804 805 806 807
			      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);

808 809
	if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
		return -E2BIG;
810

811 812 813 814
	if (type == BPF_PROG_TYPE_KPROBE &&
	    attr->kern_version != LINUX_VERSION_CODE)
		return -EINVAL;

815 816 817
	if (type != BPF_PROG_TYPE_SOCKET_FILTER && !capable(CAP_SYS_ADMIN))
		return -EPERM;

818 819 820 821 822
	/* plain bpf_prog allocation */
	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
	if (!prog)
		return -ENOMEM;

823 824 825 826
	err = bpf_prog_charge_memlock(prog);
	if (err)
		goto free_prog_nouncharge;

827 828 829
	prog->len = attr->insn_cnt;

	err = -EFAULT;
M
Mickaël Salaün 已提交
830
	if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
831
			   bpf_prog_insn_size(prog)) != 0)
832 833 834
		goto free_prog;

	prog->orig_prog = NULL;
835
	prog->jited = 0;
836 837

	atomic_set(&prog->aux->refcnt, 1);
838
	prog->gpl_compatible = is_gpl ? 1 : 0;
839 840 841 842 843 844 845

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

	/* run eBPF verifier */
846
	err = bpf_check(&prog, attr);
847 848 849 850
	if (err < 0)
		goto free_used_maps;

	/* eBPF program is ready to be JITed */
851
	prog = bpf_prog_select_runtime(prog, &err);
852 853
	if (err < 0)
		goto free_used_maps;
854

855
	err = bpf_prog_new_fd(prog);
856 857 858 859
	if (err < 0)
		/* failed to allocate fd */
		goto free_used_maps;

860
	bpf_prog_kallsyms_add(prog);
861
	trace_bpf_prog_load(prog, err);
862 863 864 865 866
	return err;

free_used_maps:
	free_used_maps(prog->aux);
free_prog:
867 868
	bpf_prog_uncharge_memlock(prog);
free_prog_nouncharge:
869 870 871 872
	bpf_prog_free(prog);
	return err;
}

873 874 875 876 877 878 879
#define BPF_OBJ_LAST_FIELD bpf_fd

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

M
Mickaël Salaün 已提交
880
	return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
881 882 883 884 885 886 887
}

static int bpf_obj_get(const union bpf_attr *attr)
{
	if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0)
		return -EINVAL;

M
Mickaël Salaün 已提交
888
	return bpf_obj_get_user(u64_to_user_ptr(attr->pathname));
889 890
}

891 892
#ifdef CONFIG_CGROUP_BPF

893
#define BPF_PROG_ATTACH_LAST_FIELD attach_flags
894 895 896

static int bpf_prog_attach(const union bpf_attr *attr)
{
897
	enum bpf_prog_type ptype;
898 899
	struct bpf_prog *prog;
	struct cgroup *cgrp;
900
	int ret;
901 902 903 904 905 906 907

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

	if (CHECK_ATTR(BPF_PROG_ATTACH))
		return -EINVAL;

908 909 910
	if (attr->attach_flags & ~BPF_F_ALLOW_OVERRIDE)
		return -EINVAL;

911 912 913
	switch (attr->attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
914
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
915
		break;
916 917 918
	case BPF_CGROUP_INET_SOCK_CREATE:
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
919 920 921 922
	default:
		return -EINVAL;
	}

923 924 925 926 927 928 929 930 931 932
	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);
	}

933 934 935 936
	ret = cgroup_bpf_update(cgrp, prog, attr->attach_type,
				attr->attach_flags & BPF_F_ALLOW_OVERRIDE);
	if (ret)
		bpf_prog_put(prog);
937 938
	cgroup_put(cgrp);

939
	return ret;
940 941 942 943 944 945 946
}

#define BPF_PROG_DETACH_LAST_FIELD attach_type

static int bpf_prog_detach(const union bpf_attr *attr)
{
	struct cgroup *cgrp;
947
	int ret;
948 949 950 951 952 953 954 955 956 957

	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:
958
	case BPF_CGROUP_INET_SOCK_CREATE:
959 960 961 962
		cgrp = cgroup_get_from_fd(attr->target_fd);
		if (IS_ERR(cgrp))
			return PTR_ERR(cgrp);

963
		ret = cgroup_bpf_update(cgrp, NULL, attr->attach_type, false);
964 965 966 967 968 969 970
		cgroup_put(cgrp);
		break;

	default:
		return -EINVAL;
	}

971
	return ret;
972 973 974
}
#endif /* CONFIG_CGROUP_BPF */

975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996
#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;

	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;
}

997 998 999 1000 1001
SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
{
	union bpf_attr attr = {};
	int err;

1002
	if (!capable(CAP_SYS_ADMIN) && sysctl_unprivileged_bpf_disabled)
1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041
		return -EPERM;

	if (!access_ok(VERIFY_READ, uattr, 1))
		return -EFAULT;

	if (size > PAGE_SIZE)	/* silly large */
		return -E2BIG;

	/* 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 dont know about yet.
	 */
	if (size > sizeof(attr)) {
		unsigned char __user *addr;
		unsigned char __user *end;
		unsigned char val;

		addr = (void __user *)uattr + sizeof(attr);
		end  = (void __user *)uattr + size;

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

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

	switch (cmd) {
	case BPF_MAP_CREATE:
		err = map_create(&attr);
		break;
1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053
	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;
1054 1055 1056
	case BPF_PROG_LOAD:
		err = bpf_prog_load(&attr);
		break;
1057 1058 1059 1060 1061 1062
	case BPF_OBJ_PIN:
		err = bpf_obj_pin(&attr);
		break;
	case BPF_OBJ_GET:
		err = bpf_obj_get(&attr);
		break;
1063 1064 1065 1066 1067 1068 1069 1070
#ifdef CONFIG_CGROUP_BPF
	case BPF_PROG_ATTACH:
		err = bpf_prog_attach(&attr);
		break;
	case BPF_PROG_DETACH:
		err = bpf_prog_detach(&attr);
		break;
#endif
1071 1072 1073
	case BPF_PROG_TEST_RUN:
		err = bpf_prog_test_run(&attr, uattr);
		break;
1074 1075 1076 1077 1078 1079 1080
	default:
		err = -EINVAL;
		break;
	}

	return err;
}