syscall.c 25.3 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12
/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of version 2 of the GNU General Public
 * License as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
 * General Public License for more details.
 */
#include <linux/bpf.h>
13
#include <linux/bpf_trace.h>
14 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
DEFINE_PER_CPU(int, bpf_prog_active);
M
Martin KaFai Lau 已提交
28 29
static DEFINE_IDR(prog_idr);
static DEFINE_SPINLOCK(prog_idr_lock);
M
Martin KaFai Lau 已提交
30 31
static DEFINE_IDR(map_idr);
static DEFINE_SPINLOCK(map_idr_lock);
32

33 34
int sysctl_unprivileged_bpf_disabled __read_mostly;

35 36 37 38 39 40 41 42
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
};
43 44 45 46 47

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

48 49 50
	if (attr->map_type >= ARRAY_SIZE(bpf_map_types) ||
	    !bpf_map_types[attr->map_type])
		return ERR_PTR(-EINVAL);
51

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

60 61 62 63 64 65 66 67 68 69 70 71 72 73 74
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;
	}

75
	return __vmalloc(size, GFP_KERNEL | flags, PAGE_KERNEL);
76 77 78 79 80 81 82
}

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

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

96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121
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 已提交
122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144
static int bpf_map_alloc_id(struct bpf_map *map)
{
	int id;

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

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

	return id > 0 ? 0 : id;
}

static void bpf_map_free_id(struct bpf_map *map)
{
	spin_lock_bh(&map_idr_lock);
	idr_remove(&map_idr, map->id);
	spin_unlock_bh(&map_idr_lock);
}

145 146 147 148 149
/* called from workqueue */
static void bpf_map_free_deferred(struct work_struct *work)
{
	struct bpf_map *map = container_of(work, struct bpf_map, work);

150
	bpf_map_uncharge_memlock(map);
151 152 153 154
	/* implementation dependent freeing */
	map->ops->map_free(map);
}

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

163 164 165 166 167 168
/* 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)) {
M
Martin KaFai Lau 已提交
169
		bpf_map_free_id(map);
170 171 172 173 174
		INIT_WORK(&map->work, bpf_map_free_deferred);
		schedule_work(&map->work);
	}
}

175
void bpf_map_put_with_uref(struct bpf_map *map)
176
{
177
	bpf_map_put_uref(map);
178
	bpf_map_put(map);
179 180 181 182
}

static int bpf_map_release(struct inode *inode, struct file *filp)
{
183 184 185 186 187 188
	struct bpf_map *map = filp->private_data;

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

	bpf_map_put_with_uref(map);
189 190 191
	return 0;
}

192 193 194 195
#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;
196 197 198 199 200 201 202
	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;
	}
203 204 205 206 207

	seq_printf(m,
		   "map_type:\t%u\n"
		   "key_size:\t%u\n"
		   "value_size:\t%u\n"
208
		   "max_entries:\t%u\n"
209 210
		   "map_flags:\t%#x\n"
		   "memlock:\t%llu\n",
211 212 213
		   map->map_type,
		   map->key_size,
		   map->value_size,
214
		   map->max_entries,
215 216 217 218 219 220
		   map->map_flags,
		   map->pages * 1ULL << PAGE_SHIFT);

	if (owner_prog_type)
		seq_printf(m, "owner_prog_type:\t%u\n",
			   owner_prog_type);
221 222 223
}
#endif

224
static const struct file_operations bpf_map_fops = {
225 226 227 228
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_map_show_fdinfo,
#endif
	.release	= bpf_map_release,
229 230
};

231
int bpf_map_new_fd(struct bpf_map *map)
232 233 234 235 236
{
	return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
				O_RDWR | O_CLOEXEC);
}

237 238 239 240 241 242 243 244
/* 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

245
#define BPF_MAP_CREATE_LAST_FIELD inner_map_fd
246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261
/* 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);
262
	atomic_set(&map->usercnt, 1);
263

264 265
	err = bpf_map_charge_memlock(map);
	if (err)
266
		goto free_map_nouncharge;
267

M
Martin KaFai Lau 已提交
268 269 270 271
	err = bpf_map_alloc_id(map);
	if (err)
		goto free_map;

272
	err = bpf_map_new_fd(map);
273 274
	if (err < 0)
		/* failed to allocate fd */
M
Martin KaFai Lau 已提交
275
		goto free_id;
276

277
	trace_bpf_map_create(map, err);
278 279
	return err;

M
Martin KaFai Lau 已提交
280 281
free_id:
	bpf_map_free_id(map);
282
free_map:
283 284
	bpf_map_uncharge_memlock(map);
