exit.c 42 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636
  1. /*
  2. * linux/kernel/exit.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. #include <linux/mm.h>
  7. #include <linux/slab.h>
  8. #include <linux/interrupt.h>
  9. #include <linux/module.h>
  10. #include <linux/capability.h>
  11. #include <linux/completion.h>
  12. #include <linux/personality.h>
  13. #include <linux/tty.h>
  14. #include <linux/iocontext.h>
  15. #include <linux/key.h>
  16. #include <linux/security.h>
  17. #include <linux/cpu.h>
  18. #include <linux/acct.h>
  19. #include <linux/tsacct_kern.h>
  20. #include <linux/file.h>
  21. #include <linux/fdtable.h>
  22. #include <linux/freezer.h>
  23. #include <linux/binfmts.h>
  24. #include <linux/nsproxy.h>
  25. #include <linux/pid_namespace.h>
  26. #include <linux/ptrace.h>
  27. #include <linux/profile.h>
  28. #include <linux/mount.h>
  29. #include <linux/proc_fs.h>
  30. #include <linux/kthread.h>
  31. #include <linux/mempolicy.h>
  32. #include <linux/taskstats_kern.h>
  33. #include <linux/delayacct.h>
  34. #include <linux/cgroup.h>
  35. #include <linux/syscalls.h>
  36. #include <linux/signal.h>
  37. #include <linux/posix-timers.h>
  38. #include <linux/cn_proc.h>
  39. #include <linux/mutex.h>
  40. #include <linux/futex.h>
  41. #include <linux/pipe_fs_i.h>
  42. #include <linux/audit.h> /* for audit_free() */
  43. #include <linux/resource.h>
  44. #include <linux/blkdev.h>
  45. #include <linux/task_io_accounting_ops.h>
  46. #include <linux/tracehook.h>
  47. #include <linux/fs_struct.h>
  48. #include <linux/init_task.h>
  49. #include <linux/perf_event.h>
  50. #include <trace/events/sched.h>
  51. #include <linux/hw_breakpoint.h>
  52. #include <linux/oom.h>
  53. #include <linux/writeback.h>
  54. #include <linux/shm.h>
  55. #include <asm/uaccess.h>
  56. #include <asm/unistd.h>
  57. #include <asm/pgtable.h>
  58. #include <asm/mmu_context.h>
  59. static void exit_mm(struct task_struct *tsk);
  60. static void __unhash_process(struct task_struct *p, bool group_dead)
  61. {
  62. nr_threads--;
  63. detach_pid(p, PIDTYPE_PID);
  64. if (group_dead) {
  65. detach_pid(p, PIDTYPE_PGID);
  66. detach_pid(p, PIDTYPE_SID);
  67. list_del_rcu(&p->tasks);
  68. list_del_init(&p->sibling);
  69. __this_cpu_dec(process_counts);
  70. }
  71. list_del_rcu(&p->thread_group);
  72. list_del_rcu(&p->thread_node);
  73. }
  74. /*
  75. * This function expects the tasklist_lock write-locked.
  76. */
  77. static void __exit_signal(struct task_struct *tsk)
  78. {
  79. struct signal_struct *sig = tsk->signal;
  80. bool group_dead = thread_group_leader(tsk);
  81. struct sighand_struct *sighand;
  82. struct tty_struct *uninitialized_var(tty);
  83. cputime_t utime, stime;
  84. sighand = rcu_dereference_check(tsk->sighand,
  85. lockdep_tasklist_lock_is_held());
  86. spin_lock(&sighand->siglock);
  87. posix_cpu_timers_exit(tsk);
  88. if (group_dead) {
  89. posix_cpu_timers_exit_group(tsk);
  90. tty = sig->tty;
  91. sig->tty = NULL;
  92. } else {
  93. /*
  94. * This can only happen if the caller is de_thread().
  95. * FIXME: this is the temporary hack, we should teach
  96. * posix-cpu-timers to handle this case correctly.
  97. */
  98. if (unlikely(has_group_leader_pid(tsk)))
  99. posix_cpu_timers_exit_group(tsk);
  100. /*
  101. * If there is any task waiting for the group exit
  102. * then notify it:
  103. */
  104. if (sig->notify_count > 0 && !--sig->notify_count)
  105. wake_up_process(sig->group_exit_task);
  106. if (tsk == sig->curr_target)
  107. sig->curr_target = next_thread(tsk);
  108. /*
  109. * Accumulate here the counters for all threads but the
  110. * group leader as they die, so they can be added into
  111. * the process-wide totals when those are taken.
  112. * The group leader stays around as a zombie as long
  113. * as there are other threads. When it gets reaped,
  114. * the exit.c code will add its counts into these totals.
  115. * We won't ever get here for the group leader, since it
  116. * will have been the last reference on the signal_struct.
  117. */
  118. task_cputime(tsk, &utime, &stime);
  119. sig->utime += utime;
  120. sig->stime += stime;
  121. sig->gtime += task_gtime(tsk);
  122. sig->min_flt += tsk->min_flt;
  123. sig->maj_flt += tsk->maj_flt;
  124. sig->nvcsw += tsk->nvcsw;
  125. sig->nivcsw += tsk->nivcsw;
  126. sig->inblock += task_io_get_inblock(tsk);
  127. sig->oublock += task_io_get_oublock(tsk);
  128. task_io_accounting_add(&sig->ioac, &tsk->ioac);
  129. sig->sum_sched_runtime += tsk->se.sum_exec_runtime;
  130. }
  131. sig->nr_threads--;
  132. __unhash_process(tsk, group_dead);
  133. /*
  134. * Do this under ->siglock, we can race with another thread
  135. * doing sigqueue_free() if we have SIGQUEUE_PREALLOC signals.
  136. */
  137. flush_sigqueue(&tsk->pending);
  138. tsk->sighand = NULL;
  139. spin_unlock(&sighand->siglock);
  140. __cleanup_sighand(sighand);
  141. clear_tsk_thread_flag(tsk, TIF_SIGPENDING);
  142. if (group_dead) {
  143. flush_sigqueue(&sig->shared_pending);
  144. tty_kref_put(tty);
  145. }
  146. }
  147. static void delayed_put_task_struct(struct rcu_head *rhp)
  148. {
  149. struct task_struct *tsk = container_of(rhp, struct task_struct, rcu);
  150. perf_event_delayed_put(tsk);
  151. trace_sched_process_free(tsk);
  152. put_task_struct(tsk);
  153. }
  154. void release_task(struct task_struct *p)
  155. {
  156. struct task_struct *leader;
  157. int zap_leader;
  158. repeat:
  159. /* don't need to get the RCU readlock here - the process is dead and
  160. * can't be modifying its own credentials. But shut RCU-lockdep up */
  161. rcu_read_lock();
  162. atomic_dec(&__task_cred(p)->user->processes);
  163. rcu_read_unlock();
  164. proc_flush_task(p);
  165. write_lock_irq(&tasklist_lock);
  166. ptrace_release_task(p);
  167. __exit_signal(p);
  168. /*
  169. * If we are the last non-leader member of the thread
  170. * group, and the leader is zombie, then notify the
  171. * group leader's parent process. (if it wants notification.)
  172. */
  173. zap_leader = 0;
  174. leader = p->group_leader;
  175. if (leader != p && thread_group_empty(leader)
  176. && leader->exit_state == EXIT_ZOMBIE) {
  177. /*
  178. * If we were the last child thread and the leader has
  179. * exited already, and the leader's parent ignores SIGCHLD,
  180. * then we are the one who should release the leader.
  181. */
  182. zap_leader = do_notify_parent(leader, leader->exit_signal);
  183. if (zap_leader)
  184. leader->exit_state = EXIT_DEAD;
  185. }
  186. write_unlock_irq(&tasklist_lock);
  187. release_thread(p);
  188. call_rcu(&p->rcu, delayed_put_task_struct);
  189. p = leader;
  190. if (unlikely(zap_leader))
  191. goto repeat;
  192. }
  193. /*
  194. * This checks not only the pgrp, but falls back on the pid if no
  195. * satisfactory pgrp is found. I dunno - gdb doesn't work correctly
  196. * without this...
  197. *
  198. * The caller must hold rcu lock or the tasklist lock.
  199. */
  200. struct pid *session_of_pgrp(struct pid *pgrp)
  201. {
  202. struct task_struct *p;
  203. struct pid *sid = NULL;
  204. p = pid_task(pgrp, PIDTYPE_PGID);
  205. if (p == NULL)
  206. p = pid_task(pgrp, PIDTYPE_PID);
  207. if (p != NULL)
  208. sid = task_session(p);
  209. return sid;
  210. }
  211. /*
  212. * Determine if a process group is "orphaned", according to the POSIX
  213. * definition in 2.2.2.52. Orphaned process groups are not to be affected
  214. * by terminal-generated stop signals. Newly orphaned process groups are
  215. * to receive a SIGHUP and a SIGCONT.
  216. *
  217. * "I ask you, have you ever known what it is to be an orphan?"
  218. */
  219. static int will_become_orphaned_pgrp(struct pid *pgrp,
  220. struct task_struct *ignored_task)
  221. {
  222. struct task_struct *p;
  223. do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
  224. if ((p == ignored_task) ||
  225. (p->exit_state && thread_group_empty(p)) ||
  226. is_global_init(p->real_parent))
  227. continue;
  228. if (task_pgrp(p->real_parent) != pgrp &&
  229. task_session(p->real_parent) == task_session(p))
  230. return 0;
  231. } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
  232. return 1;
  233. }
  234. int is_current_pgrp_orphaned(void)
  235. {
  236. int retval;
  237. read_lock(&tasklist_lock);
  238. retval = will_become_orphaned_pgrp(task_pgrp(current), NULL);
  239. read_unlock(&tasklist_lock);
  240. return retval;
  241. }
  242. static bool has_stopped_jobs(struct pid *pgrp)
  243. {
  244. struct task_struct *p;
  245. do_each_pid_task(pgrp, PIDTYPE_PGID, p) {
  246. if (p->signal->flags & SIGNAL_STOP_STOPPED)
  247. return true;
  248. } while_each_pid_task(pgrp, PIDTYPE_PGID, p);
  249. return false;
  250. }
  251. /*
  252. * Check to see if any process groups have become orphaned as
  253. * a result of our exiting, and if they have any stopped jobs,
  254. * send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  255. */
  256. static void
  257. kill_orphaned_pgrp(struct task_struct *tsk, struct task_struct *parent)
  258. {
  259. struct pid *pgrp = task_pgrp(tsk);
  260. struct task_struct *ignored_task = tsk;
  261. if (!parent)
  262. /* exit: our father is in a different pgrp than
  263. * we are and we were the only connection outside.
  264. */
  265. parent = tsk->real_parent;
  266. else
  267. /* reparent: our child is in a different pgrp than
  268. * we are, and it was the only connection outside.
  269. */
  270. ignored_task = NULL;
  271. if (task_pgrp(parent) != pgrp &&
  272. task_session(parent) == task_session(tsk) &&
  273. will_become_orphaned_pgrp(pgrp, ignored_task) &&
  274. has_stopped_jobs(pgrp)) {
  275. __kill_pgrp_info(SIGHUP, SEND_SIG_PRIV, pgrp);
  276. __kill_pgrp_info(SIGCONT, SEND_SIG_PRIV, pgrp);
  277. }
  278. }
  279. #ifdef CONFIG_MEMCG
  280. /*
  281. * A task is exiting. If it owned this mm, find a new owner for the mm.
  282. */
  283. void mm_update_next_owner(struct mm_struct *mm)
  284. {
  285. struct task_struct *c, *g, *p = current;
  286. retry:
  287. /*
  288. * If the exiting or execing task is not the owner, it's
  289. * someone else's problem.
  290. */
  291. if (mm->owner != p)
  292. return;
  293. /*
  294. * The current owner is exiting/execing and there are no other
  295. * candidates. Do not leave the mm pointing to a possibly
  296. * freed task structure.
  297. */
  298. if (atomic_read(&mm->mm_users) <= 1) {
  299. mm->owner = NULL;
  300. return;
  301. }
  302. read_lock(&tasklist_lock);
  303. /*
  304. * Search in the children
  305. */
  306. list_for_each_entry(c, &p->children, sibling) {
  307. if (c->mm == mm)
  308. goto assign_new_owner;
  309. }
  310. /*
  311. * Search in the siblings
  312. */
  313. list_for_each_entry(c, &p->real_parent->children, sibling) {
  314. if (c->mm == mm)
  315. goto assign_new_owner;
  316. }
  317. /*
  318. * Search through everything else, we should not get here often.
  319. */
  320. for_each_process(g) {
  321. if (g->flags & PF_KTHREAD)
  322. continue;
  323. for_each_thread(g, c) {
  324. if (c->mm == mm)
  325. goto assign_new_owner;
  326. if (c->mm)
  327. break;
  328. }
  329. }
  330. read_unlock(&tasklist_lock);
  331. /*
  332. * We found no owner yet mm_users > 1: this implies that we are
  333. * most likely racing with swapoff (try_to_unuse()) or /proc or
  334. * ptrace or page migration (get_task_mm()). Mark owner as NULL.
  335. */
  336. mm->owner = NULL;
  337. return;
  338. assign_new_owner:
  339. BUG_ON(c == p);
  340. get_task_struct(c);
  341. /*
  342. * The task_lock protects c->mm from changing.
  343. * We always want mm->owner->mm == mm
  344. */
  345. task_lock(c);
  346. /*
  347. * Delay read_unlock() till we have the task_lock()
  348. * to ensure that c does not slip away underneath us
  349. */
  350. read_unlock(&tasklist_lock);
  351. if (c->mm != mm) {
  352. task_unlock(c);
  353. put_task_struct(c);
  354. goto retry;
  355. }
  356. mm->owner = c;
  357. task_unlock(c);
  358. put_task_struct(c);
  359. }
  360. #endif /* CONFIG_MEMCG */
  361. /*
  362. * Turn us into a lazy TLB process if we
  363. * aren't already..
  364. */
  365. static void exit_mm(struct task_struct *tsk)
  366. {
  367. struct mm_struct *mm = tsk->mm;
  368. struct core_state *core_state;
  369. mm_release(tsk, mm);
  370. if (!mm)
  371. return;
  372. sync_mm_rss(mm);
  373. /*
  374. * Serialize with any possible pending coredump.
  375. * We must hold mmap_sem around checking core_state
  376. * and clearing tsk->mm. The core-inducing thread
  377. * will increment ->nr_threads for each thread in the
  378. * group with ->mm != NULL.
  379. */
  380. down_read(&mm->mmap_sem);
  381. core_state = mm->core_state;
  382. if (core_state) {
  383. struct core_thread self;
  384. up_read(&mm->mmap_sem);
  385. self.task = tsk;
  386. self.next = xchg(&core_state->dumper.next, &self);
  387. /*
  388. * Implies mb(), the result of xchg() must be visible
  389. * to core_state->dumper.
  390. */
  391. if (atomic_dec_and_test(&core_state->nr_threads))
  392. complete(&core_state->startup);
  393. for (;;) {
  394. set_task_state(tsk, TASK_UNINTERRUPTIBLE);
  395. if (!self.task) /* see coredump_finish() */
  396. break;
  397. freezable_schedule();
  398. }
  399. __set_task_state(tsk, TASK_RUNNING);
  400. down_read(&mm->mmap_sem);
  401. }
  402. atomic_inc(&mm->mm_count);
  403. BUG_ON(mm != tsk->active_mm);
  404. /* more a memory barrier than a real lock */
  405. task_lock(tsk);
  406. tsk->mm = NULL;
  407. up_read(&mm->mmap_sem);
  408. enter_lazy_tlb(mm, current);
  409. task_unlock(tsk);
  410. mm_update_next_owner(mm);
  411. mmput(mm);
  412. clear_thread_flag(TIF_MEMDIE);
  413. }
  414. /*
  415. * When we die, we re-parent all our children, and try to:
  416. * 1. give them to another thread in our thread group, if such a member exists
  417. * 2. give it to the first ancestor process which prctl'd itself as a
  418. * child_subreaper for its children (like a service manager)
  419. * 3. give it to the init process (PID 1) in our pid namespace
  420. */
  421. static struct task_struct *find_new_reaper(struct task_struct *father)
  422. __releases(&tasklist_lock)
  423. __acquires(&tasklist_lock)
  424. {
  425. struct pid_namespace *pid_ns = task_active_pid_ns(father);
  426. struct task_struct *thread;
  427. thread = father;
  428. while_each_thread(father, thread) {
  429. if (thread->flags & PF_EXITING)
  430. continue;
  431. if (unlikely(pid_ns->child_reaper == father))
  432. pid_ns->child_reaper = thread;
  433. return thread;
  434. }
  435. if (unlikely(pid_ns->child_reaper == father)) {
  436. write_unlock_irq(&tasklist_lock);
  437. if (unlikely(pid_ns == &init_pid_ns)) {
  438. panic("Attempted to kill init! exitcode=0x%08x\n",
  439. father->signal->group_exit_code ?:
  440. father->exit_code);
  441. }
  442. zap_pid_ns_processes(pid_ns);
  443. write_lock_irq(&tasklist_lock);
  444. } else if (father->signal->has_child_subreaper) {
  445. struct task_struct *reaper;
  446. /*
  447. * Find the first ancestor marked as child_subreaper.
  448. * Note that the code below checks same_thread_group(reaper,
  449. * pid_ns->child_reaper). This is what we need to DTRT in a
  450. * PID namespace. However we still need the check above, see
  451. * http://marc.info/?l=linux-kernel&m=131385460420380
  452. */
  453. for (reaper = father->real_parent;
  454. reaper != &init_task;
  455. reaper = reaper->real_parent) {
  456. if (same_thread_group(reaper, pid_ns->child_reaper))
  457. break;
  458. if (!reaper->signal->is_child_subreaper)
  459. continue;
  460. thread = reaper;
  461. do {
  462. if (!(thread->flags & PF_EXITING))
  463. return reaper;
  464. } while_each_thread(reaper, thread);
  465. }
  466. }
  467. return pid_ns->child_reaper;
  468. }
  469. /*
  470. * Any that need to be release_task'd are put on the @dead list.
  471. */
  472. static void reparent_leader(struct task_struct *father, struct task_struct *p,
  473. struct list_head *dead)
  474. {
  475. list_move_tail(&p->sibling, &p->real_parent->children);
  476. if (p->exit_state == EXIT_DEAD)
  477. return;
  478. /*
  479. * If this is a threaded reparent there is no need to
  480. * notify anyone anything has happened.
  481. */
  482. if (same_thread_group(p->real_parent, father))
  483. return;
  484. /* We don't want people slaying init. */
  485. p->exit_signal = SIGCHLD;
  486. /* If it has exited notify the new parent about this child's death. */
  487. if (!p->ptrace &&
  488. p->exit_state == EXIT_ZOMBIE && thread_group_empty(p)) {
  489. if (do_notify_parent(p, p->exit_signal)) {
  490. p->exit_state = EXIT_DEAD;
  491. list_move_tail(&p->sibling, dead);
  492. }
  493. }
  494. kill_orphaned_pgrp(p, father);
  495. }
  496. static void forget_original_parent(struct task_struct *father)
  497. {
  498. struct task_struct *p, *n, *reaper;
  499. LIST_HEAD(dead_children);
  500. write_lock_irq(&tasklist_lock);
  501. /*
  502. * Note that exit_ptrace() and find_new_reaper() might
  503. * drop tasklist_lock and reacquire it.
  504. */
  505. exit_ptrace(father);
  506. reaper = find_new_reaper(father);
  507. list_for_each_entry_safe(p, n, &father->children, sibling) {
  508. struct task_struct *t = p;
  509. do {
  510. t->real_parent = reaper;
  511. if (t->parent == father) {
  512. BUG_ON(t->ptrace);
  513. t->parent = t->real_parent;
  514. }
  515. if (t->pdeath_signal)
  516. group_send_sig_info(t->pdeath_signal,
  517. SEND_SIG_NOINFO, t);
  518. } while_each_thread(p, t);
  519. reparent_leader(father, p, &dead_children);
  520. }
  521. write_unlock_irq(&tasklist_lock);
  522. BUG_ON(!list_empty(&father->children));
  523. list_for_each_entry_safe(p, n, &dead_children, sibling) {
  524. list_del_init(&p->sibling);
  525. release_task(p);
  526. }
  527. }
  528. /*
  529. * Send signals to all our closest relatives so that they know
  530. * to properly mourn us..
  531. */
  532. static void exit_notify(struct task_struct *tsk, int group_dead)
  533. {
  534. bool autoreap;
  535. /*
  536. * This does two things:
  537. *
  538. * A. Make init inherit all the child processes
  539. * B. Check to see if any process groups have become orphaned
  540. * as a result of our exiting, and if they have any stopped
  541. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  542. */
  543. forget_original_parent(tsk);
  544. write_lock_irq(&tasklist_lock);
  545. if (group_dead)
  546. kill_orphaned_pgrp(tsk->group_leader, NULL);
  547. if (unlikely(tsk->ptrace)) {
  548. int sig = thread_group_leader(tsk) &&
  549. thread_group_empty(tsk) &&
  550. !ptrace_reparented(tsk) ?
  551. tsk->exit_signal : SIGCHLD;
  552. autoreap = do_notify_parent(tsk, sig);
  553. } else if (thread_group_leader(tsk)) {
  554. autoreap = thread_group_empty(tsk) &&
  555. do_notify_parent(tsk, tsk->exit_signal);
  556. } else {
  557. autoreap = true;
  558. }
  559. tsk->exit_state = autoreap ? EXIT_DEAD : EXIT_ZOMBIE;
  560. /* mt-exec, de_thread() is waiting for group leader */
  561. if (unlikely(tsk->signal->notify_count < 0))
  562. wake_up_process(tsk->signal->group_exit_task);
  563. write_unlock_irq(&tasklist_lock);
  564. /* If the process is dead, release it - nobody will wait for it */
  565. if (autoreap)
  566. release_task(tsk);
  567. }
  568. #ifdef CONFIG_DEBUG_STACK_USAGE
  569. static void check_stack_usage(void)
  570. {
  571. static DEFINE_SPINLOCK(low_water_lock);
  572. static int lowest_to_date = THREAD_SIZE;
  573. unsigned long free;
  574. free = stack_not_used(current);
  575. if (free >= lowest_to_date)
  576. return;
  577. spin_lock(&low_water_lock);
  578. if (free < lowest_to_date) {
  579. pr_warn("%s (%d) used greatest stack depth: %lu bytes left\n",
  580. current->comm, task_pid_nr(current), free);
  581. lowest_to_date = free;
  582. }
  583. spin_unlock(&low_water_lock);
  584. }
  585. #else
  586. static inline void check_stack_usage(void) {}
  587. #endif
  588. void do_exit(long code)
  589. {
  590. struct task_struct *tsk = current;
  591. int group_dead;
  592. profile_task_exit(tsk);
  593. WARN_ON(blk_needs_flush_plug(tsk));
  594. if (unlikely(in_interrupt()))
  595. panic("Aiee, killing interrupt handler!");
  596. if (unlikely(!tsk->pid))
  597. panic("Attempted to kill the idle task!");
  598. /*
  599. * If do_exit is called because this processes oopsed, it's possible
  600. * that get_fs() was left as KERNEL_DS, so reset it to USER_DS before
  601. * continuing. Amongst other possible reasons, this is to prevent
  602. * mm_release()->clear_child_tid() from writing to a user-controlled
  603. * kernel address.
  604. */
  605. set_fs(USER_DS);
  606. ptrace_event(PTRACE_EVENT_EXIT, code);
  607. validate_creds_for_do_exit(tsk);
  608. /*
  609. * We're taking recursive faults here in do_exit. Safest is to just
  610. * leave this task alone and wait for reboot.
  611. */
  612. if (unlikely(tsk->flags & PF_EXITING)) {
  613. pr_alert("Fixing recursive fault but reboot is needed!\n");
  614. /*
  615. * We can do this unlocked here. The futex code uses
  616. * this flag just to verify whether the pi state
  617. * cleanup has been done or not. In the worst case it
  618. * loops once more. We pretend that the cleanup was
  619. * done as there is no way to return. Either the
  620. * OWNER_DIED bit is set by now or we push the blocked
  621. * task into the wait for ever nirwana as well.
  622. */
  623. tsk->flags |= PF_EXITPIDONE;
  624. set_current_state(TASK_UNINTERRUPTIBLE);
  625. schedule();
  626. }
  627. exit_signals(tsk); /* sets PF_EXITING */
  628. /*
  629. * tsk->flags are checked in the futex code to protect against
  630. * an exiting task cleaning up the robust pi futexes.
  631. */
  632. smp_mb();
  633. raw_spin_unlock_wait(&tsk->pi_lock);
  634. if (unlikely(in_atomic()))
  635. pr_info("note: %s[%d] exited with preempt_count %d\n",
  636. current->comm, task_pid_nr(current),
  637. preempt_count());
  638. acct_update_integrals(tsk);
  639. /* sync mm's RSS info before statistics gathering */
  640. if (tsk->mm)
  641. sync_mm_rss(tsk->mm);
  642. group_dead = atomic_dec_and_test(&tsk->signal->live);
  643. if (group_dead) {
  644. hrtimer_cancel(&tsk->signal->real_timer);
  645. exit_itimers(tsk->signal);
  646. if (tsk->mm)
  647. setmax_mm_hiwater_rss(&tsk->signal->maxrss, tsk->mm);
  648. }
  649. acct_collect(code, group_dead);
  650. if (group_dead)
  651. tty_audit_exit();
  652. audit_free(tsk);
  653. tsk->exit_code = code;
  654. taskstats_exit(tsk, group_dead);
  655. exit_mm(tsk);
  656. if (group_dead)
  657. acct_process();
  658. trace_sched_process_exit(tsk);
  659. exit_sem(tsk);
  660. exit_shm(tsk);
  661. exit_files(tsk);
  662. exit_fs(tsk);
  663. if (group_dead)
  664. disassociate_ctty(1);
  665. exit_task_namespaces(tsk);
  666. exit_task_work(tsk);
  667. exit_thread();
  668. /*
  669. * Flush inherited counters to the parent - before the parent
  670. * gets woken up by child-exit notifications.
  671. *
  672. * because of cgroup mode, must be called before cgroup_exit()
  673. */
  674. perf_event_exit_task(tsk);
  675. cgroup_exit(tsk);
  676. module_put(task_thread_info(tsk)->exec_domain->module);
  677. /*
  678. * FIXME: do that only when needed, using sched_exit tracepoint
  679. */
  680. flush_ptrace_hw_breakpoint(tsk);
  681. exit_notify(tsk, group_dead);
  682. proc_exit_connector(tsk);
  683. #ifdef CONFIG_NUMA
  684. task_lock(tsk);
  685. mpol_put(tsk->mempolicy);
  686. tsk->mempolicy = NULL;
  687. task_unlock(tsk);
  688. #endif
  689. #ifdef CONFIG_FUTEX
  690. if (unlikely(current->pi_state_cache))
  691. kfree(current->pi_state_cache);
  692. #endif
  693. /*
  694. * Make sure we are holding no locks:
  695. */
  696. debug_check_no_locks_held();
  697. /*
  698. * We can do this unlocked here. The futex code uses this flag
  699. * just to verify whether the pi state cleanup has been done
  700. * or not. In the worst case it loops once more.
  701. */
  702. tsk->flags |= PF_EXITPIDONE;
  703. if (tsk->io_context)
  704. exit_io_context(tsk);
  705. if (tsk->splice_pipe)
  706. free_pipe_info(tsk->splice_pipe);
  707. if (tsk->task_frag.page)
  708. put_page(tsk->task_frag.page);
  709. validate_creds_for_do_exit(tsk);
  710. check_stack_usage();
  711. preempt_disable();
  712. if (tsk->nr_dirtied)
  713. __this_cpu_add(dirty_throttle_leaks, tsk->nr_dirtied);
  714. exit_rcu();
  715. /*
  716. * The setting of TASK_RUNNING by try_to_wake_up() may be delayed
  717. * when the following two conditions become true.
  718. * - There is race condition of mmap_sem (It is acquired by
  719. * exit_mm()), and
  720. * - SMI occurs before setting TASK_RUNINNG.
  721. * (or hypervisor of virtual machine switches to other guest)
  722. * As a result, we may become TASK_RUNNING after becoming TASK_DEAD
  723. *
  724. * To avoid it, we have to wait for releasing tsk->pi_lock which
  725. * is held by try_to_wake_up()
  726. */
  727. smp_mb();
  728. raw_spin_unlock_wait(&tsk->pi_lock);
  729. /* causes final put_task_struct in finish_task_switch(). */
  730. tsk->state = TASK_DEAD;
  731. tsk->flags |= PF_NOFREEZE; /* tell freezer to ignore us */
  732. schedule();
  733. BUG();
  734. /* Avoid "noreturn function does return". */
  735. for (;;)
  736. cpu_relax(); /* For when BUG is null */
  737. }
  738. EXPORT_SYMBOL_GPL(do_exit);
  739. void complete_and_exit(struct completion *comp, long code)
  740. {
  741. if (comp)
  742. complete(comp);
  743. do_exit(code);
  744. }
  745. EXPORT_SYMBOL(complete_and_exit);
  746. SYSCALL_DEFINE1(exit, int, error_code)
  747. {
  748. do_exit((error_code&0xff)<<8);
  749. }
  750. /*
  751. * Take down every thread in the group. This is called by fatal signals
  752. * as well as by sys_exit_group (below).
  753. */
  754. void
  755. do_group_exit(int exit_code)
  756. {
  757. struct signal_struct *sig = current->signal;
  758. BUG_ON(exit_code & 0x80); /* core dumps don't get here */
  759. if (signal_group_exit(sig))
  760. exit_code = sig->group_exit_code;
  761. else if (!thread_group_empty(current)) {
  762. struct sighand_struct *const sighand = current->sighand;
  763. spin_lock_irq(&sighand->siglock);
  764. if (signal_group_exit(sig))
  765. /* Another thread got here before we took the lock. */
  766. exit_code = sig->group_exit_code;
  767. else {
  768. sig->group_exit_code = exit_code;
  769. sig->flags = SIGNAL_GROUP_EXIT;
  770. zap_other_threads(current);
  771. }
  772. spin_unlock_irq(&sighand->siglock);
  773. }
  774. do_exit(exit_code);
  775. /* NOTREACHED */
  776. }
  777. /*
  778. * this kills every thread in the thread group. Note that any externally
  779. * wait4()-ing process will get the correct exit code - even if this
  780. * thread is not the thread group leader.
  781. */
  782. SYSCALL_DEFINE1(exit_group, int, error_code)
  783. {
  784. do_group_exit((error_code & 0xff) << 8);
  785. /* NOTREACHED */
  786. return 0;
  787. }
  788. struct wait_opts {
  789. enum pid_type wo_type;
  790. int wo_flags;
  791. struct pid *wo_pid;
  792. struct siginfo __user *wo_info;
  793. int __user *wo_stat;
  794. struct rusage __user *wo_rusage;
  795. wait_queue_t child_wait;
  796. int notask_error;
  797. };
  798. static inline
  799. struct pid *task_pid_type(struct task_struct *task, enum pid_type type)
  800. {
  801. if (type != PIDTYPE_PID)
  802. task = task->group_leader;
  803. return task->pids[type].pid;
  804. }
  805. static int eligible_pid(struct wait_opts *wo, struct task_struct *p)
  806. {
  807. return wo->wo_type == PIDTYPE_MAX ||
  808. task_pid_type(p, wo->wo_type) == wo->wo_pid;
  809. }
  810. static int eligible_child(struct wait_opts *wo, struct task_struct *p)
  811. {
  812. if (!eligible_pid(wo, p))
  813. return 0;
  814. /* Wait for all children (clone and not) if __WALL is set;
  815. * otherwise, wait for clone children *only* if __WCLONE is
  816. * set; otherwise, wait for non-clone children *only*. (Note:
  817. * A "clone" child here is one that reports to its parent
  818. * using a signal other than SIGCHLD.) */
  819. if (((p->exit_signal != SIGCHLD) ^ !!(wo->wo_flags & __WCLONE))
  820. && !(wo->wo_flags & __WALL))
  821. return 0;
  822. return 1;
  823. }
  824. static int wait_noreap_copyout(struct wait_opts *wo, struct task_struct *p,
  825. pid_t pid, uid_t uid, int why, int status)
  826. {
  827. struct siginfo __user *infop;
  828. int retval = wo->wo_rusage
  829. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  830. put_task_struct(p);
  831. infop = wo->wo_info;
  832. if (infop) {
  833. if (!retval)
  834. retval = put_user(SIGCHLD, &infop->si_signo);
  835. if (!retval)
  836. retval = put_user(0, &infop->si_errno);
  837. if (!retval)
  838. retval = put_user((short)why, &infop->si_code);
  839. if (!retval)
  840. retval = put_user(pid, &infop->si_pid);
  841. if (!retval)
  842. retval = put_user(uid, &infop->si_uid);
  843. if (!retval)
  844. retval = put_user(status, &infop->si_status);
  845. }
  846. if (!retval)
  847. retval = pid;
  848. return retval;
  849. }
  850. /*
  851. * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
  852. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  853. * the lock and this task is uninteresting. If we return nonzero, we have
  854. * released the lock and the system call should return.
  855. */
  856. static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p)
  857. {
  858. unsigned long state;
  859. int retval, status, traced;
  860. pid_t pid = task_pid_vnr(p);
  861. uid_t uid = from_kuid_munged(current_user_ns(), task_uid(p));
  862. struct siginfo __user *infop;
  863. if (!likely(wo->wo_flags & WEXITED))
  864. return 0;
  865. if (unlikely(wo->wo_flags & WNOWAIT)) {
  866. int exit_code = p->exit_code;
  867. int why;
  868. get_task_struct(p);
  869. read_unlock(&tasklist_lock);
  870. if ((exit_code & 0x7f) == 0) {
  871. why = CLD_EXITED;
  872. status = exit_code >> 8;
  873. } else {
  874. why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
  875. status = exit_code & 0x7f;
  876. }
  877. return wait_noreap_copyout(wo, p, pid, uid, why, status);
  878. }
  879. traced = ptrace_reparented(p);
  880. /*
  881. * Move the task's state to DEAD/TRACE, only one thread can do this.
  882. */
  883. state = traced && thread_group_leader(p) ? EXIT_TRACE : EXIT_DEAD;
  884. if (cmpxchg(&p->exit_state, EXIT_ZOMBIE, state) != EXIT_ZOMBIE)
  885. return 0;
  886. /*
  887. * It can be ptraced but not reparented, check
  888. * thread_group_leader() to filter out sub-threads.
  889. */
  890. if (likely(!traced) && thread_group_leader(p)) {
  891. struct signal_struct *psig;
  892. struct signal_struct *sig;
  893. unsigned long maxrss;
  894. cputime_t tgutime, tgstime;
  895. /*
  896. * The resource counters for the group leader are in its
  897. * own task_struct. Those for dead threads in the group
  898. * are in its signal_struct, as are those for the child
  899. * processes it has previously reaped. All these
  900. * accumulate in the parent's signal_struct c* fields.
  901. *
  902. * We don't bother to take a lock here to protect these
  903. * p->signal fields, because they are only touched by
  904. * __exit_signal, which runs with tasklist_lock
  905. * write-locked anyway, and so is excluded here. We do
  906. * need to protect the access to parent->signal fields,
  907. * as other threads in the parent group can be right
  908. * here reaping other children at the same time.
  909. *
  910. * We use thread_group_cputime_adjusted() to get times for
  911. * the thread group, which consolidates times for all threads
  912. * in the group including the group leader.
  913. */
  914. thread_group_cputime_adjusted(p, &tgutime, &tgstime);
  915. spin_lock_irq(&p->real_parent->sighand->siglock);
  916. psig = p->real_parent->signal;
  917. sig = p->signal;
  918. psig->cutime += tgutime + sig->cutime;
  919. psig->cstime += tgstime + sig->cstime;
  920. psig->cgtime += task_gtime(p) + sig->gtime + sig->cgtime;
  921. psig->cmin_flt +=
  922. p->min_flt + sig->min_flt + sig->cmin_flt;
  923. psig->cmaj_flt +=
  924. p->maj_flt + sig->maj_flt + sig->cmaj_flt;
  925. psig->cnvcsw +=
  926. p->nvcsw + sig->nvcsw + sig->cnvcsw;
  927. psig->cnivcsw +=
  928. p->nivcsw + sig->nivcsw + sig->cnivcsw;
  929. psig->cinblock +=
  930. task_io_get_inblock(p) +
  931. sig->inblock + sig->cinblock;
  932. psig->coublock +=
  933. task_io_get_oublock(p) +
  934. sig->oublock + sig->coublock;
  935. maxrss = max(sig->maxrss, sig->cmaxrss);
  936. if (psig->cmaxrss < maxrss)
  937. psig->cmaxrss = maxrss;
  938. task_io_accounting_add(&psig->ioac, &p->ioac);
  939. task_io_accounting_add(&psig->ioac, &sig->ioac);
  940. spin_unlock_irq(&p->real_parent->sighand->siglock);
  941. }
  942. /*
  943. * Now we are sure this task is interesting, and no other
  944. * thread can reap it because we its state == DEAD/TRACE.
  945. */
  946. read_unlock(&tasklist_lock);
  947. retval = wo->wo_rusage
  948. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  949. status = (p->signal->flags & SIGNAL_GROUP_EXIT)
  950. ? p->signal->group_exit_code : p->exit_code;
  951. if (!retval && wo->wo_stat)
  952. retval = put_user(status, wo->wo_stat);
  953. infop = wo->wo_info;
  954. if (!retval && infop)
  955. retval = put_user(SIGCHLD, &infop->si_signo);
  956. if (!retval && infop)
  957. retval = put_user(0, &infop->si_errno);
  958. if (!retval && infop) {
  959. int why;
  960. if ((status & 0x7f) == 0) {
  961. why = CLD_EXITED;
  962. status >>= 8;
  963. } else {
  964. why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
  965. status &= 0x7f;
  966. }
  967. retval = put_user((short)why, &infop->si_code);
  968. if (!retval)
  969. retval = put_user(status, &infop->si_status);
  970. }
  971. if (!retval && infop)
  972. retval = put_user(pid, &infop->si_pid);
  973. if (!retval && infop)
  974. retval = put_user(uid, &infop->si_uid);
  975. if (!retval)
  976. retval = pid;
  977. if (state == EXIT_TRACE) {
  978. write_lock_irq(&tasklist_lock);
  979. /* We dropped tasklist, ptracer could die and untrace */
  980. ptrace_unlink(p);
  981. /* If parent wants a zombie, don't release it now */
  982. state = EXIT_ZOMBIE;
  983. if (do_notify_parent(p, p->exit_signal))
  984. state = EXIT_DEAD;
  985. p->exit_state = state;
  986. write_unlock_irq(&tasklist_lock);
  987. }
  988. if (state == EXIT_DEAD)
  989. release_task(p);
  990. return retval;
  991. }
  992. static int *task_stopped_code(struct task_struct *p, bool ptrace)
  993. {
  994. if (ptrace) {
  995. if (task_is_stopped_or_traced(p) &&
  996. !(p->jobctl & JOBCTL_LISTENING))
  997. return &p->exit_code;
  998. } else {
  999. if (p->signal->flags & SIGNAL_STOP_STOPPED)
  1000. return &p->signal->group_exit_code;
  1001. }
  1002. return NULL;
  1003. }
  1004. /**
  1005. * wait_task_stopped - Wait for %TASK_STOPPED or %TASK_TRACED
  1006. * @wo: wait options
  1007. * @ptrace: is the wait for ptrace
  1008. * @p: task to wait for
  1009. *
  1010. * Handle sys_wait4() work for %p in state %TASK_STOPPED or %TASK_TRACED.
  1011. *
  1012. * CONTEXT:
  1013. * read_lock(&tasklist_lock), which is released if return value is
  1014. * non-zero. Also, grabs and releases @p->sighand->siglock.
  1015. *
  1016. * RETURNS:
  1017. * 0 if wait condition didn't exist and search for other wait conditions
  1018. * should continue. Non-zero return, -errno on failure and @p's pid on
  1019. * success, implies that tasklist_lock is released and wait condition
  1020. * search should terminate.
  1021. */
  1022. static int wait_task_stopped(struct wait_opts *wo,
  1023. int ptrace, struct task_struct *p)
  1024. {
  1025. struct siginfo __user *infop;
  1026. int retval, exit_code, *p_code, why;
  1027. uid_t uid = 0; /* unneeded, required by compiler */
  1028. pid_t pid;
  1029. /*
  1030. * Traditionally we see ptrace'd stopped tasks regardless of options.
  1031. */
  1032. if (!ptrace && !(wo->wo_flags & WUNTRACED))
  1033. return 0;
  1034. if (!task_stopped_code(p, ptrace))
  1035. return 0;
  1036. exit_code = 0;
  1037. spin_lock_irq(&p->sighand->siglock);
  1038. p_code = task_stopped_code(p, ptrace);
  1039. if (unlikely(!p_code))
  1040. goto unlock_sig;
  1041. exit_code = *p_code;
  1042. if (!exit_code)
  1043. goto unlock_sig;
  1044. if (!unlikely(wo->wo_flags & WNOWAIT))
  1045. *p_code = 0;
  1046. uid = from_kuid_munged(current_user_ns(), task_uid(p));
  1047. unlock_sig:
  1048. spin_unlock_irq(&p->sighand->siglock);
  1049. if (!exit_code)
  1050. return 0;
  1051. /*
  1052. * Now we are pretty sure this task is interesting.
  1053. * Make sure it doesn't get reaped out from under us while we
  1054. * give up the lock and then examine it below. We don't want to
  1055. * keep holding onto the tasklist_lock while we call getrusage and
  1056. * possibly take page faults for user memory.
  1057. */
  1058. get_task_struct(p);
  1059. pid = task_pid_vnr(p);
  1060. why = ptrace ? CLD_TRAPPED : CLD_STOPPED;
  1061. read_unlock(&tasklist_lock);
  1062. if (unlikely(wo->wo_flags & WNOWAIT))
  1063. return wait_noreap_copyout(wo, p, pid, uid, why, exit_code);
  1064. retval = wo->wo_rusage
  1065. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  1066. if (!retval && wo->wo_stat)
  1067. retval = put_user((exit_code << 8) | 0x7f, wo->wo_stat);
  1068. infop = wo->wo_info;
  1069. if (!retval && infop)
  1070. retval = put_user(SIGCHLD, &infop->si_signo);
  1071. if (!retval && infop)
  1072. retval = put_user(0, &infop->si_errno);
  1073. if (!retval && infop)
  1074. retval = put_user((short)why, &infop->si_code);
  1075. if (!retval && infop)
  1076. retval = put_user(exit_code, &infop->si_status);
  1077. if (!retval && infop)
  1078. retval = put_user(pid, &infop->si_pid);
  1079. if (!retval && infop)
  1080. retval = put_user(uid, &infop->si_uid);
  1081. if (!retval)
  1082. retval = pid;
  1083. put_task_struct(p);
  1084. BUG_ON(!retval);
  1085. return retval;
  1086. }
  1087. /*
  1088. * Handle do_wait work for one task in a live, non-stopped state.
  1089. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1090. * the lock and this task is uninteresting. If we return nonzero, we have
  1091. * released the lock and the system call should return.
  1092. */
  1093. static int wait_task_continued(struct wait_opts *wo, struct task_struct *p)
  1094. {
  1095. int retval;
  1096. pid_t pid;
  1097. uid_t uid;
  1098. if (!unlikely(wo->wo_flags & WCONTINUED))
  1099. return 0;
  1100. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
  1101. return 0;
  1102. spin_lock_irq(&p->sighand->siglock);
  1103. /* Re-check with the lock held. */
  1104. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
  1105. spin_unlock_irq(&p->sighand->siglock);
  1106. return 0;
  1107. }
  1108. if (!unlikely(wo->wo_flags & WNOWAIT))
  1109. p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
  1110. uid = from_kuid_munged(current_user_ns(), task_uid(p));
  1111. spin_unlock_irq(&p->sighand->siglock);
  1112. pid = task_pid_vnr(p);
  1113. get_task_struct(p);
  1114. read_unlock(&tasklist_lock);
  1115. if (!wo->wo_info) {
  1116. retval = wo->wo_rusage
  1117. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  1118. put_task_struct(p);
  1119. if (!retval && wo->wo_stat)
  1120. retval = put_user(0xffff, wo->wo_stat);
  1121. if (!retval)
  1122. retval = pid;
  1123. } else {
  1124. retval = wait_noreap_copyout(wo, p, pid, uid,
  1125. CLD_CONTINUED, SIGCONT);
  1126. BUG_ON(retval == 0);
  1127. }
  1128. return retval;
  1129. }
  1130. /*
  1131. * Consider @p for a wait by @parent.
  1132. *
  1133. * -ECHILD should be in ->notask_error before the first call.
  1134. * Returns nonzero for a final return, when we have unlocked tasklist_lock.
  1135. * Returns zero if the search for a child should continue;
  1136. * then ->notask_error is 0 if @p is an eligible child,
  1137. * or another error from security_task_wait(), or still -ECHILD.
  1138. */
  1139. static int wait_consider_task(struct wait_opts *wo, int ptrace,
  1140. struct task_struct *p)
  1141. {
  1142. int ret;
  1143. if (unlikely(p->exit_state == EXIT_DEAD))
  1144. return 0;
  1145. ret = eligible_child(wo, p);
  1146. if (!ret)
  1147. return ret;
  1148. ret = security_task_wait(p);
  1149. if (unlikely(ret < 0)) {
  1150. /*
  1151. * If we have not yet seen any eligible child,
  1152. * then let this error code replace -ECHILD.
  1153. * A permission error will give the user a clue
  1154. * to look for security policy problems, rather
  1155. * than for mysterious wait bugs.
  1156. */
  1157. if (wo->notask_error)
  1158. wo->notask_error = ret;
  1159. return 0;
  1160. }
  1161. if (unlikely(p->exit_state == EXIT_TRACE)) {
  1162. /*
  1163. * ptrace == 0 means we are the natural parent. In this case
  1164. * we should clear notask_error, debugger will notify us.
  1165. */
  1166. if (likely(!ptrace))
  1167. wo->notask_error = 0;
  1168. return 0;
  1169. }
  1170. if (likely(!ptrace) && unlikely(p->ptrace)) {
  1171. /*
  1172. * If it is traced by its real parent's group, just pretend
  1173. * the caller is ptrace_do_wait() and reap this child if it
  1174. * is zombie.
  1175. *
  1176. * This also hides group stop state from real parent; otherwise
  1177. * a single stop can be reported twice as group and ptrace stop.
  1178. * If a ptracer wants to distinguish these two events for its
  1179. * own children it should create a separate process which takes
  1180. * the role of real parent.
  1181. */
  1182. if (!ptrace_reparented(p))
  1183. ptrace = 1;
  1184. }
  1185. /* slay zombie? */
  1186. if (p->exit_state == EXIT_ZOMBIE) {
  1187. /* we don't reap group leaders with subthreads */
  1188. if (!delay_group_leader(p)) {
  1189. /*
  1190. * A zombie ptracee is only visible to its ptracer.
  1191. * Notification and reaping will be cascaded to the
  1192. * real parent when the ptracer detaches.
  1193. */
  1194. if (unlikely(ptrace) || likely(!p->ptrace))
  1195. return wait_task_zombie(wo, p);
  1196. }
  1197. /*
  1198. * Allow access to stopped/continued state via zombie by
  1199. * falling through. Clearing of notask_error is complex.
  1200. *
  1201. * When !@ptrace:
  1202. *
  1203. * If WEXITED is set, notask_error should naturally be
  1204. * cleared. If not, subset of WSTOPPED|WCONTINUED is set,
  1205. * so, if there are live subthreads, there are events to
  1206. * wait for. If all subthreads are dead, it's still safe
  1207. * to clear - this function will be called again in finite
  1208. * amount time once all the subthreads are released and
  1209. * will then return without clearing.
  1210. *
  1211. * When @ptrace:
  1212. *
  1213. * Stopped state is per-task and thus can't change once the
  1214. * target task dies. Only continued and exited can happen.
  1215. * Clear notask_error if WCONTINUED | WEXITED.
  1216. */
  1217. if (likely(!ptrace) || (wo->wo_flags & (WCONTINUED | WEXITED)))
  1218. wo->notask_error = 0;
  1219. } else {
  1220. /*
  1221. * @p is alive and it's gonna stop, continue or exit, so
  1222. * there always is something to wait for.
  1223. */
  1224. wo->notask_error = 0;
  1225. }
  1226. /*
  1227. * Wait for stopped. Depending on @ptrace, different stopped state
  1228. * is used and the two don't interact with each other.
  1229. */
  1230. ret = wait_task_stopped(wo, ptrace, p);
  1231. if (ret)
  1232. return ret;
  1233. /*
  1234. * Wait for continued. There's only one continued state and the
  1235. * ptracer can consume it which can confuse the real parent. Don't
  1236. * use WCONTINUED from ptracer. You don't need or want it.
  1237. */
  1238. return wait_task_continued(wo, p);
  1239. }
  1240. /*
  1241. * Do the work of do_wait() for one thread in the group, @tsk.
  1242. *
  1243. * -ECHILD should be in ->notask_error before the first call.
  1244. * Returns nonzero for a final return, when we have unlocked tasklist_lock.
  1245. * Returns zero if the search for a child should continue; then
  1246. * ->notask_error is 0 if there were any eligible children,
  1247. * or another error from security_task_wait(), or still -ECHILD.
  1248. */
  1249. static int do_wait_thread(struct wait_opts *wo, struct task_struct *tsk)
  1250. {
  1251. struct task_struct *p;
  1252. list_for_each_entry(p, &tsk->children, sibling) {
  1253. int ret = wait_consider_task(wo, 0, p);
  1254. if (ret)
  1255. return ret;
  1256. }
  1257. return 0;
  1258. }
  1259. static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk)
  1260. {
  1261. struct task_struct *p;
  1262. list_for_each_entry(p, &tsk->ptraced, ptrace_entry) {
  1263. int ret = wait_consider_task(wo, 1, p);
  1264. if (ret)
  1265. return ret;
  1266. }
  1267. return 0;
  1268. }
  1269. static int child_wait_callback(wait_queue_t *wait, unsigned mode,
  1270. int sync, void *key)
  1271. {
  1272. struct wait_opts *wo = container_of(wait, struct wait_opts,
  1273. child_wait);
  1274. struct task_struct *p = key;
  1275. if (!eligible_pid(wo, p))
  1276. return 0;
  1277. if ((wo->wo_flags & __WNOTHREAD) && wait->private != p->parent)
  1278. return 0;
  1279. return default_wake_function(wait, mode, sync, key);
  1280. }
  1281. void __wake_up_parent(struct task_struct *p, struct task_struct *parent)
  1282. {
  1283. __wake_up_sync_key(&parent->signal->wait_chldexit,
  1284. TASK_INTERRUPTIBLE, 1, p);
  1285. }
  1286. static long do_wait(struct wait_opts *wo)
  1287. {
  1288. struct task_struct *tsk;
  1289. int retval;
  1290. trace_sched_process_wait(wo->wo_pid);
  1291. init_waitqueue_func_entry(&wo->child_wait, child_wait_callback);
  1292. wo->child_wait.private = current;
  1293. add_wait_queue(&current->signal->wait_chldexit, &wo->child_wait);
  1294. repeat:
  1295. /*
  1296. * If there is nothing that can match our critiera just get out.
  1297. * We will clear ->notask_error to zero if we see any child that
  1298. * might later match our criteria, even if we are not able to reap
  1299. * it yet.
  1300. */
  1301. wo->notask_error = -ECHILD;
  1302. if ((wo->wo_type < PIDTYPE_MAX) &&
  1303. (!wo->wo_pid || hlist_empty(&wo->wo_pid->tasks[wo->wo_type])))
  1304. goto notask;
  1305. set_current_state(TASK_INTERRUPTIBLE);
  1306. read_lock(&tasklist_lock);
  1307. tsk = current;
  1308. do {
  1309. retval = do_wait_thread(wo, tsk);
  1310. if (retval)
  1311. goto end;
  1312. retval = ptrace_do_wait(wo, tsk);
  1313. if (retval)
  1314. goto end;
  1315. if (wo->wo_flags & __WNOTHREAD)
  1316. break;
  1317. } while_each_thread(current, tsk);
  1318. read_unlock(&tasklist_lock);
  1319. notask:
  1320. retval = wo->notask_error;
  1321. if (!retval && !(wo->wo_flags & WNOHANG)) {
  1322. retval = -ERESTARTSYS;
  1323. if (!signal_pending(current)) {
  1324. schedule();
  1325. goto repeat;
  1326. }
  1327. }
  1328. end:
  1329. __set_current_state(TASK_RUNNING);
  1330. remove_wait_queue(&current->signal->wait_chldexit, &wo->child_wait);
  1331. return retval;
  1332. }
  1333. SYSCALL_DEFINE5(waitid, int, which, pid_t, upid, struct siginfo __user *,
  1334. infop, int, options, struct rusage __user *, ru)
  1335. {
  1336. struct wait_opts wo;
  1337. struct pid *pid = NULL;
  1338. enum pid_type type;
  1339. long ret;
  1340. if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
  1341. return -EINVAL;
  1342. if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
  1343. return -EINVAL;
  1344. switch (which) {
  1345. case P_ALL:
  1346. type = PIDTYPE_MAX;
  1347. break;
  1348. case P_PID:
  1349. type = PIDTYPE_PID;
  1350. if (upid <= 0)
  1351. return -EINVAL;
  1352. break;
  1353. case P_PGID:
  1354. type = PIDTYPE_PGID;
  1355. if (upid <= 0)
  1356. return -EINVAL;
  1357. break;
  1358. default:
  1359. return -EINVAL;
  1360. }
  1361. if (type < PIDTYPE_MAX)
  1362. pid = find_get_pid(upid);
  1363. wo.wo_type = type;
  1364. wo.wo_pid = pid;
  1365. wo.wo_flags = options;
  1366. wo.wo_info = infop;
  1367. wo.wo_stat = NULL;
  1368. wo.wo_rusage = ru;
  1369. ret = do_wait(&wo);
  1370. if (ret > 0) {
  1371. ret = 0;
  1372. } else if (infop) {
  1373. /*
  1374. * For a WNOHANG return, clear out all the fields
  1375. * we would set so the user can easily tell the
  1376. * difference.
  1377. */
  1378. if (!ret)
  1379. ret = put_user(0, &infop->si_signo);
  1380. if (!ret)
  1381. ret = put_user(0, &infop->si_errno);
  1382. if (!ret)
  1383. ret = put_user(0, &infop->si_code);
  1384. if (!ret)
  1385. ret = put_user(0, &infop->si_pid);
  1386. if (!ret)
  1387. ret = put_user(0, &infop->si_uid);
  1388. if (!ret)
  1389. ret = put_user(0, &infop->si_status);
  1390. }
  1391. put_pid(pid);
  1392. return ret;
  1393. }
  1394. SYSCALL_DEFINE4(wait4, pid_t, upid, int __user *, stat_addr,
  1395. int, options, struct rusage __user *, ru)
  1396. {
  1397. struct wait_opts wo;
  1398. struct pid *pid = NULL;
  1399. enum pid_type type;
  1400. long ret;
  1401. if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
  1402. __WNOTHREAD|__WCLONE|__WALL))
  1403. return -EINVAL;
  1404. if (upid == -1)
  1405. type = PIDTYPE_MAX;
  1406. else if (upid < 0) {
  1407. type = PIDTYPE_PGID;
  1408. pid = find_get_pid(-upid);
  1409. } else if (upid == 0) {
  1410. type = PIDTYPE_PGID;
  1411. pid = get_task_pid(current, PIDTYPE_PGID);
  1412. } else /* upid > 0 */ {
  1413. type = PIDTYPE_PID;
  1414. pid = find_get_pid(upid);
  1415. }
  1416. wo.wo_type = type;
  1417. wo.wo_pid = pid;
  1418. wo.wo_flags = options | WEXITED;
  1419. wo.wo_info = NULL;
  1420. wo.wo_stat = stat_addr;
  1421. wo.wo_rusage = ru;
  1422. ret = do_wait(&wo);
  1423. put_pid(pid);
  1424. return ret;
  1425. }
  1426. #ifdef __ARCH_WANT_SYS_WAITPID
  1427. /*
  1428. * sys_waitpid() remains for compatibility. waitpid() should be
  1429. * implemented by calling sys_wait4() from libc.a.
  1430. */
  1431. SYSCALL_DEFINE3(waitpid, pid_t, pid, int __user *, stat_addr, int, options)
  1432. {
  1433. return sys_wait4(pid, stat_addr, options, NULL);
  1434. }
  1435. #endif