exit.c 46 KB

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