free_map_nouncharge:
285 286 287 288
	map->ops->map_free(map);
	return err;
}

289 290 291
/* if error is returned, fd is released.
 * On success caller should complete fd access with matching fdput()
 */
292
struct bpf_map *__bpf_map_get(struct fd f)
293 294 295 296 297 298 299 300
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_map_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

301 302 303
	return f.file->private_data;
}

A
Alexei Starovoitov 已提交
304 305 306 307
/* prog's and map's refcnt limit */
#define BPF_MAX_REFCNT 32768

struct bpf_map *bpf_map_inc(struct bpf_map *map, bool uref)
308
{
A
Alexei Starovoitov 已提交
309 310 311 312
	if (atomic_inc_return(&map->refcnt) > BPF_MAX_REFCNT) {
		atomic_dec(&map->refcnt);
		return ERR_PTR(-EBUSY);
	}
313 314
	if (uref)
		atomic_inc(&map->usercnt);
A
Alexei Starovoitov 已提交
315
	return map;
316 317 318
}

struct bpf_map *bpf_map_get_with_uref(u32 ufd)
319 320 321 322 323 324 325 326
{
	struct fd f = fdget(ufd);
	struct bpf_map *map;

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

A
Alexei Starovoitov 已提交
327
	map = bpf_map_inc(map, true);
328
	fdput(f);
329 330 331 332

	return map;
}

333 334 335 336 337
int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
{
	return -ENOTSUPP;
}

