1994-05-27 05:00:24 +00:00
|
|
|
/*-
|
|
|
|
* Copyright (c) 1989, 1992, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software developed by the Computer Systems
|
|
|
|
* Engineering group at Lawrence Berkeley Laboratory under DARPA contract
|
|
|
|
* BG 91-66 and contributed to Berkeley.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#if defined(LIBC_SCCS) && !defined(lint)
|
|
|
|
static char sccsid[] = "@(#)kvm_proc.c 8.3 (Berkeley) 9/23/93";
|
|
|
|
#endif /* LIBC_SCCS and not lint */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Proc traversal interface for kvm. ps and w are (probably) the exclusive
|
|
|
|
* users of this code, so we've factored it out into a separate module.
|
|
|
|
* Thus, we keep this grunge out of the other kvm applications (i.e.,
|
|
|
|
* most other applications are interested only in open/close/read/nlist).
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/user.h>
|
|
|
|
#include <sys/proc.h>
|
|
|
|
#include <sys/exec.h>
|
|
|
|
#include <sys/stat.h>
|
|
|
|
#include <sys/ioctl.h>
|
|
|
|
#include <sys/tty.h>
|
1994-08-11 13:38:23 +00:00
|
|
|
#include <sys/file.h>
|
1996-07-12 18:57:58 +00:00
|
|
|
#include <stdio.h>
|
|
|
|
#include <stdlib.h>
|
1994-05-27 05:00:24 +00:00
|
|
|
#include <unistd.h>
|
|
|
|
#include <nlist.h>
|
|
|
|
#include <kvm.h>
|
|
|
|
|
|
|
|
#include <vm/vm.h>
|
|
|
|
#include <vm/vm_param.h>
|
|
|
|
#include <vm/swap_pager.h>
|
|
|
|
|
|
|
|
#include <sys/sysctl.h>
|
|
|
|
|
|
|
|
#include <limits.h>
|
1995-12-09 04:42:51 +00:00
|
|
|
#include <memory.h>
|
1994-05-27 05:00:24 +00:00
|
|
|
#include <db.h>
|
|
|
|
#include <paths.h>
|
|
|
|
|
|
|
|
#include "kvm_private.h"
|
|
|
|
|
1996-07-12 18:57:58 +00:00
|
|
|
#if used
|
1994-05-27 05:00:24 +00:00
|
|
|
static char *
|
|
|
|
kvm_readswap(kd, p, va, cnt)
|
|
|
|
kvm_t *kd;
|
|
|
|
const struct proc *p;
|
|
|
|
u_long va;
|
|
|
|
u_long *cnt;
|
|
|
|
{
|
1994-05-28 05:48:30 +00:00
|
|
|
#ifdef __FreeBSD__
|
|
|
|
/* XXX Stubbed out, our vm system is differnet */
|
|
|
|
_kvm_err(kd, kd->program, "kvm_readswap not implemented");
|
|
|
|
return(0);
|
|
|
|
#endif /* __FreeBSD__ */
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
1996-07-12 18:57:58 +00:00
|
|
|
#endif
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
#define KREAD(kd, addr, obj) \
|
|
|
|
(kvm_read(kd, addr, (char *)(obj), sizeof(*obj)) != sizeof(*obj))
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Read proc's from memory file into buffer bp, which has space to hold
|
|
|
|
* at most maxcnt procs.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
kvm_proclist(kd, what, arg, p, bp, maxcnt)
|
|
|
|
kvm_t *kd;
|
|
|
|
int what, arg;
|
|
|
|
struct proc *p;
|
|
|
|
struct kinfo_proc *bp;
|
|
|
|
int maxcnt;
|
|
|
|
{
|
|
|
|
register int cnt = 0;
|
|
|
|
struct eproc eproc;
|
|
|
|
struct pgrp pgrp;
|
|
|
|
struct session sess;
|
|
|
|
struct tty tty;
|
|
|
|
struct proc proc;
|
1997-06-25 20:56:48 +00:00
|
|
|
struct proc pproc;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1996-03-11 05:34:46 +00:00
|
|
|
for (; cnt < maxcnt && p != NULL; p = proc.p_list.le_next) {
|
1994-05-27 05:00:24 +00:00
|
|
|
if (KREAD(kd, (u_long)p, &proc)) {
|
|
|
|
_kvm_err(kd, kd->program, "can't read proc at %x", p);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
if (KREAD(kd, (u_long)proc.p_cred, &eproc.e_pcred) == 0)
|
1996-07-12 18:57:58 +00:00
|
|
|
(void)(KREAD(kd, (u_long)eproc.e_pcred.pc_ucred,
|
|
|
|
&eproc.e_ucred));
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
switch(what) {
|
1995-05-30 05:51:47 +00:00
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
case KERN_PROC_PID:
|
|
|
|
if (proc.p_pid != (pid_t)arg)
|
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case KERN_PROC_UID:
|
|
|
|
if (eproc.e_ucred.cr_uid != (uid_t)arg)
|
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case KERN_PROC_RUID:
|
|
|
|
if (eproc.e_pcred.p_ruid != (uid_t)arg)
|
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* We're going to add another proc to the set. If this
|
|
|
|
* will overflow the buffer, assume the reason is because
|
|
|
|
* nprocs (or the proc list) is corrupt and declare an error.
|
|
|
|
*/
|
|
|
|
if (cnt >= maxcnt) {
|
|
|
|
_kvm_err(kd, kd->program, "nprocs corrupt");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* gather eproc
|
|
|
|
*/
|
|
|
|
eproc.e_paddr = p;
|
|
|
|
if (KREAD(kd, (u_long)proc.p_pgrp, &pgrp)) {
|
|
|
|
_kvm_err(kd, kd->program, "can't read pgrp at %x",
|
|
|
|
proc.p_pgrp);
|
|
|
|
return (-1);
|
|
|
|
}
|
1997-06-25 20:56:48 +00:00
|
|
|
if (proc.p_oppid)
|
|
|
|
eproc.e_ppid = proc.p_oppid;
|
|
|
|
else if (proc.p_pptr) {
|
|
|
|
if (KREAD(kd, (u_long)proc.p_pptr, &pproc)) {
|
|
|
|
_kvm_err(kd, kd->program, "can't read pproc at %x",
|
|
|
|
proc.p_pptr);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
eproc.e_ppid = pproc.p_pid;
|
|
|
|
} else
|
|
|
|
eproc.e_ppid = 0;
|
1994-05-27 05:00:24 +00:00
|
|
|
eproc.e_sess = pgrp.pg_session;
|
|
|
|
eproc.e_pgid = pgrp.pg_id;
|
|
|
|
eproc.e_jobc = pgrp.pg_jobc;
|
|
|
|
if (KREAD(kd, (u_long)pgrp.pg_session, &sess)) {
|
1995-05-30 05:51:47 +00:00
|
|
|
_kvm_err(kd, kd->program, "can't read session at %x",
|
1994-05-27 05:00:24 +00:00
|
|
|
pgrp.pg_session);
|
|
|
|
return (-1);
|
|
|
|
}
|
1996-01-01 17:08:17 +00:00
|
|
|
(void)memcpy(eproc.e_login, sess.s_login,
|
|
|
|
sizeof(eproc.e_login));
|
1994-05-27 05:00:24 +00:00
|
|
|
if ((proc.p_flag & P_CONTROLT) && sess.s_ttyp != NULL) {
|
|
|
|
if (KREAD(kd, (u_long)sess.s_ttyp, &tty)) {
|
|
|
|
_kvm_err(kd, kd->program,
|
|
|
|
"can't read tty at %x", sess.s_ttyp);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
eproc.e_tdev = tty.t_dev;
|
|
|
|
eproc.e_tsess = tty.t_session;
|
|
|
|
if (tty.t_pgrp != NULL) {
|
|
|
|
if (KREAD(kd, (u_long)tty.t_pgrp, &pgrp)) {
|
|
|
|
_kvm_err(kd, kd->program,
|
1995-05-30 05:51:47 +00:00
|
|
|
"can't read tpgrp at &x",
|
1994-05-27 05:00:24 +00:00
|
|
|
tty.t_pgrp);
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
eproc.e_tpgid = pgrp.pg_id;
|
|
|
|
} else
|
|
|
|
eproc.e_tpgid = -1;
|
|
|
|
} else
|
|
|
|
eproc.e_tdev = NODEV;
|
|
|
|
eproc.e_flag = sess.s_ttyvp ? EPROC_CTTY : 0;
|
|
|
|
if (sess.s_leader == p)
|
|
|
|
eproc.e_flag |= EPROC_SLEADER;
|
|
|
|
if (proc.p_wmesg)
|
1995-05-30 05:51:47 +00:00
|
|
|
(void)kvm_read(kd, (u_long)proc.p_wmesg,
|
1994-05-27 05:00:24 +00:00
|
|
|
eproc.e_wmesg, WMESGLEN);
|
|
|
|
|
|
|
|
#ifdef sparc
|
|
|
|
(void)kvm_read(kd, (u_long)&proc.p_vmspace->vm_rssize,
|
|
|
|
(char *)&eproc.e_vm.vm_rssize,
|
|
|
|
sizeof(eproc.e_vm.vm_rssize));
|
|
|
|
(void)kvm_read(kd, (u_long)&proc.p_vmspace->vm_tsize,
|
|
|
|
(char *)&eproc.e_vm.vm_tsize,
|
|
|
|
3 * sizeof(eproc.e_vm.vm_rssize)); /* XXX */
|
|
|
|
#else
|
|
|
|
(void)kvm_read(kd, (u_long)proc.p_vmspace,
|
|
|
|
(char *)&eproc.e_vm, sizeof(eproc.e_vm));
|
|
|
|
#endif
|
|
|
|
eproc.e_xsize = eproc.e_xrssize = 0;
|
|
|
|
eproc.e_xccount = eproc.e_xswrss = 0;
|
|
|
|
|
|
|
|
switch (what) {
|
|
|
|
|
|
|
|
case KERN_PROC_PGRP:
|
|
|
|
if (eproc.e_pgid != (pid_t)arg)
|
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case KERN_PROC_TTY:
|
1995-05-30 05:51:47 +00:00
|
|
|
if ((proc.p_flag & P_CONTROLT) == 0 ||
|
1994-05-27 05:00:24 +00:00
|
|
|
eproc.e_tdev != (dev_t)arg)
|
|
|
|
continue;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
bcopy(&proc, &bp->kp_proc, sizeof(proc));
|
|
|
|
bcopy(&eproc, &bp->kp_eproc, sizeof(eproc));
|
|
|
|
++bp;
|
|
|
|
++cnt;
|
|
|
|
}
|
|
|
|
return (cnt);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Build proc info array by reading in proc list from a crash dump.
|
|
|
|
* Return number of procs read. maxcnt is the max we will read.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
kvm_deadprocs(kd, what, arg, a_allproc, a_zombproc, maxcnt)
|
|
|
|
kvm_t *kd;
|
|
|
|
int what, arg;
|
|
|
|
u_long a_allproc;
|
|
|
|
u_long a_zombproc;
|
|
|
|
int maxcnt;
|
|
|
|
{
|
|
|
|
register struct kinfo_proc *bp = kd->procbase;
|
|
|
|
register int acnt, zcnt;
|
|
|
|
struct proc *p;
|
|
|
|
|
|
|
|
if (KREAD(kd, a_allproc, &p)) {
|
|
|
|
_kvm_err(kd, kd->program, "cannot read allproc");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
acnt = kvm_proclist(kd, what, arg, p, bp, maxcnt);
|
|
|
|
if (acnt < 0)
|
|
|
|
return (acnt);
|
|
|
|
|
|
|
|
if (KREAD(kd, a_zombproc, &p)) {
|
|
|
|
_kvm_err(kd, kd->program, "cannot read zombproc");
|
|
|
|
return (-1);
|
|
|
|
}
|
|
|
|
zcnt = kvm_proclist(kd, what, arg, p, bp + acnt, maxcnt - acnt);
|
|
|
|
if (zcnt < 0)
|
|
|
|
zcnt = 0;
|
|
|
|
|
|
|
|
return (acnt + zcnt);
|
|
|
|
}
|
|
|
|
|
|
|
|
struct kinfo_proc *
|
|
|
|
kvm_getprocs(kd, op, arg, cnt)
|
|
|
|
kvm_t *kd;
|
|
|
|
int op, arg;
|
|
|
|
int *cnt;
|
|
|
|
{
|
1998-08-25 07:52:33 +00:00
|
|
|
int mib[4], st, nprocs;
|
|
|
|
size_t size;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
if (kd->procbase != 0) {
|
|
|
|
free((void *)kd->procbase);
|
1995-05-30 05:51:47 +00:00
|
|
|
/*
|
1994-05-27 05:00:24 +00:00
|
|
|
* Clear this pointer in case this call fails. Otherwise,
|
|
|
|
* kvm_close() will free it again.
|
|
|
|
*/
|
|
|
|
kd->procbase = 0;
|
|
|
|
}
|
|
|
|
if (ISALIVE(kd)) {
|
|
|
|
size = 0;
|
|
|
|
mib[0] = CTL_KERN;
|
|
|
|
mib[1] = KERN_PROC;
|
|
|
|
mib[2] = op;
|
|
|
|
mib[3] = arg;
|
1996-06-06 17:16:52 +00:00
|
|
|
st = sysctl(mib, op == KERN_PROC_ALL ? 3 : 4, NULL, &size, NULL, 0);
|
1994-05-27 05:00:24 +00:00
|
|
|
if (st == -1) {
|
|
|
|
_kvm_syserr(kd, kd->program, "kvm_getprocs");
|
|
|
|
return (0);
|
|
|
|
}
|
1998-10-12 20:36:33 +00:00
|
|
|
kd->procbase = 0;
|
|
|
|
do {
|
|
|
|
size += size / 10;
|
|
|
|
kd->procbase = (struct kinfo_proc *)
|
|
|
|
_kvm_realloc(kd, kd->procbase, size);
|
|
|
|
if (kd->procbase == 0)
|
|
|
|
return (0);
|
|
|
|
st = sysctl(mib, op == KERN_PROC_ALL ? 3 : 4,
|
|
|
|
kd->procbase, &size, NULL, 0);
|
|
|
|
} while (st == -1 && errno == ENOMEM);
|
1994-05-27 05:00:24 +00:00
|
|
|
if (st == -1) {
|
|
|
|
_kvm_syserr(kd, kd->program, "kvm_getprocs");
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (size % sizeof(struct kinfo_proc) != 0) {
|
|
|
|
_kvm_err(kd, kd->program,
|
|
|
|
"proc size mismatch (%d total, %d chunks)",
|
|
|
|
size, sizeof(struct kinfo_proc));
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
nprocs = size / sizeof(struct kinfo_proc);
|
|
|
|
} else {
|
|
|
|
struct nlist nl[4], *p;
|
|
|
|
|
|
|
|
nl[0].n_name = "_nprocs";
|
|
|
|
nl[1].n_name = "_allproc";
|
|
|
|
nl[2].n_name = "_zombproc";
|
|
|
|
nl[3].n_name = 0;
|
|
|
|
|
|
|
|
if (kvm_nlist(kd, nl) != 0) {
|
|
|
|
for (p = nl; p->n_type != 0; ++p)
|
|
|
|
;
|
|
|
|
_kvm_err(kd, kd->program,
|
|
|
|
"%s: no such symbol", p->n_name);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
if (KREAD(kd, nl[0].n_value, &nprocs)) {
|
|
|
|
_kvm_err(kd, kd->program, "can't read nprocs");
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
size = nprocs * sizeof(struct kinfo_proc);
|
|
|
|
kd->procbase = (struct kinfo_proc *)_kvm_malloc(kd, size);
|
|
|
|
if (kd->procbase == 0)
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
nprocs = kvm_deadprocs(kd, op, arg, nl[1].n_value,
|
|
|
|
nl[2].n_value, nprocs);
|
|
|
|
#ifdef notdef
|
|
|
|
size = nprocs * sizeof(struct kinfo_proc);
|
|
|
|
(void)realloc(kd->procbase, size);
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
*cnt = nprocs;
|
|
|
|
return (kd->procbase);
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
_kvm_freeprocs(kd)
|
|
|
|
kvm_t *kd;
|
|
|
|
{
|
|
|
|
if (kd->procbase) {
|
|
|
|
free(kd->procbase);
|
|
|
|
kd->procbase = 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void *
|
|
|
|
_kvm_realloc(kd, p, n)
|
|
|
|
kvm_t *kd;
|
|
|
|
void *p;
|
|
|
|
size_t n;
|
|
|
|
{
|
|
|
|
void *np = (void *)realloc(p, n);
|
|
|
|
|
1998-09-16 04:17:47 +00:00
|
|
|
if (np == 0) {
|
|
|
|
free(p);
|
1994-05-27 05:00:24 +00:00
|
|
|
_kvm_err(kd, kd->program, "out of memory");
|
1998-09-16 04:17:47 +00:00
|
|
|
}
|
1994-05-27 05:00:24 +00:00
|
|
|
return (np);
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifndef MAX
|
|
|
|
#define MAX(a, b) ((a) > (b) ? (a) : (b))
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Read in an argument vector from the user address space of process p.
|
1995-12-09 04:42:51 +00:00
|
|
|
* addr if the user-space base address of narg null-terminated contiguous
|
1994-05-27 05:00:24 +00:00
|
|
|
* strings. This is used to read in both the command arguments and
|
|
|
|
* environment strings. Read at most maxcnt characters of strings.
|
|
|
|
*/
|
|
|
|
static char **
|
|
|
|
kvm_argv(kd, p, addr, narg, maxcnt)
|
|
|
|
kvm_t *kd;
|
1995-12-09 04:42:51 +00:00
|
|
|
const struct proc *p;
|
1994-05-27 05:00:24 +00:00
|
|
|
register u_long addr;
|
|
|
|
register int narg;
|
|
|
|
register int maxcnt;
|
|
|
|
{
|
1995-12-09 04:42:51 +00:00
|
|
|
register char *np, *cp, *ep, *ap;
|
|
|
|
register u_long oaddr = -1;
|
1994-05-27 05:00:24 +00:00
|
|
|
register int len, cc;
|
|
|
|
register char **argv;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Check that there aren't an unreasonable number of agruments,
|
|
|
|
* and that the address is in user space.
|
|
|
|
*/
|
1995-12-16 09:25:17 +00:00
|
|
|
if (narg > 512 || addr < VM_MIN_ADDRESS || addr >= VM_MAXUSER_ADDRESS)
|
1994-05-27 05:00:24 +00:00
|
|
|
return (0);
|
|
|
|
|
1995-12-16 09:25:17 +00:00
|
|
|
/*
|
|
|
|
* kd->argv : work space for fetching the strings from the target
|
|
|
|
* process's space, and is converted for returning to caller
|
|
|
|
*/
|
1994-05-27 05:00:24 +00:00
|
|
|
if (kd->argv == 0) {
|
|
|
|
/*
|
|
|
|
* Try to avoid reallocs.
|
|
|
|
*/
|
|
|
|
kd->argc = MAX(narg + 1, 32);
|
1995-05-30 05:51:47 +00:00
|
|
|
kd->argv = (char **)_kvm_malloc(kd, kd->argc *
|
1994-05-27 05:00:24 +00:00
|
|
|
sizeof(*kd->argv));
|
|
|
|
if (kd->argv == 0)
|
|
|
|
return (0);
|
|
|
|
} else if (narg + 1 > kd->argc) {
|
|
|
|
kd->argc = MAX(2 * kd->argc, narg + 1);
|
1995-05-30 05:51:47 +00:00
|
|
|
kd->argv = (char **)_kvm_realloc(kd, kd->argv, kd->argc *
|
1994-05-27 05:00:24 +00:00
|
|
|
sizeof(*kd->argv));
|
|
|
|
if (kd->argv == 0)
|
|
|
|
return (0);
|
|
|
|
}
|
1995-12-16 09:25:17 +00:00
|
|
|
/*
|
|
|
|
* kd->argspc : returned to user, this is where the kd->argv
|
|
|
|
* arrays are left pointing to the collected strings.
|
|
|
|
*/
|
1994-05-27 05:00:24 +00:00
|
|
|
if (kd->argspc == 0) {
|
1996-05-02 09:23:36 +00:00
|
|
|
kd->argspc = (char *)_kvm_malloc(kd, PAGE_SIZE);
|
1994-05-27 05:00:24 +00:00
|
|
|
if (kd->argspc == 0)
|
|
|
|
return (0);
|
1996-05-02 09:23:36 +00:00
|
|
|
kd->arglen = PAGE_SIZE;
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
1995-12-16 09:25:17 +00:00
|
|
|
/*
|
|
|
|
* kd->argbuf : used to pull in pages from the target process.
|
|
|
|
* the strings are copied out of here.
|
|
|
|
*/
|
1995-12-09 04:42:51 +00:00
|
|
|
if (kd->argbuf == 0) {
|
1996-05-02 09:23:36 +00:00
|
|
|
kd->argbuf = (char *)_kvm_malloc(kd, PAGE_SIZE);
|
1995-12-09 04:42:51 +00:00
|
|
|
if (kd->argbuf == 0)
|
|
|
|
return (0);
|
|
|
|
}
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/* Pull in the target process'es argv vector */
|
1995-12-09 04:42:51 +00:00
|
|
|
cc = sizeof(char *) * narg;
|
|
|
|
if (kvm_uread(kd, p, addr, (char *)kd->argv, cc) != cc)
|
|
|
|
return (0);
|
1995-12-16 09:25:17 +00:00
|
|
|
/*
|
|
|
|
* ap : saved start address of string we're working on in kd->argspc
|
|
|
|
* np : pointer to next place to write in kd->argspc
|
|
|
|
* len: length of data in kd->argspc
|
|
|
|
* argv: pointer to the argv vector that we are hunting around the
|
|
|
|
* target process space for, and converting to addresses in
|
|
|
|
* our address space (kd->argspc).
|
|
|
|
*/
|
1995-12-09 04:42:51 +00:00
|
|
|
ap = np = kd->argspc;
|
1994-05-27 05:00:24 +00:00
|
|
|
argv = kd->argv;
|
|
|
|
len = 0;
|
|
|
|
/*
|
|
|
|
* Loop over pages, filling in the argument vector.
|
1995-12-16 09:25:17 +00:00
|
|
|
* Note that the argv strings could be pointing *anywhere* in
|
|
|
|
* the user address space and are no longer contiguous.
|
|
|
|
* Note that *argv is modified when we are going to fetch a string
|
|
|
|
* that crosses a page boundary. We copy the next part of the string
|
|
|
|
* into to "np" and eventually convert the pointer.
|
1994-05-27 05:00:24 +00:00
|
|
|
*/
|
1995-12-09 04:42:51 +00:00
|
|
|
while (argv < kd->argv + narg && *argv != 0) {
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/* get the address that the current argv string is on */
|
1996-05-02 09:23:36 +00:00
|
|
|
addr = (u_long)*argv & ~(PAGE_SIZE - 1);
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/* is it the same page as the last one? */
|
1995-12-09 04:42:51 +00:00
|
|
|
if (addr != oaddr) {
|
1996-05-02 09:23:36 +00:00
|
|
|
if (kvm_uread(kd, p, addr, kd->argbuf, PAGE_SIZE) !=
|
|
|
|
PAGE_SIZE)
|
1995-12-09 04:42:51 +00:00
|
|
|
return (0);
|
|
|
|
oaddr = addr;
|
|
|
|
}
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/* offset within the page... kd->argbuf */
|
1996-05-02 09:23:36 +00:00
|
|
|
addr = (u_long)*argv & (PAGE_SIZE - 1);
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/* cp = start of string, cc = count of chars in this chunk */
|
1995-12-09 04:42:51 +00:00
|
|
|
cp = kd->argbuf + addr;
|
1996-05-02 09:23:36 +00:00
|
|
|
cc = PAGE_SIZE - addr;
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/* dont get more than asked for by user process */
|
1994-05-27 05:00:24 +00:00
|
|
|
if (maxcnt > 0 && cc > maxcnt - len)
|
1995-12-16 09:25:17 +00:00
|
|
|
cc = maxcnt - len;
|
|
|
|
|
|
|
|
/* pointer to end of string if we found it in this page */
|
1995-12-09 04:42:51 +00:00
|
|
|
ep = memchr(cp, '\0', cc);
|
|
|
|
if (ep != 0)
|
|
|
|
cc = ep - cp + 1;
|
1995-12-16 09:25:17 +00:00
|
|
|
/*
|
|
|
|
* at this point, cc is the count of the chars that we are
|
|
|
|
* going to retrieve this time. we may or may not have found
|
|
|
|
* the end of it. (ep points to the null if the end is known)
|
|
|
|
*/
|
|
|
|
|
|
|
|
/* will we exceed the malloc/realloced buffer? */
|
1994-05-27 05:00:24 +00:00
|
|
|
if (len + cc > kd->arglen) {
|
|
|
|
register int off;
|
|
|
|
register char **pp;
|
|
|
|
register char *op = kd->argspc;
|
|
|
|
|
|
|
|
kd->arglen *= 2;
|
|
|
|
kd->argspc = (char *)_kvm_realloc(kd, kd->argspc,
|
|
|
|
kd->arglen);
|
|
|
|
if (kd->argspc == 0)
|
|
|
|
return (0);
|
|
|
|
/*
|
|
|
|
* Adjust argv pointers in case realloc moved
|
|
|
|
* the string space.
|
|
|
|
*/
|
|
|
|
off = kd->argspc - op;
|
1995-12-09 04:42:51 +00:00
|
|
|
for (pp = kd->argv; pp < argv; pp++)
|
1994-05-27 05:00:24 +00:00
|
|
|
*pp += off;
|
1995-12-09 04:42:51 +00:00
|
|
|
ap += off;
|
|
|
|
np += off;
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
1995-12-16 09:25:17 +00:00
|
|
|
/* np = where to put the next part of the string in kd->argspc*/
|
|
|
|
/* np is kinda redundant.. could use "kd->argspc + len" */
|
1995-12-09 04:42:51 +00:00
|
|
|
memcpy(np, cp, cc);
|
1995-12-16 09:25:17 +00:00
|
|
|
np += cc; /* inc counters */
|
1994-05-27 05:00:24 +00:00
|
|
|
len += cc;
|
1995-12-16 09:25:17 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* if end of string found, set the *argv pointer to the
|
|
|
|
* saved beginning of string, and advance. argv points to
|
|
|
|
* somewhere in kd->argv.. This is initially relative
|
|
|
|
* to the target process, but when we close it off, we set
|
|
|
|
* it to point in our address space.
|
|
|
|
*/
|
1995-12-09 04:42:51 +00:00
|
|
|
if (ep != 0) {
|
|
|
|
*argv++ = ap;
|
|
|
|
ap = np;
|
1995-12-16 09:25:17 +00:00
|
|
|
} else {
|
|
|
|
/* update the address relative to the target process */
|
1995-12-09 04:42:51 +00:00
|
|
|
*argv += cc;
|
1995-12-16 09:25:17 +00:00
|
|
|
}
|
|
|
|
|
1994-05-27 05:00:24 +00:00
|
|
|
if (maxcnt > 0 && len >= maxcnt) {
|
|
|
|
/*
|
|
|
|
* We're stopping prematurely. Terminate the
|
1995-12-09 04:42:51 +00:00
|
|
|
* current string.
|
1994-05-27 05:00:24 +00:00
|
|
|
*/
|
1995-12-09 04:42:51 +00:00
|
|
|
if (ep == 0) {
|
|
|
|
*np = '\0';
|
|
|
|
*argv++ = ap;
|
1995-12-16 09:25:17 +00:00
|
|
|
}
|
1995-12-09 04:42:51 +00:00
|
|
|
break;
|
1995-12-16 09:25:17 +00:00
|
|
|
}
|
1995-12-09 04:42:51 +00:00
|
|
|
}
|
|
|
|
/* Make sure argv is terminated. */
|
|
|
|
*argv = 0;
|
|
|
|
return (kd->argv);
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
ps_str_a(p, addr, n)
|
|
|
|
struct ps_strings *p;
|
|
|
|
u_long *addr;
|
|
|
|
int *n;
|
|
|
|
{
|
|
|
|
*addr = (u_long)p->ps_argvstr;
|
|
|
|
*n = p->ps_nargvstr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void
|
|
|
|
ps_str_e(p, addr, n)
|
|
|
|
struct ps_strings *p;
|
|
|
|
u_long *addr;
|
|
|
|
int *n;
|
|
|
|
{
|
|
|
|
*addr = (u_long)p->ps_envstr;
|
|
|
|
*n = p->ps_nenvstr;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Determine if the proc indicated by p is still active.
|
|
|
|
* This test is not 100% foolproof in theory, but chances of
|
|
|
|
* being wrong are very low.
|
|
|
|
*/
|
|
|
|
static int
|
|
|
|
proc_verify(kd, kernp, p)
|
|
|
|
kvm_t *kd;
|
|
|
|
u_long kernp;
|
|
|
|
const struct proc *p;
|
|
|
|
{
|
1998-06-30 21:29:44 +00:00
|
|
|
struct kinfo_proc kp;
|
1998-08-25 07:52:33 +00:00
|
|
|
int mib[4], st;
|
|
|
|
size_t len;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1998-06-30 21:29:44 +00:00
|
|
|
mib[0] = CTL_KERN;
|
|
|
|
mib[1] = KERN_PROC;
|
|
|
|
mib[2] = KERN_PROC_PID;
|
|
|
|
mib[3] = p->p_pid;
|
|
|
|
|
|
|
|
len = sizeof kp;
|
|
|
|
|
|
|
|
st = sysctl(mib, 4, &kp, &len, NULL, 0);
|
|
|
|
if (st < 0)
|
|
|
|
return(0);
|
|
|
|
return (p->p_pid == kp.kp_proc.p_pid &&
|
|
|
|
(kp.kp_proc.p_stat != SZOMB || p->p_stat == SZOMB));
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static char **
|
|
|
|
kvm_doargv(kd, kp, nchr, info)
|
|
|
|
kvm_t *kd;
|
|
|
|
const struct kinfo_proc *kp;
|
|
|
|
int nchr;
|
1995-12-09 04:42:51 +00:00
|
|
|
void (*info)(struct ps_strings *, u_long *, int *);
|
1994-05-27 05:00:24 +00:00
|
|
|
{
|
|
|
|
register const struct proc *p = &kp->kp_proc;
|
|
|
|
register char **ap;
|
|
|
|
u_long addr;
|
|
|
|
int cnt;
|
1998-06-30 21:29:44 +00:00
|
|
|
static struct ps_strings arginfo, *ps_strings;
|
1996-02-24 14:37:30 +00:00
|
|
|
size_t len;
|
1998-06-30 21:29:44 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
if (ps_strings == NULL) {
|
|
|
|
len = sizeof ps_strings;
|
|
|
|
i = sysctlbyname("kern.ps_strings",
|
|
|
|
&ps_strings, &len, 0, 0);
|
|
|
|
if (i < 0 || ps_strings == NULL)
|
|
|
|
ps_strings = PS_STRINGS;
|
|
|
|
}
|
1994-05-27 05:00:24 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Pointers are stored at the top of the user stack.
|
|
|
|
*/
|
1995-05-30 05:51:47 +00:00
|
|
|
if (p->p_stat == SZOMB ||
|
1996-02-24 14:37:30 +00:00
|
|
|
kvm_uread(kd, p, ps_strings, (char *)&arginfo,
|
1995-12-09 04:42:51 +00:00
|
|
|
sizeof(arginfo)) != sizeof(arginfo))
|
1994-05-27 05:00:24 +00:00
|
|
|
return (0);
|
|
|
|
|
|
|
|
(*info)(&arginfo, &addr, &cnt);
|
1995-12-09 04:42:51 +00:00
|
|
|
if (cnt == 0)
|
|
|
|
return (0);
|
1994-05-27 05:00:24 +00:00
|
|
|
ap = kvm_argv(kd, p, addr, cnt, nchr);
|
|
|
|
/*
|
|
|
|
* For live kernels, make sure this process didn't go away.
|
|
|
|
*/
|
|
|
|
if (ap != 0 && ISALIVE(kd) &&
|
|
|
|
!proc_verify(kd, (u_long)kp->kp_eproc.e_paddr, p))
|
|
|
|
ap = 0;
|
|
|
|
return (ap);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get the command args. This code is now machine independent.
|
|
|
|
*/
|
|
|
|
char **
|
|
|
|
kvm_getargv(kd, kp, nchr)
|
|
|
|
kvm_t *kd;
|
|
|
|
const struct kinfo_proc *kp;
|
|
|
|
int nchr;
|
|
|
|
{
|
|
|
|
return (kvm_doargv(kd, kp, nchr, ps_str_a));
|
|
|
|
}
|
|
|
|
|
|
|
|
char **
|
|
|
|
kvm_getenvv(kd, kp, nchr)
|
|
|
|
kvm_t *kd;
|
|
|
|
const struct kinfo_proc *kp;
|
|
|
|
int nchr;
|
|
|
|
{
|
|
|
|
return (kvm_doargv(kd, kp, nchr, ps_str_e));
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Read from user space. The user context is given by p.
|
|
|
|
*/
|
|
|
|
ssize_t
|
|
|
|
kvm_uread(kd, p, uva, buf, len)
|
|
|
|
kvm_t *kd;
|
1996-07-12 18:57:58 +00:00
|
|
|
register const struct proc *p;
|
1994-05-27 05:00:24 +00:00
|
|
|
register u_long uva;
|
|
|
|
register char *buf;
|
|
|
|
register size_t len;
|
|
|
|
{
|
|
|
|
register char *cp;
|
1994-08-11 13:38:23 +00:00
|
|
|
char procfile[MAXPATHLEN];
|
|
|
|
ssize_t amount;
|
|
|
|
int fd;
|
1994-05-27 05:00:24 +00:00
|
|
|
|
1996-02-24 14:37:30 +00:00
|
|
|
if (!ISALIVE(kd)) {
|
1998-01-16 16:45:05 +00:00
|
|
|
_kvm_err(kd, kd->program,
|
|
|
|
"cannot read user space from dead kernel");
|
|
|
|
return (0);
|
1996-02-24 14:37:30 +00:00
|
|
|
}
|
|
|
|
|
1994-08-11 13:38:23 +00:00
|
|
|
sprintf(procfile, "/proc/%d/mem", p->p_pid);
|
|
|
|
fd = open(procfile, O_RDONLY, 0);
|
|
|
|
if (fd < 0) {
|
|
|
|
_kvm_err(kd, kd->program, "cannot open %s", procfile);
|
|
|
|
close(fd);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
1998-01-16 16:45:05 +00:00
|
|
|
cp = buf;
|
1994-05-27 05:00:24 +00:00
|
|
|
while (len > 0) {
|
1998-01-16 16:45:05 +00:00
|
|
|
errno = 0;
|
1995-03-19 13:33:05 +00:00
|
|
|
if (lseek(fd, (off_t)uva, 0) == -1 && errno != 0) {
|
1998-01-16 16:45:05 +00:00
|
|
|
_kvm_err(kd, kd->program, "invalid address (%x) in %s",
|
|
|
|
uva, procfile);
|
1994-08-11 13:38:23 +00:00
|
|
|
break;
|
|
|
|
}
|
1994-11-02 16:38:51 +00:00
|
|
|
amount = read(fd, cp, len);
|
1994-08-11 13:38:23 +00:00
|
|
|
if (amount < 0) {
|
1998-01-16 16:45:05 +00:00
|
|
|
_kvm_syserr(kd, kd->program, "error reading %s",
|
|
|
|
procfile);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (amount == 0) {
|
|
|
|
_kvm_err(kd, kd->program, "EOF reading %s", procfile);
|
1994-05-27 05:00:24 +00:00
|
|
|
break;
|
1994-08-11 13:38:23 +00:00
|
|
|
}
|
|
|
|
cp += amount;
|
|
|
|
uva += amount;
|
|
|
|
len -= amount;
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|
1994-08-11 13:38:23 +00:00
|
|
|
|
|
|
|
close(fd);
|
1998-01-16 16:45:05 +00:00
|
|
|
return ((ssize_t)(cp - buf));
|
1994-05-27 05:00:24 +00:00
|
|
|
}
|