Loading...
1// SPDX-License-Identifier: GPL-2.0-only
2/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3 */
4#include <linux/bpf.h>
5#include <linux/bpf-cgroup.h>
6#include <linux/bpf_trace.h>
7#include <linux/bpf_lirc.h>
8#include <linux/bpf_verifier.h>
9#include <linux/bsearch.h>
10#include <linux/btf.h>
11#include <linux/syscalls.h>
12#include <linux/slab.h>
13#include <linux/sched/signal.h>
14#include <linux/vmalloc.h>
15#include <linux/mmzone.h>
16#include <linux/anon_inodes.h>
17#include <linux/fdtable.h>
18#include <linux/file.h>
19#include <linux/fs.h>
20#include <linux/license.h>
21#include <linux/filter.h>
22#include <linux/kernel.h>
23#include <linux/idr.h>
24#include <linux/cred.h>
25#include <linux/timekeeping.h>
26#include <linux/ctype.h>
27#include <linux/nospec.h>
28#include <linux/audit.h>
29#include <uapi/linux/btf.h>
30#include <linux/pgtable.h>
31#include <linux/bpf_lsm.h>
32#include <linux/poll.h>
33#include <linux/sort.h>
34#include <linux/bpf-netns.h>
35#include <linux/rcupdate_trace.h>
36#include <linux/memcontrol.h>
37#include <linux/trace_events.h>
38
39#include <net/netfilter/nf_bpf_link.h>
40#include <net/netkit.h>
41#include <net/tcx.h>
42
43#define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
44 (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
45 (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
46#define IS_FD_PROG_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)
47#define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
48#define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \
49 IS_FD_HASH(map))
50
51#define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
52
53DEFINE_PER_CPU(int, bpf_prog_active);
54static DEFINE_IDR(prog_idr);
55static DEFINE_SPINLOCK(prog_idr_lock);
56static DEFINE_IDR(map_idr);
57static DEFINE_SPINLOCK(map_idr_lock);
58static DEFINE_IDR(link_idr);
59static DEFINE_SPINLOCK(link_idr_lock);
60
61int sysctl_unprivileged_bpf_disabled __read_mostly =
62 IS_BUILTIN(CONFIG_BPF_UNPRIV_DEFAULT_OFF) ? 2 : 0;
63
64static const struct bpf_map_ops * const bpf_map_types[] = {
65#define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type)
66#define BPF_MAP_TYPE(_id, _ops) \
67 [_id] = &_ops,
68#define BPF_LINK_TYPE(_id, _name)
69#include <linux/bpf_types.h>
70#undef BPF_PROG_TYPE
71#undef BPF_MAP_TYPE
72#undef BPF_LINK_TYPE
73};
74
75/*
76 * If we're handed a bigger struct than we know of, ensure all the unknown bits
77 * are 0 - i.e. new user-space does not rely on any kernel feature extensions
78 * we don't know about yet.
79 *
80 * There is a ToCToU between this function call and the following
81 * copy_from_user() call. However, this is not a concern since this function is
82 * meant to be a future-proofing of bits.
83 */
84int bpf_check_uarg_tail_zero(bpfptr_t uaddr,
85 size_t expected_size,
86 size_t actual_size)
87{
88 int res;
89
90 if (unlikely(actual_size > PAGE_SIZE)) /* silly large */
91 return -E2BIG;
92
93 if (actual_size <= expected_size)
94 return 0;
95
96 if (uaddr.is_kernel)
97 res = memchr_inv(uaddr.kernel + expected_size, 0,
98 actual_size - expected_size) == NULL;
99 else
100 res = check_zeroed_user(uaddr.user + expected_size,
101 actual_size - expected_size);
102 if (res < 0)
103 return res;
104 return res ? 0 : -E2BIG;
105}
106
107const struct bpf_map_ops bpf_map_offload_ops = {
108 .map_meta_equal = bpf_map_meta_equal,
109 .map_alloc = bpf_map_offload_map_alloc,
110 .map_free = bpf_map_offload_map_free,
111 .map_check_btf = map_check_no_btf,
112 .map_mem_usage = bpf_map_offload_map_mem_usage,
113};
114
115static void bpf_map_write_active_inc(struct bpf_map *map)
116{
117 atomic64_inc(&map->writecnt);
118}
119
120static void bpf_map_write_active_dec(struct bpf_map *map)
121{
122 atomic64_dec(&map->writecnt);
123}
124
125bool bpf_map_write_active(const struct bpf_map *map)
126{
127 return atomic64_read(&map->writecnt) != 0;
128}
129
130static u32 bpf_map_value_size(const struct bpf_map *map)
131{
132 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
133 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
134 map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
135 map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
136 return round_up(map->value_size, 8) * num_possible_cpus();
137 else if (IS_FD_MAP(map))
138 return sizeof(u32);
139 else
140 return map->value_size;
141}
142
143static void maybe_wait_bpf_programs(struct bpf_map *map)
144{
145 /* Wait for any running non-sleepable BPF programs to complete so that
146 * userspace, when we return to it, knows that all non-sleepable
147 * programs that could be running use the new map value. For sleepable
148 * BPF programs, synchronize_rcu_tasks_trace() should be used to wait
149 * for the completions of these programs, but considering the waiting
150 * time can be very long and userspace may think it will hang forever,
151 * so don't handle sleepable BPF programs now.
152 */
153 if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS ||
154 map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
155 synchronize_rcu();
156}
157
158static int bpf_map_update_value(struct bpf_map *map, struct file *map_file,
159 void *key, void *value, __u64 flags)
160{
161 int err;
162
163 /* Need to create a kthread, thus must support schedule */
164 if (bpf_map_is_offloaded(map)) {
165 return bpf_map_offload_update_elem(map, key, value, flags);
166 } else if (map->map_type == BPF_MAP_TYPE_CPUMAP ||
167 map->map_type == BPF_MAP_TYPE_ARENA ||
168 map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
169 return map->ops->map_update_elem(map, key, value, flags);
170 } else if (map->map_type == BPF_MAP_TYPE_SOCKHASH ||
171 map->map_type == BPF_MAP_TYPE_SOCKMAP) {
172 return sock_map_update_elem_sys(map, key, value, flags);
173 } else if (IS_FD_PROG_ARRAY(map)) {
174 return bpf_fd_array_map_update_elem(map, map_file, key, value,
175 flags);
176 }
177
178 bpf_disable_instrumentation();
179 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
180 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
181 err = bpf_percpu_hash_update(map, key, value, flags);
182 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
183 err = bpf_percpu_array_update(map, key, value, flags);
184 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
185 err = bpf_percpu_cgroup_storage_update(map, key, value,
186 flags);
187 } else if (IS_FD_ARRAY(map)) {
188 err = bpf_fd_array_map_update_elem(map, map_file, key, value,
189 flags);
190 } else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
191 err = bpf_fd_htab_map_update_elem(map, map_file, key, value,
192 flags);
193 } else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
194 /* rcu_read_lock() is not needed */
195 err = bpf_fd_reuseport_array_update_elem(map, key, value,
196 flags);
197 } else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
198 map->map_type == BPF_MAP_TYPE_STACK ||
199 map->map_type == BPF_MAP_TYPE_BLOOM_FILTER) {
200 err = map->ops->map_push_elem(map, value, flags);
201 } else {
202 rcu_read_lock();
203 err = map->ops->map_update_elem(map, key, value, flags);
204 rcu_read_unlock();
205 }
206 bpf_enable_instrumentation();
207
208 return err;
209}
210
211static int bpf_map_copy_value(struct bpf_map *map, void *key, void *value,
212 __u64 flags)
213{
214 void *ptr;
215 int err;
216
217 if (bpf_map_is_offloaded(map))
218 return bpf_map_offload_lookup_elem(map, key, value);
219
220 bpf_disable_instrumentation();
221 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
222 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
223 err = bpf_percpu_hash_copy(map, key, value);
224 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
225 err = bpf_percpu_array_copy(map, key, value);
226 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
227 err = bpf_percpu_cgroup_storage_copy(map, key, value);
228 } else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
229 err = bpf_stackmap_copy(map, key, value);
230 } else if (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map)) {
231 err = bpf_fd_array_map_lookup_elem(map, key, value);
232 } else if (IS_FD_HASH(map)) {
233 err = bpf_fd_htab_map_lookup_elem(map, key, value);
234 } else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
235 err = bpf_fd_reuseport_array_lookup_elem(map, key, value);
236 } else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
237 map->map_type == BPF_MAP_TYPE_STACK ||
238 map->map_type == BPF_MAP_TYPE_BLOOM_FILTER) {
239 err = map->ops->map_peek_elem(map, value);
240 } else if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
241 /* struct_ops map requires directly updating "value" */
242 err = bpf_struct_ops_map_sys_lookup_elem(map, key, value);
243 } else {
244 rcu_read_lock();
245 if (map->ops->map_lookup_elem_sys_only)
246 ptr = map->ops->map_lookup_elem_sys_only(map, key);
247 else
248 ptr = map->ops->map_lookup_elem(map, key);
249 if (IS_ERR(ptr)) {
250 err = PTR_ERR(ptr);
251 } else if (!ptr) {
252 err = -ENOENT;
253 } else {
254 err = 0;
255 if (flags & BPF_F_LOCK)
256 /* lock 'ptr' and copy everything but lock */
257 copy_map_value_locked(map, value, ptr, true);
258 else
259 copy_map_value(map, value, ptr);
260 /* mask lock and timer, since value wasn't zero inited */
261 check_and_init_map_value(map, value);
262 }
263 rcu_read_unlock();
264 }
265
266 bpf_enable_instrumentation();
267
268 return err;
269}
270
271/* Please, do not use this function outside from the map creation path
272 * (e.g. in map update path) without taking care of setting the active
273 * memory cgroup (see at bpf_map_kmalloc_node() for example).
274 */
275static void *__bpf_map_area_alloc(u64 size, int numa_node, bool mmapable)
276{
277 /* We really just want to fail instead of triggering OOM killer
278 * under memory pressure, therefore we set __GFP_NORETRY to kmalloc,
279 * which is used for lower order allocation requests.
280 *
281 * It has been observed that higher order allocation requests done by
282 * vmalloc with __GFP_NORETRY being set might fail due to not trying
283 * to reclaim memory from the page cache, thus we set
284 * __GFP_RETRY_MAYFAIL to avoid such situations.
285 */
286
287 gfp_t gfp = bpf_memcg_flags(__GFP_NOWARN | __GFP_ZERO);
288 unsigned int flags = 0;
289 unsigned long align = 1;
290 void *area;
291
292 if (size >= SIZE_MAX)
293 return NULL;
294
295 /* kmalloc()'ed memory can't be mmap()'ed */
296 if (mmapable) {
297 BUG_ON(!PAGE_ALIGNED(size));
298 align = SHMLBA;
299 flags = VM_USERMAP;
300 } else if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
301 area = kmalloc_node(size, gfp | GFP_USER | __GFP_NORETRY,
302 numa_node);
303 if (area != NULL)
304 return area;
305 }
306
307 return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END,
308 gfp | GFP_KERNEL | __GFP_RETRY_MAYFAIL, PAGE_KERNEL,
309 flags, numa_node, __builtin_return_address(0));
310}
311
312void *bpf_map_area_alloc(u64 size, int numa_node)
313{
314 return __bpf_map_area_alloc(size, numa_node, false);
315}
316
317void *bpf_map_area_mmapable_alloc(u64 size, int numa_node)
318{
319 return __bpf_map_area_alloc(size, numa_node, true);
320}
321
322void bpf_map_area_free(void *area)
323{
324 kvfree(area);
325}
326
327static u32 bpf_map_flags_retain_permanent(u32 flags)
328{
329 /* Some map creation flags are not tied to the map object but
330 * rather to the map fd instead, so they have no meaning upon
331 * map object inspection since multiple file descriptors with
332 * different (access) properties can exist here. Thus, given
333 * this has zero meaning for the map itself, lets clear these
334 * from here.
335 */
336 return flags & ~(BPF_F_RDONLY | BPF_F_WRONLY);
337}
338
339void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
340{
341 map->map_type = attr->map_type;
342 map->key_size = attr->key_size;
343 map->value_size = attr->value_size;
344 map->max_entries = attr->max_entries;
345 map->map_flags = bpf_map_flags_retain_permanent(attr->map_flags);
346 map->numa_node = bpf_map_attr_numa_node(attr);
347 map->map_extra = attr->map_extra;
348}
349
350static int bpf_map_alloc_id(struct bpf_map *map)
351{
352 int id;
353
354 idr_preload(GFP_KERNEL);
355 spin_lock_bh(&map_idr_lock);
356 id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
357 if (id > 0)
358 map->id = id;
359 spin_unlock_bh(&map_idr_lock);
360 idr_preload_end();
361
362 if (WARN_ON_ONCE(!id))
363 return -ENOSPC;
364
365 return id > 0 ? 0 : id;
366}
367
368void bpf_map_free_id(struct bpf_map *map)
369{
370 unsigned long flags;
371
372 /* Offloaded maps are removed from the IDR store when their device
373 * disappears - even if someone holds an fd to them they are unusable,
374 * the memory is gone, all ops will fail; they are simply waiting for
375 * refcnt to drop to be freed.
376 */
377 if (!map->id)
378 return;
379
380 spin_lock_irqsave(&map_idr_lock, flags);
381
382 idr_remove(&map_idr, map->id);
383 map->id = 0;
384
385 spin_unlock_irqrestore(&map_idr_lock, flags);
386}
387
388#ifdef CONFIG_MEMCG_KMEM
389static void bpf_map_save_memcg(struct bpf_map *map)
390{
391 /* Currently if a map is created by a process belonging to the root
392 * memory cgroup, get_obj_cgroup_from_current() will return NULL.
393 * So we have to check map->objcg for being NULL each time it's
394 * being used.
395 */
396 if (memcg_bpf_enabled())
397 map->objcg = get_obj_cgroup_from_current();
398}
399
400static void bpf_map_release_memcg(struct bpf_map *map)
401{
402 if (map->objcg)
403 obj_cgroup_put(map->objcg);
404}
405
406static struct mem_cgroup *bpf_map_get_memcg(const struct bpf_map *map)
407{
408 if (map->objcg)
409 return get_mem_cgroup_from_objcg(map->objcg);
410
411 return root_mem_cgroup;
412}
413
414void *bpf_map_kmalloc_node(const struct bpf_map *map, size_t size, gfp_t flags,
415 int node)
416{
417 struct mem_cgroup *memcg, *old_memcg;
418 void *ptr;
419
420 memcg = bpf_map_get_memcg(map);
421 old_memcg = set_active_memcg(memcg);
422 ptr = kmalloc_node(size, flags | __GFP_ACCOUNT, node);
423 set_active_memcg(old_memcg);
424 mem_cgroup_put(memcg);
425
426 return ptr;
427}
428
429void *bpf_map_kzalloc(const struct bpf_map *map, size_t size, gfp_t flags)
430{
431 struct mem_cgroup *memcg, *old_memcg;
432 void *ptr;
433
434 memcg = bpf_map_get_memcg(map);
435 old_memcg = set_active_memcg(memcg);
436 ptr = kzalloc(size, flags | __GFP_ACCOUNT);
437 set_active_memcg(old_memcg);
438 mem_cgroup_put(memcg);
439
440 return ptr;
441}
442
443void *bpf_map_kvcalloc(struct bpf_map *map, size_t n, size_t size,
444 gfp_t flags)
445{
446 struct mem_cgroup *memcg, *old_memcg;
447 void *ptr;
448
449 memcg = bpf_map_get_memcg(map);
450 old_memcg = set_active_memcg(memcg);
451 ptr = kvcalloc(n, size, flags | __GFP_ACCOUNT);
452 set_active_memcg(old_memcg);
453 mem_cgroup_put(memcg);
454
455 return ptr;
456}
457
458void __percpu *bpf_map_alloc_percpu(const struct bpf_map *map, size_t size,
459 size_t align, gfp_t flags)
460{
461 struct mem_cgroup *memcg, *old_memcg;
462 void __percpu *ptr;
463
464 memcg = bpf_map_get_memcg(map);
465 old_memcg = set_active_memcg(memcg);
466 ptr = __alloc_percpu_gfp(size, align, flags | __GFP_ACCOUNT);
467 set_active_memcg(old_memcg);
468 mem_cgroup_put(memcg);
469
470 return ptr;
471}
472
473#else
474static void bpf_map_save_memcg(struct bpf_map *map)
475{
476}
477
478static void bpf_map_release_memcg(struct bpf_map *map)
479{
480}
481#endif
482
483int bpf_map_alloc_pages(const struct bpf_map *map, gfp_t gfp, int nid,
484 unsigned long nr_pages, struct page **pages)
485{
486 unsigned long i, j;
487 struct page *pg;
488 int ret = 0;
489#ifdef CONFIG_MEMCG_KMEM
490 struct mem_cgroup *memcg, *old_memcg;
491
492 memcg = bpf_map_get_memcg(map);
493 old_memcg = set_active_memcg(memcg);
494#endif
495 for (i = 0; i < nr_pages; i++) {
496 pg = alloc_pages_node(nid, gfp | __GFP_ACCOUNT, 0);
497
498 if (pg) {
499 pages[i] = pg;
500 continue;
501 }
502 for (j = 0; j < i; j++)
503 __free_page(pages[j]);
504 ret = -ENOMEM;
505 break;
506 }
507
508#ifdef CONFIG_MEMCG_KMEM
509 set_active_memcg(old_memcg);
510 mem_cgroup_put(memcg);
511#endif
512 return ret;
513}
514
515
516static int btf_field_cmp(const void *a, const void *b)
517{
518 const struct btf_field *f1 = a, *f2 = b;
519
520 if (f1->offset < f2->offset)
521 return -1;
522 else if (f1->offset > f2->offset)
523 return 1;
524 return 0;
525}
526
527struct btf_field *btf_record_find(const struct btf_record *rec, u32 offset,
528 u32 field_mask)
529{
530 struct btf_field *field;
531
532 if (IS_ERR_OR_NULL(rec) || !(rec->field_mask & field_mask))
533 return NULL;
534 field = bsearch(&offset, rec->fields, rec->cnt, sizeof(rec->fields[0]), btf_field_cmp);
535 if (!field || !(field->type & field_mask))
536 return NULL;
537 return field;
538}
539
540void btf_record_free(struct btf_record *rec)
541{
542 int i;
543
544 if (IS_ERR_OR_NULL(rec))
545 return;
546 for (i = 0; i < rec->cnt; i++) {
547 switch (rec->fields[i].type) {
548 case BPF_KPTR_UNREF:
549 case BPF_KPTR_REF:
550 case BPF_KPTR_PERCPU:
551 if (rec->fields[i].kptr.module)
552 module_put(rec->fields[i].kptr.module);
553 btf_put(rec->fields[i].kptr.btf);
554 break;
555 case BPF_LIST_HEAD:
556 case BPF_LIST_NODE:
557 case BPF_RB_ROOT:
558 case BPF_RB_NODE:
559 case BPF_SPIN_LOCK:
560 case BPF_TIMER:
561 case BPF_REFCOUNT:
562 /* Nothing to release */
563 break;
564 default:
565 WARN_ON_ONCE(1);
566 continue;
567 }
568 }
569 kfree(rec);
570}
571
572void bpf_map_free_record(struct bpf_map *map)
573{
574 btf_record_free(map->record);
575 map->record = NULL;
576}
577
578struct btf_record *btf_record_dup(const struct btf_record *rec)
579{
580 const struct btf_field *fields;
581 struct btf_record *new_rec;
582 int ret, size, i;
583
584 if (IS_ERR_OR_NULL(rec))
585 return NULL;
586 size = offsetof(struct btf_record, fields[rec->cnt]);
587 new_rec = kmemdup(rec, size, GFP_KERNEL | __GFP_NOWARN);
588 if (!new_rec)
589 return ERR_PTR(-ENOMEM);
590 /* Do a deep copy of the btf_record */
591 fields = rec->fields;
592 new_rec->cnt = 0;
593 for (i = 0; i < rec->cnt; i++) {
594 switch (fields[i].type) {
595 case BPF_KPTR_UNREF:
596 case BPF_KPTR_REF:
597 case BPF_KPTR_PERCPU:
598 btf_get(fields[i].kptr.btf);
599 if (fields[i].kptr.module && !try_module_get(fields[i].kptr.module)) {
600 ret = -ENXIO;
601 goto free;
602 }
603 break;
604 case BPF_LIST_HEAD:
605 case BPF_LIST_NODE:
606 case BPF_RB_ROOT:
607 case BPF_RB_NODE:
608 case BPF_SPIN_LOCK:
609 case BPF_TIMER:
610 case BPF_REFCOUNT:
611 /* Nothing to acquire */
612 break;
613 default:
614 ret = -EFAULT;
615 WARN_ON_ONCE(1);
616 goto free;
617 }
618 new_rec->cnt++;
619 }
620 return new_rec;
621free:
622 btf_record_free(new_rec);
623 return ERR_PTR(ret);
624}
625
626bool btf_record_equal(const struct btf_record *rec_a, const struct btf_record *rec_b)
627{
628 bool a_has_fields = !IS_ERR_OR_NULL(rec_a), b_has_fields = !IS_ERR_OR_NULL(rec_b);
629 int size;
630
631 if (!a_has_fields && !b_has_fields)
632 return true;
633 if (a_has_fields != b_has_fields)
634 return false;
635 if (rec_a->cnt != rec_b->cnt)
636 return false;
637 size = offsetof(struct btf_record, fields[rec_a->cnt]);
638 /* btf_parse_fields uses kzalloc to allocate a btf_record, so unused
639 * members are zeroed out. So memcmp is safe to do without worrying
640 * about padding/unused fields.
641 *
642 * While spin_lock, timer, and kptr have no relation to map BTF,
643 * list_head metadata is specific to map BTF, the btf and value_rec
644 * members in particular. btf is the map BTF, while value_rec points to
645 * btf_record in that map BTF.
646 *
647 * So while by default, we don't rely on the map BTF (which the records
648 * were parsed from) matching for both records, which is not backwards
649 * compatible, in case list_head is part of it, we implicitly rely on
650 * that by way of depending on memcmp succeeding for it.
651 */
652 return !memcmp(rec_a, rec_b, size);
653}
654
655void bpf_obj_free_timer(const struct btf_record *rec, void *obj)
656{
657 if (WARN_ON_ONCE(!btf_record_has_field(rec, BPF_TIMER)))
658 return;
659 bpf_timer_cancel_and_free(obj + rec->timer_off);
660}
661
662void bpf_obj_free_fields(const struct btf_record *rec, void *obj)
663{
664 const struct btf_field *fields;
665 int i;
666
667 if (IS_ERR_OR_NULL(rec))
668 return;
669 fields = rec->fields;
670 for (i = 0; i < rec->cnt; i++) {
671 struct btf_struct_meta *pointee_struct_meta;
672 const struct btf_field *field = &fields[i];
673 void *field_ptr = obj + field->offset;
674 void *xchgd_field;
675
676 switch (fields[i].type) {
677 case BPF_SPIN_LOCK:
678 break;
679 case BPF_TIMER:
680 bpf_timer_cancel_and_free(field_ptr);
681 break;
682 case BPF_KPTR_UNREF:
683 WRITE_ONCE(*(u64 *)field_ptr, 0);
684 break;
685 case BPF_KPTR_REF:
686 case BPF_KPTR_PERCPU:
687 xchgd_field = (void *)xchg((unsigned long *)field_ptr, 0);
688 if (!xchgd_field)
689 break;
690
691 if (!btf_is_kernel(field->kptr.btf)) {
692 pointee_struct_meta = btf_find_struct_meta(field->kptr.btf,
693 field->kptr.btf_id);
694 migrate_disable();
695 __bpf_obj_drop_impl(xchgd_field, pointee_struct_meta ?
696 pointee_struct_meta->record : NULL,
697 fields[i].type == BPF_KPTR_PERCPU);
698 migrate_enable();
699 } else {
700 field->kptr.dtor(xchgd_field);
701 }
702 break;
703 case BPF_LIST_HEAD:
704 if (WARN_ON_ONCE(rec->spin_lock_off < 0))
705 continue;
706 bpf_list_head_free(field, field_ptr, obj + rec->spin_lock_off);
707 break;
708 case BPF_RB_ROOT:
709 if (WARN_ON_ONCE(rec->spin_lock_off < 0))
710 continue;
711 bpf_rb_root_free(field, field_ptr, obj + rec->spin_lock_off);
712 break;
713 case BPF_LIST_NODE:
714 case BPF_RB_NODE:
715 case BPF_REFCOUNT:
716 break;
717 default:
718 WARN_ON_ONCE(1);
719 continue;
720 }
721 }
722}
723
724/* called from workqueue */
725static void bpf_map_free_deferred(struct work_struct *work)
726{
727 struct bpf_map *map = container_of(work, struct bpf_map, work);
728 struct btf_record *rec = map->record;
729 struct btf *btf = map->btf;
730
731 security_bpf_map_free(map);
732 bpf_map_release_memcg(map);
733 /* implementation dependent freeing */
734 map->ops->map_free(map);
735 /* Delay freeing of btf_record for maps, as map_free
736 * callback usually needs access to them. It is better to do it here
737 * than require each callback to do the free itself manually.
738 *
739 * Note that the btf_record stashed in map->inner_map_meta->record was
740 * already freed using the map_free callback for map in map case which
741 * eventually calls bpf_map_free_meta, since inner_map_meta is only a
742 * template bpf_map struct used during verification.
743 */
744 btf_record_free(rec);
745 /* Delay freeing of btf for maps, as map_free callback may need
746 * struct_meta info which will be freed with btf_put().
747 */
748 btf_put(btf);
749}
750
751static void bpf_map_put_uref(struct bpf_map *map)
752{
753 if (atomic64_dec_and_test(&map->usercnt)) {
754 if (map->ops->map_release_uref)
755 map->ops->map_release_uref(map);
756 }
757}
758
759static void bpf_map_free_in_work(struct bpf_map *map)
760{
761 INIT_WORK(&map->work, bpf_map_free_deferred);
762 /* Avoid spawning kworkers, since they all might contend
763 * for the same mutex like slab_mutex.
764 */
765 queue_work(system_unbound_wq, &map->work);
766}
767
768static void bpf_map_free_rcu_gp(struct rcu_head *rcu)
769{
770 bpf_map_free_in_work(container_of(rcu, struct bpf_map, rcu));
771}
772
773static void bpf_map_free_mult_rcu_gp(struct rcu_head *rcu)
774{
775 if (rcu_trace_implies_rcu_gp())
776 bpf_map_free_rcu_gp(rcu);
777 else
778 call_rcu(rcu, bpf_map_free_rcu_gp);
779}
780
781/* decrement map refcnt and schedule it for freeing via workqueue
782 * (underlying map implementation ops->map_free() might sleep)
783 */
784void bpf_map_put(struct bpf_map *map)
785{
786 if (atomic64_dec_and_test(&map->refcnt)) {
787 /* bpf_map_free_id() must be called first */
788 bpf_map_free_id(map);
789
790 WARN_ON_ONCE(atomic64_read(&map->sleepable_refcnt));
791 if (READ_ONCE(map->free_after_mult_rcu_gp))
792 call_rcu_tasks_trace(&map->rcu, bpf_map_free_mult_rcu_gp);
793 else if (READ_ONCE(map->free_after_rcu_gp))
794 call_rcu(&map->rcu, bpf_map_free_rcu_gp);
795 else
796 bpf_map_free_in_work(map);
797 }
798}
799EXPORT_SYMBOL_GPL(bpf_map_put);
800
801void bpf_map_put_with_uref(struct bpf_map *map)
802{
803 bpf_map_put_uref(map);
804 bpf_map_put(map);
805}
806
807static int bpf_map_release(struct inode *inode, struct file *filp)
808{
809 struct bpf_map *map = filp->private_data;
810
811 if (map->ops->map_release)
812 map->ops->map_release(map, filp);
813
814 bpf_map_put_with_uref(map);
815 return 0;
816}
817
818static fmode_t map_get_sys_perms(struct bpf_map *map, struct fd f)
819{
820 fmode_t mode = f.file->f_mode;
821
822 /* Our file permissions may have been overridden by global
823 * map permissions facing syscall side.
824 */
825 if (READ_ONCE(map->frozen))
826 mode &= ~FMODE_CAN_WRITE;
827 return mode;
828}
829
830#ifdef CONFIG_PROC_FS
831/* Show the memory usage of a bpf map */
832static u64 bpf_map_memory_usage(const struct bpf_map *map)
833{
834 return map->ops->map_mem_usage(map);
835}
836
837static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
838{
839 struct bpf_map *map = filp->private_data;
840 u32 type = 0, jited = 0;
841
842 if (map_type_contains_progs(map)) {
843 spin_lock(&map->owner.lock);
844 type = map->owner.type;
845 jited = map->owner.jited;
846 spin_unlock(&map->owner.lock);
847 }
848
849 seq_printf(m,
850 "map_type:\t%u\n"
851 "key_size:\t%u\n"
852 "value_size:\t%u\n"
853 "max_entries:\t%u\n"
854 "map_flags:\t%#x\n"
855 "map_extra:\t%#llx\n"
856 "memlock:\t%llu\n"
857 "map_id:\t%u\n"
858 "frozen:\t%u\n",
859 map->map_type,
860 map->key_size,
861 map->value_size,
862 map->max_entries,
863 map->map_flags,
864 (unsigned long long)map->map_extra,
865 bpf_map_memory_usage(map),
866 map->id,
867 READ_ONCE(map->frozen));
868 if (type) {
869 seq_printf(m, "owner_prog_type:\t%u\n", type);
870 seq_printf(m, "owner_jited:\t%u\n", jited);
871 }
872}
873#endif
874
875static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
876 loff_t *ppos)
877{
878 /* We need this handler such that alloc_file() enables
879 * f_mode with FMODE_CAN_READ.
880 */
881 return -EINVAL;
882}
883
884static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
885 size_t siz, loff_t *ppos)
886{
887 /* We need this handler such that alloc_file() enables
888 * f_mode with FMODE_CAN_WRITE.
889 */
890 return -EINVAL;
891}
892
893/* called for any extra memory-mapped regions (except initial) */
894static void bpf_map_mmap_open(struct vm_area_struct *vma)
895{
896 struct bpf_map *map = vma->vm_file->private_data;
897
898 if (vma->vm_flags & VM_MAYWRITE)
899 bpf_map_write_active_inc(map);
900}
901
902/* called for all unmapped memory region (including initial) */
903static void bpf_map_mmap_close(struct vm_area_struct *vma)
904{
905 struct bpf_map *map = vma->vm_file->private_data;
906
907 if (vma->vm_flags & VM_MAYWRITE)
908 bpf_map_write_active_dec(map);
909}
910
911static const struct vm_operations_struct bpf_map_default_vmops = {
912 .open = bpf_map_mmap_open,
913 .close = bpf_map_mmap_close,
914};
915
916static int bpf_map_mmap(struct file *filp, struct vm_area_struct *vma)
917{
918 struct bpf_map *map = filp->private_data;
919 int err;
920
921 if (!map->ops->map_mmap || !IS_ERR_OR_NULL(map->record))
922 return -ENOTSUPP;
923
924 if (!(vma->vm_flags & VM_SHARED))
925 return -EINVAL;
926
927 mutex_lock(&map->freeze_mutex);
928
929 if (vma->vm_flags & VM_WRITE) {
930 if (map->frozen) {
931 err = -EPERM;
932 goto out;
933 }
934 /* map is meant to be read-only, so do not allow mapping as
935 * writable, because it's possible to leak a writable page
936 * reference and allows user-space to still modify it after
937 * freezing, while verifier will assume contents do not change
938 */
939 if (map->map_flags & BPF_F_RDONLY_PROG) {
940 err = -EACCES;
941 goto out;
942 }
943 }
944
945 /* set default open/close callbacks */
946 vma->vm_ops = &bpf_map_default_vmops;
947 vma->vm_private_data = map;
948 vm_flags_clear(vma, VM_MAYEXEC);
949 if (!(vma->vm_flags & VM_WRITE))
950 /* disallow re-mapping with PROT_WRITE */
951 vm_flags_clear(vma, VM_MAYWRITE);
952
953 err = map->ops->map_mmap(map, vma);
954 if (err)
955 goto out;
956
957 if (vma->vm_flags & VM_MAYWRITE)
958 bpf_map_write_active_inc(map);
959out:
960 mutex_unlock(&map->freeze_mutex);
961 return err;
962}
963
964static __poll_t bpf_map_poll(struct file *filp, struct poll_table_struct *pts)
965{
966 struct bpf_map *map = filp->private_data;
967
968 if (map->ops->map_poll)
969 return map->ops->map_poll(map, filp, pts);
970
971 return EPOLLERR;
972}
973
974static unsigned long bpf_get_unmapped_area(struct file *filp, unsigned long addr,
975 unsigned long len, unsigned long pgoff,
976 unsigned long flags)
977{
978 struct bpf_map *map = filp->private_data;
979
980 if (map->ops->map_get_unmapped_area)
981 return map->ops->map_get_unmapped_area(filp, addr, len, pgoff, flags);
982#ifdef CONFIG_MMU
983 return current->mm->get_unmapped_area(filp, addr, len, pgoff, flags);
984#else
985 return addr;
986#endif
987}
988
989const struct file_operations bpf_map_fops = {
990#ifdef CONFIG_PROC_FS
991 .show_fdinfo = bpf_map_show_fdinfo,
992#endif
993 .release = bpf_map_release,
994 .read = bpf_dummy_read,
995 .write = bpf_dummy_write,
996 .mmap = bpf_map_mmap,
997 .poll = bpf_map_poll,
998 .get_unmapped_area = bpf_get_unmapped_area,
999};
1000
1001int bpf_map_new_fd(struct bpf_map *map, int flags)
1002{
1003 int ret;
1004
1005 ret = security_bpf_map(map, OPEN_FMODE(flags));
1006 if (ret < 0)
1007 return ret;
1008
1009 return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
1010 flags | O_CLOEXEC);
1011}
1012
1013int bpf_get_file_flag(int flags)
1014{
1015 if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
1016 return -EINVAL;
1017 if (flags & BPF_F_RDONLY)
1018 return O_RDONLY;
1019 if (flags & BPF_F_WRONLY)
1020 return O_WRONLY;
1021 return O_RDWR;
1022}
1023
1024/* helper macro to check that unused fields 'union bpf_attr' are zero */
1025#define CHECK_ATTR(CMD) \
1026 memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
1027 sizeof(attr->CMD##_LAST_FIELD), 0, \
1028 sizeof(*attr) - \
1029 offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
1030 sizeof(attr->CMD##_LAST_FIELD)) != NULL
1031
1032/* dst and src must have at least "size" number of bytes.
1033 * Return strlen on success and < 0 on error.
1034 */
1035int bpf_obj_name_cpy(char *dst, const char *src, unsigned int size)
1036{
1037 const char *end = src + size;
1038 const char *orig_src = src;
1039
1040 memset(dst, 0, size);
1041 /* Copy all isalnum(), '_' and '.' chars. */
1042 while (src < end && *src) {
1043 if (!isalnum(*src) &&
1044 *src != '_' && *src != '.')
1045 return -EINVAL;
1046 *dst++ = *src++;
1047 }
1048
1049 /* No '\0' found in "size" number of bytes */
1050 if (src == end)
1051 return -EINVAL;
1052
1053 return src - orig_src;
1054}
1055
1056int map_check_no_btf(const struct bpf_map *map,
1057 const struct btf *btf,
1058 const struct btf_type *key_type,
1059 const struct btf_type *value_type)
1060{
1061 return -ENOTSUPP;
1062}
1063
1064static int map_check_btf(struct bpf_map *map, struct bpf_token *token,
1065 const struct btf *btf, u32 btf_key_id, u32 btf_value_id)
1066{
1067 const struct btf_type *key_type, *value_type;
1068 u32 key_size, value_size;
1069 int ret = 0;
1070
1071 /* Some maps allow key to be unspecified. */
1072 if (btf_key_id) {
1073 key_type = btf_type_id_size(btf, &btf_key_id, &key_size);
1074 if (!key_type || key_size != map->key_size)
1075 return -EINVAL;
1076 } else {
1077 key_type = btf_type_by_id(btf, 0);
1078 if (!map->ops->map_check_btf)
1079 return -EINVAL;
1080 }
1081
1082 value_type = btf_type_id_size(btf, &btf_value_id, &value_size);
1083 if (!value_type || value_size != map->value_size)
1084 return -EINVAL;
1085
1086 map->record = btf_parse_fields(btf, value_type,
1087 BPF_SPIN_LOCK | BPF_TIMER | BPF_KPTR | BPF_LIST_HEAD |
1088 BPF_RB_ROOT | BPF_REFCOUNT,
1089 map->value_size);
1090 if (!IS_ERR_OR_NULL(map->record)) {
1091 int i;
1092
1093 if (!bpf_token_capable(token, CAP_BPF)) {
1094 ret = -EPERM;
1095 goto free_map_tab;
1096 }
1097 if (map->map_flags & (BPF_F_RDONLY_PROG | BPF_F_WRONLY_PROG)) {
1098 ret = -EACCES;
1099 goto free_map_tab;
1100 }
1101 for (i = 0; i < sizeof(map->record->field_mask) * 8; i++) {
1102 switch (map->record->field_mask & (1 << i)) {
1103 case 0:
1104 continue;
1105 case BPF_SPIN_LOCK:
1106 if (map->map_type != BPF_MAP_TYPE_HASH &&
1107 map->map_type != BPF_MAP_TYPE_ARRAY &&
1108 map->map_type != BPF_MAP_TYPE_CGROUP_STORAGE &&
1109 map->map_type != BPF_MAP_TYPE_SK_STORAGE &&
1110 map->map_type != BPF_MAP_TYPE_INODE_STORAGE &&
1111 map->map_type != BPF_MAP_TYPE_TASK_STORAGE &&
1112 map->map_type != BPF_MAP_TYPE_CGRP_STORAGE) {
1113 ret = -EOPNOTSUPP;
1114 goto free_map_tab;
1115 }
1116 break;
1117 case BPF_TIMER:
1118 if (map->map_type != BPF_MAP_TYPE_HASH &&
1119 map->map_type != BPF_MAP_TYPE_LRU_HASH &&
1120 map->map_type != BPF_MAP_TYPE_ARRAY) {
1121 ret = -EOPNOTSUPP;
1122 goto free_map_tab;
1123 }
1124 break;
1125 case BPF_KPTR_UNREF:
1126 case BPF_KPTR_REF:
1127 case BPF_KPTR_PERCPU:
1128 case BPF_REFCOUNT:
1129 if (map->map_type != BPF_MAP_TYPE_HASH &&
1130 map->map_type != BPF_MAP_TYPE_PERCPU_HASH &&
1131 map->map_type != BPF_MAP_TYPE_LRU_HASH &&
1132 map->map_type != BPF_MAP_TYPE_LRU_PERCPU_HASH &&
1133 map->map_type != BPF_MAP_TYPE_ARRAY &&
1134 map->map_type != BPF_MAP_TYPE_PERCPU_ARRAY &&
1135 map->map_type != BPF_MAP_TYPE_SK_STORAGE &&
1136 map->map_type != BPF_MAP_TYPE_INODE_STORAGE &&
1137 map->map_type != BPF_MAP_TYPE_TASK_STORAGE &&
1138 map->map_type != BPF_MAP_TYPE_CGRP_STORAGE) {
1139 ret = -EOPNOTSUPP;
1140 goto free_map_tab;
1141 }
1142 break;
1143 case BPF_LIST_HEAD:
1144 case BPF_RB_ROOT:
1145 if (map->map_type != BPF_MAP_TYPE_HASH &&
1146 map->map_type != BPF_MAP_TYPE_LRU_HASH &&
1147 map->map_type != BPF_MAP_TYPE_ARRAY) {
1148 ret = -EOPNOTSUPP;
1149 goto free_map_tab;
1150 }
1151 break;
1152 default:
1153 /* Fail if map_type checks are missing for a field type */
1154 ret = -EOPNOTSUPP;
1155 goto free_map_tab;
1156 }
1157 }
1158 }
1159
1160 ret = btf_check_and_fixup_fields(btf, map->record);
1161 if (ret < 0)
1162 goto free_map_tab;
1163
1164 if (map->ops->map_check_btf) {
1165 ret = map->ops->map_check_btf(map, btf, key_type, value_type);
1166 if (ret < 0)
1167 goto free_map_tab;
1168 }
1169
1170 return ret;
1171free_map_tab:
1172 bpf_map_free_record(map);
1173 return ret;
1174}
1175
1176static bool bpf_net_capable(void)
1177{
1178 return capable(CAP_NET_ADMIN) || capable(CAP_SYS_ADMIN);
1179}
1180
1181#define BPF_MAP_CREATE_LAST_FIELD map_token_fd
1182/* called via syscall */
1183static int map_create(union bpf_attr *attr)
1184{
1185 const struct bpf_map_ops *ops;
1186 struct bpf_token *token = NULL;
1187 int numa_node = bpf_map_attr_numa_node(attr);
1188 u32 map_type = attr->map_type;
1189 struct bpf_map *map;
1190 bool token_flag;
1191 int f_flags;
1192 int err;
1193
1194 err = CHECK_ATTR(BPF_MAP_CREATE);
1195 if (err)
1196 return -EINVAL;
1197
1198 /* check BPF_F_TOKEN_FD flag, remember if it's set, and then clear it
1199 * to avoid per-map type checks tripping on unknown flag
1200 */
1201 token_flag = attr->map_flags & BPF_F_TOKEN_FD;
1202 attr->map_flags &= ~BPF_F_TOKEN_FD;
1203
1204 if (attr->btf_vmlinux_value_type_id) {
1205 if (attr->map_type != BPF_MAP_TYPE_STRUCT_OPS ||
1206 attr->btf_key_type_id || attr->btf_value_type_id)
1207 return -EINVAL;
1208 } else if (attr->btf_key_type_id && !attr->btf_value_type_id) {
1209 return -EINVAL;
1210 }
1211
1212 if (attr->map_type != BPF_MAP_TYPE_BLOOM_FILTER &&
1213 attr->map_type != BPF_MAP_TYPE_ARENA &&
1214 attr->map_extra != 0)
1215 return -EINVAL;
1216
1217 f_flags = bpf_get_file_flag(attr->map_flags);
1218 if (f_flags < 0)
1219 return f_flags;
1220
1221 if (numa_node != NUMA_NO_NODE &&
1222 ((unsigned int)numa_node >= nr_node_ids ||
1223 !node_online(numa_node)))
1224 return -EINVAL;
1225
1226 /* find map type and init map: hashtable vs rbtree vs bloom vs ... */
1227 map_type = attr->map_type;
1228 if (map_type >= ARRAY_SIZE(bpf_map_types))
1229 return -EINVAL;
1230 map_type = array_index_nospec(map_type, ARRAY_SIZE(bpf_map_types));
1231 ops = bpf_map_types[map_type];
1232 if (!ops)
1233 return -EINVAL;
1234
1235 if (ops->map_alloc_check) {
1236 err = ops->map_alloc_check(attr);
1237 if (err)
1238 return err;
1239 }
1240 if (attr->map_ifindex)
1241 ops = &bpf_map_offload_ops;
1242 if (!ops->map_mem_usage)
1243 return -EINVAL;
1244
1245 if (token_flag) {
1246 token = bpf_token_get_from_fd(attr->map_token_fd);
1247 if (IS_ERR(token))
1248 return PTR_ERR(token);
1249
1250 /* if current token doesn't grant map creation permissions,
1251 * then we can't use this token, so ignore it and rely on
1252 * system-wide capabilities checks
1253 */
1254 if (!bpf_token_allow_cmd(token, BPF_MAP_CREATE) ||
1255 !bpf_token_allow_map_type(token, attr->map_type)) {
1256 bpf_token_put(token);
1257 token = NULL;
1258 }
1259 }
1260
1261 err = -EPERM;
1262
1263 /* Intent here is for unprivileged_bpf_disabled to block BPF map
1264 * creation for unprivileged users; other actions depend
1265 * on fd availability and access to bpffs, so are dependent on
1266 * object creation success. Even with unprivileged BPF disabled,
1267 * capability checks are still carried out.
1268 */
1269 if (sysctl_unprivileged_bpf_disabled && !bpf_token_capable(token, CAP_BPF))
1270 goto put_token;
1271
1272 /* check privileged map type permissions */
1273 switch (map_type) {
1274 case BPF_MAP_TYPE_ARRAY:
1275 case BPF_MAP_TYPE_PERCPU_ARRAY:
1276 case BPF_MAP_TYPE_PROG_ARRAY:
1277 case BPF_MAP_TYPE_PERF_EVENT_ARRAY:
1278 case BPF_MAP_TYPE_CGROUP_ARRAY:
1279 case BPF_MAP_TYPE_ARRAY_OF_MAPS:
1280 case BPF_MAP_TYPE_HASH:
1281 case BPF_MAP_TYPE_PERCPU_HASH:
1282 case BPF_MAP_TYPE_HASH_OF_MAPS:
1283 case BPF_MAP_TYPE_RINGBUF:
1284 case BPF_MAP_TYPE_USER_RINGBUF:
1285 case BPF_MAP_TYPE_CGROUP_STORAGE:
1286 case BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE:
1287 /* unprivileged */
1288 break;
1289 case BPF_MAP_TYPE_SK_STORAGE:
1290 case BPF_MAP_TYPE_INODE_STORAGE:
1291 case BPF_MAP_TYPE_TASK_STORAGE:
1292 case BPF_MAP_TYPE_CGRP_STORAGE:
1293 case BPF_MAP_TYPE_BLOOM_FILTER:
1294 case BPF_MAP_TYPE_LPM_TRIE:
1295 case BPF_MAP_TYPE_REUSEPORT_SOCKARRAY:
1296 case BPF_MAP_TYPE_STACK_TRACE:
1297 case BPF_MAP_TYPE_QUEUE:
1298 case BPF_MAP_TYPE_STACK:
1299 case BPF_MAP_TYPE_LRU_HASH:
1300 case BPF_MAP_TYPE_LRU_PERCPU_HASH:
1301 case BPF_MAP_TYPE_STRUCT_OPS:
1302 case BPF_MAP_TYPE_CPUMAP:
1303 case BPF_MAP_TYPE_ARENA:
1304 if (!bpf_token_capable(token, CAP_BPF))
1305 goto put_token;
1306 break;
1307 case BPF_MAP_TYPE_SOCKMAP:
1308 case BPF_MAP_TYPE_SOCKHASH:
1309 case BPF_MAP_TYPE_DEVMAP:
1310 case BPF_MAP_TYPE_DEVMAP_HASH:
1311 case BPF_MAP_TYPE_XSKMAP:
1312 if (!bpf_token_capable(token, CAP_NET_ADMIN))
1313 goto put_token;
1314 break;
1315 default:
1316 WARN(1, "unsupported map type %d", map_type);
1317 goto put_token;
1318 }
1319
1320 map = ops->map_alloc(attr);
1321 if (IS_ERR(map)) {
1322 err = PTR_ERR(map);
1323 goto put_token;
1324 }
1325 map->ops = ops;
1326 map->map_type = map_type;
1327
1328 err = bpf_obj_name_cpy(map->name, attr->map_name,
1329 sizeof(attr->map_name));
1330 if (err < 0)
1331 goto free_map;
1332
1333 atomic64_set(&map->refcnt, 1);
1334 atomic64_set(&map->usercnt, 1);
1335 mutex_init(&map->freeze_mutex);
1336 spin_lock_init(&map->owner.lock);
1337
1338 if (attr->btf_key_type_id || attr->btf_value_type_id ||
1339 /* Even the map's value is a kernel's struct,
1340 * the bpf_prog.o must have BTF to begin with
1341 * to figure out the corresponding kernel's
1342 * counter part. Thus, attr->btf_fd has
1343 * to be valid also.
1344 */
1345 attr->btf_vmlinux_value_type_id) {
1346 struct btf *btf;
1347
1348 btf = btf_get_by_fd(attr->btf_fd);
1349 if (IS_ERR(btf)) {
1350 err = PTR_ERR(btf);
1351 goto free_map;
1352 }
1353 if (btf_is_kernel(btf)) {
1354 btf_put(btf);
1355 err = -EACCES;
1356 goto free_map;
1357 }
1358 map->btf = btf;
1359
1360 if (attr->btf_value_type_id) {
1361 err = map_check_btf(map, token, btf, attr->btf_key_type_id,
1362 attr->btf_value_type_id);
1363 if (err)
1364 goto free_map;
1365 }
1366
1367 map->btf_key_type_id = attr->btf_key_type_id;
1368 map->btf_value_type_id = attr->btf_value_type_id;
1369 map->btf_vmlinux_value_type_id =
1370 attr->btf_vmlinux_value_type_id;
1371 }
1372
1373 err = security_bpf_map_create(map, attr, token);
1374 if (err)
1375 goto free_map_sec;
1376
1377 err = bpf_map_alloc_id(map);
1378 if (err)
1379 goto free_map_sec;
1380
1381 bpf_map_save_memcg(map);
1382 bpf_token_put(token);
1383
1384 err = bpf_map_new_fd(map, f_flags);
1385 if (err < 0) {
1386 /* failed to allocate fd.
1387 * bpf_map_put_with_uref() is needed because the above
1388 * bpf_map_alloc_id() has published the map
1389 * to the userspace and the userspace may
1390 * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
1391 */
1392 bpf_map_put_with_uref(map);
1393 return err;
1394 }
1395
1396 return err;
1397
1398free_map_sec:
1399 security_bpf_map_free(map);
1400free_map:
1401 btf_put(map->btf);
1402 map->ops->map_free(map);
1403put_token:
1404 bpf_token_put(token);
1405 return err;
1406}
1407
1408/* if error is returned, fd is released.
1409 * On success caller should complete fd access with matching fdput()
1410 */
1411struct bpf_map *__bpf_map_get(struct fd f)
1412{
1413 if (!f.file)
1414 return ERR_PTR(-EBADF);
1415 if (f.file->f_op != &bpf_map_fops) {
1416 fdput(f);
1417 return ERR_PTR(-EINVAL);
1418 }
1419
1420 return f.file->private_data;
1421}
1422
1423void bpf_map_inc(struct bpf_map *map)
1424{
1425 atomic64_inc(&map->refcnt);
1426}
1427EXPORT_SYMBOL_GPL(bpf_map_inc);
1428
1429void bpf_map_inc_with_uref(struct bpf_map *map)
1430{
1431 atomic64_inc(&map->refcnt);
1432 atomic64_inc(&map->usercnt);
1433}
1434EXPORT_SYMBOL_GPL(bpf_map_inc_with_uref);
1435
1436struct bpf_map *bpf_map_get(u32 ufd)
1437{
1438 struct fd f = fdget(ufd);
1439 struct bpf_map *map;
1440
1441 map = __bpf_map_get(f);
1442 if (IS_ERR(map))
1443 return map;
1444
1445 bpf_map_inc(map);
1446 fdput(f);
1447
1448 return map;
1449}
1450EXPORT_SYMBOL(bpf_map_get);
1451
1452struct bpf_map *bpf_map_get_with_uref(u32 ufd)
1453{
1454 struct fd f = fdget(ufd);
1455 struct bpf_map *map;
1456
1457 map = __bpf_map_get(f);
1458 if (IS_ERR(map))
1459 return map;
1460
1461 bpf_map_inc_with_uref(map);
1462 fdput(f);
1463
1464 return map;
1465}
1466
1467/* map_idr_lock should have been held or the map should have been
1468 * protected by rcu read lock.
1469 */
1470struct bpf_map *__bpf_map_inc_not_zero(struct bpf_map *map, bool uref)
1471{
1472 int refold;
1473
1474 refold = atomic64_fetch_add_unless(&map->refcnt, 1, 0);
1475 if (!refold)
1476 return ERR_PTR(-ENOENT);
1477 if (uref)
1478 atomic64_inc(&map->usercnt);
1479
1480 return map;
1481}
1482
1483struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map)
1484{
1485 spin_lock_bh(&map_idr_lock);
1486 map = __bpf_map_inc_not_zero(map, false);
1487 spin_unlock_bh(&map_idr_lock);
1488
1489 return map;
1490}
1491EXPORT_SYMBOL_GPL(bpf_map_inc_not_zero);
1492
1493int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
1494{
1495 return -ENOTSUPP;
1496}
1497
1498static void *__bpf_copy_key(void __user *ukey, u64 key_size)
1499{
1500 if (key_size)
1501 return vmemdup_user(ukey, key_size);
1502
1503 if (ukey)
1504 return ERR_PTR(-EINVAL);
1505
1506 return NULL;
1507}
1508
1509static void *___bpf_copy_key(bpfptr_t ukey, u64 key_size)
1510{
1511 if (key_size)
1512 return kvmemdup_bpfptr(ukey, key_size);
1513
1514 if (!bpfptr_is_null(ukey))
1515 return ERR_PTR(-EINVAL);
1516
1517 return NULL;
1518}
1519
1520/* last field in 'union bpf_attr' used by this command */
1521#define BPF_MAP_LOOKUP_ELEM_LAST_FIELD flags
1522
1523static int map_lookup_elem(union bpf_attr *attr)
1524{
1525 void __user *ukey = u64_to_user_ptr(attr->key);
1526 void __user *uvalue = u64_to_user_ptr(attr->value);
1527 int ufd = attr->map_fd;
1528 struct bpf_map *map;
1529 void *key, *value;
1530 u32 value_size;
1531 struct fd f;
1532 int err;
1533
1534 if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
1535 return -EINVAL;
1536
1537 if (attr->flags & ~BPF_F_LOCK)
1538 return -EINVAL;
1539
1540 f = fdget(ufd);
1541 map = __bpf_map_get(f);
1542 if (IS_ERR(map))
1543 return PTR_ERR(map);
1544 if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
1545 err = -EPERM;
1546 goto err_put;
1547 }
1548
1549 if ((attr->flags & BPF_F_LOCK) &&
1550 !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1551 err = -EINVAL;
1552 goto err_put;
1553 }
1554
1555 key = __bpf_copy_key(ukey, map->key_size);
1556 if (IS_ERR(key)) {
1557 err = PTR_ERR(key);
1558 goto err_put;
1559 }
1560
1561 value_size = bpf_map_value_size(map);
1562
1563 err = -ENOMEM;
1564 value = kvmalloc(value_size, GFP_USER | __GFP_NOWARN);
1565 if (!value)
1566 goto free_key;
1567
1568 if (map->map_type == BPF_MAP_TYPE_BLOOM_FILTER) {
1569 if (copy_from_user(value, uvalue, value_size))
1570 err = -EFAULT;
1571 else
1572 err = bpf_map_copy_value(map, key, value, attr->flags);
1573 goto free_value;
1574 }
1575
1576 err = bpf_map_copy_value(map, key, value, attr->flags);
1577 if (err)
1578 goto free_value;
1579
1580 err = -EFAULT;
1581 if (copy_to_user(uvalue, value, value_size) != 0)
1582 goto free_value;
1583
1584 err = 0;
1585
1586free_value:
1587 kvfree(value);
1588free_key:
1589 kvfree(key);
1590err_put:
1591 fdput(f);
1592 return err;
1593}
1594
1595
1596#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
1597
1598static int map_update_elem(union bpf_attr *attr, bpfptr_t uattr)
1599{
1600 bpfptr_t ukey = make_bpfptr(attr->key, uattr.is_kernel);
1601 bpfptr_t uvalue = make_bpfptr(attr->value, uattr.is_kernel);
1602 int ufd = attr->map_fd;
1603 struct bpf_map *map;
1604 void *key, *value;
1605 u32 value_size;
1606 struct fd f;
1607 int err;
1608
1609 if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
1610 return -EINVAL;
1611
1612 f = fdget(ufd);
1613 map = __bpf_map_get(f);
1614 if (IS_ERR(map))
1615 return PTR_ERR(map);
1616 bpf_map_write_active_inc(map);
1617 if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1618 err = -EPERM;
1619 goto err_put;
1620 }
1621
1622 if ((attr->flags & BPF_F_LOCK) &&
1623 !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1624 err = -EINVAL;
1625 goto err_put;
1626 }
1627
1628 key = ___bpf_copy_key(ukey, map->key_size);
1629 if (IS_ERR(key)) {
1630 err = PTR_ERR(key);
1631 goto err_put;
1632 }
1633
1634 value_size = bpf_map_value_size(map);
1635 value = kvmemdup_bpfptr(uvalue, value_size);
1636 if (IS_ERR(value)) {
1637 err = PTR_ERR(value);
1638 goto free_key;
1639 }
1640
1641 err = bpf_map_update_value(map, f.file, key, value, attr->flags);
1642 if (!err)
1643 maybe_wait_bpf_programs(map);
1644
1645 kvfree(value);
1646free_key:
1647 kvfree(key);
1648err_put:
1649 bpf_map_write_active_dec(map);
1650 fdput(f);
1651 return err;
1652}
1653
1654#define BPF_MAP_DELETE_ELEM_LAST_FIELD key
1655
1656static int map_delete_elem(union bpf_attr *attr, bpfptr_t uattr)
1657{
1658 bpfptr_t ukey = make_bpfptr(attr->key, uattr.is_kernel);
1659 int ufd = attr->map_fd;
1660 struct bpf_map *map;
1661 struct fd f;
1662 void *key;
1663 int err;
1664
1665 if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
1666 return -EINVAL;
1667
1668 f = fdget(ufd);
1669 map = __bpf_map_get(f);
1670 if (IS_ERR(map))
1671 return PTR_ERR(map);
1672 bpf_map_write_active_inc(map);
1673 if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1674 err = -EPERM;
1675 goto err_put;
1676 }
1677
1678 key = ___bpf_copy_key(ukey, map->key_size);
1679 if (IS_ERR(key)) {
1680 err = PTR_ERR(key);
1681 goto err_put;
1682 }
1683
1684 if (bpf_map_is_offloaded(map)) {
1685 err = bpf_map_offload_delete_elem(map, key);
1686 goto out;
1687 } else if (IS_FD_PROG_ARRAY(map) ||
1688 map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
1689 /* These maps require sleepable context */
1690 err = map->ops->map_delete_elem(map, key);
1691 goto out;
1692 }
1693
1694 bpf_disable_instrumentation();
1695 rcu_read_lock();
1696 err = map->ops->map_delete_elem(map, key);
1697 rcu_read_unlock();
1698 bpf_enable_instrumentation();
1699 if (!err)
1700 maybe_wait_bpf_programs(map);
1701out:
1702 kvfree(key);
1703err_put:
1704 bpf_map_write_active_dec(map);
1705 fdput(f);
1706 return err;
1707}
1708
1709/* last field in 'union bpf_attr' used by this command */
1710#define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
1711
1712static int map_get_next_key(union bpf_attr *attr)
1713{
1714 void __user *ukey = u64_to_user_ptr(attr->key);
1715 void __user *unext_key = u64_to_user_ptr(attr->next_key);
1716 int ufd = attr->map_fd;
1717 struct bpf_map *map;
1718 void *key, *next_key;
1719 struct fd f;
1720 int err;
1721
1722 if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
1723 return -EINVAL;
1724
1725 f = fdget(ufd);
1726 map = __bpf_map_get(f);
1727 if (IS_ERR(map))
1728 return PTR_ERR(map);
1729 if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
1730 err = -EPERM;
1731 goto err_put;
1732 }
1733
1734 if (ukey) {
1735 key = __bpf_copy_key(ukey, map->key_size);
1736 if (IS_ERR(key)) {
1737 err = PTR_ERR(key);
1738 goto err_put;
1739 }
1740 } else {
1741 key = NULL;
1742 }
1743
1744 err = -ENOMEM;
1745 next_key = kvmalloc(map->key_size, GFP_USER);
1746 if (!next_key)
1747 goto free_key;
1748
1749 if (bpf_map_is_offloaded(map)) {
1750 err = bpf_map_offload_get_next_key(map, key, next_key);
1751 goto out;
1752 }
1753
1754 rcu_read_lock();
1755 err = map->ops->map_get_next_key(map, key, next_key);
1756 rcu_read_unlock();
1757out:
1758 if (err)
1759 goto free_next_key;
1760
1761 err = -EFAULT;
1762 if (copy_to_user(unext_key, next_key, map->key_size) != 0)
1763 goto free_next_key;
1764
1765 err = 0;
1766
1767free_next_key:
1768 kvfree(next_key);
1769free_key:
1770 kvfree(key);
1771err_put:
1772 fdput(f);
1773 return err;
1774}
1775
1776int generic_map_delete_batch(struct bpf_map *map,
1777 const union bpf_attr *attr,
1778 union bpf_attr __user *uattr)
1779{
1780 void __user *keys = u64_to_user_ptr(attr->batch.keys);
1781 u32 cp, max_count;
1782 int err = 0;
1783 void *key;
1784
1785 if (attr->batch.elem_flags & ~BPF_F_LOCK)
1786 return -EINVAL;
1787
1788 if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1789 !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1790 return -EINVAL;
1791 }
1792
1793 max_count = attr->batch.count;
1794 if (!max_count)
1795 return 0;
1796
1797 if (put_user(0, &uattr->batch.count))
1798 return -EFAULT;
1799
1800 key = kvmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1801 if (!key)
1802 return -ENOMEM;
1803
1804 for (cp = 0; cp < max_count; cp++) {
1805 err = -EFAULT;
1806 if (copy_from_user(key, keys + cp * map->key_size,
1807 map->key_size))
1808 break;
1809
1810 if (bpf_map_is_offloaded(map)) {
1811 err = bpf_map_offload_delete_elem(map, key);
1812 break;
1813 }
1814
1815 bpf_disable_instrumentation();
1816 rcu_read_lock();
1817 err = map->ops->map_delete_elem(map, key);
1818 rcu_read_unlock();
1819 bpf_enable_instrumentation();
1820 if (err)
1821 break;
1822 cond_resched();
1823 }
1824 if (copy_to_user(&uattr->batch.count, &cp, sizeof(cp)))
1825 err = -EFAULT;
1826
1827 kvfree(key);
1828
1829 return err;
1830}
1831
1832int generic_map_update_batch(struct bpf_map *map, struct file *map_file,
1833 const union bpf_attr *attr,
1834 union bpf_attr __user *uattr)
1835{
1836 void __user *values = u64_to_user_ptr(attr->batch.values);
1837 void __user *keys = u64_to_user_ptr(attr->batch.keys);
1838 u32 value_size, cp, max_count;
1839 void *key, *value;
1840 int err = 0;
1841
1842 if (attr->batch.elem_flags & ~BPF_F_LOCK)
1843 return -EINVAL;
1844
1845 if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1846 !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
1847 return -EINVAL;
1848 }
1849
1850 value_size = bpf_map_value_size(map);
1851
1852 max_count = attr->batch.count;
1853 if (!max_count)
1854 return 0;
1855
1856 if (put_user(0, &uattr->batch.count))
1857 return -EFAULT;
1858
1859 key = kvmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1860 if (!key)
1861 return -ENOMEM;
1862
1863 value = kvmalloc(value_size, GFP_USER | __GFP_NOWARN);
1864 if (!value) {
1865 kvfree(key);
1866 return -ENOMEM;
1867 }
1868
1869 for (cp = 0; cp < max_count; cp++) {
1870 err = -EFAULT;
1871 if (copy_from_user(key, keys + cp * map->key_size,
1872 map->key_size) ||
1873 copy_from_user(value, values + cp * value_size, value_size))
1874 break;
1875
1876 err = bpf_map_update_value(map, map_file, key, value,
1877 attr->batch.elem_flags);
1878
1879 if (err)
1880 break;
1881 cond_resched();
1882 }
1883
1884 if (copy_to_user(&uattr->batch.count, &cp, sizeof(cp)))
1885 err = -EFAULT;
1886
1887 kvfree(value);
1888 kvfree(key);
1889
1890 return err;
1891}
1892
1893#define MAP_LOOKUP_RETRIES 3
1894
1895int generic_map_lookup_batch(struct bpf_map *map,
1896 const union bpf_attr *attr,
1897 union bpf_attr __user *uattr)
1898{
1899 void __user *uobatch = u64_to_user_ptr(attr->batch.out_batch);
1900 void __user *ubatch = u64_to_user_ptr(attr->batch.in_batch);
1901 void __user *values = u64_to_user_ptr(attr->batch.values);
1902 void __user *keys = u64_to_user_ptr(attr->batch.keys);
1903 void *buf, *buf_prevkey, *prev_key, *key, *value;
1904 int err, retry = MAP_LOOKUP_RETRIES;
1905 u32 value_size, cp, max_count;
1906
1907 if (attr->batch.elem_flags & ~BPF_F_LOCK)
1908 return -EINVAL;
1909
1910 if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1911 !btf_record_has_field(map->record, BPF_SPIN_LOCK))
1912 return -EINVAL;
1913
1914 value_size = bpf_map_value_size(map);
1915
1916 max_count = attr->batch.count;
1917 if (!max_count)
1918 return 0;
1919
1920 if (put_user(0, &uattr->batch.count))
1921 return -EFAULT;
1922
1923 buf_prevkey = kvmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1924 if (!buf_prevkey)
1925 return -ENOMEM;
1926
1927 buf = kvmalloc(map->key_size + value_size, GFP_USER | __GFP_NOWARN);
1928 if (!buf) {
1929 kvfree(buf_prevkey);
1930 return -ENOMEM;
1931 }
1932
1933 err = -EFAULT;
1934 prev_key = NULL;
1935 if (ubatch && copy_from_user(buf_prevkey, ubatch, map->key_size))
1936 goto free_buf;
1937 key = buf;
1938 value = key + map->key_size;
1939 if (ubatch)
1940 prev_key = buf_prevkey;
1941
1942 for (cp = 0; cp < max_count;) {
1943 rcu_read_lock();
1944 err = map->ops->map_get_next_key(map, prev_key, key);
1945 rcu_read_unlock();
1946 if (err)
1947 break;
1948 err = bpf_map_copy_value(map, key, value,
1949 attr->batch.elem_flags);
1950
1951 if (err == -ENOENT) {
1952 if (retry) {
1953 retry--;
1954 continue;
1955 }
1956 err = -EINTR;
1957 break;
1958 }
1959
1960 if (err)
1961 goto free_buf;
1962
1963 if (copy_to_user(keys + cp * map->key_size, key,
1964 map->key_size)) {
1965 err = -EFAULT;
1966 goto free_buf;
1967 }
1968 if (copy_to_user(values + cp * value_size, value, value_size)) {
1969 err = -EFAULT;
1970 goto free_buf;
1971 }
1972
1973 if (!prev_key)
1974 prev_key = buf_prevkey;
1975
1976 swap(prev_key, key);
1977 retry = MAP_LOOKUP_RETRIES;
1978 cp++;
1979 cond_resched();
1980 }
1981
1982 if (err == -EFAULT)
1983 goto free_buf;
1984
1985 if ((copy_to_user(&uattr->batch.count, &cp, sizeof(cp)) ||
1986 (cp && copy_to_user(uobatch, prev_key, map->key_size))))
1987 err = -EFAULT;
1988
1989free_buf:
1990 kvfree(buf_prevkey);
1991 kvfree(buf);
1992 return err;
1993}
1994
1995#define BPF_MAP_LOOKUP_AND_DELETE_ELEM_LAST_FIELD flags
1996
1997static int map_lookup_and_delete_elem(union bpf_attr *attr)
1998{
1999 void __user *ukey = u64_to_user_ptr(attr->key);
2000 void __user *uvalue = u64_to_user_ptr(attr->value);
2001 int ufd = attr->map_fd;
2002 struct bpf_map *map;
2003 void *key, *value;
2004 u32 value_size;
2005 struct fd f;
2006 int err;
2007
2008 if (CHECK_ATTR(BPF_MAP_LOOKUP_AND_DELETE_ELEM))
2009 return -EINVAL;
2010
2011 if (attr->flags & ~BPF_F_LOCK)
2012 return -EINVAL;
2013
2014 f = fdget(ufd);
2015 map = __bpf_map_get(f);
2016 if (IS_ERR(map))
2017 return PTR_ERR(map);
2018 bpf_map_write_active_inc(map);
2019 if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ) ||
2020 !(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
2021 err = -EPERM;
2022 goto err_put;
2023 }
2024
2025 if (attr->flags &&
2026 (map->map_type == BPF_MAP_TYPE_QUEUE ||
2027 map->map_type == BPF_MAP_TYPE_STACK)) {
2028 err = -EINVAL;
2029 goto err_put;
2030 }
2031
2032 if ((attr->flags & BPF_F_LOCK) &&
2033 !btf_record_has_field(map->record, BPF_SPIN_LOCK)) {
2034 err = -EINVAL;
2035 goto err_put;
2036 }
2037
2038 key = __bpf_copy_key(ukey, map->key_size);
2039 if (IS_ERR(key)) {
2040 err = PTR_ERR(key);
2041 goto err_put;
2042 }
2043
2044 value_size = bpf_map_value_size(map);
2045
2046 err = -ENOMEM;
2047 value = kvmalloc(value_size, GFP_USER | __GFP_NOWARN);
2048 if (!value)
2049 goto free_key;
2050
2051 err = -ENOTSUPP;
2052 if (map->map_type == BPF_MAP_TYPE_QUEUE ||
2053 map->map_type == BPF_MAP_TYPE_STACK) {
2054 err = map->ops->map_pop_elem(map, value);
2055 } else if (map->map_type == BPF_MAP_TYPE_HASH ||
2056 map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
2057 map->map_type == BPF_MAP_TYPE_LRU_HASH ||
2058 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
2059 if (!bpf_map_is_offloaded(map)) {
2060 bpf_disable_instrumentation();
2061 rcu_read_lock();
2062 err = map->ops->map_lookup_and_delete_elem(map, key, value, attr->flags);
2063 rcu_read_unlock();
2064 bpf_enable_instrumentation();
2065 }
2066 }
2067
2068 if (err)
2069 goto free_value;
2070
2071 if (copy_to_user(uvalue, value, value_size) != 0) {
2072 err = -EFAULT;
2073 goto free_value;
2074 }
2075
2076 err = 0;
2077
2078free_value:
2079 kvfree(value);
2080free_key:
2081 kvfree(key);
2082err_put:
2083 bpf_map_write_active_dec(map);
2084 fdput(f);
2085 return err;
2086}
2087
2088#define BPF_MAP_FREEZE_LAST_FIELD map_fd
2089
2090static int map_freeze(const union bpf_attr *attr)
2091{
2092 int err = 0, ufd = attr->map_fd;
2093 struct bpf_map *map;
2094 struct fd f;
2095
2096 if (CHECK_ATTR(BPF_MAP_FREEZE))
2097 return -EINVAL;
2098
2099 f = fdget(ufd);
2100 map = __bpf_map_get(f);
2101 if (IS_ERR(map))
2102 return PTR_ERR(map);
2103
2104 if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS || !IS_ERR_OR_NULL(map->record)) {
2105 fdput(f);
2106 return -ENOTSUPP;
2107 }
2108
2109 if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
2110 fdput(f);
2111 return -EPERM;
2112 }
2113
2114 mutex_lock(&map->freeze_mutex);
2115 if (bpf_map_write_active(map)) {
2116 err = -EBUSY;
2117 goto err_put;
2118 }
2119 if (READ_ONCE(map->frozen)) {
2120 err = -EBUSY;
2121 goto err_put;
2122 }
2123
2124 WRITE_ONCE(map->frozen, true);
2125err_put:
2126 mutex_unlock(&map->freeze_mutex);
2127 fdput(f);
2128 return err;
2129}
2130
2131static const struct bpf_prog_ops * const bpf_prog_types[] = {
2132#define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type) \
2133 [_id] = & _name ## _prog_ops,
2134#define BPF_MAP_TYPE(_id, _ops)
2135#define BPF_LINK_TYPE(_id, _name)
2136#include <linux/bpf_types.h>
2137#undef BPF_PROG_TYPE
2138#undef BPF_MAP_TYPE
2139#undef BPF_LINK_TYPE
2140};
2141
2142static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
2143{
2144 const struct bpf_prog_ops *ops;
2145
2146 if (type >= ARRAY_SIZE(bpf_prog_types))
2147 return -EINVAL;
2148 type = array_index_nospec(type, ARRAY_SIZE(bpf_prog_types));
2149 ops = bpf_prog_types[type];
2150 if (!ops)
2151 return -EINVAL;
2152
2153 if (!bpf_prog_is_offloaded(prog->aux))
2154 prog->aux->ops = ops;
2155 else
2156 prog->aux->ops = &bpf_offload_prog_ops;
2157 prog->type = type;
2158 return 0;
2159}
2160
2161enum bpf_audit {
2162 BPF_AUDIT_LOAD,
2163 BPF_AUDIT_UNLOAD,
2164 BPF_AUDIT_MAX,
2165};
2166
2167static const char * const bpf_audit_str[BPF_AUDIT_MAX] = {
2168 [BPF_AUDIT_LOAD] = "LOAD",
2169 [BPF_AUDIT_UNLOAD] = "UNLOAD",
2170};
2171
2172static void bpf_audit_prog(const struct bpf_prog *prog, unsigned int op)
2173{
2174 struct audit_context *ctx = NULL;
2175 struct audit_buffer *ab;
2176
2177 if (WARN_ON_ONCE(op >= BPF_AUDIT_MAX))
2178 return;
2179 if (audit_enabled == AUDIT_OFF)
2180 return;
2181 if (!in_irq() && !irqs_disabled())
2182 ctx = audit_context();
2183 ab = audit_log_start(ctx, GFP_ATOMIC, AUDIT_BPF);
2184 if (unlikely(!ab))
2185 return;
2186 audit_log_format(ab, "prog-id=%u op=%s",
2187 prog->aux->id, bpf_audit_str[op]);
2188 audit_log_end(ab);
2189}
2190
2191static int bpf_prog_alloc_id(struct bpf_prog *prog)
2192{
2193 int id;
2194
2195 idr_preload(GFP_KERNEL);
2196 spin_lock_bh(&prog_idr_lock);
2197 id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
2198 if (id > 0)
2199 prog->aux->id = id;
2200 spin_unlock_bh(&prog_idr_lock);
2201 idr_preload_end();
2202
2203 /* id is in [1, INT_MAX) */
2204 if (WARN_ON_ONCE(!id))
2205 return -ENOSPC;
2206
2207 return id > 0 ? 0 : id;
2208}
2209
2210void bpf_prog_free_id(struct bpf_prog *prog)
2211{
2212 unsigned long flags;
2213
2214 /* cBPF to eBPF migrations are currently not in the idr store.
2215 * Offloaded programs are removed from the store when their device
2216 * disappears - even if someone grabs an fd to them they are unusable,
2217 * simply waiting for refcnt to drop to be freed.
2218 */
2219 if (!prog->aux->id)
2220 return;
2221
2222 spin_lock_irqsave(&prog_idr_lock, flags);
2223 idr_remove(&prog_idr, prog->aux->id);
2224 prog->aux->id = 0;
2225 spin_unlock_irqrestore(&prog_idr_lock, flags);
2226}
2227
2228static void __bpf_prog_put_rcu(struct rcu_head *rcu)
2229{
2230 struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
2231
2232 kvfree(aux->func_info);
2233 kfree(aux->func_info_aux);
2234 free_uid(aux->user);
2235 security_bpf_prog_free(aux->prog);
2236 bpf_prog_free(aux->prog);
2237}
2238
2239static void __bpf_prog_put_noref(struct bpf_prog *prog, bool deferred)
2240{
2241 bpf_prog_kallsyms_del_all(prog);
2242 btf_put(prog->aux->btf);
2243 module_put(prog->aux->mod);
2244 kvfree(prog->aux->jited_linfo);
2245 kvfree(prog->aux->linfo);
2246 kfree(prog->aux->kfunc_tab);
2247 if (prog->aux->attach_btf)
2248 btf_put(prog->aux->attach_btf);
2249
2250 if (deferred) {
2251 if (prog->sleepable)
2252 call_rcu_tasks_trace(&prog->aux->rcu, __bpf_prog_put_rcu);
2253 else
2254 call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
2255 } else {
2256 __bpf_prog_put_rcu(&prog->aux->rcu);
2257 }
2258}
2259
2260static void bpf_prog_put_deferred(struct work_struct *work)
2261{
2262 struct bpf_prog_aux *aux;
2263 struct bpf_prog *prog;
2264
2265 aux = container_of(work, struct bpf_prog_aux, work);
2266 prog = aux->prog;
2267 perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_UNLOAD, 0);
2268 bpf_audit_prog(prog, BPF_AUDIT_UNLOAD);
2269 bpf_prog_free_id(prog);
2270 __bpf_prog_put_noref(prog, true);
2271}
2272
2273static void __bpf_prog_put(struct bpf_prog *prog)
2274{
2275 struct bpf_prog_aux *aux = prog->aux;
2276
2277 if (atomic64_dec_and_test(&aux->refcnt)) {
2278 if (in_irq() || irqs_disabled()) {
2279 INIT_WORK(&aux->work, bpf_prog_put_deferred);
2280 schedule_work(&aux->work);
2281 } else {
2282 bpf_prog_put_deferred(&aux->work);
2283 }
2284 }
2285}
2286
2287void bpf_prog_put(struct bpf_prog *prog)
2288{
2289 __bpf_prog_put(prog);
2290}
2291EXPORT_SYMBOL_GPL(bpf_prog_put);
2292
2293static int bpf_prog_release(struct inode *inode, struct file *filp)
2294{
2295 struct bpf_prog *prog = filp->private_data;
2296
2297 bpf_prog_put(prog);
2298 return 0;
2299}
2300
2301struct bpf_prog_kstats {
2302 u64 nsecs;
2303 u64 cnt;
2304 u64 misses;
2305};
2306
2307void notrace bpf_prog_inc_misses_counter(struct bpf_prog *prog)
2308{
2309 struct bpf_prog_stats *stats;
2310 unsigned int flags;
2311
2312 stats = this_cpu_ptr(prog->stats);
2313 flags = u64_stats_update_begin_irqsave(&stats->syncp);
2314 u64_stats_inc(&stats->misses);
2315 u64_stats_update_end_irqrestore(&stats->syncp, flags);
2316}
2317
2318static void bpf_prog_get_stats(const struct bpf_prog *prog,
2319 struct bpf_prog_kstats *stats)
2320{
2321 u64 nsecs = 0, cnt = 0, misses = 0;
2322 int cpu;
2323
2324 for_each_possible_cpu(cpu) {
2325 const struct bpf_prog_stats *st;
2326 unsigned int start;
2327 u64 tnsecs, tcnt, tmisses;
2328
2329 st = per_cpu_ptr(prog->stats, cpu);
2330 do {
2331 start = u64_stats_fetch_begin(&st->syncp);
2332 tnsecs = u64_stats_read(&st->nsecs);
2333 tcnt = u64_stats_read(&st->cnt);
2334 tmisses = u64_stats_read(&st->misses);
2335 } while (u64_stats_fetch_retry(&st->syncp, start));
2336 nsecs += tnsecs;
2337 cnt += tcnt;
2338 misses += tmisses;
2339 }
2340 stats->nsecs = nsecs;
2341 stats->cnt = cnt;
2342 stats->misses = misses;
2343}
2344
2345#ifdef CONFIG_PROC_FS
2346static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
2347{
2348 const struct bpf_prog *prog = filp->private_data;
2349 char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
2350 struct bpf_prog_kstats stats;
2351
2352 bpf_prog_get_stats(prog, &stats);
2353 bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
2354 seq_printf(m,
2355 "prog_type:\t%u\n"
2356 "prog_jited:\t%u\n"
2357 "prog_tag:\t%s\n"
2358 "memlock:\t%llu\n"
2359 "prog_id:\t%u\n"
2360 "run_time_ns:\t%llu\n"
2361 "run_cnt:\t%llu\n"
2362 "recursion_misses:\t%llu\n"
2363 "verified_insns:\t%u\n",
2364 prog->type,
2365 prog->jited,
2366 prog_tag,
2367 prog->pages * 1ULL << PAGE_SHIFT,
2368 prog->aux->id,
2369 stats.nsecs,
2370 stats.cnt,
2371 stats.misses,
2372 prog->aux->verified_insns);
2373}
2374#endif
2375
2376const struct file_operations bpf_prog_fops = {
2377#ifdef CONFIG_PROC_FS
2378 .show_fdinfo = bpf_prog_show_fdinfo,
2379#endif
2380 .release = bpf_prog_release,
2381 .read = bpf_dummy_read,
2382 .write = bpf_dummy_write,
2383};
2384
2385int bpf_prog_new_fd(struct bpf_prog *prog)
2386{
2387 int ret;
2388
2389 ret = security_bpf_prog(prog);
2390 if (ret < 0)
2391 return ret;
2392
2393 return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
2394 O_RDWR | O_CLOEXEC);
2395}
2396
2397static struct bpf_prog *____bpf_prog_get(struct fd f)
2398{
2399 if (!f.file)
2400 return ERR_PTR(-EBADF);
2401 if (f.file->f_op != &bpf_prog_fops) {
2402 fdput(f);
2403 return ERR_PTR(-EINVAL);
2404 }
2405
2406 return f.file->private_data;
2407}
2408
2409void bpf_prog_add(struct bpf_prog *prog, int i)
2410{
2411 atomic64_add(i, &prog->aux->refcnt);
2412}
2413EXPORT_SYMBOL_GPL(bpf_prog_add);
2414
2415void bpf_prog_sub(struct bpf_prog *prog, int i)
2416{
2417 /* Only to be used for undoing previous bpf_prog_add() in some
2418 * error path. We still know that another entity in our call
2419 * path holds a reference to the program, thus atomic_sub() can
2420 * be safely used in such cases!
2421 */
2422 WARN_ON(atomic64_sub_return(i, &prog->aux->refcnt) == 0);
2423}
2424EXPORT_SYMBOL_GPL(bpf_prog_sub);
2425
2426void bpf_prog_inc(struct bpf_prog *prog)
2427{
2428 atomic64_inc(&prog->aux->refcnt);
2429}
2430EXPORT_SYMBOL_GPL(bpf_prog_inc);
2431
2432/* prog_idr_lock should have been held */
2433struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
2434{
2435 int refold;
2436
2437 refold = atomic64_fetch_add_unless(&prog->aux->refcnt, 1, 0);
2438
2439 if (!refold)
2440 return ERR_PTR(-ENOENT);
2441
2442 return prog;
2443}
2444EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
2445
2446bool bpf_prog_get_ok(struct bpf_prog *prog,
2447 enum bpf_prog_type *attach_type, bool attach_drv)
2448{
2449 /* not an attachment, just a refcount inc, always allow */
2450 if (!attach_type)
2451 return true;
2452
2453 if (prog->type != *attach_type)
2454 return false;
2455 if (bpf_prog_is_offloaded(prog->aux) && !attach_drv)
2456 return false;
2457
2458 return true;
2459}
2460
2461static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
2462 bool attach_drv)
2463{
2464 struct fd f = fdget(ufd);
2465 struct bpf_prog *prog;
2466
2467 prog = ____bpf_prog_get(f);
2468 if (IS_ERR(prog))
2469 return prog;
2470 if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
2471 prog = ERR_PTR(-EINVAL);
2472 goto out;
2473 }
2474
2475 bpf_prog_inc(prog);
2476out:
2477 fdput(f);
2478 return prog;
2479}
2480
2481struct bpf_prog *bpf_prog_get(u32 ufd)
2482{
2483 return __bpf_prog_get(ufd, NULL, false);
2484}
2485
2486struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
2487 bool attach_drv)
2488{
2489 return __bpf_prog_get(ufd, &type, attach_drv);
2490}
2491EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
2492
2493/* Initially all BPF programs could be loaded w/o specifying
2494 * expected_attach_type. Later for some of them specifying expected_attach_type
2495 * at load time became required so that program could be validated properly.
2496 * Programs of types that are allowed to be loaded both w/ and w/o (for
2497 * backward compatibility) expected_attach_type, should have the default attach
2498 * type assigned to expected_attach_type for the latter case, so that it can be
2499 * validated later at attach time.
2500 *
2501 * bpf_prog_load_fixup_attach_type() sets expected_attach_type in @attr if
2502 * prog type requires it but has some attach types that have to be backward
2503 * compatible.
2504 */
2505static void bpf_prog_load_fixup_attach_type(union bpf_attr *attr)
2506{
2507 switch (attr->prog_type) {
2508 case BPF_PROG_TYPE_CGROUP_SOCK:
2509 /* Unfortunately BPF_ATTACH_TYPE_UNSPEC enumeration doesn't
2510 * exist so checking for non-zero is the way to go here.
2511 */
2512 if (!attr->expected_attach_type)
2513 attr->expected_attach_type =
2514 BPF_CGROUP_INET_SOCK_CREATE;
2515 break;
2516 case BPF_PROG_TYPE_SK_REUSEPORT:
2517 if (!attr->expected_attach_type)
2518 attr->expected_attach_type =
2519 BPF_SK_REUSEPORT_SELECT;
2520 break;
2521 }
2522}
2523
2524static int
2525bpf_prog_load_check_attach(enum bpf_prog_type prog_type,
2526 enum bpf_attach_type expected_attach_type,
2527 struct btf *attach_btf, u32 btf_id,
2528 struct bpf_prog *dst_prog)
2529{
2530 if (btf_id) {
2531 if (btf_id > BTF_MAX_TYPE)
2532 return -EINVAL;
2533
2534 if (!attach_btf && !dst_prog)
2535 return -EINVAL;
2536
2537 switch (prog_type) {
2538 case BPF_PROG_TYPE_TRACING:
2539 case BPF_PROG_TYPE_LSM:
2540 case BPF_PROG_TYPE_STRUCT_OPS:
2541 case BPF_PROG_TYPE_EXT:
2542 break;
2543 default:
2544 return -EINVAL;
2545 }
2546 }
2547
2548 if (attach_btf && (!btf_id || dst_prog))
2549 return -EINVAL;
2550
2551 if (dst_prog && prog_type != BPF_PROG_TYPE_TRACING &&
2552 prog_type != BPF_PROG_TYPE_EXT)
2553 return -EINVAL;
2554
2555 switch (prog_type) {
2556 case BPF_PROG_TYPE_CGROUP_SOCK:
2557 switch (expected_attach_type) {
2558 case BPF_CGROUP_INET_SOCK_CREATE:
2559 case BPF_CGROUP_INET_SOCK_RELEASE:
2560 case BPF_CGROUP_INET4_POST_BIND:
2561 case BPF_CGROUP_INET6_POST_BIND:
2562 return 0;
2563 default:
2564 return -EINVAL;
2565 }
2566 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2567 switch (expected_attach_type) {
2568 case BPF_CGROUP_INET4_BIND:
2569 case BPF_CGROUP_INET6_BIND:
2570 case BPF_CGROUP_INET4_CONNECT:
2571 case BPF_CGROUP_INET6_CONNECT:
2572 case BPF_CGROUP_UNIX_CONNECT:
2573 case BPF_CGROUP_INET4_GETPEERNAME:
2574 case BPF_CGROUP_INET6_GETPEERNAME:
2575 case BPF_CGROUP_UNIX_GETPEERNAME:
2576 case BPF_CGROUP_INET4_GETSOCKNAME:
2577 case BPF_CGROUP_INET6_GETSOCKNAME:
2578 case BPF_CGROUP_UNIX_GETSOCKNAME:
2579 case BPF_CGROUP_UDP4_SENDMSG:
2580 case BPF_CGROUP_UDP6_SENDMSG:
2581 case BPF_CGROUP_UNIX_SENDMSG:
2582 case BPF_CGROUP_UDP4_RECVMSG:
2583 case BPF_CGROUP_UDP6_RECVMSG:
2584 case BPF_CGROUP_UNIX_RECVMSG:
2585 return 0;
2586 default:
2587 return -EINVAL;
2588 }
2589 case BPF_PROG_TYPE_CGROUP_SKB:
2590 switch (expected_attach_type) {
2591 case BPF_CGROUP_INET_INGRESS:
2592 case BPF_CGROUP_INET_EGRESS:
2593 return 0;
2594 default:
2595 return -EINVAL;
2596 }
2597 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2598 switch (expected_attach_type) {
2599 case BPF_CGROUP_SETSOCKOPT:
2600 case BPF_CGROUP_GETSOCKOPT:
2601 return 0;
2602 default:
2603 return -EINVAL;
2604 }
2605 case BPF_PROG_TYPE_SK_LOOKUP:
2606 if (expected_attach_type == BPF_SK_LOOKUP)
2607 return 0;
2608 return -EINVAL;
2609 case BPF_PROG_TYPE_SK_REUSEPORT:
2610 switch (expected_attach_type) {
2611 case BPF_SK_REUSEPORT_SELECT:
2612 case BPF_SK_REUSEPORT_SELECT_OR_MIGRATE:
2613 return 0;
2614 default:
2615 return -EINVAL;
2616 }
2617 case BPF_PROG_TYPE_NETFILTER:
2618 if (expected_attach_type == BPF_NETFILTER)
2619 return 0;
2620 return -EINVAL;
2621 case BPF_PROG_TYPE_SYSCALL:
2622 case BPF_PROG_TYPE_EXT:
2623 if (expected_attach_type)
2624 return -EINVAL;
2625 fallthrough;
2626 default:
2627 return 0;
2628 }
2629}
2630
2631static bool is_net_admin_prog_type(enum bpf_prog_type prog_type)
2632{
2633 switch (prog_type) {
2634 case BPF_PROG_TYPE_SCHED_CLS:
2635 case BPF_PROG_TYPE_SCHED_ACT:
2636 case BPF_PROG_TYPE_XDP:
2637 case BPF_PROG_TYPE_LWT_IN:
2638 case BPF_PROG_TYPE_LWT_OUT:
2639 case BPF_PROG_TYPE_LWT_XMIT:
2640 case BPF_PROG_TYPE_LWT_SEG6LOCAL:
2641 case BPF_PROG_TYPE_SK_SKB:
2642 case BPF_PROG_TYPE_SK_MSG:
2643 case BPF_PROG_TYPE_FLOW_DISSECTOR:
2644 case BPF_PROG_TYPE_CGROUP_DEVICE:
2645 case BPF_PROG_TYPE_CGROUP_SOCK:
2646 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2647 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2648 case BPF_PROG_TYPE_CGROUP_SYSCTL:
2649 case BPF_PROG_TYPE_SOCK_OPS:
2650 case BPF_PROG_TYPE_EXT: /* extends any prog */
2651 case BPF_PROG_TYPE_NETFILTER:
2652 return true;
2653 case BPF_PROG_TYPE_CGROUP_SKB:
2654 /* always unpriv */
2655 case BPF_PROG_TYPE_SK_REUSEPORT:
2656 /* equivalent to SOCKET_FILTER. need CAP_BPF only */
2657 default:
2658 return false;
2659 }
2660}
2661
2662static bool is_perfmon_prog_type(enum bpf_prog_type prog_type)
2663{
2664 switch (prog_type) {
2665 case BPF_PROG_TYPE_KPROBE:
2666 case BPF_PROG_TYPE_TRACEPOINT:
2667 case BPF_PROG_TYPE_PERF_EVENT:
2668 case BPF_PROG_TYPE_RAW_TRACEPOINT:
2669 case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
2670 case BPF_PROG_TYPE_TRACING:
2671 case BPF_PROG_TYPE_LSM:
2672 case BPF_PROG_TYPE_STRUCT_OPS: /* has access to struct sock */
2673 case BPF_PROG_TYPE_EXT: /* extends any prog */
2674 return true;
2675 default:
2676 return false;
2677 }
2678}
2679
2680/* last field in 'union bpf_attr' used by this command */
2681#define BPF_PROG_LOAD_LAST_FIELD prog_token_fd
2682
2683static int bpf_prog_load(union bpf_attr *attr, bpfptr_t uattr, u32 uattr_size)
2684{
2685 enum bpf_prog_type type = attr->prog_type;
2686 struct bpf_prog *prog, *dst_prog = NULL;
2687 struct btf *attach_btf = NULL;
2688 struct bpf_token *token = NULL;
2689 bool bpf_cap;
2690 int err;
2691 char license[128];
2692
2693 if (CHECK_ATTR(BPF_PROG_LOAD))
2694 return -EINVAL;
2695
2696 if (attr->prog_flags & ~(BPF_F_STRICT_ALIGNMENT |
2697 BPF_F_ANY_ALIGNMENT |
2698 BPF_F_TEST_STATE_FREQ |
2699 BPF_F_SLEEPABLE |
2700 BPF_F_TEST_RND_HI32 |
2701 BPF_F_XDP_HAS_FRAGS |
2702 BPF_F_XDP_DEV_BOUND_ONLY |
2703 BPF_F_TEST_REG_INVARIANTS |
2704 BPF_F_TOKEN_FD))
2705 return -EINVAL;
2706
2707 bpf_prog_load_fixup_attach_type(attr);
2708
2709 if (attr->prog_flags & BPF_F_TOKEN_FD) {
2710 token = bpf_token_get_from_fd(attr->prog_token_fd);
2711 if (IS_ERR(token))
2712 return PTR_ERR(token);
2713 /* if current token doesn't grant prog loading permissions,
2714 * then we can't use this token, so ignore it and rely on
2715 * system-wide capabilities checks
2716 */
2717 if (!bpf_token_allow_cmd(token, BPF_PROG_LOAD) ||
2718 !bpf_token_allow_prog_type(token, attr->prog_type,
2719 attr->expected_attach_type)) {
2720 bpf_token_put(token);
2721 token = NULL;
2722 }
2723 }
2724
2725 bpf_cap = bpf_token_capable(token, CAP_BPF);
2726 err = -EPERM;
2727
2728 if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) &&
2729 (attr->prog_flags & BPF_F_ANY_ALIGNMENT) &&
2730 !bpf_cap)
2731 goto put_token;
2732
2733 /* Intent here is for unprivileged_bpf_disabled to block BPF program
2734 * creation for unprivileged users; other actions depend
2735 * on fd availability and access to bpffs, so are dependent on
2736 * object creation success. Even with unprivileged BPF disabled,
2737 * capability checks are still carried out for these
2738 * and other operations.
2739 */
2740 if (sysctl_unprivileged_bpf_disabled && !bpf_cap)
2741 goto put_token;
2742
2743 if (attr->insn_cnt == 0 ||
2744 attr->insn_cnt > (bpf_cap ? BPF_COMPLEXITY_LIMIT_INSNS : BPF_MAXINSNS)) {
2745 err = -E2BIG;
2746 goto put_token;
2747 }
2748 if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
2749 type != BPF_PROG_TYPE_CGROUP_SKB &&
2750 !bpf_cap)
2751 goto put_token;
2752
2753 if (is_net_admin_prog_type(type) && !bpf_token_capable(token, CAP_NET_ADMIN))
2754 goto put_token;
2755 if (is_perfmon_prog_type(type) && !bpf_token_capable(token, CAP_PERFMON))
2756 goto put_token;
2757
2758 /* attach_prog_fd/attach_btf_obj_fd can specify fd of either bpf_prog
2759 * or btf, we need to check which one it is
2760 */
2761 if (attr->attach_prog_fd) {
2762 dst_prog = bpf_prog_get(attr->attach_prog_fd);
2763 if (IS_ERR(dst_prog)) {
2764 dst_prog = NULL;
2765 attach_btf = btf_get_by_fd(attr->attach_btf_obj_fd);
2766 if (IS_ERR(attach_btf)) {
2767 err = -EINVAL;
2768 goto put_token;
2769 }
2770 if (!btf_is_kernel(attach_btf)) {
2771 /* attaching through specifying bpf_prog's BTF
2772 * objects directly might be supported eventually
2773 */
2774 btf_put(attach_btf);
2775 err = -ENOTSUPP;
2776 goto put_token;
2777 }
2778 }
2779 } else if (attr->attach_btf_id) {
2780 /* fall back to vmlinux BTF, if BTF type ID is specified */
2781 attach_btf = bpf_get_btf_vmlinux();
2782 if (IS_ERR(attach_btf)) {
2783 err = PTR_ERR(attach_btf);
2784 goto put_token;
2785 }
2786 if (!attach_btf) {
2787 err = -EINVAL;
2788 goto put_token;
2789 }
2790 btf_get(attach_btf);
2791 }
2792
2793 if (bpf_prog_load_check_attach(type, attr->expected_attach_type,
2794 attach_btf, attr->attach_btf_id,
2795 dst_prog)) {
2796 if (dst_prog)
2797 bpf_prog_put(dst_prog);
2798 if (attach_btf)
2799 btf_put(attach_btf);
2800 err = -EINVAL;
2801 goto put_token;
2802 }
2803
2804 /* plain bpf_prog allocation */
2805 prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
2806 if (!prog) {
2807 if (dst_prog)
2808 bpf_prog_put(dst_prog);
2809 if (attach_btf)
2810 btf_put(attach_btf);
2811 err = -EINVAL;
2812 goto put_token;
2813 }
2814
2815 prog->expected_attach_type = attr->expected_attach_type;
2816 prog->sleepable = !!(attr->prog_flags & BPF_F_SLEEPABLE);
2817 prog->aux->attach_btf = attach_btf;
2818 prog->aux->attach_btf_id = attr->attach_btf_id;
2819 prog->aux->dst_prog = dst_prog;
2820 prog->aux->dev_bound = !!attr->prog_ifindex;
2821 prog->aux->xdp_has_frags = attr->prog_flags & BPF_F_XDP_HAS_FRAGS;
2822
2823 /* move token into prog->aux, reuse taken refcnt */
2824 prog->aux->token = token;
2825 token = NULL;
2826
2827 prog->aux->user = get_current_user();
2828 prog->len = attr->insn_cnt;
2829
2830 err = -EFAULT;
2831 if (copy_from_bpfptr(prog->insns,
2832 make_bpfptr(attr->insns, uattr.is_kernel),
2833 bpf_prog_insn_size(prog)) != 0)
2834 goto free_prog;
2835 /* copy eBPF program license from user space */
2836 if (strncpy_from_bpfptr(license,
2837 make_bpfptr(attr->license, uattr.is_kernel),
2838 sizeof(license) - 1) < 0)
2839 goto free_prog;
2840 license[sizeof(license) - 1] = 0;
2841
2842 /* eBPF programs must be GPL compatible to use GPL-ed functions */
2843 prog->gpl_compatible = license_is_gpl_compatible(license) ? 1 : 0;
2844
2845 prog->orig_prog = NULL;
2846 prog->jited = 0;
2847
2848 atomic64_set(&prog->aux->refcnt, 1);
2849
2850 if (bpf_prog_is_dev_bound(prog->aux)) {
2851 err = bpf_prog_dev_bound_init(prog, attr);
2852 if (err)
2853 goto free_prog;
2854 }
2855
2856 if (type == BPF_PROG_TYPE_EXT && dst_prog &&
2857 bpf_prog_is_dev_bound(dst_prog->aux)) {
2858 err = bpf_prog_dev_bound_inherit(prog, dst_prog);
2859 if (err)
2860 goto free_prog;
2861 }
2862
2863 /*
2864 * Bookkeeping for managing the program attachment chain.
2865 *
2866 * It might be tempting to set attach_tracing_prog flag at the attachment
2867 * time, but this will not prevent from loading bunch of tracing prog
2868 * first, then attach them one to another.
2869 *
2870 * The flag attach_tracing_prog is set for the whole program lifecycle, and
2871 * doesn't have to be cleared in bpf_tracing_link_release, since tracing
2872 * programs cannot change attachment target.
2873 */
2874 if (type == BPF_PROG_TYPE_TRACING && dst_prog &&
2875 dst_prog->type == BPF_PROG_TYPE_TRACING) {
2876 prog->aux->attach_tracing_prog = true;
2877 }
2878
2879 /* find program type: socket_filter vs tracing_filter */
2880 err = find_prog_type(type, prog);
2881 if (err < 0)
2882 goto free_prog;
2883
2884 prog->aux->load_time = ktime_get_boottime_ns();
2885 err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name,
2886 sizeof(attr->prog_name));
2887 if (err < 0)
2888 goto free_prog;
2889
2890 err = security_bpf_prog_load(prog, attr, token);
2891 if (err)
2892 goto free_prog_sec;
2893
2894 /* run eBPF verifier */
2895 err = bpf_check(&prog, attr, uattr, uattr_size);
2896 if (err < 0)
2897 goto free_used_maps;
2898
2899 prog = bpf_prog_select_runtime(prog, &err);
2900 if (err < 0)
2901 goto free_used_maps;
2902
2903 err = bpf_prog_alloc_id(prog);
2904 if (err)
2905 goto free_used_maps;
2906
2907 /* Upon success of bpf_prog_alloc_id(), the BPF prog is
2908 * effectively publicly exposed. However, retrieving via
2909 * bpf_prog_get_fd_by_id() will take another reference,
2910 * therefore it cannot be gone underneath us.
2911 *
2912 * Only for the time /after/ successful bpf_prog_new_fd()
2913 * and before returning to userspace, we might just hold
2914 * one reference and any parallel close on that fd could
2915 * rip everything out. Hence, below notifications must
2916 * happen before bpf_prog_new_fd().
2917 *
2918 * Also, any failure handling from this point onwards must
2919 * be using bpf_prog_put() given the program is exposed.
2920 */
2921 bpf_prog_kallsyms_add(prog);
2922 perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_LOAD, 0);
2923 bpf_audit_prog(prog, BPF_AUDIT_LOAD);
2924
2925 err = bpf_prog_new_fd(prog);
2926 if (err < 0)
2927 bpf_prog_put(prog);
2928 return err;
2929
2930free_used_maps:
2931 /* In case we have subprogs, we need to wait for a grace
2932 * period before we can tear down JIT memory since symbols
2933 * are already exposed under kallsyms.
2934 */
2935 __bpf_prog_put_noref(prog, prog->aux->real_func_cnt);
2936 return err;
2937
2938free_prog_sec:
2939 security_bpf_prog_free(prog);
2940free_prog:
2941 free_uid(prog->aux->user);
2942 if (prog->aux->attach_btf)
2943 btf_put(prog->aux->attach_btf);
2944 bpf_prog_free(prog);
2945put_token:
2946 bpf_token_put(token);
2947 return err;
2948}
2949
2950#define BPF_OBJ_LAST_FIELD path_fd
2951
2952static int bpf_obj_pin(const union bpf_attr *attr)
2953{
2954 int path_fd;
2955
2956 if (CHECK_ATTR(BPF_OBJ) || attr->file_flags & ~BPF_F_PATH_FD)
2957 return -EINVAL;
2958
2959 /* path_fd has to be accompanied by BPF_F_PATH_FD flag */
2960 if (!(attr->file_flags & BPF_F_PATH_FD) && attr->path_fd)
2961 return -EINVAL;
2962
2963 path_fd = attr->file_flags & BPF_F_PATH_FD ? attr->path_fd : AT_FDCWD;
2964 return bpf_obj_pin_user(attr->bpf_fd, path_fd,
2965 u64_to_user_ptr(attr->pathname));
2966}
2967
2968static int bpf_obj_get(const union bpf_attr *attr)
2969{
2970 int path_fd;
2971
2972 if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
2973 attr->file_flags & ~(BPF_OBJ_FLAG_MASK | BPF_F_PATH_FD))
2974 return -EINVAL;
2975
2976 /* path_fd has to be accompanied by BPF_F_PATH_FD flag */
2977 if (!(attr->file_flags & BPF_F_PATH_FD) && attr->path_fd)
2978 return -EINVAL;
2979
2980 path_fd = attr->file_flags & BPF_F_PATH_FD ? attr->path_fd : AT_FDCWD;
2981 return bpf_obj_get_user(path_fd, u64_to_user_ptr(attr->pathname),
2982 attr->file_flags);
2983}
2984
2985void bpf_link_init(struct bpf_link *link, enum bpf_link_type type,
2986 const struct bpf_link_ops *ops, struct bpf_prog *prog)
2987{
2988 atomic64_set(&link->refcnt, 1);
2989 link->type = type;
2990 link->id = 0;
2991 link->ops = ops;
2992 link->prog = prog;
2993}
2994
2995static void bpf_link_free_id(int id)
2996{
2997 if (!id)
2998 return;
2999
3000 spin_lock_bh(&link_idr_lock);
3001 idr_remove(&link_idr, id);
3002 spin_unlock_bh(&link_idr_lock);
3003}
3004
3005/* Clean up bpf_link and corresponding anon_inode file and FD. After
3006 * anon_inode is created, bpf_link can't be just kfree()'d due to deferred
3007 * anon_inode's release() call. This helper marks bpf_link as
3008 * defunct, releases anon_inode file and puts reserved FD. bpf_prog's refcnt
3009 * is not decremented, it's the responsibility of a calling code that failed
3010 * to complete bpf_link initialization.
3011 * This helper eventually calls link's dealloc callback, but does not call
3012 * link's release callback.
3013 */
3014void bpf_link_cleanup(struct bpf_link_primer *primer)
3015{
3016 primer->link->prog = NULL;
3017 bpf_link_free_id(primer->id);
3018 fput(primer->file);
3019 put_unused_fd(primer->fd);
3020}
3021
3022void bpf_link_inc(struct bpf_link *link)
3023{
3024 atomic64_inc(&link->refcnt);
3025}
3026
3027static void bpf_link_defer_dealloc_rcu_gp(struct rcu_head *rcu)
3028{
3029 struct bpf_link *link = container_of(rcu, struct bpf_link, rcu);
3030
3031 /* free bpf_link and its containing memory */
3032 link->ops->dealloc_deferred(link);
3033}
3034
3035static void bpf_link_defer_dealloc_mult_rcu_gp(struct rcu_head *rcu)
3036{
3037 if (rcu_trace_implies_rcu_gp())
3038 bpf_link_defer_dealloc_rcu_gp(rcu);
3039 else
3040 call_rcu(rcu, bpf_link_defer_dealloc_rcu_gp);
3041}
3042
3043/* bpf_link_free is guaranteed to be called from process context */
3044static void bpf_link_free(struct bpf_link *link)
3045{
3046 bool sleepable = false;
3047
3048 bpf_link_free_id(link->id);
3049 if (link->prog) {
3050 sleepable = link->prog->sleepable;
3051 /* detach BPF program, clean up used resources */
3052 link->ops->release(link);
3053 bpf_prog_put(link->prog);
3054 }
3055 if (link->ops->dealloc_deferred) {
3056 /* schedule BPF link deallocation; if underlying BPF program
3057 * is sleepable, we need to first wait for RCU tasks trace
3058 * sync, then go through "classic" RCU grace period
3059 */
3060 if (sleepable)
3061 call_rcu_tasks_trace(&link->rcu, bpf_link_defer_dealloc_mult_rcu_gp);
3062 else
3063 call_rcu(&link->rcu, bpf_link_defer_dealloc_rcu_gp);
3064 }
3065 if (link->ops->dealloc)
3066 link->ops->dealloc(link);
3067}
3068
3069static void bpf_link_put_deferred(struct work_struct *work)
3070{
3071 struct bpf_link *link = container_of(work, struct bpf_link, work);
3072
3073 bpf_link_free(link);
3074}
3075
3076/* bpf_link_put might be called from atomic context. It needs to be called
3077 * from sleepable context in order to acquire sleeping locks during the process.
3078 */
3079void bpf_link_put(struct bpf_link *link)
3080{
3081 if (!atomic64_dec_and_test(&link->refcnt))
3082 return;
3083
3084 INIT_WORK(&link->work, bpf_link_put_deferred);
3085 schedule_work(&link->work);
3086}
3087EXPORT_SYMBOL(bpf_link_put);
3088
3089static void bpf_link_put_direct(struct bpf_link *link)
3090{
3091 if (!atomic64_dec_and_test(&link->refcnt))
3092 return;
3093 bpf_link_free(link);
3094}
3095
3096static int bpf_link_release(struct inode *inode, struct file *filp)
3097{
3098 struct bpf_link *link = filp->private_data;
3099
3100 bpf_link_put_direct(link);
3101 return 0;
3102}
3103
3104#ifdef CONFIG_PROC_FS
3105#define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type)
3106#define BPF_MAP_TYPE(_id, _ops)
3107#define BPF_LINK_TYPE(_id, _name) [_id] = #_name,
3108static const char *bpf_link_type_strs[] = {
3109 [BPF_LINK_TYPE_UNSPEC] = "<invalid>",
3110#include <linux/bpf_types.h>
3111};
3112#undef BPF_PROG_TYPE
3113#undef BPF_MAP_TYPE
3114#undef BPF_LINK_TYPE
3115
3116static void bpf_link_show_fdinfo(struct seq_file *m, struct file *filp)
3117{
3118 const struct bpf_link *link = filp->private_data;
3119 const struct bpf_prog *prog = link->prog;
3120 char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
3121
3122 seq_printf(m,
3123 "link_type:\t%s\n"
3124 "link_id:\t%u\n",
3125 bpf_link_type_strs[link->type],
3126 link->id);
3127 if (prog) {
3128 bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
3129 seq_printf(m,
3130 "prog_tag:\t%s\n"
3131 "prog_id:\t%u\n",
3132 prog_tag,
3133 prog->aux->id);
3134 }
3135 if (link->ops->show_fdinfo)
3136 link->ops->show_fdinfo(link, m);
3137}
3138#endif
3139
3140static const struct file_operations bpf_link_fops = {
3141#ifdef CONFIG_PROC_FS
3142 .show_fdinfo = bpf_link_show_fdinfo,
3143#endif
3144 .release = bpf_link_release,
3145 .read = bpf_dummy_read,
3146 .write = bpf_dummy_write,
3147};
3148
3149static int bpf_link_alloc_id(struct bpf_link *link)
3150{
3151 int id;
3152
3153 idr_preload(GFP_KERNEL);
3154 spin_lock_bh(&link_idr_lock);
3155 id = idr_alloc_cyclic(&link_idr, link, 1, INT_MAX, GFP_ATOMIC);
3156 spin_unlock_bh(&link_idr_lock);
3157 idr_preload_end();
3158
3159 return id;
3160}
3161
3162/* Prepare bpf_link to be exposed to user-space by allocating anon_inode file,
3163 * reserving unused FD and allocating ID from link_idr. This is to be paired
3164 * with bpf_link_settle() to install FD and ID and expose bpf_link to
3165 * user-space, if bpf_link is successfully attached. If not, bpf_link and
3166 * pre-allocated resources are to be freed with bpf_cleanup() call. All the
3167 * transient state is passed around in struct bpf_link_primer.
3168 * This is preferred way to create and initialize bpf_link, especially when
3169 * there are complicated and expensive operations in between creating bpf_link
3170 * itself and attaching it to BPF hook. By using bpf_link_prime() and
3171 * bpf_link_settle() kernel code using bpf_link doesn't have to perform
3172 * expensive (and potentially failing) roll back operations in a rare case
3173 * that file, FD, or ID can't be allocated.
3174 */
3175int bpf_link_prime(struct bpf_link *link, struct bpf_link_primer *primer)
3176{
3177 struct file *file;
3178 int fd, id;
3179
3180 fd = get_unused_fd_flags(O_CLOEXEC);
3181 if (fd < 0)
3182 return fd;
3183
3184
3185 id = bpf_link_alloc_id(link);
3186 if (id < 0) {
3187 put_unused_fd(fd);
3188 return id;
3189 }
3190
3191 file = anon_inode_getfile("bpf_link", &bpf_link_fops, link, O_CLOEXEC);
3192 if (IS_ERR(file)) {
3193 bpf_link_free_id(id);
3194 put_unused_fd(fd);
3195 return PTR_ERR(file);
3196 }
3197
3198 primer->link = link;
3199 primer->file = file;
3200 primer->fd = fd;
3201 primer->id = id;
3202 return 0;
3203}
3204
3205int bpf_link_settle(struct bpf_link_primer *primer)
3206{
3207 /* make bpf_link fetchable by ID */
3208 spin_lock_bh(&link_idr_lock);
3209 primer->link->id = primer->id;
3210 spin_unlock_bh(&link_idr_lock);
3211 /* make bpf_link fetchable by FD */
3212 fd_install(primer->fd, primer->file);
3213 /* pass through installed FD */
3214 return primer->fd;
3215}
3216
3217int bpf_link_new_fd(struct bpf_link *link)
3218{
3219 return anon_inode_getfd("bpf-link", &bpf_link_fops, link, O_CLOEXEC);
3220}
3221
3222struct bpf_link *bpf_link_get_from_fd(u32 ufd)
3223{
3224 struct fd f = fdget(ufd);
3225 struct bpf_link *link;
3226
3227 if (!f.file)
3228 return ERR_PTR(-EBADF);
3229 if (f.file->f_op != &bpf_link_fops) {
3230 fdput(f);
3231 return ERR_PTR(-EINVAL);
3232 }
3233
3234 link = f.file->private_data;
3235 bpf_link_inc(link);
3236 fdput(f);
3237
3238 return link;
3239}
3240EXPORT_SYMBOL(bpf_link_get_from_fd);
3241
3242static void bpf_tracing_link_release(struct bpf_link *link)
3243{
3244 struct bpf_tracing_link *tr_link =
3245 container_of(link, struct bpf_tracing_link, link.link);
3246
3247 WARN_ON_ONCE(bpf_trampoline_unlink_prog(&tr_link->link,
3248 tr_link->trampoline));
3249
3250 bpf_trampoline_put(tr_link->trampoline);
3251
3252 /* tgt_prog is NULL if target is a kernel function */
3253 if (tr_link->tgt_prog)
3254 bpf_prog_put(tr_link->tgt_prog);
3255}
3256
3257static void bpf_tracing_link_dealloc(struct bpf_link *link)
3258{
3259 struct bpf_tracing_link *tr_link =
3260 container_of(link, struct bpf_tracing_link, link.link);
3261
3262 kfree(tr_link);
3263}
3264
3265static void bpf_tracing_link_show_fdinfo(const struct bpf_link *link,
3266 struct seq_file *seq)
3267{
3268 struct bpf_tracing_link *tr_link =
3269 container_of(link, struct bpf_tracing_link, link.link);
3270 u32 target_btf_id, target_obj_id;
3271
3272 bpf_trampoline_unpack_key(tr_link->trampoline->key,
3273 &target_obj_id, &target_btf_id);
3274 seq_printf(seq,
3275 "attach_type:\t%d\n"
3276 "target_obj_id:\t%u\n"
3277 "target_btf_id:\t%u\n",
3278 tr_link->attach_type,
3279 target_obj_id,
3280 target_btf_id);
3281}
3282
3283static int bpf_tracing_link_fill_link_info(const struct bpf_link *link,
3284 struct bpf_link_info *info)
3285{
3286 struct bpf_tracing_link *tr_link =
3287 container_of(link, struct bpf_tracing_link, link.link);
3288
3289 info->tracing.attach_type = tr_link->attach_type;
3290 bpf_trampoline_unpack_key(tr_link->trampoline->key,
3291 &info->tracing.target_obj_id,
3292 &info->tracing.target_btf_id);
3293
3294 return 0;
3295}
3296
3297static const struct bpf_link_ops bpf_tracing_link_lops = {
3298 .release = bpf_tracing_link_release,
3299 .dealloc = bpf_tracing_link_dealloc,
3300 .show_fdinfo = bpf_tracing_link_show_fdinfo,
3301 .fill_link_info = bpf_tracing_link_fill_link_info,
3302};
3303
3304static int bpf_tracing_prog_attach(struct bpf_prog *prog,
3305 int tgt_prog_fd,
3306 u32 btf_id,
3307 u64 bpf_cookie)
3308{
3309 struct bpf_link_primer link_primer;
3310 struct bpf_prog *tgt_prog = NULL;
3311 struct bpf_trampoline *tr = NULL;
3312 struct bpf_tracing_link *link;
3313 u64 key = 0;
3314 int err;
3315
3316 switch (prog->type) {
3317 case BPF_PROG_TYPE_TRACING:
3318 if (prog->expected_attach_type != BPF_TRACE_FENTRY &&
3319 prog->expected_attach_type != BPF_TRACE_FEXIT &&
3320 prog->expected_attach_type != BPF_MODIFY_RETURN) {
3321 err = -EINVAL;
3322 goto out_put_prog;
3323 }
3324 break;
3325 case BPF_PROG_TYPE_EXT:
3326 if (prog->expected_attach_type != 0) {
3327 err = -EINVAL;
3328 goto out_put_prog;
3329 }
3330 break;
3331 case BPF_PROG_TYPE_LSM:
3332 if (prog->expected_attach_type != BPF_LSM_MAC) {
3333 err = -EINVAL;
3334 goto out_put_prog;
3335 }
3336 break;
3337 default:
3338 err = -EINVAL;
3339 goto out_put_prog;
3340 }
3341
3342 if (!!tgt_prog_fd != !!btf_id) {
3343 err = -EINVAL;
3344 goto out_put_prog;
3345 }
3346
3347 if (tgt_prog_fd) {
3348 /*
3349 * For now we only allow new targets for BPF_PROG_TYPE_EXT. If this
3350 * part would be changed to implement the same for
3351 * BPF_PROG_TYPE_TRACING, do not forget to update the way how
3352 * attach_tracing_prog flag is set.
3353 */
3354 if (prog->type != BPF_PROG_TYPE_EXT) {
3355 err = -EINVAL;
3356 goto out_put_prog;
3357 }
3358
3359 tgt_prog = bpf_prog_get(tgt_prog_fd);
3360 if (IS_ERR(tgt_prog)) {
3361 err = PTR_ERR(tgt_prog);
3362 tgt_prog = NULL;
3363 goto out_put_prog;
3364 }
3365
3366 key = bpf_trampoline_compute_key(tgt_prog, NULL, btf_id);
3367 }
3368
3369 link = kzalloc(sizeof(*link), GFP_USER);
3370 if (!link) {
3371 err = -ENOMEM;
3372 goto out_put_prog;
3373 }
3374 bpf_link_init(&link->link.link, BPF_LINK_TYPE_TRACING,
3375 &bpf_tracing_link_lops, prog);
3376 link->attach_type = prog->expected_attach_type;
3377 link->link.cookie = bpf_cookie;
3378
3379 mutex_lock(&prog->aux->dst_mutex);
3380
3381 /* There are a few possible cases here:
3382 *
3383 * - if prog->aux->dst_trampoline is set, the program was just loaded
3384 * and not yet attached to anything, so we can use the values stored
3385 * in prog->aux
3386 *
3387 * - if prog->aux->dst_trampoline is NULL, the program has already been
3388 * attached to a target and its initial target was cleared (below)
3389 *
3390 * - if tgt_prog != NULL, the caller specified tgt_prog_fd +
3391 * target_btf_id using the link_create API.
3392 *
3393 * - if tgt_prog == NULL when this function was called using the old
3394 * raw_tracepoint_open API, and we need a target from prog->aux
3395 *
3396 * - if prog->aux->dst_trampoline and tgt_prog is NULL, the program
3397 * was detached and is going for re-attachment.
3398 *
3399 * - if prog->aux->dst_trampoline is NULL and tgt_prog and prog->aux->attach_btf
3400 * are NULL, then program was already attached and user did not provide
3401 * tgt_prog_fd so we have no way to find out or create trampoline
3402 */
3403 if (!prog->aux->dst_trampoline && !tgt_prog) {
3404 /*
3405 * Allow re-attach for TRACING and LSM programs. If it's
3406 * currently linked, bpf_trampoline_link_prog will fail.
3407 * EXT programs need to specify tgt_prog_fd, so they
3408 * re-attach in separate code path.
3409 */
3410 if (prog->type != BPF_PROG_TYPE_TRACING &&
3411 prog->type != BPF_PROG_TYPE_LSM) {
3412 err = -EINVAL;
3413 goto out_unlock;
3414 }
3415 /* We can allow re-attach only if we have valid attach_btf. */
3416 if (!prog->aux->attach_btf) {
3417 err = -EINVAL;
3418 goto out_unlock;
3419 }
3420 btf_id = prog->aux->attach_btf_id;
3421 key = bpf_trampoline_compute_key(NULL, prog->aux->attach_btf, btf_id);
3422 }
3423
3424 if (!prog->aux->dst_trampoline ||
3425 (key && key != prog->aux->dst_trampoline->key)) {
3426 /* If there is no saved target, or the specified target is
3427 * different from the destination specified at load time, we
3428 * need a new trampoline and a check for compatibility
3429 */
3430 struct bpf_attach_target_info tgt_info = {};
3431
3432 err = bpf_check_attach_target(NULL, prog, tgt_prog, btf_id,
3433 &tgt_info);
3434 if (err)
3435 goto out_unlock;
3436
3437 if (tgt_info.tgt_mod) {
3438 module_put(prog->aux->mod);
3439 prog->aux->mod = tgt_info.tgt_mod;
3440 }
3441
3442 tr = bpf_trampoline_get(key, &tgt_info);
3443 if (!tr) {
3444 err = -ENOMEM;
3445 goto out_unlock;
3446 }
3447 } else {
3448 /* The caller didn't specify a target, or the target was the
3449 * same as the destination supplied during program load. This
3450 * means we can reuse the trampoline and reference from program
3451 * load time, and there is no need to allocate a new one. This
3452 * can only happen once for any program, as the saved values in
3453 * prog->aux are cleared below.
3454 */
3455 tr = prog->aux->dst_trampoline;
3456 tgt_prog = prog->aux->dst_prog;
3457 }
3458
3459 err = bpf_link_prime(&link->link.link, &link_primer);
3460 if (err)
3461 goto out_unlock;
3462
3463 err = bpf_trampoline_link_prog(&link->link, tr);
3464 if (err) {
3465 bpf_link_cleanup(&link_primer);
3466 link = NULL;
3467 goto out_unlock;
3468 }
3469
3470 link->tgt_prog = tgt_prog;
3471 link->trampoline = tr;
3472
3473 /* Always clear the trampoline and target prog from prog->aux to make
3474 * sure the original attach destination is not kept alive after a
3475 * program is (re-)attached to another target.
3476 */
3477 if (prog->aux->dst_prog &&
3478 (tgt_prog_fd || tr != prog->aux->dst_trampoline))
3479 /* got extra prog ref from syscall, or attaching to different prog */
3480 bpf_prog_put(prog->aux->dst_prog);
3481 if (prog->aux->dst_trampoline && tr != prog->aux->dst_trampoline)
3482 /* we allocated a new trampoline, so free the old one */
3483 bpf_trampoline_put(prog->aux->dst_trampoline);
3484
3485 prog->aux->dst_prog = NULL;
3486 prog->aux->dst_trampoline = NULL;
3487 mutex_unlock(&prog->aux->dst_mutex);
3488
3489 return bpf_link_settle(&link_primer);
3490out_unlock:
3491 if (tr && tr != prog->aux->dst_trampoline)
3492 bpf_trampoline_put(tr);
3493 mutex_unlock(&prog->aux->dst_mutex);
3494 kfree(link);
3495out_put_prog:
3496 if (tgt_prog_fd && tgt_prog)
3497 bpf_prog_put(tgt_prog);
3498 return err;
3499}
3500
3501struct bpf_raw_tp_link {
3502 struct bpf_link link;
3503 struct bpf_raw_event_map *btp;
3504};
3505
3506static void bpf_raw_tp_link_release(struct bpf_link *link)
3507{
3508 struct bpf_raw_tp_link *raw_tp =
3509 container_of(link, struct bpf_raw_tp_link, link);
3510
3511 bpf_probe_unregister(raw_tp->btp, raw_tp->link.prog);
3512 bpf_put_raw_tracepoint(raw_tp->btp);
3513}
3514
3515static void bpf_raw_tp_link_dealloc(struct bpf_link *link)
3516{
3517 struct bpf_raw_tp_link *raw_tp =
3518 container_of(link, struct bpf_raw_tp_link, link);
3519
3520 kfree(raw_tp);
3521}
3522
3523static void bpf_raw_tp_link_show_fdinfo(const struct bpf_link *link,
3524 struct seq_file *seq)
3525{
3526 struct bpf_raw_tp_link *raw_tp_link =
3527 container_of(link, struct bpf_raw_tp_link, link);
3528
3529 seq_printf(seq,
3530 "tp_name:\t%s\n",
3531 raw_tp_link->btp->tp->name);
3532}
3533
3534static int bpf_copy_to_user(char __user *ubuf, const char *buf, u32 ulen,
3535 u32 len)
3536{
3537 if (ulen >= len + 1) {
3538 if (copy_to_user(ubuf, buf, len + 1))
3539 return -EFAULT;
3540 } else {
3541 char zero = '\0';
3542
3543 if (copy_to_user(ubuf, buf, ulen - 1))
3544 return -EFAULT;
3545 if (put_user(zero, ubuf + ulen - 1))
3546 return -EFAULT;
3547 return -ENOSPC;
3548 }
3549
3550 return 0;
3551}
3552
3553static int bpf_raw_tp_link_fill_link_info(const struct bpf_link *link,
3554 struct bpf_link_info *info)
3555{
3556 struct bpf_raw_tp_link *raw_tp_link =
3557 container_of(link, struct bpf_raw_tp_link, link);
3558 char __user *ubuf = u64_to_user_ptr(info->raw_tracepoint.tp_name);
3559 const char *tp_name = raw_tp_link->btp->tp->name;
3560 u32 ulen = info->raw_tracepoint.tp_name_len;
3561 size_t tp_len = strlen(tp_name);
3562
3563 if (!ulen ^ !ubuf)
3564 return -EINVAL;
3565
3566 info->raw_tracepoint.tp_name_len = tp_len + 1;
3567
3568 if (!ubuf)
3569 return 0;
3570
3571 return bpf_copy_to_user(ubuf, tp_name, ulen, tp_len);
3572}
3573
3574static const struct bpf_link_ops bpf_raw_tp_link_lops = {
3575 .release = bpf_raw_tp_link_release,
3576 .dealloc_deferred = bpf_raw_tp_link_dealloc,
3577 .show_fdinfo = bpf_raw_tp_link_show_fdinfo,
3578 .fill_link_info = bpf_raw_tp_link_fill_link_info,
3579};
3580
3581#ifdef CONFIG_PERF_EVENTS
3582struct bpf_perf_link {
3583 struct bpf_link link;
3584 struct file *perf_file;
3585};
3586
3587static void bpf_perf_link_release(struct bpf_link *link)
3588{
3589 struct bpf_perf_link *perf_link = container_of(link, struct bpf_perf_link, link);
3590 struct perf_event *event = perf_link->perf_file->private_data;
3591
3592 perf_event_free_bpf_prog(event);
3593 fput(perf_link->perf_file);
3594}
3595
3596static void bpf_perf_link_dealloc(struct bpf_link *link)
3597{
3598 struct bpf_perf_link *perf_link = container_of(link, struct bpf_perf_link, link);
3599
3600 kfree(perf_link);
3601}
3602
3603static int bpf_perf_link_fill_common(const struct perf_event *event,
3604 char __user *uname, u32 ulen,
3605 u64 *probe_offset, u64 *probe_addr,
3606 u32 *fd_type, unsigned long *missed)
3607{
3608 const char *buf;
3609 u32 prog_id;
3610 size_t len;
3611 int err;
3612
3613 if (!ulen ^ !uname)
3614 return -EINVAL;
3615
3616 err = bpf_get_perf_event_info(event, &prog_id, fd_type, &buf,
3617 probe_offset, probe_addr, missed);
3618 if (err)
3619 return err;
3620 if (!uname)
3621 return 0;
3622 if (buf) {
3623 len = strlen(buf);
3624 err = bpf_copy_to_user(uname, buf, ulen, len);
3625 if (err)
3626 return err;
3627 } else {
3628 char zero = '\0';
3629
3630 if (put_user(zero, uname))
3631 return -EFAULT;
3632 }
3633 return 0;
3634}
3635
3636#ifdef CONFIG_KPROBE_EVENTS
3637static int bpf_perf_link_fill_kprobe(const struct perf_event *event,
3638 struct bpf_link_info *info)
3639{
3640 unsigned long missed;
3641 char __user *uname;
3642 u64 addr, offset;
3643 u32 ulen, type;
3644 int err;
3645
3646 uname = u64_to_user_ptr(info->perf_event.kprobe.func_name);
3647 ulen = info->perf_event.kprobe.name_len;
3648 err = bpf_perf_link_fill_common(event, uname, ulen, &offset, &addr,
3649 &type, &missed);
3650 if (err)
3651 return err;
3652 if (type == BPF_FD_TYPE_KRETPROBE)
3653 info->perf_event.type = BPF_PERF_EVENT_KRETPROBE;
3654 else
3655 info->perf_event.type = BPF_PERF_EVENT_KPROBE;
3656
3657 info->perf_event.kprobe.offset = offset;
3658 info->perf_event.kprobe.missed = missed;
3659 if (!kallsyms_show_value(current_cred()))
3660 addr = 0;
3661 info->perf_event.kprobe.addr = addr;
3662 info->perf_event.kprobe.cookie = event->bpf_cookie;
3663 return 0;
3664}
3665#endif
3666
3667#ifdef CONFIG_UPROBE_EVENTS
3668static int bpf_perf_link_fill_uprobe(const struct perf_event *event,
3669 struct bpf_link_info *info)
3670{
3671 char __user *uname;
3672 u64 addr, offset;
3673 u32 ulen, type;
3674 int err;
3675
3676 uname = u64_to_user_ptr(info->perf_event.uprobe.file_name);
3677 ulen = info->perf_event.uprobe.name_len;
3678 err = bpf_perf_link_fill_common(event, uname, ulen, &offset, &addr,
3679 &type, NULL);
3680 if (err)
3681 return err;
3682
3683 if (type == BPF_FD_TYPE_URETPROBE)
3684 info->perf_event.type = BPF_PERF_EVENT_URETPROBE;
3685 else
3686 info->perf_event.type = BPF_PERF_EVENT_UPROBE;
3687 info->perf_event.uprobe.offset = offset;
3688 info->perf_event.uprobe.cookie = event->bpf_cookie;
3689 return 0;
3690}
3691#endif
3692
3693static int bpf_perf_link_fill_probe(const struct perf_event *event,
3694 struct bpf_link_info *info)
3695{
3696#ifdef CONFIG_KPROBE_EVENTS
3697 if (event->tp_event->flags & TRACE_EVENT_FL_KPROBE)
3698 return bpf_perf_link_fill_kprobe(event, info);
3699#endif
3700#ifdef CONFIG_UPROBE_EVENTS
3701 if (event->tp_event->flags & TRACE_EVENT_FL_UPROBE)
3702 return bpf_perf_link_fill_uprobe(event, info);
3703#endif
3704 return -EOPNOTSUPP;
3705}
3706
3707static int bpf_perf_link_fill_tracepoint(const struct perf_event *event,
3708 struct bpf_link_info *info)
3709{
3710 char __user *uname;
3711 u32 ulen;
3712
3713 uname = u64_to_user_ptr(info->perf_event.tracepoint.tp_name);
3714 ulen = info->perf_event.tracepoint.name_len;
3715 info->perf_event.type = BPF_PERF_EVENT_TRACEPOINT;
3716 info->perf_event.tracepoint.cookie = event->bpf_cookie;
3717 return bpf_perf_link_fill_common(event, uname, ulen, NULL, NULL, NULL, NULL);
3718}
3719
3720static int bpf_perf_link_fill_perf_event(const struct perf_event *event,
3721 struct bpf_link_info *info)
3722{
3723 info->perf_event.event.type = event->attr.type;
3724 info->perf_event.event.config = event->attr.config;
3725 info->perf_event.event.cookie = event->bpf_cookie;
3726 info->perf_event.type = BPF_PERF_EVENT_EVENT;
3727 return 0;
3728}
3729
3730static int bpf_perf_link_fill_link_info(const struct bpf_link *link,
3731 struct bpf_link_info *info)
3732{
3733 struct bpf_perf_link *perf_link;
3734 const struct perf_event *event;
3735
3736 perf_link = container_of(link, struct bpf_perf_link, link);
3737 event = perf_get_event(perf_link->perf_file);
3738 if (IS_ERR(event))
3739 return PTR_ERR(event);
3740
3741 switch (event->prog->type) {
3742 case BPF_PROG_TYPE_PERF_EVENT:
3743 return bpf_perf_link_fill_perf_event(event, info);
3744 case BPF_PROG_TYPE_TRACEPOINT:
3745 return bpf_perf_link_fill_tracepoint(event, info);
3746 case BPF_PROG_TYPE_KPROBE:
3747 return bpf_perf_link_fill_probe(event, info);
3748 default:
3749 return -EOPNOTSUPP;
3750 }
3751}
3752
3753static const struct bpf_link_ops bpf_perf_link_lops = {
3754 .release = bpf_perf_link_release,
3755 .dealloc = bpf_perf_link_dealloc,
3756 .fill_link_info = bpf_perf_link_fill_link_info,
3757};
3758
3759static int bpf_perf_link_attach(const union bpf_attr *attr, struct bpf_prog *prog)
3760{
3761 struct bpf_link_primer link_primer;
3762 struct bpf_perf_link *link;
3763 struct perf_event *event;
3764 struct file *perf_file;
3765 int err;
3766
3767 if (attr->link_create.flags)
3768 return -EINVAL;
3769
3770 perf_file = perf_event_get(attr->link_create.target_fd);
3771 if (IS_ERR(perf_file))
3772 return PTR_ERR(perf_file);
3773
3774 link = kzalloc(sizeof(*link), GFP_USER);
3775 if (!link) {
3776 err = -ENOMEM;
3777 goto out_put_file;
3778 }
3779 bpf_link_init(&link->link, BPF_LINK_TYPE_PERF_EVENT, &bpf_perf_link_lops, prog);
3780 link->perf_file = perf_file;
3781
3782 err = bpf_link_prime(&link->link, &link_primer);
3783 if (err) {
3784 kfree(link);
3785 goto out_put_file;
3786 }
3787
3788 event = perf_file->private_data;
3789 err = perf_event_set_bpf_prog(event, prog, attr->link_create.perf_event.bpf_cookie);
3790 if (err) {
3791 bpf_link_cleanup(&link_primer);
3792 goto out_put_file;
3793 }
3794 /* perf_event_set_bpf_prog() doesn't take its own refcnt on prog */
3795 bpf_prog_inc(prog);
3796
3797 return bpf_link_settle(&link_primer);
3798
3799out_put_file:
3800 fput(perf_file);
3801 return err;
3802}
3803#else
3804static int bpf_perf_link_attach(const union bpf_attr *attr, struct bpf_prog *prog)
3805{
3806 return -EOPNOTSUPP;
3807}
3808#endif /* CONFIG_PERF_EVENTS */
3809
3810static int bpf_raw_tp_link_attach(struct bpf_prog *prog,
3811 const char __user *user_tp_name)
3812{
3813 struct bpf_link_primer link_primer;
3814 struct bpf_raw_tp_link *link;
3815 struct bpf_raw_event_map *btp;
3816 const char *tp_name;
3817 char buf[128];
3818 int err;
3819
3820 switch (prog->type) {
3821 case BPF_PROG_TYPE_TRACING:
3822 case BPF_PROG_TYPE_EXT:
3823 case BPF_PROG_TYPE_LSM:
3824 if (user_tp_name)
3825 /* The attach point for this category of programs
3826 * should be specified via btf_id during program load.
3827 */
3828 return -EINVAL;
3829 if (prog->type == BPF_PROG_TYPE_TRACING &&
3830 prog->expected_attach_type == BPF_TRACE_RAW_TP) {
3831 tp_name = prog->aux->attach_func_name;
3832 break;
3833 }
3834 return bpf_tracing_prog_attach(prog, 0, 0, 0);
3835 case BPF_PROG_TYPE_RAW_TRACEPOINT:
3836 case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
3837 if (strncpy_from_user(buf, user_tp_name, sizeof(buf) - 1) < 0)
3838 return -EFAULT;
3839 buf[sizeof(buf) - 1] = 0;
3840 tp_name = buf;
3841 break;
3842 default:
3843 return -EINVAL;
3844 }
3845
3846 btp = bpf_get_raw_tracepoint(tp_name);
3847 if (!btp)
3848 return -ENOENT;
3849
3850 link = kzalloc(sizeof(*link), GFP_USER);
3851 if (!link) {
3852 err = -ENOMEM;
3853 goto out_put_btp;
3854 }
3855 bpf_link_init(&link->link, BPF_LINK_TYPE_RAW_TRACEPOINT,
3856 &bpf_raw_tp_link_lops, prog);
3857 link->btp = btp;
3858
3859 err = bpf_link_prime(&link->link, &link_primer);
3860 if (err) {
3861 kfree(link);
3862 goto out_put_btp;
3863 }
3864
3865 err = bpf_probe_register(link->btp, prog);
3866 if (err) {
3867 bpf_link_cleanup(&link_primer);
3868 goto out_put_btp;
3869 }
3870
3871 return bpf_link_settle(&link_primer);
3872
3873out_put_btp:
3874 bpf_put_raw_tracepoint(btp);
3875 return err;
3876}
3877
3878#define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd
3879
3880static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
3881{
3882 struct bpf_prog *prog;
3883 int fd;
3884
3885 if (CHECK_ATTR(BPF_RAW_TRACEPOINT_OPEN))
3886 return -EINVAL;
3887
3888 prog = bpf_prog_get(attr->raw_tracepoint.prog_fd);
3889 if (IS_ERR(prog))
3890 return PTR_ERR(prog);
3891
3892 fd = bpf_raw_tp_link_attach(prog, u64_to_user_ptr(attr->raw_tracepoint.name));
3893 if (fd < 0)
3894 bpf_prog_put(prog);
3895 return fd;
3896}
3897
3898static enum bpf_prog_type
3899attach_type_to_prog_type(enum bpf_attach_type attach_type)
3900{
3901 switch (attach_type) {
3902 case BPF_CGROUP_INET_INGRESS:
3903 case BPF_CGROUP_INET_EGRESS:
3904 return BPF_PROG_TYPE_CGROUP_SKB;
3905 case BPF_CGROUP_INET_SOCK_CREATE:
3906 case BPF_CGROUP_INET_SOCK_RELEASE:
3907 case BPF_CGROUP_INET4_POST_BIND:
3908 case BPF_CGROUP_INET6_POST_BIND:
3909 return BPF_PROG_TYPE_CGROUP_SOCK;
3910 case BPF_CGROUP_INET4_BIND:
3911 case BPF_CGROUP_INET6_BIND:
3912 case BPF_CGROUP_INET4_CONNECT:
3913 case BPF_CGROUP_INET6_CONNECT:
3914 case BPF_CGROUP_UNIX_CONNECT:
3915 case BPF_CGROUP_INET4_GETPEERNAME:
3916 case BPF_CGROUP_INET6_GETPEERNAME:
3917 case BPF_CGROUP_UNIX_GETPEERNAME:
3918 case BPF_CGROUP_INET4_GETSOCKNAME:
3919 case BPF_CGROUP_INET6_GETSOCKNAME:
3920 case BPF_CGROUP_UNIX_GETSOCKNAME:
3921 case BPF_CGROUP_UDP4_SENDMSG:
3922 case BPF_CGROUP_UDP6_SENDMSG:
3923 case BPF_CGROUP_UNIX_SENDMSG:
3924 case BPF_CGROUP_UDP4_RECVMSG:
3925 case BPF_CGROUP_UDP6_RECVMSG:
3926 case BPF_CGROUP_UNIX_RECVMSG:
3927 return BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
3928 case BPF_CGROUP_SOCK_OPS:
3929 return BPF_PROG_TYPE_SOCK_OPS;
3930 case BPF_CGROUP_DEVICE:
3931 return BPF_PROG_TYPE_CGROUP_DEVICE;
3932 case BPF_SK_MSG_VERDICT:
3933 return BPF_PROG_TYPE_SK_MSG;
3934 case BPF_SK_SKB_STREAM_PARSER:
3935 case BPF_SK_SKB_STREAM_VERDICT:
3936 case BPF_SK_SKB_VERDICT:
3937 return BPF_PROG_TYPE_SK_SKB;
3938 case BPF_LIRC_MODE2:
3939 return BPF_PROG_TYPE_LIRC_MODE2;
3940 case BPF_FLOW_DISSECTOR:
3941 return BPF_PROG_TYPE_FLOW_DISSECTOR;
3942 case BPF_CGROUP_SYSCTL:
3943 return BPF_PROG_TYPE_CGROUP_SYSCTL;
3944 case BPF_CGROUP_GETSOCKOPT:
3945 case BPF_CGROUP_SETSOCKOPT:
3946 return BPF_PROG_TYPE_CGROUP_SOCKOPT;
3947 case BPF_TRACE_ITER:
3948 case BPF_TRACE_RAW_TP:
3949 case BPF_TRACE_FENTRY:
3950 case BPF_TRACE_FEXIT:
3951 case BPF_MODIFY_RETURN:
3952 return BPF_PROG_TYPE_TRACING;
3953 case BPF_LSM_MAC:
3954 return BPF_PROG_TYPE_LSM;
3955 case BPF_SK_LOOKUP:
3956 return BPF_PROG_TYPE_SK_LOOKUP;
3957 case BPF_XDP:
3958 return BPF_PROG_TYPE_XDP;
3959 case BPF_LSM_CGROUP:
3960 return BPF_PROG_TYPE_LSM;
3961 case BPF_TCX_INGRESS:
3962 case BPF_TCX_EGRESS:
3963 case BPF_NETKIT_PRIMARY:
3964 case BPF_NETKIT_PEER:
3965 return BPF_PROG_TYPE_SCHED_CLS;
3966 default:
3967 return BPF_PROG_TYPE_UNSPEC;
3968 }
3969}
3970
3971static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
3972 enum bpf_attach_type attach_type)
3973{
3974 enum bpf_prog_type ptype;
3975
3976 switch (prog->type) {
3977 case BPF_PROG_TYPE_CGROUP_SOCK:
3978 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
3979 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
3980 case BPF_PROG_TYPE_SK_LOOKUP:
3981 return attach_type == prog->expected_attach_type ? 0 : -EINVAL;
3982 case BPF_PROG_TYPE_CGROUP_SKB:
3983 if (!bpf_token_capable(prog->aux->token, CAP_NET_ADMIN))
3984 /* cg-skb progs can be loaded by unpriv user.
3985 * check permissions at attach time.
3986 */
3987 return -EPERM;
3988
3989 ptype = attach_type_to_prog_type(attach_type);
3990 if (prog->type != ptype)
3991 return -EINVAL;
3992
3993 return prog->enforce_expected_attach_type &&
3994 prog->expected_attach_type != attach_type ?
3995 -EINVAL : 0;
3996 case BPF_PROG_TYPE_EXT:
3997 return 0;
3998 case BPF_PROG_TYPE_NETFILTER:
3999 if (attach_type != BPF_NETFILTER)
4000 return -EINVAL;
4001 return 0;
4002 case BPF_PROG_TYPE_PERF_EVENT:
4003 case BPF_PROG_TYPE_TRACEPOINT:
4004 if (attach_type != BPF_PERF_EVENT)
4005 return -EINVAL;
4006 return 0;
4007 case BPF_PROG_TYPE_KPROBE:
4008 if (prog->expected_attach_type == BPF_TRACE_KPROBE_MULTI &&
4009 attach_type != BPF_TRACE_KPROBE_MULTI)
4010 return -EINVAL;
4011 if (prog->expected_attach_type == BPF_TRACE_UPROBE_MULTI &&
4012 attach_type != BPF_TRACE_UPROBE_MULTI)
4013 return -EINVAL;
4014 if (attach_type != BPF_PERF_EVENT &&
4015 attach_type != BPF_TRACE_KPROBE_MULTI &&
4016 attach_type != BPF_TRACE_UPROBE_MULTI)
4017 return -EINVAL;
4018 return 0;
4019 case BPF_PROG_TYPE_SCHED_CLS:
4020 if (attach_type != BPF_TCX_INGRESS &&
4021 attach_type != BPF_TCX_EGRESS &&
4022 attach_type != BPF_NETKIT_PRIMARY &&
4023 attach_type != BPF_NETKIT_PEER)
4024 return -EINVAL;
4025 return 0;
4026 default:
4027 ptype = attach_type_to_prog_type(attach_type);
4028 if (ptype == BPF_PROG_TYPE_UNSPEC || ptype != prog->type)
4029 return -EINVAL;
4030 return 0;
4031 }
4032}
4033
4034#define BPF_PROG_ATTACH_LAST_FIELD expected_revision
4035
4036#define BPF_F_ATTACH_MASK_BASE \
4037 (BPF_F_ALLOW_OVERRIDE | \
4038 BPF_F_ALLOW_MULTI | \
4039 BPF_F_REPLACE)
4040
4041#define BPF_F_ATTACH_MASK_MPROG \
4042 (BPF_F_REPLACE | \
4043 BPF_F_BEFORE | \
4044 BPF_F_AFTER | \
4045 BPF_F_ID | \
4046 BPF_F_LINK)
4047
4048static int bpf_prog_attach(const union bpf_attr *attr)
4049{
4050 enum bpf_prog_type ptype;
4051 struct bpf_prog *prog;
4052 int ret;
4053
4054 if (CHECK_ATTR(BPF_PROG_ATTACH))
4055 return -EINVAL;
4056
4057 ptype = attach_type_to_prog_type(attr->attach_type);
4058 if (ptype == BPF_PROG_TYPE_UNSPEC)
4059 return -EINVAL;
4060 if (bpf_mprog_supported(ptype)) {
4061 if (attr->attach_flags & ~BPF_F_ATTACH_MASK_MPROG)
4062 return -EINVAL;
4063 } else {
4064 if (attr->attach_flags & ~BPF_F_ATTACH_MASK_BASE)
4065 return -EINVAL;
4066 if (attr->relative_fd ||
4067 attr->expected_revision)
4068 return -EINVAL;
4069 }
4070
4071 prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
4072 if (IS_ERR(prog))
4073 return PTR_ERR(prog);
4074
4075 if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
4076 bpf_prog_put(prog);
4077 return -EINVAL;
4078 }
4079
4080 switch (ptype) {
4081 case BPF_PROG_TYPE_SK_SKB:
4082 case BPF_PROG_TYPE_SK_MSG:
4083 ret = sock_map_get_from_fd(attr, prog);
4084 break;
4085 case BPF_PROG_TYPE_LIRC_MODE2:
4086 ret = lirc_prog_attach(attr, prog);
4087 break;
4088 case BPF_PROG_TYPE_FLOW_DISSECTOR:
4089 ret = netns_bpf_prog_attach(attr, prog);
4090 break;
4091 case BPF_PROG_TYPE_CGROUP_DEVICE:
4092 case BPF_PROG_TYPE_CGROUP_SKB:
4093 case BPF_PROG_TYPE_CGROUP_SOCK:
4094 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
4095 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
4096 case BPF_PROG_TYPE_CGROUP_SYSCTL:
4097 case BPF_PROG_TYPE_SOCK_OPS:
4098 case BPF_PROG_TYPE_LSM:
4099 if (ptype == BPF_PROG_TYPE_LSM &&
4100 prog->expected_attach_type != BPF_LSM_CGROUP)
4101 ret = -EINVAL;
4102 else
4103 ret = cgroup_bpf_prog_attach(attr, ptype, prog);
4104 break;
4105 case BPF_PROG_TYPE_SCHED_CLS:
4106 if (attr->attach_type == BPF_TCX_INGRESS ||
4107 attr->attach_type == BPF_TCX_EGRESS)
4108 ret = tcx_prog_attach(attr, prog);
4109 else
4110 ret = netkit_prog_attach(attr, prog);
4111 break;
4112 default:
4113 ret = -EINVAL;
4114 }
4115
4116 if (ret)
4117 bpf_prog_put(prog);
4118 return ret;
4119}
4120
4121#define BPF_PROG_DETACH_LAST_FIELD expected_revision
4122
4123static int bpf_prog_detach(const union bpf_attr *attr)
4124{
4125 struct bpf_prog *prog = NULL;
4126 enum bpf_prog_type ptype;
4127 int ret;
4128
4129 if (CHECK_ATTR(BPF_PROG_DETACH))
4130 return -EINVAL;
4131
4132 ptype = attach_type_to_prog_type(attr->attach_type);
4133 if (bpf_mprog_supported(ptype)) {
4134 if (ptype == BPF_PROG_TYPE_UNSPEC)
4135 return -EINVAL;
4136 if (attr->attach_flags & ~BPF_F_ATTACH_MASK_MPROG)
4137 return -EINVAL;
4138 if (attr->attach_bpf_fd) {
4139 prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
4140 if (IS_ERR(prog))
4141 return PTR_ERR(prog);
4142 }
4143 } else if (attr->attach_flags ||
4144 attr->relative_fd ||
4145 attr->expected_revision) {
4146 return -EINVAL;
4147 }
4148
4149 switch (ptype) {
4150 case BPF_PROG_TYPE_SK_MSG:
4151 case BPF_PROG_TYPE_SK_SKB:
4152 ret = sock_map_prog_detach(attr, ptype);
4153 break;
4154 case BPF_PROG_TYPE_LIRC_MODE2:
4155 ret = lirc_prog_detach(attr);
4156 break;
4157 case BPF_PROG_TYPE_FLOW_DISSECTOR:
4158 ret = netns_bpf_prog_detach(attr, ptype);
4159 break;
4160 case BPF_PROG_TYPE_CGROUP_DEVICE:
4161 case BPF_PROG_TYPE_CGROUP_SKB:
4162 case BPF_PROG_TYPE_CGROUP_SOCK:
4163 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
4164 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
4165 case BPF_PROG_TYPE_CGROUP_SYSCTL:
4166 case BPF_PROG_TYPE_SOCK_OPS:
4167 case BPF_PROG_TYPE_LSM:
4168 ret = cgroup_bpf_prog_detach(attr, ptype);
4169 break;
4170 case BPF_PROG_TYPE_SCHED_CLS:
4171 if (attr->attach_type == BPF_TCX_INGRESS ||
4172 attr->attach_type == BPF_TCX_EGRESS)
4173 ret = tcx_prog_detach(attr, prog);
4174 else
4175 ret = netkit_prog_detach(attr, prog);
4176 break;
4177 default:
4178 ret = -EINVAL;
4179 }
4180
4181 if (prog)
4182 bpf_prog_put(prog);
4183 return ret;
4184}
4185
4186#define BPF_PROG_QUERY_LAST_FIELD query.revision
4187
4188static int bpf_prog_query(const union bpf_attr *attr,
4189 union bpf_attr __user *uattr)
4190{
4191 if (!bpf_net_capable())
4192 return -EPERM;
4193 if (CHECK_ATTR(BPF_PROG_QUERY))
4194 return -EINVAL;
4195 if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
4196 return -EINVAL;
4197
4198 switch (attr->query.attach_type) {
4199 case BPF_CGROUP_INET_INGRESS:
4200 case BPF_CGROUP_INET_EGRESS:
4201 case BPF_CGROUP_INET_SOCK_CREATE:
4202 case BPF_CGROUP_INET_SOCK_RELEASE:
4203 case BPF_CGROUP_INET4_BIND:
4204 case BPF_CGROUP_INET6_BIND:
4205 case BPF_CGROUP_INET4_POST_BIND:
4206 case BPF_CGROUP_INET6_POST_BIND:
4207 case BPF_CGROUP_INET4_CONNECT:
4208 case BPF_CGROUP_INET6_CONNECT:
4209 case BPF_CGROUP_UNIX_CONNECT:
4210 case BPF_CGROUP_INET4_GETPEERNAME:
4211 case BPF_CGROUP_INET6_GETPEERNAME:
4212 case BPF_CGROUP_UNIX_GETPEERNAME:
4213 case BPF_CGROUP_INET4_GETSOCKNAME:
4214 case BPF_CGROUP_INET6_GETSOCKNAME:
4215 case BPF_CGROUP_UNIX_GETSOCKNAME:
4216 case BPF_CGROUP_UDP4_SENDMSG:
4217 case BPF_CGROUP_UDP6_SENDMSG:
4218 case BPF_CGROUP_UNIX_SENDMSG:
4219 case BPF_CGROUP_UDP4_RECVMSG:
4220 case BPF_CGROUP_UDP6_RECVMSG:
4221 case BPF_CGROUP_UNIX_RECVMSG:
4222 case BPF_CGROUP_SOCK_OPS:
4223 case BPF_CGROUP_DEVICE:
4224 case BPF_CGROUP_SYSCTL:
4225 case BPF_CGROUP_GETSOCKOPT:
4226 case BPF_CGROUP_SETSOCKOPT:
4227 case BPF_LSM_CGROUP:
4228 return cgroup_bpf_prog_query(attr, uattr);
4229 case BPF_LIRC_MODE2:
4230 return lirc_prog_query(attr, uattr);
4231 case BPF_FLOW_DISSECTOR:
4232 case BPF_SK_LOOKUP:
4233 return netns_bpf_prog_query(attr, uattr);
4234 case BPF_SK_SKB_STREAM_PARSER:
4235 case BPF_SK_SKB_STREAM_VERDICT:
4236 case BPF_SK_MSG_VERDICT:
4237 case BPF_SK_SKB_VERDICT:
4238 return sock_map_bpf_prog_query(attr, uattr);
4239 case BPF_TCX_INGRESS:
4240 case BPF_TCX_EGRESS:
4241 return tcx_prog_query(attr, uattr);
4242 case BPF_NETKIT_PRIMARY:
4243 case BPF_NETKIT_PEER:
4244 return netkit_prog_query(attr, uattr);
4245 default:
4246 return -EINVAL;
4247 }
4248}
4249
4250#define BPF_PROG_TEST_RUN_LAST_FIELD test.batch_size
4251
4252static int bpf_prog_test_run(const union bpf_attr *attr,
4253 union bpf_attr __user *uattr)
4254{
4255 struct bpf_prog *prog;
4256 int ret = -ENOTSUPP;
4257
4258 if (CHECK_ATTR(BPF_PROG_TEST_RUN))
4259 return -EINVAL;
4260
4261 if ((attr->test.ctx_size_in && !attr->test.ctx_in) ||
4262 (!attr->test.ctx_size_in && attr->test.ctx_in))
4263 return -EINVAL;
4264
4265 if ((attr->test.ctx_size_out && !attr->test.ctx_out) ||
4266 (!attr->test.ctx_size_out && attr->test.ctx_out))
4267 return -EINVAL;
4268
4269 prog = bpf_prog_get(attr->test.prog_fd);
4270 if (IS_ERR(prog))
4271 return PTR_ERR(prog);
4272
4273 if (prog->aux->ops->test_run)
4274 ret = prog->aux->ops->test_run(prog, attr, uattr);
4275
4276 bpf_prog_put(prog);
4277 return ret;
4278}
4279
4280#define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
4281
4282static int bpf_obj_get_next_id(const union bpf_attr *attr,
4283 union bpf_attr __user *uattr,
4284 struct idr *idr,
4285 spinlock_t *lock)
4286{
4287 u32 next_id = attr->start_id;
4288 int err = 0;
4289
4290 if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
4291 return -EINVAL;
4292
4293 if (!capable(CAP_SYS_ADMIN))
4294 return -EPERM;
4295
4296 next_id++;
4297 spin_lock_bh(lock);
4298 if (!idr_get_next(idr, &next_id))
4299 err = -ENOENT;
4300 spin_unlock_bh(lock);
4301
4302 if (!err)
4303 err = put_user(next_id, &uattr->next_id);
4304
4305 return err;
4306}
4307
4308struct bpf_map *bpf_map_get_curr_or_next(u32 *id)
4309{
4310 struct bpf_map *map;
4311
4312 spin_lock_bh(&map_idr_lock);
4313again:
4314 map = idr_get_next(&map_idr, id);
4315 if (map) {
4316 map = __bpf_map_inc_not_zero(map, false);
4317 if (IS_ERR(map)) {
4318 (*id)++;
4319 goto again;
4320 }
4321 }
4322 spin_unlock_bh(&map_idr_lock);
4323
4324 return map;
4325}
4326
4327struct bpf_prog *bpf_prog_get_curr_or_next(u32 *id)
4328{
4329 struct bpf_prog *prog;
4330
4331 spin_lock_bh(&prog_idr_lock);
4332again:
4333 prog = idr_get_next(&prog_idr, id);
4334 if (prog) {
4335 prog = bpf_prog_inc_not_zero(prog);
4336 if (IS_ERR(prog)) {
4337 (*id)++;
4338 goto again;
4339 }
4340 }
4341 spin_unlock_bh(&prog_idr_lock);
4342
4343 return prog;
4344}
4345
4346#define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
4347
4348struct bpf_prog *bpf_prog_by_id(u32 id)
4349{
4350 struct bpf_prog *prog;
4351
4352 if (!id)
4353 return ERR_PTR(-ENOENT);
4354
4355 spin_lock_bh(&prog_idr_lock);
4356 prog = idr_find(&prog_idr, id);
4357 if (prog)
4358 prog = bpf_prog_inc_not_zero(prog);
4359 else
4360 prog = ERR_PTR(-ENOENT);
4361 spin_unlock_bh(&prog_idr_lock);
4362 return prog;
4363}
4364
4365static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
4366{
4367 struct bpf_prog *prog;
4368 u32 id = attr->prog_id;
4369 int fd;
4370
4371 if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
4372 return -EINVAL;
4373
4374 if (!capable(CAP_SYS_ADMIN))
4375 return -EPERM;
4376
4377 prog = bpf_prog_by_id(id);
4378 if (IS_ERR(prog))
4379 return PTR_ERR(prog);
4380
4381 fd = bpf_prog_new_fd(prog);
4382 if (fd < 0)
4383 bpf_prog_put(prog);
4384
4385 return fd;
4386}
4387
4388#define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
4389
4390static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
4391{
4392 struct bpf_map *map;
4393 u32 id = attr->map_id;
4394 int f_flags;
4395 int fd;
4396
4397 if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
4398 attr->open_flags & ~BPF_OBJ_FLAG_MASK)
4399 return -EINVAL;
4400
4401 if (!capable(CAP_SYS_ADMIN))
4402 return -EPERM;
4403
4404 f_flags = bpf_get_file_flag(attr->open_flags);
4405 if (f_flags < 0)
4406 return f_flags;
4407
4408 spin_lock_bh(&map_idr_lock);
4409 map = idr_find(&map_idr, id);
4410 if (map)
4411 map = __bpf_map_inc_not_zero(map, true);
4412 else
4413 map = ERR_PTR(-ENOENT);
4414 spin_unlock_bh(&map_idr_lock);
4415
4416 if (IS_ERR(map))
4417 return PTR_ERR(map);
4418
4419 fd = bpf_map_new_fd(map, f_flags);
4420 if (fd < 0)
4421 bpf_map_put_with_uref(map);
4422
4423 return fd;
4424}
4425
4426static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
4427 unsigned long addr, u32 *off,
4428 u32 *type)
4429{
4430 const struct bpf_map *map;
4431 int i;
4432
4433 mutex_lock(&prog->aux->used_maps_mutex);
4434 for (i = 0, *off = 0; i < prog->aux->used_map_cnt; i++) {
4435 map = prog->aux->used_maps[i];
4436 if (map == (void *)addr) {
4437 *type = BPF_PSEUDO_MAP_FD;
4438 goto out;
4439 }
4440 if (!map->ops->map_direct_value_meta)
4441 continue;
4442 if (!map->ops->map_direct_value_meta(map, addr, off)) {
4443 *type = BPF_PSEUDO_MAP_VALUE;
4444 goto out;
4445 }
4446 }
4447 map = NULL;
4448
4449out:
4450 mutex_unlock(&prog->aux->used_maps_mutex);
4451 return map;
4452}
4453
4454static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog,
4455 const struct cred *f_cred)
4456{
4457 const struct bpf_map *map;
4458 struct bpf_insn *insns;
4459 u32 off, type;
4460 u64 imm;
4461 u8 code;
4462 int i;
4463
4464 insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
4465 GFP_USER);
4466 if (!insns)
4467 return insns;
4468
4469 for (i = 0; i < prog->len; i++) {
4470 code = insns[i].code;
4471
4472 if (code == (BPF_JMP | BPF_TAIL_CALL)) {
4473 insns[i].code = BPF_JMP | BPF_CALL;
4474 insns[i].imm = BPF_FUNC_tail_call;
4475 /* fall-through */
4476 }
4477 if (code == (BPF_JMP | BPF_CALL) ||
4478 code == (BPF_JMP | BPF_CALL_ARGS)) {
4479 if (code == (BPF_JMP | BPF_CALL_ARGS))
4480 insns[i].code = BPF_JMP | BPF_CALL;
4481 if (!bpf_dump_raw_ok(f_cred))
4482 insns[i].imm = 0;
4483 continue;
4484 }
4485 if (BPF_CLASS(code) == BPF_LDX && BPF_MODE(code) == BPF_PROBE_MEM) {
4486 insns[i].code = BPF_LDX | BPF_SIZE(code) | BPF_MEM;
4487 continue;
4488 }
4489
4490 if ((BPF_CLASS(code) == BPF_LDX || BPF_CLASS(code) == BPF_STX ||
4491 BPF_CLASS(code) == BPF_ST) && BPF_MODE(code) == BPF_PROBE_MEM32) {
4492 insns[i].code = BPF_CLASS(code) | BPF_SIZE(code) | BPF_MEM;
4493 continue;
4494 }
4495
4496 if (code != (BPF_LD | BPF_IMM | BPF_DW))
4497 continue;
4498
4499 imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
4500 map = bpf_map_from_imm(prog, imm, &off, &type);
4501 if (map) {
4502 insns[i].src_reg = type;
4503 insns[i].imm = map->id;
4504 insns[i + 1].imm = off;
4505 continue;
4506 }
4507 }
4508
4509 return insns;
4510}
4511
4512static int set_info_rec_size(struct bpf_prog_info *info)
4513{
4514 /*
4515 * Ensure info.*_rec_size is the same as kernel expected size
4516 *
4517 * or
4518 *
4519 * Only allow zero *_rec_size if both _rec_size and _cnt are
4520 * zero. In this case, the kernel will set the expected
4521 * _rec_size back to the info.
4522 */
4523
4524 if ((info->nr_func_info || info->func_info_rec_size) &&
4525 info->func_info_rec_size != sizeof(struct bpf_func_info))
4526 return -EINVAL;
4527
4528 if ((info->nr_line_info || info->line_info_rec_size) &&
4529 info->line_info_rec_size != sizeof(struct bpf_line_info))
4530 return -EINVAL;
4531
4532 if ((info->nr_jited_line_info || info->jited_line_info_rec_size) &&
4533 info->jited_line_info_rec_size != sizeof(__u64))
4534 return -EINVAL;
4535
4536 info->func_info_rec_size = sizeof(struct bpf_func_info);
4537 info->line_info_rec_size = sizeof(struct bpf_line_info);
4538 info->jited_line_info_rec_size = sizeof(__u64);
4539
4540 return 0;
4541}
4542
4543static int bpf_prog_get_info_by_fd(struct file *file,
4544 struct bpf_prog *prog,
4545 const union bpf_attr *attr,
4546 union bpf_attr __user *uattr)
4547{
4548 struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
4549 struct btf *attach_btf = bpf_prog_get_target_btf(prog);
4550 struct bpf_prog_info info;
4551 u32 info_len = attr->info.info_len;
4552 struct bpf_prog_kstats stats;
4553 char __user *uinsns;
4554 u32 ulen;
4555 int err;
4556
4557 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
4558 if (err)
4559 return err;
4560 info_len = min_t(u32, sizeof(info), info_len);
4561
4562 memset(&info, 0, sizeof(info));
4563 if (copy_from_user(&info, uinfo, info_len))
4564 return -EFAULT;
4565
4566 info.type = prog->type;
4567 info.id = prog->aux->id;
4568 info.load_time = prog->aux->load_time;
4569 info.created_by_uid = from_kuid_munged(current_user_ns(),
4570 prog->aux->user->uid);
4571 info.gpl_compatible = prog->gpl_compatible;
4572
4573 memcpy(info.tag, prog->tag, sizeof(prog->tag));
4574 memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
4575
4576 mutex_lock(&prog->aux->used_maps_mutex);
4577 ulen = info.nr_map_ids;
4578 info.nr_map_ids = prog->aux->used_map_cnt;
4579 ulen = min_t(u32, info.nr_map_ids, ulen);
4580 if (ulen) {
4581 u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
4582 u32 i;
4583
4584 for (i = 0; i < ulen; i++)
4585 if (put_user(prog->aux->used_maps[i]->id,
4586 &user_map_ids[i])) {
4587 mutex_unlock(&prog->aux->used_maps_mutex);
4588 return -EFAULT;
4589 }
4590 }
4591 mutex_unlock(&prog->aux->used_maps_mutex);
4592
4593 err = set_info_rec_size(&info);
4594 if (err)
4595 return err;
4596
4597 bpf_prog_get_stats(prog, &stats);
4598 info.run_time_ns = stats.nsecs;
4599 info.run_cnt = stats.cnt;
4600 info.recursion_misses = stats.misses;
4601
4602 info.verified_insns = prog->aux->verified_insns;
4603
4604 if (!bpf_capable()) {
4605 info.jited_prog_len = 0;
4606 info.xlated_prog_len = 0;
4607 info.nr_jited_ksyms = 0;
4608 info.nr_jited_func_lens = 0;
4609 info.nr_func_info = 0;
4610 info.nr_line_info = 0;
4611 info.nr_jited_line_info = 0;
4612 goto done;
4613 }
4614
4615 ulen = info.xlated_prog_len;
4616 info.xlated_prog_len = bpf_prog_insn_size(prog);
4617 if (info.xlated_prog_len && ulen) {
4618 struct bpf_insn *insns_sanitized;
4619 bool fault;
4620
4621 if (prog->blinded && !bpf_dump_raw_ok(file->f_cred)) {
4622 info.xlated_prog_insns = 0;
4623 goto done;
4624 }
4625 insns_sanitized = bpf_insn_prepare_dump(prog, file->f_cred);
4626 if (!insns_sanitized)
4627 return -ENOMEM;
4628 uinsns = u64_to_user_ptr(info.xlated_prog_insns);
4629 ulen = min_t(u32, info.xlated_prog_len, ulen);
4630 fault = copy_to_user(uinsns, insns_sanitized, ulen);
4631 kfree(insns_sanitized);
4632 if (fault)
4633 return -EFAULT;
4634 }
4635
4636 if (bpf_prog_is_offloaded(prog->aux)) {
4637 err = bpf_prog_offload_info_fill(&info, prog);
4638 if (err)
4639 return err;
4640 goto done;
4641 }
4642
4643 /* NOTE: the following code is supposed to be skipped for offload.
4644 * bpf_prog_offload_info_fill() is the place to fill similar fields
4645 * for offload.
4646 */
4647 ulen = info.jited_prog_len;
4648 if (prog->aux->func_cnt) {
4649 u32 i;
4650
4651 info.jited_prog_len = 0;
4652 for (i = 0; i < prog->aux->func_cnt; i++)
4653 info.jited_prog_len += prog->aux->func[i]->jited_len;
4654 } else {
4655 info.jited_prog_len = prog->jited_len;
4656 }
4657
4658 if (info.jited_prog_len && ulen) {
4659 if (bpf_dump_raw_ok(file->f_cred)) {
4660 uinsns = u64_to_user_ptr(info.jited_prog_insns);
4661 ulen = min_t(u32, info.jited_prog_len, ulen);
4662
4663 /* for multi-function programs, copy the JITed
4664 * instructions for all the functions
4665 */
4666 if (prog->aux->func_cnt) {
4667 u32 len, free, i;
4668 u8 *img;
4669
4670 free = ulen;
4671 for (i = 0; i < prog->aux->func_cnt; i++) {
4672 len = prog->aux->func[i]->jited_len;
4673 len = min_t(u32, len, free);
4674 img = (u8 *) prog->aux->func[i]->bpf_func;
4675 if (copy_to_user(uinsns, img, len))
4676 return -EFAULT;
4677 uinsns += len;
4678 free -= len;
4679 if (!free)
4680 break;
4681 }
4682 } else {
4683 if (copy_to_user(uinsns, prog->bpf_func, ulen))
4684 return -EFAULT;
4685 }
4686 } else {
4687 info.jited_prog_insns = 0;
4688 }
4689 }
4690
4691 ulen = info.nr_jited_ksyms;
4692 info.nr_jited_ksyms = prog->aux->func_cnt ? : 1;
4693 if (ulen) {
4694 if (bpf_dump_raw_ok(file->f_cred)) {
4695 unsigned long ksym_addr;
4696 u64 __user *user_ksyms;
4697 u32 i;
4698
4699 /* copy the address of the kernel symbol
4700 * corresponding to each function
4701 */
4702 ulen = min_t(u32, info.nr_jited_ksyms, ulen);
4703 user_ksyms = u64_to_user_ptr(info.jited_ksyms);
4704 if (prog->aux->func_cnt) {
4705 for (i = 0; i < ulen; i++) {
4706 ksym_addr = (unsigned long)
4707 prog->aux->func[i]->bpf_func;
4708 if (put_user((u64) ksym_addr,
4709 &user_ksyms[i]))
4710 return -EFAULT;
4711 }
4712 } else {
4713 ksym_addr = (unsigned long) prog->bpf_func;
4714 if (put_user((u64) ksym_addr, &user_ksyms[0]))
4715 return -EFAULT;
4716 }
4717 } else {
4718 info.jited_ksyms = 0;
4719 }
4720 }
4721
4722 ulen = info.nr_jited_func_lens;
4723 info.nr_jited_func_lens = prog->aux->func_cnt ? : 1;
4724 if (ulen) {
4725 if (bpf_dump_raw_ok(file->f_cred)) {
4726 u32 __user *user_lens;
4727 u32 func_len, i;
4728
4729 /* copy the JITed image lengths for each function */
4730 ulen = min_t(u32, info.nr_jited_func_lens, ulen);
4731 user_lens = u64_to_user_ptr(info.jited_func_lens);
4732 if (prog->aux->func_cnt) {
4733 for (i = 0; i < ulen; i++) {
4734 func_len =
4735 prog->aux->func[i]->jited_len;
4736 if (put_user(func_len, &user_lens[i]))
4737 return -EFAULT;
4738 }
4739 } else {
4740 func_len = prog->jited_len;
4741 if (put_user(func_len, &user_lens[0]))
4742 return -EFAULT;
4743 }
4744 } else {
4745 info.jited_func_lens = 0;
4746 }
4747 }
4748
4749 if (prog->aux->btf)
4750 info.btf_id = btf_obj_id(prog->aux->btf);
4751 info.attach_btf_id = prog->aux->attach_btf_id;
4752 if (attach_btf)
4753 info.attach_btf_obj_id = btf_obj_id(attach_btf);
4754
4755 ulen = info.nr_func_info;
4756 info.nr_func_info = prog->aux->func_info_cnt;
4757 if (info.nr_func_info && ulen) {
4758 char __user *user_finfo;
4759
4760 user_finfo = u64_to_user_ptr(info.func_info);
4761 ulen = min_t(u32, info.nr_func_info, ulen);
4762 if (copy_to_user(user_finfo, prog->aux->func_info,
4763 info.func_info_rec_size * ulen))
4764 return -EFAULT;
4765 }
4766
4767 ulen = info.nr_line_info;
4768 info.nr_line_info = prog->aux->nr_linfo;
4769 if (info.nr_line_info && ulen) {
4770 __u8 __user *user_linfo;
4771
4772 user_linfo = u64_to_user_ptr(info.line_info);
4773 ulen = min_t(u32, info.nr_line_info, ulen);
4774 if (copy_to_user(user_linfo, prog->aux->linfo,
4775 info.line_info_rec_size * ulen))
4776 return -EFAULT;
4777 }
4778
4779 ulen = info.nr_jited_line_info;
4780 if (prog->aux->jited_linfo)
4781 info.nr_jited_line_info = prog->aux->nr_linfo;
4782 else
4783 info.nr_jited_line_info = 0;
4784 if (info.nr_jited_line_info && ulen) {
4785 if (bpf_dump_raw_ok(file->f_cred)) {
4786 unsigned long line_addr;
4787 __u64 __user *user_linfo;
4788 u32 i;
4789
4790 user_linfo = u64_to_user_ptr(info.jited_line_info);
4791 ulen = min_t(u32, info.nr_jited_line_info, ulen);
4792 for (i = 0; i < ulen; i++) {
4793 line_addr = (unsigned long)prog->aux->jited_linfo[i];
4794 if (put_user((__u64)line_addr, &user_linfo[i]))
4795 return -EFAULT;
4796 }
4797 } else {
4798 info.jited_line_info = 0;
4799 }
4800 }
4801
4802 ulen = info.nr_prog_tags;
4803 info.nr_prog_tags = prog->aux->func_cnt ? : 1;
4804 if (ulen) {
4805 __u8 __user (*user_prog_tags)[BPF_TAG_SIZE];
4806 u32 i;
4807
4808 user_prog_tags = u64_to_user_ptr(info.prog_tags);
4809 ulen = min_t(u32, info.nr_prog_tags, ulen);
4810 if (prog->aux->func_cnt) {
4811 for (i = 0; i < ulen; i++) {
4812 if (copy_to_user(user_prog_tags[i],
4813 prog->aux->func[i]->tag,
4814 BPF_TAG_SIZE))
4815 return -EFAULT;
4816 }
4817 } else {
4818 if (copy_to_user(user_prog_tags[0],
4819 prog->tag, BPF_TAG_SIZE))
4820 return -EFAULT;
4821 }
4822 }
4823
4824done:
4825 if (copy_to_user(uinfo, &info, info_len) ||
4826 put_user(info_len, &uattr->info.info_len))
4827 return -EFAULT;
4828
4829 return 0;
4830}
4831
4832static int bpf_map_get_info_by_fd(struct file *file,
4833 struct bpf_map *map,
4834 const union bpf_attr *attr,
4835 union bpf_attr __user *uattr)
4836{
4837 struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
4838 struct bpf_map_info info;
4839 u32 info_len = attr->info.info_len;
4840 int err;
4841
4842 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
4843 if (err)
4844 return err;
4845 info_len = min_t(u32, sizeof(info), info_len);
4846
4847 memset(&info, 0, sizeof(info));
4848 info.type = map->map_type;
4849 info.id = map->id;
4850 info.key_size = map->key_size;
4851 info.value_size = map->value_size;
4852 info.max_entries = map->max_entries;
4853 info.map_flags = map->map_flags;
4854 info.map_extra = map->map_extra;
4855 memcpy(info.name, map->name, sizeof(map->name));
4856
4857 if (map->btf) {
4858 info.btf_id = btf_obj_id(map->btf);
4859 info.btf_key_type_id = map->btf_key_type_id;
4860 info.btf_value_type_id = map->btf_value_type_id;
4861 }
4862 info.btf_vmlinux_value_type_id = map->btf_vmlinux_value_type_id;
4863 if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS)
4864 bpf_map_struct_ops_info_fill(&info, map);
4865
4866 if (bpf_map_is_offloaded(map)) {
4867 err = bpf_map_offload_info_fill(&info, map);
4868 if (err)
4869 return err;
4870 }
4871
4872 if (copy_to_user(uinfo, &info, info_len) ||
4873 put_user(info_len, &uattr->info.info_len))
4874 return -EFAULT;
4875
4876 return 0;
4877}
4878
4879static int bpf_btf_get_info_by_fd(struct file *file,
4880 struct btf *btf,
4881 const union bpf_attr *attr,
4882 union bpf_attr __user *uattr)
4883{
4884 struct bpf_btf_info __user *uinfo = u64_to_user_ptr(attr->info.info);
4885 u32 info_len = attr->info.info_len;
4886 int err;
4887
4888 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(*uinfo), info_len);
4889 if (err)
4890 return err;
4891
4892 return btf_get_info_by_fd(btf, attr, uattr);
4893}
4894
4895static int bpf_link_get_info_by_fd(struct file *file,
4896 struct bpf_link *link,
4897 const union bpf_attr *attr,
4898 union bpf_attr __user *uattr)
4899{
4900 struct bpf_link_info __user *uinfo = u64_to_user_ptr(attr->info.info);
4901 struct bpf_link_info info;
4902 u32 info_len = attr->info.info_len;
4903 int err;
4904
4905 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
4906 if (err)
4907 return err;
4908 info_len = min_t(u32, sizeof(info), info_len);
4909
4910 memset(&info, 0, sizeof(info));
4911 if (copy_from_user(&info, uinfo, info_len))
4912 return -EFAULT;
4913
4914 info.type = link->type;
4915 info.id = link->id;
4916 if (link->prog)
4917 info.prog_id = link->prog->aux->id;
4918
4919 if (link->ops->fill_link_info) {
4920 err = link->ops->fill_link_info(link, &info);
4921 if (err)
4922 return err;
4923 }
4924
4925 if (copy_to_user(uinfo, &info, info_len) ||
4926 put_user(info_len, &uattr->info.info_len))
4927 return -EFAULT;
4928
4929 return 0;
4930}
4931
4932
4933#define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
4934
4935static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
4936 union bpf_attr __user *uattr)
4937{
4938 int ufd = attr->info.bpf_fd;
4939 struct fd f;
4940 int err;
4941
4942 if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
4943 return -EINVAL;
4944
4945 f = fdget(ufd);
4946 if (!f.file)
4947 return -EBADFD;
4948
4949 if (f.file->f_op == &bpf_prog_fops)
4950 err = bpf_prog_get_info_by_fd(f.file, f.file->private_data, attr,
4951 uattr);
4952 else if (f.file->f_op == &bpf_map_fops)
4953 err = bpf_map_get_info_by_fd(f.file, f.file->private_data, attr,
4954 uattr);
4955 else if (f.file->f_op == &btf_fops)
4956 err = bpf_btf_get_info_by_fd(f.file, f.file->private_data, attr, uattr);
4957 else if (f.file->f_op == &bpf_link_fops)
4958 err = bpf_link_get_info_by_fd(f.file, f.file->private_data,
4959 attr, uattr);
4960 else
4961 err = -EINVAL;
4962
4963 fdput(f);
4964 return err;
4965}
4966
4967#define BPF_BTF_LOAD_LAST_FIELD btf_token_fd
4968
4969static int bpf_btf_load(const union bpf_attr *attr, bpfptr_t uattr, __u32 uattr_size)
4970{
4971 struct bpf_token *token = NULL;
4972
4973 if (CHECK_ATTR(BPF_BTF_LOAD))
4974 return -EINVAL;
4975
4976 if (attr->btf_flags & ~BPF_F_TOKEN_FD)
4977 return -EINVAL;
4978
4979 if (attr->btf_flags & BPF_F_TOKEN_FD) {
4980 token = bpf_token_get_from_fd(attr->btf_token_fd);
4981 if (IS_ERR(token))
4982 return PTR_ERR(token);
4983 if (!bpf_token_allow_cmd(token, BPF_BTF_LOAD)) {
4984 bpf_token_put(token);
4985 token = NULL;
4986 }
4987 }
4988
4989 if (!bpf_token_capable(token, CAP_BPF)) {
4990 bpf_token_put(token);
4991 return -EPERM;
4992 }
4993
4994 bpf_token_put(token);
4995
4996 return btf_new_fd(attr, uattr, uattr_size);
4997}
4998
4999#define BPF_BTF_GET_FD_BY_ID_LAST_FIELD btf_id
5000
5001static int bpf_btf_get_fd_by_id(const union bpf_attr *attr)
5002{
5003 if (CHECK_ATTR(BPF_BTF_GET_FD_BY_ID))
5004 return -EINVAL;
5005
5006 if (!capable(CAP_SYS_ADMIN))
5007 return -EPERM;
5008
5009 return btf_get_fd_by_id(attr->btf_id);
5010}
5011
5012static int bpf_task_fd_query_copy(const union bpf_attr *attr,
5013 union bpf_attr __user *uattr,
5014 u32 prog_id, u32 fd_type,
5015 const char *buf, u64 probe_offset,
5016 u64 probe_addr)
5017{
5018 char __user *ubuf = u64_to_user_ptr(attr->task_fd_query.buf);
5019 u32 len = buf ? strlen(buf) : 0, input_len;
5020 int err = 0;
5021
5022 if (put_user(len, &uattr->task_fd_query.buf_len))
5023 return -EFAULT;
5024 input_len = attr->task_fd_query.buf_len;
5025 if (input_len && ubuf) {
5026 if (!len) {
5027 /* nothing to copy, just make ubuf NULL terminated */
5028 char zero = '\0';
5029
5030 if (put_user(zero, ubuf))
5031 return -EFAULT;
5032 } else if (input_len >= len + 1) {
5033 /* ubuf can hold the string with NULL terminator */
5034 if (copy_to_user(ubuf, buf, len + 1))
5035 return -EFAULT;
5036 } else {
5037 /* ubuf cannot hold the string with NULL terminator,
5038 * do a partial copy with NULL terminator.
5039 */
5040 char zero = '\0';
5041
5042 err = -ENOSPC;
5043 if (copy_to_user(ubuf, buf, input_len - 1))
5044 return -EFAULT;
5045 if (put_user(zero, ubuf + input_len - 1))
5046 return -EFAULT;
5047 }
5048 }
5049
5050 if (put_user(prog_id, &uattr->task_fd_query.prog_id) ||
5051 put_user(fd_type, &uattr->task_fd_query.fd_type) ||
5052 put_user(probe_offset, &uattr->task_fd_query.probe_offset) ||
5053 put_user(probe_addr, &uattr->task_fd_query.probe_addr))
5054 return -EFAULT;
5055
5056 return err;
5057}
5058
5059#define BPF_TASK_FD_QUERY_LAST_FIELD task_fd_query.probe_addr
5060
5061static int bpf_task_fd_query(const union bpf_attr *attr,
5062 union bpf_attr __user *uattr)
5063{
5064 pid_t pid = attr->task_fd_query.pid;
5065 u32 fd = attr->task_fd_query.fd;
5066 const struct perf_event *event;
5067 struct task_struct *task;
5068 struct file *file;
5069 int err;
5070
5071 if (CHECK_ATTR(BPF_TASK_FD_QUERY))
5072 return -EINVAL;
5073
5074 if (!capable(CAP_SYS_ADMIN))
5075 return -EPERM;
5076
5077 if (attr->task_fd_query.flags != 0)
5078 return -EINVAL;
5079
5080 rcu_read_lock();
5081 task = get_pid_task(find_vpid(pid), PIDTYPE_PID);
5082 rcu_read_unlock();
5083 if (!task)
5084 return -ENOENT;
5085
5086 err = 0;
5087 file = fget_task(task, fd);
5088 put_task_struct(task);
5089 if (!file)
5090 return -EBADF;
5091
5092 if (file->f_op == &bpf_link_fops) {
5093 struct bpf_link *link = file->private_data;
5094
5095 if (link->ops == &bpf_raw_tp_link_lops) {
5096 struct bpf_raw_tp_link *raw_tp =
5097 container_of(link, struct bpf_raw_tp_link, link);
5098 struct bpf_raw_event_map *btp = raw_tp->btp;
5099
5100 err = bpf_task_fd_query_copy(attr, uattr,
5101 raw_tp->link.prog->aux->id,
5102 BPF_FD_TYPE_RAW_TRACEPOINT,
5103 btp->tp->name, 0, 0);
5104 goto put_file;
5105 }
5106 goto out_not_supp;
5107 }
5108
5109 event = perf_get_event(file);
5110 if (!IS_ERR(event)) {
5111 u64 probe_offset, probe_addr;
5112 u32 prog_id, fd_type;
5113 const char *buf;
5114
5115 err = bpf_get_perf_event_info(event, &prog_id, &fd_type,
5116 &buf, &probe_offset,
5117 &probe_addr, NULL);
5118 if (!err)
5119 err = bpf_task_fd_query_copy(attr, uattr, prog_id,
5120 fd_type, buf,
5121 probe_offset,
5122 probe_addr);
5123 goto put_file;
5124 }
5125
5126out_not_supp:
5127 err = -ENOTSUPP;
5128put_file:
5129 fput(file);
5130 return err;
5131}
5132
5133#define BPF_MAP_BATCH_LAST_FIELD batch.flags
5134
5135#define BPF_DO_BATCH(fn, ...) \
5136 do { \
5137 if (!fn) { \
5138 err = -ENOTSUPP; \
5139 goto err_put; \
5140 } \
5141 err = fn(__VA_ARGS__); \
5142 } while (0)
5143
5144static int bpf_map_do_batch(const union bpf_attr *attr,
5145 union bpf_attr __user *uattr,
5146 int cmd)
5147{
5148 bool has_read = cmd == BPF_MAP_LOOKUP_BATCH ||
5149 cmd == BPF_MAP_LOOKUP_AND_DELETE_BATCH;
5150 bool has_write = cmd != BPF_MAP_LOOKUP_BATCH;
5151 struct bpf_map *map;
5152 int err, ufd;
5153 struct fd f;
5154
5155 if (CHECK_ATTR(BPF_MAP_BATCH))
5156 return -EINVAL;
5157
5158 ufd = attr->batch.map_fd;
5159 f = fdget(ufd);
5160 map = __bpf_map_get(f);
5161 if (IS_ERR(map))
5162 return PTR_ERR(map);
5163 if (has_write)
5164 bpf_map_write_active_inc(map);
5165 if (has_read && !(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
5166 err = -EPERM;
5167 goto err_put;
5168 }
5169 if (has_write && !(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
5170 err = -EPERM;
5171 goto err_put;
5172 }
5173
5174 if (cmd == BPF_MAP_LOOKUP_BATCH)
5175 BPF_DO_BATCH(map->ops->map_lookup_batch, map, attr, uattr);
5176 else if (cmd == BPF_MAP_LOOKUP_AND_DELETE_BATCH)
5177 BPF_DO_BATCH(map->ops->map_lookup_and_delete_batch, map, attr, uattr);
5178 else if (cmd == BPF_MAP_UPDATE_BATCH)
5179 BPF_DO_BATCH(map->ops->map_update_batch, map, f.file, attr, uattr);
5180 else
5181 BPF_DO_BATCH(map->ops->map_delete_batch, map, attr, uattr);
5182err_put:
5183 if (has_write) {
5184 maybe_wait_bpf_programs(map);
5185 bpf_map_write_active_dec(map);
5186 }
5187 fdput(f);
5188 return err;
5189}
5190
5191#define BPF_LINK_CREATE_LAST_FIELD link_create.uprobe_multi.pid
5192static int link_create(union bpf_attr *attr, bpfptr_t uattr)
5193{
5194 struct bpf_prog *prog;
5195 int ret;
5196
5197 if (CHECK_ATTR(BPF_LINK_CREATE))
5198 return -EINVAL;
5199
5200 if (attr->link_create.attach_type == BPF_STRUCT_OPS)
5201 return bpf_struct_ops_link_create(attr);
5202
5203 prog = bpf_prog_get(attr->link_create.prog_fd);
5204 if (IS_ERR(prog))
5205 return PTR_ERR(prog);
5206
5207 ret = bpf_prog_attach_check_attach_type(prog,
5208 attr->link_create.attach_type);
5209 if (ret)
5210 goto out;
5211
5212 switch (prog->type) {
5213 case BPF_PROG_TYPE_CGROUP_SKB:
5214 case BPF_PROG_TYPE_CGROUP_SOCK:
5215 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
5216 case BPF_PROG_TYPE_SOCK_OPS:
5217 case BPF_PROG_TYPE_CGROUP_DEVICE:
5218 case BPF_PROG_TYPE_CGROUP_SYSCTL:
5219 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
5220 ret = cgroup_bpf_link_attach(attr, prog);
5221 break;
5222 case BPF_PROG_TYPE_EXT:
5223 ret = bpf_tracing_prog_attach(prog,
5224 attr->link_create.target_fd,
5225 attr->link_create.target_btf_id,
5226 attr->link_create.tracing.cookie);
5227 break;
5228 case BPF_PROG_TYPE_LSM:
5229 case BPF_PROG_TYPE_TRACING:
5230 if (attr->link_create.attach_type != prog->expected_attach_type) {
5231 ret = -EINVAL;
5232 goto out;
5233 }
5234 if (prog->expected_attach_type == BPF_TRACE_RAW_TP)
5235 ret = bpf_raw_tp_link_attach(prog, NULL);
5236 else if (prog->expected_attach_type == BPF_TRACE_ITER)
5237 ret = bpf_iter_link_attach(attr, uattr, prog);
5238 else if (prog->expected_attach_type == BPF_LSM_CGROUP)
5239 ret = cgroup_bpf_link_attach(attr, prog);
5240 else
5241 ret = bpf_tracing_prog_attach(prog,
5242 attr->link_create.target_fd,
5243 attr->link_create.target_btf_id,
5244 attr->link_create.tracing.cookie);
5245 break;
5246 case BPF_PROG_TYPE_FLOW_DISSECTOR:
5247 case BPF_PROG_TYPE_SK_LOOKUP:
5248 ret = netns_bpf_link_create(attr, prog);
5249 break;
5250#ifdef CONFIG_NET
5251 case BPF_PROG_TYPE_XDP:
5252 ret = bpf_xdp_link_attach(attr, prog);
5253 break;
5254 case BPF_PROG_TYPE_SCHED_CLS:
5255 if (attr->link_create.attach_type == BPF_TCX_INGRESS ||
5256 attr->link_create.attach_type == BPF_TCX_EGRESS)
5257 ret = tcx_link_attach(attr, prog);
5258 else
5259 ret = netkit_link_attach(attr, prog);
5260 break;
5261 case BPF_PROG_TYPE_NETFILTER:
5262 ret = bpf_nf_link_attach(attr, prog);
5263 break;
5264#endif
5265 case BPF_PROG_TYPE_PERF_EVENT:
5266 case BPF_PROG_TYPE_TRACEPOINT:
5267 ret = bpf_perf_link_attach(attr, prog);
5268 break;
5269 case BPF_PROG_TYPE_KPROBE:
5270 if (attr->link_create.attach_type == BPF_PERF_EVENT)
5271 ret = bpf_perf_link_attach(attr, prog);
5272 else if (attr->link_create.attach_type == BPF_TRACE_KPROBE_MULTI)
5273 ret = bpf_kprobe_multi_link_attach(attr, prog);
5274 else if (attr->link_create.attach_type == BPF_TRACE_UPROBE_MULTI)
5275 ret = bpf_uprobe_multi_link_attach(attr, prog);
5276 break;
5277 default:
5278 ret = -EINVAL;
5279 }
5280
5281out:
5282 if (ret < 0)
5283 bpf_prog_put(prog);
5284 return ret;
5285}
5286
5287static int link_update_map(struct bpf_link *link, union bpf_attr *attr)
5288{
5289 struct bpf_map *new_map, *old_map = NULL;
5290 int ret;
5291
5292 new_map = bpf_map_get(attr->link_update.new_map_fd);
5293 if (IS_ERR(new_map))
5294 return PTR_ERR(new_map);
5295
5296 if (attr->link_update.flags & BPF_F_REPLACE) {
5297 old_map = bpf_map_get(attr->link_update.old_map_fd);
5298 if (IS_ERR(old_map)) {
5299 ret = PTR_ERR(old_map);
5300 goto out_put;
5301 }
5302 } else if (attr->link_update.old_map_fd) {
5303 ret = -EINVAL;
5304 goto out_put;
5305 }
5306
5307 ret = link->ops->update_map(link, new_map, old_map);
5308
5309 if (old_map)
5310 bpf_map_put(old_map);
5311out_put:
5312 bpf_map_put(new_map);
5313 return ret;
5314}
5315
5316#define BPF_LINK_UPDATE_LAST_FIELD link_update.old_prog_fd
5317
5318static int link_update(union bpf_attr *attr)
5319{
5320 struct bpf_prog *old_prog = NULL, *new_prog;
5321 struct bpf_link *link;
5322 u32 flags;
5323 int ret;
5324
5325 if (CHECK_ATTR(BPF_LINK_UPDATE))
5326 return -EINVAL;
5327
5328 flags = attr->link_update.flags;
5329 if (flags & ~BPF_F_REPLACE)
5330 return -EINVAL;
5331
5332 link = bpf_link_get_from_fd(attr->link_update.link_fd);
5333 if (IS_ERR(link))
5334 return PTR_ERR(link);
5335
5336 if (link->ops->update_map) {
5337 ret = link_update_map(link, attr);
5338 goto out_put_link;
5339 }
5340
5341 new_prog = bpf_prog_get(attr->link_update.new_prog_fd);
5342 if (IS_ERR(new_prog)) {
5343 ret = PTR_ERR(new_prog);
5344 goto out_put_link;
5345 }
5346
5347 if (flags & BPF_F_REPLACE) {
5348 old_prog = bpf_prog_get(attr->link_update.old_prog_fd);
5349 if (IS_ERR(old_prog)) {
5350 ret = PTR_ERR(old_prog);
5351 old_prog = NULL;
5352 goto out_put_progs;
5353 }
5354 } else if (attr->link_update.old_prog_fd) {
5355 ret = -EINVAL;
5356 goto out_put_progs;
5357 }
5358
5359 if (link->ops->update_prog)
5360 ret = link->ops->update_prog(link, new_prog, old_prog);
5361 else
5362 ret = -EINVAL;
5363
5364out_put_progs:
5365 if (old_prog)
5366 bpf_prog_put(old_prog);
5367 if (ret)
5368 bpf_prog_put(new_prog);
5369out_put_link:
5370 bpf_link_put_direct(link);
5371 return ret;
5372}
5373
5374#define BPF_LINK_DETACH_LAST_FIELD link_detach.link_fd
5375
5376static int link_detach(union bpf_attr *attr)
5377{
5378 struct bpf_link *link;
5379 int ret;
5380
5381 if (CHECK_ATTR(BPF_LINK_DETACH))
5382 return -EINVAL;
5383
5384 link = bpf_link_get_from_fd(attr->link_detach.link_fd);
5385 if (IS_ERR(link))
5386 return PTR_ERR(link);
5387
5388 if (link->ops->detach)
5389 ret = link->ops->detach(link);
5390 else
5391 ret = -EOPNOTSUPP;
5392
5393 bpf_link_put_direct(link);
5394 return ret;
5395}
5396
5397static struct bpf_link *bpf_link_inc_not_zero(struct bpf_link *link)
5398{
5399 return atomic64_fetch_add_unless(&link->refcnt, 1, 0) ? link : ERR_PTR(-ENOENT);
5400}
5401
5402struct bpf_link *bpf_link_by_id(u32 id)
5403{
5404 struct bpf_link *link;
5405
5406 if (!id)
5407 return ERR_PTR(-ENOENT);
5408
5409 spin_lock_bh(&link_idr_lock);
5410 /* before link is "settled", ID is 0, pretend it doesn't exist yet */
5411 link = idr_find(&link_idr, id);
5412 if (link) {
5413 if (link->id)
5414 link = bpf_link_inc_not_zero(link);
5415 else
5416 link = ERR_PTR(-EAGAIN);
5417 } else {
5418 link = ERR_PTR(-ENOENT);
5419 }
5420 spin_unlock_bh(&link_idr_lock);
5421 return link;
5422}
5423
5424struct bpf_link *bpf_link_get_curr_or_next(u32 *id)
5425{
5426 struct bpf_link *link;
5427
5428 spin_lock_bh(&link_idr_lock);
5429again:
5430 link = idr_get_next(&link_idr, id);
5431 if (link) {
5432 link = bpf_link_inc_not_zero(link);
5433 if (IS_ERR(link)) {
5434 (*id)++;
5435 goto again;
5436 }
5437 }
5438 spin_unlock_bh(&link_idr_lock);
5439
5440 return link;
5441}
5442
5443#define BPF_LINK_GET_FD_BY_ID_LAST_FIELD link_id
5444
5445static int bpf_link_get_fd_by_id(const union bpf_attr *attr)
5446{
5447 struct bpf_link *link;
5448 u32 id = attr->link_id;
5449 int fd;
5450
5451 if (CHECK_ATTR(BPF_LINK_GET_FD_BY_ID))
5452 return -EINVAL;
5453
5454 if (!capable(CAP_SYS_ADMIN))
5455 return -EPERM;
5456
5457 link = bpf_link_by_id(id);
5458 if (IS_ERR(link))
5459 return PTR_ERR(link);
5460
5461 fd = bpf_link_new_fd(link);
5462 if (fd < 0)
5463 bpf_link_put_direct(link);
5464
5465 return fd;
5466}
5467
5468DEFINE_MUTEX(bpf_stats_enabled_mutex);
5469
5470static int bpf_stats_release(struct inode *inode, struct file *file)
5471{
5472 mutex_lock(&bpf_stats_enabled_mutex);
5473 static_key_slow_dec(&bpf_stats_enabled_key.key);
5474 mutex_unlock(&bpf_stats_enabled_mutex);
5475 return 0;
5476}
5477
5478static const struct file_operations bpf_stats_fops = {
5479 .release = bpf_stats_release,
5480};
5481
5482static int bpf_enable_runtime_stats(void)
5483{
5484 int fd;
5485
5486 mutex_lock(&bpf_stats_enabled_mutex);
5487
5488 /* Set a very high limit to avoid overflow */
5489 if (static_key_count(&bpf_stats_enabled_key.key) > INT_MAX / 2) {
5490 mutex_unlock(&bpf_stats_enabled_mutex);
5491 return -EBUSY;
5492 }
5493
5494 fd = anon_inode_getfd("bpf-stats", &bpf_stats_fops, NULL, O_CLOEXEC);
5495 if (fd >= 0)
5496 static_key_slow_inc(&bpf_stats_enabled_key.key);
5497
5498 mutex_unlock(&bpf_stats_enabled_mutex);
5499 return fd;
5500}
5501
5502#define BPF_ENABLE_STATS_LAST_FIELD enable_stats.type
5503
5504static int bpf_enable_stats(union bpf_attr *attr)
5505{
5506
5507 if (CHECK_ATTR(BPF_ENABLE_STATS))
5508 return -EINVAL;
5509
5510 if (!capable(CAP_SYS_ADMIN))
5511 return -EPERM;
5512
5513 switch (attr->enable_stats.type) {
5514 case BPF_STATS_RUN_TIME:
5515 return bpf_enable_runtime_stats();
5516 default:
5517 break;
5518 }
5519 return -EINVAL;
5520}
5521
5522#define BPF_ITER_CREATE_LAST_FIELD iter_create.flags
5523
5524static int bpf_iter_create(union bpf_attr *attr)
5525{
5526 struct bpf_link *link;
5527 int err;
5528
5529 if (CHECK_ATTR(BPF_ITER_CREATE))
5530 return -EINVAL;
5531
5532 if (attr->iter_create.flags)
5533 return -EINVAL;
5534
5535 link = bpf_link_get_from_fd(attr->iter_create.link_fd);
5536 if (IS_ERR(link))
5537 return PTR_ERR(link);
5538
5539 err = bpf_iter_new_fd(link);
5540 bpf_link_put_direct(link);
5541
5542 return err;
5543}
5544
5545#define BPF_PROG_BIND_MAP_LAST_FIELD prog_bind_map.flags
5546
5547static int bpf_prog_bind_map(union bpf_attr *attr)
5548{
5549 struct bpf_prog *prog;
5550 struct bpf_map *map;
5551 struct bpf_map **used_maps_old, **used_maps_new;
5552 int i, ret = 0;
5553
5554 if (CHECK_ATTR(BPF_PROG_BIND_MAP))
5555 return -EINVAL;
5556
5557 if (attr->prog_bind_map.flags)
5558 return -EINVAL;
5559
5560 prog = bpf_prog_get(attr->prog_bind_map.prog_fd);
5561 if (IS_ERR(prog))
5562 return PTR_ERR(prog);
5563
5564 map = bpf_map_get(attr->prog_bind_map.map_fd);
5565 if (IS_ERR(map)) {
5566 ret = PTR_ERR(map);
5567 goto out_prog_put;
5568 }
5569
5570 mutex_lock(&prog->aux->used_maps_mutex);
5571
5572 used_maps_old = prog->aux->used_maps;
5573
5574 for (i = 0; i < prog->aux->used_map_cnt; i++)
5575 if (used_maps_old[i] == map) {
5576 bpf_map_put(map);
5577 goto out_unlock;
5578 }
5579
5580 used_maps_new = kmalloc_array(prog->aux->used_map_cnt + 1,
5581 sizeof(used_maps_new[0]),
5582 GFP_KERNEL);
5583 if (!used_maps_new) {
5584 ret = -ENOMEM;
5585 goto out_unlock;
5586 }
5587
5588 /* The bpf program will not access the bpf map, but for the sake of
5589 * simplicity, increase sleepable_refcnt for sleepable program as well.
5590 */
5591 if (prog->sleepable)
5592 atomic64_inc(&map->sleepable_refcnt);
5593 memcpy(used_maps_new, used_maps_old,
5594 sizeof(used_maps_old[0]) * prog->aux->used_map_cnt);
5595 used_maps_new[prog->aux->used_map_cnt] = map;
5596
5597 prog->aux->used_map_cnt++;
5598 prog->aux->used_maps = used_maps_new;
5599
5600 kfree(used_maps_old);
5601
5602out_unlock:
5603 mutex_unlock(&prog->aux->used_maps_mutex);
5604
5605 if (ret)
5606 bpf_map_put(map);
5607out_prog_put:
5608 bpf_prog_put(prog);
5609 return ret;
5610}
5611
5612#define BPF_TOKEN_CREATE_LAST_FIELD token_create.bpffs_fd
5613
5614static int token_create(union bpf_attr *attr)
5615{
5616 if (CHECK_ATTR(BPF_TOKEN_CREATE))
5617 return -EINVAL;
5618
5619 /* no flags are supported yet */
5620 if (attr->token_create.flags)
5621 return -EINVAL;
5622
5623 return bpf_token_create(attr);
5624}
5625
5626static int __sys_bpf(int cmd, bpfptr_t uattr, unsigned int size)
5627{
5628 union bpf_attr attr;
5629 int err;
5630
5631 err = bpf_check_uarg_tail_zero(uattr, sizeof(attr), size);
5632 if (err)
5633 return err;
5634 size = min_t(u32, size, sizeof(attr));
5635
5636 /* copy attributes from user space, may be less than sizeof(bpf_attr) */
5637 memset(&attr, 0, sizeof(attr));
5638 if (copy_from_bpfptr(&attr, uattr, size) != 0)
5639 return -EFAULT;
5640
5641 err = security_bpf(cmd, &attr, size);
5642 if (err < 0)
5643 return err;
5644
5645 switch (cmd) {
5646 case BPF_MAP_CREATE:
5647 err = map_create(&attr);
5648 break;
5649 case BPF_MAP_LOOKUP_ELEM:
5650 err = map_lookup_elem(&attr);
5651 break;
5652 case BPF_MAP_UPDATE_ELEM:
5653 err = map_update_elem(&attr, uattr);
5654 break;
5655 case BPF_MAP_DELETE_ELEM:
5656 err = map_delete_elem(&attr, uattr);
5657 break;
5658 case BPF_MAP_GET_NEXT_KEY:
5659 err = map_get_next_key(&attr);
5660 break;
5661 case BPF_MAP_FREEZE:
5662 err = map_freeze(&attr);
5663 break;
5664 case BPF_PROG_LOAD:
5665 err = bpf_prog_load(&attr, uattr, size);
5666 break;
5667 case BPF_OBJ_PIN:
5668 err = bpf_obj_pin(&attr);
5669 break;
5670 case BPF_OBJ_GET:
5671 err = bpf_obj_get(&attr);
5672 break;
5673 case BPF_PROG_ATTACH:
5674 err = bpf_prog_attach(&attr);
5675 break;
5676 case BPF_PROG_DETACH:
5677 err = bpf_prog_detach(&attr);
5678 break;
5679 case BPF_PROG_QUERY:
5680 err = bpf_prog_query(&attr, uattr.user);
5681 break;
5682 case BPF_PROG_TEST_RUN:
5683 err = bpf_prog_test_run(&attr, uattr.user);
5684 break;
5685 case BPF_PROG_GET_NEXT_ID:
5686 err = bpf_obj_get_next_id(&attr, uattr.user,
5687 &prog_idr, &prog_idr_lock);
5688 break;
5689 case BPF_MAP_GET_NEXT_ID:
5690 err = bpf_obj_get_next_id(&attr, uattr.user,
5691 &map_idr, &map_idr_lock);
5692 break;
5693 case BPF_BTF_GET_NEXT_ID:
5694 err = bpf_obj_get_next_id(&attr, uattr.user,
5695 &btf_idr, &btf_idr_lock);
5696 break;
5697 case BPF_PROG_GET_FD_BY_ID:
5698 err = bpf_prog_get_fd_by_id(&attr);
5699 break;
5700 case BPF_MAP_GET_FD_BY_ID:
5701 err = bpf_map_get_fd_by_id(&attr);
5702 break;
5703 case BPF_OBJ_GET_INFO_BY_FD:
5704 err = bpf_obj_get_info_by_fd(&attr, uattr.user);
5705 break;
5706 case BPF_RAW_TRACEPOINT_OPEN:
5707 err = bpf_raw_tracepoint_open(&attr);
5708 break;
5709 case BPF_BTF_LOAD:
5710 err = bpf_btf_load(&attr, uattr, size);
5711 break;
5712 case BPF_BTF_GET_FD_BY_ID:
5713 err = bpf_btf_get_fd_by_id(&attr);
5714 break;
5715 case BPF_TASK_FD_QUERY:
5716 err = bpf_task_fd_query(&attr, uattr.user);
5717 break;
5718 case BPF_MAP_LOOKUP_AND_DELETE_ELEM:
5719 err = map_lookup_and_delete_elem(&attr);
5720 break;
5721 case BPF_MAP_LOOKUP_BATCH:
5722 err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_LOOKUP_BATCH);
5723 break;
5724 case BPF_MAP_LOOKUP_AND_DELETE_BATCH:
5725 err = bpf_map_do_batch(&attr, uattr.user,
5726 BPF_MAP_LOOKUP_AND_DELETE_BATCH);
5727 break;
5728 case BPF_MAP_UPDATE_BATCH:
5729 err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_UPDATE_BATCH);
5730 break;
5731 case BPF_MAP_DELETE_BATCH:
5732 err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_DELETE_BATCH);
5733 break;
5734 case BPF_LINK_CREATE:
5735 err = link_create(&attr, uattr);
5736 break;
5737 case BPF_LINK_UPDATE:
5738 err = link_update(&attr);
5739 break;
5740 case BPF_LINK_GET_FD_BY_ID:
5741 err = bpf_link_get_fd_by_id(&attr);
5742 break;
5743 case BPF_LINK_GET_NEXT_ID:
5744 err = bpf_obj_get_next_id(&attr, uattr.user,
5745 &link_idr, &link_idr_lock);
5746 break;
5747 case BPF_ENABLE_STATS:
5748 err = bpf_enable_stats(&attr);
5749 break;
5750 case BPF_ITER_CREATE:
5751 err = bpf_iter_create(&attr);
5752 break;
5753 case BPF_LINK_DETACH:
5754 err = link_detach(&attr);
5755 break;
5756 case BPF_PROG_BIND_MAP:
5757 err = bpf_prog_bind_map(&attr);
5758 break;
5759 case BPF_TOKEN_CREATE:
5760 err = token_create(&attr);
5761 break;
5762 default:
5763 err = -EINVAL;
5764 break;
5765 }
5766
5767 return err;
5768}
5769
5770SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
5771{
5772 return __sys_bpf(cmd, USER_BPFPTR(uattr), size);
5773}
5774
5775static bool syscall_prog_is_valid_access(int off, int size,
5776 enum bpf_access_type type,
5777 const struct bpf_prog *prog,
5778 struct bpf_insn_access_aux *info)
5779{
5780 if (off < 0 || off >= U16_MAX)
5781 return false;
5782 if (off % size != 0)
5783 return false;
5784 return true;
5785}
5786
5787BPF_CALL_3(bpf_sys_bpf, int, cmd, union bpf_attr *, attr, u32, attr_size)
5788{
5789 switch (cmd) {
5790 case BPF_MAP_CREATE:
5791 case BPF_MAP_DELETE_ELEM:
5792 case BPF_MAP_UPDATE_ELEM:
5793 case BPF_MAP_FREEZE:
5794 case BPF_MAP_GET_FD_BY_ID:
5795 case BPF_PROG_LOAD:
5796 case BPF_BTF_LOAD:
5797 case BPF_LINK_CREATE:
5798 case BPF_RAW_TRACEPOINT_OPEN:
5799 break;
5800 default:
5801 return -EINVAL;
5802 }
5803 return __sys_bpf(cmd, KERNEL_BPFPTR(attr), attr_size);
5804}
5805
5806
5807/* To shut up -Wmissing-prototypes.
5808 * This function is used by the kernel light skeleton
5809 * to load bpf programs when modules are loaded or during kernel boot.
5810 * See tools/lib/bpf/skel_internal.h
5811 */
5812int kern_sys_bpf(int cmd, union bpf_attr *attr, unsigned int size);
5813
5814int kern_sys_bpf(int cmd, union bpf_attr *attr, unsigned int size)
5815{
5816 struct bpf_prog * __maybe_unused prog;
5817 struct bpf_tramp_run_ctx __maybe_unused run_ctx;
5818
5819 switch (cmd) {
5820#ifdef CONFIG_BPF_JIT /* __bpf_prog_enter_sleepable used by trampoline and JIT */
5821 case BPF_PROG_TEST_RUN:
5822 if (attr->test.data_in || attr->test.data_out ||
5823 attr->test.ctx_out || attr->test.duration ||
5824 attr->test.repeat || attr->test.flags)
5825 return -EINVAL;
5826
5827 prog = bpf_prog_get_type(attr->test.prog_fd, BPF_PROG_TYPE_SYSCALL);
5828 if (IS_ERR(prog))
5829 return PTR_ERR(prog);
5830
5831 if (attr->test.ctx_size_in < prog->aux->max_ctx_offset ||
5832 attr->test.ctx_size_in > U16_MAX) {
5833 bpf_prog_put(prog);
5834 return -EINVAL;
5835 }
5836
5837 run_ctx.bpf_cookie = 0;
5838 if (!__bpf_prog_enter_sleepable_recur(prog, &run_ctx)) {
5839 /* recursion detected */
5840 __bpf_prog_exit_sleepable_recur(prog, 0, &run_ctx);
5841 bpf_prog_put(prog);
5842 return -EBUSY;
5843 }
5844 attr->test.retval = bpf_prog_run(prog, (void *) (long) attr->test.ctx_in);
5845 __bpf_prog_exit_sleepable_recur(prog, 0 /* bpf_prog_run does runtime stats */,
5846 &run_ctx);
5847 bpf_prog_put(prog);
5848 return 0;
5849#endif
5850 default:
5851 return ____bpf_sys_bpf(cmd, attr, size);
5852 }
5853}
5854EXPORT_SYMBOL(kern_sys_bpf);
5855
5856static const struct bpf_func_proto bpf_sys_bpf_proto = {
5857 .func = bpf_sys_bpf,
5858 .gpl_only = false,
5859 .ret_type = RET_INTEGER,
5860 .arg1_type = ARG_ANYTHING,
5861 .arg2_type = ARG_PTR_TO_MEM | MEM_RDONLY,
5862 .arg3_type = ARG_CONST_SIZE,
5863};
5864
5865const struct bpf_func_proto * __weak
5866tracing_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
5867{
5868 return bpf_base_func_proto(func_id, prog);
5869}
5870
5871BPF_CALL_1(bpf_sys_close, u32, fd)
5872{
5873 /* When bpf program calls this helper there should not be
5874 * an fdget() without matching completed fdput().
5875 * This helper is allowed in the following callchain only:
5876 * sys_bpf->prog_test_run->bpf_prog->bpf_sys_close
5877 */
5878 return close_fd(fd);
5879}
5880
5881static const struct bpf_func_proto bpf_sys_close_proto = {
5882 .func = bpf_sys_close,
5883 .gpl_only = false,
5884 .ret_type = RET_INTEGER,
5885 .arg1_type = ARG_ANYTHING,
5886};
5887
5888BPF_CALL_4(bpf_kallsyms_lookup_name, const char *, name, int, name_sz, int, flags, u64 *, res)
5889{
5890 if (flags)
5891 return -EINVAL;
5892
5893 if (name_sz <= 1 || name[name_sz - 1])
5894 return -EINVAL;
5895
5896 if (!bpf_dump_raw_ok(current_cred()))
5897 return -EPERM;
5898
5899 *res = kallsyms_lookup_name(name);
5900 return *res ? 0 : -ENOENT;
5901}
5902
5903static const struct bpf_func_proto bpf_kallsyms_lookup_name_proto = {
5904 .func = bpf_kallsyms_lookup_name,
5905 .gpl_only = false,
5906 .ret_type = RET_INTEGER,
5907 .arg1_type = ARG_PTR_TO_MEM,
5908 .arg2_type = ARG_CONST_SIZE_OR_ZERO,
5909 .arg3_type = ARG_ANYTHING,
5910 .arg4_type = ARG_PTR_TO_LONG,
5911};
5912
5913static const struct bpf_func_proto *
5914syscall_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
5915{
5916 switch (func_id) {
5917 case BPF_FUNC_sys_bpf:
5918 return !bpf_token_capable(prog->aux->token, CAP_PERFMON)
5919 ? NULL : &bpf_sys_bpf_proto;
5920 case BPF_FUNC_btf_find_by_name_kind:
5921 return &bpf_btf_find_by_name_kind_proto;
5922 case BPF_FUNC_sys_close:
5923 return &bpf_sys_close_proto;
5924 case BPF_FUNC_kallsyms_lookup_name:
5925 return &bpf_kallsyms_lookup_name_proto;
5926 default:
5927 return tracing_prog_func_proto(func_id, prog);
5928 }
5929}
5930
5931const struct bpf_verifier_ops bpf_syscall_verifier_ops = {
5932 .get_func_proto = syscall_prog_func_proto,
5933 .is_valid_access = syscall_prog_is_valid_access,
5934};
5935
5936const struct bpf_prog_ops bpf_syscall_prog_ops = {
5937 .test_run = bpf_prog_test_run_syscall,
5938};
5939
5940#ifdef CONFIG_SYSCTL
5941static int bpf_stats_handler(struct ctl_table *table, int write,
5942 void *buffer, size_t *lenp, loff_t *ppos)
5943{
5944 struct static_key *key = (struct static_key *)table->data;
5945 static int saved_val;
5946 int val, ret;
5947 struct ctl_table tmp = {
5948 .data = &val,
5949 .maxlen = sizeof(val),
5950 .mode = table->mode,
5951 .extra1 = SYSCTL_ZERO,
5952 .extra2 = SYSCTL_ONE,
5953 };
5954
5955 if (write && !capable(CAP_SYS_ADMIN))
5956 return -EPERM;
5957
5958 mutex_lock(&bpf_stats_enabled_mutex);
5959 val = saved_val;
5960 ret = proc_dointvec_minmax(&tmp, write, buffer, lenp, ppos);
5961 if (write && !ret && val != saved_val) {
5962 if (val)
5963 static_key_slow_inc(key);
5964 else
5965 static_key_slow_dec(key);
5966 saved_val = val;
5967 }
5968 mutex_unlock(&bpf_stats_enabled_mutex);
5969 return ret;
5970}
5971
5972void __weak unpriv_ebpf_notify(int new_state)
5973{
5974}
5975
5976static int bpf_unpriv_handler(struct ctl_table *table, int write,
5977 void *buffer, size_t *lenp, loff_t *ppos)
5978{
5979 int ret, unpriv_enable = *(int *)table->data;
5980 bool locked_state = unpriv_enable == 1;
5981 struct ctl_table tmp = *table;
5982
5983 if (write && !capable(CAP_SYS_ADMIN))
5984 return -EPERM;
5985
5986 tmp.data = &unpriv_enable;
5987 ret = proc_dointvec_minmax(&tmp, write, buffer, lenp, ppos);
5988 if (write && !ret) {
5989 if (locked_state && unpriv_enable != 1)
5990 return -EPERM;
5991 *(int *)table->data = unpriv_enable;
5992 }
5993
5994 if (write)
5995 unpriv_ebpf_notify(unpriv_enable);
5996
5997 return ret;
5998}
5999
6000static struct ctl_table bpf_syscall_table[] = {
6001 {
6002 .procname = "unprivileged_bpf_disabled",
6003 .data = &sysctl_unprivileged_bpf_disabled,
6004 .maxlen = sizeof(sysctl_unprivileged_bpf_disabled),
6005 .mode = 0644,
6006 .proc_handler = bpf_unpriv_handler,
6007 .extra1 = SYSCTL_ZERO,
6008 .extra2 = SYSCTL_TWO,
6009 },
6010 {
6011 .procname = "bpf_stats_enabled",
6012 .data = &bpf_stats_enabled_key.key,
6013 .mode = 0644,
6014 .proc_handler = bpf_stats_handler,
6015 },
6016 { }
6017};
6018
6019static int __init bpf_syscall_sysctl_init(void)
6020{
6021 register_sysctl_init("kernel", bpf_syscall_table);
6022 return 0;
6023}
6024late_initcall(bpf_syscall_sysctl_init);
6025#endif /* CONFIG_SYSCTL */
1// SPDX-License-Identifier: GPL-2.0-only
2/* Copyright (c) 2011-2014 PLUMgrid, http://plumgrid.com
3 */
4#include <linux/bpf.h>
5#include <linux/bpf_trace.h>
6#include <linux/bpf_lirc.h>
7#include <linux/bpf_verifier.h>
8#include <linux/btf.h>
9#include <linux/syscalls.h>
10#include <linux/slab.h>
11#include <linux/sched/signal.h>
12#include <linux/vmalloc.h>
13#include <linux/mmzone.h>
14#include <linux/anon_inodes.h>
15#include <linux/fdtable.h>
16#include <linux/file.h>
17#include <linux/fs.h>
18#include <linux/license.h>
19#include <linux/filter.h>
20#include <linux/kernel.h>
21#include <linux/idr.h>
22#include <linux/cred.h>
23#include <linux/timekeeping.h>
24#include <linux/ctype.h>
25#include <linux/nospec.h>
26#include <linux/audit.h>
27#include <uapi/linux/btf.h>
28#include <linux/pgtable.h>
29#include <linux/bpf_lsm.h>
30#include <linux/poll.h>
31#include <linux/bpf-netns.h>
32#include <linux/rcupdate_trace.h>
33#include <linux/memcontrol.h>
34
35#define IS_FD_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PERF_EVENT_ARRAY || \
36 (map)->map_type == BPF_MAP_TYPE_CGROUP_ARRAY || \
37 (map)->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
38#define IS_FD_PROG_ARRAY(map) ((map)->map_type == BPF_MAP_TYPE_PROG_ARRAY)
39#define IS_FD_HASH(map) ((map)->map_type == BPF_MAP_TYPE_HASH_OF_MAPS)
40#define IS_FD_MAP(map) (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map) || \
41 IS_FD_HASH(map))
42
43#define BPF_OBJ_FLAG_MASK (BPF_F_RDONLY | BPF_F_WRONLY)
44
45DEFINE_PER_CPU(int, bpf_prog_active);
46static DEFINE_IDR(prog_idr);
47static DEFINE_SPINLOCK(prog_idr_lock);
48static DEFINE_IDR(map_idr);
49static DEFINE_SPINLOCK(map_idr_lock);
50static DEFINE_IDR(link_idr);
51static DEFINE_SPINLOCK(link_idr_lock);
52
53int sysctl_unprivileged_bpf_disabled __read_mostly =
54 IS_BUILTIN(CONFIG_BPF_UNPRIV_DEFAULT_OFF) ? 2 : 0;
55
56static const struct bpf_map_ops * const bpf_map_types[] = {
57#define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type)
58#define BPF_MAP_TYPE(_id, _ops) \
59 [_id] = &_ops,
60#define BPF_LINK_TYPE(_id, _name)
61#include <linux/bpf_types.h>
62#undef BPF_PROG_TYPE
63#undef BPF_MAP_TYPE
64#undef BPF_LINK_TYPE
65};
66
67/*
68 * If we're handed a bigger struct than we know of, ensure all the unknown bits
69 * are 0 - i.e. new user-space does not rely on any kernel feature extensions
70 * we don't know about yet.
71 *
72 * There is a ToCToU between this function call and the following
73 * copy_from_user() call. However, this is not a concern since this function is
74 * meant to be a future-proofing of bits.
75 */
76int bpf_check_uarg_tail_zero(bpfptr_t uaddr,
77 size_t expected_size,
78 size_t actual_size)
79{
80 int res;
81
82 if (unlikely(actual_size > PAGE_SIZE)) /* silly large */
83 return -E2BIG;
84
85 if (actual_size <= expected_size)
86 return 0;
87
88 if (uaddr.is_kernel)
89 res = memchr_inv(uaddr.kernel + expected_size, 0,
90 actual_size - expected_size) == NULL;
91 else
92 res = check_zeroed_user(uaddr.user + expected_size,
93 actual_size - expected_size);
94 if (res < 0)
95 return res;
96 return res ? 0 : -E2BIG;
97}
98
99const struct bpf_map_ops bpf_map_offload_ops = {
100 .map_meta_equal = bpf_map_meta_equal,
101 .map_alloc = bpf_map_offload_map_alloc,
102 .map_free = bpf_map_offload_map_free,
103 .map_check_btf = map_check_no_btf,
104};
105
106static struct bpf_map *find_and_alloc_map(union bpf_attr *attr)
107{
108 const struct bpf_map_ops *ops;
109 u32 type = attr->map_type;
110 struct bpf_map *map;
111 int err;
112
113 if (type >= ARRAY_SIZE(bpf_map_types))
114 return ERR_PTR(-EINVAL);
115 type = array_index_nospec(type, ARRAY_SIZE(bpf_map_types));
116 ops = bpf_map_types[type];
117 if (!ops)
118 return ERR_PTR(-EINVAL);
119
120 if (ops->map_alloc_check) {
121 err = ops->map_alloc_check(attr);
122 if (err)
123 return ERR_PTR(err);
124 }
125 if (attr->map_ifindex)
126 ops = &bpf_map_offload_ops;
127 map = ops->map_alloc(attr);
128 if (IS_ERR(map))
129 return map;
130 map->ops = ops;
131 map->map_type = type;
132 return map;
133}
134
135static u32 bpf_map_value_size(const struct bpf_map *map)
136{
137 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
138 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
139 map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
140 map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
141 return round_up(map->value_size, 8) * num_possible_cpus();
142 else if (IS_FD_MAP(map))
143 return sizeof(u32);
144 else
145 return map->value_size;
146}
147
148static void maybe_wait_bpf_programs(struct bpf_map *map)
149{
150 /* Wait for any running BPF programs to complete so that
151 * userspace, when we return to it, knows that all programs
152 * that could be running use the new map value.
153 */
154 if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS ||
155 map->map_type == BPF_MAP_TYPE_ARRAY_OF_MAPS)
156 synchronize_rcu();
157}
158
159static int bpf_map_update_value(struct bpf_map *map, struct fd f, void *key,
160 void *value, __u64 flags)
161{
162 int err;
163
164 /* Need to create a kthread, thus must support schedule */
165 if (bpf_map_is_dev_bound(map)) {
166 return bpf_map_offload_update_elem(map, key, value, flags);
167 } else if (map->map_type == BPF_MAP_TYPE_CPUMAP ||
168 map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
169 return map->ops->map_update_elem(map, key, value, flags);
170 } else if (map->map_type == BPF_MAP_TYPE_SOCKHASH ||
171 map->map_type == BPF_MAP_TYPE_SOCKMAP) {
172 return sock_map_update_elem_sys(map, key, value, flags);
173 } else if (IS_FD_PROG_ARRAY(map)) {
174 return bpf_fd_array_map_update_elem(map, f.file, key, value,
175 flags);
176 }
177
178 bpf_disable_instrumentation();
179 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
180 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
181 err = bpf_percpu_hash_update(map, key, value, flags);
182 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
183 err = bpf_percpu_array_update(map, key, value, flags);
184 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
185 err = bpf_percpu_cgroup_storage_update(map, key, value,
186 flags);
187 } else if (IS_FD_ARRAY(map)) {
188 rcu_read_lock();
189 err = bpf_fd_array_map_update_elem(map, f.file, key, value,
190 flags);
191 rcu_read_unlock();
192 } else if (map->map_type == BPF_MAP_TYPE_HASH_OF_MAPS) {
193 rcu_read_lock();
194 err = bpf_fd_htab_map_update_elem(map, f.file, key, value,
195 flags);
196 rcu_read_unlock();
197 } else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
198 /* rcu_read_lock() is not needed */
199 err = bpf_fd_reuseport_array_update_elem(map, key, value,
200 flags);
201 } else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
202 map->map_type == BPF_MAP_TYPE_STACK) {
203 err = map->ops->map_push_elem(map, value, flags);
204 } else {
205 rcu_read_lock();
206 err = map->ops->map_update_elem(map, key, value, flags);
207 rcu_read_unlock();
208 }
209 bpf_enable_instrumentation();
210 maybe_wait_bpf_programs(map);
211
212 return err;
213}
214
215static int bpf_map_copy_value(struct bpf_map *map, void *key, void *value,
216 __u64 flags)
217{
218 void *ptr;
219 int err;
220
221 if (bpf_map_is_dev_bound(map))
222 return bpf_map_offload_lookup_elem(map, key, value);
223
224 bpf_disable_instrumentation();
225 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
226 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
227 err = bpf_percpu_hash_copy(map, key, value);
228 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY) {
229 err = bpf_percpu_array_copy(map, key, value);
230 } else if (map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE) {
231 err = bpf_percpu_cgroup_storage_copy(map, key, value);
232 } else if (map->map_type == BPF_MAP_TYPE_STACK_TRACE) {
233 err = bpf_stackmap_copy(map, key, value);
234 } else if (IS_FD_ARRAY(map) || IS_FD_PROG_ARRAY(map)) {
235 err = bpf_fd_array_map_lookup_elem(map, key, value);
236 } else if (IS_FD_HASH(map)) {
237 err = bpf_fd_htab_map_lookup_elem(map, key, value);
238 } else if (map->map_type == BPF_MAP_TYPE_REUSEPORT_SOCKARRAY) {
239 err = bpf_fd_reuseport_array_lookup_elem(map, key, value);
240 } else if (map->map_type == BPF_MAP_TYPE_QUEUE ||
241 map->map_type == BPF_MAP_TYPE_STACK) {
242 err = map->ops->map_peek_elem(map, value);
243 } else if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
244 /* struct_ops map requires directly updating "value" */
245 err = bpf_struct_ops_map_sys_lookup_elem(map, key, value);
246 } else {
247 rcu_read_lock();
248 if (map->ops->map_lookup_elem_sys_only)
249 ptr = map->ops->map_lookup_elem_sys_only(map, key);
250 else
251 ptr = map->ops->map_lookup_elem(map, key);
252 if (IS_ERR(ptr)) {
253 err = PTR_ERR(ptr);
254 } else if (!ptr) {
255 err = -ENOENT;
256 } else {
257 err = 0;
258 if (flags & BPF_F_LOCK)
259 /* lock 'ptr' and copy everything but lock */
260 copy_map_value_locked(map, value, ptr, true);
261 else
262 copy_map_value(map, value, ptr);
263 /* mask lock, since value wasn't zero inited */
264 check_and_init_map_lock(map, value);
265 }
266 rcu_read_unlock();
267 }
268
269 bpf_enable_instrumentation();
270 maybe_wait_bpf_programs(map);
271
272 return err;
273}
274
275/* Please, do not use this function outside from the map creation path
276 * (e.g. in map update path) without taking care of setting the active
277 * memory cgroup (see at bpf_map_kmalloc_node() for example).
278 */
279static void *__bpf_map_area_alloc(u64 size, int numa_node, bool mmapable)
280{
281 /* We really just want to fail instead of triggering OOM killer
282 * under memory pressure, therefore we set __GFP_NORETRY to kmalloc,
283 * which is used for lower order allocation requests.
284 *
285 * It has been observed that higher order allocation requests done by
286 * vmalloc with __GFP_NORETRY being set might fail due to not trying
287 * to reclaim memory from the page cache, thus we set
288 * __GFP_RETRY_MAYFAIL to avoid such situations.
289 */
290
291 const gfp_t gfp = __GFP_NOWARN | __GFP_ZERO | __GFP_ACCOUNT;
292 unsigned int flags = 0;
293 unsigned long align = 1;
294 void *area;
295
296 if (size >= SIZE_MAX)
297 return NULL;
298
299 /* kmalloc()'ed memory can't be mmap()'ed */
300 if (mmapable) {
301 BUG_ON(!PAGE_ALIGNED(size));
302 align = SHMLBA;
303 flags = VM_USERMAP;
304 } else if (size <= (PAGE_SIZE << PAGE_ALLOC_COSTLY_ORDER)) {
305 area = kmalloc_node(size, gfp | GFP_USER | __GFP_NORETRY,
306 numa_node);
307 if (area != NULL)
308 return area;
309 }
310
311 return __vmalloc_node_range(size, align, VMALLOC_START, VMALLOC_END,
312 gfp | GFP_KERNEL | __GFP_RETRY_MAYFAIL, PAGE_KERNEL,
313 flags, numa_node, __builtin_return_address(0));
314}
315
316void *bpf_map_area_alloc(u64 size, int numa_node)
317{
318 return __bpf_map_area_alloc(size, numa_node, false);
319}
320
321void *bpf_map_area_mmapable_alloc(u64 size, int numa_node)
322{
323 return __bpf_map_area_alloc(size, numa_node, true);
324}
325
326void bpf_map_area_free(void *area)
327{
328 kvfree(area);
329}
330
331static u32 bpf_map_flags_retain_permanent(u32 flags)
332{
333 /* Some map creation flags are not tied to the map object but
334 * rather to the map fd instead, so they have no meaning upon
335 * map object inspection since multiple file descriptors with
336 * different (access) properties can exist here. Thus, given
337 * this has zero meaning for the map itself, lets clear these
338 * from here.
339 */
340 return flags & ~(BPF_F_RDONLY | BPF_F_WRONLY);
341}
342
343void bpf_map_init_from_attr(struct bpf_map *map, union bpf_attr *attr)
344{
345 map->map_type = attr->map_type;
346 map->key_size = attr->key_size;
347 map->value_size = attr->value_size;
348 map->max_entries = attr->max_entries;
349 map->map_flags = bpf_map_flags_retain_permanent(attr->map_flags);
350 map->numa_node = bpf_map_attr_numa_node(attr);
351}
352
353static int bpf_map_alloc_id(struct bpf_map *map)
354{
355 int id;
356
357 idr_preload(GFP_KERNEL);
358 spin_lock_bh(&map_idr_lock);
359 id = idr_alloc_cyclic(&map_idr, map, 1, INT_MAX, GFP_ATOMIC);
360 if (id > 0)
361 map->id = id;
362 spin_unlock_bh(&map_idr_lock);
363 idr_preload_end();
364
365 if (WARN_ON_ONCE(!id))
366 return -ENOSPC;
367
368 return id > 0 ? 0 : id;
369}
370
371void bpf_map_free_id(struct bpf_map *map, bool do_idr_lock)
372{
373 unsigned long flags;
374
375 /* Offloaded maps are removed from the IDR store when their device
376 * disappears - even if someone holds an fd to them they are unusable,
377 * the memory is gone, all ops will fail; they are simply waiting for
378 * refcnt to drop to be freed.
379 */
380 if (!map->id)
381 return;
382
383 if (do_idr_lock)
384 spin_lock_irqsave(&map_idr_lock, flags);
385 else
386 __acquire(&map_idr_lock);
387
388 idr_remove(&map_idr, map->id);
389 map->id = 0;
390
391 if (do_idr_lock)
392 spin_unlock_irqrestore(&map_idr_lock, flags);
393 else
394 __release(&map_idr_lock);
395}
396
397#ifdef CONFIG_MEMCG_KMEM
398static void bpf_map_save_memcg(struct bpf_map *map)
399{
400 map->memcg = get_mem_cgroup_from_mm(current->mm);
401}
402
403static void bpf_map_release_memcg(struct bpf_map *map)
404{
405 mem_cgroup_put(map->memcg);
406}
407
408void *bpf_map_kmalloc_node(const struct bpf_map *map, size_t size, gfp_t flags,
409 int node)
410{
411 struct mem_cgroup *old_memcg;
412 void *ptr;
413
414 old_memcg = set_active_memcg(map->memcg);
415 ptr = kmalloc_node(size, flags | __GFP_ACCOUNT, node);
416 set_active_memcg(old_memcg);
417
418 return ptr;
419}
420
421void *bpf_map_kzalloc(const struct bpf_map *map, size_t size, gfp_t flags)
422{
423 struct mem_cgroup *old_memcg;
424 void *ptr;
425
426 old_memcg = set_active_memcg(map->memcg);
427 ptr = kzalloc(size, flags | __GFP_ACCOUNT);
428 set_active_memcg(old_memcg);
429
430 return ptr;
431}
432
433void __percpu *bpf_map_alloc_percpu(const struct bpf_map *map, size_t size,
434 size_t align, gfp_t flags)
435{
436 struct mem_cgroup *old_memcg;
437 void __percpu *ptr;
438
439 old_memcg = set_active_memcg(map->memcg);
440 ptr = __alloc_percpu_gfp(size, align, flags | __GFP_ACCOUNT);
441 set_active_memcg(old_memcg);
442
443 return ptr;
444}
445
446#else
447static void bpf_map_save_memcg(struct bpf_map *map)
448{
449}
450
451static void bpf_map_release_memcg(struct bpf_map *map)
452{
453}
454#endif
455
456/* called from workqueue */
457static void bpf_map_free_deferred(struct work_struct *work)
458{
459 struct bpf_map *map = container_of(work, struct bpf_map, work);
460
461 security_bpf_map_free(map);
462 bpf_map_release_memcg(map);
463 /* implementation dependent freeing */
464 map->ops->map_free(map);
465}
466
467static void bpf_map_put_uref(struct bpf_map *map)
468{
469 if (atomic64_dec_and_test(&map->usercnt)) {
470 if (map->ops->map_release_uref)
471 map->ops->map_release_uref(map);
472 }
473}
474
475/* decrement map refcnt and schedule it for freeing via workqueue
476 * (unrelying map implementation ops->map_free() might sleep)
477 */
478static void __bpf_map_put(struct bpf_map *map, bool do_idr_lock)
479{
480 if (atomic64_dec_and_test(&map->refcnt)) {
481 /* bpf_map_free_id() must be called first */
482 bpf_map_free_id(map, do_idr_lock);
483 btf_put(map->btf);
484 INIT_WORK(&map->work, bpf_map_free_deferred);
485 schedule_work(&map->work);
486 }
487}
488
489void bpf_map_put(struct bpf_map *map)
490{
491 __bpf_map_put(map, true);
492}
493EXPORT_SYMBOL_GPL(bpf_map_put);
494
495void bpf_map_put_with_uref(struct bpf_map *map)
496{
497 bpf_map_put_uref(map);
498 bpf_map_put(map);
499}
500
501static int bpf_map_release(struct inode *inode, struct file *filp)
502{
503 struct bpf_map *map = filp->private_data;
504
505 if (map->ops->map_release)
506 map->ops->map_release(map, filp);
507
508 bpf_map_put_with_uref(map);
509 return 0;
510}
511
512static fmode_t map_get_sys_perms(struct bpf_map *map, struct fd f)
513{
514 fmode_t mode = f.file->f_mode;
515
516 /* Our file permissions may have been overridden by global
517 * map permissions facing syscall side.
518 */
519 if (READ_ONCE(map->frozen))
520 mode &= ~FMODE_CAN_WRITE;
521 return mode;
522}
523
524#ifdef CONFIG_PROC_FS
525/* Provides an approximation of the map's memory footprint.
526 * Used only to provide a backward compatibility and display
527 * a reasonable "memlock" info.
528 */
529static unsigned long bpf_map_memory_footprint(const struct bpf_map *map)
530{
531 unsigned long size;
532
533 size = round_up(map->key_size + bpf_map_value_size(map), 8);
534
535 return round_up(map->max_entries * size, PAGE_SIZE);
536}
537
538static void bpf_map_show_fdinfo(struct seq_file *m, struct file *filp)
539{
540 const struct bpf_map *map = filp->private_data;
541 const struct bpf_array *array;
542 u32 type = 0, jited = 0;
543
544 if (map->map_type == BPF_MAP_TYPE_PROG_ARRAY) {
545 array = container_of(map, struct bpf_array, map);
546 type = array->aux->type;
547 jited = array->aux->jited;
548 }
549
550 seq_printf(m,
551 "map_type:\t%u\n"
552 "key_size:\t%u\n"
553 "value_size:\t%u\n"
554 "max_entries:\t%u\n"
555 "map_flags:\t%#x\n"
556 "memlock:\t%lu\n"
557 "map_id:\t%u\n"
558 "frozen:\t%u\n",
559 map->map_type,
560 map->key_size,
561 map->value_size,
562 map->max_entries,
563 map->map_flags,
564 bpf_map_memory_footprint(map),
565 map->id,
566 READ_ONCE(map->frozen));
567 if (type) {
568 seq_printf(m, "owner_prog_type:\t%u\n", type);
569 seq_printf(m, "owner_jited:\t%u\n", jited);
570 }
571}
572#endif
573
574static ssize_t bpf_dummy_read(struct file *filp, char __user *buf, size_t siz,
575 loff_t *ppos)
576{
577 /* We need this handler such that alloc_file() enables
578 * f_mode with FMODE_CAN_READ.
579 */
580 return -EINVAL;
581}
582
583static ssize_t bpf_dummy_write(struct file *filp, const char __user *buf,
584 size_t siz, loff_t *ppos)
585{
586 /* We need this handler such that alloc_file() enables
587 * f_mode with FMODE_CAN_WRITE.
588 */
589 return -EINVAL;
590}
591
592/* called for any extra memory-mapped regions (except initial) */
593static void bpf_map_mmap_open(struct vm_area_struct *vma)
594{
595 struct bpf_map *map = vma->vm_file->private_data;
596
597 if (vma->vm_flags & VM_MAYWRITE) {
598 mutex_lock(&map->freeze_mutex);
599 map->writecnt++;
600 mutex_unlock(&map->freeze_mutex);
601 }
602}
603
604/* called for all unmapped memory region (including initial) */
605static void bpf_map_mmap_close(struct vm_area_struct *vma)
606{
607 struct bpf_map *map = vma->vm_file->private_data;
608
609 if (vma->vm_flags & VM_MAYWRITE) {
610 mutex_lock(&map->freeze_mutex);
611 map->writecnt--;
612 mutex_unlock(&map->freeze_mutex);
613 }
614}
615
616static const struct vm_operations_struct bpf_map_default_vmops = {
617 .open = bpf_map_mmap_open,
618 .close = bpf_map_mmap_close,
619};
620
621static int bpf_map_mmap(struct file *filp, struct vm_area_struct *vma)
622{
623 struct bpf_map *map = filp->private_data;
624 int err;
625
626 if (!map->ops->map_mmap || map_value_has_spin_lock(map))
627 return -ENOTSUPP;
628
629 if (!(vma->vm_flags & VM_SHARED))
630 return -EINVAL;
631
632 mutex_lock(&map->freeze_mutex);
633
634 if (vma->vm_flags & VM_WRITE) {
635 if (map->frozen) {
636 err = -EPERM;
637 goto out;
638 }
639 /* map is meant to be read-only, so do not allow mapping as
640 * writable, because it's possible to leak a writable page
641 * reference and allows user-space to still modify it after
642 * freezing, while verifier will assume contents do not change
643 */
644 if (map->map_flags & BPF_F_RDONLY_PROG) {
645 err = -EACCES;
646 goto out;
647 }
648 }
649
650 /* set default open/close callbacks */
651 vma->vm_ops = &bpf_map_default_vmops;
652 vma->vm_private_data = map;
653 vma->vm_flags &= ~VM_MAYEXEC;
654 if (!(vma->vm_flags & VM_WRITE))
655 /* disallow re-mapping with PROT_WRITE */
656 vma->vm_flags &= ~VM_MAYWRITE;
657
658 err = map->ops->map_mmap(map, vma);
659 if (err)
660 goto out;
661
662 if (vma->vm_flags & VM_MAYWRITE)
663 map->writecnt++;
664out:
665 mutex_unlock(&map->freeze_mutex);
666 return err;
667}
668
669static __poll_t bpf_map_poll(struct file *filp, struct poll_table_struct *pts)
670{
671 struct bpf_map *map = filp->private_data;
672
673 if (map->ops->map_poll)
674 return map->ops->map_poll(map, filp, pts);
675
676 return EPOLLERR;
677}
678
679const struct file_operations bpf_map_fops = {
680#ifdef CONFIG_PROC_FS
681 .show_fdinfo = bpf_map_show_fdinfo,
682#endif
683 .release = bpf_map_release,
684 .read = bpf_dummy_read,
685 .write = bpf_dummy_write,
686 .mmap = bpf_map_mmap,
687 .poll = bpf_map_poll,
688};
689
690int bpf_map_new_fd(struct bpf_map *map, int flags)
691{
692 int ret;
693
694 ret = security_bpf_map(map, OPEN_FMODE(flags));
695 if (ret < 0)
696 return ret;
697
698 return anon_inode_getfd("bpf-map", &bpf_map_fops, map,
699 flags | O_CLOEXEC);
700}
701
702int bpf_get_file_flag(int flags)
703{
704 if ((flags & BPF_F_RDONLY) && (flags & BPF_F_WRONLY))
705 return -EINVAL;
706 if (flags & BPF_F_RDONLY)
707 return O_RDONLY;
708 if (flags & BPF_F_WRONLY)
709 return O_WRONLY;
710 return O_RDWR;
711}
712
713/* helper macro to check that unused fields 'union bpf_attr' are zero */
714#define CHECK_ATTR(CMD) \
715 memchr_inv((void *) &attr->CMD##_LAST_FIELD + \
716 sizeof(attr->CMD##_LAST_FIELD), 0, \
717 sizeof(*attr) - \
718 offsetof(union bpf_attr, CMD##_LAST_FIELD) - \
719 sizeof(attr->CMD##_LAST_FIELD)) != NULL
720
721/* dst and src must have at least "size" number of bytes.
722 * Return strlen on success and < 0 on error.
723 */
724int bpf_obj_name_cpy(char *dst, const char *src, unsigned int size)
725{
726 const char *end = src + size;
727 const char *orig_src = src;
728
729 memset(dst, 0, size);
730 /* Copy all isalnum(), '_' and '.' chars. */
731 while (src < end && *src) {
732 if (!isalnum(*src) &&
733 *src != '_' && *src != '.')
734 return -EINVAL;
735 *dst++ = *src++;
736 }
737
738 /* No '\0' found in "size" number of bytes */
739 if (src == end)
740 return -EINVAL;
741
742 return src - orig_src;
743}
744
745int map_check_no_btf(const struct bpf_map *map,
746 const struct btf *btf,
747 const struct btf_type *key_type,
748 const struct btf_type *value_type)
749{
750 return -ENOTSUPP;
751}
752
753static int map_check_btf(struct bpf_map *map, const struct btf *btf,
754 u32 btf_key_id, u32 btf_value_id)
755{
756 const struct btf_type *key_type, *value_type;
757 u32 key_size, value_size;
758 int ret = 0;
759
760 /* Some maps allow key to be unspecified. */
761 if (btf_key_id) {
762 key_type = btf_type_id_size(btf, &btf_key_id, &key_size);
763 if (!key_type || key_size != map->key_size)
764 return -EINVAL;
765 } else {
766 key_type = btf_type_by_id(btf, 0);
767 if (!map->ops->map_check_btf)
768 return -EINVAL;
769 }
770
771 value_type = btf_type_id_size(btf, &btf_value_id, &value_size);
772 if (!value_type || value_size != map->value_size)
773 return -EINVAL;
774
775 map->spin_lock_off = btf_find_spin_lock(btf, value_type);
776
777 if (map_value_has_spin_lock(map)) {
778 if (map->map_flags & BPF_F_RDONLY_PROG)
779 return -EACCES;
780 if (map->map_type != BPF_MAP_TYPE_HASH &&
781 map->map_type != BPF_MAP_TYPE_ARRAY &&
782 map->map_type != BPF_MAP_TYPE_CGROUP_STORAGE &&
783 map->map_type != BPF_MAP_TYPE_SK_STORAGE &&
784 map->map_type != BPF_MAP_TYPE_INODE_STORAGE &&
785 map->map_type != BPF_MAP_TYPE_TASK_STORAGE)
786 return -ENOTSUPP;
787 if (map->spin_lock_off + sizeof(struct bpf_spin_lock) >
788 map->value_size) {
789 WARN_ONCE(1,
790 "verifier bug spin_lock_off %d value_size %d\n",
791 map->spin_lock_off, map->value_size);
792 return -EFAULT;
793 }
794 }
795
796 if (map->ops->map_check_btf)
797 ret = map->ops->map_check_btf(map, btf, key_type, value_type);
798
799 return ret;
800}
801
802#define BPF_MAP_CREATE_LAST_FIELD btf_vmlinux_value_type_id
803/* called via syscall */
804static int map_create(union bpf_attr *attr)
805{
806 int numa_node = bpf_map_attr_numa_node(attr);
807 struct bpf_map *map;
808 int f_flags;
809 int err;
810
811 err = CHECK_ATTR(BPF_MAP_CREATE);
812 if (err)
813 return -EINVAL;
814
815 if (attr->btf_vmlinux_value_type_id) {
816 if (attr->map_type != BPF_MAP_TYPE_STRUCT_OPS ||
817 attr->btf_key_type_id || attr->btf_value_type_id)
818 return -EINVAL;
819 } else if (attr->btf_key_type_id && !attr->btf_value_type_id) {
820 return -EINVAL;
821 }
822
823 f_flags = bpf_get_file_flag(attr->map_flags);
824 if (f_flags < 0)
825 return f_flags;
826
827 if (numa_node != NUMA_NO_NODE &&
828 ((unsigned int)numa_node >= nr_node_ids ||
829 !node_online(numa_node)))
830 return -EINVAL;
831
832 /* find map type and init map: hashtable vs rbtree vs bloom vs ... */
833 map = find_and_alloc_map(attr);
834 if (IS_ERR(map))
835 return PTR_ERR(map);
836
837 err = bpf_obj_name_cpy(map->name, attr->map_name,
838 sizeof(attr->map_name));
839 if (err < 0)
840 goto free_map;
841
842 atomic64_set(&map->refcnt, 1);
843 atomic64_set(&map->usercnt, 1);
844 mutex_init(&map->freeze_mutex);
845
846 map->spin_lock_off = -EINVAL;
847 if (attr->btf_key_type_id || attr->btf_value_type_id ||
848 /* Even the map's value is a kernel's struct,
849 * the bpf_prog.o must have BTF to begin with
850 * to figure out the corresponding kernel's
851 * counter part. Thus, attr->btf_fd has
852 * to be valid also.
853 */
854 attr->btf_vmlinux_value_type_id) {
855 struct btf *btf;
856
857 btf = btf_get_by_fd(attr->btf_fd);
858 if (IS_ERR(btf)) {
859 err = PTR_ERR(btf);
860 goto free_map;
861 }
862 if (btf_is_kernel(btf)) {
863 btf_put(btf);
864 err = -EACCES;
865 goto free_map;
866 }
867 map->btf = btf;
868
869 if (attr->btf_value_type_id) {
870 err = map_check_btf(map, btf, attr->btf_key_type_id,
871 attr->btf_value_type_id);
872 if (err)
873 goto free_map;
874 }
875
876 map->btf_key_type_id = attr->btf_key_type_id;
877 map->btf_value_type_id = attr->btf_value_type_id;
878 map->btf_vmlinux_value_type_id =
879 attr->btf_vmlinux_value_type_id;
880 }
881
882 err = security_bpf_map_alloc(map);
883 if (err)
884 goto free_map;
885
886 err = bpf_map_alloc_id(map);
887 if (err)
888 goto free_map_sec;
889
890 bpf_map_save_memcg(map);
891
892 err = bpf_map_new_fd(map, f_flags);
893 if (err < 0) {
894 /* failed to allocate fd.
895 * bpf_map_put_with_uref() is needed because the above
896 * bpf_map_alloc_id() has published the map
897 * to the userspace and the userspace may
898 * have refcnt-ed it through BPF_MAP_GET_FD_BY_ID.
899 */
900 bpf_map_put_with_uref(map);
901 return err;
902 }
903
904 return err;
905
906free_map_sec:
907 security_bpf_map_free(map);
908free_map:
909 btf_put(map->btf);
910 map->ops->map_free(map);
911 return err;
912}
913
914/* if error is returned, fd is released.
915 * On success caller should complete fd access with matching fdput()
916 */
917struct bpf_map *__bpf_map_get(struct fd f)
918{
919 if (!f.file)
920 return ERR_PTR(-EBADF);
921 if (f.file->f_op != &bpf_map_fops) {
922 fdput(f);
923 return ERR_PTR(-EINVAL);
924 }
925
926 return f.file->private_data;
927}
928
929void bpf_map_inc(struct bpf_map *map)
930{
931 atomic64_inc(&map->refcnt);
932}
933EXPORT_SYMBOL_GPL(bpf_map_inc);
934
935void bpf_map_inc_with_uref(struct bpf_map *map)
936{
937 atomic64_inc(&map->refcnt);
938 atomic64_inc(&map->usercnt);
939}
940EXPORT_SYMBOL_GPL(bpf_map_inc_with_uref);
941
942struct bpf_map *bpf_map_get(u32 ufd)
943{
944 struct fd f = fdget(ufd);
945 struct bpf_map *map;
946
947 map = __bpf_map_get(f);
948 if (IS_ERR(map))
949 return map;
950
951 bpf_map_inc(map);
952 fdput(f);
953
954 return map;
955}
956
957struct bpf_map *bpf_map_get_with_uref(u32 ufd)
958{
959 struct fd f = fdget(ufd);
960 struct bpf_map *map;
961
962 map = __bpf_map_get(f);
963 if (IS_ERR(map))
964 return map;
965
966 bpf_map_inc_with_uref(map);
967 fdput(f);
968
969 return map;
970}
971
972/* map_idr_lock should have been held */
973static struct bpf_map *__bpf_map_inc_not_zero(struct bpf_map *map, bool uref)
974{
975 int refold;
976
977 refold = atomic64_fetch_add_unless(&map->refcnt, 1, 0);
978 if (!refold)
979 return ERR_PTR(-ENOENT);
980 if (uref)
981 atomic64_inc(&map->usercnt);
982
983 return map;
984}
985
986struct bpf_map *bpf_map_inc_not_zero(struct bpf_map *map)
987{
988 spin_lock_bh(&map_idr_lock);
989 map = __bpf_map_inc_not_zero(map, false);
990 spin_unlock_bh(&map_idr_lock);
991
992 return map;
993}
994EXPORT_SYMBOL_GPL(bpf_map_inc_not_zero);
995
996int __weak bpf_stackmap_copy(struct bpf_map *map, void *key, void *value)
997{
998 return -ENOTSUPP;
999}
1000
1001static void *__bpf_copy_key(void __user *ukey, u64 key_size)
1002{
1003 if (key_size)
1004 return memdup_user(ukey, key_size);
1005
1006 if (ukey)
1007 return ERR_PTR(-EINVAL);
1008
1009 return NULL;
1010}
1011
1012static void *___bpf_copy_key(bpfptr_t ukey, u64 key_size)
1013{
1014 if (key_size)
1015 return memdup_bpfptr(ukey, key_size);
1016
1017 if (!bpfptr_is_null(ukey))
1018 return ERR_PTR(-EINVAL);
1019
1020 return NULL;
1021}
1022
1023/* last field in 'union bpf_attr' used by this command */
1024#define BPF_MAP_LOOKUP_ELEM_LAST_FIELD flags
1025
1026static int map_lookup_elem(union bpf_attr *attr)
1027{
1028 void __user *ukey = u64_to_user_ptr(attr->key);
1029 void __user *uvalue = u64_to_user_ptr(attr->value);
1030 int ufd = attr->map_fd;
1031 struct bpf_map *map;
1032 void *key, *value;
1033 u32 value_size;
1034 struct fd f;
1035 int err;
1036
1037 if (CHECK_ATTR(BPF_MAP_LOOKUP_ELEM))
1038 return -EINVAL;
1039
1040 if (attr->flags & ~BPF_F_LOCK)
1041 return -EINVAL;
1042
1043 f = fdget(ufd);
1044 map = __bpf_map_get(f);
1045 if (IS_ERR(map))
1046 return PTR_ERR(map);
1047 if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
1048 err = -EPERM;
1049 goto err_put;
1050 }
1051
1052 if ((attr->flags & BPF_F_LOCK) &&
1053 !map_value_has_spin_lock(map)) {
1054 err = -EINVAL;
1055 goto err_put;
1056 }
1057
1058 key = __bpf_copy_key(ukey, map->key_size);
1059 if (IS_ERR(key)) {
1060 err = PTR_ERR(key);
1061 goto err_put;
1062 }
1063
1064 value_size = bpf_map_value_size(map);
1065
1066 err = -ENOMEM;
1067 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
1068 if (!value)
1069 goto free_key;
1070
1071 err = bpf_map_copy_value(map, key, value, attr->flags);
1072 if (err)
1073 goto free_value;
1074
1075 err = -EFAULT;
1076 if (copy_to_user(uvalue, value, value_size) != 0)
1077 goto free_value;
1078
1079 err = 0;
1080
1081free_value:
1082 kfree(value);
1083free_key:
1084 kfree(key);
1085err_put:
1086 fdput(f);
1087 return err;
1088}
1089
1090
1091#define BPF_MAP_UPDATE_ELEM_LAST_FIELD flags
1092
1093static int map_update_elem(union bpf_attr *attr, bpfptr_t uattr)
1094{
1095 bpfptr_t ukey = make_bpfptr(attr->key, uattr.is_kernel);
1096 bpfptr_t uvalue = make_bpfptr(attr->value, uattr.is_kernel);
1097 int ufd = attr->map_fd;
1098 struct bpf_map *map;
1099 void *key, *value;
1100 u32 value_size;
1101 struct fd f;
1102 int err;
1103
1104 if (CHECK_ATTR(BPF_MAP_UPDATE_ELEM))
1105 return -EINVAL;
1106
1107 f = fdget(ufd);
1108 map = __bpf_map_get(f);
1109 if (IS_ERR(map))
1110 return PTR_ERR(map);
1111 if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1112 err = -EPERM;
1113 goto err_put;
1114 }
1115
1116 if ((attr->flags & BPF_F_LOCK) &&
1117 !map_value_has_spin_lock(map)) {
1118 err = -EINVAL;
1119 goto err_put;
1120 }
1121
1122 key = ___bpf_copy_key(ukey, map->key_size);
1123 if (IS_ERR(key)) {
1124 err = PTR_ERR(key);
1125 goto err_put;
1126 }
1127
1128 if (map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
1129 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH ||
1130 map->map_type == BPF_MAP_TYPE_PERCPU_ARRAY ||
1131 map->map_type == BPF_MAP_TYPE_PERCPU_CGROUP_STORAGE)
1132 value_size = round_up(map->value_size, 8) * num_possible_cpus();
1133 else
1134 value_size = map->value_size;
1135
1136 err = -ENOMEM;
1137 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
1138 if (!value)
1139 goto free_key;
1140
1141 err = -EFAULT;
1142 if (copy_from_bpfptr(value, uvalue, value_size) != 0)
1143 goto free_value;
1144
1145 err = bpf_map_update_value(map, f, key, value, attr->flags);
1146
1147free_value:
1148 kfree(value);
1149free_key:
1150 kfree(key);
1151err_put:
1152 fdput(f);
1153 return err;
1154}
1155
1156#define BPF_MAP_DELETE_ELEM_LAST_FIELD key
1157
1158static int map_delete_elem(union bpf_attr *attr)
1159{
1160 void __user *ukey = u64_to_user_ptr(attr->key);
1161 int ufd = attr->map_fd;
1162 struct bpf_map *map;
1163 struct fd f;
1164 void *key;
1165 int err;
1166
1167 if (CHECK_ATTR(BPF_MAP_DELETE_ELEM))
1168 return -EINVAL;
1169
1170 f = fdget(ufd);
1171 map = __bpf_map_get(f);
1172 if (IS_ERR(map))
1173 return PTR_ERR(map);
1174 if (!(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1175 err = -EPERM;
1176 goto err_put;
1177 }
1178
1179 key = __bpf_copy_key(ukey, map->key_size);
1180 if (IS_ERR(key)) {
1181 err = PTR_ERR(key);
1182 goto err_put;
1183 }
1184
1185 if (bpf_map_is_dev_bound(map)) {
1186 err = bpf_map_offload_delete_elem(map, key);
1187 goto out;
1188 } else if (IS_FD_PROG_ARRAY(map) ||
1189 map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
1190 /* These maps require sleepable context */
1191 err = map->ops->map_delete_elem(map, key);
1192 goto out;
1193 }
1194
1195 bpf_disable_instrumentation();
1196 rcu_read_lock();
1197 err = map->ops->map_delete_elem(map, key);
1198 rcu_read_unlock();
1199 bpf_enable_instrumentation();
1200 maybe_wait_bpf_programs(map);
1201out:
1202 kfree(key);
1203err_put:
1204 fdput(f);
1205 return err;
1206}
1207
1208/* last field in 'union bpf_attr' used by this command */
1209#define BPF_MAP_GET_NEXT_KEY_LAST_FIELD next_key
1210
1211static int map_get_next_key(union bpf_attr *attr)
1212{
1213 void __user *ukey = u64_to_user_ptr(attr->key);
1214 void __user *unext_key = u64_to_user_ptr(attr->next_key);
1215 int ufd = attr->map_fd;
1216 struct bpf_map *map;
1217 void *key, *next_key;
1218 struct fd f;
1219 int err;
1220
1221 if (CHECK_ATTR(BPF_MAP_GET_NEXT_KEY))
1222 return -EINVAL;
1223
1224 f = fdget(ufd);
1225 map = __bpf_map_get(f);
1226 if (IS_ERR(map))
1227 return PTR_ERR(map);
1228 if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
1229 err = -EPERM;
1230 goto err_put;
1231 }
1232
1233 if (ukey) {
1234 key = __bpf_copy_key(ukey, map->key_size);
1235 if (IS_ERR(key)) {
1236 err = PTR_ERR(key);
1237 goto err_put;
1238 }
1239 } else {
1240 key = NULL;
1241 }
1242
1243 err = -ENOMEM;
1244 next_key = kmalloc(map->key_size, GFP_USER);
1245 if (!next_key)
1246 goto free_key;
1247
1248 if (bpf_map_is_dev_bound(map)) {
1249 err = bpf_map_offload_get_next_key(map, key, next_key);
1250 goto out;
1251 }
1252
1253 rcu_read_lock();
1254 err = map->ops->map_get_next_key(map, key, next_key);
1255 rcu_read_unlock();
1256out:
1257 if (err)
1258 goto free_next_key;
1259
1260 err = -EFAULT;
1261 if (copy_to_user(unext_key, next_key, map->key_size) != 0)
1262 goto free_next_key;
1263
1264 err = 0;
1265
1266free_next_key:
1267 kfree(next_key);
1268free_key:
1269 kfree(key);
1270err_put:
1271 fdput(f);
1272 return err;
1273}
1274
1275int generic_map_delete_batch(struct bpf_map *map,
1276 const union bpf_attr *attr,
1277 union bpf_attr __user *uattr)
1278{
1279 void __user *keys = u64_to_user_ptr(attr->batch.keys);
1280 u32 cp, max_count;
1281 int err = 0;
1282 void *key;
1283
1284 if (attr->batch.elem_flags & ~BPF_F_LOCK)
1285 return -EINVAL;
1286
1287 if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1288 !map_value_has_spin_lock(map)) {
1289 return -EINVAL;
1290 }
1291
1292 max_count = attr->batch.count;
1293 if (!max_count)
1294 return 0;
1295
1296 key = kmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1297 if (!key)
1298 return -ENOMEM;
1299
1300 for (cp = 0; cp < max_count; cp++) {
1301 err = -EFAULT;
1302 if (copy_from_user(key, keys + cp * map->key_size,
1303 map->key_size))
1304 break;
1305
1306 if (bpf_map_is_dev_bound(map)) {
1307 err = bpf_map_offload_delete_elem(map, key);
1308 break;
1309 }
1310
1311 bpf_disable_instrumentation();
1312 rcu_read_lock();
1313 err = map->ops->map_delete_elem(map, key);
1314 rcu_read_unlock();
1315 bpf_enable_instrumentation();
1316 maybe_wait_bpf_programs(map);
1317 if (err)
1318 break;
1319 }
1320 if (copy_to_user(&uattr->batch.count, &cp, sizeof(cp)))
1321 err = -EFAULT;
1322
1323 kfree(key);
1324 return err;
1325}
1326
1327int generic_map_update_batch(struct bpf_map *map,
1328 const union bpf_attr *attr,
1329 union bpf_attr __user *uattr)
1330{
1331 void __user *values = u64_to_user_ptr(attr->batch.values);
1332 void __user *keys = u64_to_user_ptr(attr->batch.keys);
1333 u32 value_size, cp, max_count;
1334 int ufd = attr->map_fd;
1335 void *key, *value;
1336 struct fd f;
1337 int err = 0;
1338
1339 f = fdget(ufd);
1340 if (attr->batch.elem_flags & ~BPF_F_LOCK)
1341 return -EINVAL;
1342
1343 if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1344 !map_value_has_spin_lock(map)) {
1345 return -EINVAL;
1346 }
1347
1348 value_size = bpf_map_value_size(map);
1349
1350 max_count = attr->batch.count;
1351 if (!max_count)
1352 return 0;
1353
1354 key = kmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1355 if (!key)
1356 return -ENOMEM;
1357
1358 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
1359 if (!value) {
1360 kfree(key);
1361 return -ENOMEM;
1362 }
1363
1364 for (cp = 0; cp < max_count; cp++) {
1365 err = -EFAULT;
1366 if (copy_from_user(key, keys + cp * map->key_size,
1367 map->key_size) ||
1368 copy_from_user(value, values + cp * value_size, value_size))
1369 break;
1370
1371 err = bpf_map_update_value(map, f, key, value,
1372 attr->batch.elem_flags);
1373
1374 if (err)
1375 break;
1376 }
1377
1378 if (copy_to_user(&uattr->batch.count, &cp, sizeof(cp)))
1379 err = -EFAULT;
1380
1381 kfree(value);
1382 kfree(key);
1383 return err;
1384}
1385
1386#define MAP_LOOKUP_RETRIES 3
1387
1388int generic_map_lookup_batch(struct bpf_map *map,
1389 const union bpf_attr *attr,
1390 union bpf_attr __user *uattr)
1391{
1392 void __user *uobatch = u64_to_user_ptr(attr->batch.out_batch);
1393 void __user *ubatch = u64_to_user_ptr(attr->batch.in_batch);
1394 void __user *values = u64_to_user_ptr(attr->batch.values);
1395 void __user *keys = u64_to_user_ptr(attr->batch.keys);
1396 void *buf, *buf_prevkey, *prev_key, *key, *value;
1397 int err, retry = MAP_LOOKUP_RETRIES;
1398 u32 value_size, cp, max_count;
1399
1400 if (attr->batch.elem_flags & ~BPF_F_LOCK)
1401 return -EINVAL;
1402
1403 if ((attr->batch.elem_flags & BPF_F_LOCK) &&
1404 !map_value_has_spin_lock(map))
1405 return -EINVAL;
1406
1407 value_size = bpf_map_value_size(map);
1408
1409 max_count = attr->batch.count;
1410 if (!max_count)
1411 return 0;
1412
1413 if (put_user(0, &uattr->batch.count))
1414 return -EFAULT;
1415
1416 buf_prevkey = kmalloc(map->key_size, GFP_USER | __GFP_NOWARN);
1417 if (!buf_prevkey)
1418 return -ENOMEM;
1419
1420 buf = kmalloc(map->key_size + value_size, GFP_USER | __GFP_NOWARN);
1421 if (!buf) {
1422 kfree(buf_prevkey);
1423 return -ENOMEM;
1424 }
1425
1426 err = -EFAULT;
1427 prev_key = NULL;
1428 if (ubatch && copy_from_user(buf_prevkey, ubatch, map->key_size))
1429 goto free_buf;
1430 key = buf;
1431 value = key + map->key_size;
1432 if (ubatch)
1433 prev_key = buf_prevkey;
1434
1435 for (cp = 0; cp < max_count;) {
1436 rcu_read_lock();
1437 err = map->ops->map_get_next_key(map, prev_key, key);
1438 rcu_read_unlock();
1439 if (err)
1440 break;
1441 err = bpf_map_copy_value(map, key, value,
1442 attr->batch.elem_flags);
1443
1444 if (err == -ENOENT) {
1445 if (retry) {
1446 retry--;
1447 continue;
1448 }
1449 err = -EINTR;
1450 break;
1451 }
1452
1453 if (err)
1454 goto free_buf;
1455
1456 if (copy_to_user(keys + cp * map->key_size, key,
1457 map->key_size)) {
1458 err = -EFAULT;
1459 goto free_buf;
1460 }
1461 if (copy_to_user(values + cp * value_size, value, value_size)) {
1462 err = -EFAULT;
1463 goto free_buf;
1464 }
1465
1466 if (!prev_key)
1467 prev_key = buf_prevkey;
1468
1469 swap(prev_key, key);
1470 retry = MAP_LOOKUP_RETRIES;
1471 cp++;
1472 }
1473
1474 if (err == -EFAULT)
1475 goto free_buf;
1476
1477 if ((copy_to_user(&uattr->batch.count, &cp, sizeof(cp)) ||
1478 (cp && copy_to_user(uobatch, prev_key, map->key_size))))
1479 err = -EFAULT;
1480
1481free_buf:
1482 kfree(buf_prevkey);
1483 kfree(buf);
1484 return err;
1485}
1486
1487#define BPF_MAP_LOOKUP_AND_DELETE_ELEM_LAST_FIELD flags
1488
1489static int map_lookup_and_delete_elem(union bpf_attr *attr)
1490{
1491 void __user *ukey = u64_to_user_ptr(attr->key);
1492 void __user *uvalue = u64_to_user_ptr(attr->value);
1493 int ufd = attr->map_fd;
1494 struct bpf_map *map;
1495 void *key, *value;
1496 u32 value_size;
1497 struct fd f;
1498 int err;
1499
1500 if (CHECK_ATTR(BPF_MAP_LOOKUP_AND_DELETE_ELEM))
1501 return -EINVAL;
1502
1503 if (attr->flags & ~BPF_F_LOCK)
1504 return -EINVAL;
1505
1506 f = fdget(ufd);
1507 map = __bpf_map_get(f);
1508 if (IS_ERR(map))
1509 return PTR_ERR(map);
1510 if (!(map_get_sys_perms(map, f) & FMODE_CAN_READ) ||
1511 !(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
1512 err = -EPERM;
1513 goto err_put;
1514 }
1515
1516 if (attr->flags &&
1517 (map->map_type == BPF_MAP_TYPE_QUEUE ||
1518 map->map_type == BPF_MAP_TYPE_STACK)) {
1519 err = -EINVAL;
1520 goto err_put;
1521 }
1522
1523 if ((attr->flags & BPF_F_LOCK) &&
1524 !map_value_has_spin_lock(map)) {
1525 err = -EINVAL;
1526 goto err_put;
1527 }
1528
1529 key = __bpf_copy_key(ukey, map->key_size);
1530 if (IS_ERR(key)) {
1531 err = PTR_ERR(key);
1532 goto err_put;
1533 }
1534
1535 value_size = bpf_map_value_size(map);
1536
1537 err = -ENOMEM;
1538 value = kmalloc(value_size, GFP_USER | __GFP_NOWARN);
1539 if (!value)
1540 goto free_key;
1541
1542 err = -ENOTSUPP;
1543 if (map->map_type == BPF_MAP_TYPE_QUEUE ||
1544 map->map_type == BPF_MAP_TYPE_STACK) {
1545 err = map->ops->map_pop_elem(map, value);
1546 } else if (map->map_type == BPF_MAP_TYPE_HASH ||
1547 map->map_type == BPF_MAP_TYPE_PERCPU_HASH ||
1548 map->map_type == BPF_MAP_TYPE_LRU_HASH ||
1549 map->map_type == BPF_MAP_TYPE_LRU_PERCPU_HASH) {
1550 if (!bpf_map_is_dev_bound(map)) {
1551 bpf_disable_instrumentation();
1552 rcu_read_lock();
1553 err = map->ops->map_lookup_and_delete_elem(map, key, value, attr->flags);
1554 rcu_read_unlock();
1555 bpf_enable_instrumentation();
1556 }
1557 }
1558
1559 if (err)
1560 goto free_value;
1561
1562 if (copy_to_user(uvalue, value, value_size) != 0) {
1563 err = -EFAULT;
1564 goto free_value;
1565 }
1566
1567 err = 0;
1568
1569free_value:
1570 kfree(value);
1571free_key:
1572 kfree(key);
1573err_put:
1574 fdput(f);
1575 return err;
1576}
1577
1578#define BPF_MAP_FREEZE_LAST_FIELD map_fd
1579
1580static int map_freeze(const union bpf_attr *attr)
1581{
1582 int err = 0, ufd = attr->map_fd;
1583 struct bpf_map *map;
1584 struct fd f;
1585
1586 if (CHECK_ATTR(BPF_MAP_FREEZE))
1587 return -EINVAL;
1588
1589 f = fdget(ufd);
1590 map = __bpf_map_get(f);
1591 if (IS_ERR(map))
1592 return PTR_ERR(map);
1593
1594 if (map->map_type == BPF_MAP_TYPE_STRUCT_OPS) {
1595 fdput(f);
1596 return -ENOTSUPP;
1597 }
1598
1599 mutex_lock(&map->freeze_mutex);
1600
1601 if (map->writecnt) {
1602 err = -EBUSY;
1603 goto err_put;
1604 }
1605 if (READ_ONCE(map->frozen)) {
1606 err = -EBUSY;
1607 goto err_put;
1608 }
1609 if (!bpf_capable()) {
1610 err = -EPERM;
1611 goto err_put;
1612 }
1613
1614 WRITE_ONCE(map->frozen, true);
1615err_put:
1616 mutex_unlock(&map->freeze_mutex);
1617 fdput(f);
1618 return err;
1619}
1620
1621static const struct bpf_prog_ops * const bpf_prog_types[] = {
1622#define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type) \
1623 [_id] = & _name ## _prog_ops,
1624#define BPF_MAP_TYPE(_id, _ops)
1625#define BPF_LINK_TYPE(_id, _name)
1626#include <linux/bpf_types.h>
1627#undef BPF_PROG_TYPE
1628#undef BPF_MAP_TYPE
1629#undef BPF_LINK_TYPE
1630};
1631
1632static int find_prog_type(enum bpf_prog_type type, struct bpf_prog *prog)
1633{
1634 const struct bpf_prog_ops *ops;
1635
1636 if (type >= ARRAY_SIZE(bpf_prog_types))
1637 return -EINVAL;
1638 type = array_index_nospec(type, ARRAY_SIZE(bpf_prog_types));
1639 ops = bpf_prog_types[type];
1640 if (!ops)
1641 return -EINVAL;
1642
1643 if (!bpf_prog_is_dev_bound(prog->aux))
1644 prog->aux->ops = ops;
1645 else
1646 prog->aux->ops = &bpf_offload_prog_ops;
1647 prog->type = type;
1648 return 0;
1649}
1650
1651enum bpf_audit {
1652 BPF_AUDIT_LOAD,
1653 BPF_AUDIT_UNLOAD,
1654 BPF_AUDIT_MAX,
1655};
1656
1657static const char * const bpf_audit_str[BPF_AUDIT_MAX] = {
1658 [BPF_AUDIT_LOAD] = "LOAD",
1659 [BPF_AUDIT_UNLOAD] = "UNLOAD",
1660};
1661
1662static void bpf_audit_prog(const struct bpf_prog *prog, unsigned int op)
1663{
1664 struct audit_context *ctx = NULL;
1665 struct audit_buffer *ab;
1666
1667 if (WARN_ON_ONCE(op >= BPF_AUDIT_MAX))
1668 return;
1669 if (audit_enabled == AUDIT_OFF)
1670 return;
1671 if (op == BPF_AUDIT_LOAD)
1672 ctx = audit_context();
1673 ab = audit_log_start(ctx, GFP_ATOMIC, AUDIT_BPF);
1674 if (unlikely(!ab))
1675 return;
1676 audit_log_format(ab, "prog-id=%u op=%s",
1677 prog->aux->id, bpf_audit_str[op]);
1678 audit_log_end(ab);
1679}
1680
1681static int bpf_prog_alloc_id(struct bpf_prog *prog)
1682{
1683 int id;
1684
1685 idr_preload(GFP_KERNEL);
1686 spin_lock_bh(&prog_idr_lock);
1687 id = idr_alloc_cyclic(&prog_idr, prog, 1, INT_MAX, GFP_ATOMIC);
1688 if (id > 0)
1689 prog->aux->id = id;
1690 spin_unlock_bh(&prog_idr_lock);
1691 idr_preload_end();
1692
1693 /* id is in [1, INT_MAX) */
1694 if (WARN_ON_ONCE(!id))
1695 return -ENOSPC;
1696
1697 return id > 0 ? 0 : id;
1698}
1699
1700void bpf_prog_free_id(struct bpf_prog *prog, bool do_idr_lock)
1701{
1702 /* cBPF to eBPF migrations are currently not in the idr store.
1703 * Offloaded programs are removed from the store when their device
1704 * disappears - even if someone grabs an fd to them they are unusable,
1705 * simply waiting for refcnt to drop to be freed.
1706 */
1707 if (!prog->aux->id)
1708 return;
1709
1710 if (do_idr_lock)
1711 spin_lock_bh(&prog_idr_lock);
1712 else
1713 __acquire(&prog_idr_lock);
1714
1715 idr_remove(&prog_idr, prog->aux->id);
1716 prog->aux->id = 0;
1717
1718 if (do_idr_lock)
1719 spin_unlock_bh(&prog_idr_lock);
1720 else
1721 __release(&prog_idr_lock);
1722}
1723
1724static void __bpf_prog_put_rcu(struct rcu_head *rcu)
1725{
1726 struct bpf_prog_aux *aux = container_of(rcu, struct bpf_prog_aux, rcu);
1727
1728 kvfree(aux->func_info);
1729 kfree(aux->func_info_aux);
1730 free_uid(aux->user);
1731 security_bpf_prog_free(aux);
1732 bpf_prog_free(aux->prog);
1733}
1734
1735static void __bpf_prog_put_noref(struct bpf_prog *prog, bool deferred)
1736{
1737 bpf_prog_kallsyms_del_all(prog);
1738 btf_put(prog->aux->btf);
1739 kvfree(prog->aux->jited_linfo);
1740 kvfree(prog->aux->linfo);
1741 kfree(prog->aux->kfunc_tab);
1742 if (prog->aux->attach_btf)
1743 btf_put(prog->aux->attach_btf);
1744
1745 if (deferred) {
1746 if (prog->aux->sleepable)
1747 call_rcu_tasks_trace(&prog->aux->rcu, __bpf_prog_put_rcu);
1748 else
1749 call_rcu(&prog->aux->rcu, __bpf_prog_put_rcu);
1750 } else {
1751 __bpf_prog_put_rcu(&prog->aux->rcu);
1752 }
1753}
1754
1755static void __bpf_prog_put(struct bpf_prog *prog, bool do_idr_lock)
1756{
1757 if (atomic64_dec_and_test(&prog->aux->refcnt)) {
1758 perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_UNLOAD, 0);
1759 bpf_audit_prog(prog, BPF_AUDIT_UNLOAD);
1760 /* bpf_prog_free_id() must be called first */
1761 bpf_prog_free_id(prog, do_idr_lock);
1762 __bpf_prog_put_noref(prog, true);
1763 }
1764}
1765
1766void bpf_prog_put(struct bpf_prog *prog)
1767{
1768 __bpf_prog_put(prog, true);
1769}
1770EXPORT_SYMBOL_GPL(bpf_prog_put);
1771
1772static int bpf_prog_release(struct inode *inode, struct file *filp)
1773{
1774 struct bpf_prog *prog = filp->private_data;
1775
1776 bpf_prog_put(prog);
1777 return 0;
1778}
1779
1780static void bpf_prog_get_stats(const struct bpf_prog *prog,
1781 struct bpf_prog_stats *stats)
1782{
1783 u64 nsecs = 0, cnt = 0, misses = 0;
1784 int cpu;
1785
1786 for_each_possible_cpu(cpu) {
1787 const struct bpf_prog_stats *st;
1788 unsigned int start;
1789 u64 tnsecs, tcnt, tmisses;
1790
1791 st = per_cpu_ptr(prog->stats, cpu);
1792 do {
1793 start = u64_stats_fetch_begin_irq(&st->syncp);
1794 tnsecs = st->nsecs;
1795 tcnt = st->cnt;
1796 tmisses = st->misses;
1797 } while (u64_stats_fetch_retry_irq(&st->syncp, start));
1798 nsecs += tnsecs;
1799 cnt += tcnt;
1800 misses += tmisses;
1801 }
1802 stats->nsecs = nsecs;
1803 stats->cnt = cnt;
1804 stats->misses = misses;
1805}
1806
1807#ifdef CONFIG_PROC_FS
1808static void bpf_prog_show_fdinfo(struct seq_file *m, struct file *filp)
1809{
1810 const struct bpf_prog *prog = filp->private_data;
1811 char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
1812 struct bpf_prog_stats stats;
1813
1814 bpf_prog_get_stats(prog, &stats);
1815 bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
1816 seq_printf(m,
1817 "prog_type:\t%u\n"
1818 "prog_jited:\t%u\n"
1819 "prog_tag:\t%s\n"
1820 "memlock:\t%llu\n"
1821 "prog_id:\t%u\n"
1822 "run_time_ns:\t%llu\n"
1823 "run_cnt:\t%llu\n"
1824 "recursion_misses:\t%llu\n",
1825 prog->type,
1826 prog->jited,
1827 prog_tag,
1828 prog->pages * 1ULL << PAGE_SHIFT,
1829 prog->aux->id,
1830 stats.nsecs,
1831 stats.cnt,
1832 stats.misses);
1833}
1834#endif
1835
1836const struct file_operations bpf_prog_fops = {
1837#ifdef CONFIG_PROC_FS
1838 .show_fdinfo = bpf_prog_show_fdinfo,
1839#endif
1840 .release = bpf_prog_release,
1841 .read = bpf_dummy_read,
1842 .write = bpf_dummy_write,
1843};
1844
1845int bpf_prog_new_fd(struct bpf_prog *prog)
1846{
1847 int ret;
1848
1849 ret = security_bpf_prog(prog);
1850 if (ret < 0)
1851 return ret;
1852
1853 return anon_inode_getfd("bpf-prog", &bpf_prog_fops, prog,
1854 O_RDWR | O_CLOEXEC);
1855}
1856
1857static struct bpf_prog *____bpf_prog_get(struct fd f)
1858{
1859 if (!f.file)
1860 return ERR_PTR(-EBADF);
1861 if (f.file->f_op != &bpf_prog_fops) {
1862 fdput(f);
1863 return ERR_PTR(-EINVAL);
1864 }
1865
1866 return f.file->private_data;
1867}
1868
1869void bpf_prog_add(struct bpf_prog *prog, int i)
1870{
1871 atomic64_add(i, &prog->aux->refcnt);
1872}
1873EXPORT_SYMBOL_GPL(bpf_prog_add);
1874
1875void bpf_prog_sub(struct bpf_prog *prog, int i)
1876{
1877 /* Only to be used for undoing previous bpf_prog_add() in some
1878 * error path. We still know that another entity in our call
1879 * path holds a reference to the program, thus atomic_sub() can
1880 * be safely used in such cases!
1881 */
1882 WARN_ON(atomic64_sub_return(i, &prog->aux->refcnt) == 0);
1883}
1884EXPORT_SYMBOL_GPL(bpf_prog_sub);
1885
1886void bpf_prog_inc(struct bpf_prog *prog)
1887{
1888 atomic64_inc(&prog->aux->refcnt);
1889}
1890EXPORT_SYMBOL_GPL(bpf_prog_inc);
1891
1892/* prog_idr_lock should have been held */
1893struct bpf_prog *bpf_prog_inc_not_zero(struct bpf_prog *prog)
1894{
1895 int refold;
1896
1897 refold = atomic64_fetch_add_unless(&prog->aux->refcnt, 1, 0);
1898
1899 if (!refold)
1900 return ERR_PTR(-ENOENT);
1901
1902 return prog;
1903}
1904EXPORT_SYMBOL_GPL(bpf_prog_inc_not_zero);
1905
1906bool bpf_prog_get_ok(struct bpf_prog *prog,
1907 enum bpf_prog_type *attach_type, bool attach_drv)
1908{
1909 /* not an attachment, just a refcount inc, always allow */
1910 if (!attach_type)
1911 return true;
1912
1913 if (prog->type != *attach_type)
1914 return false;
1915 if (bpf_prog_is_dev_bound(prog->aux) && !attach_drv)
1916 return false;
1917
1918 return true;
1919}
1920
1921static struct bpf_prog *__bpf_prog_get(u32 ufd, enum bpf_prog_type *attach_type,
1922 bool attach_drv)
1923{
1924 struct fd f = fdget(ufd);
1925 struct bpf_prog *prog;
1926
1927 prog = ____bpf_prog_get(f);
1928 if (IS_ERR(prog))
1929 return prog;
1930 if (!bpf_prog_get_ok(prog, attach_type, attach_drv)) {
1931 prog = ERR_PTR(-EINVAL);
1932 goto out;
1933 }
1934
1935 bpf_prog_inc(prog);
1936out:
1937 fdput(f);
1938 return prog;
1939}
1940
1941struct bpf_prog *bpf_prog_get(u32 ufd)
1942{
1943 return __bpf_prog_get(ufd, NULL, false);
1944}
1945
1946struct bpf_prog *bpf_prog_get_type_dev(u32 ufd, enum bpf_prog_type type,
1947 bool attach_drv)
1948{
1949 return __bpf_prog_get(ufd, &type, attach_drv);
1950}
1951EXPORT_SYMBOL_GPL(bpf_prog_get_type_dev);
1952
1953/* Initially all BPF programs could be loaded w/o specifying
1954 * expected_attach_type. Later for some of them specifying expected_attach_type
1955 * at load time became required so that program could be validated properly.
1956 * Programs of types that are allowed to be loaded both w/ and w/o (for
1957 * backward compatibility) expected_attach_type, should have the default attach
1958 * type assigned to expected_attach_type for the latter case, so that it can be
1959 * validated later at attach time.
1960 *
1961 * bpf_prog_load_fixup_attach_type() sets expected_attach_type in @attr if
1962 * prog type requires it but has some attach types that have to be backward
1963 * compatible.
1964 */
1965static void bpf_prog_load_fixup_attach_type(union bpf_attr *attr)
1966{
1967 switch (attr->prog_type) {
1968 case BPF_PROG_TYPE_CGROUP_SOCK:
1969 /* Unfortunately BPF_ATTACH_TYPE_UNSPEC enumeration doesn't
1970 * exist so checking for non-zero is the way to go here.
1971 */
1972 if (!attr->expected_attach_type)
1973 attr->expected_attach_type =
1974 BPF_CGROUP_INET_SOCK_CREATE;
1975 break;
1976 case BPF_PROG_TYPE_SK_REUSEPORT:
1977 if (!attr->expected_attach_type)
1978 attr->expected_attach_type =
1979 BPF_SK_REUSEPORT_SELECT;
1980 break;
1981 }
1982}
1983
1984static int
1985bpf_prog_load_check_attach(enum bpf_prog_type prog_type,
1986 enum bpf_attach_type expected_attach_type,
1987 struct btf *attach_btf, u32 btf_id,
1988 struct bpf_prog *dst_prog)
1989{
1990 if (btf_id) {
1991 if (btf_id > BTF_MAX_TYPE)
1992 return -EINVAL;
1993
1994 if (!attach_btf && !dst_prog)
1995 return -EINVAL;
1996
1997 switch (prog_type) {
1998 case BPF_PROG_TYPE_TRACING:
1999 case BPF_PROG_TYPE_LSM:
2000 case BPF_PROG_TYPE_STRUCT_OPS:
2001 case BPF_PROG_TYPE_EXT:
2002 break;
2003 default:
2004 return -EINVAL;
2005 }
2006 }
2007
2008 if (attach_btf && (!btf_id || dst_prog))
2009 return -EINVAL;
2010
2011 if (dst_prog && prog_type != BPF_PROG_TYPE_TRACING &&
2012 prog_type != BPF_PROG_TYPE_EXT)
2013 return -EINVAL;
2014
2015 switch (prog_type) {
2016 case BPF_PROG_TYPE_CGROUP_SOCK:
2017 switch (expected_attach_type) {
2018 case BPF_CGROUP_INET_SOCK_CREATE:
2019 case BPF_CGROUP_INET_SOCK_RELEASE:
2020 case BPF_CGROUP_INET4_POST_BIND:
2021 case BPF_CGROUP_INET6_POST_BIND:
2022 return 0;
2023 default:
2024 return -EINVAL;
2025 }
2026 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2027 switch (expected_attach_type) {
2028 case BPF_CGROUP_INET4_BIND:
2029 case BPF_CGROUP_INET6_BIND:
2030 case BPF_CGROUP_INET4_CONNECT:
2031 case BPF_CGROUP_INET6_CONNECT:
2032 case BPF_CGROUP_INET4_GETPEERNAME:
2033 case BPF_CGROUP_INET6_GETPEERNAME:
2034 case BPF_CGROUP_INET4_GETSOCKNAME:
2035 case BPF_CGROUP_INET6_GETSOCKNAME:
2036 case BPF_CGROUP_UDP4_SENDMSG:
2037 case BPF_CGROUP_UDP6_SENDMSG:
2038 case BPF_CGROUP_UDP4_RECVMSG:
2039 case BPF_CGROUP_UDP6_RECVMSG:
2040 return 0;
2041 default:
2042 return -EINVAL;
2043 }
2044 case BPF_PROG_TYPE_CGROUP_SKB:
2045 switch (expected_attach_type) {
2046 case BPF_CGROUP_INET_INGRESS:
2047 case BPF_CGROUP_INET_EGRESS:
2048 return 0;
2049 default:
2050 return -EINVAL;
2051 }
2052 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2053 switch (expected_attach_type) {
2054 case BPF_CGROUP_SETSOCKOPT:
2055 case BPF_CGROUP_GETSOCKOPT:
2056 return 0;
2057 default:
2058 return -EINVAL;
2059 }
2060 case BPF_PROG_TYPE_SK_LOOKUP:
2061 if (expected_attach_type == BPF_SK_LOOKUP)
2062 return 0;
2063 return -EINVAL;
2064 case BPF_PROG_TYPE_SK_REUSEPORT:
2065 switch (expected_attach_type) {
2066 case BPF_SK_REUSEPORT_SELECT:
2067 case BPF_SK_REUSEPORT_SELECT_OR_MIGRATE:
2068 return 0;
2069 default:
2070 return -EINVAL;
2071 }
2072 case BPF_PROG_TYPE_SYSCALL:
2073 case BPF_PROG_TYPE_EXT:
2074 if (expected_attach_type)
2075 return -EINVAL;
2076 fallthrough;
2077 default:
2078 return 0;
2079 }
2080}
2081
2082static bool is_net_admin_prog_type(enum bpf_prog_type prog_type)
2083{
2084 switch (prog_type) {
2085 case BPF_PROG_TYPE_SCHED_CLS:
2086 case BPF_PROG_TYPE_SCHED_ACT:
2087 case BPF_PROG_TYPE_XDP:
2088 case BPF_PROG_TYPE_LWT_IN:
2089 case BPF_PROG_TYPE_LWT_OUT:
2090 case BPF_PROG_TYPE_LWT_XMIT:
2091 case BPF_PROG_TYPE_LWT_SEG6LOCAL:
2092 case BPF_PROG_TYPE_SK_SKB:
2093 case BPF_PROG_TYPE_SK_MSG:
2094 case BPF_PROG_TYPE_LIRC_MODE2:
2095 case BPF_PROG_TYPE_FLOW_DISSECTOR:
2096 case BPF_PROG_TYPE_CGROUP_DEVICE:
2097 case BPF_PROG_TYPE_CGROUP_SOCK:
2098 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2099 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2100 case BPF_PROG_TYPE_CGROUP_SYSCTL:
2101 case BPF_PROG_TYPE_SOCK_OPS:
2102 case BPF_PROG_TYPE_EXT: /* extends any prog */
2103 return true;
2104 case BPF_PROG_TYPE_CGROUP_SKB:
2105 /* always unpriv */
2106 case BPF_PROG_TYPE_SK_REUSEPORT:
2107 /* equivalent to SOCKET_FILTER. need CAP_BPF only */
2108 default:
2109 return false;
2110 }
2111}
2112
2113static bool is_perfmon_prog_type(enum bpf_prog_type prog_type)
2114{
2115 switch (prog_type) {
2116 case BPF_PROG_TYPE_KPROBE:
2117 case BPF_PROG_TYPE_TRACEPOINT:
2118 case BPF_PROG_TYPE_PERF_EVENT:
2119 case BPF_PROG_TYPE_RAW_TRACEPOINT:
2120 case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
2121 case BPF_PROG_TYPE_TRACING:
2122 case BPF_PROG_TYPE_LSM:
2123 case BPF_PROG_TYPE_STRUCT_OPS: /* has access to struct sock */
2124 case BPF_PROG_TYPE_EXT: /* extends any prog */
2125 return true;
2126 default:
2127 return false;
2128 }
2129}
2130
2131/* last field in 'union bpf_attr' used by this command */
2132#define BPF_PROG_LOAD_LAST_FIELD fd_array
2133
2134static int bpf_prog_load(union bpf_attr *attr, bpfptr_t uattr)
2135{
2136 enum bpf_prog_type type = attr->prog_type;
2137 struct bpf_prog *prog, *dst_prog = NULL;
2138 struct btf *attach_btf = NULL;
2139 int err;
2140 char license[128];
2141 bool is_gpl;
2142
2143 if (CHECK_ATTR(BPF_PROG_LOAD))
2144 return -EINVAL;
2145
2146 if (attr->prog_flags & ~(BPF_F_STRICT_ALIGNMENT |
2147 BPF_F_ANY_ALIGNMENT |
2148 BPF_F_TEST_STATE_FREQ |
2149 BPF_F_SLEEPABLE |
2150 BPF_F_TEST_RND_HI32))
2151 return -EINVAL;
2152
2153 if (!IS_ENABLED(CONFIG_HAVE_EFFICIENT_UNALIGNED_ACCESS) &&
2154 (attr->prog_flags & BPF_F_ANY_ALIGNMENT) &&
2155 !bpf_capable())
2156 return -EPERM;
2157
2158 /* copy eBPF program license from user space */
2159 if (strncpy_from_bpfptr(license,
2160 make_bpfptr(attr->license, uattr.is_kernel),
2161 sizeof(license) - 1) < 0)
2162 return -EFAULT;
2163 license[sizeof(license) - 1] = 0;
2164
2165 /* eBPF programs must be GPL compatible to use GPL-ed functions */
2166 is_gpl = license_is_gpl_compatible(license);
2167
2168 if (attr->insn_cnt == 0 ||
2169 attr->insn_cnt > (bpf_capable() ? BPF_COMPLEXITY_LIMIT_INSNS : BPF_MAXINSNS))
2170 return -E2BIG;
2171 if (type != BPF_PROG_TYPE_SOCKET_FILTER &&
2172 type != BPF_PROG_TYPE_CGROUP_SKB &&
2173 !bpf_capable())
2174 return -EPERM;
2175
2176 if (is_net_admin_prog_type(type) && !capable(CAP_NET_ADMIN) && !capable(CAP_SYS_ADMIN))
2177 return -EPERM;
2178 if (is_perfmon_prog_type(type) && !perfmon_capable())
2179 return -EPERM;
2180
2181 /* attach_prog_fd/attach_btf_obj_fd can specify fd of either bpf_prog
2182 * or btf, we need to check which one it is
2183 */
2184 if (attr->attach_prog_fd) {
2185 dst_prog = bpf_prog_get(attr->attach_prog_fd);
2186 if (IS_ERR(dst_prog)) {
2187 dst_prog = NULL;
2188 attach_btf = btf_get_by_fd(attr->attach_btf_obj_fd);
2189 if (IS_ERR(attach_btf))
2190 return -EINVAL;
2191 if (!btf_is_kernel(attach_btf)) {
2192 /* attaching through specifying bpf_prog's BTF
2193 * objects directly might be supported eventually
2194 */
2195 btf_put(attach_btf);
2196 return -ENOTSUPP;
2197 }
2198 }
2199 } else if (attr->attach_btf_id) {
2200 /* fall back to vmlinux BTF, if BTF type ID is specified */
2201 attach_btf = bpf_get_btf_vmlinux();
2202 if (IS_ERR(attach_btf))
2203 return PTR_ERR(attach_btf);
2204 if (!attach_btf)
2205 return -EINVAL;
2206 btf_get(attach_btf);
2207 }
2208
2209 bpf_prog_load_fixup_attach_type(attr);
2210 if (bpf_prog_load_check_attach(type, attr->expected_attach_type,
2211 attach_btf, attr->attach_btf_id,
2212 dst_prog)) {
2213 if (dst_prog)
2214 bpf_prog_put(dst_prog);
2215 if (attach_btf)
2216 btf_put(attach_btf);
2217 return -EINVAL;
2218 }
2219
2220 /* plain bpf_prog allocation */
2221 prog = bpf_prog_alloc(bpf_prog_size(attr->insn_cnt), GFP_USER);
2222 if (!prog) {
2223 if (dst_prog)
2224 bpf_prog_put(dst_prog);
2225 if (attach_btf)
2226 btf_put(attach_btf);
2227 return -ENOMEM;
2228 }
2229
2230 prog->expected_attach_type = attr->expected_attach_type;
2231 prog->aux->attach_btf = attach_btf;
2232 prog->aux->attach_btf_id = attr->attach_btf_id;
2233 prog->aux->dst_prog = dst_prog;
2234 prog->aux->offload_requested = !!attr->prog_ifindex;
2235 prog->aux->sleepable = attr->prog_flags & BPF_F_SLEEPABLE;
2236
2237 err = security_bpf_prog_alloc(prog->aux);
2238 if (err)
2239 goto free_prog;
2240
2241 prog->aux->user = get_current_user();
2242 prog->len = attr->insn_cnt;
2243
2244 err = -EFAULT;
2245 if (copy_from_bpfptr(prog->insns,
2246 make_bpfptr(attr->insns, uattr.is_kernel),
2247 bpf_prog_insn_size(prog)) != 0)
2248 goto free_prog_sec;
2249
2250 prog->orig_prog = NULL;
2251 prog->jited = 0;
2252
2253 atomic64_set(&prog->aux->refcnt, 1);
2254 prog->gpl_compatible = is_gpl ? 1 : 0;
2255
2256 if (bpf_prog_is_dev_bound(prog->aux)) {
2257 err = bpf_prog_offload_init(prog, attr);
2258 if (err)
2259 goto free_prog_sec;
2260 }
2261
2262 /* find program type: socket_filter vs tracing_filter */
2263 err = find_prog_type(type, prog);
2264 if (err < 0)
2265 goto free_prog_sec;
2266
2267 prog->aux->load_time = ktime_get_boottime_ns();
2268 err = bpf_obj_name_cpy(prog->aux->name, attr->prog_name,
2269 sizeof(attr->prog_name));
2270 if (err < 0)
2271 goto free_prog_sec;
2272
2273 /* run eBPF verifier */
2274 err = bpf_check(&prog, attr, uattr);
2275 if (err < 0)
2276 goto free_used_maps;
2277
2278 prog = bpf_prog_select_runtime(prog, &err);
2279 if (err < 0)
2280 goto free_used_maps;
2281
2282 err = bpf_prog_alloc_id(prog);
2283 if (err)
2284 goto free_used_maps;
2285
2286 /* Upon success of bpf_prog_alloc_id(), the BPF prog is
2287 * effectively publicly exposed. However, retrieving via
2288 * bpf_prog_get_fd_by_id() will take another reference,
2289 * therefore it cannot be gone underneath us.
2290 *
2291 * Only for the time /after/ successful bpf_prog_new_fd()
2292 * and before returning to userspace, we might just hold
2293 * one reference and any parallel close on that fd could
2294 * rip everything out. Hence, below notifications must
2295 * happen before bpf_prog_new_fd().
2296 *
2297 * Also, any failure handling from this point onwards must
2298 * be using bpf_prog_put() given the program is exposed.
2299 */
2300 bpf_prog_kallsyms_add(prog);
2301 perf_event_bpf_event(prog, PERF_BPF_EVENT_PROG_LOAD, 0);
2302 bpf_audit_prog(prog, BPF_AUDIT_LOAD);
2303
2304 err = bpf_prog_new_fd(prog);
2305 if (err < 0)
2306 bpf_prog_put(prog);
2307 return err;
2308
2309free_used_maps:
2310 /* In case we have subprogs, we need to wait for a grace
2311 * period before we can tear down JIT memory since symbols
2312 * are already exposed under kallsyms.
2313 */
2314 __bpf_prog_put_noref(prog, prog->aux->func_cnt);
2315 return err;
2316free_prog_sec:
2317 free_uid(prog->aux->user);
2318 security_bpf_prog_free(prog->aux);
2319free_prog:
2320 if (prog->aux->attach_btf)
2321 btf_put(prog->aux->attach_btf);
2322 bpf_prog_free(prog);
2323 return err;
2324}
2325
2326#define BPF_OBJ_LAST_FIELD file_flags
2327
2328static int bpf_obj_pin(const union bpf_attr *attr)
2329{
2330 if (CHECK_ATTR(BPF_OBJ) || attr->file_flags != 0)
2331 return -EINVAL;
2332
2333 return bpf_obj_pin_user(attr->bpf_fd, u64_to_user_ptr(attr->pathname));
2334}
2335
2336static int bpf_obj_get(const union bpf_attr *attr)
2337{
2338 if (CHECK_ATTR(BPF_OBJ) || attr->bpf_fd != 0 ||
2339 attr->file_flags & ~BPF_OBJ_FLAG_MASK)
2340 return -EINVAL;
2341
2342 return bpf_obj_get_user(u64_to_user_ptr(attr->pathname),
2343 attr->file_flags);
2344}
2345
2346void bpf_link_init(struct bpf_link *link, enum bpf_link_type type,
2347 const struct bpf_link_ops *ops, struct bpf_prog *prog)
2348{
2349 atomic64_set(&link->refcnt, 1);
2350 link->type = type;
2351 link->id = 0;
2352 link->ops = ops;
2353 link->prog = prog;
2354}
2355
2356static void bpf_link_free_id(int id)
2357{
2358 if (!id)
2359 return;
2360
2361 spin_lock_bh(&link_idr_lock);
2362 idr_remove(&link_idr, id);
2363 spin_unlock_bh(&link_idr_lock);
2364}
2365
2366/* Clean up bpf_link and corresponding anon_inode file and FD. After
2367 * anon_inode is created, bpf_link can't be just kfree()'d due to deferred
2368 * anon_inode's release() call. This helper marksbpf_link as
2369 * defunct, releases anon_inode file and puts reserved FD. bpf_prog's refcnt
2370 * is not decremented, it's the responsibility of a calling code that failed
2371 * to complete bpf_link initialization.
2372 */
2373void bpf_link_cleanup(struct bpf_link_primer *primer)
2374{
2375 primer->link->prog = NULL;
2376 bpf_link_free_id(primer->id);
2377 fput(primer->file);
2378 put_unused_fd(primer->fd);
2379}
2380
2381void bpf_link_inc(struct bpf_link *link)
2382{
2383 atomic64_inc(&link->refcnt);
2384}
2385
2386/* bpf_link_free is guaranteed to be called from process context */
2387static void bpf_link_free(struct bpf_link *link)
2388{
2389 bpf_link_free_id(link->id);
2390 if (link->prog) {
2391 /* detach BPF program, clean up used resources */
2392 link->ops->release(link);
2393 bpf_prog_put(link->prog);
2394 }
2395 /* free bpf_link and its containing memory */
2396 link->ops->dealloc(link);
2397}
2398
2399static void bpf_link_put_deferred(struct work_struct *work)
2400{
2401 struct bpf_link *link = container_of(work, struct bpf_link, work);
2402
2403 bpf_link_free(link);
2404}
2405
2406/* bpf_link_put can be called from atomic context, but ensures that resources
2407 * are freed from process context
2408 */
2409void bpf_link_put(struct bpf_link *link)
2410{
2411 if (!atomic64_dec_and_test(&link->refcnt))
2412 return;
2413
2414 if (in_atomic()) {
2415 INIT_WORK(&link->work, bpf_link_put_deferred);
2416 schedule_work(&link->work);
2417 } else {
2418 bpf_link_free(link);
2419 }
2420}
2421
2422static int bpf_link_release(struct inode *inode, struct file *filp)
2423{
2424 struct bpf_link *link = filp->private_data;
2425
2426 bpf_link_put(link);
2427 return 0;
2428}
2429
2430#ifdef CONFIG_PROC_FS
2431#define BPF_PROG_TYPE(_id, _name, prog_ctx_type, kern_ctx_type)
2432#define BPF_MAP_TYPE(_id, _ops)
2433#define BPF_LINK_TYPE(_id, _name) [_id] = #_name,
2434static const char *bpf_link_type_strs[] = {
2435 [BPF_LINK_TYPE_UNSPEC] = "<invalid>",
2436#include <linux/bpf_types.h>
2437};
2438#undef BPF_PROG_TYPE
2439#undef BPF_MAP_TYPE
2440#undef BPF_LINK_TYPE
2441
2442static void bpf_link_show_fdinfo(struct seq_file *m, struct file *filp)
2443{
2444 const struct bpf_link *link = filp->private_data;
2445 const struct bpf_prog *prog = link->prog;
2446 char prog_tag[sizeof(prog->tag) * 2 + 1] = { };
2447
2448 bin2hex(prog_tag, prog->tag, sizeof(prog->tag));
2449 seq_printf(m,
2450 "link_type:\t%s\n"
2451 "link_id:\t%u\n"
2452 "prog_tag:\t%s\n"
2453 "prog_id:\t%u\n",
2454 bpf_link_type_strs[link->type],
2455 link->id,
2456 prog_tag,
2457 prog->aux->id);
2458 if (link->ops->show_fdinfo)
2459 link->ops->show_fdinfo(link, m);
2460}
2461#endif
2462
2463static const struct file_operations bpf_link_fops = {
2464#ifdef CONFIG_PROC_FS
2465 .show_fdinfo = bpf_link_show_fdinfo,
2466#endif
2467 .release = bpf_link_release,
2468 .read = bpf_dummy_read,
2469 .write = bpf_dummy_write,
2470};
2471
2472static int bpf_link_alloc_id(struct bpf_link *link)
2473{
2474 int id;
2475
2476 idr_preload(GFP_KERNEL);
2477 spin_lock_bh(&link_idr_lock);
2478 id = idr_alloc_cyclic(&link_idr, link, 1, INT_MAX, GFP_ATOMIC);
2479 spin_unlock_bh(&link_idr_lock);
2480 idr_preload_end();
2481
2482 return id;
2483}
2484
2485/* Prepare bpf_link to be exposed to user-space by allocating anon_inode file,
2486 * reserving unused FD and allocating ID from link_idr. This is to be paired
2487 * with bpf_link_settle() to install FD and ID and expose bpf_link to
2488 * user-space, if bpf_link is successfully attached. If not, bpf_link and
2489 * pre-allocated resources are to be freed with bpf_cleanup() call. All the
2490 * transient state is passed around in struct bpf_link_primer.
2491 * This is preferred way to create and initialize bpf_link, especially when
2492 * there are complicated and expensive operations inbetween creating bpf_link
2493 * itself and attaching it to BPF hook. By using bpf_link_prime() and
2494 * bpf_link_settle() kernel code using bpf_link doesn't have to perform
2495 * expensive (and potentially failing) roll back operations in a rare case
2496 * that file, FD, or ID can't be allocated.
2497 */
2498int bpf_link_prime(struct bpf_link *link, struct bpf_link_primer *primer)
2499{
2500 struct file *file;
2501 int fd, id;
2502
2503 fd = get_unused_fd_flags(O_CLOEXEC);
2504 if (fd < 0)
2505 return fd;
2506
2507
2508 id = bpf_link_alloc_id(link);
2509 if (id < 0) {
2510 put_unused_fd(fd);
2511 return id;
2512 }
2513
2514 file = anon_inode_getfile("bpf_link", &bpf_link_fops, link, O_CLOEXEC);
2515 if (IS_ERR(file)) {
2516 bpf_link_free_id(id);
2517 put_unused_fd(fd);
2518 return PTR_ERR(file);
2519 }
2520
2521 primer->link = link;
2522 primer->file = file;
2523 primer->fd = fd;
2524 primer->id = id;
2525 return 0;
2526}
2527
2528int bpf_link_settle(struct bpf_link_primer *primer)
2529{
2530 /* make bpf_link fetchable by ID */
2531 spin_lock_bh(&link_idr_lock);
2532 primer->link->id = primer->id;
2533 spin_unlock_bh(&link_idr_lock);
2534 /* make bpf_link fetchable by FD */
2535 fd_install(primer->fd, primer->file);
2536 /* pass through installed FD */
2537 return primer->fd;
2538}
2539
2540int bpf_link_new_fd(struct bpf_link *link)
2541{
2542 return anon_inode_getfd("bpf-link", &bpf_link_fops, link, O_CLOEXEC);
2543}
2544
2545struct bpf_link *bpf_link_get_from_fd(u32 ufd)
2546{
2547 struct fd f = fdget(ufd);
2548 struct bpf_link *link;
2549
2550 if (!f.file)
2551 return ERR_PTR(-EBADF);
2552 if (f.file->f_op != &bpf_link_fops) {
2553 fdput(f);
2554 return ERR_PTR(-EINVAL);
2555 }
2556
2557 link = f.file->private_data;
2558 bpf_link_inc(link);
2559 fdput(f);
2560
2561 return link;
2562}
2563
2564struct bpf_tracing_link {
2565 struct bpf_link link;
2566 enum bpf_attach_type attach_type;
2567 struct bpf_trampoline *trampoline;
2568 struct bpf_prog *tgt_prog;
2569};
2570
2571static void bpf_tracing_link_release(struct bpf_link *link)
2572{
2573 struct bpf_tracing_link *tr_link =
2574 container_of(link, struct bpf_tracing_link, link);
2575
2576 WARN_ON_ONCE(bpf_trampoline_unlink_prog(link->prog,
2577 tr_link->trampoline));
2578
2579 bpf_trampoline_put(tr_link->trampoline);
2580
2581 /* tgt_prog is NULL if target is a kernel function */
2582 if (tr_link->tgt_prog)
2583 bpf_prog_put(tr_link->tgt_prog);
2584}
2585
2586static void bpf_tracing_link_dealloc(struct bpf_link *link)
2587{
2588 struct bpf_tracing_link *tr_link =
2589 container_of(link, struct bpf_tracing_link, link);
2590
2591 kfree(tr_link);
2592}
2593
2594static void bpf_tracing_link_show_fdinfo(const struct bpf_link *link,
2595 struct seq_file *seq)
2596{
2597 struct bpf_tracing_link *tr_link =
2598 container_of(link, struct bpf_tracing_link, link);
2599
2600 seq_printf(seq,
2601 "attach_type:\t%d\n",
2602 tr_link->attach_type);
2603}
2604
2605static int bpf_tracing_link_fill_link_info(const struct bpf_link *link,
2606 struct bpf_link_info *info)
2607{
2608 struct bpf_tracing_link *tr_link =
2609 container_of(link, struct bpf_tracing_link, link);
2610
2611 info->tracing.attach_type = tr_link->attach_type;
2612 bpf_trampoline_unpack_key(tr_link->trampoline->key,
2613 &info->tracing.target_obj_id,
2614 &info->tracing.target_btf_id);
2615
2616 return 0;
2617}
2618
2619static const struct bpf_link_ops bpf_tracing_link_lops = {
2620 .release = bpf_tracing_link_release,
2621 .dealloc = bpf_tracing_link_dealloc,
2622 .show_fdinfo = bpf_tracing_link_show_fdinfo,
2623 .fill_link_info = bpf_tracing_link_fill_link_info,
2624};
2625
2626static int bpf_tracing_prog_attach(struct bpf_prog *prog,
2627 int tgt_prog_fd,
2628 u32 btf_id)
2629{
2630 struct bpf_link_primer link_primer;
2631 struct bpf_prog *tgt_prog = NULL;
2632 struct bpf_trampoline *tr = NULL;
2633 struct bpf_tracing_link *link;
2634 u64 key = 0;
2635 int err;
2636
2637 switch (prog->type) {
2638 case BPF_PROG_TYPE_TRACING:
2639 if (prog->expected_attach_type != BPF_TRACE_FENTRY &&
2640 prog->expected_attach_type != BPF_TRACE_FEXIT &&
2641 prog->expected_attach_type != BPF_MODIFY_RETURN) {
2642 err = -EINVAL;
2643 goto out_put_prog;
2644 }
2645 break;
2646 case BPF_PROG_TYPE_EXT:
2647 if (prog->expected_attach_type != 0) {
2648 err = -EINVAL;
2649 goto out_put_prog;
2650 }
2651 break;
2652 case BPF_PROG_TYPE_LSM:
2653 if (prog->expected_attach_type != BPF_LSM_MAC) {
2654 err = -EINVAL;
2655 goto out_put_prog;
2656 }
2657 break;
2658 default:
2659 err = -EINVAL;
2660 goto out_put_prog;
2661 }
2662
2663 if (!!tgt_prog_fd != !!btf_id) {
2664 err = -EINVAL;
2665 goto out_put_prog;
2666 }
2667
2668 if (tgt_prog_fd) {
2669 /* For now we only allow new targets for BPF_PROG_TYPE_EXT */
2670 if (prog->type != BPF_PROG_TYPE_EXT) {
2671 err = -EINVAL;
2672 goto out_put_prog;
2673 }
2674
2675 tgt_prog = bpf_prog_get(tgt_prog_fd);
2676 if (IS_ERR(tgt_prog)) {
2677 err = PTR_ERR(tgt_prog);
2678 tgt_prog = NULL;
2679 goto out_put_prog;
2680 }
2681
2682 key = bpf_trampoline_compute_key(tgt_prog, NULL, btf_id);
2683 }
2684
2685 link = kzalloc(sizeof(*link), GFP_USER);
2686 if (!link) {
2687 err = -ENOMEM;
2688 goto out_put_prog;
2689 }
2690 bpf_link_init(&link->link, BPF_LINK_TYPE_TRACING,
2691 &bpf_tracing_link_lops, prog);
2692 link->attach_type = prog->expected_attach_type;
2693
2694 mutex_lock(&prog->aux->dst_mutex);
2695
2696 /* There are a few possible cases here:
2697 *
2698 * - if prog->aux->dst_trampoline is set, the program was just loaded
2699 * and not yet attached to anything, so we can use the values stored
2700 * in prog->aux
2701 *
2702 * - if prog->aux->dst_trampoline is NULL, the program has already been
2703 * attached to a target and its initial target was cleared (below)
2704 *
2705 * - if tgt_prog != NULL, the caller specified tgt_prog_fd +
2706 * target_btf_id using the link_create API.
2707 *
2708 * - if tgt_prog == NULL when this function was called using the old
2709 * raw_tracepoint_open API, and we need a target from prog->aux
2710 *
2711 * - if prog->aux->dst_trampoline and tgt_prog is NULL, the program
2712 * was detached and is going for re-attachment.
2713 */
2714 if (!prog->aux->dst_trampoline && !tgt_prog) {
2715 /*
2716 * Allow re-attach for TRACING and LSM programs. If it's
2717 * currently linked, bpf_trampoline_link_prog will fail.
2718 * EXT programs need to specify tgt_prog_fd, so they
2719 * re-attach in separate code path.
2720 */
2721 if (prog->type != BPF_PROG_TYPE_TRACING &&
2722 prog->type != BPF_PROG_TYPE_LSM) {
2723 err = -EINVAL;
2724 goto out_unlock;
2725 }
2726 btf_id = prog->aux->attach_btf_id;
2727 key = bpf_trampoline_compute_key(NULL, prog->aux->attach_btf, btf_id);
2728 }
2729
2730 if (!prog->aux->dst_trampoline ||
2731 (key && key != prog->aux->dst_trampoline->key)) {
2732 /* If there is no saved target, or the specified target is
2733 * different from the destination specified at load time, we
2734 * need a new trampoline and a check for compatibility
2735 */
2736 struct bpf_attach_target_info tgt_info = {};
2737
2738 err = bpf_check_attach_target(NULL, prog, tgt_prog, btf_id,
2739 &tgt_info);
2740 if (err)
2741 goto out_unlock;
2742
2743 tr = bpf_trampoline_get(key, &tgt_info);
2744 if (!tr) {
2745 err = -ENOMEM;
2746 goto out_unlock;
2747 }
2748 } else {
2749 /* The caller didn't specify a target, or the target was the
2750 * same as the destination supplied during program load. This
2751 * means we can reuse the trampoline and reference from program
2752 * load time, and there is no need to allocate a new one. This
2753 * can only happen once for any program, as the saved values in
2754 * prog->aux are cleared below.
2755 */
2756 tr = prog->aux->dst_trampoline;
2757 tgt_prog = prog->aux->dst_prog;
2758 }
2759
2760 err = bpf_link_prime(&link->link, &link_primer);
2761 if (err)
2762 goto out_unlock;
2763
2764 err = bpf_trampoline_link_prog(prog, tr);
2765 if (err) {
2766 bpf_link_cleanup(&link_primer);
2767 link = NULL;
2768 goto out_unlock;
2769 }
2770
2771 link->tgt_prog = tgt_prog;
2772 link->trampoline = tr;
2773
2774 /* Always clear the trampoline and target prog from prog->aux to make
2775 * sure the original attach destination is not kept alive after a
2776 * program is (re-)attached to another target.
2777 */
2778 if (prog->aux->dst_prog &&
2779 (tgt_prog_fd || tr != prog->aux->dst_trampoline))
2780 /* got extra prog ref from syscall, or attaching to different prog */
2781 bpf_prog_put(prog->aux->dst_prog);
2782 if (prog->aux->dst_trampoline && tr != prog->aux->dst_trampoline)
2783 /* we allocated a new trampoline, so free the old one */
2784 bpf_trampoline_put(prog->aux->dst_trampoline);
2785
2786 prog->aux->dst_prog = NULL;
2787 prog->aux->dst_trampoline = NULL;
2788 mutex_unlock(&prog->aux->dst_mutex);
2789
2790 return bpf_link_settle(&link_primer);
2791out_unlock:
2792 if (tr && tr != prog->aux->dst_trampoline)
2793 bpf_trampoline_put(tr);
2794 mutex_unlock(&prog->aux->dst_mutex);
2795 kfree(link);
2796out_put_prog:
2797 if (tgt_prog_fd && tgt_prog)
2798 bpf_prog_put(tgt_prog);
2799 return err;
2800}
2801
2802struct bpf_raw_tp_link {
2803 struct bpf_link link;
2804 struct bpf_raw_event_map *btp;
2805};
2806
2807static void bpf_raw_tp_link_release(struct bpf_link *link)
2808{
2809 struct bpf_raw_tp_link *raw_tp =
2810 container_of(link, struct bpf_raw_tp_link, link);
2811
2812 bpf_probe_unregister(raw_tp->btp, raw_tp->link.prog);
2813 bpf_put_raw_tracepoint(raw_tp->btp);
2814}
2815
2816static void bpf_raw_tp_link_dealloc(struct bpf_link *link)
2817{
2818 struct bpf_raw_tp_link *raw_tp =
2819 container_of(link, struct bpf_raw_tp_link, link);
2820
2821 kfree(raw_tp);
2822}
2823
2824static void bpf_raw_tp_link_show_fdinfo(const struct bpf_link *link,
2825 struct seq_file *seq)
2826{
2827 struct bpf_raw_tp_link *raw_tp_link =
2828 container_of(link, struct bpf_raw_tp_link, link);
2829
2830 seq_printf(seq,
2831 "tp_name:\t%s\n",
2832 raw_tp_link->btp->tp->name);
2833}
2834
2835static int bpf_raw_tp_link_fill_link_info(const struct bpf_link *link,
2836 struct bpf_link_info *info)
2837{
2838 struct bpf_raw_tp_link *raw_tp_link =
2839 container_of(link, struct bpf_raw_tp_link, link);
2840 char __user *ubuf = u64_to_user_ptr(info->raw_tracepoint.tp_name);
2841 const char *tp_name = raw_tp_link->btp->tp->name;
2842 u32 ulen = info->raw_tracepoint.tp_name_len;
2843 size_t tp_len = strlen(tp_name);
2844
2845 if (!ulen ^ !ubuf)
2846 return -EINVAL;
2847
2848 info->raw_tracepoint.tp_name_len = tp_len + 1;
2849
2850 if (!ubuf)
2851 return 0;
2852
2853 if (ulen >= tp_len + 1) {
2854 if (copy_to_user(ubuf, tp_name, tp_len + 1))
2855 return -EFAULT;
2856 } else {
2857 char zero = '\0';
2858
2859 if (copy_to_user(ubuf, tp_name, ulen - 1))
2860 return -EFAULT;
2861 if (put_user(zero, ubuf + ulen - 1))
2862 return -EFAULT;
2863 return -ENOSPC;
2864 }
2865
2866 return 0;
2867}
2868
2869static const struct bpf_link_ops bpf_raw_tp_link_lops = {
2870 .release = bpf_raw_tp_link_release,
2871 .dealloc = bpf_raw_tp_link_dealloc,
2872 .show_fdinfo = bpf_raw_tp_link_show_fdinfo,
2873 .fill_link_info = bpf_raw_tp_link_fill_link_info,
2874};
2875
2876#define BPF_RAW_TRACEPOINT_OPEN_LAST_FIELD raw_tracepoint.prog_fd
2877
2878static int bpf_raw_tracepoint_open(const union bpf_attr *attr)
2879{
2880 struct bpf_link_primer link_primer;
2881 struct bpf_raw_tp_link *link;
2882 struct bpf_raw_event_map *btp;
2883 struct bpf_prog *prog;
2884 const char *tp_name;
2885 char buf[128];
2886 int err;
2887
2888 if (CHECK_ATTR(BPF_RAW_TRACEPOINT_OPEN))
2889 return -EINVAL;
2890
2891 prog = bpf_prog_get(attr->raw_tracepoint.prog_fd);
2892 if (IS_ERR(prog))
2893 return PTR_ERR(prog);
2894
2895 switch (prog->type) {
2896 case BPF_PROG_TYPE_TRACING:
2897 case BPF_PROG_TYPE_EXT:
2898 case BPF_PROG_TYPE_LSM:
2899 if (attr->raw_tracepoint.name) {
2900 /* The attach point for this category of programs
2901 * should be specified via btf_id during program load.
2902 */
2903 err = -EINVAL;
2904 goto out_put_prog;
2905 }
2906 if (prog->type == BPF_PROG_TYPE_TRACING &&
2907 prog->expected_attach_type == BPF_TRACE_RAW_TP) {
2908 tp_name = prog->aux->attach_func_name;
2909 break;
2910 }
2911 err = bpf_tracing_prog_attach(prog, 0, 0);
2912 if (err >= 0)
2913 return err;
2914 goto out_put_prog;
2915 case BPF_PROG_TYPE_RAW_TRACEPOINT:
2916 case BPF_PROG_TYPE_RAW_TRACEPOINT_WRITABLE:
2917 if (strncpy_from_user(buf,
2918 u64_to_user_ptr(attr->raw_tracepoint.name),
2919 sizeof(buf) - 1) < 0) {
2920 err = -EFAULT;
2921 goto out_put_prog;
2922 }
2923 buf[sizeof(buf) - 1] = 0;
2924 tp_name = buf;
2925 break;
2926 default:
2927 err = -EINVAL;
2928 goto out_put_prog;
2929 }
2930
2931 btp = bpf_get_raw_tracepoint(tp_name);
2932 if (!btp) {
2933 err = -ENOENT;
2934 goto out_put_prog;
2935 }
2936
2937 link = kzalloc(sizeof(*link), GFP_USER);
2938 if (!link) {
2939 err = -ENOMEM;
2940 goto out_put_btp;
2941 }
2942 bpf_link_init(&link->link, BPF_LINK_TYPE_RAW_TRACEPOINT,
2943 &bpf_raw_tp_link_lops, prog);
2944 link->btp = btp;
2945
2946 err = bpf_link_prime(&link->link, &link_primer);
2947 if (err) {
2948 kfree(link);
2949 goto out_put_btp;
2950 }
2951
2952 err = bpf_probe_register(link->btp, prog);
2953 if (err) {
2954 bpf_link_cleanup(&link_primer);
2955 goto out_put_btp;
2956 }
2957
2958 return bpf_link_settle(&link_primer);
2959
2960out_put_btp:
2961 bpf_put_raw_tracepoint(btp);
2962out_put_prog:
2963 bpf_prog_put(prog);
2964 return err;
2965}
2966
2967static int bpf_prog_attach_check_attach_type(const struct bpf_prog *prog,
2968 enum bpf_attach_type attach_type)
2969{
2970 switch (prog->type) {
2971 case BPF_PROG_TYPE_CGROUP_SOCK:
2972 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
2973 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
2974 case BPF_PROG_TYPE_SK_LOOKUP:
2975 return attach_type == prog->expected_attach_type ? 0 : -EINVAL;
2976 case BPF_PROG_TYPE_CGROUP_SKB:
2977 if (!capable(CAP_NET_ADMIN))
2978 /* cg-skb progs can be loaded by unpriv user.
2979 * check permissions at attach time.
2980 */
2981 return -EPERM;
2982 return prog->enforce_expected_attach_type &&
2983 prog->expected_attach_type != attach_type ?
2984 -EINVAL : 0;
2985 default:
2986 return 0;
2987 }
2988}
2989
2990static enum bpf_prog_type
2991attach_type_to_prog_type(enum bpf_attach_type attach_type)
2992{
2993 switch (attach_type) {
2994 case BPF_CGROUP_INET_INGRESS:
2995 case BPF_CGROUP_INET_EGRESS:
2996 return BPF_PROG_TYPE_CGROUP_SKB;
2997 case BPF_CGROUP_INET_SOCK_CREATE:
2998 case BPF_CGROUP_INET_SOCK_RELEASE:
2999 case BPF_CGROUP_INET4_POST_BIND:
3000 case BPF_CGROUP_INET6_POST_BIND:
3001 return BPF_PROG_TYPE_CGROUP_SOCK;
3002 case BPF_CGROUP_INET4_BIND:
3003 case BPF_CGROUP_INET6_BIND:
3004 case BPF_CGROUP_INET4_CONNECT:
3005 case BPF_CGROUP_INET6_CONNECT:
3006 case BPF_CGROUP_INET4_GETPEERNAME:
3007 case BPF_CGROUP_INET6_GETPEERNAME:
3008 case BPF_CGROUP_INET4_GETSOCKNAME:
3009 case BPF_CGROUP_INET6_GETSOCKNAME:
3010 case BPF_CGROUP_UDP4_SENDMSG:
3011 case BPF_CGROUP_UDP6_SENDMSG:
3012 case BPF_CGROUP_UDP4_RECVMSG:
3013 case BPF_CGROUP_UDP6_RECVMSG:
3014 return BPF_PROG_TYPE_CGROUP_SOCK_ADDR;
3015 case BPF_CGROUP_SOCK_OPS:
3016 return BPF_PROG_TYPE_SOCK_OPS;
3017 case BPF_CGROUP_DEVICE:
3018 return BPF_PROG_TYPE_CGROUP_DEVICE;
3019 case BPF_SK_MSG_VERDICT:
3020 return BPF_PROG_TYPE_SK_MSG;
3021 case BPF_SK_SKB_STREAM_PARSER:
3022 case BPF_SK_SKB_STREAM_VERDICT:
3023 case BPF_SK_SKB_VERDICT:
3024 return BPF_PROG_TYPE_SK_SKB;
3025 case BPF_LIRC_MODE2:
3026 return BPF_PROG_TYPE_LIRC_MODE2;
3027 case BPF_FLOW_DISSECTOR:
3028 return BPF_PROG_TYPE_FLOW_DISSECTOR;
3029 case BPF_CGROUP_SYSCTL:
3030 return BPF_PROG_TYPE_CGROUP_SYSCTL;
3031 case BPF_CGROUP_GETSOCKOPT:
3032 case BPF_CGROUP_SETSOCKOPT:
3033 return BPF_PROG_TYPE_CGROUP_SOCKOPT;
3034 case BPF_TRACE_ITER:
3035 return BPF_PROG_TYPE_TRACING;
3036 case BPF_SK_LOOKUP:
3037 return BPF_PROG_TYPE_SK_LOOKUP;
3038 case BPF_XDP:
3039 return BPF_PROG_TYPE_XDP;
3040 default:
3041 return BPF_PROG_TYPE_UNSPEC;
3042 }
3043}
3044
3045#define BPF_PROG_ATTACH_LAST_FIELD replace_bpf_fd
3046
3047#define BPF_F_ATTACH_MASK \
3048 (BPF_F_ALLOW_OVERRIDE | BPF_F_ALLOW_MULTI | BPF_F_REPLACE)
3049
3050static int bpf_prog_attach(const union bpf_attr *attr)
3051{
3052 enum bpf_prog_type ptype;
3053 struct bpf_prog *prog;
3054 int ret;
3055
3056 if (CHECK_ATTR(BPF_PROG_ATTACH))
3057 return -EINVAL;
3058
3059 if (attr->attach_flags & ~BPF_F_ATTACH_MASK)
3060 return -EINVAL;
3061
3062 ptype = attach_type_to_prog_type(attr->attach_type);
3063 if (ptype == BPF_PROG_TYPE_UNSPEC)
3064 return -EINVAL;
3065
3066 prog = bpf_prog_get_type(attr->attach_bpf_fd, ptype);
3067 if (IS_ERR(prog))
3068 return PTR_ERR(prog);
3069
3070 if (bpf_prog_attach_check_attach_type(prog, attr->attach_type)) {
3071 bpf_prog_put(prog);
3072 return -EINVAL;
3073 }
3074
3075 switch (ptype) {
3076 case BPF_PROG_TYPE_SK_SKB:
3077 case BPF_PROG_TYPE_SK_MSG:
3078 ret = sock_map_get_from_fd(attr, prog);
3079 break;
3080 case BPF_PROG_TYPE_LIRC_MODE2:
3081 ret = lirc_prog_attach(attr, prog);
3082 break;
3083 case BPF_PROG_TYPE_FLOW_DISSECTOR:
3084 ret = netns_bpf_prog_attach(attr, prog);
3085 break;
3086 case BPF_PROG_TYPE_CGROUP_DEVICE:
3087 case BPF_PROG_TYPE_CGROUP_SKB:
3088 case BPF_PROG_TYPE_CGROUP_SOCK:
3089 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
3090 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
3091 case BPF_PROG_TYPE_CGROUP_SYSCTL:
3092 case BPF_PROG_TYPE_SOCK_OPS:
3093 ret = cgroup_bpf_prog_attach(attr, ptype, prog);
3094 break;
3095 default:
3096 ret = -EINVAL;
3097 }
3098
3099 if (ret)
3100 bpf_prog_put(prog);
3101 return ret;
3102}
3103
3104#define BPF_PROG_DETACH_LAST_FIELD attach_type
3105
3106static int bpf_prog_detach(const union bpf_attr *attr)
3107{
3108 enum bpf_prog_type ptype;
3109
3110 if (CHECK_ATTR(BPF_PROG_DETACH))
3111 return -EINVAL;
3112
3113 ptype = attach_type_to_prog_type(attr->attach_type);
3114
3115 switch (ptype) {
3116 case BPF_PROG_TYPE_SK_MSG:
3117 case BPF_PROG_TYPE_SK_SKB:
3118 return sock_map_prog_detach(attr, ptype);
3119 case BPF_PROG_TYPE_LIRC_MODE2:
3120 return lirc_prog_detach(attr);
3121 case BPF_PROG_TYPE_FLOW_DISSECTOR:
3122 return netns_bpf_prog_detach(attr, ptype);
3123 case BPF_PROG_TYPE_CGROUP_DEVICE:
3124 case BPF_PROG_TYPE_CGROUP_SKB:
3125 case BPF_PROG_TYPE_CGROUP_SOCK:
3126 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
3127 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
3128 case BPF_PROG_TYPE_CGROUP_SYSCTL:
3129 case BPF_PROG_TYPE_SOCK_OPS:
3130 return cgroup_bpf_prog_detach(attr, ptype);
3131 default:
3132 return -EINVAL;
3133 }
3134}
3135
3136#define BPF_PROG_QUERY_LAST_FIELD query.prog_cnt
3137
3138static int bpf_prog_query(const union bpf_attr *attr,
3139 union bpf_attr __user *uattr)
3140{
3141 if (!capable(CAP_NET_ADMIN))
3142 return -EPERM;
3143 if (CHECK_ATTR(BPF_PROG_QUERY))
3144 return -EINVAL;
3145 if (attr->query.query_flags & ~BPF_F_QUERY_EFFECTIVE)
3146 return -EINVAL;
3147
3148 switch (attr->query.attach_type) {
3149 case BPF_CGROUP_INET_INGRESS:
3150 case BPF_CGROUP_INET_EGRESS:
3151 case BPF_CGROUP_INET_SOCK_CREATE:
3152 case BPF_CGROUP_INET_SOCK_RELEASE:
3153 case BPF_CGROUP_INET4_BIND:
3154 case BPF_CGROUP_INET6_BIND:
3155 case BPF_CGROUP_INET4_POST_BIND:
3156 case BPF_CGROUP_INET6_POST_BIND:
3157 case BPF_CGROUP_INET4_CONNECT:
3158 case BPF_CGROUP_INET6_CONNECT:
3159 case BPF_CGROUP_INET4_GETPEERNAME:
3160 case BPF_CGROUP_INET6_GETPEERNAME:
3161 case BPF_CGROUP_INET4_GETSOCKNAME:
3162 case BPF_CGROUP_INET6_GETSOCKNAME:
3163 case BPF_CGROUP_UDP4_SENDMSG:
3164 case BPF_CGROUP_UDP6_SENDMSG:
3165 case BPF_CGROUP_UDP4_RECVMSG:
3166 case BPF_CGROUP_UDP6_RECVMSG:
3167 case BPF_CGROUP_SOCK_OPS:
3168 case BPF_CGROUP_DEVICE:
3169 case BPF_CGROUP_SYSCTL:
3170 case BPF_CGROUP_GETSOCKOPT:
3171 case BPF_CGROUP_SETSOCKOPT:
3172 return cgroup_bpf_prog_query(attr, uattr);
3173 case BPF_LIRC_MODE2:
3174 return lirc_prog_query(attr, uattr);
3175 case BPF_FLOW_DISSECTOR:
3176 case BPF_SK_LOOKUP:
3177 return netns_bpf_prog_query(attr, uattr);
3178 default:
3179 return -EINVAL;
3180 }
3181}
3182
3183#define BPF_PROG_TEST_RUN_LAST_FIELD test.cpu
3184
3185static int bpf_prog_test_run(const union bpf_attr *attr,
3186 union bpf_attr __user *uattr)
3187{
3188 struct bpf_prog *prog;
3189 int ret = -ENOTSUPP;
3190
3191 if (CHECK_ATTR(BPF_PROG_TEST_RUN))
3192 return -EINVAL;
3193
3194 if ((attr->test.ctx_size_in && !attr->test.ctx_in) ||
3195 (!attr->test.ctx_size_in && attr->test.ctx_in))
3196 return -EINVAL;
3197
3198 if ((attr->test.ctx_size_out && !attr->test.ctx_out) ||
3199 (!attr->test.ctx_size_out && attr->test.ctx_out))
3200 return -EINVAL;
3201
3202 prog = bpf_prog_get(attr->test.prog_fd);
3203 if (IS_ERR(prog))
3204 return PTR_ERR(prog);
3205
3206 if (prog->aux->ops->test_run)
3207 ret = prog->aux->ops->test_run(prog, attr, uattr);
3208
3209 bpf_prog_put(prog);
3210 return ret;
3211}
3212
3213#define BPF_OBJ_GET_NEXT_ID_LAST_FIELD next_id
3214
3215static int bpf_obj_get_next_id(const union bpf_attr *attr,
3216 union bpf_attr __user *uattr,
3217 struct idr *idr,
3218 spinlock_t *lock)
3219{
3220 u32 next_id = attr->start_id;
3221 int err = 0;
3222
3223 if (CHECK_ATTR(BPF_OBJ_GET_NEXT_ID) || next_id >= INT_MAX)
3224 return -EINVAL;
3225
3226 if (!capable(CAP_SYS_ADMIN))
3227 return -EPERM;
3228
3229 next_id++;
3230 spin_lock_bh(lock);
3231 if (!idr_get_next(idr, &next_id))
3232 err = -ENOENT;
3233 spin_unlock_bh(lock);
3234
3235 if (!err)
3236 err = put_user(next_id, &uattr->next_id);
3237
3238 return err;
3239}
3240
3241struct bpf_map *bpf_map_get_curr_or_next(u32 *id)
3242{
3243 struct bpf_map *map;
3244
3245 spin_lock_bh(&map_idr_lock);
3246again:
3247 map = idr_get_next(&map_idr, id);
3248 if (map) {
3249 map = __bpf_map_inc_not_zero(map, false);
3250 if (IS_ERR(map)) {
3251 (*id)++;
3252 goto again;
3253 }
3254 }
3255 spin_unlock_bh(&map_idr_lock);
3256
3257 return map;
3258}
3259
3260struct bpf_prog *bpf_prog_get_curr_or_next(u32 *id)
3261{
3262 struct bpf_prog *prog;
3263
3264 spin_lock_bh(&prog_idr_lock);
3265again:
3266 prog = idr_get_next(&prog_idr, id);
3267 if (prog) {
3268 prog = bpf_prog_inc_not_zero(prog);
3269 if (IS_ERR(prog)) {
3270 (*id)++;
3271 goto again;
3272 }
3273 }
3274 spin_unlock_bh(&prog_idr_lock);
3275
3276 return prog;
3277}
3278
3279#define BPF_PROG_GET_FD_BY_ID_LAST_FIELD prog_id
3280
3281struct bpf_prog *bpf_prog_by_id(u32 id)
3282{
3283 struct bpf_prog *prog;
3284
3285 if (!id)
3286 return ERR_PTR(-ENOENT);
3287
3288 spin_lock_bh(&prog_idr_lock);
3289 prog = idr_find(&prog_idr, id);
3290 if (prog)
3291 prog = bpf_prog_inc_not_zero(prog);
3292 else
3293 prog = ERR_PTR(-ENOENT);
3294 spin_unlock_bh(&prog_idr_lock);
3295 return prog;
3296}
3297
3298static int bpf_prog_get_fd_by_id(const union bpf_attr *attr)
3299{
3300 struct bpf_prog *prog;
3301 u32 id = attr->prog_id;
3302 int fd;
3303
3304 if (CHECK_ATTR(BPF_PROG_GET_FD_BY_ID))
3305 return -EINVAL;
3306
3307 if (!capable(CAP_SYS_ADMIN))
3308 return -EPERM;
3309
3310 prog = bpf_prog_by_id(id);
3311 if (IS_ERR(prog))
3312 return PTR_ERR(prog);
3313
3314 fd = bpf_prog_new_fd(prog);
3315 if (fd < 0)
3316 bpf_prog_put(prog);
3317
3318 return fd;
3319}
3320
3321#define BPF_MAP_GET_FD_BY_ID_LAST_FIELD open_flags
3322
3323static int bpf_map_get_fd_by_id(const union bpf_attr *attr)
3324{
3325 struct bpf_map *map;
3326 u32 id = attr->map_id;
3327 int f_flags;
3328 int fd;
3329
3330 if (CHECK_ATTR(BPF_MAP_GET_FD_BY_ID) ||
3331 attr->open_flags & ~BPF_OBJ_FLAG_MASK)
3332 return -EINVAL;
3333
3334 if (!capable(CAP_SYS_ADMIN))
3335 return -EPERM;
3336
3337 f_flags = bpf_get_file_flag(attr->open_flags);
3338 if (f_flags < 0)
3339 return f_flags;
3340
3341 spin_lock_bh(&map_idr_lock);
3342 map = idr_find(&map_idr, id);
3343 if (map)
3344 map = __bpf_map_inc_not_zero(map, true);
3345 else
3346 map = ERR_PTR(-ENOENT);
3347 spin_unlock_bh(&map_idr_lock);
3348
3349 if (IS_ERR(map))
3350 return PTR_ERR(map);
3351
3352 fd = bpf_map_new_fd(map, f_flags);
3353 if (fd < 0)
3354 bpf_map_put_with_uref(map);
3355
3356 return fd;
3357}
3358
3359static const struct bpf_map *bpf_map_from_imm(const struct bpf_prog *prog,
3360 unsigned long addr, u32 *off,
3361 u32 *type)
3362{
3363 const struct bpf_map *map;
3364 int i;
3365
3366 mutex_lock(&prog->aux->used_maps_mutex);
3367 for (i = 0, *off = 0; i < prog->aux->used_map_cnt; i++) {
3368 map = prog->aux->used_maps[i];
3369 if (map == (void *)addr) {
3370 *type = BPF_PSEUDO_MAP_FD;
3371 goto out;
3372 }
3373 if (!map->ops->map_direct_value_meta)
3374 continue;
3375 if (!map->ops->map_direct_value_meta(map, addr, off)) {
3376 *type = BPF_PSEUDO_MAP_VALUE;
3377 goto out;
3378 }
3379 }
3380 map = NULL;
3381
3382out:
3383 mutex_unlock(&prog->aux->used_maps_mutex);
3384 return map;
3385}
3386
3387static struct bpf_insn *bpf_insn_prepare_dump(const struct bpf_prog *prog,
3388 const struct cred *f_cred)
3389{
3390 const struct bpf_map *map;
3391 struct bpf_insn *insns;
3392 u32 off, type;
3393 u64 imm;
3394 u8 code;
3395 int i;
3396
3397 insns = kmemdup(prog->insnsi, bpf_prog_insn_size(prog),
3398 GFP_USER);
3399 if (!insns)
3400 return insns;
3401
3402 for (i = 0; i < prog->len; i++) {
3403 code = insns[i].code;
3404
3405 if (code == (BPF_JMP | BPF_TAIL_CALL)) {
3406 insns[i].code = BPF_JMP | BPF_CALL;
3407 insns[i].imm = BPF_FUNC_tail_call;
3408 /* fall-through */
3409 }
3410 if (code == (BPF_JMP | BPF_CALL) ||
3411 code == (BPF_JMP | BPF_CALL_ARGS)) {
3412 if (code == (BPF_JMP | BPF_CALL_ARGS))
3413 insns[i].code = BPF_JMP | BPF_CALL;
3414 if (!bpf_dump_raw_ok(f_cred))
3415 insns[i].imm = 0;
3416 continue;
3417 }
3418 if (BPF_CLASS(code) == BPF_LDX && BPF_MODE(code) == BPF_PROBE_MEM) {
3419 insns[i].code = BPF_LDX | BPF_SIZE(code) | BPF_MEM;
3420 continue;
3421 }
3422
3423 if (code != (BPF_LD | BPF_IMM | BPF_DW))
3424 continue;
3425
3426 imm = ((u64)insns[i + 1].imm << 32) | (u32)insns[i].imm;
3427 map = bpf_map_from_imm(prog, imm, &off, &type);
3428 if (map) {
3429 insns[i].src_reg = type;
3430 insns[i].imm = map->id;
3431 insns[i + 1].imm = off;
3432 continue;
3433 }
3434 }
3435
3436 return insns;
3437}
3438
3439static int set_info_rec_size(struct bpf_prog_info *info)
3440{
3441 /*
3442 * Ensure info.*_rec_size is the same as kernel expected size
3443 *
3444 * or
3445 *
3446 * Only allow zero *_rec_size if both _rec_size and _cnt are
3447 * zero. In this case, the kernel will set the expected
3448 * _rec_size back to the info.
3449 */
3450
3451 if ((info->nr_func_info || info->func_info_rec_size) &&
3452 info->func_info_rec_size != sizeof(struct bpf_func_info))
3453 return -EINVAL;
3454
3455 if ((info->nr_line_info || info->line_info_rec_size) &&
3456 info->line_info_rec_size != sizeof(struct bpf_line_info))
3457 return -EINVAL;
3458
3459 if ((info->nr_jited_line_info || info->jited_line_info_rec_size) &&
3460 info->jited_line_info_rec_size != sizeof(__u64))
3461 return -EINVAL;
3462
3463 info->func_info_rec_size = sizeof(struct bpf_func_info);
3464 info->line_info_rec_size = sizeof(struct bpf_line_info);
3465 info->jited_line_info_rec_size = sizeof(__u64);
3466
3467 return 0;
3468}
3469
3470static int bpf_prog_get_info_by_fd(struct file *file,
3471 struct bpf_prog *prog,
3472 const union bpf_attr *attr,
3473 union bpf_attr __user *uattr)
3474{
3475 struct bpf_prog_info __user *uinfo = u64_to_user_ptr(attr->info.info);
3476 struct bpf_prog_info info;
3477 u32 info_len = attr->info.info_len;
3478 struct bpf_prog_stats stats;
3479 char __user *uinsns;
3480 u32 ulen;
3481 int err;
3482
3483 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
3484 if (err)
3485 return err;
3486 info_len = min_t(u32, sizeof(info), info_len);
3487
3488 memset(&info, 0, sizeof(info));
3489 if (copy_from_user(&info, uinfo, info_len))
3490 return -EFAULT;
3491
3492 info.type = prog->type;
3493 info.id = prog->aux->id;
3494 info.load_time = prog->aux->load_time;
3495 info.created_by_uid = from_kuid_munged(current_user_ns(),
3496 prog->aux->user->uid);
3497 info.gpl_compatible = prog->gpl_compatible;
3498
3499 memcpy(info.tag, prog->tag, sizeof(prog->tag));
3500 memcpy(info.name, prog->aux->name, sizeof(prog->aux->name));
3501
3502 mutex_lock(&prog->aux->used_maps_mutex);
3503 ulen = info.nr_map_ids;
3504 info.nr_map_ids = prog->aux->used_map_cnt;
3505 ulen = min_t(u32, info.nr_map_ids, ulen);
3506 if (ulen) {
3507 u32 __user *user_map_ids = u64_to_user_ptr(info.map_ids);
3508 u32 i;
3509
3510 for (i = 0; i < ulen; i++)
3511 if (put_user(prog->aux->used_maps[i]->id,
3512 &user_map_ids[i])) {
3513 mutex_unlock(&prog->aux->used_maps_mutex);
3514 return -EFAULT;
3515 }
3516 }
3517 mutex_unlock(&prog->aux->used_maps_mutex);
3518
3519 err = set_info_rec_size(&info);
3520 if (err)
3521 return err;
3522
3523 bpf_prog_get_stats(prog, &stats);
3524 info.run_time_ns = stats.nsecs;
3525 info.run_cnt = stats.cnt;
3526 info.recursion_misses = stats.misses;
3527
3528 if (!bpf_capable()) {
3529 info.jited_prog_len = 0;
3530 info.xlated_prog_len = 0;
3531 info.nr_jited_ksyms = 0;
3532 info.nr_jited_func_lens = 0;
3533 info.nr_func_info = 0;
3534 info.nr_line_info = 0;
3535 info.nr_jited_line_info = 0;
3536 goto done;
3537 }
3538
3539 ulen = info.xlated_prog_len;
3540 info.xlated_prog_len = bpf_prog_insn_size(prog);
3541 if (info.xlated_prog_len && ulen) {
3542 struct bpf_insn *insns_sanitized;
3543 bool fault;
3544
3545 if (prog->blinded && !bpf_dump_raw_ok(file->f_cred)) {
3546 info.xlated_prog_insns = 0;
3547 goto done;
3548 }
3549 insns_sanitized = bpf_insn_prepare_dump(prog, file->f_cred);
3550 if (!insns_sanitized)
3551 return -ENOMEM;
3552 uinsns = u64_to_user_ptr(info.xlated_prog_insns);
3553 ulen = min_t(u32, info.xlated_prog_len, ulen);
3554 fault = copy_to_user(uinsns, insns_sanitized, ulen);
3555 kfree(insns_sanitized);
3556 if (fault)
3557 return -EFAULT;
3558 }
3559
3560 if (bpf_prog_is_dev_bound(prog->aux)) {
3561 err = bpf_prog_offload_info_fill(&info, prog);
3562 if (err)
3563 return err;
3564 goto done;
3565 }
3566
3567 /* NOTE: the following code is supposed to be skipped for offload.
3568 * bpf_prog_offload_info_fill() is the place to fill similar fields
3569 * for offload.
3570 */
3571 ulen = info.jited_prog_len;
3572 if (prog->aux->func_cnt) {
3573 u32 i;
3574
3575 info.jited_prog_len = 0;
3576 for (i = 0; i < prog->aux->func_cnt; i++)
3577 info.jited_prog_len += prog->aux->func[i]->jited_len;
3578 } else {
3579 info.jited_prog_len = prog->jited_len;
3580 }
3581
3582 if (info.jited_prog_len && ulen) {
3583 if (bpf_dump_raw_ok(file->f_cred)) {
3584 uinsns = u64_to_user_ptr(info.jited_prog_insns);
3585 ulen = min_t(u32, info.jited_prog_len, ulen);
3586
3587 /* for multi-function programs, copy the JITed
3588 * instructions for all the functions
3589 */
3590 if (prog->aux->func_cnt) {
3591 u32 len, free, i;
3592 u8 *img;
3593
3594 free = ulen;
3595 for (i = 0; i < prog->aux->func_cnt; i++) {
3596 len = prog->aux->func[i]->jited_len;
3597 len = min_t(u32, len, free);
3598 img = (u8 *) prog->aux->func[i]->bpf_func;
3599 if (copy_to_user(uinsns, img, len))
3600 return -EFAULT;
3601 uinsns += len;
3602 free -= len;
3603 if (!free)
3604 break;
3605 }
3606 } else {
3607 if (copy_to_user(uinsns, prog->bpf_func, ulen))
3608 return -EFAULT;
3609 }
3610 } else {
3611 info.jited_prog_insns = 0;
3612 }
3613 }
3614
3615 ulen = info.nr_jited_ksyms;
3616 info.nr_jited_ksyms = prog->aux->func_cnt ? : 1;
3617 if (ulen) {
3618 if (bpf_dump_raw_ok(file->f_cred)) {
3619 unsigned long ksym_addr;
3620 u64 __user *user_ksyms;
3621 u32 i;
3622
3623 /* copy the address of the kernel symbol
3624 * corresponding to each function
3625 */
3626 ulen = min_t(u32, info.nr_jited_ksyms, ulen);
3627 user_ksyms = u64_to_user_ptr(info.jited_ksyms);
3628 if (prog->aux->func_cnt) {
3629 for (i = 0; i < ulen; i++) {
3630 ksym_addr = (unsigned long)
3631 prog->aux->func[i]->bpf_func;
3632 if (put_user((u64) ksym_addr,
3633 &user_ksyms[i]))
3634 return -EFAULT;
3635 }
3636 } else {
3637 ksym_addr = (unsigned long) prog->bpf_func;
3638 if (put_user((u64) ksym_addr, &user_ksyms[0]))
3639 return -EFAULT;
3640 }
3641 } else {
3642 info.jited_ksyms = 0;
3643 }
3644 }
3645
3646 ulen = info.nr_jited_func_lens;
3647 info.nr_jited_func_lens = prog->aux->func_cnt ? : 1;
3648 if (ulen) {
3649 if (bpf_dump_raw_ok(file->f_cred)) {
3650 u32 __user *user_lens;
3651 u32 func_len, i;
3652
3653 /* copy the JITed image lengths for each function */
3654 ulen = min_t(u32, info.nr_jited_func_lens, ulen);
3655 user_lens = u64_to_user_ptr(info.jited_func_lens);
3656 if (prog->aux->func_cnt) {
3657 for (i = 0; i < ulen; i++) {
3658 func_len =
3659 prog->aux->func[i]->jited_len;
3660 if (put_user(func_len, &user_lens[i]))
3661 return -EFAULT;
3662 }
3663 } else {
3664 func_len = prog->jited_len;
3665 if (put_user(func_len, &user_lens[0]))
3666 return -EFAULT;
3667 }
3668 } else {
3669 info.jited_func_lens = 0;
3670 }
3671 }
3672
3673 if (prog->aux->btf)
3674 info.btf_id = btf_obj_id(prog->aux->btf);
3675
3676 ulen = info.nr_func_info;
3677 info.nr_func_info = prog->aux->func_info_cnt;
3678 if (info.nr_func_info && ulen) {
3679 char __user *user_finfo;
3680
3681 user_finfo = u64_to_user_ptr(info.func_info);
3682 ulen = min_t(u32, info.nr_func_info, ulen);
3683 if (copy_to_user(user_finfo, prog->aux->func_info,
3684 info.func_info_rec_size * ulen))
3685 return -EFAULT;
3686 }
3687
3688 ulen = info.nr_line_info;
3689 info.nr_line_info = prog->aux->nr_linfo;
3690 if (info.nr_line_info && ulen) {
3691 __u8 __user *user_linfo;
3692
3693 user_linfo = u64_to_user_ptr(info.line_info);
3694 ulen = min_t(u32, info.nr_line_info, ulen);
3695 if (copy_to_user(user_linfo, prog->aux->linfo,
3696 info.line_info_rec_size * ulen))
3697 return -EFAULT;
3698 }
3699
3700 ulen = info.nr_jited_line_info;
3701 if (prog->aux->jited_linfo)
3702 info.nr_jited_line_info = prog->aux->nr_linfo;
3703 else
3704 info.nr_jited_line_info = 0;
3705 if (info.nr_jited_line_info && ulen) {
3706 if (bpf_dump_raw_ok(file->f_cred)) {
3707 __u64 __user *user_linfo;
3708 u32 i;
3709
3710 user_linfo = u64_to_user_ptr(info.jited_line_info);
3711 ulen = min_t(u32, info.nr_jited_line_info, ulen);
3712 for (i = 0; i < ulen; i++) {
3713 if (put_user((__u64)(long)prog->aux->jited_linfo[i],
3714 &user_linfo[i]))
3715 return -EFAULT;
3716 }
3717 } else {
3718 info.jited_line_info = 0;
3719 }
3720 }
3721
3722 ulen = info.nr_prog_tags;
3723 info.nr_prog_tags = prog->aux->func_cnt ? : 1;
3724 if (ulen) {
3725 __u8 __user (*user_prog_tags)[BPF_TAG_SIZE];
3726 u32 i;
3727
3728 user_prog_tags = u64_to_user_ptr(info.prog_tags);
3729 ulen = min_t(u32, info.nr_prog_tags, ulen);
3730 if (prog->aux->func_cnt) {
3731 for (i = 0; i < ulen; i++) {
3732 if (copy_to_user(user_prog_tags[i],
3733 prog->aux->func[i]->tag,
3734 BPF_TAG_SIZE))
3735 return -EFAULT;
3736 }
3737 } else {
3738 if (copy_to_user(user_prog_tags[0],
3739 prog->tag, BPF_TAG_SIZE))
3740 return -EFAULT;
3741 }
3742 }
3743
3744done:
3745 if (copy_to_user(uinfo, &info, info_len) ||
3746 put_user(info_len, &uattr->info.info_len))
3747 return -EFAULT;
3748
3749 return 0;
3750}
3751
3752static int bpf_map_get_info_by_fd(struct file *file,
3753 struct bpf_map *map,
3754 const union bpf_attr *attr,
3755 union bpf_attr __user *uattr)
3756{
3757 struct bpf_map_info __user *uinfo = u64_to_user_ptr(attr->info.info);
3758 struct bpf_map_info info;
3759 u32 info_len = attr->info.info_len;
3760 int err;
3761
3762 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
3763 if (err)
3764 return err;
3765 info_len = min_t(u32, sizeof(info), info_len);
3766
3767 memset(&info, 0, sizeof(info));
3768 info.type = map->map_type;
3769 info.id = map->id;
3770 info.key_size = map->key_size;
3771 info.value_size = map->value_size;
3772 info.max_entries = map->max_entries;
3773 info.map_flags = map->map_flags;
3774 memcpy(info.name, map->name, sizeof(map->name));
3775
3776 if (map->btf) {
3777 info.btf_id = btf_obj_id(map->btf);
3778 info.btf_key_type_id = map->btf_key_type_id;
3779 info.btf_value_type_id = map->btf_value_type_id;
3780 }
3781 info.btf_vmlinux_value_type_id = map->btf_vmlinux_value_type_id;
3782
3783 if (bpf_map_is_dev_bound(map)) {
3784 err = bpf_map_offload_info_fill(&info, map);
3785 if (err)
3786 return err;
3787 }
3788
3789 if (copy_to_user(uinfo, &info, info_len) ||
3790 put_user(info_len, &uattr->info.info_len))
3791 return -EFAULT;
3792
3793 return 0;
3794}
3795
3796static int bpf_btf_get_info_by_fd(struct file *file,
3797 struct btf *btf,
3798 const union bpf_attr *attr,
3799 union bpf_attr __user *uattr)
3800{
3801 struct bpf_btf_info __user *uinfo = u64_to_user_ptr(attr->info.info);
3802 u32 info_len = attr->info.info_len;
3803 int err;
3804
3805 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(*uinfo), info_len);
3806 if (err)
3807 return err;
3808
3809 return btf_get_info_by_fd(btf, attr, uattr);
3810}
3811
3812static int bpf_link_get_info_by_fd(struct file *file,
3813 struct bpf_link *link,
3814 const union bpf_attr *attr,
3815 union bpf_attr __user *uattr)
3816{
3817 struct bpf_link_info __user *uinfo = u64_to_user_ptr(attr->info.info);
3818 struct bpf_link_info info;
3819 u32 info_len = attr->info.info_len;
3820 int err;
3821
3822 err = bpf_check_uarg_tail_zero(USER_BPFPTR(uinfo), sizeof(info), info_len);
3823 if (err)
3824 return err;
3825 info_len = min_t(u32, sizeof(info), info_len);
3826
3827 memset(&info, 0, sizeof(info));
3828 if (copy_from_user(&info, uinfo, info_len))
3829 return -EFAULT;
3830
3831 info.type = link->type;
3832 info.id = link->id;
3833 info.prog_id = link->prog->aux->id;
3834
3835 if (link->ops->fill_link_info) {
3836 err = link->ops->fill_link_info(link, &info);
3837 if (err)
3838 return err;
3839 }
3840
3841 if (copy_to_user(uinfo, &info, info_len) ||
3842 put_user(info_len, &uattr->info.info_len))
3843 return -EFAULT;
3844
3845 return 0;
3846}
3847
3848
3849#define BPF_OBJ_GET_INFO_BY_FD_LAST_FIELD info.info
3850
3851static int bpf_obj_get_info_by_fd(const union bpf_attr *attr,
3852 union bpf_attr __user *uattr)
3853{
3854 int ufd = attr->info.bpf_fd;
3855 struct fd f;
3856 int err;
3857
3858 if (CHECK_ATTR(BPF_OBJ_GET_INFO_BY_FD))
3859 return -EINVAL;
3860
3861 f = fdget(ufd);
3862 if (!f.file)
3863 return -EBADFD;
3864
3865 if (f.file->f_op == &bpf_prog_fops)
3866 err = bpf_prog_get_info_by_fd(f.file, f.file->private_data, attr,
3867 uattr);
3868 else if (f.file->f_op == &bpf_map_fops)
3869 err = bpf_map_get_info_by_fd(f.file, f.file->private_data, attr,
3870 uattr);
3871 else if (f.file->f_op == &btf_fops)
3872 err = bpf_btf_get_info_by_fd(f.file, f.file->private_data, attr, uattr);
3873 else if (f.file->f_op == &bpf_link_fops)
3874 err = bpf_link_get_info_by_fd(f.file, f.file->private_data,
3875 attr, uattr);
3876 else
3877 err = -EINVAL;
3878
3879 fdput(f);
3880 return err;
3881}
3882
3883#define BPF_BTF_LOAD_LAST_FIELD btf_log_level
3884
3885static int bpf_btf_load(const union bpf_attr *attr, bpfptr_t uattr)
3886{
3887 if (CHECK_ATTR(BPF_BTF_LOAD))
3888 return -EINVAL;
3889
3890 if (!bpf_capable())
3891 return -EPERM;
3892
3893 return btf_new_fd(attr, uattr);
3894}
3895
3896#define BPF_BTF_GET_FD_BY_ID_LAST_FIELD btf_id
3897
3898static int bpf_btf_get_fd_by_id(const union bpf_attr *attr)
3899{
3900 if (CHECK_ATTR(BPF_BTF_GET_FD_BY_ID))
3901 return -EINVAL;
3902
3903 if (!capable(CAP_SYS_ADMIN))
3904 return -EPERM;
3905
3906 return btf_get_fd_by_id(attr->btf_id);
3907}
3908
3909static int bpf_task_fd_query_copy(const union bpf_attr *attr,
3910 union bpf_attr __user *uattr,
3911 u32 prog_id, u32 fd_type,
3912 const char *buf, u64 probe_offset,
3913 u64 probe_addr)
3914{
3915 char __user *ubuf = u64_to_user_ptr(attr->task_fd_query.buf);
3916 u32 len = buf ? strlen(buf) : 0, input_len;
3917 int err = 0;
3918
3919 if (put_user(len, &uattr->task_fd_query.buf_len))
3920 return -EFAULT;
3921 input_len = attr->task_fd_query.buf_len;
3922 if (input_len && ubuf) {
3923 if (!len) {
3924 /* nothing to copy, just make ubuf NULL terminated */
3925 char zero = '\0';
3926
3927 if (put_user(zero, ubuf))
3928 return -EFAULT;
3929 } else if (input_len >= len + 1) {
3930 /* ubuf can hold the string with NULL terminator */
3931 if (copy_to_user(ubuf, buf, len + 1))
3932 return -EFAULT;
3933 } else {
3934 /* ubuf cannot hold the string with NULL terminator,
3935 * do a partial copy with NULL terminator.
3936 */
3937 char zero = '\0';
3938
3939 err = -ENOSPC;
3940 if (copy_to_user(ubuf, buf, input_len - 1))
3941 return -EFAULT;
3942 if (put_user(zero, ubuf + input_len - 1))
3943 return -EFAULT;
3944 }
3945 }
3946
3947 if (put_user(prog_id, &uattr->task_fd_query.prog_id) ||
3948 put_user(fd_type, &uattr->task_fd_query.fd_type) ||
3949 put_user(probe_offset, &uattr->task_fd_query.probe_offset) ||
3950 put_user(probe_addr, &uattr->task_fd_query.probe_addr))
3951 return -EFAULT;
3952
3953 return err;
3954}
3955
3956#define BPF_TASK_FD_QUERY_LAST_FIELD task_fd_query.probe_addr
3957
3958static int bpf_task_fd_query(const union bpf_attr *attr,
3959 union bpf_attr __user *uattr)
3960{
3961 pid_t pid = attr->task_fd_query.pid;
3962 u32 fd = attr->task_fd_query.fd;
3963 const struct perf_event *event;
3964 struct task_struct *task;
3965 struct file *file;
3966 int err;
3967
3968 if (CHECK_ATTR(BPF_TASK_FD_QUERY))
3969 return -EINVAL;
3970
3971 if (!capable(CAP_SYS_ADMIN))
3972 return -EPERM;
3973
3974 if (attr->task_fd_query.flags != 0)
3975 return -EINVAL;
3976
3977 task = get_pid_task(find_vpid(pid), PIDTYPE_PID);
3978 if (!task)
3979 return -ENOENT;
3980
3981 err = 0;
3982 file = fget_task(task, fd);
3983 put_task_struct(task);
3984 if (!file)
3985 return -EBADF;
3986
3987 if (file->f_op == &bpf_link_fops) {
3988 struct bpf_link *link = file->private_data;
3989
3990 if (link->ops == &bpf_raw_tp_link_lops) {
3991 struct bpf_raw_tp_link *raw_tp =
3992 container_of(link, struct bpf_raw_tp_link, link);
3993 struct bpf_raw_event_map *btp = raw_tp->btp;
3994
3995 err = bpf_task_fd_query_copy(attr, uattr,
3996 raw_tp->link.prog->aux->id,
3997 BPF_FD_TYPE_RAW_TRACEPOINT,
3998 btp->tp->name, 0, 0);
3999 goto put_file;
4000 }
4001 goto out_not_supp;
4002 }
4003
4004 event = perf_get_event(file);
4005 if (!IS_ERR(event)) {
4006 u64 probe_offset, probe_addr;
4007 u32 prog_id, fd_type;
4008 const char *buf;
4009
4010 err = bpf_get_perf_event_info(event, &prog_id, &fd_type,
4011 &buf, &probe_offset,
4012 &probe_addr);
4013 if (!err)
4014 err = bpf_task_fd_query_copy(attr, uattr, prog_id,
4015 fd_type, buf,
4016 probe_offset,
4017 probe_addr);
4018 goto put_file;
4019 }
4020
4021out_not_supp:
4022 err = -ENOTSUPP;
4023put_file:
4024 fput(file);
4025 return err;
4026}
4027
4028#define BPF_MAP_BATCH_LAST_FIELD batch.flags
4029
4030#define BPF_DO_BATCH(fn) \
4031 do { \
4032 if (!fn) { \
4033 err = -ENOTSUPP; \
4034 goto err_put; \
4035 } \
4036 err = fn(map, attr, uattr); \
4037 } while (0)
4038
4039static int bpf_map_do_batch(const union bpf_attr *attr,
4040 union bpf_attr __user *uattr,
4041 int cmd)
4042{
4043 struct bpf_map *map;
4044 int err, ufd;
4045 struct fd f;
4046
4047 if (CHECK_ATTR(BPF_MAP_BATCH))
4048 return -EINVAL;
4049
4050 ufd = attr->batch.map_fd;
4051 f = fdget(ufd);
4052 map = __bpf_map_get(f);
4053 if (IS_ERR(map))
4054 return PTR_ERR(map);
4055
4056 if ((cmd == BPF_MAP_LOOKUP_BATCH ||
4057 cmd == BPF_MAP_LOOKUP_AND_DELETE_BATCH) &&
4058 !(map_get_sys_perms(map, f) & FMODE_CAN_READ)) {
4059 err = -EPERM;
4060 goto err_put;
4061 }
4062
4063 if (cmd != BPF_MAP_LOOKUP_BATCH &&
4064 !(map_get_sys_perms(map, f) & FMODE_CAN_WRITE)) {
4065 err = -EPERM;
4066 goto err_put;
4067 }
4068
4069 if (cmd == BPF_MAP_LOOKUP_BATCH)
4070 BPF_DO_BATCH(map->ops->map_lookup_batch);
4071 else if (cmd == BPF_MAP_LOOKUP_AND_DELETE_BATCH)
4072 BPF_DO_BATCH(map->ops->map_lookup_and_delete_batch);
4073 else if (cmd == BPF_MAP_UPDATE_BATCH)
4074 BPF_DO_BATCH(map->ops->map_update_batch);
4075 else
4076 BPF_DO_BATCH(map->ops->map_delete_batch);
4077
4078err_put:
4079 fdput(f);
4080 return err;
4081}
4082
4083static int tracing_bpf_link_attach(const union bpf_attr *attr, bpfptr_t uattr,
4084 struct bpf_prog *prog)
4085{
4086 if (attr->link_create.attach_type != prog->expected_attach_type)
4087 return -EINVAL;
4088
4089 if (prog->expected_attach_type == BPF_TRACE_ITER)
4090 return bpf_iter_link_attach(attr, uattr, prog);
4091 else if (prog->type == BPF_PROG_TYPE_EXT)
4092 return bpf_tracing_prog_attach(prog,
4093 attr->link_create.target_fd,
4094 attr->link_create.target_btf_id);
4095 return -EINVAL;
4096}
4097
4098#define BPF_LINK_CREATE_LAST_FIELD link_create.iter_info_len
4099static int link_create(union bpf_attr *attr, bpfptr_t uattr)
4100{
4101 enum bpf_prog_type ptype;
4102 struct bpf_prog *prog;
4103 int ret;
4104
4105 if (CHECK_ATTR(BPF_LINK_CREATE))
4106 return -EINVAL;
4107
4108 prog = bpf_prog_get(attr->link_create.prog_fd);
4109 if (IS_ERR(prog))
4110 return PTR_ERR(prog);
4111
4112 ret = bpf_prog_attach_check_attach_type(prog,
4113 attr->link_create.attach_type);
4114 if (ret)
4115 goto out;
4116
4117 if (prog->type == BPF_PROG_TYPE_EXT) {
4118 ret = tracing_bpf_link_attach(attr, uattr, prog);
4119 goto out;
4120 }
4121
4122 ptype = attach_type_to_prog_type(attr->link_create.attach_type);
4123 if (ptype == BPF_PROG_TYPE_UNSPEC || ptype != prog->type) {
4124 ret = -EINVAL;
4125 goto out;
4126 }
4127
4128 switch (ptype) {
4129 case BPF_PROG_TYPE_CGROUP_SKB:
4130 case BPF_PROG_TYPE_CGROUP_SOCK:
4131 case BPF_PROG_TYPE_CGROUP_SOCK_ADDR:
4132 case BPF_PROG_TYPE_SOCK_OPS:
4133 case BPF_PROG_TYPE_CGROUP_DEVICE:
4134 case BPF_PROG_TYPE_CGROUP_SYSCTL:
4135 case BPF_PROG_TYPE_CGROUP_SOCKOPT:
4136 ret = cgroup_bpf_link_attach(attr, prog);
4137 break;
4138 case BPF_PROG_TYPE_TRACING:
4139 ret = tracing_bpf_link_attach(attr, uattr, prog);
4140 break;
4141 case BPF_PROG_TYPE_FLOW_DISSECTOR:
4142 case BPF_PROG_TYPE_SK_LOOKUP:
4143 ret = netns_bpf_link_create(attr, prog);
4144 break;
4145#ifdef CONFIG_NET
4146 case BPF_PROG_TYPE_XDP:
4147 ret = bpf_xdp_link_attach(attr, prog);
4148 break;
4149#endif
4150 default:
4151 ret = -EINVAL;
4152 }
4153
4154out:
4155 if (ret < 0)
4156 bpf_prog_put(prog);
4157 return ret;
4158}
4159
4160#define BPF_LINK_UPDATE_LAST_FIELD link_update.old_prog_fd
4161
4162static int link_update(union bpf_attr *attr)
4163{
4164 struct bpf_prog *old_prog = NULL, *new_prog;
4165 struct bpf_link *link;
4166 u32 flags;
4167 int ret;
4168
4169 if (CHECK_ATTR(BPF_LINK_UPDATE))
4170 return -EINVAL;
4171
4172 flags = attr->link_update.flags;
4173 if (flags & ~BPF_F_REPLACE)
4174 return -EINVAL;
4175
4176 link = bpf_link_get_from_fd(attr->link_update.link_fd);
4177 if (IS_ERR(link))
4178 return PTR_ERR(link);
4179
4180 new_prog = bpf_prog_get(attr->link_update.new_prog_fd);
4181 if (IS_ERR(new_prog)) {
4182 ret = PTR_ERR(new_prog);
4183 goto out_put_link;
4184 }
4185
4186 if (flags & BPF_F_REPLACE) {
4187 old_prog = bpf_prog_get(attr->link_update.old_prog_fd);
4188 if (IS_ERR(old_prog)) {
4189 ret = PTR_ERR(old_prog);
4190 old_prog = NULL;
4191 goto out_put_progs;
4192 }
4193 } else if (attr->link_update.old_prog_fd) {
4194 ret = -EINVAL;
4195 goto out_put_progs;
4196 }
4197
4198 if (link->ops->update_prog)
4199 ret = link->ops->update_prog(link, new_prog, old_prog);
4200 else
4201 ret = -EINVAL;
4202
4203out_put_progs:
4204 if (old_prog)
4205 bpf_prog_put(old_prog);
4206 if (ret)
4207 bpf_prog_put(new_prog);
4208out_put_link:
4209 bpf_link_put(link);
4210 return ret;
4211}
4212
4213#define BPF_LINK_DETACH_LAST_FIELD link_detach.link_fd
4214
4215static int link_detach(union bpf_attr *attr)
4216{
4217 struct bpf_link *link;
4218 int ret;
4219
4220 if (CHECK_ATTR(BPF_LINK_DETACH))
4221 return -EINVAL;
4222
4223 link = bpf_link_get_from_fd(attr->link_detach.link_fd);
4224 if (IS_ERR(link))
4225 return PTR_ERR(link);
4226
4227 if (link->ops->detach)
4228 ret = link->ops->detach(link);
4229 else
4230 ret = -EOPNOTSUPP;
4231
4232 bpf_link_put(link);
4233 return ret;
4234}
4235
4236static struct bpf_link *bpf_link_inc_not_zero(struct bpf_link *link)
4237{
4238 return atomic64_fetch_add_unless(&link->refcnt, 1, 0) ? link : ERR_PTR(-ENOENT);
4239}
4240
4241struct bpf_link *bpf_link_by_id(u32 id)
4242{
4243 struct bpf_link *link;
4244
4245 if (!id)
4246 return ERR_PTR(-ENOENT);
4247
4248 spin_lock_bh(&link_idr_lock);
4249 /* before link is "settled", ID is 0, pretend it doesn't exist yet */
4250 link = idr_find(&link_idr, id);
4251 if (link) {
4252 if (link->id)
4253 link = bpf_link_inc_not_zero(link);
4254 else
4255 link = ERR_PTR(-EAGAIN);
4256 } else {
4257 link = ERR_PTR(-ENOENT);
4258 }
4259 spin_unlock_bh(&link_idr_lock);
4260 return link;
4261}
4262
4263#define BPF_LINK_GET_FD_BY_ID_LAST_FIELD link_id
4264
4265static int bpf_link_get_fd_by_id(const union bpf_attr *attr)
4266{
4267 struct bpf_link *link;
4268 u32 id = attr->link_id;
4269 int fd;
4270
4271 if (CHECK_ATTR(BPF_LINK_GET_FD_BY_ID))
4272 return -EINVAL;
4273
4274 if (!capable(CAP_SYS_ADMIN))
4275 return -EPERM;
4276
4277 link = bpf_link_by_id(id);
4278 if (IS_ERR(link))
4279 return PTR_ERR(link);
4280
4281 fd = bpf_link_new_fd(link);
4282 if (fd < 0)
4283 bpf_link_put(link);
4284
4285 return fd;
4286}
4287
4288DEFINE_MUTEX(bpf_stats_enabled_mutex);
4289
4290static int bpf_stats_release(struct inode *inode, struct file *file)
4291{
4292 mutex_lock(&bpf_stats_enabled_mutex);
4293 static_key_slow_dec(&bpf_stats_enabled_key.key);
4294 mutex_unlock(&bpf_stats_enabled_mutex);
4295 return 0;
4296}
4297
4298static const struct file_operations bpf_stats_fops = {
4299 .release = bpf_stats_release,
4300};
4301
4302static int bpf_enable_runtime_stats(void)
4303{
4304 int fd;
4305
4306 mutex_lock(&bpf_stats_enabled_mutex);
4307
4308 /* Set a very high limit to avoid overflow */
4309 if (static_key_count(&bpf_stats_enabled_key.key) > INT_MAX / 2) {
4310 mutex_unlock(&bpf_stats_enabled_mutex);
4311 return -EBUSY;
4312 }
4313
4314 fd = anon_inode_getfd("bpf-stats", &bpf_stats_fops, NULL, O_CLOEXEC);
4315 if (fd >= 0)
4316 static_key_slow_inc(&bpf_stats_enabled_key.key);
4317
4318 mutex_unlock(&bpf_stats_enabled_mutex);
4319 return fd;
4320}
4321
4322#define BPF_ENABLE_STATS_LAST_FIELD enable_stats.type
4323
4324static int bpf_enable_stats(union bpf_attr *attr)
4325{
4326
4327 if (CHECK_ATTR(BPF_ENABLE_STATS))
4328 return -EINVAL;
4329
4330 if (!capable(CAP_SYS_ADMIN))
4331 return -EPERM;
4332
4333 switch (attr->enable_stats.type) {
4334 case BPF_STATS_RUN_TIME:
4335 return bpf_enable_runtime_stats();
4336 default:
4337 break;
4338 }
4339 return -EINVAL;
4340}
4341
4342#define BPF_ITER_CREATE_LAST_FIELD iter_create.flags
4343
4344static int bpf_iter_create(union bpf_attr *attr)
4345{
4346 struct bpf_link *link;
4347 int err;
4348
4349 if (CHECK_ATTR(BPF_ITER_CREATE))
4350 return -EINVAL;
4351
4352 if (attr->iter_create.flags)
4353 return -EINVAL;
4354
4355 link = bpf_link_get_from_fd(attr->iter_create.link_fd);
4356 if (IS_ERR(link))
4357 return PTR_ERR(link);
4358
4359 err = bpf_iter_new_fd(link);
4360 bpf_link_put(link);
4361
4362 return err;
4363}
4364
4365#define BPF_PROG_BIND_MAP_LAST_FIELD prog_bind_map.flags
4366
4367static int bpf_prog_bind_map(union bpf_attr *attr)
4368{
4369 struct bpf_prog *prog;
4370 struct bpf_map *map;
4371 struct bpf_map **used_maps_old, **used_maps_new;
4372 int i, ret = 0;
4373
4374 if (CHECK_ATTR(BPF_PROG_BIND_MAP))
4375 return -EINVAL;
4376
4377 if (attr->prog_bind_map.flags)
4378 return -EINVAL;
4379
4380 prog = bpf_prog_get(attr->prog_bind_map.prog_fd);
4381 if (IS_ERR(prog))
4382 return PTR_ERR(prog);
4383
4384 map = bpf_map_get(attr->prog_bind_map.map_fd);
4385 if (IS_ERR(map)) {
4386 ret = PTR_ERR(map);
4387 goto out_prog_put;
4388 }
4389
4390 mutex_lock(&prog->aux->used_maps_mutex);
4391
4392 used_maps_old = prog->aux->used_maps;
4393
4394 for (i = 0; i < prog->aux->used_map_cnt; i++)
4395 if (used_maps_old[i] == map) {
4396 bpf_map_put(map);
4397 goto out_unlock;
4398 }
4399
4400 used_maps_new = kmalloc_array(prog->aux->used_map_cnt + 1,
4401 sizeof(used_maps_new[0]),
4402 GFP_KERNEL);
4403 if (!used_maps_new) {
4404 ret = -ENOMEM;
4405 goto out_unlock;
4406 }
4407
4408 memcpy(used_maps_new, used_maps_old,
4409 sizeof(used_maps_old[0]) * prog->aux->used_map_cnt);
4410 used_maps_new[prog->aux->used_map_cnt] = map;
4411
4412 prog->aux->used_map_cnt++;
4413 prog->aux->used_maps = used_maps_new;
4414
4415 kfree(used_maps_old);
4416
4417out_unlock:
4418 mutex_unlock(&prog->aux->used_maps_mutex);
4419
4420 if (ret)
4421 bpf_map_put(map);
4422out_prog_put:
4423 bpf_prog_put(prog);
4424 return ret;
4425}
4426
4427static int __sys_bpf(int cmd, bpfptr_t uattr, unsigned int size)
4428{
4429 union bpf_attr attr;
4430 int err;
4431
4432 if (sysctl_unprivileged_bpf_disabled && !bpf_capable())
4433 return -EPERM;
4434
4435 err = bpf_check_uarg_tail_zero(uattr, sizeof(attr), size);
4436 if (err)
4437 return err;
4438 size = min_t(u32, size, sizeof(attr));
4439
4440 /* copy attributes from user space, may be less than sizeof(bpf_attr) */
4441 memset(&attr, 0, sizeof(attr));
4442 if (copy_from_bpfptr(&attr, uattr, size) != 0)
4443 return -EFAULT;
4444
4445 err = security_bpf(cmd, &attr, size);
4446 if (err < 0)
4447 return err;
4448
4449 switch (cmd) {
4450 case BPF_MAP_CREATE:
4451 err = map_create(&attr);
4452 break;
4453 case BPF_MAP_LOOKUP_ELEM:
4454 err = map_lookup_elem(&attr);
4455 break;
4456 case BPF_MAP_UPDATE_ELEM:
4457 err = map_update_elem(&attr, uattr);
4458 break;
4459 case BPF_MAP_DELETE_ELEM:
4460 err = map_delete_elem(&attr);
4461 break;
4462 case BPF_MAP_GET_NEXT_KEY:
4463 err = map_get_next_key(&attr);
4464 break;
4465 case BPF_MAP_FREEZE:
4466 err = map_freeze(&attr);
4467 break;
4468 case BPF_PROG_LOAD:
4469 err = bpf_prog_load(&attr, uattr);
4470 break;
4471 case BPF_OBJ_PIN:
4472 err = bpf_obj_pin(&attr);
4473 break;
4474 case BPF_OBJ_GET:
4475 err = bpf_obj_get(&attr);
4476 break;
4477 case BPF_PROG_ATTACH:
4478 err = bpf_prog_attach(&attr);
4479 break;
4480 case BPF_PROG_DETACH:
4481 err = bpf_prog_detach(&attr);
4482 break;
4483 case BPF_PROG_QUERY:
4484 err = bpf_prog_query(&attr, uattr.user);
4485 break;
4486 case BPF_PROG_TEST_RUN:
4487 err = bpf_prog_test_run(&attr, uattr.user);
4488 break;
4489 case BPF_PROG_GET_NEXT_ID:
4490 err = bpf_obj_get_next_id(&attr, uattr.user,
4491 &prog_idr, &prog_idr_lock);
4492 break;
4493 case BPF_MAP_GET_NEXT_ID:
4494 err = bpf_obj_get_next_id(&attr, uattr.user,
4495 &map_idr, &map_idr_lock);
4496 break;
4497 case BPF_BTF_GET_NEXT_ID:
4498 err = bpf_obj_get_next_id(&attr, uattr.user,
4499 &btf_idr, &btf_idr_lock);
4500 break;
4501 case BPF_PROG_GET_FD_BY_ID:
4502 err = bpf_prog_get_fd_by_id(&attr);
4503 break;
4504 case BPF_MAP_GET_FD_BY_ID:
4505 err = bpf_map_get_fd_by_id(&attr);
4506 break;
4507 case BPF_OBJ_GET_INFO_BY_FD:
4508 err = bpf_obj_get_info_by_fd(&attr, uattr.user);
4509 break;
4510 case BPF_RAW_TRACEPOINT_OPEN:
4511 err = bpf_raw_tracepoint_open(&attr);
4512 break;
4513 case BPF_BTF_LOAD:
4514 err = bpf_btf_load(&attr, uattr);
4515 break;
4516 case BPF_BTF_GET_FD_BY_ID:
4517 err = bpf_btf_get_fd_by_id(&attr);
4518 break;
4519 case BPF_TASK_FD_QUERY:
4520 err = bpf_task_fd_query(&attr, uattr.user);
4521 break;
4522 case BPF_MAP_LOOKUP_AND_DELETE_ELEM:
4523 err = map_lookup_and_delete_elem(&attr);
4524 break;
4525 case BPF_MAP_LOOKUP_BATCH:
4526 err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_LOOKUP_BATCH);
4527 break;
4528 case BPF_MAP_LOOKUP_AND_DELETE_BATCH:
4529 err = bpf_map_do_batch(&attr, uattr.user,
4530 BPF_MAP_LOOKUP_AND_DELETE_BATCH);
4531 break;
4532 case BPF_MAP_UPDATE_BATCH:
4533 err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_UPDATE_BATCH);
4534 break;
4535 case BPF_MAP_DELETE_BATCH:
4536 err = bpf_map_do_batch(&attr, uattr.user, BPF_MAP_DELETE_BATCH);
4537 break;
4538 case BPF_LINK_CREATE:
4539 err = link_create(&attr, uattr);
4540 break;
4541 case BPF_LINK_UPDATE:
4542 err = link_update(&attr);
4543 break;
4544 case BPF_LINK_GET_FD_BY_ID:
4545 err = bpf_link_get_fd_by_id(&attr);
4546 break;
4547 case BPF_LINK_GET_NEXT_ID:
4548 err = bpf_obj_get_next_id(&attr, uattr.user,
4549 &link_idr, &link_idr_lock);
4550 break;
4551 case BPF_ENABLE_STATS:
4552 err = bpf_enable_stats(&attr);
4553 break;
4554 case BPF_ITER_CREATE:
4555 err = bpf_iter_create(&attr);
4556 break;
4557 case BPF_LINK_DETACH:
4558 err = link_detach(&attr);
4559 break;
4560 case BPF_PROG_BIND_MAP:
4561 err = bpf_prog_bind_map(&attr);
4562 break;
4563 default:
4564 err = -EINVAL;
4565 break;
4566 }
4567
4568 return err;
4569}
4570
4571SYSCALL_DEFINE3(bpf, int, cmd, union bpf_attr __user *, uattr, unsigned int, size)
4572{
4573 return __sys_bpf(cmd, USER_BPFPTR(uattr), size);
4574}
4575
4576static bool syscall_prog_is_valid_access(int off, int size,
4577 enum bpf_access_type type,
4578 const struct bpf_prog *prog,
4579 struct bpf_insn_access_aux *info)
4580{
4581 if (off < 0 || off >= U16_MAX)
4582 return false;
4583 if (off % size != 0)
4584 return false;
4585 return true;
4586}
4587
4588BPF_CALL_3(bpf_sys_bpf, int, cmd, void *, attr, u32, attr_size)
4589{
4590 switch (cmd) {
4591 case BPF_MAP_CREATE:
4592 case BPF_MAP_UPDATE_ELEM:
4593 case BPF_MAP_FREEZE:
4594 case BPF_PROG_LOAD:
4595 case BPF_BTF_LOAD:
4596 break;
4597 /* case BPF_PROG_TEST_RUN:
4598 * is not part of this list to prevent recursive test_run
4599 */
4600 default:
4601 return -EINVAL;
4602 }
4603 return __sys_bpf(cmd, KERNEL_BPFPTR(attr), attr_size);
4604}
4605
4606static const struct bpf_func_proto bpf_sys_bpf_proto = {
4607 .func = bpf_sys_bpf,
4608 .gpl_only = false,
4609 .ret_type = RET_INTEGER,
4610 .arg1_type = ARG_ANYTHING,
4611 .arg2_type = ARG_PTR_TO_MEM,
4612 .arg3_type = ARG_CONST_SIZE,
4613};
4614
4615const struct bpf_func_proto * __weak
4616tracing_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
4617{
4618 return bpf_base_func_proto(func_id);
4619}
4620
4621BPF_CALL_1(bpf_sys_close, u32, fd)
4622{
4623 /* When bpf program calls this helper there should not be
4624 * an fdget() without matching completed fdput().
4625 * This helper is allowed in the following callchain only:
4626 * sys_bpf->prog_test_run->bpf_prog->bpf_sys_close
4627 */
4628 return close_fd(fd);
4629}
4630
4631static const struct bpf_func_proto bpf_sys_close_proto = {
4632 .func = bpf_sys_close,
4633 .gpl_only = false,
4634 .ret_type = RET_INTEGER,
4635 .arg1_type = ARG_ANYTHING,
4636};
4637
4638static const struct bpf_func_proto *
4639syscall_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog)
4640{
4641 switch (func_id) {
4642 case BPF_FUNC_sys_bpf:
4643 return &bpf_sys_bpf_proto;
4644 case BPF_FUNC_btf_find_by_name_kind:
4645 return &bpf_btf_find_by_name_kind_proto;
4646 case BPF_FUNC_sys_close:
4647 return &bpf_sys_close_proto;
4648 default:
4649 return tracing_prog_func_proto(func_id, prog);
4650 }
4651}
4652
4653const struct bpf_verifier_ops bpf_syscall_verifier_ops = {
4654 .get_func_proto = syscall_prog_func_proto,
4655 .is_valid_access = syscall_prog_is_valid_access,
4656};
4657
4658const struct bpf_prog_ops bpf_syscall_prog_ops = {
4659 .test_run = bpf_prog_test_run_syscall,
4660};