exit.c 44 KB

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