|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * This code is derived from software contributed to Berkeley by ! 6: * Edward Wang at The University of California, Berkeley. ! 7: * ! 8: * Redistribution and use in source and binary forms are permitted provided ! 9: * that: (1) source distributions retain this entire copyright notice and ! 10: * comment, and (2) distributions including binaries display the following ! 11: * acknowledgement: ``This product includes software developed by the ! 12: * University of California, Berkeley and its contributors'' in the ! 13: * documentation or other materials provided with the distribution and in ! 14: * all advertising materials mentioning features or use of this software. ! 15: * Neither the name of the University nor the names of its contributors may ! 16: * be used to endorse or promote products derived from this software without ! 17: * specific prior written permission. ! 18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 19: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 20: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 21: */ ! 22: ! 23: #ifndef lint ! 24: static char sccsid[] = "@(#)wwchild.c 3.12 (Berkeley) 6/6/90"; ! 25: #endif /* not lint */ ! 26: ! 27: #include "ww.h" ! 28: #include <sys/wait.h> ! 29: ! 30: wwchild() ! 31: { ! 32: extern errno; ! 33: int olderrno; ! 34: register struct ww **wp; ! 35: union wait w; ! 36: int pid; ! 37: char collected = 0; ! 38: ! 39: olderrno = errno; ! 40: while ((pid = wait3(&w, WNOHANG|WUNTRACED, (struct rusage *)0)) > 0) { ! 41: for (wp = wwindex; wp < &wwindex[NWW]; wp++) { ! 42: if (*wp && (*wp)->ww_state == WWS_HASPROC ! 43: && (*wp)->ww_pid == pid) { ! 44: (*wp)->ww_state = WWS_DEAD; ! 45: collected = 1; ! 46: break; ! 47: } ! 48: } ! 49: } ! 50: errno = olderrno; ! 51: /* jump out of wwiomux when somebody dies */ ! 52: if (collected) ! 53: wwsetintr(); ! 54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.