exit.c 43 KB

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