array.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704
  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/user_namespace.h>
  84. #include <asm/pgtable.h>
  85. #include <asm/processor.h>
  86. #include "internal.h"
  87. static inline void task_name(struct seq_file *m, struct task_struct *p)
  88. {
  89. int i;
  90. char *buf, *end;
  91. char *name;
  92. char tcomm[sizeof(p->comm)];
  93. get_task_comm(tcomm, p);
  94. seq_puts(m, "Name:\t");
  95. end = m->buf + m->size;
  96. buf = m->buf + m->count;
  97. name = tcomm;
  98. i = sizeof(tcomm);
  99. while (i && (buf < end)) {
  100. unsigned char c = *name;
  101. name++;
  102. i--;
  103. *buf = c;
  104. if (!c)
  105. break;
  106. if (c == '\\') {
  107. buf++;
  108. if (buf < end)
  109. *buf++ = c;
  110. continue;
  111. }
  112. if (c == '\n') {
  113. *buf++ = '\\';
  114. if (buf < end)
  115. *buf++ = 'n';
  116. continue;
  117. }
  118. buf++;
  119. }
  120. m->count = buf - m->buf;
  121. seq_putc(m, '\n');
  122. }
  123. /*
  124. * The task state array is a strange "bitmap" of
  125. * reasons to sleep. Thus "running" is zero, and
  126. * you can test for combinations of others with
  127. * simple bit tests.
  128. */
  129. static const char * const task_state_array[] = {
  130. "R (running)", /* 0 */
  131. "S (sleeping)", /* 1 */
  132. "D (disk sleep)", /* 2 */
  133. "T (stopped)", /* 4 */
  134. "t (tracing stop)", /* 8 */
  135. "Z (zombie)", /* 16 */
  136. "X (dead)", /* 32 */
  137. "x (dead)", /* 64 */
  138. "K (wakekill)", /* 128 */
  139. "W (waking)", /* 256 */
  140. };
  141. static inline const char *get_task_state(struct task_struct *tsk)
  142. {
  143. unsigned int state = (tsk->state & TASK_REPORT) | tsk->exit_state;
  144. const char * const *p = &task_state_array[0];
  145. BUILD_BUG_ON(1 + ilog2(TASK_STATE_MAX) != ARRAY_SIZE(task_state_array));
  146. while (state) {
  147. p++;
  148. state >>= 1;
  149. }
  150. return *p;
  151. }
  152. static inline void task_state(struct seq_file *m, struct pid_namespace *ns,
  153. struct pid *pid, struct task_struct *p)
  154. {
  155. struct user_namespace *user_ns = current_user_ns();
  156. struct group_info *group_info;
  157. int g;
  158. struct fdtable *fdt = NULL;
  159. const struct cred *cred;
  160. pid_t ppid, tpid;
  161. rcu_read_lock();
  162. ppid = pid_alive(p) ?
  163. task_tgid_nr_ns(rcu_dereference(p->real_parent), ns) : 0;
  164. tpid = 0;
  165. if (pid_alive(p)) {
  166. struct task_struct *tracer = ptrace_parent(p);
  167. if (tracer)
  168. tpid = task_pid_nr_ns(tracer, ns);
  169. }
  170. cred = get_task_cred(p);
  171. seq_printf(m,
  172. "State:\t%s\n"
  173. "Tgid:\t%d\n"
  174. "Pid:\t%d\n"
  175. "PPid:\t%d\n"
  176. "TracerPid:\t%d\n"
  177. "Uid:\t%d\t%d\t%d\t%d\n"
  178. "Gid:\t%d\t%d\t%d\t%d\n",
  179. get_task_state(p),
  180. task_tgid_nr_ns(p, ns),
  181. pid_nr_ns(pid, ns),
  182. ppid, tpid,
  183. from_kuid_munged(user_ns, cred->uid),
  184. from_kuid_munged(user_ns, cred->euid),
  185. from_kuid_munged(user_ns, cred->suid),
  186. from_kuid_munged(user_ns, cred->fsuid),
  187. from_kgid_munged(user_ns, cred->gid),
  188. from_kgid_munged(user_ns, cred->egid),
  189. from_kgid_munged(user_ns, cred->sgid),
  190. from_kgid_munged(user_ns, cred->fsgid));
  191. task_lock(p);
  192. if (p->files)
  193. fdt = files_fdtable(p->files);
  194. seq_printf(m,
  195. "FDSize:\t%d\n"
  196. "Groups:\t",
  197. fdt ? fdt->max_fds : 0);
  198. rcu_read_unlock();
  199. group_info = cred->group_info;
  200. task_unlock(p);
  201. for (g = 0; g < min(group_info->ngroups, NGROUPS_SMALL); g++)
  202. seq_printf(m, "%d ",
  203. from_kgid_munged(user_ns, GROUP_AT(group_info, g)));
  204. put_cred(cred);
  205. seq_putc(m, '\n');
  206. }
  207. static 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_printf(m, "%x", 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_printf(m, "Threads:\t%d\n", num_threads);
  262. seq_printf(m, "SigQ:\t%lu/%lu\n", qsize, qlim);
  263. /* render them all */
  264. render_sigset_t(m, "SigPnd:\t", &pending);
  265. render_sigset_t(m, "ShdPnd:\t", &shpending);
  266. render_sigset_t(m, "SigBlk:\t", &blocked);
  267. render_sigset_t(m, "SigIgn:\t", &ignored);
  268. render_sigset_t(m, "SigCgt:\t", &caught);
  269. }
  270. static void render_cap_t(struct seq_file *m, const char *header,
  271. kernel_cap_t *a)
  272. {
  273. unsigned __capi;
  274. seq_puts(m, header);
  275. CAP_FOR_EACH_U32(__capi) {
  276. seq_printf(m, "%08x",
  277. a->cap[(_KERNEL_CAPABILITY_U32S-1) - __capi]);
  278. }
  279. seq_putc(m, '\n');
  280. }
  281. static inline void task_cap(struct seq_file *m, struct task_struct *p)
  282. {
  283. const struct cred *cred;
  284. kernel_cap_t cap_inheritable, cap_permitted, cap_effective, cap_bset;
  285. rcu_read_lock();
  286. cred = __task_cred(p);
  287. cap_inheritable = cred->cap_inheritable;
  288. cap_permitted = cred->cap_permitted;
  289. cap_effective = cred->cap_effective;
  290. cap_bset = cred->cap_bset;
  291. rcu_read_unlock();
  292. render_cap_t(m, "CapInh:\t", &cap_inheritable);
  293. render_cap_t(m, "CapPrm:\t", &cap_permitted);
  294. render_cap_t(m, "CapEff:\t", &cap_effective);
  295. render_cap_t(m, "CapBnd:\t", &cap_bset);
  296. }
  297. static inline void task_context_switch_counts(struct seq_file *m,
  298. struct task_struct *p)
  299. {
  300. seq_printf(m, "voluntary_ctxt_switches:\t%lu\n"
  301. "nonvoluntary_ctxt_switches:\t%lu\n",
  302. p->nvcsw,
  303. p->nivcsw);
  304. }
  305. static void task_cpus_allowed(struct seq_file *m, struct task_struct *task)
  306. {
  307. seq_puts(m, "Cpus_allowed:\t");
  308. seq_cpumask(m, &task->cpus_allowed);
  309. seq_putc(m, '\n');
  310. seq_puts(m, "Cpus_allowed_list:\t");
  311. seq_cpumask_list(m, &task->cpus_allowed);
  312. seq_putc(m, '\n');
  313. }
  314. int proc_pid_status(struct seq_file *m, struct pid_namespace *ns,
  315. struct pid *pid, struct task_struct *task)
  316. {
  317. struct mm_struct *mm = get_task_mm(task);
  318. task_name(m, task);
  319. task_state(m, ns, pid, task);
  320. if (mm) {
  321. task_mem(m, mm);
  322. mmput(mm);
  323. }
  324. task_sig(m, task);
  325. task_cap(m, task);
  326. task_cpus_allowed(m, task);
  327. cpuset_task_status_allowed(m, task);
  328. task_context_switch_counts(m, task);
  329. return 0;
  330. }
  331. static int do_task_stat(struct seq_file *m, struct pid_namespace *ns,
  332. struct pid *pid, struct task_struct *task, int whole)
  333. {
  334. unsigned long vsize, eip, esp, wchan = ~0UL;
  335. int priority, nice;
  336. int tty_pgrp = -1, tty_nr = 0;
  337. sigset_t sigign, sigcatch;
  338. char state;
  339. pid_t ppid = 0, pgid = -1, sid = -1;
  340. int num_threads = 0;
  341. int permitted;
  342. struct mm_struct *mm;
  343. unsigned long long start_time;
  344. unsigned long cmin_flt = 0, cmaj_flt = 0;
  345. unsigned long min_flt = 0, maj_flt = 0;
  346. cputime_t cutime, cstime, utime, stime;
  347. cputime_t cgtime, gtime;
  348. unsigned long rsslim = 0;
  349. char tcomm[sizeof(task->comm)];
  350. unsigned long flags;
  351. state = *get_task_state(task);
  352. vsize = eip = esp = 0;
  353. permitted = ptrace_may_access(task, PTRACE_MODE_READ | PTRACE_MODE_NOAUDIT);
  354. mm = get_task_mm(task);
  355. if (mm) {
  356. vsize = task_vsize(mm);
  357. if (permitted) {
  358. eip = KSTK_EIP(task);
  359. esp = KSTK_ESP(task);
  360. }
  361. }
  362. get_task_comm(tcomm, task);
  363. sigemptyset(&sigign);
  364. sigemptyset(&sigcatch);
  365. cutime = cstime = utime = stime = 0;
  366. cgtime = gtime = 0;
  367. if (lock_task_sighand(task, &flags)) {
  368. struct signal_struct *sig = task->signal;
  369. if (sig->tty) {
  370. struct pid *pgrp = tty_get_pgrp(sig->tty);
  371. tty_pgrp = pid_nr_ns(pgrp, ns);
  372. put_pid(pgrp);
  373. tty_nr = new_encode_dev(tty_devnum(sig->tty));
  374. }
  375. num_threads = get_nr_threads(task);
  376. collect_sigign_sigcatch(task, &sigign, &sigcatch);
  377. cmin_flt = sig->cmin_flt;
  378. cmaj_flt = sig->cmaj_flt;
  379. cutime = sig->cutime;
  380. cstime = sig->cstime;
  381. cgtime = sig->cgtime;
  382. rsslim = ACCESS_ONCE(sig->rlim[RLIMIT_RSS].rlim_cur);
  383. /* add up live thread stats at the group level */
  384. if (whole) {
  385. struct task_struct *t = task;
  386. do {
  387. min_flt += t->min_flt;
  388. maj_flt += t->maj_flt;
  389. gtime += t->gtime;
  390. t = next_thread(t);
  391. } while (t != task);
  392. min_flt += sig->min_flt;
  393. maj_flt += sig->maj_flt;
  394. thread_group_times(task, &utime, &stime);
  395. gtime += sig->gtime;
  396. }
  397. sid = task_session_nr_ns(task, ns);
  398. ppid = task_tgid_nr_ns(task->real_parent, ns);
  399. pgid = task_pgrp_nr_ns(task, ns);
  400. unlock_task_sighand(task, &flags);
  401. }
  402. if (permitted && (!whole || num_threads < 2))
  403. wchan = get_wchan(task);
  404. if (!whole) {
  405. min_flt = task->min_flt;
  406. maj_flt = task->maj_flt;
  407. task_times(task, &utime, &stime);
  408. gtime = task->gtime;
  409. }
  410. /* scale priority and nice values from timeslices to -20..20 */
  411. /* to make it look like a "normal" Unix priority/nice value */
  412. priority = task_prio(task);
  413. nice = task_nice(task);
  414. /* Temporary variable needed for gcc-2.96 */
  415. /* convert timespec -> nsec*/
  416. start_time =
  417. (unsigned long long)task->real_start_time.tv_sec * NSEC_PER_SEC
  418. + task->real_start_time.tv_nsec;
  419. /* convert nsec -> ticks */
  420. start_time = nsec_to_clock_t(start_time);
  421. seq_printf(m, "%d (%s) %c", pid_nr_ns(pid, ns), tcomm, state);
  422. seq_put_decimal_ll(m, ' ', ppid);
  423. seq_put_decimal_ll(m, ' ', pgid);
  424. seq_put_decimal_ll(m, ' ', sid);
  425. seq_put_decimal_ll(m, ' ', tty_nr);
  426. seq_put_decimal_ll(m, ' ', tty_pgrp);
  427. seq_put_decimal_ull(m, ' ', task->flags);
  428. seq_put_decimal_ull(m, ' ', min_flt);
  429. seq_put_decimal_ull(m, ' ', cmin_flt);
  430. seq_put_decimal_ull(m, ' ', maj_flt);
  431. seq_put_decimal_ull(m, ' ', cmaj_flt);
  432. seq_put_decimal_ull(m, ' ', cputime_to_clock_t(utime));
  433. seq_put_decimal_ull(m, ' ', cputime_to_clock_t(stime));
  434. seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cutime));
  435. seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cstime));
  436. seq_put_decimal_ll(m, ' ', priority);
  437. seq_put_decimal_ll(m, ' ', nice);
  438. seq_put_decimal_ll(m, ' ', num_threads);
  439. seq_put_decimal_ull(m, ' ', 0);
  440. seq_put_decimal_ull(m, ' ', start_time);
  441. seq_put_decimal_ull(m, ' ', vsize);
  442. seq_put_decimal_ull(m, ' ', mm ? get_mm_rss(mm) : 0);
  443. seq_put_decimal_ull(m, ' ', rsslim);
  444. seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->start_code : 1) : 0);
  445. seq_put_decimal_ull(m, ' ', mm ? (permitted ? mm->end_code : 1) : 0);
  446. seq_put_decimal_ull(m, ' ', (permitted && mm) ? mm->start_stack : 0);
  447. seq_put_decimal_ull(m, ' ', esp);
  448. seq_put_decimal_ull(m, ' ', eip);
  449. /* The signal information here is obsolete.
  450. * It must be decimal for Linux 2.0 compatibility.
  451. * Use /proc/#/status for real-time signals.
  452. */
  453. seq_put_decimal_ull(m, ' ', task->pending.signal.sig[0] & 0x7fffffffUL);
  454. seq_put_decimal_ull(m, ' ', task->blocked.sig[0] & 0x7fffffffUL);
  455. seq_put_decimal_ull(m, ' ', sigign.sig[0] & 0x7fffffffUL);
  456. seq_put_decimal_ull(m, ' ', sigcatch.sig[0] & 0x7fffffffUL);
  457. seq_put_decimal_ull(m, ' ', wchan);
  458. seq_put_decimal_ull(m, ' ', 0);
  459. seq_put_decimal_ull(m, ' ', 0);
  460. seq_put_decimal_ll(m, ' ', task->exit_signal);
  461. seq_put_decimal_ll(m, ' ', task_cpu(task));
  462. seq_put_decimal_ull(m, ' ', task->rt_priority);
  463. seq_put_decimal_ull(m, ' ', task->policy);
  464. seq_put_decimal_ull(m, ' ', delayacct_blkio_ticks(task));
  465. seq_put_decimal_ull(m, ' ', cputime_to_clock_t(gtime));
  466. seq_put_decimal_ll(m, ' ', cputime_to_clock_t(cgtime));
  467. if (mm && permitted) {
  468. seq_put_decimal_ull(m, ' ', mm->start_data);
  469. seq_put_decimal_ull(m, ' ', mm->end_data);
  470. seq_put_decimal_ull(m, ' ', mm->start_brk);
  471. seq_put_decimal_ull(m, ' ', mm->arg_start);
  472. seq_put_decimal_ull(m, ' ', mm->arg_end);
  473. seq_put_decimal_ull(m, ' ', mm->env_start);
  474. seq_put_decimal_ull(m, ' ', mm->env_end);
  475. } else
  476. seq_printf(m, " 0 0 0 0 0 0 0");
  477. if (permitted)
  478. seq_put_decimal_ll(m, ' ', task->exit_code);
  479. else
  480. seq_put_decimal_ll(m, ' ', 0);
  481. seq_putc(m, '\n');
  482. if (mm)
  483. mmput(mm);
  484. return 0;
  485. }
  486. int proc_tid_stat(struct seq_file *m, struct pid_namespace *ns,
  487. struct pid *pid, struct task_struct *task)
  488. {
  489. return do_task_stat(m, ns, pid, task, 0);
  490. }
  491. int proc_tgid_stat(struct seq_file *m, struct pid_namespace *ns,
  492. struct pid *pid, struct task_struct *task)
  493. {
  494. return do_task_stat(m, ns, pid, task, 1);
  495. }
  496. int proc_pid_statm(struct seq_file *m, struct pid_namespace *ns,
  497. struct pid *pid, struct task_struct *task)
  498. {
  499. unsigned long size = 0, resident = 0, shared = 0, text = 0, data = 0;
  500. struct mm_struct *mm = get_task_mm(task);
  501. if (mm) {
  502. size = task_statm(mm, &shared, &text, &data, &resident);
  503. mmput(mm);
  504. }
  505. /*
  506. * For quick read, open code by putting numbers directly
  507. * expected format is
  508. * seq_printf(m, "%lu %lu %lu %lu 0 %lu 0\n",
  509. * size, resident, shared, text, data);
  510. */
  511. seq_put_decimal_ull(m, 0, size);
  512. seq_put_decimal_ull(m, ' ', resident);
  513. seq_put_decimal_ull(m, ' ', shared);
  514. seq_put_decimal_ull(m, ' ', text);
  515. seq_put_decimal_ull(m, ' ', 0);
  516. seq_put_decimal_ull(m, ' ', data);
  517. seq_put_decimal_ull(m, ' ', 0);
  518. seq_putc(m, '\n');
  519. return 0;
  520. }
  521. #ifdef CONFIG_CHECKPOINT_RESTORE
  522. static struct pid *
  523. get_children_pid(struct inode *inode, struct pid *pid_prev, loff_t pos)
  524. {
  525. struct task_struct *start, *task;
  526. struct pid *pid = NULL;
  527. read_lock(&tasklist_lock);
  528. start = pid_task(proc_pid(inode), PIDTYPE_PID);
  529. if (!start)
  530. goto out;
  531. /*
  532. * Lets try to continue searching first, this gives
  533. * us significant speedup on children-rich processes.
  534. */
  535. if (pid_prev) {
  536. task = pid_task(pid_prev, PIDTYPE_PID);
  537. if (task && task->real_parent == start &&
  538. !(list_empty(&task->sibling))) {
  539. if (list_is_last(&task->sibling, &start->children))
  540. goto out;
  541. task = list_first_entry(&task->sibling,
  542. struct task_struct, sibling);
  543. pid = get_pid(task_pid(task));
  544. goto out;
  545. }
  546. }
  547. /*
  548. * Slow search case.
  549. *
  550. * We might miss some children here if children
  551. * are exited while we were not holding the lock,
  552. * but it was never promised to be accurate that
  553. * much.
  554. *
  555. * "Just suppose that the parent sleeps, but N children
  556. * exit after we printed their tids. Now the slow paths
  557. * skips N extra children, we miss N tasks." (c)
  558. *
  559. * So one need to stop or freeze the leader and all
  560. * its children to get a precise result.
  561. */
  562. list_for_each_entry(task, &start->children, sibling) {
  563. if (pos-- == 0) {
  564. pid = get_pid(task_pid(task));
  565. break;
  566. }
  567. }
  568. out:
  569. read_unlock(&tasklist_lock);
  570. return pid;
  571. }
  572. static int children_seq_show(struct seq_file *seq, void *v)
  573. {
  574. struct inode *inode = seq->private;
  575. pid_t pid;
  576. pid = pid_nr_ns(v, inode->i_sb->s_fs_info);
  577. return seq_printf(seq, "%d ", pid);
  578. }
  579. static void *children_seq_start(struct seq_file *seq, loff_t *pos)
  580. {
  581. return get_children_pid(seq->private, NULL, *pos);
  582. }
  583. static void *children_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  584. {
  585. struct pid *pid;
  586. pid = get_children_pid(seq->private, v, *pos + 1);
  587. put_pid(v);
  588. ++*pos;
  589. return pid;
  590. }
  591. static void children_seq_stop(struct seq_file *seq, void *v)
  592. {
  593. put_pid(v);
  594. }
  595. static const struct seq_operations children_seq_ops = {
  596. .start = children_seq_start,
  597. .next = children_seq_next,
  598. .stop = children_seq_stop,
  599. .show = children_seq_show,
  600. };
  601. static int children_seq_open(struct inode *inode, struct file *file)
  602. {
  603. struct seq_file *m;
  604. int ret;
  605. ret = seq_open(file, &children_seq_ops);
  606. if (ret)
  607. return ret;
  608. m = file->private_data;
  609. m->private = inode;
  610. return ret;
  611. }
  612. int children_seq_release(struct inode *inode, struct file *file)
  613. {
  614. seq_release(inode, file);
  615. return 0;
  616. }
  617. const struct file_operations proc_tid_children_operations = {
  618. .open = children_seq_open,
  619. .read = seq_read,
  620. .llseek = seq_lseek,
  621. .release = children_seq_release,
  622. };
  623. #endif /* CONFIG_CHECKPOINT_RESTORE */