array.c 20 KB

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