kern_proc.c revision 1.24 1 1.24 thorpej /* $NetBSD: kern_proc.c,v 1.24 1998/08/02 04:41:32 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.5 mycroft #include <sys/buf.h>
44 1.5 mycroft #include <sys/acct.h>
45 1.5 mycroft #include <sys/wait.h>
46 1.5 mycroft #include <sys/file.h>
47 1.8 mycroft #include <ufs/ufs/quota.h>
48 1.5 mycroft #include <sys/uio.h>
49 1.5 mycroft #include <sys/malloc.h>
50 1.24 thorpej #include <sys/pool.h>
51 1.5 mycroft #include <sys/mbuf.h>
52 1.5 mycroft #include <sys/ioctl.h>
53 1.5 mycroft #include <sys/tty.h>
54 1.11 cgd #include <sys/signalvar.h>
55 1.5 mycroft
56 1.7 cgd /*
57 1.7 cgd * Structure associated with user cacheing.
58 1.7 cgd */
59 1.7 cgd struct uidinfo {
60 1.10 mycroft LIST_ENTRY(uidinfo) ui_hash;
61 1.7 cgd uid_t ui_uid;
62 1.7 cgd long ui_proccnt;
63 1.10 mycroft };
64 1.10 mycroft #define UIHASH(uid) (&uihashtbl[(uid) & uihash])
65 1.10 mycroft LIST_HEAD(uihashhead, uidinfo) *uihashtbl;
66 1.10 mycroft u_long uihash; /* size of hash table - 1 */
67 1.7 cgd
68 1.7 cgd /*
69 1.10 mycroft * Other process lists
70 1.7 cgd */
71 1.10 mycroft struct pidhashhead *pidhashtbl;
72 1.10 mycroft u_long pidhash;
73 1.10 mycroft struct pgrphashhead *pgrphashtbl;
74 1.10 mycroft u_long pgrphash;
75 1.10 mycroft struct proclist allproc;
76 1.10 mycroft struct proclist zombproc;
77 1.24 thorpej struct pool proc_pool;
78 1.10 mycroft
79 1.13 christos static void orphanpg __P((struct pgrp *));
80 1.14 christos #ifdef DEBUG
81 1.14 christos void pgrpdump __P((void));
82 1.14 christos #endif
83 1.13 christos
84 1.10 mycroft /*
85 1.10 mycroft * Initialize global process hashing structures.
86 1.10 mycroft */
87 1.11 cgd void
88 1.10 mycroft procinit()
89 1.7 cgd {
90 1.7 cgd
91 1.10 mycroft LIST_INIT(&allproc);
92 1.10 mycroft LIST_INIT(&zombproc);
93 1.20 chs pidhashtbl = hashinit(maxproc / 4, M_PROC, M_WAITOK, &pidhash);
94 1.20 chs pgrphashtbl = hashinit(maxproc / 4, M_PROC, M_WAITOK, &pgrphash);
95 1.20 chs uihashtbl = hashinit(maxproc / 16, M_PROC, M_WAITOK, &uihash);
96 1.24 thorpej pool_init(&proc_pool, sizeof(struct proc), 0, 0, 0, "procpl",
97 1.24 thorpej 0, NULL, NULL, M_PROC);
98 1.7 cgd }
99 1.1 cgd
100 1.7 cgd /*
101 1.7 cgd * Change the count associated with number of processes
102 1.7 cgd * a given user is using.
103 1.7 cgd */
104 1.7 cgd int
105 1.7 cgd chgproccnt(uid, diff)
106 1.7 cgd uid_t uid;
107 1.7 cgd int diff;
108 1.7 cgd {
109 1.10 mycroft register struct uidinfo *uip;
110 1.10 mycroft register struct uihashhead *uipp;
111 1.7 cgd
112 1.10 mycroft uipp = UIHASH(uid);
113 1.10 mycroft for (uip = uipp->lh_first; uip != 0; uip = uip->ui_hash.le_next)
114 1.7 cgd if (uip->ui_uid == uid)
115 1.7 cgd break;
116 1.7 cgd if (uip) {
117 1.7 cgd uip->ui_proccnt += diff;
118 1.7 cgd if (uip->ui_proccnt > 0)
119 1.7 cgd return (uip->ui_proccnt);
120 1.7 cgd if (uip->ui_proccnt < 0)
121 1.7 cgd panic("chgproccnt: procs < 0");
122 1.10 mycroft LIST_REMOVE(uip, ui_hash);
123 1.7 cgd FREE(uip, M_PROC);
124 1.7 cgd return (0);
125 1.7 cgd }
126 1.7 cgd if (diff <= 0) {
127 1.7 cgd if (diff == 0)
128 1.7 cgd return(0);
129 1.7 cgd panic("chgproccnt: lost user");
130 1.7 cgd }
131 1.7 cgd MALLOC(uip, struct uidinfo *, sizeof(*uip), M_PROC, M_WAITOK);
132 1.10 mycroft LIST_INSERT_HEAD(uipp, uip, ui_hash);
133 1.7 cgd uip->ui_uid = uid;
134 1.7 cgd uip->ui_proccnt = diff;
135 1.7 cgd return (diff);
136 1.7 cgd }
137 1.4 andrew
138 1.1 cgd /*
139 1.1 cgd * Is p an inferior of the current process?
140 1.1 cgd */
141 1.11 cgd int
142 1.1 cgd inferior(p)
143 1.1 cgd register struct proc *p;
144 1.1 cgd {
145 1.1 cgd
146 1.1 cgd for (; p != curproc; p = p->p_pptr)
147 1.1 cgd if (p->p_pid == 0)
148 1.1 cgd return (0);
149 1.1 cgd return (1);
150 1.1 cgd }
151 1.1 cgd
152 1.1 cgd /*
153 1.1 cgd * Locate a process by number
154 1.1 cgd */
155 1.1 cgd struct proc *
156 1.1 cgd pfind(pid)
157 1.6 cgd register pid_t pid;
158 1.1 cgd {
159 1.7 cgd register struct proc *p;
160 1.1 cgd
161 1.10 mycroft for (p = PIDHASH(pid)->lh_first; p != 0; p = p->p_hash.le_next)
162 1.1 cgd if (p->p_pid == pid)
163 1.1 cgd return (p);
164 1.7 cgd return (NULL);
165 1.1 cgd }
166 1.1 cgd
167 1.1 cgd /*
168 1.1 cgd * Locate a process group by number
169 1.1 cgd */
170 1.1 cgd struct pgrp *
171 1.1 cgd pgfind(pgid)
172 1.1 cgd register pid_t pgid;
173 1.1 cgd {
174 1.7 cgd register struct pgrp *pgrp;
175 1.1 cgd
176 1.10 mycroft for (pgrp = PGRPHASH(pgid)->lh_first; pgrp != 0; pgrp = pgrp->pg_hash.le_next)
177 1.1 cgd if (pgrp->pg_id == pgid)
178 1.1 cgd return (pgrp);
179 1.7 cgd return (NULL);
180 1.1 cgd }
181 1.1 cgd
182 1.1 cgd /*
183 1.1 cgd * Move p to a new or existing process group (and session)
184 1.1 cgd */
185 1.11 cgd int
186 1.1 cgd enterpgrp(p, pgid, mksess)
187 1.1 cgd register struct proc *p;
188 1.1 cgd pid_t pgid;
189 1.4 andrew int mksess;
190 1.1 cgd {
191 1.1 cgd register struct pgrp *pgrp = pgfind(pgid);
192 1.1 cgd
193 1.1 cgd #ifdef DIAGNOSTIC
194 1.7 cgd if (pgrp != NULL && mksess) /* firewalls */
195 1.1 cgd panic("enterpgrp: setsid into non-empty pgrp");
196 1.1 cgd if (SESS_LEADER(p))
197 1.1 cgd panic("enterpgrp: session leader attempted setpgrp");
198 1.1 cgd #endif
199 1.1 cgd if (pgrp == NULL) {
200 1.7 cgd pid_t savepid = p->p_pid;
201 1.7 cgd struct proc *np;
202 1.1 cgd /*
203 1.1 cgd * new process group
204 1.1 cgd */
205 1.1 cgd #ifdef DIAGNOSTIC
206 1.1 cgd if (p->p_pid != pgid)
207 1.1 cgd panic("enterpgrp: new pgrp and pid != pgid");
208 1.1 cgd #endif
209 1.1 cgd MALLOC(pgrp, struct pgrp *, sizeof(struct pgrp), M_PGRP,
210 1.10 mycroft M_WAITOK);
211 1.7 cgd if ((np = pfind(savepid)) == NULL || np != p)
212 1.7 cgd return (ESRCH);
213 1.1 cgd if (mksess) {
214 1.1 cgd register struct session *sess;
215 1.1 cgd
216 1.1 cgd /*
217 1.1 cgd * new session
218 1.1 cgd */
219 1.1 cgd MALLOC(sess, struct session *, sizeof(struct session),
220 1.10 mycroft M_SESSION, M_WAITOK);
221 1.21 thorpej sess->s_sid = p->p_pid;
222 1.1 cgd sess->s_leader = p;
223 1.1 cgd sess->s_count = 1;
224 1.1 cgd sess->s_ttyvp = NULL;
225 1.1 cgd sess->s_ttyp = NULL;
226 1.1 cgd bcopy(p->p_session->s_login, sess->s_login,
227 1.1 cgd sizeof(sess->s_login));
228 1.6 cgd p->p_flag &= ~P_CONTROLT;
229 1.1 cgd pgrp->pg_session = sess;
230 1.1 cgd #ifdef DIAGNOSTIC
231 1.1 cgd if (p != curproc)
232 1.1 cgd panic("enterpgrp: mksession and p != curproc");
233 1.1 cgd #endif
234 1.1 cgd } else {
235 1.1 cgd pgrp->pg_session = p->p_session;
236 1.1 cgd pgrp->pg_session->s_count++;
237 1.1 cgd }
238 1.1 cgd pgrp->pg_id = pgid;
239 1.10 mycroft LIST_INIT(&pgrp->pg_members);
240 1.10 mycroft LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
241 1.1 cgd pgrp->pg_jobc = 0;
242 1.1 cgd } else if (pgrp == p->p_pgrp)
243 1.7 cgd return (0);
244 1.1 cgd
245 1.1 cgd /*
246 1.1 cgd * Adjust eligibility of affected pgrps to participate in job control.
247 1.1 cgd * Increment eligibility counts before decrementing, otherwise we
248 1.1 cgd * could reach 0 spuriously during the first call.
249 1.1 cgd */
250 1.1 cgd fixjobc(p, pgrp, 1);
251 1.1 cgd fixjobc(p, p->p_pgrp, 0);
252 1.1 cgd
253 1.10 mycroft LIST_REMOVE(p, p_pglist);
254 1.10 mycroft if (p->p_pgrp->pg_members.lh_first == 0)
255 1.1 cgd pgdelete(p->p_pgrp);
256 1.1 cgd p->p_pgrp = pgrp;
257 1.10 mycroft LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
258 1.7 cgd return (0);
259 1.1 cgd }
260 1.1 cgd
261 1.1 cgd /*
262 1.1 cgd * remove process from process group
263 1.1 cgd */
264 1.11 cgd int
265 1.1 cgd leavepgrp(p)
266 1.1 cgd register struct proc *p;
267 1.1 cgd {
268 1.1 cgd
269 1.10 mycroft LIST_REMOVE(p, p_pglist);
270 1.10 mycroft if (p->p_pgrp->pg_members.lh_first == 0)
271 1.1 cgd pgdelete(p->p_pgrp);
272 1.1 cgd p->p_pgrp = 0;
273 1.7 cgd return (0);
274 1.1 cgd }
275 1.1 cgd
276 1.1 cgd /*
277 1.7 cgd * delete a process group
278 1.1 cgd */
279 1.11 cgd void
280 1.1 cgd pgdelete(pgrp)
281 1.1 cgd register struct pgrp *pgrp;
282 1.1 cgd {
283 1.1 cgd
284 1.1 cgd if (pgrp->pg_session->s_ttyp != NULL &&
285 1.1 cgd pgrp->pg_session->s_ttyp->t_pgrp == pgrp)
286 1.1 cgd pgrp->pg_session->s_ttyp->t_pgrp = NULL;
287 1.10 mycroft LIST_REMOVE(pgrp, pg_hash);
288 1.1 cgd if (--pgrp->pg_session->s_count == 0)
289 1.1 cgd FREE(pgrp->pg_session, M_SESSION);
290 1.1 cgd FREE(pgrp, M_PGRP);
291 1.1 cgd }
292 1.1 cgd
293 1.1 cgd /*
294 1.1 cgd * Adjust pgrp jobc counters when specified process changes process group.
295 1.1 cgd * We count the number of processes in each process group that "qualify"
296 1.1 cgd * the group for terminal job control (those with a parent in a different
297 1.1 cgd * process group of the same session). If that count reaches zero, the
298 1.1 cgd * process group becomes orphaned. Check both the specified process'
299 1.1 cgd * process group and that of its children.
300 1.1 cgd * entering == 0 => p is leaving specified group.
301 1.1 cgd * entering == 1 => p is entering specified group.
302 1.1 cgd */
303 1.4 andrew void
304 1.1 cgd fixjobc(p, pgrp, entering)
305 1.1 cgd register struct proc *p;
306 1.1 cgd register struct pgrp *pgrp;
307 1.1 cgd int entering;
308 1.1 cgd {
309 1.1 cgd register struct pgrp *hispgrp;
310 1.1 cgd register struct session *mysession = pgrp->pg_session;
311 1.1 cgd
312 1.1 cgd /*
313 1.1 cgd * Check p's parent to see whether p qualifies its own process
314 1.1 cgd * group; if so, adjust count for p's process group.
315 1.1 cgd */
316 1.1 cgd if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
317 1.1 cgd hispgrp->pg_session == mysession)
318 1.1 cgd if (entering)
319 1.1 cgd pgrp->pg_jobc++;
320 1.1 cgd else if (--pgrp->pg_jobc == 0)
321 1.1 cgd orphanpg(pgrp);
322 1.1 cgd
323 1.1 cgd /*
324 1.1 cgd * Check this process' children to see whether they qualify
325 1.1 cgd * their process groups; if so, adjust counts for children's
326 1.1 cgd * process groups.
327 1.1 cgd */
328 1.10 mycroft for (p = p->p_children.lh_first; p != 0; p = p->p_sibling.le_next)
329 1.1 cgd if ((hispgrp = p->p_pgrp) != pgrp &&
330 1.1 cgd hispgrp->pg_session == mysession &&
331 1.1 cgd p->p_stat != SZOMB)
332 1.1 cgd if (entering)
333 1.1 cgd hispgrp->pg_jobc++;
334 1.1 cgd else if (--hispgrp->pg_jobc == 0)
335 1.1 cgd orphanpg(hispgrp);
336 1.1 cgd }
337 1.1 cgd
338 1.1 cgd /*
339 1.1 cgd * A process group has become orphaned;
340 1.1 cgd * if there are any stopped processes in the group,
341 1.1 cgd * hang-up all process in that group.
342 1.1 cgd */
343 1.4 andrew static void
344 1.1 cgd orphanpg(pg)
345 1.1 cgd struct pgrp *pg;
346 1.1 cgd {
347 1.1 cgd register struct proc *p;
348 1.1 cgd
349 1.10 mycroft for (p = pg->pg_members.lh_first; p != 0; p = p->p_pglist.le_next) {
350 1.1 cgd if (p->p_stat == SSTOP) {
351 1.10 mycroft for (p = pg->pg_members.lh_first; p != 0;
352 1.10 mycroft p = p->p_pglist.le_next) {
353 1.1 cgd psignal(p, SIGHUP);
354 1.1 cgd psignal(p, SIGCONT);
355 1.1 cgd }
356 1.1 cgd return;
357 1.1 cgd }
358 1.1 cgd }
359 1.1 cgd }
360 1.1 cgd
361 1.10 mycroft #ifdef DEBUG
362 1.14 christos void
363 1.1 cgd pgrpdump()
364 1.1 cgd {
365 1.1 cgd register struct pgrp *pgrp;
366 1.1 cgd register struct proc *p;
367 1.22 kleink register int i;
368 1.1 cgd
369 1.10 mycroft for (i = 0; i <= pgrphash; i++) {
370 1.14 christos if ((pgrp = pgrphashtbl[i].lh_first) != NULL) {
371 1.16 christos printf("\tindx %d\n", i);
372 1.10 mycroft for (; pgrp != 0; pgrp = pgrp->pg_hash.le_next) {
373 1.16 christos printf("\tpgrp %p, pgid %d, sess %p, sesscnt %d, mem %p\n",
374 1.10 mycroft pgrp, pgrp->pg_id, pgrp->pg_session,
375 1.10 mycroft pgrp->pg_session->s_count,
376 1.10 mycroft pgrp->pg_members.lh_first);
377 1.10 mycroft for (p = pgrp->pg_members.lh_first; p != 0;
378 1.10 mycroft p = p->p_pglist.le_next) {
379 1.16 christos printf("\t\tpid %d addr %p pgrp %p\n",
380 1.10 mycroft p->p_pid, p, p->p_pgrp);
381 1.10 mycroft }
382 1.10 mycroft }
383 1.1 cgd }
384 1.1 cgd }
385 1.1 cgd }
386 1.10 mycroft #endif /* DEBUG */
387