exit.c 47 KB

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