exit.c 42 KB

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