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