exit.c 46 KB

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