proc: task_state: deuglify the max_fds calculation
[deliverable/linux.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 */
ad86622b
ON
141 "X (dead)", /* 16 */
142 "Z (zombie)", /* 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;
c69e8d9c 160 const struct cred *cred;
b488893a 161 pid_t ppid, tpid;
0f4a0d53 162 unsigned int max_fds = 0;
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);
0f4a0d53
ON
174
175 task_lock(p);
176 if (p->files)
177 max_fds = files_fdtable(p->files)->max_fds;
178 task_unlock(p);
179
df5f8314 180 seq_printf(m,
1da177e4 181 "State:\t%s\n"
1da177e4 182 "Tgid:\t%d\n"
e29cf08b 183 "Ngid:\t%d\n"
1da177e4
LT
184 "Pid:\t%d\n"
185 "PPid:\t%d\n"
186 "TracerPid:\t%d\n"
187 "Uid:\t%d\t%d\t%d\t%d\n"
0f4a0d53
ON
188 "Gid:\t%d\t%d\t%d\t%d\n"
189 "FDSize:\t%d\nGroups:\t",
1da177e4 190 get_task_state(p),
b488893a 191 task_tgid_nr_ns(p, ns),
e29cf08b 192 task_numa_group_id(p),
df5f8314 193 pid_nr_ns(pid, ns),
b488893a 194 ppid, tpid,
dcb0f222
EB
195 from_kuid_munged(user_ns, cred->uid),
196 from_kuid_munged(user_ns, cred->euid),
197 from_kuid_munged(user_ns, cred->suid),
198 from_kuid_munged(user_ns, cred->fsuid),
199 from_kgid_munged(user_ns, cred->gid),
200 from_kgid_munged(user_ns, cred->egid),
201 from_kgid_munged(user_ns, cred->sgid),
0f4a0d53
ON
202 from_kgid_munged(user_ns, cred->fsgid),
203 max_fds);
4fb3a538 204 rcu_read_unlock();
1da177e4 205
c69e8d9c 206 group_info = cred->group_info;
8d238027 207 for (g = 0; g < group_info->ngroups; g++)
ae2975bc
EB
208 seq_printf(m, "%d ",
209 from_kgid_munged(user_ns, GROUP_AT(group_info, g)));
c69e8d9c 210 put_cred(cred);
1da177e4 211
9d6de12f 212 seq_putc(m, '\n');
1da177e4
LT
213}
214
138d22b5 215void render_sigset_t(struct seq_file *m, const char *header,
df5f8314 216 sigset_t *set)
1da177e4 217{
df5f8314 218 int i;
1da177e4 219
9d6de12f 220 seq_puts(m, header);
1da177e4
LT
221
222 i = _NSIG;
223 do {
224 int x = 0;
225
226 i -= 4;
227 if (sigismember(set, i+1)) x |= 1;
228 if (sigismember(set, i+2)) x |= 2;
229 if (sigismember(set, i+3)) x |= 4;
230 if (sigismember(set, i+4)) x |= 8;
df5f8314 231 seq_printf(m, "%x", x);
1da177e4
LT
232 } while (i >= 4);
233
9d6de12f 234 seq_putc(m, '\n');
1da177e4
LT
235}
236
237static void collect_sigign_sigcatch(struct task_struct *p, sigset_t *ign,
238 sigset_t *catch)
239{
240 struct k_sigaction *k;
241 int i;
242
243 k = p->sighand->action;
244 for (i = 1; i <= _NSIG; ++i, ++k) {
245 if (k->sa.sa_handler == SIG_IGN)
246 sigaddset(ign, i);
247 else if (k->sa.sa_handler != SIG_DFL)
248 sigaddset(catch, i);
249 }
250}
251
df5f8314 252static inline void task_sig(struct seq_file *m, struct task_struct *p)
1da177e4 253{
5e6b3f42 254 unsigned long flags;
1da177e4
LT
255 sigset_t pending, shpending, blocked, ignored, caught;
256 int num_threads = 0;
257 unsigned long qsize = 0;
258 unsigned long qlim = 0;
259
260 sigemptyset(&pending);
261 sigemptyset(&shpending);
262 sigemptyset(&blocked);
263 sigemptyset(&ignored);
264 sigemptyset(&caught);
265
5e6b3f42 266 if (lock_task_sighand(p, &flags)) {
1da177e4
LT
267 pending = p->pending.signal;
268 shpending = p->signal->shared_pending.signal;
269 blocked = p->blocked;
270 collect_sigign_sigcatch(p, &ignored, &caught);
7e49827c 271 num_threads = get_nr_threads(p);
7dc52157 272 rcu_read_lock(); /* FIXME: is this correct? */
c69e8d9c 273 qsize = atomic_read(&__task_cred(p)->user->sigpending);
7dc52157 274 rcu_read_unlock();
d554ed89 275 qlim = task_rlimit(p, RLIMIT_SIGPENDING);
5e6b3f42 276 unlock_task_sighand(p, &flags);
1da177e4 277 }
1da177e4 278
df5f8314
EB
279 seq_printf(m, "Threads:\t%d\n", num_threads);
280 seq_printf(m, "SigQ:\t%lu/%lu\n", qsize, qlim);
1da177e4
LT
281
282 /* render them all */
df5f8314
EB
283 render_sigset_t(m, "SigPnd:\t", &pending);
284 render_sigset_t(m, "ShdPnd:\t", &shpending);
285 render_sigset_t(m, "SigBlk:\t", &blocked);
286 render_sigset_t(m, "SigIgn:\t", &ignored);
287 render_sigset_t(m, "SigCgt:\t", &caught);
1da177e4
LT
288}
289
df5f8314
EB
290static void render_cap_t(struct seq_file *m, const char *header,
291 kernel_cap_t *a)
e338d263
AM
292{
293 unsigned __capi;
294
9d6de12f 295 seq_puts(m, header);
e338d263 296 CAP_FOR_EACH_U32(__capi) {
df5f8314 297 seq_printf(m, "%08x",
7d8b6c63 298 a->cap[CAP_LAST_U32 - __capi]);
e338d263 299 }
9d6de12f 300 seq_putc(m, '\n');
e338d263
AM
301}
302
df5f8314 303static inline void task_cap(struct seq_file *m, struct task_struct *p)
1da177e4 304{
c69e8d9c
DH
305 const struct cred *cred;
306 kernel_cap_t cap_inheritable, cap_permitted, cap_effective, cap_bset;
b6dff3ec 307
c69e8d9c
DH
308 rcu_read_lock();
309 cred = __task_cred(p);
310 cap_inheritable = cred->cap_inheritable;
311 cap_permitted = cred->cap_permitted;
312 cap_effective = cred->cap_effective;
313 cap_bset = cred->cap_bset;
314 rcu_read_unlock();
315
316 render_cap_t(m, "CapInh:\t", &cap_inheritable);
317 render_cap_t(m, "CapPrm:\t", &cap_permitted);
318 render_cap_t(m, "CapEff:\t", &cap_effective);
319 render_cap_t(m, "CapBnd:\t", &cap_bset);
1da177e4
LT
320}
321
2f4b3bf6
KC
322static inline void task_seccomp(struct seq_file *m, struct task_struct *p)
323{
324#ifdef CONFIG_SECCOMP
325 seq_printf(m, "Seccomp:\t%d\n", p->seccomp.mode);
326#endif
327}
328
df5f8314
EB
329static inline void task_context_switch_counts(struct seq_file *m,
330 struct task_struct *p)
b663a79c 331{
df5f8314
EB
332 seq_printf(m, "voluntary_ctxt_switches:\t%lu\n"
333 "nonvoluntary_ctxt_switches:\t%lu\n",
334 p->nvcsw,
335 p->nivcsw);
b663a79c
MU
336}
337
d01d4827
HC
338static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
339{
9d6de12f 340 seq_puts(m, "Cpus_allowed:\t");
d01d4827 341 seq_cpumask(m, &task->cpus_allowed);
9d6de12f
AD
342 seq_putc(m, '\n');
343 seq_puts(m, "Cpus_allowed_list:\t");
d01d4827 344 seq_cpumask_list(m, &task->cpus_allowed);
9d6de12f 345 seq_putc(m, '\n');
d01d4827
HC
346}
347
df5f8314
EB
348int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
349 struct pid *pid, struct task_struct *task)
1da177e4 350{
1da177e4
LT
351 struct mm_struct *mm = get_task_mm(task);
352
df5f8314
EB
353 task_name(m, task);
354 task_state(m, ns, pid, task);
8ea02606 355
1da177e4 356 if (mm) {
df5f8314 357 task_mem(m, mm);
1da177e4
LT
358 mmput(mm);
359 }
df5f8314
EB
360 task_sig(m, task);
361 task_cap(m, task);
2f4b3bf6 362 task_seccomp(m, task);
d01d4827 363 task_cpus_allowed(m, task);
df5f8314 364 cpuset_task_status_allowed(m, task);
df5f8314
EB
365 task_context_switch_counts(m, task);
366 return 0;
1da177e4
LT
367}
368
ee992744
EB
369static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
370 struct pid *pid, struct task_struct *task, int whole)
1da177e4
LT
371{
372 unsigned long vsize, eip, esp, wchan = ~0UL;
715be1fc 373 int priority, nice;
1da177e4
LT
374 int tty_pgrp = -1, tty_nr = 0;
375 sigset_t sigign, sigcatch;
376 char state;
8ea02606 377 pid_t ppid = 0, pgid = -1, sid = -1;
1da177e4 378 int num_threads = 0;
f83ce3e6 379 int permitted;
1da177e4
LT
380 struct mm_struct *mm;
381 unsigned long long start_time;
382 unsigned long cmin_flt = 0, cmaj_flt = 0;
383 unsigned long min_flt = 0, maj_flt = 0;
efe567fc 384 cputime_t cutime, cstime, utime, stime;
9ac52315 385 cputime_t cgtime, gtime;
1da177e4 386 unsigned long rsslim = 0;
1da177e4 387 char tcomm[sizeof(task->comm)];
a593d6ed 388 unsigned long flags;
1da177e4
LT
389
390 state = *get_task_state(task);
391 vsize = eip = esp = 0;
69f594a3 392 permitted = ptrace_may_access(task, PTRACE_MODE_READ | PTRACE_MODE_NOAUDIT);
1da177e4
LT
393 mm = get_task_mm(task);
394 if (mm) {
395 vsize = task_vsize(mm);
f83ce3e6
JE
396 if (permitted) {
397 eip = KSTK_EIP(task);
398 esp = KSTK_ESP(task);
399 }
1da177e4
LT
400 }
401
402 get_task_comm(tcomm, task);
403
404 sigemptyset(&sigign);
405 sigemptyset(&sigcatch);
64861634
MS
406 cutime = cstime = utime = stime = 0;
407 cgtime = gtime = 0;
3cfd0885 408
a593d6ed
ON
409 if (lock_task_sighand(task, &flags)) {
410 struct signal_struct *sig = task->signal;
91593504
ON
411
412 if (sig->tty) {
5d0fdf1e
AC
413 struct pid *pgrp = tty_get_pgrp(sig->tty);
414 tty_pgrp = pid_nr_ns(pgrp, ns);
415 put_pid(pgrp);
91593504 416 tty_nr = new_encode_dev(tty_devnum(sig->tty));
a593d6ed
ON
417 }
418
7e49827c 419 num_threads = get_nr_threads(task);
1da177e4
LT
420 collect_sigign_sigcatch(task, &sigign, &sigcatch);
421
a593d6ed
ON
422 cmin_flt = sig->cmin_flt;
423 cmaj_flt = sig->cmaj_flt;
424 cutime = sig->cutime;
425 cstime = sig->cstime;
9ac52315 426 cgtime = sig->cgtime;
d554ed89 427 rsslim = ACCESS_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
a593d6ed 428
1da177e4
LT
429 /* add up live thread stats at the group level */
430 if (whole) {
a593d6ed 431 struct task_struct *t = task;
1da177e4
LT
432 do {
433 min_flt += t->min_flt;
434 maj_flt += t->maj_flt;
6fac4829 435 gtime += task_gtime(t);
185ee40e 436 } while_each_thread(task, t);
1da177e4 437
a593d6ed
ON
438 min_flt += sig->min_flt;
439 maj_flt += sig->maj_flt;
e80d0a1a 440 thread_group_cputime_adjusted(task, &utime, &stime);
64861634 441 gtime += sig->gtime;
1da177e4 442 }
a593d6ed 443
b488893a 444 sid = task_session_nr_ns(task, ns);
a98fdcef 445 ppid = task_tgid_nr_ns(task->real_parent, ns);
b488893a 446 pgid = task_pgrp_nr_ns(task, ns);
a593d6ed
ON
447
448 unlock_task_sighand(task, &flags);
1da177e4 449 }
1da177e4 450
f83ce3e6 451 if (permitted && (!whole || num_threads < 2))
1da177e4
LT
452 wchan = get_wchan(task);
453 if (!whole) {
454 min_flt = task->min_flt;
455 maj_flt = task->maj_flt;
e80d0a1a 456 task_cputime_adjusted(task, &utime, &stime);
6fac4829 457 gtime = task_gtime(task);
1da177e4
LT
458 }
459
460 /* scale priority and nice values from timeslices to -20..20 */
461 /* to make it look like a "normal" Unix priority/nice value */
462 priority = task_prio(task);
463 nice = task_nice(task);
464
1da177e4 465 /* convert nsec -> ticks */
57e0be04 466 start_time = nsec_to_clock_t(task->real_start_time);
1da177e4 467
bda7bad6
KH
468 seq_printf(m, "%d (%s) %c", pid_nr_ns(pid, ns), tcomm, state);
469 seq_put_decimal_ll(m, ' ', ppid);
470 seq_put_decimal_ll(m, ' ', pgid);
471 seq_put_decimal_ll(m, ' ', sid);
472 seq_put_decimal_ll(m, ' ', tty_nr);
473 seq_put_decimal_ll(m, ' ', tty_pgrp);
474 seq_put_decimal_ull(m, ' ', task->flags);
475 seq_put_decimal_ull(m, ' ', min_flt);
476 seq_put_decimal_ull(m, ' ', cmin_flt);
477 seq_put_decimal_ull(m, ' ', maj_flt);
478 seq_put_decimal_ull(m, ' ', cmaj_flt);
479 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(utime));
480 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(stime));
481 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cutime));
482 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cstime));
483 seq_put_decimal_ll(m, ' ', priority);
484 seq_put_decimal_ll(m, ' ', nice);
485 seq_put_decimal_ll(m, ' ', num_threads);
486 seq_put_decimal_ull(m, ' ', 0);
487 seq_put_decimal_ull(m, ' ', start_time);
488 seq_put_decimal_ull(m, ' ', vsize);
715be1fc 489 seq_put_decimal_ull(m, ' ', mm ? get_mm_rss(mm) : 0);
bda7bad6
KH
490 seq_put_decimal_ull(m, ' ', rsslim);
491 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->start_code : 1) : 0);
492 seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->end_code : 1) : 0);
493 seq_put_decimal_ull(m, ' ', (permitted && mm) ? mm->start_stack : 0);
494 seq_put_decimal_ull(m, ' ', esp);
495 seq_put_decimal_ull(m, ' ', eip);
496 /* The signal information here is obsolete.
497 * It must be decimal for Linux 2.0 compatibility.
498 * Use /proc/#/status for real-time signals.
499 */
500 seq_put_decimal_ull(m, ' ', task->pending.signal.sig[0] & 0x7fffffffUL);
501 seq_put_decimal_ull(m, ' ', task->blocked.sig[0] & 0x7fffffffUL);
502 seq_put_decimal_ull(m, ' ', sigign.sig[0] & 0x7fffffffUL);
503 seq_put_decimal_ull(m, ' ', sigcatch.sig[0] & 0x7fffffffUL);
504 seq_put_decimal_ull(m, ' ', wchan);
505 seq_put_decimal_ull(m, ' ', 0);
506 seq_put_decimal_ull(m, ' ', 0);
507 seq_put_decimal_ll(m, ' ', task->exit_signal);
508 seq_put_decimal_ll(m, ' ', task_cpu(task));
509 seq_put_decimal_ull(m, ' ', task->rt_priority);
510 seq_put_decimal_ull(m, ' ', task->policy);
511 seq_put_decimal_ull(m, ' ', delayacct_blkio_ticks(task));
512 seq_put_decimal_ull(m, ' ', cputime_to_clock_t(gtime));
513 seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cgtime));
5b172087
CG
514
515 if (mm && permitted) {
516 seq_put_decimal_ull(m, ' ', mm->start_data);
517 seq_put_decimal_ull(m, ' ', mm->end_data);
518 seq_put_decimal_ull(m, ' ', mm->start_brk);
519 seq_put_decimal_ull(m, ' ', mm->arg_start);
520 seq_put_decimal_ull(m, ' ', mm->arg_end);
521 seq_put_decimal_ull(m, ' ', mm->env_start);
522 seq_put_decimal_ull(m, ' ', mm->env_end);
523 } else
524 seq_printf(m, " 0 0 0 0 0 0 0");
525
526 if (permitted)
527 seq_put_decimal_ll(m, ' ', task->exit_code);
528 else
529 seq_put_decimal_ll(m, ' ', 0);
530
bda7bad6 531 seq_putc(m, '\n');
8ea02606 532 if (mm)
1da177e4 533 mmput(mm);
ee992744 534 return 0;
1da177e4
LT
535}
536
ee992744
EB
537int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
538 struct pid *pid, struct task_struct *task)
1da177e4 539{
ee992744 540 return do_task_stat(m, ns, pid, task, 0);
1da177e4
LT
541}
542
ee992744
EB
543int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
544 struct pid *pid, struct task_struct *task)
1da177e4 545{
ee992744 546 return do_task_stat(m, ns, pid, task, 1);
1da177e4
LT
547}
548
a56d3fc7
EB
549int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
550 struct pid *pid, struct task_struct *task)
1da177e4 551{
a2ade7b6 552 unsigned long size = 0, resident = 0, shared = 0, text = 0, data = 0;
1da177e4 553 struct mm_struct *mm = get_task_mm(task);
8ea02606 554
1da177e4
LT
555 if (mm) {
556 size = task_statm(mm, &shared, &text, &data, &resident);
557 mmput(mm);
558 }
bda7bad6
KH
559 /*
560 * For quick read, open code by putting numbers directly
561 * expected format is
562 * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
563 * size, resident, shared, text, data);
564 */
565 seq_put_decimal_ull(m, 0, size);
566 seq_put_decimal_ull(m, ' ', resident);
567 seq_put_decimal_ull(m, ' ', shared);
568 seq_put_decimal_ull(m, ' ', text);
569 seq_put_decimal_ull(m, ' ', 0);
3748b2f1 570 seq_put_decimal_ull(m, ' ', data);
bda7bad6
KH
571 seq_put_decimal_ull(m, ' ', 0);
572 seq_putc(m, '\n');
1da177e4 573
a56d3fc7 574 return 0;
1da177e4 575}
81841161
CG
576
577#ifdef CONFIG_CHECKPOINT_RESTORE
578static struct pid *
579get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
580{
581 struct task_struct *start, *task;
582 struct pid *pid = NULL;
583
584 read_lock(&tasklist_lock);
585
586 start = pid_task(proc_pid(inode), PIDTYPE_PID);
587 if (!start)
588 goto out;
589
590 /*
591 * Lets try to continue searching first, this gives
592 * us significant speedup on children-rich processes.
593 */
594 if (pid_prev) {
595 task = pid_task(pid_prev, PIDTYPE_PID);
596 if (task && task->real_parent == start &&
597 !(list_empty(&task->sibling))) {
598 if (list_is_last(&task->sibling, &start->children))
599 goto out;
600 task = list_first_entry(&task->sibling,
601 struct task_struct, sibling);
602 pid = get_pid(task_pid(task));
603 goto out;
604 }
605 }
606
607 /*
608 * Slow search case.
609 *
610 * We might miss some children here if children
611 * are exited while we were not holding the lock,
612 * but it was never promised to be accurate that
613 * much.
614 *
615 * "Just suppose that the parent sleeps, but N children
616 * exit after we printed their tids. Now the slow paths
617 * skips N extra children, we miss N tasks." (c)
618 *
619 * So one need to stop or freeze the leader and all
620 * its children to get a precise result.
621 */
622 list_for_each_entry(task, &start->children, sibling) {
623 if (pos-- == 0) {
624 pid = get_pid(task_pid(task));
625 break;
626 }
627 }
628
629out:
630 read_unlock(&tasklist_lock);
631 return pid;
632}
633
634static int children_seq_show(struct seq_file *seq, void *v)
635{
636 struct inode *inode = seq->private;
637 pid_t pid;
638
639 pid = pid_nr_ns(v, inode->i_sb->s_fs_info);
640 return seq_printf(seq, "%d ", pid);
641}
642
643static void *children_seq_start(struct seq_file *seq, loff_t *pos)
644{
645 return get_children_pid(seq->private, NULL, *pos);
646}
647
648static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
649{
650 struct pid *pid;
651
652 pid = get_children_pid(seq->private, v, *pos + 1);
653 put_pid(v);
654
655 ++*pos;
656 return pid;
657}
658
659static void children_seq_stop(struct seq_file *seq, void *v)
660{
661 put_pid(v);
662}
663
664static const struct seq_operations children_seq_ops = {
665 .start = children_seq_start,
666 .next = children_seq_next,
667 .stop = children_seq_stop,
668 .show = children_seq_show,
669};
670
671static int children_seq_open(struct inode *inode, struct file *file)
672{
673 struct seq_file *m;
674 int ret;
675
676 ret = seq_open(file, &children_seq_ops);
677 if (ret)
678 return ret;
679
680 m = file->private_data;
681 m->private = inode;
682
683 return ret;
684}
685
686int children_seq_release(struct inode *inode, struct file *file)
687{
688 seq_release(inode, file);
689 return 0;
690}
691
692const struct file_operations proc_tid_children_operations = {
693 .open = children_seq_open,
694 .read = seq_read,
695 .llseek = seq_lseek,
696 .release = children_seq_release,
697};
698#endif /* CONFIG_CHECKPOINT_RESTORE */
This page took 1.08646 seconds and 5 git commands to generate.