2 * Copyright (c) 1989, 1992, 1993
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software developed by the Computer Systems
6 * Engineering group at Lawrence Berkeley Laboratory under DARPA contract
7 * BG 91-66 and contributed to Berkeley.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 * 3. All advertising materials mentioning features or use of this software
18 * must display the following acknowledgement:
19 * This product includes software developed by the University of
20 * California, Berkeley and its contributors.
21 * 4. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * $FreeBSD: src/lib/libkvm/kvm_proc.c,v 1.25.2.3 2002/08/24 07:27:46 kris Exp $
40 #if defined(LIBC_SCCS) && !defined(lint)
41 static char sccsid[] = "@(#)kvm_proc.c 8.3 (Berkeley) 9/23/93";
42 #endif /* LIBC_SCCS and not lint */
45 * Proc traversal interface for kvm. ps and w are (probably) the exclusive
46 * users of this code, so we've factored it out into a separate module.
47 * Thus, we keep this grunge out of the other kvm applications (i.e.,
48 * most other applications are interested only in open/close/read/nlist).
51 #include <sys/param.h>
56 #include <sys/ioctl.h>
66 #include <vm/vm_param.h>
67 #include <vm/swap_pager.h>
69 #include <sys/sysctl.h>
75 #include "kvm_private.h"
79 kvm_readswap(kd, p, va, cnt)
86 /* XXX Stubbed out, our vm system is differnet */
87 _kvm_err(kd, kd->program, "kvm_readswap not implemented");
89 #endif /* __FreeBSD__ */
93 #define KREAD(kd, addr, obj) \
94 (kvm_read(kd, addr, (char *)(obj), sizeof(*obj)) != sizeof(*obj))
97 * Read proc's from memory file into buffer bp, which has space to hold
98 * at most maxcnt procs.
101 kvm_proclist(kd, what, arg, p, bp, maxcnt)
105 struct kinfo_proc *bp;
108 register int cnt = 0;
116 for (; cnt < maxcnt && p != NULL; p = proc.p_list.le_next) {
117 if (KREAD(kd, (u_long)p, &proc)) {
118 _kvm_err(kd, kd->program, "can't read proc at %x", p);
121 if (KREAD(kd, (u_long)proc.p_cred, &eproc.e_pcred) == 0)
122 (void)(KREAD(kd, (u_long)eproc.e_pcred.pc_ucred,
128 if (proc.p_pid != (pid_t)arg)
133 if (eproc.e_ucred.cr_uid != (uid_t)arg)
138 if (eproc.e_pcred.p_ruid != (uid_t)arg)
143 * We're going to add another proc to the set. If this
144 * will overflow the buffer, assume the reason is because
145 * nprocs (or the proc list) is corrupt and declare an error.
148 _kvm_err(kd, kd->program, "nprocs corrupt");
155 if (KREAD(kd, (u_long)proc.p_pgrp, &pgrp)) {
156 _kvm_err(kd, kd->program, "can't read pgrp at %x",
161 eproc.e_ppid = proc.p_oppid;
162 else if (proc.p_pptr) {
163 if (KREAD(kd, (u_long)proc.p_pptr, &pproc)) {
164 _kvm_err(kd, kd->program, "can't read pproc at %x",
168 eproc.e_ppid = pproc.p_pid;
171 eproc.e_sess = pgrp.pg_session;
172 eproc.e_pgid = pgrp.pg_id;
173 eproc.e_jobc = pgrp.pg_jobc;
174 if (KREAD(kd, (u_long)pgrp.pg_session, &sess)) {
175 _kvm_err(kd, kd->program, "can't read session at %x",
179 (void)memcpy(eproc.e_login, sess.s_login,
180 sizeof(eproc.e_login));
181 if ((proc.p_flag & P_CONTROLT) && sess.s_ttyp != NULL) {
182 if (KREAD(kd, (u_long)sess.s_ttyp, &tty)) {
183 _kvm_err(kd, kd->program,
184 "can't read tty at %x", sess.s_ttyp);
187 eproc.e_tdev = tty.t_dev;
188 eproc.e_tsess = tty.t_session;
189 if (tty.t_pgrp != NULL) {
190 if (KREAD(kd, (u_long)tty.t_pgrp, &pgrp)) {
191 _kvm_err(kd, kd->program,
192 "can't read tpgrp at %x",
196 eproc.e_tpgid = pgrp.pg_id;
200 eproc.e_tdev = NODEV;
201 eproc.e_flag = sess.s_ttyvp ? EPROC_CTTY : 0;
202 if (sess.s_leader == p)
203 eproc.e_flag |= EPROC_SLEADER;
205 (void)kvm_read(kd, (u_long)proc.p_wmesg,
206 eproc.e_wmesg, WMESGLEN);
209 (void)kvm_read(kd, (u_long)&proc.p_vmspace->vm_rssize,
210 (char *)&eproc.e_vm.vm_rssize,
211 sizeof(eproc.e_vm.vm_rssize));
212 (void)kvm_read(kd, (u_long)&proc.p_vmspace->vm_tsize,
213 (char *)&eproc.e_vm.vm_tsize,
214 3 * sizeof(eproc.e_vm.vm_rssize)); /* XXX */
216 (void)kvm_read(kd, (u_long)proc.p_vmspace,
217 (char *)&eproc.e_vm, sizeof(eproc.e_vm));
219 eproc.e_xsize = eproc.e_xrssize = 0;
220 eproc.e_xccount = eproc.e_xswrss = 0;
225 if (eproc.e_pgid != (pid_t)arg)
230 if ((proc.p_flag & P_CONTROLT) == 0 ||
231 eproc.e_tdev != (dev_t)arg)
235 bcopy(&proc, &bp->kp_proc, sizeof(proc));
236 bcopy(&eproc, &bp->kp_eproc, sizeof(eproc));
244 * Build proc info array by reading in proc list from a crash dump.
245 * Return number of procs read. maxcnt is the max we will read.
248 kvm_deadprocs(kd, what, arg, a_allproc, a_zombproc, maxcnt)
255 register struct kinfo_proc *bp = kd->procbase;
256 register int acnt, zcnt;
259 if (KREAD(kd, a_allproc, &p)) {
260 _kvm_err(kd, kd->program, "cannot read allproc");
263 acnt = kvm_proclist(kd, what, arg, p, bp, maxcnt);
267 if (KREAD(kd, a_zombproc, &p)) {
268 _kvm_err(kd, kd->program, "cannot read zombproc");
271 zcnt = kvm_proclist(kd, what, arg, p, bp + acnt, maxcnt - acnt);
275 return (acnt + zcnt);
279 kvm_getprocs(kd, op, arg, cnt)
284 int mib[4], st, nprocs;
287 if (kd->procbase != 0) {
288 free((void *)kd->procbase);
290 * Clear this pointer in case this call fails. Otherwise,
291 * kvm_close() will free it again.
301 st = sysctl(mib, op == KERN_PROC_ALL ? 3 : 4, NULL, &size, NULL, 0);
303 _kvm_syserr(kd, kd->program, "kvm_getprocs");
308 kd->procbase = (struct kinfo_proc *)
309 _kvm_realloc(kd, kd->procbase, size);
310 if (kd->procbase == 0)
312 st = sysctl(mib, op == KERN_PROC_ALL ? 3 : 4,
313 kd->procbase, &size, NULL, 0);
314 } while (st == -1 && errno == ENOMEM);
316 _kvm_syserr(kd, kd->program, "kvm_getprocs");
319 if (size % sizeof(struct kinfo_proc) != 0) {
320 _kvm_err(kd, kd->program,
321 "proc size mismatch (%d total, %d chunks)",
322 size, sizeof(struct kinfo_proc));
325 nprocs = size / sizeof(struct kinfo_proc);
327 struct nlist nl[4], *p;
329 nl[0].n_name = "_nprocs";
330 nl[1].n_name = "_allproc";
331 nl[2].n_name = "_zombproc";
334 if (kvm_nlist(kd, nl) != 0) {
335 for (p = nl; p->n_type != 0; ++p)
337 _kvm_err(kd, kd->program,
338 "%s: no such symbol", p->n_name);
341 if (KREAD(kd, nl[0].n_value, &nprocs)) {
342 _kvm_err(kd, kd->program, "can't read nprocs");
345 size = nprocs * sizeof(struct kinfo_proc);
346 kd->procbase = (struct kinfo_proc *)_kvm_malloc(kd, size);
347 if (kd->procbase == 0)
350 nprocs = kvm_deadprocs(kd, op, arg, nl[1].n_value,
351 nl[2].n_value, nprocs);
353 size = nprocs * sizeof(struct kinfo_proc);
354 (void)realloc(kd->procbase, size);
358 return (kd->procbase);
372 _kvm_realloc(kd, p, n)
377 void *np = (void *)realloc(p, n);
381 _kvm_err(kd, kd->program, "out of memory");
387 #define MAX(a, b) ((a) > (b) ? (a) : (b))
391 * Read in an argument vector from the user address space of process p.
392 * addr if the user-space base address of narg null-terminated contiguous
393 * strings. This is used to read in both the command arguments and
394 * environment strings. Read at most maxcnt characters of strings.
397 kvm_argv(kd, p, addr, narg, maxcnt)
399 const struct proc *p;
400 register u_long addr;
404 register char *np, *cp, *ep, *ap;
405 register u_long oaddr = -1;
406 register int len, cc;
407 register char **argv;
410 * Check that there aren't an unreasonable number of agruments,
411 * and that the address is in user space.
413 if (narg > 512 || addr < VM_MIN_ADDRESS || addr >= VM_MAXUSER_ADDRESS)
417 * kd->argv : work space for fetching the strings from the target
418 * process's space, and is converted for returning to caller
422 * Try to avoid reallocs.
424 kd->argc = MAX(narg + 1, 32);
425 kd->argv = (char **)_kvm_malloc(kd, kd->argc *
429 } else if (narg + 1 > kd->argc) {
430 kd->argc = MAX(2 * kd->argc, narg + 1);
431 kd->argv = (char **)_kvm_realloc(kd, kd->argv, kd->argc *
437 * kd->argspc : returned to user, this is where the kd->argv
438 * arrays are left pointing to the collected strings.
440 if (kd->argspc == 0) {
441 kd->argspc = (char *)_kvm_malloc(kd, PAGE_SIZE);
444 kd->arglen = PAGE_SIZE;
447 * kd->argbuf : used to pull in pages from the target process.
448 * the strings are copied out of here.
450 if (kd->argbuf == 0) {
451 kd->argbuf = (char *)_kvm_malloc(kd, PAGE_SIZE);
456 /* Pull in the target process'es argv vector */
457 cc = sizeof(char *) * narg;
458 if (kvm_uread(kd, p, addr, (char *)kd->argv, cc) != cc)
461 * ap : saved start address of string we're working on in kd->argspc
462 * np : pointer to next place to write in kd->argspc
463 * len: length of data in kd->argspc
464 * argv: pointer to the argv vector that we are hunting around the
465 * target process space for, and converting to addresses in
466 * our address space (kd->argspc).
468 ap = np = kd->argspc;
472 * Loop over pages, filling in the argument vector.
473 * Note that the argv strings could be pointing *anywhere* in
474 * the user address space and are no longer contiguous.
475 * Note that *argv is modified when we are going to fetch a string
476 * that crosses a page boundary. We copy the next part of the string
477 * into to "np" and eventually convert the pointer.
479 while (argv < kd->argv + narg && *argv != 0) {
481 /* get the address that the current argv string is on */
482 addr = (u_long)*argv & ~(PAGE_SIZE - 1);
484 /* is it the same page as the last one? */
486 if (kvm_uread(kd, p, addr, kd->argbuf, PAGE_SIZE) !=
492 /* offset within the page... kd->argbuf */
493 addr = (u_long)*argv & (PAGE_SIZE - 1);
495 /* cp = start of string, cc = count of chars in this chunk */
496 cp = kd->argbuf + addr;
497 cc = PAGE_SIZE - addr;
499 /* dont get more than asked for by user process */
500 if (maxcnt > 0 && cc > maxcnt - len)
503 /* pointer to end of string if we found it in this page */
504 ep = memchr(cp, '\0', cc);
508 * at this point, cc is the count of the chars that we are
509 * going to retrieve this time. we may or may not have found
510 * the end of it. (ep points to the null if the end is known)
513 /* will we exceed the malloc/realloced buffer? */
514 if (len + cc > kd->arglen) {
517 register char *op = kd->argspc;
520 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc,
525 * Adjust argv pointers in case realloc moved
528 off = kd->argspc - op;
529 for (pp = kd->argv; pp < argv; pp++)
534 /* np = where to put the next part of the string in kd->argspc*/
535 /* np is kinda redundant.. could use "kd->argspc + len" */
537 np += cc; /* inc counters */
541 * if end of string found, set the *argv pointer to the
542 * saved beginning of string, and advance. argv points to
543 * somewhere in kd->argv.. This is initially relative
544 * to the target process, but when we close it off, we set
545 * it to point in our address space.
551 /* update the address relative to the target process */
555 if (maxcnt > 0 && len >= maxcnt) {
557 * We're stopping prematurely. Terminate the
567 /* Make sure argv is terminated. */
574 struct ps_strings *p;
578 *addr = (u_long)p->ps_argvstr;
584 struct ps_strings *p;
588 *addr = (u_long)p->ps_envstr;
593 * Determine if the proc indicated by p is still active.
594 * This test is not 100% foolproof in theory, but chances of
595 * being wrong are very low.
598 proc_verify(kd, kernp, p)
601 const struct proc *p;
603 struct kinfo_proc kp;
609 mib[2] = KERN_PROC_PID;
612 if (sysctl(mib, 4, &kp, &len, NULL, 0) == -1)
614 return (p->p_pid == kp.kp_proc.p_pid &&
615 (kp.kp_proc.p_stat != SZOMB || p->p_stat == SZOMB));
619 kvm_doargv(kd, kp, nchr, info)
621 const struct kinfo_proc *kp;
623 void (*info)(struct ps_strings *, u_long *, int *);
625 register const struct proc *p = &kp->kp_proc;
629 static struct ps_strings arginfo;
630 static u_long ps_strings;
633 if (ps_strings == NULL) {
634 len = sizeof(ps_strings);
635 if (sysctlbyname("kern.ps_strings", &ps_strings, &len, NULL,
637 ps_strings = PS_STRINGS;
641 * Pointers are stored at the top of the user stack.
643 if (p->p_stat == SZOMB ||
644 kvm_uread(kd, p, ps_strings, (char *)&arginfo,
645 sizeof(arginfo)) != sizeof(arginfo))
648 (*info)(&arginfo, &addr, &cnt);
651 ap = kvm_argv(kd, p, addr, cnt, nchr);
653 * For live kernels, make sure this process didn't go away.
655 if (ap != 0 && ISALIVE(kd) &&
656 !proc_verify(kd, (u_long)kp->kp_eproc.e_paddr, p))
662 * Get the command args. This code is now machine independent.
665 kvm_getargv(kd, kp, nchr)
667 const struct kinfo_proc *kp;
673 static unsigned long buflen;
674 static char *buf, *p;
679 _kvm_err(kd, kd->program,
680 "cannot read user space from dead kernel");
685 bufsz = sizeof(buflen);
686 i = sysctlbyname("kern.ps_arg_cache_limit",
687 &buflen, &bufsz, NULL, 0);
691 buf = malloc(buflen);
695 bufp = malloc(sizeof(char *) * argc);
701 oid[2] = KERN_PROC_ARGS;
702 oid[3] = kp->kp_proc.p_pid;
704 i = sysctl(oid, 4, buf, &bufsz, 0, 0);
705 if (i == 0 && bufsz > 0) {
714 sizeof(char *) * argc);
716 } while (p < buf + bufsz);
721 if (kp->kp_proc.p_flag & P_SYSTEM)
723 return (kvm_doargv(kd, kp, nchr, ps_str_a));
727 kvm_getenvv(kd, kp, nchr)
729 const struct kinfo_proc *kp;
732 return (kvm_doargv(kd, kp, nchr, ps_str_e));
736 * Read from user space. The user context is given by p.
739 kvm_uread(kd, p, uva, buf, len)
741 register const struct proc *p;
747 char procfile[MAXPATHLEN];
752 _kvm_err(kd, kd->program,
753 "cannot read user space from dead kernel");
757 sprintf(procfile, "/proc/%d/mem", p->p_pid);
758 fd = open(procfile, O_RDONLY, 0);
760 _kvm_err(kd, kd->program, "cannot open %s", procfile);
768 if (lseek(fd, (off_t)uva, 0) == -1 && errno != 0) {
769 _kvm_err(kd, kd->program, "invalid address (%x) in %s",
773 amount = read(fd, cp, len);
775 _kvm_syserr(kd, kd->program, "error reading %s",
780 _kvm_err(kd, kd->program, "EOF reading %s", procfile);
789 return ((ssize_t)(cp - buf));