exit.c 46 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856
  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. /* We don't want this task to be frozen prematurely */
  597. clear_freeze_flag(tsk);
  598. if (tsk->signal->oom_score_adj == OOM_SCORE_ADJ_MIN)
  599. atomic_dec(&mm->oom_disable_count);
  600. task_unlock(tsk);
  601. mm_update_next_owner(mm);
  602. mmput(mm);
  603. }
  604. /*
  605. * When we die, we re-parent all our children.
  606. * Try to give them to another thread in our thread
  607. * group, and if no such member exists, give it to
  608. * the child reaper process (ie "init") in our pid
  609. * space.
  610. */
  611. static struct task_struct *find_new_reaper(struct task_struct *father)
  612. __releases(&tasklist_lock)
  613. __acquires(&tasklist_lock)
  614. {
  615. struct pid_namespace *pid_ns = task_active_pid_ns(father);
  616. struct task_struct *thread;
  617. thread = father;
  618. while_each_thread(father, thread) {
  619. if (thread->flags & PF_EXITING)
  620. continue;
  621. if (unlikely(pid_ns->child_reaper == father))
  622. pid_ns->child_reaper = thread;
  623. return thread;
  624. }
  625. if (unlikely(pid_ns->child_reaper == father)) {
  626. write_unlock_irq(&tasklist_lock);
  627. if (unlikely(pid_ns == &init_pid_ns))
  628. panic("Attempted to kill init!");
  629. zap_pid_ns_processes(pid_ns);
  630. write_lock_irq(&tasklist_lock);
  631. /*
  632. * We can not clear ->child_reaper or leave it alone.
  633. * There may by stealth EXIT_DEAD tasks on ->children,
  634. * forget_original_parent() must move them somewhere.
  635. */
  636. pid_ns->child_reaper = init_pid_ns.child_reaper;
  637. }
  638. return pid_ns->child_reaper;
  639. }
  640. /*
  641. * Any that need to be release_task'd are put on the @dead list.
  642. */
  643. static void reparent_leader(struct task_struct *father, struct task_struct *p,
  644. struct list_head *dead)
  645. {
  646. list_move_tail(&p->sibling, &p->real_parent->children);
  647. if (p->exit_state == EXIT_DEAD)
  648. return;
  649. /*
  650. * If this is a threaded reparent there is no need to
  651. * notify anyone anything has happened.
  652. */
  653. if (same_thread_group(p->real_parent, father))
  654. return;
  655. /* We don't want people slaying init. */
  656. p->exit_signal = SIGCHLD;
  657. /* If it has exited notify the new parent about this child's death. */
  658. if (!p->ptrace &&
  659. p->exit_state == EXIT_ZOMBIE && thread_group_empty(p)) {
  660. if (do_notify_parent(p, p->exit_signal)) {
  661. p->exit_state = EXIT_DEAD;
  662. list_move_tail(&p->sibling, dead);
  663. }
  664. }
  665. kill_orphaned_pgrp(p, father);
  666. }
  667. static void forget_original_parent(struct task_struct *father)
  668. {
  669. struct task_struct *p, *n, *reaper;
  670. LIST_HEAD(dead_children);
  671. write_lock_irq(&tasklist_lock);
  672. /*
  673. * Note that exit_ptrace() and find_new_reaper() might
  674. * drop tasklist_lock and reacquire it.
  675. */
  676. exit_ptrace(father);
  677. reaper = find_new_reaper(father);
  678. list_for_each_entry_safe(p, n, &father->children, sibling) {
  679. struct task_struct *t = p;
  680. do {
  681. t->real_parent = reaper;
  682. if (t->parent == father) {
  683. BUG_ON(t->ptrace);
  684. t->parent = t->real_parent;
  685. }
  686. if (t->pdeath_signal)
  687. group_send_sig_info(t->pdeath_signal,
  688. SEND_SIG_NOINFO, t);
  689. } while_each_thread(p, t);
  690. reparent_leader(father, p, &dead_children);
  691. }
  692. write_unlock_irq(&tasklist_lock);
  693. BUG_ON(!list_empty(&father->children));
  694. list_for_each_entry_safe(p, n, &dead_children, sibling) {
  695. list_del_init(&p->sibling);
  696. release_task(p);
  697. }
  698. }
  699. /*
  700. * Send signals to all our closest relatives so that they know
  701. * to properly mourn us..
  702. */
  703. static void exit_notify(struct task_struct *tsk, int group_dead)
  704. {
  705. bool autoreap;
  706. /*
  707. * This does two things:
  708. *
  709. * A. Make init inherit all the child processes
  710. * B. Check to see if any process groups have become orphaned
  711. * as a result of our exiting, and if they have any stopped
  712. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  713. */
  714. forget_original_parent(tsk);
  715. exit_task_namespaces(tsk);
  716. write_lock_irq(&tasklist_lock);
  717. if (group_dead)
  718. kill_orphaned_pgrp(tsk->group_leader, NULL);
  719. /* Let father know we died
  720. *
  721. * Thread signals are configurable, but you aren't going to use
  722. * that to send signals to arbitrary processes.
  723. * That stops right now.
  724. *
  725. * If the parent exec id doesn't match the exec id we saved
  726. * when we started then we know the parent has changed security
  727. * domain.
  728. *
  729. * If our self_exec id doesn't match our parent_exec_id then
  730. * we have changed execution domain as these two values started
  731. * the same after a fork.
  732. */
  733. if (thread_group_leader(tsk) && tsk->exit_signal != SIGCHLD &&
  734. (tsk->parent_exec_id != tsk->real_parent->self_exec_id ||
  735. tsk->self_exec_id != tsk->parent_exec_id))
  736. tsk->exit_signal = SIGCHLD;
  737. if (unlikely(tsk->ptrace)) {
  738. int sig = thread_group_leader(tsk) &&
  739. thread_group_empty(tsk) &&
  740. !ptrace_reparented(tsk) ?
  741. tsk->exit_signal : SIGCHLD;
  742. autoreap = do_notify_parent(tsk, sig);
  743. } else if (thread_group_leader(tsk)) {
  744. autoreap = thread_group_empty(tsk) &&
  745. do_notify_parent(tsk, tsk->exit_signal);
  746. } else {
  747. autoreap = true;
  748. }
  749. tsk->exit_state = autoreap ? EXIT_DEAD : EXIT_ZOMBIE;
  750. /* mt-exec, de_thread() is waiting for group leader */
  751. if (unlikely(tsk->signal->notify_count < 0))
  752. wake_up_process(tsk->signal->group_exit_task);
  753. write_unlock_irq(&tasklist_lock);
  754. /* If the process is dead, release it - nobody will wait for it */
  755. if (autoreap)
  756. release_task(tsk);
  757. }
  758. #ifdef CONFIG_DEBUG_STACK_USAGE
  759. static void check_stack_usage(void)
  760. {
  761. static DEFINE_SPINLOCK(low_water_lock);
  762. static int lowest_to_date = THREAD_SIZE;
  763. unsigned long free;
  764. free = stack_not_used(current);
  765. if (free >= lowest_to_date)
  766. return;
  767. spin_lock(&low_water_lock);
  768. if (free < lowest_to_date) {
  769. printk(KERN_WARNING "%s used greatest stack depth: %lu bytes "
  770. "left\n",
  771. current->comm, free);
  772. lowest_to_date = free;
  773. }
  774. spin_unlock(&low_water_lock);
  775. }
  776. #else
  777. static inline void check_stack_usage(void) {}
  778. #endif
  779. NORET_TYPE void do_exit(long code)
  780. {
  781. struct task_struct *tsk = current;
  782. int group_dead;
  783. profile_task_exit(tsk);
  784. WARN_ON(blk_needs_flush_plug(tsk));
  785. if (unlikely(in_interrupt()))
  786. panic("Aiee, killing interrupt handler!");
  787. if (unlikely(!tsk->pid))
  788. panic("Attempted to kill the idle task!");
  789. /*
  790. * If do_exit is called because this processes oopsed, it's possible
  791. * that get_fs() was left as KERNEL_DS, so reset it to USER_DS before
  792. * continuing. Amongst other possible reasons, this is to prevent
  793. * mm_release()->clear_child_tid() from writing to a user-controlled
  794. * kernel address.
  795. */
  796. set_fs(USER_DS);
  797. ptrace_event(PTRACE_EVENT_EXIT, code);
  798. validate_creds_for_do_exit(tsk);
  799. /*
  800. * We're taking recursive faults here in do_exit. Safest is to just
  801. * leave this task alone and wait for reboot.
  802. */
  803. if (unlikely(tsk->flags & PF_EXITING)) {
  804. printk(KERN_ALERT
  805. "Fixing recursive fault but reboot is needed!\n");
  806. /*
  807. * We can do this unlocked here. The futex code uses
  808. * this flag just to verify whether the pi state
  809. * cleanup has been done or not. In the worst case it
  810. * loops once more. We pretend that the cleanup was
  811. * done as there is no way to return. Either the
  812. * OWNER_DIED bit is set by now or we push the blocked
  813. * task into the wait for ever nirwana as well.
  814. */
  815. tsk->flags |= PF_EXITPIDONE;
  816. set_current_state(TASK_UNINTERRUPTIBLE);
  817. schedule();
  818. }
  819. exit_irq_thread();
  820. exit_signals(tsk); /* sets PF_EXITING */
  821. /*
  822. * tsk->flags are checked in the futex code to protect against
  823. * an exiting task cleaning up the robust pi futexes.
  824. */
  825. smp_mb();
  826. raw_spin_unlock_wait(&tsk->pi_lock);
  827. if (unlikely(in_atomic()))
  828. printk(KERN_INFO "note: %s[%d] exited with preempt_count %d\n",
  829. current->comm, task_pid_nr(current),
  830. preempt_count());
  831. acct_update_integrals(tsk);
  832. /* sync mm's RSS info before statistics gathering */
  833. if (tsk->mm)
  834. sync_mm_rss(tsk, tsk->mm);
  835. group_dead = atomic_dec_and_test(&tsk->signal->live);
  836. if (group_dead) {
  837. hrtimer_cancel(&tsk->signal->real_timer);
  838. exit_itimers(tsk->signal);
  839. if (tsk->mm)
  840. setmax_mm_hiwater_rss(&tsk->signal->maxrss, tsk->mm);
  841. }
  842. acct_collect(code, group_dead);
  843. if (group_dead)
  844. tty_audit_exit();
  845. if (unlikely(tsk->audit_context))
  846. audit_free(tsk);
  847. tsk->exit_code = code;
  848. taskstats_exit(tsk, group_dead);
  849. exit_mm(tsk);
  850. if (group_dead)
  851. acct_process();
  852. trace_sched_process_exit(tsk);
  853. exit_sem(tsk);
  854. exit_shm(tsk);
  855. exit_files(tsk);
  856. exit_fs(tsk);
  857. check_stack_usage();
  858. exit_thread();
  859. /*
  860. * Flush inherited counters to the parent - before the parent
  861. * gets woken up by child-exit notifications.
  862. *
  863. * because of cgroup mode, must be called before cgroup_exit()
  864. */
  865. perf_event_exit_task(tsk);
  866. cgroup_exit(tsk, 1);
  867. if (group_dead)
  868. disassociate_ctty(1);
  869. module_put(task_thread_info(tsk)->exec_domain->module);
  870. proc_exit_connector(tsk);
  871. /*
  872. * FIXME: do that only when needed, using sched_exit tracepoint
  873. */
  874. ptrace_put_breakpoints(tsk);
  875. exit_notify(tsk, group_dead);
  876. #ifdef CONFIG_NUMA
  877. task_lock(tsk);
  878. mpol_put(tsk->mempolicy);
  879. tsk->mempolicy = NULL;
  880. task_unlock(tsk);
  881. #endif
  882. #ifdef CONFIG_FUTEX
  883. if (unlikely(current->pi_state_cache))
  884. kfree(current->pi_state_cache);
  885. #endif
  886. /*
  887. * Make sure we are holding no locks:
  888. */
  889. debug_check_no_locks_held(tsk);
  890. /*
  891. * We can do this unlocked here. The futex code uses this flag
  892. * just to verify whether the pi state cleanup has been done
  893. * or not. In the worst case it loops once more.
  894. */
  895. tsk->flags |= PF_EXITPIDONE;
  896. if (tsk->io_context)
  897. exit_io_context(tsk);
  898. if (tsk->splice_pipe)
  899. __free_pipe_info(tsk->splice_pipe);
  900. validate_creds_for_do_exit(tsk);
  901. preempt_disable();
  902. exit_rcu();
  903. /* causes final put_task_struct in finish_task_switch(). */
  904. tsk->state = TASK_DEAD;
  905. schedule();
  906. BUG();
  907. /* Avoid "noreturn function does return". */
  908. for (;;)
  909. cpu_relax(); /* For when BUG is null */
  910. }
  911. EXPORT_SYMBOL_GPL(do_exit);
  912. NORET_TYPE void complete_and_exit(struct completion *comp, long code)
  913. {
  914. if (comp)
  915. complete(comp);
  916. do_exit(code);
  917. }
  918. EXPORT_SYMBOL(complete_and_exit);
  919. SYSCALL_DEFINE1(exit, int, error_code)
  920. {
  921. do_exit((error_code&0xff)<<8);
  922. }
  923. /*
  924. * Take down every thread in the group. This is called by fatal signals
  925. * as well as by sys_exit_group (below).
  926. */
  927. NORET_TYPE void
  928. do_group_exit(int exit_code)
  929. {
  930. struct signal_struct *sig = current->signal;
  931. BUG_ON(exit_code & 0x80); /* core dumps don't get here */
  932. if (signal_group_exit(sig))
  933. exit_code = sig->group_exit_code;
  934. else if (!thread_group_empty(current)) {
  935. struct sighand_struct *const sighand = current->sighand;
  936. spin_lock_irq(&sighand->siglock);
  937. if (signal_group_exit(sig))
  938. /* Another thread got here before we took the lock. */
  939. exit_code = sig->group_exit_code;
  940. else {
  941. sig->group_exit_code = exit_code;
  942. sig->flags = SIGNAL_GROUP_EXIT;
  943. zap_other_threads(current);
  944. }
  945. spin_unlock_irq(&sighand->siglock);
  946. }
  947. do_exit(exit_code);
  948. /* NOTREACHED */
  949. }
  950. /*
  951. * this kills every thread in the thread group. Note that any externally
  952. * wait4()-ing process will get the correct exit code - even if this
  953. * thread is not the thread group leader.
  954. */
  955. SYSCALL_DEFINE1(exit_group, int, error_code)
  956. {
  957. do_group_exit((error_code & 0xff) << 8);
  958. /* NOTREACHED */
  959. return 0;
  960. }
  961. struct wait_opts {
  962. enum pid_type wo_type;
  963. int wo_flags;
  964. struct pid *wo_pid;
  965. struct siginfo __user *wo_info;
  966. int __user *wo_stat;
  967. struct rusage __user *wo_rusage;
  968. wait_queue_t child_wait;
  969. int notask_error;
  970. };
  971. static inline
  972. struct pid *task_pid_type(struct task_struct *task, enum pid_type type)
  973. {
  974. if (type != PIDTYPE_PID)
  975. task = task->group_leader;
  976. return task->pids[type].pid;
  977. }
  978. static int eligible_pid(struct wait_opts *wo, struct task_struct *p)
  979. {
  980. return wo->wo_type == PIDTYPE_MAX ||
  981. task_pid_type(p, wo->wo_type) == wo->wo_pid;
  982. }
  983. static int eligible_child(struct wait_opts *wo, struct task_struct *p)
  984. {
  985. if (!eligible_pid(wo, p))
  986. return 0;
  987. /* Wait for all children (clone and not) if __WALL is set;
  988. * otherwise, wait for clone children *only* if __WCLONE is
  989. * set; otherwise, wait for non-clone children *only*. (Note:
  990. * A "clone" child here is one that reports to its parent
  991. * using a signal other than SIGCHLD.) */
  992. if (((p->exit_signal != SIGCHLD) ^ !!(wo->wo_flags & __WCLONE))
  993. && !(wo->wo_flags & __WALL))
  994. return 0;
  995. return 1;
  996. }
  997. static int wait_noreap_copyout(struct wait_opts *wo, struct task_struct *p,
  998. pid_t pid, uid_t uid, int why, int status)
  999. {
  1000. struct siginfo __user *infop;
  1001. int retval = wo->wo_rusage
  1002. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  1003. put_task_struct(p);
  1004. infop = wo->wo_info;
  1005. if (infop) {
  1006. if (!retval)
  1007. retval = put_user(SIGCHLD, &infop->si_signo);
  1008. if (!retval)
  1009. retval = put_user(0, &infop->si_errno);
  1010. if (!retval)
  1011. retval = put_user((short)why, &infop->si_code);
  1012. if (!retval)
  1013. retval = put_user(pid, &infop->si_pid);
  1014. if (!retval)
  1015. retval = put_user(uid, &infop->si_uid);
  1016. if (!retval)
  1017. retval = put_user(status, &infop->si_status);
  1018. }
  1019. if (!retval)
  1020. retval = pid;
  1021. return retval;
  1022. }
  1023. /*
  1024. * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
  1025. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1026. * the lock and this task is uninteresting. If we return nonzero, we have
  1027. * released the lock and the system call should return.
  1028. */
  1029. static int wait_task_zombie(struct wait_opts *wo, struct task_struct *p)
  1030. {
  1031. unsigned long state;
  1032. int retval, status, traced;
  1033. pid_t pid = task_pid_vnr(p);
  1034. uid_t uid = __task_cred(p)->uid;
  1035. struct siginfo __user *infop;
  1036. if (!likely(wo->wo_flags & WEXITED))
  1037. return 0;
  1038. if (unlikely(wo->wo_flags & WNOWAIT)) {
  1039. int exit_code = p->exit_code;
  1040. int why;
  1041. get_task_struct(p);
  1042. read_unlock(&tasklist_lock);
  1043. if ((exit_code & 0x7f) == 0) {
  1044. why = CLD_EXITED;
  1045. status = exit_code >> 8;
  1046. } else {
  1047. why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
  1048. status = exit_code & 0x7f;
  1049. }
  1050. return wait_noreap_copyout(wo, p, pid, uid, why, status);
  1051. }
  1052. /*
  1053. * Try to move the task's state to DEAD
  1054. * only one thread is allowed to do this:
  1055. */
  1056. state = xchg(&p->exit_state, EXIT_DEAD);
  1057. if (state != EXIT_ZOMBIE) {
  1058. BUG_ON(state != EXIT_DEAD);
  1059. return 0;
  1060. }
  1061. traced = ptrace_reparented(p);
  1062. /*
  1063. * It can be ptraced but not reparented, check
  1064. * thread_group_leader() to filter out sub-threads.
  1065. */
  1066. if (likely(!traced) && thread_group_leader(p)) {
  1067. struct signal_struct *psig;
  1068. struct signal_struct *sig;
  1069. unsigned long maxrss;
  1070. cputime_t tgutime, tgstime;
  1071. /*
  1072. * The resource counters for the group leader are in its
  1073. * own task_struct. Those for dead threads in the group
  1074. * are in its signal_struct, as are those for the child
  1075. * processes it has previously reaped. All these
  1076. * accumulate in the parent's signal_struct c* fields.
  1077. *
  1078. * We don't bother to take a lock here to protect these
  1079. * p->signal fields, because they are only touched by
  1080. * __exit_signal, which runs with tasklist_lock
  1081. * write-locked anyway, and so is excluded here. We do
  1082. * need to protect the access to parent->signal fields,
  1083. * as other threads in the parent group can be right
  1084. * here reaping other children at the same time.
  1085. *
  1086. * We use thread_group_times() to get times for the thread
  1087. * group, which consolidates times for all threads in the
  1088. * group including the group leader.
  1089. */
  1090. thread_group_times(p, &tgutime, &tgstime);
  1091. spin_lock_irq(&p->real_parent->sighand->siglock);
  1092. psig = p->real_parent->signal;
  1093. sig = p->signal;
  1094. psig->cutime =
  1095. cputime_add(psig->cutime,
  1096. cputime_add(tgutime,
  1097. sig->cutime));
  1098. psig->cstime =
  1099. cputime_add(psig->cstime,
  1100. cputime_add(tgstime,
  1101. sig->cstime));
  1102. psig->cgtime =
  1103. cputime_add(psig->cgtime,
  1104. cputime_add(p->gtime,
  1105. cputime_add(sig->gtime,
  1106. sig->cgtime)));
  1107. psig->cmin_flt +=
  1108. p->min_flt + sig->min_flt + sig->cmin_flt;
  1109. psig->cmaj_flt +=
  1110. p->maj_flt + sig->maj_flt + sig->cmaj_flt;
  1111. psig->cnvcsw +=
  1112. p->nvcsw + sig->nvcsw + sig->cnvcsw;
  1113. psig->cnivcsw +=
  1114. p->nivcsw + sig->nivcsw + sig->cnivcsw;
  1115. psig->cinblock +=
  1116. task_io_get_inblock(p) +
  1117. sig->inblock + sig->cinblock;
  1118. psig->coublock +=
  1119. task_io_get_oublock(p) +
  1120. sig->oublock + sig->coublock;
  1121. maxrss = max(sig->maxrss, sig->cmaxrss);
  1122. if (psig->cmaxrss < maxrss)
  1123. psig->cmaxrss = maxrss;
  1124. task_io_accounting_add(&psig->ioac, &p->ioac);
  1125. task_io_accounting_add(&psig->ioac, &sig->ioac);
  1126. spin_unlock_irq(&p->real_parent->sighand->siglock);
  1127. }
  1128. /*
  1129. * Now we are sure this task is interesting, and no other
  1130. * thread can reap it because we set its state to EXIT_DEAD.
  1131. */
  1132. read_unlock(&tasklist_lock);
  1133. retval = wo->wo_rusage
  1134. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  1135. status = (p->signal->flags & SIGNAL_GROUP_EXIT)
  1136. ? p->signal->group_exit_code : p->exit_code;
  1137. if (!retval && wo->wo_stat)
  1138. retval = put_user(status, wo->wo_stat);
  1139. infop = wo->wo_info;
  1140. if (!retval && infop)
  1141. retval = put_user(SIGCHLD, &infop->si_signo);
  1142. if (!retval && infop)
  1143. retval = put_user(0, &infop->si_errno);
  1144. if (!retval && infop) {
  1145. int why;
  1146. if ((status & 0x7f) == 0) {
  1147. why = CLD_EXITED;
  1148. status >>= 8;
  1149. } else {
  1150. why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
  1151. status &= 0x7f;
  1152. }
  1153. retval = put_user((short)why, &infop->si_code);
  1154. if (!retval)
  1155. retval = put_user(status, &infop->si_status);
  1156. }
  1157. if (!retval && infop)
  1158. retval = put_user(pid, &infop->si_pid);
  1159. if (!retval && infop)
  1160. retval = put_user(uid, &infop->si_uid);
  1161. if (!retval)
  1162. retval = pid;
  1163. if (traced) {
  1164. write_lock_irq(&tasklist_lock);
  1165. /* We dropped tasklist, ptracer could die and untrace */
  1166. ptrace_unlink(p);
  1167. /*
  1168. * If this is not a sub-thread, notify the parent.
  1169. * If parent wants a zombie, don't release it now.
  1170. */
  1171. if (thread_group_leader(p) &&
  1172. !do_notify_parent(p, p->exit_signal)) {
  1173. p->exit_state = EXIT_ZOMBIE;
  1174. p = NULL;
  1175. }
  1176. write_unlock_irq(&tasklist_lock);
  1177. }
  1178. if (p != NULL)
  1179. release_task(p);
  1180. return retval;
  1181. }
  1182. static int *task_stopped_code(struct task_struct *p, bool ptrace)
  1183. {
  1184. if (ptrace) {
  1185. if (task_is_stopped_or_traced(p) &&
  1186. !(p->jobctl & JOBCTL_LISTENING))
  1187. return &p->exit_code;
  1188. } else {
  1189. if (p->signal->flags & SIGNAL_STOP_STOPPED)
  1190. return &p->signal->group_exit_code;
  1191. }
  1192. return NULL;
  1193. }
  1194. /**
  1195. * wait_task_stopped - Wait for %TASK_STOPPED or %TASK_TRACED
  1196. * @wo: wait options
  1197. * @ptrace: is the wait for ptrace
  1198. * @p: task to wait for
  1199. *
  1200. * Handle sys_wait4() work for %p in state %TASK_STOPPED or %TASK_TRACED.
  1201. *
  1202. * CONTEXT:
  1203. * read_lock(&tasklist_lock), which is released if return value is
  1204. * non-zero. Also, grabs and releases @p->sighand->siglock.
  1205. *
  1206. * RETURNS:
  1207. * 0 if wait condition didn't exist and search for other wait conditions
  1208. * should continue. Non-zero return, -errno on failure and @p's pid on
  1209. * success, implies that tasklist_lock is released and wait condition
  1210. * search should terminate.
  1211. */
  1212. static int wait_task_stopped(struct wait_opts *wo,
  1213. int ptrace, struct task_struct *p)
  1214. {
  1215. struct siginfo __user *infop;
  1216. int retval, exit_code, *p_code, why;
  1217. uid_t uid = 0; /* unneeded, required by compiler */
  1218. pid_t pid;
  1219. /*
  1220. * Traditionally we see ptrace'd stopped tasks regardless of options.
  1221. */
  1222. if (!ptrace && !(wo->wo_flags & WUNTRACED))
  1223. return 0;
  1224. if (!task_stopped_code(p, ptrace))
  1225. return 0;
  1226. exit_code = 0;
  1227. spin_lock_irq(&p->sighand->siglock);
  1228. p_code = task_stopped_code(p, ptrace);
  1229. if (unlikely(!p_code))
  1230. goto unlock_sig;
  1231. exit_code = *p_code;
  1232. if (!exit_code)
  1233. goto unlock_sig;
  1234. if (!unlikely(wo->wo_flags & WNOWAIT))
  1235. *p_code = 0;
  1236. uid = task_uid(p);
  1237. unlock_sig:
  1238. spin_unlock_irq(&p->sighand->siglock);
  1239. if (!exit_code)
  1240. return 0;
  1241. /*
  1242. * Now we are pretty sure this task is interesting.
  1243. * Make sure it doesn't get reaped out from under us while we
  1244. * give up the lock and then examine it below. We don't want to
  1245. * keep holding onto the tasklist_lock while we call getrusage and
  1246. * possibly take page faults for user memory.
  1247. */
  1248. get_task_struct(p);
  1249. pid = task_pid_vnr(p);
  1250. why = ptrace ? CLD_TRAPPED : CLD_STOPPED;
  1251. read_unlock(&tasklist_lock);
  1252. if (unlikely(wo->wo_flags & WNOWAIT))
  1253. return wait_noreap_copyout(wo, p, pid, uid, why, exit_code);
  1254. retval = wo->wo_rusage
  1255. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  1256. if (!retval && wo->wo_stat)
  1257. retval = put_user((exit_code << 8) | 0x7f, wo->wo_stat);
  1258. infop = wo->wo_info;
  1259. if (!retval && infop)
  1260. retval = put_user(SIGCHLD, &infop->si_signo);
  1261. if (!retval && infop)
  1262. retval = put_user(0, &infop->si_errno);
  1263. if (!retval && infop)
  1264. retval = put_user((short)why, &infop->si_code);
  1265. if (!retval && infop)
  1266. retval = put_user(exit_code, &infop->si_status);
  1267. if (!retval && infop)
  1268. retval = put_user(pid, &infop->si_pid);
  1269. if (!retval && infop)
  1270. retval = put_user(uid, &infop->si_uid);
  1271. if (!retval)
  1272. retval = pid;
  1273. put_task_struct(p);
  1274. BUG_ON(!retval);
  1275. return retval;
  1276. }
  1277. /*
  1278. * Handle do_wait work for one task in a live, non-stopped state.
  1279. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1280. * the lock and this task is uninteresting. If we return nonzero, we have
  1281. * released the lock and the system call should return.
  1282. */
  1283. static int wait_task_continued(struct wait_opts *wo, struct task_struct *p)
  1284. {
  1285. int retval;
  1286. pid_t pid;
  1287. uid_t uid;
  1288. if (!unlikely(wo->wo_flags & WCONTINUED))
  1289. return 0;
  1290. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
  1291. return 0;
  1292. spin_lock_irq(&p->sighand->siglock);
  1293. /* Re-check with the lock held. */
  1294. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
  1295. spin_unlock_irq(&p->sighand->siglock);
  1296. return 0;
  1297. }
  1298. if (!unlikely(wo->wo_flags & WNOWAIT))
  1299. p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
  1300. uid = task_uid(p);
  1301. spin_unlock_irq(&p->sighand->siglock);
  1302. pid = task_pid_vnr(p);
  1303. get_task_struct(p);
  1304. read_unlock(&tasklist_lock);
  1305. if (!wo->wo_info) {
  1306. retval = wo->wo_rusage
  1307. ? getrusage(p, RUSAGE_BOTH, wo->wo_rusage) : 0;
  1308. put_task_struct(p);
  1309. if (!retval && wo->wo_stat)
  1310. retval = put_user(0xffff, wo->wo_stat);
  1311. if (!retval)
  1312. retval = pid;
  1313. } else {
  1314. retval = wait_noreap_copyout(wo, p, pid, uid,
  1315. CLD_CONTINUED, SIGCONT);
  1316. BUG_ON(retval == 0);
  1317. }
  1318. return retval;
  1319. }
  1320. /*
  1321. * Consider @p for a wait by @parent.
  1322. *
  1323. * -ECHILD should be in ->notask_error before the first call.
  1324. * Returns nonzero for a final return, when we have unlocked tasklist_lock.
  1325. * Returns zero if the search for a child should continue;
  1326. * then ->notask_error is 0 if @p is an eligible child,
  1327. * or another error from security_task_wait(), or still -ECHILD.
  1328. */
  1329. static int wait_consider_task(struct wait_opts *wo, int ptrace,
  1330. struct task_struct *p)
  1331. {
  1332. int ret = eligible_child(wo, p);
  1333. if (!ret)
  1334. return ret;
  1335. ret = security_task_wait(p);
  1336. if (unlikely(ret < 0)) {
  1337. /*
  1338. * If we have not yet seen any eligible child,
  1339. * then let this error code replace -ECHILD.
  1340. * A permission error will give the user a clue
  1341. * to look for security policy problems, rather
  1342. * than for mysterious wait bugs.
  1343. */
  1344. if (wo->notask_error)
  1345. wo->notask_error = ret;
  1346. return 0;
  1347. }
  1348. /* dead body doesn't have much to contribute */
  1349. if (p->exit_state == EXIT_DEAD)
  1350. return 0;
  1351. /* slay zombie? */
  1352. if (p->exit_state == EXIT_ZOMBIE) {
  1353. /*
  1354. * A zombie ptracee is only visible to its ptracer.
  1355. * Notification and reaping will be cascaded to the real
  1356. * parent when the ptracer detaches.
  1357. */
  1358. if (likely(!ptrace) && unlikely(p->ptrace)) {
  1359. /* it will become visible, clear notask_error */
  1360. wo->notask_error = 0;
  1361. return 0;
  1362. }
  1363. /* we don't reap group leaders with subthreads */
  1364. if (!delay_group_leader(p))
  1365. return wait_task_zombie(wo, p);
  1366. /*
  1367. * Allow access to stopped/continued state via zombie by
  1368. * falling through. Clearing of notask_error is complex.
  1369. *
  1370. * When !@ptrace:
  1371. *
  1372. * If WEXITED is set, notask_error should naturally be
  1373. * cleared. If not, subset of WSTOPPED|WCONTINUED is set,
  1374. * so, if there are live subthreads, there are events to
  1375. * wait for. If all subthreads are dead, it's still safe
  1376. * to clear - this function will be called again in finite
  1377. * amount time once all the subthreads are released and
  1378. * will then return without clearing.
  1379. *
  1380. * When @ptrace:
  1381. *
  1382. * Stopped state is per-task and thus can't change once the
  1383. * target task dies. Only continued and exited can happen.
  1384. * Clear notask_error if WCONTINUED | WEXITED.
  1385. */
  1386. if (likely(!ptrace) || (wo->wo_flags & (WCONTINUED | WEXITED)))
  1387. wo->notask_error = 0;
  1388. } else {
  1389. /*
  1390. * If @p is ptraced by a task in its real parent's group,
  1391. * hide group stop/continued state when looking at @p as
  1392. * the real parent; otherwise, a single stop can be
  1393. * reported twice as group and ptrace stops.
  1394. *
  1395. * If a ptracer wants to distinguish the two events for its
  1396. * own children, it should create a separate process which
  1397. * takes the role of real parent.
  1398. */
  1399. if (likely(!ptrace) && p->ptrace && !ptrace_reparented(p))
  1400. return 0;
  1401. /*
  1402. * @p is alive and it's gonna stop, continue or exit, so
  1403. * there always is something to wait for.
  1404. */
  1405. wo->notask_error = 0;
  1406. }
  1407. /*
  1408. * Wait for stopped. Depending on @ptrace, different stopped state
  1409. * is used and the two don't interact with each other.
  1410. */
  1411. ret = wait_task_stopped(wo, ptrace, p);
  1412. if (ret)
  1413. return ret;
  1414. /*
  1415. * Wait for continued. There's only one continued state and the
  1416. * ptracer can consume it which can confuse the real parent. Don't
  1417. * use WCONTINUED from ptracer. You don't need or want it.
  1418. */
  1419. return wait_task_continued(wo, p);
  1420. }
  1421. /*
  1422. * Do the work of do_wait() for one thread in the group, @tsk.
  1423. *
  1424. * -ECHILD should be in ->notask_error before the first call.
  1425. * Returns nonzero for a final return, when we have unlocked tasklist_lock.
  1426. * Returns zero if the search for a child should continue; then
  1427. * ->notask_error is 0 if there were any eligible children,
  1428. * or another error from security_task_wait(), or still -ECHILD.
  1429. */
  1430. static int do_wait_thread(struct wait_opts *wo, struct task_struct *tsk)
  1431. {
  1432. struct task_struct *p;
  1433. list_for_each_entry(p, &tsk->children, sibling) {
  1434. int ret = wait_consider_task(wo, 0, p);
  1435. if (ret)
  1436. return ret;
  1437. }
  1438. return 0;
  1439. }
  1440. static int ptrace_do_wait(struct wait_opts *wo, struct task_struct *tsk)
  1441. {
  1442. struct task_struct *p;
  1443. list_for_each_entry(p, &tsk->ptraced, ptrace_entry) {
  1444. int ret = wait_consider_task(wo, 1, p);
  1445. if (ret)
  1446. return ret;
  1447. }
  1448. return 0;
  1449. }
  1450. static int child_wait_callback(wait_queue_t *wait, unsigned mode,
  1451. int sync, void *key)
  1452. {
  1453. struct wait_opts *wo = container_of(wait, struct wait_opts,
  1454. child_wait);
  1455. struct task_struct *p = key;
  1456. if (!eligible_pid(wo, p))
  1457. return 0;
  1458. if ((wo->wo_flags & __WNOTHREAD) && wait->private != p->parent)
  1459. return 0;
  1460. return default_wake_function(wait, mode, sync, key);
  1461. }
  1462. void __wake_up_parent(struct task_struct *p, struct task_struct *parent)
  1463. {
  1464. __wake_up_sync_key(&parent->signal->wait_chldexit,
  1465. TASK_INTERRUPTIBLE, 1, p);
  1466. }
  1467. static long do_wait(struct wait_opts *wo)
  1468. {
  1469. struct task_struct *tsk;
  1470. int retval;
  1471. trace_sched_process_wait(wo->wo_pid);
  1472. init_waitqueue_func_entry(&wo->child_wait, child_wait_callback);
  1473. wo->child_wait.private = current;
  1474. add_wait_queue(&current->signal->wait_chldexit, &wo->child_wait);
  1475. repeat:
  1476. /*
  1477. * If there is nothing that can match our critiera just get out.
  1478. * We will clear ->notask_error to zero if we see any child that
  1479. * might later match our criteria, even if we are not able to reap
  1480. * it yet.
  1481. */
  1482. wo->notask_error = -ECHILD;
  1483. if ((wo->wo_type < PIDTYPE_MAX) &&
  1484. (!wo->wo_pid || hlist_empty(&wo->wo_pid->tasks[wo->wo_type])))
  1485. goto notask;
  1486. set_current_state(TASK_INTERRUPTIBLE);
  1487. read_lock(&tasklist_lock);
  1488. tsk = current;
  1489. do {
  1490. retval = do_wait_thread(wo, tsk);
  1491. if (retval)
  1492. goto end;
  1493. retval = ptrace_do_wait(wo, tsk);
  1494. if (retval)
  1495. goto end;
  1496. if (wo->wo_flags & __WNOTHREAD)
  1497. break;
  1498. } while_each_thread(current, tsk);
  1499. read_unlock(&tasklist_lock);
  1500. notask:
  1501. retval = wo->notask_error;
  1502. if (!retval && !(wo->wo_flags & WNOHANG)) {
  1503. retval = -ERESTARTSYS;
  1504. if (!signal_pending(current)) {
  1505. schedule();
  1506. goto repeat;
  1507. }
  1508. }
  1509. end:
  1510. __set_current_state(TASK_RUNNING);
  1511. remove_wait_queue(&current->signal->wait_chldexit, &wo->child_wait);
  1512. return retval;
  1513. }
  1514. SYSCALL_DEFINE5(waitid, int, which, pid_t, upid, struct siginfo __user *,
  1515. infop, int, options, struct rusage __user *, ru)
  1516. {
  1517. struct wait_opts wo;
  1518. struct pid *pid = NULL;
  1519. enum pid_type type;
  1520. long ret;
  1521. if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
  1522. return -EINVAL;
  1523. if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
  1524. return -EINVAL;
  1525. switch (which) {
  1526. case P_ALL:
  1527. type = PIDTYPE_MAX;
  1528. break;
  1529. case P_PID:
  1530. type = PIDTYPE_PID;
  1531. if (upid <= 0)
  1532. return -EINVAL;
  1533. break;
  1534. case P_PGID:
  1535. type = PIDTYPE_PGID;
  1536. if (upid <= 0)
  1537. return -EINVAL;
  1538. break;
  1539. default:
  1540. return -EINVAL;
  1541. }
  1542. if (type < PIDTYPE_MAX)
  1543. pid = find_get_pid(upid);
  1544. wo.wo_type = type;
  1545. wo.wo_pid = pid;
  1546. wo.wo_flags = options;
  1547. wo.wo_info = infop;
  1548. wo.wo_stat = NULL;
  1549. wo.wo_rusage = ru;
  1550. ret = do_wait(&wo);
  1551. if (ret > 0) {
  1552. ret = 0;
  1553. } else if (infop) {
  1554. /*
  1555. * For a WNOHANG return, clear out all the fields
  1556. * we would set so the user can easily tell the
  1557. * difference.
  1558. */
  1559. if (!ret)
  1560. ret = put_user(0, &infop->si_signo);
  1561. if (!ret)
  1562. ret = put_user(0, &infop->si_errno);
  1563. if (!ret)
  1564. ret = put_user(0, &infop->si_code);
  1565. if (!ret)
  1566. ret = put_user(0, &infop->si_pid);
  1567. if (!ret)
  1568. ret = put_user(0, &infop->si_uid);
  1569. if (!ret)
  1570. ret = put_user(0, &infop->si_status);
  1571. }
  1572. put_pid(pid);
  1573. /* avoid REGPARM breakage on x86: */
  1574. asmlinkage_protect(5, ret, which, upid, infop, options, ru);
  1575. return ret;
  1576. }
  1577. SYSCALL_DEFINE4(wait4, pid_t, upid, int __user *, stat_addr,
  1578. int, options, struct rusage __user *, ru)
  1579. {
  1580. struct wait_opts wo;
  1581. struct pid *pid = NULL;
  1582. enum pid_type type;
  1583. long ret;
  1584. if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
  1585. __WNOTHREAD|__WCLONE|__WALL))
  1586. return -EINVAL;
  1587. if (upid == -1)
  1588. type = PIDTYPE_MAX;
  1589. else if (upid < 0) {
  1590. type = PIDTYPE_PGID;
  1591. pid = find_get_pid(-upid);
  1592. } else if (upid == 0) {
  1593. type = PIDTYPE_PGID;
  1594. pid = get_task_pid(current, PIDTYPE_PGID);
  1595. } else /* upid > 0 */ {
  1596. type = PIDTYPE_PID;
  1597. pid = find_get_pid(upid);
  1598. }
  1599. wo.wo_type = type;
  1600. wo.wo_pid = pid;
  1601. wo.wo_flags = options | WEXITED;
  1602. wo.wo_info = NULL;
  1603. wo.wo_stat = stat_addr;
  1604. wo.wo_rusage = ru;
  1605. ret = do_wait(&wo);
  1606. put_pid(pid);
  1607. /* avoid REGPARM breakage on x86: */
  1608. asmlinkage_protect(4, ret, upid, stat_addr, options, ru);
  1609. return ret;
  1610. }
  1611. #ifdef __ARCH_WANT_SYS_WAITPID
  1612. /*
  1613. * sys_waitpid() remains for compatibility. waitpid() should be
  1614. * implemented by calling sys_wait4() from libc.a.
  1615. */
  1616. SYSCALL_DEFINE3(waitpid, pid_t, pid, int __user *, stat_addr, int, options)
  1617. {
  1618. return sys_wait4(pid, stat_addr, options, NULL);
  1619. }
  1620. #endif