2 * Copyright (c) 1982, 1986, 1989, 1991, 1993
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)kern_proc.c 8.7 (Berkeley) 2/14/95
34 * $FreeBSD: src/sys/kern/kern_proc.c,v 1.63.2.9 2003/05/08 07:47:16 kbyanc Exp $
35 * $DragonFly: src/sys/kern/kern_proc.c,v 1.16 2004/07/24 20:21:35 dillon Exp $
38 #include <sys/param.h>
39 #include <sys/systm.h>
40 #include <sys/kernel.h>
41 #include <sys/sysctl.h>
42 #include <sys/malloc.h>
44 #include <sys/filedesc.h>
46 #include <sys/signalvar.h>
50 #include <vm/vm_map.h>
52 #include <vm/vm_zone.h>
53 #include <machine/smp.h>
55 static MALLOC_DEFINE(M_PGRP, "pgrp", "process group header");
56 MALLOC_DEFINE(M_SESSION, "session", "session header");
57 static MALLOC_DEFINE(M_PROC, "proc", "Proc structures");
58 MALLOC_DEFINE(M_SUBPROC, "subproc", "Proc sub-structures");
60 int ps_showallprocs = 1;
61 static int ps_showallthreads = 1;
62 SYSCTL_INT(_kern, OID_AUTO, ps_showallprocs, CTLFLAG_RW,
63 &ps_showallprocs, 0, "");
64 SYSCTL_INT(_kern, OID_AUTO, ps_showallthreads, CTLFLAG_RW,
65 &ps_showallthreads, 0, "");
67 static void pgdelete (struct pgrp *);
69 static void orphanpg (struct pgrp *pg);
74 struct pidhashhead *pidhashtbl;
76 struct pgrphashhead *pgrphashtbl;
78 struct proclist allproc;
79 struct proclist zombproc;
81 vm_zone_t thread_zone;
84 * Initialize global process hashing structures.
92 pidhashtbl = hashinit(maxproc / 4, M_PROC, &pidhash);
93 pgrphashtbl = hashinit(maxproc / 4, M_PROC, &pgrphash);
94 proc_zone = zinit("PROC", sizeof (struct proc), 0, 0, 5);
95 thread_zone = zinit("THREAD", sizeof (struct thread), 0, 0, 5);
100 * Is p an inferior of the current process?
107 for (; p != curproc; p = p->p_pptr)
114 * Locate a process by number
122 LIST_FOREACH(p, PIDHASH(pid), p_hash)
129 * Locate a process group by number
137 LIST_FOREACH(pgrp, PGRPHASH(pgid), pg_hash)
138 if (pgrp->pg_id == pgid)
144 * Move p to a new or existing process group (and session)
147 enterpgrp(p, pgid, mksess)
152 struct pgrp *pgrp = pgfind(pgid);
154 KASSERT(pgrp == NULL || !mksess,
155 ("enterpgrp: setsid into non-empty pgrp"));
156 KASSERT(!SESS_LEADER(p),
157 ("enterpgrp: session leader attempted setpgrp"));
160 pid_t savepid = p->p_pid;
165 KASSERT(p->p_pid == pgid,
166 ("enterpgrp: new pgrp and pid != pgid"));
167 if ((np = pfind(savepid)) == NULL || np != p)
169 MALLOC(pgrp, struct pgrp *, sizeof(struct pgrp), M_PGRP,
172 struct session *sess;
177 MALLOC(sess, struct session *, sizeof(struct session),
178 M_SESSION, M_WAITOK);
180 sess->s_sid = p->p_pid;
182 sess->s_ttyvp = NULL;
184 bcopy(p->p_session->s_login, sess->s_login,
185 sizeof(sess->s_login));
186 p->p_flag &= ~P_CONTROLT;
187 pgrp->pg_session = sess;
188 KASSERT(p == curproc,
189 ("enterpgrp: mksession and p != curproc"));
191 pgrp->pg_session = p->p_session;
192 pgrp->pg_session->s_count++;
195 LIST_INIT(&pgrp->pg_members);
196 LIST_INSERT_HEAD(PGRPHASH(pgid), pgrp, pg_hash);
198 SLIST_INIT(&pgrp->pg_sigiolst);
199 } else if (pgrp == p->p_pgrp)
203 * Adjust eligibility of affected pgrps to participate in job control.
204 * Increment eligibility counts before decrementing, otherwise we
205 * could reach 0 spuriously during the first call.
208 fixjobc(p, p->p_pgrp, 0);
210 LIST_REMOVE(p, p_pglist);
211 if (LIST_EMPTY(&p->p_pgrp->pg_members))
214 LIST_INSERT_HEAD(&pgrp->pg_members, p, p_pglist);
219 * remove process from process group
226 LIST_REMOVE(p, p_pglist);
227 if (LIST_EMPTY(&p->p_pgrp->pg_members))
234 * delete a process group
242 * Reset any sigio structures pointing to us as a result of
243 * F_SETOWN with our pgid.
245 funsetownlst(&pgrp->pg_sigiolst);
247 if (pgrp->pg_session->s_ttyp != NULL &&
248 pgrp->pg_session->s_ttyp->t_pgrp == pgrp)
249 pgrp->pg_session->s_ttyp->t_pgrp = NULL;
250 LIST_REMOVE(pgrp, pg_hash);
251 if (--pgrp->pg_session->s_count == 0)
252 FREE(pgrp->pg_session, M_SESSION);
257 * Adjust pgrp jobc counters when specified process changes process group.
258 * We count the number of processes in each process group that "qualify"
259 * the group for terminal job control (those with a parent in a different
260 * process group of the same session). If that count reaches zero, the
261 * process group becomes orphaned. Check both the specified process'
262 * process group and that of its children.
263 * entering == 0 => p is leaving specified group.
264 * entering == 1 => p is entering specified group.
267 fixjobc(p, pgrp, entering)
272 struct pgrp *hispgrp;
273 struct session *mysession = pgrp->pg_session;
276 * Check p's parent to see whether p qualifies its own process
277 * group; if so, adjust count for p's process group.
279 if ((hispgrp = p->p_pptr->p_pgrp) != pgrp &&
280 hispgrp->pg_session == mysession) {
283 else if (--pgrp->pg_jobc == 0)
288 * Check this process' children to see whether they qualify
289 * their process groups; if so, adjust counts for children's
292 LIST_FOREACH(p, &p->p_children, p_sibling)
293 if ((hispgrp = p->p_pgrp) != pgrp &&
294 hispgrp->pg_session == mysession &&
295 p->p_stat != SZOMB) {
298 else if (--hispgrp->pg_jobc == 0)
304 * A process group has become orphaned;
305 * if there are any stopped processes in the group,
306 * hang-up all process in that group.
314 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
315 if (p->p_stat == SSTOP) {
316 LIST_FOREACH(p, &pg->pg_members, p_pglist) {
329 DB_SHOW_COMMAND(pgrpdump, pgrpdump)
335 for (i = 0; i <= pgrphash; i++) {
336 if (!LIST_EMPTY(&pgrphashtbl[i])) {
337 printf("\tindx %d\n", i);
338 LIST_FOREACH(pgrp, &pgrphashtbl[i], pg_hash) {
340 "\tpgrp %p, pgid %ld, sess %p, sesscnt %d, mem %p\n",
341 (void *)pgrp, (long)pgrp->pg_id,
342 (void *)pgrp->pg_session,
343 pgrp->pg_session->s_count,
344 (void *)LIST_FIRST(&pgrp->pg_members));
345 LIST_FOREACH(p, &pgrp->pg_members, p_pglist) {
346 printf("\t\tpid %ld addr %p pgrp %p\n",
347 (long)p->p_pid, (void *)p,
357 * Fill in an eproc structure for the specified thread.
360 fill_eproc_td(thread_t td, struct eproc *ep, struct proc *xp)
362 bzero(ep, sizeof(*ep));
364 ep->e_uticks = td->td_uticks;
365 ep->e_sticks = td->td_sticks;
366 ep->e_iticks = td->td_iticks;
368 ep->e_cpuid = td->td_gd->gd_cpuid;
370 strncpy(ep->e_wmesg, td->td_wmesg, WMESGLEN);
371 ep->e_wmesg[WMESGLEN] = 0;
375 * Fake up portions of the proc structure copied out by the sysctl
376 * to return useful information. Note that using td_pri directly
377 * is messy because it includes critial section data so we fake
378 * up an rtprio.prio for threads.
382 xp->p_rtprio.type = RTP_PRIO_THREAD;
383 xp->p_rtprio.prio = td->td_pri & TDPRI_MASK;
389 * Fill in an eproc structure for the specified process.
392 fill_eproc(struct proc *p, struct eproc *ep)
396 fill_eproc_td(p->p_thread, ep, NULL);
400 ep->e_ucred = *p->p_ucred;
403 ep->e_procsig = *p->p_procsig;
405 if (p->p_stat != SIDL && p->p_stat != SZOMB && p->p_vmspace != NULL) {
406 struct vmspace *vm = p->p_vmspace;
408 ep->e_vm.vm_rssize = vmspace_resident_count(vm); /*XXX*/
410 if ((p->p_flag & P_INMEM) && p->p_stats)
411 ep->e_stats = *p->p_stats;
413 ep->e_ppid = p->p_pptr->p_pid;
415 ep->e_pgid = p->p_pgrp->pg_id;
416 ep->e_jobc = p->p_pgrp->pg_jobc;
417 ep->e_sess = p->p_pgrp->pg_session;
420 bcopy(ep->e_sess->s_login, ep->e_login, sizeof(ep->e_login));
421 if (ep->e_sess->s_ttyvp)
422 ep->e_flag = EPROC_CTTY;
423 if (p->p_session && SESS_LEADER(p))
424 ep->e_flag |= EPROC_SLEADER;
427 if ((p->p_flag & P_CONTROLT) &&
428 (ep->e_sess != NULL) &&
429 ((tp = ep->e_sess->s_ttyp) != NULL)) {
430 ep->e_tdev = dev2udev(tp->t_dev);
431 ep->e_tpgid = tp->t_pgrp ? tp->t_pgrp->pg_id : NO_PID;
432 ep->e_tsess = tp->t_session;
443 LIST_FOREACH(p, &zombproc, p_list)
450 sysctl_out_proc(struct proc *p, struct thread *td, struct sysctl_req *req, int doingzomb)
456 pid_t pid = p->p_pid;
461 fill_eproc(p, &eproc);
465 * Fixup p_stat from SRUN to SSLEEP if the LWKT thread is
466 * in a thread-blocked state.
468 * XXX temporary fix which might become permanent (I'd rather
469 * not pollute the thread scheduler with knowlege about
472 if (p->p_stat == SRUN && td && (td->td_flags & TDF_BLOCKED)) {
473 xproc.p_stat = SSLEEP;
476 fill_eproc_td(td, &eproc, &xproc);
478 error = SYSCTL_OUT(req,(caddr_t)&xproc, sizeof(struct proc));
481 error = SYSCTL_OUT(req,(caddr_t)&eproc, sizeof(eproc));
484 error = SYSCTL_OUT(req,(caddr_t)td, sizeof(struct thread));
488 if (!doingzomb && pid && (pfind(pid) != p))
490 if (doingzomb && zpfind(pid) != p)
497 sysctl_kern_proc(SYSCTL_HANDLER_ARGS)
499 int *name = (int*) arg1;
500 u_int namelen = arg2;
507 struct ucred *cr1 = curproc->p_ucred;
509 if (oidp->oid_number == KERN_PROC_PID) {
512 p = pfind((pid_t)name[0]);
515 if (!PRISON_CHECK(cr1, p->p_ucred))
517 error = sysctl_out_proc(p, NULL, req, 0);
520 if (oidp->oid_number == KERN_PROC_ALL && !namelen)
522 else if (oidp->oid_number != KERN_PROC_ALL && namelen == 1)
528 /* overestimate by 5 procs */
529 error = SYSCTL_OUT(req, 0, sizeof (struct kinfo_proc) * 5);
533 for (doingzomb=0 ; doingzomb < 2 ; doingzomb++) {
535 p = LIST_FIRST(&allproc);
537 p = LIST_FIRST(&zombproc);
538 for (; p != 0; p = LIST_NEXT(p, p_list)) {
540 * Show a user only their processes.
542 if ((!ps_showallprocs) && p_trespass(cr1, p->p_ucred))
545 * Skip embryonic processes.
547 if (p->p_stat == SIDL)
550 * TODO - make more efficient (see notes below).
553 switch (oidp->oid_number) {
555 /* could do this by traversing pgrp */
556 if (p->p_pgrp == NULL ||
557 p->p_pgrp->pg_id != (pid_t)name[0])
562 if ((p->p_flag & P_CONTROLT) == 0 ||
563 p->p_session == NULL ||
564 p->p_session->s_ttyp == NULL ||
565 dev2udev(p->p_session->s_ttyp->t_dev) !=
571 if (p->p_ucred == NULL ||
572 p->p_ucred->cr_uid != (uid_t)name[0])
577 if (p->p_ucred == NULL ||
578 p->p_ucred->cr_ruid != (uid_t)name[0])
583 if (!PRISON_CHECK(cr1, p->p_ucred))
586 error = sysctl_out_proc(p, NULL, req, doingzomb);
594 * Iterate over all active cpus and scan their thread list. Start
595 * with the next logical cpu and end with our original cpu. We
596 * migrate our own thread to each target cpu in order to safely scan
597 * its thread list. In the last loop we migrate back to our original
600 origcpu = mycpu->gd_cpuid;
601 for (n = 1; ps_showallthreads && n <= ncpus; ++n) {
605 nid = (origcpu + n) % ncpus;
606 if ((smp_active_mask & (1 << nid)) == 0)
608 rgd = globaldata_find(nid);
609 lwkt_setcpu_self(rgd);
610 cpu_mb1(); /* CURRENT CPU HAS CHANGED */
612 TAILQ_FOREACH(td, &mycpu->gd_tdallq, td_allq) {
615 switch (oidp->oid_number) {
625 error = sysctl_out_proc(NULL, td, req, doingzomb);
635 * This sysctl allows a process to retrieve the argument list or process
636 * title for another process without groping around in the address space
637 * of the other process. It also allow a process to set its own "process
638 * title to a string of its own choice.
641 sysctl_kern_proc_args(SYSCTL_HANDLER_ARGS)
643 int *name = (int*) arg1;
644 u_int namelen = arg2;
648 struct ucred *cr1 = curproc->p_ucred;
653 p = pfind((pid_t)name[0]);
657 if ((!ps_argsopen) && p_trespass(cr1, p->p_ucred))
660 if (req->newptr && curproc != p)
663 if (req->oldptr && p->p_args != NULL)
664 error = SYSCTL_OUT(req, p->p_args->ar_args, p->p_args->ar_length);
665 if (req->newptr == NULL)
668 if (p->p_args && --p->p_args->ar_ref == 0)
669 FREE(p->p_args, M_PARGS);
672 if (req->newlen + sizeof(struct pargs) > ps_arg_cache_limit)
675 MALLOC(pa, struct pargs *, sizeof(struct pargs) + req->newlen,
678 pa->ar_length = req->newlen;
679 error = SYSCTL_IN(req, pa->ar_args, req->newlen);
687 SYSCTL_NODE(_kern, KERN_PROC, proc, CTLFLAG_RD, 0, "Process table");
689 SYSCTL_PROC(_kern_proc, KERN_PROC_ALL, all, CTLFLAG_RD|CTLTYPE_STRUCT,
690 0, 0, sysctl_kern_proc, "S,proc", "Return entire process table");
692 SYSCTL_NODE(_kern_proc, KERN_PROC_PGRP, pgrp, CTLFLAG_RD,
693 sysctl_kern_proc, "Process table");
695 SYSCTL_NODE(_kern_proc, KERN_PROC_TTY, tty, CTLFLAG_RD,
696 sysctl_kern_proc, "Process table");
698 SYSCTL_NODE(_kern_proc, KERN_PROC_UID, uid, CTLFLAG_RD,
699 sysctl_kern_proc, "Process table");
701 SYSCTL_NODE(_kern_proc, KERN_PROC_RUID, ruid, CTLFLAG_RD,
702 sysctl_kern_proc, "Process table");
704 SYSCTL_NODE(_kern_proc, KERN_PROC_PID, pid, CTLFLAG_RD,
705 sysctl_kern_proc, "Process table");
707 SYSCTL_NODE(_kern_proc, KERN_PROC_ARGS, args, CTLFLAG_RW | CTLFLAG_ANYBODY,
708 sysctl_kern_proc_args, "Process argument list");