338 339 340 341 342
/* 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 已提交
343 344
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
345 346
	int ufd = attr->map_fd;
	struct bpf_map *map;
347
	void *key, *value, *ptr;
348
	u32 value_size;
349
	struct fd f;
350 351 352 353 354
	int err;

	if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
		return -EINVAL;

355
	f = fdget(ufd);
356
	map = __bpf_map_get(f);
357 358 359 360 361 362 363 364 365 366 367 368
	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;

369
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
370
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
371 372 373 374 375
	    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;

376
	err = -ENOMEM;
377
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
378
	if (!value)
379 380
		goto free_key;

381 382
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
383 384 385
		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);
386 387
	} else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
		err = bpf_stackmap_copy(map, key, value);
M
Martin KaFai Lau 已提交
388 389
	} else if (map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS ||
		   map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
390
		err = -ENOTSUPP;
391 392 393 394 395 396 397 398
	} 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;
	}
399

400
	if (err)
401
		goto free_value;
402 403

	err = -EFAULT;
404
	if (copy_to_user(uvalue, value, value_size) != 0)
405
		goto free_value;
406

407
	trace_bpf_map_lookup_elem(map, ufd, key, value);
408 409
	err = 0;

410 411
free_value:
	kfree(value);
412 413 414 415 416 417 418
free_key:
	kfree(key);
err_put:
	fdput(f);
	return err;
}

419
#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
420 421 422

static int map_update_elem(union bpf_attr *attr)
{
M
Mickaël Salaün 已提交
423 424
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *uvalue = u64_to_user_ptr(attr->value);
425 426 427
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *value;
428
	u32 value_size;
429
	struct fd f;
430 431 432 433 434
	int err;

	if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
		return -EINVAL;

435
	f = fdget(ufd);
436
	map = __bpf_map_get(f);
437 438 439 440 441 442 443 444 445 446 447 448
	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;

449
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
450
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
451 452 453 454 455
	    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;

456
	err = -ENOMEM;
457
	value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
458 459 460 461
	if (!value)
		goto free_key;

	err = -EFAULT;
462
	if (copy_from_user(value, uvalue, value_size) != 0)
463 464
		goto free_value;

465 466 467 468 469
	/* 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);
470 471
	if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
	    map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
472 473 474
		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);
475
	} else if (map->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY ||
476
		   map->map_type == BPF_MAP_TYPE_PROG_ARRAY ||
477 478
		   map->map_type == BPF_MAP_TYPE_CGROUP_ARRAY ||
		   map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS) {
479 480 481 482
		rcu_read_lock();
		err = bpf_fd_array_map_update_elem(map, f.file, key, value,
						   attr->flags);
		rcu_read_unlock();
M
Martin KaFai Lau 已提交
483 484 485 486 487
	} 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();
488 489 490 491 492
	} else {
		rcu_read_lock();
		err = map->ops->map_update_elem(map, key, value, attr->flags);
		rcu_read_unlock();
	}
493 494
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
495

496 497
	if (!err)
		trace_bpf_map_update_elem(map, ufd, key, value);
498 499 500 501 502 503 504 505 506 507 508 509 510
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 已提交
511
	void __user *ukey = u64_to_user_ptr(attr->key);
512 513
	int ufd = attr->map_fd;
	struct bpf_map *map;
514
	struct fd f;
515 516 517 518 519 520
	void *key;
	int err;

	if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
		return -EINVAL;

521
	f = fdget(ufd);
522
	map = __bpf_map_get(f);
523 524 525 526 527 528 529 530 531 532 533 534
	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;

535 536
	preempt_disable();
	__this_cpu_inc(bpf_prog_active);
537 538 539
	rcu_read_lock();
	err = map->ops->map_delete_elem(map, key);
	rcu_read_unlock();
540 541
	__this_cpu_dec(bpf_prog_active);
	preempt_enable();
542

543 544
	if (!err)
		trace_bpf_map_delete_elem(map, ufd, key);
545 546 547 548 549 550 551 552 553 554 555 556
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 已提交
557 558
	void __user *ukey = u64_to_user_ptr(attr->key);
	void __user *unext_key = u64_to_user_ptr(attr->next_key);
559 560 561
	int ufd = attr->map_fd;
	struct bpf_map *map;
	void *key, *next_key;
562
	struct fd f;
563 564 565 566 567
	int err;

	if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
		return -EINVAL;

568
	f = fdget(ufd);
569
	map = __bpf_map_get(f);
570 571 572
	if (IS_ERR(map))
		return PTR_ERR(map);

573 574 575 576 577 578 579 580 581 582 583 584
	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;
	}
585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600

	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;

601
	trace_bpf_map_next_key(map, ufd, key, next_key);
602 603 604 605 606 607 608 609 610 611 612
	err = 0;

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

613 614 615
static const struct bpf_verifier_ops * const bpf_prog_types[] = {
#define BPF_PROG_TYPE(_id, _ops) \
	[_id] = &_ops,
616
#define BPF_MAP_TYPE(_id, _ops)
617 618
#include <linux/bpf_types.h>
#undef BPF_PROG_TYPE
619
#undef BPF_MAP_TYPE
620
};
621 622 623

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

627 628 629
	prog->aux->ops = bpf_prog_types[type];
	prog->type = type;
	return 0;
630 631 632 633 634 635 636 637 638 639 640 641 642
}

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

643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664
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);
}

665 666 667
static int bpf_prog_charge_memlock(struct bpf_prog *prog)
{
	struct user_struct *user = get_current_user();
668
	int ret;
669

670 671
	ret = __bpf_prog_charge(user, prog->pages);
	if (ret) {
672
		free_uid(user);
673
		return ret;
674
	}
675

676 677 678 679 680 681 682 683
	prog->aux->user = user;
	return 0;
}

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

684
	__bpf_prog_uncharge(user, prog->pages);
685 686 687
	free_uid(user);
}

M
Martin KaFai Lau 已提交
688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715
static int bpf_prog_alloc_id(struct bpf_prog *prog)
{
	int id;

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

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

	return id > 0 ? 0 : id;
}

static void bpf_prog_free_id(struct bpf_prog *prog)
{
	/* cBPF to eBPF migrations are currently not in the idr store. */
	if (!prog->aux->id)
		return;

	spin_lock_bh(&prog_idr_lock);
	idr_remove(&prog_idr, prog->aux->id);
	spin_unlock_bh(&prog_idr_lock);
}

716
static void __bpf_prog_put_rcu(struct rcu_head *rcu)
717 718 719 720
{
	struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);

	free_used_maps(aux);
721
	bpf_prog_uncharge_memlock(aux->prog);
722 723 724
	bpf_prog_free(aux->prog);
}

725 726
void bpf_prog_put(struct bpf_prog *prog)
{
727 728
	if (atomic_dec_and_test(&prog->aux->refcnt)) {
		trace_bpf_prog_put_rcu(prog);
M
Martin KaFai Lau 已提交
729
		bpf_prog_free_id(prog);
730
		bpf_prog_kallsyms_del(prog);
731
		call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
732
	}
733
}
734
EXPORT_SYMBOL_GPL(bpf_prog_put);
735 736 737 738 739

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

740
	bpf_prog_put(prog);
741 742 743
	return 0;
}

744 745 746 747
#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;
748
	char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
749

750
	bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
751 752 753
	seq_printf(m,
		   "prog_type:\t%u\n"
		   "prog_jited:\t%u\n"
754
		   "prog_tag:\t%s\n"
755 756 757
		   "memlock:\t%llu\n",
		   prog->type,
		   prog->jited,
758
		   prog_tag,
759 760 761 762
		   prog->pages * 1ULL << PAGE_SHIFT);
}
#endif

