exit.c 42 KB

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