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
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>
58 #include <sys/select.h>
69 #include <vm/vm_param.h>
70 #include <vm/swap_pager.h>
72 #include <sys/sysctl.h>
78 #include "kvm_private.h"
82 kvm_readswap(kd, p, va, cnt)
89 /* XXX Stubbed out, our vm system is differnet */
90 _kvm_err(kd, kd->program, "kvm_readswap not implemented");
92 #endif /* __FreeBSD__ */
96 #define KREAD(kd, addr, obj) \
97 (kvm_read(kd, addr, (char *)(obj), sizeof(*obj)) != sizeof(*obj))
100 * Read proc's from memory file into buffer bp, which has space to hold
101 * at most maxcnt procs.
104 kvm_proclist(kd, what, arg, p, bp, maxcnt)
108 struct kinfo_proc *bp;
111 register int cnt = 0;
119 for (; cnt < maxcnt && p != NULL; p = proc.p_list.le_next) {
120 if (KREAD(kd, (u_long)p, &proc)) {
121 _kvm_err(kd, kd->program, "can't read proc at %x", p);
124 if (KREAD(kd, (u_long)proc.p_cred, &eproc.e_pcred) == 0)
125 (void)(KREAD(kd, (u_long)eproc.e_pcred.pc_ucred,
131 if (proc.p_pid != (pid_t)arg)
136 if (eproc.e_ucred.cr_uid != (uid_t)arg)
141 if (eproc.e_pcred.p_ruid != (uid_t)arg)
146 * We're going to add another proc to the set. If this
147 * will overflow the buffer, assume the reason is because
148 * nprocs (or the proc list) is corrupt and declare an error.
151 _kvm_err(kd, kd->program, "nprocs corrupt");
158 if (KREAD(kd, (u_long)proc.p_pgrp, &pgrp)) {
159 _kvm_err(kd, kd->program, "can't read pgrp at %x",
164 eproc.e_ppid = proc.p_oppid;
165 else if (proc.p_pptr) {
166 if (KREAD(kd, (u_long)proc.p_pptr, &pproc)) {
167 _kvm_err(kd, kd->program, "can't read pproc at %x",
171 eproc.e_ppid = pproc.p_pid;
174 eproc.e_sess = pgrp.pg_session;
175 eproc.e_pgid = pgrp.pg_id;
176 eproc.e_jobc = pgrp.pg_jobc;
177 if (KREAD(kd, (u_long)pgrp.pg_session, &sess)) {
178 _kvm_err(kd, kd->program, "can't read session at %x",
182 (void)memcpy(eproc.e_login, sess.s_login,
183 sizeof(eproc.e_login));
184 if ((proc.p_flag & P_CONTROLT) && sess.s_ttyp != NULL) {
185 if (KREAD(kd, (u_long)sess.s_ttyp, &tty)) {
186 _kvm_err(kd, kd->program,
187 "can't read tty at %x", sess.s_ttyp);
190 eproc.e_tdev = tty.t_dev;
191 eproc.e_tsess = tty.t_session;
192 if (tty.t_pgrp != NULL) {
193 if (KREAD(kd, (u_long)tty.t_pgrp, &pgrp)) {
194 _kvm_err(kd, kd->program,
195 "can't read tpgrp at &x",
199 eproc.e_tpgid = pgrp.pg_id;
203 eproc.e_tdev = NODEV;
204 eproc.e_flag = sess.s_ttyvp ? EPROC_CTTY : 0;
205 if (sess.s_leader == p)
206 eproc.e_flag |= EPROC_SLEADER;
208 (void)kvm_read(kd, (u_long)proc.p_wmesg,
209 eproc.e_wmesg, WMESGLEN);
212 (void)kvm_read(kd, (u_long)&proc.p_vmspace->vm_rssize,
213 (char *)&eproc.e_vm.vm_rssize,
214 sizeof(eproc.e_vm.vm_rssize));
215 (void)kvm_read(kd, (u_long)&proc.p_vmspace->vm_tsize,
216 (char *)&eproc.e_vm.vm_tsize,
217 3 * sizeof(eproc.e_vm.vm_rssize)); /* XXX */
219 (void)kvm_read(kd, (u_long)proc.p_vmspace,
220 (char *)&eproc.e_vm, sizeof(eproc.e_vm));
222 eproc.e_xsize = eproc.e_xrssize = 0;
223 eproc.e_xccount = eproc.e_xswrss = 0;
228 if (eproc.e_pgid != (pid_t)arg)
233 if ((proc.p_flag & P_CONTROLT) == 0 ||
234 eproc.e_tdev != (dev_t)arg)
238 bcopy(&proc, &bp->kp_proc, sizeof(proc));
239 bcopy(&eproc, &bp->kp_eproc, sizeof(eproc));
247 * Build proc info array by reading in proc list from a crash dump.
248 * Return number of procs read. maxcnt is the max we will read.
251 kvm_deadprocs(kd, what, arg, a_allproc, a_zombproc, maxcnt)
258 register struct kinfo_proc *bp = kd->procbase;
259 register int acnt, zcnt;
262 if (KREAD(kd, a_allproc, &p)) {
263 _kvm_err(kd, kd->program, "cannot read allproc");
266 acnt = kvm_proclist(kd, what, arg, p, bp, maxcnt);
270 if (KREAD(kd, a_zombproc, &p)) {
271 _kvm_err(kd, kd->program, "cannot read zombproc");
274 zcnt = kvm_proclist(kd, what, arg, p, bp + acnt, maxcnt - acnt);
278 return (acnt + zcnt);
282 kvm_getprocs(kd, op, arg, cnt)
287 int mib[4], st, nprocs;
290 if (kd->procbase != 0) {
291 free((void *)kd->procbase);
293 * Clear this pointer in case this call fails. Otherwise,
294 * kvm_close() will free it again.
304 st = sysctl(mib, op == KERN_PROC_ALL ? 3 : 4, NULL, &size, NULL, 0);
306 _kvm_syserr(kd, kd->program, "kvm_getprocs");
311 kd->procbase = (struct kinfo_proc *)
312 _kvm_realloc(kd, kd->procbase, size);
313 if (kd->procbase == 0)
315 st = sysctl(mib, op == KERN_PROC_ALL ? 3 : 4,
316 kd->procbase, &size, NULL, 0);
317 } while (st == -1 && errno == ENOMEM);
319 _kvm_syserr(kd, kd->program, "kvm_getprocs");
322 if (size % sizeof(struct kinfo_proc) != 0) {
323 _kvm_err(kd, kd->program,
324 "proc size mismatch (%d total, %d chunks)",
325 size, sizeof(struct kinfo_proc));
328 nprocs = size / sizeof(struct kinfo_proc);
330 struct nlist nl[4], *p;
332 nl[0].n_name = "_nprocs";
333 nl[1].n_name = "_allproc";
334 nl[2].n_name = "_zombproc";
337 if (kvm_nlist(kd, nl) != 0) {
338 for (p = nl; p->n_type != 0; ++p)
340 _kvm_err(kd, kd->program,
341 "%s: no such symbol", p->n_name);
344 if (KREAD(kd, nl[0].n_value, &nprocs)) {
345 _kvm_err(kd, kd->program, "can't read nprocs");
348 size = nprocs * sizeof(struct kinfo_proc);
349 kd->procbase = (struct kinfo_proc *)_kvm_malloc(kd, size);
350 if (kd->procbase == 0)
353 nprocs = kvm_deadprocs(kd, op, arg, nl[1].n_value,
354 nl[2].n_value, nprocs);
356 size = nprocs * sizeof(struct kinfo_proc);
357 (void)realloc(kd->procbase, size);
361 return (kd->procbase);
375 _kvm_realloc(kd, p, n)
380 void *np = (void *)realloc(p, n);
384 _kvm_err(kd, kd->program, "out of memory");
390 #define MAX(a, b) ((a) > (b) ? (a) : (b))
394 * Read in an argument vector from the user address space of process p.
395 * addr if the user-space base address of narg null-terminated contiguous
396 * strings. This is used to read in both the command arguments and
397 * environment strings. Read at most maxcnt characters of strings.
400 kvm_argv(kd, p, addr, narg, maxcnt)
402 const struct proc *p;
403 register u_long addr;
407 register char *np, *cp, *ep, *ap;
408 register u_long oaddr = -1;
409 register int len, cc;
410 register char **argv;
413 * Check that there aren't an unreasonable number of agruments,
414 * and that the address is in user space.
416 if (narg > 512 || addr < VM_MIN_ADDRESS || addr >= VM_MAXUSER_ADDRESS)
420 * kd->argv : work space for fetching the strings from the target
421 * process's space, and is converted for returning to caller
425 * Try to avoid reallocs.
427 kd->argc = MAX(narg + 1, 32);
428 kd->argv = (char **)_kvm_malloc(kd, kd->argc *
432 } else if (narg + 1 > kd->argc) {
433 kd->argc = MAX(2 * kd->argc, narg + 1);
434 kd->argv = (char **)_kvm_realloc(kd, kd->argv, kd->argc *
440 * kd->argspc : returned to user, this is where the kd->argv
441 * arrays are left pointing to the collected strings.
443 if (kd->argspc == 0) {
444 kd->argspc = (char *)_kvm_malloc(kd, PAGE_SIZE);
447 kd->arglen = PAGE_SIZE;
450 * kd->argbuf : used to pull in pages from the target process.
451 * the strings are copied out of here.
453 if (kd->argbuf == 0) {
454 kd->argbuf = (char *)_kvm_malloc(kd, PAGE_SIZE);
459 /* Pull in the target process'es argv vector */
460 cc = sizeof(char *) * narg;
461 if (kvm_uread(kd, p, addr, (char *)kd->argv, cc) != cc)
464 * ap : saved start address of string we're working on in kd->argspc
465 * np : pointer to next place to write in kd->argspc
466 * len: length of data in kd->argspc
467 * argv: pointer to the argv vector that we are hunting around the
468 * target process space for, and converting to addresses in
469 * our address space (kd->argspc).
471 ap = np = kd->argspc;
475 * Loop over pages, filling in the argument vector.
476 * Note that the argv strings could be pointing *anywhere* in
477 * the user address space and are no longer contiguous.
478 * Note that *argv is modified when we are going to fetch a string
479 * that crosses a page boundary. We copy the next part of the string
480 * into to "np" and eventually convert the pointer.
482 while (argv < kd->argv + narg && *argv != 0) {
484 /* get the address that the current argv string is on */
485 addr = (u_long)*argv & ~(PAGE_SIZE - 1);
487 /* is it the same page as the last one? */
489 if (kvm_uread(kd, p, addr, kd->argbuf, PAGE_SIZE) !=
495 /* offset within the page... kd->argbuf */
496 addr = (u_long)*argv & (PAGE_SIZE - 1);
498 /* cp = start of string, cc = count of chars in this chunk */
499 cp = kd->argbuf + addr;
500 cc = PAGE_SIZE - addr;
502 /* dont get more than asked for by user process */
503 if (maxcnt > 0 && cc > maxcnt - len)
506 /* pointer to end of string if we found it in this page */
507 ep = memchr(cp, '\0', cc);
511 * at this point, cc is the count of the chars that we are
512 * going to retrieve this time. we may or may not have found
513 * the end of it. (ep points to the null if the end is known)
516 /* will we exceed the malloc/realloced buffer? */
517 if (len + cc > kd->arglen) {
520 register char *op = kd->argspc;
523 kd->argspc = (char *)_kvm_realloc(kd, kd->argspc,
528 * Adjust argv pointers in case realloc moved
531 off = kd->argspc - op;
532 for (pp = kd->argv; pp < argv; pp++)
537 /* np = where to put the next part of the string in kd->argspc*/
538 /* np is kinda redundant.. could use "kd->argspc + len" */
540 np += cc; /* inc counters */
544 * if end of string found, set the *argv pointer to the
545 * saved beginning of string, and advance. argv points to
546 * somewhere in kd->argv.. This is initially relative
547 * to the target process, but when we close it off, we set
548 * it to point in our address space.
554 /* update the address relative to the target process */
558 if (maxcnt > 0 && len >= maxcnt) {
560 * We're stopping prematurely. Terminate the
570 /* Make sure argv is terminated. */
577 struct ps_strings *p;
581 *addr = (u_long)p->ps_argvstr;
587 struct ps_strings *p;
591 *addr = (u_long)p->ps_envstr;
596 * Determine if the proc indicated by p is still active.
597 * This test is not 100% foolproof in theory, but chances of
598 * being wrong are very low.
601 proc_verify(kd, kernp, p)
604 const struct proc *p;
606 struct kinfo_proc kp;
612 mib[2] = KERN_PROC_PID;
615 if (sysctl(mib, 4, &kp, &len, NULL, 0) == -1)
617 return (p->p_pid == kp.kp_proc.p_pid &&
618 (kp.kp_proc.p_stat != SZOMB || p->p_stat == SZOMB));
622 kvm_doargv(kd, kp, nchr, info)
624 const struct kinfo_proc *kp;
626 void (*info)(struct ps_strings *, u_long *, int *);
628 register const struct proc *p = &kp->kp_proc;
632 static struct ps_strings arginfo;
633 static u_long ps_strings;
636 if (ps_strings == NULL) {
637 len = sizeof(ps_strings);
638 if (sysctlbyname("kern.ps_strings", &ps_strings, &len, NULL,
640 ps_strings = PS_STRINGS;
644 * Pointers are stored at the top of the user stack.
646 if (p->p_stat == SZOMB ||
647 kvm_uread(kd, p, ps_strings, (char *)&arginfo,
648 sizeof(arginfo)) != sizeof(arginfo))
651 (*info)(&arginfo, &addr, &cnt);
654 ap = kvm_argv(kd, p, addr, cnt, nchr);
656 * For live kernels, make sure this process didn't go away.
658 if (ap != 0 && ISALIVE(kd) &&
659 !proc_verify(kd, (u_long)kp->kp_eproc.e_paddr, p))
665 * Get the command args. This code is now machine independent.
668 kvm_getargv(kd, kp, nchr)
670 const struct kinfo_proc *kp;
677 static char *buf, *p;
682 _kvm_err(kd, kd->program,
683 "cannot read user space from dead kernel");
688 bufsz = sizeof(buflen);
689 i = sysctlbyname("kern.ps_arg_cache_limit",
690 &buflen, &bufsz, NULL, 0);
694 buf = malloc(buflen);
698 bufp = malloc(sizeof(char *) * argc);
704 oid[2] = KERN_PROC_ARGS;
705 oid[3] = kp->kp_proc.p_pid;
707 i = sysctl(oid, 4, buf, &bufsz, 0, 0);
708 if (i == 0 && bufsz > 0) {
717 sizeof(char *) * argc);
719 } while (p < buf + bufsz);
724 if (kp->kp_proc.p_flag & P_SYSTEM)
726 return (kvm_doargv(kd, kp, nchr, ps_str_a));
730 kvm_getenvv(kd, kp, nchr)
732 const struct kinfo_proc *kp;
735 return (kvm_doargv(kd, kp, nchr, ps_str_e));
739 * Read from user space. The user context is given by p.
742 kvm_uread(kd, p, uva, buf, len)
744 register const struct proc *p;
750 char procfile[MAXPATHLEN];
755 _kvm_err(kd, kd->program,
756 "cannot read user space from dead kernel");
760 sprintf(procfile, "/proc/%d/mem", p->p_pid);
761 fd = open(procfile, O_RDONLY, 0);
763 _kvm_err(kd, kd->program, "cannot open %s", procfile);
771 if (lseek(fd, (off_t)uva, 0) == -1 && errno != 0) {
772 _kvm_err(kd, kd->program, "invalid address (%x) in %s",
776 amount = read(fd, cp, len);
778 _kvm_syserr(kd, kd->program, "error reading %s",
783 _kvm_err(kd, kd->program, "EOF reading %s", procfile);
792 return ((ssize_t)(cp - buf));