1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
|
/* $NetBSD: kern_exit.c,v 1.133 2004/01/04 11:33:31 jdolecek Exp $ */
/*-
* Copyright (c) 1998, 1999 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Jason R. Thorpe of the Numerical Aerospace Simulation Facility,
* NASA Ames Research Center.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
* TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
/*
* Copyright (c) 1982, 1986, 1989, 1991, 1993
* The Regents of the University of California. All rights reserved.
* (c) UNIX System Laboratories, Inc.
* All or some portions of this file are derived from material licensed
* to the University of California by American Telephone and Telegraph
* Co. or Unix System Laboratories, Inc. and are reproduced herein with
* the permission of UNIX System Laboratories, Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)kern_exit.c 8.10 (Berkeley) 2/23/95
*/
#include <sys/cdefs.h>
__KERNEL_RCSID(0, "$NetBSD: kern_exit.c,v 1.133 2004/01/04 11:33:31 jdolecek Exp $");
#include "opt_ktrace.h"
#include "opt_perfctrs.h"
#include "opt_systrace.h"
#include "opt_sysv.h"
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/ioctl.h>
#include <sys/proc.h>
#include <sys/tty.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <sys/kernel.h>
#include <sys/ktrace.h>
#include <sys/proc.h>
#include <sys/buf.h>
#include <sys/wait.h>
#include <sys/file.h>
#include <sys/vnode.h>
#include <sys/syslog.h>
#include <sys/malloc.h>
#include <sys/pool.h>
#include <sys/resourcevar.h>
#if defined(PERFCTRS)
#include <sys/pmc.h>
#endif
#include <sys/ptrace.h>
#include <sys/acct.h>
#include <sys/filedesc.h>
#include <sys/ras.h>
#include <sys/signalvar.h>
#include <sys/sched.h>
#include <sys/sa.h>
#include <sys/savar.h>
#include <sys/mount.h>
#include <sys/syscallargs.h>
#include <sys/systrace.h>
#include <machine/cpu.h>
#include <uvm/uvm_extern.h>
#define DEBUG_EXIT
#ifdef DEBUG_EXIT
int debug_exit = 0;
#define DPRINTF(x) if (debug_exit) printf x
#else
#define DPRINTF(x)
#endif
static void lwp_exit_hook(struct lwp *, void *);
static void exit_psignal(struct proc *, struct proc *);
/*
* Fill in the appropriate signal information, and signal the parent.
*/
static void
exit_psignal(struct proc *p, struct proc *pp)
{
ksiginfo_t ksi;
(void)memset(&ksi, 0, sizeof(ksi));
if ((ksi.ksi_signo = P_EXITSIG(p)) == SIGCHLD) {
if (WIFSIGNALED(p->p_xstat)) {
if (WCOREDUMP(p->p_xstat))
ksi.ksi_code = CLD_DUMPED;
else
ksi.ksi_code = CLD_KILLED;
} else {
ksi.ksi_code = CLD_EXITED;
}
}
/*
* we fill those in, even for non-SIGCHLD.
*/
ksi.ksi_pid = p->p_pid;
ksi.ksi_uid = p->p_ucred->cr_uid;
ksi.ksi_status = p->p_xstat;
/* XXX: is this still valid? */
ksi.ksi_utime = p->p_ru->ru_utime.tv_sec;
ksi.ksi_stime = p->p_ru->ru_stime.tv_sec;
kpsignal(pp, &ksi, NULL);
}
/*
* exit --
* Death of process.
*/
int
sys_exit(struct lwp *l, void *v, register_t *retval)
{
struct sys_exit_args /* {
syscallarg(int) rval;
} */ *uap = v;
/* Don't call exit1() multiple times in the same process.*/
if (l->l_proc->p_flag & P_WEXIT)
lwp_exit(l);
exit1(l, W_EXITCODE(SCARG(uap, rval), 0));
/* NOTREACHED */
return (0);
}
/*
* Exit: deallocate address space and other resources, change proc state
* to zombie, and unlink proc from allproc and parent's lists. Save exit
* status and rusage for wait(). Check for child processes and orphan them.
*/
void
exit1(struct lwp *l, int rv)
{
struct proc *p, *q, *nq;
int s, sa;
p = l->l_proc;
if (__predict_false(p == initproc))
panic("init died (signal %d, exit %d)",
WTERMSIG(rv), WEXITSTATUS(rv));
p->p_flag |= P_WEXIT;
if (p->p_flag & P_STOPEXIT) {
int s;
sigminusset(&contsigmask, &p->p_sigctx.ps_siglist);
SCHED_LOCK(s);
p->p_stat = SSTOP;
l->l_stat = LSSTOP;
p->p_nrlwps--;
mi_switch(l, NULL);
SCHED_ASSERT_UNLOCKED();
splx(s);
}
DPRINTF(("exit1: %d.%d exiting.\n", p->p_pid, l->l_lid));
/*
* Disable scheduler activation upcalls.
* We're trying to get out of here.
*/
sa = 0;
if (p->p_sa != NULL) {
l->l_flag &= ~L_SA;
#if 0
p->p_flag &= ~P_SA;
#endif
sa = 1;
}
#ifdef PGINPROF
vmsizmon();
#endif
if (p->p_flag & P_PROFIL)
stopprofclock(p);
p->p_ru = pool_get(&rusage_pool, PR_WAITOK);
/*
* If parent is waiting for us to exit or exec, P_PPWAIT is set; we
* wake up the parent early to avoid deadlock.
*/
if (p->p_flag & P_PPWAIT) {
p->p_flag &= ~P_PPWAIT;
wakeup(p->p_pptr);
}
sigfillset(&p->p_sigctx.ps_sigignore);
sigemptyset(&p->p_sigctx.ps_siglist);
p->p_sigctx.ps_sigcheck = 0;
timers_free(p, TIMERS_ALL);
if (sa || (p->p_nlwps > 1)) {
exit_lwps(l);
/*
* Collect thread u-areas.
*/
uvm_uarea_drain(FALSE);
}
#if defined(__HAVE_RAS)
ras_purgeall(p);
#endif
/*
* Close open files and release open-file table.
* This may block!
*/
fdfree(p);
cwdfree(p);
doexithooks(p);
if (SESS_LEADER(p)) {
struct session *sp = p->p_session;
struct tty *tp;
if (sp->s_ttyvp) {
/*
* Controlling process.
* Signal foreground pgrp,
* drain controlling terminal
* and revoke access to controlling terminal.
*/
tp = sp->s_ttyp;
TTY_LOCK(tp);
if (tp->t_session == sp) {
if (tp->t_pgrp)
pgsignal(tp->t_pgrp, SIGHUP, 1);
/* we can't guarantee the revoke will do this */
tp->t_pgrp = NULL;
tp->t_session = NULL;
TTY_UNLOCK(tp);
SESSRELE(sp);
(void) ttywait(tp);
/*
* The tty could have been revoked
* if we blocked.
*/
if (sp->s_ttyvp)
VOP_REVOKE(sp->s_ttyvp, REVOKEALL);
} else
TTY_UNLOCK(tp);
if (sp->s_ttyvp)
vrele(sp->s_ttyvp);
sp->s_ttyvp = NULL;
/*
* s_ttyp is not zero'd; we use this to indicate
* that the session once had a controlling terminal.
* (for logging and informational purposes)
*/
}
sp->s_leader = NULL;
}
fixjobc(p, p->p_pgrp, 0);
(void)acct_process(p);
#ifdef KTRACE
/*
* release trace file
*/
ktrderef(p);
#endif
#ifdef SYSTRACE
systrace_sys_exit(p);
#endif
/*
* If emulation has process exit hook, call it now.
*/
if (p->p_emul->e_proc_exit)
(*p->p_emul->e_proc_exit)(p);
/*
* Reset p_opptr pointer of all former children which got
* traced by another process and were reparented. We reset
* it to NULL here; the trace detach code then reparents
* the child to initproc. We only check allproc list, since
* eventual former children on zombproc list won't reference
* p_opptr anymore.
*/
s = proclist_lock_write();
if (p->p_flag & P_CHTRACED) {
LIST_FOREACH(q, &allproc, p_list) {
if (q->p_opptr == p)
q->p_opptr = NULL;
}
}
/*
* Give orphaned children to init(8).
*/
q = LIST_FIRST(&p->p_children);
if (q) /* only need this if any child is SZOMB */
wakeup(initproc);
for (; q != NULL; q = nq) {
nq = LIST_NEXT(q, p_sibling);
/*
* Traced processes are killed since their existence
* means someone is screwing up. Since we reset the
* trace flags, the logic in sys_wait4() would not be
* triggered to reparent the process to its
* original parent, so we must do this here.
*/
if (q->p_flag & P_TRACED) {
if (q->p_opptr != q->p_pptr) {
struct proc *t = q->p_opptr;
proc_reparent(q, t ? t : initproc);
q->p_opptr = NULL;
} else
proc_reparent(q, initproc);
q->p_flag &= ~(P_TRACED|P_WAITED|P_FSTRACE);
psignal(q, SIGKILL);
} else {
proc_reparent(q, initproc);
}
}
proclist_unlock_write(s);
/*
* Deactivate the address space before the vmspace is
* freed. Note that we will continue to run on this
* vmspace's context until the switch to the idle process.
*/
pmap_deactivate(l);
/*
* Free the VM resources we're still holding on to.
* We must do this from a valid thread because doing
* so may block. This frees vmspace, which we don't
* need anymore. The only remaining lwp is the one
* we run at this moment, nothing runs in userland
* anymore.
*/
uvm_proc_exit(p);
/*
* Give machine-dependent code a chance to free any
* MD LWP resources while we can still block. This must be done
* before uvm_lwp_exit(), in case these resources are in the
* PCB.
* THIS IS LAST BLOCKING OPERATION.
*/
#ifndef __NO_CPU_LWP_FREE
cpu_lwp_free(l, 1);
#endif
/*
* NOTE: WE ARE NO LONGER ALLOWED TO SLEEP!
*/
/*
* Save exit status and final rusage info, adding in child rusage
* info and self times.
* In order to pick up the time for the current execution, we must
* do this before unlinking the lwp from l_list.
*/
p->p_xstat = rv;
*p->p_ru = p->p_stats->p_ru;
calcru(p, &p->p_ru->ru_utime, &p->p_ru->ru_stime, NULL);
ruadd(p->p_ru, &p->p_stats->p_cru);
/*
* Move proc from allproc to zombproc, it's now ready
* to be collected by parent. Remaining lwp resources
* will be freed in lwp_exit2() once we'd switch to idle
* context.
* Changing the state to SZOMB stops it being found by pfind().
*/
s = proclist_lock_write();
LIST_REMOVE(p, p_list);
LIST_INSERT_HEAD(&zombproc, p, p_list);
p->p_stat = SZOMB;
LIST_REMOVE(l, l_list);
l->l_flag |= L_DETACHED|L_PROCEXIT; /* detached from proc too */
l->l_stat = LSDEAD;
p->p_nrlwps--;
p->p_nlwps--;
/* Put in front of parent's sibling list for parent to collect it */
q = p->p_pptr;
q->p_nstopchild++;
if (LIST_FIRST(&q->p_children) != p) {
/* Put child where it can be found quickly */
LIST_REMOVE(p, p_sibling);
LIST_INSERT_HEAD(&q->p_children, p, p_sibling);
}
proclist_unlock_write(s);
/*
* Notify interested parties of our demise.
*/
KNOTE(&p->p_klist, NOTE_EXIT);
#if PERFCTRS
/*
* Save final PMC information in parent process & clean up.
*/
if (PMC_ENABLED(p)) {
pmc_save_context(p);
pmc_accumulate(p->p_pptr, p);
pmc_process_exit(p);
}
#endif
/*
* Notify parent that we're gone. If parent has the P_NOCLDWAIT
* flag set, notify init instead (and hope it will handle
* this situation).
*/
if (p->p_pptr->p_flag & P_NOCLDWAIT) {
struct proc *pp = p->p_pptr;
proc_reparent(p, initproc);
/*
* If this was the last child of our parent, notify
* parent, so in case he was wait(2)ing, he will
* continue.
*/
if (LIST_FIRST(&pp->p_children) == NULL)
wakeup(pp);
}
/* Wake up the parent so it can get exit status. */
if ((p->p_flag & P_FSTRACE) == 0 && p->p_exitsig != 0)
exit_psignal(p, p->p_pptr);
wakeup(p->p_pptr);
/*
* Release the process's signal state.
*/
sigactsfree(p);
/*
* Clear curlwp after we've done all operations
* that could block, and before tearing down the rest
* of the process state that might be used from clock, etc.
* Also, can't clear curlwp while we're still runnable,
* as we're not on a run queue (we are current, just not
* a proper proc any longer!).
*
* Other substructures are freed from wait().
*/
curlwp = NULL;
limfree(p->p_limit);
pstatsfree(p->p_stats);
p->p_limit = NULL;
/* This process no longer needs to hold the kernel lock. */
KERNEL_PROC_UNLOCK(l);
#ifdef DEBUG
/* Nothing should use the process link anymore */
l->l_proc = NULL;
#endif
/*
* Finally, call machine-dependent code to switch to a new
* context (possibly the idle context). Once we are no longer
* using the dead lwp's stack, lwp_exit2() will be called
* to arrange for the resources to be released.
*
* Note that cpu_exit() will end with a call equivalent to
* cpu_switch(), finishing our execution (pun intended).
*/
uvmexp.swtch++;
cpu_exit(l);
}
void
exit_lwps(struct lwp *l)
{
struct proc *p;
struct lwp *l2;
int s, error;
lwpid_t waited;
p = l->l_proc;
/* XXX SMP
* This would be the right place to IPI any LWPs running on
* other processors so that they can notice the userret exit hook.
*/
p->p_userret = lwp_exit_hook;
p->p_userret_arg = NULL;
if (p->p_sa) {
/*
* Make SA-cached LWPs normal process runnable LWPs so
* that they'll also self-destruct.
*/
DPRINTF(("exit_lwps: Making cached LWPs of %d runnable: ",
p->p_pid));
SCHED_LOCK(s);
while ((l2 = sa_getcachelwp(p)) != 0) {
l2->l_priority = l2->l_usrpri;
setrunnable(l2);
DPRINTF(("%d ", l2->l_lid));
}
DPRINTF(("\n"));
SCHED_UNLOCK(s);
/* Clear wokenq, the LWPs on the queue will run below */
p->p_sa->sa_wokenq_head = NULL;
}
/*
* Interrupt LWPs in interruptable sleep, unsuspend suspended
* LWPs, make detached LWPs undetached (so we can wait for
* them) and then wait for everyone else to finish.
*/
LIST_FOREACH(l2, &p->p_lwps, l_sibling) {
l2->l_flag &= ~(L_DETACHED|L_SA);
if (p->p_sa && l2->l_wchan == p->p_sa)
l2->l_flag |= L_SINTR;
if ((l2->l_stat == LSSLEEP && (l2->l_flag & L_SINTR)) ||
l2->l_stat == LSSUSPENDED || l2->l_stat == LSSTOP) {
SCHED_LOCK(s);
setrunnable(l2);
SCHED_UNLOCK(s);
DPRINTF(("exit_lwps: Made %d.%d runnable\n",
p->p_pid, l2->l_lid));
}
}
while (p->p_nlwps > 1) {
DPRINTF(("exit_lwps: waiting for %d LWPs (%d runnable, %d zombies)\n",
p->p_nlwps, p->p_nrlwps, p->p_nzlwps));
error = lwp_wait1(l, 0, &waited, LWPWAIT_EXITCONTROL);
if (error)
panic("exit_lwps: lwp_wait1 failed with error %d\n",
error);
DPRINTF(("exit_lwps: Got LWP %d from lwp_wait1()\n", waited));
}
p->p_userret = NULL;
}
/* Wrapper function for use in p_userret */
static void
lwp_exit_hook(struct lwp *l, void *arg)
{
KERNEL_PROC_LOCK(l);
lwp_exit(l);
}
int
sys_wait4(struct lwp *l, void *v, register_t *retval)
{
struct sys_wait4_args /* {
syscallarg(int) pid;
syscallarg(int *) status;
syscallarg(int) options;
syscallarg(struct rusage *) rusage;
} */ *uap = v;
struct proc *child, *parent;
int status, error;
parent = l->l_proc;
if (SCARG(uap, pid) == 0)
SCARG(uap, pid) = -parent->p_pgid;
if (SCARG(uap, options) & ~(WUNTRACED|WNOHANG|WALTSIG|WALLSIG))
return (EINVAL);
error = find_stopped_child(parent, SCARG(uap,pid), SCARG(uap,options),
&child);
if (error != 0)
return error;
if (child == NULL) {
*retval = 0;
return 0;
}
/*
* Collect child u-areas.
*/
uvm_uarea_drain(FALSE);
retval[0] = child->p_pid;
if (child->p_stat == SZOMB) {
if (SCARG(uap, status)) {
status = child->p_xstat; /* convert to int */
error = copyout(&status, SCARG(uap, status),
sizeof(status));
if (error)
return (error);
}
if (SCARG(uap, rusage)) {
error = copyout(child->p_ru, SCARG(uap, rusage),
sizeof(struct rusage));
if (error)
return (error);
}
proc_free(child);
return 0;
}
/* child state must be SSTOP */
if (SCARG(uap, status)) {
status = W_STOPCODE(child->p_xstat);
return copyout(&status, SCARG(uap, status), sizeof(status));
}
return 0;
}
/*
* Scan list of child processes for a child process that has stopped or
* exited. Used by sys_wait4 and 'compat' equivalents.
*/
int
find_stopped_child(struct proc *parent, pid_t pid, int options,
struct proc **child_p)
{
struct proc *child;
int error;
for (;;) {
proclist_lock_read();
error = ECHILD;
LIST_FOREACH(child, &parent->p_children, p_sibling) {
if (pid >= 0) {
if (child->p_pid != pid) {
child = p_find(pid, PFIND_ZOMBIE |
PFIND_LOCKED);
if (child == NULL
|| child->p_pptr != parent) {
child = NULL;
break;
}
}
} else
if (pid != WAIT_ANY && child->p_pgid != -pid)
/* child not in correct pgrp */
continue;
/*
* Wait for processes with p_exitsig != SIGCHLD
* processes only if WALTSIG is set; wait for
* processes with p_exitsig == SIGCHLD only
* if WALTSIG is clear.
*/
if (((options & WALLSIG) == 0) &&
(options & WALTSIG ? child->p_exitsig == SIGCHLD
: P_EXITSIG(child) != SIGCHLD)){
if (child->p_pid == pid) {
child = NULL;
break;
}
continue;
}
error = 0;
if (child->p_stat == SZOMB && !(options & WNOZOMBIE))
break;
if (child->p_stat == SSTOP &&
(child->p_flag & P_WAITED) == 0 &&
(child->p_flag & P_TRACED || options & WUNTRACED)) {
if ((options & WNOWAIT) == 0) {
child->p_flag |= P_WAITED;
parent->p_nstopchild--;
}
break;
}
if (parent->p_nstopchild == 0 || child->p_pid == pid) {
child = NULL;
break;
}
}
proclist_unlock_read();
if (child != NULL || error != 0 || options & WNOHANG) {
*child_p = child;
return error;
}
error = tsleep(parent, PWAIT | PCATCH, "wait", 0);
if (error != 0)
return error;
}
}
/*
* Free a process after parent has taken all the state info.
*/
void
proc_free(struct proc *p)
{
struct proc *parent = p->p_pptr;
int s;
/*
* If we got the child via ptrace(2) or procfs, and
* the parent is different (meaning the process was
* attached, rather than run as a child), then we need
* to give it back to the old parent, and send the
* parent the exit signal. The rest of the cleanup
* will be done when the old parent waits on the child.
*/
if ((p->p_flag & P_TRACED) && p->p_opptr != parent){
parent = p->p_opptr;
if (parent == NULL)
parent = initproc;
proc_reparent(p, parent);
p->p_opptr = NULL;
p->p_flag &= ~(P_TRACED|P_WAITED|P_FSTRACE);
if (p->p_exitsig != 0)
exit_psignal(p, parent);
wakeup(parent);
return;
}
scheduler_wait_hook(parent, p);
p->p_xstat = 0;
ruadd(&parent->p_stats->p_cru, p->p_ru);
/*
* At this point we are going to start freeing the final resources.
* If anyone tries to access the proc structure after here they
* will get a shock - bits are missing.
* Attempt to make it hard!
*/
p->p_stat = SIDL; /* not even a zombie any more */
pool_put(&rusage_pool, p->p_ru);
/*
* Finally finished with old proc entry.
* Unlink it from its process group and free it.
*/
leavepgrp(p);
s = proclist_lock_write();
LIST_REMOVE(p, p_list); /* off zombproc */
p->p_pptr->p_nstopchild--;
LIST_REMOVE(p, p_sibling);
proclist_unlock_write(s);
/*
* Decrement the count of procs running with this uid.
*/
(void)chgproccnt(p->p_cred->p_ruid, -1);
/*
* Free up credentials.
*/
if (--p->p_cred->p_refcnt == 0) {
crfree(p->p_cred->pc_ucred);
pool_put(&pcred_pool, p->p_cred);
}
/*
* Release reference to text vnode
*/
if (p->p_textvp)
vrele(p->p_textvp);
/* Release any SA state. */
if (p->p_sa)
sa_release(p);
/* Free proc structure and let pid be reallocated */
proc_free_mem(p);
}
/*
* make process 'parent' the new parent of process 'child'.
*
* Must be called with proclist_lock_write() held.
*/
void
proc_reparent(struct proc *child, struct proc *parent)
{
if (child->p_pptr == parent)
return;
if (child->p_stat == SZOMB
|| (child->p_stat == SSTOP && !(child->p_flag & P_WAITED))) {
child->p_pptr->p_nstopchild--;
parent->p_nstopchild++;
}
if (parent == initproc)
child->p_exitsig = SIGCHLD;
LIST_REMOVE(child, p_sibling);
LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
child->p_pptr = parent;
}
|