exit.c 46 KB

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