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.13 (Berkeley) 12/19/89 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 int x; 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 i = PIDHASH(p->p_pid); 154 x = p - proc; 155 if (pidhash[i] == x) 156 pidhash[i] = p->p_idhash; 157 else { 158 for (i = pidhash[i]; i != 0; i = proc[i].p_idhash) 159 if (proc[i].p_idhash == x) { 160 proc[i].p_idhash = p->p_idhash; 161 goto done; 162 } 163 panic("exit"); 164 } 165 if (p->p_pid == 1) { 166 if (p->p_dsize == 0) { 167 printf("Can't exec init (errno %d)\n", WEXITSTATUS(rv)); 168 for (;;) 169 ; 170 } else 171 panic("init died"); 172 } 173 done: 174 p->p_xstat = rv; 175 *p->p_ru = u.u_ru; 176 ruadd(p->p_ru, &u.u_cru); 177 if (p->p_cptr) /* only need this if any child is S_ZOMB */ 178 wakeup((caddr_t)&proc[1]); 179 if (PGRP_JOBC(p)) 180 p->p_pgrp->pg_jobc--; 181 for (q = p->p_cptr; q != NULL; q = nq) { 182 if (PGRP_JOBC(q)) 183 q->p_pgrp->pg_jobc--; 184 nq = q->p_osptr; 185 if (nq != NULL) 186 nq->p_ysptr = NULL; 187 if (proc[1].p_cptr) 188 proc[1].p_cptr->p_ysptr = q; 189 q->p_osptr = proc[1].p_cptr; 190 q->p_ysptr = NULL; 191 proc[1].p_cptr = q; 192 193 q->p_pptr = &proc[1]; 194 q->p_ppid = 1; 195 /* 196 * Traced processes are killed 197 * since their existence means someone is screwing up. 198 * Stopped processes are sent a hangup and a continue. 199 * This is designed to be ``safe'' for setuid 200 * processes since they must be willing to tolerate 201 * hangups anyways. 202 */ 203 if (q->p_flag&STRC) { 204 q->p_flag &= ~STRC; 205 psignal(q, SIGKILL); 206 } else if (q->p_stat == SSTOP) { 207 psignal(q, SIGHUP); 208 psignal(q, SIGCONT); 209 } 210 /* 211 * Protect this process from future 212 * tty signals, clear TSTP/TTIN/TTOU if pending. 213 */ 214 (void) spgrp(q); 215 } 216 p->p_cptr = NULL; 217 psignal(p->p_pptr, SIGCHLD); 218 wakeup((caddr_t)p->p_pptr); 219 #if defined(tahoe) 220 dkeyrelease(p->p_dkey), p->p_dkey = 0; 221 ckeyrelease(p->p_ckey), p->p_ckey = 0; 222 u.u_pcb.pcb_savacc.faddr = (float *)NULL; 223 #endif 224 swtch(); 225 } 226 227 #ifdef COMPAT_43 228 owait() 229 { 230 register struct a { 231 int pid; 232 int *status; 233 int options; 234 struct rusage *rusage; 235 int compat; 236 } *uap = (struct a *)u.u_ap; 237 238 if ((u.u_ar0[PS] & PSL_ALLCC) != PSL_ALLCC) { 239 uap->options = 0; 240 uap->rusage = 0; 241 } else { 242 uap->options = u.u_ar0[R0]; 243 uap->rusage = (struct rusage *)u.u_ar0[R1]; 244 } 245 uap->pid = WAIT_ANY; 246 uap->status = 0; 247 uap->compat = 1; 248 u.u_error = wait1(); 249 } 250 251 wait4() 252 { 253 register struct a { 254 int pid; 255 int *status; 256 int options; 257 struct rusage *rusage; 258 int compat; 259 } *uap = (struct a *)u.u_ap; 260 261 uap->compat = 0; 262 u.u_error = wait1(); 263 } 264 #else 265 #define wait1 wait4 266 #endif 267 268 /* 269 * Wait system call. 270 * Search for a terminated (zombie) child, 271 * finally lay it to rest, and collect its status. 272 * Look also for stopped (traced) children, 273 * and pass back status from them. 274 */ 275 wait1() 276 { 277 register struct a { 278 int pid; 279 int *status; 280 int options; 281 struct rusage *rusage; 282 #ifdef COMPAT_43 283 int compat; 284 #endif 285 } *uap = (struct a *)u.u_ap; 286 register f; 287 register struct proc *p, *q; 288 int status, error; 289 290 q = u.u_procp; 291 if (uap->pid == 0) 292 uap->pid = -q->p_pgid; 293 #ifdef notyet 294 if (uap->options &~ (WUNTRACED|WNOHANG)) 295 return (EINVAL); 296 #endif 297 loop: 298 f = 0; 299 for (p = q->p_cptr; p; p = p->p_osptr) { 300 if (uap->pid != WAIT_ANY && 301 p->p_pid != uap->pid && p->p_pgid != -uap->pid) 302 continue; 303 f++; 304 if (p->p_stat == SZOMB) { 305 u.u_r.r_val1 = p->p_pid; 306 #ifdef COMPAT_43 307 if (uap->compat) 308 u.u_r.r_val2 = p->p_xstat; 309 else 310 #endif 311 if (uap->status) { 312 status = p->p_xstat; /* convert to int */ 313 if (error = copyout((caddr_t)&status, 314 (caddr_t)uap->status, sizeof(status))) 315 return (error); 316 } 317 if (uap->rusage && (error = copyout((caddr_t)p->p_ru, 318 (caddr_t)uap->rusage, sizeof (struct rusage)))) 319 return (error); 320 pgrm(p); /* off pgrp */ 321 p->p_xstat = 0; 322 ruadd(&u.u_cru, p->p_ru); 323 FREE(p->p_ru, M_ZOMBIE); 324 p->p_ru = 0; 325 p->p_stat = NULL; 326 p->p_pid = 0; 327 p->p_ppid = 0; 328 if (*p->p_prev = p->p_nxt) /* off zombproc */ 329 p->p_nxt->p_prev = p->p_prev; 330 p->p_nxt = freeproc; /* onto freeproc */ 331 freeproc = p; 332 if (q = p->p_ysptr) 333 q->p_osptr = p->p_osptr; 334 if (q = p->p_osptr) 335 q->p_ysptr = p->p_ysptr; 336 if ((q = p->p_pptr)->p_cptr == p) 337 q->p_cptr = p->p_osptr; 338 p->p_pptr = 0; 339 p->p_ysptr = 0; 340 p->p_osptr = 0; 341 p->p_cptr = 0; 342 p->p_sig = 0; 343 p->p_sigcatch = 0; 344 p->p_sigignore = 0; 345 p->p_sigmask = 0; 346 /*p->p_pgrp = 0;*/ 347 p->p_flag = 0; 348 p->p_wchan = 0; 349 p->p_cursig = 0; 350 return (0); 351 } 352 if (p->p_stat == SSTOP && (p->p_flag & SWTED) == 0 && 353 (p->p_flag & STRC || uap->options & WUNTRACED)) { 354 p->p_flag |= SWTED; 355 u.u_r.r_val1 = p->p_pid; 356 #ifdef COMPAT_43 357 if (uap->compat) { 358 u.u_r.r_val2 = W_STOPCODE(p->p_cursig); 359 error = 0; 360 } else 361 #endif 362 if (uap->status) { 363 status = W_STOPCODE(p->p_cursig); 364 error = copyout((caddr_t)&status, 365 (caddr_t)uap->status, sizeof(status)); 366 } else 367 error = 0; 368 return (error); 369 } 370 } 371 if (f == 0) 372 return (ECHILD); 373 if (uap->options & WNOHANG) { 374 u.u_r.r_val1 = 0; 375 return (0); 376 } 377 if (setjmp(&u.u_qsave)) { 378 p = u.u_procp; 379 if ((u.u_sigintr & sigmask(p->p_cursig)) != 0) 380 return (EINTR); 381 u.u_eosys = RESTARTSYS; 382 return (0); 383 } 384 sleep((caddr_t)u.u_procp, PWAIT); 385 goto loop; 386 } 387