exit.c 43 KB

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