kern_exit.c revision 1.45 1 1.45 mycroft /* $NetBSD: kern_exit.c,v 1.45 1997/04/28 13:17:05 mycroft Exp $ */
2 1.24 cgd
3 1.24 cgd /*
4 1.24 cgd * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 1.24 cgd * The Regents of the University of California. All rights reserved.
6 1.24 cgd * (c) UNIX System Laboratories, Inc.
7 1.24 cgd * All or some portions of this file are derived from material licensed
8 1.24 cgd * to the University of California by American Telephone and Telegraph
9 1.24 cgd * Co. or Unix System Laboratories, Inc. and are reproduced herein with
10 1.24 cgd * the permission of UNIX System Laboratories, Inc.
11 1.24 cgd *
12 1.24 cgd * Redistribution and use in source and binary forms, with or without
13 1.24 cgd * modification, are permitted provided that the following conditions
14 1.24 cgd * are met:
15 1.24 cgd * 1. Redistributions of source code must retain the above copyright
16 1.24 cgd * notice, this list of conditions and the following disclaimer.
17 1.24 cgd * 2. Redistributions in binary form must reproduce the above copyright
18 1.24 cgd * notice, this list of conditions and the following disclaimer in the
19 1.24 cgd * documentation and/or other materials provided with the distribution.
20 1.24 cgd * 3. All advertising materials mentioning features or use of this software
21 1.24 cgd * must display the following acknowledgement:
22 1.24 cgd * This product includes software developed by the University of
23 1.24 cgd * California, Berkeley and its contributors.
24 1.24 cgd * 4. Neither the name of the University nor the names of its contributors
25 1.24 cgd * may be used to endorse or promote products derived from this software
26 1.24 cgd * without specific prior written permission.
27 1.24 cgd *
28 1.24 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 1.24 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 1.24 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 1.24 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 1.24 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 1.24 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 1.24 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 1.24 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 1.24 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 1.24 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 1.24 cgd * SUCH DAMAGE.
39 1.24 cgd *
40 1.24 cgd * @(#)kern_exit.c 8.7 (Berkeley) 2/12/94
41 1.24 cgd */
42 1.24 cgd
43 1.24 cgd #include <sys/param.h>
44 1.24 cgd #include <sys/systm.h>
45 1.24 cgd #include <sys/map.h>
46 1.24 cgd #include <sys/ioctl.h>
47 1.24 cgd #include <sys/proc.h>
48 1.24 cgd #include <sys/tty.h>
49 1.24 cgd #include <sys/time.h>
50 1.24 cgd #include <sys/resource.h>
51 1.24 cgd #include <sys/kernel.h>
52 1.24 cgd #include <sys/proc.h>
53 1.24 cgd #include <sys/buf.h>
54 1.24 cgd #include <sys/wait.h>
55 1.24 cgd #include <sys/file.h>
56 1.24 cgd #include <sys/vnode.h>
57 1.24 cgd #include <sys/syslog.h>
58 1.24 cgd #include <sys/malloc.h>
59 1.24 cgd #include <sys/resourcevar.h>
60 1.24 cgd #include <sys/ptrace.h>
61 1.29 cgd #include <sys/acct.h>
62 1.36 christos #include <sys/filedesc.h>
63 1.36 christos #include <sys/signalvar.h>
64 1.38 christos #ifdef SYSVSHM
65 1.38 christos #include <sys/shm.h>
66 1.38 christos #endif
67 1.38 christos #ifdef SYSVSEM
68 1.38 christos #include <sys/sem.h>
69 1.38 christos #endif
70 1.24 cgd
71 1.26 cgd #include <sys/mount.h>
72 1.26 cgd #include <sys/syscallargs.h>
73 1.26 cgd
74 1.24 cgd #include <machine/cpu.h>
75 1.24 cgd
76 1.24 cgd #include <vm/vm.h>
77 1.24 cgd #include <vm/vm_kern.h>
78 1.24 cgd
79 1.24 cgd /*
80 1.24 cgd * exit --
81 1.24 cgd * Death of process.
82 1.24 cgd */
83 1.31 thorpej int
84 1.33 mycroft sys_exit(p, v, retval)
85 1.24 cgd struct proc *p;
86 1.31 thorpej void *v;
87 1.32 thorpej register_t *retval;
88 1.31 thorpej {
89 1.33 mycroft struct sys_exit_args /* {
90 1.26 cgd syscallarg(int) rval;
91 1.31 thorpej } */ *uap = v;
92 1.24 cgd
93 1.26 cgd exit1(p, W_EXITCODE(SCARG(uap, rval), 0));
94 1.24 cgd /* NOTREACHED */
95 1.31 thorpej return (0);
96 1.24 cgd }
97 1.24 cgd
98 1.24 cgd /*
99 1.24 cgd * Exit: deallocate address space and other resources, change proc state
100 1.24 cgd * to zombie, and unlink proc from allproc and parent's lists. Save exit
101 1.24 cgd * status and rusage for wait(). Check for child processes and orphan them.
102 1.24 cgd */
103 1.31 thorpej void
104 1.24 cgd exit1(p, rv)
105 1.24 cgd register struct proc *p;
106 1.24 cgd int rv;
107 1.24 cgd {
108 1.24 cgd register struct proc *q, *nq;
109 1.24 cgd register struct vmspace *vm;
110 1.24 cgd
111 1.24 cgd if (p->p_pid == 1)
112 1.24 cgd panic("init died (signal %d, exit %d)",
113 1.24 cgd WTERMSIG(rv), WEXITSTATUS(rv));
114 1.24 cgd #ifdef PGINPROF
115 1.24 cgd vmsizmon();
116 1.24 cgd #endif
117 1.24 cgd if (p->p_flag & P_PROFIL)
118 1.24 cgd stopprofclock(p);
119 1.24 cgd MALLOC(p->p_ru, struct rusage *, sizeof(struct rusage),
120 1.24 cgd M_ZOMBIE, M_WAITOK);
121 1.24 cgd /*
122 1.37 mycroft * If parent is waiting for us to exit or exec, P_PPWAIT is set; we
123 1.37 mycroft * wake up the parent early to avoid deadlock.
124 1.24 cgd */
125 1.24 cgd p->p_flag |= P_WEXIT;
126 1.37 mycroft if (p->p_flag & P_PPWAIT) {
127 1.37 mycroft p->p_flag &= ~P_PPWAIT;
128 1.37 mycroft wakeup((caddr_t)p->p_pptr);
129 1.37 mycroft }
130 1.24 cgd p->p_sigignore = ~0;
131 1.24 cgd p->p_siglist = 0;
132 1.24 cgd untimeout(realitexpire, (caddr_t)p);
133 1.24 cgd
134 1.24 cgd /*
135 1.24 cgd * Close open files and release open-file table.
136 1.24 cgd * This may block!
137 1.24 cgd */
138 1.24 cgd fdfree(p);
139 1.24 cgd
140 1.24 cgd /* The next three chunks should probably be moved to vmspace_exit. */
141 1.24 cgd vm = p->p_vmspace;
142 1.24 cgd #ifdef SYSVSHM
143 1.24 cgd if (vm->vm_shm)
144 1.24 cgd shmexit(p);
145 1.24 cgd #endif
146 1.24 cgd #ifdef SYSVSEM
147 1.24 cgd semexit(p);
148 1.24 cgd #endif
149 1.24 cgd /*
150 1.24 cgd * Release user portion of address space.
151 1.24 cgd * This releases references to vnodes,
152 1.24 cgd * which could cause I/O if the file has been unlinked.
153 1.24 cgd * Need to do this early enough that we can still sleep.
154 1.24 cgd * Can't free the entire vmspace as the kernel stack
155 1.24 cgd * may be mapped within that space also.
156 1.24 cgd */
157 1.24 cgd if (vm->vm_refcnt == 1)
158 1.24 cgd (void) vm_map_remove(&vm->vm_map, VM_MIN_ADDRESS,
159 1.24 cgd VM_MAXUSER_ADDRESS);
160 1.24 cgd
161 1.24 cgd if (SESS_LEADER(p)) {
162 1.24 cgd register struct session *sp = p->p_session;
163 1.24 cgd
164 1.24 cgd if (sp->s_ttyvp) {
165 1.24 cgd /*
166 1.24 cgd * Controlling process.
167 1.24 cgd * Signal foreground pgrp,
168 1.24 cgd * drain controlling terminal
169 1.24 cgd * and revoke access to controlling terminal.
170 1.24 cgd */
171 1.24 cgd if (sp->s_ttyp->t_session == sp) {
172 1.24 cgd if (sp->s_ttyp->t_pgrp)
173 1.24 cgd pgsignal(sp->s_ttyp->t_pgrp, SIGHUP, 1);
174 1.24 cgd (void) ttywait(sp->s_ttyp);
175 1.24 cgd /*
176 1.24 cgd * The tty could have been revoked
177 1.24 cgd * if we blocked.
178 1.24 cgd */
179 1.24 cgd if (sp->s_ttyvp)
180 1.24 cgd vgoneall(sp->s_ttyvp);
181 1.24 cgd }
182 1.24 cgd if (sp->s_ttyvp)
183 1.24 cgd vrele(sp->s_ttyvp);
184 1.24 cgd sp->s_ttyvp = NULL;
185 1.24 cgd /*
186 1.24 cgd * s_ttyp is not zero'd; we use this to indicate
187 1.24 cgd * that the session once had a controlling terminal.
188 1.24 cgd * (for logging and informational purposes)
189 1.24 cgd */
190 1.24 cgd }
191 1.24 cgd sp->s_leader = NULL;
192 1.24 cgd }
193 1.24 cgd fixjobc(p, p->p_pgrp, 0);
194 1.24 cgd p->p_rlimit[RLIMIT_FSIZE].rlim_cur = RLIM_INFINITY;
195 1.24 cgd (void)acct_process(p);
196 1.24 cgd #ifdef KTRACE
197 1.24 cgd /*
198 1.24 cgd * release trace file
199 1.24 cgd */
200 1.24 cgd p->p_traceflag = 0; /* don't trace the vrele() */
201 1.24 cgd if (p->p_tracep)
202 1.24 cgd vrele(p->p_tracep);
203 1.24 cgd #endif
204 1.24 cgd /*
205 1.24 cgd * Remove proc from allproc queue and pidhash chain.
206 1.24 cgd * Place onto zombproc. Unlink from parent's child list.
207 1.24 cgd */
208 1.25 mycroft LIST_REMOVE(p, p_list);
209 1.25 mycroft LIST_INSERT_HEAD(&zombproc, p, p_list);
210 1.24 cgd p->p_stat = SZOMB;
211 1.24 cgd
212 1.25 mycroft LIST_REMOVE(p, p_hash);
213 1.24 cgd
214 1.25 mycroft q = p->p_children.lh_first;
215 1.25 mycroft if (q) /* only need this if any child is S_ZOMB */
216 1.37 mycroft wakeup((caddr_t)initproc);
217 1.25 mycroft for (; q != 0; q = nq) {
218 1.25 mycroft nq = q->p_sibling.le_next;
219 1.27 mycroft proc_reparent(q, initproc);
220 1.24 cgd /*
221 1.24 cgd * Traced processes are killed
222 1.24 cgd * since their existence means someone is screwing up.
223 1.24 cgd */
224 1.24 cgd if (q->p_flag & P_TRACED) {
225 1.45 mycroft q->p_flag &= ~(P_TRACED|P_WAITED|P_FSTRACE);
226 1.24 cgd psignal(q, SIGKILL);
227 1.24 cgd }
228 1.24 cgd }
229 1.24 cgd
230 1.24 cgd /*
231 1.24 cgd * Save exit status and final rusage info, adding in child rusage
232 1.24 cgd * info and self times.
233 1.24 cgd */
234 1.24 cgd p->p_xstat = rv;
235 1.24 cgd *p->p_ru = p->p_stats->p_ru;
236 1.24 cgd calcru(p, &p->p_ru->ru_utime, &p->p_ru->ru_stime, NULL);
237 1.24 cgd ruadd(p->p_ru, &p->p_stats->p_cru);
238 1.24 cgd
239 1.24 cgd /*
240 1.24 cgd * Notify parent that we're gone.
241 1.24 cgd */
242 1.44 mycroft if ((p->p_flag & P_FSTRACE) == 0)
243 1.44 mycroft psignal(p->p_pptr, SIGCHLD);
244 1.24 cgd wakeup((caddr_t)p->p_pptr);
245 1.40 perry
246 1.24 cgd /*
247 1.24 cgd * Clear curproc after we've done all operations
248 1.24 cgd * that could block, and before tearing down the rest
249 1.24 cgd * of the process state that might be used from clock, etc.
250 1.24 cgd * Also, can't clear curproc while we're still runnable,
251 1.24 cgd * as we're not on a run queue (we are current, just not
252 1.24 cgd * a proper proc any longer!).
253 1.24 cgd *
254 1.24 cgd * Other substructures are freed from wait().
255 1.24 cgd */
256 1.24 cgd curproc = NULL;
257 1.36 christos if (--p->p_limit->p_refcnt == 0)
258 1.36 christos FREE(p->p_limit, M_SUBPROC);
259 1.24 cgd
260 1.24 cgd /*
261 1.24 cgd * Finally, call machine-dependent code to release the remaining
262 1.24 cgd * resources including address space, the kernel stack and pcb.
263 1.24 cgd * The address space is released by "vmspace_free(p->p_vmspace)";
264 1.24 cgd * This is machine-dependent, as we may have to change stacks
265 1.24 cgd * or ensure that the current one isn't reallocated before we
266 1.24 cgd * finish. cpu_exit will end with a call to cpu_swtch(), finishing
267 1.24 cgd * our execution (pun intended).
268 1.24 cgd */
269 1.24 cgd cpu_exit(p);
270 1.24 cgd }
271 1.24 cgd
272 1.24 cgd int
273 1.33 mycroft sys_wait4(q, v, retval)
274 1.24 cgd register struct proc *q;
275 1.31 thorpej void *v;
276 1.31 thorpej register_t *retval;
277 1.31 thorpej {
278 1.33 mycroft register struct sys_wait4_args /* {
279 1.26 cgd syscallarg(int) pid;
280 1.26 cgd syscallarg(int *) status;
281 1.26 cgd syscallarg(int) options;
282 1.26 cgd syscallarg(struct rusage *) rusage;
283 1.31 thorpej } */ *uap = v;
284 1.24 cgd register int nfound;
285 1.24 cgd register struct proc *p, *t;
286 1.24 cgd int status, error;
287 1.24 cgd
288 1.26 cgd if (SCARG(uap, pid) == 0)
289 1.26 cgd SCARG(uap, pid) = -q->p_pgid;
290 1.26 cgd if (SCARG(uap, options) &~ (WUNTRACED|WNOHANG))
291 1.24 cgd return (EINVAL);
292 1.41 mikel
293 1.24 cgd loop:
294 1.24 cgd nfound = 0;
295 1.25 mycroft for (p = q->p_children.lh_first; p != 0; p = p->p_sibling.le_next) {
296 1.26 cgd if (SCARG(uap, pid) != WAIT_ANY &&
297 1.26 cgd p->p_pid != SCARG(uap, pid) &&
298 1.26 cgd p->p_pgid != -SCARG(uap, pid))
299 1.24 cgd continue;
300 1.24 cgd nfound++;
301 1.24 cgd if (p->p_stat == SZOMB) {
302 1.24 cgd retval[0] = p->p_pid;
303 1.30 christos
304 1.26 cgd if (SCARG(uap, status)) {
305 1.24 cgd status = p->p_xstat; /* convert to int */
306 1.36 christos error = copyout((caddr_t)&status,
307 1.36 christos (caddr_t)SCARG(uap, status),
308 1.36 christos sizeof(status));
309 1.36 christos if (error)
310 1.24 cgd return (error);
311 1.24 cgd }
312 1.26 cgd if (SCARG(uap, rusage) &&
313 1.26 cgd (error = copyout((caddr_t)p->p_ru,
314 1.26 cgd (caddr_t)SCARG(uap, rusage),
315 1.26 cgd sizeof (struct rusage))))
316 1.24 cgd return (error);
317 1.24 cgd /*
318 1.45 mycroft * If we got the child via ptrace(2) or procfs, and
319 1.45 mycroft * the parent is different (meaning the process was
320 1.45 mycroft * attached, rather than run as a child), then we need
321 1.45 mycroft * to give it back to the old parent, and send the
322 1.45 mycroft * parent a SIGCHLD. The rest of the cleanup will be
323 1.45 mycroft * done when the old parent waits on the child.
324 1.24 cgd */
325 1.45 mycroft if ((p->p_flag & P_TRACED) &&
326 1.45 mycroft p->p_oppid != p->p_pptr->p_pid) {
327 1.45 mycroft t = pfind(p->p_oppid);
328 1.45 mycroft proc_reparent(p, t ? t : initproc);
329 1.24 cgd p->p_oppid = 0;
330 1.45 mycroft p->p_flag &= ~(P_TRACED|P_WAITED|P_FSTRACE);
331 1.45 mycroft psignal(p->p_pptr, SIGCHLD);
332 1.45 mycroft wakeup((caddr_t)p->p_pptr);
333 1.24 cgd return (0);
334 1.24 cgd }
335 1.24 cgd p->p_xstat = 0;
336 1.24 cgd ruadd(&q->p_stats->p_cru, p->p_ru);
337 1.24 cgd FREE(p->p_ru, M_ZOMBIE);
338 1.24 cgd
339 1.24 cgd /*
340 1.35 mycroft * Finally finished with old proc entry.
341 1.35 mycroft * Unlink it from its process group and free it.
342 1.35 mycroft */
343 1.35 mycroft leavepgrp(p);
344 1.35 mycroft LIST_REMOVE(p, p_list); /* off zombproc */
345 1.35 mycroft LIST_REMOVE(p, p_sibling);
346 1.35 mycroft
347 1.35 mycroft /*
348 1.24 cgd * Decrement the count of procs running with this uid.
349 1.24 cgd */
350 1.24 cgd (void)chgproccnt(p->p_cred->p_ruid, -1);
351 1.24 cgd
352 1.24 cgd /*
353 1.24 cgd * Free up credentials.
354 1.24 cgd */
355 1.24 cgd if (--p->p_cred->p_refcnt == 0) {
356 1.24 cgd crfree(p->p_cred->pc_ucred);
357 1.24 cgd FREE(p->p_cred, M_SUBPROC);
358 1.24 cgd }
359 1.24 cgd
360 1.24 cgd /*
361 1.24 cgd * Release reference to text vnode
362 1.24 cgd */
363 1.24 cgd if (p->p_textvp)
364 1.24 cgd vrele(p->p_textvp);
365 1.24 cgd
366 1.24 cgd /*
367 1.24 cgd * Give machine-dependent layer a chance
368 1.24 cgd * to free anything that cpu_exit couldn't
369 1.24 cgd * release while still running in process context.
370 1.24 cgd */
371 1.24 cgd cpu_wait(p);
372 1.24 cgd FREE(p, M_PROC);
373 1.24 cgd nprocs--;
374 1.24 cgd return (0);
375 1.24 cgd }
376 1.24 cgd if (p->p_stat == SSTOP && (p->p_flag & P_WAITED) == 0 &&
377 1.26 cgd (p->p_flag & P_TRACED || SCARG(uap, options) & WUNTRACED)) {
378 1.24 cgd p->p_flag |= P_WAITED;
379 1.24 cgd retval[0] = p->p_pid;
380 1.30 christos
381 1.26 cgd if (SCARG(uap, status)) {
382 1.24 cgd status = W_STOPCODE(p->p_xstat);
383 1.24 cgd error = copyout((caddr_t)&status,
384 1.26 cgd (caddr_t)SCARG(uap, status),
385 1.26 cgd sizeof(status));
386 1.24 cgd } else
387 1.24 cgd error = 0;
388 1.24 cgd return (error);
389 1.24 cgd }
390 1.24 cgd }
391 1.24 cgd if (nfound == 0)
392 1.24 cgd return (ECHILD);
393 1.26 cgd if (SCARG(uap, options) & WNOHANG) {
394 1.24 cgd retval[0] = 0;
395 1.24 cgd return (0);
396 1.24 cgd }
397 1.36 christos if ((error = tsleep((caddr_t)q, PWAIT | PCATCH, "wait", 0)) != 0)
398 1.24 cgd return (error);
399 1.24 cgd goto loop;
400 1.24 cgd }
401 1.24 cgd
402 1.24 cgd /*
403 1.24 cgd * make process 'parent' the new parent of process 'child'.
404 1.24 cgd */
405 1.24 cgd void
406 1.24 cgd proc_reparent(child, parent)
407 1.24 cgd register struct proc *child;
408 1.24 cgd register struct proc *parent;
409 1.24 cgd {
410 1.24 cgd
411 1.24 cgd if (child->p_pptr == parent)
412 1.24 cgd return;
413 1.24 cgd
414 1.25 mycroft LIST_REMOVE(child, p_sibling);
415 1.25 mycroft LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
416 1.24 cgd child->p_pptr = parent;
417 1.24 cgd }
418