1 // SPDX-License-Identifier: GPL-2.0 2 /* Copyright (c) 2011-2015 PLUMgrid, http://plumgrid.com 3 * Copyright (c) 2016 Facebook 4 */ 5 #include <linux/kernel.h> 6 #include <linux/types.h> 7 #include <linux/slab.h> 8 #include <linux/bpf.h> 9 #include <linux/bpf_verifier.h> 10 #include <linux/bpf_perf_event.h> 11 #include <linux/btf.h> 12 #include <linux/filter.h> 13 #include <linux/uaccess.h> 14 #include <linux/ctype.h> 15 #include <linux/kprobes.h> 16 #include <linux/spinlock.h> 17 #include <linux/syscalls.h> 18 #include <linux/error-injection.h> 19 #include <linux/btf_ids.h> 20 #include <linux/bpf_lsm.h> 21 #include <linux/fprobe.h> 22 #include <linux/bsearch.h> 23 #include <linux/sort.h> 24 #include <linux/key.h> 25 #include <linux/verification.h> 26 #include <linux/namei.h> 27 #include <linux/fileattr.h> 28 29 #include <net/bpf_sk_storage.h> 30 31 #include <uapi/linux/bpf.h> 32 #include <uapi/linux/btf.h> 33 34 #include <asm/tlb.h> 35 36 #include "trace_probe.h" 37 #include "trace.h" 38 39 #define CREATE_TRACE_POINTS 40 #include "bpf_trace.h" 41 42 #define bpf_event_rcu_dereference(p) \ 43 rcu_dereference_protected(p, lockdep_is_held(&bpf_event_mutex)) 44 45 #define MAX_UPROBE_MULTI_CNT (1U << 20) 46 #define MAX_KPROBE_MULTI_CNT (1U << 20) 47 48 #ifdef CONFIG_MODULES 49 struct bpf_trace_module { 50 struct module *module; 51 struct list_head list; 52 }; 53 54 static LIST_HEAD(bpf_trace_modules); 55 static DEFINE_MUTEX(bpf_module_mutex); 56 57 static struct bpf_raw_event_map *bpf_get_raw_tracepoint_module(const char *name) 58 { 59 struct bpf_raw_event_map *btp, *ret = NULL; 60 struct bpf_trace_module *btm; 61 unsigned int i; 62 63 mutex_lock(&bpf_module_mutex); 64 list_for_each_entry(btm, &bpf_trace_modules, list) { 65 for (i = 0; i < btm->module->num_bpf_raw_events; ++i) { 66 btp = &btm->module->bpf_raw_events[i]; 67 if (!strcmp(btp->tp->name, name)) { 68 if (try_module_get(btm->module)) 69 ret = btp; 70 goto out; 71 } 72 } 73 } 74 out: 75 mutex_unlock(&bpf_module_mutex); 76 return ret; 77 } 78 #else 79 static struct bpf_raw_event_map *bpf_get_raw_tracepoint_module(const char *name) 80 { 81 return NULL; 82 } 83 #endif /* CONFIG_MODULES */ 84 85 u64 bpf_get_stackid(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5); 86 u64 bpf_get_stack(u64 r1, u64 r2, u64 r3, u64 r4, u64 r5); 87 88 static int bpf_btf_printf_prepare(struct btf_ptr *ptr, u32 btf_ptr_size, 89 u64 flags, const struct btf **btf, 90 s32 *btf_id); 91 static u64 bpf_kprobe_multi_cookie(struct bpf_run_ctx *ctx); 92 static u64 bpf_kprobe_multi_entry_ip(struct bpf_run_ctx *ctx); 93 94 static u64 bpf_uprobe_multi_cookie(struct bpf_run_ctx *ctx); 95 static u64 bpf_uprobe_multi_entry_ip(struct bpf_run_ctx *ctx); 96 97 /** 98 * trace_call_bpf - invoke BPF program 99 * @call: tracepoint event 100 * @ctx: opaque context pointer 101 * 102 * kprobe handlers execute BPF programs via this helper. 103 * Can be used from static tracepoints in the future. 104 * 105 * Return: BPF programs always return an integer which is interpreted by 106 * kprobe handler as: 107 * 0 - return from kprobe (event is filtered out) 108 * 1 - store kprobe event into ring buffer 109 * Other values are reserved and currently alias to 1 110 */ 111 unsigned int trace_call_bpf(struct trace_event_call *call, void *ctx) 112 { 113 unsigned int ret; 114 115 cant_sleep(); 116 117 if (unlikely(__this_cpu_inc_return(bpf_prog_active) != 1)) { 118 /* 119 * since some bpf program is already running on this cpu, 120 * don't call into another bpf program (same or different) 121 * and don't send kprobe event into ring-buffer, 122 * so return zero here 123 */ 124 rcu_read_lock(); 125 bpf_prog_inc_misses_counters(rcu_dereference(call->prog_array)); 126 rcu_read_unlock(); 127 ret = 0; 128 goto out; 129 } 130 131 /* 132 * Instead of moving rcu_read_lock/rcu_dereference/rcu_read_unlock 133 * to all call sites, we did a bpf_prog_array_valid() there to check 134 * whether call->prog_array is empty or not, which is 135 * a heuristic to speed up execution. 136 * 137 * If bpf_prog_array_valid() fetched prog_array was 138 * non-NULL, we go into trace_call_bpf() and do the actual 139 * proper rcu_dereference() under RCU lock. 140 * If it turns out that prog_array is NULL then, we bail out. 141 * For the opposite, if the bpf_prog_array_valid() fetched pointer 142 * was NULL, you'll skip the prog_array with the risk of missing 143 * out of events when it was updated in between this and the 144 * rcu_dereference() which is accepted risk. 145 */ 146 rcu_read_lock(); 147 ret = bpf_prog_run_array(rcu_dereference(call->prog_array), 148 ctx, bpf_prog_run); 149 rcu_read_unlock(); 150 151 out: 152 __this_cpu_dec(bpf_prog_active); 153 154 return ret; 155 } 156 157 #ifdef CONFIG_BPF_KPROBE_OVERRIDE 158 BPF_CALL_2(bpf_override_return, struct pt_regs *, regs, unsigned long, rc) 159 { 160 regs_set_return_value(regs, rc); 161 override_function_with_return(regs); 162 return 0; 163 } 164 165 static const struct bpf_func_proto bpf_override_return_proto = { 166 .func = bpf_override_return, 167 .gpl_only = true, 168 .ret_type = RET_INTEGER, 169 .arg1_type = ARG_PTR_TO_CTX, 170 .arg2_type = ARG_ANYTHING, 171 }; 172 #endif 173 174 static __always_inline int 175 bpf_probe_read_user_common(void *dst, u32 size, const void __user *unsafe_ptr) 176 { 177 int ret; 178 179 ret = copy_from_user_nofault(dst, unsafe_ptr, size); 180 if (unlikely(ret < 0)) 181 memset(dst, 0, size); 182 return ret; 183 } 184 185 BPF_CALL_3(bpf_probe_read_user, void *, dst, u32, size, 186 const void __user *, unsafe_ptr) 187 { 188 return bpf_probe_read_user_common(dst, size, unsafe_ptr); 189 } 190 191 const struct bpf_func_proto bpf_probe_read_user_proto = { 192 .func = bpf_probe_read_user, 193 .gpl_only = true, 194 .ret_type = RET_INTEGER, 195 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 196 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 197 .arg3_type = ARG_ANYTHING, 198 }; 199 200 static __always_inline int 201 bpf_probe_read_user_str_common(void *dst, u32 size, 202 const void __user *unsafe_ptr) 203 { 204 int ret; 205 206 /* 207 * NB: We rely on strncpy_from_user() not copying junk past the NUL 208 * terminator into `dst`. 209 * 210 * strncpy_from_user() does long-sized strides in the fast path. If the 211 * strncpy does not mask out the bytes after the NUL in `unsafe_ptr`, 212 * then there could be junk after the NUL in `dst`. If user takes `dst` 213 * and keys a hash map with it, then semantically identical strings can 214 * occupy multiple entries in the map. 215 */ 216 ret = strncpy_from_user_nofault(dst, unsafe_ptr, size); 217 if (unlikely(ret < 0)) 218 memset(dst, 0, size); 219 return ret; 220 } 221 222 BPF_CALL_3(bpf_probe_read_user_str, void *, dst, u32, size, 223 const void __user *, unsafe_ptr) 224 { 225 return bpf_probe_read_user_str_common(dst, size, unsafe_ptr); 226 } 227 228 const struct bpf_func_proto bpf_probe_read_user_str_proto = { 229 .func = bpf_probe_read_user_str, 230 .gpl_only = true, 231 .ret_type = RET_INTEGER, 232 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 233 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 234 .arg3_type = ARG_ANYTHING, 235 }; 236 237 BPF_CALL_3(bpf_probe_read_kernel, void *, dst, u32, size, 238 const void *, unsafe_ptr) 239 { 240 return bpf_probe_read_kernel_common(dst, size, unsafe_ptr); 241 } 242 243 const struct bpf_func_proto bpf_probe_read_kernel_proto = { 244 .func = bpf_probe_read_kernel, 245 .gpl_only = true, 246 .ret_type = RET_INTEGER, 247 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 248 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 249 .arg3_type = ARG_ANYTHING, 250 }; 251 252 static __always_inline int 253 bpf_probe_read_kernel_str_common(void *dst, u32 size, const void *unsafe_ptr) 254 { 255 int ret; 256 257 /* 258 * The strncpy_from_kernel_nofault() call will likely not fill the 259 * entire buffer, but that's okay in this circumstance as we're probing 260 * arbitrary memory anyway similar to bpf_probe_read_*() and might 261 * as well probe the stack. Thus, memory is explicitly cleared 262 * only in error case, so that improper users ignoring return 263 * code altogether don't copy garbage; otherwise length of string 264 * is returned that can be used for bpf_perf_event_output() et al. 265 */ 266 ret = strncpy_from_kernel_nofault(dst, unsafe_ptr, size); 267 if (unlikely(ret < 0)) 268 memset(dst, 0, size); 269 return ret; 270 } 271 272 BPF_CALL_3(bpf_probe_read_kernel_str, void *, dst, u32, size, 273 const void *, unsafe_ptr) 274 { 275 return bpf_probe_read_kernel_str_common(dst, size, unsafe_ptr); 276 } 277 278 const struct bpf_func_proto bpf_probe_read_kernel_str_proto = { 279 .func = bpf_probe_read_kernel_str, 280 .gpl_only = true, 281 .ret_type = RET_INTEGER, 282 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 283 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 284 .arg3_type = ARG_ANYTHING, 285 }; 286 287 #ifdef CONFIG_ARCH_HAS_NON_OVERLAPPING_ADDRESS_SPACE 288 BPF_CALL_3(bpf_probe_read_compat, void *, dst, u32, size, 289 const void *, unsafe_ptr) 290 { 291 if ((unsigned long)unsafe_ptr < TASK_SIZE) { 292 return bpf_probe_read_user_common(dst, size, 293 (__force void __user *)unsafe_ptr); 294 } 295 return bpf_probe_read_kernel_common(dst, size, unsafe_ptr); 296 } 297 298 static const struct bpf_func_proto bpf_probe_read_compat_proto = { 299 .func = bpf_probe_read_compat, 300 .gpl_only = true, 301 .ret_type = RET_INTEGER, 302 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 303 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 304 .arg3_type = ARG_ANYTHING, 305 }; 306 307 BPF_CALL_3(bpf_probe_read_compat_str, void *, dst, u32, size, 308 const void *, unsafe_ptr) 309 { 310 if ((unsigned long)unsafe_ptr < TASK_SIZE) { 311 return bpf_probe_read_user_str_common(dst, size, 312 (__force void __user *)unsafe_ptr); 313 } 314 return bpf_probe_read_kernel_str_common(dst, size, unsafe_ptr); 315 } 316 317 static const struct bpf_func_proto bpf_probe_read_compat_str_proto = { 318 .func = bpf_probe_read_compat_str, 319 .gpl_only = true, 320 .ret_type = RET_INTEGER, 321 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 322 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 323 .arg3_type = ARG_ANYTHING, 324 }; 325 #endif /* CONFIG_ARCH_HAS_NON_OVERLAPPING_ADDRESS_SPACE */ 326 327 BPF_CALL_3(bpf_probe_write_user, void __user *, unsafe_ptr, const void *, src, 328 u32, size) 329 { 330 /* 331 * Ensure we're in user context which is safe for the helper to 332 * run. This helper has no business in a kthread. 333 * 334 * access_ok() should prevent writing to non-user memory, but in 335 * some situations (nommu, temporary switch, etc) access_ok() does 336 * not provide enough validation, hence the check on KERNEL_DS. 337 * 338 * nmi_uaccess_okay() ensures the probe is not run in an interim 339 * state, when the task or mm are switched. This is specifically 340 * required to prevent the use of temporary mm. 341 */ 342 343 if (unlikely(in_interrupt() || 344 current->flags & (PF_KTHREAD | PF_EXITING))) 345 return -EPERM; 346 if (unlikely(!nmi_uaccess_okay())) 347 return -EPERM; 348 349 return copy_to_user_nofault(unsafe_ptr, src, size); 350 } 351 352 static const struct bpf_func_proto bpf_probe_write_user_proto = { 353 .func = bpf_probe_write_user, 354 .gpl_only = true, 355 .ret_type = RET_INTEGER, 356 .arg1_type = ARG_ANYTHING, 357 .arg2_type = ARG_PTR_TO_MEM | MEM_RDONLY, 358 .arg3_type = ARG_CONST_SIZE, 359 }; 360 361 static const struct bpf_func_proto *bpf_get_probe_write_proto(void) 362 { 363 if (!capable(CAP_SYS_ADMIN)) 364 return NULL; 365 366 pr_warn_ratelimited("%s[%d] is installing a program with bpf_probe_write_user helper that may corrupt user memory!", 367 current->comm, task_pid_nr(current)); 368 369 return &bpf_probe_write_user_proto; 370 } 371 372 #define MAX_TRACE_PRINTK_VARARGS 3 373 #define BPF_TRACE_PRINTK_SIZE 1024 374 375 BPF_CALL_5(bpf_trace_printk, char *, fmt, u32, fmt_size, u64, arg1, 376 u64, arg2, u64, arg3) 377 { 378 u64 args[MAX_TRACE_PRINTK_VARARGS] = { arg1, arg2, arg3 }; 379 struct bpf_bprintf_data data = { 380 .get_bin_args = true, 381 .get_buf = true, 382 }; 383 int ret; 384 385 ret = bpf_bprintf_prepare(fmt, fmt_size, args, 386 MAX_TRACE_PRINTK_VARARGS, &data); 387 if (ret < 0) 388 return ret; 389 390 ret = bstr_printf(data.buf, MAX_BPRINTF_BUF, fmt, data.bin_args); 391 392 trace_bpf_trace_printk(data.buf); 393 394 bpf_bprintf_cleanup(&data); 395 396 return ret; 397 } 398 399 static const struct bpf_func_proto bpf_trace_printk_proto = { 400 .func = bpf_trace_printk, 401 .gpl_only = true, 402 .ret_type = RET_INTEGER, 403 .arg1_type = ARG_PTR_TO_MEM | MEM_RDONLY, 404 .arg2_type = ARG_CONST_SIZE, 405 }; 406 407 static void __set_printk_clr_event(void) 408 { 409 /* 410 * This program might be calling bpf_trace_printk, 411 * so enable the associated bpf_trace/bpf_trace_printk event. 412 * Repeat this each time as it is possible a user has 413 * disabled bpf_trace_printk events. By loading a program 414 * calling bpf_trace_printk() however the user has expressed 415 * the intent to see such events. 416 */ 417 if (trace_set_clr_event("bpf_trace", "bpf_trace_printk", 1)) 418 pr_warn_ratelimited("could not enable bpf_trace_printk events"); 419 } 420 421 const struct bpf_func_proto *bpf_get_trace_printk_proto(void) 422 { 423 __set_printk_clr_event(); 424 return &bpf_trace_printk_proto; 425 } 426 427 BPF_CALL_4(bpf_trace_vprintk, char *, fmt, u32, fmt_size, const void *, args, 428 u32, data_len) 429 { 430 struct bpf_bprintf_data data = { 431 .get_bin_args = true, 432 .get_buf = true, 433 }; 434 int ret, num_args; 435 436 if (data_len & 7 || data_len > MAX_BPRINTF_VARARGS * 8 || 437 (data_len && !args)) 438 return -EINVAL; 439 num_args = data_len / 8; 440 441 ret = bpf_bprintf_prepare(fmt, fmt_size, args, num_args, &data); 442 if (ret < 0) 443 return ret; 444 445 ret = bstr_printf(data.buf, MAX_BPRINTF_BUF, fmt, data.bin_args); 446 447 trace_bpf_trace_printk(data.buf); 448 449 bpf_bprintf_cleanup(&data); 450 451 return ret; 452 } 453 454 static const struct bpf_func_proto bpf_trace_vprintk_proto = { 455 .func = bpf_trace_vprintk, 456 .gpl_only = true, 457 .ret_type = RET_INTEGER, 458 .arg1_type = ARG_PTR_TO_MEM | MEM_RDONLY, 459 .arg2_type = ARG_CONST_SIZE, 460 .arg3_type = ARG_PTR_TO_MEM | PTR_MAYBE_NULL | MEM_RDONLY, 461 .arg4_type = ARG_CONST_SIZE_OR_ZERO, 462 }; 463 464 const struct bpf_func_proto *bpf_get_trace_vprintk_proto(void) 465 { 466 __set_printk_clr_event(); 467 return &bpf_trace_vprintk_proto; 468 } 469 470 BPF_CALL_5(bpf_seq_printf, struct seq_file *, m, char *, fmt, u32, fmt_size, 471 const void *, args, u32, data_len) 472 { 473 struct bpf_bprintf_data data = { 474 .get_bin_args = true, 475 }; 476 int err, num_args; 477 478 if (data_len & 7 || data_len > MAX_BPRINTF_VARARGS * 8 || 479 (data_len && !args)) 480 return -EINVAL; 481 num_args = data_len / 8; 482 483 err = bpf_bprintf_prepare(fmt, fmt_size, args, num_args, &data); 484 if (err < 0) 485 return err; 486 487 seq_bprintf(m, fmt, data.bin_args); 488 489 bpf_bprintf_cleanup(&data); 490 491 return seq_has_overflowed(m) ? -EOVERFLOW : 0; 492 } 493 494 BTF_ID_LIST_SINGLE(btf_seq_file_ids, struct, seq_file) 495 496 static const struct bpf_func_proto bpf_seq_printf_proto = { 497 .func = bpf_seq_printf, 498 .gpl_only = true, 499 .ret_type = RET_INTEGER, 500 .arg1_type = ARG_PTR_TO_BTF_ID, 501 .arg1_btf_id = &btf_seq_file_ids[0], 502 .arg2_type = ARG_PTR_TO_MEM | MEM_RDONLY, 503 .arg3_type = ARG_CONST_SIZE, 504 .arg4_type = ARG_PTR_TO_MEM | PTR_MAYBE_NULL | MEM_RDONLY, 505 .arg5_type = ARG_CONST_SIZE_OR_ZERO, 506 }; 507 508 BPF_CALL_3(bpf_seq_write, struct seq_file *, m, const void *, data, u32, len) 509 { 510 return seq_write(m, data, len) ? -EOVERFLOW : 0; 511 } 512 513 static const struct bpf_func_proto bpf_seq_write_proto = { 514 .func = bpf_seq_write, 515 .gpl_only = true, 516 .ret_type = RET_INTEGER, 517 .arg1_type = ARG_PTR_TO_BTF_ID, 518 .arg1_btf_id = &btf_seq_file_ids[0], 519 .arg2_type = ARG_PTR_TO_MEM | MEM_RDONLY, 520 .arg3_type = ARG_CONST_SIZE_OR_ZERO, 521 }; 522 523 BPF_CALL_4(bpf_seq_printf_btf, struct seq_file *, m, struct btf_ptr *, ptr, 524 u32, btf_ptr_size, u64, flags) 525 { 526 const struct btf *btf; 527 s32 btf_id; 528 int ret; 529 530 ret = bpf_btf_printf_prepare(ptr, btf_ptr_size, flags, &btf, &btf_id); 531 if (ret) 532 return ret; 533 534 return btf_type_seq_show_flags(btf, btf_id, ptr->ptr, m, flags); 535 } 536 537 static const struct bpf_func_proto bpf_seq_printf_btf_proto = { 538 .func = bpf_seq_printf_btf, 539 .gpl_only = true, 540 .ret_type = RET_INTEGER, 541 .arg1_type = ARG_PTR_TO_BTF_ID, 542 .arg1_btf_id = &btf_seq_file_ids[0], 543 .arg2_type = ARG_PTR_TO_MEM | MEM_RDONLY, 544 .arg3_type = ARG_CONST_SIZE_OR_ZERO, 545 .arg4_type = ARG_ANYTHING, 546 }; 547 548 static __always_inline int 549 get_map_perf_counter(struct bpf_map *map, u64 flags, 550 u64 *value, u64 *enabled, u64 *running) 551 { 552 struct bpf_array *array = container_of(map, struct bpf_array, map); 553 unsigned int cpu = smp_processor_id(); 554 u64 index = flags & BPF_F_INDEX_MASK; 555 struct bpf_event_entry *ee; 556 557 if (unlikely(flags & ~(BPF_F_INDEX_MASK))) 558 return -EINVAL; 559 if (index == BPF_F_CURRENT_CPU) 560 index = cpu; 561 if (unlikely(index >= array->map.max_entries)) 562 return -E2BIG; 563 564 ee = READ_ONCE(array->ptrs[index]); 565 if (!ee) 566 return -ENOENT; 567 568 return perf_event_read_local(ee->event, value, enabled, running); 569 } 570 571 BPF_CALL_2(bpf_perf_event_read, struct bpf_map *, map, u64, flags) 572 { 573 u64 value = 0; 574 int err; 575 576 err = get_map_perf_counter(map, flags, &value, NULL, NULL); 577 /* 578 * this api is ugly since we miss [-22..-2] range of valid 579 * counter values, but that's uapi 580 */ 581 if (err) 582 return err; 583 return value; 584 } 585 586 static const struct bpf_func_proto bpf_perf_event_read_proto = { 587 .func = bpf_perf_event_read, 588 .gpl_only = true, 589 .ret_type = RET_INTEGER, 590 .arg1_type = ARG_CONST_MAP_PTR, 591 .arg2_type = ARG_ANYTHING, 592 }; 593 594 BPF_CALL_4(bpf_perf_event_read_value, struct bpf_map *, map, u64, flags, 595 struct bpf_perf_event_value *, buf, u32, size) 596 { 597 int err = -EINVAL; 598 599 if (unlikely(size != sizeof(struct bpf_perf_event_value))) 600 goto clear; 601 err = get_map_perf_counter(map, flags, &buf->counter, &buf->enabled, 602 &buf->running); 603 if (unlikely(err)) 604 goto clear; 605 return 0; 606 clear: 607 memset(buf, 0, size); 608 return err; 609 } 610 611 static const struct bpf_func_proto bpf_perf_event_read_value_proto = { 612 .func = bpf_perf_event_read_value, 613 .gpl_only = true, 614 .ret_type = RET_INTEGER, 615 .arg1_type = ARG_CONST_MAP_PTR, 616 .arg2_type = ARG_ANYTHING, 617 .arg3_type = ARG_PTR_TO_UNINIT_MEM, 618 .arg4_type = ARG_CONST_SIZE, 619 }; 620 621 static __always_inline u64 622 __bpf_perf_event_output(struct pt_regs *regs, struct bpf_map *map, 623 u64 flags, struct perf_sample_data *sd) 624 { 625 struct bpf_array *array = container_of(map, struct bpf_array, map); 626 unsigned int cpu = smp_processor_id(); 627 u64 index = flags & BPF_F_INDEX_MASK; 628 struct bpf_event_entry *ee; 629 struct perf_event *event; 630 631 if (index == BPF_F_CURRENT_CPU) 632 index = cpu; 633 if (unlikely(index >= array->map.max_entries)) 634 return -E2BIG; 635 636 ee = READ_ONCE(array->ptrs[index]); 637 if (!ee) 638 return -ENOENT; 639 640 event = ee->event; 641 if (unlikely(event->attr.type != PERF_TYPE_SOFTWARE || 642 event->attr.config != PERF_COUNT_SW_BPF_OUTPUT)) 643 return -EINVAL; 644 645 if (unlikely(event->oncpu != cpu)) 646 return -EOPNOTSUPP; 647 648 return perf_event_output(event, sd, regs); 649 } 650 651 /* 652 * Support executing tracepoints in normal, irq, and nmi context that each call 653 * bpf_perf_event_output 654 */ 655 struct bpf_trace_sample_data { 656 struct perf_sample_data sds[3]; 657 }; 658 659 static DEFINE_PER_CPU(struct bpf_trace_sample_data, bpf_trace_sds); 660 static DEFINE_PER_CPU(int, bpf_trace_nest_level); 661 BPF_CALL_5(bpf_perf_event_output, struct pt_regs *, regs, struct bpf_map *, map, 662 u64, flags, void *, data, u64, size) 663 { 664 struct bpf_trace_sample_data *sds; 665 struct perf_raw_record raw = { 666 .frag = { 667 .size = size, 668 .data = data, 669 }, 670 }; 671 struct perf_sample_data *sd; 672 int nest_level, err; 673 674 preempt_disable(); 675 sds = this_cpu_ptr(&bpf_trace_sds); 676 nest_level = this_cpu_inc_return(bpf_trace_nest_level); 677 678 if (WARN_ON_ONCE(nest_level > ARRAY_SIZE(sds->sds))) { 679 err = -EBUSY; 680 goto out; 681 } 682 683 sd = &sds->sds[nest_level - 1]; 684 685 if (unlikely(flags & ~(BPF_F_INDEX_MASK))) { 686 err = -EINVAL; 687 goto out; 688 } 689 690 perf_sample_data_init(sd, 0, 0); 691 perf_sample_save_raw_data(sd, &raw); 692 693 err = __bpf_perf_event_output(regs, map, flags, sd); 694 out: 695 this_cpu_dec(bpf_trace_nest_level); 696 preempt_enable(); 697 return err; 698 } 699 700 static const struct bpf_func_proto bpf_perf_event_output_proto = { 701 .func = bpf_perf_event_output, 702 .gpl_only = true, 703 .ret_type = RET_INTEGER, 704 .arg1_type = ARG_PTR_TO_CTX, 705 .arg2_type = ARG_CONST_MAP_PTR, 706 .arg3_type = ARG_ANYTHING, 707 .arg4_type = ARG_PTR_TO_MEM | MEM_RDONLY, 708 .arg5_type = ARG_CONST_SIZE_OR_ZERO, 709 }; 710 711 static DEFINE_PER_CPU(int, bpf_event_output_nest_level); 712 struct bpf_nested_pt_regs { 713 struct pt_regs regs[3]; 714 }; 715 static DEFINE_PER_CPU(struct bpf_nested_pt_regs, bpf_pt_regs); 716 static DEFINE_PER_CPU(struct bpf_trace_sample_data, bpf_misc_sds); 717 718 u64 bpf_event_output(struct bpf_map *map, u64 flags, void *meta, u64 meta_size, 719 void *ctx, u64 ctx_size, bpf_ctx_copy_t ctx_copy) 720 { 721 struct perf_raw_frag frag = { 722 .copy = ctx_copy, 723 .size = ctx_size, 724 .data = ctx, 725 }; 726 struct perf_raw_record raw = { 727 .frag = { 728 { 729 .next = ctx_size ? &frag : NULL, 730 }, 731 .size = meta_size, 732 .data = meta, 733 }, 734 }; 735 struct perf_sample_data *sd; 736 struct pt_regs *regs; 737 int nest_level; 738 u64 ret; 739 740 preempt_disable(); 741 nest_level = this_cpu_inc_return(bpf_event_output_nest_level); 742 743 if (WARN_ON_ONCE(nest_level > ARRAY_SIZE(bpf_misc_sds.sds))) { 744 ret = -EBUSY; 745 goto out; 746 } 747 sd = this_cpu_ptr(&bpf_misc_sds.sds[nest_level - 1]); 748 regs = this_cpu_ptr(&bpf_pt_regs.regs[nest_level - 1]); 749 750 perf_fetch_caller_regs(regs); 751 perf_sample_data_init(sd, 0, 0); 752 perf_sample_save_raw_data(sd, &raw); 753 754 ret = __bpf_perf_event_output(regs, map, flags, sd); 755 out: 756 this_cpu_dec(bpf_event_output_nest_level); 757 preempt_enable(); 758 return ret; 759 } 760 761 BPF_CALL_0(bpf_get_current_task) 762 { 763 return (long) current; 764 } 765 766 const struct bpf_func_proto bpf_get_current_task_proto = { 767 .func = bpf_get_current_task, 768 .gpl_only = true, 769 .ret_type = RET_INTEGER, 770 }; 771 772 BPF_CALL_0(bpf_get_current_task_btf) 773 { 774 return (unsigned long) current; 775 } 776 777 const struct bpf_func_proto bpf_get_current_task_btf_proto = { 778 .func = bpf_get_current_task_btf, 779 .gpl_only = true, 780 .ret_type = RET_PTR_TO_BTF_ID_TRUSTED, 781 .ret_btf_id = &btf_tracing_ids[BTF_TRACING_TYPE_TASK], 782 }; 783 784 BPF_CALL_1(bpf_task_pt_regs, struct task_struct *, task) 785 { 786 return (unsigned long) task_pt_regs(task); 787 } 788 789 BTF_ID_LIST(bpf_task_pt_regs_ids) 790 BTF_ID(struct, pt_regs) 791 792 const struct bpf_func_proto bpf_task_pt_regs_proto = { 793 .func = bpf_task_pt_regs, 794 .gpl_only = true, 795 .arg1_type = ARG_PTR_TO_BTF_ID, 796 .arg1_btf_id = &btf_tracing_ids[BTF_TRACING_TYPE_TASK], 797 .ret_type = RET_PTR_TO_BTF_ID, 798 .ret_btf_id = &bpf_task_pt_regs_ids[0], 799 }; 800 801 BPF_CALL_2(bpf_current_task_under_cgroup, struct bpf_map *, map, u32, idx) 802 { 803 struct bpf_array *array = container_of(map, struct bpf_array, map); 804 struct cgroup *cgrp; 805 806 if (unlikely(idx >= array->map.max_entries)) 807 return -E2BIG; 808 809 cgrp = READ_ONCE(array->ptrs[idx]); 810 if (unlikely(!cgrp)) 811 return -EAGAIN; 812 813 return task_under_cgroup_hierarchy(current, cgrp); 814 } 815 816 static const struct bpf_func_proto bpf_current_task_under_cgroup_proto = { 817 .func = bpf_current_task_under_cgroup, 818 .gpl_only = false, 819 .ret_type = RET_INTEGER, 820 .arg1_type = ARG_CONST_MAP_PTR, 821 .arg2_type = ARG_ANYTHING, 822 }; 823 824 struct send_signal_irq_work { 825 struct irq_work irq_work; 826 struct task_struct *task; 827 u32 sig; 828 enum pid_type type; 829 }; 830 831 static DEFINE_PER_CPU(struct send_signal_irq_work, send_signal_work); 832 833 static void do_bpf_send_signal(struct irq_work *entry) 834 { 835 struct send_signal_irq_work *work; 836 837 work = container_of(entry, struct send_signal_irq_work, irq_work); 838 group_send_sig_info(work->sig, SEND_SIG_PRIV, work->task, work->type); 839 put_task_struct(work->task); 840 } 841 842 static int bpf_send_signal_common(u32 sig, enum pid_type type) 843 { 844 struct send_signal_irq_work *work = NULL; 845 846 /* Similar to bpf_probe_write_user, task needs to be 847 * in a sound condition and kernel memory access be 848 * permitted in order to send signal to the current 849 * task. 850 */ 851 if (unlikely(current->flags & (PF_KTHREAD | PF_EXITING))) 852 return -EPERM; 853 if (unlikely(!nmi_uaccess_okay())) 854 return -EPERM; 855 /* Task should not be pid=1 to avoid kernel panic. */ 856 if (unlikely(is_global_init(current))) 857 return -EPERM; 858 859 if (irqs_disabled()) { 860 /* Do an early check on signal validity. Otherwise, 861 * the error is lost in deferred irq_work. 862 */ 863 if (unlikely(!valid_signal(sig))) 864 return -EINVAL; 865 866 work = this_cpu_ptr(&send_signal_work); 867 if (irq_work_is_busy(&work->irq_work)) 868 return -EBUSY; 869 870 /* Add the current task, which is the target of sending signal, 871 * to the irq_work. The current task may change when queued 872 * irq works get executed. 873 */ 874 work->task = get_task_struct(current); 875 work->sig = sig; 876 work->type = type; 877 irq_work_queue(&work->irq_work); 878 return 0; 879 } 880 881 return group_send_sig_info(sig, SEND_SIG_PRIV, current, type); 882 } 883 884 BPF_CALL_1(bpf_send_signal, u32, sig) 885 { 886 return bpf_send_signal_common(sig, PIDTYPE_TGID); 887 } 888 889 static const struct bpf_func_proto bpf_send_signal_proto = { 890 .func = bpf_send_signal, 891 .gpl_only = false, 892 .ret_type = RET_INTEGER, 893 .arg1_type = ARG_ANYTHING, 894 }; 895 896 BPF_CALL_1(bpf_send_signal_thread, u32, sig) 897 { 898 return bpf_send_signal_common(sig, PIDTYPE_PID); 899 } 900 901 static const struct bpf_func_proto bpf_send_signal_thread_proto = { 902 .func = bpf_send_signal_thread, 903 .gpl_only = false, 904 .ret_type = RET_INTEGER, 905 .arg1_type = ARG_ANYTHING, 906 }; 907 908 BPF_CALL_3(bpf_d_path, struct path *, path, char *, buf, u32, sz) 909 { 910 struct path copy; 911 long len; 912 char *p; 913 914 if (!sz) 915 return 0; 916 917 /* 918 * The path pointer is verified as trusted and safe to use, 919 * but let's double check it's valid anyway to workaround 920 * potentially broken verifier. 921 */ 922 len = copy_from_kernel_nofault(©, path, sizeof(*path)); 923 if (len < 0) 924 return len; 925 926 p = d_path(©, buf, sz); 927 if (IS_ERR(p)) { 928 len = PTR_ERR(p); 929 } else { 930 len = buf + sz - p; 931 memmove(buf, p, len); 932 } 933 934 return len; 935 } 936 937 BTF_SET_START(btf_allowlist_d_path) 938 #ifdef CONFIG_SECURITY 939 BTF_ID(func, security_file_permission) 940 BTF_ID(func, security_inode_getattr) 941 BTF_ID(func, security_file_open) 942 #endif 943 #ifdef CONFIG_SECURITY_PATH 944 BTF_ID(func, security_path_truncate) 945 #endif 946 BTF_ID(func, vfs_truncate) 947 BTF_ID(func, vfs_fallocate) 948 BTF_ID(func, dentry_open) 949 BTF_ID(func, vfs_getattr) 950 BTF_ID(func, filp_close) 951 BTF_SET_END(btf_allowlist_d_path) 952 953 static bool bpf_d_path_allowed(const struct bpf_prog *prog) 954 { 955 if (prog->type == BPF_PROG_TYPE_TRACING && 956 prog->expected_attach_type == BPF_TRACE_ITER) 957 return true; 958 959 if (prog->type == BPF_PROG_TYPE_LSM) 960 return bpf_lsm_is_sleepable_hook(prog->aux->attach_btf_id); 961 962 return btf_id_set_contains(&btf_allowlist_d_path, 963 prog->aux->attach_btf_id); 964 } 965 966 BTF_ID_LIST_SINGLE(bpf_d_path_btf_ids, struct, path) 967 968 static const struct bpf_func_proto bpf_d_path_proto = { 969 .func = bpf_d_path, 970 .gpl_only = false, 971 .ret_type = RET_INTEGER, 972 .arg1_type = ARG_PTR_TO_BTF_ID, 973 .arg1_btf_id = &bpf_d_path_btf_ids[0], 974 .arg2_type = ARG_PTR_TO_MEM, 975 .arg3_type = ARG_CONST_SIZE_OR_ZERO, 976 .allowed = bpf_d_path_allowed, 977 }; 978 979 #define BTF_F_ALL (BTF_F_COMPACT | BTF_F_NONAME | \ 980 BTF_F_PTR_RAW | BTF_F_ZERO) 981 982 static int bpf_btf_printf_prepare(struct btf_ptr *ptr, u32 btf_ptr_size, 983 u64 flags, const struct btf **btf, 984 s32 *btf_id) 985 { 986 const struct btf_type *t; 987 988 if (unlikely(flags & ~(BTF_F_ALL))) 989 return -EINVAL; 990 991 if (btf_ptr_size != sizeof(struct btf_ptr)) 992 return -EINVAL; 993 994 *btf = bpf_get_btf_vmlinux(); 995 996 if (IS_ERR_OR_NULL(*btf)) 997 return IS_ERR(*btf) ? PTR_ERR(*btf) : -EINVAL; 998 999 if (ptr->type_id > 0) 1000 *btf_id = ptr->type_id; 1001 else 1002 return -EINVAL; 1003 1004 if (*btf_id > 0) 1005 t = btf_type_by_id(*btf, *btf_id); 1006 if (*btf_id <= 0 || !t) 1007 return -ENOENT; 1008 1009 return 0; 1010 } 1011 1012 BPF_CALL_5(bpf_snprintf_btf, char *, str, u32, str_size, struct btf_ptr *, ptr, 1013 u32, btf_ptr_size, u64, flags) 1014 { 1015 const struct btf *btf; 1016 s32 btf_id; 1017 int ret; 1018 1019 ret = bpf_btf_printf_prepare(ptr, btf_ptr_size, flags, &btf, &btf_id); 1020 if (ret) 1021 return ret; 1022 1023 return btf_type_snprintf_show(btf, btf_id, ptr->ptr, str, str_size, 1024 flags); 1025 } 1026 1027 const struct bpf_func_proto bpf_snprintf_btf_proto = { 1028 .func = bpf_snprintf_btf, 1029 .gpl_only = false, 1030 .ret_type = RET_INTEGER, 1031 .arg1_type = ARG_PTR_TO_MEM, 1032 .arg2_type = ARG_CONST_SIZE, 1033 .arg3_type = ARG_PTR_TO_MEM | MEM_RDONLY, 1034 .arg4_type = ARG_CONST_SIZE, 1035 .arg5_type = ARG_ANYTHING, 1036 }; 1037 1038 BPF_CALL_1(bpf_get_func_ip_tracing, void *, ctx) 1039 { 1040 /* This helper call is inlined by verifier. */ 1041 return ((u64 *)ctx)[-2]; 1042 } 1043 1044 static const struct bpf_func_proto bpf_get_func_ip_proto_tracing = { 1045 .func = bpf_get_func_ip_tracing, 1046 .gpl_only = true, 1047 .ret_type = RET_INTEGER, 1048 .arg1_type = ARG_PTR_TO_CTX, 1049 }; 1050 1051 #ifdef CONFIG_X86_KERNEL_IBT 1052 static unsigned long get_entry_ip(unsigned long fentry_ip) 1053 { 1054 u32 instr; 1055 1056 /* We want to be extra safe in case entry ip is on the page edge, 1057 * but otherwise we need to avoid get_kernel_nofault()'s overhead. 1058 */ 1059 if ((fentry_ip & ~PAGE_MASK) < ENDBR_INSN_SIZE) { 1060 if (get_kernel_nofault(instr, (u32 *)(fentry_ip - ENDBR_INSN_SIZE))) 1061 return fentry_ip; 1062 } else { 1063 instr = *(u32 *)(fentry_ip - ENDBR_INSN_SIZE); 1064 } 1065 if (is_endbr(instr)) 1066 fentry_ip -= ENDBR_INSN_SIZE; 1067 return fentry_ip; 1068 } 1069 #else 1070 #define get_entry_ip(fentry_ip) fentry_ip 1071 #endif 1072 1073 BPF_CALL_1(bpf_get_func_ip_kprobe, struct pt_regs *, regs) 1074 { 1075 struct bpf_trace_run_ctx *run_ctx __maybe_unused; 1076 struct kprobe *kp; 1077 1078 #ifdef CONFIG_UPROBES 1079 run_ctx = container_of(current->bpf_ctx, struct bpf_trace_run_ctx, run_ctx); 1080 if (run_ctx->is_uprobe) 1081 return ((struct uprobe_dispatch_data *)current->utask->vaddr)->bp_addr; 1082 #endif 1083 1084 kp = kprobe_running(); 1085 1086 if (!kp || !(kp->flags & KPROBE_FLAG_ON_FUNC_ENTRY)) 1087 return 0; 1088 1089 return get_entry_ip((uintptr_t)kp->addr); 1090 } 1091 1092 static const struct bpf_func_proto bpf_get_func_ip_proto_kprobe = { 1093 .func = bpf_get_func_ip_kprobe, 1094 .gpl_only = true, 1095 .ret_type = RET_INTEGER, 1096 .arg1_type = ARG_PTR_TO_CTX, 1097 }; 1098 1099 BPF_CALL_1(bpf_get_func_ip_kprobe_multi, struct pt_regs *, regs) 1100 { 1101 return bpf_kprobe_multi_entry_ip(current->bpf_ctx); 1102 } 1103 1104 static const struct bpf_func_proto bpf_get_func_ip_proto_kprobe_multi = { 1105 .func = bpf_get_func_ip_kprobe_multi, 1106 .gpl_only = false, 1107 .ret_type = RET_INTEGER, 1108 .arg1_type = ARG_PTR_TO_CTX, 1109 }; 1110 1111 BPF_CALL_1(bpf_get_attach_cookie_kprobe_multi, struct pt_regs *, regs) 1112 { 1113 return bpf_kprobe_multi_cookie(current->bpf_ctx); 1114 } 1115 1116 static const struct bpf_func_proto bpf_get_attach_cookie_proto_kmulti = { 1117 .func = bpf_get_attach_cookie_kprobe_multi, 1118 .gpl_only = false, 1119 .ret_type = RET_INTEGER, 1120 .arg1_type = ARG_PTR_TO_CTX, 1121 }; 1122 1123 BPF_CALL_1(bpf_get_func_ip_uprobe_multi, struct pt_regs *, regs) 1124 { 1125 return bpf_uprobe_multi_entry_ip(current->bpf_ctx); 1126 } 1127 1128 static const struct bpf_func_proto bpf_get_func_ip_proto_uprobe_multi = { 1129 .func = bpf_get_func_ip_uprobe_multi, 1130 .gpl_only = false, 1131 .ret_type = RET_INTEGER, 1132 .arg1_type = ARG_PTR_TO_CTX, 1133 }; 1134 1135 BPF_CALL_1(bpf_get_attach_cookie_uprobe_multi, struct pt_regs *, regs) 1136 { 1137 return bpf_uprobe_multi_cookie(current->bpf_ctx); 1138 } 1139 1140 static const struct bpf_func_proto bpf_get_attach_cookie_proto_umulti = { 1141 .func = bpf_get_attach_cookie_uprobe_multi, 1142 .gpl_only = false, 1143 .ret_type = RET_INTEGER, 1144 .arg1_type = ARG_PTR_TO_CTX, 1145 }; 1146 1147 BPF_CALL_1(bpf_get_attach_cookie_trace, void *, ctx) 1148 { 1149 struct bpf_trace_run_ctx *run_ctx; 1150 1151 run_ctx = container_of(current->bpf_ctx, struct bpf_trace_run_ctx, run_ctx); 1152 return run_ctx->bpf_cookie; 1153 } 1154 1155 static const struct bpf_func_proto bpf_get_attach_cookie_proto_trace = { 1156 .func = bpf_get_attach_cookie_trace, 1157 .gpl_only = false, 1158 .ret_type = RET_INTEGER, 1159 .arg1_type = ARG_PTR_TO_CTX, 1160 }; 1161 1162 BPF_CALL_1(bpf_get_attach_cookie_pe, struct bpf_perf_event_data_kern *, ctx) 1163 { 1164 return ctx->event->bpf_cookie; 1165 } 1166 1167 static const struct bpf_func_proto bpf_get_attach_cookie_proto_pe = { 1168 .func = bpf_get_attach_cookie_pe, 1169 .gpl_only = false, 1170 .ret_type = RET_INTEGER, 1171 .arg1_type = ARG_PTR_TO_CTX, 1172 }; 1173 1174 BPF_CALL_1(bpf_get_attach_cookie_tracing, void *, ctx) 1175 { 1176 struct bpf_trace_run_ctx *run_ctx; 1177 1178 run_ctx = container_of(current->bpf_ctx, struct bpf_trace_run_ctx, run_ctx); 1179 return run_ctx->bpf_cookie; 1180 } 1181 1182 static const struct bpf_func_proto bpf_get_attach_cookie_proto_tracing = { 1183 .func = bpf_get_attach_cookie_tracing, 1184 .gpl_only = false, 1185 .ret_type = RET_INTEGER, 1186 .arg1_type = ARG_PTR_TO_CTX, 1187 }; 1188 1189 BPF_CALL_3(bpf_get_branch_snapshot, void *, buf, u32, size, u64, flags) 1190 { 1191 static const u32 br_entry_size = sizeof(struct perf_branch_entry); 1192 u32 entry_cnt = size / br_entry_size; 1193 1194 entry_cnt = static_call(perf_snapshot_branch_stack)(buf, entry_cnt); 1195 1196 if (unlikely(flags)) 1197 return -EINVAL; 1198 1199 if (!entry_cnt) 1200 return -ENOENT; 1201 1202 return entry_cnt * br_entry_size; 1203 } 1204 1205 static const struct bpf_func_proto bpf_get_branch_snapshot_proto = { 1206 .func = bpf_get_branch_snapshot, 1207 .gpl_only = true, 1208 .ret_type = RET_INTEGER, 1209 .arg1_type = ARG_PTR_TO_UNINIT_MEM, 1210 .arg2_type = ARG_CONST_SIZE_OR_ZERO, 1211 }; 1212 1213 BPF_CALL_3(get_func_arg, void *, ctx, u32, n, u64 *, value) 1214 { 1215 /* This helper call is inlined by verifier. */ 1216 u64 nr_args = ((u64 *)ctx)[-1]; 1217 1218 if ((u64) n >= nr_args) 1219 return -EINVAL; 1220 *value = ((u64 *)ctx)[n]; 1221 return 0; 1222 } 1223 1224 static const struct bpf_func_proto bpf_get_func_arg_proto = { 1225 .func = get_func_arg, 1226 .ret_type = RET_INTEGER, 1227 .arg1_type = ARG_PTR_TO_CTX, 1228 .arg2_type = ARG_ANYTHING, 1229 .arg3_type = ARG_PTR_TO_LONG, 1230 }; 1231 1232 BPF_CALL_2(get_func_ret, void *, ctx, u64 *, value) 1233 { 1234 /* This helper call is inlined by verifier. */ 1235 u64 nr_args = ((u64 *)ctx)[-1]; 1236 1237 *value = ((u64 *)ctx)[nr_args]; 1238 return 0; 1239 } 1240 1241 static const struct bpf_func_proto bpf_get_func_ret_proto = { 1242 .func = get_func_ret, 1243 .ret_type = RET_INTEGER, 1244 .arg1_type = ARG_PTR_TO_CTX, 1245 .arg2_type = ARG_PTR_TO_LONG, 1246 }; 1247 1248 BPF_CALL_1(get_func_arg_cnt, void *, ctx) 1249 { 1250 /* This helper call is inlined by verifier. */ 1251 return ((u64 *)ctx)[-1]; 1252 } 1253 1254 static const struct bpf_func_proto bpf_get_func_arg_cnt_proto = { 1255 .func = get_func_arg_cnt, 1256 .ret_type = RET_INTEGER, 1257 .arg1_type = ARG_PTR_TO_CTX, 1258 }; 1259 1260 #ifdef CONFIG_KEYS 1261 __bpf_kfunc_start_defs(); 1262 1263 /** 1264 * bpf_lookup_user_key - lookup a key by its serial 1265 * @serial: key handle serial number 1266 * @flags: lookup-specific flags 1267 * 1268 * Search a key with a given *serial* and the provided *flags*. 1269 * If found, increment the reference count of the key by one, and 1270 * return it in the bpf_key structure. 1271 * 1272 * The bpf_key structure must be passed to bpf_key_put() when done 1273 * with it, so that the key reference count is decremented and the 1274 * bpf_key structure is freed. 1275 * 1276 * Permission checks are deferred to the time the key is used by 1277 * one of the available key-specific kfuncs. 1278 * 1279 * Set *flags* with KEY_LOOKUP_CREATE, to attempt creating a requested 1280 * special keyring (e.g. session keyring), if it doesn't yet exist. 1281 * Set *flags* with KEY_LOOKUP_PARTIAL, to lookup a key without waiting 1282 * for the key construction, and to retrieve uninstantiated keys (keys 1283 * without data attached to them). 1284 * 1285 * Return: a bpf_key pointer with a valid key pointer if the key is found, a 1286 * NULL pointer otherwise. 1287 */ 1288 __bpf_kfunc struct bpf_key *bpf_lookup_user_key(u32 serial, u64 flags) 1289 { 1290 key_ref_t key_ref; 1291 struct bpf_key *bkey; 1292 1293 if (flags & ~KEY_LOOKUP_ALL) 1294 return NULL; 1295 1296 /* 1297 * Permission check is deferred until the key is used, as the 1298 * intent of the caller is unknown here. 1299 */ 1300 key_ref = lookup_user_key(serial, flags, KEY_DEFER_PERM_CHECK); 1301 if (IS_ERR(key_ref)) 1302 return NULL; 1303 1304 bkey = kmalloc(sizeof(*bkey), GFP_KERNEL); 1305 if (!bkey) { 1306 key_put(key_ref_to_ptr(key_ref)); 1307 return NULL; 1308 } 1309 1310 bkey->key = key_ref_to_ptr(key_ref); 1311 bkey->has_ref = true; 1312 1313 return bkey; 1314 } 1315 1316 /** 1317 * bpf_lookup_system_key - lookup a key by a system-defined ID 1318 * @id: key ID 1319 * 1320 * Obtain a bpf_key structure with a key pointer set to the passed key ID. 1321 * The key pointer is marked as invalid, to prevent bpf_key_put() from 1322 * attempting to decrement the key reference count on that pointer. The key 1323 * pointer set in such way is currently understood only by 1324 * verify_pkcs7_signature(). 1325 * 1326 * Set *id* to one of the values defined in include/linux/verification.h: 1327 * 0 for the primary keyring (immutable keyring of system keys); 1328 * VERIFY_USE_SECONDARY_KEYRING for both the primary and secondary keyring 1329 * (where keys can be added only if they are vouched for by existing keys 1330 * in those keyrings); VERIFY_USE_PLATFORM_KEYRING for the platform 1331 * keyring (primarily used by the integrity subsystem to verify a kexec'ed 1332 * kerned image and, possibly, the initramfs signature). 1333 * 1334 * Return: a bpf_key pointer with an invalid key pointer set from the 1335 * pre-determined ID on success, a NULL pointer otherwise 1336 */ 1337 __bpf_kfunc struct bpf_key *bpf_lookup_system_key(u64 id) 1338 { 1339 struct bpf_key *bkey; 1340 1341 if (system_keyring_id_check(id) < 0) 1342 return NULL; 1343 1344 bkey = kmalloc(sizeof(*bkey), GFP_ATOMIC); 1345 if (!bkey) 1346 return NULL; 1347 1348 bkey->key = (struct key *)(unsigned long)id; 1349 bkey->has_ref = false; 1350 1351 return bkey; 1352 } 1353 1354 /** 1355 * bpf_key_put - decrement key reference count if key is valid and free bpf_key 1356 * @bkey: bpf_key structure 1357 * 1358 * Decrement the reference count of the key inside *bkey*, if the pointer 1359 * is valid, and free *bkey*. 1360 */ 1361 __bpf_kfunc void bpf_key_put(struct bpf_key *bkey) 1362 { 1363 if (bkey->has_ref) 1364 key_put(bkey->key); 1365 1366 kfree(bkey); 1367 } 1368 1369 #ifdef CONFIG_SYSTEM_DATA_VERIFICATION 1370 /** 1371 * bpf_verify_pkcs7_signature - verify a PKCS#7 signature 1372 * @data_ptr: data to verify 1373 * @sig_ptr: signature of the data 1374 * @trusted_keyring: keyring with keys trusted for signature verification 1375 * 1376 * Verify the PKCS#7 signature *sig_ptr* against the supplied *data_ptr* 1377 * with keys in a keyring referenced by *trusted_keyring*. 1378 * 1379 * Return: 0 on success, a negative value on error. 1380 */ 1381 __bpf_kfunc int bpf_verify_pkcs7_signature(struct bpf_dynptr_kern *data_ptr, 1382 struct bpf_dynptr_kern *sig_ptr, 1383 struct bpf_key *trusted_keyring) 1384 { 1385 const void *data, *sig; 1386 u32 data_len, sig_len; 1387 int ret; 1388 1389 if (trusted_keyring->has_ref) { 1390 /* 1391 * Do the permission check deferred in bpf_lookup_user_key(). 1392 * See bpf_lookup_user_key() for more details. 1393 * 1394 * A call to key_task_permission() here would be redundant, as 1395 * it is already done by keyring_search() called by 1396 * find_asymmetric_key(). 1397 */ 1398 ret = key_validate(trusted_keyring->key); 1399 if (ret < 0) 1400 return ret; 1401 } 1402 1403 data_len = __bpf_dynptr_size(data_ptr); 1404 data = __bpf_dynptr_data(data_ptr, data_len); 1405 sig_len = __bpf_dynptr_size(sig_ptr); 1406 sig = __bpf_dynptr_data(sig_ptr, sig_len); 1407 1408 return verify_pkcs7_signature(data, data_len, sig, sig_len, 1409 trusted_keyring->key, 1410 VERIFYING_UNSPECIFIED_SIGNATURE, NULL, 1411 NULL); 1412 } 1413 #endif /* CONFIG_SYSTEM_DATA_VERIFICATION */ 1414 1415 __bpf_kfunc_end_defs(); 1416 1417 BTF_KFUNCS_START(key_sig_kfunc_set) 1418 BTF_ID_FLAGS(func, bpf_lookup_user_key, KF_ACQUIRE | KF_RET_NULL | KF_SLEEPABLE) 1419 BTF_ID_FLAGS(func, bpf_lookup_system_key, KF_ACQUIRE | KF_RET_NULL) 1420 BTF_ID_FLAGS(func, bpf_key_put, KF_RELEASE) 1421 #ifdef CONFIG_SYSTEM_DATA_VERIFICATION 1422 BTF_ID_FLAGS(func, bpf_verify_pkcs7_signature, KF_SLEEPABLE) 1423 #endif 1424 BTF_KFUNCS_END(key_sig_kfunc_set) 1425 1426 static const struct btf_kfunc_id_set bpf_key_sig_kfunc_set = { 1427 .owner = THIS_MODULE, 1428 .set = &key_sig_kfunc_set, 1429 }; 1430 1431 static int __init bpf_key_sig_kfuncs_init(void) 1432 { 1433 return register_btf_kfunc_id_set(BPF_PROG_TYPE_TRACING, 1434 &bpf_key_sig_kfunc_set); 1435 } 1436 1437 late_initcall(bpf_key_sig_kfuncs_init); 1438 #endif /* CONFIG_KEYS */ 1439 1440 /* filesystem kfuncs */ 1441 __bpf_kfunc_start_defs(); 1442 1443 /** 1444 * bpf_get_file_xattr - get xattr of a file 1445 * @file: file to get xattr from 1446 * @name__str: name of the xattr 1447 * @value_ptr: output buffer of the xattr value 1448 * 1449 * Get xattr *name__str* of *file* and store the output in *value_ptr*. 1450 * 1451 * For security reasons, only *name__str* with prefix "user." is allowed. 1452 * 1453 * Return: 0 on success, a negative value on error. 1454 */ 1455 __bpf_kfunc int bpf_get_file_xattr(struct file *file, const char *name__str, 1456 struct bpf_dynptr_kern *value_ptr) 1457 { 1458 struct dentry *dentry; 1459 u32 value_len; 1460 void *value; 1461 int ret; 1462 1463 if (strncmp(name__str, XATTR_USER_PREFIX, XATTR_USER_PREFIX_LEN)) 1464 return -EPERM; 1465 1466 value_len = __bpf_dynptr_size(value_ptr); 1467 value = __bpf_dynptr_data_rw(value_ptr, value_len); 1468 if (!value) 1469 return -EINVAL; 1470 1471 dentry = file_dentry(file); 1472 ret = inode_permission(&nop_mnt_idmap, dentry->d_inode, MAY_READ); 1473 if (ret) 1474 return ret; 1475 return __vfs_getxattr(dentry, dentry->d_inode, name__str, value, value_len); 1476 } 1477 1478 __bpf_kfunc_end_defs(); 1479 1480 BTF_KFUNCS_START(fs_kfunc_set_ids) 1481 BTF_ID_FLAGS(func, bpf_get_file_xattr, KF_SLEEPABLE | KF_TRUSTED_ARGS) 1482 BTF_KFUNCS_END(fs_kfunc_set_ids) 1483 1484 static int bpf_get_file_xattr_filter(const struct bpf_prog *prog, u32 kfunc_id) 1485 { 1486 if (!btf_id_set8_contains(&fs_kfunc_set_ids, kfunc_id)) 1487 return 0; 1488 1489 /* Only allow to attach from LSM hooks, to avoid recursion */ 1490 return prog->type != BPF_PROG_TYPE_LSM ? -EACCES : 0; 1491 } 1492 1493 static const struct btf_kfunc_id_set bpf_fs_kfunc_set = { 1494 .owner = THIS_MODULE, 1495 .set = &fs_kfunc_set_ids, 1496 .filter = bpf_get_file_xattr_filter, 1497 }; 1498 1499 static int __init bpf_fs_kfuncs_init(void) 1500 { 1501 return register_btf_kfunc_id_set(BPF_PROG_TYPE_LSM, &bpf_fs_kfunc_set); 1502 } 1503 1504 late_initcall(bpf_fs_kfuncs_init); 1505 1506 static const struct bpf_func_proto * 1507 bpf_tracing_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog) 1508 { 1509 switch (func_id) { 1510 case BPF_FUNC_map_lookup_elem: 1511 return &bpf_map_lookup_elem_proto; 1512 case BPF_FUNC_map_update_elem: 1513 return &bpf_map_update_elem_proto; 1514 case BPF_FUNC_map_delete_elem: 1515 return &bpf_map_delete_elem_proto; 1516 case BPF_FUNC_map_push_elem: 1517 return &bpf_map_push_elem_proto; 1518 case BPF_FUNC_map_pop_elem: 1519 return &bpf_map_pop_elem_proto; 1520 case BPF_FUNC_map_peek_elem: 1521 return &bpf_map_peek_elem_proto; 1522 case BPF_FUNC_map_lookup_percpu_elem: 1523 return &bpf_map_lookup_percpu_elem_proto; 1524 case BPF_FUNC_ktime_get_ns: 1525 return &bpf_ktime_get_ns_proto; 1526 case BPF_FUNC_ktime_get_boot_ns: 1527 return &bpf_ktime_get_boot_ns_proto; 1528 case BPF_FUNC_tail_call: 1529 return &bpf_tail_call_proto; 1530 case BPF_FUNC_get_current_task: 1531 return &bpf_get_current_task_proto; 1532 case BPF_FUNC_get_current_task_btf: 1533 return &bpf_get_current_task_btf_proto; 1534 case BPF_FUNC_task_pt_regs: 1535 return &bpf_task_pt_regs_proto; 1536 case BPF_FUNC_get_current_uid_gid: 1537 return &bpf_get_current_uid_gid_proto; 1538 case BPF_FUNC_get_current_comm: 1539 return &bpf_get_current_comm_proto; 1540 case BPF_FUNC_trace_printk: 1541 return bpf_get_trace_printk_proto(); 1542 case BPF_FUNC_get_smp_processor_id: 1543 return &bpf_get_smp_processor_id_proto; 1544 case BPF_FUNC_get_numa_node_id: 1545 return &bpf_get_numa_node_id_proto; 1546 case BPF_FUNC_perf_event_read: 1547 return &bpf_perf_event_read_proto; 1548 case BPF_FUNC_current_task_under_cgroup: 1549 return &bpf_current_task_under_cgroup_proto; 1550 case BPF_FUNC_get_prandom_u32: 1551 return &bpf_get_prandom_u32_proto; 1552 case BPF_FUNC_probe_write_user: 1553 return security_locked_down(LOCKDOWN_BPF_WRITE_USER) < 0 ? 1554 NULL : bpf_get_probe_write_proto(); 1555 case BPF_FUNC_probe_read_user: 1556 return &bpf_probe_read_user_proto; 1557 case BPF_FUNC_probe_read_kernel: 1558 return security_locked_down(LOCKDOWN_BPF_READ_KERNEL) < 0 ? 1559 NULL : &bpf_probe_read_kernel_proto; 1560 case BPF_FUNC_probe_read_user_str: 1561 return &bpf_probe_read_user_str_proto; 1562 case BPF_FUNC_probe_read_kernel_str: 1563 return security_locked_down(LOCKDOWN_BPF_READ_KERNEL) < 0 ? 1564 NULL : &bpf_probe_read_kernel_str_proto; 1565 #ifdef CONFIG_ARCH_HAS_NON_OVERLAPPING_ADDRESS_SPACE 1566 case BPF_FUNC_probe_read: 1567 return security_locked_down(LOCKDOWN_BPF_READ_KERNEL) < 0 ? 1568 NULL : &bpf_probe_read_compat_proto; 1569 case BPF_FUNC_probe_read_str: 1570 return security_locked_down(LOCKDOWN_BPF_READ_KERNEL) < 0 ? 1571 NULL : &bpf_probe_read_compat_str_proto; 1572 #endif 1573 #ifdef CONFIG_CGROUPS 1574 case BPF_FUNC_cgrp_storage_get: 1575 return &bpf_cgrp_storage_get_proto; 1576 case BPF_FUNC_cgrp_storage_delete: 1577 return &bpf_cgrp_storage_delete_proto; 1578 #endif 1579 case BPF_FUNC_send_signal: 1580 return &bpf_send_signal_proto; 1581 case BPF_FUNC_send_signal_thread: 1582 return &bpf_send_signal_thread_proto; 1583 case BPF_FUNC_perf_event_read_value: 1584 return &bpf_perf_event_read_value_proto; 1585 case BPF_FUNC_ringbuf_output: 1586 return &bpf_ringbuf_output_proto; 1587 case BPF_FUNC_ringbuf_reserve: 1588 return &bpf_ringbuf_reserve_proto; 1589 case BPF_FUNC_ringbuf_submit: 1590 return &bpf_ringbuf_submit_proto; 1591 case BPF_FUNC_ringbuf_discard: 1592 return &bpf_ringbuf_discard_proto; 1593 case BPF_FUNC_ringbuf_query: 1594 return &bpf_ringbuf_query_proto; 1595 case BPF_FUNC_jiffies64: 1596 return &bpf_jiffies64_proto; 1597 case BPF_FUNC_get_task_stack: 1598 return &bpf_get_task_stack_proto; 1599 case BPF_FUNC_copy_from_user: 1600 return &bpf_copy_from_user_proto; 1601 case BPF_FUNC_copy_from_user_task: 1602 return &bpf_copy_from_user_task_proto; 1603 case BPF_FUNC_snprintf_btf: 1604 return &bpf_snprintf_btf_proto; 1605 case BPF_FUNC_per_cpu_ptr: 1606 return &bpf_per_cpu_ptr_proto; 1607 case BPF_FUNC_this_cpu_ptr: 1608 return &bpf_this_cpu_ptr_proto; 1609 case BPF_FUNC_task_storage_get: 1610 if (bpf_prog_check_recur(prog)) 1611 return &bpf_task_storage_get_recur_proto; 1612 return &bpf_task_storage_get_proto; 1613 case BPF_FUNC_task_storage_delete: 1614 if (bpf_prog_check_recur(prog)) 1615 return &bpf_task_storage_delete_recur_proto; 1616 return &bpf_task_storage_delete_proto; 1617 case BPF_FUNC_for_each_map_elem: 1618 return &bpf_for_each_map_elem_proto; 1619 case BPF_FUNC_snprintf: 1620 return &bpf_snprintf_proto; 1621 case BPF_FUNC_get_func_ip: 1622 return &bpf_get_func_ip_proto_tracing; 1623 case BPF_FUNC_get_branch_snapshot: 1624 return &bpf_get_branch_snapshot_proto; 1625 case BPF_FUNC_find_vma: 1626 return &bpf_find_vma_proto; 1627 case BPF_FUNC_trace_vprintk: 1628 return bpf_get_trace_vprintk_proto(); 1629 default: 1630 return bpf_base_func_proto(func_id, prog); 1631 } 1632 } 1633 1634 static const struct bpf_func_proto * 1635 kprobe_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog) 1636 { 1637 switch (func_id) { 1638 case BPF_FUNC_perf_event_output: 1639 return &bpf_perf_event_output_proto; 1640 case BPF_FUNC_get_stackid: 1641 return &bpf_get_stackid_proto; 1642 case BPF_FUNC_get_stack: 1643 return &bpf_get_stack_proto; 1644 #ifdef CONFIG_BPF_KPROBE_OVERRIDE 1645 case BPF_FUNC_override_return: 1646 return &bpf_override_return_proto; 1647 #endif 1648 case BPF_FUNC_get_func_ip: 1649 if (prog->expected_attach_type == BPF_TRACE_KPROBE_MULTI) 1650 return &bpf_get_func_ip_proto_kprobe_multi; 1651 if (prog->expected_attach_type == BPF_TRACE_UPROBE_MULTI) 1652 return &bpf_get_func_ip_proto_uprobe_multi; 1653 return &bpf_get_func_ip_proto_kprobe; 1654 case BPF_FUNC_get_attach_cookie: 1655 if (prog->expected_attach_type == BPF_TRACE_KPROBE_MULTI) 1656 return &bpf_get_attach_cookie_proto_kmulti; 1657 if (prog->expected_attach_type == BPF_TRACE_UPROBE_MULTI) 1658 return &bpf_get_attach_cookie_proto_umulti; 1659 return &bpf_get_attach_cookie_proto_trace; 1660 default: 1661 return bpf_tracing_func_proto(func_id, prog); 1662 } 1663 } 1664 1665 /* bpf+kprobe programs can access fields of 'struct pt_regs' */ 1666 static bool kprobe_prog_is_valid_access(int off, int size, enum bpf_access_type type, 1667 const struct bpf_prog *prog, 1668 struct bpf_insn_access_aux *info) 1669 { 1670 if (off < 0 || off >= sizeof(struct pt_regs)) 1671 return false; 1672 if (type != BPF_READ) 1673 return false; 1674 if (off % size != 0) 1675 return false; 1676 /* 1677 * Assertion for 32 bit to make sure last 8 byte access 1678 * (BPF_DW) to the last 4 byte member is disallowed. 1679 */ 1680 if (off + size > sizeof(struct pt_regs)) 1681 return false; 1682 1683 return true; 1684 } 1685 1686 const struct bpf_verifier_ops kprobe_verifier_ops = { 1687 .get_func_proto = kprobe_prog_func_proto, 1688 .is_valid_access = kprobe_prog_is_valid_access, 1689 }; 1690 1691 const struct bpf_prog_ops kprobe_prog_ops = { 1692 }; 1693 1694 BPF_CALL_5(bpf_perf_event_output_tp, void *, tp_buff, struct bpf_map *, map, 1695 u64, flags, void *, data, u64, size) 1696 { 1697 struct pt_regs *regs = *(struct pt_regs **)tp_buff; 1698 1699 /* 1700 * r1 points to perf tracepoint buffer where first 8 bytes are hidden 1701 * from bpf program and contain a pointer to 'struct pt_regs'. Fetch it 1702 * from there and call the same bpf_perf_event_output() helper inline. 1703 */ 1704 return ____bpf_perf_event_output(regs, map, flags, data, size); 1705 } 1706 1707 static const struct bpf_func_proto bpf_perf_event_output_proto_tp = { 1708 .func = bpf_perf_event_output_tp, 1709 .gpl_only = true, 1710 .ret_type = RET_INTEGER, 1711 .arg1_type = ARG_PTR_TO_CTX, 1712 .arg2_type = ARG_CONST_MAP_PTR, 1713 .arg3_type = ARG_ANYTHING, 1714 .arg4_type = ARG_PTR_TO_MEM | MEM_RDONLY, 1715 .arg5_type = ARG_CONST_SIZE_OR_ZERO, 1716 }; 1717 1718 BPF_CALL_3(bpf_get_stackid_tp, void *, tp_buff, struct bpf_map *, map, 1719 u64, flags) 1720 { 1721 struct pt_regs *regs = *(struct pt_regs **)tp_buff; 1722 1723 /* 1724 * Same comment as in bpf_perf_event_output_tp(), only that this time 1725 * the other helper's function body cannot be inlined due to being 1726 * external, thus we need to call raw helper function. 1727 */ 1728 return bpf_get_stackid((unsigned long) regs, (unsigned long) map, 1729 flags, 0, 0); 1730 } 1731 1732 static const struct bpf_func_proto bpf_get_stackid_proto_tp = { 1733 .func = bpf_get_stackid_tp, 1734 .gpl_only = true, 1735 .ret_type = RET_INTEGER, 1736 .arg1_type = ARG_PTR_TO_CTX, 1737 .arg2_type = ARG_CONST_MAP_PTR, 1738 .arg3_type = ARG_ANYTHING, 1739 }; 1740 1741 BPF_CALL_4(bpf_get_stack_tp, void *, tp_buff, void *, buf, u32, size, 1742 u64, flags) 1743 { 1744 struct pt_regs *regs = *(struct pt_regs **)tp_buff; 1745 1746 return bpf_get_stack((unsigned long) regs, (unsigned long) buf, 1747 (unsigned long) size, flags, 0); 1748 } 1749 1750 static const struct bpf_func_proto bpf_get_stack_proto_tp = { 1751 .func = bpf_get_stack_tp, 1752 .gpl_only = true, 1753 .ret_type = RET_INTEGER, 1754 .arg1_type = ARG_PTR_TO_CTX, 1755 .arg2_type = ARG_PTR_TO_UNINIT_MEM, 1756 .arg3_type = ARG_CONST_SIZE_OR_ZERO, 1757 .arg4_type = ARG_ANYTHING, 1758 }; 1759 1760 static const struct bpf_func_proto * 1761 tp_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog) 1762 { 1763 switch (func_id) { 1764 case BPF_FUNC_perf_event_output: 1765 return &bpf_perf_event_output_proto_tp; 1766 case BPF_FUNC_get_stackid: 1767 return &bpf_get_stackid_proto_tp; 1768 case BPF_FUNC_get_stack: 1769 return &bpf_get_stack_proto_tp; 1770 case BPF_FUNC_get_attach_cookie: 1771 return &bpf_get_attach_cookie_proto_trace; 1772 default: 1773 return bpf_tracing_func_proto(func_id, prog); 1774 } 1775 } 1776 1777 static bool tp_prog_is_valid_access(int off, int size, enum bpf_access_type type, 1778 const struct bpf_prog *prog, 1779 struct bpf_insn_access_aux *info) 1780 { 1781 if (off < sizeof(void *) || off >= PERF_MAX_TRACE_SIZE) 1782 return false; 1783 if (type != BPF_READ) 1784 return false; 1785 if (off % size != 0) 1786 return false; 1787 1788 BUILD_BUG_ON(PERF_MAX_TRACE_SIZE % sizeof(__u64)); 1789 return true; 1790 } 1791 1792 const struct bpf_verifier_ops tracepoint_verifier_ops = { 1793 .get_func_proto = tp_prog_func_proto, 1794 .is_valid_access = tp_prog_is_valid_access, 1795 }; 1796 1797 const struct bpf_prog_ops tracepoint_prog_ops = { 1798 }; 1799 1800 BPF_CALL_3(bpf_perf_prog_read_value, struct bpf_perf_event_data_kern *, ctx, 1801 struct bpf_perf_event_value *, buf, u32, size) 1802 { 1803 int err = -EINVAL; 1804 1805 if (unlikely(size != sizeof(struct bpf_perf_event_value))) 1806 goto clear; 1807 err = perf_event_read_local(ctx->event, &buf->counter, &buf->enabled, 1808 &buf->running); 1809 if (unlikely(err)) 1810 goto clear; 1811 return 0; 1812 clear: 1813 memset(buf, 0, size); 1814 return err; 1815 } 1816 1817 static const struct bpf_func_proto bpf_perf_prog_read_value_proto = { 1818 .func = bpf_perf_prog_read_value, 1819 .gpl_only = true, 1820 .ret_type = RET_INTEGER, 1821 .arg1_type = ARG_PTR_TO_CTX, 1822 .arg2_type = ARG_PTR_TO_UNINIT_MEM, 1823 .arg3_type = ARG_CONST_SIZE, 1824 }; 1825 1826 BPF_CALL_4(bpf_read_branch_records, struct bpf_perf_event_data_kern *, ctx, 1827 void *, buf, u32, size, u64, flags) 1828 { 1829 static const u32 br_entry_size = sizeof(struct perf_branch_entry); 1830 struct perf_branch_stack *br_stack = ctx->data->br_stack; 1831 u32 to_copy; 1832 1833 if (unlikely(flags & ~BPF_F_GET_BRANCH_RECORDS_SIZE)) 1834 return -EINVAL; 1835 1836 if (unlikely(!(ctx->data->sample_flags & PERF_SAMPLE_BRANCH_STACK))) 1837 return -ENOENT; 1838 1839 if (unlikely(!br_stack)) 1840 return -ENOENT; 1841 1842 if (flags & BPF_F_GET_BRANCH_RECORDS_SIZE) 1843 return br_stack->nr * br_entry_size; 1844 1845 if (!buf || (size % br_entry_size != 0)) 1846 return -EINVAL; 1847 1848 to_copy = min_t(u32, br_stack->nr * br_entry_size, size); 1849 memcpy(buf, br_stack->entries, to_copy); 1850 1851 return to_copy; 1852 } 1853 1854 static const struct bpf_func_proto bpf_read_branch_records_proto = { 1855 .func = bpf_read_branch_records, 1856 .gpl_only = true, 1857 .ret_type = RET_INTEGER, 1858 .arg1_type = ARG_PTR_TO_CTX, 1859 .arg2_type = ARG_PTR_TO_MEM_OR_NULL, 1860 .arg3_type = ARG_CONST_SIZE_OR_ZERO, 1861 .arg4_type = ARG_ANYTHING, 1862 }; 1863 1864 static const struct bpf_func_proto * 1865 pe_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog) 1866 { 1867 switch (func_id) { 1868 case BPF_FUNC_perf_event_output: 1869 return &bpf_perf_event_output_proto_tp; 1870 case BPF_FUNC_get_stackid: 1871 return &bpf_get_stackid_proto_pe; 1872 case BPF_FUNC_get_stack: 1873 return &bpf_get_stack_proto_pe; 1874 case BPF_FUNC_perf_prog_read_value: 1875 return &bpf_perf_prog_read_value_proto; 1876 case BPF_FUNC_read_branch_records: 1877 return &bpf_read_branch_records_proto; 1878 case BPF_FUNC_get_attach_cookie: 1879 return &bpf_get_attach_cookie_proto_pe; 1880 default: 1881 return bpf_tracing_func_proto(func_id, prog); 1882 } 1883 } 1884 1885 /* 1886 * bpf_raw_tp_regs are separate from bpf_pt_regs used from skb/xdp 1887 * to avoid potential recursive reuse issue when/if tracepoints are added 1888 * inside bpf_*_event_output, bpf_get_stackid and/or bpf_get_stack. 1889 * 1890 * Since raw tracepoints run despite bpf_prog_active, support concurrent usage 1891 * in normal, irq, and nmi context. 1892 */ 1893 struct bpf_raw_tp_regs { 1894 struct pt_regs regs[3]; 1895 }; 1896 static DEFINE_PER_CPU(struct bpf_raw_tp_regs, bpf_raw_tp_regs); 1897 static DEFINE_PER_CPU(int, bpf_raw_tp_nest_level); 1898 static struct pt_regs *get_bpf_raw_tp_regs(void) 1899 { 1900 struct bpf_raw_tp_regs *tp_regs = this_cpu_ptr(&bpf_raw_tp_regs); 1901 int nest_level = this_cpu_inc_return(bpf_raw_tp_nest_level); 1902 1903 if (WARN_ON_ONCE(nest_level > ARRAY_SIZE(tp_regs->regs))) { 1904 this_cpu_dec(bpf_raw_tp_nest_level); 1905 return ERR_PTR(-EBUSY); 1906 } 1907 1908 return &tp_regs->regs[nest_level - 1]; 1909 } 1910 1911 static void put_bpf_raw_tp_regs(void) 1912 { 1913 this_cpu_dec(bpf_raw_tp_nest_level); 1914 } 1915 1916 BPF_CALL_5(bpf_perf_event_output_raw_tp, struct bpf_raw_tracepoint_args *, args, 1917 struct bpf_map *, map, u64, flags, void *, data, u64, size) 1918 { 1919 struct pt_regs *regs = get_bpf_raw_tp_regs(); 1920 int ret; 1921 1922 if (IS_ERR(regs)) 1923 return PTR_ERR(regs); 1924 1925 perf_fetch_caller_regs(regs); 1926 ret = ____bpf_perf_event_output(regs, map, flags, data, size); 1927 1928 put_bpf_raw_tp_regs(); 1929 return ret; 1930 } 1931 1932 static const struct bpf_func_proto bpf_perf_event_output_proto_raw_tp = { 1933 .func = bpf_perf_event_output_raw_tp, 1934 .gpl_only = true, 1935 .ret_type = RET_INTEGER, 1936 .arg1_type = ARG_PTR_TO_CTX, 1937 .arg2_type = ARG_CONST_MAP_PTR, 1938 .arg3_type = ARG_ANYTHING, 1939 .arg4_type = ARG_PTR_TO_MEM | MEM_RDONLY, 1940 .arg5_type = ARG_CONST_SIZE_OR_ZERO, 1941 }; 1942 1943 extern const struct bpf_func_proto bpf_skb_output_proto; 1944 extern const struct bpf_func_proto bpf_xdp_output_proto; 1945 extern const struct bpf_func_proto bpf_xdp_get_buff_len_trace_proto; 1946 1947 BPF_CALL_3(bpf_get_stackid_raw_tp, struct bpf_raw_tracepoint_args *, args, 1948 struct bpf_map *, map, u64, flags) 1949 { 1950 struct pt_regs *regs = get_bpf_raw_tp_regs(); 1951 int ret; 1952 1953 if (IS_ERR(regs)) 1954 return PTR_ERR(regs); 1955 1956 perf_fetch_caller_regs(regs); 1957 /* similar to bpf_perf_event_output_tp, but pt_regs fetched differently */ 1958 ret = bpf_get_stackid((unsigned long) regs, (unsigned long) map, 1959 flags, 0, 0); 1960 put_bpf_raw_tp_regs(); 1961 return ret; 1962 } 1963 1964 static const struct bpf_func_proto bpf_get_stackid_proto_raw_tp = { 1965 .func = bpf_get_stackid_raw_tp, 1966 .gpl_only = true, 1967 .ret_type = RET_INTEGER, 1968 .arg1_type = ARG_PTR_TO_CTX, 1969 .arg2_type = ARG_CONST_MAP_PTR, 1970 .arg3_type = ARG_ANYTHING, 1971 }; 1972 1973 BPF_CALL_4(bpf_get_stack_raw_tp, struct bpf_raw_tracepoint_args *, args, 1974 void *, buf, u32, size, u64, flags) 1975 { 1976 struct pt_regs *regs = get_bpf_raw_tp_regs(); 1977 int ret; 1978 1979 if (IS_ERR(regs)) 1980 return PTR_ERR(regs); 1981 1982 perf_fetch_caller_regs(regs); 1983 ret = bpf_get_stack((unsigned long) regs, (unsigned long) buf, 1984 (unsigned long) size, flags, 0); 1985 put_bpf_raw_tp_regs(); 1986 return ret; 1987 } 1988 1989 static const struct bpf_func_proto bpf_get_stack_proto_raw_tp = { 1990 .func = bpf_get_stack_raw_tp, 1991 .gpl_only = true, 1992 .ret_type = RET_INTEGER, 1993 .arg1_type = ARG_PTR_TO_CTX, 1994 .arg2_type = ARG_PTR_TO_MEM | MEM_RDONLY, 1995 .arg3_type = ARG_CONST_SIZE_OR_ZERO, 1996 .arg4_type = ARG_ANYTHING, 1997 }; 1998 1999 static const struct bpf_func_proto * 2000 raw_tp_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog) 2001 { 2002 switch (func_id) { 2003 case BPF_FUNC_perf_event_output: 2004 return &bpf_perf_event_output_proto_raw_tp; 2005 case BPF_FUNC_get_stackid: 2006 return &bpf_get_stackid_proto_raw_tp; 2007 case BPF_FUNC_get_stack: 2008 return &bpf_get_stack_proto_raw_tp; 2009 case BPF_FUNC_get_attach_cookie: 2010 return &bpf_get_attach_cookie_proto_tracing; 2011 default: 2012 return bpf_tracing_func_proto(func_id, prog); 2013 } 2014 } 2015 2016 const struct bpf_func_proto * 2017 tracing_prog_func_proto(enum bpf_func_id func_id, const struct bpf_prog *prog) 2018 { 2019 const struct bpf_func_proto *fn; 2020 2021 switch (func_id) { 2022 #ifdef CONFIG_NET 2023 case BPF_FUNC_skb_output: 2024 return &bpf_skb_output_proto; 2025 case BPF_FUNC_xdp_output: 2026 return &bpf_xdp_output_proto; 2027 case BPF_FUNC_skc_to_tcp6_sock: 2028 return &bpf_skc_to_tcp6_sock_proto; 2029 case BPF_FUNC_skc_to_tcp_sock: 2030 return &bpf_skc_to_tcp_sock_proto; 2031 case BPF_FUNC_skc_to_tcp_timewait_sock: 2032 return &bpf_skc_to_tcp_timewait_sock_proto; 2033 case BPF_FUNC_skc_to_tcp_request_sock: 2034 return &bpf_skc_to_tcp_request_sock_proto; 2035 case BPF_FUNC_skc_to_udp6_sock: 2036 return &bpf_skc_to_udp6_sock_proto; 2037 case BPF_FUNC_skc_to_unix_sock: 2038 return &bpf_skc_to_unix_sock_proto; 2039 case BPF_FUNC_skc_to_mptcp_sock: 2040 return &bpf_skc_to_mptcp_sock_proto; 2041 case BPF_FUNC_sk_storage_get: 2042 return &bpf_sk_storage_get_tracing_proto; 2043 case BPF_FUNC_sk_storage_delete: 2044 return &bpf_sk_storage_delete_tracing_proto; 2045 case BPF_FUNC_sock_from_file: 2046 return &bpf_sock_from_file_proto; 2047 case BPF_FUNC_get_socket_cookie: 2048 return &bpf_get_socket_ptr_cookie_proto; 2049 case BPF_FUNC_xdp_get_buff_len: 2050 return &bpf_xdp_get_buff_len_trace_proto; 2051 #endif 2052 case BPF_FUNC_seq_printf: 2053 return prog->expected_attach_type == BPF_TRACE_ITER ? 2054 &bpf_seq_printf_proto : 2055 NULL; 2056 case BPF_FUNC_seq_write: 2057 return prog->expected_attach_type == BPF_TRACE_ITER ? 2058 &bpf_seq_write_proto : 2059 NULL; 2060 case BPF_FUNC_seq_printf_btf: 2061 return prog->expected_attach_type == BPF_TRACE_ITER ? 2062 &bpf_seq_printf_btf_proto : 2063 NULL; 2064 case BPF_FUNC_d_path: 2065 return &bpf_d_path_proto; 2066 case BPF_FUNC_get_func_arg: 2067 return bpf_prog_has_trampoline(prog) ? &bpf_get_func_arg_proto : NULL; 2068 case BPF_FUNC_get_func_ret: 2069 return bpf_prog_has_trampoline(prog) ? &bpf_get_func_ret_proto : NULL; 2070 case BPF_FUNC_get_func_arg_cnt: 2071 return bpf_prog_has_trampoline(prog) ? &bpf_get_func_arg_cnt_proto : NULL; 2072 case BPF_FUNC_get_attach_cookie: 2073 if (prog->type == BPF_PROG_TYPE_TRACING && 2074 prog->expected_attach_type == BPF_TRACE_RAW_TP) 2075 return &bpf_get_attach_cookie_proto_tracing; 2076 return bpf_prog_has_trampoline(prog) ? &bpf_get_attach_cookie_proto_tracing : NULL; 2077 default: 2078 fn = raw_tp_prog_func_proto(func_id, prog); 2079 if (!fn && prog->expected_attach_type == BPF_TRACE_ITER) 2080 fn = bpf_iter_get_func_proto(func_id, prog); 2081 return fn; 2082 } 2083 } 2084 2085 static bool raw_tp_prog_is_valid_access(int off, int size, 2086 enum bpf_access_type type, 2087 const struct bpf_prog *prog, 2088 struct bpf_insn_access_aux *info) 2089 { 2090 return bpf_tracing_ctx_access(off, size, type); 2091 } 2092 2093 static bool tracing_prog_is_valid_access(int off, int size, 2094 enum bpf_access_type type, 2095 const struct bpf_prog *prog, 2096 struct bpf_insn_access_aux *info) 2097 { 2098 return bpf_tracing_btf_ctx_access(off, size, type, prog, info); 2099 } 2100 2101 int __weak bpf_prog_test_run_tracing(struct bpf_prog *prog, 2102 const union bpf_attr *kattr, 2103 union bpf_attr __user *uattr) 2104 { 2105 return -ENOTSUPP; 2106 } 2107 2108 const struct bpf_verifier_ops raw_tracepoint_verifier_ops = { 2109 .get_func_proto = raw_tp_prog_func_proto, 2110 .is_valid_access = raw_tp_prog_is_valid_access, 2111 }; 2112 2113 const struct bpf_prog_ops raw_tracepoint_prog_ops = { 2114 #ifdef CONFIG_NET 2115 .test_run = bpf_prog_test_run_raw_tp, 2116 #endif 2117 }; 2118 2119 const struct bpf_verifier_ops tracing_verifier_ops = { 2120 .get_func_proto = tracing_prog_func_proto, 2121 .is_valid_access = tracing_prog_is_valid_access, 2122 }; 2123 2124 const struct bpf_prog_ops tracing_prog_ops = { 2125 .test_run = bpf_prog_test_run_tracing, 2126 }; 2127 2128 static bool raw_tp_writable_prog_is_valid_access(int off, int size, 2129 enum bpf_access_type type, 2130 const struct bpf_prog *prog, 2131 struct bpf_insn_access_aux *info) 2132 { 2133 if (off == 0) { 2134 if (size != sizeof(u64) || type != BPF_READ) 2135 return false; 2136 info->reg_type = PTR_TO_TP_BUFFER; 2137 } 2138 return raw_tp_prog_is_valid_access(off, size, type, prog, info); 2139 } 2140 2141 const struct bpf_verifier_ops raw_tracepoint_writable_verifier_ops = { 2142 .get_func_proto = raw_tp_prog_func_proto, 2143 .is_valid_access = raw_tp_writable_prog_is_valid_access, 2144 }; 2145 2146 const struct bpf_prog_ops raw_tracepoint_writable_prog_ops = { 2147 }; 2148 2149 static bool pe_prog_is_valid_access(int off, int size, enum bpf_access_type type, 2150 const struct bpf_prog *prog, 2151 struct bpf_insn_access_aux *info) 2152 { 2153 const int size_u64 = sizeof(u64); 2154 2155 if (off < 0 || off >= sizeof(struct bpf_perf_event_data)) 2156 return false; 2157 if (type != BPF_READ) 2158 return false; 2159 if (off % size != 0) { 2160 if (sizeof(unsigned long) != 4) 2161 return false; 2162 if (size != 8) 2163 return false; 2164 if (off % size != 4) 2165 return false; 2166 } 2167 2168 switch (off) { 2169 case bpf_ctx_range(struct bpf_perf_event_data, sample_period): 2170 bpf_ctx_record_field_size(info, size_u64); 2171 if (!bpf_ctx_narrow_access_ok(off, size, size_u64)) 2172 return false; 2173 break; 2174 case bpf_ctx_range(struct bpf_perf_event_data, addr): 2175 bpf_ctx_record_field_size(info, size_u64); 2176 if (!bpf_ctx_narrow_access_ok(off, size, size_u64)) 2177 return false; 2178 break; 2179 default: 2180 if (size != sizeof(long)) 2181 return false; 2182 } 2183 2184 return true; 2185 } 2186 2187 static u32 pe_prog_convert_ctx_access(enum bpf_access_type type, 2188 const struct bpf_insn *si, 2189 struct bpf_insn *insn_buf, 2190 struct bpf_prog *prog, u32 *target_size) 2191 { 2192 struct bpf_insn *insn = insn_buf; 2193 2194 switch (si->off) { 2195 case offsetof(struct bpf_perf_event_data, sample_period): 2196 *insn++ = BPF_LDX_MEM(BPF_FIELD_SIZEOF(struct bpf_perf_event_data_kern, 2197 data), si->dst_reg, si->src_reg, 2198 offsetof(struct bpf_perf_event_data_kern, data)); 2199 *insn++ = BPF_LDX_MEM(BPF_DW, si->dst_reg, si->dst_reg, 2200 bpf_target_off(struct perf_sample_data, period, 8, 2201 target_size)); 2202 break; 2203 case offsetof(struct bpf_perf_event_data, addr): 2204 *insn++ = BPF_LDX_MEM(BPF_FIELD_SIZEOF(struct bpf_perf_event_data_kern, 2205 data), si->dst_reg, si->src_reg, 2206 offsetof(struct bpf_perf_event_data_kern, data)); 2207 *insn++ = BPF_LDX_MEM(BPF_DW, si->dst_reg, si->dst_reg, 2208 bpf_target_off(struct perf_sample_data, addr, 8, 2209 target_size)); 2210 break; 2211 default: 2212 *insn++ = BPF_LDX_MEM(BPF_FIELD_SIZEOF(struct bpf_perf_event_data_kern, 2213 regs), si->dst_reg, si->src_reg, 2214 offsetof(struct bpf_perf_event_data_kern, regs)); 2215 *insn++ = BPF_LDX_MEM(BPF_SIZEOF(long), si->dst_reg, si->dst_reg, 2216 si->off); 2217 break; 2218 } 2219 2220 return insn - insn_buf; 2221 } 2222 2223 const struct bpf_verifier_ops perf_event_verifier_ops = { 2224 .get_func_proto = pe_prog_func_proto, 2225 .is_valid_access = pe_prog_is_valid_access, 2226 .convert_ctx_access = pe_prog_convert_ctx_access, 2227 }; 2228 2229 const struct bpf_prog_ops perf_event_prog_ops = { 2230 }; 2231 2232 static DEFINE_MUTEX(bpf_event_mutex); 2233 2234 #define BPF_TRACE_MAX_PROGS 64 2235 2236 int perf_event_attach_bpf_prog(struct perf_event *event, 2237 struct bpf_prog *prog, 2238 u64 bpf_cookie) 2239 { 2240 struct bpf_prog_array *old_array; 2241 struct bpf_prog_array *new_array; 2242 int ret = -EEXIST; 2243 2244 /* 2245 * Kprobe override only works if they are on the function entry, 2246 * and only if they are on the opt-in list. 2247 */ 2248 if (prog->kprobe_override && 2249 (!trace_kprobe_on_func_entry(event->tp_event) || 2250 !trace_kprobe_error_injectable(event->tp_event))) 2251 return -EINVAL; 2252 2253 mutex_lock(&bpf_event_mutex); 2254 2255 if (event->prog) 2256 goto unlock; 2257 2258 old_array = bpf_event_rcu_dereference(event->tp_event->prog_array); 2259 if (old_array && 2260 bpf_prog_array_length(old_array) >= BPF_TRACE_MAX_PROGS) { 2261 ret = -E2BIG; 2262 goto unlock; 2263 } 2264 2265 ret = bpf_prog_array_copy(old_array, NULL, prog, bpf_cookie, &new_array); 2266 if (ret < 0) 2267 goto unlock; 2268 2269 /* set the new array to event->tp_event and set event->prog */ 2270 event->prog = prog; 2271 event->bpf_cookie = bpf_cookie; 2272 rcu_assign_pointer(event->tp_event->prog_array, new_array); 2273 bpf_prog_array_free_sleepable(old_array); 2274 2275 unlock: 2276 mutex_unlock(&bpf_event_mutex); 2277 return ret; 2278 } 2279 2280 void perf_event_detach_bpf_prog(struct perf_event *event) 2281 { 2282 struct bpf_prog_array *old_array; 2283 struct bpf_prog_array *new_array; 2284 int ret; 2285 2286 mutex_lock(&bpf_event_mutex); 2287 2288 if (!event->prog) 2289 goto unlock; 2290 2291 old_array = bpf_event_rcu_dereference(event->tp_event->prog_array); 2292 ret = bpf_prog_array_copy(old_array, event->prog, NULL, 0, &new_array); 2293 if (ret == -ENOENT) 2294 goto unlock; 2295 if (ret < 0) { 2296 bpf_prog_array_delete_safe(old_array, event->prog); 2297 } else { 2298 rcu_assign_pointer(event->tp_event->prog_array, new_array); 2299 bpf_prog_array_free_sleepable(old_array); 2300 } 2301 2302 bpf_prog_put(event->prog); 2303 event->prog = NULL; 2304 2305 unlock: 2306 mutex_unlock(&bpf_event_mutex); 2307 } 2308 2309 int perf_event_query_prog_array(struct perf_event *event, void __user *info) 2310 { 2311 struct perf_event_query_bpf __user *uquery = info; 2312 struct perf_event_query_bpf query = {}; 2313 struct bpf_prog_array *progs; 2314 u32 *ids, prog_cnt, ids_len; 2315 int ret; 2316 2317 if (!perfmon_capable()) 2318 return -EPERM; 2319 if (event->attr.type != PERF_TYPE_TRACEPOINT) 2320 return -EINVAL; 2321 if (copy_from_user(&query, uquery, sizeof(query))) 2322 return -EFAULT; 2323 2324 ids_len = query.ids_len; 2325 if (ids_len > BPF_TRACE_MAX_PROGS) 2326 return -E2BIG; 2327 ids = kcalloc(ids_len, sizeof(u32), GFP_USER | __GFP_NOWARN); 2328 if (!ids) 2329 return -ENOMEM; 2330 /* 2331 * The above kcalloc returns ZERO_SIZE_PTR when ids_len = 0, which 2332 * is required when user only wants to check for uquery->prog_cnt. 2333 * There is no need to check for it since the case is handled 2334 * gracefully in bpf_prog_array_copy_info. 2335 */ 2336 2337 mutex_lock(&bpf_event_mutex); 2338 progs = bpf_event_rcu_dereference(event->tp_event->prog_array); 2339 ret = bpf_prog_array_copy_info(progs, ids, ids_len, &prog_cnt); 2340 mutex_unlock(&bpf_event_mutex); 2341 2342 if (copy_to_user(&uquery->prog_cnt, &prog_cnt, sizeof(prog_cnt)) || 2343 copy_to_user(uquery->ids, ids, ids_len * sizeof(u32))) 2344 ret = -EFAULT; 2345 2346 kfree(ids); 2347 return ret; 2348 } 2349 2350 extern struct bpf_raw_event_map __start__bpf_raw_tp[]; 2351 extern struct bpf_raw_event_map __stop__bpf_raw_tp[]; 2352 2353 struct bpf_raw_event_map *bpf_get_raw_tracepoint(const char *name) 2354 { 2355 struct bpf_raw_event_map *btp = __start__bpf_raw_tp; 2356 2357 for (; btp < __stop__bpf_raw_tp; btp++) { 2358 if (!strcmp(btp->tp->name, name)) 2359 return btp; 2360 } 2361 2362 return bpf_get_raw_tracepoint_module(name); 2363 } 2364 2365 void bpf_put_raw_tracepoint(struct bpf_raw_event_map *btp) 2366 { 2367 struct module *mod; 2368 2369 preempt_disable(); 2370 mod = __module_address((unsigned long)btp); 2371 module_put(mod); 2372 preempt_enable(); 2373 } 2374 2375 static __always_inline 2376 void __bpf_trace_run(struct bpf_raw_tp_link *link, u64 *args) 2377 { 2378 struct bpf_prog *prog = link->link.prog; 2379 struct bpf_run_ctx *old_run_ctx; 2380 struct bpf_trace_run_ctx run_ctx; 2381 2382 cant_sleep(); 2383 if (unlikely(this_cpu_inc_return(*(prog->active)) != 1)) { 2384 bpf_prog_inc_misses_counter(prog); 2385 goto out; 2386 } 2387 2388 run_ctx.bpf_cookie = link->cookie; 2389 old_run_ctx = bpf_set_run_ctx(&run_ctx.run_ctx); 2390 2391 rcu_read_lock(); 2392 (void) bpf_prog_run(prog, args); 2393 rcu_read_unlock(); 2394 2395 bpf_reset_run_ctx(old_run_ctx); 2396 out: 2397 this_cpu_dec(*(prog->active)); 2398 } 2399 2400 #define UNPACK(...) __VA_ARGS__ 2401 #define REPEAT_1(FN, DL, X, ...) FN(X) 2402 #define REPEAT_2(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_1(FN, DL, __VA_ARGS__) 2403 #define REPEAT_3(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_2(FN, DL, __VA_ARGS__) 2404 #define REPEAT_4(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_3(FN, DL, __VA_ARGS__) 2405 #define REPEAT_5(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_4(FN, DL, __VA_ARGS__) 2406 #define REPEAT_6(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_5(FN, DL, __VA_ARGS__) 2407 #define REPEAT_7(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_6(FN, DL, __VA_ARGS__) 2408 #define REPEAT_8(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_7(FN, DL, __VA_ARGS__) 2409 #define REPEAT_9(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_8(FN, DL, __VA_ARGS__) 2410 #define REPEAT_10(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_9(FN, DL, __VA_ARGS__) 2411 #define REPEAT_11(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_10(FN, DL, __VA_ARGS__) 2412 #define REPEAT_12(FN, DL, X, ...) FN(X) UNPACK DL REPEAT_11(FN, DL, __VA_ARGS__) 2413 #define REPEAT(X, FN, DL, ...) REPEAT_##X(FN, DL, __VA_ARGS__) 2414 2415 #define SARG(X) u64 arg##X 2416 #define COPY(X) args[X] = arg##X 2417 2418 #define __DL_COM (,) 2419 #define __DL_SEM (;) 2420 2421 #define __SEQ_0_11 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11 2422 2423 #define BPF_TRACE_DEFN_x(x) \ 2424 void bpf_trace_run##x(struct bpf_raw_tp_link *link, \ 2425 REPEAT(x, SARG, __DL_COM, __SEQ_0_11)) \ 2426 { \ 2427 u64 args[x]; \ 2428 REPEAT(x, COPY, __DL_SEM, __SEQ_0_11); \ 2429 __bpf_trace_run(link, args); \ 2430 } \ 2431 EXPORT_SYMBOL_GPL(bpf_trace_run##x) 2432 BPF_TRACE_DEFN_x(1); 2433 BPF_TRACE_DEFN_x(2); 2434 BPF_TRACE_DEFN_x(3); 2435 BPF_TRACE_DEFN_x(4); 2436 BPF_TRACE_DEFN_x(5); 2437 BPF_TRACE_DEFN_x(6); 2438 BPF_TRACE_DEFN_x(7); 2439 BPF_TRACE_DEFN_x(8); 2440 BPF_TRACE_DEFN_x(9); 2441 BPF_TRACE_DEFN_x(10); 2442 BPF_TRACE_DEFN_x(11); 2443 BPF_TRACE_DEFN_x(12); 2444 2445 int bpf_probe_register(struct bpf_raw_event_map *btp, struct bpf_raw_tp_link *link) 2446 { 2447 struct tracepoint *tp = btp->tp; 2448 struct bpf_prog *prog = link->link.prog; 2449 2450 /* 2451 * check that program doesn't access arguments beyond what's 2452 * available in this tracepoint 2453 */ 2454 if (prog->aux->max_ctx_offset > btp->num_args * sizeof(u64)) 2455 return -EINVAL; 2456 2457 if (prog->aux->max_tp_access > btp->writable_size) 2458 return -EINVAL; 2459 2460 return tracepoint_probe_register_may_exist(tp, (void *)btp->bpf_func, link); 2461 } 2462 2463 int bpf_probe_unregister(struct bpf_raw_event_map *btp, struct bpf_raw_tp_link *link) 2464 { 2465 return tracepoint_probe_unregister(btp->tp, (void *)btp->bpf_func, link); 2466 } 2467 2468 int bpf_get_perf_event_info(const struct perf_event *event, u32 *prog_id, 2469 u32 *fd_type, const char **buf, 2470 u64 *probe_offset, u64 *probe_addr, 2471 unsigned long *missed) 2472 { 2473 bool is_tracepoint, is_syscall_tp; 2474 struct bpf_prog *prog; 2475 int flags, err = 0; 2476 2477 prog = event->prog; 2478 if (!prog) 2479 return -ENOENT; 2480 2481 /* not supporting BPF_PROG_TYPE_PERF_EVENT yet */ 2482 if (prog->type == BPF_PROG_TYPE_PERF_EVENT) 2483 return -EOPNOTSUPP; 2484 2485 *prog_id = prog->aux->id; 2486 flags = event->tp_event->flags; 2487 is_tracepoint = flags & TRACE_EVENT_FL_TRACEPOINT; 2488 is_syscall_tp = is_syscall_trace_event(event->tp_event); 2489 2490 if (is_tracepoint || is_syscall_tp) { 2491 *buf = is_tracepoint ? event->tp_event->tp->name 2492 : event->tp_event->name; 2493 /* We allow NULL pointer for tracepoint */ 2494 if (fd_type) 2495 *fd_type = BPF_FD_TYPE_TRACEPOINT; 2496 if (probe_offset) 2497 *probe_offset = 0x0; 2498 if (probe_addr) 2499 *probe_addr = 0x0; 2500 } else { 2501 /* kprobe/uprobe */ 2502 err = -EOPNOTSUPP; 2503 #ifdef CONFIG_KPROBE_EVENTS 2504 if (flags & TRACE_EVENT_FL_KPROBE) 2505 err = bpf_get_kprobe_info(event, fd_type, buf, 2506 probe_offset, probe_addr, missed, 2507 event->attr.type == PERF_TYPE_TRACEPOINT); 2508 #endif 2509 #ifdef CONFIG_UPROBE_EVENTS 2510 if (flags & TRACE_EVENT_FL_UPROBE) 2511 err = bpf_get_uprobe_info(event, fd_type, buf, 2512 probe_offset, probe_addr, 2513 event->attr.type == PERF_TYPE_TRACEPOINT); 2514 #endif 2515 } 2516 2517 return err; 2518 } 2519 2520 static int __init send_signal_irq_work_init(void) 2521 { 2522 int cpu; 2523 struct send_signal_irq_work *work; 2524 2525 for_each_possible_cpu(cpu) { 2526 work = per_cpu_ptr(&send_signal_work, cpu); 2527 init_irq_work(&work->irq_work, do_bpf_send_signal); 2528 } 2529 return 0; 2530 } 2531 2532 subsys_initcall(send_signal_irq_work_init); 2533 2534 #ifdef CONFIG_MODULES 2535 static int bpf_event_notify(struct notifier_block *nb, unsigned long op, 2536 void *module) 2537 { 2538 struct bpf_trace_module *btm, *tmp; 2539 struct module *mod = module; 2540 int ret = 0; 2541 2542 if (mod->num_bpf_raw_events == 0 || 2543 (op != MODULE_STATE_COMING && op != MODULE_STATE_GOING)) 2544 goto out; 2545 2546 mutex_lock(&bpf_module_mutex); 2547 2548 switch (op) { 2549 case MODULE_STATE_COMING: 2550 btm = kzalloc(sizeof(*btm), GFP_KERNEL); 2551 if (btm) { 2552 btm->module = module; 2553 list_add(&btm->list, &bpf_trace_modules); 2554 } else { 2555 ret = -ENOMEM; 2556 } 2557 break; 2558 case MODULE_STATE_GOING: 2559 list_for_each_entry_safe(btm, tmp, &bpf_trace_modules, list) { 2560 if (btm->module == module) { 2561 list_del(&btm->list); 2562 kfree(btm); 2563 break; 2564 } 2565 } 2566 break; 2567 } 2568 2569 mutex_unlock(&bpf_module_mutex); 2570 2571 out: 2572 return notifier_from_errno(ret); 2573 } 2574 2575 static struct notifier_block bpf_module_nb = { 2576 .notifier_call = bpf_event_notify, 2577 }; 2578 2579 static int __init bpf_event_init(void) 2580 { 2581 register_module_notifier(&bpf_module_nb); 2582 return 0; 2583 } 2584 2585 fs_initcall(bpf_event_init); 2586 #endif /* CONFIG_MODULES */ 2587 2588 #ifdef CONFIG_FPROBE 2589 struct bpf_kprobe_multi_link { 2590 struct bpf_link link; 2591 struct fprobe fp; 2592 unsigned long *addrs; 2593 u64 *cookies; 2594 u32 cnt; 2595 u32 mods_cnt; 2596 struct module **mods; 2597 u32 flags; 2598 }; 2599 2600 struct bpf_kprobe_multi_run_ctx { 2601 struct bpf_run_ctx run_ctx; 2602 struct bpf_kprobe_multi_link *link; 2603 unsigned long entry_ip; 2604 }; 2605 2606 struct user_syms { 2607 const char **syms; 2608 char *buf; 2609 }; 2610 2611 static int copy_user_syms(struct user_syms *us, unsigned long __user *usyms, u32 cnt) 2612 { 2613 unsigned long __user usymbol; 2614 const char **syms = NULL; 2615 char *buf = NULL, *p; 2616 int err = -ENOMEM; 2617 unsigned int i; 2618 2619 syms = kvmalloc_array(cnt, sizeof(*syms), GFP_KERNEL); 2620 if (!syms) 2621 goto error; 2622 2623 buf = kvmalloc_array(cnt, KSYM_NAME_LEN, GFP_KERNEL); 2624 if (!buf) 2625 goto error; 2626 2627 for (p = buf, i = 0; i < cnt; i++) { 2628 if (__get_user(usymbol, usyms + i)) { 2629 err = -EFAULT; 2630 goto error; 2631 } 2632 err = strncpy_from_user(p, (const char __user *) usymbol, KSYM_NAME_LEN); 2633 if (err == KSYM_NAME_LEN) 2634 err = -E2BIG; 2635 if (err < 0) 2636 goto error; 2637 syms[i] = p; 2638 p += err + 1; 2639 } 2640 2641 us->syms = syms; 2642 us->buf = buf; 2643 return 0; 2644 2645 error: 2646 if (err) { 2647 kvfree(syms); 2648 kvfree(buf); 2649 } 2650 return err; 2651 } 2652 2653 static void kprobe_multi_put_modules(struct module **mods, u32 cnt) 2654 { 2655 u32 i; 2656 2657 for (i = 0; i < cnt; i++) 2658 module_put(mods[i]); 2659 } 2660 2661 static void free_user_syms(struct user_syms *us) 2662 { 2663 kvfree(us->syms); 2664 kvfree(us->buf); 2665 } 2666 2667 static void bpf_kprobe_multi_link_release(struct bpf_link *link) 2668 { 2669 struct bpf_kprobe_multi_link *kmulti_link; 2670 2671 kmulti_link = container_of(link, struct bpf_kprobe_multi_link, link); 2672 unregister_fprobe(&kmulti_link->fp); 2673 kprobe_multi_put_modules(kmulti_link->mods, kmulti_link->mods_cnt); 2674 } 2675 2676 static void bpf_kprobe_multi_link_dealloc(struct bpf_link *link) 2677 { 2678 struct bpf_kprobe_multi_link *kmulti_link; 2679 2680 kmulti_link = container_of(link, struct bpf_kprobe_multi_link, link); 2681 kvfree(kmulti_link->addrs); 2682 kvfree(kmulti_link->cookies); 2683 kfree(kmulti_link->mods); 2684 kfree(kmulti_link); 2685 } 2686 2687 static int bpf_kprobe_multi_link_fill_link_info(const struct bpf_link *link, 2688 struct bpf_link_info *info) 2689 { 2690 u64 __user *ucookies = u64_to_user_ptr(info->kprobe_multi.cookies); 2691 u64 __user *uaddrs = u64_to_user_ptr(info->kprobe_multi.addrs); 2692 struct bpf_kprobe_multi_link *kmulti_link; 2693 u32 ucount = info->kprobe_multi.count; 2694 int err = 0, i; 2695 2696 if (!uaddrs ^ !ucount) 2697 return -EINVAL; 2698 if (ucookies && !ucount) 2699 return -EINVAL; 2700 2701 kmulti_link = container_of(link, struct bpf_kprobe_multi_link, link); 2702 info->kprobe_multi.count = kmulti_link->cnt; 2703 info->kprobe_multi.flags = kmulti_link->flags; 2704 info->kprobe_multi.missed = kmulti_link->fp.nmissed; 2705 2706 if (!uaddrs) 2707 return 0; 2708 if (ucount < kmulti_link->cnt) 2709 err = -ENOSPC; 2710 else 2711 ucount = kmulti_link->cnt; 2712 2713 if (ucookies) { 2714 if (kmulti_link->cookies) { 2715 if (copy_to_user(ucookies, kmulti_link->cookies, ucount * sizeof(u64))) 2716 return -EFAULT; 2717 } else { 2718 for (i = 0; i < ucount; i++) { 2719 if (put_user(0, ucookies + i)) 2720 return -EFAULT; 2721 } 2722 } 2723 } 2724 2725 if (kallsyms_show_value(current_cred())) { 2726 if (copy_to_user(uaddrs, kmulti_link->addrs, ucount * sizeof(u64))) 2727 return -EFAULT; 2728 } else { 2729 for (i = 0; i < ucount; i++) { 2730 if (put_user(0, uaddrs + i)) 2731 return -EFAULT; 2732 } 2733 } 2734 return err; 2735 } 2736 2737 static const struct bpf_link_ops bpf_kprobe_multi_link_lops = { 2738 .release = bpf_kprobe_multi_link_release, 2739 .dealloc_deferred = bpf_kprobe_multi_link_dealloc, 2740 .fill_link_info = bpf_kprobe_multi_link_fill_link_info, 2741 }; 2742 2743 static void bpf_kprobe_multi_cookie_swap(void *a, void *b, int size, const void *priv) 2744 { 2745 const struct bpf_kprobe_multi_link *link = priv; 2746 unsigned long *addr_a = a, *addr_b = b; 2747 u64 *cookie_a, *cookie_b; 2748 2749 cookie_a = link->cookies + (addr_a - link->addrs); 2750 cookie_b = link->cookies + (addr_b - link->addrs); 2751 2752 /* swap addr_a/addr_b and cookie_a/cookie_b values */ 2753 swap(*addr_a, *addr_b); 2754 swap(*cookie_a, *cookie_b); 2755 } 2756 2757 static int bpf_kprobe_multi_addrs_cmp(const void *a, const void *b) 2758 { 2759 const unsigned long *addr_a = a, *addr_b = b; 2760 2761 if (*addr_a == *addr_b) 2762 return 0; 2763 return *addr_a < *addr_b ? -1 : 1; 2764 } 2765 2766 static int bpf_kprobe_multi_cookie_cmp(const void *a, const void *b, const void *priv) 2767 { 2768 return bpf_kprobe_multi_addrs_cmp(a, b); 2769 } 2770 2771 static u64 bpf_kprobe_multi_cookie(struct bpf_run_ctx *ctx) 2772 { 2773 struct bpf_kprobe_multi_run_ctx *run_ctx; 2774 struct bpf_kprobe_multi_link *link; 2775 u64 *cookie, entry_ip; 2776 unsigned long *addr; 2777 2778 if (WARN_ON_ONCE(!ctx)) 2779 return 0; 2780 run_ctx = container_of(current->bpf_ctx, struct bpf_kprobe_multi_run_ctx, run_ctx); 2781 link = run_ctx->link; 2782 if (!link->cookies) 2783 return 0; 2784 entry_ip = run_ctx->entry_ip; 2785 addr = bsearch(&entry_ip, link->addrs, link->cnt, sizeof(entry_ip), 2786 bpf_kprobe_multi_addrs_cmp); 2787 if (!addr) 2788 return 0; 2789 cookie = link->cookies + (addr - link->addrs); 2790 return *cookie; 2791 } 2792 2793 static u64 bpf_kprobe_multi_entry_ip(struct bpf_run_ctx *ctx) 2794 { 2795 struct bpf_kprobe_multi_run_ctx *run_ctx; 2796 2797 run_ctx = container_of(current->bpf_ctx, struct bpf_kprobe_multi_run_ctx, run_ctx); 2798 return run_ctx->entry_ip; 2799 } 2800 2801 static int 2802 kprobe_multi_link_prog_run(struct bpf_kprobe_multi_link *link, 2803 unsigned long entry_ip, struct pt_regs *regs) 2804 { 2805 struct bpf_kprobe_multi_run_ctx run_ctx = { 2806 .link = link, 2807 .entry_ip = entry_ip, 2808 }; 2809 struct bpf_run_ctx *old_run_ctx; 2810 int err; 2811 2812 if (unlikely(__this_cpu_inc_return(bpf_prog_active) != 1)) { 2813 bpf_prog_inc_misses_counter(link->link.prog); 2814 err = 0; 2815 goto out; 2816 } 2817 2818 migrate_disable(); 2819 rcu_read_lock(); 2820 old_run_ctx = bpf_set_run_ctx(&run_ctx.run_ctx); 2821 err = bpf_prog_run(link->link.prog, regs); 2822 bpf_reset_run_ctx(old_run_ctx); 2823 rcu_read_unlock(); 2824 migrate_enable(); 2825 2826 out: 2827 __this_cpu_dec(bpf_prog_active); 2828 return err; 2829 } 2830 2831 static int 2832 kprobe_multi_link_handler(struct fprobe *fp, unsigned long fentry_ip, 2833 unsigned long ret_ip, struct pt_regs *regs, 2834 void *data) 2835 { 2836 struct bpf_kprobe_multi_link *link; 2837 2838 link = container_of(fp, struct bpf_kprobe_multi_link, fp); 2839 kprobe_multi_link_prog_run(link, get_entry_ip(fentry_ip), regs); 2840 return 0; 2841 } 2842 2843 static void 2844 kprobe_multi_link_exit_handler(struct fprobe *fp, unsigned long fentry_ip, 2845 unsigned long ret_ip, struct pt_regs *regs, 2846 void *data) 2847 { 2848 struct bpf_kprobe_multi_link *link; 2849 2850 link = container_of(fp, struct bpf_kprobe_multi_link, fp); 2851 kprobe_multi_link_prog_run(link, get_entry_ip(fentry_ip), regs); 2852 } 2853 2854 static int symbols_cmp_r(const void *a, const void *b, const void *priv) 2855 { 2856 const char **str_a = (const char **) a; 2857 const char **str_b = (const char **) b; 2858 2859 return strcmp(*str_a, *str_b); 2860 } 2861 2862 struct multi_symbols_sort { 2863 const char **funcs; 2864 u64 *cookies; 2865 }; 2866 2867 static void symbols_swap_r(void *a, void *b, int size, const void *priv) 2868 { 2869 const struct multi_symbols_sort *data = priv; 2870 const char **name_a = a, **name_b = b; 2871 2872 swap(*name_a, *name_b); 2873 2874 /* If defined, swap also related cookies. */ 2875 if (data->cookies) { 2876 u64 *cookie_a, *cookie_b; 2877 2878 cookie_a = data->cookies + (name_a - data->funcs); 2879 cookie_b = data->cookies + (name_b - data->funcs); 2880 swap(*cookie_a, *cookie_b); 2881 } 2882 } 2883 2884 struct modules_array { 2885 struct module **mods; 2886 int mods_cnt; 2887 int mods_cap; 2888 }; 2889 2890 static int add_module(struct modules_array *arr, struct module *mod) 2891 { 2892 struct module **mods; 2893 2894 if (arr->mods_cnt == arr->mods_cap) { 2895 arr->mods_cap = max(16, arr->mods_cap * 3 / 2); 2896 mods = krealloc_array(arr->mods, arr->mods_cap, sizeof(*mods), GFP_KERNEL); 2897 if (!mods) 2898 return -ENOMEM; 2899 arr->mods = mods; 2900 } 2901 2902 arr->mods[arr->mods_cnt] = mod; 2903 arr->mods_cnt++; 2904 return 0; 2905 } 2906 2907 static bool has_module(struct modules_array *arr, struct module *mod) 2908 { 2909 int i; 2910 2911 for (i = arr->mods_cnt - 1; i >= 0; i--) { 2912 if (arr->mods[i] == mod) 2913 return true; 2914 } 2915 return false; 2916 } 2917 2918 static int get_modules_for_addrs(struct module ***mods, unsigned long *addrs, u32 addrs_cnt) 2919 { 2920 struct modules_array arr = {}; 2921 u32 i, err = 0; 2922 2923 for (i = 0; i < addrs_cnt; i++) { 2924 struct module *mod; 2925 2926 preempt_disable(); 2927 mod = __module_address(addrs[i]); 2928 /* Either no module or we it's already stored */ 2929 if (!mod || has_module(&arr, mod)) { 2930 preempt_enable(); 2931 continue; 2932 } 2933 if (!try_module_get(mod)) 2934 err = -EINVAL; 2935 preempt_enable(); 2936 if (err) 2937 break; 2938 err = add_module(&arr, mod); 2939 if (err) { 2940 module_put(mod); 2941 break; 2942 } 2943 } 2944 2945 /* We return either err < 0 in case of error, ... */ 2946 if (err) { 2947 kprobe_multi_put_modules(arr.mods, arr.mods_cnt); 2948 kfree(arr.mods); 2949 return err; 2950 } 2951 2952 /* or number of modules found if everything is ok. */ 2953 *mods = arr.mods; 2954 return arr.mods_cnt; 2955 } 2956 2957 static int addrs_check_error_injection_list(unsigned long *addrs, u32 cnt) 2958 { 2959 u32 i; 2960 2961 for (i = 0; i < cnt; i++) { 2962 if (!within_error_injection_list(addrs[i])) 2963 return -EINVAL; 2964 } 2965 return 0; 2966 } 2967 2968 int bpf_kprobe_multi_link_attach(const union bpf_attr *attr, struct bpf_prog *prog) 2969 { 2970 struct bpf_kprobe_multi_link *link = NULL; 2971 struct bpf_link_primer link_primer; 2972 void __user *ucookies; 2973 unsigned long *addrs; 2974 u32 flags, cnt, size; 2975 void __user *uaddrs; 2976 u64 *cookies = NULL; 2977 void __user *usyms; 2978 int err; 2979 2980 /* no support for 32bit archs yet */ 2981 if (sizeof(u64) != sizeof(void *)) 2982 return -EOPNOTSUPP; 2983 2984 if (prog->expected_attach_type != BPF_TRACE_KPROBE_MULTI) 2985 return -EINVAL; 2986 2987 flags = attr->link_create.kprobe_multi.flags; 2988 if (flags & ~BPF_F_KPROBE_MULTI_RETURN) 2989 return -EINVAL; 2990 2991 uaddrs = u64_to_user_ptr(attr->link_create.kprobe_multi.addrs); 2992 usyms = u64_to_user_ptr(attr->link_create.kprobe_multi.syms); 2993 if (!!uaddrs == !!usyms) 2994 return -EINVAL; 2995 2996 cnt = attr->link_create.kprobe_multi.cnt; 2997 if (!cnt) 2998 return -EINVAL; 2999 if (cnt > MAX_KPROBE_MULTI_CNT) 3000 return -E2BIG; 3001 3002 size = cnt * sizeof(*addrs); 3003 addrs = kvmalloc_array(cnt, sizeof(*addrs), GFP_KERNEL); 3004 if (!addrs) 3005 return -ENOMEM; 3006 3007 ucookies = u64_to_user_ptr(attr->link_create.kprobe_multi.cookies); 3008 if (ucookies) { 3009 cookies = kvmalloc_array(cnt, sizeof(*addrs), GFP_KERNEL); 3010 if (!cookies) { 3011 err = -ENOMEM; 3012 goto error; 3013 } 3014 if (copy_from_user(cookies, ucookies, size)) { 3015 err = -EFAULT; 3016 goto error; 3017 } 3018 } 3019 3020 if (uaddrs) { 3021 if (copy_from_user(addrs, uaddrs, size)) { 3022 err = -EFAULT; 3023 goto error; 3024 } 3025 } else { 3026 struct multi_symbols_sort data = { 3027 .cookies = cookies, 3028 }; 3029 struct user_syms us; 3030 3031 err = copy_user_syms(&us, usyms, cnt); 3032 if (err) 3033 goto error; 3034 3035 if (cookies) 3036 data.funcs = us.syms; 3037 3038 sort_r(us.syms, cnt, sizeof(*us.syms), symbols_cmp_r, 3039 symbols_swap_r, &data); 3040 3041 err = ftrace_lookup_symbols(us.syms, cnt, addrs); 3042 free_user_syms(&us); 3043 if (err) 3044 goto error; 3045 } 3046 3047 if (prog->kprobe_override && addrs_check_error_injection_list(addrs, cnt)) { 3048 err = -EINVAL; 3049 goto error; 3050 } 3051 3052 link = kzalloc(sizeof(*link), GFP_KERNEL); 3053 if (!link) { 3054 err = -ENOMEM; 3055 goto error; 3056 } 3057 3058 bpf_link_init(&link->link, BPF_LINK_TYPE_KPROBE_MULTI, 3059 &bpf_kprobe_multi_link_lops, prog); 3060 3061 err = bpf_link_prime(&link->link, &link_primer); 3062 if (err) 3063 goto error; 3064 3065 if (flags & BPF_F_KPROBE_MULTI_RETURN) 3066 link->fp.exit_handler = kprobe_multi_link_exit_handler; 3067 else 3068 link->fp.entry_handler = kprobe_multi_link_handler; 3069 3070 link->addrs = addrs; 3071 link->cookies = cookies; 3072 link->cnt = cnt; 3073 link->flags = flags; 3074 3075 if (cookies) { 3076 /* 3077 * Sorting addresses will trigger sorting cookies as well 3078 * (check bpf_kprobe_multi_cookie_swap). This way we can 3079 * find cookie based on the address in bpf_get_attach_cookie 3080 * helper. 3081 */ 3082 sort_r(addrs, cnt, sizeof(*addrs), 3083 bpf_kprobe_multi_cookie_cmp, 3084 bpf_kprobe_multi_cookie_swap, 3085 link); 3086 } 3087 3088 err = get_modules_for_addrs(&link->mods, addrs, cnt); 3089 if (err < 0) { 3090 bpf_link_cleanup(&link_primer); 3091 return err; 3092 } 3093 link->mods_cnt = err; 3094 3095 err = register_fprobe_ips(&link->fp, addrs, cnt); 3096 if (err) { 3097 kprobe_multi_put_modules(link->mods, link->mods_cnt); 3098 bpf_link_cleanup(&link_primer); 3099 return err; 3100 } 3101 3102 return bpf_link_settle(&link_primer); 3103 3104 error: 3105 kfree(link); 3106 kvfree(addrs); 3107 kvfree(cookies); 3108 return err; 3109 } 3110 #else /* !CONFIG_FPROBE */ 3111 int bpf_kprobe_multi_link_attach(const union bpf_attr *attr, struct bpf_prog *prog) 3112 { 3113 return -EOPNOTSUPP; 3114 } 3115 static u64 bpf_kprobe_multi_cookie(struct bpf_run_ctx *ctx) 3116 { 3117 return 0; 3118 } 3119 static u64 bpf_kprobe_multi_entry_ip(struct bpf_run_ctx *ctx) 3120 { 3121 return 0; 3122 } 3123 #endif 3124 3125 #ifdef CONFIG_UPROBES 3126 struct bpf_uprobe_multi_link; 3127 3128 struct bpf_uprobe { 3129 struct bpf_uprobe_multi_link *link; 3130 loff_t offset; 3131 unsigned long ref_ctr_offset; 3132 u64 cookie; 3133 struct uprobe_consumer consumer; 3134 }; 3135 3136 struct bpf_uprobe_multi_link { 3137 struct path path; 3138 struct bpf_link link; 3139 u32 cnt; 3140 u32 flags; 3141 struct bpf_uprobe *uprobes; 3142 struct task_struct *task; 3143 }; 3144 3145 struct bpf_uprobe_multi_run_ctx { 3146 struct bpf_run_ctx run_ctx; 3147 unsigned long entry_ip; 3148 struct bpf_uprobe *uprobe; 3149 }; 3150 3151 static void bpf_uprobe_unregister(struct path *path, struct bpf_uprobe *uprobes, 3152 u32 cnt) 3153 { 3154 u32 i; 3155 3156 for (i = 0; i < cnt; i++) { 3157 uprobe_unregister(d_real_inode(path->dentry), uprobes[i].offset, 3158 &uprobes[i].consumer); 3159 } 3160 } 3161 3162 static void bpf_uprobe_multi_link_release(struct bpf_link *link) 3163 { 3164 struct bpf_uprobe_multi_link *umulti_link; 3165 3166 umulti_link = container_of(link, struct bpf_uprobe_multi_link, link); 3167 bpf_uprobe_unregister(&umulti_link->path, umulti_link->uprobes, umulti_link->cnt); 3168 if (umulti_link->task) 3169 put_task_struct(umulti_link->task); 3170 path_put(&umulti_link->path); 3171 } 3172 3173 static void bpf_uprobe_multi_link_dealloc(struct bpf_link *link) 3174 { 3175 struct bpf_uprobe_multi_link *umulti_link; 3176 3177 umulti_link = container_of(link, struct bpf_uprobe_multi_link, link); 3178 kvfree(umulti_link->uprobes); 3179 kfree(umulti_link); 3180 } 3181 3182 static int bpf_uprobe_multi_link_fill_link_info(const struct bpf_link *link, 3183 struct bpf_link_info *info) 3184 { 3185 u64 __user *uref_ctr_offsets = u64_to_user_ptr(info->uprobe_multi.ref_ctr_offsets); 3186 u64 __user *ucookies = u64_to_user_ptr(info->uprobe_multi.cookies); 3187 u64 __user *uoffsets = u64_to_user_ptr(info->uprobe_multi.offsets); 3188 u64 __user *upath = u64_to_user_ptr(info->uprobe_multi.path); 3189 u32 upath_size = info->uprobe_multi.path_size; 3190 struct bpf_uprobe_multi_link *umulti_link; 3191 u32 ucount = info->uprobe_multi.count; 3192 int err = 0, i; 3193 long left; 3194 3195 if (!upath ^ !upath_size) 3196 return -EINVAL; 3197 3198 if ((uoffsets || uref_ctr_offsets || ucookies) && !ucount) 3199 return -EINVAL; 3200 3201 umulti_link = container_of(link, struct bpf_uprobe_multi_link, link); 3202 info->uprobe_multi.count = umulti_link->cnt; 3203 info->uprobe_multi.flags = umulti_link->flags; 3204 info->uprobe_multi.pid = umulti_link->task ? 3205 task_pid_nr_ns(umulti_link->task, task_active_pid_ns(current)) : 0; 3206 3207 if (upath) { 3208 char *p, *buf; 3209 3210 upath_size = min_t(u32, upath_size, PATH_MAX); 3211 3212 buf = kmalloc(upath_size, GFP_KERNEL); 3213 if (!buf) 3214 return -ENOMEM; 3215 p = d_path(&umulti_link->path, buf, upath_size); 3216 if (IS_ERR(p)) { 3217 kfree(buf); 3218 return PTR_ERR(p); 3219 } 3220 upath_size = buf + upath_size - p; 3221 left = copy_to_user(upath, p, upath_size); 3222 kfree(buf); 3223 if (left) 3224 return -EFAULT; 3225 info->uprobe_multi.path_size = upath_size; 3226 } 3227 3228 if (!uoffsets && !ucookies && !uref_ctr_offsets) 3229 return 0; 3230 3231 if (ucount < umulti_link->cnt) 3232 err = -ENOSPC; 3233 else 3234 ucount = umulti_link->cnt; 3235 3236 for (i = 0; i < ucount; i++) { 3237 if (uoffsets && 3238 put_user(umulti_link->uprobes[i].offset, uoffsets + i)) 3239 return -EFAULT; 3240 if (uref_ctr_offsets && 3241 put_user(umulti_link->uprobes[i].ref_ctr_offset, uref_ctr_offsets + i)) 3242 return -EFAULT; 3243 if (ucookies && 3244 put_user(umulti_link->uprobes[i].cookie, ucookies + i)) 3245 return -EFAULT; 3246 } 3247 3248 return err; 3249 } 3250 3251 static const struct bpf_link_ops bpf_uprobe_multi_link_lops = { 3252 .release = bpf_uprobe_multi_link_release, 3253 .dealloc_deferred = bpf_uprobe_multi_link_dealloc, 3254 .fill_link_info = bpf_uprobe_multi_link_fill_link_info, 3255 }; 3256 3257 static int uprobe_prog_run(struct bpf_uprobe *uprobe, 3258 unsigned long entry_ip, 3259 struct pt_regs *regs) 3260 { 3261 struct bpf_uprobe_multi_link *link = uprobe->link; 3262 struct bpf_uprobe_multi_run_ctx run_ctx = { 3263 .entry_ip = entry_ip, 3264 .uprobe = uprobe, 3265 }; 3266 struct bpf_prog *prog = link->link.prog; 3267 bool sleepable = prog->sleepable; 3268 struct bpf_run_ctx *old_run_ctx; 3269 int err = 0; 3270 3271 if (link->task && current != link->task) 3272 return 0; 3273 3274 if (sleepable) 3275 rcu_read_lock_trace(); 3276 else 3277 rcu_read_lock(); 3278 3279 migrate_disable(); 3280 3281 old_run_ctx = bpf_set_run_ctx(&run_ctx.run_ctx); 3282 err = bpf_prog_run(link->link.prog, regs); 3283 bpf_reset_run_ctx(old_run_ctx); 3284 3285 migrate_enable(); 3286 3287 if (sleepable) 3288 rcu_read_unlock_trace(); 3289 else 3290 rcu_read_unlock(); 3291 return err; 3292 } 3293 3294 static bool 3295 uprobe_multi_link_filter(struct uprobe_consumer *con, enum uprobe_filter_ctx ctx, 3296 struct mm_struct *mm) 3297 { 3298 struct bpf_uprobe *uprobe; 3299 3300 uprobe = container_of(con, struct bpf_uprobe, consumer); 3301 return uprobe->link->task->mm == mm; 3302 } 3303 3304 static int 3305 uprobe_multi_link_handler(struct uprobe_consumer *con, struct pt_regs *regs) 3306 { 3307 struct bpf_uprobe *uprobe; 3308 3309 uprobe = container_of(con, struct bpf_uprobe, consumer); 3310 return uprobe_prog_run(uprobe, instruction_pointer(regs), regs); 3311 } 3312 3313 static int 3314 uprobe_multi_link_ret_handler(struct uprobe_consumer *con, unsigned long func, struct pt_regs *regs) 3315 { 3316 struct bpf_uprobe *uprobe; 3317 3318 uprobe = container_of(con, struct bpf_uprobe, consumer); 3319 return uprobe_prog_run(uprobe, func, regs); 3320 } 3321 3322 static u64 bpf_uprobe_multi_entry_ip(struct bpf_run_ctx *ctx) 3323 { 3324 struct bpf_uprobe_multi_run_ctx *run_ctx; 3325 3326 run_ctx = container_of(current->bpf_ctx, struct bpf_uprobe_multi_run_ctx, run_ctx); 3327 return run_ctx->entry_ip; 3328 } 3329 3330 static u64 bpf_uprobe_multi_cookie(struct bpf_run_ctx *ctx) 3331 { 3332 struct bpf_uprobe_multi_run_ctx *run_ctx; 3333 3334 run_ctx = container_of(current->bpf_ctx, struct bpf_uprobe_multi_run_ctx, run_ctx); 3335 return run_ctx->uprobe->cookie; 3336 } 3337 3338 int bpf_uprobe_multi_link_attach(const union bpf_attr *attr, struct bpf_prog *prog) 3339 { 3340 struct bpf_uprobe_multi_link *link = NULL; 3341 unsigned long __user *uref_ctr_offsets; 3342 struct bpf_link_primer link_primer; 3343 struct bpf_uprobe *uprobes = NULL; 3344 struct task_struct *task = NULL; 3345 unsigned long __user *uoffsets; 3346 u64 __user *ucookies; 3347 void __user *upath; 3348 u32 flags, cnt, i; 3349 struct path path; 3350 char *name; 3351 pid_t pid; 3352 int err; 3353 3354 /* no support for 32bit archs yet */ 3355 if (sizeof(u64) != sizeof(void *)) 3356 return -EOPNOTSUPP; 3357 3358 if (prog->expected_attach_type != BPF_TRACE_UPROBE_MULTI) 3359 return -EINVAL; 3360 3361 flags = attr->link_create.uprobe_multi.flags; 3362 if (flags & ~BPF_F_UPROBE_MULTI_RETURN) 3363 return -EINVAL; 3364 3365 /* 3366 * path, offsets and cnt are mandatory, 3367 * ref_ctr_offsets and cookies are optional 3368 */ 3369 upath = u64_to_user_ptr(attr->link_create.uprobe_multi.path); 3370 uoffsets = u64_to_user_ptr(attr->link_create.uprobe_multi.offsets); 3371 cnt = attr->link_create.uprobe_multi.cnt; 3372 3373 if (!upath || !uoffsets || !cnt) 3374 return -EINVAL; 3375 if (cnt > MAX_UPROBE_MULTI_CNT) 3376 return -E2BIG; 3377 3378 uref_ctr_offsets = u64_to_user_ptr(attr->link_create.uprobe_multi.ref_ctr_offsets); 3379 ucookies = u64_to_user_ptr(attr->link_create.uprobe_multi.cookies); 3380 3381 name = strndup_user(upath, PATH_MAX); 3382 if (IS_ERR(name)) { 3383 err = PTR_ERR(name); 3384 return err; 3385 } 3386 3387 err = kern_path(name, LOOKUP_FOLLOW, &path); 3388 kfree(name); 3389 if (err) 3390 return err; 3391 3392 if (!d_is_reg(path.dentry)) { 3393 err = -EBADF; 3394 goto error_path_put; 3395 } 3396 3397 pid = attr->link_create.uprobe_multi.pid; 3398 if (pid) { 3399 rcu_read_lock(); 3400 task = get_pid_task(find_vpid(pid), PIDTYPE_PID); 3401 rcu_read_unlock(); 3402 if (!task) { 3403 err = -ESRCH; 3404 goto error_path_put; 3405 } 3406 } 3407 3408 err = -ENOMEM; 3409 3410 link = kzalloc(sizeof(*link), GFP_KERNEL); 3411 uprobes = kvcalloc(cnt, sizeof(*uprobes), GFP_KERNEL); 3412 3413 if (!uprobes || !link) 3414 goto error_free; 3415 3416 for (i = 0; i < cnt; i++) { 3417 if (__get_user(uprobes[i].offset, uoffsets + i)) { 3418 err = -EFAULT; 3419 goto error_free; 3420 } 3421 if (uprobes[i].offset < 0) { 3422 err = -EINVAL; 3423 goto error_free; 3424 } 3425 if (uref_ctr_offsets && __get_user(uprobes[i].ref_ctr_offset, uref_ctr_offsets + i)) { 3426 err = -EFAULT; 3427 goto error_free; 3428 } 3429 if (ucookies && __get_user(uprobes[i].cookie, ucookies + i)) { 3430 err = -EFAULT; 3431 goto error_free; 3432 } 3433 3434 uprobes[i].link = link; 3435 3436 if (flags & BPF_F_UPROBE_MULTI_RETURN) 3437 uprobes[i].consumer.ret_handler = uprobe_multi_link_ret_handler; 3438 else 3439 uprobes[i].consumer.handler = uprobe_multi_link_handler; 3440 3441 if (pid) 3442 uprobes[i].consumer.filter = uprobe_multi_link_filter; 3443 } 3444 3445 link->cnt = cnt; 3446 link->uprobes = uprobes; 3447 link->path = path; 3448 link->task = task; 3449 link->flags = flags; 3450 3451 bpf_link_init(&link->link, BPF_LINK_TYPE_UPROBE_MULTI, 3452 &bpf_uprobe_multi_link_lops, prog); 3453 3454 for (i = 0; i < cnt; i++) { 3455 err = uprobe_register_refctr(d_real_inode(link->path.dentry), 3456 uprobes[i].offset, 3457 uprobes[i].ref_ctr_offset, 3458 &uprobes[i].consumer); 3459 if (err) { 3460 bpf_uprobe_unregister(&path, uprobes, i); 3461 goto error_free; 3462 } 3463 } 3464 3465 err = bpf_link_prime(&link->link, &link_primer); 3466 if (err) 3467 goto error_free; 3468 3469 return bpf_link_settle(&link_primer); 3470 3471 error_free: 3472 kvfree(uprobes); 3473 kfree(link); 3474 if (task) 3475 put_task_struct(task); 3476 error_path_put: 3477 path_put(&path); 3478 return err; 3479 } 3480 #else /* !CONFIG_UPROBES */ 3481 int bpf_uprobe_multi_link_attach(const union bpf_attr *attr, struct bpf_prog *prog) 3482 { 3483 return -EOPNOTSUPP; 3484 } 3485 static u64 bpf_uprobe_multi_cookie(struct bpf_run_ctx *ctx) 3486 { 3487 return 0; 3488 } 3489 static u64 bpf_uprobe_multi_entry_ip(struct bpf_run_ctx *ctx) 3490 { 3491 return 0; 3492 } 3493 #endif /* CONFIG_UPROBES */ 3494