exit.c 42 KB

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