3535ff5eb9
useless for the non-omniscient (who, by definition, would have no need for this program anyway).
460 lines
11 KiB
C
460 lines
11 KiB
C
/* $NetBSD: main.c,v 1.3 2003/01/16 15:34:18 atatat Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 2002, 2003 The NetBSD Foundation, Inc.
|
|
* All rights reserved.
|
|
*
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
* by Andrew Brown.
|
|
*
|
|
* 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 NetBSD
|
|
* Foundation, Inc. and its contributors.
|
|
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
#ifndef lint
|
|
__RCSID("$NetBSD: main.c,v 1.3 2003/01/16 15:34:18 atatat Exp $");
|
|
#endif
|
|
|
|
#include <sys/param.h>
|
|
|
|
#ifndef __NetBSD_Version__
|
|
#error go away, you fool
|
|
#elif (__NetBSD_Version__ < 105000000)
|
|
#error only works with uvm
|
|
#endif
|
|
|
|
#include <fcntl.h>
|
|
#include <errno.h>
|
|
#include <unistd.h>
|
|
#include <limits.h>
|
|
#include <string.h>
|
|
|
|
#include "pmap.h"
|
|
#include "main.h"
|
|
|
|
/*
|
|
* strange gyrations to get the prototype for the lockdebug version of
|
|
* the process_map function
|
|
*/
|
|
#undef VERSION
|
|
#define VERSION lockdebug
|
|
#include "pmap.h"
|
|
#undef VERSION
|
|
#define VERSION regular
|
|
|
|
struct cache_head lcache;
|
|
struct nchashhead *nchashtbl;
|
|
void *uvm_vnodeops, *uvm_deviceops, *aobj_pager, *ubc_pager;
|
|
void *kernel_floor;
|
|
struct vm_map *kmem_map, *mb_map, *phys_map, *exec_map, *pager_map;
|
|
u_long nchash_addr, nchashtbl_addr, kernel_map_addr;
|
|
int debug, verbose, recurse;
|
|
int print_all, print_map, print_maps, print_solaris, print_ddb;
|
|
int rwx = VM_PROT_READ | VM_PROT_WRITE | VM_PROT_EXECUTE, heapfound;
|
|
rlim_t maxssiz;
|
|
|
|
struct nlist ksyms[] = {
|
|
{ "_maxsmap" },
|
|
#define NL_MAXSSIZ 0
|
|
{ "_uvm_vnodeops" },
|
|
#define NL_UVM_VNODEOPS 1
|
|
{ "_uvm_deviceops" },
|
|
#define NL_UVM_DEVICEOPS 2
|
|
{ "_aobj_pager" },
|
|
#define NL_AOBJ_PAGER 3
|
|
{ "_ubc_pager" },
|
|
#define NL_UBC_PAGER 4
|
|
{ "_kernel_map" },
|
|
#define NL_KERNEL_MAP 5
|
|
{ "_nchashtbl" },
|
|
#define NL_NCHASHTBL 6
|
|
{ "_nchash" },
|
|
#define NL_NCHASH 7
|
|
{ "_kernel_text" },
|
|
#define NL_KENTER 8
|
|
{ NULL }
|
|
};
|
|
|
|
struct nlist kmaps[] = {
|
|
{ "_kmem_map" },
|
|
#define NL_KMEM_MAP 0
|
|
{ "_mb_map" },
|
|
#define NL_MB_MAP 1
|
|
{ "_phys_map" },
|
|
#define NL_PHYS_MAP 2
|
|
{ "_exec_map" },
|
|
#define NL_EXEC_MAP 3
|
|
{ "_pager_map" },
|
|
#define NL_PAGER_MAP 4
|
|
{ NULL }
|
|
};
|
|
|
|
void check_fd(int);
|
|
int using_lockdebug(kvm_t *);
|
|
void load_symbols(kvm_t *);
|
|
void cache_enter(int, struct namecache *);
|
|
|
|
int
|
|
main(int argc, char *argv[])
|
|
{
|
|
kvm_t *kd;
|
|
pid_t pid;
|
|
int many, ch, rc;
|
|
char errbuf[_POSIX2_LINE_MAX + 1];
|
|
struct kinfo_proc2 *kproc;
|
|
char *kmem, *kernel;
|
|
gid_t egid;
|
|
|
|
egid = getegid();
|
|
if (setegid(getgid()) == -1)
|
|
err(1, "failed to reset privileges");
|
|
|
|
check_fd(STDIN_FILENO);
|
|
check_fd(STDOUT_FILENO);
|
|
check_fd(STDERR_FILENO);
|
|
|
|
pid = -1;
|
|
verbose = debug = 0;
|
|
print_all = print_map = print_maps = print_solaris = print_ddb = 0;
|
|
recurse = 0;
|
|
kmem = kernel = NULL;
|
|
|
|
while ((ch = getopt(argc, argv, "aD:dlmM:N:p:PRrsvx")) != -1) {
|
|
switch (ch) {
|
|
case 'a':
|
|
print_all = 1;
|
|
break;
|
|
case 'd':
|
|
print_ddb = 1;
|
|
break;
|
|
case 'D':
|
|
debug = atoi(optarg);
|
|
break;
|
|
case 'l':
|
|
print_maps = 1;
|
|
break;
|
|
case 'm':
|
|
print_map = 1;
|
|
break;
|
|
case 'M':
|
|
kmem = optarg;
|
|
break;
|
|
case 'N':
|
|
kernel = optarg;
|
|
break;
|
|
case 'p':
|
|
pid = atoi(optarg);
|
|
break;
|
|
case 'P':
|
|
pid = getpid();
|
|
break;
|
|
case 'R':
|
|
recurse = 1;
|
|
break;
|
|
case 's':
|
|
print_solaris = 1;
|
|
break;
|
|
case 'v':
|
|
verbose++;
|
|
break;
|
|
case 'r':
|
|
case 'x':
|
|
errx(1, "-%c option not implemented, sorry", optopt);
|
|
/*NOTREACHED*/
|
|
case '?':
|
|
default:
|
|
fprintf(stderr, "usage: %s [-adlmPsv] [-D number] "
|
|
"[-M core] [-N system] [-p pid] [pid ...]\n",
|
|
getprogname());
|
|
exit(1);
|
|
}
|
|
}
|
|
argc -= optind;
|
|
argv += optind;
|
|
|
|
/* more than one "process" to dump? */
|
|
many = (argc > 1 - (pid == -1 ? 0 : 1)) ? 1 : 0;
|
|
|
|
/* apply default */
|
|
if (print_all + print_map + print_maps + print_solaris +
|
|
print_ddb == 0)
|
|
print_solaris = 1;
|
|
|
|
/* get privs back if it appears to be safe, otherwise toss them */
|
|
if (kernel == NULL && kmem == NULL)
|
|
rc = setegid(egid);
|
|
else
|
|
rc = setgid(getgid());
|
|
if (rc == -1)
|
|
err(1, "failed to reset privileges");
|
|
|
|
/* start by opening libkvm */
|
|
kd = kvm_openfiles(kernel, kmem, NULL, O_RDONLY, errbuf);
|
|
errbuf[_POSIX2_LINE_MAX] = '\0';
|
|
if (kd == NULL)
|
|
errx(1, "%s", errbuf);
|
|
|
|
/* get "bootstrap" addresses from kernel */
|
|
load_symbols(kd);
|
|
|
|
if (! using_lockdebug(kd))
|
|
process_map = PMAPFUNC(process_map,regular);
|
|
else
|
|
process_map = PMAPFUNC(process_map,lockdebug);
|
|
|
|
do {
|
|
if (pid == -1) {
|
|
if (argc == 0)
|
|
pid = getppid();
|
|
else {
|
|
pid = atoi(argv[0]);
|
|
argv++;
|
|
argc--;
|
|
}
|
|
}
|
|
|
|
/* find the process id */
|
|
if (pid == 0)
|
|
kproc = NULL;
|
|
else {
|
|
kproc = kvm_getproc2(kd, KERN_PROC_PID, pid,
|
|
sizeof(struct kinfo_proc2), &rc);
|
|
if (kproc == NULL || rc == 0) {
|
|
errno = ESRCH;
|
|
warn("%d", pid);
|
|
pid = -1;
|
|
continue;
|
|
}
|
|
}
|
|
|
|
/* dump it */
|
|
if (many) {
|
|
if (kproc)
|
|
printf("process %d:\n", kproc->p_pid);
|
|
else
|
|
printf("kernel:\n");
|
|
}
|
|
|
|
(*process_map)(kd, pid, kproc);
|
|
pid = -1;
|
|
} while (argc > 0);
|
|
|
|
/* done. go away. */
|
|
rc = kvm_close(kd);
|
|
if (rc == -1)
|
|
err(1, "kvm_close");
|
|
|
|
return (0);
|
|
}
|
|
|
|
void
|
|
check_fd(int fd)
|
|
{
|
|
struct stat st;
|
|
int n;
|
|
|
|
if (fstat(fd, &st) == -1) {
|
|
(void)close(fd);
|
|
n = open("/dev/null", O_RDWR);
|
|
if (n == fd || n == -1)
|
|
/* we're either done or we can do no more */
|
|
return;
|
|
/* if either of these fail, there's not much we can do */
|
|
(void)dup2(n, fd);
|
|
(void)close(n);
|
|
/* XXX should we exit if it fails? */
|
|
}
|
|
}
|
|
|
|
int
|
|
using_lockdebug(kvm_t *kd)
|
|
{
|
|
struct kbit kbit[3];
|
|
struct kbit *vm_map, *header, *vm_map_entry;
|
|
|
|
vm_map = &kbit[0];
|
|
header = &kbit[1];
|
|
vm_map_entry = &kbit[2];
|
|
|
|
A(vm_map) = kernel_map_addr;
|
|
S(vm_map) = sizeof(struct vm_map);
|
|
KDEREF(kd, vm_map);
|
|
|
|
A(header) = A(vm_map) + offsetof(struct vm_map, header);
|
|
S(header) = sizeof(struct vm_map_entry);
|
|
memcpy(D(header, vm_map_entry), &D(vm_map, vm_map)->header, S(header));
|
|
|
|
/*
|
|
* the kernel *always* has map entries, but we might see a
|
|
* zero if we're using a lockdebug kernel and haven't noticed
|
|
* yet.
|
|
*/
|
|
if (D(vm_map, vm_map)->nentries == 0) {
|
|
|
|
/* no entries -> all pointers must point to the header */
|
|
if (P(header) == D(header, vm_map_entry)->next &&
|
|
P(header) == D(header, vm_map_entry)->prev &&
|
|
P(header) == D(vm_map, vm_map)->hint &&
|
|
P(header) == D(vm_map, vm_map)->first_free)
|
|
return (0);
|
|
}
|
|
else {
|
|
|
|
P(vm_map_entry) = D(header, vm_map_entry)->next;
|
|
S(vm_map_entry) = sizeof(struct vm_map_entry);
|
|
KDEREF(kd, vm_map_entry);
|
|
|
|
/* we have entries, so there must be referential integrity */
|
|
if (D(vm_map_entry, vm_map_entry)->prev == P(header) &&
|
|
D(header, vm_map_entry)->start <=
|
|
D(vm_map_entry, vm_map_entry)->start &&
|
|
D(vm_map_entry, vm_map_entry)->end <=
|
|
D(header, vm_map_entry)->end)
|
|
return (0);
|
|
}
|
|
|
|
return (1);
|
|
}
|
|
|
|
void
|
|
load_symbols(kvm_t *kd)
|
|
{
|
|
int rc, i;
|
|
|
|
rc = kvm_nlist(kd, &ksyms[0]);
|
|
if (rc != 0) {
|
|
for (i = 0; ksyms[i].n_name != NULL; i++)
|
|
if (ksyms[i].n_value == 0)
|
|
warnx("symbol %s: not found", ksyms[i].n_name);
|
|
exit(1);
|
|
}
|
|
|
|
uvm_vnodeops = (void*)ksyms[NL_UVM_VNODEOPS].n_value;
|
|
uvm_deviceops = (void*)ksyms[NL_UVM_DEVICEOPS].n_value;
|
|
aobj_pager = (void*)ksyms[NL_AOBJ_PAGER].n_value;
|
|
ubc_pager = (void*)ksyms[NL_UBC_PAGER].n_value;
|
|
|
|
kernel_floor = (void*)ksyms[NL_KENTER].n_value;
|
|
nchash_addr = ksyms[NL_NCHASH].n_value;
|
|
|
|
_KDEREF(kd, ksyms[NL_MAXSSIZ].n_value, &maxssiz,
|
|
sizeof(maxssiz));
|
|
_KDEREF(kd, ksyms[NL_NCHASHTBL].n_value, &nchashtbl_addr,
|
|
sizeof(nchashtbl_addr));
|
|
_KDEREF(kd, ksyms[NL_KERNEL_MAP].n_value, &kernel_map_addr,
|
|
sizeof(kernel_map_addr));
|
|
|
|
/*
|
|
* Some of these may be missing from some platforms, for
|
|
* example sparc, sh3, and most powerpc platforms don't
|
|
* have a "phys_map".
|
|
*/
|
|
(void)kvm_nlist(kd, &kmaps[0]);
|
|
if (kmaps[NL_KMEM_MAP].n_value != 0)
|
|
_KDEREF(kd, kmaps[NL_KMEM_MAP].n_value, &kmem_map,
|
|
sizeof(kmem_map));
|
|
if (kmaps[NL_MB_MAP].n_value != 0)
|
|
_KDEREF(kd, kmaps[NL_MB_MAP].n_value, &mb_map,
|
|
sizeof(mb_map));
|
|
if (kmaps[NL_PHYS_MAP].n_value != 0)
|
|
_KDEREF(kd, kmaps[NL_PHYS_MAP].n_value, &phys_map,
|
|
sizeof(phys_map));
|
|
if (kmaps[NL_EXEC_MAP].n_value != 0)
|
|
_KDEREF(kd, kmaps[NL_EXEC_MAP].n_value, &exec_map,
|
|
sizeof(exec_map));
|
|
if (kmaps[NL_PAGER_MAP].n_value != 0)
|
|
_KDEREF(kd, kmaps[NL_PAGER_MAP].n_value, &pager_map,
|
|
sizeof(pager_map));
|
|
}
|
|
|
|
void
|
|
load_name_cache(kvm_t *kd)
|
|
{
|
|
struct namecache _ncp, *ncp, *oncp;
|
|
struct nchashhead _ncpp, *ncpp;
|
|
u_long nchash;
|
|
int i;
|
|
|
|
LIST_INIT(&lcache);
|
|
|
|
_KDEREF(kd, nchash_addr, &nchash, sizeof(nchash));
|
|
nchashtbl = malloc(sizeof(nchashtbl) * (int)nchash);
|
|
_KDEREF(kd, nchashtbl_addr, nchashtbl,
|
|
sizeof(nchashtbl) * (int)nchash);
|
|
|
|
ncpp = &_ncpp;
|
|
|
|
for (i = 0; i <= nchash; i++) {
|
|
ncpp = &nchashtbl[i];
|
|
oncp = NULL;
|
|
LIST_FOREACH(ncp, ncpp, nc_hash) {
|
|
if (ncp == oncp ||
|
|
(void*)ncp < kernel_floor ||
|
|
ncp == (void*)0xdeadbeef)
|
|
break;
|
|
oncp = ncp;
|
|
_KDEREF(kd, (u_long)ncp, &_ncp, sizeof(*ncp));
|
|
ncp = &_ncp;
|
|
if ((void*)ncp->nc_vp > kernel_floor &&
|
|
ncp->nc_nlen > 0) {
|
|
if (ncp->nc_nlen > 2 ||
|
|
ncp->nc_name[0] != '.' ||
|
|
(ncp->nc_name[1] != '.' &&
|
|
ncp->nc_nlen != 1))
|
|
cache_enter(i, ncp);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void
|
|
cache_enter(int i, struct namecache *ncp)
|
|
{
|
|
struct cache_entry *ce;
|
|
|
|
if (debug & DUMP_NAMEI_CACHE)
|
|
printf("[%d] ncp->nc_vp %10p, ncp->nc_dvp %10p, "
|
|
"ncp->nc_nlen %3d [%.*s] (nc_dvpid=%lu, nc_vpid=%lu)\n",
|
|
i, ncp->nc_vp, ncp->nc_dvp,
|
|
ncp->nc_nlen, ncp->nc_nlen, ncp->nc_name,
|
|
ncp->nc_dvpid, ncp->nc_vpid);
|
|
|
|
ce = malloc(sizeof(struct cache_entry));
|
|
|
|
ce->ce_vp = ncp->nc_vp;
|
|
ce->ce_pvp = ncp->nc_dvp;
|
|
ce->ce_cid = ncp->nc_vpid;
|
|
ce->ce_pcid = ncp->nc_dvpid;
|
|
ce->ce_nlen = ncp->nc_nlen;
|
|
strncpy(ce->ce_name, ncp->nc_name, sizeof(ce->ce_name));
|
|
ce->ce_name[MIN(ce->ce_nlen, sizeof(ce->ce_name) - 1)] = '\0';
|
|
|
|
LIST_INSERT_HEAD(&lcache, ce, ce_next);
|
|
}
|