exit.c 42 KB

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