exit.c 39 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546
  1. /*
  2. * linux/kernel/exit.c
  3. *
  4. * Copyright (C) 1991, 1992 Linus Torvalds
  5. */
  6. #include <linux/config.h>
  7. #include <linux/mm.h>
  8. #include <linux/slab.h>
  9. #include <linux/interrupt.h>
  10. #include <linux/smp_lock.h>
  11. #include <linux/module.h>
  12. #include <linux/completion.h>
  13. #include <linux/personality.h>
  14. #include <linux/tty.h>
  15. #include <linux/namespace.h>
  16. #include <linux/key.h>
  17. #include <linux/security.h>
  18. #include <linux/cpu.h>
  19. #include <linux/acct.h>
  20. #include <linux/file.h>
  21. #include <linux/binfmts.h>
  22. #include <linux/ptrace.h>
  23. #include <linux/profile.h>
  24. #include <linux/mount.h>
  25. #include <linux/proc_fs.h>
  26. #include <linux/mempolicy.h>
  27. #include <linux/cpuset.h>
  28. #include <linux/syscalls.h>
  29. #include <linux/signal.h>
  30. #include <asm/uaccess.h>
  31. #include <asm/unistd.h>
  32. #include <asm/pgtable.h>
  33. #include <asm/mmu_context.h>
  34. extern void sem_exit (void);
  35. extern struct task_struct *child_reaper;
  36. int getrusage(struct task_struct *, int, struct rusage __user *);
  37. static void exit_mm(struct task_struct * tsk);
  38. static void __unhash_process(struct task_struct *p)
  39. {
  40. nr_threads--;
  41. detach_pid(p, PIDTYPE_PID);
  42. detach_pid(p, PIDTYPE_TGID);
  43. if (thread_group_leader(p)) {
  44. detach_pid(p, PIDTYPE_PGID);
  45. detach_pid(p, PIDTYPE_SID);
  46. if (p->pid)
  47. __get_cpu_var(process_counts)--;
  48. }
  49. REMOVE_LINKS(p);
  50. }
  51. void release_task(struct task_struct * p)
  52. {
  53. int zap_leader;
  54. task_t *leader;
  55. struct dentry *proc_dentry;
  56. repeat:
  57. atomic_dec(&p->user->processes);
  58. spin_lock(&p->proc_lock);
  59. proc_dentry = proc_pid_unhash(p);
  60. write_lock_irq(&tasklist_lock);
  61. if (unlikely(p->ptrace))
  62. __ptrace_unlink(p);
  63. BUG_ON(!list_empty(&p->ptrace_list) || !list_empty(&p->ptrace_children));
  64. __exit_signal(p);
  65. __exit_sighand(p);
  66. /*
  67. * Note that the fastpath in sys_times depends on __exit_signal having
  68. * updated the counters before a task is removed from the tasklist of
  69. * the process by __unhash_process.
  70. */
  71. __unhash_process(p);
  72. /*
  73. * If we are the last non-leader member of the thread
  74. * group, and the leader is zombie, then notify the
  75. * group leader's parent process. (if it wants notification.)
  76. */
  77. zap_leader = 0;
  78. leader = p->group_leader;
  79. if (leader != p && thread_group_empty(leader) && leader->exit_state == EXIT_ZOMBIE) {
  80. BUG_ON(leader->exit_signal == -1);
  81. do_notify_parent(leader, leader->exit_signal);
  82. /*
  83. * If we were the last child thread and the leader has
  84. * exited already, and the leader's parent ignores SIGCHLD,
  85. * then we are the one who should release the leader.
  86. *
  87. * do_notify_parent() will have marked it self-reaping in
  88. * that case.
  89. */
  90. zap_leader = (leader->exit_signal == -1);
  91. }
  92. sched_exit(p);
  93. write_unlock_irq(&tasklist_lock);
  94. spin_unlock(&p->proc_lock);
  95. proc_pid_flush(proc_dentry);
  96. release_thread(p);
  97. put_task_struct(p);
  98. p = leader;
  99. if (unlikely(zap_leader))
  100. goto repeat;
  101. }
  102. /* we are using it only for SMP init */
  103. void unhash_process(struct task_struct *p)
  104. {
  105. struct dentry *proc_dentry;
  106. spin_lock(&p->proc_lock);
  107. proc_dentry = proc_pid_unhash(p);
  108. write_lock_irq(&tasklist_lock);
  109. __unhash_process(p);
  110. write_unlock_irq(&tasklist_lock);
  111. spin_unlock(&p->proc_lock);
  112. proc_pid_flush(proc_dentry);
  113. }
  114. /*
  115. * This checks not only the pgrp, but falls back on the pid if no
  116. * satisfactory pgrp is found. I dunno - gdb doesn't work correctly
  117. * without this...
  118. */
  119. int session_of_pgrp(int pgrp)
  120. {
  121. struct task_struct *p;
  122. int sid = -1;
  123. read_lock(&tasklist_lock);
  124. do_each_task_pid(pgrp, PIDTYPE_PGID, p) {
  125. if (p->signal->session > 0) {
  126. sid = p->signal->session;
  127. goto out;
  128. }
  129. } while_each_task_pid(pgrp, PIDTYPE_PGID, p);
  130. p = find_task_by_pid(pgrp);
  131. if (p)
  132. sid = p->signal->session;
  133. out:
  134. read_unlock(&tasklist_lock);
  135. return sid;
  136. }
  137. /*
  138. * Determine if a process group is "orphaned", according to the POSIX
  139. * definition in 2.2.2.52. Orphaned process groups are not to be affected
  140. * by terminal-generated stop signals. Newly orphaned process groups are
  141. * to receive a SIGHUP and a SIGCONT.
  142. *
  143. * "I ask you, have you ever known what it is to be an orphan?"
  144. */
  145. static int will_become_orphaned_pgrp(int pgrp, task_t *ignored_task)
  146. {
  147. struct task_struct *p;
  148. int ret = 1;
  149. do_each_task_pid(pgrp, PIDTYPE_PGID, p) {
  150. if (p == ignored_task
  151. || p->exit_state
  152. || p->real_parent->pid == 1)
  153. continue;
  154. if (process_group(p->real_parent) != pgrp
  155. && p->real_parent->signal->session == p->signal->session) {
  156. ret = 0;
  157. break;
  158. }
  159. } while_each_task_pid(pgrp, PIDTYPE_PGID, p);
  160. return ret; /* (sighing) "Often!" */
  161. }
  162. int is_orphaned_pgrp(int pgrp)
  163. {
  164. int retval;
  165. read_lock(&tasklist_lock);
  166. retval = will_become_orphaned_pgrp(pgrp, NULL);
  167. read_unlock(&tasklist_lock);
  168. return retval;
  169. }
  170. static inline int has_stopped_jobs(int pgrp)
  171. {
  172. int retval = 0;
  173. struct task_struct *p;
  174. do_each_task_pid(pgrp, PIDTYPE_PGID, p) {
  175. if (p->state != TASK_STOPPED)
  176. continue;
  177. /* If p is stopped by a debugger on a signal that won't
  178. stop it, then don't count p as stopped. This isn't
  179. perfect but it's a good approximation. */
  180. if (unlikely (p->ptrace)
  181. && p->exit_code != SIGSTOP
  182. && p->exit_code != SIGTSTP
  183. && p->exit_code != SIGTTOU
  184. && p->exit_code != SIGTTIN)
  185. continue;
  186. retval = 1;
  187. break;
  188. } while_each_task_pid(pgrp, PIDTYPE_PGID, p);
  189. return retval;
  190. }
  191. /**
  192. * reparent_to_init - Reparent the calling kernel thread to the init task.
  193. *
  194. * If a kernel thread is launched as a result of a system call, or if
  195. * it ever exits, it should generally reparent itself to init so that
  196. * it is correctly cleaned up on exit.
  197. *
  198. * The various task state such as scheduling policy and priority may have
  199. * been inherited from a user process, so we reset them to sane values here.
  200. *
  201. * NOTE that reparent_to_init() gives the caller full capabilities.
  202. */
  203. static inline void reparent_to_init(void)
  204. {
  205. write_lock_irq(&tasklist_lock);
  206. ptrace_unlink(current);
  207. /* Reparent to init */
  208. REMOVE_LINKS(current);
  209. current->parent = child_reaper;
  210. current->real_parent = child_reaper;
  211. SET_LINKS(current);
  212. /* Set the exit signal to SIGCHLD so we signal init on exit */
  213. current->exit_signal = SIGCHLD;
  214. if ((current->policy == SCHED_NORMAL) && (task_nice(current) < 0))
  215. set_user_nice(current, 0);
  216. /* cpus_allowed? */
  217. /* rt_priority? */
  218. /* signals? */
  219. security_task_reparent_to_init(current);
  220. memcpy(current->signal->rlim, init_task.signal->rlim,
  221. sizeof(current->signal->rlim));
  222. atomic_inc(&(INIT_USER->__count));
  223. write_unlock_irq(&tasklist_lock);
  224. switch_uid(INIT_USER);
  225. }
  226. void __set_special_pids(pid_t session, pid_t pgrp)
  227. {
  228. struct task_struct *curr = current;
  229. if (curr->signal->session != session) {
  230. detach_pid(curr, PIDTYPE_SID);
  231. curr->signal->session = session;
  232. attach_pid(curr, PIDTYPE_SID, session);
  233. }
  234. if (process_group(curr) != pgrp) {
  235. detach_pid(curr, PIDTYPE_PGID);
  236. curr->signal->pgrp = pgrp;
  237. attach_pid(curr, PIDTYPE_PGID, pgrp);
  238. }
  239. }
  240. void set_special_pids(pid_t session, pid_t pgrp)
  241. {
  242. write_lock_irq(&tasklist_lock);
  243. __set_special_pids(session, pgrp);
  244. write_unlock_irq(&tasklist_lock);
  245. }
  246. /*
  247. * Let kernel threads use this to say that they
  248. * allow a certain signal (since daemonize() will
  249. * have disabled all of them by default).
  250. */
  251. int allow_signal(int sig)
  252. {
  253. if (!valid_signal(sig) || sig < 1)
  254. return -EINVAL;
  255. spin_lock_irq(&current->sighand->siglock);
  256. sigdelset(&current->blocked, sig);
  257. if (!current->mm) {
  258. /* Kernel threads handle their own signals.
  259. Let the signal code know it'll be handled, so
  260. that they don't get converted to SIGKILL or
  261. just silently dropped */
  262. current->sighand->action[(sig)-1].sa.sa_handler = (void __user *)2;
  263. }
  264. recalc_sigpending();
  265. spin_unlock_irq(&current->sighand->siglock);
  266. return 0;
  267. }
  268. EXPORT_SYMBOL(allow_signal);
  269. int disallow_signal(int sig)
  270. {
  271. if (!valid_signal(sig) || sig < 1)
  272. return -EINVAL;
  273. spin_lock_irq(&current->sighand->siglock);
  274. sigaddset(&current->blocked, sig);
  275. recalc_sigpending();
  276. spin_unlock_irq(&current->sighand->siglock);
  277. return 0;
  278. }
  279. EXPORT_SYMBOL(disallow_signal);
  280. /*
  281. * Put all the gunge required to become a kernel thread without
  282. * attached user resources in one place where it belongs.
  283. */
  284. void daemonize(const char *name, ...)
  285. {
  286. va_list args;
  287. struct fs_struct *fs;
  288. sigset_t blocked;
  289. va_start(args, name);
  290. vsnprintf(current->comm, sizeof(current->comm), name, args);
  291. va_end(args);
  292. /*
  293. * If we were started as result of loading a module, close all of the
  294. * user space pages. We don't need them, and if we didn't close them
  295. * they would be locked into memory.
  296. */
  297. exit_mm(current);
  298. set_special_pids(1, 1);
  299. down(&tty_sem);
  300. current->signal->tty = NULL;
  301. up(&tty_sem);
  302. /* Block and flush all signals */
  303. sigfillset(&blocked);
  304. sigprocmask(SIG_BLOCK, &blocked, NULL);
  305. flush_signals(current);
  306. /* Become as one with the init task */
  307. exit_fs(current); /* current->fs->count--; */
  308. fs = init_task.fs;
  309. current->fs = fs;
  310. atomic_inc(&fs->count);
  311. exit_files(current);
  312. current->files = init_task.files;
  313. atomic_inc(&current->files->count);
  314. reparent_to_init();
  315. }
  316. EXPORT_SYMBOL(daemonize);
  317. static inline void close_files(struct files_struct * files)
  318. {
  319. int i, j;
  320. j = 0;
  321. for (;;) {
  322. unsigned long set;
  323. i = j * __NFDBITS;
  324. if (i >= files->max_fdset || i >= files->max_fds)
  325. break;
  326. set = files->open_fds->fds_bits[j++];
  327. while (set) {
  328. if (set & 1) {
  329. struct file * file = xchg(&files->fd[i], NULL);
  330. if (file)
  331. filp_close(file, files);
  332. }
  333. i++;
  334. set >>= 1;
  335. }
  336. }
  337. }
  338. struct files_struct *get_files_struct(struct task_struct *task)
  339. {
  340. struct files_struct *files;
  341. task_lock(task);
  342. files = task->files;
  343. if (files)
  344. atomic_inc(&files->count);
  345. task_unlock(task);
  346. return files;
  347. }
  348. void fastcall put_files_struct(struct files_struct *files)
  349. {
  350. if (atomic_dec_and_test(&files->count)) {
  351. close_files(files);
  352. /*
  353. * Free the fd and fdset arrays if we expanded them.
  354. */
  355. if (files->fd != &files->fd_array[0])
  356. free_fd_array(files->fd, files->max_fds);
  357. if (files->max_fdset > __FD_SETSIZE) {
  358. free_fdset(files->open_fds, files->max_fdset);
  359. free_fdset(files->close_on_exec, files->max_fdset);
  360. }
  361. kmem_cache_free(files_cachep, files);
  362. }
  363. }
  364. EXPORT_SYMBOL(put_files_struct);
  365. static inline void __exit_files(struct task_struct *tsk)
  366. {
  367. struct files_struct * files = tsk->files;
  368. if (files) {
  369. task_lock(tsk);
  370. tsk->files = NULL;
  371. task_unlock(tsk);
  372. put_files_struct(files);
  373. }
  374. }
  375. void exit_files(struct task_struct *tsk)
  376. {
  377. __exit_files(tsk);
  378. }
  379. static inline void __put_fs_struct(struct fs_struct *fs)
  380. {
  381. /* No need to hold fs->lock if we are killing it */
  382. if (atomic_dec_and_test(&fs->count)) {
  383. dput(fs->root);
  384. mntput(fs->rootmnt);
  385. dput(fs->pwd);
  386. mntput(fs->pwdmnt);
  387. if (fs->altroot) {
  388. dput(fs->altroot);
  389. mntput(fs->altrootmnt);
  390. }
  391. kmem_cache_free(fs_cachep, fs);
  392. }
  393. }
  394. void put_fs_struct(struct fs_struct *fs)
  395. {
  396. __put_fs_struct(fs);
  397. }
  398. static inline void __exit_fs(struct task_struct *tsk)
  399. {
  400. struct fs_struct * fs = tsk->fs;
  401. if (fs) {
  402. task_lock(tsk);
  403. tsk->fs = NULL;
  404. task_unlock(tsk);
  405. __put_fs_struct(fs);
  406. }
  407. }
  408. void exit_fs(struct task_struct *tsk)
  409. {
  410. __exit_fs(tsk);
  411. }
  412. EXPORT_SYMBOL_GPL(exit_fs);
  413. /*
  414. * Turn us into a lazy TLB process if we
  415. * aren't already..
  416. */
  417. static void exit_mm(struct task_struct * tsk)
  418. {
  419. struct mm_struct *mm = tsk->mm;
  420. mm_release(tsk, mm);
  421. if (!mm)
  422. return;
  423. /*
  424. * Serialize with any possible pending coredump.
  425. * We must hold mmap_sem around checking core_waiters
  426. * and clearing tsk->mm. The core-inducing thread
  427. * will increment core_waiters for each thread in the
  428. * group with ->mm != NULL.
  429. */
  430. down_read(&mm->mmap_sem);
  431. if (mm->core_waiters) {
  432. up_read(&mm->mmap_sem);
  433. down_write(&mm->mmap_sem);
  434. if (!--mm->core_waiters)
  435. complete(mm->core_startup_done);
  436. up_write(&mm->mmap_sem);
  437. wait_for_completion(&mm->core_done);
  438. down_read(&mm->mmap_sem);
  439. }
  440. atomic_inc(&mm->mm_count);
  441. if (mm != tsk->active_mm) BUG();
  442. /* more a memory barrier than a real lock */
  443. task_lock(tsk);
  444. tsk->mm = NULL;
  445. up_read(&mm->mmap_sem);
  446. enter_lazy_tlb(mm, current);
  447. task_unlock(tsk);
  448. mmput(mm);
  449. }
  450. static inline void choose_new_parent(task_t *p, task_t *reaper, task_t *child_reaper)
  451. {
  452. /*
  453. * Make sure we're not reparenting to ourselves and that
  454. * the parent is not a zombie.
  455. */
  456. BUG_ON(p == reaper || reaper->exit_state >= EXIT_ZOMBIE);
  457. p->real_parent = reaper;
  458. }
  459. static inline void reparent_thread(task_t *p, task_t *father, int traced)
  460. {
  461. /* We don't want people slaying init. */
  462. if (p->exit_signal != -1)
  463. p->exit_signal = SIGCHLD;
  464. if (p->pdeath_signal)
  465. /* We already hold the tasklist_lock here. */
  466. group_send_sig_info(p->pdeath_signal, (void *) 0, p);
  467. /* Move the child from its dying parent to the new one. */
  468. if (unlikely(traced)) {
  469. /* Preserve ptrace links if someone else is tracing this child. */
  470. list_del_init(&p->ptrace_list);
  471. if (p->parent != p->real_parent)
  472. list_add(&p->ptrace_list, &p->real_parent->ptrace_children);
  473. } else {
  474. /* If this child is being traced, then we're the one tracing it
  475. * anyway, so let go of it.
  476. */
  477. p->ptrace = 0;
  478. list_del_init(&p->sibling);
  479. p->parent = p->real_parent;
  480. list_add_tail(&p->sibling, &p->parent->children);
  481. /* If we'd notified the old parent about this child's death,
  482. * also notify the new parent.
  483. */
  484. if (p->exit_state == EXIT_ZOMBIE && p->exit_signal != -1 &&
  485. thread_group_empty(p))
  486. do_notify_parent(p, p->exit_signal);
  487. else if (p->state == TASK_TRACED) {
  488. /*
  489. * If it was at a trace stop, turn it into
  490. * a normal stop since it's no longer being
  491. * traced.
  492. */
  493. ptrace_untrace(p);
  494. }
  495. }
  496. /*
  497. * process group orphan check
  498. * Case ii: Our child is in a different pgrp
  499. * than we are, and it was the only connection
  500. * outside, so the child pgrp is now orphaned.
  501. */
  502. if ((process_group(p) != process_group(father)) &&
  503. (p->signal->session == father->signal->session)) {
  504. int pgrp = process_group(p);
  505. if (will_become_orphaned_pgrp(pgrp, NULL) && has_stopped_jobs(pgrp)) {
  506. __kill_pg_info(SIGHUP, (void *)1, pgrp);
  507. __kill_pg_info(SIGCONT, (void *)1, pgrp);
  508. }
  509. }
  510. }
  511. /*
  512. * When we die, we re-parent all our children.
  513. * Try to give them to another thread in our thread
  514. * group, and if no such member exists, give it to
  515. * the global child reaper process (ie "init")
  516. */
  517. static inline void forget_original_parent(struct task_struct * father,
  518. struct list_head *to_release)
  519. {
  520. struct task_struct *p, *reaper = father;
  521. struct list_head *_p, *_n;
  522. do {
  523. reaper = next_thread(reaper);
  524. if (reaper == father) {
  525. reaper = child_reaper;
  526. break;
  527. }
  528. } while (reaper->exit_state);
  529. /*
  530. * There are only two places where our children can be:
  531. *
  532. * - in our child list
  533. * - in our ptraced child list
  534. *
  535. * Search them and reparent children.
  536. */
  537. list_for_each_safe(_p, _n, &father->children) {
  538. int ptrace;
  539. p = list_entry(_p,struct task_struct,sibling);
  540. ptrace = p->ptrace;
  541. /* if father isn't the real parent, then ptrace must be enabled */
  542. BUG_ON(father != p->real_parent && !ptrace);
  543. if (father == p->real_parent) {
  544. /* reparent with a reaper, real father it's us */
  545. choose_new_parent(p, reaper, child_reaper);
  546. reparent_thread(p, father, 0);
  547. } else {
  548. /* reparent ptraced task to its real parent */
  549. __ptrace_unlink (p);
  550. if (p->exit_state == EXIT_ZOMBIE && p->exit_signal != -1 &&
  551. thread_group_empty(p))
  552. do_notify_parent(p, p->exit_signal);
  553. }
  554. /*
  555. * if the ptraced child is a zombie with exit_signal == -1
  556. * we must collect it before we exit, or it will remain
  557. * zombie forever since we prevented it from self-reap itself
  558. * while it was being traced by us, to be able to see it in wait4.
  559. */
  560. if (unlikely(ptrace && p->exit_state == EXIT_ZOMBIE && p->exit_signal == -1))
  561. list_add(&p->ptrace_list, to_release);
  562. }
  563. list_for_each_safe(_p, _n, &father->ptrace_children) {
  564. p = list_entry(_p,struct task_struct,ptrace_list);
  565. choose_new_parent(p, reaper, child_reaper);
  566. reparent_thread(p, father, 1);
  567. }
  568. }
  569. /*
  570. * Send signals to all our closest relatives so that they know
  571. * to properly mourn us..
  572. */
  573. static void exit_notify(struct task_struct *tsk)
  574. {
  575. int state;
  576. struct task_struct *t;
  577. struct list_head ptrace_dead, *_p, *_n;
  578. if (signal_pending(tsk) && !(tsk->signal->flags & SIGNAL_GROUP_EXIT)
  579. && !thread_group_empty(tsk)) {
  580. /*
  581. * This occurs when there was a race between our exit
  582. * syscall and a group signal choosing us as the one to
  583. * wake up. It could be that we are the only thread
  584. * alerted to check for pending signals, but another thread
  585. * should be woken now to take the signal since we will not.
  586. * Now we'll wake all the threads in the group just to make
  587. * sure someone gets all the pending signals.
  588. */
  589. read_lock(&tasklist_lock);
  590. spin_lock_irq(&tsk->sighand->siglock);
  591. for (t = next_thread(tsk); t != tsk; t = next_thread(t))
  592. if (!signal_pending(t) && !(t->flags & PF_EXITING)) {
  593. recalc_sigpending_tsk(t);
  594. if (signal_pending(t))
  595. signal_wake_up(t, 0);
  596. }
  597. spin_unlock_irq(&tsk->sighand->siglock);
  598. read_unlock(&tasklist_lock);
  599. }
  600. write_lock_irq(&tasklist_lock);
  601. /*
  602. * This does two things:
  603. *
  604. * A. Make init inherit all the child processes
  605. * B. Check to see if any process groups have become orphaned
  606. * as a result of our exiting, and if they have any stopped
  607. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  608. */
  609. INIT_LIST_HEAD(&ptrace_dead);
  610. forget_original_parent(tsk, &ptrace_dead);
  611. BUG_ON(!list_empty(&tsk->children));
  612. BUG_ON(!list_empty(&tsk->ptrace_children));
  613. /*
  614. * Check to see if any process groups have become orphaned
  615. * as a result of our exiting, and if they have any stopped
  616. * jobs, send them a SIGHUP and then a SIGCONT. (POSIX 3.2.2.2)
  617. *
  618. * Case i: Our father is in a different pgrp than we are
  619. * and we were the only connection outside, so our pgrp
  620. * is about to become orphaned.
  621. */
  622. t = tsk->real_parent;
  623. if ((process_group(t) != process_group(tsk)) &&
  624. (t->signal->session == tsk->signal->session) &&
  625. will_become_orphaned_pgrp(process_group(tsk), tsk) &&
  626. has_stopped_jobs(process_group(tsk))) {
  627. __kill_pg_info(SIGHUP, (void *)1, process_group(tsk));
  628. __kill_pg_info(SIGCONT, (void *)1, process_group(tsk));
  629. }
  630. /* Let father know we died
  631. *
  632. * Thread signals are configurable, but you aren't going to use
  633. * that to send signals to arbitary processes.
  634. * That stops right now.
  635. *
  636. * If the parent exec id doesn't match the exec id we saved
  637. * when we started then we know the parent has changed security
  638. * domain.
  639. *
  640. * If our self_exec id doesn't match our parent_exec_id then
  641. * we have changed execution domain as these two values started
  642. * the same after a fork.
  643. *
  644. */
  645. if (tsk->exit_signal != SIGCHLD && tsk->exit_signal != -1 &&
  646. ( tsk->parent_exec_id != t->self_exec_id ||
  647. tsk->self_exec_id != tsk->parent_exec_id)
  648. && !capable(CAP_KILL))
  649. tsk->exit_signal = SIGCHLD;
  650. /* If something other than our normal parent is ptracing us, then
  651. * send it a SIGCHLD instead of honoring exit_signal. exit_signal
  652. * only has special meaning to our real parent.
  653. */
  654. if (tsk->exit_signal != -1 && thread_group_empty(tsk)) {
  655. int signal = tsk->parent == tsk->real_parent ? tsk->exit_signal : SIGCHLD;
  656. do_notify_parent(tsk, signal);
  657. } else if (tsk->ptrace) {
  658. do_notify_parent(tsk, SIGCHLD);
  659. }
  660. state = EXIT_ZOMBIE;
  661. if (tsk->exit_signal == -1 &&
  662. (likely(tsk->ptrace == 0) ||
  663. unlikely(tsk->parent->signal->flags & SIGNAL_GROUP_EXIT)))
  664. state = EXIT_DEAD;
  665. tsk->exit_state = state;
  666. write_unlock_irq(&tasklist_lock);
  667. list_for_each_safe(_p, _n, &ptrace_dead) {
  668. list_del_init(_p);
  669. t = list_entry(_p,struct task_struct,ptrace_list);
  670. release_task(t);
  671. }
  672. /* If the process is dead, release it - nobody will wait for it */
  673. if (state == EXIT_DEAD)
  674. release_task(tsk);
  675. /* PF_DEAD causes final put_task_struct after we schedule. */
  676. preempt_disable();
  677. tsk->flags |= PF_DEAD;
  678. }
  679. fastcall NORET_TYPE void do_exit(long code)
  680. {
  681. struct task_struct *tsk = current;
  682. int group_dead;
  683. profile_task_exit(tsk);
  684. WARN_ON(atomic_read(&tsk->fs_excl));
  685. if (unlikely(in_interrupt()))
  686. panic("Aiee, killing interrupt handler!");
  687. if (unlikely(!tsk->pid))
  688. panic("Attempted to kill the idle task!");
  689. if (unlikely(tsk->pid == 1))
  690. panic("Attempted to kill init!");
  691. if (tsk->io_context)
  692. exit_io_context();
  693. if (unlikely(current->ptrace & PT_TRACE_EXIT)) {
  694. current->ptrace_message = code;
  695. ptrace_notify((PTRACE_EVENT_EXIT << 8) | SIGTRAP);
  696. }
  697. /*
  698. * We're taking recursive faults here in do_exit. Safest is to just
  699. * leave this task alone and wait for reboot.
  700. */
  701. if (unlikely(tsk->flags & PF_EXITING)) {
  702. printk(KERN_ALERT
  703. "Fixing recursive fault but reboot is needed!\n");
  704. set_current_state(TASK_UNINTERRUPTIBLE);
  705. schedule();
  706. }
  707. tsk->flags |= PF_EXITING;
  708. /*
  709. * Make sure we don't try to process any timer firings
  710. * while we are already exiting.
  711. */
  712. tsk->it_virt_expires = cputime_zero;
  713. tsk->it_prof_expires = cputime_zero;
  714. tsk->it_sched_expires = 0;
  715. if (unlikely(in_atomic()))
  716. printk(KERN_INFO "note: %s[%d] exited with preempt_count %d\n",
  717. current->comm, current->pid,
  718. preempt_count());
  719. acct_update_integrals(tsk);
  720. update_mem_hiwater(tsk);
  721. group_dead = atomic_dec_and_test(&tsk->signal->live);
  722. if (group_dead)
  723. acct_process(code);
  724. exit_mm(tsk);
  725. exit_sem(tsk);
  726. __exit_files(tsk);
  727. __exit_fs(tsk);
  728. exit_namespace(tsk);
  729. exit_thread();
  730. cpuset_exit(tsk);
  731. exit_keys(tsk);
  732. if (group_dead && tsk->signal->leader)
  733. disassociate_ctty(1);
  734. module_put(tsk->thread_info->exec_domain->module);
  735. if (tsk->binfmt)
  736. module_put(tsk->binfmt->module);
  737. tsk->exit_code = code;
  738. exit_notify(tsk);
  739. #ifdef CONFIG_NUMA
  740. mpol_free(tsk->mempolicy);
  741. tsk->mempolicy = NULL;
  742. #endif
  743. BUG_ON(!(current->flags & PF_DEAD));
  744. schedule();
  745. BUG();
  746. /* Avoid "noreturn function does return". */
  747. for (;;) ;
  748. }
  749. EXPORT_SYMBOL_GPL(do_exit);
  750. NORET_TYPE void complete_and_exit(struct completion *comp, long code)
  751. {
  752. if (comp)
  753. complete(comp);
  754. do_exit(code);
  755. }
  756. EXPORT_SYMBOL(complete_and_exit);
  757. asmlinkage long sys_exit(int error_code)
  758. {
  759. do_exit((error_code&0xff)<<8);
  760. }
  761. task_t fastcall *next_thread(const task_t *p)
  762. {
  763. return pid_task(p->pids[PIDTYPE_TGID].pid_list.next, PIDTYPE_TGID);
  764. }
  765. EXPORT_SYMBOL(next_thread);
  766. /*
  767. * Take down every thread in the group. This is called by fatal signals
  768. * as well as by sys_exit_group (below).
  769. */
  770. NORET_TYPE void
  771. do_group_exit(int exit_code)
  772. {
  773. BUG_ON(exit_code & 0x80); /* core dumps don't get here */
  774. if (current->signal->flags & SIGNAL_GROUP_EXIT)
  775. exit_code = current->signal->group_exit_code;
  776. else if (!thread_group_empty(current)) {
  777. struct signal_struct *const sig = current->signal;
  778. struct sighand_struct *const sighand = current->sighand;
  779. read_lock(&tasklist_lock);
  780. spin_lock_irq(&sighand->siglock);
  781. if (sig->flags & SIGNAL_GROUP_EXIT)
  782. /* Another thread got here before we took the lock. */
  783. exit_code = sig->group_exit_code;
  784. else {
  785. sig->flags = SIGNAL_GROUP_EXIT;
  786. sig->group_exit_code = exit_code;
  787. zap_other_threads(current);
  788. }
  789. spin_unlock_irq(&sighand->siglock);
  790. read_unlock(&tasklist_lock);
  791. }
  792. do_exit(exit_code);
  793. /* NOTREACHED */
  794. }
  795. /*
  796. * this kills every thread in the thread group. Note that any externally
  797. * wait4()-ing process will get the correct exit code - even if this
  798. * thread is not the thread group leader.
  799. */
  800. asmlinkage void sys_exit_group(int error_code)
  801. {
  802. do_group_exit((error_code & 0xff) << 8);
  803. }
  804. static int eligible_child(pid_t pid, int options, task_t *p)
  805. {
  806. if (pid > 0) {
  807. if (p->pid != pid)
  808. return 0;
  809. } else if (!pid) {
  810. if (process_group(p) != process_group(current))
  811. return 0;
  812. } else if (pid != -1) {
  813. if (process_group(p) != -pid)
  814. return 0;
  815. }
  816. /*
  817. * Do not consider detached threads that are
  818. * not ptraced:
  819. */
  820. if (p->exit_signal == -1 && !p->ptrace)
  821. return 0;
  822. /* Wait for all children (clone and not) if __WALL is set;
  823. * otherwise, wait for clone children *only* if __WCLONE is
  824. * set; otherwise, wait for non-clone children *only*. (Note:
  825. * A "clone" child here is one that reports to its parent
  826. * using a signal other than SIGCHLD.) */
  827. if (((p->exit_signal != SIGCHLD) ^ ((options & __WCLONE) != 0))
  828. && !(options & __WALL))
  829. return 0;
  830. /*
  831. * Do not consider thread group leaders that are
  832. * in a non-empty thread group:
  833. */
  834. if (current->tgid != p->tgid && delay_group_leader(p))
  835. return 2;
  836. if (security_task_wait(p))
  837. return 0;
  838. return 1;
  839. }
  840. static int wait_noreap_copyout(task_t *p, pid_t pid, uid_t uid,
  841. int why, int status,
  842. struct siginfo __user *infop,
  843. struct rusage __user *rusagep)
  844. {
  845. int retval = rusagep ? getrusage(p, RUSAGE_BOTH, rusagep) : 0;
  846. put_task_struct(p);
  847. if (!retval)
  848. retval = put_user(SIGCHLD, &infop->si_signo);
  849. if (!retval)
  850. retval = put_user(0, &infop->si_errno);
  851. if (!retval)
  852. retval = put_user((short)why, &infop->si_code);
  853. if (!retval)
  854. retval = put_user(pid, &infop->si_pid);
  855. if (!retval)
  856. retval = put_user(uid, &infop->si_uid);
  857. if (!retval)
  858. retval = put_user(status, &infop->si_status);
  859. if (!retval)
  860. retval = pid;
  861. return retval;
  862. }
  863. /*
  864. * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
  865. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  866. * the lock and this task is uninteresting. If we return nonzero, we have
  867. * released the lock and the system call should return.
  868. */
  869. static int wait_task_zombie(task_t *p, int noreap,
  870. struct siginfo __user *infop,
  871. int __user *stat_addr, struct rusage __user *ru)
  872. {
  873. unsigned long state;
  874. int retval;
  875. int status;
  876. if (unlikely(noreap)) {
  877. pid_t pid = p->pid;
  878. uid_t uid = p->uid;
  879. int exit_code = p->exit_code;
  880. int why, status;
  881. if (unlikely(p->exit_state != EXIT_ZOMBIE))
  882. return 0;
  883. if (unlikely(p->exit_signal == -1 && p->ptrace == 0))
  884. return 0;
  885. get_task_struct(p);
  886. read_unlock(&tasklist_lock);
  887. if ((exit_code & 0x7f) == 0) {
  888. why = CLD_EXITED;
  889. status = exit_code >> 8;
  890. } else {
  891. why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
  892. status = exit_code & 0x7f;
  893. }
  894. return wait_noreap_copyout(p, pid, uid, why,
  895. status, infop, ru);
  896. }
  897. /*
  898. * Try to move the task's state to DEAD
  899. * only one thread is allowed to do this:
  900. */
  901. state = xchg(&p->exit_state, EXIT_DEAD);
  902. if (state != EXIT_ZOMBIE) {
  903. BUG_ON(state != EXIT_DEAD);
  904. return 0;
  905. }
  906. if (unlikely(p->exit_signal == -1 && p->ptrace == 0)) {
  907. /*
  908. * This can only happen in a race with a ptraced thread
  909. * dying on another processor.
  910. */
  911. return 0;
  912. }
  913. if (likely(p->real_parent == p->parent) && likely(p->signal)) {
  914. /*
  915. * The resource counters for the group leader are in its
  916. * own task_struct. Those for dead threads in the group
  917. * are in its signal_struct, as are those for the child
  918. * processes it has previously reaped. All these
  919. * accumulate in the parent's signal_struct c* fields.
  920. *
  921. * We don't bother to take a lock here to protect these
  922. * p->signal fields, because they are only touched by
  923. * __exit_signal, which runs with tasklist_lock
  924. * write-locked anyway, and so is excluded here. We do
  925. * need to protect the access to p->parent->signal fields,
  926. * as other threads in the parent group can be right
  927. * here reaping other children at the same time.
  928. */
  929. spin_lock_irq(&p->parent->sighand->siglock);
  930. p->parent->signal->cutime =
  931. cputime_add(p->parent->signal->cutime,
  932. cputime_add(p->utime,
  933. cputime_add(p->signal->utime,
  934. p->signal->cutime)));
  935. p->parent->signal->cstime =
  936. cputime_add(p->parent->signal->cstime,
  937. cputime_add(p->stime,
  938. cputime_add(p->signal->stime,
  939. p->signal->cstime)));
  940. p->parent->signal->cmin_flt +=
  941. p->min_flt + p->signal->min_flt + p->signal->cmin_flt;
  942. p->parent->signal->cmaj_flt +=
  943. p->maj_flt + p->signal->maj_flt + p->signal->cmaj_flt;
  944. p->parent->signal->cnvcsw +=
  945. p->nvcsw + p->signal->nvcsw + p->signal->cnvcsw;
  946. p->parent->signal->cnivcsw +=
  947. p->nivcsw + p->signal->nivcsw + p->signal->cnivcsw;
  948. spin_unlock_irq(&p->parent->sighand->siglock);
  949. }
  950. /*
  951. * Now we are sure this task is interesting, and no other
  952. * thread can reap it because we set its state to EXIT_DEAD.
  953. */
  954. read_unlock(&tasklist_lock);
  955. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  956. status = (p->signal->flags & SIGNAL_GROUP_EXIT)
  957. ? p->signal->group_exit_code : p->exit_code;
  958. if (!retval && stat_addr)
  959. retval = put_user(status, stat_addr);
  960. if (!retval && infop)
  961. retval = put_user(SIGCHLD, &infop->si_signo);
  962. if (!retval && infop)
  963. retval = put_user(0, &infop->si_errno);
  964. if (!retval && infop) {
  965. int why;
  966. if ((status & 0x7f) == 0) {
  967. why = CLD_EXITED;
  968. status >>= 8;
  969. } else {
  970. why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
  971. status &= 0x7f;
  972. }
  973. retval = put_user((short)why, &infop->si_code);
  974. if (!retval)
  975. retval = put_user(status, &infop->si_status);
  976. }
  977. if (!retval && infop)
  978. retval = put_user(p->pid, &infop->si_pid);
  979. if (!retval && infop)
  980. retval = put_user(p->uid, &infop->si_uid);
  981. if (retval) {
  982. // TODO: is this safe?
  983. p->exit_state = EXIT_ZOMBIE;
  984. return retval;
  985. }
  986. retval = p->pid;
  987. if (p->real_parent != p->parent) {
  988. write_lock_irq(&tasklist_lock);
  989. /* Double-check with lock held. */
  990. if (p->real_parent != p->parent) {
  991. __ptrace_unlink(p);
  992. // TODO: is this safe?
  993. p->exit_state = EXIT_ZOMBIE;
  994. /*
  995. * If this is not a detached task, notify the parent.
  996. * If it's still not detached after that, don't release
  997. * it now.
  998. */
  999. if (p->exit_signal != -1) {
  1000. do_notify_parent(p, p->exit_signal);
  1001. if (p->exit_signal != -1)
  1002. p = NULL;
  1003. }
  1004. }
  1005. write_unlock_irq(&tasklist_lock);
  1006. }
  1007. if (p != NULL)
  1008. release_task(p);
  1009. BUG_ON(!retval);
  1010. return retval;
  1011. }
  1012. /*
  1013. * Handle sys_wait4 work for one task in state TASK_STOPPED. We hold
  1014. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1015. * the lock and this task is uninteresting. If we return nonzero, we have
  1016. * released the lock and the system call should return.
  1017. */
  1018. static int wait_task_stopped(task_t *p, int delayed_group_leader, int noreap,
  1019. struct siginfo __user *infop,
  1020. int __user *stat_addr, struct rusage __user *ru)
  1021. {
  1022. int retval, exit_code;
  1023. if (!p->exit_code)
  1024. return 0;
  1025. if (delayed_group_leader && !(p->ptrace & PT_PTRACED) &&
  1026. p->signal && p->signal->group_stop_count > 0)
  1027. /*
  1028. * A group stop is in progress and this is the group leader.
  1029. * We won't report until all threads have stopped.
  1030. */
  1031. return 0;
  1032. /*
  1033. * Now we are pretty sure this task is interesting.
  1034. * Make sure it doesn't get reaped out from under us while we
  1035. * give up the lock and then examine it below. We don't want to
  1036. * keep holding onto the tasklist_lock while we call getrusage and
  1037. * possibly take page faults for user memory.
  1038. */
  1039. get_task_struct(p);
  1040. read_unlock(&tasklist_lock);
  1041. if (unlikely(noreap)) {
  1042. pid_t pid = p->pid;
  1043. uid_t uid = p->uid;
  1044. int why = (p->ptrace & PT_PTRACED) ? CLD_TRAPPED : CLD_STOPPED;
  1045. exit_code = p->exit_code;
  1046. if (unlikely(!exit_code) ||
  1047. unlikely(p->state > TASK_STOPPED))
  1048. goto bail_ref;
  1049. return wait_noreap_copyout(p, pid, uid,
  1050. why, (exit_code << 8) | 0x7f,
  1051. infop, ru);
  1052. }
  1053. write_lock_irq(&tasklist_lock);
  1054. /*
  1055. * This uses xchg to be atomic with the thread resuming and setting
  1056. * it. It must also be done with the write lock held to prevent a
  1057. * race with the EXIT_ZOMBIE case.
  1058. */
  1059. exit_code = xchg(&p->exit_code, 0);
  1060. if (unlikely(p->exit_state)) {
  1061. /*
  1062. * The task resumed and then died. Let the next iteration
  1063. * catch it in EXIT_ZOMBIE. Note that exit_code might
  1064. * already be zero here if it resumed and did _exit(0).
  1065. * The task itself is dead and won't touch exit_code again;
  1066. * other processors in this function are locked out.
  1067. */
  1068. p->exit_code = exit_code;
  1069. exit_code = 0;
  1070. }
  1071. if (unlikely(exit_code == 0)) {
  1072. /*
  1073. * Another thread in this function got to it first, or it
  1074. * resumed, or it resumed and then died.
  1075. */
  1076. write_unlock_irq(&tasklist_lock);
  1077. bail_ref:
  1078. put_task_struct(p);
  1079. /*
  1080. * We are returning to the wait loop without having successfully
  1081. * removed the process and having released the lock. We cannot
  1082. * continue, since the "p" task pointer is potentially stale.
  1083. *
  1084. * Return -EAGAIN, and do_wait() will restart the loop from the
  1085. * beginning. Do _not_ re-acquire the lock.
  1086. */
  1087. return -EAGAIN;
  1088. }
  1089. /* move to end of parent's list to avoid starvation */
  1090. remove_parent(p);
  1091. add_parent(p, p->parent);
  1092. write_unlock_irq(&tasklist_lock);
  1093. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1094. if (!retval && stat_addr)
  1095. retval = put_user((exit_code << 8) | 0x7f, stat_addr);
  1096. if (!retval && infop)
  1097. retval = put_user(SIGCHLD, &infop->si_signo);
  1098. if (!retval && infop)
  1099. retval = put_user(0, &infop->si_errno);
  1100. if (!retval && infop)
  1101. retval = put_user((short)((p->ptrace & PT_PTRACED)
  1102. ? CLD_TRAPPED : CLD_STOPPED),
  1103. &infop->si_code);
  1104. if (!retval && infop)
  1105. retval = put_user(exit_code, &infop->si_status);
  1106. if (!retval && infop)
  1107. retval = put_user(p->pid, &infop->si_pid);
  1108. if (!retval && infop)
  1109. retval = put_user(p->uid, &infop->si_uid);
  1110. if (!retval)
  1111. retval = p->pid;
  1112. put_task_struct(p);
  1113. BUG_ON(!retval);
  1114. return retval;
  1115. }
  1116. /*
  1117. * Handle do_wait work for one task in a live, non-stopped state.
  1118. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1119. * the lock and this task is uninteresting. If we return nonzero, we have
  1120. * released the lock and the system call should return.
  1121. */
  1122. static int wait_task_continued(task_t *p, int noreap,
  1123. struct siginfo __user *infop,
  1124. int __user *stat_addr, struct rusage __user *ru)
  1125. {
  1126. int retval;
  1127. pid_t pid;
  1128. uid_t uid;
  1129. if (unlikely(!p->signal))
  1130. return 0;
  1131. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
  1132. return 0;
  1133. spin_lock_irq(&p->sighand->siglock);
  1134. /* Re-check with the lock held. */
  1135. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
  1136. spin_unlock_irq(&p->sighand->siglock);
  1137. return 0;
  1138. }
  1139. if (!noreap)
  1140. p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
  1141. spin_unlock_irq(&p->sighand->siglock);
  1142. pid = p->pid;
  1143. uid = p->uid;
  1144. get_task_struct(p);
  1145. read_unlock(&tasklist_lock);
  1146. if (!infop) {
  1147. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1148. put_task_struct(p);
  1149. if (!retval && stat_addr)
  1150. retval = put_user(0xffff, stat_addr);
  1151. if (!retval)
  1152. retval = p->pid;
  1153. } else {
  1154. retval = wait_noreap_copyout(p, pid, uid,
  1155. CLD_CONTINUED, SIGCONT,
  1156. infop, ru);
  1157. BUG_ON(retval == 0);
  1158. }
  1159. return retval;
  1160. }
  1161. static inline int my_ptrace_child(struct task_struct *p)
  1162. {
  1163. if (!(p->ptrace & PT_PTRACED))
  1164. return 0;
  1165. if (!(p->ptrace & PT_ATTACHED))
  1166. return 1;
  1167. /*
  1168. * This child was PTRACE_ATTACH'd. We should be seeing it only if
  1169. * we are the attacher. If we are the real parent, this is a race
  1170. * inside ptrace_attach. It is waiting for the tasklist_lock,
  1171. * which we have to switch the parent links, but has already set
  1172. * the flags in p->ptrace.
  1173. */
  1174. return (p->parent != p->real_parent);
  1175. }
  1176. static long do_wait(pid_t pid, int options, struct siginfo __user *infop,
  1177. int __user *stat_addr, struct rusage __user *ru)
  1178. {
  1179. DECLARE_WAITQUEUE(wait, current);
  1180. struct task_struct *tsk;
  1181. int flag, retval;
  1182. add_wait_queue(&current->signal->wait_chldexit,&wait);
  1183. repeat:
  1184. /*
  1185. * We will set this flag if we see any child that might later
  1186. * match our criteria, even if we are not able to reap it yet.
  1187. */
  1188. flag = 0;
  1189. current->state = TASK_INTERRUPTIBLE;
  1190. read_lock(&tasklist_lock);
  1191. tsk = current;
  1192. do {
  1193. struct task_struct *p;
  1194. struct list_head *_p;
  1195. int ret;
  1196. list_for_each(_p,&tsk->children) {
  1197. p = list_entry(_p,struct task_struct,sibling);
  1198. ret = eligible_child(pid, options, p);
  1199. if (!ret)
  1200. continue;
  1201. switch (p->state) {
  1202. case TASK_TRACED:
  1203. if (!my_ptrace_child(p))
  1204. continue;
  1205. /*FALLTHROUGH*/
  1206. case TASK_STOPPED:
  1207. /*
  1208. * It's stopped now, so it might later
  1209. * continue, exit, or stop again.
  1210. */
  1211. flag = 1;
  1212. if (!(options & WUNTRACED) &&
  1213. !my_ptrace_child(p))
  1214. continue;
  1215. retval = wait_task_stopped(p, ret == 2,
  1216. (options & WNOWAIT),
  1217. infop,
  1218. stat_addr, ru);
  1219. if (retval == -EAGAIN)
  1220. goto repeat;
  1221. if (retval != 0) /* He released the lock. */
  1222. goto end;
  1223. break;
  1224. default:
  1225. // case EXIT_DEAD:
  1226. if (p->exit_state == EXIT_DEAD)
  1227. continue;
  1228. // case EXIT_ZOMBIE:
  1229. if (p->exit_state == EXIT_ZOMBIE) {
  1230. /*
  1231. * Eligible but we cannot release
  1232. * it yet:
  1233. */
  1234. if (ret == 2)
  1235. goto check_continued;
  1236. if (!likely(options & WEXITED))
  1237. continue;
  1238. retval = wait_task_zombie(
  1239. p, (options & WNOWAIT),
  1240. infop, stat_addr, ru);
  1241. /* He released the lock. */
  1242. if (retval != 0)
  1243. goto end;
  1244. break;
  1245. }
  1246. check_continued:
  1247. /*
  1248. * It's running now, so it might later
  1249. * exit, stop, or stop and then continue.
  1250. */
  1251. flag = 1;
  1252. if (!unlikely(options & WCONTINUED))
  1253. continue;
  1254. retval = wait_task_continued(
  1255. p, (options & WNOWAIT),
  1256. infop, stat_addr, ru);
  1257. if (retval != 0) /* He released the lock. */
  1258. goto end;
  1259. break;
  1260. }
  1261. }
  1262. if (!flag) {
  1263. list_for_each(_p, &tsk->ptrace_children) {
  1264. p = list_entry(_p, struct task_struct,
  1265. ptrace_list);
  1266. if (!eligible_child(pid, options, p))
  1267. continue;
  1268. flag = 1;
  1269. break;
  1270. }
  1271. }
  1272. if (options & __WNOTHREAD)
  1273. break;
  1274. tsk = next_thread(tsk);
  1275. if (tsk->signal != current->signal)
  1276. BUG();
  1277. } while (tsk != current);
  1278. read_unlock(&tasklist_lock);
  1279. if (flag) {
  1280. retval = 0;
  1281. if (options & WNOHANG)
  1282. goto end;
  1283. retval = -ERESTARTSYS;
  1284. if (signal_pending(current))
  1285. goto end;
  1286. schedule();
  1287. goto repeat;
  1288. }
  1289. retval = -ECHILD;
  1290. end:
  1291. current->state = TASK_RUNNING;
  1292. remove_wait_queue(&current->signal->wait_chldexit,&wait);
  1293. if (infop) {
  1294. if (retval > 0)
  1295. retval = 0;
  1296. else {
  1297. /*
  1298. * For a WNOHANG return, clear out all the fields
  1299. * we would set so the user can easily tell the
  1300. * difference.
  1301. */
  1302. if (!retval)
  1303. retval = put_user(0, &infop->si_signo);
  1304. if (!retval)
  1305. retval = put_user(0, &infop->si_errno);
  1306. if (!retval)
  1307. retval = put_user(0, &infop->si_code);
  1308. if (!retval)
  1309. retval = put_user(0, &infop->si_pid);
  1310. if (!retval)
  1311. retval = put_user(0, &infop->si_uid);
  1312. if (!retval)
  1313. retval = put_user(0, &infop->si_status);
  1314. }
  1315. }
  1316. return retval;
  1317. }
  1318. asmlinkage long sys_waitid(int which, pid_t pid,
  1319. struct siginfo __user *infop, int options,
  1320. struct rusage __user *ru)
  1321. {
  1322. long ret;
  1323. if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
  1324. return -EINVAL;
  1325. if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
  1326. return -EINVAL;
  1327. switch (which) {
  1328. case P_ALL:
  1329. pid = -1;
  1330. break;
  1331. case P_PID:
  1332. if (pid <= 0)
  1333. return -EINVAL;
  1334. break;
  1335. case P_PGID:
  1336. if (pid <= 0)
  1337. return -EINVAL;
  1338. pid = -pid;
  1339. break;
  1340. default:
  1341. return -EINVAL;
  1342. }
  1343. ret = do_wait(pid, options, infop, NULL, ru);
  1344. /* avoid REGPARM breakage on x86: */
  1345. prevent_tail_call(ret);
  1346. return ret;
  1347. }
  1348. asmlinkage long sys_wait4(pid_t pid, int __user *stat_addr,
  1349. int options, struct rusage __user *ru)
  1350. {
  1351. long ret;
  1352. if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
  1353. __WNOTHREAD|__WCLONE|__WALL))
  1354. return -EINVAL;
  1355. ret = do_wait(pid, options | WEXITED, NULL, stat_addr, ru);
  1356. /* avoid REGPARM breakage on x86: */
  1357. prevent_tail_call(ret);
  1358. return ret;
  1359. }
  1360. #ifdef __ARCH_WANT_SYS_WAITPID
  1361. /*
  1362. * sys_waitpid() remains for compatibility. waitpid() should be
  1363. * implemented by calling sys_wait4() from libc.a.
  1364. */
  1365. asmlinkage long sys_waitpid(pid_t pid, int __user *stat_addr, int options)
  1366. {
  1367. return sys_wait4(pid, stat_addr, options, NULL);
  1368. }
  1369. #endif