exit.c 46 KB

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