kern_exit.c revision 1.37 1 1.37 mycroft /* $NetBSD: kern_exit.c,v 1.37 1996/02/09 01:19:21 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.24 cgd
65 1.26 cgd #include <sys/mount.h>
66 1.26 cgd #include <sys/syscallargs.h>
67 1.26 cgd
68 1.24 cgd #include <machine/cpu.h>
69 1.24 cgd
70 1.24 cgd #include <vm/vm.h>
71 1.24 cgd #include <vm/vm_kern.h>
72 1.24 cgd
73 1.36 christos #include <kern/kern_extern.h>
74 1.24 cgd
75 1.24 cgd /*
76 1.24 cgd * exit --
77 1.24 cgd * Death of process.
78 1.24 cgd */
79 1.31 thorpej int
80 1.33 mycroft sys_exit(p, v, retval)
81 1.24 cgd struct proc *p;
82 1.31 thorpej void *v;
83 1.32 thorpej register_t *retval;
84 1.31 thorpej {
85 1.33 mycroft struct sys_exit_args /* {
86 1.26 cgd syscallarg(int) rval;
87 1.31 thorpej } */ *uap = v;
88 1.24 cgd
89 1.26 cgd exit1(p, W_EXITCODE(SCARG(uap, rval), 0));
90 1.24 cgd /* NOTREACHED */
91 1.31 thorpej return (0);
92 1.24 cgd }
93 1.24 cgd
94 1.24 cgd /*
95 1.24 cgd * Exit: deallocate address space and other resources, change proc state
96 1.24 cgd * to zombie, and unlink proc from allproc and parent's lists. Save exit
97 1.24 cgd * status and rusage for wait(). Check for child processes and orphan them.
98 1.24 cgd */
99 1.31 thorpej void
100 1.24 cgd exit1(p, rv)
101 1.24 cgd register struct proc *p;
102 1.24 cgd int rv;
103 1.24 cgd {
104 1.24 cgd register struct proc *q, *nq;
105 1.24 cgd register struct vmspace *vm;
106 1.24 cgd
107 1.24 cgd if (p->p_pid == 1)
108 1.24 cgd panic("init died (signal %d, exit %d)",
109 1.24 cgd WTERMSIG(rv), WEXITSTATUS(rv));
110 1.24 cgd #ifdef PGINPROF
111 1.24 cgd vmsizmon();
112 1.24 cgd #endif
113 1.24 cgd if (p->p_flag & P_PROFIL)
114 1.24 cgd stopprofclock(p);
115 1.24 cgd MALLOC(p->p_ru, struct rusage *, sizeof(struct rusage),
116 1.24 cgd M_ZOMBIE, M_WAITOK);
117 1.24 cgd /*
118 1.37 mycroft * If parent is waiting for us to exit or exec, P_PPWAIT is set; we
119 1.37 mycroft * wake up the parent early to avoid deadlock.
120 1.24 cgd */
121 1.24 cgd p->p_flag |= P_WEXIT;
122 1.37 mycroft p->p_flag &= ~P_TRACED;
123 1.37 mycroft if (p->p_flag & P_PPWAIT) {
124 1.37 mycroft p->p_flag &= ~P_PPWAIT;
125 1.37 mycroft wakeup((caddr_t)p->p_pptr);
126 1.37 mycroft }
127 1.24 cgd p->p_sigignore = ~0;
128 1.24 cgd p->p_siglist = 0;
129 1.24 cgd untimeout(realitexpire, (caddr_t)p);
130 1.24 cgd
131 1.24 cgd /*
132 1.24 cgd * Close open files and release open-file table.
133 1.24 cgd * This may block!
134 1.24 cgd */
135 1.24 cgd fdfree(p);
136 1.24 cgd
137 1.24 cgd /* The next three chunks should probably be moved to vmspace_exit. */
138 1.24 cgd vm = p->p_vmspace;
139 1.24 cgd #ifdef SYSVSHM
140 1.24 cgd if (vm->vm_shm)
141 1.24 cgd shmexit(p);
142 1.24 cgd #endif
143 1.24 cgd #ifdef SYSVSEM
144 1.24 cgd semexit(p);
145 1.24 cgd #endif
146 1.24 cgd /*
147 1.24 cgd * Release user portion of address space.
148 1.24 cgd * This releases references to vnodes,
149 1.24 cgd * which could cause I/O if the file has been unlinked.
150 1.24 cgd * Need to do this early enough that we can still sleep.
151 1.24 cgd * Can't free the entire vmspace as the kernel stack
152 1.24 cgd * may be mapped within that space also.
153 1.24 cgd */
154 1.24 cgd if (vm->vm_refcnt == 1)
155 1.24 cgd (void) vm_map_remove(&vm->vm_map, VM_MIN_ADDRESS,
156 1.24 cgd VM_MAXUSER_ADDRESS);
157 1.24 cgd
158 1.24 cgd if (SESS_LEADER(p)) {
159 1.24 cgd register struct session *sp = p->p_session;
160 1.24 cgd
161 1.24 cgd if (sp->s_ttyvp) {
162 1.24 cgd /*
163 1.24 cgd * Controlling process.
164 1.24 cgd * Signal foreground pgrp,
165 1.24 cgd * drain controlling terminal
166 1.24 cgd * and revoke access to controlling terminal.
167 1.24 cgd */
168 1.24 cgd if (sp->s_ttyp->t_session == sp) {
169 1.24 cgd if (sp->s_ttyp->t_pgrp)
170 1.24 cgd pgsignal(sp->s_ttyp->t_pgrp, SIGHUP, 1);
171 1.24 cgd (void) ttywait(sp->s_ttyp);
172 1.24 cgd /*
173 1.24 cgd * The tty could have been revoked
174 1.24 cgd * if we blocked.
175 1.24 cgd */
176 1.24 cgd if (sp->s_ttyvp)
177 1.24 cgd vgoneall(sp->s_ttyvp);
178 1.24 cgd }
179 1.24 cgd if (sp->s_ttyvp)
180 1.24 cgd vrele(sp->s_ttyvp);
181 1.24 cgd sp->s_ttyvp = NULL;
182 1.24 cgd /*
183 1.24 cgd * s_ttyp is not zero'd; we use this to indicate
184 1.24 cgd * that the session once had a controlling terminal.
185 1.24 cgd * (for logging and informational purposes)
186 1.24 cgd */
187 1.24 cgd }
188 1.24 cgd sp->s_leader = NULL;
189 1.24 cgd }
190 1.24 cgd fixjobc(p, p->p_pgrp, 0);
191 1.24 cgd p->p_rlimit[RLIMIT_FSIZE].rlim_cur = RLIM_INFINITY;
192 1.24 cgd (void)acct_process(p);
193 1.24 cgd #ifdef KTRACE
194 1.24 cgd /*
195 1.24 cgd * release trace file
196 1.24 cgd */
197 1.24 cgd p->p_traceflag = 0; /* don't trace the vrele() */
198 1.24 cgd if (p->p_tracep)
199 1.24 cgd vrele(p->p_tracep);
200 1.24 cgd #endif
201 1.24 cgd /*
202 1.24 cgd * Remove proc from allproc queue and pidhash chain.
203 1.24 cgd * Place onto zombproc. Unlink from parent's child list.
204 1.24 cgd */
205 1.25 mycroft LIST_REMOVE(p, p_list);
206 1.25 mycroft LIST_INSERT_HEAD(&zombproc, p, p_list);
207 1.24 cgd p->p_stat = SZOMB;
208 1.24 cgd
209 1.25 mycroft LIST_REMOVE(p, p_hash);
210 1.24 cgd
211 1.25 mycroft q = p->p_children.lh_first;
212 1.25 mycroft if (q) /* only need this if any child is S_ZOMB */
213 1.37 mycroft wakeup((caddr_t)initproc);
214 1.25 mycroft for (; q != 0; q = nq) {
215 1.25 mycroft nq = q->p_sibling.le_next;
216 1.27 mycroft proc_reparent(q, initproc);
217 1.24 cgd /*
218 1.24 cgd * Traced processes are killed
219 1.24 cgd * since their existence means someone is screwing up.
220 1.24 cgd */
221 1.24 cgd if (q->p_flag & P_TRACED) {
222 1.24 cgd q->p_flag &= ~P_TRACED;
223 1.24 cgd psignal(q, SIGKILL);
224 1.24 cgd }
225 1.24 cgd }
226 1.24 cgd
227 1.24 cgd /*
228 1.24 cgd * Save exit status and final rusage info, adding in child rusage
229 1.24 cgd * info and self times.
230 1.24 cgd */
231 1.24 cgd p->p_xstat = rv;
232 1.24 cgd *p->p_ru = p->p_stats->p_ru;
233 1.24 cgd calcru(p, &p->p_ru->ru_utime, &p->p_ru->ru_stime, NULL);
234 1.24 cgd ruadd(p->p_ru, &p->p_stats->p_cru);
235 1.24 cgd
236 1.24 cgd /*
237 1.24 cgd * Notify parent that we're gone.
238 1.24 cgd */
239 1.24 cgd psignal(p->p_pptr, SIGCHLD);
240 1.24 cgd wakeup((caddr_t)p->p_pptr);
241 1.24 cgd /*
242 1.24 cgd * Notify procfs debugger
243 1.24 cgd */
244 1.24 cgd if (p->p_flag & P_FSTRACE)
245 1.24 cgd wakeup((caddr_t)p);
246 1.24 cgd #if defined(tahoe)
247 1.24 cgd /* move this to cpu_exit */
248 1.24 cgd p->p_addr->u_pcb.pcb_savacc.faddr = (float *)NULL;
249 1.24 cgd #endif
250 1.24 cgd /*
251 1.24 cgd * Clear curproc after we've done all operations
252 1.24 cgd * that could block, and before tearing down the rest
253 1.24 cgd * of the process state that might be used from clock, etc.
254 1.24 cgd * Also, can't clear curproc while we're still runnable,
255 1.24 cgd * as we're not on a run queue (we are current, just not
256 1.24 cgd * a proper proc any longer!).
257 1.24 cgd *
258 1.24 cgd * Other substructures are freed from wait().
259 1.24 cgd */
260 1.24 cgd curproc = NULL;
261 1.36 christos if (--p->p_limit->p_refcnt == 0)
262 1.36 christos FREE(p->p_limit, M_SUBPROC);
263 1.24 cgd
264 1.24 cgd /*
265 1.24 cgd * Finally, call machine-dependent code to release the remaining
266 1.24 cgd * resources including address space, the kernel stack and pcb.
267 1.24 cgd * The address space is released by "vmspace_free(p->p_vmspace)";
268 1.24 cgd * This is machine-dependent, as we may have to change stacks
269 1.24 cgd * or ensure that the current one isn't reallocated before we
270 1.24 cgd * finish. cpu_exit will end with a call to cpu_swtch(), finishing
271 1.24 cgd * our execution (pun intended).
272 1.24 cgd */
273 1.24 cgd cpu_exit(p);
274 1.24 cgd }
275 1.24 cgd
276 1.24 cgd int
277 1.33 mycroft sys_wait4(q, v, retval)
278 1.24 cgd register struct proc *q;
279 1.31 thorpej void *v;
280 1.31 thorpej register_t *retval;
281 1.31 thorpej {
282 1.33 mycroft register struct sys_wait4_args /* {
283 1.26 cgd syscallarg(int) pid;
284 1.26 cgd syscallarg(int *) status;
285 1.26 cgd syscallarg(int) options;
286 1.26 cgd syscallarg(struct rusage *) rusage;
287 1.31 thorpej } */ *uap = v;
288 1.24 cgd register int nfound;
289 1.24 cgd register struct proc *p, *t;
290 1.24 cgd int status, error;
291 1.24 cgd
292 1.24 cgd #ifdef COMPAT_09
293 1.26 cgd SCARG(uap, pid) = (short)SCARG(uap, pid);
294 1.24 cgd #endif
295 1.24 cgd
296 1.26 cgd if (SCARG(uap, pid) == 0)
297 1.26 cgd SCARG(uap, pid) = -q->p_pgid;
298 1.24 cgd #ifdef notyet
299 1.26 cgd if (SCARG(uap, options) &~ (WUNTRACED|WNOHANG))
300 1.24 cgd return (EINVAL);
301 1.24 cgd #endif
302 1.24 cgd loop:
303 1.24 cgd nfound = 0;
304 1.25 mycroft for (p = q->p_children.lh_first; p != 0; p = p->p_sibling.le_next) {
305 1.26 cgd if (SCARG(uap, pid) != WAIT_ANY &&
306 1.26 cgd p->p_pid != SCARG(uap, pid) &&
307 1.26 cgd p->p_pgid != -SCARG(uap, pid))
308 1.24 cgd continue;
309 1.24 cgd nfound++;
310 1.24 cgd if (p->p_stat == SZOMB) {
311 1.24 cgd retval[0] = p->p_pid;
312 1.30 christos
313 1.26 cgd if (SCARG(uap, status)) {
314 1.24 cgd status = p->p_xstat; /* convert to int */
315 1.36 christos error = copyout((caddr_t)&status,
316 1.36 christos (caddr_t)SCARG(uap, status),
317 1.36 christos sizeof(status));
318 1.36 christos if (error)
319 1.24 cgd return (error);
320 1.24 cgd }
321 1.26 cgd if (SCARG(uap, rusage) &&
322 1.26 cgd (error = copyout((caddr_t)p->p_ru,
323 1.26 cgd (caddr_t)SCARG(uap, rusage),
324 1.26 cgd sizeof (struct rusage))))
325 1.24 cgd return (error);
326 1.24 cgd /*
327 1.24 cgd * If we got the child via a ptrace 'attach',
328 1.24 cgd * we need to give it back to the old parent.
329 1.24 cgd */
330 1.24 cgd if (p->p_oppid && (t = pfind(p->p_oppid))) {
331 1.24 cgd p->p_oppid = 0;
332 1.24 cgd proc_reparent(p, t);
333 1.24 cgd psignal(t, SIGCHLD);
334 1.24 cgd wakeup((caddr_t)t);
335 1.24 cgd return (0);
336 1.24 cgd }
337 1.24 cgd p->p_xstat = 0;
338 1.24 cgd ruadd(&q->p_stats->p_cru, p->p_ru);
339 1.24 cgd FREE(p->p_ru, M_ZOMBIE);
340 1.24 cgd
341 1.24 cgd /*
342 1.35 mycroft * Finally finished with old proc entry.
343 1.35 mycroft * Unlink it from its process group and free it.
344 1.35 mycroft */
345 1.35 mycroft leavepgrp(p);
346 1.35 mycroft LIST_REMOVE(p, p_list); /* off zombproc */
347 1.35 mycroft LIST_REMOVE(p, p_sibling);
348 1.35 mycroft
349 1.35 mycroft /*
350 1.24 cgd * Decrement the count of procs running with this uid.
351 1.24 cgd */
352 1.24 cgd (void)chgproccnt(p->p_cred->p_ruid, -1);
353 1.24 cgd
354 1.24 cgd /*
355 1.24 cgd * Free up credentials.
356 1.24 cgd */
357 1.24 cgd if (--p->p_cred->p_refcnt == 0) {
358 1.24 cgd crfree(p->p_cred->pc_ucred);
359 1.24 cgd FREE(p->p_cred, M_SUBPROC);
360 1.24 cgd }
361 1.24 cgd
362 1.24 cgd /*
363 1.24 cgd * Release reference to text vnode
364 1.24 cgd */
365 1.24 cgd if (p->p_textvp)
366 1.24 cgd vrele(p->p_textvp);
367 1.24 cgd
368 1.24 cgd /*
369 1.24 cgd * Give machine-dependent layer a chance
370 1.24 cgd * to free anything that cpu_exit couldn't
371 1.24 cgd * release while still running in process context.
372 1.24 cgd */
373 1.24 cgd cpu_wait(p);
374 1.24 cgd FREE(p, M_PROC);
375 1.24 cgd nprocs--;
376 1.24 cgd return (0);
377 1.24 cgd }
378 1.24 cgd if (p->p_stat == SSTOP && (p->p_flag & P_WAITED) == 0 &&
379 1.26 cgd (p->p_flag & P_TRACED || SCARG(uap, options) & WUNTRACED)) {
380 1.24 cgd p->p_flag |= P_WAITED;
381 1.24 cgd retval[0] = p->p_pid;
382 1.30 christos
383 1.26 cgd if (SCARG(uap, status)) {
384 1.24 cgd status = W_STOPCODE(p->p_xstat);
385 1.24 cgd error = copyout((caddr_t)&status,
386 1.26 cgd (caddr_t)SCARG(uap, status),
387 1.26 cgd sizeof(status));
388 1.24 cgd } else
389 1.24 cgd error = 0;
390 1.24 cgd return (error);
391 1.24 cgd }
392 1.24 cgd }
393 1.24 cgd if (nfound == 0)
394 1.24 cgd return (ECHILD);
395 1.26 cgd if (SCARG(uap, options) & WNOHANG) {
396 1.24 cgd retval[0] = 0;
397 1.24 cgd return (0);
398 1.24 cgd }
399 1.36 christos if ((error = tsleep((caddr_t)q, PWAIT | PCATCH, "wait", 0)) != 0)
400 1.24 cgd return (error);
401 1.24 cgd goto loop;
402 1.24 cgd }
403 1.24 cgd
404 1.24 cgd /*
405 1.24 cgd * make process 'parent' the new parent of process 'child'.
406 1.24 cgd */
407 1.24 cgd void
408 1.24 cgd proc_reparent(child, parent)
409 1.24 cgd register struct proc *child;
410 1.24 cgd register struct proc *parent;
411 1.24 cgd {
412 1.24 cgd
413 1.24 cgd if (child->p_pptr == parent)
414 1.24 cgd return;
415 1.24 cgd
416 1.25 mycroft LIST_REMOVE(child, p_sibling);
417 1.25 mycroft LIST_INSERT_HEAD(&parent->p_children, child, p_sibling);
418 1.24 cgd child->p_pptr = parent;
419 1.24 cgd }
420