exit.c 43 KB

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