exit.c 44 KB

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