exit.c 46 KB

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