kvm_amd64.c revision 18798 
1/*-
2 * Copyright (c) 1989, 1992, 1993
3 *	The Regents of the University of California.  All rights reserved.
4 *
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.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
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.
24 *
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
35 * SUCH DAMAGE.
36 */
37
38#if defined(LIBC_SCCS) && !defined(lint)
39static char sccsid[] = "@(#)kvm_hp300.c	8.1 (Berkeley) 6/4/93";
40#endif /* LIBC_SCCS and not lint */
41
42/*
43 * i386 machine dependent routines for kvm.  Hopefully, the forthcoming
44 * vm code will one day obsolete this module.
45 */
46
47#include <sys/param.h>
48#include <sys/user.h>
49#include <sys/proc.h>
50#include <sys/stat.h>
51#include <stdlib.h>
52#include <unistd.h>
53#include <nlist.h>
54#include <kvm.h>
55
56#include <vm/vm.h>
57#include <vm/vm_param.h>
58
59#include <limits.h>
60#include <db.h>
61
62#include "kvm_private.h"
63
64#ifndef btop
65#define	btop(x)		(i386_btop(x))
66#define	ptob(x)		(i386_ptob(x))
67#endif
68
69struct vmstate {
70	pd_entry_t	*PTD;
71};
72
73void
74_kvm_freevtop(kvm_t *kd)
75{
76	if (kd->vmst != 0) {
77		if (kd->vmst->PTD) {
78			free(kd->vmst->PTD);
79		}
80		free(kd->vmst);
81	}
82}
83
84int
85_kvm_initvtop(kvm_t *kd)
86{
87	struct vmstate *vm;
88	struct nlist nlist[2];
89	u_long pa;
90	pd_entry_t	*PTD;
91
92	vm = (struct vmstate *)_kvm_malloc(kd, sizeof(*vm));
93	if (vm == 0) {
94		_kvm_err(kd, kd->program, "cannot allocate vm");
95		return (-1);
96	}
97	kd->vmst = vm;
98	vm->PTD = 0;
99
100	nlist[0].n_name = "_IdlePTD";
101	nlist[1].n_name = 0;
102
103	if (kvm_nlist(kd, nlist) != 0) {
104		_kvm_err(kd, kd->program, "bad namelist");
105		return (-1);
106	}
107	if (kvm_read(kd, (nlist[0].n_value - KERNBASE), &pa, sizeof(pa)) != sizeof(pa)) {
108		_kvm_err(kd, kd->program, "cannot read IdlePTD");
109		return (-1);
110	}
111	PTD = _kvm_malloc(kd, PAGE_SIZE);
112	if (kvm_read(kd, pa, PTD, PAGE_SIZE) != PAGE_SIZE) {
113		_kvm_err(kd, kd->program, "cannot read PTD");
114		return (-1);
115	}
116	vm->PTD = PTD;
117	return (0);
118}
119
120static int
121_kvm_vatop(kvm_t *kd, u_long va, u_long *pa)
122{
123	struct vmstate *vm;
124	u_long offset;
125	u_long pte_pa;
126	pd_entry_t pde;
127	pt_entry_t pte;
128	u_long pdeindex;
129	u_long pteindex;
130	int i;
131
132	if (ISALIVE(kd)) {
133		_kvm_err(kd, 0, "vatop called in live kernel!");
134		return((off_t)0);
135	}
136
137	vm = kd->vmst;
138	offset = va & (PAGE_SIZE - 1);
139
140	/*
141	 * If we are initializing (kernel page table descriptor pointer
142	 * not yet set) then return pa == va to avoid infinite recursion.
143	 */
144	if (vm->PTD == 0) {
145		*pa = va;
146		return (PAGE_SIZE - offset);
147	}
148
149	pdeindex = va >> PDRSHIFT;
150	pde = vm->PTD[pdeindex];
151	if (((u_long)pde & PG_V) == 0)
152		goto invalid;
153
154	pteindex = (va >> PAGE_SHIFT) & (NPTEPG-1);
155	pte_pa = ((u_long)pde & PG_FRAME) + (pteindex * sizeof(pt_entry_t));
156
157	/* XXX This has to be a physical address read, kvm_read is virtual */
158	if (lseek(kd->pmfd, pte_pa, 0) == -1) {
159		_kvm_syserr(kd, kd->program, "_kvm_vatop: lseek");
160		goto invalid;
161	}
162	if (read(kd->pmfd, &pte, sizeof pte) != sizeof pte) {
163		_kvm_syserr(kd, kd->program, "_kvm_vatop: read");
164		goto invalid;
165	}
166	if (((u_long)pte & PG_V) == 0)
167		goto invalid;
168
169	*pa = ((u_long)pte & PG_FRAME) + offset;
170	return (PAGE_SIZE - offset);
171
172invalid:
173	_kvm_err(kd, 0, "invalid address (%x)", va);
174	return (0);
175}
176
177int
178_kvm_kvatop(kvm_t *kd, u_long va, u_long *pa)
179{
180	return (_kvm_vatop(kd, va, pa));
181}
182