exit.c 43 KB

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