Loading...
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 */
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/user_namespace.h>
85
86#include <asm/pgtable.h>
87#include <asm/processor.h>
88#include "internal.h"
89
90static inline void task_name(struct seq_file *m, struct task_struct *p)
91{
92 int i;
93 char *buf, *end;
94 char *name;
95 char tcomm[sizeof(p->comm)];
96
97 get_task_comm(tcomm, p);
98
99 seq_puts(m, "Name:\t");
100 end = m->buf + m->size;
101 buf = m->buf + m->count;
102 name = tcomm;
103 i = sizeof(tcomm);
104 while (i && (buf < end)) {
105 unsigned char c = *name;
106 name++;
107 i--;
108 *buf = c;
109 if (!c)
110 break;
111 if (c == '\\') {
112 buf++;
113 if (buf < end)
114 *buf++ = c;
115 continue;
116 }
117 if (c == '\n') {
118 *buf++ = '\\';
119 if (buf < end)
120 *buf++ = 'n';
121 continue;
122 }
123 buf++;
124 }
125 m->count = buf - m->buf;
126 seq_putc(m, '\n');
127}
128
129/*
130 * The task state array is a strange "bitmap" of
131 * reasons to sleep. Thus "running" is zero, and
132 * you can test for combinations of others with
133 * simple bit tests.
134 */
135static const char * const task_state_array[] = {
136 "R (running)", /* 0 */
137 "S (sleeping)", /* 1 */
138 "D (disk sleep)", /* 2 */
139 "T (stopped)", /* 4 */
140 "t (tracing stop)", /* 8 */
141 "X (dead)", /* 16 */
142 "Z (zombie)", /* 32 */
143};
144
145static inline const char *get_task_state(struct task_struct *tsk)
146{
147 unsigned int state = (tsk->state | tsk->exit_state) & TASK_REPORT;
148
149 BUILD_BUG_ON(1 + ilog2(TASK_REPORT) != ARRAY_SIZE(task_state_array)-1);
150
151 return task_state_array[fls(state)];
152}
153
154static inline void task_state(struct seq_file *m, struct pid_namespace *ns,
155 struct pid *pid, struct task_struct *p)
156{
157 struct user_namespace *user_ns = seq_user_ns(m);
158 struct group_info *group_info;
159 int g;
160 struct fdtable *fdt = NULL;
161 const struct cred *cred;
162 pid_t ppid, tpid;
163
164 rcu_read_lock();
165 ppid = pid_alive(p) ?
166 task_tgid_nr_ns(rcu_dereference(p->real_parent), ns) : 0;
167 tpid = 0;
168 if (pid_alive(p)) {
169 struct task_struct *tracer = ptrace_parent(p);
170 if (tracer)
171 tpid = task_pid_nr_ns(tracer, ns);
172 }
173 cred = get_task_cred(p);
174 seq_printf(m,
175 "State:\t%s\n"
176 "Tgid:\t%d\n"
177 "Ngid:\t%d\n"
178 "Pid:\t%d\n"
179 "PPid:\t%d\n"
180 "TracerPid:\t%d\n"
181 "Uid:\t%d\t%d\t%d\t%d\n"
182 "Gid:\t%d\t%d\t%d\t%d\n",
183 get_task_state(p),
184 task_tgid_nr_ns(p, ns),
185 task_numa_group_id(p),
186 pid_nr_ns(pid, ns),
187 ppid, tpid,
188 from_kuid_munged(user_ns, cred->uid),
189 from_kuid_munged(user_ns, cred->euid),
190 from_kuid_munged(user_ns, cred->suid),
191 from_kuid_munged(user_ns, cred->fsuid),
192 from_kgid_munged(user_ns, cred->gid),
193 from_kgid_munged(user_ns, cred->egid),
194 from_kgid_munged(user_ns, cred->sgid),
195 from_kgid_munged(user_ns, cred->fsgid));
196
197 task_lock(p);
198 if (p->files)
199 fdt = files_fdtable(p->files);
200 seq_printf(m,
201 "FDSize:\t%d\n"
202 "Groups:\t",
203 fdt ? fdt->max_fds : 0);
204 rcu_read_unlock();
205
206 group_info = cred->group_info;
207 task_unlock(p);
208
209 for (g = 0; g < group_info->ngroups; g++)
210 seq_printf(m, "%d ",
211 from_kgid_munged(user_ns, GROUP_AT(group_info, g)));
212 put_cred(cred);
213
214 seq_putc(m, '\n');
215}
216
217void render_sigset_t(struct seq_file *m, const char *header,
218 sigset_t *set)
219{
220 int i;
221
222 seq_puts(m, header);
223
224 i = _NSIG;
225 do {
226 int x = 0;
227
228 i -= 4;
229 if (sigismember(set, i+1)) x |= 1;
230 if (sigismember(set, i+2)) x |= 2;
231 if (sigismember(set, i+3)) x |= 4;
232 if (sigismember(set, i+4)) x |= 8;
233 seq_printf(m, "%x", x);
234 } while (i >= 4);
235
236 seq_putc(m, '\n');
237}
238
239static void collect_sigign_sigcatch(struct task_struct *p, sigset_t *ign,
240 sigset_t *catch)
241{
242 struct k_sigaction *k;
243 int i;
244
245 k = p->sighand->action;
246 for (i = 1; i <= _NSIG; ++i, ++k) {
247 if (k->sa.sa_handler == SIG_IGN)
248 sigaddset(ign, i);
249 else if (k->sa.sa_handler != SIG_DFL)
250 sigaddset(catch, i);
251 }
252}
253
254static inline void task_sig(struct seq_file *m, struct task_struct *p)
255{
256 unsigned long flags;
257 sigset_t pending, shpending, blocked, ignored, caught;
258 int num_threads = 0;
259 unsigned long qsize = 0;
260 unsigned long qlim = 0;
261
262 sigemptyset(&pending);
263 sigemptyset(&shpending);
264 sigemptyset(&blocked);
265 sigemptyset(&ignored);
266 sigemptyset(&caught);
267
268 if (lock_task_sighand(p, &flags)) {
269 pending = p->pending.signal;
270 shpending = p->signal->shared_pending.signal;
271 blocked = p->blocked;
272 collect_sigign_sigcatch(p, &ignored, &caught);
273 num_threads = get_nr_threads(p);
274 rcu_read_lock(); /* FIXME: is this correct? */
275 qsize = atomic_read(&__task_cred(p)->user->sigpending);
276 rcu_read_unlock();
277 qlim = task_rlimit(p, RLIMIT_SIGPENDING);
278 unlock_task_sighand(p, &flags);
279 }
280
281 seq_printf(m, "Threads:\t%d\n", num_threads);
282 seq_printf(m, "SigQ:\t%lu/%lu\n", qsize, qlim);
283
284 /* render them all */
285 render_sigset_t(m, "SigPnd:\t", &pending);
286 render_sigset_t(m, "ShdPnd:\t", &shpending);
287 render_sigset_t(m, "SigBlk:\t", &blocked);
288 render_sigset_t(m, "SigIgn:\t", &ignored);
289 render_sigset_t(m, "SigCgt:\t", &caught);
290}
291
292static void render_cap_t(struct seq_file *m, const char *header,
293 kernel_cap_t *a)
294{
295 unsigned __capi;
296
297 seq_puts(m, header);
298 CAP_FOR_EACH_U32(__capi) {
299 seq_printf(m, "%08x",
300 a->cap[(_KERNEL_CAPABILITY_U32S-1) - __capi]);
301 }
302 seq_putc(m, '\n');
303}
304
305/* Remove non-existent capabilities */
306#define NORM_CAPS(v) (v.cap[CAP_TO_INDEX(CAP_LAST_CAP)] &= \
307 CAP_TO_MASK(CAP_LAST_CAP + 1) - 1)
308
309static inline void task_cap(struct seq_file *m, struct task_struct *p)
310{
311 const struct cred *cred;
312 kernel_cap_t cap_inheritable, cap_permitted, cap_effective, cap_bset;
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 rcu_read_unlock();
321
322 NORM_CAPS(cap_inheritable);
323 NORM_CAPS(cap_permitted);
324 NORM_CAPS(cap_effective);
325 NORM_CAPS(cap_bset);
326
327 render_cap_t(m, "CapInh:\t", &cap_inheritable);
328 render_cap_t(m, "CapPrm:\t", &cap_permitted);
329 render_cap_t(m, "CapEff:\t", &cap_effective);
330 render_cap_t(m, "CapBnd:\t", &cap_bset);
331}
332
333static inline void task_seccomp(struct seq_file *m, struct task_struct *p)
334{
335#ifdef CONFIG_SECCOMP
336 seq_printf(m, "Seccomp:\t%d\n", p->seccomp.mode);
337#endif
338}
339
340static inline void task_context_switch_counts(struct seq_file *m,
341 struct task_struct *p)
342{
343 seq_printf(m, "voluntary_ctxt_switches:\t%lu\n"
344 "nonvoluntary_ctxt_switches:\t%lu\n",
345 p->nvcsw,
346 p->nivcsw);
347}
348
349static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
350{
351 seq_puts(m, "Cpus_allowed:\t");
352 seq_cpumask(m, &task->cpus_allowed);
353 seq_putc(m, '\n');
354 seq_puts(m, "Cpus_allowed_list:\t");
355 seq_cpumask_list(m, &task->cpus_allowed);
356 seq_putc(m, '\n');
357}
358
359int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
360 struct pid *pid, struct task_struct *task)
361{
362 struct mm_struct *mm = get_task_mm(task);
363
364 task_name(m, task);
365 task_state(m, ns, pid, task);
366
367 if (mm) {
368 task_mem(m, mm);
369 mmput(mm);
370 }
371 task_sig(m, task);
372 task_cap(m, task);
373 task_seccomp(m, task);
374 task_cpus_allowed(m, task);
375 cpuset_task_status_allowed(m, task);
376 task_context_switch_counts(m, task);
377 return 0;
378}
379
380static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
381 struct pid *pid, struct task_struct *task, int whole)
382{
383 unsigned long vsize, eip, esp, wchan = ~0UL;
384 int priority, nice;
385 int tty_pgrp = -1, tty_nr = 0;
386 sigset_t sigign, sigcatch;
387 char state;
388 pid_t ppid = 0, pgid = -1, sid = -1;
389 int num_threads = 0;
390 int permitted;
391 struct mm_struct *mm;
392 unsigned long long start_time;
393 unsigned long cmin_flt = 0, cmaj_flt = 0;
394 unsigned long min_flt = 0, maj_flt = 0;
395 cputime_t cutime, cstime, utime, stime;
396 cputime_t cgtime, gtime;
397 unsigned long rsslim = 0;
398 char tcomm[sizeof(task->comm)];
399 unsigned long flags;
400
401 state = *get_task_state(task);
402 vsize = eip = esp = 0;
403 permitted = ptrace_may_access(task, PTRACE_MODE_READ | PTRACE_MODE_NOAUDIT);
404 mm = get_task_mm(task);
405 if (mm) {
406 vsize = task_vsize(mm);
407 if (permitted) {
408 eip = KSTK_EIP(task);
409 esp = KSTK_ESP(task);
410 }
411 }
412
413 get_task_comm(tcomm, task);
414
415 sigemptyset(&sigign);
416 sigemptyset(&sigcatch);
417 cutime = cstime = utime = stime = 0;
418 cgtime = gtime = 0;
419
420 if (lock_task_sighand(task, &flags)) {
421 struct signal_struct *sig = task->signal;
422
423 if (sig->tty) {
424 struct pid *pgrp = tty_get_pgrp(sig->tty);
425 tty_pgrp = pid_nr_ns(pgrp, ns);
426 put_pid(pgrp);
427 tty_nr = new_encode_dev(tty_devnum(sig->tty));
428 }
429
430 num_threads = get_nr_threads(task);
431 collect_sigign_sigcatch(task, &sigign, &sigcatch);
432
433 cmin_flt = sig->cmin_flt;
434 cmaj_flt = sig->cmaj_flt;
435 cutime = sig->cutime;
436 cstime = sig->cstime;
437 cgtime = sig->cgtime;
438 rsslim = ACCESS_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
439
440 /* add up live thread stats at the group level */
441 if (whole) {
442 struct task_struct *t = task;
443 do {
444 min_flt += t->min_flt;
445 maj_flt += t->maj_flt;
446 gtime += task_gtime(t);
447 } while_each_thread(task, t);
448
449 min_flt += sig->min_flt;
450 maj_flt += sig->maj_flt;
451 thread_group_cputime_adjusted(task, &utime, &stime);
452 gtime += sig->gtime;
453 }
454
455 sid = task_session_nr_ns(task, ns);
456 ppid = task_tgid_nr_ns(task->real_parent, ns);
457 pgid = task_pgrp_nr_ns(task, ns);
458
459 unlock_task_sighand(task, &flags);
460 }
461
462 if (permitted && (!whole || num_threads < 2))
463 wchan = get_wchan(task);
464 if (!whole) {
465 min_flt = task->min_flt;
466 maj_flt = task->maj_flt;
467 task_cputime_adjusted(task, &utime, &stime);
468 gtime = task_gtime(task);
469 }
470
471 /* scale priority and nice values from timeslices to -20..20 */
472 /* to make it look like a "normal" Unix priority/nice value */
473 priority = task_prio(task);
474 nice = task_nice(task);
475
476 /* Temporary variable needed for gcc-2.96 */
477 /* convert timespec -> nsec*/
478 start_time =
479 (unsigned long long)task->real_start_time.tv_sec * NSEC_PER_SEC
480 + task->real_start_time.tv_nsec;
481 /* convert nsec -> ticks */
482 start_time = nsec_to_clock_t(start_time);
483
484 seq_printf(m, "%d (%s) %c", pid_nr_ns(pid, ns), tcomm, state);
485 seq_put_decimal_ll(m, ' ', ppid);
486 seq_put_decimal_ll(m, ' ', pgid);
487 seq_put_decimal_ll(m, ' ', sid);
488 seq_put_decimal_ll(m, ' ', tty_nr);
489 seq_put_decimal_ll(m, ' ', tty_pgrp);
490 seq_put_decimal_ull(m, ' ', task->flags);
491 seq_put_decimal_ull(m, ' ', min_flt);
492 seq_put_decimal_ull(m, ' ', cmin_flt);
493 seq_put_decimal_ull(m, ' ', maj_flt);
494 seq_put_decimal_ull(m, ' ', cmaj_flt);
495 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(utime));
496 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(stime));
497 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cutime));
498 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cstime));
499 seq_put_decimal_ll(m, ' ', priority);
500 seq_put_decimal_ll(m, ' ', nice);
501 seq_put_decimal_ll(m, ' ', num_threads);
502 seq_put_decimal_ull(m, ' ', 0);
503 seq_put_decimal_ull(m, ' ', start_time);
504 seq_put_decimal_ull(m, ' ', vsize);
505 seq_put_decimal_ull(m, ' ', mm ? get_mm_rss(mm) : 0);
506 seq_put_decimal_ull(m, ' ', rsslim);
507 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->start_code : 1) : 0);
508 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->end_code : 1) : 0);
509 seq_put_decimal_ull(m, ' ', (permitted && mm) ? mm->start_stack : 0);
510 seq_put_decimal_ull(m, ' ', esp);
511 seq_put_decimal_ull(m, ' ', eip);
512 /* The signal information here is obsolete.
513 * It must be decimal for Linux 2.0 compatibility.
514 * Use /proc/#/status for real-time signals.
515 */
516 seq_put_decimal_ull(m, ' ', task->pending.signal.sig[0] & 0x7fffffffUL);
517 seq_put_decimal_ull(m, ' ', task->blocked.sig[0] & 0x7fffffffUL);
518 seq_put_decimal_ull(m, ' ', sigign.sig[0] & 0x7fffffffUL);
519 seq_put_decimal_ull(m, ' ', sigcatch.sig[0] & 0x7fffffffUL);
520 seq_put_decimal_ull(m, ' ', wchan);
521 seq_put_decimal_ull(m, ' ', 0);
522 seq_put_decimal_ull(m, ' ', 0);
523 seq_put_decimal_ll(m, ' ', task->exit_signal);
524 seq_put_decimal_ll(m, ' ', task_cpu(task));
525 seq_put_decimal_ull(m, ' ', task->rt_priority);
526 seq_put_decimal_ull(m, ' ', task->policy);
527 seq_put_decimal_ull(m, ' ', delayacct_blkio_ticks(task));
528 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(gtime));
529 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cgtime));
530
531 if (mm && permitted) {
532 seq_put_decimal_ull(m, ' ', mm->start_data);
533 seq_put_decimal_ull(m, ' ', mm->end_data);
534 seq_put_decimal_ull(m, ' ', mm->start_brk);
535 seq_put_decimal_ull(m, ' ', mm->arg_start);
536 seq_put_decimal_ull(m, ' ', mm->arg_end);
537 seq_put_decimal_ull(m, ' ', mm->env_start);
538 seq_put_decimal_ull(m, ' ', mm->env_end);
539 } else
540 seq_printf(m, " 0 0 0 0 0 0 0");
541
542 if (permitted)
543 seq_put_decimal_ll(m, ' ', task->exit_code);
544 else
545 seq_put_decimal_ll(m, ' ', 0);
546
547 seq_putc(m, '\n');
548 if (mm)
549 mmput(mm);
550 return 0;
551}
552
553int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
554 struct pid *pid, struct task_struct *task)
555{
556 return do_task_stat(m, ns, pid, task, 0);
557}
558
559int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
560 struct pid *pid, struct task_struct *task)
561{
562 return do_task_stat(m, ns, pid, task, 1);
563}
564
565int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
566 struct pid *pid, struct task_struct *task)
567{
568 unsigned long size = 0, resident = 0, shared = 0, text = 0, data = 0;
569 struct mm_struct *mm = get_task_mm(task);
570
571 if (mm) {
572 size = task_statm(mm, &shared, &text, &data, &resident);
573 mmput(mm);
574 }
575 /*
576 * For quick read, open code by putting numbers directly
577 * expected format is
578 * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
579 * size, resident, shared, text, data);
580 */
581 seq_put_decimal_ull(m, 0, size);
582 seq_put_decimal_ull(m, ' ', resident);
583 seq_put_decimal_ull(m, ' ', shared);
584 seq_put_decimal_ull(m, ' ', text);
585 seq_put_decimal_ull(m, ' ', 0);
586 seq_put_decimal_ull(m, ' ', data);
587 seq_put_decimal_ull(m, ' ', 0);
588 seq_putc(m, '\n');
589
590 return 0;
591}
592
593#ifdef CONFIG_CHECKPOINT_RESTORE
594static struct pid *
595get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
596{
597 struct task_struct *start, *task;
598 struct pid *pid = NULL;
599
600 read_lock(&tasklist_lock);
601
602 start = pid_task(proc_pid(inode), PIDTYPE_PID);
603 if (!start)
604 goto out;
605
606 /*
607 * Lets try to continue searching first, this gives
608 * us significant speedup on children-rich processes.
609 */
610 if (pid_prev) {
611 task = pid_task(pid_prev, PIDTYPE_PID);
612 if (task && task->real_parent == start &&
613 !(list_empty(&task->sibling))) {
614 if (list_is_last(&task->sibling, &start->children))
615 goto out;
616 task = list_first_entry(&task->sibling,
617 struct task_struct, sibling);
618 pid = get_pid(task_pid(task));
619 goto out;
620 }
621 }
622
623 /*
624 * Slow search case.
625 *
626 * We might miss some children here if children
627 * are exited while we were not holding the lock,
628 * but it was never promised to be accurate that
629 * much.
630 *
631 * "Just suppose that the parent sleeps, but N children
632 * exit after we printed their tids. Now the slow paths
633 * skips N extra children, we miss N tasks." (c)
634 *
635 * So one need to stop or freeze the leader and all
636 * its children to get a precise result.
637 */
638 list_for_each_entry(task, &start->children, sibling) {
639 if (pos-- == 0) {
640 pid = get_pid(task_pid(task));
641 break;
642 }
643 }
644
645out:
646 read_unlock(&tasklist_lock);
647 return pid;
648}
649
650static int children_seq_show(struct seq_file *seq, void *v)
651{
652 struct inode *inode = seq->private;
653 pid_t pid;
654
655 pid = pid_nr_ns(v, inode->i_sb->s_fs_info);
656 return seq_printf(seq, "%d ", pid);
657}
658
659static void *children_seq_start(struct seq_file *seq, loff_t *pos)
660{
661 return get_children_pid(seq->private, NULL, *pos);
662}
663
664static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
665{
666 struct pid *pid;
667
668 pid = get_children_pid(seq->private, v, *pos + 1);
669 put_pid(v);
670
671 ++*pos;
672 return pid;
673}
674
675static void children_seq_stop(struct seq_file *seq, void *v)
676{
677 put_pid(v);
678}
679
680static const struct seq_operations children_seq_ops = {
681 .start = children_seq_start,
682 .next = children_seq_next,
683 .stop = children_seq_stop,
684 .show = children_seq_show,
685};
686
687static int children_seq_open(struct inode *inode, struct file *file)
688{
689 struct seq_file *m;
690 int ret;
691
692 ret = seq_open(file, &children_seq_ops);
693 if (ret)
694 return ret;
695
696 m = file->private_data;
697 m->private = inode;
698
699 return ret;
700}
701
702int children_seq_release(struct inode *inode, struct file *file)
703{
704 seq_release(inode, file);
705 return 0;
706}
707
708const struct file_operations proc_tid_children_operations = {
709 .open = children_seq_open,
710 .read = seq_read,
711 .llseek = seq_lseek,
712 .release = children_seq_release,
713};
714#endif /* CONFIG_CHECKPOINT_RESTORE */