4 * Copyright (C) 1991, 1992 Linus Torvalds
6 * proc base directory handling functions
8 * 1999, Al Viro. Rewritten. Now it covers the whole per-process part.
9 * Instead of using magical inumbers to determine the kind of object
10 * we allocate and fill in-core inodes upon lookup. They don't even
11 * go into icache. We cache the reference to task_struct upon lookup too.
12 * Eventually it should become a filesystem in its own. We don't use the
13 * rest of procfs anymore.
24 * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT
26 * A new process specific entry (smaps) included in /proc. It shows the
27 * size of rss for each memory area. The maps entry lacks information
28 * about physical memory size (rss) for each mapped file, i.e.,
29 * rss information for executables and library files.
30 * This additional information is useful for any tools that need to know
31 * about physical memory consumption for a process specific library.
35 * Embedded Linux Lab - 10LE Instituto Nokia de Tecnologia - INdT
36 * Pud inclusion in the page table walking.
40 * 10LE Instituto Nokia de Tecnologia - INdT:
41 * A better way to walks through the page table as suggested by Hugh Dickins.
44 * Smaps information related to shared, private, clean and dirty pages.
47 * Overall revision about smaps.
50 #include <linux/uaccess.h>
52 #include <linux/errno.h>
53 #include <linux/time.h>
54 #include <linux/proc_fs.h>
55 #include <linux/stat.h>
56 #include <linux/task_io_accounting_ops.h>
57 #include <linux/init.h>
58 #include <linux/capability.h>
59 #include <linux/file.h>
60 #include <linux/fdtable.h>
61 #include <linux/string.h>
62 #include <linux/seq_file.h>
63 #include <linux/namei.h>
64 #include <linux/mnt_namespace.h>
66 #include <linux/swap.h>
67 #include <linux/rcupdate.h>
68 #include <linux/kallsyms.h>
69 #include <linux/stacktrace.h>
70 #include <linux/resource.h>
71 #include <linux/module.h>
72 #include <linux/mount.h>
73 #include <linux/security.h>
74 #include <linux/ptrace.h>
75 #include <linux/tracehook.h>
76 #include <linux/printk.h>
77 #include <linux/cgroup.h>
78 #include <linux/cpuset.h>
79 #include <linux/audit.h>
80 #include <linux/poll.h>
81 #include <linux/nsproxy.h>
82 #include <linux/oom.h>
83 #include <linux/elf.h>
84 #include <linux/pid_namespace.h>
85 #include <linux/user_namespace.h>
86 #include <linux/fs_struct.h>
87 #include <linux/slab.h>
88 #include <linux/sched/autogroup.h>
89 #include <linux/sched/mm.h>
90 #include <linux/sched/coredump.h>
91 #include <linux/sched/debug.h>
92 #include <linux/sched/stat.h>
93 #include <linux/flex_array.h>
94 #include <linux/posix-timers.h>
95 #ifdef CONFIG_HARDWALL
96 #include <asm/hardwall.h>
98 #include <trace/events/oom.h>
103 * Implementing inode permission operations in /proc is almost
104 * certainly an error. Permission checks need to happen during
105 * each system call not at open time. The reason is that most of
106 * what we wish to check for permissions in /proc varies at runtime.
108 * The classic example of a problem is opening file descriptors
109 * in /proc for a task before it execs a suid executable.
113 static u8 nlink_tgid;
119 const struct inode_operations *iop;
120 const struct file_operations *fop;
124 #define NOD(NAME, MODE, IOP, FOP, OP) { \
126 .len = sizeof(NAME) - 1, \
133 #define DIR(NAME, MODE, iops, fops) \
134 NOD(NAME, (S_IFDIR|(MODE)), &iops, &fops, {} )
135 #define LNK(NAME, get_link) \
136 NOD(NAME, (S_IFLNK|S_IRWXUGO), \
137 &proc_pid_link_inode_operations, NULL, \
138 { .proc_get_link = get_link } )
139 #define REG(NAME, MODE, fops) \
140 NOD(NAME, (S_IFREG|(MODE)), NULL, &fops, {})
141 #define ONE(NAME, MODE, show) \
142 NOD(NAME, (S_IFREG|(MODE)), \
143 NULL, &proc_single_file_operations, \
144 { .proc_show = show } )
147 * Count the number of hardlinks for the pid_entry table, excluding the .
150 static unsigned int __init pid_entry_nlink(const struct pid_entry *entries,
157 for (i = 0; i < n; ++i) {
158 if (S_ISDIR(entries[i].mode))
165 static int get_task_root(struct task_struct *task, struct path *root)
167 int result = -ENOENT;
171 get_fs_root(task->fs, root);
178 static int proc_cwd_link(struct dentry *dentry, struct path *path)
180 struct task_struct *task = get_proc_task(d_inode(dentry));
181 int result = -ENOENT;
186 get_fs_pwd(task->fs, path);
190 put_task_struct(task);
195 static int proc_root_link(struct dentry *dentry, struct path *path)
197 struct task_struct *task = get_proc_task(d_inode(dentry));
198 int result = -ENOENT;
201 result = get_task_root(task, path);
202 put_task_struct(task);
207 static ssize_t proc_pid_cmdline_read(struct file *file, char __user *buf,
208 size_t _count, loff_t *pos)
210 struct task_struct *tsk;
211 struct mm_struct *mm;
213 unsigned long count = _count;
214 unsigned long arg_start, arg_end, env_start, env_end;
215 unsigned long len1, len2, len;
222 tsk = get_proc_task(file_inode(file));
225 mm = get_task_mm(tsk);
226 put_task_struct(tsk);
229 /* Check if process spawned far enough to have cmdline. */
235 page = (char *)__get_free_page(GFP_TEMPORARY);
241 down_read(&mm->mmap_sem);
242 arg_start = mm->arg_start;
243 arg_end = mm->arg_end;
244 env_start = mm->env_start;
245 env_end = mm->env_end;
246 up_read(&mm->mmap_sem);
248 BUG_ON(arg_start > arg_end);
249 BUG_ON(env_start > env_end);
251 len1 = arg_end - arg_start;
252 len2 = env_end - env_start;
260 * Inherently racy -- command line shares address space
261 * with code and data.
263 rv = access_remote_vm(mm, arg_end - 1, &c, 1, 0);
270 /* Command line (set of strings) occupies whole ARGV. */
274 p = arg_start + *pos;
276 while (count > 0 && len > 0) {
280 _count = min3(count, len, PAGE_SIZE);
281 nr_read = access_remote_vm(mm, p, page, _count, 0);
287 if (copy_to_user(buf, page, nr_read)) {
300 * Command line (1 string) occupies ARGV and
307 { .p = arg_start, .len = len1 },
308 { .p = env_start, .len = len2 },
314 while (i < 2 && pos1 >= cmdline[i].len) {
315 pos1 -= cmdline[i].len;
319 p = cmdline[i].p + pos1;
320 len = cmdline[i].len - pos1;
321 while (count > 0 && len > 0) {
322 unsigned int _count, l;
326 _count = min3(count, len, PAGE_SIZE);
327 nr_read = access_remote_vm(mm, p, page, _count, 0);
334 * Command line can be shorter than whole ARGV
335 * even if last "marker" byte says it is not.
338 l = strnlen(page, nr_read);
344 if (copy_to_user(buf, page, nr_read)) {
359 /* Only first chunk can be read partially. */
366 free_page((unsigned long)page);
374 static const struct file_operations proc_pid_cmdline_ops = {
375 .read = proc_pid_cmdline_read,
376 .llseek = generic_file_llseek,
379 #ifdef CONFIG_KALLSYMS
381 * Provides a wchan file via kallsyms in a proper one-value-per-file format.
382 * Returns the resolved symbol. If that fails, simply return the address.
384 static int proc_pid_wchan(struct seq_file *m, struct pid_namespace *ns,
385 struct pid *pid, struct task_struct *task)
388 char symname[KSYM_NAME_LEN];
390 wchan = get_wchan(task);
392 if (wchan && ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS)
393 && !lookup_symbol_name(wchan, symname))
394 seq_printf(m, "%s", symname);
400 #endif /* CONFIG_KALLSYMS */
402 static int lock_trace(struct task_struct *task)
404 int err = mutex_lock_killable(&task->signal->cred_guard_mutex);
407 if (!ptrace_may_access(task, PTRACE_MODE_ATTACH_FSCREDS)) {
408 mutex_unlock(&task->signal->cred_guard_mutex);
414 static void unlock_trace(struct task_struct *task)
416 mutex_unlock(&task->signal->cred_guard_mutex);
419 #ifdef CONFIG_STACKTRACE
421 #define MAX_STACK_TRACE_DEPTH 64
423 static int proc_pid_stack(struct seq_file *m, struct pid_namespace *ns,
424 struct pid *pid, struct task_struct *task)
426 struct stack_trace trace;
427 unsigned long *entries;
431 entries = kmalloc(MAX_STACK_TRACE_DEPTH * sizeof(*entries), GFP_KERNEL);
435 trace.nr_entries = 0;
436 trace.max_entries = MAX_STACK_TRACE_DEPTH;
437 trace.entries = entries;
440 err = lock_trace(task);
442 save_stack_trace_tsk(task, &trace);
444 for (i = 0; i < trace.nr_entries; i++) {
445 seq_printf(m, "[<%pK>] %pB\n",
446 (void *)entries[i], (void *)entries[i]);
456 #ifdef CONFIG_SCHED_INFO
458 * Provides /proc/PID/schedstat
460 static int proc_pid_schedstat(struct seq_file *m, struct pid_namespace *ns,
461 struct pid *pid, struct task_struct *task)
463 if (unlikely(!sched_info_on()))
464 seq_printf(m, "0 0 0\n");
466 seq_printf(m, "%llu %llu %lu\n",
467 (unsigned long long)task->se.sum_exec_runtime,
468 (unsigned long long)task->sched_info.run_delay,
469 task->sched_info.pcount);
475 #ifdef CONFIG_LATENCYTOP
476 static int lstats_show_proc(struct seq_file *m, void *v)
479 struct inode *inode = m->private;
480 struct task_struct *task = get_proc_task(inode);
484 seq_puts(m, "Latency Top version : v0.1\n");
485 for (i = 0; i < 32; i++) {
486 struct latency_record *lr = &task->latency_record[i];
487 if (lr->backtrace[0]) {
489 seq_printf(m, "%i %li %li",
490 lr->count, lr->time, lr->max);
491 for (q = 0; q < LT_BACKTRACEDEPTH; q++) {
492 unsigned long bt = lr->backtrace[q];
497 seq_printf(m, " %ps", (void *)bt);
503 put_task_struct(task);
507 static int lstats_open(struct inode *inode, struct file *file)
509 return single_open(file, lstats_show_proc, inode);
512 static ssize_t lstats_write(struct file *file, const char __user *buf,
513 size_t count, loff_t *offs)
515 struct task_struct *task = get_proc_task(file_inode(file));
519 clear_all_latency_tracing(task);
520 put_task_struct(task);
525 static const struct file_operations proc_lstats_operations = {
528 .write = lstats_write,
530 .release = single_release,
535 static int proc_oom_score(struct seq_file *m, struct pid_namespace *ns,
536 struct pid *pid, struct task_struct *task)
538 unsigned long totalpages = totalram_pages + total_swap_pages;
539 unsigned long points = 0;
541 points = oom_badness(task, NULL, NULL, totalpages) *
543 seq_printf(m, "%lu\n", points);
553 static const struct limit_names lnames[RLIM_NLIMITS] = {
554 [RLIMIT_CPU] = {"Max cpu time", "seconds"},
555 [RLIMIT_FSIZE] = {"Max file size", "bytes"},
556 [RLIMIT_DATA] = {"Max data size", "bytes"},
557 [RLIMIT_STACK] = {"Max stack size", "bytes"},
558 [RLIMIT_CORE] = {"Max core file size", "bytes"},
559 [RLIMIT_RSS] = {"Max resident set", "bytes"},
560 [RLIMIT_NPROC] = {"Max processes", "processes"},
561 [RLIMIT_NOFILE] = {"Max open files", "files"},
562 [RLIMIT_MEMLOCK] = {"Max locked memory", "bytes"},
563 [RLIMIT_AS] = {"Max address space", "bytes"},
564 [RLIMIT_LOCKS] = {"Max file locks", "locks"},
565 [RLIMIT_SIGPENDING] = {"Max pending signals", "signals"},
566 [RLIMIT_MSGQUEUE] = {"Max msgqueue size", "bytes"},
567 [RLIMIT_NICE] = {"Max nice priority", NULL},
568 [RLIMIT_RTPRIO] = {"Max realtime priority", NULL},
569 [RLIMIT_RTTIME] = {"Max realtime timeout", "us"},
572 /* Display limits for a process */
573 static int proc_pid_limits(struct seq_file *m, struct pid_namespace *ns,
574 struct pid *pid, struct task_struct *task)
579 struct rlimit rlim[RLIM_NLIMITS];
581 if (!lock_task_sighand(task, &flags))
583 memcpy(rlim, task->signal->rlim, sizeof(struct rlimit) * RLIM_NLIMITS);
584 unlock_task_sighand(task, &flags);
587 * print the file header
589 seq_printf(m, "%-25s %-20s %-20s %-10s\n",
590 "Limit", "Soft Limit", "Hard Limit", "Units");
592 for (i = 0; i < RLIM_NLIMITS; i++) {
593 if (rlim[i].rlim_cur == RLIM_INFINITY)
594 seq_printf(m, "%-25s %-20s ",
595 lnames[i].name, "unlimited");
597 seq_printf(m, "%-25s %-20lu ",
598 lnames[i].name, rlim[i].rlim_cur);
600 if (rlim[i].rlim_max == RLIM_INFINITY)
601 seq_printf(m, "%-20s ", "unlimited");
603 seq_printf(m, "%-20lu ", rlim[i].rlim_max);
606 seq_printf(m, "%-10s\n", lnames[i].unit);
614 #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
615 static int proc_pid_syscall(struct seq_file *m, struct pid_namespace *ns,
616 struct pid *pid, struct task_struct *task)
619 unsigned long args[6], sp, pc;
622 res = lock_trace(task);
626 if (task_current_syscall(task, &nr, args, 6, &sp, &pc))
627 seq_puts(m, "running\n");
629 seq_printf(m, "%ld 0x%lx 0x%lx\n", nr, sp, pc);
632 "%ld 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx 0x%lx\n",
634 args[0], args[1], args[2], args[3], args[4], args[5],
640 #endif /* CONFIG_HAVE_ARCH_TRACEHOOK */
642 /************************************************************************/
643 /* Here the fs part begins */
644 /************************************************************************/
646 /* permission checks */
647 static int proc_fd_access_allowed(struct inode *inode)
649 struct task_struct *task;
651 /* Allow access to a task's file descriptors if it is us or we
652 * may use ptrace attach to the process and find out that
655 task = get_proc_task(inode);
657 allowed = ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS);
658 put_task_struct(task);
663 int proc_setattr(struct dentry *dentry, struct iattr *attr)
666 struct inode *inode = d_inode(dentry);
668 if (attr->ia_valid & ATTR_MODE)
671 error = setattr_prepare(dentry, attr);
675 setattr_copy(inode, attr);
676 mark_inode_dirty(inode);
681 * May current process learn task's sched/cmdline info (for hide_pid_min=1)
682 * or euid/egid (for hide_pid_min=2)?
684 static bool has_pid_permissions(struct pid_namespace *pid,
685 struct task_struct *task,
688 if (pid->hide_pid < hide_pid_min)
690 if (in_group_p(pid->pid_gid))
692 return ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS);
696 static int proc_pid_permission(struct inode *inode, int mask)
698 struct pid_namespace *pid = inode->i_sb->s_fs_info;
699 struct task_struct *task;
702 task = get_proc_task(inode);
705 has_perms = has_pid_permissions(pid, task, HIDEPID_NO_ACCESS);
706 put_task_struct(task);
709 if (pid->hide_pid == HIDEPID_INVISIBLE) {
711 * Let's make getdents(), stat(), and open()
712 * consistent with each other. If a process
713 * may not stat() a file, it shouldn't be seen
721 return generic_permission(inode, mask);
726 static const struct inode_operations proc_def_inode_operations = {
727 .setattr = proc_setattr,
730 static int proc_single_show(struct seq_file *m, void *v)
732 struct inode *inode = m->private;
733 struct pid_namespace *ns;
735 struct task_struct *task;
738 ns = inode->i_sb->s_fs_info;
739 pid = proc_pid(inode);
740 task = get_pid_task(pid, PIDTYPE_PID);
744 ret = PROC_I(inode)->op.proc_show(m, ns, pid, task);
746 put_task_struct(task);
750 static int proc_single_open(struct inode *inode, struct file *filp)
752 return single_open(filp, proc_single_show, inode);
755 static const struct file_operations proc_single_file_operations = {
756 .open = proc_single_open,
759 .release = single_release,
763 struct mm_struct *proc_mem_open(struct inode *inode, unsigned int mode)
765 struct task_struct *task = get_proc_task(inode);
766 struct mm_struct *mm = ERR_PTR(-ESRCH);
769 mm = mm_access(task, mode | PTRACE_MODE_FSCREDS);
770 put_task_struct(task);
772 if (!IS_ERR_OR_NULL(mm)) {
773 /* ensure this mm_struct can't be freed */
775 /* but do not pin its memory */
783 static int __mem_open(struct inode *inode, struct file *file, unsigned int mode)
785 struct mm_struct *mm = proc_mem_open(inode, mode);
790 file->private_data = mm;
794 static int mem_open(struct inode *inode, struct file *file)
796 int ret = __mem_open(inode, file, PTRACE_MODE_ATTACH);
798 /* OK to pass negative loff_t, we can catch out-of-range */
799 file->f_mode |= FMODE_UNSIGNED_OFFSET;
804 static ssize_t mem_rw(struct file *file, char __user *buf,
805 size_t count, loff_t *ppos, int write)
807 struct mm_struct *mm = file->private_data;
808 unsigned long addr = *ppos;
816 page = (char *)__get_free_page(GFP_TEMPORARY);
821 if (!mmget_not_zero(mm))
824 flags = FOLL_FORCE | (write ? FOLL_WRITE : 0);
827 int this_len = min_t(int, count, PAGE_SIZE);
829 if (write && copy_from_user(page, buf, this_len)) {
834 this_len = access_remote_vm(mm, addr, page, this_len, flags);
841 if (!write && copy_to_user(buf, page, this_len)) {
855 free_page((unsigned long) page);
859 static ssize_t mem_read(struct file *file, char __user *buf,
860 size_t count, loff_t *ppos)
862 return mem_rw(file, buf, count, ppos, 0);
865 static ssize_t mem_write(struct file *file, const char __user *buf,
866 size_t count, loff_t *ppos)
868 return mem_rw(file, (char __user*)buf, count, ppos, 1);
871 loff_t mem_lseek(struct file *file, loff_t offset, int orig)
875 file->f_pos = offset;
878 file->f_pos += offset;
883 force_successful_syscall_return();
887 static int mem_release(struct inode *inode, struct file *file)
889 struct mm_struct *mm = file->private_data;
895 static const struct file_operations proc_mem_operations = {
900 .release = mem_release,
903 static int environ_open(struct inode *inode, struct file *file)
905 return __mem_open(inode, file, PTRACE_MODE_READ);
908 static ssize_t environ_read(struct file *file, char __user *buf,
909 size_t count, loff_t *ppos)
912 unsigned long src = *ppos;
914 struct mm_struct *mm = file->private_data;
915 unsigned long env_start, env_end;
917 /* Ensure the process spawned far enough to have an environment. */
918 if (!mm || !mm->env_end)
921 page = (char *)__get_free_page(GFP_TEMPORARY);
926 if (!mmget_not_zero(mm))
929 down_read(&mm->mmap_sem);
930 env_start = mm->env_start;
931 env_end = mm->env_end;
932 up_read(&mm->mmap_sem);
935 size_t this_len, max_len;
938 if (src >= (env_end - env_start))
941 this_len = env_end - (env_start + src);
943 max_len = min_t(size_t, PAGE_SIZE, count);
944 this_len = min(max_len, this_len);
946 retval = access_remote_vm(mm, (env_start + src), page, this_len, 0);
953 if (copy_to_user(buf, page, retval)) {
967 free_page((unsigned long) page);
971 static const struct file_operations proc_environ_operations = {
972 .open = environ_open,
973 .read = environ_read,
974 .llseek = generic_file_llseek,
975 .release = mem_release,
978 static int auxv_open(struct inode *inode, struct file *file)
980 return __mem_open(inode, file, PTRACE_MODE_READ_FSCREDS);
983 static ssize_t auxv_read(struct file *file, char __user *buf,
984 size_t count, loff_t *ppos)
986 struct mm_struct *mm = file->private_data;
987 unsigned int nwords = 0;
993 } while (mm->saved_auxv[nwords - 2] != 0); /* AT_NULL */
994 return simple_read_from_buffer(buf, count, ppos, mm->saved_auxv,
995 nwords * sizeof(mm->saved_auxv[0]));
998 static const struct file_operations proc_auxv_operations = {
1001 .llseek = generic_file_llseek,
1002 .release = mem_release,
1005 static ssize_t oom_adj_read(struct file *file, char __user *buf, size_t count,
1008 struct task_struct *task = get_proc_task(file_inode(file));
1009 char buffer[PROC_NUMBUF];
1010 int oom_adj = OOM_ADJUST_MIN;
1015 if (task->signal->oom_score_adj == OOM_SCORE_ADJ_MAX)
1016 oom_adj = OOM_ADJUST_MAX;
1018 oom_adj = (task->signal->oom_score_adj * -OOM_DISABLE) /
1020 put_task_struct(task);
1021 len = snprintf(buffer, sizeof(buffer), "%d\n", oom_adj);
1022 return simple_read_from_buffer(buf, count, ppos, buffer, len);
1025 static int __set_oom_adj(struct file *file, int oom_adj, bool legacy)
1027 static DEFINE_MUTEX(oom_adj_mutex);
1028 struct mm_struct *mm = NULL;
1029 struct task_struct *task;
1032 task = get_proc_task(file_inode(file));
1036 mutex_lock(&oom_adj_mutex);
1038 if (oom_adj < task->signal->oom_score_adj &&
1039 !capable(CAP_SYS_RESOURCE)) {
1044 * /proc/pid/oom_adj is provided for legacy purposes, ask users to use
1045 * /proc/pid/oom_score_adj instead.
1047 pr_warn_once("%s (%d): /proc/%d/oom_adj is deprecated, please use /proc/%d/oom_score_adj instead.\n",
1048 current->comm, task_pid_nr(current), task_pid_nr(task),
1051 if ((short)oom_adj < task->signal->oom_score_adj_min &&
1052 !capable(CAP_SYS_RESOURCE)) {
1059 * Make sure we will check other processes sharing the mm if this is
1060 * not vfrok which wants its own oom_score_adj.
1061 * pin the mm so it doesn't go away and get reused after task_unlock
1063 if (!task->vfork_done) {
1064 struct task_struct *p = find_lock_task_mm(task);
1067 if (atomic_read(&p->mm->mm_users) > 1) {
1075 task->signal->oom_score_adj = oom_adj;
1076 if (!legacy && has_capability_noaudit(current, CAP_SYS_RESOURCE))
1077 task->signal->oom_score_adj_min = (short)oom_adj;
1078 trace_oom_score_adj_update(task);
1081 struct task_struct *p;
1084 for_each_process(p) {
1085 if (same_thread_group(task, p))
1088 /* do not touch kernel threads or the global init */
1089 if (p->flags & PF_KTHREAD || is_global_init(p))
1093 if (!p->vfork_done && process_shares_mm(p, mm)) {
1094 pr_info("updating oom_score_adj for %d (%s) from %d to %d because it shares mm with %d (%s). Report if this is unexpected.\n",
1095 task_pid_nr(p), p->comm,
1096 p->signal->oom_score_adj, oom_adj,
1097 task_pid_nr(task), task->comm);
1098 p->signal->oom_score_adj = oom_adj;
1099 if (!legacy && has_capability_noaudit(current, CAP_SYS_RESOURCE))
1100 p->signal->oom_score_adj_min = (short)oom_adj;
1108 mutex_unlock(&oom_adj_mutex);
1109 put_task_struct(task);
1114 * /proc/pid/oom_adj exists solely for backwards compatibility with previous
1115 * kernels. The effective policy is defined by oom_score_adj, which has a
1116 * different scale: oom_adj grew exponentially and oom_score_adj grows linearly.
1117 * Values written to oom_adj are simply mapped linearly to oom_score_adj.
1118 * Processes that become oom disabled via oom_adj will still be oom disabled
1119 * with this implementation.
1121 * oom_adj cannot be removed since existing userspace binaries use it.
1123 static ssize_t oom_adj_write(struct file *file, const char __user *buf,
1124 size_t count, loff_t *ppos)
1126 char buffer[PROC_NUMBUF];
1130 memset(buffer, 0, sizeof(buffer));
1131 if (count > sizeof(buffer) - 1)
1132 count = sizeof(buffer) - 1;
1133 if (copy_from_user(buffer, buf, count)) {
1138 err = kstrtoint(strstrip(buffer), 0, &oom_adj);
1141 if ((oom_adj < OOM_ADJUST_MIN || oom_adj > OOM_ADJUST_MAX) &&
1142 oom_adj != OOM_DISABLE) {
1148 * Scale /proc/pid/oom_score_adj appropriately ensuring that a maximum
1149 * value is always attainable.
1151 if (oom_adj == OOM_ADJUST_MAX)
1152 oom_adj = OOM_SCORE_ADJ_MAX;
1154 oom_adj = (oom_adj * OOM_SCORE_ADJ_MAX) / -OOM_DISABLE;
1156 err = __set_oom_adj(file, oom_adj, true);
1158 return err < 0 ? err : count;
1161 static const struct file_operations proc_oom_adj_operations = {
1162 .read = oom_adj_read,
1163 .write = oom_adj_write,
1164 .llseek = generic_file_llseek,
1167 static ssize_t oom_score_adj_read(struct file *file, char __user *buf,
1168 size_t count, loff_t *ppos)
1170 struct task_struct *task = get_proc_task(file_inode(file));
1171 char buffer[PROC_NUMBUF];
1172 short oom_score_adj = OOM_SCORE_ADJ_MIN;
1177 oom_score_adj = task->signal->oom_score_adj;
1178 put_task_struct(task);
1179 len = snprintf(buffer, sizeof(buffer), "%hd\n", oom_score_adj);
1180 return simple_read_from_buffer(buf, count, ppos, buffer, len);
1183 static ssize_t oom_score_adj_write(struct file *file, const char __user *buf,
1184 size_t count, loff_t *ppos)
1186 char buffer[PROC_NUMBUF];
1190 memset(buffer, 0, sizeof(buffer));
1191 if (count > sizeof(buffer) - 1)
1192 count = sizeof(buffer) - 1;
1193 if (copy_from_user(buffer, buf, count)) {
1198 err = kstrtoint(strstrip(buffer), 0, &oom_score_adj);
1201 if (oom_score_adj < OOM_SCORE_ADJ_MIN ||
1202 oom_score_adj > OOM_SCORE_ADJ_MAX) {
1207 err = __set_oom_adj(file, oom_score_adj, false);
1209 return err < 0 ? err : count;
1212 static const struct file_operations proc_oom_score_adj_operations = {
1213 .read = oom_score_adj_read,
1214 .write = oom_score_adj_write,
1215 .llseek = default_llseek,
1218 #ifdef CONFIG_AUDITSYSCALL
1219 #define TMPBUFLEN 11
1220 static ssize_t proc_loginuid_read(struct file * file, char __user * buf,
1221 size_t count, loff_t *ppos)
1223 struct inode * inode = file_inode(file);
1224 struct task_struct *task = get_proc_task(inode);
1226 char tmpbuf[TMPBUFLEN];
1230 length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
1231 from_kuid(file->f_cred->user_ns,
1232 audit_get_loginuid(task)));
1233 put_task_struct(task);
1234 return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
1237 static ssize_t proc_loginuid_write(struct file * file, const char __user * buf,
1238 size_t count, loff_t *ppos)
1240 struct inode * inode = file_inode(file);
1246 if (current != pid_task(proc_pid(inode), PIDTYPE_PID)) {
1253 /* No partial writes. */
1257 rv = kstrtou32_from_user(buf, count, 10, &loginuid);
1261 /* is userspace tring to explicitly UNSET the loginuid? */
1262 if (loginuid == AUDIT_UID_UNSET) {
1263 kloginuid = INVALID_UID;
1265 kloginuid = make_kuid(file->f_cred->user_ns, loginuid);
1266 if (!uid_valid(kloginuid))
1270 rv = audit_set_loginuid(kloginuid);
1276 static const struct file_operations proc_loginuid_operations = {
1277 .read = proc_loginuid_read,
1278 .write = proc_loginuid_write,
1279 .llseek = generic_file_llseek,
1282 static ssize_t proc_sessionid_read(struct file * file, char __user * buf,
1283 size_t count, loff_t *ppos)
1285 struct inode * inode = file_inode(file);
1286 struct task_struct *task = get_proc_task(inode);
1288 char tmpbuf[TMPBUFLEN];
1292 length = scnprintf(tmpbuf, TMPBUFLEN, "%u",
1293 audit_get_sessionid(task));
1294 put_task_struct(task);
1295 return simple_read_from_buffer(buf, count, ppos, tmpbuf, length);
1298 static const struct file_operations proc_sessionid_operations = {
1299 .read = proc_sessionid_read,
1300 .llseek = generic_file_llseek,
1304 #ifdef CONFIG_FAULT_INJECTION
1305 static ssize_t proc_fault_inject_read(struct file * file, char __user * buf,
1306 size_t count, loff_t *ppos)
1308 struct task_struct *task = get_proc_task(file_inode(file));
1309 char buffer[PROC_NUMBUF];
1315 make_it_fail = task->make_it_fail;
1316 put_task_struct(task);
1318 len = snprintf(buffer, sizeof(buffer), "%i\n", make_it_fail);
1320 return simple_read_from_buffer(buf, count, ppos, buffer, len);
1323 static ssize_t proc_fault_inject_write(struct file * file,
1324 const char __user * buf, size_t count, loff_t *ppos)
1326 struct task_struct *task;
1327 char buffer[PROC_NUMBUF];
1331 if (!capable(CAP_SYS_RESOURCE))
1333 memset(buffer, 0, sizeof(buffer));
1334 if (count > sizeof(buffer) - 1)
1335 count = sizeof(buffer) - 1;
1336 if (copy_from_user(buffer, buf, count))
1338 rv = kstrtoint(strstrip(buffer), 0, &make_it_fail);
1341 if (make_it_fail < 0 || make_it_fail > 1)
1344 task = get_proc_task(file_inode(file));
1347 task->make_it_fail = make_it_fail;
1348 put_task_struct(task);
1353 static const struct file_operations proc_fault_inject_operations = {
1354 .read = proc_fault_inject_read,
1355 .write = proc_fault_inject_write,
1356 .llseek = generic_file_llseek,
1359 static ssize_t proc_fail_nth_write(struct file *file, const char __user *buf,
1360 size_t count, loff_t *ppos)
1362 struct task_struct *task;
1366 err = kstrtouint_from_user(buf, count, 0, &n);
1370 task = get_proc_task(file_inode(file));
1373 WRITE_ONCE(task->fail_nth, n);
1374 put_task_struct(task);
1379 static ssize_t proc_fail_nth_read(struct file *file, char __user *buf,
1380 size_t count, loff_t *ppos)
1382 struct task_struct *task;
1383 char numbuf[PROC_NUMBUF];
1386 task = get_proc_task(file_inode(file));
1389 len = snprintf(numbuf, sizeof(numbuf), "%u\n",
1390 READ_ONCE(task->fail_nth));
1391 len = simple_read_from_buffer(buf, count, ppos, numbuf, len);
1392 put_task_struct(task);
1397 static const struct file_operations proc_fail_nth_operations = {
1398 .read = proc_fail_nth_read,
1399 .write = proc_fail_nth_write,
1404 #ifdef CONFIG_SCHED_DEBUG
1406 * Print out various scheduling related per-task fields:
1408 static int sched_show(struct seq_file *m, void *v)
1410 struct inode *inode = m->private;
1411 struct task_struct *p;
1413 p = get_proc_task(inode);
1416 proc_sched_show_task(p, m);
1424 sched_write(struct file *file, const char __user *buf,
1425 size_t count, loff_t *offset)
1427 struct inode *inode = file_inode(file);
1428 struct task_struct *p;
1430 p = get_proc_task(inode);
1433 proc_sched_set_task(p);
1440 static int sched_open(struct inode *inode, struct file *filp)
1442 return single_open(filp, sched_show, inode);
1445 static const struct file_operations proc_pid_sched_operations = {
1448 .write = sched_write,
1449 .llseek = seq_lseek,
1450 .release = single_release,
1455 #ifdef CONFIG_SCHED_AUTOGROUP
1457 * Print out autogroup related information:
1459 static int sched_autogroup_show(struct seq_file *m, void *v)
1461 struct inode *inode = m->private;
1462 struct task_struct *p;
1464 p = get_proc_task(inode);
1467 proc_sched_autogroup_show_task(p, m);
1475 sched_autogroup_write(struct file *file, const char __user *buf,
1476 size_t count, loff_t *offset)
1478 struct inode *inode = file_inode(file);
1479 struct task_struct *p;
1480 char buffer[PROC_NUMBUF];
1484 memset(buffer, 0, sizeof(buffer));
1485 if (count > sizeof(buffer) - 1)
1486 count = sizeof(buffer) - 1;
1487 if (copy_from_user(buffer, buf, count))
1490 err = kstrtoint(strstrip(buffer), 0, &nice);
1494 p = get_proc_task(inode);
1498 err = proc_sched_autogroup_set_nice(p, nice);
1507 static int sched_autogroup_open(struct inode *inode, struct file *filp)
1511 ret = single_open(filp, sched_autogroup_show, NULL);
1513 struct seq_file *m = filp->private_data;
1520 static const struct file_operations proc_pid_sched_autogroup_operations = {
1521 .open = sched_autogroup_open,
1523 .write = sched_autogroup_write,
1524 .llseek = seq_lseek,
1525 .release = single_release,
1528 #endif /* CONFIG_SCHED_AUTOGROUP */
1530 static ssize_t comm_write(struct file *file, const char __user *buf,
1531 size_t count, loff_t *offset)
1533 struct inode *inode = file_inode(file);
1534 struct task_struct *p;
1535 char buffer[TASK_COMM_LEN];
1536 const size_t maxlen = sizeof(buffer) - 1;
1538 memset(buffer, 0, sizeof(buffer));
1539 if (copy_from_user(buffer, buf, count > maxlen ? maxlen : count))
1542 p = get_proc_task(inode);
1546 if (same_thread_group(current, p))
1547 set_task_comm(p, buffer);
1556 static int comm_show(struct seq_file *m, void *v)
1558 struct inode *inode = m->private;
1559 struct task_struct *p;
1561 p = get_proc_task(inode);
1566 seq_printf(m, "%s\n", p->comm);
1574 static int comm_open(struct inode *inode, struct file *filp)
1576 return single_open(filp, comm_show, inode);
1579 static const struct file_operations proc_pid_set_comm_operations = {
1582 .write = comm_write,
1583 .llseek = seq_lseek,
1584 .release = single_release,
1587 static int proc_exe_link(struct dentry *dentry, struct path *exe_path)
1589 struct task_struct *task;
1590 struct file *exe_file;
1592 task = get_proc_task(d_inode(dentry));
1595 exe_file = get_task_exe_file(task);
1596 put_task_struct(task);
1598 *exe_path = exe_file->f_path;
1599 path_get(&exe_file->f_path);
1606 static const char *proc_pid_get_link(struct dentry *dentry,
1607 struct inode *inode,
1608 struct delayed_call *done)
1611 int error = -EACCES;
1614 return ERR_PTR(-ECHILD);
1616 /* Are we allowed to snoop on the tasks file descriptors? */
1617 if (!proc_fd_access_allowed(inode))
1620 error = PROC_I(inode)->op.proc_get_link(dentry, &path);
1624 nd_jump_link(&path);
1627 return ERR_PTR(error);
1630 static int do_proc_readlink(struct path *path, char __user *buffer, int buflen)
1632 char *tmp = (char*)__get_free_page(GFP_TEMPORARY);
1639 pathname = d_path(path, tmp, PAGE_SIZE);
1640 len = PTR_ERR(pathname);
1641 if (IS_ERR(pathname))
1643 len = tmp + PAGE_SIZE - 1 - pathname;
1647 if (copy_to_user(buffer, pathname, len))
1650 free_page((unsigned long)tmp);
1654 static int proc_pid_readlink(struct dentry * dentry, char __user * buffer, int buflen)
1656 int error = -EACCES;
1657 struct inode *inode = d_inode(dentry);
1660 /* Are we allowed to snoop on the tasks file descriptors? */
1661 if (!proc_fd_access_allowed(inode))
1664 error = PROC_I(inode)->op.proc_get_link(dentry, &path);
1668 error = do_proc_readlink(&path, buffer, buflen);
1674 const struct inode_operations proc_pid_link_inode_operations = {
1675 .readlink = proc_pid_readlink,
1676 .get_link = proc_pid_get_link,
1677 .setattr = proc_setattr,
1681 /* building an inode */
1683 void task_dump_owner(struct task_struct *task, mode_t mode,
1684 kuid_t *ruid, kgid_t *rgid)
1686 /* Depending on the state of dumpable compute who should own a
1687 * proc file for a task.
1689 const struct cred *cred;
1693 /* Default to the tasks effective ownership */
1695 cred = __task_cred(task);
1701 * Before the /proc/pid/status file was created the only way to read
1702 * the effective uid of a /process was to stat /proc/pid. Reading
1703 * /proc/pid/status is slow enough that procps and other packages
1704 * kept stating /proc/pid. To keep the rules in /proc simple I have
1705 * made this apply to all per process world readable and executable
1708 if (mode != (S_IFDIR|S_IRUGO|S_IXUGO)) {
1709 struct mm_struct *mm;
1712 /* Make non-dumpable tasks owned by some root */
1714 if (get_dumpable(mm) != SUID_DUMP_USER) {
1715 struct user_namespace *user_ns = mm->user_ns;
1717 uid = make_kuid(user_ns, 0);
1718 if (!uid_valid(uid))
1719 uid = GLOBAL_ROOT_UID;
1721 gid = make_kgid(user_ns, 0);
1722 if (!gid_valid(gid))
1723 gid = GLOBAL_ROOT_GID;
1726 uid = GLOBAL_ROOT_UID;
1727 gid = GLOBAL_ROOT_GID;
1735 struct inode *proc_pid_make_inode(struct super_block * sb,
1736 struct task_struct *task, umode_t mode)
1738 struct inode * inode;
1739 struct proc_inode *ei;
1741 /* We need a new inode */
1743 inode = new_inode(sb);
1749 inode->i_mode = mode;
1750 inode->i_ino = get_next_ino();
1751 inode->i_mtime = inode->i_atime = inode->i_ctime = current_time(inode);
1752 inode->i_op = &proc_def_inode_operations;
1755 * grab the reference to task.
1757 ei->pid = get_task_pid(task, PIDTYPE_PID);
1761 task_dump_owner(task, 0, &inode->i_uid, &inode->i_gid);
1762 security_task_to_inode(task, inode);
1772 int pid_getattr(const struct path *path, struct kstat *stat,
1773 u32 request_mask, unsigned int query_flags)
1775 struct inode *inode = d_inode(path->dentry);
1776 struct task_struct *task;
1777 struct pid_namespace *pid = path->dentry->d_sb->s_fs_info;
1779 generic_fillattr(inode, stat);
1782 stat->uid = GLOBAL_ROOT_UID;
1783 stat->gid = GLOBAL_ROOT_GID;
1784 task = pid_task(proc_pid(inode), PIDTYPE_PID);
1786 if (!has_pid_permissions(pid, task, HIDEPID_INVISIBLE)) {
1789 * This doesn't prevent learning whether PID exists,
1790 * it only makes getattr() consistent with readdir().
1794 task_dump_owner(task, inode->i_mode, &stat->uid, &stat->gid);
1803 * Exceptional case: normally we are not allowed to unhash a busy
1804 * directory. In this case, however, we can do it - no aliasing problems
1805 * due to the way we treat inodes.
1807 * Rewrite the inode's ownerships here because the owning task may have
1808 * performed a setuid(), etc.
1811 int pid_revalidate(struct dentry *dentry, unsigned int flags)
1813 struct inode *inode;
1814 struct task_struct *task;
1816 if (flags & LOOKUP_RCU)
1819 inode = d_inode(dentry);
1820 task = get_proc_task(inode);
1823 task_dump_owner(task, inode->i_mode, &inode->i_uid, &inode->i_gid);
1825 inode->i_mode &= ~(S_ISUID | S_ISGID);
1826 security_task_to_inode(task, inode);
1827 put_task_struct(task);
1833 static inline bool proc_inode_is_dead(struct inode *inode)
1835 return !proc_pid(inode)->tasks[PIDTYPE_PID].first;
1838 int pid_delete_dentry(const struct dentry *dentry)
1840 /* Is the task we represent dead?
1841 * If so, then don't put the dentry on the lru list,
1842 * kill it immediately.
1844 return proc_inode_is_dead(d_inode(dentry));
1847 const struct dentry_operations pid_dentry_operations =
1849 .d_revalidate = pid_revalidate,
1850 .d_delete = pid_delete_dentry,
1856 * Fill a directory entry.
1858 * If possible create the dcache entry and derive our inode number and
1859 * file type from dcache entry.
1861 * Since all of the proc inode numbers are dynamically generated, the inode
1862 * numbers do not exist until the inode is cache. This means creating the
1863 * the dcache entry in readdir is necessary to keep the inode numbers
1864 * reported by readdir in sync with the inode numbers reported
1867 bool proc_fill_cache(struct file *file, struct dir_context *ctx,
1868 const char *name, int len,
1869 instantiate_t instantiate, struct task_struct *task, const void *ptr)
1871 struct dentry *child, *dir = file->f_path.dentry;
1872 struct qstr qname = QSTR_INIT(name, len);
1873 struct inode *inode;
1877 child = d_hash_and_lookup(dir, &qname);
1879 DECLARE_WAIT_QUEUE_HEAD_ONSTACK(wq);
1880 child = d_alloc_parallel(dir, &qname, &wq);
1882 goto end_instantiate;
1883 if (d_in_lookup(child)) {
1884 int err = instantiate(d_inode(dir), child, task, ptr);
1885 d_lookup_done(child);
1888 goto end_instantiate;
1892 inode = d_inode(child);
1894 type = inode->i_mode >> 12;
1896 return dir_emit(ctx, name, len, ino, type);
1899 return dir_emit(ctx, name, len, 1, DT_UNKNOWN);
1903 * dname_to_vma_addr - maps a dentry name into two unsigned longs
1904 * which represent vma start and end addresses.
1906 static int dname_to_vma_addr(struct dentry *dentry,
1907 unsigned long *start, unsigned long *end)
1909 if (sscanf(dentry->d_name.name, "%lx-%lx", start, end) != 2)
1915 static int map_files_d_revalidate(struct dentry *dentry, unsigned int flags)
1917 unsigned long vm_start, vm_end;
1918 bool exact_vma_exists = false;
1919 struct mm_struct *mm = NULL;
1920 struct task_struct *task;
1921 struct inode *inode;
1924 if (flags & LOOKUP_RCU)
1927 inode = d_inode(dentry);
1928 task = get_proc_task(inode);
1932 mm = mm_access(task, PTRACE_MODE_READ_FSCREDS);
1933 if (IS_ERR_OR_NULL(mm))
1936 if (!dname_to_vma_addr(dentry, &vm_start, &vm_end)) {
1937 down_read(&mm->mmap_sem);
1938 exact_vma_exists = !!find_exact_vma(mm, vm_start, vm_end);
1939 up_read(&mm->mmap_sem);
1944 if (exact_vma_exists) {
1945 task_dump_owner(task, 0, &inode->i_uid, &inode->i_gid);
1947 security_task_to_inode(task, inode);
1952 put_task_struct(task);
1958 static const struct dentry_operations tid_map_files_dentry_operations = {
1959 .d_revalidate = map_files_d_revalidate,
1960 .d_delete = pid_delete_dentry,
1963 static int map_files_get_link(struct dentry *dentry, struct path *path)
1965 unsigned long vm_start, vm_end;
1966 struct vm_area_struct *vma;
1967 struct task_struct *task;
1968 struct mm_struct *mm;
1972 task = get_proc_task(d_inode(dentry));
1976 mm = get_task_mm(task);
1977 put_task_struct(task);
1981 rc = dname_to_vma_addr(dentry, &vm_start, &vm_end);
1986 down_read(&mm->mmap_sem);
1987 vma = find_exact_vma(mm, vm_start, vm_end);
1988 if (vma && vma->vm_file) {
1989 *path = vma->vm_file->f_path;
1993 up_read(&mm->mmap_sem);
2001 struct map_files_info {
2004 unsigned char name[4*sizeof(long)+2]; /* max: %lx-%lx\0 */
2008 * Only allow CAP_SYS_ADMIN to follow the links, due to concerns about how the
2009 * symlinks may be used to bypass permissions on ancestor directories in the
2010 * path to the file in question.
2013 proc_map_files_get_link(struct dentry *dentry,
2014 struct inode *inode,
2015 struct delayed_call *done)
2017 if (!capable(CAP_SYS_ADMIN))
2018 return ERR_PTR(-EPERM);
2020 return proc_pid_get_link(dentry, inode, done);
2024 * Identical to proc_pid_link_inode_operations except for get_link()
2026 static const struct inode_operations proc_map_files_link_inode_operations = {
2027 .readlink = proc_pid_readlink,
2028 .get_link = proc_map_files_get_link,
2029 .setattr = proc_setattr,
2033 proc_map_files_instantiate(struct inode *dir, struct dentry *dentry,
2034 struct task_struct *task, const void *ptr)
2036 fmode_t mode = (fmode_t)(unsigned long)ptr;
2037 struct proc_inode *ei;
2038 struct inode *inode;
2040 inode = proc_pid_make_inode(dir->i_sb, task, S_IFLNK |
2041 ((mode & FMODE_READ ) ? S_IRUSR : 0) |
2042 ((mode & FMODE_WRITE) ? S_IWUSR : 0));
2047 ei->op.proc_get_link = map_files_get_link;
2049 inode->i_op = &proc_map_files_link_inode_operations;
2052 d_set_d_op(dentry, &tid_map_files_dentry_operations);
2053 d_add(dentry, inode);
2058 static struct dentry *proc_map_files_lookup(struct inode *dir,
2059 struct dentry *dentry, unsigned int flags)
2061 unsigned long vm_start, vm_end;
2062 struct vm_area_struct *vma;
2063 struct task_struct *task;
2065 struct mm_struct *mm;
2068 task = get_proc_task(dir);
2073 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS))
2077 if (dname_to_vma_addr(dentry, &vm_start, &vm_end))
2080 mm = get_task_mm(task);
2084 down_read(&mm->mmap_sem);
2085 vma = find_exact_vma(mm, vm_start, vm_end);
2090 result = proc_map_files_instantiate(dir, dentry, task,
2091 (void *)(unsigned long)vma->vm_file->f_mode);
2094 up_read(&mm->mmap_sem);
2097 put_task_struct(task);
2099 return ERR_PTR(result);
2102 static const struct inode_operations proc_map_files_inode_operations = {
2103 .lookup = proc_map_files_lookup,
2104 .permission = proc_fd_permission,
2105 .setattr = proc_setattr,
2109 proc_map_files_readdir(struct file *file, struct dir_context *ctx)
2111 struct vm_area_struct *vma;
2112 struct task_struct *task;
2113 struct mm_struct *mm;
2114 unsigned long nr_files, pos, i;
2115 struct flex_array *fa = NULL;
2116 struct map_files_info info;
2117 struct map_files_info *p;
2121 task = get_proc_task(file_inode(file));
2126 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS))
2130 if (!dir_emit_dots(file, ctx))
2133 mm = get_task_mm(task);
2136 down_read(&mm->mmap_sem);
2141 * We need two passes here:
2143 * 1) Collect vmas of mapped files with mmap_sem taken
2144 * 2) Release mmap_sem and instantiate entries
2146 * otherwise we get lockdep complained, since filldir()
2147 * routine might require mmap_sem taken in might_fault().
2150 for (vma = mm->mmap, pos = 2; vma; vma = vma->vm_next) {
2151 if (vma->vm_file && ++pos > ctx->pos)
2156 fa = flex_array_alloc(sizeof(info), nr_files,
2158 if (!fa || flex_array_prealloc(fa, 0, nr_files,
2162 flex_array_free(fa);
2163 up_read(&mm->mmap_sem);
2167 for (i = 0, vma = mm->mmap, pos = 2; vma;
2168 vma = vma->vm_next) {
2171 if (++pos <= ctx->pos)
2174 info.mode = vma->vm_file->f_mode;
2175 info.len = snprintf(info.name,
2176 sizeof(info.name), "%lx-%lx",
2177 vma->vm_start, vma->vm_end);
2178 if (flex_array_put(fa, i++, &info, GFP_KERNEL))
2182 up_read(&mm->mmap_sem);
2184 for (i = 0; i < nr_files; i++) {
2185 p = flex_array_get(fa, i);
2186 if (!proc_fill_cache(file, ctx,
2188 proc_map_files_instantiate,
2190 (void *)(unsigned long)p->mode))
2195 flex_array_free(fa);
2199 put_task_struct(task);
2204 static const struct file_operations proc_map_files_operations = {
2205 .read = generic_read_dir,
2206 .iterate_shared = proc_map_files_readdir,
2207 .llseek = generic_file_llseek,
2210 #if defined(CONFIG_CHECKPOINT_RESTORE) && defined(CONFIG_POSIX_TIMERS)
2211 struct timers_private {
2213 struct task_struct *task;
2214 struct sighand_struct *sighand;
2215 struct pid_namespace *ns;
2216 unsigned long flags;
2219 static void *timers_start(struct seq_file *m, loff_t *pos)
2221 struct timers_private *tp = m->private;
2223 tp->task = get_pid_task(tp->pid, PIDTYPE_PID);
2225 return ERR_PTR(-ESRCH);
2227 tp->sighand = lock_task_sighand(tp->task, &tp->flags);
2229 return ERR_PTR(-ESRCH);
2231 return seq_list_start(&tp->task->signal->posix_timers, *pos);
2234 static void *timers_next(struct seq_file *m, void *v, loff_t *pos)
2236 struct timers_private *tp = m->private;
2237 return seq_list_next(v, &tp->task->signal->posix_timers, pos);
2240 static void timers_stop(struct seq_file *m, void *v)
2242 struct timers_private *tp = m->private;
2245 unlock_task_sighand(tp->task, &tp->flags);
2250 put_task_struct(tp->task);
2255 static int show_timer(struct seq_file *m, void *v)
2257 struct k_itimer *timer;
2258 struct timers_private *tp = m->private;
2260 static const char * const nstr[] = {
2261 [SIGEV_SIGNAL] = "signal",
2262 [SIGEV_NONE] = "none",
2263 [SIGEV_THREAD] = "thread",
2266 timer = list_entry((struct list_head *)v, struct k_itimer, list);
2267 notify = timer->it_sigev_notify;
2269 seq_printf(m, "ID: %d\n", timer->it_id);
2270 seq_printf(m, "signal: %d/%p\n",
2271 timer->sigq->info.si_signo,
2272 timer->sigq->info.si_value.sival_ptr);
2273 seq_printf(m, "notify: %s/%s.%d\n",
2274 nstr[notify & ~SIGEV_THREAD_ID],
2275 (notify & SIGEV_THREAD_ID) ? "tid" : "pid",
2276 pid_nr_ns(timer->it_pid, tp->ns));
2277 seq_printf(m, "ClockID: %d\n", timer->it_clock);
2282 static const struct seq_operations proc_timers_seq_ops = {
2283 .start = timers_start,
2284 .next = timers_next,
2285 .stop = timers_stop,
2289 static int proc_timers_open(struct inode *inode, struct file *file)
2291 struct timers_private *tp;
2293 tp = __seq_open_private(file, &proc_timers_seq_ops,
2294 sizeof(struct timers_private));
2298 tp->pid = proc_pid(inode);
2299 tp->ns = inode->i_sb->s_fs_info;
2303 static const struct file_operations proc_timers_operations = {
2304 .open = proc_timers_open,
2306 .llseek = seq_lseek,
2307 .release = seq_release_private,
2311 static ssize_t timerslack_ns_write(struct file *file, const char __user *buf,
2312 size_t count, loff_t *offset)
2314 struct inode *inode = file_inode(file);
2315 struct task_struct *p;
2319 err = kstrtoull_from_user(buf, count, 10, &slack_ns);
2323 p = get_proc_task(inode);
2328 if (!capable(CAP_SYS_NICE)) {
2333 err = security_task_setscheduler(p);
2342 p->timer_slack_ns = p->default_timer_slack_ns;
2344 p->timer_slack_ns = slack_ns;
2353 static int timerslack_ns_show(struct seq_file *m, void *v)
2355 struct inode *inode = m->private;
2356 struct task_struct *p;
2359 p = get_proc_task(inode);
2365 if (!capable(CAP_SYS_NICE)) {
2369 err = security_task_getscheduler(p);
2375 seq_printf(m, "%llu\n", p->timer_slack_ns);
2384 static int timerslack_ns_open(struct inode *inode, struct file *filp)
2386 return single_open(filp, timerslack_ns_show, inode);
2389 static const struct file_operations proc_pid_set_timerslack_ns_operations = {
2390 .open = timerslack_ns_open,
2392 .write = timerslack_ns_write,
2393 .llseek = seq_lseek,
2394 .release = single_release,
2397 static int proc_pident_instantiate(struct inode *dir,
2398 struct dentry *dentry, struct task_struct *task, const void *ptr)
2400 const struct pid_entry *p = ptr;
2401 struct inode *inode;
2402 struct proc_inode *ei;
2404 inode = proc_pid_make_inode(dir->i_sb, task, p->mode);
2409 if (S_ISDIR(inode->i_mode))
2410 set_nlink(inode, 2); /* Use getattr to fix if necessary */
2412 inode->i_op = p->iop;
2414 inode->i_fop = p->fop;
2416 d_set_d_op(dentry, &pid_dentry_operations);
2417 d_add(dentry, inode);
2418 /* Close the race of the process dying before we return the dentry */
2419 if (pid_revalidate(dentry, 0))
2425 static struct dentry *proc_pident_lookup(struct inode *dir,
2426 struct dentry *dentry,
2427 const struct pid_entry *ents,
2431 struct task_struct *task = get_proc_task(dir);
2432 const struct pid_entry *p, *last;
2440 * Yes, it does not scale. And it should not. Don't add
2441 * new entries into /proc/<tgid>/ without very good reasons.
2443 last = &ents[nents];
2444 for (p = ents; p < last; p++) {
2445 if (p->len != dentry->d_name.len)
2447 if (!memcmp(dentry->d_name.name, p->name, p->len))
2453 error = proc_pident_instantiate(dir, dentry, task, p);
2455 put_task_struct(task);
2457 return ERR_PTR(error);
2460 static int proc_pident_readdir(struct file *file, struct dir_context *ctx,
2461 const struct pid_entry *ents, unsigned int nents)
2463 struct task_struct *task = get_proc_task(file_inode(file));
2464 const struct pid_entry *p;
2469 if (!dir_emit_dots(file, ctx))
2472 if (ctx->pos >= nents + 2)
2475 for (p = ents + (ctx->pos - 2); p < ents + nents; p++) {
2476 if (!proc_fill_cache(file, ctx, p->name, p->len,
2477 proc_pident_instantiate, task, p))
2482 put_task_struct(task);
2486 #ifdef CONFIG_SECURITY
2487 static ssize_t proc_pid_attr_read(struct file * file, char __user * buf,
2488 size_t count, loff_t *ppos)
2490 struct inode * inode = file_inode(file);
2493 struct task_struct *task = get_proc_task(inode);
2498 length = security_getprocattr(task,
2499 (char*)file->f_path.dentry->d_name.name,
2501 put_task_struct(task);
2503 length = simple_read_from_buffer(buf, count, ppos, p, length);
2508 static ssize_t proc_pid_attr_write(struct file * file, const char __user * buf,
2509 size_t count, loff_t *ppos)
2511 struct inode * inode = file_inode(file);
2514 struct task_struct *task = get_proc_task(inode);
2520 /* A task may only write its own attributes. */
2522 if (current != task)
2525 if (count > PAGE_SIZE)
2528 /* No partial writes. */
2533 page = memdup_user(buf, count);
2535 length = PTR_ERR(page);
2539 /* Guard against adverse ptrace interaction */
2540 length = mutex_lock_interruptible(¤t->signal->cred_guard_mutex);
2544 length = security_setprocattr(file->f_path.dentry->d_name.name,
2546 mutex_unlock(¤t->signal->cred_guard_mutex);
2550 put_task_struct(task);
2555 static const struct file_operations proc_pid_attr_operations = {
2556 .read = proc_pid_attr_read,
2557 .write = proc_pid_attr_write,
2558 .llseek = generic_file_llseek,
2561 static const struct pid_entry attr_dir_stuff[] = {
2562 REG("current", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
2563 REG("prev", S_IRUGO, proc_pid_attr_operations),
2564 REG("exec", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
2565 REG("fscreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
2566 REG("keycreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
2567 REG("sockcreate", S_IRUGO|S_IWUGO, proc_pid_attr_operations),
2570 static int proc_attr_dir_readdir(struct file *file, struct dir_context *ctx)
2572 return proc_pident_readdir(file, ctx,
2573 attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
2576 static const struct file_operations proc_attr_dir_operations = {
2577 .read = generic_read_dir,
2578 .iterate_shared = proc_attr_dir_readdir,
2579 .llseek = generic_file_llseek,
2582 static struct dentry *proc_attr_dir_lookup(struct inode *dir,
2583 struct dentry *dentry, unsigned int flags)
2585 return proc_pident_lookup(dir, dentry,
2586 attr_dir_stuff, ARRAY_SIZE(attr_dir_stuff));
2589 static const struct inode_operations proc_attr_dir_inode_operations = {
2590 .lookup = proc_attr_dir_lookup,
2591 .getattr = pid_getattr,
2592 .setattr = proc_setattr,
2597 #ifdef CONFIG_ELF_CORE
2598 static ssize_t proc_coredump_filter_read(struct file *file, char __user *buf,
2599 size_t count, loff_t *ppos)
2601 struct task_struct *task = get_proc_task(file_inode(file));
2602 struct mm_struct *mm;
2603 char buffer[PROC_NUMBUF];
2611 mm = get_task_mm(task);
2613 len = snprintf(buffer, sizeof(buffer), "%08lx\n",
2614 ((mm->flags & MMF_DUMP_FILTER_MASK) >>
2615 MMF_DUMP_FILTER_SHIFT));
2617 ret = simple_read_from_buffer(buf, count, ppos, buffer, len);
2620 put_task_struct(task);
2625 static ssize_t proc_coredump_filter_write(struct file *file,
2626 const char __user *buf,
2630 struct task_struct *task;
2631 struct mm_struct *mm;
2637 ret = kstrtouint_from_user(buf, count, 0, &val);
2642 task = get_proc_task(file_inode(file));
2646 mm = get_task_mm(task);
2651 for (i = 0, mask = 1; i < MMF_DUMP_FILTER_BITS; i++, mask <<= 1) {
2653 set_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
2655 clear_bit(i + MMF_DUMP_FILTER_SHIFT, &mm->flags);
2660 put_task_struct(task);
2667 static const struct file_operations proc_coredump_filter_operations = {
2668 .read = proc_coredump_filter_read,
2669 .write = proc_coredump_filter_write,
2670 .llseek = generic_file_llseek,
2674 #ifdef CONFIG_TASK_IO_ACCOUNTING
2675 static int do_io_accounting(struct task_struct *task, struct seq_file *m, int whole)
2677 struct task_io_accounting acct = task->ioac;
2678 unsigned long flags;
2681 result = mutex_lock_killable(&task->signal->cred_guard_mutex);
2685 if (!ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS)) {
2690 if (whole && lock_task_sighand(task, &flags)) {
2691 struct task_struct *t = task;
2693 task_io_accounting_add(&acct, &task->signal->ioac);
2694 while_each_thread(task, t)
2695 task_io_accounting_add(&acct, &t->ioac);
2697 unlock_task_sighand(task, &flags);
2704 "read_bytes: %llu\n"
2705 "write_bytes: %llu\n"
2706 "cancelled_write_bytes: %llu\n",
2707 (unsigned long long)acct.rchar,
2708 (unsigned long long)acct.wchar,
2709 (unsigned long long)acct.syscr,
2710 (unsigned long long)acct.syscw,
2711 (unsigned long long)acct.read_bytes,
2712 (unsigned long long)acct.write_bytes,
2713 (unsigned long long)acct.cancelled_write_bytes);
2717 mutex_unlock(&task->signal->cred_guard_mutex);
2721 static int proc_tid_io_accounting(struct seq_file *m, struct pid_namespace *ns,
2722 struct pid *pid, struct task_struct *task)
2724 return do_io_accounting(task, m, 0);
2727 static int proc_tgid_io_accounting(struct seq_file *m, struct pid_namespace *ns,
2728 struct pid *pid, struct task_struct *task)
2730 return do_io_accounting(task, m, 1);
2732 #endif /* CONFIG_TASK_IO_ACCOUNTING */
2734 #ifdef CONFIG_USER_NS
2735 static int proc_id_map_open(struct inode *inode, struct file *file,
2736 const struct seq_operations *seq_ops)
2738 struct user_namespace *ns = NULL;
2739 struct task_struct *task;
2740 struct seq_file *seq;
2743 task = get_proc_task(inode);
2746 ns = get_user_ns(task_cred_xxx(task, user_ns));
2748 put_task_struct(task);
2753 ret = seq_open(file, seq_ops);
2757 seq = file->private_data;
2767 static int proc_id_map_release(struct inode *inode, struct file *file)
2769 struct seq_file *seq = file->private_data;
2770 struct user_namespace *ns = seq->private;
2772 return seq_release(inode, file);
2775 static int proc_uid_map_open(struct inode *inode, struct file *file)
2777 return proc_id_map_open(inode, file, &proc_uid_seq_operations);
2780 static int proc_gid_map_open(struct inode *inode, struct file *file)
2782 return proc_id_map_open(inode, file, &proc_gid_seq_operations);
2785 static int proc_projid_map_open(struct inode *inode, struct file *file)
2787 return proc_id_map_open(inode, file, &proc_projid_seq_operations);
2790 static const struct file_operations proc_uid_map_operations = {
2791 .open = proc_uid_map_open,
2792 .write = proc_uid_map_write,
2794 .llseek = seq_lseek,
2795 .release = proc_id_map_release,
2798 static const struct file_operations proc_gid_map_operations = {
2799 .open = proc_gid_map_open,
2800 .write = proc_gid_map_write,
2802 .llseek = seq_lseek,
2803 .release = proc_id_map_release,
2806 static const struct file_operations proc_projid_map_operations = {
2807 .open = proc_projid_map_open,
2808 .write = proc_projid_map_write,
2810 .llseek = seq_lseek,
2811 .release = proc_id_map_release,
2814 static int proc_setgroups_open(struct inode *inode, struct file *file)
2816 struct user_namespace *ns = NULL;
2817 struct task_struct *task;
2821 task = get_proc_task(inode);
2824 ns = get_user_ns(task_cred_xxx(task, user_ns));
2826 put_task_struct(task);
2831 if (file->f_mode & FMODE_WRITE) {
2833 if (!ns_capable(ns, CAP_SYS_ADMIN))
2837 ret = single_open(file, &proc_setgroups_show, ns);
2848 static int proc_setgroups_release(struct inode *inode, struct file *file)
2850 struct seq_file *seq = file->private_data;
2851 struct user_namespace *ns = seq->private;
2852 int ret = single_release(inode, file);
2857 static const struct file_operations proc_setgroups_operations = {
2858 .open = proc_setgroups_open,
2859 .write = proc_setgroups_write,
2861 .llseek = seq_lseek,
2862 .release = proc_setgroups_release,
2864 #endif /* CONFIG_USER_NS */
2866 static int proc_pid_personality(struct seq_file *m, struct pid_namespace *ns,
2867 struct pid *pid, struct task_struct *task)
2869 int err = lock_trace(task);
2871 seq_printf(m, "%08x\n", task->personality);
2877 #ifdef CONFIG_LIVEPATCH
2878 static int proc_pid_patch_state(struct seq_file *m, struct pid_namespace *ns,
2879 struct pid *pid, struct task_struct *task)
2881 seq_printf(m, "%d\n", task->patch_state);
2884 #endif /* CONFIG_LIVEPATCH */
2889 static const struct file_operations proc_task_operations;
2890 static const struct inode_operations proc_task_inode_operations;
2892 static const struct pid_entry tgid_base_stuff[] = {
2893 DIR("task", S_IRUGO|S_IXUGO, proc_task_inode_operations, proc_task_operations),
2894 DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
2895 DIR("map_files", S_IRUSR|S_IXUSR, proc_map_files_inode_operations, proc_map_files_operations),
2896 DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
2897 DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
2899 DIR("net", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),
2901 REG("environ", S_IRUSR, proc_environ_operations),
2902 REG("auxv", S_IRUSR, proc_auxv_operations),
2903 ONE("status", S_IRUGO, proc_pid_status),
2904 ONE("personality", S_IRUSR, proc_pid_personality),
2905 ONE("limits", S_IRUGO, proc_pid_limits),
2906 #ifdef CONFIG_SCHED_DEBUG
2907 REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations),
2909 #ifdef CONFIG_SCHED_AUTOGROUP
2910 REG("autogroup", S_IRUGO|S_IWUSR, proc_pid_sched_autogroup_operations),
2912 REG("comm", S_IRUGO|S_IWUSR, proc_pid_set_comm_operations),
2913 #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
2914 ONE("syscall", S_IRUSR, proc_pid_syscall),
2916 REG("cmdline", S_IRUGO, proc_pid_cmdline_ops),
2917 ONE("stat", S_IRUGO, proc_tgid_stat),
2918 ONE("statm", S_IRUGO, proc_pid_statm),
2919 REG("maps", S_IRUGO, proc_pid_maps_operations),
2921 REG("numa_maps", S_IRUGO, proc_pid_numa_maps_operations),
2923 REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations),
2924 LNK("cwd", proc_cwd_link),
2925 LNK("root", proc_root_link),
2926 LNK("exe", proc_exe_link),
2927 REG("mounts", S_IRUGO, proc_mounts_operations),
2928 REG("mountinfo", S_IRUGO, proc_mountinfo_operations),
2929 REG("mountstats", S_IRUSR, proc_mountstats_operations),
2930 #ifdef CONFIG_PROC_PAGE_MONITOR
2931 REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
2932 REG("smaps", S_IRUGO, proc_pid_smaps_operations),
2933 REG("pagemap", S_IRUSR, proc_pagemap_operations),
2935 #ifdef CONFIG_SECURITY
2936 DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
2938 #ifdef CONFIG_KALLSYMS
2939 ONE("wchan", S_IRUGO, proc_pid_wchan),
2941 #ifdef CONFIG_STACKTRACE
2942 ONE("stack", S_IRUSR, proc_pid_stack),
2944 #ifdef CONFIG_SCHED_INFO
2945 ONE("schedstat", S_IRUGO, proc_pid_schedstat),
2947 #ifdef CONFIG_LATENCYTOP
2948 REG("latency", S_IRUGO, proc_lstats_operations),
2950 #ifdef CONFIG_PROC_PID_CPUSET
2951 ONE("cpuset", S_IRUGO, proc_cpuset_show),
2953 #ifdef CONFIG_CGROUPS
2954 ONE("cgroup", S_IRUGO, proc_cgroup_show),
2956 ONE("oom_score", S_IRUGO, proc_oom_score),
2957 REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adj_operations),
2958 REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
2959 #ifdef CONFIG_AUDITSYSCALL
2960 REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations),
2961 REG("sessionid", S_IRUGO, proc_sessionid_operations),
2963 #ifdef CONFIG_FAULT_INJECTION
2964 REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
2965 REG("fail-nth", 0644, proc_fail_nth_operations),
2967 #ifdef CONFIG_ELF_CORE
2968 REG("coredump_filter", S_IRUGO|S_IWUSR, proc_coredump_filter_operations),
2970 #ifdef CONFIG_TASK_IO_ACCOUNTING
2971 ONE("io", S_IRUSR, proc_tgid_io_accounting),
2973 #ifdef CONFIG_HARDWALL
2974 ONE("hardwall", S_IRUGO, proc_pid_hardwall),
2976 #ifdef CONFIG_USER_NS
2977 REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations),
2978 REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations),
2979 REG("projid_map", S_IRUGO|S_IWUSR, proc_projid_map_operations),
2980 REG("setgroups", S_IRUGO|S_IWUSR, proc_setgroups_operations),
2982 #if defined(CONFIG_CHECKPOINT_RESTORE) && defined(CONFIG_POSIX_TIMERS)
2983 REG("timers", S_IRUGO, proc_timers_operations),
2985 REG("timerslack_ns", S_IRUGO|S_IWUGO, proc_pid_set_timerslack_ns_operations),
2986 #ifdef CONFIG_LIVEPATCH
2987 ONE("patch_state", S_IRUSR, proc_pid_patch_state),
2991 static int proc_tgid_base_readdir(struct file *file, struct dir_context *ctx)
2993 return proc_pident_readdir(file, ctx,
2994 tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
2997 static const struct file_operations proc_tgid_base_operations = {
2998 .read = generic_read_dir,
2999 .iterate_shared = proc_tgid_base_readdir,
3000 .llseek = generic_file_llseek,
3003 static struct dentry *proc_tgid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
3005 return proc_pident_lookup(dir, dentry,
3006 tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));
3009 static const struct inode_operations proc_tgid_base_inode_operations = {
3010 .lookup = proc_tgid_base_lookup,
3011 .getattr = pid_getattr,
3012 .setattr = proc_setattr,
3013 .permission = proc_pid_permission,
3016 static void proc_flush_task_mnt(struct vfsmount *mnt, pid_t pid, pid_t tgid)
3018 struct dentry *dentry, *leader, *dir;
3019 char buf[PROC_NUMBUF];
3023 name.len = snprintf(buf, sizeof(buf), "%d", pid);
3024 /* no ->d_hash() rejects on procfs */
3025 dentry = d_hash_and_lookup(mnt->mnt_root, &name);
3027 d_invalidate(dentry);
3035 name.len = snprintf(buf, sizeof(buf), "%d", tgid);
3036 leader = d_hash_and_lookup(mnt->mnt_root, &name);
3041 name.len = strlen(name.name);
3042 dir = d_hash_and_lookup(leader, &name);
3044 goto out_put_leader;
3047 name.len = snprintf(buf, sizeof(buf), "%d", pid);
3048 dentry = d_hash_and_lookup(dir, &name);
3050 d_invalidate(dentry);
3062 * proc_flush_task - Remove dcache entries for @task from the /proc dcache.
3063 * @task: task that should be flushed.
3065 * When flushing dentries from proc, one needs to flush them from global
3066 * proc (proc_mnt) and from all the namespaces' procs this task was seen
3067 * in. This call is supposed to do all of this job.
3069 * Looks in the dcache for
3071 * /proc/@tgid/task/@pid
3072 * if either directory is present flushes it and all of it'ts children
3075 * It is safe and reasonable to cache /proc entries for a task until
3076 * that task exits. After that they just clog up the dcache with
3077 * useless entries, possibly causing useful dcache entries to be
3078 * flushed instead. This routine is proved to flush those useless
3079 * dcache entries at process exit time.
3081 * NOTE: This routine is just an optimization so it does not guarantee
3082 * that no dcache entries will exist at process exit time it
3083 * just makes it very unlikely that any will persist.
3086 void proc_flush_task(struct task_struct *task)
3089 struct pid *pid, *tgid;
3092 pid = task_pid(task);
3093 tgid = task_tgid(task);
3095 for (i = 0; i <= pid->level; i++) {
3096 upid = &pid->numbers[i];
3097 proc_flush_task_mnt(upid->ns->proc_mnt, upid->nr,
3098 tgid->numbers[i].nr);
3102 static int proc_pid_instantiate(struct inode *dir,
3103 struct dentry * dentry,
3104 struct task_struct *task, const void *ptr)
3106 struct inode *inode;
3108 inode = proc_pid_make_inode(dir->i_sb, task, S_IFDIR | S_IRUGO | S_IXUGO);
3112 inode->i_op = &proc_tgid_base_inode_operations;
3113 inode->i_fop = &proc_tgid_base_operations;
3114 inode->i_flags|=S_IMMUTABLE;
3116 set_nlink(inode, nlink_tgid);
3118 d_set_d_op(dentry, &pid_dentry_operations);
3120 d_add(dentry, inode);
3121 /* Close the race of the process dying before we return the dentry */
3122 if (pid_revalidate(dentry, 0))
3128 struct dentry *proc_pid_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags)
3130 int result = -ENOENT;
3131 struct task_struct *task;
3133 struct pid_namespace *ns;
3135 tgid = name_to_int(&dentry->d_name);
3139 ns = dentry->d_sb->s_fs_info;
3141 task = find_task_by_pid_ns(tgid, ns);
3143 get_task_struct(task);
3148 result = proc_pid_instantiate(dir, dentry, task, NULL);
3149 put_task_struct(task);
3151 return ERR_PTR(result);
3155 * Find the first task with tgid >= tgid
3160 struct task_struct *task;
3162 static struct tgid_iter next_tgid(struct pid_namespace *ns, struct tgid_iter iter)
3167 put_task_struct(iter.task);
3171 pid = find_ge_pid(iter.tgid, ns);
3173 iter.tgid = pid_nr_ns(pid, ns);
3174 iter.task = pid_task(pid, PIDTYPE_PID);
3175 /* What we to know is if the pid we have find is the
3176 * pid of a thread_group_leader. Testing for task
3177 * being a thread_group_leader is the obvious thing
3178 * todo but there is a window when it fails, due to
3179 * the pid transfer logic in de_thread.
3181 * So we perform the straight forward test of seeing
3182 * if the pid we have found is the pid of a thread
3183 * group leader, and don't worry if the task we have
3184 * found doesn't happen to be a thread group leader.
3185 * As we don't care in the case of readdir.
3187 if (!iter.task || !has_group_leader_pid(iter.task)) {
3191 get_task_struct(iter.task);
3197 #define TGID_OFFSET (FIRST_PROCESS_ENTRY + 2)
3199 /* for the /proc/ directory itself, after non-process stuff has been done */
3200 int proc_pid_readdir(struct file *file, struct dir_context *ctx)
3202 struct tgid_iter iter;
3203 struct pid_namespace *ns = file_inode(file)->i_sb->s_fs_info;
3204 loff_t pos = ctx->pos;
3206 if (pos >= PID_MAX_LIMIT + TGID_OFFSET)
3209 if (pos == TGID_OFFSET - 2) {
3210 struct inode *inode = d_inode(ns->proc_self);
3211 if (!dir_emit(ctx, "self", 4, inode->i_ino, DT_LNK))
3213 ctx->pos = pos = pos + 1;
3215 if (pos == TGID_OFFSET - 1) {
3216 struct inode *inode = d_inode(ns->proc_thread_self);
3217 if (!dir_emit(ctx, "thread-self", 11, inode->i_ino, DT_LNK))
3219 ctx->pos = pos = pos + 1;
3221 iter.tgid = pos - TGID_OFFSET;
3223 for (iter = next_tgid(ns, iter);
3225 iter.tgid += 1, iter = next_tgid(ns, iter)) {
3226 char name[PROC_NUMBUF];
3230 if (!has_pid_permissions(ns, iter.task, HIDEPID_INVISIBLE))
3233 len = snprintf(name, sizeof(name), "%d", iter.tgid);
3234 ctx->pos = iter.tgid + TGID_OFFSET;
3235 if (!proc_fill_cache(file, ctx, name, len,
3236 proc_pid_instantiate, iter.task, NULL)) {
3237 put_task_struct(iter.task);
3241 ctx->pos = PID_MAX_LIMIT + TGID_OFFSET;
3246 * proc_tid_comm_permission is a special permission function exclusively
3247 * used for the node /proc/<pid>/task/<tid>/comm.
3248 * It bypasses generic permission checks in the case where a task of the same
3249 * task group attempts to access the node.
3250 * The rationale behind this is that glibc and bionic access this node for
3251 * cross thread naming (pthread_set/getname_np(!self)). However, if
3252 * PR_SET_DUMPABLE gets set to 0 this node among others becomes uid=0 gid=0,
3253 * which locks out the cross thread naming implementation.
3254 * This function makes sure that the node is always accessible for members of
3255 * same thread group.
3257 static int proc_tid_comm_permission(struct inode *inode, int mask)
3259 bool is_same_tgroup;
3260 struct task_struct *task;
3262 task = get_proc_task(inode);
3265 is_same_tgroup = same_thread_group(current, task);
3266 put_task_struct(task);
3268 if (likely(is_same_tgroup && !(mask & MAY_EXEC))) {
3269 /* This file (/proc/<pid>/task/<tid>/comm) can always be
3270 * read or written by the members of the corresponding
3276 return generic_permission(inode, mask);
3279 static const struct inode_operations proc_tid_comm_inode_operations = {
3280 .permission = proc_tid_comm_permission,
3286 static const struct pid_entry tid_base_stuff[] = {
3287 DIR("fd", S_IRUSR|S_IXUSR, proc_fd_inode_operations, proc_fd_operations),
3288 DIR("fdinfo", S_IRUSR|S_IXUSR, proc_fdinfo_inode_operations, proc_fdinfo_operations),
3289 DIR("ns", S_IRUSR|S_IXUGO, proc_ns_dir_inode_operations, proc_ns_dir_operations),
3291 DIR("net", S_IRUGO|S_IXUGO, proc_net_inode_operations, proc_net_operations),
3293 REG("environ", S_IRUSR, proc_environ_operations),
3294 REG("auxv", S_IRUSR, proc_auxv_operations),
3295 ONE("status", S_IRUGO, proc_pid_status),
3296 ONE("personality", S_IRUSR, proc_pid_personality),
3297 ONE("limits", S_IRUGO, proc_pid_limits),
3298 #ifdef CONFIG_SCHED_DEBUG
3299 REG("sched", S_IRUGO|S_IWUSR, proc_pid_sched_operations),
3301 NOD("comm", S_IFREG|S_IRUGO|S_IWUSR,
3302 &proc_tid_comm_inode_operations,
3303 &proc_pid_set_comm_operations, {}),
3304 #ifdef CONFIG_HAVE_ARCH_TRACEHOOK
3305 ONE("syscall", S_IRUSR, proc_pid_syscall),
3307 REG("cmdline", S_IRUGO, proc_pid_cmdline_ops),
3308 ONE("stat", S_IRUGO, proc_tid_stat),
3309 ONE("statm", S_IRUGO, proc_pid_statm),
3310 REG("maps", S_IRUGO, proc_tid_maps_operations),
3311 #ifdef CONFIG_PROC_CHILDREN
3312 REG("children", S_IRUGO, proc_tid_children_operations),
3315 REG("numa_maps", S_IRUGO, proc_tid_numa_maps_operations),
3317 REG("mem", S_IRUSR|S_IWUSR, proc_mem_operations),
3318 LNK("cwd", proc_cwd_link),
3319 LNK("root", proc_root_link),
3320 LNK("exe", proc_exe_link),
3321 REG("mounts", S_IRUGO, proc_mounts_operations),
3322 REG("mountinfo", S_IRUGO, proc_mountinfo_operations),
3323 #ifdef CONFIG_PROC_PAGE_MONITOR
3324 REG("clear_refs", S_IWUSR, proc_clear_refs_operations),
3325 REG("smaps", S_IRUGO, proc_tid_smaps_operations),
3326 REG("pagemap", S_IRUSR, proc_pagemap_operations),
3328 #ifdef CONFIG_SECURITY
3329 DIR("attr", S_IRUGO|S_IXUGO, proc_attr_dir_inode_operations, proc_attr_dir_operations),
3331 #ifdef CONFIG_KALLSYMS
3332 ONE("wchan", S_IRUGO, proc_pid_wchan),
3334 #ifdef CONFIG_STACKTRACE
3335 ONE("stack", S_IRUSR, proc_pid_stack),
3337 #ifdef CONFIG_SCHED_INFO
3338 ONE("schedstat", S_IRUGO, proc_pid_schedstat),
3340 #ifdef CONFIG_LATENCYTOP
3341 REG("latency", S_IRUGO, proc_lstats_operations),
3343 #ifdef CONFIG_PROC_PID_CPUSET
3344 ONE("cpuset", S_IRUGO, proc_cpuset_show),
3346 #ifdef CONFIG_CGROUPS
3347 ONE("cgroup", S_IRUGO, proc_cgroup_show),
3349 ONE("oom_score", S_IRUGO, proc_oom_score),
3350 REG("oom_adj", S_IRUGO|S_IWUSR, proc_oom_adj_operations),
3351 REG("oom_score_adj", S_IRUGO|S_IWUSR, proc_oom_score_adj_operations),
3352 #ifdef CONFIG_AUDITSYSCALL
3353 REG("loginuid", S_IWUSR|S_IRUGO, proc_loginuid_operations),
3354 REG("sessionid", S_IRUGO, proc_sessionid_operations),
3356 #ifdef CONFIG_FAULT_INJECTION
3357 REG("make-it-fail", S_IRUGO|S_IWUSR, proc_fault_inject_operations),
3358 REG("fail-nth", 0644, proc_fail_nth_operations),
3360 #ifdef CONFIG_TASK_IO_ACCOUNTING
3361 ONE("io", S_IRUSR, proc_tid_io_accounting),
3363 #ifdef CONFIG_HARDWALL
3364 ONE("hardwall", S_IRUGO, proc_pid_hardwall),
3366 #ifdef CONFIG_USER_NS
3367 REG("uid_map", S_IRUGO|S_IWUSR, proc_uid_map_operations),
3368 REG("gid_map", S_IRUGO|S_IWUSR, proc_gid_map_operations),
3369 REG("projid_map", S_IRUGO|S_IWUSR, proc_projid_map_operations),
3370 REG("setgroups", S_IRUGO|S_IWUSR, proc_setgroups_operations),
3372 #ifdef CONFIG_LIVEPATCH
3373 ONE("patch_state", S_IRUSR, proc_pid_patch_state),
3377 static int proc_tid_base_readdir(struct file *file, struct dir_context *ctx)
3379 return proc_pident_readdir(file, ctx,
3380 tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
3383 static struct dentry *proc_tid_base_lookup(struct inode *dir, struct dentry *dentry, unsigned int flags)
3385 return proc_pident_lookup(dir, dentry,
3386 tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
3389 static const struct file_operations proc_tid_base_operations = {
3390 .read = generic_read_dir,
3391 .iterate_shared = proc_tid_base_readdir,
3392 .llseek = generic_file_llseek,
3395 static const struct inode_operations proc_tid_base_inode_operations = {
3396 .lookup = proc_tid_base_lookup,
3397 .getattr = pid_getattr,
3398 .setattr = proc_setattr,
3401 static int proc_task_instantiate(struct inode *dir,
3402 struct dentry *dentry, struct task_struct *task, const void *ptr)
3404 struct inode *inode;
3405 inode = proc_pid_make_inode(dir->i_sb, task, S_IFDIR | S_IRUGO | S_IXUGO);
3409 inode->i_op = &proc_tid_base_inode_operations;
3410 inode->i_fop = &proc_tid_base_operations;
3411 inode->i_flags|=S_IMMUTABLE;
3413 set_nlink(inode, nlink_tid);
3415 d_set_d_op(dentry, &pid_dentry_operations);
3417 d_add(dentry, inode);
3418 /* Close the race of the process dying before we return the dentry */
3419 if (pid_revalidate(dentry, 0))
3425 static struct dentry *proc_task_lookup(struct inode *dir, struct dentry * dentry, unsigned int flags)
3427 int result = -ENOENT;
3428 struct task_struct *task;
3429 struct task_struct *leader = get_proc_task(dir);
3431 struct pid_namespace *ns;
3436 tid = name_to_int(&dentry->d_name);
3440 ns = dentry->d_sb->s_fs_info;
3442 task = find_task_by_pid_ns(tid, ns);
3444 get_task_struct(task);
3448 if (!same_thread_group(leader, task))
3451 result = proc_task_instantiate(dir, dentry, task, NULL);
3453 put_task_struct(task);
3455 put_task_struct(leader);
3457 return ERR_PTR(result);
3461 * Find the first tid of a thread group to return to user space.
3463 * Usually this is just the thread group leader, but if the users
3464 * buffer was too small or there was a seek into the middle of the
3465 * directory we have more work todo.
3467 * In the case of a short read we start with find_task_by_pid.
3469 * In the case of a seek we start with the leader and walk nr
3472 static struct task_struct *first_tid(struct pid *pid, int tid, loff_t f_pos,
3473 struct pid_namespace *ns)
3475 struct task_struct *pos, *task;
3476 unsigned long nr = f_pos;
3478 if (nr != f_pos) /* 32bit overflow? */
3482 task = pid_task(pid, PIDTYPE_PID);
3486 /* Attempt to start with the tid of a thread */
3488 pos = find_task_by_pid_ns(tid, ns);
3489 if (pos && same_thread_group(pos, task))
3493 /* If nr exceeds the number of threads there is nothing todo */
3494 if (nr >= get_nr_threads(task))
3497 /* If we haven't found our starting place yet start
3498 * with the leader and walk nr threads forward.
3500 pos = task = task->group_leader;
3504 } while_each_thread(task, pos);
3509 get_task_struct(pos);
3516 * Find the next thread in the thread list.
3517 * Return NULL if there is an error or no next thread.
3519 * The reference to the input task_struct is released.
3521 static struct task_struct *next_tid(struct task_struct *start)
3523 struct task_struct *pos = NULL;
3525 if (pid_alive(start)) {
3526 pos = next_thread(start);
3527 if (thread_group_leader(pos))
3530 get_task_struct(pos);
3533 put_task_struct(start);
3537 /* for the /proc/TGID/task/ directories */
3538 static int proc_task_readdir(struct file *file, struct dir_context *ctx)
3540 struct inode *inode = file_inode(file);
3541 struct task_struct *task;
3542 struct pid_namespace *ns;
3545 if (proc_inode_is_dead(inode))
3548 if (!dir_emit_dots(file, ctx))
3551 /* f_version caches the tgid value that the last readdir call couldn't
3552 * return. lseek aka telldir automagically resets f_version to 0.
3554 ns = inode->i_sb->s_fs_info;
3555 tid = (int)file->f_version;
3556 file->f_version = 0;
3557 for (task = first_tid(proc_pid(inode), tid, ctx->pos - 2, ns);
3559 task = next_tid(task), ctx->pos++) {
3560 char name[PROC_NUMBUF];
3562 tid = task_pid_nr_ns(task, ns);
3563 len = snprintf(name, sizeof(name), "%d", tid);
3564 if (!proc_fill_cache(file, ctx, name, len,
3565 proc_task_instantiate, task, NULL)) {
3566 /* returning this tgid failed, save it as the first
3567 * pid for the next readir call */
3568 file->f_version = (u64)tid;
3569 put_task_struct(task);
3577 static int proc_task_getattr(const struct path *path, struct kstat *stat,
3578 u32 request_mask, unsigned int query_flags)
3580 struct inode *inode = d_inode(path->dentry);
3581 struct task_struct *p = get_proc_task(inode);
3582 generic_fillattr(inode, stat);
3585 stat->nlink += get_nr_threads(p);
3592 static const struct inode_operations proc_task_inode_operations = {
3593 .lookup = proc_task_lookup,
3594 .getattr = proc_task_getattr,
3595 .setattr = proc_setattr,
3596 .permission = proc_pid_permission,
3599 static const struct file_operations proc_task_operations = {
3600 .read = generic_read_dir,
3601 .iterate_shared = proc_task_readdir,
3602 .llseek = generic_file_llseek,
3605 void __init set_proc_pid_nlink(void)
3607 nlink_tid = pid_entry_nlink(tid_base_stuff, ARRAY_SIZE(tid_base_stuff));
3608 nlink_tgid = pid_entry_nlink(tgid_base_stuff, ARRAY_SIZE(tgid_base_stuff));