exit.c 42 KB

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