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