exit.c 44 KB

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