exit.c 48 KB

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