exit.c 41 KB

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