exit.c 44 KB

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