]> git.proxmox.com Git - mirror_ubuntu-artful-kernel.git/blame - fs/proc/array.c
exec: kill task_struct->did_exec
[mirror_ubuntu-artful-kernel.git] / fs / proc / array.c
CommitLineData
1da177e4
LT
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.
526719ba 43 * <alan@lxorguk.ukuu.org.uk>
1da177e4
LT
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
1da177e4
LT
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>
8ea02606
IM
65#include <linux/uaccess.h>
66#include <linux/io.h>
1da177e4
LT
67#include <linux/mm.h>
68#include <linux/hugetlb.h>
69#include <linux/pagemap.h>
70#include <linux/swap.h>
1da177e4
LT
71#include <linux/smp.h>
72#include <linux/signal.h>
73#include <linux/highmem.h>
74#include <linux/file.h>
9f3acc31 75#include <linux/fdtable.h>
1da177e4
LT
76#include <linux/times.h>
77#include <linux/cpuset.h>
4fb3a538 78#include <linux/rcupdate.h>
25890454 79#include <linux/delayacct.h>
ee992744 80#include <linux/seq_file.h>
b488893a 81#include <linux/pid_namespace.h>
f83ce3e6 82#include <linux/ptrace.h>
0d094efe 83#include <linux/tracehook.h>
ae2975bc 84#include <linux/user_namespace.h>
1da177e4 85
1da177e4 86#include <asm/pgtable.h>
1da177e4
LT
87#include <asm/processor.h>
88#include "internal.h"
89
df5f8314 90static inline void task_name(struct seq_file *m, struct task_struct *p)
1da177e4
LT
91{
92 int i;
df5f8314 93 char *buf, *end;
8ea02606 94 char *name;
1da177e4
LT
95 char tcomm[sizeof(p->comm)];
96
97 get_task_comm(tcomm, p);
98
9d6de12f 99 seq_puts(m, "Name:\t");
df5f8314
EB
100 end = m->buf + m->size;
101 buf = m->buf + m->count;
1da177e4
LT
102 name = tcomm;
103 i = sizeof(tcomm);
df5f8314 104 while (i && (buf < end)) {
1da177e4
LT
105 unsigned char c = *name;
106 name++;
107 i--;
108 *buf = c;
109 if (!c)
110 break;
111 if (c == '\\') {
df5f8314
EB
112 buf++;
113 if (buf < end)
114 *buf++ = c;
1da177e4
LT
115 continue;
116 }
117 if (c == '\n') {
df5f8314
EB
118 *buf++ = '\\';
119 if (buf < end)
120 *buf++ = 'n';
1da177e4
LT
121 continue;
122 }
123 buf++;
df5f8314
EB
124 }
125 m->count = buf - m->buf;
9d6de12f 126 seq_putc(m, '\n');
1da177e4
LT
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 */
e130aa70 135static const char * const task_state_array[] = {
e1781538
PZ
136 "R (running)", /* 0 */
137 "S (sleeping)", /* 1 */
138 "D (disk sleep)", /* 2 */
139 "T (stopped)", /* 4 */
140 "t (tracing stop)", /* 8 */
141 "Z (zombie)", /* 16 */
142 "X (dead)", /* 32 */
1da177e4
LT
143};
144
8ea02606 145static inline const char *get_task_state(struct task_struct *tsk)
1da177e4 146{
74e37200 147 unsigned int state = (tsk->state | tsk->exit_state) & TASK_REPORT;
1da177e4 148
74e37200 149 BUILD_BUG_ON(1 + ilog2(TASK_REPORT) != ARRAY_SIZE(task_state_array)-1);
e1781538 150
74e37200 151 return task_state_array[fls(state)];
1da177e4
LT
152}
153
df5f8314
EB
154static inline void task_state(struct seq_file *m, struct pid_namespace *ns,
155 struct pid *pid, struct task_struct *p)
1da177e4 156{
e9f238c3 157 struct user_namespace *user_ns = seq_user_ns(m);
1da177e4
LT
158 struct group_info *group_info;
159 int g;
badf1662 160 struct fdtable *fdt = NULL;
c69e8d9c 161 const struct cred *cred;
b488893a 162 pid_t ppid, tpid;
1da177e4 163
b0fa9db6 164 rcu_read_lock();
b488893a
PE
165 ppid = pid_alive(p) ?
166 task_tgid_nr_ns(rcu_dereference(p->real_parent), ns) : 0;
0d094efe
RM
167 tpid = 0;
168 if (pid_alive(p)) {
06d98473 169 struct task_struct *tracer = ptrace_parent(p);
0d094efe
RM
170 if (tracer)
171 tpid = task_pid_nr_ns(tracer, ns);
172 }
de09a977 173 cred = get_task_cred(p);
df5f8314 174 seq_printf(m,
1da177e4 175 "State:\t%s\n"
1da177e4 176 "Tgid:\t%d\n"
e29cf08b 177 "Ngid:\t%d\n"
1da177e4
LT
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),
b488893a 184 task_tgid_nr_ns(p, ns),
e29cf08b 185 task_numa_group_id(p),
df5f8314 186 pid_nr_ns(pid, ns),
b488893a 187 ppid, tpid,
dcb0f222
EB
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));
b0fa9db6 196
1da177e4 197 task_lock(p);
badf1662
DS
198 if (p->files)
199 fdt = files_fdtable(p->files);
df5f8314 200 seq_printf(m,
1da177e4
LT
201 "FDSize:\t%d\n"
202 "Groups:\t",
badf1662 203 fdt ? fdt->max_fds : 0);
4fb3a538 204 rcu_read_unlock();
1da177e4 205
c69e8d9c 206 group_info = cred->group_info;
1da177e4
LT
207 task_unlock(p);
208
8d238027 209 for (g = 0; g < group_info->ngroups; g++)
ae2975bc
EB
210 seq_printf(m, "%d ",
211 from_kgid_munged(user_ns, GROUP_AT(group_info, g)));
c69e8d9c 212 put_cred(cred);
1da177e4 213
9d6de12f 214 seq_putc(m, '\n');
1da177e4
LT
215}
216
138d22b5 217void render_sigset_t(struct seq_file *m, const char *header,
df5f8314 218 sigset_t *set)
1da177e4 219{
df5f8314 220 int i;
1da177e4 221
9d6de12f 222 seq_puts(m, header);
1da177e4
LT
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;
df5f8314 233 seq_printf(m, "%x", x);
1da177e4
LT
234 } while (i >= 4);
235
9d6de12f 236 seq_putc(m, '\n');
1da177e4
LT
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
df5f8314 254static inline void task_sig(struct seq_file *m, struct task_struct *p)
1da177e4 255{
5e6b3f42 256 unsigned long flags;
1da177e4
LT
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
5e6b3f42 268 if (lock_task_sighand(p, &flags)) {
1da177e4
LT
269 pending = p->pending.signal;
270 shpending = p->signal->shared_pending.signal;
271 blocked = p->blocked;
272 collect_sigign_sigcatch(p, &ignored, &caught);
7e49827c 273 num_threads = get_nr_threads(p);
7dc52157 274 rcu_read_lock(); /* FIXME: is this correct? */
c69e8d9c 275 qsize = atomic_read(&__task_cred(p)->user->sigpending);
7dc52157 276 rcu_read_unlock();
d554ed89 277 qlim = task_rlimit(p, RLIMIT_SIGPENDING);
5e6b3f42 278 unlock_task_sighand(p, &flags);
1da177e4 279 }
1da177e4 280
df5f8314
EB
281 seq_printf(m, "Threads:\t%d\n", num_threads);
282 seq_printf(m, "SigQ:\t%lu/%lu\n", qsize, qlim);
1da177e4
LT
283
284 /* render them all */
df5f8314
EB
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);
1da177e4
LT
290}
291
df5f8314
EB
292static void render_cap_t(struct seq_file *m, const char *header,
293 kernel_cap_t *a)
e338d263
AM
294{
295 unsigned __capi;
296
9d6de12f 297 seq_puts(m, header);
e338d263 298 CAP_FOR_EACH_U32(__capi) {
df5f8314 299 seq_printf(m, "%08x",
ca05a99a 300 a->cap[(_KERNEL_CAPABILITY_U32S-1) - __capi]);
e338d263 301 }
9d6de12f 302 seq_putc(m, '\n');
e338d263
AM
303}
304
7b9a7ec5
AV
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
df5f8314 309static inline void task_cap(struct seq_file *m, struct task_struct *p)
1da177e4 310{
c69e8d9c
DH
311 const struct cred *cred;
312 kernel_cap_t cap_inheritable, cap_permitted, cap_effective, cap_bset;
b6dff3ec 313
c69e8d9c
DH
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
7b9a7ec5
AV
322 NORM_CAPS(cap_inheritable);
323 NORM_CAPS(cap_permitted);
324 NORM_CAPS(cap_effective);
325 NORM_CAPS(cap_bset);
326
c69e8d9c
DH
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);
1da177e4
LT
331}
332
2f4b3bf6
KC
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
df5f8314
EB
340static inline void task_context_switch_counts(struct seq_file *m,
341 struct task_struct *p)
b663a79c 342{
df5f8314
EB
343 seq_printf(m, "voluntary_ctxt_switches:\t%lu\n"
344 "nonvoluntary_ctxt_switches:\t%lu\n",
345 p->nvcsw,
346 p->nivcsw);
b663a79c
MU
347}
348
d01d4827
HC
349static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
350{
9d6de12f 351 seq_puts(m, "Cpus_allowed:\t");
d01d4827 352 seq_cpumask(m, &task->cpus_allowed);
9d6de12f
AD
353 seq_putc(m, '\n');
354 seq_puts(m, "Cpus_allowed_list:\t");
d01d4827 355 seq_cpumask_list(m, &task->cpus_allowed);
9d6de12f 356 seq_putc(m, '\n');
d01d4827
HC
357}
358
df5f8314
EB
359int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
360 struct pid *pid, struct task_struct *task)
1da177e4 361{
1da177e4
LT
362 struct mm_struct *mm = get_task_mm(task);
363
df5f8314
EB
364 task_name(m, task);
365 task_state(m, ns, pid, task);
8ea02606 366
1da177e4 367 if (mm) {
df5f8314 368 task_mem(m, mm);
1da177e4
LT
369 mmput(mm);
370 }
df5f8314
EB
371 task_sig(m, task);
372 task_cap(m, task);
2f4b3bf6 373 task_seccomp(m, task);
d01d4827 374 task_cpus_allowed(m, task);
df5f8314 375 cpuset_task_status_allowed(m, task);
df5f8314
EB
376 task_context_switch_counts(m, task);
377 return 0;
1da177e4
LT
378}
379
ee992744
EB
380static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
381 struct pid *pid, struct task_struct *task, int whole)
1da177e4
LT
382{
383 unsigned long vsize, eip, esp, wchan = ~0UL;
715be1fc 384 int priority, nice;
1da177e4
LT
385 int tty_pgrp = -1, tty_nr = 0;
386 sigset_t sigign, sigcatch;
387 char state;
8ea02606 388 pid_t ppid = 0, pgid = -1, sid = -1;
1da177e4 389 int num_threads = 0;
f83ce3e6 390 int permitted;
1da177e4
LT
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;
efe567fc 395 cputime_t cutime, cstime, utime, stime;
9ac52315 396 cputime_t cgtime, gtime;
1da177e4 397 unsigned long rsslim = 0;
1da177e4 398 char tcomm[sizeof(task->comm)];
a593d6ed 399 unsigned long flags;
1da177e4
LT
400
401 state = *get_task_state(task);
402 vsize = eip = esp = 0;
69f594a3 403 permitted = ptrace_may_access(task, PTRACE_MODE_READ | PTRACE_MODE_NOAUDIT);
1da177e4
LT
404 mm = get_task_mm(task);
405 if (mm) {
406 vsize = task_vsize(mm);
f83ce3e6
JE
407 if (permitted) {
408 eip = KSTK_EIP(task);
409 esp = KSTK_ESP(task);
410 }
1da177e4
LT
411 }
412
413 get_task_comm(tcomm, task);
414
415 sigemptyset(&sigign);
416 sigemptyset(&sigcatch);
64861634
MS
417 cutime = cstime = utime = stime = 0;
418 cgtime = gtime = 0;
3cfd0885 419
a593d6ed
ON
420 if (lock_task_sighand(task, &flags)) {
421 struct signal_struct *sig = task->signal;
91593504
ON
422
423 if (sig->tty) {
5d0fdf1e
AC
424 struct pid *pgrp = tty_get_pgrp(sig->tty);
425 tty_pgrp = pid_nr_ns(pgrp, ns);
426 put_pid(pgrp);
91593504 427 tty_nr = new_encode_dev(tty_devnum(sig->tty));
a593d6ed
ON
428 }
429
7e49827c 430 num_threads = get_nr_threads(task);
1da177e4
LT
431 collect_sigign_sigcatch(task, &sigign, &sigcatch);
432
a593d6ed
ON
433 cmin_flt = sig->cmin_flt;
434 cmaj_flt = sig->cmaj_flt;
435 cutime = sig->cutime;
436 cstime = sig->cstime;
9ac52315 437 cgtime = sig->cgtime;
d554ed89 438 rsslim = ACCESS_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
a593d6ed 439
1da177e4
LT
440 /* add up live thread stats at the group level */
441 if (whole) {
a593d6ed 442 struct task_struct *t = task;
1da177e4
LT
443 do {
444 min_flt += t->min_flt;
445 maj_flt += t->maj_flt;
6fac4829 446 gtime += task_gtime(t);
1da177e4
LT
447 t = next_thread(t);
448 } while (t != task);
1da177e4 449
a593d6ed
ON
450 min_flt += sig->min_flt;
451 maj_flt += sig->maj_flt;
e80d0a1a 452 thread_group_cputime_adjusted(task, &utime, &stime);
64861634 453 gtime += sig->gtime;
1da177e4 454 }
a593d6ed 455
b488893a 456 sid = task_session_nr_ns(task, ns);
a98fdcef 457 ppid = task_tgid_nr_ns(task->real_parent, ns);
b488893a 458 pgid = task_pgrp_nr_ns(task, ns);
a593d6ed
ON
459
460 unlock_task_sighand(task, &flags);
1da177e4 461 }
1da177e4 462
f83ce3e6 463 if (permitted && (!whole || num_threads < 2))
1da177e4
LT
464 wchan = get_wchan(task);
465 if (!whole) {
466 min_flt = task->min_flt;
467 maj_flt = task->maj_flt;
e80d0a1a 468 task_cputime_adjusted(task, &utime, &stime);
6fac4829 469 gtime = task_gtime(task);
1da177e4
LT
470 }
471
472 /* scale priority and nice values from timeslices to -20..20 */
473 /* to make it look like a "normal" Unix priority/nice value */
474 priority = task_prio(task);
475 nice = task_nice(task);
476
477 /* Temporary variable needed for gcc-2.96 */
478 /* convert timespec -> nsec*/
924b42d5
TJ
479 start_time =
480 (unsigned long long)task->real_start_time.tv_sec * NSEC_PER_SEC
481 + task->real_start_time.tv_nsec;
1da177e4
LT
482 /* convert nsec -> ticks */
483 start_time = nsec_to_clock_t(start_time);
484
bda7bad6
KH
485 seq_printf(m, "%d (%s) %c", pid_nr_ns(pid, ns), tcomm, state);
486 seq_put_decimal_ll(m, ' ', ppid);
487 seq_put_decimal_ll(m, ' ', pgid);
488 seq_put_decimal_ll(m, ' ', sid);
489 seq_put_decimal_ll(m, ' ', tty_nr);
490 seq_put_decimal_ll(m, ' ', tty_pgrp);
491 seq_put_decimal_ull(m, ' ', task->flags);
492 seq_put_decimal_ull(m, ' ', min_flt);
493 seq_put_decimal_ull(m, ' ', cmin_flt);
494 seq_put_decimal_ull(m, ' ', maj_flt);
495 seq_put_decimal_ull(m, ' ', cmaj_flt);
496 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(utime));
497 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(stime));
498 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cutime));
499 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cstime));
500 seq_put_decimal_ll(m, ' ', priority);
501 seq_put_decimal_ll(m, ' ', nice);
502 seq_put_decimal_ll(m, ' ', num_threads);
503 seq_put_decimal_ull(m, ' ', 0);
504 seq_put_decimal_ull(m, ' ', start_time);
505 seq_put_decimal_ull(m, ' ', vsize);
715be1fc 506 seq_put_decimal_ull(m, ' ', mm ? get_mm_rss(mm) : 0);
bda7bad6
KH
507 seq_put_decimal_ull(m, ' ', rsslim);
508 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->start_code : 1) : 0);
509 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->end_code : 1) : 0);
510 seq_put_decimal_ull(m, ' ', (permitted && mm) ? mm->start_stack : 0);
511 seq_put_decimal_ull(m, ' ', esp);
512 seq_put_decimal_ull(m, ' ', eip);
513 /* The signal information here is obsolete.
514 * It must be decimal for Linux 2.0 compatibility.
515 * Use /proc/#/status for real-time signals.
516 */
517 seq_put_decimal_ull(m, ' ', task->pending.signal.sig[0] & 0x7fffffffUL);
518 seq_put_decimal_ull(m, ' ', task->blocked.sig[0] & 0x7fffffffUL);
519 seq_put_decimal_ull(m, ' ', sigign.sig[0] & 0x7fffffffUL);
520 seq_put_decimal_ull(m, ' ', sigcatch.sig[0] & 0x7fffffffUL);
521 seq_put_decimal_ull(m, ' ', wchan);
522 seq_put_decimal_ull(m, ' ', 0);
523 seq_put_decimal_ull(m, ' ', 0);
524 seq_put_decimal_ll(m, ' ', task->exit_signal);
525 seq_put_decimal_ll(m, ' ', task_cpu(task));
526 seq_put_decimal_ull(m, ' ', task->rt_priority);
527 seq_put_decimal_ull(m, ' ', task->policy);
528 seq_put_decimal_ull(m, ' ', delayacct_blkio_ticks(task));
529 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(gtime));
530 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cgtime));
5b172087
CG
531
532 if (mm && permitted) {
533 seq_put_decimal_ull(m, ' ', mm->start_data);
534 seq_put_decimal_ull(m, ' ', mm->end_data);
535 seq_put_decimal_ull(m, ' ', mm->start_brk);
536 seq_put_decimal_ull(m, ' ', mm->arg_start);
537 seq_put_decimal_ull(m, ' ', mm->arg_end);
538 seq_put_decimal_ull(m, ' ', mm->env_start);
539 seq_put_decimal_ull(m, ' ', mm->env_end);
540 } else
541 seq_printf(m, " 0 0 0 0 0 0 0");
542
543 if (permitted)
544 seq_put_decimal_ll(m, ' ', task->exit_code);
545 else
546 seq_put_decimal_ll(m, ' ', 0);
547
bda7bad6 548 seq_putc(m, '\n');
8ea02606 549 if (mm)
1da177e4 550 mmput(mm);
ee992744 551 return 0;
1da177e4
LT
552}
553
ee992744
EB
554int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
555 struct pid *pid, struct task_struct *task)
1da177e4 556{
ee992744 557 return do_task_stat(m, ns, pid, task, 0);
1da177e4
LT
558}
559
ee992744
EB
560int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
561 struct pid *pid, struct task_struct *task)
1da177e4 562{
ee992744 563 return do_task_stat(m, ns, pid, task, 1);
1da177e4
LT
564}
565
a56d3fc7
EB
566int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
567 struct pid *pid, struct task_struct *task)
1da177e4 568{
a2ade7b6 569 unsigned long size = 0, resident = 0, shared = 0, text = 0, data = 0;
1da177e4 570 struct mm_struct *mm = get_task_mm(task);
8ea02606 571
1da177e4
LT
572 if (mm) {
573 size = task_statm(mm, &shared, &text, &data, &resident);
574 mmput(mm);
575 }
bda7bad6
KH
576 /*
577 * For quick read, open code by putting numbers directly
578 * expected format is
579 * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
580 * size, resident, shared, text, data);
581 */
582 seq_put_decimal_ull(m, 0, size);
583 seq_put_decimal_ull(m, ' ', resident);
584 seq_put_decimal_ull(m, ' ', shared);
585 seq_put_decimal_ull(m, ' ', text);
586 seq_put_decimal_ull(m, ' ', 0);
3748b2f1 587 seq_put_decimal_ull(m, ' ', data);
bda7bad6
KH
588 seq_put_decimal_ull(m, ' ', 0);
589 seq_putc(m, '\n');
1da177e4 590
a56d3fc7 591 return 0;
1da177e4 592}
81841161
CG
593
594#ifdef CONFIG_CHECKPOINT_RESTORE
595static struct pid *
596get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
597{
598 struct task_struct *start, *task;
599 struct pid *pid = NULL;
600
601 read_lock(&tasklist_lock);
602
603 start = pid_task(proc_pid(inode), PIDTYPE_PID);
604 if (!start)
605 goto out;
606
607 /*
608 * Lets try to continue searching first, this gives
609 * us significant speedup on children-rich processes.
610 */
611 if (pid_prev) {
612 task = pid_task(pid_prev, PIDTYPE_PID);
613 if (task && task->real_parent == start &&
614 !(list_empty(&task->sibling))) {
615 if (list_is_last(&task->sibling, &start->children))
616 goto out;
617 task = list_first_entry(&task->sibling,
618 struct task_struct, sibling);
619 pid = get_pid(task_pid(task));
620 goto out;
621 }
622 }
623
624 /*
625 * Slow search case.
626 *
627 * We might miss some children here if children
628 * are exited while we were not holding the lock,
629 * but it was never promised to be accurate that
630 * much.
631 *
632 * "Just suppose that the parent sleeps, but N children
633 * exit after we printed their tids. Now the slow paths
634 * skips N extra children, we miss N tasks." (c)
635 *
636 * So one need to stop or freeze the leader and all
637 * its children to get a precise result.
638 */
639 list_for_each_entry(task, &start->children, sibling) {
640 if (pos-- == 0) {
641 pid = get_pid(task_pid(task));
642 break;
643 }
644 }
645
646out:
647 read_unlock(&tasklist_lock);
648 return pid;
649}
650
651static int children_seq_show(struct seq_file *seq, void *v)
652{
653 struct inode *inode = seq->private;
654 pid_t pid;
655
656 pid = pid_nr_ns(v, inode->i_sb->s_fs_info);
657 return seq_printf(seq, "%d ", pid);
658}
659
660static void *children_seq_start(struct seq_file *seq, loff_t *pos)
661{
662 return get_children_pid(seq->private, NULL, *pos);
663}
664
665static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
666{
667 struct pid *pid;
668
669 pid = get_children_pid(seq->private, v, *pos + 1);
670 put_pid(v);
671
672 ++*pos;
673 return pid;
674}
675
676static void children_seq_stop(struct seq_file *seq, void *v)
677{
678 put_pid(v);
679}
680
681static const struct seq_operations children_seq_ops = {
682 .start = children_seq_start,
683 .next = children_seq_next,
684 .stop = children_seq_stop,
685 .show = children_seq_show,
686};
687
688static int children_seq_open(struct inode *inode, struct file *file)
689{
690 struct seq_file *m;
691 int ret;
692
693 ret = seq_open(file, &children_seq_ops);
694 if (ret)
695 return ret;
696
697 m = file->private_data;
698 m->private = inode;
699
700 return ret;
701}
702
703int children_seq_release(struct inode *inode, struct file *file)
704{
705 seq_release(inode, file);
706 return 0;
707}
708
709const struct file_operations proc_tid_children_operations = {
710 .open = children_seq_open,
711 .read = seq_read,
712 .llseek = seq_lseek,
713 .release = children_seq_release,
714};
715#endif /* CONFIG_CHECKPOINT_RESTORE */