kvm_i386.c revision 1.8 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)
39 /* from: static char sccsid[] = "@(#)kvm_hp300.c 8.1 (Berkeley) 6/4/93"; */
40 static char *rcsid = "$Id: kvm_i386.c,v 1.8 1996/03/08 10:45:16 mycroft Exp $";
41 #endif /* LIBC_SCCS and not lint */
42
43 /*
44 * i386 machine dependent routines for kvm. Hopefully, the forthcoming
45 * vm code will one day obsolete this module.
46 */
47
48 #include <sys/param.h>
49 #include <sys/user.h>
50 #include <sys/proc.h>
51 #include <sys/stat.h>
52 #include <stdlib.h>
53 #include <unistd.h>
54 #include <nlist.h>
55 #include <kvm.h>
56
57 #include <vm/vm.h>
58 #include <vm/vm_param.h>
59
60 #include <limits.h>
61 #include <db.h>
62
63 #include "kvm_private.h"
64
65 #include <machine/pte.h>
66
67 #ifndef btop
68 #define btop(x) (((unsigned)(x)) >> PGSHIFT) /* XXX */
69 #define ptob(x) ((caddr_t)((x) << PGSHIFT)) /* XXX */
70 #endif
71
72 struct vmstate {
73 pd_entry_t *PTD;
74 };
75
76 void
77 _kvm_freevtop(kd)
78 kvm_t *kd;
79 {
80 if (kd->vmst != 0) {
81 if (kd->vmst->PTD != 0)
82 free(kd->vmst->PTD);
83
84 free(kd->vmst);
85 }
86 }
87
88 int
89 _kvm_initvtop(kd)
90 kvm_t *kd;
91 {
92 struct vmstate *vm;
93 struct nlist nlist[2];
94 u_long pa;
95
96 vm = (struct vmstate *)_kvm_malloc(kd, sizeof(*vm));
97 if (vm == 0)
98 return (-1);
99 kd->vmst = vm;
100
101 nlist[0].n_name = "_PTDpaddr";
102 nlist[1].n_name = 0;
103
104 if (kvm_nlist(kd, nlist) != 0) {
105 _kvm_err(kd, kd->program, "bad namelist");
106 return (-1);
107 }
108
109 vm->PTD = 0;
110
111 if (lseek(kd->pmfd, (off_t)(nlist[0].n_value - KERNBASE), 0) == -1 &&
112 errno != 0) {
113 _kvm_syserr(kd, kd->program, "kvm_lseek");
114 goto invalid;
115 }
116 if (read(kd->pmfd, &pa, sizeof pa) != sizeof pa) {
117 _kvm_syserr(kd, kd->program, "kvm_read");
118 goto invalid;
119 }
120
121 vm->PTD = (pd_entry_t *)_kvm_malloc(kd, NBPG);
122
123 if (lseek(kd->pmfd, (off_t)pa, 0) == -1 && errno != 0) {
124 _kvm_syserr(kd, kd->program, "kvm_lseek");
125 goto invalid;
126 }
127 if (read(kd->pmfd, vm->PTD, NBPG) != NBPG) {
128 _kvm_syserr(kd, kd->program, "kvm_read");
129 goto invalid;
130 }
131
132 return (0);
133
134 invalid:
135 if (vm->PTD != 0)
136 free(vm->PTD);
137 return (-1);
138 }
139
140 /*
141 * Translate a kernel virtual address to a physical address.
142 */
143 int
144 _kvm_kvatop(kd, va, pa)
145 kvm_t *kd;
146 u_long va;
147 u_long *pa;
148 {
149 struct vmstate *vm;
150 u_long offset;
151 u_long pte_pa;
152 pt_entry_t pte;
153
154 if (ISALIVE(kd)) {
155 _kvm_err(kd, 0, "vatop called in live kernel!");
156 return(0);
157 }
158
159 vm = kd->vmst;
160 offset = va & PGOFSET;
161
162 /*
163 * If we are initializing (kernel page table descriptor pointer
164 * not yet set) * then return pa == va to avoid infinite recursion.
165 */
166 if (vm->PTD == 0) {
167 *pa = va;
168 return (NBPG - offset);
169 }
170 if ((vm->PTD[pdei(va)] & PG_V) == 0)
171 goto invalid;
172
173 pte_pa = (vm->PTD[pdei(va)] & PG_FRAME) +
174 (ptei(va) * sizeof(pt_entry_t));
175 /* XXX READ PHYSICAL XXX */
176 {
177 if (lseek(kd->pmfd, (off_t)pte_pa, 0) == -1 && errno != 0) {
178 _kvm_syserr(kd, kd->program, "kvm_lseek");
179 goto invalid;
180 }
181 if (read(kd->pmfd, &pte, sizeof pte) != sizeof pte) {
182 _kvm_syserr(kd, kd->program, "kvm_read");
183 goto invalid;
184 }
185 }
186
187 *pa = (pte & PG_FRAME) + offset;
188 return (NBPG - offset);
189
190 invalid:
191 _kvm_err(kd, 0, "invalid address (%x)", va);
192 return (0);
193 }
194