2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
4 * @APPLE_LICENSE_HEADER_START@
6 * The contents of this file constitute Original Code as defined in and
7 * are subject to the Apple Public Source License Version 1.1 (the
8 * "License"). You may not use this file except in compliance with the
9 * License. Please obtain a copy of the License at
10 * http://www.apple.com/publicsource and read it before using this file.
12 * This Original Code and all software distributed under the License are
13 * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
14 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
15 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
16 * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
17 * License for the specific language governing rights and limitations
20 * @APPLE_LICENSE_HEADER_END@
22 /* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */
24 * Copyright (c) 1982, 1986, 1989, 1991, 1993
25 * The Regents of the University of California. All rights reserved.
26 * (c) UNIX System Laboratories, Inc.
27 * All or some portions of this file are derived from material licensed
28 * to the University of California by American Telephone and Telegraph
29 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
30 * the permission of UNIX System Laboratories, Inc.
32 * Redistribution and use in source and binary forms, with or without
33 * modification, are permitted provided that the following conditions
35 * 1. Redistributions of source code must retain the above copyright
36 * notice, this list of conditions and the following disclaimer.
37 * 2. Redistributions in binary form must reproduce the above copyright
38 * notice, this list of conditions and the following disclaimer in the
39 * documentation and/or other materials provided with the distribution.
40 * 3. All advertising materials mentioning features or use of this software
41 * must display the following acknowledgement:
42 * This product includes software developed by the University of
43 * California, Berkeley and its contributors.
44 * 4. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
60 * @(#)kern_exit.c 8.7 (Berkeley) 2/12/94
63 #include <machine/reg.h>
64 #include <machine/psl.h>
66 #include "compat_43.h"
68 #include <sys/param.h>
69 #include <sys/systm.h>
70 #include <sys/ioctl.h>
74 #include <sys/resource.h>
75 #include <sys/kernel.h>
79 #include <sys/vnode.h>
80 #include <sys/syslog.h>
81 #include <sys/malloc.h>
82 #include <sys/resourcevar.h>
83 #include <sys/ptrace.h>
86 #include <mach/mach_types.h>
87 #include <kern/thread.h>
88 #include <kern/thread_act.h>
89 #include <kern/assert.h>
91 extern char init_task_failure_data
[];
92 int exit1
__P((struct proc
*, int, int *));
104 struct exit_args
*uap
;
107 exit1(p
, W_EXITCODE(uap
->rval
, 0), retval
);
109 /* drop funnel befewo we return */
110 thread_funnel_set(kernel_flock
, FALSE
);
111 thread_exception_return();
119 * Exit: deallocate address space and other resources, change proc state
120 * to zombie, and unlink proc from allproc and parent's lists. Save exit
121 * status and rusage for wait(). Check for child processes and orphan them.
125 register struct proc
*p
;
129 register struct proc
*q
, *nq
;
130 thread_t self
= current_thread();
131 thread_act_t th_act_self
= current_act();
132 struct task
*task
= p
->task
;
137 * If a thread in this task has already
138 * called exit(), then halt any others
142 ut
= get_bsdthread_info(th_act_self
);
143 if (ut
->uu_flag
& P_VFORK
) {
145 vfork_return(th_act_self
, p
->p_pptr
, p
, retval
);
146 unix_syscall_return(0);
150 while (p
->exit_thread
!= self
) {
151 if (sig_try_locked(p
) <= 0) {
152 if (get_threadtask(th_act_self
) != task
) {
157 thread_terminate(th_act_self
);
158 thread_funnel_set(kernel_flock
, FALSE
);
159 thread_exception_return();
166 printf("pid 1 exited (signal %d, exit %d)",
167 WTERMSIG(rv
), WEXITSTATUS(rv
));
168 panic("init died\nState at Last Exception:\n\n%s",
169 init_task_failure_data
);
173 p
->p_flag
|= P_WEXIT
;
178 /* task terminate will call proc_terminate and that cleans it up */
179 task_terminate_internal(task
);
182 * we come back and returns to AST which
183 * should cleanup the rest
186 if (task
== current_task()) {
187 thread_exception_return();
191 while (task
== current_task()) {
192 thread_terminate_self();
200 proc_prepareexit(struct proc
*p
)
204 thread_t self
= current_thread();
205 thread_act_t th_act_self
= current_act();
208 * Remove proc from allproc queue and from pidhash chain.
209 * Need to do this before we do anything that can block.
210 * Not doing causes things like mount() find this on allproc
211 * in partially cleaned state.
213 LIST_REMOVE(p
, p_list
);
214 LIST_REMOVE(p
, p_hash
);
220 * If parent is waiting for us to exit or exec,
221 * P_PPWAIT is set; we will wakeup the parent below.
223 p
->p_flag
&= ~(P_TRACED
| P_PPWAIT
);
226 ut
= get_bsdthread_info(th_act_self
);
228 untimeout(realitexpire
, (caddr_t
)p
);
232 proc_exit(struct proc
*p
)
234 register struct proc
*q
, *nq
;
235 thread_t self
= current_thread();
236 thread_act_t th_act_self
= current_act();
237 struct task
*task
= p
->task
;
239 boolean_t funnel_state
;
241 /* This can happen if thread_terminate of the single thread
245 funnel_state
= thread_funnel_set(kernel_flock
, TRUE
);
246 if( !(p
->p_flag
& P_WEXIT
)) {
248 p
->p_flag
|= P_WEXIT
;
253 MALLOC_ZONE(p
->p_ru
, struct rusage
*,
254 sizeof (*p
->p_ru
), M_ZOMBIE
, M_WAITOK
);
257 * Close open files and release open-file table.
262 /* Close ref SYSV Shared memory*/
266 if (SESS_LEADER(p
)) {
267 register struct session
*sp
= p
->p_session
;
273 * Controlling process.
274 * Signal foreground pgrp,
275 * drain controlling terminal
276 * and revoke access to controlling terminal.
278 if (sp
->s_ttyp
->t_session
== sp
) {
279 if (sp
->s_ttyp
->t_pgrp
)
280 pgsignal(sp
->s_ttyp
->t_pgrp
, SIGHUP
, 1);
281 (void) ttywait(sp
->s_ttyp
);
283 * The tty could have been revoked
287 VOP_REVOKE(sp
->s_ttyvp
, REVOKEALL
);
294 * s_ttyp is not zero'd; we use this to indicate
295 * that the session once had a controlling terminal.
296 * (for logging and informational purposes)
302 fixjobc(p
, p
->p_pgrp
, 0);
303 p
->p_rlimit
[RLIMIT_FSIZE
].rlim_cur
= RLIM_INFINITY
;
308 p
->p_traceflag
= 0; /* don't trace the vrele() */
310 struct vnode
*tvp
= p
->p_tracep
;
317 q
= p
->p_children
.lh_first
;
318 if (q
) /* only need this if any child is S_ZOMB */
319 wakeup((caddr_t
) initproc
);
320 for (; q
!= 0; q
= nq
) {
321 nq
= q
->p_sibling
.le_next
;
322 proc_reparent(q
, initproc
);
324 * Traced processes are killed
325 * since their existence means someone is messing up.
327 if (q
->p_flag
& P_TRACED
) {
328 q
->p_flag
&= ~P_TRACED
;
329 if (q
->sigwait_thread
) {
330 thread_t sig_shuttle
= getshuttle_thread(q
->sigwait_thread
);
332 * The sigwait_thread could be stopped at a
333 * breakpoint. Wake it up to kill.
334 * Need to do this as it could be a thread which is not
335 * the first thread in the task. So any attempts to kill
336 * the process would result into a deadlock on q->sigwait.
338 thread_resume((struct thread
*)q
->sigwait_thread
);
339 clear_wait(sig_shuttle
, THREAD_INTERRUPTED
);
340 threadsignal(q
->sigwait_thread
, SIGKILL
, 0);
347 * Save exit status and final rusage info, adding in child rusage
348 * info and self times.
350 *p
->p_ru
= p
->p_stats
->p_ru
;
352 timerclear(&p
->p_ru
->ru_utime
);
353 timerclear(&p
->p_ru
->ru_stime
);
356 task_basic_info_data_t tinfo
;
357 task_thread_times_info_data_t ttimesinfo
;
358 int task_info_stuff
, task_ttimes_stuff
;
359 struct timeval ut
,st
;
361 task_info_stuff
= TASK_BASIC_INFO_COUNT
;
362 task_info(task
, TASK_BASIC_INFO
,
363 &tinfo
, &task_info_stuff
);
364 p
->p_ru
->ru_utime
.tv_sec
= tinfo
.user_time
.seconds
;
365 p
->p_ru
->ru_utime
.tv_usec
= tinfo
.user_time
.microseconds
;
366 p
->p_ru
->ru_stime
.tv_sec
= tinfo
.system_time
.seconds
;
367 p
->p_ru
->ru_stime
.tv_usec
= tinfo
.system_time
.microseconds
;
369 task_ttimes_stuff
= TASK_THREAD_TIMES_INFO_COUNT
;
370 task_info(task
, TASK_THREAD_TIMES_INFO
,
371 &ttimesinfo
, &task_ttimes_stuff
);
373 ut
.tv_sec
= ttimesinfo
.user_time
.seconds
;
374 ut
.tv_usec
= ttimesinfo
.user_time
.microseconds
;
375 st
.tv_sec
= ttimesinfo
.system_time
.seconds
;
376 st
.tv_usec
= ttimesinfo
.system_time
.microseconds
;
377 timeradd(&ut
,&p
->p_ru
->ru_utime
,&p
->p_ru
->ru_utime
);
378 timeradd(&st
,&p
->p_ru
->ru_stime
,&p
->p_ru
->ru_stime
);
381 ruadd(p
->p_ru
, &p
->p_stats
->p_cru
);
384 * Free up profiling buffers.
387 struct uprof
*p0
= &p
->p_stats
->p_prof
, *p1
, *pn
;
393 for (; p1
!= NULL
; p1
= pn
) {
395 kfree((vm_offset_t
)p1
, sizeof *p1
);
400 * Other substructures are freed from wait().
402 FREE_ZONE(p
->p_stats
, sizeof *p
->p_stats
, M_SUBPROC
);
405 FREE_ZONE(p
->p_sigacts
, sizeof *p
->p_sigacts
, M_SUBPROC
);
408 if (--p
->p_limit
->p_refcnt
== 0)
409 FREE_ZONE(p
->p_limit
, sizeof *p
->p_limit
, M_SUBPROC
);
413 * Finish up by terminating the task
414 * and halt this thread (only if a
415 * member of the task exiting).
419 set_bsdtask_info(task
, NULL
);
422 * Notify parent that we're gone.
424 psignal(p
->p_pptr
, SIGCHLD
);
426 /* Place onto zombproc. */
427 LIST_INSERT_HEAD(&zombproc
, p
, p_list
);
430 /* and now wakeup the parent */
431 wakeup((caddr_t
)p
->p_pptr
);
433 (void) thread_funnel_set(kernel_flock
, funnel_state
);
441 struct rusage
*rusage
;
446 owait(p
, uap
, retval
)
451 struct wait4_args
*a
;
453 a
= (struct wait4_args
*)get_bsduthreadarg(current_act());
459 return (wait1(p
, a
, retval
, 1));
463 wait4(p
, uap
, retval
)
465 struct wait4_args
*uap
;
468 return (wait1(p
, uap
, retval
, 0));
474 struct rusage
*rusage
;
478 owait3(p
, uap
, retval
)
480 struct owait3_args
*uap
;
483 struct wait4_args
*a
;
485 a
= (struct wait4_args
*)get_bsduthreadarg(current_act
);
487 a
->rusage
= uap
->rusage
;
488 a
->options
= uap
->options
;
489 a
->status
= uap
->status
;
492 return (wait1(p
, a
, retval
, 1));
500 wait1continue(result
)
511 thread
= current_act();
512 vt
= get_bsduthreadarg(thread
);
513 retval
= get_bsduthreadrval(thread
);
514 wait1((struct proc
*)p
, (struct wait4_args
*)vt
, retval
, 0);
518 wait1(q
, uap
, retval
, compat
)
519 register struct proc
*q
;
520 register struct wait4_args
*uap
;
527 register struct proc
*p
, *t
;
533 uap
->pid
= -q
->p_pgid
;
537 for (p
= q
->p_children
.lh_first
; p
!= 0; p
= p
->p_sibling
.le_next
) {
538 if (uap
->pid
!= WAIT_ANY
&&
539 p
->p_pid
!= uap
->pid
&&
540 p
->p_pgid
!= -(uap
->pid
))
543 if (p
->p_flag
& P_WAITING
) {
544 (void)tsleep(&p
->p_stat
, PWAIT
, "waitcoll", 0);
547 p
->p_flag
|= P_WAITING
; /* only allow single thread to wait() */
549 if (p
->p_stat
== SZOMB
) {
550 retval
[0] = p
->p_pid
;
553 retval
[1] = p
->p_xstat
;
557 status
= p
->p_xstat
; /* convert to int */
558 if (error
= copyout((caddr_t
)&status
,
559 (caddr_t
)uap
->status
,
561 p
->p_flag
&= ~P_WAITING
;
567 (error
= copyout((caddr_t
)p
->p_ru
,
568 (caddr_t
)uap
->rusage
,
569 sizeof (struct rusage
)))) {
570 p
->p_flag
&= ~P_WAITING
;
575 * If we got the child via a ptrace 'attach',
576 * we need to give it back to the old parent.
578 if (p
->p_oppid
&& (t
= pfind(p
->p_oppid
))) {
583 p
->p_flag
&= ~P_WAITING
;
589 ruadd(&q
->p_stats
->p_cru
, p
->p_ru
);
590 FREE_ZONE(p
->p_ru
, sizeof *p
->p_ru
, M_ZOMBIE
);
593 printf("Warning : lost p_ru for %s\n", p
->p_comm
);
597 * Decrement the count of procs running with this uid.
599 (void)chgproccnt(p
->p_cred
->p_ruid
, -1);
602 * Free up credentials.
604 if (--p
->p_cred
->p_refcnt
== 0) {
605 struct ucred
*ucr
= p
->p_ucred
;
614 FREE_ZONE(pcr
, sizeof *pcr
, M_SUBPROC
);
618 * Release reference to text vnode
626 * Finally finished with old proc entry.
627 * Unlink it from its process group and free it.
630 LIST_REMOVE(p
, p_list
); /* off zombproc */
631 LIST_REMOVE(p
, p_sibling
);
632 p
->p_flag
&= ~P_WAITING
;
633 FREE_ZONE(p
, sizeof *p
, M_PROC
);
638 if (p
->p_stat
== SSTOP
&& (p
->p_flag
& P_WAITED
) == 0 &&
639 (p
->p_flag
& P_TRACED
|| uap
->options
& WUNTRACED
)) {
640 p
->p_flag
|= P_WAITED
;
641 retval
[0] = p
->p_pid
;
644 retval
[1] = W_STOPCODE(p
->p_xstat
);
649 status
= W_STOPCODE(p
->p_xstat
);
650 error
= copyout((caddr_t
)&status
,
651 (caddr_t
)uap
->status
,
655 p
->p_flag
&= ~P_WAITING
;
659 p
->p_flag
&= ~P_WAITING
;
665 if (uap
->options
& WNOHANG
) {
670 if (error
= tsleep0((caddr_t
)q
, PWAIT
| PCATCH
, "wait", 0, wait1continue
))
677 * make process 'parent' the new parent of process 'child'.
680 proc_reparent(child
, parent
)
681 register struct proc
*child
;
682 register struct proc
*parent
;
685 if (child
->p_pptr
== parent
)
688 LIST_REMOVE(child
, p_sibling
);
689 LIST_INSERT_HEAD(&parent
->p_children
, child
, p_sibling
);
690 child
->p_pptr
= parent
;
694 * Make the current process an "init" process, meaning
695 * that it doesn't have a parent, and that it won't be
696 * gunned down by kill(-1, 0).
701 register struct proc
*p
= current_proc();
703 if (suser(p
->p_ucred
, &p
->p_acflag
))
704 return(KERN_NO_ACCESS
);
706 if (p
->p_pid
!= 1 && p
->p_pgid
!= p
->p_pid
)
707 enterpgrp(p
, p
->p_pid
, 0);
708 p
->p_flag
|= P_SYSTEM
;
711 * Take us out of the sibling chain, and
712 * out of our parent's child chain.
714 LIST_REMOVE(p
, p_sibling
);
715 p
->p_sibling
.le_prev
= NULL
;
716 p
->p_sibling
.le_next
= NULL
;
717 p
->p_pptr
= kernproc
;
719 return(KERN_SUCCESS
);
723 process_terminate_self(void)
725 struct proc
*p
= current_proc();
728 exit1(p
, W_EXITCODE(0, SIGKILL
), (int *)NULL
);
734 * Exit: deallocate address space and other resources, change proc state
735 * to zombie, and unlink proc from allproc and parent's lists. Save exit
736 * status and rusage for wait(). Check for child processes and orphan them.
741 register struct proc
*p
;
744 register struct proc
*q
, *nq
;
745 thread_t self
= current_thread();
746 thread_act_t th_act_self
= current_act();
747 struct task
*task
= p
->task
;
752 * If a thread in this task has already
753 * called exit(), then halt any others
757 ut
= get_bsdthread_info(th_act_self
);
760 while (p
->exit_thread
!= self
) {
761 if (sig_try_locked(p
) <= 0) {
762 if (get_threadtask(th_act_self
) != task
) {
767 thread_terminate(th_act_self
);
768 thread_funnel_set(kernel_flock
, FALSE
);
769 thread_exception_return();
776 printf("pid 1 exited (signal %d, exit %d)",
777 WTERMSIG(rv
), WEXITSTATUS(rv
));
778 panic("init died\nState at Last Exception:\n\n%s", init_task_failure_data
);
783 p
->p_flag
|= P_WEXIT
;
786 * Remove proc from allproc queue and from pidhash chain.
787 * Need to do this before we do anything that can block.
788 * Not doing causes things like mount() find this on allproc
789 * in partially cleaned state.
791 LIST_REMOVE(p
, p_list
);
792 LIST_REMOVE(p
, p_hash
);
794 * If parent is waiting for us to exit or exec,
795 * P_PPWAIT is set; we will wakeup the parent below.
797 p
->p_flag
&= ~(P_TRACED
| P_PPWAIT
);
802 untimeout(realitexpire
, (caddr_t
)p
);
810 vproc_exit(struct proc
*p
)
812 register struct proc
*q
, *nq
;
813 thread_t self
= current_thread();
814 thread_act_t th_act_self
= current_act();
815 struct task
*task
= p
->task
;
817 boolean_t funnel_state
;
819 MALLOC_ZONE(p
->p_ru
, struct rusage
*,
820 sizeof (*p
->p_ru
), M_ZOMBIE
, M_WAITOK
);
823 * Close open files and release open-file table.
828 /* Close ref SYSV Shared memory*/
832 if (SESS_LEADER(p
)) {
833 register struct session
*sp
= p
->p_session
;
839 * Controlling process.
840 * Signal foreground pgrp,
841 * drain controlling terminal
842 * and revoke access to controlling terminal.
844 if (sp
->s_ttyp
->t_session
== sp
) {
845 if (sp
->s_ttyp
->t_pgrp
)
846 pgsignal(sp
->s_ttyp
->t_pgrp
, SIGHUP
, 1);
847 (void) ttywait(sp
->s_ttyp
);
849 * The tty could have been revoked
853 VOP_REVOKE(sp
->s_ttyvp
, REVOKEALL
);
860 * s_ttyp is not zero'd; we use this to indicate
861 * that the session once had a controlling terminal.
862 * (for logging and informational purposes)
868 fixjobc(p
, p
->p_pgrp
, 0);
869 p
->p_rlimit
[RLIMIT_FSIZE
].rlim_cur
= RLIM_INFINITY
;
874 p
->p_traceflag
= 0; /* don't trace the vrele() */
876 struct vnode
*tvp
= p
->p_tracep
;
882 q
= p
->p_children
.lh_first
;
883 if (q
) /* only need this if any child is S_ZOMB */
884 wakeup((caddr_t
) initproc
);
885 for (; q
!= 0; q
= nq
) {
886 nq
= q
->p_sibling
.le_next
;
887 proc_reparent(q
, initproc
);
889 * Traced processes are killed
890 * since their existence means someone is messing up.
892 if (q
->p_flag
& P_TRACED
) {
893 q
->p_flag
&= ~P_TRACED
;
894 if (q
->sigwait_thread
) {
895 thread_t sig_shuttle
= getshuttle_thread(q
->sigwait_thread
);
897 * The sigwait_thread could be stopped at a
898 * breakpoint. Wake it up to kill.
899 * Need to do this as it could be a thread which is not
900 * the first thread in the task. So any attempts to kill
901 * the process would result into a deadlock on q->sigwait.
903 thread_resume((struct thread
*)q
->sigwait_thread
);
904 clear_wait(sig_shuttle
, THREAD_INTERRUPTED
);
905 threadsignal(q
->sigwait_thread
, SIGKILL
, 0);
912 * Save exit status and final rusage info, adding in child rusage
913 * info and self times.
915 *p
->p_ru
= p
->p_stats
->p_ru
;
917 timerclear(&p
->p_ru
->ru_utime
);
918 timerclear(&p
->p_ru
->ru_stime
);
922 task_basic_info_data_t tinfo
;
923 task_thread_times_info_data_t ttimesinfo
;
924 int task_info_stuff
, task_ttimes_stuff
;
925 struct timeval ut
,st
;
927 task_info_stuff
= TASK_BASIC_INFO_COUNT
;
928 task_info(task
, TASK_BASIC_INFO
,
929 &tinfo
, &task_info_stuff
);
930 p
->p_ru
->ru_utime
.tv_sec
= tinfo
.user_time
.seconds
;
931 p
->p_ru
->ru_utime
.tv_usec
= tinfo
.user_time
.microseconds
;
932 p
->p_ru
->ru_stime
.tv_sec
= tinfo
.system_time
.seconds
;
933 p
->p_ru
->ru_stime
.tv_usec
= tinfo
.system_time
.microseconds
;
935 task_ttimes_stuff
= TASK_THREAD_TIMES_INFO_COUNT
;
936 task_info(task
, TASK_THREAD_TIMES_INFO
,
937 &ttimesinfo
, &task_ttimes_stuff
);
939 ut
.tv_sec
= ttimesinfo
.user_time
.seconds
;
940 ut
.tv_usec
= ttimesinfo
.user_time
.microseconds
;
941 st
.tv_sec
= ttimesinfo
.system_time
.seconds
;
942 st
.tv_usec
= ttimesinfo
.system_time
.microseconds
;
943 timeradd(&ut
,&p
->p_ru
->ru_utime
,&p
->p_ru
->ru_utime
);
944 timeradd(&st
,&p
->p_ru
->ru_stime
,&p
->p_ru
->ru_stime
);
948 ruadd(p
->p_ru
, &p
->p_stats
->p_cru
);
951 * Free up profiling buffers.
954 struct uprof
*p0
= &p
->p_stats
->p_prof
, *p1
, *pn
;
960 for (; p1
!= NULL
; p1
= pn
) {
962 kfree((vm_offset_t
)p1
, sizeof *p1
);
967 * Other substructures are freed from wait().
969 FREE_ZONE(p
->p_stats
, sizeof *p
->p_stats
, M_SUBPROC
);
972 FREE_ZONE(p
->p_sigacts
, sizeof *p
->p_sigacts
, M_SUBPROC
);
975 if (--p
->p_limit
->p_refcnt
== 0)
976 FREE_ZONE(p
->p_limit
, sizeof *p
->p_limit
, M_SUBPROC
);
980 * Finish up by terminating the task
981 * and halt this thread (only if a
982 * member of the task exiting).
987 * Notify parent that we're gone.
989 psignal(p
->p_pptr
, SIGCHLD
);
991 /* Place onto zombproc. */
992 LIST_INSERT_HEAD(&zombproc
, p
, p_list
);
995 /* and now wakeup the parent */
996 wakeup((caddr_t
)p
->p_pptr
);