array.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733
  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. #include <linux/types.h>
  55. #include <linux/errno.h>
  56. #include <linux/time.h>
  57. #include <linux/kernel.h>
  58. #include <linux/kernel_stat.h>
  59. #include <linux/tty.h>
  60. #include <linux/string.h>
  61. #include <linux/mman.h>
  62. #include <linux/proc_fs.h>
  63. #include <linux/ioport.h>
  64. #include <linux/uaccess.h>
  65. #include <linux/io.h>
  66. #include <linux/mm.h>
  67. #include <linux/hugetlb.h>
  68. #include <linux/pagemap.h>
  69. #include <linux/swap.h>
  70. #include <linux/smp.h>
  71. #include <linux/signal.h>
  72. #include <linux/highmem.h>
  73. #include <linux/file.h>
  74. #include <linux/fdtable.h>
  75. #include <linux/times.h>
  76. #include <linux/cpuset.h>
  77. #include <linux/rcupdate.h>
  78. #include <linux/delayacct.h>
  79. #include <linux/seq_file.h>
  80. #include <linux/pid_namespace.h>
  81. #include <linux/ptrace.h>
  82. #include <linux/tracehook.h>
  83. #include <linux/string_helpers.h>
  84. #include <linux/user_namespace.h>
  85. #include <linux/fs_struct.h>
  86. #include <asm/pgtable.h>
  87. #include <asm/processor.h>
  88. #include "internal.h"
  89. static inline void task_name(struct seq_file *m, struct task_struct *p)
  90. {
  91. char *buf;
  92. size_t size;
  93. char tcomm[sizeof(p->comm)];
  94. int ret;
  95. get_task_comm(tcomm, p);
  96. seq_puts(m, "Name:\t");
  97. size = seq_get_buf(m, &buf);
  98. ret = string_escape_str(tcomm, buf, size, ESCAPE_SPACE | ESCAPE_SPECIAL, "\n\\");
  99. seq_commit(m, ret < size ? ret : -1);
  100. seq_putc(m, '\n');
  101. }
  102. /*
  103. * The task state array is a strange "bitmap" of
  104. * reasons to sleep. Thus "running" is zero, and
  105. * you can test for combinations of others with
  106. * simple bit tests.
  107. */
  108. static const char * const task_state_array[] = {
  109. "R (running)", /* 0 */
  110. "S (sleeping)", /* 1 */
  111. "D (disk sleep)", /* 2 */
  112. "T (stopped)", /* 4 */
  113. "t (tracing stop)", /* 8 */
  114. "X (dead)", /* 16 */
  115. "Z (zombie)", /* 32 */
  116. };
  117. static inline const char *get_task_state(struct task_struct *tsk)
  118. {
  119. unsigned int state = (tsk->state | tsk->exit_state) & TASK_REPORT;
  120. /*
  121. * Parked tasks do not run; they sit in __kthread_parkme().
  122. * Without this check, we would report them as running, which is
  123. * clearly wrong, so we report them as sleeping instead.
  124. */
  125. if (tsk->state == TASK_PARKED)
  126. state = TASK_INTERRUPTIBLE;
  127. BUILD_BUG_ON(1 + ilog2(TASK_REPORT) != ARRAY_SIZE(task_state_array)-1);
  128. return task_state_array[fls(state)];
  129. }
  130. static inline int get_task_umask(struct task_struct *tsk)
  131. {
  132. struct fs_struct *fs;
  133. int umask = -ENOENT;
  134. task_lock(tsk);
  135. fs = tsk->fs;
  136. if (fs)
  137. umask = fs->umask;
  138. task_unlock(tsk);
  139. return umask;
  140. }
  141. static inline void task_state(struct seq_file *m, struct pid_namespace *ns,
  142. struct pid *pid, struct task_struct *p)
  143. {
  144. struct user_namespace *user_ns = seq_user_ns(m);
  145. struct group_info *group_info;
  146. int g, umask;
  147. struct task_struct *tracer;
  148. const struct cred *cred;
  149. pid_t ppid, tpid = 0, tgid, ngid;
  150. unsigned int max_fds = 0;
  151. rcu_read_lock();
  152. ppid = pid_alive(p) ?
  153. task_tgid_nr_ns(rcu_dereference(p->real_parent), ns) : 0;
  154. tracer = ptrace_parent(p);
  155. if (tracer)
  156. tpid = task_pid_nr_ns(tracer, ns);
  157. tgid = task_tgid_nr_ns(p, ns);
  158. ngid = task_numa_group_id(p);
  159. cred = get_task_cred(p);
  160. umask = get_task_umask(p);
  161. if (umask >= 0)
  162. seq_printf(m, "Umask:\t%#04o\n", umask);
  163. task_lock(p);
  164. if (p->files)
  165. max_fds = files_fdtable(p->files)->max_fds;
  166. task_unlock(p);
  167. rcu_read_unlock();
  168. seq_printf(m, "State:\t%s", get_task_state(p));
  169. seq_put_decimal_ull(m, "\nTgid:\t", tgid);
  170. seq_put_decimal_ull(m, "\nNgid:\t", ngid);
  171. seq_put_decimal_ull(m, "\nPid:\t", pid_nr_ns(pid, ns));
  172. seq_put_decimal_ull(m, "\nPPid:\t", ppid);
  173. seq_put_decimal_ull(m, "\nTracerPid:\t", tpid);
  174. seq_put_decimal_ull(m, "\nUid:\t", from_kuid_munged(user_ns, cred->uid));
  175. seq_put_decimal_ull(m, "\t", from_kuid_munged(user_ns, cred->euid));
  176. seq_put_decimal_ull(m, "\t", from_kuid_munged(user_ns, cred->suid));
  177. seq_put_decimal_ull(m, "\t", from_kuid_munged(user_ns, cred->fsuid));
  178. seq_put_decimal_ull(m, "\nGid:\t", from_kgid_munged(user_ns, cred->gid));
  179. seq_put_decimal_ull(m, "\t", from_kgid_munged(user_ns, cred->egid));
  180. seq_put_decimal_ull(m, "\t", from_kgid_munged(user_ns, cred->sgid));
  181. seq_put_decimal_ull(m, "\t", from_kgid_munged(user_ns, cred->fsgid));
  182. seq_put_decimal_ull(m, "\nFDSize:\t", max_fds);
  183. seq_puts(m, "\nGroups:\t");
  184. group_info = cred->group_info;
  185. for (g = 0; g < group_info->ngroups; g++)
  186. seq_put_decimal_ull(m, g ? " " : "",
  187. from_kgid_munged(user_ns, group_info->gid[g]));
  188. put_cred(cred);
  189. /* Trailing space shouldn't have been added in the first place. */
  190. seq_putc(m, ' ');
  191. #ifdef CONFIG_PID_NS
  192. seq_puts(m, "\nNStgid:");
  193. for (g = ns->level; g <= pid->level; g++)
  194. seq_put_decimal_ull(m, "\t", task_tgid_nr_ns(p, pid->numbers[g].ns));
  195. seq_puts(m, "\nNSpid:");
  196. for (g = ns->level; g <= pid->level; g++)
  197. seq_put_decimal_ull(m, "\t", task_pid_nr_ns(p, pid->numbers[g].ns));
  198. seq_puts(m, "\nNSpgid:");
  199. for (g = ns->level; g <= pid->level; g++)
  200. seq_put_decimal_ull(m, "\t", task_pgrp_nr_ns(p, pid->numbers[g].ns));
  201. seq_puts(m, "\nNSsid:");
  202. for (g = ns->level; g <= pid->level; g++)
  203. seq_put_decimal_ull(m, "\t", task_session_nr_ns(p, pid->numbers[g].ns));
  204. #endif
  205. seq_putc(m, '\n');
  206. }
  207. void render_sigset_t(struct seq_file *m, const char *header,
  208. sigset_t *set)
  209. {
  210. int i;
  211. seq_puts(m, header);
  212. i = _NSIG;
  213. do {
  214. int x = 0;
  215. i -= 4;
  216. if (sigismember(set, i+1)) x |= 1;
  217. if (sigismember(set, i+2)) x |= 2;
  218. if (sigismember(set, i+3)) x |= 4;
  219. if (sigismember(set, i+4)) x |= 8;
  220. seq_putc(m, hex_asc[x]);
  221. } while (i >= 4);
  222. seq_putc(m, '\n');
  223. }
  224. static void collect_sigign_sigcatch(struct task_struct *p, sigset_t *ign,
  225. sigset_t *catch)
  226. {
  227. struct k_sigaction *k;
  228. int i;
  229. k = p->sighand->action;
  230. for (i = 1; i <= _NSIG; ++i, ++k) {
  231. if (k->sa.sa_handler == SIG_IGN)
  232. sigaddset(ign, i);
  233. else if (k->sa.sa_handler != SIG_DFL)
  234. sigaddset(catch, i);
  235. }
  236. }
  237. static inline void task_sig(struct seq_file *m, struct task_struct *p)
  238. {
  239. unsigned long flags;
  240. sigset_t pending, shpending, blocked, ignored, caught;
  241. int num_threads = 0;
  242. unsigned long qsize = 0;
  243. unsigned long qlim = 0;
  244. sigemptyset(&pending);
  245. sigemptyset(&shpending);
  246. sigemptyset(&blocked);
  247. sigemptyset(&ignored);
  248. sigemptyset(&caught);
  249. if (lock_task_sighand(p, &flags)) {
  250. pending = p->pending.signal;
  251. shpending = p->signal->shared_pending.signal;
  252. blocked = p->blocked;
  253. collect_sigign_sigcatch(p, &ignored, &caught);
  254. num_threads = get_nr_threads(p);
  255. rcu_read_lock(); /* FIXME: is this correct? */
  256. qsize = atomic_read(&__task_cred(p)->user->sigpending);
  257. rcu_read_unlock();
  258. qlim = task_rlimit(p, RLIMIT_SIGPENDING);
  259. unlock_task_sighand(p, &flags);
  260. }
  261. seq_put_decimal_ull(m, "Threads:\t", num_threads);
  262. seq_put_decimal_ull(m, "\nSigQ:\t", qsize);
  263. seq_put_decimal_ull(m, "/", qlim);
  264. /* render them all */
  265. render_sigset_t(m, "\nSigPnd:\t", &pending);
  266. render_sigset_t(m, "ShdPnd:\t", &shpending);
  267. render_sigset_t(m, "SigBlk:\t", &blocked);
  268. render_sigset_t(m, "SigIgn:\t", &ignored);
  269. render_sigset_t(m, "SigCgt:\t", &caught);
  270. }
  271. static void render_cap_t(struct seq_file *m, const char *header,
  272. kernel_cap_t *a)
  273. {
  274. unsigned __capi;
  275. seq_puts(m, header);
  276. CAP_FOR_EACH_U32(__capi) {
  277. seq_printf(m, "%08x",
  278. a->cap[CAP_LAST_U32 - __capi]);
  279. }
  280. seq_putc(m, '\n');
  281. }
  282. static inline void task_cap(struct seq_file *m, struct task_struct *p)
  283. {
  284. const struct cred *cred;
  285. kernel_cap_t cap_inheritable, cap_permitted, cap_effective,
  286. cap_bset, cap_ambient;
  287. rcu_read_lock();
  288. cred = __task_cred(p);
  289. cap_inheritable = cred->cap_inheritable;
  290. cap_permitted = cred->cap_permitted;
  291. cap_effective = cred->cap_effective;
  292. cap_bset = cred->cap_bset;
  293. cap_ambient = cred->cap_ambient;
  294. rcu_read_unlock();
  295. render_cap_t(m, "CapInh:\t", &cap_inheritable);
  296. render_cap_t(m, "CapPrm:\t", &cap_permitted);
  297. render_cap_t(m, "CapEff:\t", &cap_effective);
  298. render_cap_t(m, "CapBnd:\t", &cap_bset);
  299. render_cap_t(m, "CapAmb:\t", &cap_ambient);
  300. }
  301. static inline void task_seccomp(struct seq_file *m, struct task_struct *p)
  302. {
  303. seq_put_decimal_ull(m, "NoNewPrivs:\t", task_no_new_privs(p));
  304. #ifdef CONFIG_SECCOMP
  305. seq_put_decimal_ull(m, "\nSeccomp:\t", p->seccomp.mode);
  306. #endif
  307. seq_putc(m, '\n');
  308. }
  309. static inline void task_context_switch_counts(struct seq_file *m,
  310. struct task_struct *p)
  311. {
  312. seq_put_decimal_ull(m, "voluntary_ctxt_switches:\t", p->nvcsw);
  313. seq_put_decimal_ull(m, "\nnonvoluntary_ctxt_switches:\t", p->nivcsw);
  314. seq_putc(m, '\n');
  315. }
  316. static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
  317. {
  318. seq_printf(m, "Cpus_allowed:\t%*pb\n",
  319. cpumask_pr_args(&task->cpus_allowed));
  320. seq_printf(m, "Cpus_allowed_list:\t%*pbl\n",
  321. cpumask_pr_args(&task->cpus_allowed));
  322. }
  323. int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
  324. struct pid *pid, struct task_struct *task)
  325. {
  326. struct mm_struct *mm = get_task_mm(task);
  327. task_name(m, task);
  328. task_state(m, ns, pid, task);
  329. if (mm) {
  330. task_mem(m, mm);
  331. mmput(mm);
  332. }
  333. task_sig(m, task);
  334. task_cap(m, task);
  335. task_seccomp(m, task);
  336. task_cpus_allowed(m, task);
  337. cpuset_task_status_allowed(m, task);
  338. task_context_switch_counts(m, task);
  339. return 0;
  340. }
  341. static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
  342. struct pid *pid, struct task_struct *task, int whole)
  343. {
  344. unsigned long vsize, eip, esp, wchan = 0;
  345. int priority, nice;
  346. int tty_pgrp = -1, tty_nr = 0;
  347. sigset_t sigign, sigcatch;
  348. char state;
  349. pid_t ppid = 0, pgid = -1, sid = -1;
  350. int num_threads = 0;
  351. int permitted;
  352. struct mm_struct *mm;
  353. unsigned long long start_time;
  354. unsigned long cmin_flt = 0, cmaj_flt = 0;
  355. unsigned long min_flt = 0, maj_flt = 0;
  356. u64 cutime, cstime, utime, stime;
  357. u64 cgtime, gtime;
  358. unsigned long rsslim = 0;
  359. char tcomm[sizeof(task->comm)];
  360. unsigned long flags;
  361. state = *get_task_state(task);
  362. vsize = eip = esp = 0;
  363. permitted = ptrace_may_access(task, PTRACE_MODE_READ_FSCREDS | PTRACE_MODE_NOAUDIT);
  364. mm = get_task_mm(task);
  365. if (mm) {
  366. vsize = task_vsize(mm);
  367. /*
  368. * esp and eip are intentionally zeroed out. There is no
  369. * non-racy way to read them without freezing the task.
  370. * Programs that need reliable values can use ptrace(2).
  371. */
  372. }
  373. get_task_comm(tcomm, task);
  374. sigemptyset(&sigign);
  375. sigemptyset(&sigcatch);
  376. cutime = cstime = utime = stime = 0;
  377. cgtime = gtime = 0;
  378. if (lock_task_sighand(task, &flags)) {
  379. struct signal_struct *sig = task->signal;
  380. if (sig->tty) {
  381. struct pid *pgrp = tty_get_pgrp(sig->tty);
  382. tty_pgrp = pid_nr_ns(pgrp, ns);
  383. put_pid(pgrp);
  384. tty_nr = new_encode_dev(tty_devnum(sig->tty));
  385. }
  386. num_threads = get_nr_threads(task);
  387. collect_sigign_sigcatch(task, &sigign, &sigcatch);
  388. cmin_flt = sig->cmin_flt;
  389. cmaj_flt = sig->cmaj_flt;
  390. cutime = sig->cutime;
  391. cstime = sig->cstime;
  392. cgtime = sig->cgtime;
  393. rsslim = ACCESS_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
  394. /* add up live thread stats at the group level */
  395. if (whole) {
  396. struct task_struct *t = task;
  397. do {
  398. min_flt += t->min_flt;
  399. maj_flt += t->maj_flt;
  400. gtime += task_gtime(t);
  401. } while_each_thread(task, t);
  402. min_flt += sig->min_flt;
  403. maj_flt += sig->maj_flt;
  404. thread_group_cputime_adjusted(task, &utime, &stime);
  405. gtime += sig->gtime;
  406. }
  407. sid = task_session_nr_ns(task, ns);
  408. ppid = task_tgid_nr_ns(task->real_parent, ns);
  409. pgid = task_pgrp_nr_ns(task, ns);
  410. unlock_task_sighand(task, &flags);
  411. }
  412. if (permitted && (!whole || num_threads < 2))
  413. wchan = get_wchan(task);
  414. if (!whole) {
  415. min_flt = task->min_flt;
  416. maj_flt = task->maj_flt;
  417. task_cputime_adjusted(task, &utime, &stime);
  418. gtime = task_gtime(task);
  419. }
  420. /* scale priority and nice values from timeslices to -20..20 */
  421. /* to make it look like a "normal" Unix priority/nice value */
  422. priority = task_prio(task);
  423. nice = task_nice(task);
  424. /* convert nsec -> ticks */
  425. start_time = nsec_to_clock_t(task->real_start_time);
  426. seq_printf(m, "%d (%s) %c", pid_nr_ns(pid, ns), tcomm, state);
  427. seq_put_decimal_ll(m, " ", ppid);
  428. seq_put_decimal_ll(m, " ", pgid);
  429. seq_put_decimal_ll(m, " ", sid);
  430. seq_put_decimal_ll(m, " ", tty_nr);
  431. seq_put_decimal_ll(m, " ", tty_pgrp);
  432. seq_put_decimal_ull(m, " ", task->flags);
  433. seq_put_decimal_ull(m, " ", min_flt);
  434. seq_put_decimal_ull(m, " ", cmin_flt);
  435. seq_put_decimal_ull(m, " ", maj_flt);
  436. seq_put_decimal_ull(m, " ", cmaj_flt);
  437. seq_put_decimal_ull(m, " ", nsec_to_clock_t(utime));
  438. seq_put_decimal_ull(m, " ", nsec_to_clock_t(stime));
  439. seq_put_decimal_ll(m, " ", nsec_to_clock_t(cutime));
  440. seq_put_decimal_ll(m, " ", nsec_to_clock_t(cstime));
  441. seq_put_decimal_ll(m, " ", priority);
  442. seq_put_decimal_ll(m, " ", nice);
  443. seq_put_decimal_ll(m, " ", num_threads);
  444. seq_put_decimal_ull(m, " ", 0);
  445. seq_put_decimal_ull(m, " ", start_time);
  446. seq_put_decimal_ull(m, " ", vsize);
  447. seq_put_decimal_ull(m, " ", mm ? get_mm_rss(mm) : 0);
  448. seq_put_decimal_ull(m, " ", rsslim);
  449. seq_put_decimal_ull(m, " ", mm ? (permitted ? mm->start_code : 1) : 0);
  450. seq_put_decimal_ull(m, " ", mm ? (permitted ? mm->end_code : 1) : 0);
  451. seq_put_decimal_ull(m, " ", (permitted && mm) ? mm->start_stack : 0);
  452. seq_put_decimal_ull(m, " ", esp);
  453. seq_put_decimal_ull(m, " ", eip);
  454. /* The signal information here is obsolete.
  455. * It must be decimal for Linux 2.0 compatibility.
  456. * Use /proc/#/status for real-time signals.
  457. */
  458. seq_put_decimal_ull(m, " ", task->pending.signal.sig[0] & 0x7fffffffUL);
  459. seq_put_decimal_ull(m, " ", task->blocked.sig[0] & 0x7fffffffUL);
  460. seq_put_decimal_ull(m, " ", sigign.sig[0] & 0x7fffffffUL);
  461. seq_put_decimal_ull(m, " ", sigcatch.sig[0] & 0x7fffffffUL);
  462. /*
  463. * We used to output the absolute kernel address, but that's an
  464. * information leak - so instead we show a 0/1 flag here, to signal
  465. * to user-space whether there's a wchan field in /proc/PID/wchan.
  466. *
  467. * This works with older implementations of procps as well.
  468. */
  469. if (wchan)
  470. seq_puts(m, " 1");
  471. else
  472. seq_puts(m, " 0");
  473. seq_put_decimal_ull(m, " ", 0);
  474. seq_put_decimal_ull(m, " ", 0);
  475. seq_put_decimal_ll(m, " ", task->exit_signal);
  476. seq_put_decimal_ll(m, " ", task_cpu(task));
  477. seq_put_decimal_ull(m, " ", task->rt_priority);
  478. seq_put_decimal_ull(m, " ", task->policy);
  479. seq_put_decimal_ull(m, " ", delayacct_blkio_ticks(task));
  480. seq_put_decimal_ull(m, " ", nsec_to_clock_t(gtime));
  481. seq_put_decimal_ll(m, " ", nsec_to_clock_t(cgtime));
  482. if (mm && permitted) {
  483. seq_put_decimal_ull(m, " ", mm->start_data);
  484. seq_put_decimal_ull(m, " ", mm->end_data);
  485. seq_put_decimal_ull(m, " ", mm->start_brk);
  486. seq_put_decimal_ull(m, " ", mm->arg_start);
  487. seq_put_decimal_ull(m, " ", mm->arg_end);
  488. seq_put_decimal_ull(m, " ", mm->env_start);
  489. seq_put_decimal_ull(m, " ", mm->env_end);
  490. } else
  491. seq_puts(m, " 0 0 0 0 0 0 0");
  492. if (permitted)
  493. seq_put_decimal_ll(m, " ", task->exit_code);
  494. else
  495. seq_puts(m, " 0");
  496. seq_putc(m, '\n');
  497. if (mm)
  498. mmput(mm);
  499. return 0;
  500. }
  501. int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
  502. struct pid *pid, struct task_struct *task)
  503. {
  504. return do_task_stat(m, ns, pid, task, 0);
  505. }
  506. int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
  507. struct pid *pid, struct task_struct *task)
  508. {
  509. return do_task_stat(m, ns, pid, task, 1);
  510. }
  511. int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
  512. struct pid *pid, struct task_struct *task)
  513. {
  514. unsigned long size = 0, resident = 0, shared = 0, text = 0, data = 0;
  515. struct mm_struct *mm = get_task_mm(task);
  516. if (mm) {
  517. size = task_statm(mm, &shared, &text, &data, &resident);
  518. mmput(mm);
  519. }
  520. /*
  521. * For quick read, open code by putting numbers directly
  522. * expected format is
  523. * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
  524. * size, resident, shared, text, data);
  525. */
  526. seq_put_decimal_ull(m, "", size);
  527. seq_put_decimal_ull(m, " ", resident);
  528. seq_put_decimal_ull(m, " ", shared);
  529. seq_put_decimal_ull(m, " ", text);
  530. seq_put_decimal_ull(m, " ", 0);
  531. seq_put_decimal_ull(m, " ", data);
  532. seq_put_decimal_ull(m, " ", 0);
  533. seq_putc(m, '\n');
  534. return 0;
  535. }
  536. #ifdef CONFIG_PROC_CHILDREN
  537. static struct pid *
  538. get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
  539. {
  540. struct task_struct *start, *task;
  541. struct pid *pid = NULL;
  542. read_lock(&tasklist_lock);
  543. start = pid_task(proc_pid(inode), PIDTYPE_PID);
  544. if (!start)
  545. goto out;
  546. /*
  547. * Lets try to continue searching first, this gives
  548. * us significant speedup on children-rich processes.
  549. */
  550. if (pid_prev) {
  551. task = pid_task(pid_prev, PIDTYPE_PID);
  552. if (task && task->real_parent == start &&
  553. !(list_empty(&task->sibling))) {
  554. if (list_is_last(&task->sibling, &start->children))
  555. goto out;
  556. task = list_first_entry(&task->sibling,
  557. struct task_struct, sibling);
  558. pid = get_pid(task_pid(task));
  559. goto out;
  560. }
  561. }
  562. /*
  563. * Slow search case.
  564. *
  565. * We might miss some children here if children
  566. * are exited while we were not holding the lock,
  567. * but it was never promised to be accurate that
  568. * much.
  569. *
  570. * "Just suppose that the parent sleeps, but N children
  571. * exit after we printed their tids. Now the slow paths
  572. * skips N extra children, we miss N tasks." (c)
  573. *
  574. * So one need to stop or freeze the leader and all
  575. * its children to get a precise result.
  576. */
  577. list_for_each_entry(task, &start->children, sibling) {
  578. if (pos-- == 0) {
  579. pid = get_pid(task_pid(task));
  580. break;
  581. }
  582. }
  583. out:
  584. read_unlock(&tasklist_lock);
  585. return pid;
  586. }
  587. static int children_seq_show(struct seq_file *seq, void *v)
  588. {
  589. struct inode *inode = seq->private;
  590. pid_t pid;
  591. pid = pid_nr_ns(v, inode->i_sb->s_fs_info);
  592. seq_printf(seq, "%d ", pid);
  593. return 0;
  594. }
  595. static void *children_seq_start(struct seq_file *seq, loff_t *pos)
  596. {
  597. return get_children_pid(seq->private, NULL, *pos);
  598. }
  599. static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  600. {
  601. struct pid *pid;
  602. pid = get_children_pid(seq->private, v, *pos + 1);
  603. put_pid(v);
  604. ++*pos;
  605. return pid;
  606. }
  607. static void children_seq_stop(struct seq_file *seq, void *v)
  608. {
  609. put_pid(v);
  610. }
  611. static const struct seq_operations children_seq_ops = {
  612. .start = children_seq_start,
  613. .next = children_seq_next,
  614. .stop = children_seq_stop,
  615. .show = children_seq_show,
  616. };
  617. static int children_seq_open(struct inode *inode, struct file *file)
  618. {
  619. struct seq_file *m;
  620. int ret;
  621. ret = seq_open(file, &children_seq_ops);
  622. if (ret)
  623. return ret;
  624. m = file->private_data;
  625. m->private = inode;
  626. return ret;
  627. }
  628. int children_seq_release(struct inode *inode, struct file *file)
  629. {
  630. seq_release(inode, file);
  631. return 0;
  632. }
  633. const struct file_operations proc_tid_children_operations = {
  634. .open = children_seq_open,
  635. .read = seq_read,
  636. .llseek = seq_lseek,
  637. .release = children_seq_release,
  638. };
  639. #endif /* CONFIG_PROC_CHILDREN */