exit.c 39 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548
  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. del_timer_sync(&tsk->signal->real_timer);
  724. acct_process(code);
  725. }
  726. exit_mm(tsk);
  727. exit_sem(tsk);
  728. __exit_files(tsk);
  729. __exit_fs(tsk);
  730. exit_namespace(tsk);
  731. exit_thread();
  732. cpuset_exit(tsk);
  733. exit_keys(tsk);
  734. if (group_dead && tsk->signal->leader)
  735. disassociate_ctty(1);
  736. module_put(tsk->thread_info->exec_domain->module);
  737. if (tsk->binfmt)
  738. module_put(tsk->binfmt->module);
  739. tsk->exit_code = code;
  740. exit_notify(tsk);
  741. #ifdef CONFIG_NUMA
  742. mpol_free(tsk->mempolicy);
  743. tsk->mempolicy = NULL;
  744. #endif
  745. BUG_ON(!(current->flags & PF_DEAD));
  746. schedule();
  747. BUG();
  748. /* Avoid "noreturn function does return". */
  749. for (;;) ;
  750. }
  751. EXPORT_SYMBOL_GPL(do_exit);
  752. NORET_TYPE void complete_and_exit(struct completion *comp, long code)
  753. {
  754. if (comp)
  755. complete(comp);
  756. do_exit(code);
  757. }
  758. EXPORT_SYMBOL(complete_and_exit);
  759. asmlinkage long sys_exit(int error_code)
  760. {
  761. do_exit((error_code&0xff)<<8);
  762. }
  763. task_t fastcall *next_thread(const task_t *p)
  764. {
  765. return pid_task(p->pids[PIDTYPE_TGID].pid_list.next, PIDTYPE_TGID);
  766. }
  767. EXPORT_SYMBOL(next_thread);
  768. /*
  769. * Take down every thread in the group. This is called by fatal signals
  770. * as well as by sys_exit_group (below).
  771. */
  772. NORET_TYPE void
  773. do_group_exit(int exit_code)
  774. {
  775. BUG_ON(exit_code & 0x80); /* core dumps don't get here */
  776. if (current->signal->flags & SIGNAL_GROUP_EXIT)
  777. exit_code = current->signal->group_exit_code;
  778. else if (!thread_group_empty(current)) {
  779. struct signal_struct *const sig = current->signal;
  780. struct sighand_struct *const sighand = current->sighand;
  781. read_lock(&tasklist_lock);
  782. spin_lock_irq(&sighand->siglock);
  783. if (sig->flags & SIGNAL_GROUP_EXIT)
  784. /* Another thread got here before we took the lock. */
  785. exit_code = sig->group_exit_code;
  786. else {
  787. sig->flags = SIGNAL_GROUP_EXIT;
  788. sig->group_exit_code = exit_code;
  789. zap_other_threads(current);
  790. }
  791. spin_unlock_irq(&sighand->siglock);
  792. read_unlock(&tasklist_lock);
  793. }
  794. do_exit(exit_code);
  795. /* NOTREACHED */
  796. }
  797. /*
  798. * this kills every thread in the thread group. Note that any externally
  799. * wait4()-ing process will get the correct exit code - even if this
  800. * thread is not the thread group leader.
  801. */
  802. asmlinkage void sys_exit_group(int error_code)
  803. {
  804. do_group_exit((error_code & 0xff) << 8);
  805. }
  806. static int eligible_child(pid_t pid, int options, task_t *p)
  807. {
  808. if (pid > 0) {
  809. if (p->pid != pid)
  810. return 0;
  811. } else if (!pid) {
  812. if (process_group(p) != process_group(current))
  813. return 0;
  814. } else if (pid != -1) {
  815. if (process_group(p) != -pid)
  816. return 0;
  817. }
  818. /*
  819. * Do not consider detached threads that are
  820. * not ptraced:
  821. */
  822. if (p->exit_signal == -1 && !p->ptrace)
  823. return 0;
  824. /* Wait for all children (clone and not) if __WALL is set;
  825. * otherwise, wait for clone children *only* if __WCLONE is
  826. * set; otherwise, wait for non-clone children *only*. (Note:
  827. * A "clone" child here is one that reports to its parent
  828. * using a signal other than SIGCHLD.) */
  829. if (((p->exit_signal != SIGCHLD) ^ ((options & __WCLONE) != 0))
  830. && !(options & __WALL))
  831. return 0;
  832. /*
  833. * Do not consider thread group leaders that are
  834. * in a non-empty thread group:
  835. */
  836. if (current->tgid != p->tgid && delay_group_leader(p))
  837. return 2;
  838. if (security_task_wait(p))
  839. return 0;
  840. return 1;
  841. }
  842. static int wait_noreap_copyout(task_t *p, pid_t pid, uid_t uid,
  843. int why, int status,
  844. struct siginfo __user *infop,
  845. struct rusage __user *rusagep)
  846. {
  847. int retval = rusagep ? getrusage(p, RUSAGE_BOTH, rusagep) : 0;
  848. put_task_struct(p);
  849. if (!retval)
  850. retval = put_user(SIGCHLD, &infop->si_signo);
  851. if (!retval)
  852. retval = put_user(0, &infop->si_errno);
  853. if (!retval)
  854. retval = put_user((short)why, &infop->si_code);
  855. if (!retval)
  856. retval = put_user(pid, &infop->si_pid);
  857. if (!retval)
  858. retval = put_user(uid, &infop->si_uid);
  859. if (!retval)
  860. retval = put_user(status, &infop->si_status);
  861. if (!retval)
  862. retval = pid;
  863. return retval;
  864. }
  865. /*
  866. * Handle sys_wait4 work for one task in state EXIT_ZOMBIE. We hold
  867. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  868. * the lock and this task is uninteresting. If we return nonzero, we have
  869. * released the lock and the system call should return.
  870. */
  871. static int wait_task_zombie(task_t *p, int noreap,
  872. struct siginfo __user *infop,
  873. int __user *stat_addr, struct rusage __user *ru)
  874. {
  875. unsigned long state;
  876. int retval;
  877. int status;
  878. if (unlikely(noreap)) {
  879. pid_t pid = p->pid;
  880. uid_t uid = p->uid;
  881. int exit_code = p->exit_code;
  882. int why, status;
  883. if (unlikely(p->exit_state != EXIT_ZOMBIE))
  884. return 0;
  885. if (unlikely(p->exit_signal == -1 && p->ptrace == 0))
  886. return 0;
  887. get_task_struct(p);
  888. read_unlock(&tasklist_lock);
  889. if ((exit_code & 0x7f) == 0) {
  890. why = CLD_EXITED;
  891. status = exit_code >> 8;
  892. } else {
  893. why = (exit_code & 0x80) ? CLD_DUMPED : CLD_KILLED;
  894. status = exit_code & 0x7f;
  895. }
  896. return wait_noreap_copyout(p, pid, uid, why,
  897. status, infop, ru);
  898. }
  899. /*
  900. * Try to move the task's state to DEAD
  901. * only one thread is allowed to do this:
  902. */
  903. state = xchg(&p->exit_state, EXIT_DEAD);
  904. if (state != EXIT_ZOMBIE) {
  905. BUG_ON(state != EXIT_DEAD);
  906. return 0;
  907. }
  908. if (unlikely(p->exit_signal == -1 && p->ptrace == 0)) {
  909. /*
  910. * This can only happen in a race with a ptraced thread
  911. * dying on another processor.
  912. */
  913. return 0;
  914. }
  915. if (likely(p->real_parent == p->parent) && likely(p->signal)) {
  916. /*
  917. * The resource counters for the group leader are in its
  918. * own task_struct. Those for dead threads in the group
  919. * are in its signal_struct, as are those for the child
  920. * processes it has previously reaped. All these
  921. * accumulate in the parent's signal_struct c* fields.
  922. *
  923. * We don't bother to take a lock here to protect these
  924. * p->signal fields, because they are only touched by
  925. * __exit_signal, which runs with tasklist_lock
  926. * write-locked anyway, and so is excluded here. We do
  927. * need to protect the access to p->parent->signal fields,
  928. * as other threads in the parent group can be right
  929. * here reaping other children at the same time.
  930. */
  931. spin_lock_irq(&p->parent->sighand->siglock);
  932. p->parent->signal->cutime =
  933. cputime_add(p->parent->signal->cutime,
  934. cputime_add(p->utime,
  935. cputime_add(p->signal->utime,
  936. p->signal->cutime)));
  937. p->parent->signal->cstime =
  938. cputime_add(p->parent->signal->cstime,
  939. cputime_add(p->stime,
  940. cputime_add(p->signal->stime,
  941. p->signal->cstime)));
  942. p->parent->signal->cmin_flt +=
  943. p->min_flt + p->signal->min_flt + p->signal->cmin_flt;
  944. p->parent->signal->cmaj_flt +=
  945. p->maj_flt + p->signal->maj_flt + p->signal->cmaj_flt;
  946. p->parent->signal->cnvcsw +=
  947. p->nvcsw + p->signal->nvcsw + p->signal->cnvcsw;
  948. p->parent->signal->cnivcsw +=
  949. p->nivcsw + p->signal->nivcsw + p->signal->cnivcsw;
  950. spin_unlock_irq(&p->parent->sighand->siglock);
  951. }
  952. /*
  953. * Now we are sure this task is interesting, and no other
  954. * thread can reap it because we set its state to EXIT_DEAD.
  955. */
  956. read_unlock(&tasklist_lock);
  957. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  958. status = (p->signal->flags & SIGNAL_GROUP_EXIT)
  959. ? p->signal->group_exit_code : p->exit_code;
  960. if (!retval && stat_addr)
  961. retval = put_user(status, stat_addr);
  962. if (!retval && infop)
  963. retval = put_user(SIGCHLD, &infop->si_signo);
  964. if (!retval && infop)
  965. retval = put_user(0, &infop->si_errno);
  966. if (!retval && infop) {
  967. int why;
  968. if ((status & 0x7f) == 0) {
  969. why = CLD_EXITED;
  970. status >>= 8;
  971. } else {
  972. why = (status & 0x80) ? CLD_DUMPED : CLD_KILLED;
  973. status &= 0x7f;
  974. }
  975. retval = put_user((short)why, &infop->si_code);
  976. if (!retval)
  977. retval = put_user(status, &infop->si_status);
  978. }
  979. if (!retval && infop)
  980. retval = put_user(p->pid, &infop->si_pid);
  981. if (!retval && infop)
  982. retval = put_user(p->uid, &infop->si_uid);
  983. if (retval) {
  984. // TODO: is this safe?
  985. p->exit_state = EXIT_ZOMBIE;
  986. return retval;
  987. }
  988. retval = p->pid;
  989. if (p->real_parent != p->parent) {
  990. write_lock_irq(&tasklist_lock);
  991. /* Double-check with lock held. */
  992. if (p->real_parent != p->parent) {
  993. __ptrace_unlink(p);
  994. // TODO: is this safe?
  995. p->exit_state = EXIT_ZOMBIE;
  996. /*
  997. * If this is not a detached task, notify the parent.
  998. * If it's still not detached after that, don't release
  999. * it now.
  1000. */
  1001. if (p->exit_signal != -1) {
  1002. do_notify_parent(p, p->exit_signal);
  1003. if (p->exit_signal != -1)
  1004. p = NULL;
  1005. }
  1006. }
  1007. write_unlock_irq(&tasklist_lock);
  1008. }
  1009. if (p != NULL)
  1010. release_task(p);
  1011. BUG_ON(!retval);
  1012. return retval;
  1013. }
  1014. /*
  1015. * Handle sys_wait4 work for one task in state TASK_STOPPED. We hold
  1016. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1017. * the lock and this task is uninteresting. If we return nonzero, we have
  1018. * released the lock and the system call should return.
  1019. */
  1020. static int wait_task_stopped(task_t *p, int delayed_group_leader, int noreap,
  1021. struct siginfo __user *infop,
  1022. int __user *stat_addr, struct rusage __user *ru)
  1023. {
  1024. int retval, exit_code;
  1025. if (!p->exit_code)
  1026. return 0;
  1027. if (delayed_group_leader && !(p->ptrace & PT_PTRACED) &&
  1028. p->signal && p->signal->group_stop_count > 0)
  1029. /*
  1030. * A group stop is in progress and this is the group leader.
  1031. * We won't report until all threads have stopped.
  1032. */
  1033. return 0;
  1034. /*
  1035. * Now we are pretty sure this task is interesting.
  1036. * Make sure it doesn't get reaped out from under us while we
  1037. * give up the lock and then examine it below. We don't want to
  1038. * keep holding onto the tasklist_lock while we call getrusage and
  1039. * possibly take page faults for user memory.
  1040. */
  1041. get_task_struct(p);
  1042. read_unlock(&tasklist_lock);
  1043. if (unlikely(noreap)) {
  1044. pid_t pid = p->pid;
  1045. uid_t uid = p->uid;
  1046. int why = (p->ptrace & PT_PTRACED) ? CLD_TRAPPED : CLD_STOPPED;
  1047. exit_code = p->exit_code;
  1048. if (unlikely(!exit_code) ||
  1049. unlikely(p->state > TASK_STOPPED))
  1050. goto bail_ref;
  1051. return wait_noreap_copyout(p, pid, uid,
  1052. why, (exit_code << 8) | 0x7f,
  1053. infop, ru);
  1054. }
  1055. write_lock_irq(&tasklist_lock);
  1056. /*
  1057. * This uses xchg to be atomic with the thread resuming and setting
  1058. * it. It must also be done with the write lock held to prevent a
  1059. * race with the EXIT_ZOMBIE case.
  1060. */
  1061. exit_code = xchg(&p->exit_code, 0);
  1062. if (unlikely(p->exit_state)) {
  1063. /*
  1064. * The task resumed and then died. Let the next iteration
  1065. * catch it in EXIT_ZOMBIE. Note that exit_code might
  1066. * already be zero here if it resumed and did _exit(0).
  1067. * The task itself is dead and won't touch exit_code again;
  1068. * other processors in this function are locked out.
  1069. */
  1070. p->exit_code = exit_code;
  1071. exit_code = 0;
  1072. }
  1073. if (unlikely(exit_code == 0)) {
  1074. /*
  1075. * Another thread in this function got to it first, or it
  1076. * resumed, or it resumed and then died.
  1077. */
  1078. write_unlock_irq(&tasklist_lock);
  1079. bail_ref:
  1080. put_task_struct(p);
  1081. /*
  1082. * We are returning to the wait loop without having successfully
  1083. * removed the process and having released the lock. We cannot
  1084. * continue, since the "p" task pointer is potentially stale.
  1085. *
  1086. * Return -EAGAIN, and do_wait() will restart the loop from the
  1087. * beginning. Do _not_ re-acquire the lock.
  1088. */
  1089. return -EAGAIN;
  1090. }
  1091. /* move to end of parent's list to avoid starvation */
  1092. remove_parent(p);
  1093. add_parent(p, p->parent);
  1094. write_unlock_irq(&tasklist_lock);
  1095. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1096. if (!retval && stat_addr)
  1097. retval = put_user((exit_code << 8) | 0x7f, stat_addr);
  1098. if (!retval && infop)
  1099. retval = put_user(SIGCHLD, &infop->si_signo);
  1100. if (!retval && infop)
  1101. retval = put_user(0, &infop->si_errno);
  1102. if (!retval && infop)
  1103. retval = put_user((short)((p->ptrace & PT_PTRACED)
  1104. ? CLD_TRAPPED : CLD_STOPPED),
  1105. &infop->si_code);
  1106. if (!retval && infop)
  1107. retval = put_user(exit_code, &infop->si_status);
  1108. if (!retval && infop)
  1109. retval = put_user(p->pid, &infop->si_pid);
  1110. if (!retval && infop)
  1111. retval = put_user(p->uid, &infop->si_uid);
  1112. if (!retval)
  1113. retval = p->pid;
  1114. put_task_struct(p);
  1115. BUG_ON(!retval);
  1116. return retval;
  1117. }
  1118. /*
  1119. * Handle do_wait work for one task in a live, non-stopped state.
  1120. * read_lock(&tasklist_lock) on entry. If we return zero, we still hold
  1121. * the lock and this task is uninteresting. If we return nonzero, we have
  1122. * released the lock and the system call should return.
  1123. */
  1124. static int wait_task_continued(task_t *p, int noreap,
  1125. struct siginfo __user *infop,
  1126. int __user *stat_addr, struct rusage __user *ru)
  1127. {
  1128. int retval;
  1129. pid_t pid;
  1130. uid_t uid;
  1131. if (unlikely(!p->signal))
  1132. return 0;
  1133. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED))
  1134. return 0;
  1135. spin_lock_irq(&p->sighand->siglock);
  1136. /* Re-check with the lock held. */
  1137. if (!(p->signal->flags & SIGNAL_STOP_CONTINUED)) {
  1138. spin_unlock_irq(&p->sighand->siglock);
  1139. return 0;
  1140. }
  1141. if (!noreap)
  1142. p->signal->flags &= ~SIGNAL_STOP_CONTINUED;
  1143. spin_unlock_irq(&p->sighand->siglock);
  1144. pid = p->pid;
  1145. uid = p->uid;
  1146. get_task_struct(p);
  1147. read_unlock(&tasklist_lock);
  1148. if (!infop) {
  1149. retval = ru ? getrusage(p, RUSAGE_BOTH, ru) : 0;
  1150. put_task_struct(p);
  1151. if (!retval && stat_addr)
  1152. retval = put_user(0xffff, stat_addr);
  1153. if (!retval)
  1154. retval = p->pid;
  1155. } else {
  1156. retval = wait_noreap_copyout(p, pid, uid,
  1157. CLD_CONTINUED, SIGCONT,
  1158. infop, ru);
  1159. BUG_ON(retval == 0);
  1160. }
  1161. return retval;
  1162. }
  1163. static inline int my_ptrace_child(struct task_struct *p)
  1164. {
  1165. if (!(p->ptrace & PT_PTRACED))
  1166. return 0;
  1167. if (!(p->ptrace & PT_ATTACHED))
  1168. return 1;
  1169. /*
  1170. * This child was PTRACE_ATTACH'd. We should be seeing it only if
  1171. * we are the attacher. If we are the real parent, this is a race
  1172. * inside ptrace_attach. It is waiting for the tasklist_lock,
  1173. * which we have to switch the parent links, but has already set
  1174. * the flags in p->ptrace.
  1175. */
  1176. return (p->parent != p->real_parent);
  1177. }
  1178. static long do_wait(pid_t pid, int options, struct siginfo __user *infop,
  1179. int __user *stat_addr, struct rusage __user *ru)
  1180. {
  1181. DECLARE_WAITQUEUE(wait, current);
  1182. struct task_struct *tsk;
  1183. int flag, retval;
  1184. add_wait_queue(&current->signal->wait_chldexit,&wait);
  1185. repeat:
  1186. /*
  1187. * We will set this flag if we see any child that might later
  1188. * match our criteria, even if we are not able to reap it yet.
  1189. */
  1190. flag = 0;
  1191. current->state = TASK_INTERRUPTIBLE;
  1192. read_lock(&tasklist_lock);
  1193. tsk = current;
  1194. do {
  1195. struct task_struct *p;
  1196. struct list_head *_p;
  1197. int ret;
  1198. list_for_each(_p,&tsk->children) {
  1199. p = list_entry(_p,struct task_struct,sibling);
  1200. ret = eligible_child(pid, options, p);
  1201. if (!ret)
  1202. continue;
  1203. switch (p->state) {
  1204. case TASK_TRACED:
  1205. if (!my_ptrace_child(p))
  1206. continue;
  1207. /*FALLTHROUGH*/
  1208. case TASK_STOPPED:
  1209. /*
  1210. * It's stopped now, so it might later
  1211. * continue, exit, or stop again.
  1212. */
  1213. flag = 1;
  1214. if (!(options & WUNTRACED) &&
  1215. !my_ptrace_child(p))
  1216. continue;
  1217. retval = wait_task_stopped(p, ret == 2,
  1218. (options & WNOWAIT),
  1219. infop,
  1220. stat_addr, ru);
  1221. if (retval == -EAGAIN)
  1222. goto repeat;
  1223. if (retval != 0) /* He released the lock. */
  1224. goto end;
  1225. break;
  1226. default:
  1227. // case EXIT_DEAD:
  1228. if (p->exit_state == EXIT_DEAD)
  1229. continue;
  1230. // case EXIT_ZOMBIE:
  1231. if (p->exit_state == EXIT_ZOMBIE) {
  1232. /*
  1233. * Eligible but we cannot release
  1234. * it yet:
  1235. */
  1236. if (ret == 2)
  1237. goto check_continued;
  1238. if (!likely(options & WEXITED))
  1239. continue;
  1240. retval = wait_task_zombie(
  1241. p, (options & WNOWAIT),
  1242. infop, stat_addr, ru);
  1243. /* He released the lock. */
  1244. if (retval != 0)
  1245. goto end;
  1246. break;
  1247. }
  1248. check_continued:
  1249. /*
  1250. * It's running now, so it might later
  1251. * exit, stop, or stop and then continue.
  1252. */
  1253. flag = 1;
  1254. if (!unlikely(options & WCONTINUED))
  1255. continue;
  1256. retval = wait_task_continued(
  1257. p, (options & WNOWAIT),
  1258. infop, stat_addr, ru);
  1259. if (retval != 0) /* He released the lock. */
  1260. goto end;
  1261. break;
  1262. }
  1263. }
  1264. if (!flag) {
  1265. list_for_each(_p, &tsk->ptrace_children) {
  1266. p = list_entry(_p, struct task_struct,
  1267. ptrace_list);
  1268. if (!eligible_child(pid, options, p))
  1269. continue;
  1270. flag = 1;
  1271. break;
  1272. }
  1273. }
  1274. if (options & __WNOTHREAD)
  1275. break;
  1276. tsk = next_thread(tsk);
  1277. if (tsk->signal != current->signal)
  1278. BUG();
  1279. } while (tsk != current);
  1280. read_unlock(&tasklist_lock);
  1281. if (flag) {
  1282. retval = 0;
  1283. if (options & WNOHANG)
  1284. goto end;
  1285. retval = -ERESTARTSYS;
  1286. if (signal_pending(current))
  1287. goto end;
  1288. schedule();
  1289. goto repeat;
  1290. }
  1291. retval = -ECHILD;
  1292. end:
  1293. current->state = TASK_RUNNING;
  1294. remove_wait_queue(&current->signal->wait_chldexit,&wait);
  1295. if (infop) {
  1296. if (retval > 0)
  1297. retval = 0;
  1298. else {
  1299. /*
  1300. * For a WNOHANG return, clear out all the fields
  1301. * we would set so the user can easily tell the
  1302. * difference.
  1303. */
  1304. if (!retval)
  1305. retval = put_user(0, &infop->si_signo);
  1306. if (!retval)
  1307. retval = put_user(0, &infop->si_errno);
  1308. if (!retval)
  1309. retval = put_user(0, &infop->si_code);
  1310. if (!retval)
  1311. retval = put_user(0, &infop->si_pid);
  1312. if (!retval)
  1313. retval = put_user(0, &infop->si_uid);
  1314. if (!retval)
  1315. retval = put_user(0, &infop->si_status);
  1316. }
  1317. }
  1318. return retval;
  1319. }
  1320. asmlinkage long sys_waitid(int which, pid_t pid,
  1321. struct siginfo __user *infop, int options,
  1322. struct rusage __user *ru)
  1323. {
  1324. long ret;
  1325. if (options & ~(WNOHANG|WNOWAIT|WEXITED|WSTOPPED|WCONTINUED))
  1326. return -EINVAL;
  1327. if (!(options & (WEXITED|WSTOPPED|WCONTINUED)))
  1328. return -EINVAL;
  1329. switch (which) {
  1330. case P_ALL:
  1331. pid = -1;
  1332. break;
  1333. case P_PID:
  1334. if (pid <= 0)
  1335. return -EINVAL;
  1336. break;
  1337. case P_PGID:
  1338. if (pid <= 0)
  1339. return -EINVAL;
  1340. pid = -pid;
  1341. break;
  1342. default:
  1343. return -EINVAL;
  1344. }
  1345. ret = do_wait(pid, options, infop, NULL, ru);
  1346. /* avoid REGPARM breakage on x86: */
  1347. prevent_tail_call(ret);
  1348. return ret;
  1349. }
  1350. asmlinkage long sys_wait4(pid_t pid, int __user *stat_addr,
  1351. int options, struct rusage __user *ru)
  1352. {
  1353. long ret;
  1354. if (options & ~(WNOHANG|WUNTRACED|WCONTINUED|
  1355. __WNOTHREAD|__WCLONE|__WALL))
  1356. return -EINVAL;
  1357. ret = do_wait(pid, options | WEXITED, NULL, stat_addr, ru);
  1358. /* avoid REGPARM breakage on x86: */
  1359. prevent_tail_call(ret);
  1360. return ret;
  1361. }
  1362. #ifdef __ARCH_WANT_SYS_WAITPID
  1363. /*
  1364. * sys_waitpid() remains for compatibility. waitpid() should be
  1365. * implemented by calling sys_wait4() from libc.a.
  1366. */
  1367. asmlinkage long sys_waitpid(pid_t pid, int __user *stat_addr, int options)
  1368. {
  1369. return sys_wait4(pid, stat_addr, options, NULL);
  1370. }
  1371. #endif