exit.c 47 KB

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