162 lines
4.9 KiB
C
162 lines
4.9 KiB
C
/* $NetBSD: pmap.h,v 1.14 2022/08/21 07:46:52 mlelstv Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 2002, 2003, 2020 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.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/*
|
|
* only pull in the headers once. if we attempt to pull them in
|
|
* again, we get namespace collisions on some structures, and we don't
|
|
* want to redefine some of them since it will affect the layout of
|
|
* the struct kbit.
|
|
*/
|
|
#ifndef PMAP_HEADERS
|
|
|
|
#include <err.h>
|
|
#include <kvm.h>
|
|
#include <stddef.h>
|
|
#include <stdlib.h>
|
|
|
|
#include <sys/types.h>
|
|
#include <sys/param.h>
|
|
#include <sys/time.h>
|
|
#include <sys/vnode.h>
|
|
#include <sys/vnode_impl.h>
|
|
#define __EXPOSE_MOUNT
|
|
#include <sys/mount.h>
|
|
#include <sys/uio.h>
|
|
#define __NAMECACHE_PRIVATE
|
|
#include <sys/namei.h>
|
|
#include <sys/sysctl.h>
|
|
|
|
#include <uvm/uvm.h>
|
|
#include <uvm/uvm_device.h>
|
|
|
|
#include <ufs/ufs/inode.h>
|
|
#undef doff_t
|
|
#undef IN_ACCESS
|
|
#include <isofs/cd9660/iso.h>
|
|
#include <isofs/cd9660/cd9660_node.h>
|
|
|
|
#define PMAP_HEADERS
|
|
#endif /* PMAP_HEADERS */
|
|
|
|
/*
|
|
* if the definition of the kbit structure (and the accessor macros)
|
|
* is already established, don't redefine it.
|
|
*/
|
|
#ifndef struct_kbit
|
|
|
|
/*
|
|
* stolen (and munged) from #include <uvm/uvm_object.h>
|
|
*/
|
|
#define UVM_OBJ_IS_VNODE(uobj) ((uobj)->pgops == uvm_vnodeops)
|
|
#define UVM_OBJ_IS_AOBJ(uobj) ((uobj)->pgops == aobj_pager)
|
|
#define UVM_OBJ_IS_DEVICE(uobj) ((uobj)->pgops == uvm_deviceops)
|
|
#define UVM_OBJ_IS_UBCPAGER(uobj) ((uobj)->pgops == ubc_pager)
|
|
|
|
/*
|
|
* stolen from #include <uvm/uvm_amap.h>
|
|
*/
|
|
#define PPREF_NONE ((int *) -1)
|
|
|
|
/* the size of the object in the kernel */
|
|
#define S(x) ((x)->k_size)
|
|
/* the address of the object in kernel, two forms */
|
|
#define A(x) ((x)->k_addr.k_addr_ul)
|
|
#define P(x) ((x)->k_addr.k_addr_p)
|
|
/* the data from the kernel */
|
|
#define D(x,d) (&((x)->k_data.d))
|
|
|
|
/* suck the data from the kernel */
|
|
#define _KDEREFOK(kd, addr, dst, sz) \
|
|
((size_t)kvm_read((kd), (addr), (dst), (sz)) == (size_t)(sz))
|
|
#define _KDEREF(kd, addr, dst, sz) do { \
|
|
if (!_KDEREFOK((kd), (addr), (dst), (sz))) \
|
|
errx(1, "reading from kmem failed: %s", kvm_geterr(kd)); \
|
|
} while (0/*CONSTCOND*/)
|
|
|
|
/* suck the data using the structure */
|
|
#define KDEREFOK(kd, item) _KDEREFOK((kd), A(item), D(item, data), S(item))
|
|
#define KDEREF(kd, item) _KDEREF((kd), A(item), D(item, data), S(item))
|
|
|
|
struct kbit {
|
|
/*
|
|
* size of data chunk
|
|
*/
|
|
size_t k_size;
|
|
|
|
/*
|
|
* something for printf() and something for kvm_read()
|
|
*/
|
|
union {
|
|
void *k_addr_p;
|
|
u_long k_addr_ul;
|
|
} k_addr;
|
|
|
|
/*
|
|
* where we actually put the "stuff"
|
|
*/
|
|
union {
|
|
char data[1];
|
|
struct vmspace vmspace;
|
|
struct vm_map vm_map;
|
|
struct vm_map_entry vm_map_entry;
|
|
struct vnode vnode;
|
|
struct uvm_object uvm_object;
|
|
struct mount mount;
|
|
struct namecache namecache;
|
|
struct inode inode;
|
|
struct iso_node iso_node;
|
|
struct uvm_device uvm_device;
|
|
struct vm_amap amap;
|
|
struct vm_anon anon;
|
|
} k_data;
|
|
};
|
|
#define struct_kbit
|
|
#endif /* struct_kbit */
|
|
|
|
/*
|
|
* this is the *actual* module interface
|
|
*/
|
|
|
|
void process_map(kvm_t *, struct kinfo_proc2 *,
|
|
struct kbit *, const char *);
|
|
void dump_vm_map(kvm_t *, struct kinfo_proc2 *,
|
|
struct kbit *, struct kbit *, const char *);
|
|
size_t dump_vm_map_list(kvm_t *, struct kinfo_proc2 *,
|
|
struct kbit *, struct kbit *, struct kbit *);
|
|
size_t dump_vm_map_tree(kvm_t *, struct kinfo_proc2 *,
|
|
struct kbit *, struct kbit *, struct kbit *);
|
|
size_t dump_vm_map_node(kvm_t *, int lvl, struct kinfo_proc2 *,
|
|
struct kbit *, struct kbit *, struct vm_map_entry *);
|
|
size_t dump_vm_map_entry(kvm_t *, struct kinfo_proc2 *,
|
|
struct kbit *, struct kbit *, int);
|
|
|
|
void dump_amap(kvm_t *, struct kbit *);
|