1 // SPDX-License-Identifier: GPL-2.0 2 /* 3 * linux/fs/proc/base.c 4 * 5 * Copyright (C) 1991, 1992 Linus Torvalds 6 * 7 * proc base directory handling functions 8 * 9 * 1999, Al Viro. Rewritten. Now it covers the whole per-process part. 10 * Instead of using magical inumbers to determine the kind of object 11 * we allocate and fill in-core inodes upon lookup. They don't even 12 * go into icache. We cache the reference to task_struct upon lookup too. 13 * Eventually it should become a filesystem in its own. We don't use the 14 * rest of procfs anymore. 15 * 16 * 17 * Changelog: 18 * 17-Jan-2005 19 * Allan Bezerra 20 * Bruna Moreira <bruna.moreira@indt.org.br> 21 * Edjard Mota <edjard.mota@indt.org.br> 22 * Ilias Biris <ilias.biris@indt.org.br> 23 * Mauricio Lin <mauricio.lin@indt.org.br> 24 * 25 * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT 26 * 27 * A new process specific entry (smaps) included in /proc. It shows the 28 * size of rss for each memory area. The maps entry lacks information 29 * about physical memory size (rss) for each mapped file, i.e., 30 * rss information for executables and library files. 31 * This additional information is useful for any tools that need to know 32 * about physical memory consumption for a process specific library. 33 * 34 * Changelog: 35 * 21-Feb-2005 36 * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT 37 * Pud inclusion in the page table walking. 38 * 39 * ChangeLog: 40 * 10-Mar-2005 41 * 10LE Instituto Nokia de Tecnologia - INdT: 42 * A better way to walks through the page table as suggested by Hugh Dickins. 43 * 44 * Simo Piiroinen <simo.piiroinen@nokia.com>: 45 * Smaps information related to shared, private, clean and dirty pages. 46 * 47 * Paul Mundt <paul.mundt@nokia.com>: 48 * Overall revision about smaps. 49 */ 50 51 #include <linux/uaccess.h> 52 53 #include <linux/errno.h> 54 #include <linux/time.h> 55 #include <linux/proc_fs.h> 56 #include <linux/stat.h> 57 #include <linux/task_io_accounting_ops.h> 58 #include <linux/init.h> 59 #include <linux/capability.h> 60 #include <linux/file.h> 61 #include <linux/fdtable.h> 62 #include <linux/generic-radix-tree.h> 63 #include <linux/string.h> 64 #include <linux/seq_file.h> 65 #include <linux/namei.h> 66 #include <linux/mnt_namespace.h> 67 #include <linux/mm.h> 68 #include <linux/swap.h> 69 #include <linux/rcupdate.h> 70 #include <linux/kallsyms.h> 71 #include <linux/stacktrace.h> 72 #include <linux/resource.h> 73 #include <linux/module.h> 74 #include <linux/mount.h> 75 #include <linux/security.h> 76 #include <linux/ptrace.h> 77 #include <linux/tracehook.h> 78 #include <linux/printk.h> 79 #include <linux/cache.h> 80 #include <linux/cgroup.h> 81 #include <linux/cpuset.h> 82 #include <linux/audit.h> 83 #include <linux/poll.h> 84 #include <linux/nsproxy.h> 85 #include <linux/oom.h> 86 #include <linux/elf.h> 87 #include <linux/pid_namespace.h> 88 #include <linux/user_namespace.h> 89 #include <linux/fs_struct.h> 90 #include <linux/slab.h> 91 #include <linux/sched/autogroup.h> 92 #include <linux/sched/mm.h> 93 #include <linux/sched/coredump.h> 94 #include <linux/sched/debug.h> 95 #include <linux/sched/stat.h> 96 #include <linux/posix-timers.h> 97 #include <linux/time_namespace.h> 98 #include <linux/resctrl.h> 99 #include <trace/events/oom.h> 100 #include "internal.h" 101 #include "fd.h" 102 103 #include "../../lib/kstrtox.h" 104 105 /* NOTE: 106 * Implementing inode permission operations in /proc is almost 107 * certainly an error. Permission checks need to happen during 108 * each system call not at open time. The reason is that most of 109 * what we wish to check for permissions in /proc varies at runtime. 110 * 111 * The classic example of a problem is opening file descriptors 112 * in /proc for a task before it execs a suid executable. 113 */ 114 115 static u8 nlink_tid __ro_after_init; 116 static u8 nlink_tgid __ro_after_init; 117 118 struct pid_entry { 119 const char *name; 120 unsigned int len; 121 umode_t mode; 122 const struct inode_operations *iop; 123 const struct file_operations *fop; 124 union proc_op op; 125 }; 126 127 #define NOD(NAME, MODE, IOP, FOP, OP) { \ 128 .name = (NAME), \ 129 .len = sizeof(NAME) - 1, \ 130 .mode = MODE, \ 131 .iop = IOP, \ 132 .fop = FOP, \ 133 .op = OP, \ 134 } 135 136 #define DIR(NAME, MODE, iops, fops) \ 137 NOD(NAME, (S_IFDIR|(MODE)), &iops, &fops, {} ) 138 #define LNK(NAME, get_link) \ 139 NOD(NAME, (S_IFLNK|S_IRWXUGO), \ 140 &proc_pid_link_inode_operations, NULL, \ 141 { .proc_get_link = get_link } ) 142 #define REG(NAME, MODE, fops) \ 143 NOD(NAME, (S_IFREG|(MODE)), NULL, &fops, {}) 144 #define ONE(NAME, MODE, show) \ 145 NOD(NAME, (S_IFREG|(MODE)), \ 146 NULL, &proc_single_file_operations, \ 147 { .proc_show = show } ) 148 #define ATTR(LSM, NAME, MODE) \ 149 NOD(NAME, (S_IFREG|(MODE)), \ 150 NULL, &proc_pid_attr_operations, \ 151 { .lsm = LSM }) 152 153 /* 154 * Count the number of hardlinks for the pid_entry table, excluding the . 155 * and .. links. 156 */ 157 static unsigned int __init pid_entry_nlink(const struct pid_entry *entries, 158 unsigned int n) 159 { 160 unsigned int i; 161 unsigned int count; 162 163 count = 2; 164 for (i = 0; i < n; ++i) { 165 if (S_ISDIR(entries[i].mode)) 166 ++count; 167 } 168 169 return count; 170 } 171 172 static int get_task_root(struct task_struct *task, struct path *root) 173 { 174 int result = -ENOENT; 175 176 task_lock(task); 177 if (task->fs) { 178 get_fs_root(task->fs, root); 179 result = 0; 180 } 181 task_unlock(task); 182 return result; 183 } 184 185 static int proc_cwd_link(struct dentry *dentry, struct path *path) 186 { 187 struct task_struct *task = get_proc_task(d_inode(dentry)); 188 int result = -ENOENT; 189 190 if (task) { 191 task_lock(task); 192 if (task->fs) { 193 get_fs_pwd(task->fs, path); 194 result = 0; 195 } 196 task_unlock(task); 197 put_task_struct(task); 198 } 199 return result; 200 } 201 202 static int proc_root_link(struct dentry *dentry, struct path *path) 203 { 204 struct task_struct *task = get_proc_task(d_inode(dentry)); 205 int result = -ENOENT; 206 207 if (task) { 208 result = get_task_root(task, path); 209 put_task_struct(task); 210 } 211 return result; 212 } 213 214 /* 215 * If the user used setproctitle(), we just get the string from 216 * user space at arg_start, and limit it to a maximum of one page. 217 */ 218 static ssize_t get_mm_proctitle(struct mm_struct *mm, char __user *buf, 219 size_t count, unsigned long pos, 220 unsigned long arg_start) 221 { 222 char *page; 223 int ret, got; 224 225 if (pos >= PAGE_SIZE) 226 return 0; 227 228 page = (char *)__get_free_page(GFP_KERNEL); 229 if (!page) 230 return -ENOMEM; 231 232 ret = 0; 233 got = access_remote_vm(mm, arg_start, page, PAGE_SIZE, FOLL_ANON); 234 if (got > 0) { 235 int len = strnlen(page, got); 236 237 /* Include the NUL character if it was found */ 238 if (len < got) 239 len++; 240 241 if (len > pos) { 242 len -= pos; 243 if (len > count) 244 len = count; 245 len -= copy_to_user(buf, page+pos, len); 246 if (!len) 247 len = -EFAULT; 248 ret = len; 249 } 250 } 251 free_page((unsigned long)page); 252 return ret; 253 } 254 255 static ssize_t get_mm_cmdline(struct mm_struct *mm, char __user *buf, 256 size_t count, loff_t *ppos) 257 { 258 unsigned long arg_start, arg_end, env_start, env_end; 259 unsigned long pos, len; 260 char *page, c; 261 262 /* Check if process spawned far enough to have cmdline. */ 263 if (!mm->env_end) 264 return 0; 265 266 spin_lock(&mm->arg_lock); 267 arg_start = mm->arg_start; 268 arg_end = mm->arg_end; 269 env_start = mm->env_start; 270 env_end = mm->env_end; 271 spin_unlock(&mm->arg_lock); 272 273 if (arg_start >= arg_end) 274 return 0; 275 276 /* 277 * We allow setproctitle() to overwrite the argument 278 * strings, and overflow past the original end. But 279 * only when it overflows into the environment area. 280 */ 281 if (env_start != arg_end || env_end < env_start) 282 env_start = env_end = arg_end; 283 len = env_end - arg_start; 284 285 /* We're not going to care if "*ppos" has high bits set */ 286 pos = *ppos; 287 if (pos >= len) 288 return 0; 289 if (count > len - pos) 290 count = len - pos; 291 if (!count) 292 return 0; 293 294 /* 295 * Magical special case: if the argv[] end byte is not 296 * zero, the user has overwritten it with setproctitle(3). 297 * 298 * Possible future enhancement: do this only once when 299 * pos is 0, and set a flag in the 'struct file'. 300 */ 301 if (access_remote_vm(mm, arg_end-1, &c, 1, FOLL_ANON) == 1 && c) 302 return get_mm_proctitle(mm, buf, count, pos, arg_start); 303 304 /* 305 * For the non-setproctitle() case we limit things strictly 306 * to the [arg_start, arg_end[ range. 307 */ 308 pos += arg_start; 309 if (pos < arg_start || pos >= arg_end) 310 return 0; 311 if (count > arg_end - pos) 312 count = arg_end - pos; 313 314 page = (char *)__get_free_page(GFP_KERNEL); 315 if (!page) 316 return -ENOMEM; 317 318 len = 0; 319 while (count) { 320 int got; 321 size_t size = min_t(size_t, PAGE_SIZE, count); 322 323 got = access_remote_vm(mm, pos, page, size, FOLL_ANON); 324 if (got <= 0) 325 break; 326 got -= copy_to_user(buf, page, got); 327 if (unlikely(!got)) { 328 if (!len) 329 len = -EFAULT; 330 break; 331 } 332 pos += got; 333 buf += got; 334 len += got; 335 count -= got; 336 } 337 338 free_page((unsigned long)page); 339 return len; 340 } 341 342 static ssize_t get_task_cmdline(struct task_struct *tsk, char __user *buf, 343 size_t count, loff_t *pos) 344 { 345 struct mm_struct *mm; 346 ssize_t ret; 347 348 mm = get_task_mm(tsk); 349 if (!mm) 350 return 0; 351 352 ret = get_mm_cmdline(mm, buf, count, pos); 353 mmput(mm); 354 return ret; 355 } 356 357 static ssize_t proc_pid_cmdline_read(struct file *file, char __user *buf, 358 size_t count, loff_t *pos) 359 { 360 struct task_struct *tsk; 361 ssize_t ret; 362 363 BUG_ON(*pos < 0); 364 365 tsk = get_proc_task(file_inode(file)); 366 if (!tsk) 367 return -ESRCH; 368 ret = get_task_cmdline(tsk, buf, count, pos); 369 put_task_struct(tsk); 370 if (ret > 0) 371 *pos += ret; 372 return ret; 373 } 374 375 static const struct file_operations proc_pid_cmdline_ops = { 376 .read = proc_pid_cmdline_read, 377 .llseek = generic_file_llseek, 378 }; 379 380 #ifdef CONFIG_KALLSYMS 381 /* 382 * Provides a wchan file via kallsyms in a proper one-value-per-file format. 383 * Returns the resolved symbol. If that fails, simply return the address. 384 */ 385 static int proc_pid_wchan(struct seq_file *m, struct pid_namespace *ns, 386 struct pid *pid, struct task_struct *task) 387 { 388 unsigned long wchan; 389 char symname[KSYM_NAME_LEN]; 390 391 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS)) 392 goto print0; 393 394 wchan = get_wchan(task); 395 if (wchan && !lookup_symbol_name(wchan, symname)) { 396 seq_puts(m, symname); 397 return 0; 398 } 399 400 print0: 401 seq_putc(m, '0'); 402 return 0; 403 } 404 #endif /* CONFIG_KALLSYMS */ 405 406 static int lock_trace(struct task_struct *task) 407 { 408 int err = down_read_killable(&task->signal->exec_update_lock); 409 if (err) 410 return err; 411 if (!ptrace_may_access(task, PTRACE_MODE_ATTACH_FSCREDS)) { 412 up_read(&task->signal->exec_update_lock); 413 return -EPERM; 414 } 415 return 0; 416 } 417 418 static void unlock_trace(struct task_struct *task) 419 { 420 up_read(&task->signal->exec_update_lock); 421 } 422 423 #ifdef CONFIG_STACKTRACE 424 425 #define MAX_STACK_TRACE_DEPTH 64 426 427 static int proc_pid_stack(struct seq_file *m, struct pid_namespace *ns, 428 struct pid *pid, struct task_struct *task) 429 { 430 unsigned long *entries; 431 int err; 432 433 /* 434 * The ability to racily run the kernel stack unwinder on a running task 435 * and then observe the unwinder output is scary; while it is useful for 436 * debugging kernel issues, it can also allow an attacker to leak kernel 437 * stack contents. 438 * Doing this in a manner that is at least safe from races would require 439 * some work to ensure that the remote task can not be scheduled; and 440 * even then, this would still expose the unwinder as local attack 441 * surface. 442 * Therefore, this interface is restricted to root. 443 */ 444 if (!file_ns_capable(m->file, &init_user_ns, CAP_SYS_ADMIN)) 445 return -EACCES; 446 447 entries = kmalloc_array(MAX_STACK_TRACE_DEPTH, sizeof(*entries), 448 GFP_KERNEL); 449 if (!entries) 450 return -ENOMEM; 451 452 err = lock_trace(task); 453 if (!err) { 454 unsigned int i, nr_entries; 455 456 nr_entries = stack_trace_save_tsk(task, entries, 457 MAX_STACK_TRACE_DEPTH, 0); 458 459 for (i = 0; i < nr_entries; i++) { 460 seq_printf(m, "[<0>] %pB\n", (void *)entries[i]); 461 } 462 463 unlock_trace(task); 464 } 465 kfree(entries); 466 467 return err; 468 } 469 #endif 470 471 #ifdef CONFIG_SCHED_INFO 472 /* 473 * Provides /proc/PID/schedstat 474 */ 475 static int proc_pid_schedstat(struct seq_file *m, struct pid_namespace *ns, 476 struct pid *pid, struct task_struct *task) 477 { 478 if (unlikely(!sched_info_on())) 479 seq_puts(m, "0 0 0\n"); 480 else 481 seq_printf(m, "%llu %llu %lu\n", 482 (unsigned long long)task->se.sum_exec_runtime, 483 (unsigned long long)task->sched_info.run_delay, 484 task->sched_info.pcount); 485 486 return 0; 487 } 488 #endif 489 490 #ifdef CONFIG_LATENCYTOP 491 static int lstats_show_proc(struct seq_file *m, void *v) 492 { 493 int i; 494 struct inode *inode = m->private; 495 struct task_struct *task = get_proc_task(inode); 496 497 if (!task) 498 return -ESRCH; 499 seq_puts(m, "Latency Top version : v0.1\n"); 500 for (i = 0; i < LT_SAVECOUNT; i++) { 501 struct latency_record *lr = &task->latency_record[i]; 502 if (lr->backtrace[0]) { 503 int q; 504 seq_printf(m, "%i %li %li", 505 lr->count, lr->time, lr->max); 506 for (q = 0; q < LT_BACKTRACEDEPTH; q++) { 507 unsigned long bt = lr->backtrace[q]; 508 509 if (!bt) 510 break; 511 seq_printf(m, " %ps", (void *)bt); 512 } 513 seq_putc(m, '\n'); 514 } 515 516 } 517 put_task_struct(task); 518 return 0; 519 } 520 521 static int lstats_open(struct inode *inode, struct file *file) 522 { 523 return single_open(file, lstats_show_proc, inode); 524 } 525 526 static ssize_t lstats_write(struct file *file, const char __user *buf, 527 size_t count, loff_t *offs) 528 { 529 struct task_struct *task = get_proc_task(file_inode(file)); 530 531 if (!task) 532 return -ESRCH; 533 clear_tsk_latency_tracing(task); 534 put_task_struct(task); 535 536 return count; 537 } 538 539 static const struct file_operations proc_lstats_operations = { 540 .open = lstats_open, 541 .read = seq_read, 542 .write = lstats_write, 543 .llseek = seq_lseek, 544 .release = single_release, 545 }; 546 547 #endif 548 549 static int proc_oom_score(struct seq_file *m, struct pid_namespace *ns, 550 struct pid *pid, struct task_struct *task) 551 { 552 unsigned long totalpages = totalram_pages() + total_swap_pages; 553 unsigned long points = 0; 554 long badness; 555 556 badness = oom_badness(task, totalpages); 557 /* 558 * Special case OOM_SCORE_ADJ_MIN for all others scale the 559 * badness value into [0, 2000] range which we have been 560 * exporting for a long time so userspace might depend on it. 561 */ 562 if (badness != LONG_MIN) 563 points = (1000 + badness * 1000 / (long)totalpages) * 2 / 3; 564 565 seq_printf(m, "%lu\n", points); 566 567 return 0; 568 } 569 570 struct limit_names { 571 const char *name; 572 const char *unit; 573 }; 574 575 static const struct limit_names lnames[RLIM_NLIMITS] = { 576 [RLIMIT_CPU] = {"Max cpu time", "seconds"}, 577 [RLIMIT_FSIZE] = {"Max file size", "bytes"}, 578 [RLIMIT_DATA] = {"Max data size", "bytes"}, 579 [RLIMIT_STACK] = {"Max stack size", "bytes"}, 580 [RLIMIT_CORE] = {"Max core file size", "bytes"}, 581 [RLIMIT_RSS] = {"Max resident set", "bytes"}, 582 [RLIMIT_NPROC] = {"Max processes", "processes"}, 583 [RLIMIT_NOFILE] = {"Max open files", "files"}, 584 [RLIMIT_MEMLOCK] = {"Max locked memory", "bytes"}, 585 [RLIMIT_AS] = {"Max address space", "bytes"}, 586 [RLIMIT_LOCKS] = {"Max file locks", "locks"}, 587 [RLIMIT_SIGPENDING] = {"Max pending signals", "signals"}, 588 [RLIMIT_MSGQUEUE] = {"Max msgqueue size", "bytes"}, 589 [RLIMIT_NICE] = {"Max nice priority", NULL}, 590 [RLIMIT_RTPRIO] = {"Max realtime priority", NULL}, 591 [RLIMIT_RTTIME] = {"Max realtime timeout", "us"}, 592 }; 593 594 /* Display limits for a process */ 595 static int proc_pid_limits(struct seq_file *m, struct pid_namespace *ns, 596 struct pid *pid, struct task_struct *task) 597 { 598 unsigned int i; 599 unsigned long flags; 600 601 struct rlimit rlim[RLIM_NLIMITS]; 602 603 if (!lock_task_sighand(task, &flags)) 604 return 0; 605 memcpy(rlim, task->signal->rlim, sizeof(struct rlimit) * RLIM_NLIMITS); 606 unlock_task_sighand(task, &flags); 607 608 /* 609 * print the file header 610 */ 611 seq_puts(m, "Limit " 612 "Soft Limit " 613 "Hard Limit " 614 "Units \n"); 615 616 for (i = 0; i < RLIM_NLIMITS; i++) { 617 if (rlim[i].rlim_cur == RLIM_INFINITY) 618 seq_printf(m, "%-25s %-20s ", 619 lnames[i].name, "unlimited"); 620 else 621 seq_printf(m, "%-25s %-20lu ", 622 lnames[i].name, rlim[i].rlim_cur); 623 624 if (rlim[i].rlim_max == RLIM_INFINITY) 625 seq_printf(m, "%-20s ", "unlimited"); 626 else 627 seq_printf(m, "%-20lu ", rlim[i].rlim_max); 628 629 if (lnames[i].unit) 630 seq_printf(m, "%-10s\n", lnames[i].unit); 631 else 632 seq_putc(m, '\n'); 633 } 634 635 return 0; 636 } 637 638 #ifdef CONFIG_HAVE_ARCH_TRACEHOOK 639 static int proc_pid_syscall(struct seq_file *m, struct pid_namespace *ns, 640 struct pid *pid, struct task_struct *task) 641 { 642 struct syscall_info info; 643 u64 *args = &info.data.args[0]; 644 int res; 645 646 res = lock_trace(task); 647 if (res) 648 return res; 649 650 if (task_current_syscall(task, &info)) 651 seq_puts(m, "running\n"); 652 else if (info.data.nr < 0) 653 seq_printf(m, "%d 0x%llx 0x%llx\n", 654 info.data.nr, info.sp, info.data.instruction_pointer); 655 else 656 seq_printf(m, 657 "%d 0x%llx 0x%llx 0x%llx 0x%llx 0x%llx 0x%llx 0x%llx 0x%llx\n", 658 info.data.nr, 659 args[0], args[1], args[2], args[3], args[4], args[5], 660 info.sp, info.data.instruction_pointer); 661 unlock_trace(task); 662 663 return 0; 664 } 665 #endif /* CONFIG_HAVE_ARCH_TRACEHOOK */ 666 667 /************************************************************************/ 668 /* Here the fs part begins */ 669 /************************************************************************/ 670 671 /* permission checks */ 672 static int proc_fd_access_allowed(struct inode *inode) 673 { 674 struct task_struct *task; 675 int allowed = 0; 676 /* Allow access to a task's file descriptors if it is us or we 677 * may use ptrace attach to the process and find out that 678 * information. 679 */ 680 task = get_proc_task(inode); 681 if (task) { 682 allowed = ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS); 683 put_task_struct(task); 684 } 685 return allowed; 686 } 687 688 int proc_setattr(struct user_namespace *mnt_userns, struct dentry *dentry, 689 struct iattr *attr) 690 { 691 int error; 692 struct inode *inode = d_inode(dentry); 693 694 if (attr->ia_valid & ATTR_MODE) 695 return -EPERM; 696 697 error = setattr_prepare(&init_user_ns, dentry, attr); 698 if (error) 699 return error; 700 701 setattr_copy(&init_user_ns, inode, attr); 702 mark_inode_dirty(inode); 703 return 0; 704 } 705 706 /* 707 * May current process learn task's sched/cmdline info (for hide_pid_min=1) 708 * or euid/egid (for hide_pid_min=2)? 709 */ 710 static bool has_pid_permissions(struct proc_fs_info *fs_info, 711 struct task_struct *task, 712 enum proc_hidepid hide_pid_min) 713 { 714 /* 715 * If 'hidpid' mount option is set force a ptrace check, 716 * we indicate that we are using a filesystem syscall 717 * by passing PTRACE_MODE_READ_FSCREDS 718 */ 719 if (fs_info->hide_pid == HIDEPID_NOT_PTRACEABLE) 720 return ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS); 721 722 if (fs_info->hide_pid < hide_pid_min) 723 return true; 724 if (in_group_p(fs_info->pid_gid)) 725 return true; 726 return ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS); 727 } 728 729 730 static int proc_pid_permission(struct user_namespace *mnt_userns, 731 struct inode *inode, int mask) 732 { 733 struct proc_fs_info *fs_info = proc_sb_info(inode->i_sb); 734 struct task_struct *task; 735 bool has_perms; 736 737 task = get_proc_task(inode); 738 if (!task) 739 return -ESRCH; 740 has_perms = has_pid_permissions(fs_info, task, HIDEPID_NO_ACCESS); 741 put_task_struct(task); 742 743 if (!has_perms) { 744 if (fs_info->hide_pid == HIDEPID_INVISIBLE) { 745 /* 746 * Let's make getdents(), stat(), and open() 747 * consistent with each other. If a process 748 * may not stat() a file, it shouldn't be seen 749 * in procfs at all. 750 */ 751 return -ENOENT; 752 } 753 754 return -EPERM; 755 } 756 return generic_permission(&init_user_ns, inode, mask); 757 } 758 759 760 761 static const struct inode_operations proc_def_inode_operations = { 762 .setattr = proc_setattr, 763 }; 764 765 static int proc_single_show(struct seq_file *m, void *v) 766 { 767 struct inode *inode = m->private; 768 struct pid_namespace *ns = proc_pid_ns(inode->i_sb); 769 struct pid *pid = proc_pid(inode); 770 struct task_struct *task; 771 int ret; 772 773 task = get_pid_task(pid, PIDTYPE_PID); 774 if (!task) 775 return -ESRCH; 776 777 ret = PROC_I(inode)->op.proc_show(m, ns, pid, task); 778 779 put_task_struct(task); 780 return ret; 781 } 782 783 static int proc_single_open(struct inode *inode, struct file *filp) 784 { 785 return single_open(filp, proc_single_show, inode); 786 } 787 788 static const struct file_operations proc_single_file_operations = { 789 .open = proc_single_open, 790 .read = seq_read, 791 .llseek = seq_lseek, 792 .release = single_release, 793 }; 794 795 796 struct mm_struct *proc_mem_open(struct inode *inode, unsigned int mode) 797 { 798 struct task_struct *task = get_proc_task(inode); 799 struct mm_struct *mm = ERR_PTR(-ESRCH); 800 801 if (task) { 802 mm = mm_access(task, mode | PTRACE_MODE_FSCREDS); 803 put_task_struct(task); 804 805 if (!IS_ERR_OR_NULL(mm)) { 806 /* ensure this mm_struct can't be freed */ 807 mmgrab(mm); 808 /* but do not pin its memory */ 809 mmput(mm); 810 } 811 } 812 813 return mm; 814 } 815 816 static int __mem_open(struct inode *inode, struct file *file, unsigned int mode) 817 { 818 struct mm_struct *mm = proc_mem_open(inode, mode); 819 820 if (IS_ERR(mm)) 821 return PTR_ERR(mm); 822 823 file->private_data = mm; 824 return 0; 825 } 826 827 static int mem_open(struct inode *inode, struct file *file) 828 { 829 int ret = __mem_open(inode, file, PTRACE_MODE_ATTACH); 830 831 /* OK to pass negative loff_t, we can catch out-of-range */ 832 file->f_mode |= FMODE_UNSIGNED_OFFSET; 833 834 return ret; 835 } 836 837 static ssize_t mem_rw(struct file *file, char __user *buf, 838 size_t count, loff_t *ppos, int write) 839 { 840 struct mm_struct *mm = file->private_data; 841 unsigned long addr = *ppos; 842 ssize_t copied; 843 char *page; 844 unsigned int flags; 845 846 if (!mm) 847 return 0; 848 849 page = (char *)__get_free_page(GFP_KERNEL); 850 if (!page) 851 return -ENOMEM; 852 853 copied = 0; 854 if (!mmget_not_zero(mm)) 855 goto free; 856 857 flags = FOLL_FORCE | (write ? FOLL_WRITE : 0); 858 859 while (count > 0) { 860 int this_len = min_t(int, count, PAGE_SIZE); 861 862 if (write && copy_from_user(page, buf, this_len)) { 863 copied = -EFAULT; 864 break; 865 } 866 867 this_len = access_remote_vm(mm, addr, page, this_len, flags); 868 if (!this_len) { 869 if (!copied) 870 copied = -EIO; 871 break; 872 } 873 874 if (!write && copy_to_user(buf, page, this_len)) { 875 copied = -EFAULT; 876 break; 877 } 878 879 buf += this_len; 880 addr += this_len; 881 copied += this_len; 882 count -= this_len; 883 } 884 *ppos = addr; 885 886 mmput(mm); 887 free: 888 free_page((unsigned long) page); 889 return copied; 890 } 891 892 static ssize_t mem_read(struct file *file, char __user *buf, 893 size_t count, loff_t *ppos) 894 { 895 return mem_rw(file, buf, count, ppos, 0); 896 } 897 898 static ssize_t mem_write(struct file *file, const char __user *buf, 899 size_t count, loff_t *ppos) 900 { 901 return mem_rw(file, (char __user*)buf, count, ppos, 1); 902 } 903 904 loff_t mem_lseek(struct file *file, loff_t offset, int orig) 905 { 906 switch (orig) { 907 case 0: 908 file->f_pos = offset; 909 break; 910 case 1: 911 file->f_pos += offset; 912 break; 913 default: 914 return -EINVAL; 915 } 916 force_successful_syscall_return(); 917 return file->f_pos; 918 } 919 920 static int mem_release(struct inode *inode, struct file *file) 921 { 922 struct mm_struct *mm = file->private_data; 923 if (mm) 924 mmdrop(mm); 925 return 0; 926 } 927 928 static const struct file_operations proc_mem_operations = { 929 .llseek = mem_lseek, 930 .read = mem_read, 931 .write = mem_write, 932 .open = mem_open, 933 .release = mem_release, 934 }; 935 936 static int environ_open(struct inode *inode, struct file *file) 937 { 938 return __mem_open(inode, file, PTRACE_MODE_READ); 939 } 940 941 static ssize_t environ_read(struct file *file, char __user *buf, 942 size_t count, loff_t *ppos) 943 { 944 char *page; 945 unsigned long src = *ppos; 946 int ret = 0; 947 struct mm_struct *mm = file->private_data; 948 unsigned long env_start, env_end; 949 950 /* Ensure the process spawned far enough to have an environment. */ 951 if (!mm || !mm->env_end) 952 return 0; 953 954 page = (char *)__get_free_page(GFP_KERNEL); 955 if (!page) 956 return -ENOMEM; 957 958 ret = 0; 959 if (!mmget_not_zero(mm)) 960 goto free; 961 962 spin_lock(&mm->arg_lock); 963 env_start = mm->env_start; 964 env_end = mm->env_end; 965 spin_unlock(&mm->arg_lock); 966 967 while (count > 0) { 968 size_t this_len, max_len; 969 int retval; 970 971 if (src >= (env_end - env_start)) 972 break; 973 974 this_len = env_end - (env_start + src); 975 976 max_len = min_t(size_t, PAGE_SIZE, count); 977 this_len = min(max_len, this_len); 978 979 retval = access_remote_vm(mm, (env_start + src), page, this_len, FOLL_ANON); 980 981 if (retval <= 0) { 982 ret = retval; 983 break; 984 } 985 986 if (copy_to_user(buf, page, retval)) { 987 ret = -EFAULT; 988 break; 989 } 990 991 ret += retval; 992 src += retval; 993 buf += retval; 994 count -= retval; 995 } 996 *ppos = src; 997 mmput(mm); 998 999 free: 1000 free_page((unsigned long) page); 1001 return ret; 1002 } 1003 1004 static const struct file_operations proc_environ_operations = { 1005 .open = environ_open, 1006 .read = environ_read, 1007 .llseek = generic_file_llseek, 1008 .release = mem_release, 1009 }; 1010 1011 static int auxv_open(struct inode *inode, struct file *file) 1012 { 1013 return __mem_open(inode, file, PTRACE_MODE_READ_FSCREDS); 1014 } 1015 1016 static ssize_t auxv_read(struct file *file, char __user *buf, 1017 size_t count, loff_t *ppos) 1018 { 1019 struct mm_struct *mm = file->private_data; 1020 unsigned int nwords = 0; 1021 1022 if (!mm) 1023 return 0; 1024 do { 1025 nwords += 2; 1026 } while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */ 1027 return simple_read_from_buffer(buf, count, ppos, mm->saved_auxv, 1028 nwords * sizeof(mm->saved_auxv[0])); 1029 } 1030 1031 static const struct file_operations proc_auxv_operations = { 1032 .open = auxv_open, 1033 .read = auxv_read, 1034 .llseek = generic_file_llseek, 1035 .release = mem_release, 1036 }; 1037 1038 static ssize_t oom_adj_read(struct file *file, char __user *buf, size_t count, 1039 loff_t *ppos) 1040 { 1041 struct task_struct *task = get_proc_task(file_inode(file)); 1042 char buffer[PROC_NUMBUF]; 1043 int oom_adj = OOM_ADJUST_MIN; 1044 size_t len; 1045 1046 if (!task) 1047 return -ESRCH; 1048 if (task->signal->oom_score_adj == OOM_SCORE_ADJ_MAX) 1049 oom_adj = OOM_ADJUST_MAX; 1050 else 1051 oom_adj = (task->signal->oom_score_adj * -OOM_DISABLE) / 1052 OOM_SCORE_ADJ_MAX; 1053 put_task_struct(task); 1054 if (oom_adj > OOM_ADJUST_MAX) 1055 oom_adj = OOM_ADJUST_MAX; 1056 len = snprintf(buffer, sizeof(buffer), "%d\n", oom_adj); 1057 return simple_read_from_buffer(buf, count, ppos, buffer, len); 1058 } 1059 1060 static int __set_oom_adj(struct file *file, int oom_adj, bool legacy) 1061 { 1062 struct mm_struct *mm = NULL; 1063 struct task_struct *task; 1064 int err = 0; 1065 1066 task = get_proc_task(file_inode(file)); 1067 if (!task) 1068 return -ESRCH; 1069 1070 mutex_lock(&oom_adj_mutex); 1071 if (legacy) { 1072 if (oom_adj < task->signal->oom_score_adj && 1073 !capable(CAP_SYS_RESOURCE)) { 1074 err = -EACCES; 1075 goto err_unlock; 1076 } 1077 /* 1078 * /proc/pid/oom_adj is provided for legacy purposes, ask users to use 1079 * /proc/pid/oom_score_adj instead. 1080 */ 1081 pr_warn_once("%s (%d): /proc/%d/oom_adj is deprecated, please use /proc/%d/oom_score_adj instead.\n", 1082 current->comm, task_pid_nr(current), task_pid_nr(task), 1083 task_pid_nr(task)); 1084 } else { 1085 if ((short)oom_adj < task->signal->oom_score_adj_min && 1086 !capable(CAP_SYS_RESOURCE)) { 1087 err = -EACCES; 1088 goto err_unlock; 1089 } 1090 } 1091 1092 /* 1093 * Make sure we will check other processes sharing the mm if this is 1094 * not vfrok which wants its own oom_score_adj. 1095 * pin the mm so it doesn't go away and get reused after task_unlock 1096 */ 1097 if (!task->vfork_done) { 1098 struct task_struct *p = find_lock_task_mm(task); 1099 1100 if (p) { 1101 if (test_bit(MMF_MULTIPROCESS, &p->mm->flags)) { 1102 mm = p->mm; 1103 mmgrab(mm); 1104 } 1105 task_unlock(p); 1106 } 1107 } 1108 1109 task->signal->oom_score_adj = oom_adj; 1110 if (!legacy && has_capability_noaudit(current, CAP_SYS_RESOURCE)) 1111 task->signal->oom_score_adj_min = (short)oom_adj; 1112 trace_oom_score_adj_update(task); 1113 1114 if (mm) { 1115 struct task_struct *p; 1116 1117 rcu_read_lock(); 1118 for_each_process(p) { 1119 if (same_thread_group(task, p)) 1120 continue; 1121 1122 /* do not touch kernel threads or the global init */ 1123 if (p->flags & PF_KTHREAD || is_global_init(p)) 1124 continue; 1125 1126 task_lock(p); 1127 if (!p->vfork_done && process_shares_mm(p, mm)) { 1128 p->signal->oom_score_adj = oom_adj; 1129 if (!legacy && has_capability_noaudit(current, CAP_SYS_RESOURCE)) 1130 p->signal->oom_score_adj_min = (short)oom_adj; 1131 } 1132 task_unlock(p); 1133 } 1134 rcu_read_unlock(); 1135 mmdrop(mm); 1136 } 1137 err_unlock: 1138 mutex_unlock(&oom_adj_mutex); 1139 put_task_struct(task); 1140 return err; 1141 } 1142 1143 /* 1144 * /proc/pid/oom_adj exists solely for backwards compatibility with previous 1145 * kernels. The effective policy is defined by oom_score_adj, which has a 1146 * different scale: oom_adj grew exponentially and oom_score_adj grows linearly. 1147 * Values written to oom_adj are simply mapped linearly to oom_score_adj. 1148 * Processes that become oom disabled via oom_adj will still be oom disabled 1149 * with this implementation. 1150 * 1151 * oom_adj cannot be removed since existing userspace binaries use it. 1152 */ 1153 static ssize_t oom_adj_write(struct file *file, const char __user *buf, 1154 size_t count, loff_t *ppos) 1155 { 1156 char buffer[PROC_NUMBUF]; 1157 int oom_adj; 1158 int err; 1159 1160 memset(buffer, 0, sizeof(buffer)); 1161 if (count > sizeof(buffer) - 1) 1162 count = sizeof(buffer) - 1; 1163 if (copy_from_user(buffer, buf, count)) { 1164 err = -EFAULT; 1165 goto out; 1166 } 1167 1168 err = kstrtoint(strstrip(buffer), 0, &oom_adj); 1169 if (err) 1170 goto out; 1171 if ((oom_adj < OOM_ADJUST_MIN || oom_adj > OOM_ADJUST_MAX) && 1172 oom_adj != OOM_DISABLE) { 1173 err = -EINVAL; 1174 goto out; 1175 } 1176 1177 /* 1178 * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum 1179 * value is always attainable. 1180 */ 1181 if (oom_adj == OOM_ADJUST_MAX) 1182 oom_adj = OOM_SCORE_ADJ_MAX; 1183 else 1184 oom_adj = (oom_adj * OOM_SCORE_ADJ_MAX) / -OOM_DISABLE; 1185 1186 err = __set_oom_adj(file, oom_adj, true); 1187 out: 1188 return err < 0 ? err : count; 1189 } 1190 1191 static const struct file_operations proc_oom_adj_operations = { 1192 .read = oom_adj_read, 1193 .write = oom_adj_write, 1194 .llseek = generic_file_llseek, 1195 }; 1196 1197 static ssize_t oom_score_adj_read(struct file *file, char __user *buf, 1198 size_t count, loff_t *ppos) 1199 { 1200 struct task_struct *task = get_proc_task(file_inode(file)); 1201 char buffer[PROC_NUMBUF]; 1202 short oom_score_adj = OOM_SCORE_ADJ_MIN; 1203 size_t len; 1204 1205 if (!task) 1206 return -ESRCH; 1207 oom_score_adj = task->signal->oom_score_adj; 1208 put_task_struct(task); 1209 len = snprintf(buffer, sizeof(buffer), "%hd\n", oom_score_adj); 1210 return simple_read_from_buffer(buf, count, ppos, buffer, len); 1211 } 1212 1213 static ssize_t oom_score_adj_write(struct file *file, const char __user *buf, 1214 size_t count, loff_t *ppos) 1215 { 1216 char buffer[PROC_NUMBUF]; 1217 int oom_score_adj; 1218 int err; 1219 1220 memset(buffer, 0, sizeof(buffer)); 1221 if (count > sizeof(buffer) - 1) 1222 count = sizeof(buffer) - 1; 1223 if (copy_from_user(buffer, buf, count)) { 1224 err = -EFAULT; 1225 goto out; 1226 } 1227 1228 err = kstrtoint(strstrip(buffer), 0, &oom_score_adj); 1229 if (err) 1230 goto out; 1231 if (oom_score_adj < OOM_SCORE_ADJ_MIN || 1232 oom_score_adj > OOM_SCORE_ADJ_MAX) { 1233 err = -EINVAL; 1234 goto out; 1235 } 1236 1237 err = __set_oom_adj(file, oom_score_adj, false); 1238 out: 1239 return err < 0 ? err : count; 1240 } 1241 1242 static const struct file_operations proc_oom_score_adj_operations = { 1243 .read = oom_score_adj_read, 1244 .write = oom_score_adj_write, 1245 .llseek = default_llseek, 1246 }; 1247 1248 #ifdef CONFIG_AUDIT 1249 #define TMPBUFLEN 11 1250 static ssize_t proc_loginuid_read(struct file * file, char __user * buf, 1251 size_t count, loff_t *ppos) 1252 { 1253 struct inode * inode = file_inode(file); 1254 struct task_struct *task = get_proc_task(inode); 1255 ssize_t length; 1256 char tmpbuf[TMPBUFLEN]; 1257 1258 if (!task) 1259 return -ESRCH; 1260 length = scnprintf(tmpbuf, TMPBUFLEN, "%u", 1261 from_kuid(file->f_cred->user_ns, 1262 audit_get_loginuid(task))); 1263 put_task_struct(task); 1264 return simple_read_from_buffer(buf, count, ppos, tmpbuf, length); 1265 } 1266 1267 static ssize_t proc_loginuid_write(struct file * file, const char __user * buf, 1268 size_t count, loff_t *ppos) 1269 { 1270 struct inode * inode = file_inode(file); 1271 uid_t loginuid; 1272 kuid_t kloginuid; 1273 int rv; 1274 1275 /* Don't let kthreads write their own loginuid */ 1276 if (current->flags & PF_KTHREAD) 1277 return -EPERM; 1278 1279 rcu_read_lock(); 1280 if (current != pid_task(proc_pid(inode), PIDTYPE_PID)) { 1281 rcu_read_unlock(); 1282 return -EPERM; 1283 } 1284 rcu_read_unlock(); 1285 1286 if (*ppos != 0) { 1287 /* No partial writes. */ 1288 return -EINVAL; 1289 } 1290 1291 rv = kstrtou32_from_user(buf, count, 10, &loginuid); 1292 if (rv < 0) 1293 return rv; 1294 1295 /* is userspace tring to explicitly UNSET the loginuid? */ 1296 if (loginuid == AUDIT_UID_UNSET) { 1297 kloginuid = INVALID_UID; 1298 } else { 1299 kloginuid = make_kuid(file->f_cred->user_ns, loginuid); 1300 if (!uid_valid(kloginuid)) 1301 return -EINVAL; 1302 } 1303 1304 rv = audit_set_loginuid(kloginuid); 1305 if (rv < 0) 1306 return rv; 1307 return count; 1308 } 1309 1310 static const struct file_operations proc_loginuid_operations = { 1311 .read = proc_loginuid_read, 1312 .write = proc_loginuid_write, 1313 .llseek = generic_file_llseek, 1314 }; 1315 1316 static ssize_t proc_sessionid_read(struct file * file, char __user * buf, 1317 size_t count, loff_t *ppos) 1318 { 1319 struct inode * inode = file_inode(file); 1320 struct task_struct *task = get_proc_task(inode); 1321 ssize_t length; 1322 char tmpbuf[TMPBUFLEN]; 1323 1324 if (!task) 1325 return -ESRCH; 1326 length = scnprintf(tmpbuf, TMPBUFLEN, "%u", 1327 audit_get_sessionid(task)); 1328 put_task_struct(task); 1329 return simple_read_from_buffer(buf, count, ppos, tmpbuf, length); 1330 } 1331 1332 static const struct file_operations proc_sessionid_operations = { 1333 .read = proc_sessionid_read, 1334 .llseek = generic_file_llseek, 1335 }; 1336 #endif 1337 1338 #ifdef CONFIG_FAULT_INJECTION 1339 static ssize_t proc_fault_inject_read(struct file * file, char __user * buf, 1340 size_t count, loff_t *ppos) 1341 { 1342 struct task_struct *task = get_proc_task(file_inode(file)); 1343 char buffer[PROC_NUMBUF]; 1344 size_t len; 1345 int make_it_fail; 1346 1347 if (!task) 1348 return -ESRCH; 1349 make_it_fail = task->make_it_fail; 1350 put_task_struct(task); 1351 1352 len = snprintf(buffer, sizeof(buffer), "%i\n", make_it_fail); 1353 1354 return simple_read_from_buffer(buf, count, ppos, buffer, len); 1355 } 1356 1357 static ssize_t proc_fault_inject_write(struct file * file, 1358 const char __user * buf, size_t count, loff_t *ppos) 1359 { 1360 struct task_struct *task; 1361 char buffer[PROC_NUMBUF]; 1362 int make_it_fail; 1363 int rv; 1364 1365 if (!capable(CAP_SYS_RESOURCE)) 1366 return -EPERM; 1367 memset(buffer, 0, sizeof(buffer)); 1368 if (count > sizeof(buffer) - 1) 1369 count = sizeof(buffer) - 1; 1370 if (copy_from_user(buffer, buf, count)) 1371 return -EFAULT; 1372 rv = kstrtoint(strstrip(buffer), 0, &make_it_fail); 1373 if (rv < 0) 1374 return rv; 1375 if (make_it_fail < 0 || make_it_fail > 1) 1376 return -EINVAL; 1377 1378 task = get_proc_task(file_inode(file)); 1379 if (!task) 1380 return -ESRCH; 1381 task->make_it_fail = make_it_fail; 1382 put_task_struct(task); 1383 1384 return count; 1385 } 1386 1387 static const struct file_operations proc_fault_inject_operations = { 1388 .read = proc_fault_inject_read, 1389 .write = proc_fault_inject_write, 1390 .llseek = generic_file_llseek, 1391 }; 1392 1393 static ssize_t proc_fail_nth_write(struct file *file, const char __user *buf, 1394 size_t count, loff_t *ppos) 1395 { 1396 struct task_struct *task; 1397 int err; 1398 unsigned int n; 1399 1400 err = kstrtouint_from_user(buf, count, 0, &n); 1401 if (err) 1402 return err; 1403 1404 task = get_proc_task(file_inode(file)); 1405 if (!task) 1406 return -ESRCH; 1407 task->fail_nth = n; 1408 put_task_struct(task); 1409 1410 return count; 1411 } 1412 1413 static ssize_t proc_fail_nth_read(struct file *file, char __user *buf, 1414 size_t count, loff_t *ppos) 1415 { 1416 struct task_struct *task; 1417 char numbuf[PROC_NUMBUF]; 1418 ssize_t len; 1419 1420 task = get_proc_task(file_inode(file)); 1421 if (!task) 1422 return -ESRCH; 1423 len = snprintf(numbuf, sizeof(numbuf), "%u\n", task->fail_nth); 1424 put_task_struct(task); 1425 return simple_read_from_buffer(buf, count, ppos, numbuf, len); 1426 } 1427 1428 static const struct file_operations proc_fail_nth_operations = { 1429 .read = proc_fail_nth_read, 1430 .write = proc_fail_nth_write, 1431 }; 1432 #endif 1433 1434 1435 #ifdef CONFIG_SCHED_DEBUG 1436 /* 1437 * Print out various scheduling related per-task fields: 1438 */ 1439 static int sched_show(struct seq_file *m, void *v) 1440 { 1441 struct inode *inode = m->private; 1442 struct pid_namespace *ns = proc_pid_ns(inode->i_sb); 1443 struct task_struct *p; 1444 1445 p = get_proc_task(inode); 1446 if (!p) 1447 return -ESRCH; 1448 proc_sched_show_task(p, ns, m); 1449 1450 put_task_struct(p); 1451 1452 return 0; 1453 } 1454 1455 static ssize_t 1456 sched_write(struct file *file, const char __user *buf, 1457 size_t count, loff_t *offset) 1458 { 1459 struct inode *inode = file_inode(file); 1460 struct task_struct *p; 1461 1462 p = get_proc_task(inode); 1463 if (!p) 1464 return -ESRCH; 1465 proc_sched_set_task(p); 1466 1467 put_task_struct(p); 1468 1469 return count; 1470 } 1471 1472 static int sched_open(struct inode *inode, struct file *filp) 1473 { 1474 return single_open(filp, sched_show, inode); 1475 } 1476 1477 static const struct file_operations proc_pid_sched_operations = { 1478 .open = sched_open, 1479 .read = seq_read, 1480 .write = sched_write, 1481 .llseek = seq_lseek, 1482 .release = single_release, 1483 }; 1484 1485 #endif 1486 1487 #ifdef CONFIG_SCHED_AUTOGROUP 1488 /* 1489 * Print out autogroup related information: 1490 */ 1491 static int sched_autogroup_show(struct seq_file *m, void *v) 1492 { 1493 struct inode *inode = m->private; 1494 struct task_struct *p; 1495 1496 p = get_proc_task(inode); 1497 if (!p) 1498 return -ESRCH; 1499 proc_sched_autogroup_show_task(p, m); 1500 1501 put_task_struct(p); 1502 1503 return 0; 1504 } 1505 1506 static ssize_t 1507 sched_autogroup_write(struct file *file, const char __user *buf, 1508 size_t count, loff_t *offset) 1509 { 1510 struct inode *inode = file_inode(file); 1511 struct task_struct *p; 1512 char buffer[PROC_NUMBUF]; 1513 int nice; 1514 int err; 1515 1516 memset(buffer, 0, sizeof(buffer)); 1517 if (count > sizeof(buffer) - 1) 1518 count = sizeof(buffer) - 1; 1519 if (copy_from_user(buffer, buf, count)) 1520 return -EFAULT; 1521 1522 err = kstrtoint(strstrip(buffer), 0, &nice); 1523 if (err < 0) 1524 return err; 1525 1526 p = get_proc_task(inode); 1527 if (!p) 1528 return -ESRCH; 1529 1530 err = proc_sched_autogroup_set_nice(p, nice); 1531 if (err) 1532 count = err; 1533 1534 put_task_struct(p); 1535 1536 return count; 1537 } 1538 1539 static int sched_autogroup_open(struct inode *inode, struct file *filp) 1540 { 1541 int ret; 1542 1543 ret = single_open(filp, sched_autogroup_show, NULL); 1544 if (!ret) { 1545 struct seq_file *m = filp->private_data; 1546 1547 m->private = inode; 1548 } 1549 return ret; 1550 } 1551 1552 static const struct file_operations proc_pid_sched_autogroup_operations = { 1553 .open = sched_autogroup_open, 1554 .read = seq_read, 1555 .write = sched_autogroup_write, 1556 .llseek = seq_lseek, 1557 .release = single_release, 1558 }; 1559 1560 #endif /* CONFIG_SCHED_AUTOGROUP */ 1561 1562 #ifdef CONFIG_TIME_NS 1563 static int timens_offsets_show(struct seq_file *m, void *v) 1564 { 1565 struct task_struct *p; 1566 1567 p = get_proc_task(file_inode(m->file)); 1568 if (!p) 1569 return -ESRCH; 1570 proc_timens_show_offsets(p, m); 1571 1572 put_task_struct(p); 1573 1574 return 0; 1575 } 1576 1577 static ssize_t timens_offsets_write(struct file *file, const char __user *buf, 1578 size_t count, loff_t *ppos) 1579 { 1580 struct inode *inode = file_inode(file); 1581 struct proc_timens_offset offsets[2]; 1582 char *kbuf = NULL, *pos, *next_line; 1583 struct task_struct *p; 1584 int ret, noffsets; 1585 1586 /* Only allow < page size writes at the beginning of the file */ 1587 if ((*ppos != 0) || (count >= PAGE_SIZE)) 1588 return -EINVAL; 1589 1590 /* Slurp in the user data */ 1591 kbuf = memdup_user_nul(buf, count); 1592 if (IS_ERR(kbuf)) 1593 return PTR_ERR(kbuf); 1594 1595 /* Parse the user data */ 1596 ret = -EINVAL; 1597 noffsets = 0; 1598 for (pos = kbuf; pos; pos = next_line) { 1599 struct proc_timens_offset *off = &offsets[noffsets]; 1600 char clock[10]; 1601 int err; 1602 1603 /* Find the end of line and ensure we don't look past it */ 1604 next_line = strchr(pos, '\n'); 1605 if (next_line) { 1606 *next_line = '\0'; 1607 next_line++; 1608 if (*next_line == '\0') 1609 next_line = NULL; 1610 } 1611 1612 err = sscanf(pos, "%9s %lld %lu", clock, 1613 &off->val.tv_sec, &off->val.tv_nsec); 1614 if (err != 3 || off->val.tv_nsec >= NSEC_PER_SEC) 1615 goto out; 1616 1617 clock[sizeof(clock) - 1] = 0; 1618 if (strcmp(clock, "monotonic") == 0 || 1619 strcmp(clock, __stringify(CLOCK_MONOTONIC)) == 0) 1620 off->clockid = CLOCK_MONOTONIC; 1621 else if (strcmp(clock, "boottime") == 0 || 1622 strcmp(clock, __stringify(CLOCK_BOOTTIME)) == 0) 1623 off->clockid = CLOCK_BOOTTIME; 1624 else 1625 goto out; 1626 1627 noffsets++; 1628 if (noffsets == ARRAY_SIZE(offsets)) { 1629 if (next_line) 1630 count = next_line - kbuf; 1631 break; 1632 } 1633 } 1634 1635 ret = -ESRCH; 1636 p = get_proc_task(inode); 1637 if (!p) 1638 goto out; 1639 ret = proc_timens_set_offset(file, p, offsets, noffsets); 1640 put_task_struct(p); 1641 if (ret) 1642 goto out; 1643 1644 ret = count; 1645 out: 1646 kfree(kbuf); 1647 return ret; 1648 } 1649 1650 static int timens_offsets_open(struct inode *inode, struct file *filp) 1651 { 1652 return single_open(filp, timens_offsets_show, inode); 1653 } 1654 1655 static const struct file_operations proc_timens_offsets_operations = { 1656 .open = timens_offsets_open, 1657 .read = seq_read, 1658 .write = timens_offsets_write, 1659 .llseek = seq_lseek, 1660 .release = single_release, 1661 }; 1662 #endif /* CONFIG_TIME_NS */ 1663 1664 static ssize_t comm_write(struct file *file, const char __user *buf, 1665 size_t count, loff_t *offset) 1666 { 1667 struct inode *inode = file_inode(file); 1668 struct task_struct *p; 1669 char buffer[TASK_COMM_LEN]; 1670 const size_t maxlen = sizeof(buffer) - 1; 1671 1672 memset(buffer, 0, sizeof(buffer)); 1673 if (copy_from_user(buffer, buf, count > maxlen ? maxlen : count)) 1674 return -EFAULT; 1675 1676 p = get_proc_task(inode); 1677 if (!p) 1678 return -ESRCH; 1679 1680 if (same_thread_group(current, p)) 1681 set_task_comm(p, buffer); 1682 else 1683 count = -EINVAL; 1684 1685 put_task_struct(p); 1686 1687 return count; 1688 } 1689 1690 static int comm_show(struct seq_file *m, void *v) 1691 { 1692 struct inode *inode = m->private; 1693 struct task_struct *p; 1694 1695 p = get_proc_task(inode); 1696 if (!p) 1697 return -ESRCH; 1698 1699 proc_task_name(m, p, false); 1700 seq_putc(m, '\n'); 1701 1702 put_task_struct(p); 1703 1704 return 0; 1705 } 1706 1707 static int comm_open(struct inode *inode, struct file *filp) 1708 { 1709 return single_open(filp, comm_show, inode); 1710 } 1711 1712 static const struct file_operations proc_pid_set_comm_operations = { 1713 .open = comm_open, 1714 .read = seq_read, 1715 .write = comm_write, 1716 .llseek = seq_lseek, 1717 .release = single_release, 1718 }; 1719 1720 static int proc_exe_link(struct dentry *dentry, struct path *exe_path) 1721 { 1722 struct task_struct *task; 1723 struct file *exe_file; 1724 1725 task = get_proc_task(d_inode(dentry)); 1726 if (!task) 1727 return -ENOENT; 1728 exe_file = get_task_exe_file(task); 1729 put_task_struct(task); 1730 if (exe_file) { 1731 *exe_path = exe_file->f_path; 1732 path_get(&exe_file->f_path); 1733 fput(exe_file); 1734 return 0; 1735 } else 1736 return -ENOENT; 1737 } 1738 1739 static const char *proc_pid_get_link(struct dentry *dentry, 1740 struct inode *inode, 1741 struct delayed_call *done) 1742 { 1743 struct path path; 1744 int error = -EACCES; 1745 1746 if (!dentry) 1747 return ERR_PTR(-ECHILD); 1748 1749 /* Are we allowed to snoop on the tasks file descriptors? */ 1750 if (!proc_fd_access_allowed(inode)) 1751 goto out; 1752 1753 error = PROC_I(inode)->op.proc_get_link(dentry, &path); 1754 if (error) 1755 goto out; 1756 1757 error = nd_jump_link(&path); 1758 out: 1759 return ERR_PTR(error); 1760 } 1761 1762 static int do_proc_readlink(struct path *path, char __user *buffer, int buflen) 1763 { 1764 char *tmp = (char *)__get_free_page(GFP_KERNEL); 1765 char *pathname; 1766 int len; 1767 1768 if (!tmp) 1769 return -ENOMEM; 1770 1771 pathname = d_path(path, tmp, PAGE_SIZE); 1772 len = PTR_ERR(pathname); 1773 if (IS_ERR(pathname)) 1774 goto out; 1775 len = tmp + PAGE_SIZE - 1 - pathname; 1776 1777 if (len > buflen) 1778 len = buflen; 1779 if (copy_to_user(buffer, pathname, len)) 1780 len = -EFAULT; 1781 out: 1782 free_page((unsigned long)tmp); 1783 return len; 1784 } 1785 1786 static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen) 1787 { 1788 int error = -EACCES; 1789 struct inode *inode = d_inode(dentry); 1790 struct path path; 1791 1792 /* Are we allowed to snoop on the tasks file descriptors? */ 1793 if (!proc_fd_access_allowed(inode)) 1794 goto out; 1795 1796 error = PROC_I(inode)->op.proc_get_link(dentry, &path); 1797 if (error) 1798 goto out; 1799 1800 error = do_proc_readlink(&path, buffer, buflen); 1801 path_put(&path); 1802 out: 1803 return error; 1804 } 1805 1806 const struct inode_operations proc_pid_link_inode_operations = { 1807 .readlink = proc_pid_readlink, 1808 .get_link = proc_pid_get_link, 1809 .setattr = proc_setattr, 1810 }; 1811 1812 1813 /* building an inode */ 1814 1815 void task_dump_owner(struct task_struct *task, umode_t mode, 1816 kuid_t *ruid, kgid_t *rgid) 1817 { 1818 /* Depending on the state of dumpable compute who should own a 1819 * proc file for a task. 1820 */ 1821 const struct cred *cred; 1822 kuid_t uid; 1823 kgid_t gid; 1824 1825 if (unlikely(task->flags & PF_KTHREAD)) { 1826 *ruid = GLOBAL_ROOT_UID; 1827 *rgid = GLOBAL_ROOT_GID; 1828 return; 1829 } 1830 1831 /* Default to the tasks effective ownership */ 1832 rcu_read_lock(); 1833 cred = __task_cred(task); 1834 uid = cred->euid; 1835 gid = cred->egid; 1836 rcu_read_unlock(); 1837 1838 /* 1839 * Before the /proc/pid/status file was created the only way to read 1840 * the effective uid of a /process was to stat /proc/pid. Reading 1841 * /proc/pid/status is slow enough that procps and other packages 1842 * kept stating /proc/pid. To keep the rules in /proc simple I have 1843 * made this apply to all per process world readable and executable 1844 * directories. 1845 */ 1846 if (mode != (S_IFDIR|S_IRUGO|S_IXUGO)) { 1847 struct mm_struct *mm; 1848 task_lock(task); 1849 mm = task->mm; 1850 /* Make non-dumpable tasks owned by some root */ 1851 if (mm) { 1852 if (get_dumpable(mm) != SUID_DUMP_USER) { 1853 struct user_namespace *user_ns = mm->user_ns; 1854 1855 uid = make_kuid(user_ns, 0); 1856 if (!uid_valid(uid)) 1857 uid = GLOBAL_ROOT_UID; 1858 1859 gid = make_kgid(user_ns, 0); 1860 if (!gid_valid(gid)) 1861 gid = GLOBAL_ROOT_GID; 1862 } 1863 } else { 1864 uid = GLOBAL_ROOT_UID; 1865 gid = GLOBAL_ROOT_GID; 1866 } 1867 task_unlock(task); 1868 } 1869 *ruid = uid; 1870 *rgid = gid; 1871 } 1872 1873 void proc_pid_evict_inode(struct proc_inode *ei) 1874 { 1875 struct pid *pid = ei->pid; 1876 1877 if (S_ISDIR(ei->vfs_inode.i_mode)) { 1878 spin_lock(&pid->lock); 1879 hlist_del_init_rcu(&ei->sibling_inodes); 1880 spin_unlock(&pid->lock); 1881 } 1882 1883 put_pid(pid); 1884 } 1885 1886 struct inode *proc_pid_make_inode(struct super_block * sb, 1887 struct task_struct *task, umode_t mode) 1888 { 1889 struct inode * inode; 1890 struct proc_inode *ei; 1891 struct pid *pid; 1892 1893 /* We need a new inode */ 1894 1895 inode = new_inode(sb); 1896 if (!inode) 1897 goto out; 1898 1899 /* Common stuff */ 1900 ei = PROC_I(inode); 1901 inode->i_mode = mode; 1902 inode->i_ino = get_next_ino(); 1903 inode->i_mtime = inode->i_atime = inode->i_ctime = current_time(inode); 1904 inode->i_op = &proc_def_inode_operations; 1905 1906 /* 1907 * grab the reference to task. 1908 */ 1909 pid = get_task_pid(task, PIDTYPE_PID); 1910 if (!pid) 1911 goto out_unlock; 1912 1913 /* Let the pid remember us for quick removal */ 1914 ei->pid = pid; 1915 if (S_ISDIR(mode)) { 1916 spin_lock(&pid->lock); 1917 hlist_add_head_rcu(&ei->sibling_inodes, &pid->inodes); 1918 spin_unlock(&pid->lock); 1919 } 1920 1921 task_dump_owner(task, 0, &inode->i_uid, &inode->i_gid); 1922 security_task_to_inode(task, inode); 1923 1924 out: 1925 return inode; 1926 1927 out_unlock: 1928 iput(inode); 1929 return NULL; 1930 } 1931 1932 int pid_getattr(struct user_namespace *mnt_userns, const struct path *path, 1933 struct kstat *stat, u32 request_mask, unsigned int query_flags) 1934 { 1935 struct inode *inode = d_inode(path->dentry); 1936 struct proc_fs_info *fs_info = proc_sb_info(inode->i_sb); 1937 struct task_struct *task; 1938 1939 generic_fillattr(&init_user_ns, inode, stat); 1940 1941 stat->uid = GLOBAL_ROOT_UID; 1942 stat->gid = GLOBAL_ROOT_GID; 1943 rcu_read_lock(); 1944 task = pid_task(proc_pid(inode), PIDTYPE_PID); 1945 if (task) { 1946 if (!has_pid_permissions(fs_info, task, HIDEPID_INVISIBLE)) { 1947 rcu_read_unlock(); 1948 /* 1949 * This doesn't prevent learning whether PID exists, 1950 * it only makes getattr() consistent with readdir(). 1951 */ 1952 return -ENOENT; 1953 } 1954 task_dump_owner(task, inode->i_mode, &stat->uid, &stat->gid); 1955 } 1956 rcu_read_unlock(); 1957 return 0; 1958 } 1959 1960 /* dentry stuff */ 1961 1962 /* 1963 * Set <pid>/... inode ownership (can change due to setuid(), etc.) 1964 */ 1965 void pid_update_inode(struct task_struct *task, struct inode *inode) 1966 { 1967 task_dump_owner(task, inode->i_mode, &inode->i_uid, &inode->i_gid); 1968 1969 inode->i_mode &= ~(S_ISUID | S_ISGID); 1970 security_task_to_inode(task, inode); 1971 } 1972 1973 /* 1974 * Rewrite the inode's ownerships here because the owning task may have 1975 * performed a setuid(), etc. 1976 * 1977 */ 1978 static int pid_revalidate(struct dentry *dentry, unsigned int flags) 1979 { 1980 struct inode *inode; 1981 struct task_struct *task; 1982 1983 if (flags & LOOKUP_RCU) 1984 return -ECHILD; 1985 1986 inode = d_inode(dentry); 1987 task = get_proc_task(inode); 1988 1989 if (task) { 1990 pid_update_inode(task, inode); 1991 put_task_struct(task); 1992 return 1; 1993 } 1994 return 0; 1995 } 1996 1997 static inline bool proc_inode_is_dead(struct inode *inode) 1998 { 1999 return !proc_pid(inode)->tasks[PIDTYPE_PID].first; 2000 } 2001 2002 int pid_delete_dentry(const struct dentry *dentry) 2003 { 2004 /* Is the task we represent dead? 2005 * If so, then don't put the dentry on the lru list, 2006 * kill it immediately. 2007 */ 2008 return proc_inode_is_dead(d_inode(dentry)); 2009 } 2010 2011 const struct dentry_operations pid_dentry_operations = 2012 { 2013 .d_revalidate = pid_revalidate, 2014 .d_delete = pid_delete_dentry, 2015 }; 2016 2017 /* Lookups */ 2018 2019 /* 2020 * Fill a directory entry. 2021 * 2022 * If possible create the dcache entry and derive our inode number and 2023 * file type from dcache entry. 2024 * 2025 * Since all of the proc inode numbers are dynamically generated, the inode 2026 * numbers do not exist until the inode is cache. This means creating 2027 * the dcache entry in readdir is necessary to keep the inode numbers 2028 * reported by readdir in sync with the inode numbers reported 2029 * by stat. 2030 */ 2031 bool proc_fill_cache(struct file *file, struct dir_context *ctx, 2032 const char *name, unsigned int len, 2033 instantiate_t instantiate, struct task_struct *task, const void *ptr) 2034 { 2035 struct dentry *child, *dir = file->f_path.dentry; 2036 struct qstr qname = QSTR_INIT(name, len); 2037 struct inode *inode; 2038 unsigned type = DT_UNKNOWN; 2039 ino_t ino = 1; 2040 2041 child = d_hash_and_lookup(dir, &qname); 2042 if (!child) { 2043 DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq); 2044 child = d_alloc_parallel(dir, &qname, &wq); 2045 if (IS_ERR(child)) 2046 goto end_instantiate; 2047 if (d_in_lookup(child)) { 2048 struct dentry *res; 2049 res = instantiate(child, task, ptr); 2050 d_lookup_done(child); 2051 if (unlikely(res)) { 2052 dput(child); 2053 child = res; 2054 if (IS_ERR(child)) 2055 goto end_instantiate; 2056 } 2057 } 2058 } 2059 inode = d_inode(child); 2060 ino = inode->i_ino; 2061 type = inode->i_mode >> 12; 2062 dput(child); 2063 end_instantiate: 2064 return dir_emit(ctx, name, len, ino, type); 2065 } 2066 2067 /* 2068 * dname_to_vma_addr - maps a dentry name into two unsigned longs 2069 * which represent vma start and end addresses. 2070 */ 2071 static int dname_to_vma_addr(struct dentry *dentry, 2072 unsigned long *start, unsigned long *end) 2073 { 2074 const char *str = dentry->d_name.name; 2075 unsigned long long sval, eval; 2076 unsigned int len; 2077 2078 if (str[0] == '0' && str[1] != '-') 2079 return -EINVAL; 2080 len = _parse_integer(str, 16, &sval); 2081 if (len & KSTRTOX_OVERFLOW) 2082 return -EINVAL; 2083 if (sval != (unsigned long)sval) 2084 return -EINVAL; 2085 str += len; 2086 2087 if (*str != '-') 2088 return -EINVAL; 2089 str++; 2090 2091 if (str[0] == '0' && str[1]) 2092 return -EINVAL; 2093 len = _parse_integer(str, 16, &eval); 2094 if (len & KSTRTOX_OVERFLOW) 2095 return -EINVAL; 2096 if (eval != (unsigned long)eval) 2097 return -EINVAL; 2098 str += len; 2099 2100 if (*str != '\0') 2101 return -EINVAL; 2102 2103 *start = sval; 2104 *end = eval; 2105 2106 return 0; 2107 } 2108 2109 static int map_files_d_revalidate(struct dentry *dentry, unsigned int flags) 2110 { 2111 unsigned long vm_start, vm_end; 2112 bool exact_vma_exists = false; 2113 struct mm_struct *mm = NULL; 2114 struct task_struct *task; 2115 struct inode *inode; 2116 int status = 0; 2117 2118 if (flags & LOOKUP_RCU) 2119 return -ECHILD; 2120 2121 inode = d_inode(dentry); 2122 task = get_proc_task(inode); 2123 if (!task) 2124 goto out_notask; 2125 2126 mm = mm_access(task, PTRACE_MODE_READ_FSCREDS); 2127 if (IS_ERR_OR_NULL(mm)) 2128 goto out; 2129 2130 if (!dname_to_vma_addr(dentry, &vm_start, &vm_end)) { 2131 status = mmap_read_lock_killable(mm); 2132 if (!status) { 2133 exact_vma_exists = !!find_exact_vma(mm, vm_start, 2134 vm_end); 2135 mmap_read_unlock(mm); 2136 } 2137 } 2138 2139 mmput(mm); 2140 2141 if (exact_vma_exists) { 2142 task_dump_owner(task, 0, &inode->i_uid, &inode->i_gid); 2143 2144 security_task_to_inode(task, inode); 2145 status = 1; 2146 } 2147 2148 out: 2149 put_task_struct(task); 2150 2151 out_notask: 2152 return status; 2153 } 2154 2155 static const struct dentry_operations tid_map_files_dentry_operations = { 2156 .d_revalidate = map_files_d_revalidate, 2157 .d_delete = pid_delete_dentry, 2158 }; 2159 2160 static int map_files_get_link(struct dentry *dentry, struct path *path) 2161 { 2162 unsigned long vm_start, vm_end; 2163 struct vm_area_struct *vma; 2164 struct task_struct *task; 2165 struct mm_struct *mm; 2166 int rc; 2167 2168 rc = -ENOENT; 2169 task = get_proc_task(d_inode(dentry)); 2170 if (!task) 2171 goto out; 2172 2173 mm = get_task_mm(task); 2174 put_task_struct(task); 2175 if (!mm) 2176 goto out; 2177 2178 rc = dname_to_vma_addr(dentry, &vm_start, &vm_end); 2179 if (rc) 2180 goto out_mmput; 2181 2182 rc = mmap_read_lock_killable(mm); 2183 if (rc) 2184 goto out_mmput; 2185 2186 rc = -ENOENT; 2187 vma = find_exact_vma(mm, vm_start, vm_end); 2188 if (vma && vma->vm_file) { 2189 *path = vma->vm_file->f_path; 2190 path_get(path); 2191 rc = 0; 2192 } 2193 mmap_read_unlock(mm); 2194 2195 out_mmput: 2196 mmput(mm); 2197 out: 2198 return rc; 2199 } 2200 2201 struct map_files_info { 2202 unsigned long start; 2203 unsigned long end; 2204 fmode_t mode; 2205 }; 2206 2207 /* 2208 * Only allow CAP_SYS_ADMIN and CAP_CHECKPOINT_RESTORE to follow the links, due 2209 * to concerns about how the symlinks may be used to bypass permissions on 2210 * ancestor directories in the path to the file in question. 2211 */ 2212 static const char * 2213 proc_map_files_get_link(struct dentry *dentry, 2214 struct inode *inode, 2215 struct delayed_call *done) 2216 { 2217 if (!checkpoint_restore_ns_capable(&init_user_ns)) 2218 return ERR_PTR(-EPERM); 2219 2220 return proc_pid_get_link(dentry, inode, done); 2221 } 2222 2223 /* 2224 * Identical to proc_pid_link_inode_operations except for get_link() 2225 */ 2226 static const struct inode_operations proc_map_files_link_inode_operations = { 2227 .readlink = proc_pid_readlink, 2228 .get_link = proc_map_files_get_link, 2229 .setattr = proc_setattr, 2230 }; 2231 2232 static struct dentry * 2233 proc_map_files_instantiate(struct dentry *dentry, 2234 struct task_struct *task, const void *ptr) 2235 { 2236 fmode_t mode = (fmode_t)(unsigned long)ptr; 2237 struct proc_inode *ei; 2238 struct inode *inode; 2239 2240 inode = proc_pid_make_inode(dentry->d_sb, task, S_IFLNK | 2241 ((mode & FMODE_READ ) ? S_IRUSR : 0) | 2242 ((mode & FMODE_WRITE) ? S_IWUSR : 0)); 2243 if (!inode) 2244 return ERR_PTR(-ENOENT); 2245 2246 ei = PROC_I(inode); 2247 ei->op.proc_get_link = map_files_get_link; 2248 2249 inode->i_op = &proc_map_files_link_inode_operations; 2250 inode->i_size = 64; 2251 2252 d_set_d_op(dentry, &tid_map_files_dentry_operations); 2253 return d_splice_alias(inode, dentry); 2254 } 2255 2256 static struct dentry *proc_map_files_lookup(struct inode *dir, 2257 struct dentry *dentry, unsigned int flags) 2258 { 2259 unsigned long vm_start, vm_end; 2260 struct vm_area_struct *vma; 2261 struct task_struct *task; 2262 struct dentry *result; 2263 struct mm_struct *mm; 2264 2265 result = ERR_PTR(-ENOENT); 2266 task = get_proc_task(dir); 2267 if (!task) 2268 goto out; 2269 2270 result = ERR_PTR(-EACCES); 2271 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS)) 2272 goto out_put_task; 2273 2274 result = ERR_PTR(-ENOENT); 2275 if (dname_to_vma_addr(dentry, &vm_start, &vm_end)) 2276 goto out_put_task; 2277 2278 mm = get_task_mm(task); 2279 if (!mm) 2280 goto out_put_task; 2281 2282 result = ERR_PTR(-EINTR); 2283 if (mmap_read_lock_killable(mm)) 2284 goto out_put_mm; 2285 2286 result = ERR_PTR(-ENOENT); 2287 vma = find_exact_vma(mm, vm_start, vm_end); 2288 if (!vma) 2289 goto out_no_vma; 2290 2291 if (vma->vm_file) 2292 result = proc_map_files_instantiate(dentry, task, 2293 (void *)(unsigned long)vma->vm_file->f_mode); 2294 2295 out_no_vma: 2296 mmap_read_unlock(mm); 2297 out_put_mm: 2298 mmput(mm); 2299 out_put_task: 2300 put_task_struct(task); 2301 out: 2302 return result; 2303 } 2304 2305 static const struct inode_operations proc_map_files_inode_operations = { 2306 .lookup = proc_map_files_lookup, 2307 .permission = proc_fd_permission, 2308 .setattr = proc_setattr, 2309 }; 2310 2311 static int 2312 proc_map_files_readdir(struct file *file, struct dir_context *ctx) 2313 { 2314 struct vm_area_struct *vma; 2315 struct task_struct *task; 2316 struct mm_struct *mm; 2317 unsigned long nr_files, pos, i; 2318 GENRADIX(struct map_files_info) fa; 2319 struct map_files_info *p; 2320 int ret; 2321 2322 genradix_init(&fa); 2323 2324 ret = -ENOENT; 2325 task = get_proc_task(file_inode(file)); 2326 if (!task) 2327 goto out; 2328 2329 ret = -EACCES; 2330 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS)) 2331 goto out_put_task; 2332 2333 ret = 0; 2334 if (!dir_emit_dots(file, ctx)) 2335 goto out_put_task; 2336 2337 mm = get_task_mm(task); 2338 if (!mm) 2339 goto out_put_task; 2340 2341 ret = mmap_read_lock_killable(mm); 2342 if (ret) { 2343 mmput(mm); 2344 goto out_put_task; 2345 } 2346 2347 nr_files = 0; 2348 2349 /* 2350 * We need two passes here: 2351 * 2352 * 1) Collect vmas of mapped files with mmap_lock taken 2353 * 2) Release mmap_lock and instantiate entries 2354 * 2355 * otherwise we get lockdep complained, since filldir() 2356 * routine might require mmap_lock taken in might_fault(). 2357 */ 2358 2359 for (vma = mm->mmap, pos = 2; vma; vma = vma->vm_next) { 2360 if (!vma->vm_file) 2361 continue; 2362 if (++pos <= ctx->pos) 2363 continue; 2364 2365 p = genradix_ptr_alloc(&fa, nr_files++, GFP_KERNEL); 2366 if (!p) { 2367 ret = -ENOMEM; 2368 mmap_read_unlock(mm); 2369 mmput(mm); 2370 goto out_put_task; 2371 } 2372 2373 p->start = vma->vm_start; 2374 p->end = vma->vm_end; 2375 p->mode = vma->vm_file->f_mode; 2376 } 2377 mmap_read_unlock(mm); 2378 mmput(mm); 2379 2380 for (i = 0; i < nr_files; i++) { 2381 char buf[4 * sizeof(long) + 2]; /* max: %lx-%lx\0 */ 2382 unsigned int len; 2383 2384 p = genradix_ptr(&fa, i); 2385 len = snprintf(buf, sizeof(buf), "%lx-%lx", p->start, p->end); 2386 if (!proc_fill_cache(file, ctx, 2387 buf, len, 2388 proc_map_files_instantiate, 2389 task, 2390 (void *)(unsigned long)p->mode)) 2391 break; 2392 ctx->pos++; 2393 } 2394 2395 out_put_task: 2396 put_task_struct(task); 2397 out: 2398 genradix_free(&fa); 2399 return ret; 2400 } 2401 2402 static const struct file_operations proc_map_files_operations = { 2403 .read = generic_read_dir, 2404 .iterate_shared = proc_map_files_readdir, 2405 .llseek = generic_file_llseek, 2406 }; 2407 2408 #if defined(CONFIG_CHECKPOINT_RESTORE) && defined(CONFIG_POSIX_TIMERS) 2409 struct timers_private { 2410 struct pid *pid; 2411 struct task_struct *task; 2412 struct sighand_struct *sighand; 2413 struct pid_namespace *ns; 2414 unsigned long flags; 2415 }; 2416 2417 static void *timers_start(struct seq_file *m, loff_t *pos) 2418 { 2419 struct timers_private *tp = m->private; 2420 2421 tp->task = get_pid_task(tp->pid, PIDTYPE_PID); 2422 if (!tp->task) 2423 return ERR_PTR(-ESRCH); 2424 2425 tp->sighand = lock_task_sighand(tp->task, &tp->flags); 2426 if (!tp->sighand) 2427 return ERR_PTR(-ESRCH); 2428 2429 return seq_list_start(&tp->task->signal->posix_timers, *pos); 2430 } 2431 2432 static void *timers_next(struct seq_file *m, void *v, loff_t *pos) 2433 { 2434 struct timers_private *tp = m->private; 2435 return seq_list_next(v, &tp->task->signal->posix_timers, pos); 2436 } 2437 2438 static void timers_stop(struct seq_file *m, void *v) 2439 { 2440 struct timers_private *tp = m->private; 2441 2442 if (tp->sighand) { 2443 unlock_task_sighand(tp->task, &tp->flags); 2444 tp->sighand = NULL; 2445 } 2446 2447 if (tp->task) { 2448 put_task_struct(tp->task); 2449 tp->task = NULL; 2450 } 2451 } 2452 2453 static int show_timer(struct seq_file *m, void *v) 2454 { 2455 struct k_itimer *timer; 2456 struct timers_private *tp = m->private; 2457 int notify; 2458 static const char * const nstr[] = { 2459 [SIGEV_SIGNAL] = "signal", 2460 [SIGEV_NONE] = "none", 2461 [SIGEV_THREAD] = "thread", 2462 }; 2463 2464 timer = list_entry((struct list_head *)v, struct k_itimer, list); 2465 notify = timer->it_sigev_notify; 2466 2467 seq_printf(m, "ID: %d\n", timer->it_id); 2468 seq_printf(m, "signal: %d/%px\n", 2469 timer->sigq->info.si_signo, 2470 timer->sigq->info.si_value.sival_ptr); 2471 seq_printf(m, "notify: %s/%s.%d\n", 2472 nstr[notify & ~SIGEV_THREAD_ID], 2473 (notify & SIGEV_THREAD_ID) ? "tid" : "pid", 2474 pid_nr_ns(timer->it_pid, tp->ns)); 2475 seq_printf(m, "ClockID: %d\n", timer->it_clock); 2476 2477 return 0; 2478 } 2479 2480 static const struct seq_operations proc_timers_seq_ops = { 2481 .start = timers_start, 2482 .next = timers_next, 2483 .stop = timers_stop, 2484 .show = show_timer, 2485 }; 2486 2487 static int proc_timers_open(struct inode *inode, struct file *file) 2488 { 2489 struct timers_private *tp; 2490 2491 tp = __seq_open_private(file, &proc_timers_seq_ops, 2492 sizeof(struct timers_private)); 2493 if (!tp) 2494 return -ENOMEM; 2495 2496 tp->pid = proc_pid(inode); 2497 tp->ns = proc_pid_ns(inode->i_sb); 2498 return 0; 2499 } 2500 2501 static const struct file_operations proc_timers_operations = { 2502 .open = proc_timers_open, 2503 .read = seq_read, 2504 .llseek = seq_lseek, 2505 .release = seq_release_private, 2506 }; 2507 #endif 2508 2509 static ssize_t timerslack_ns_write(struct file *file, const char __user *buf, 2510 size_t count, loff_t *offset) 2511 { 2512 struct inode *inode = file_inode(file); 2513 struct task_struct *p; 2514 u64 slack_ns; 2515 int err; 2516 2517 err = kstrtoull_from_user(buf, count, 10, &slack_ns); 2518 if (err < 0) 2519 return err; 2520 2521 p = get_proc_task(inode); 2522 if (!p) 2523 return -ESRCH; 2524 2525 if (p != current) { 2526 rcu_read_lock(); 2527 if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) { 2528 rcu_read_unlock(); 2529 count = -EPERM; 2530 goto out; 2531 } 2532 rcu_read_unlock(); 2533 2534 err = security_task_setscheduler(p); 2535 if (err) { 2536 count = err; 2537 goto out; 2538 } 2539 } 2540 2541 task_lock(p); 2542 if (slack_ns == 0) 2543 p->timer_slack_ns = p->default_timer_slack_ns; 2544 else 2545 p->timer_slack_ns = slack_ns; 2546 task_unlock(p); 2547 2548 out: 2549 put_task_struct(p); 2550 2551 return count; 2552 } 2553 2554 static int timerslack_ns_show(struct seq_file *m, void *v) 2555 { 2556 struct inode *inode = m->private; 2557 struct task_struct *p; 2558 int err = 0; 2559 2560 p = get_proc_task(inode); 2561 if (!p) 2562 return -ESRCH; 2563 2564 if (p != current) { 2565 rcu_read_lock(); 2566 if (!ns_capable(__task_cred(p)->user_ns, CAP_SYS_NICE)) { 2567 rcu_read_unlock(); 2568 err = -EPERM; 2569 goto out; 2570 } 2571 rcu_read_unlock(); 2572 2573 err = security_task_getscheduler(p); 2574 if (err) 2575 goto out; 2576 } 2577 2578 task_lock(p); 2579 seq_printf(m, "%llu\n", p->timer_slack_ns); 2580 task_unlock(p); 2581 2582 out: 2583 put_task_struct(p); 2584 2585 return err; 2586 } 2587 2588 static int timerslack_ns_open(struct inode *inode, struct file *filp) 2589 { 2590 return single_open(filp, timerslack_ns_show, inode); 2591 } 2592 2593 static const struct file_operations proc_pid_set_timerslack_ns_operations = { 2594 .open = timerslack_ns_open, 2595 .read = seq_read, 2596 .write = timerslack_ns_write, 2597 .llseek = seq_lseek, 2598 .release = single_release, 2599 }; 2600 2601 static struct dentry *proc_pident_instantiate(struct dentry *dentry, 2602 struct task_struct *task, const void *ptr) 2603 { 2604 const struct pid_entry *p = ptr; 2605 struct inode *inode; 2606 struct proc_inode *ei; 2607 2608 inode = proc_pid_make_inode(dentry->d_sb, task, p->mode); 2609 if (!inode) 2610 return ERR_PTR(-ENOENT); 2611 2612 ei = PROC_I(inode); 2613 if (S_ISDIR(inode->i_mode)) 2614 set_nlink(inode, 2); /* Use getattr to fix if necessary */ 2615 if (p->iop) 2616 inode->i_op = p->iop; 2617 if (p->fop) 2618 inode->i_fop = p->fop; 2619 ei->op = p->op; 2620 pid_update_inode(task, inode); 2621 d_set_d_op(dentry, &pid_dentry_operations); 2622 return d_splice_alias(inode, dentry); 2623 } 2624 2625 static struct dentry *proc_pident_lookup(struct inode *dir, 2626 struct dentry *dentry, 2627 const struct pid_entry *p, 2628 const struct pid_entry *end) 2629 { 2630 struct task_struct *task = get_proc_task(dir); 2631 struct dentry *res = ERR_PTR(-ENOENT); 2632 2633 if (!task) 2634 goto out_no_task; 2635 2636 /* 2637 * Yes, it does not scale. And it should not. Don't add 2638 * new entries into /proc/<tgid>/ without very good reasons. 2639 */ 2640 for (; p < end; p++) { 2641 if (p->len != dentry->d_name.len) 2642 continue; 2643 if (!memcmp(dentry->d_name.name, p->name, p->len)) { 2644 res = proc_pident_instantiate(dentry, task, p); 2645 break; 2646 } 2647 } 2648 put_task_struct(task); 2649 out_no_task: 2650 return res; 2651 } 2652 2653 static int proc_pident_readdir(struct file *file, struct dir_context *ctx, 2654 const struct pid_entry *ents, unsigned int nents) 2655 { 2656 struct task_struct *task = get_proc_task(file_inode(file)); 2657 const struct pid_entry *p; 2658 2659 if (!task) 2660 return -ENOENT; 2661 2662 if (!dir_emit_dots(file, ctx)) 2663 goto out; 2664 2665 if (ctx->pos >= nents + 2) 2666 goto out; 2667 2668 for (p = ents + (ctx->pos - 2); p < ents + nents; p++) { 2669 if (!proc_fill_cache(file, ctx, p->name, p->len, 2670 proc_pident_instantiate, task, p)) 2671 break; 2672 ctx->pos++; 2673 } 2674 out: 2675 put_task_struct(task); 2676 return 0; 2677 } 2678 2679 #ifdef CONFIG_SECURITY 2680 static ssize_t proc_pid_attr_read(struct file * file, char __user * buf, 2681 size_t count, loff_t *ppos) 2682 { 2683 struct inode * inode = file_inode(file); 2684 char *p = NULL; 2685 ssize_t length; 2686 struct task_struct *task = get_proc_task(inode); 2687 2688 if (!task) 2689 return -ESRCH; 2690 2691 length = security_getprocattr(task, PROC_I(inode)->op.lsm, 2692 (char*)file->f_path.dentry->d_name.name, 2693 &p); 2694 put_task_struct(task); 2695 if (length > 0) 2696 length = simple_read_from_buffer(buf, count, ppos, p, length); 2697 kfree(p); 2698 return length; 2699 } 2700 2701 static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf, 2702 size_t count, loff_t *ppos) 2703 { 2704 struct inode * inode = file_inode(file); 2705 struct task_struct *task; 2706 void *page; 2707 int rv; 2708 2709 rcu_read_lock(); 2710 task = pid_task(proc_pid(inode), PIDTYPE_PID); 2711 if (!task) { 2712 rcu_read_unlock(); 2713 return -ESRCH; 2714 } 2715 /* A task may only write its own attributes. */ 2716 if (current != task) { 2717 rcu_read_unlock(); 2718 return -EACCES; 2719 } 2720 /* Prevent changes to overridden credentials. */ 2721 if (current_cred() != current_real_cred()) { 2722 rcu_read_unlock(); 2723 return -EBUSY; 2724 } 2725 rcu_read_unlock(); 2726 2727 if (count > PAGE_SIZE) 2728 count = PAGE_SIZE; 2729 2730 /* No partial writes. */ 2731 if (*ppos != 0) 2732 return -EINVAL; 2733 2734 page = memdup_user(buf, count); 2735 if (IS_ERR(page)) { 2736 rv = PTR_ERR(page); 2737 goto out; 2738 } 2739 2740 /* Guard against adverse ptrace interaction */ 2741 rv = mutex_lock_interruptible(¤t->signal->cred_guard_mutex); 2742 if (rv < 0) 2743 goto out_free; 2744 2745 rv = security_setprocattr(PROC_I(inode)->op.lsm, 2746 file->f_path.dentry->d_name.name, page, 2747 count); 2748 mutex_unlock(¤t->signal->cred_guard_mutex); 2749 out_free: 2750 kfree(page); 2751 out: 2752 return rv; 2753 } 2754 2755 static const struct file_operations proc_pid_attr_operations = { 2756 .read = proc_pid_attr_read, 2757 .write = proc_pid_attr_write, 2758 .llseek = generic_file_llseek, 2759 }; 2760 2761 #define LSM_DIR_OPS(LSM) \ 2762 static int proc_##LSM##_attr_dir_iterate(struct file *filp, \ 2763 struct dir_context *ctx) \ 2764 { \ 2765 return proc_pident_readdir(filp, ctx, \ 2766 LSM##_attr_dir_stuff, \ 2767 ARRAY_SIZE(LSM##_attr_dir_stuff)); \ 2768 } \ 2769 \ 2770 static const struct file_operations proc_##LSM##_attr_dir_ops = { \ 2771 .read = generic_read_dir, \ 2772 .iterate = proc_##LSM##_attr_dir_iterate, \ 2773 .llseek = default_llseek, \ 2774 }; \ 2775 \ 2776 static struct dentry *proc_##LSM##_attr_dir_lookup(struct inode *dir, \ 2777 struct dentry *dentry, unsigned int flags) \ 2778 { \ 2779 return proc_pident_lookup(dir, dentry, \ 2780 LSM##_attr_dir_stuff, \ 2781 LSM##_attr_dir_stuff + ARRAY_SIZE(LSM##_attr_dir_stuff)); \ 2782 } \ 2783 \ 2784 static const struct inode_operations proc_##LSM##_attr_dir_inode_ops = { \ 2785 .lookup = proc_##LSM##_attr_dir_lookup, \ 2786 .getattr = pid_getattr, \ 2787 .setattr = proc_setattr, \ 2788 } 2789 2790 #ifdef CONFIG_SECURITY_SMACK 2791 static const struct pid_entry smack_attr_dir_stuff[] = { 2792 ATTR("smack", "current", 0666), 2793 }; 2794 LSM_DIR_OPS(smack); 2795 #endif 2796 2797 #ifdef CONFIG_SECURITY_APPARMOR 2798 static const struct pid_entry apparmor_attr_dir_stuff[] = { 2799 ATTR("apparmor", "current", 0666), 2800 ATTR("apparmor", "prev", 0444), 2801 ATTR("apparmor", "exec", 0666), 2802 }; 2803 LSM_DIR_OPS(apparmor); 2804 #endif 2805 2806 static const struct pid_entry attr_dir_stuff[] = { 2807 ATTR(NULL, "current", 0666), 2808 ATTR(NULL, "prev", 0444), 2809 ATTR(NULL, "exec", 0666), 2810 ATTR(NULL, "fscreate", 0666), 2811 ATTR(NULL, "keycreate", 0666), 2812 ATTR(NULL, "sockcreate", 0666), 2813 #ifdef CONFIG_SECURITY_SMACK 2814 DIR("smack", 0555, 2815 proc_smack_attr_dir_inode_ops, proc_smack_attr_dir_ops), 2816 #endif 2817 #ifdef CONFIG_SECURITY_APPARMOR 2818 DIR("apparmor", 0555, 2819 proc_apparmor_attr_dir_inode_ops, proc_apparmor_attr_dir_ops), 2820 #endif 2821 }; 2822 2823 static int proc_attr_dir_readdir(struct file *file, struct dir_context *ctx) 2824 { 2825 return proc_pident_readdir(file, ctx, 2826 attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff)); 2827 } 2828 2829 static const struct file_operations proc_attr_dir_operations = { 2830 .read = generic_read_dir, 2831 .iterate_shared = proc_attr_dir_readdir, 2832 .llseek = generic_file_llseek, 2833 }; 2834 2835 static struct dentry *proc_attr_dir_lookup(struct inode *dir, 2836 struct dentry *dentry, unsigned int flags) 2837 { 2838 return proc_pident_lookup(dir, dentry, 2839 attr_dir_stuff, 2840 attr_dir_stuff + ARRAY_SIZE(attr_dir_stuff)); 2841 } 2842 2843 static const struct inode_operations proc_attr_dir_inode_operations = { 2844 .lookup = proc_attr_dir_lookup, 2845 .getattr = pid_getattr, 2846 .setattr = proc_setattr, 2847 }; 2848 2849 #endif 2850 2851 #ifdef CONFIG_ELF_CORE 2852 static ssize_t proc_coredump_filter_read(struct file *file, char __user *buf, 2853 size_t count, loff_t *ppos) 2854 { 2855 struct task_struct *task = get_proc_task(file_inode(file)); 2856 struct mm_struct *mm; 2857 char buffer[PROC_NUMBUF]; 2858 size_t len; 2859 int ret; 2860 2861 if (!task) 2862 return -ESRCH; 2863 2864 ret = 0; 2865 mm = get_task_mm(task); 2866 if (mm) { 2867 len = snprintf(buffer, sizeof(buffer), "%08lx\n", 2868 ((mm->flags & MMF_DUMP_FILTER_MASK) >> 2869 MMF_DUMP_FILTER_SHIFT)); 2870 mmput(mm); 2871 ret = simple_read_from_buffer(buf, count, ppos, buffer, len); 2872 } 2873 2874 put_task_struct(task); 2875 2876 return ret; 2877 } 2878 2879 static ssize_t proc_coredump_filter_write(struct file *file, 2880 const char __user *buf, 2881 size_t count, 2882 loff_t *ppos) 2883 { 2884 struct task_struct *task; 2885 struct mm_struct *mm; 2886 unsigned int val; 2887 int ret; 2888 int i; 2889 unsigned long mask; 2890 2891 ret = kstrtouint_from_user(buf, count, 0, &val); 2892 if (ret < 0) 2893 return ret; 2894 2895 ret = -ESRCH; 2896 task = get_proc_task(file_inode(file)); 2897 if (!task) 2898 goto out_no_task; 2899 2900 mm = get_task_mm(task); 2901 if (!mm) 2902 goto out_no_mm; 2903 ret = 0; 2904 2905 for (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) { 2906 if (val & mask) 2907 set_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags); 2908 else 2909 clear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags); 2910 } 2911 2912 mmput(mm); 2913 out_no_mm: 2914 put_task_struct(task); 2915 out_no_task: 2916 if (ret < 0) 2917 return ret; 2918 return count; 2919 } 2920 2921 static const struct file_operations proc_coredump_filter_operations = { 2922 .read = proc_coredump_filter_read, 2923 .write = proc_coredump_filter_write, 2924 .llseek = generic_file_llseek, 2925 }; 2926 #endif 2927 2928 #ifdef CONFIG_TASK_IO_ACCOUNTING 2929 static int do_io_accounting(struct task_struct *task, struct seq_file *m, int whole) 2930 { 2931 struct task_io_accounting acct = task->ioac; 2932 unsigned long flags; 2933 int result; 2934 2935 result = down_read_killable(&task->signal->exec_update_lock); 2936 if (result) 2937 return result; 2938 2939 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS)) { 2940 result = -EACCES; 2941 goto out_unlock; 2942 } 2943 2944 if (whole && lock_task_sighand(task, &flags)) { 2945 struct task_struct *t = task; 2946 2947 task_io_accounting_add(&acct, &task->signal->ioac); 2948 while_each_thread(task, t) 2949 task_io_accounting_add(&acct, &t->ioac); 2950 2951 unlock_task_sighand(task, &flags); 2952 } 2953 seq_printf(m, 2954 "rchar: %llu\n" 2955 "wchar: %llu\n" 2956 "syscr: %llu\n" 2957 "syscw: %llu\n" 2958 "read_bytes: %llu\n" 2959 "write_bytes: %llu\n" 2960 "cancelled_write_bytes: %llu\n", 2961 (unsigned long long)acct.rchar, 2962 (unsigned long long)acct.wchar, 2963 (unsigned long long)acct.syscr, 2964 (unsigned long long)acct.syscw, 2965 (unsigned long long)acct.read_bytes, 2966 (unsigned long long)acct.write_bytes, 2967 (unsigned long long)acct.cancelled_write_bytes); 2968 result = 0; 2969 2970 out_unlock: 2971 up_read(&task->signal->exec_update_lock); 2972 return result; 2973 } 2974 2975 static int proc_tid_io_accounting(struct seq_file *m, struct pid_namespace *ns, 2976 struct pid *pid, struct task_struct *task) 2977 { 2978 return do_io_accounting(task, m, 0); 2979 } 2980 2981 static int proc_tgid_io_accounting(struct seq_file *m, struct pid_namespace *ns, 2982 struct pid *pid, struct task_struct *task) 2983 { 2984 return do_io_accounting(task, m, 1); 2985 } 2986 #endif /* CONFIG_TASK_IO_ACCOUNTING */ 2987 2988 #ifdef CONFIG_USER_NS 2989 static int proc_id_map_open(struct inode *inode, struct file *file, 2990 const struct seq_operations *seq_ops) 2991 { 2992 struct user_namespace *ns = NULL; 2993 struct task_struct *task; 2994 struct seq_file *seq; 2995 int ret = -EINVAL; 2996 2997 task = get_proc_task(inode); 2998 if (task) { 2999 rcu_read_lock(); 3000 ns = get_user_ns(task_cred_xxx(task, user_ns)); 3001 rcu_read_unlock(); 3002 put_task_struct(task); 3003 } 3004 if (!ns) 3005 goto err; 3006 3007 ret = seq_open(file, seq_ops); 3008 if (ret) 3009 goto err_put_ns; 3010 3011 seq = file->private_data; 3012 seq->private = ns; 3013 3014 return 0; 3015 err_put_ns: 3016 put_user_ns(ns); 3017 err: 3018 return ret; 3019 } 3020 3021 static int proc_id_map_release(struct inode *inode, struct file *file) 3022 { 3023 struct seq_file *seq = file->private_data; 3024 struct user_namespace *ns = seq->private; 3025 put_user_ns(ns); 3026 return seq_release(inode, file); 3027 } 3028 3029 static int proc_uid_map_open(struct inode *inode, struct file *file) 3030 { 3031 return proc_id_map_open(inode, file, &proc_uid_seq_operations); 3032 } 3033 3034 static int proc_gid_map_open(struct inode *inode, struct file *file) 3035 { 3036 return proc_id_map_open(inode, file, &proc_gid_seq_operations); 3037 } 3038 3039 static int proc_projid_map_open(struct inode *inode, struct file *file) 3040 { 3041 return proc_id_map_open(inode, file, &proc_projid_seq_operations); 3042 } 3043 3044 static const struct file_operations proc_uid_map_operations = { 3045 .open = proc_uid_map_open, 3046 .write = proc_uid_map_write, 3047 .read = seq_read, 3048 .llseek = seq_lseek, 3049 .release = proc_id_map_release, 3050 }; 3051 3052 static const struct file_operations proc_gid_map_operations = { 3053 .open = proc_gid_map_open, 3054 .write = proc_gid_map_write, 3055 .read = seq_read, 3056 .llseek = seq_lseek, 3057 .release = proc_id_map_release, 3058 }; 3059 3060 static const struct file_operations proc_projid_map_operations = { 3061 .open = proc_projid_map_open, 3062 .write = proc_projid_map_write, 3063 .read = seq_read, 3064 .llseek = seq_lseek, 3065 .release = proc_id_map_release, 3066 }; 3067 3068 static int proc_setgroups_open(struct inode *inode, struct file *file) 3069 { 3070 struct user_namespace *ns = NULL; 3071 struct task_struct *task; 3072 int ret; 3073 3074 ret = -ESRCH; 3075 task = get_proc_task(inode); 3076 if (task) { 3077 rcu_read_lock(); 3078 ns = get_user_ns(task_cred_xxx(task, user_ns)); 3079 rcu_read_unlock(); 3080 put_task_struct(task); 3081 } 3082 if (!ns) 3083 goto err; 3084 3085 if (file->f_mode & FMODE_WRITE) { 3086 ret = -EACCES; 3087 if (!ns_capable(ns, CAP_SYS_ADMIN)) 3088 goto err_put_ns; 3089 } 3090 3091 ret = single_open(file, &proc_setgroups_show, ns); 3092 if (ret) 3093 goto err_put_ns; 3094 3095 return 0; 3096 err_put_ns: 3097 put_user_ns(ns); 3098 err: 3099 return ret; 3100 } 3101 3102 static int proc_setgroups_release(struct inode *inode, struct file *file) 3103 { 3104 struct seq_file *seq = file->private_data; 3105 struct user_namespace *ns = seq->private; 3106 int ret = single_release(inode, file); 3107 put_user_ns(ns); 3108 return ret; 3109 } 3110 3111 static const struct file_operations proc_setgroups_operations = { 3112 .open = proc_setgroups_open, 3113 .write = proc_setgroups_write, 3114 .read = seq_read, 3115 .llseek = seq_lseek, 3116 .release = proc_setgroups_release, 3117 }; 3118 #endif /* CONFIG_USER_NS */ 3119 3120 static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns, 3121 struct pid *pid, struct task_struct *task) 3122 { 3123 int err = lock_trace(task); 3124 if (!err) { 3125 seq_printf(m, "%08x\n", task->personality); 3126 unlock_trace(task); 3127 } 3128 return err; 3129 } 3130 3131 #ifdef CONFIG_LIVEPATCH 3132 static int proc_pid_patch_state(struct seq_file *m, struct pid_namespace *ns, 3133 struct pid *pid, struct task_struct *task) 3134 { 3135 seq_printf(m, "%d\n", task->patch_state); 3136 return 0; 3137 } 3138 #endif /* CONFIG_LIVEPATCH */ 3139 3140 #ifdef CONFIG_STACKLEAK_METRICS 3141 static int proc_stack_depth(struct seq_file *m, struct pid_namespace *ns, 3142 struct pid *pid, struct task_struct *task) 3143 { 3144 unsigned long prev_depth = THREAD_SIZE - 3145 (task->prev_lowest_stack & (THREAD_SIZE - 1)); 3146 unsigned long depth = THREAD_SIZE - 3147 (task->lowest_stack & (THREAD_SIZE - 1)); 3148 3149 seq_printf(m, "previous stack depth: %lu\nstack depth: %lu\n", 3150 prev_depth, depth); 3151 return 0; 3152 } 3153 #endif /* CONFIG_STACKLEAK_METRICS */ 3154 3155 /* 3156 * Thread groups 3157 */ 3158 static const struct file_operations proc_task_operations; 3159 static const struct inode_operations proc_task_inode_operations; 3160 3161 static const struct pid_entry tgid_base_stuff[] = { 3162 DIR("task", S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations), 3163 DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations), 3164 DIR("map_files", S_IRUSR|S_IXUSR, proc_map_files_inode_operations, proc_map_files_operations), 3165 DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations), 3166 DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations), 3167 #ifdef CONFIG_NET 3168 DIR("net", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations), 3169 #endif 3170 REG("environ", S_IRUSR, proc_environ_operations), 3171 REG("auxv", S_IRUSR, proc_auxv_operations), 3172 ONE("status", S_IRUGO, proc_pid_status), 3173 ONE("personality", S_IRUSR, proc_pid_personality), 3174 ONE("limits", S_IRUGO, proc_pid_limits), 3175 #ifdef CONFIG_SCHED_DEBUG 3176 REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations), 3177 #endif 3178 #ifdef CONFIG_SCHED_AUTOGROUP 3179 REG("autogroup", S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations), 3180 #endif 3181 #ifdef CONFIG_TIME_NS 3182 REG("timens_offsets", S_IRUGO|S_IWUSR, proc_timens_offsets_operations), 3183 #endif 3184 REG("comm", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations), 3185 #ifdef CONFIG_HAVE_ARCH_TRACEHOOK 3186 ONE("syscall", S_IRUSR, proc_pid_syscall), 3187 #endif 3188 REG("cmdline", S_IRUGO, proc_pid_cmdline_ops), 3189 ONE("stat", S_IRUGO, proc_tgid_stat), 3190 ONE("statm", S_IRUGO, proc_pid_statm), 3191 REG("maps", S_IRUGO, proc_pid_maps_operations), 3192 #ifdef CONFIG_NUMA 3193 REG("numa_maps", S_IRUGO, proc_pid_numa_maps_operations), 3194 #endif 3195 REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations), 3196 LNK("cwd", proc_cwd_link), 3197 LNK("root", proc_root_link), 3198 LNK("exe", proc_exe_link), 3199 REG("mounts", S_IRUGO, proc_mounts_operations), 3200 REG("mountinfo", S_IRUGO, proc_mountinfo_operations), 3201 REG("mountstats", S_IRUSR, proc_mountstats_operations), 3202 #ifdef CONFIG_PROC_PAGE_MONITOR 3203 REG("clear_refs", S_IWUSR, proc_clear_refs_operations), 3204 REG("smaps", S_IRUGO, proc_pid_smaps_operations), 3205 REG("smaps_rollup", S_IRUGO, proc_pid_smaps_rollup_operations), 3206 REG("pagemap", S_IRUSR, proc_pagemap_operations), 3207 #endif 3208 #ifdef CONFIG_SECURITY 3209 DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations), 3210 #endif 3211 #ifdef CONFIG_KALLSYMS 3212 ONE("wchan", S_IRUGO, proc_pid_wchan), 3213 #endif 3214 #ifdef CONFIG_STACKTRACE 3215 ONE("stack", S_IRUSR, proc_pid_stack), 3216 #endif 3217 #ifdef CONFIG_SCHED_INFO 3218 ONE("schedstat", S_IRUGO, proc_pid_schedstat), 3219 #endif 3220 #ifdef CONFIG_LATENCYTOP 3221 REG("latency", S_IRUGO, proc_lstats_operations), 3222 #endif 3223 #ifdef CONFIG_PROC_PID_CPUSET 3224 ONE("cpuset", S_IRUGO, proc_cpuset_show), 3225 #endif 3226 #ifdef CONFIG_CGROUPS 3227 ONE("cgroup", S_IRUGO, proc_cgroup_show), 3228 #endif 3229 #ifdef CONFIG_PROC_CPU_RESCTRL 3230 ONE("cpu_resctrl_groups", S_IRUGO, proc_resctrl_show), 3231 #endif 3232 ONE("oom_score", S_IRUGO, proc_oom_score), 3233 REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adj_operations), 3234 REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations), 3235 #ifdef CONFIG_AUDIT 3236 REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations), 3237 REG("sessionid", S_IRUGO, proc_sessionid_operations), 3238 #endif 3239 #ifdef CONFIG_FAULT_INJECTION 3240 REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations), 3241 REG("fail-nth", 0644, proc_fail_nth_operations), 3242 #endif 3243 #ifdef CONFIG_ELF_CORE 3244 REG("coredump_filter", S_IRUGO|S_IWUSR, proc_coredump_filter_operations), 3245 #endif 3246 #ifdef CONFIG_TASK_IO_ACCOUNTING 3247 ONE("io", S_IRUSR, proc_tgid_io_accounting), 3248 #endif 3249 #ifdef CONFIG_USER_NS 3250 REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations), 3251 REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations), 3252 REG("projid_map", S_IRUGO|S_IWUSR, proc_projid_map_operations), 3253 REG("setgroups", S_IRUGO|S_IWUSR, proc_setgroups_operations), 3254 #endif 3255 #if defined(CONFIG_CHECKPOINT_RESTORE) && defined(CONFIG_POSIX_TIMERS) 3256 REG("timers", S_IRUGO, proc_timers_operations), 3257 #endif 3258 REG("timerslack_ns", S_IRUGO|S_IWUGO, proc_pid_set_timerslack_ns_operations), 3259 #ifdef CONFIG_LIVEPATCH 3260 ONE("patch_state", S_IRUSR, proc_pid_patch_state), 3261 #endif 3262 #ifdef CONFIG_STACKLEAK_METRICS 3263 ONE("stack_depth", S_IRUGO, proc_stack_depth), 3264 #endif 3265 #ifdef CONFIG_PROC_PID_ARCH_STATUS 3266 ONE("arch_status", S_IRUGO, proc_pid_arch_status), 3267 #endif 3268 #ifdef CONFIG_SECCOMP_CACHE_DEBUG 3269 ONE("seccomp_cache", S_IRUSR, proc_pid_seccomp_cache), 3270 #endif 3271 }; 3272 3273 static int proc_tgid_base_readdir(struct file *file, struct dir_context *ctx) 3274 { 3275 return proc_pident_readdir(file, ctx, 3276 tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff)); 3277 } 3278 3279 static const struct file_operations proc_tgid_base_operations = { 3280 .read = generic_read_dir, 3281 .iterate_shared = proc_tgid_base_readdir, 3282 .llseek = generic_file_llseek, 3283 }; 3284 3285 struct pid *tgid_pidfd_to_pid(const struct file *file) 3286 { 3287 if (file->f_op != &proc_tgid_base_operations) 3288 return ERR_PTR(-EBADF); 3289 3290 return proc_pid(file_inode(file)); 3291 } 3292 3293 static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags) 3294 { 3295 return proc_pident_lookup(dir, dentry, 3296 tgid_base_stuff, 3297 tgid_base_stuff + ARRAY_SIZE(tgid_base_stuff)); 3298 } 3299 3300 static const struct inode_operations proc_tgid_base_inode_operations = { 3301 .lookup = proc_tgid_base_lookup, 3302 .getattr = pid_getattr, 3303 .setattr = proc_setattr, 3304 .permission = proc_pid_permission, 3305 }; 3306 3307 /** 3308 * proc_flush_pid - Remove dcache entries for @pid from the /proc dcache. 3309 * @pid: pid that should be flushed. 3310 * 3311 * This function walks a list of inodes (that belong to any proc 3312 * filesystem) that are attached to the pid and flushes them from 3313 * the dentry cache. 3314 * 3315 * It is safe and reasonable to cache /proc entries for a task until 3316 * that task exits. After that they just clog up the dcache with 3317 * useless entries, possibly causing useful dcache entries to be 3318 * flushed instead. This routine is provided to flush those useless 3319 * dcache entries when a process is reaped. 3320 * 3321 * NOTE: This routine is just an optimization so it does not guarantee 3322 * that no dcache entries will exist after a process is reaped 3323 * it just makes it very unlikely that any will persist. 3324 */ 3325 3326 void proc_flush_pid(struct pid *pid) 3327 { 3328 proc_invalidate_siblings_dcache(&pid->inodes, &pid->lock); 3329 } 3330 3331 static struct dentry *proc_pid_instantiate(struct dentry * dentry, 3332 struct task_struct *task, const void *ptr) 3333 { 3334 struct inode *inode; 3335 3336 inode = proc_pid_make_inode(dentry->d_sb, task, S_IFDIR | S_IRUGO | S_IXUGO); 3337 if (!inode) 3338 return ERR_PTR(-ENOENT); 3339 3340 inode->i_op = &proc_tgid_base_inode_operations; 3341 inode->i_fop = &proc_tgid_base_operations; 3342 inode->i_flags|=S_IMMUTABLE; 3343 3344 set_nlink(inode, nlink_tgid); 3345 pid_update_inode(task, inode); 3346 3347 d_set_d_op(dentry, &pid_dentry_operations); 3348 return d_splice_alias(inode, dentry); 3349 } 3350 3351 struct dentry *proc_pid_lookup(struct dentry *dentry, unsigned int flags) 3352 { 3353 struct task_struct *task; 3354 unsigned tgid; 3355 struct proc_fs_info *fs_info; 3356 struct pid_namespace *ns; 3357 struct dentry *result = ERR_PTR(-ENOENT); 3358 3359 tgid = name_to_int(&dentry->d_name); 3360 if (tgid == ~0U) 3361 goto out; 3362 3363 fs_info = proc_sb_info(dentry->d_sb); 3364 ns = fs_info->pid_ns; 3365 rcu_read_lock(); 3366 task = find_task_by_pid_ns(tgid, ns); 3367 if (task) 3368 get_task_struct(task); 3369 rcu_read_unlock(); 3370 if (!task) 3371 goto out; 3372 3373 /* Limit procfs to only ptraceable tasks */ 3374 if (fs_info->hide_pid == HIDEPID_NOT_PTRACEABLE) { 3375 if (!has_pid_permissions(fs_info, task, HIDEPID_NO_ACCESS)) 3376 goto out_put_task; 3377 } 3378 3379 result = proc_pid_instantiate(dentry, task, NULL); 3380 out_put_task: 3381 put_task_struct(task); 3382 out: 3383 return result; 3384 } 3385 3386 /* 3387 * Find the first task with tgid >= tgid 3388 * 3389 */ 3390 struct tgid_iter { 3391 unsigned int tgid; 3392 struct task_struct *task; 3393 }; 3394 static struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter) 3395 { 3396 struct pid *pid; 3397 3398 if (iter.task) 3399 put_task_struct(iter.task); 3400 rcu_read_lock(); 3401 retry: 3402 iter.task = NULL; 3403 pid = find_ge_pid(iter.tgid, ns); 3404 if (pid) { 3405 iter.tgid = pid_nr_ns(pid, ns); 3406 iter.task = pid_task(pid, PIDTYPE_TGID); 3407 if (!iter.task) { 3408 iter.tgid += 1; 3409 goto retry; 3410 } 3411 get_task_struct(iter.task); 3412 } 3413 rcu_read_unlock(); 3414 return iter; 3415 } 3416 3417 #define TGID_OFFSET (FIRST_PROCESS_ENTRY + 2) 3418 3419 /* for the /proc/ directory itself, after non-process stuff has been done */ 3420 int proc_pid_readdir(struct file *file, struct dir_context *ctx) 3421 { 3422 struct tgid_iter iter; 3423 struct proc_fs_info *fs_info = proc_sb_info(file_inode(file)->i_sb); 3424 struct pid_namespace *ns = proc_pid_ns(file_inode(file)->i_sb); 3425 loff_t pos = ctx->pos; 3426 3427 if (pos >= PID_MAX_LIMIT + TGID_OFFSET) 3428 return 0; 3429 3430 if (pos == TGID_OFFSET - 2) { 3431 struct inode *inode = d_inode(fs_info->proc_self); 3432 if (!dir_emit(ctx, "self", 4, inode->i_ino, DT_LNK)) 3433 return 0; 3434 ctx->pos = pos = pos + 1; 3435 } 3436 if (pos == TGID_OFFSET - 1) { 3437 struct inode *inode = d_inode(fs_info->proc_thread_self); 3438 if (!dir_emit(ctx, "thread-self", 11, inode->i_ino, DT_LNK)) 3439 return 0; 3440 ctx->pos = pos = pos + 1; 3441 } 3442 iter.tgid = pos - TGID_OFFSET; 3443 iter.task = NULL; 3444 for (iter = next_tgid(ns, iter); 3445 iter.task; 3446 iter.tgid += 1, iter = next_tgid(ns, iter)) { 3447 char name[10 + 1]; 3448 unsigned int len; 3449 3450 cond_resched(); 3451 if (!has_pid_permissions(fs_info, iter.task, HIDEPID_INVISIBLE)) 3452 continue; 3453 3454 len = snprintf(name, sizeof(name), "%u", iter.tgid); 3455 ctx->pos = iter.tgid + TGID_OFFSET; 3456 if (!proc_fill_cache(file, ctx, name, len, 3457 proc_pid_instantiate, iter.task, NULL)) { 3458 put_task_struct(iter.task); 3459 return 0; 3460 } 3461 } 3462 ctx->pos = PID_MAX_LIMIT + TGID_OFFSET; 3463 return 0; 3464 } 3465 3466 /* 3467 * proc_tid_comm_permission is a special permission function exclusively 3468 * used for the node /proc/<pid>/task/<tid>/comm. 3469 * It bypasses generic permission checks in the case where a task of the same 3470 * task group attempts to access the node. 3471 * The rationale behind this is that glibc and bionic access this node for 3472 * cross thread naming (pthread_set/getname_np(!self)). However, if 3473 * PR_SET_DUMPABLE gets set to 0 this node among others becomes uid=0 gid=0, 3474 * which locks out the cross thread naming implementation. 3475 * This function makes sure that the node is always accessible for members of 3476 * same thread group. 3477 */ 3478 static int proc_tid_comm_permission(struct user_namespace *mnt_userns, 3479 struct inode *inode, int mask) 3480 { 3481 bool is_same_tgroup; 3482 struct task_struct *task; 3483 3484 task = get_proc_task(inode); 3485 if (!task) 3486 return -ESRCH; 3487 is_same_tgroup = same_thread_group(current, task); 3488 put_task_struct(task); 3489 3490 if (likely(is_same_tgroup && !(mask & MAY_EXEC))) { 3491 /* This file (/proc/<pid>/task/<tid>/comm) can always be 3492 * read or written by the members of the corresponding 3493 * thread group. 3494 */ 3495 return 0; 3496 } 3497 3498 return generic_permission(&init_user_ns, inode, mask); 3499 } 3500 3501 static const struct inode_operations proc_tid_comm_inode_operations = { 3502 .permission = proc_tid_comm_permission, 3503 }; 3504 3505 /* 3506 * Tasks 3507 */ 3508 static const struct pid_entry tid_base_stuff[] = { 3509 DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations), 3510 DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations), 3511 DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations), 3512 #ifdef CONFIG_NET 3513 DIR("net", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations), 3514 #endif 3515 REG("environ", S_IRUSR, proc_environ_operations), 3516 REG("auxv", S_IRUSR, proc_auxv_operations), 3517 ONE("status", S_IRUGO, proc_pid_status), 3518 ONE("personality", S_IRUSR, proc_pid_personality), 3519 ONE("limits", S_IRUGO, proc_pid_limits), 3520 #ifdef CONFIG_SCHED_DEBUG 3521 REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations), 3522 #endif 3523 NOD("comm", S_IFREG|S_IRUGO|S_IWUSR, 3524 &proc_tid_comm_inode_operations, 3525 &proc_pid_set_comm_operations, {}), 3526 #ifdef CONFIG_HAVE_ARCH_TRACEHOOK 3527 ONE("syscall", S_IRUSR, proc_pid_syscall), 3528 #endif 3529 REG("cmdline", S_IRUGO, proc_pid_cmdline_ops), 3530 ONE("stat", S_IRUGO, proc_tid_stat), 3531 ONE("statm", S_IRUGO, proc_pid_statm), 3532 REG("maps", S_IRUGO, proc_pid_maps_operations), 3533 #ifdef CONFIG_PROC_CHILDREN 3534 REG("children", S_IRUGO, proc_tid_children_operations), 3535 #endif 3536 #ifdef CONFIG_NUMA 3537 REG("numa_maps", S_IRUGO, proc_pid_numa_maps_operations), 3538 #endif 3539 REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations), 3540 LNK("cwd", proc_cwd_link), 3541 LNK("root", proc_root_link), 3542 LNK("exe", proc_exe_link), 3543 REG("mounts", S_IRUGO, proc_mounts_operations), 3544 REG("mountinfo", S_IRUGO, proc_mountinfo_operations), 3545 #ifdef CONFIG_PROC_PAGE_MONITOR 3546 REG("clear_refs", S_IWUSR, proc_clear_refs_operations), 3547 REG("smaps", S_IRUGO, proc_pid_smaps_operations), 3548 REG("smaps_rollup", S_IRUGO, proc_pid_smaps_rollup_operations), 3549 REG("pagemap", S_IRUSR, proc_pagemap_operations), 3550 #endif 3551 #ifdef CONFIG_SECURITY 3552 DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations), 3553 #endif 3554 #ifdef CONFIG_KALLSYMS 3555 ONE("wchan", S_IRUGO, proc_pid_wchan), 3556 #endif 3557 #ifdef CONFIG_STACKTRACE 3558 ONE("stack", S_IRUSR, proc_pid_stack), 3559 #endif 3560 #ifdef CONFIG_SCHED_INFO 3561 ONE("schedstat", S_IRUGO, proc_pid_schedstat), 3562 #endif 3563 #ifdef CONFIG_LATENCYTOP 3564 REG("latency", S_IRUGO, proc_lstats_operations), 3565 #endif 3566 #ifdef CONFIG_PROC_PID_CPUSET 3567 ONE("cpuset", S_IRUGO, proc_cpuset_show), 3568 #endif 3569 #ifdef CONFIG_CGROUPS 3570 ONE("cgroup", S_IRUGO, proc_cgroup_show), 3571 #endif 3572 #ifdef CONFIG_PROC_CPU_RESCTRL 3573 ONE("cpu_resctrl_groups", S_IRUGO, proc_resctrl_show), 3574 #endif 3575 ONE("oom_score", S_IRUGO, proc_oom_score), 3576 REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adj_operations), 3577 REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations), 3578 #ifdef CONFIG_AUDIT 3579 REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations), 3580 REG("sessionid", S_IRUGO, proc_sessionid_operations), 3581 #endif 3582 #ifdef CONFIG_FAULT_INJECTION 3583 REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations), 3584 REG("fail-nth", 0644, proc_fail_nth_operations), 3585 #endif 3586 #ifdef CONFIG_TASK_IO_ACCOUNTING 3587 ONE("io", S_IRUSR, proc_tid_io_accounting), 3588 #endif 3589 #ifdef CONFIG_USER_NS 3590 REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations), 3591 REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations), 3592 REG("projid_map", S_IRUGO|S_IWUSR, proc_projid_map_operations), 3593 REG("setgroups", S_IRUGO|S_IWUSR, proc_setgroups_operations), 3594 #endif 3595 #ifdef CONFIG_LIVEPATCH 3596 ONE("patch_state", S_IRUSR, proc_pid_patch_state), 3597 #endif 3598 #ifdef CONFIG_PROC_PID_ARCH_STATUS 3599 ONE("arch_status", S_IRUGO, proc_pid_arch_status), 3600 #endif 3601 #ifdef CONFIG_SECCOMP_CACHE_DEBUG 3602 ONE("seccomp_cache", S_IRUSR, proc_pid_seccomp_cache), 3603 #endif 3604 }; 3605 3606 static int proc_tid_base_readdir(struct file *file, struct dir_context *ctx) 3607 { 3608 return proc_pident_readdir(file, ctx, 3609 tid_base_stuff, ARRAY_SIZE(tid_base_stuff)); 3610 } 3611 3612 static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags) 3613 { 3614 return proc_pident_lookup(dir, dentry, 3615 tid_base_stuff, 3616 tid_base_stuff + ARRAY_SIZE(tid_base_stuff)); 3617 } 3618 3619 static const struct file_operations proc_tid_base_operations = { 3620 .read = generic_read_dir, 3621 .iterate_shared = proc_tid_base_readdir, 3622 .llseek = generic_file_llseek, 3623 }; 3624 3625 static const struct inode_operations proc_tid_base_inode_operations = { 3626 .lookup = proc_tid_base_lookup, 3627 .getattr = pid_getattr, 3628 .setattr = proc_setattr, 3629 }; 3630 3631 static struct dentry *proc_task_instantiate(struct dentry *dentry, 3632 struct task_struct *task, const void *ptr) 3633 { 3634 struct inode *inode; 3635 inode = proc_pid_make_inode(dentry->d_sb, task, S_IFDIR | S_IRUGO | S_IXUGO); 3636 if (!inode) 3637 return ERR_PTR(-ENOENT); 3638 3639 inode->i_op = &proc_tid_base_inode_operations; 3640 inode->i_fop = &proc_tid_base_operations; 3641 inode->i_flags |= S_IMMUTABLE; 3642 3643 set_nlink(inode, nlink_tid); 3644 pid_update_inode(task, inode); 3645 3646 d_set_d_op(dentry, &pid_dentry_operations); 3647 return d_splice_alias(inode, dentry); 3648 } 3649 3650 static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags) 3651 { 3652 struct task_struct *task; 3653 struct task_struct *leader = get_proc_task(dir); 3654 unsigned tid; 3655 struct proc_fs_info *fs_info; 3656 struct pid_namespace *ns; 3657 struct dentry *result = ERR_PTR(-ENOENT); 3658 3659 if (!leader) 3660 goto out_no_task; 3661 3662 tid = name_to_int(&dentry->d_name); 3663 if (tid == ~0U) 3664 goto out; 3665 3666 fs_info = proc_sb_info(dentry->d_sb); 3667 ns = fs_info->pid_ns; 3668 rcu_read_lock(); 3669 task = find_task_by_pid_ns(tid, ns); 3670 if (task) 3671 get_task_struct(task); 3672 rcu_read_unlock(); 3673 if (!task) 3674 goto out; 3675 if (!same_thread_group(leader, task)) 3676 goto out_drop_task; 3677 3678 result = proc_task_instantiate(dentry, task, NULL); 3679 out_drop_task: 3680 put_task_struct(task); 3681 out: 3682 put_task_struct(leader); 3683 out_no_task: 3684 return result; 3685 } 3686 3687 /* 3688 * Find the first tid of a thread group to return to user space. 3689 * 3690 * Usually this is just the thread group leader, but if the users 3691 * buffer was too small or there was a seek into the middle of the 3692 * directory we have more work todo. 3693 * 3694 * In the case of a short read we start with find_task_by_pid. 3695 * 3696 * In the case of a seek we start with the leader and walk nr 3697 * threads past it. 3698 */ 3699 static struct task_struct *first_tid(struct pid *pid, int tid, loff_t f_pos, 3700 struct pid_namespace *ns) 3701 { 3702 struct task_struct *pos, *task; 3703 unsigned long nr = f_pos; 3704 3705 if (nr != f_pos) /* 32bit overflow? */ 3706 return NULL; 3707 3708 rcu_read_lock(); 3709 task = pid_task(pid, PIDTYPE_PID); 3710 if (!task) 3711 goto fail; 3712 3713 /* Attempt to start with the tid of a thread */ 3714 if (tid && nr) { 3715 pos = find_task_by_pid_ns(tid, ns); 3716 if (pos && same_thread_group(pos, task)) 3717 goto found; 3718 } 3719 3720 /* If nr exceeds the number of threads there is nothing todo */ 3721 if (nr >= get_nr_threads(task)) 3722 goto fail; 3723 3724 /* If we haven't found our starting place yet start 3725 * with the leader and walk nr threads forward. 3726 */ 3727 pos = task = task->group_leader; 3728 do { 3729 if (!nr--) 3730 goto found; 3731 } while_each_thread(task, pos); 3732 fail: 3733 pos = NULL; 3734 goto out; 3735 found: 3736 get_task_struct(pos); 3737 out: 3738 rcu_read_unlock(); 3739 return pos; 3740 } 3741 3742 /* 3743 * Find the next thread in the thread list. 3744 * Return NULL if there is an error or no next thread. 3745 * 3746 * The reference to the input task_struct is released. 3747 */ 3748 static struct task_struct *next_tid(struct task_struct *start) 3749 { 3750 struct task_struct *pos = NULL; 3751 rcu_read_lock(); 3752 if (pid_alive(start)) { 3753 pos = next_thread(start); 3754 if (thread_group_leader(pos)) 3755 pos = NULL; 3756 else 3757 get_task_struct(pos); 3758 } 3759 rcu_read_unlock(); 3760 put_task_struct(start); 3761 return pos; 3762 } 3763 3764 /* for the /proc/TGID/task/ directories */ 3765 static int proc_task_readdir(struct file *file, struct dir_context *ctx) 3766 { 3767 struct inode *inode = file_inode(file); 3768 struct task_struct *task; 3769 struct pid_namespace *ns; 3770 int tid; 3771 3772 if (proc_inode_is_dead(inode)) 3773 return -ENOENT; 3774 3775 if (!dir_emit_dots(file, ctx)) 3776 return 0; 3777 3778 /* f_version caches the tgid value that the last readdir call couldn't 3779 * return. lseek aka telldir automagically resets f_version to 0. 3780 */ 3781 ns = proc_pid_ns(inode->i_sb); 3782 tid = (int)file->f_version; 3783 file->f_version = 0; 3784 for (task = first_tid(proc_pid(inode), tid, ctx->pos - 2, ns); 3785 task; 3786 task = next_tid(task), ctx->pos++) { 3787 char name[10 + 1]; 3788 unsigned int len; 3789 tid = task_pid_nr_ns(task, ns); 3790 len = snprintf(name, sizeof(name), "%u", tid); 3791 if (!proc_fill_cache(file, ctx, name, len, 3792 proc_task_instantiate, task, NULL)) { 3793 /* returning this tgid failed, save it as the first 3794 * pid for the next readir call */ 3795 file->f_version = (u64)tid; 3796 put_task_struct(task); 3797 break; 3798 } 3799 } 3800 3801 return 0; 3802 } 3803 3804 static int proc_task_getattr(struct user_namespace *mnt_userns, 3805 const struct path *path, struct kstat *stat, 3806 u32 request_mask, unsigned int query_flags) 3807 { 3808 struct inode *inode = d_inode(path->dentry); 3809 struct task_struct *p = get_proc_task(inode); 3810 generic_fillattr(&init_user_ns, inode, stat); 3811 3812 if (p) { 3813 stat->nlink += get_nr_threads(p); 3814 put_task_struct(p); 3815 } 3816 3817 return 0; 3818 } 3819 3820 static const struct inode_operations proc_task_inode_operations = { 3821 .lookup = proc_task_lookup, 3822 .getattr = proc_task_getattr, 3823 .setattr = proc_setattr, 3824 .permission = proc_pid_permission, 3825 }; 3826 3827 static const struct file_operations proc_task_operations = { 3828 .read = generic_read_dir, 3829 .iterate_shared = proc_task_readdir, 3830 .llseek = generic_file_llseek, 3831 }; 3832 3833 void __init set_proc_pid_nlink(void) 3834 { 3835 nlink_tid = pid_entry_nlink(tid_base_stuff, ARRAY_SIZE(tid_base_stuff)); 3836 nlink_tgid = pid_entry_nlink(tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff)); 3837 } 3838