Home | History | Annotate | Line # | Download | only in kern
kern_proc.c revision 1.28
      1  1.28   thorpej /*	$NetBSD: kern_proc.c,v 1.28 1998/08/31 23:20:16 thorpej Exp $	*/
      2   1.9       cgd 
      3   1.1       cgd /*
      4   1.7       cgd  * Copyright (c) 1982, 1986, 1989, 1991, 1993
      5   1.7       cgd  *	The Regents of the University of California.  All rights reserved.
      6   1.1       cgd  *
      7   1.1       cgd  * Redistribution and use in source and binary forms, with or without
      8   1.1       cgd  * modification, are permitted provided that the following conditions
      9   1.1       cgd  * are met:
     10   1.1       cgd  * 1. Redistributions of source code must retain the above copyright
     11   1.1       cgd  *    notice, this list of conditions and the following disclaimer.
     12   1.1       cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13   1.1       cgd  *    notice, this list of conditions and the following disclaimer in the
     14   1.1       cgd  *    documentation and/or other materials provided with the distribution.
     15   1.1       cgd  * 3. All advertising materials mentioning features or use of this software
     16   1.1       cgd  *    must display the following acknowledgement:
     17   1.1       cgd  *	This product includes software developed by the University of
     18   1.1       cgd  *	California, Berkeley and its contributors.
     19   1.1       cgd  * 4. Neither the name of the University nor the names of its contributors
     20   1.1       cgd  *    may be used to endorse or promote products derived from this software
     21   1.1       cgd  *    without specific prior written permission.
     22   1.1       cgd  *
     23   1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24   1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25   1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26   1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27   1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28   1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29   1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30   1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31   1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32   1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33   1.1       cgd  * SUCH DAMAGE.
     34   1.1       cgd  *
     35  1.23      fvdl  *	@(#)kern_proc.c	8.7 (Berkeley) 2/14/95
     36   1.1       cgd  */
     37   1.1       cgd 
     38   1.5   mycroft #include <sys/param.h>
     39   1.5   mycroft #include <sys/systm.h>
     40   1.7       cgd #include <sys/map.h>
     41   1.5   mycroft #include <sys/kernel.h>
     42   1.5   mycroft #include <sys/proc.h>
     43  1.28   thorpej #include <sys/resourcevar.h>
     44   1.5   mycroft #include <sys/buf.h>
     45   1.5   mycroft #include <sys/acct.h>
     46   1.5   mycroft #include <sys/wait.h>
     47   1.5   mycroft #include <sys/file.h>
     48   1.8   mycroft #include <ufs/ufs/quota.h>
     49   1.5   mycroft #include <sys/uio.h>
     50   1.5   mycroft #include <sys/malloc.h>
     51  1.24   thorpej #include <sys/pool.h>
     52   1.5   mycroft #include <sys/mbuf.h>
     53   1.5   mycroft #include <sys/ioctl.h>
     54   1.5   mycroft #include <sys/tty.h>
     55  1.11       cgd #include <sys/signalvar.h>
     56   1.5   mycroft 
     57   1.7       cgd /*
     58   1.7       cgd  * Structure associated with user cacheing.
     59   1.7       cgd  */
     60   1.7       cgd struct uidinfo {
     61  1.10   mycroft 	LIST_ENTRY(uidinfo) ui_hash;
     62   1.7       cgd 	uid_t	ui_uid;
     63   1.7       cgd 	long	ui_proccnt;
     64  1.10   mycroft };
     65  1.10   mycroft #define	UIHASH(uid)	(&uihashtbl[(uid) & uihash])
     66  1.10   mycroft LIST_HEAD(uihashhead, uidinfo) *uihashtbl;
     67  1.10   mycroft u_long uihash;		/* size of hash table - 1 */
     68   1.7       cgd 
     69   1.7       cgd /*
     70  1.10   mycroft  * Other process lists
     71   1.7       cgd  */
     72  1.10   mycroft struct pidhashhead *pidhashtbl;
     73  1.10   mycroft u_long pidhash;
     74  1.10   mycroft struct pgrphashhead *pgrphashtbl;
     75  1.10   mycroft u_long pgrphash;
     76  1.10   mycroft struct proclist allproc;
     77  1.10   mycroft struct proclist zombproc;
     78  1.24   thorpej struct pool proc_pool;
     79  1.28   thorpej struct pool pcred_pool;
     80  1.28   thorpej struct pool plimit_pool;
     81  1.10   mycroft 
     82  1.13  christos static void orphanpg __P((struct pgrp *));
     83  1.14  christos #ifdef DEBUG
     84  1.14  christos void pgrpdump __P((void));
     85  1.14  christos #endif
     86  1.13  christos 
     87  1.10   mycroft /*
     88  1.10   mycroft  * Initialize global process hashing structures.
     89  1.10   mycroft  */
     90  1.11       cgd void
     91  1.10   mycroft procinit()
     92   1.7       cgd {
     93   1.7       cgd 
     94  1.10   mycroft 	LIST_INIT(&allproc);
     95  1.10   mycroft 	LIST_INIT(&zombproc);
     96  1.20       chs 	pidhashtbl = hashinit(maxproc / 4, M_PROC, M_WAITOK, &pidhash);
     97  1.20       chs 	pgrphashtbl = hashinit(maxproc / 4, M_PROC, M_WAITOK, &pgrphash);
     98  1.20       chs 	uihashtbl = hashinit(maxproc / 16, M_PROC, M_WAITOK, &uihash);
     99  1.24   thorpej 	pool_init(&proc_pool, sizeof(struct proc), 0, 0, 0, "procpl",
    100  1.27   thorpej 	    0, pool_page_alloc_nointr, pool_page_free_nointr, M_PROC);
    101  1.28   thorpej 	pool_init(&pcred_pool, sizeof(struct pcred), 0, 0, 0, "pcredpl",
    102  1.28   thorpej 	    0, pool_page_alloc_nointr, pool_page_free_nointr, M_SUBPROC);
    103  1.28   thorpej 	pool_init(&plimit_pool, sizeof(struct plimit), 0, 0, 0, "plimitpl",
    104  1.28   thorpej 	    0, pool_page_alloc_nointr, pool_page_free_nointr, M_SUBPROC);
    105   1.7       cgd }
    106   1.1       cgd 
    107   1.7       cgd /*
    108   1.7       cgd  * Change the count associated with number of processes
    109   1.7       cgd  * a given user is using.
    110   1.7       cgd  */
    111   1.7       cgd int
    112   1.7       cgd chgproccnt(uid, diff)
    113   1.7       cgd 	uid_t	uid;
    114   1.7       cgd 	int	diff;
    115   1.7       cgd {
    116  1.10   mycroft 	register struct uidinfo *uip;
    117  1.10   mycroft 	register struct uihashhead *uipp;
    118   1.7       cgd 
    119  1.10   mycroft 	uipp = UIHASH(uid);
    120  1.10   mycroft 	for (uip = uipp->lh_first; uip != 0; uip = uip->ui_hash.le_next)
    121   1.7       cgd 		if (uip->ui_uid == uid)
    122   1.7       cgd 			break;
    123   1.7       cgd 	if (uip) {
    124   1.7       cgd 		uip->ui_proccnt += diff;
    125   1.7       cgd 		if (uip->ui_proccnt > 0)
    126   1.7       cgd 			return (uip->ui_proccnt);
    127   1.7       cgd 		if (uip->ui_proccnt < 0)
    128   1.7       cgd 			panic("chgproccnt: procs < 0");
    129  1.10   mycroft 		LIST_REMOVE(uip, ui_hash);
    130   1.7       cgd 		FREE(uip, M_PROC);
    131   1.7       cgd 		return (0);
    132   1.7       cgd 	}
    133   1.7       cgd 	if (diff <= 0) {
    134   1.7       cgd 		if (diff == 0)
    135   1.7       cgd 			return(0);
    136   1.7       cgd 		panic("chgproccnt: lost user");
    137   1.7       cgd 	}
    138   1.7       cgd 	MALLOC(uip, struct uidinfo *, sizeof(*uip), M_PROC, M_WAITOK);
    139  1.10   mycroft 	LIST_INSERT_HEAD(uipp, uip, ui_hash);
    140   1.7       cgd 	uip->ui_uid = uid;
    141   1.7       cgd 	uip->ui_proccnt = diff;
    142   1.7       cgd 	return (diff);
    143   1.7       cgd }
    144   1.4    andrew 
    145   1.1       cgd /*
    146   1.1       cgd  * Is p an inferior of the current process?
    147   1.1       cgd  */
    148  1.11       cgd int
    149   1.1       cgd inferior(p)
    150   1.1       cgd 	register struct proc *p;
    151   1.1       cgd {
    152   1.1       cgd 
    153   1.1       cgd 	for (; p != curproc; p = p->p_pptr)
    154   1.1       cgd 		if (p->p_pid == 0)
    155   1.1       cgd 			return (0);
    156   1.1       cgd 	return (1);
    157   1.1       cgd }
    158   1.1       cgd 
    159   1.1       cgd /*
    160   1.1       cgd  * Locate a process by number
    161   1.1       cgd  */
    162   1.1       cgd struct proc *
    163   1.1       cgd pfind(pid)
    164   1.6       cgd 	register pid_t pid;
    165   1.1       cgd {
    166   1.7       cgd 	register struct proc *p;
    167   1.1       cgd 
    168  1.10   mycroft 	for (p = PIDHASH(pid)->lh_first; p != 0; p = p->p_hash.le_next)
    169   1.1       cgd 		if (p->p_pid == pid)
    170   1.1       cgd 			return (p);
    171   1.7       cgd 	return (NULL);
    172   1.1       cgd }
    173   1.1       cgd 
    174   1.1       cgd /*
    175   1.1       cgd  * Locate a process group by number
    176   1.1       cgd  */
    177   1.1       cgd struct pgrp *
    178   1.1       cgd pgfind(pgid)
    179   1.1       cgd 	register pid_t pgid;
    180   1.1       cgd {
    181   1.7       cgd 	register struct pgrp *pgrp;
    182   1.1       cgd 
    183  1.10   mycroft 	for (pgrp = PGRPHASH(pgid)->lh_first; pgrp != 0; pgrp = pgrp->pg_hash.le_next)
    184   1.1       cgd 		if (pgrp->pg_id == pgid)
    185   1.1       cgd 			return (pgrp);
    186   1.7       cgd 	return (NULL);
    187   1.1       cgd }
    188   1.1       cgd 
    189   1.1       cgd /*
    190   1.1       cgd  * Move p to a new or existing process group (and session)
    191   1.1       cgd  */
    192  1.11       cgd int
    193   1.1       cgd enterpgrp(p, pgid, mksess)
    194   1.1       cgd 	register struct proc *p;
    195   1.1       cgd 	pid_t pgid;
    196   1.4    andrew 	int mksess;
    197   1.1       cgd {
    198   1.1       cgd 	register struct pgrp *pgrp = pgfind(pgid);
    199   1.1       cgd 
    200   1.1       cgd #ifdef DIAGNOSTIC
    201   1.7       cgd 	if (pgrp != NULL && mksess)	/* firewalls */
    202   1.1       cgd 		panic("enterpgrp: setsid into non-empty pgrp");
    203   1.1       cgd 	if (SESS_LEADER(p))
    204   1.1       cgd 		panic("enterpgrp: session leader attempted setpgrp");
    205   1.1       cgd #endif
    206   1.1       cgd 	if (pgrp == NULL) {
    207   1.7       cgd 		pid_t savepid = p->p_pid;
    208   1.7       cgd 		struct proc *np;
    209   1.1       cgd 		/*
    210   1.1       cgd 		 * new process group
    211   1.1       cgd 		 */
    212   1.1       cgd #ifdef DIAGNOSTIC
    213   1.1       cgd 		if (p->p_pid != pgid)
    214   1.1       cgd 			panic("enterpgrp: new pgrp and pid != pgid");
    215   1.1       cgd #endif
    216   1.1       cgd 		MALLOC(pgrp, struct pgrp *, sizeof(struct pgrp), M_PGRP,
    217  1.10   mycroft 		    M_WAITOK);
    218   1.7       cgd 		if ((np = pfind(savepid)) == NULL || np != p)
    219   1.7       cgd 			return (ESRCH);
    220   1.1       cgd 		if (mksess) {
    221   1.1       cgd 			register struct session *sess;
    222   1.1       cgd 
    223   1.1       cgd 			/*
    224   1.1       cgd 			 * new session
    225   1.1       cgd 			 */
    226   1.1       cgd 			MALLOC(sess, struct session *, sizeof(struct session),
    227  1.10   mycroft 			    M_SESSION, M_WAITOK);
    228  1.21   thorpej 			sess->s_sid = p->p_pid;
    229   1.1       cgd 			sess->s_leader = p;
    230   1.1       cgd 			sess->s_count = 1;
    231   1.1       cgd 			sess->s_ttyvp = NULL;
    232   1.1       cgd 			sess->s_ttyp = NULL;
    233  1.25     perry 			memcpy(sess->s_login, p->p_session->s_login,
    234   1.1       cgd 			    sizeof(sess->s_login));
    235   1.6       cgd 			p->p_flag &= ~P_CONTROLT;
    236   1.1       cgd 			pgrp->pg_session = sess;
    237   1.1       cgd #ifdef DIAGNOSTIC
    238   1.1       cgd 			if (p != curproc)
    239   1.1       cgd 				panic("enterpgrp: mksession and p != curproc");
    240   1.1       cgd #endif
    241   1.1       cgd 		} else {
    242   1.1       cgd 			pgrp->pg_session = p->p_session;
    243   1.1       cgd 			pgrp->pg_session->s_count++;
    244   1.1       cgd 		}
    245   1.1       cgd 		pgrp->pg_id = pgid;
    246  1.10   mycroft 		LIST_INIT(&pgrp->pg_members);
    247  1.10   mycroft 		LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
    248   1.1       cgd 		pgrp->pg_jobc = 0;
    249   1.1       cgd 	} else if (pgrp == p->p_pgrp)
    250   1.7       cgd 		return (0);
    251   1.1       cgd 
    252   1.1       cgd 	/*
    253   1.1       cgd 	 * Adjust eligibility of affected pgrps to participate in job control.
    254   1.1       cgd 	 * Increment eligibility counts before decrementing, otherwise we
    255   1.1       cgd 	 * could reach 0 spuriously during the first call.
    256   1.1       cgd 	 */
    257   1.1       cgd 	fixjobc(p, pgrp, 1);
    258   1.1       cgd 	fixjobc(p, p->p_pgrp, 0);
    259   1.1       cgd 
    260  1.10   mycroft 	LIST_REMOVE(p, p_pglist);
    261  1.10   mycroft 	if (p->p_pgrp->pg_members.lh_first == 0)
    262   1.1       cgd 		pgdelete(p->p_pgrp);
    263   1.1       cgd 	p->p_pgrp = pgrp;
    264  1.10   mycroft 	LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
    265   1.7       cgd 	return (0);
    266   1.1       cgd }
    267   1.1       cgd 
    268   1.1       cgd /*
    269   1.1       cgd  * remove process from process group
    270   1.1       cgd  */
    271  1.11       cgd int
    272   1.1       cgd leavepgrp(p)
    273   1.1       cgd 	register struct proc *p;
    274   1.1       cgd {
    275   1.1       cgd 
    276  1.10   mycroft 	LIST_REMOVE(p, p_pglist);
    277  1.10   mycroft 	if (p->p_pgrp->pg_members.lh_first == 0)
    278   1.1       cgd 		pgdelete(p->p_pgrp);
    279   1.1       cgd 	p->p_pgrp = 0;
    280   1.7       cgd 	return (0);
    281   1.1       cgd }
    282   1.1       cgd 
    283   1.1       cgd /*
    284   1.7       cgd  * delete a process group
    285   1.1       cgd  */
    286  1.11       cgd void
    287   1.1       cgd pgdelete(pgrp)
    288   1.1       cgd 	register struct pgrp *pgrp;
    289   1.1       cgd {
    290   1.1       cgd 
    291   1.1       cgd 	if (pgrp->pg_session->s_ttyp != NULL &&
    292   1.1       cgd 	    pgrp->pg_session->s_ttyp->t_pgrp == pgrp)
    293   1.1       cgd 		pgrp->pg_session->s_ttyp->t_pgrp = NULL;
    294  1.10   mycroft 	LIST_REMOVE(pgrp, pg_hash);
    295   1.1       cgd 	if (--pgrp->pg_session->s_count == 0)
    296   1.1       cgd 		FREE(pgrp->pg_session, M_SESSION);
    297   1.1       cgd 	FREE(pgrp, M_PGRP);
    298   1.1       cgd }
    299   1.1       cgd 
    300   1.1       cgd /*
    301   1.1       cgd  * Adjust pgrp jobc counters when specified process changes process group.
    302   1.1       cgd  * We count the number of processes in each process group that "qualify"
    303   1.1       cgd  * the group for terminal job control (those with a parent in a different
    304   1.1       cgd  * process group of the same session).  If that count reaches zero, the
    305   1.1       cgd  * process group becomes orphaned.  Check both the specified process'
    306   1.1       cgd  * process group and that of its children.
    307   1.1       cgd  * entering == 0 => p is leaving specified group.
    308   1.1       cgd  * entering == 1 => p is entering specified group.
    309   1.1       cgd  */
    310   1.4    andrew void
    311   1.1       cgd fixjobc(p, pgrp, entering)
    312   1.1       cgd 	register struct proc *p;
    313   1.1       cgd 	register struct pgrp *pgrp;
    314   1.1       cgd 	int entering;
    315   1.1       cgd {
    316   1.1       cgd 	register struct pgrp *hispgrp;
    317   1.1       cgd 	register struct session *mysession = pgrp->pg_session;
    318   1.1       cgd 
    319   1.1       cgd 	/*
    320   1.1       cgd 	 * Check p's parent to see whether p qualifies its own process
    321   1.1       cgd 	 * group; if so, adjust count for p's process group.
    322   1.1       cgd 	 */
    323   1.1       cgd 	if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
    324  1.26   thorpej 	    hispgrp->pg_session == mysession) {
    325   1.1       cgd 		if (entering)
    326   1.1       cgd 			pgrp->pg_jobc++;
    327   1.1       cgd 		else if (--pgrp->pg_jobc == 0)
    328   1.1       cgd 			orphanpg(pgrp);
    329  1.26   thorpej 	}
    330   1.1       cgd 
    331   1.1       cgd 	/*
    332   1.1       cgd 	 * Check this process' children to see whether they qualify
    333   1.1       cgd 	 * their process groups; if so, adjust counts for children's
    334   1.1       cgd 	 * process groups.
    335   1.1       cgd 	 */
    336  1.26   thorpej 	for (p = p->p_children.lh_first; p != 0; p = p->p_sibling.le_next) {
    337   1.1       cgd 		if ((hispgrp = p->p_pgrp) != pgrp &&
    338   1.1       cgd 		    hispgrp->pg_session == mysession &&
    339  1.26   thorpej 		    p->p_stat != SZOMB) {
    340   1.1       cgd 			if (entering)
    341   1.1       cgd 				hispgrp->pg_jobc++;
    342   1.1       cgd 			else if (--hispgrp->pg_jobc == 0)
    343   1.1       cgd 				orphanpg(hispgrp);
    344  1.26   thorpej 		}
    345  1.26   thorpej 	}
    346   1.1       cgd }
    347   1.1       cgd 
    348   1.1       cgd /*
    349   1.1       cgd  * A process group has become orphaned;
    350   1.1       cgd  * if there are any stopped processes in the group,
    351   1.1       cgd  * hang-up all process in that group.
    352   1.1       cgd  */
    353   1.4    andrew static void
    354   1.1       cgd orphanpg(pg)
    355   1.1       cgd 	struct pgrp *pg;
    356   1.1       cgd {
    357   1.1       cgd 	register struct proc *p;
    358   1.1       cgd 
    359  1.10   mycroft 	for (p = pg->pg_members.lh_first; p != 0; p = p->p_pglist.le_next) {
    360   1.1       cgd 		if (p->p_stat == SSTOP) {
    361  1.10   mycroft 			for (p = pg->pg_members.lh_first; p != 0;
    362  1.10   mycroft 			    p = p->p_pglist.le_next) {
    363   1.1       cgd 				psignal(p, SIGHUP);
    364   1.1       cgd 				psignal(p, SIGCONT);
    365   1.1       cgd 			}
    366   1.1       cgd 			return;
    367   1.1       cgd 		}
    368   1.1       cgd 	}
    369   1.1       cgd }
    370   1.1       cgd 
    371  1.10   mycroft #ifdef DEBUG
    372  1.14  christos void
    373   1.1       cgd pgrpdump()
    374   1.1       cgd {
    375   1.1       cgd 	register struct pgrp *pgrp;
    376   1.1       cgd 	register struct proc *p;
    377  1.22    kleink 	register int i;
    378   1.1       cgd 
    379  1.10   mycroft 	for (i = 0; i <= pgrphash; i++) {
    380  1.14  christos 		if ((pgrp = pgrphashtbl[i].lh_first) != NULL) {
    381  1.16  christos 			printf("\tindx %d\n", i);
    382  1.10   mycroft 			for (; pgrp != 0; pgrp = pgrp->pg_hash.le_next) {
    383  1.16  christos 				printf("\tpgrp %p, pgid %d, sess %p, sesscnt %d, mem %p\n",
    384  1.10   mycroft 				    pgrp, pgrp->pg_id, pgrp->pg_session,
    385  1.10   mycroft 				    pgrp->pg_session->s_count,
    386  1.10   mycroft 				    pgrp->pg_members.lh_first);
    387  1.10   mycroft 				for (p = pgrp->pg_members.lh_first; p != 0;
    388  1.10   mycroft 				    p = p->p_pglist.le_next) {
    389  1.16  christos 					printf("\t\tpid %d addr %p pgrp %p\n",
    390  1.10   mycroft 					    p->p_pid, p, p->p_pgrp);
    391  1.10   mycroft 				}
    392  1.10   mycroft 			}
    393   1.1       cgd 		}
    394   1.1       cgd 	}
    395   1.1       cgd }
    396  1.10   mycroft #endif /* DEBUG */
    397