763
static const struct file_operations bpf_prog_fops = {
764 765 766 767
#ifdef CONFIG_PROC_FS
	.show_fdinfo	= bpf_prog_show_fdinfo,
#endif
	.release	= bpf_prog_release,
768 769
};

770
int bpf_prog_new_fd(struct bpf_prog *prog)
771 772 773 774 775
{
	return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
				O_RDWR | O_CLOEXEC);
}

776
static struct bpf_prog *____bpf_prog_get(struct fd f)
777 778 779 780 781 782 783 784
{
	if (!f.file)
		return ERR_PTR(-EBADF);
	if (f.file->f_op != &bpf_prog_fops) {
		fdput(f);
		return ERR_PTR(-EINVAL);
	}

785
	return f.file->private_data;
786 787
}

788
struct bpf_prog *bpf_prog_add(struct bpf_prog *prog, int i)
A
Alexei Starovoitov 已提交
789
{
790 791
	if (atomic_add_return(i, &prog->aux->refcnt) > BPF_MAX_REFCNT) {
		atomic_sub(i, &prog->aux->refcnt);
A
Alexei Starovoitov 已提交
792 793 794 795
		return ERR_PTR(-EBUSY);
	}
	return prog;
}
796 797
EXPORT_SYMBOL_GPL(bpf_prog_add);

798 799 800 801 802 803 804 805 806 807 808
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);

809 810 811 812
struct bpf_prog *bpf_prog_inc(struct bpf_prog *prog)
{
	return bpf_prog_add(prog, 1);
}
813
EXPORT_SYMBOL_GPL(bpf_prog_inc);
A
Alexei Starovoitov 已提交
814

815
static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *type)
816 817 818 819
{
	struct fd f = fdget(ufd);
	struct bpf_prog *prog;

820
	prog = ____bpf_prog_get(f);
821 822
	if (IS_ERR(prog))
		return prog;
823 824 825 826
	if (type && prog->type != *type) {
		prog = ERR_PTR(-EINVAL);
		goto out;
	}
827

A
Alexei Starovoitov 已提交
828
	prog = bpf_prog_inc(prog);
829
out:
830 831 832
	fdput(f);
	return prog;
}
833 834 835 836 837 838 839 840

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)
{
841 842 843 844 845
	struct bpf_prog *prog = __bpf_prog_get(ufd, &type);

	if (!IS_ERR(prog))
		trace_bpf_prog_get_type(prog);
	return prog;
846 847
}
EXPORT_SYMBOL_GPL(bpf_prog_get_type);
848 849

/* last field in 'union bpf_attr' used by this command */
850
#define	BPF_PROG_LOAD_LAST_FIELD prog_flags
851 852 853 854 855 856 857 858 859 860 861 862

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;

863 864 865
	if (attr->prog_flags & ~BPF_F_STRICT_ALIGNMENT)
		return -EINVAL;

866
	/* copy eBPF program license from user space */
M
Mickaël Salaün 已提交
867
	if (strncpy_from_user(license, u64_to_user_ptr(attr->license),
868 869 870 871 872 873 874
			      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);

875 876
	if (attr->insn_cnt == 0 || attr->insn_cnt > BPF_MAXINSNS)
		return -E2BIG;
877

878 879 880 881
	if (type == BPF_PROG_TYPE_KPROBE &&
	    attr->kern_version != LINUX_VERSION_CODE)
		return -EINVAL;

882 883 884
	if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
	    type != BPF_PROG_TYPE_CGROUP_SKB &&
	    !capable(CAP_SYS_ADMIN))
885 886
		return -EPERM;

887 888 889 890 891
	/* plain bpf_prog allocation */
	prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
	if (!prog)
		return -ENOMEM;

892 893 894 895
	err = bpf_prog_charge_memlock(prog);
	if (err)
		goto free_prog_nouncharge;

896 897 898
	prog->len = attr->insn_cnt;

	err = -EFAULT;
M
Mickaël Salaün 已提交
899
	if (copy_from_user(prog->insns, u64_to_user_ptr(attr->insns),
900
			   bpf_prog_insn_size(prog)) != 0)
901 902 903
		goto free_prog;

	prog->orig_prog = NULL;
904
	prog->jited = 0;
905 906

	atomic_set(&prog->aux->refcnt, 1);
907
	prog->gpl_compatible = is_gpl ? 1 : 0;
908 909 910 911 912 913 914

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

	/* run eBPF verifier */
915
	err = bpf_check(&prog, attr);
916 917 918 919
	if (err < 0)
		goto free_used_maps;

	/* eBPF program is ready to be JITed */
