exit.c 43 KB

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