exit.c 44 KB

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