920
	prog = bpf_prog_select_runtime(prog, &err);
921 922
	if (err < 0)
		goto free_used_maps;
923

M
Martin KaFai Lau 已提交
924 925 926 927
	err = bpf_prog_alloc_id(prog);
	if (err)
		goto free_used_maps;

928
	err = bpf_prog_new_fd(prog);
929 930
	if (err < 0)
		/* failed to allocate fd */
M
Martin KaFai Lau 已提交
931
		goto free_id;
932

933
	bpf_prog_kallsyms_add(prog);
934
	trace_bpf_prog_load(prog, err);
935 936
	return err;

M
Martin KaFai Lau 已提交
937 938
free_id:
	bpf_prog_free_id(prog);
939 940 941
free_used_maps:
	free_used_maps(prog->aux);
free_prog:
942 943
	bpf_prog_uncharge_memlock(prog);
free_prog_nouncharge:
944 945 946 947
	bpf_prog_free(prog);
	return err;
}

948 949 950 951 952 953 954
#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 已提交
955
	return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
956 957 958 959 960 961 962
}

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 已提交
963
	return bpf_obj_get_user(u64_to_user_ptr(attr->pathname));
964 965
}

966 967
#ifdef CONFIG_CGROUP_BPF

968
#define BPF_PROG_ATTACH_LAST_FIELD attach_flags
969 970 971

static int bpf_prog_attach(const union bpf_attr *attr)
{
972
	enum bpf_prog_type ptype;
973 974
	struct bpf_prog *prog;
	struct cgroup *cgrp;
975
	int ret;
976 977 978 979 980 981 982

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

	if (CHECK_ATTR(BPF_PROG_ATTACH))
		return -EINVAL;

983 984 985
	if (attr->attach_flags & ~BPF_F_ALLOW_OVERRIDE)
		return -EINVAL;

986 987 988
	switch (attr->attach_type) {
	case BPF_CGROUP_INET_INGRESS:
	case BPF_CGROUP_INET_EGRESS:
989
		ptype = BPF_PROG_TYPE_CGROUP_SKB;
990
		break;
991 992 993
	case BPF_CGROUP_INET_SOCK_CREATE:
		ptype = BPF_PROG_TYPE_CGROUP_SOCK;
		break;
994 995 996 997
	default:
		return -EINVAL;
	}

998 999 1000 1001 1002 1003 1004 1005 1006 1007
	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);
	}

1008 1009 1010 1011
	ret = cgroup_bpf_update(cgrp, prog, attr->attach_type,
				attr->attach_flags & BPF_F_ALLOW_OVERRIDE);
	if (ret)
		bpf_prog_put(prog);
1012 1013
	cgroup_put(cgrp);

1014
	return ret;
1015 1016 1017 1018 1019 1020 1021
}

#define BPF_PROG_DETACH_LAST_FIELD attach_type

static int bpf_prog_detach(const union bpf_attr *attr)
{
	struct cgroup *cgrp;
1022
	int ret;
1023 1024 1025 1026 1027 1028 1029 1030 1031 1032

	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:
1033
	case BPF_CGROUP_INET_SOCK_CREATE:
1034 1035 1036 1037
		cgrp = cgroup_get_from_fd(attr->target_fd);
		if (IS_ERR(cgrp))
			return PTR_ERR(cgrp);

1038
		ret = cgroup_bpf_update(cgrp, NULL, attr->attach_type, false);
1039 1040 1041 1042 1043 1044 1045
		cgroup_put(cgrp);
		break;

	default:
		return -EINVAL;
	}

1046
	return ret;
1047 1048 1049
}
#endif /* CONFIG_CGROUP_BPF */

1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071
#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;
}

1072 1073 1074 1075 1076
SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
{
	union bpf_attr attr = {};
	int err;

1077
	if (!capable(CAP_SYS_ADMIN) && sysctl_unprivileged_bpf_disabled)
1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116
		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;
1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128
	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;
1129 1130 1131
	case BPF_PROG_LOAD:
		err = bpf_prog_load(&attr);
		break;
1132 1133 1134 1135 1136 1137
	case BPF_OBJ_PIN:
		err = bpf_obj_pin(&attr);
		break;
	case BPF_OBJ_GET:
		err = bpf_obj_get(&attr);
		break;
1138 1139 1140 1141 1142 1143 1144 1145
#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
1146 1147 1148
	case BPF_PROG_TEST_RUN:
		err = bpf_prog_test_run(&attr, uattr);
		break;
1149 1150 1151 1152 1153 1154 1155
	default:
		err = -EINVAL;
		break;
	}

	return err;
}