xref: /csrg-svn/sys/kern/kern_exit.c (revision 40708)
1 /*
2  * Copyright (c) 1982, 1986, 1989 Regents of the University of California.
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms are permitted
6  * provided that the above copyright notice and this paragraph are
7  * duplicated in all such forms and that any documentation,
8  * advertising materials, and other materials related to such
9  * distribution and use acknowledge that the software was developed
10  * by the University of California, Berkeley.  The name of the
11  * University may not be used to endorse or promote products derived
12  * from this software without specific prior written permission.
13  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
14  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
15  * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
16  *
17  *	@(#)kern_exit.c	7.16 (Berkeley) 04/03/90
18  */
19 
20 #include "param.h"
21 #include "systm.h"
22 #include "map.h"
23 #include "user.h"
24 #include "kernel.h"
25 #include "proc.h"
26 #include "buf.h"
27 #include "wait.h"
28 #include "vm.h"
29 #include "file.h"
30 #include "vnode.h"
31 #include "ioctl.h"
32 #include "tty.h"
33 #include "syslog.h"
34 #include "malloc.h"
35 
36 #include "machine/reg.h"
37 #ifdef COMPAT_43
38 #include "machine/psl.h"
39 #endif
40 
41 /*
42  * Exit system call: pass back caller's arg
43  */
44 rexit()
45 {
46 	struct a {
47 		int	rval;
48 	} *uap;
49 
50 	uap = (struct a *)u.u_ap;
51 	exit(W_EXITCODE(uap->rval, 0));
52 }
53 
54 /*
55  * Release resources.
56  * Save u. area for parent to look at.
57  * Enter zombie state.
58  * Wake up parent and init processes,
59  * and dispose of children.
60  */
61 exit(rv)
62 	int rv;
63 {
64 	register int i;
65 	register struct proc *p, *q, *nq;
66 	register struct proc **pp;
67 
68 #ifdef PGINPROF
69 	vmsizmon();
70 #endif
71 	p = u.u_procp;
72 	MALLOC(p->p_ru, struct rusage *, sizeof(struct rusage),
73 		M_ZOMBIE, M_WAITOK);
74 	p->p_flag &= ~(STRC|SULOCK);
75 	p->p_flag |= SWEXIT;
76 	p->p_sigignore = ~0;
77 	p->p_sig = 0;
78 	p->p_cpticks = 0;
79 	p->p_pctcpu = 0;
80 	for (i = 0; i < NSIG; i++)
81 		u.u_signal[i] = SIG_IGN;
82 	untimeout(realitexpire, (caddr_t)p);
83 	/*
84 	 * Release virtual memory.  If we resulted from
85 	 * a vfork(), instead give the resources back to
86 	 * the parent.
87 	 */
88 	if ((p->p_flag & SVFORK) == 0)
89 		vrelvm();
90 	else {
91 		p->p_flag &= ~SVFORK;
92 		wakeup((caddr_t)p);
93 		while ((p->p_flag & SVFDONE) == 0)
94 			sleep((caddr_t)p, PZERO - 1);
95 		p->p_flag &= ~SVFDONE;
96 	}
97 	for (i = 0; i <= u.u_lastfile; i++) {
98 		struct file *f;
99 
100 		f = u.u_ofile[i];
101 		if (f) {
102 			u.u_ofile[i] = NULL;
103 			u.u_pofile[i] = 0;
104 			(void) closef(f);
105 		}
106 	}
107 	if (SESS_LEADER(p)) {
108 		p->p_session->s_leader = 0;
109 		if (p->p_session->s_ttyvp) {
110 			vgoneall(p->p_session->s_ttyvp);
111 			vrele(p->p_session->s_ttyvp);
112 			p->p_session->s_ttyvp = NULL;
113 			p->p_session->s_ttyp = NULL;
114 		}
115 	}
116 	VOP_LOCK(u.u_cdir);
117 	vput(u.u_cdir);
118 	if (u.u_rdir) {
119 		VOP_LOCK(u.u_rdir);
120 		vput(u.u_rdir);
121 	}
122 	u.u_rlimit[RLIMIT_FSIZE].rlim_cur = RLIM_INFINITY;
123 	acct();
124 #ifdef QUOTA
125 	qclean();
126 #endif
127 	crfree(u.u_cred);
128 #ifdef KTRACE
129 	/*
130 	 * release trace file
131 	 */
132 	if (p->p_tracep)
133 		vrele(p->p_tracep);
134 #endif
135 	/*
136 	/*
137 	 * Freeing the user structure and kernel stack
138 	 * for the current process: have to run a bit longer
139 	 * using the pages which are about to be freed...
140 	 * vrelu will block memory allocation by raising ipl.
141 	 */
142 	vrelu(u.u_procp, 0);
143 	vrelpt(u.u_procp);
144 	if (*p->p_prev = p->p_nxt)		/* off allproc queue */
145 		p->p_nxt->p_prev = p->p_prev;
146 	if (p->p_nxt = zombproc)		/* onto zombproc */
147 		p->p_nxt->p_prev = &p->p_nxt;
148 	p->p_prev = &zombproc;
149 	zombproc = p;
150 	multprog--;
151 	p->p_stat = SZOMB;
152 	noproc = 1;
153 	for (pp = &pidhash[PIDHASH(p->p_pid)]; *pp; pp = &(*pp)->p_hash)
154 		if (*pp == p) {
155 			*pp = p->p_hash;
156 			goto done;
157 		}
158 	panic("exit");
159 done:
160 	if (p->p_pid == 1) {
161 		if (p->p_dsize == 0) {
162 			printf("Can't exec init (errno %d)\n", WEXITSTATUS(rv));
163 			for (;;)
164 				;
165 		} else
166 			panic("init died");
167 	}
168 	p->p_xstat = rv;
169 	*p->p_ru = u.u_ru;
170 	ruadd(p->p_ru, &u.u_cru);
171 	if (p->p_cptr)		/* only need this if any child is S_ZOMB */
172 		wakeup((caddr_t)&proc[1]);
173 	if (PGRP_JOBC(p))
174 		p->p_pgrp->pg_jobc--;
175 	for (q = p->p_cptr; q != NULL; q = nq) {
176 		if (PGRP_JOBC(q))
177 			q->p_pgrp->pg_jobc--;
178 		nq = q->p_osptr;
179 		if (nq != NULL)
180 			nq->p_ysptr = NULL;
181 		if (proc[1].p_cptr)
182 			proc[1].p_cptr->p_ysptr = q;
183 		q->p_osptr = proc[1].p_cptr;
184 		q->p_ysptr = NULL;
185 		proc[1].p_cptr = q;
186 
187 		q->p_pptr = &proc[1];
188 		q->p_ppid = 1;
189 		/*
190 		 * Traced processes are killed
191 		 * since their existence means someone is screwing up.
192 		 * Stopped processes are sent a hangup and a continue.
193 		 * This is designed to be ``safe'' for setuid
194 		 * processes since they must be willing to tolerate
195 		 * hangups anyways.
196 		 */
197 		if (q->p_flag&STRC) {
198 			q->p_flag &= ~STRC;
199 			psignal(q, SIGKILL);
200 		} else if (q->p_stat == SSTOP) {
201 			psignal(q, SIGHUP);
202 			psignal(q, SIGCONT);
203 		}
204 		/*
205 		 * Protect this process from future
206 		 * tty signals, clear TSTP/TTIN/TTOU if pending.
207 		 */
208 		(void) spgrp(q);
209 	}
210 	p->p_cptr = NULL;
211 	psignal(p->p_pptr, SIGCHLD);
212 	wakeup((caddr_t)p->p_pptr);
213 #if defined(tahoe)
214 	dkeyrelease(p->p_dkey), p->p_dkey = 0;
215 	ckeyrelease(p->p_ckey), p->p_ckey = 0;
216 	u.u_pcb.pcb_savacc.faddr = (float *)NULL;
217 #endif
218 	swtch();
219 }
220 
221 #ifdef COMPAT_43
222 owait()
223 {
224 	register struct a {
225 		int	pid;
226 		int	*status;
227 		int	options;
228 		struct	rusage *rusage;
229 		int	compat;
230 	} *uap = (struct a *)u.u_ap;
231 
232 	if ((u.u_ar0[PS] & PSL_ALLCC) != PSL_ALLCC) {
233 		uap->options = 0;
234 		uap->rusage = 0;
235 	} else {
236 		uap->options = u.u_ar0[R0];
237 		uap->rusage = (struct rusage *)u.u_ar0[R1];
238 	}
239 	uap->pid = WAIT_ANY;
240 	uap->status = 0;
241 	uap->compat = 1;
242 	u.u_error = wait1();
243 }
244 
245 wait4()
246 {
247 	register struct a {
248 		int	pid;
249 		int	*status;
250 		int	options;
251 		struct	rusage *rusage;
252 		int	compat;
253 	} *uap = (struct a *)u.u_ap;
254 
255 	uap->compat = 0;
256 	u.u_error = wait1();
257 }
258 #else
259 #define	wait1	wait4
260 #endif
261 
262 /*
263  * Wait system call.
264  * Search for a terminated (zombie) child,
265  * finally lay it to rest, and collect its status.
266  * Look also for stopped (traced) children,
267  * and pass back status from them.
268  */
269 wait1()
270 {
271 	register struct a {
272 		int	pid;
273 		int	*status;
274 		int	options;
275 		struct	rusage *rusage;
276 #ifdef COMPAT_43
277 		int compat;
278 #endif
279 	} *uap = (struct a *)u.u_ap;
280 	register f;
281 	register struct proc *p, *q;
282 	int status, error;
283 
284 	q = u.u_procp;
285 	if (uap->pid == 0)
286 		uap->pid = -q->p_pgid;
287 #ifdef notyet
288 	if (uap->options &~ (WUNTRACED|WNOHANG))
289 		return (EINVAL);
290 #endif
291 loop:
292 	f = 0;
293 	for (p = q->p_cptr; p; p = p->p_osptr) {
294 		if (uap->pid != WAIT_ANY &&
295 		    p->p_pid != uap->pid && p->p_pgid != -uap->pid)
296 			continue;
297 		f++;
298 		if (p->p_stat == SZOMB) {
299 			u.u_r.r_val1 = p->p_pid;
300 #ifdef COMPAT_43
301 			if (uap->compat)
302 				u.u_r.r_val2 = p->p_xstat;
303 			else
304 #endif
305 			if (uap->status) {
306 				status = p->p_xstat;	/* convert to int */
307 				if (error = copyout((caddr_t)&status,
308 				    (caddr_t)uap->status, sizeof(status)))
309 					return (error);
310 			}
311 			if (uap->rusage && (error = copyout((caddr_t)p->p_ru,
312 			    (caddr_t)uap->rusage, sizeof (struct rusage))))
313 				return (error);
314 			pgrm(p);			/* off pgrp */
315 			p->p_xstat = 0;
316 			ruadd(&u.u_cru, p->p_ru);
317 			FREE(p->p_ru, M_ZOMBIE);
318 			p->p_ru = 0;
319 			p->p_stat = NULL;
320 			p->p_pid = 0;
321 			p->p_ppid = 0;
322 			if (*p->p_prev = p->p_nxt)	/* off zombproc */
323 				p->p_nxt->p_prev = p->p_prev;
324 			p->p_nxt = freeproc;		/* onto freeproc */
325 			freeproc = p;
326 			if (q = p->p_ysptr)
327 				q->p_osptr = p->p_osptr;
328 			if (q = p->p_osptr)
329 				q->p_ysptr = p->p_ysptr;
330 			if ((q = p->p_pptr)->p_cptr == p)
331 				q->p_cptr = p->p_osptr;
332 			p->p_pptr = 0;
333 			p->p_ysptr = 0;
334 			p->p_osptr = 0;
335 			p->p_cptr = 0;
336 			p->p_sig = 0;
337 			p->p_sigcatch = 0;
338 			p->p_sigignore = 0;
339 			p->p_sigmask = 0;
340 			/*p->p_pgrp = 0;*/
341 			p->p_flag = 0;
342 			p->p_wchan = 0;
343 			p->p_cursig = 0;
344 			return (0);
345 		}
346 		if (p->p_stat == SSTOP && (p->p_flag & SWTED) == 0 &&
347 		    (p->p_flag & STRC || uap->options & WUNTRACED)) {
348 			p->p_flag |= SWTED;
349 			u.u_r.r_val1 = p->p_pid;
350 #ifdef COMPAT_43
351 			if (uap->compat) {
352 				u.u_r.r_val2 = W_STOPCODE(p->p_cursig);
353 				error = 0;
354 			} else
355 #endif
356 			if (uap->status) {
357 				status = W_STOPCODE(p->p_cursig);
358 				error = copyout((caddr_t)&status,
359 				    (caddr_t)uap->status, sizeof(status));
360 			} else
361 				error = 0;
362 			return (error);
363 		}
364 	}
365 	if (f == 0)
366 		return (ECHILD);
367 	if (uap->options & WNOHANG) {
368 		u.u_r.r_val1 = 0;
369 		return (0);
370 	}
371 	if (error = tsleep((caddr_t)u.u_procp, PWAIT | PCATCH, "wait", 0))
372 		return (error);
373 	goto loop;
374 }
375