Loading...
1/*
2 * linux/fs/proc/array.c
3 *
4 * Copyright (C) 1992 by Linus Torvalds
5 * based on ideas by Darren Senn
6 *
7 * Fixes:
8 * Michael. K. Johnson: stat,statm extensions.
9 * <johnsonm@stolaf.edu>
10 *
11 * Pauline Middelink : Made cmdline,envline only break at '\0's, to
12 * make sure SET_PROCTITLE works. Also removed
13 * bad '!' which forced address recalculation for
14 * EVERY character on the current page.
15 * <middelin@polyware.iaf.nl>
16 *
17 * Danny ter Haar : added cpuinfo
18 * <dth@cistron.nl>
19 *
20 * Alessandro Rubini : profile extension.
21 * <rubini@ipvvis.unipv.it>
22 *
23 * Jeff Tranter : added BogoMips field to cpuinfo
24 * <Jeff_Tranter@Mitel.COM>
25 *
26 * Bruno Haible : remove 4K limit for the maps file
27 * <haible@ma2s2.mathematik.uni-karlsruhe.de>
28 *
29 * Yves Arrouye : remove removal of trailing spaces in get_array.
30 * <Yves.Arrouye@marin.fdn.fr>
31 *
32 * Jerome Forissier : added per-CPU time information to /proc/stat
33 * and /proc/<pid>/cpu extension
34 * <forissier@isia.cma.fr>
35 * - Incorporation and non-SMP safe operation
36 * of forissier patch in 2.1.78 by
37 * Hans Marcus <crowbar@concepts.nl>
38 *
39 * aeb@cwi.nl : /proc/partitions
40 *
41 *
42 * Alan Cox : security fixes.
43 * <alan@lxorguk.ukuu.org.uk>
44 *
45 * Al Viro : safe handling of mm_struct
46 *
47 * Gerhard Wichert : added BIGMEM support
48 * Siemens AG <Gerhard.Wichert@pdb.siemens.de>
49 *
50 * Al Viro & Jeff Garzik : moved most of the thing into base.c and
51 * : proc_misc.c. The rest may eventually go into
52 * : base.c too.
53 */
54
55#include <linux/types.h>
56#include <linux/errno.h>
57#include <linux/time.h>
58#include <linux/kernel.h>
59#include <linux/kernel_stat.h>
60#include <linux/tty.h>
61#include <linux/string.h>
62#include <linux/mman.h>
63#include <linux/proc_fs.h>
64#include <linux/ioport.h>
65#include <linux/uaccess.h>
66#include <linux/io.h>
67#include <linux/mm.h>
68#include <linux/hugetlb.h>
69#include <linux/pagemap.h>
70#include <linux/swap.h>
71#include <linux/smp.h>
72#include <linux/signal.h>
73#include <linux/highmem.h>
74#include <linux/file.h>
75#include <linux/fdtable.h>
76#include <linux/times.h>
77#include <linux/cpuset.h>
78#include <linux/rcupdate.h>
79#include <linux/delayacct.h>
80#include <linux/seq_file.h>
81#include <linux/pid_namespace.h>
82#include <linux/ptrace.h>
83#include <linux/tracehook.h>
84#include <linux/string_helpers.h>
85#include <linux/user_namespace.h>
86
87#include <asm/pgtable.h>
88#include <asm/processor.h>
89#include "internal.h"
90
91static inline void task_name(struct seq_file *m, struct task_struct *p)
92{
93 char *buf;
94 size_t size;
95 char tcomm[sizeof(p->comm)];
96 int ret;
97
98 get_task_comm(tcomm, p);
99
100 seq_puts(m, "Name:\t");
101
102 size = seq_get_buf(m, &buf);
103 ret = string_escape_str(tcomm, buf, size, ESCAPE_SPACE | ESCAPE_SPECIAL, "\n\\");
104 seq_commit(m, ret < size ? ret : -1);
105
106 seq_putc(m, '\n');
107}
108
109/*
110 * The task state array is a strange "bitmap" of
111 * reasons to sleep. Thus "running" is zero, and
112 * you can test for combinations of others with
113 * simple bit tests.
114 */
115static const char * const task_state_array[] = {
116 "R (running)", /* 0 */
117 "S (sleeping)", /* 1 */
118 "D (disk sleep)", /* 2 */
119 "T (stopped)", /* 4 */
120 "t (tracing stop)", /* 8 */
121 "X (dead)", /* 16 */
122 "Z (zombie)", /* 32 */
123};
124
125static inline const char *get_task_state(struct task_struct *tsk)
126{
127 unsigned int state = (tsk->state | tsk->exit_state) & TASK_REPORT;
128
129 /*
130 * Parked tasks do not run; they sit in __kthread_parkme().
131 * Without this check, we would report them as running, which is
132 * clearly wrong, so we report them as sleeping instead.
133 */
134 if (tsk->state == TASK_PARKED)
135 state = TASK_INTERRUPTIBLE;
136
137 BUILD_BUG_ON(1 + ilog2(TASK_REPORT) != ARRAY_SIZE(task_state_array)-1);
138
139 return task_state_array[fls(state)];
140}
141
142static inline void task_state(struct seq_file *m, struct pid_namespace *ns,
143 struct pid *pid, struct task_struct *p)
144{
145 struct user_namespace *user_ns = seq_user_ns(m);
146 struct group_info *group_info;
147 int g;
148 struct task_struct *tracer;
149 const struct cred *cred;
150 pid_t ppid, tpid = 0, tgid, ngid;
151 unsigned int max_fds = 0;
152
153 rcu_read_lock();
154 ppid = pid_alive(p) ?
155 task_tgid_nr_ns(rcu_dereference(p->real_parent), ns) : 0;
156
157 tracer = ptrace_parent(p);
158 if (tracer)
159 tpid = task_pid_nr_ns(tracer, ns);
160
161 tgid = task_tgid_nr_ns(p, ns);
162 ngid = task_numa_group_id(p);
163 cred = get_task_cred(p);
164
165 task_lock(p);
166 if (p->files)
167 max_fds = files_fdtable(p->files)->max_fds;
168 task_unlock(p);
169 rcu_read_unlock();
170
171 seq_printf(m,
172 "State:\t%s\n"
173 "Tgid:\t%d\n"
174 "Ngid:\t%d\n"
175 "Pid:\t%d\n"
176 "PPid:\t%d\n"
177 "TracerPid:\t%d\n"
178 "Uid:\t%d\t%d\t%d\t%d\n"
179 "Gid:\t%d\t%d\t%d\t%d\n"
180 "FDSize:\t%d\nGroups:\t",
181 get_task_state(p),
182 tgid, ngid, pid_nr_ns(pid, ns), ppid, tpid,
183 from_kuid_munged(user_ns, cred->uid),
184 from_kuid_munged(user_ns, cred->euid),
185 from_kuid_munged(user_ns, cred->suid),
186 from_kuid_munged(user_ns, cred->fsuid),
187 from_kgid_munged(user_ns, cred->gid),
188 from_kgid_munged(user_ns, cred->egid),
189 from_kgid_munged(user_ns, cred->sgid),
190 from_kgid_munged(user_ns, cred->fsgid),
191 max_fds);
192
193 group_info = cred->group_info;
194 for (g = 0; g < group_info->ngroups; g++)
195 seq_printf(m, "%d ",
196 from_kgid_munged(user_ns, GROUP_AT(group_info, g)));
197 put_cred(cred);
198
199#ifdef CONFIG_PID_NS
200 seq_puts(m, "\nNStgid:");
201 for (g = ns->level; g <= pid->level; g++)
202 seq_printf(m, "\t%d",
203 task_tgid_nr_ns(p, pid->numbers[g].ns));
204 seq_puts(m, "\nNSpid:");
205 for (g = ns->level; g <= pid->level; g++)
206 seq_printf(m, "\t%d",
207 task_pid_nr_ns(p, pid->numbers[g].ns));
208 seq_puts(m, "\nNSpgid:");
209 for (g = ns->level; g <= pid->level; g++)
210 seq_printf(m, "\t%d",
211 task_pgrp_nr_ns(p, pid->numbers[g].ns));
212 seq_puts(m, "\nNSsid:");
213 for (g = ns->level; g <= pid->level; g++)
214 seq_printf(m, "\t%d",
215 task_session_nr_ns(p, pid->numbers[g].ns));
216#endif
217 seq_putc(m, '\n');
218}
219
220void render_sigset_t(struct seq_file *m, const char *header,
221 sigset_t *set)
222{
223 int i;
224
225 seq_puts(m, header);
226
227 i = _NSIG;
228 do {
229 int x = 0;
230
231 i -= 4;
232 if (sigismember(set, i+1)) x |= 1;
233 if (sigismember(set, i+2)) x |= 2;
234 if (sigismember(set, i+3)) x |= 4;
235 if (sigismember(set, i+4)) x |= 8;
236 seq_printf(m, "%x", x);
237 } while (i >= 4);
238
239 seq_putc(m, '\n');
240}
241
242static void collect_sigign_sigcatch(struct task_struct *p, sigset_t *ign,
243 sigset_t *catch)
244{
245 struct k_sigaction *k;
246 int i;
247
248 k = p->sighand->action;
249 for (i = 1; i <= _NSIG; ++i, ++k) {
250 if (k->sa.sa_handler == SIG_IGN)
251 sigaddset(ign, i);
252 else if (k->sa.sa_handler != SIG_DFL)
253 sigaddset(catch, i);
254 }
255}
256
257static inline void task_sig(struct seq_file *m, struct task_struct *p)
258{
259 unsigned long flags;
260 sigset_t pending, shpending, blocked, ignored, caught;
261 int num_threads = 0;
262 unsigned long qsize = 0;
263 unsigned long qlim = 0;
264
265 sigemptyset(&pending);
266 sigemptyset(&shpending);
267 sigemptyset(&blocked);
268 sigemptyset(&ignored);
269 sigemptyset(&caught);
270
271 if (lock_task_sighand(p, &flags)) {
272 pending = p->pending.signal;
273 shpending = p->signal->shared_pending.signal;
274 blocked = p->blocked;
275 collect_sigign_sigcatch(p, &ignored, &caught);
276 num_threads = get_nr_threads(p);
277 rcu_read_lock(); /* FIXME: is this correct? */
278 qsize = atomic_read(&__task_cred(p)->user->sigpending);
279 rcu_read_unlock();
280 qlim = task_rlimit(p, RLIMIT_SIGPENDING);
281 unlock_task_sighand(p, &flags);
282 }
283
284 seq_printf(m, "Threads:\t%d\n", num_threads);
285 seq_printf(m, "SigQ:\t%lu/%lu\n", qsize, qlim);
286
287 /* render them all */
288 render_sigset_t(m, "SigPnd:\t", &pending);
289 render_sigset_t(m, "ShdPnd:\t", &shpending);
290 render_sigset_t(m, "SigBlk:\t", &blocked);
291 render_sigset_t(m, "SigIgn:\t", &ignored);
292 render_sigset_t(m, "SigCgt:\t", &caught);
293}
294
295static void render_cap_t(struct seq_file *m, const char *header,
296 kernel_cap_t *a)
297{
298 unsigned __capi;
299
300 seq_puts(m, header);
301 CAP_FOR_EACH_U32(__capi) {
302 seq_printf(m, "%08x",
303 a->cap[CAP_LAST_U32 - __capi]);
304 }
305 seq_putc(m, '\n');
306}
307
308static inline void task_cap(struct seq_file *m, struct task_struct *p)
309{
310 const struct cred *cred;
311 kernel_cap_t cap_inheritable, cap_permitted, cap_effective,
312 cap_bset, cap_ambient;
313
314 rcu_read_lock();
315 cred = __task_cred(p);
316 cap_inheritable = cred->cap_inheritable;
317 cap_permitted = cred->cap_permitted;
318 cap_effective = cred->cap_effective;
319 cap_bset = cred->cap_bset;
320 cap_ambient = cred->cap_ambient;
321 rcu_read_unlock();
322
323 render_cap_t(m, "CapInh:\t", &cap_inheritable);
324 render_cap_t(m, "CapPrm:\t", &cap_permitted);
325 render_cap_t(m, "CapEff:\t", &cap_effective);
326 render_cap_t(m, "CapBnd:\t", &cap_bset);
327 render_cap_t(m, "CapAmb:\t", &cap_ambient);
328}
329
330static inline void task_seccomp(struct seq_file *m, struct task_struct *p)
331{
332#ifdef CONFIG_SECCOMP
333 seq_printf(m, "Seccomp:\t%d\n", p->seccomp.mode);
334#endif
335}
336
337static inline void task_context_switch_counts(struct seq_file *m,
338 struct task_struct *p)
339{
340 seq_printf(m, "voluntary_ctxt_switches:\t%lu\n"
341 "nonvoluntary_ctxt_switches:\t%lu\n",
342 p->nvcsw,
343 p->nivcsw);
344}
345
346static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
347{
348 seq_printf(m, "Cpus_allowed:\t%*pb\n",
349 cpumask_pr_args(&task->cpus_allowed));
350 seq_printf(m, "Cpus_allowed_list:\t%*pbl\n",
351 cpumask_pr_args(&task->cpus_allowed));
352}
353
354int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
355 struct pid *pid, struct task_struct *task)
356{
357 struct mm_struct *mm = get_task_mm(task);
358
359 task_name(m, task);
360 task_state(m, ns, pid, task);
361
362 if (mm) {
363 task_mem(m, mm);
364 mmput(mm);
365 }
366 task_sig(m, task);
367 task_cap(m, task);
368 task_seccomp(m, task);
369 task_cpus_allowed(m, task);
370 cpuset_task_status_allowed(m, task);
371 task_context_switch_counts(m, task);
372 return 0;
373}
374
375static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
376 struct pid *pid, struct task_struct *task, int whole)
377{
378 unsigned long vsize, eip, esp, wchan = 0;
379 int priority, nice;
380 int tty_pgrp = -1, tty_nr = 0;
381 sigset_t sigign, sigcatch;
382 char state;
383 pid_t ppid = 0, pgid = -1, sid = -1;
384 int num_threads = 0;
385 int permitted;
386 struct mm_struct *mm;
387 unsigned long long start_time;
388 unsigned long cmin_flt = 0, cmaj_flt = 0;
389 unsigned long min_flt = 0, maj_flt = 0;
390 cputime_t cutime, cstime, utime, stime;
391 cputime_t cgtime, gtime;
392 unsigned long rsslim = 0;
393 char tcomm[sizeof(task->comm)];
394 unsigned long flags;
395
396 state = *get_task_state(task);
397 vsize = eip = esp = 0;
398 permitted = ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS | PTRACE_MODE_NOAUDIT);
399 mm = get_task_mm(task);
400 if (mm) {
401 vsize = task_vsize(mm);
402 if (permitted) {
403 eip = KSTK_EIP(task);
404 esp = KSTK_ESP(task);
405 }
406 }
407
408 get_task_comm(tcomm, task);
409
410 sigemptyset(&sigign);
411 sigemptyset(&sigcatch);
412 cutime = cstime = utime = stime = 0;
413 cgtime = gtime = 0;
414
415 if (lock_task_sighand(task, &flags)) {
416 struct signal_struct *sig = task->signal;
417
418 if (sig->tty) {
419 struct pid *pgrp = tty_get_pgrp(sig->tty);
420 tty_pgrp = pid_nr_ns(pgrp, ns);
421 put_pid(pgrp);
422 tty_nr = new_encode_dev(tty_devnum(sig->tty));
423 }
424
425 num_threads = get_nr_threads(task);
426 collect_sigign_sigcatch(task, &sigign, &sigcatch);
427
428 cmin_flt = sig->cmin_flt;
429 cmaj_flt = sig->cmaj_flt;
430 cutime = sig->cutime;
431 cstime = sig->cstime;
432 cgtime = sig->cgtime;
433 rsslim = ACCESS_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
434
435 /* add up live thread stats at the group level */
436 if (whole) {
437 struct task_struct *t = task;
438 do {
439 min_flt += t->min_flt;
440 maj_flt += t->maj_flt;
441 gtime += task_gtime(t);
442 } while_each_thread(task, t);
443
444 min_flt += sig->min_flt;
445 maj_flt += sig->maj_flt;
446 thread_group_cputime_adjusted(task, &utime, &stime);
447 gtime += sig->gtime;
448 }
449
450 sid = task_session_nr_ns(task, ns);
451 ppid = task_tgid_nr_ns(task->real_parent, ns);
452 pgid = task_pgrp_nr_ns(task, ns);
453
454 unlock_task_sighand(task, &flags);
455 }
456
457 if (permitted && (!whole || num_threads < 2))
458 wchan = get_wchan(task);
459 if (!whole) {
460 min_flt = task->min_flt;
461 maj_flt = task->maj_flt;
462 task_cputime_adjusted(task, &utime, &stime);
463 gtime = task_gtime(task);
464 }
465
466 /* scale priority and nice values from timeslices to -20..20 */
467 /* to make it look like a "normal" Unix priority/nice value */
468 priority = task_prio(task);
469 nice = task_nice(task);
470
471 /* convert nsec -> ticks */
472 start_time = nsec_to_clock_t(task->real_start_time);
473
474 seq_printf(m, "%d (%s) %c", pid_nr_ns(pid, ns), tcomm, state);
475 seq_put_decimal_ll(m, ' ', ppid);
476 seq_put_decimal_ll(m, ' ', pgid);
477 seq_put_decimal_ll(m, ' ', sid);
478 seq_put_decimal_ll(m, ' ', tty_nr);
479 seq_put_decimal_ll(m, ' ', tty_pgrp);
480 seq_put_decimal_ull(m, ' ', task->flags);
481 seq_put_decimal_ull(m, ' ', min_flt);
482 seq_put_decimal_ull(m, ' ', cmin_flt);
483 seq_put_decimal_ull(m, ' ', maj_flt);
484 seq_put_decimal_ull(m, ' ', cmaj_flt);
485 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(utime));
486 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(stime));
487 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cutime));
488 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cstime));
489 seq_put_decimal_ll(m, ' ', priority);
490 seq_put_decimal_ll(m, ' ', nice);
491 seq_put_decimal_ll(m, ' ', num_threads);
492 seq_put_decimal_ull(m, ' ', 0);
493 seq_put_decimal_ull(m, ' ', start_time);
494 seq_put_decimal_ull(m, ' ', vsize);
495 seq_put_decimal_ull(m, ' ', mm ? get_mm_rss(mm) : 0);
496 seq_put_decimal_ull(m, ' ', rsslim);
497 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->start_code : 1) : 0);
498 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->end_code : 1) : 0);
499 seq_put_decimal_ull(m, ' ', (permitted && mm) ? mm->start_stack : 0);
500 seq_put_decimal_ull(m, ' ', esp);
501 seq_put_decimal_ull(m, ' ', eip);
502 /* The signal information here is obsolete.
503 * It must be decimal for Linux 2.0 compatibility.
504 * Use /proc/#/status for real-time signals.
505 */
506 seq_put_decimal_ull(m, ' ', task->pending.signal.sig[0] & 0x7fffffffUL);
507 seq_put_decimal_ull(m, ' ', task->blocked.sig[0] & 0x7fffffffUL);
508 seq_put_decimal_ull(m, ' ', sigign.sig[0] & 0x7fffffffUL);
509 seq_put_decimal_ull(m, ' ', sigcatch.sig[0] & 0x7fffffffUL);
510
511 /*
512 * We used to output the absolute kernel address, but that's an
513 * information leak - so instead we show a 0/1 flag here, to signal
514 * to user-space whether there's a wchan field in /proc/PID/wchan.
515 *
516 * This works with older implementations of procps as well.
517 */
518 if (wchan)
519 seq_puts(m, " 1");
520 else
521 seq_puts(m, " 0");
522
523 seq_put_decimal_ull(m, ' ', 0);
524 seq_put_decimal_ull(m, ' ', 0);
525 seq_put_decimal_ll(m, ' ', task->exit_signal);
526 seq_put_decimal_ll(m, ' ', task_cpu(task));
527 seq_put_decimal_ull(m, ' ', task->rt_priority);
528 seq_put_decimal_ull(m, ' ', task->policy);
529 seq_put_decimal_ull(m, ' ', delayacct_blkio_ticks(task));
530 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(gtime));
531 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cgtime));
532
533 if (mm && permitted) {
534 seq_put_decimal_ull(m, ' ', mm->start_data);
535 seq_put_decimal_ull(m, ' ', mm->end_data);
536 seq_put_decimal_ull(m, ' ', mm->start_brk);
537 seq_put_decimal_ull(m, ' ', mm->arg_start);
538 seq_put_decimal_ull(m, ' ', mm->arg_end);
539 seq_put_decimal_ull(m, ' ', mm->env_start);
540 seq_put_decimal_ull(m, ' ', mm->env_end);
541 } else
542 seq_printf(m, " 0 0 0 0 0 0 0");
543
544 if (permitted)
545 seq_put_decimal_ll(m, ' ', task->exit_code);
546 else
547 seq_put_decimal_ll(m, ' ', 0);
548
549 seq_putc(m, '\n');
550 if (mm)
551 mmput(mm);
552 return 0;
553}
554
555int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
556 struct pid *pid, struct task_struct *task)
557{
558 return do_task_stat(m, ns, pid, task, 0);
559}
560
561int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
562 struct pid *pid, struct task_struct *task)
563{
564 return do_task_stat(m, ns, pid, task, 1);
565}
566
567int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
568 struct pid *pid, struct task_struct *task)
569{
570 unsigned long size = 0, resident = 0, shared = 0, text = 0, data = 0;
571 struct mm_struct *mm = get_task_mm(task);
572
573 if (mm) {
574 size = task_statm(mm, &shared, &text, &data, &resident);
575 mmput(mm);
576 }
577 /*
578 * For quick read, open code by putting numbers directly
579 * expected format is
580 * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
581 * size, resident, shared, text, data);
582 */
583 seq_put_decimal_ull(m, 0, size);
584 seq_put_decimal_ull(m, ' ', resident);
585 seq_put_decimal_ull(m, ' ', shared);
586 seq_put_decimal_ull(m, ' ', text);
587 seq_put_decimal_ull(m, ' ', 0);
588 seq_put_decimal_ull(m, ' ', data);
589 seq_put_decimal_ull(m, ' ', 0);
590 seq_putc(m, '\n');
591
592 return 0;
593}
594
595#ifdef CONFIG_PROC_CHILDREN
596static struct pid *
597get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
598{
599 struct task_struct *start, *task;
600 struct pid *pid = NULL;
601
602 read_lock(&tasklist_lock);
603
604 start = pid_task(proc_pid(inode), PIDTYPE_PID);
605 if (!start)
606 goto out;
607
608 /*
609 * Lets try to continue searching first, this gives
610 * us significant speedup on children-rich processes.
611 */
612 if (pid_prev) {
613 task = pid_task(pid_prev, PIDTYPE_PID);
614 if (task && task->real_parent == start &&
615 !(list_empty(&task->sibling))) {
616 if (list_is_last(&task->sibling, &start->children))
617 goto out;
618 task = list_first_entry(&task->sibling,
619 struct task_struct, sibling);
620 pid = get_pid(task_pid(task));
621 goto out;
622 }
623 }
624
625 /*
626 * Slow search case.
627 *
628 * We might miss some children here if children
629 * are exited while we were not holding the lock,
630 * but it was never promised to be accurate that
631 * much.
632 *
633 * "Just suppose that the parent sleeps, but N children
634 * exit after we printed their tids. Now the slow paths
635 * skips N extra children, we miss N tasks." (c)
636 *
637 * So one need to stop or freeze the leader and all
638 * its children to get a precise result.
639 */
640 list_for_each_entry(task, &start->children, sibling) {
641 if (pos-- == 0) {
642 pid = get_pid(task_pid(task));
643 break;
644 }
645 }
646
647out:
648 read_unlock(&tasklist_lock);
649 return pid;
650}
651
652static int children_seq_show(struct seq_file *seq, void *v)
653{
654 struct inode *inode = seq->private;
655 pid_t pid;
656
657 pid = pid_nr_ns(v, inode->i_sb->s_fs_info);
658 seq_printf(seq, "%d ", pid);
659
660 return 0;
661}
662
663static void *children_seq_start(struct seq_file *seq, loff_t *pos)
664{
665 return get_children_pid(seq->private, NULL, *pos);
666}
667
668static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
669{
670 struct pid *pid;
671
672 pid = get_children_pid(seq->private, v, *pos + 1);
673 put_pid(v);
674
675 ++*pos;
676 return pid;
677}
678
679static void children_seq_stop(struct seq_file *seq, void *v)
680{
681 put_pid(v);
682}
683
684static const struct seq_operations children_seq_ops = {
685 .start = children_seq_start,
686 .next = children_seq_next,
687 .stop = children_seq_stop,
688 .show = children_seq_show,
689};
690
691static int children_seq_open(struct inode *inode, struct file *file)
692{
693 struct seq_file *m;
694 int ret;
695
696 ret = seq_open(file, &children_seq_ops);
697 if (ret)
698 return ret;
699
700 m = file->private_data;
701 m->private = inode;
702
703 return ret;
704}
705
706int children_seq_release(struct inode *inode, struct file *file)
707{
708 seq_release(inode, file);
709 return 0;
710}
711
712const struct file_operations proc_tid_children_operations = {
713 .open = children_seq_open,
714 .read = seq_read,
715 .llseek = seq_lseek,
716 .release = children_seq_release,
717};
718#endif /* CONFIG_PROC_CHILDREN */
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * linux/fs/proc/array.c
4 *
5 * Copyright (C) 1992 by Linus Torvalds
6 * based on ideas by Darren Senn
7 *
8 * Fixes:
9 * Michael. K. Johnson: stat,statm extensions.
10 * <johnsonm@stolaf.edu>
11 *
12 * Pauline Middelink : Made cmdline,envline only break at '\0's, to
13 * make sure SET_PROCTITLE works. Also removed
14 * bad '!' which forced address recalculation for
15 * EVERY character on the current page.
16 * <middelin@polyware.iaf.nl>
17 *
18 * Danny ter Haar : added cpuinfo
19 * <dth@cistron.nl>
20 *
21 * Alessandro Rubini : profile extension.
22 * <rubini@ipvvis.unipv.it>
23 *
24 * Jeff Tranter : added BogoMips field to cpuinfo
25 * <Jeff_Tranter@Mitel.COM>
26 *
27 * Bruno Haible : remove 4K limit for the maps file
28 * <haible@ma2s2.mathematik.uni-karlsruhe.de>
29 *
30 * Yves Arrouye : remove removal of trailing spaces in get_array.
31 * <Yves.Arrouye@marin.fdn.fr>
32 *
33 * Jerome Forissier : added per-CPU time information to /proc/stat
34 * and /proc/<pid>/cpu extension
35 * <forissier@isia.cma.fr>
36 * - Incorporation and non-SMP safe operation
37 * of forissier patch in 2.1.78 by
38 * Hans Marcus <crowbar@concepts.nl>
39 *
40 * aeb@cwi.nl : /proc/partitions
41 *
42 *
43 * Alan Cox : security fixes.
44 * <alan@lxorguk.ukuu.org.uk>
45 *
46 * Al Viro : safe handling of mm_struct
47 *
48 * Gerhard Wichert : added BIGMEM support
49 * Siemens AG <Gerhard.Wichert@pdb.siemens.de>
50 *
51 * Al Viro & Jeff Garzik : moved most of the thing into base.c and
52 * : proc_misc.c. The rest may eventually go into
53 * : base.c too.
54 */
55
56#include <linux/types.h>
57#include <linux/errno.h>
58#include <linux/time.h>
59#include <linux/time_namespace.h>
60#include <linux/kernel.h>
61#include <linux/kernel_stat.h>
62#include <linux/tty.h>
63#include <linux/string.h>
64#include <linux/mman.h>
65#include <linux/sched/mm.h>
66#include <linux/sched/numa_balancing.h>
67#include <linux/sched/task_stack.h>
68#include <linux/sched/task.h>
69#include <linux/sched/cputime.h>
70#include <linux/proc_fs.h>
71#include <linux/ioport.h>
72#include <linux/io.h>
73#include <linux/mm.h>
74#include <linux/hugetlb.h>
75#include <linux/pagemap.h>
76#include <linux/swap.h>
77#include <linux/smp.h>
78#include <linux/signal.h>
79#include <linux/highmem.h>
80#include <linux/file.h>
81#include <linux/fdtable.h>
82#include <linux/times.h>
83#include <linux/cpuset.h>
84#include <linux/rcupdate.h>
85#include <linux/delayacct.h>
86#include <linux/seq_file.h>
87#include <linux/pid_namespace.h>
88#include <linux/prctl.h>
89#include <linux/ptrace.h>
90#include <linux/string_helpers.h>
91#include <linux/user_namespace.h>
92#include <linux/fs_struct.h>
93#include <linux/kthread.h>
94#include <linux/mmu_context.h>
95
96#include <asm/processor.h>
97#include "internal.h"
98
99void proc_task_name(struct seq_file *m, struct task_struct *p, bool escape)
100{
101 char tcomm[64];
102
103 /*
104 * Test before PF_KTHREAD because all workqueue worker threads are
105 * kernel threads.
106 */
107 if (p->flags & PF_WQ_WORKER)
108 wq_worker_comm(tcomm, sizeof(tcomm), p);
109 else if (p->flags & PF_KTHREAD)
110 get_kthread_comm(tcomm, sizeof(tcomm), p);
111 else
112 get_task_comm(tcomm, p);
113
114 if (escape)
115 seq_escape_str(m, tcomm, ESCAPE_SPACE | ESCAPE_SPECIAL, "\n\\");
116 else
117 seq_printf(m, "%.64s", tcomm);
118}
119
120/*
121 * The task state array is a strange "bitmap" of
122 * reasons to sleep. Thus "running" is zero, and
123 * you can test for combinations of others with
124 * simple bit tests.
125 */
126static const char * const task_state_array[] = {
127
128 /* states in TASK_REPORT: */
129 "R (running)", /* 0x00 */
130 "S (sleeping)", /* 0x01 */
131 "D (disk sleep)", /* 0x02 */
132 "T (stopped)", /* 0x04 */
133 "t (tracing stop)", /* 0x08 */
134 "X (dead)", /* 0x10 */
135 "Z (zombie)", /* 0x20 */
136 "P (parked)", /* 0x40 */
137
138 /* states beyond TASK_REPORT: */
139 "I (idle)", /* 0x80 */
140};
141
142static inline const char *get_task_state(struct task_struct *tsk)
143{
144 BUILD_BUG_ON(1 + ilog2(TASK_REPORT_MAX) != ARRAY_SIZE(task_state_array));
145 return task_state_array[task_state_index(tsk)];
146}
147
148static inline void task_state(struct seq_file *m, struct pid_namespace *ns,
149 struct pid *pid, struct task_struct *p)
150{
151 struct user_namespace *user_ns = seq_user_ns(m);
152 struct group_info *group_info;
153 int g, umask = -1;
154 struct task_struct *tracer;
155 const struct cred *cred;
156 pid_t ppid, tpid = 0, tgid, ngid;
157 unsigned int max_fds = 0;
158
159 rcu_read_lock();
160 ppid = pid_alive(p) ?
161 task_tgid_nr_ns(rcu_dereference(p->real_parent), ns) : 0;
162
163 tracer = ptrace_parent(p);
164 if (tracer)
165 tpid = task_pid_nr_ns(tracer, ns);
166
167 tgid = task_tgid_nr_ns(p, ns);
168 ngid = task_numa_group_id(p);
169 cred = get_task_cred(p);
170
171 task_lock(p);
172 if (p->fs)
173 umask = p->fs->umask;
174 if (p->files)
175 max_fds = files_fdtable(p->files)->max_fds;
176 task_unlock(p);
177 rcu_read_unlock();
178
179 if (umask >= 0)
180 seq_printf(m, "Umask:\t%#04o\n", umask);
181 seq_puts(m, "State:\t");
182 seq_puts(m, get_task_state(p));
183
184 seq_put_decimal_ull(m, "\nTgid:\t", tgid);
185 seq_put_decimal_ull(m, "\nNgid:\t", ngid);
186 seq_put_decimal_ull(m, "\nPid:\t", pid_nr_ns(pid, ns));
187 seq_put_decimal_ull(m, "\nPPid:\t", ppid);
188 seq_put_decimal_ull(m, "\nTracerPid:\t", tpid);
189 seq_put_decimal_ull(m, "\nUid:\t", from_kuid_munged(user_ns, cred->uid));
190 seq_put_decimal_ull(m, "\t", from_kuid_munged(user_ns, cred->euid));
191 seq_put_decimal_ull(m, "\t", from_kuid_munged(user_ns, cred->suid));
192 seq_put_decimal_ull(m, "\t", from_kuid_munged(user_ns, cred->fsuid));
193 seq_put_decimal_ull(m, "\nGid:\t", from_kgid_munged(user_ns, cred->gid));
194 seq_put_decimal_ull(m, "\t", from_kgid_munged(user_ns, cred->egid));
195 seq_put_decimal_ull(m, "\t", from_kgid_munged(user_ns, cred->sgid));
196 seq_put_decimal_ull(m, "\t", from_kgid_munged(user_ns, cred->fsgid));
197 seq_put_decimal_ull(m, "\nFDSize:\t", max_fds);
198
199 seq_puts(m, "\nGroups:\t");
200 group_info = cred->group_info;
201 for (g = 0; g < group_info->ngroups; g++)
202 seq_put_decimal_ull(m, g ? " " : "",
203 from_kgid_munged(user_ns, group_info->gid[g]));
204 put_cred(cred);
205 /* Trailing space shouldn't have been added in the first place. */
206 seq_putc(m, ' ');
207
208#ifdef CONFIG_PID_NS
209 seq_puts(m, "\nNStgid:");
210 for (g = ns->level; g <= pid->level; g++)
211 seq_put_decimal_ull(m, "\t", task_tgid_nr_ns(p, pid->numbers[g].ns));
212 seq_puts(m, "\nNSpid:");
213 for (g = ns->level; g <= pid->level; g++)
214 seq_put_decimal_ull(m, "\t", task_pid_nr_ns(p, pid->numbers[g].ns));
215 seq_puts(m, "\nNSpgid:");
216 for (g = ns->level; g <= pid->level; g++)
217 seq_put_decimal_ull(m, "\t", task_pgrp_nr_ns(p, pid->numbers[g].ns));
218 seq_puts(m, "\nNSsid:");
219 for (g = ns->level; g <= pid->level; g++)
220 seq_put_decimal_ull(m, "\t", task_session_nr_ns(p, pid->numbers[g].ns));
221#endif
222 seq_putc(m, '\n');
223
224 seq_printf(m, "Kthread:\t%c\n", p->flags & PF_KTHREAD ? '1' : '0');
225}
226
227void render_sigset_t(struct seq_file *m, const char *header,
228 sigset_t *set)
229{
230 int i;
231
232 seq_puts(m, header);
233
234 i = _NSIG;
235 do {
236 int x = 0;
237
238 i -= 4;
239 if (sigismember(set, i+1)) x |= 1;
240 if (sigismember(set, i+2)) x |= 2;
241 if (sigismember(set, i+3)) x |= 4;
242 if (sigismember(set, i+4)) x |= 8;
243 seq_putc(m, hex_asc[x]);
244 } while (i >= 4);
245
246 seq_putc(m, '\n');
247}
248
249static void collect_sigign_sigcatch(struct task_struct *p, sigset_t *sigign,
250 sigset_t *sigcatch)
251{
252 struct k_sigaction *k;
253 int i;
254
255 k = p->sighand->action;
256 for (i = 1; i <= _NSIG; ++i, ++k) {
257 if (k->sa.sa_handler == SIG_IGN)
258 sigaddset(sigign, i);
259 else if (k->sa.sa_handler != SIG_DFL)
260 sigaddset(sigcatch, i);
261 }
262}
263
264static inline void task_sig(struct seq_file *m, struct task_struct *p)
265{
266 unsigned long flags;
267 sigset_t pending, shpending, blocked, ignored, caught;
268 int num_threads = 0;
269 unsigned int qsize = 0;
270 unsigned long qlim = 0;
271
272 sigemptyset(&pending);
273 sigemptyset(&shpending);
274 sigemptyset(&blocked);
275 sigemptyset(&ignored);
276 sigemptyset(&caught);
277
278 if (lock_task_sighand(p, &flags)) {
279 pending = p->pending.signal;
280 shpending = p->signal->shared_pending.signal;
281 blocked = p->blocked;
282 collect_sigign_sigcatch(p, &ignored, &caught);
283 num_threads = get_nr_threads(p);
284 rcu_read_lock(); /* FIXME: is this correct? */
285 qsize = get_rlimit_value(task_ucounts(p), UCOUNT_RLIMIT_SIGPENDING);
286 rcu_read_unlock();
287 qlim = task_rlimit(p, RLIMIT_SIGPENDING);
288 unlock_task_sighand(p, &flags);
289 }
290
291 seq_put_decimal_ull(m, "Threads:\t", num_threads);
292 seq_put_decimal_ull(m, "\nSigQ:\t", qsize);
293 seq_put_decimal_ull(m, "/", qlim);
294
295 /* render them all */
296 render_sigset_t(m, "\nSigPnd:\t", &pending);
297 render_sigset_t(m, "ShdPnd:\t", &shpending);
298 render_sigset_t(m, "SigBlk:\t", &blocked);
299 render_sigset_t(m, "SigIgn:\t", &ignored);
300 render_sigset_t(m, "SigCgt:\t", &caught);
301}
302
303static void render_cap_t(struct seq_file *m, const char *header,
304 kernel_cap_t *a)
305{
306 seq_puts(m, header);
307 seq_put_hex_ll(m, NULL, a->val, 16);
308 seq_putc(m, '\n');
309}
310
311static inline void task_cap(struct seq_file *m, struct task_struct *p)
312{
313 const struct cred *cred;
314 kernel_cap_t cap_inheritable, cap_permitted, cap_effective,
315 cap_bset, cap_ambient;
316
317 rcu_read_lock();
318 cred = __task_cred(p);
319 cap_inheritable = cred->cap_inheritable;
320 cap_permitted = cred->cap_permitted;
321 cap_effective = cred->cap_effective;
322 cap_bset = cred->cap_bset;
323 cap_ambient = cred->cap_ambient;
324 rcu_read_unlock();
325
326 render_cap_t(m, "CapInh:\t", &cap_inheritable);
327 render_cap_t(m, "CapPrm:\t", &cap_permitted);
328 render_cap_t(m, "CapEff:\t", &cap_effective);
329 render_cap_t(m, "CapBnd:\t", &cap_bset);
330 render_cap_t(m, "CapAmb:\t", &cap_ambient);
331}
332
333static inline void task_seccomp(struct seq_file *m, struct task_struct *p)
334{
335 seq_put_decimal_ull(m, "NoNewPrivs:\t", task_no_new_privs(p));
336#ifdef CONFIG_SECCOMP
337 seq_put_decimal_ull(m, "\nSeccomp:\t", p->seccomp.mode);
338#ifdef CONFIG_SECCOMP_FILTER
339 seq_put_decimal_ull(m, "\nSeccomp_filters:\t",
340 atomic_read(&p->seccomp.filter_count));
341#endif
342#endif
343 seq_puts(m, "\nSpeculation_Store_Bypass:\t");
344 switch (arch_prctl_spec_ctrl_get(p, PR_SPEC_STORE_BYPASS)) {
345 case -EINVAL:
346 seq_puts(m, "unknown");
347 break;
348 case PR_SPEC_NOT_AFFECTED:
349 seq_puts(m, "not vulnerable");
350 break;
351 case PR_SPEC_PRCTL | PR_SPEC_FORCE_DISABLE:
352 seq_puts(m, "thread force mitigated");
353 break;
354 case PR_SPEC_PRCTL | PR_SPEC_DISABLE:
355 seq_puts(m, "thread mitigated");
356 break;
357 case PR_SPEC_PRCTL | PR_SPEC_ENABLE:
358 seq_puts(m, "thread vulnerable");
359 break;
360 case PR_SPEC_DISABLE:
361 seq_puts(m, "globally mitigated");
362 break;
363 default:
364 seq_puts(m, "vulnerable");
365 break;
366 }
367
368 seq_puts(m, "\nSpeculationIndirectBranch:\t");
369 switch (arch_prctl_spec_ctrl_get(p, PR_SPEC_INDIRECT_BRANCH)) {
370 case -EINVAL:
371 seq_puts(m, "unsupported");
372 break;
373 case PR_SPEC_NOT_AFFECTED:
374 seq_puts(m, "not affected");
375 break;
376 case PR_SPEC_PRCTL | PR_SPEC_FORCE_DISABLE:
377 seq_puts(m, "conditional force disabled");
378 break;
379 case PR_SPEC_PRCTL | PR_SPEC_DISABLE:
380 seq_puts(m, "conditional disabled");
381 break;
382 case PR_SPEC_PRCTL | PR_SPEC_ENABLE:
383 seq_puts(m, "conditional enabled");
384 break;
385 case PR_SPEC_ENABLE:
386 seq_puts(m, "always enabled");
387 break;
388 case PR_SPEC_DISABLE:
389 seq_puts(m, "always disabled");
390 break;
391 default:
392 seq_puts(m, "unknown");
393 break;
394 }
395 seq_putc(m, '\n');
396}
397
398static inline void task_context_switch_counts(struct seq_file *m,
399 struct task_struct *p)
400{
401 seq_put_decimal_ull(m, "voluntary_ctxt_switches:\t", p->nvcsw);
402 seq_put_decimal_ull(m, "\nnonvoluntary_ctxt_switches:\t", p->nivcsw);
403 seq_putc(m, '\n');
404}
405
406static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
407{
408 seq_printf(m, "Cpus_allowed:\t%*pb\n",
409 cpumask_pr_args(&task->cpus_mask));
410 seq_printf(m, "Cpus_allowed_list:\t%*pbl\n",
411 cpumask_pr_args(&task->cpus_mask));
412}
413
414static inline void task_core_dumping(struct seq_file *m, struct task_struct *task)
415{
416 seq_put_decimal_ull(m, "CoreDumping:\t", !!task->signal->core_state);
417 seq_putc(m, '\n');
418}
419
420static inline void task_thp_status(struct seq_file *m, struct mm_struct *mm)
421{
422 bool thp_enabled = IS_ENABLED(CONFIG_TRANSPARENT_HUGEPAGE);
423
424 if (thp_enabled)
425 thp_enabled = !test_bit(MMF_DISABLE_THP, &mm->flags);
426 seq_printf(m, "THP_enabled:\t%d\n", thp_enabled);
427}
428
429static inline void task_untag_mask(struct seq_file *m, struct mm_struct *mm)
430{
431 seq_printf(m, "untag_mask:\t%#lx\n", mm_untag_mask(mm));
432}
433
434__weak void arch_proc_pid_thread_features(struct seq_file *m,
435 struct task_struct *task)
436{
437}
438
439int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
440 struct pid *pid, struct task_struct *task)
441{
442 struct mm_struct *mm = get_task_mm(task);
443
444 seq_puts(m, "Name:\t");
445 proc_task_name(m, task, true);
446 seq_putc(m, '\n');
447
448 task_state(m, ns, pid, task);
449
450 if (mm) {
451 task_mem(m, mm);
452 task_core_dumping(m, task);
453 task_thp_status(m, mm);
454 task_untag_mask(m, mm);
455 mmput(mm);
456 }
457 task_sig(m, task);
458 task_cap(m, task);
459 task_seccomp(m, task);
460 task_cpus_allowed(m, task);
461 cpuset_task_status_allowed(m, task);
462 task_context_switch_counts(m, task);
463 arch_proc_pid_thread_features(m, task);
464 return 0;
465}
466
467static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
468 struct pid *pid, struct task_struct *task, int whole)
469{
470 unsigned long vsize, eip, esp, wchan = 0;
471 int priority, nice;
472 int tty_pgrp = -1, tty_nr = 0;
473 sigset_t sigign, sigcatch;
474 char state;
475 pid_t ppid = 0, pgid = -1, sid = -1;
476 int num_threads = 0;
477 int permitted;
478 struct mm_struct *mm;
479 unsigned long long start_time;
480 unsigned long cmin_flt, cmaj_flt, min_flt, maj_flt;
481 u64 cutime, cstime, cgtime, utime, stime, gtime;
482 unsigned long rsslim = 0;
483 unsigned long flags;
484 int exit_code = task->exit_code;
485 struct signal_struct *sig = task->signal;
486 unsigned int seq = 1;
487
488 state = *get_task_state(task);
489 vsize = eip = esp = 0;
490 permitted = ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS | PTRACE_MODE_NOAUDIT);
491 mm = get_task_mm(task);
492 if (mm) {
493 vsize = task_vsize(mm);
494 /*
495 * esp and eip are intentionally zeroed out. There is no
496 * non-racy way to read them without freezing the task.
497 * Programs that need reliable values can use ptrace(2).
498 *
499 * The only exception is if the task is core dumping because
500 * a program is not able to use ptrace(2) in that case. It is
501 * safe because the task has stopped executing permanently.
502 */
503 if (permitted && (task->flags & (PF_EXITING|PF_DUMPCORE|PF_POSTCOREDUMP))) {
504 if (try_get_task_stack(task)) {
505 eip = KSTK_EIP(task);
506 esp = KSTK_ESP(task);
507 put_task_stack(task);
508 }
509 }
510 }
511
512 sigemptyset(&sigign);
513 sigemptyset(&sigcatch);
514
515 if (lock_task_sighand(task, &flags)) {
516 if (sig->tty) {
517 struct pid *pgrp = tty_get_pgrp(sig->tty);
518 tty_pgrp = pid_nr_ns(pgrp, ns);
519 put_pid(pgrp);
520 tty_nr = new_encode_dev(tty_devnum(sig->tty));
521 }
522
523 num_threads = get_nr_threads(task);
524 collect_sigign_sigcatch(task, &sigign, &sigcatch);
525
526 rsslim = READ_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
527
528 if (whole) {
529 if (sig->flags & (SIGNAL_GROUP_EXIT | SIGNAL_STOP_STOPPED))
530 exit_code = sig->group_exit_code;
531 }
532
533 sid = task_session_nr_ns(task, ns);
534 ppid = task_tgid_nr_ns(task->real_parent, ns);
535 pgid = task_pgrp_nr_ns(task, ns);
536
537 unlock_task_sighand(task, &flags);
538 }
539
540 if (permitted && (!whole || num_threads < 2))
541 wchan = !task_is_running(task);
542
543 do {
544 seq++; /* 2 on the 1st/lockless path, otherwise odd */
545 flags = read_seqbegin_or_lock_irqsave(&sig->stats_lock, &seq);
546
547 cmin_flt = sig->cmin_flt;
548 cmaj_flt = sig->cmaj_flt;
549 cutime = sig->cutime;
550 cstime = sig->cstime;
551 cgtime = sig->cgtime;
552
553 if (whole) {
554 struct task_struct *t;
555
556 min_flt = sig->min_flt;
557 maj_flt = sig->maj_flt;
558 gtime = sig->gtime;
559
560 rcu_read_lock();
561 __for_each_thread(sig, t) {
562 min_flt += t->min_flt;
563 maj_flt += t->maj_flt;
564 gtime += task_gtime(t);
565 }
566 rcu_read_unlock();
567 }
568 } while (need_seqretry(&sig->stats_lock, seq));
569 done_seqretry_irqrestore(&sig->stats_lock, seq, flags);
570
571 if (whole) {
572 thread_group_cputime_adjusted(task, &utime, &stime);
573 } else {
574 task_cputime_adjusted(task, &utime, &stime);
575 min_flt = task->min_flt;
576 maj_flt = task->maj_flt;
577 gtime = task_gtime(task);
578 }
579
580 /* scale priority and nice values from timeslices to -20..20 */
581 /* to make it look like a "normal" Unix priority/nice value */
582 priority = task_prio(task);
583 nice = task_nice(task);
584
585 /* apply timens offset for boottime and convert nsec -> ticks */
586 start_time =
587 nsec_to_clock_t(timens_add_boottime_ns(task->start_boottime));
588
589 seq_put_decimal_ull(m, "", pid_nr_ns(pid, ns));
590 seq_puts(m, " (");
591 proc_task_name(m, task, false);
592 seq_puts(m, ") ");
593 seq_putc(m, state);
594 seq_put_decimal_ll(m, " ", ppid);
595 seq_put_decimal_ll(m, " ", pgid);
596 seq_put_decimal_ll(m, " ", sid);
597 seq_put_decimal_ll(m, " ", tty_nr);
598 seq_put_decimal_ll(m, " ", tty_pgrp);
599 seq_put_decimal_ull(m, " ", task->flags);
600 seq_put_decimal_ull(m, " ", min_flt);
601 seq_put_decimal_ull(m, " ", cmin_flt);
602 seq_put_decimal_ull(m, " ", maj_flt);
603 seq_put_decimal_ull(m, " ", cmaj_flt);
604 seq_put_decimal_ull(m, " ", nsec_to_clock_t(utime));
605 seq_put_decimal_ull(m, " ", nsec_to_clock_t(stime));
606 seq_put_decimal_ll(m, " ", nsec_to_clock_t(cutime));
607 seq_put_decimal_ll(m, " ", nsec_to_clock_t(cstime));
608 seq_put_decimal_ll(m, " ", priority);
609 seq_put_decimal_ll(m, " ", nice);
610 seq_put_decimal_ll(m, " ", num_threads);
611 seq_put_decimal_ull(m, " ", 0);
612 seq_put_decimal_ull(m, " ", start_time);
613 seq_put_decimal_ull(m, " ", vsize);
614 seq_put_decimal_ull(m, " ", mm ? get_mm_rss(mm) : 0);
615 seq_put_decimal_ull(m, " ", rsslim);
616 seq_put_decimal_ull(m, " ", mm ? (permitted ? mm->start_code : 1) : 0);
617 seq_put_decimal_ull(m, " ", mm ? (permitted ? mm->end_code : 1) : 0);
618 seq_put_decimal_ull(m, " ", (permitted && mm) ? mm->start_stack : 0);
619 seq_put_decimal_ull(m, " ", esp);
620 seq_put_decimal_ull(m, " ", eip);
621 /* The signal information here is obsolete.
622 * It must be decimal for Linux 2.0 compatibility.
623 * Use /proc/#/status for real-time signals.
624 */
625 seq_put_decimal_ull(m, " ", task->pending.signal.sig[0] & 0x7fffffffUL);
626 seq_put_decimal_ull(m, " ", task->blocked.sig[0] & 0x7fffffffUL);
627 seq_put_decimal_ull(m, " ", sigign.sig[0] & 0x7fffffffUL);
628 seq_put_decimal_ull(m, " ", sigcatch.sig[0] & 0x7fffffffUL);
629
630 /*
631 * We used to output the absolute kernel address, but that's an
632 * information leak - so instead we show a 0/1 flag here, to signal
633 * to user-space whether there's a wchan field in /proc/PID/wchan.
634 *
635 * This works with older implementations of procps as well.
636 */
637 seq_put_decimal_ull(m, " ", wchan);
638
639 seq_put_decimal_ull(m, " ", 0);
640 seq_put_decimal_ull(m, " ", 0);
641 seq_put_decimal_ll(m, " ", task->exit_signal);
642 seq_put_decimal_ll(m, " ", task_cpu(task));
643 seq_put_decimal_ull(m, " ", task->rt_priority);
644 seq_put_decimal_ull(m, " ", task->policy);
645 seq_put_decimal_ull(m, " ", delayacct_blkio_ticks(task));
646 seq_put_decimal_ull(m, " ", nsec_to_clock_t(gtime));
647 seq_put_decimal_ll(m, " ", nsec_to_clock_t(cgtime));
648
649 if (mm && permitted) {
650 seq_put_decimal_ull(m, " ", mm->start_data);
651 seq_put_decimal_ull(m, " ", mm->end_data);
652 seq_put_decimal_ull(m, " ", mm->start_brk);
653 seq_put_decimal_ull(m, " ", mm->arg_start);
654 seq_put_decimal_ull(m, " ", mm->arg_end);
655 seq_put_decimal_ull(m, " ", mm->env_start);
656 seq_put_decimal_ull(m, " ", mm->env_end);
657 } else
658 seq_puts(m, " 0 0 0 0 0 0 0");
659
660 if (permitted)
661 seq_put_decimal_ll(m, " ", exit_code);
662 else
663 seq_puts(m, " 0");
664
665 seq_putc(m, '\n');
666 if (mm)
667 mmput(mm);
668 return 0;
669}
670
671int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
672 struct pid *pid, struct task_struct *task)
673{
674 return do_task_stat(m, ns, pid, task, 0);
675}
676
677int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
678 struct pid *pid, struct task_struct *task)
679{
680 return do_task_stat(m, ns, pid, task, 1);
681}
682
683int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
684 struct pid *pid, struct task_struct *task)
685{
686 struct mm_struct *mm = get_task_mm(task);
687
688 if (mm) {
689 unsigned long size;
690 unsigned long resident = 0;
691 unsigned long shared = 0;
692 unsigned long text = 0;
693 unsigned long data = 0;
694
695 size = task_statm(mm, &shared, &text, &data, &resident);
696 mmput(mm);
697
698 /*
699 * For quick read, open code by putting numbers directly
700 * expected format is
701 * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
702 * size, resident, shared, text, data);
703 */
704 seq_put_decimal_ull(m, "", size);
705 seq_put_decimal_ull(m, " ", resident);
706 seq_put_decimal_ull(m, " ", shared);
707 seq_put_decimal_ull(m, " ", text);
708 seq_put_decimal_ull(m, " ", 0);
709 seq_put_decimal_ull(m, " ", data);
710 seq_put_decimal_ull(m, " ", 0);
711 seq_putc(m, '\n');
712 } else {
713 seq_write(m, "0 0 0 0 0 0 0\n", 14);
714 }
715 return 0;
716}
717
718#ifdef CONFIG_PROC_CHILDREN
719static struct pid *
720get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
721{
722 struct task_struct *start, *task;
723 struct pid *pid = NULL;
724
725 read_lock(&tasklist_lock);
726
727 start = pid_task(proc_pid(inode), PIDTYPE_PID);
728 if (!start)
729 goto out;
730
731 /*
732 * Lets try to continue searching first, this gives
733 * us significant speedup on children-rich processes.
734 */
735 if (pid_prev) {
736 task = pid_task(pid_prev, PIDTYPE_PID);
737 if (task && task->real_parent == start &&
738 !(list_empty(&task->sibling))) {
739 if (list_is_last(&task->sibling, &start->children))
740 goto out;
741 task = list_first_entry(&task->sibling,
742 struct task_struct, sibling);
743 pid = get_pid(task_pid(task));
744 goto out;
745 }
746 }
747
748 /*
749 * Slow search case.
750 *
751 * We might miss some children here if children
752 * are exited while we were not holding the lock,
753 * but it was never promised to be accurate that
754 * much.
755 *
756 * "Just suppose that the parent sleeps, but N children
757 * exit after we printed their tids. Now the slow paths
758 * skips N extra children, we miss N tasks." (c)
759 *
760 * So one need to stop or freeze the leader and all
761 * its children to get a precise result.
762 */
763 list_for_each_entry(task, &start->children, sibling) {
764 if (pos-- == 0) {
765 pid = get_pid(task_pid(task));
766 break;
767 }
768 }
769
770out:
771 read_unlock(&tasklist_lock);
772 return pid;
773}
774
775static int children_seq_show(struct seq_file *seq, void *v)
776{
777 struct inode *inode = file_inode(seq->file);
778
779 seq_printf(seq, "%d ", pid_nr_ns(v, proc_pid_ns(inode->i_sb)));
780 return 0;
781}
782
783static void *children_seq_start(struct seq_file *seq, loff_t *pos)
784{
785 return get_children_pid(file_inode(seq->file), NULL, *pos);
786}
787
788static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
789{
790 struct pid *pid;
791
792 pid = get_children_pid(file_inode(seq->file), v, *pos + 1);
793 put_pid(v);
794
795 ++*pos;
796 return pid;
797}
798
799static void children_seq_stop(struct seq_file *seq, void *v)
800{
801 put_pid(v);
802}
803
804static const struct seq_operations children_seq_ops = {
805 .start = children_seq_start,
806 .next = children_seq_next,
807 .stop = children_seq_stop,
808 .show = children_seq_show,
809};
810
811static int children_seq_open(struct inode *inode, struct file *file)
812{
813 return seq_open(file, &children_seq_ops);
814}
815
816const struct file_operations proc_tid_children_operations = {
817 .open = children_seq_open,
818 .read = seq_read,
819 .llseek = seq_lseek,
820 .release = seq_release,
821};
822#endif /* CONFIG_PROC_CHILDREN */