kvm_x86_64.c revision 1.11 1 1.11 chs /* $NetBSD: kvm_x86_64.c,v 1.11 2020/03/08 00:14:18 chs Exp $ */
2 1.1 fvdl
3 1.1 fvdl /*-
4 1.1 fvdl * Copyright (c) 1989, 1992, 1993
5 1.1 fvdl * The Regents of the University of California. All rights reserved.
6 1.1 fvdl *
7 1.1 fvdl * This code is derived from software developed by the Computer Systems
8 1.1 fvdl * Engineering group at Lawrence Berkeley Laboratory under DARPA contract
9 1.1 fvdl * BG 91-66 and contributed to Berkeley.
10 1.1 fvdl *
11 1.1 fvdl * Redistribution and use in source and binary forms, with or without
12 1.1 fvdl * modification, are permitted provided that the following conditions
13 1.1 fvdl * are met:
14 1.1 fvdl * 1. Redistributions of source code must retain the above copyright
15 1.1 fvdl * notice, this list of conditions and the following disclaimer.
16 1.1 fvdl * 2. Redistributions in binary form must reproduce the above copyright
17 1.1 fvdl * notice, this list of conditions and the following disclaimer in the
18 1.1 fvdl * documentation and/or other materials provided with the distribution.
19 1.4 agc * 3. Neither the name of the University nor the names of its contributors
20 1.1 fvdl * may be used to endorse or promote products derived from this software
21 1.1 fvdl * without specific prior written permission.
22 1.1 fvdl *
23 1.1 fvdl * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 fvdl * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 fvdl * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 fvdl * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 fvdl * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 fvdl * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 fvdl * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 fvdl * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 fvdl * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 fvdl * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 fvdl * SUCH DAMAGE.
34 1.1 fvdl */
35 1.1 fvdl
36 1.1 fvdl #include <sys/cdefs.h>
37 1.1 fvdl #if defined(LIBC_SCCS) && !defined(lint)
38 1.1 fvdl #if 0
39 1.1 fvdl static char sccsid[] = "@(#)kvm_hp300.c 8.1 (Berkeley) 6/4/93";
40 1.1 fvdl #else
41 1.11 chs __RCSID("$NetBSD: kvm_x86_64.c,v 1.11 2020/03/08 00:14:18 chs Exp $");
42 1.1 fvdl #endif
43 1.1 fvdl #endif /* LIBC_SCCS and not lint */
44 1.1 fvdl
45 1.1 fvdl /*
46 1.1 fvdl * x86-64 machine dependent routines for kvm.
47 1.1 fvdl */
48 1.1 fvdl
49 1.1 fvdl #include <sys/param.h>
50 1.1 fvdl #include <sys/proc.h>
51 1.1 fvdl #include <sys/stat.h>
52 1.1 fvdl #include <sys/kcore.h>
53 1.8 jym #include <sys/types.h>
54 1.8 jym
55 1.1 fvdl #include <stdlib.h>
56 1.1 fvdl #include <unistd.h>
57 1.1 fvdl #include <nlist.h>
58 1.1 fvdl #include <kvm.h>
59 1.1 fvdl
60 1.1 fvdl #include <uvm/uvm_extern.h>
61 1.1 fvdl
62 1.1 fvdl #include <limits.h>
63 1.1 fvdl #include <db.h>
64 1.1 fvdl
65 1.1 fvdl #include "kvm_private.h"
66 1.1 fvdl
67 1.8 jym #include <machine/kcore.h>
68 1.2 matt #include <machine/pmap.h>
69 1.1 fvdl #include <machine/pte.h>
70 1.2 matt #include <machine/vmparam.h>
71 1.1 fvdl
72 1.1 fvdl void
73 1.7 jym _kvm_freevtop(kvm_t *kd)
74 1.1 fvdl {
75 1.1 fvdl
76 1.1 fvdl /* Not actually used for anything right now, but safe. */
77 1.1 fvdl if (kd->vmst != 0)
78 1.1 fvdl free(kd->vmst);
79 1.1 fvdl }
80 1.1 fvdl
81 1.1 fvdl /*ARGSUSED*/
82 1.1 fvdl int
83 1.7 jym _kvm_initvtop(kvm_t *kd)
84 1.1 fvdl {
85 1.1 fvdl
86 1.1 fvdl return (0);
87 1.1 fvdl }
88 1.1 fvdl
89 1.1 fvdl /*
90 1.1 fvdl * Translate a kernel virtual address to a physical address.
91 1.1 fvdl */
92 1.1 fvdl int
93 1.8 jym _kvm_kvatop(kvm_t *kd, vaddr_t va, paddr_t *pa)
94 1.1 fvdl {
95 1.1 fvdl cpu_kcore_hdr_t *cpu_kh;
96 1.1 fvdl u_long page_off;
97 1.1 fvdl pd_entry_t pde;
98 1.1 fvdl pt_entry_t pte;
99 1.3 fvdl paddr_t pde_pa, pte_pa;
100 1.1 fvdl
101 1.1 fvdl if (ISALIVE(kd)) {
102 1.1 fvdl _kvm_err(kd, 0, "vatop called in live kernel!");
103 1.1 fvdl return (0);
104 1.1 fvdl }
105 1.1 fvdl
106 1.1 fvdl cpu_kh = kd->cpu_data;
107 1.1 fvdl
108 1.1 fvdl /*
109 1.3 fvdl * Find and read all entries to get to the pa.
110 1.3 fvdl */
111 1.3 fvdl
112 1.3 fvdl /*
113 1.3 fvdl * Level 4.
114 1.3 fvdl */
115 1.5 fvdl pde_pa = cpu_kh->ptdpaddr + (pl4_pi(va) * sizeof(pd_entry_t));
116 1.6 ad if (_kvm_pread(kd, kd->pmfd, (void *)&pde, sizeof(pde),
117 1.3 fvdl _kvm_pa2off(kd, pde_pa)) != sizeof(pde)) {
118 1.3 fvdl _kvm_syserr(kd, 0, "could not read PT level 4 entry");
119 1.3 fvdl goto lose;
120 1.3 fvdl }
121 1.3 fvdl if ((pde & PG_V) == 0) {
122 1.3 fvdl _kvm_err(kd, 0, "invalid translation (invalid level 4 PDE)");
123 1.3 fvdl goto lose;
124 1.3 fvdl }
125 1.3 fvdl
126 1.3 fvdl /*
127 1.3 fvdl * Level 3.
128 1.1 fvdl */
129 1.5 fvdl pde_pa = (pde & PG_FRAME) + (pl3_pi(va) * sizeof(pd_entry_t));
130 1.6 ad if (_kvm_pread(kd, kd->pmfd, (void *)&pde, sizeof(pde),
131 1.1 fvdl _kvm_pa2off(kd, pde_pa)) != sizeof(pde)) {
132 1.3 fvdl _kvm_syserr(kd, 0, "could not read PT level 3 entry");
133 1.3 fvdl goto lose;
134 1.3 fvdl }
135 1.3 fvdl if ((pde & PG_V) == 0) {
136 1.3 fvdl _kvm_err(kd, 0, "invalid translation (invalid level 3 PDE)");
137 1.1 fvdl goto lose;
138 1.1 fvdl }
139 1.9 chs if (pde & PG_PS) {
140 1.9 chs page_off = va & (NBPD_L3 - 1);
141 1.9 chs *pa = (pde & PG_1GFRAME) + page_off;
142 1.9 chs return (int)(NBPD_L3 - page_off);
143 1.9 chs }
144 1.1 fvdl
145 1.1 fvdl /*
146 1.3 fvdl * Level 2.
147 1.1 fvdl */
148 1.5 fvdl pde_pa = (pde & PG_FRAME) + (pl2_pi(va) * sizeof(pd_entry_t));
149 1.6 ad if (_kvm_pread(kd, kd->pmfd, (void *)&pde, sizeof(pde),
150 1.3 fvdl _kvm_pa2off(kd, pde_pa)) != sizeof(pde)) {
151 1.3 fvdl _kvm_syserr(kd, 0, "could not read PT level 2 entry");
152 1.3 fvdl goto lose;
153 1.3 fvdl }
154 1.1 fvdl if ((pde & PG_V) == 0) {
155 1.3 fvdl _kvm_err(kd, 0, "invalid translation (invalid level 2 PDE)");
156 1.1 fvdl goto lose;
157 1.1 fvdl }
158 1.9 chs if (pde & PG_PS) {
159 1.9 chs page_off = va & (NBPD_L2 - 1);
160 1.9 chs *pa = (pde & PG_2MFRAME) + page_off;
161 1.9 chs return (int)(NBPD_L2 - page_off);
162 1.9 chs }
163 1.3 fvdl
164 1.3 fvdl /*
165 1.3 fvdl * Level 1.
166 1.3 fvdl */
167 1.5 fvdl pte_pa = (pde & PG_FRAME) + (pl1_pi(va) * sizeof(pt_entry_t));
168 1.6 ad if (_kvm_pread(kd, kd->pmfd, (void *) &pte, sizeof(pte),
169 1.1 fvdl _kvm_pa2off(kd, pte_pa)) != sizeof(pte)) {
170 1.1 fvdl _kvm_syserr(kd, 0, "could not read PTE");
171 1.1 fvdl goto lose;
172 1.1 fvdl }
173 1.1 fvdl /*
174 1.1 fvdl * Validate the PTE and return the physical address.
175 1.1 fvdl */
176 1.1 fvdl if ((pte & PG_V) == 0) {
177 1.1 fvdl _kvm_err(kd, 0, "invalid translation (invalid PTE)");
178 1.1 fvdl goto lose;
179 1.1 fvdl }
180 1.9 chs page_off = va & PGOFSET;
181 1.1 fvdl *pa = (pte & PG_FRAME) + page_off;
182 1.1 fvdl return (int)(NBPG - page_off);
183 1.1 fvdl
184 1.1 fvdl lose:
185 1.1 fvdl *pa = (u_long)~0L;
186 1.1 fvdl return (0);
187 1.1 fvdl }
188 1.1 fvdl
189 1.11 chs struct p2o {
190 1.11 chs paddr_t pa;
191 1.11 chs psize_t sz;
192 1.11 chs off_t off;
193 1.11 chs };
194 1.11 chs
195 1.11 chs static int
196 1.11 chs cmp_p2o(const void *a, const void *b)
197 1.11 chs {
198 1.11 chs const struct p2o *p1 = a;
199 1.11 chs const struct p2o *p2 = b;
200 1.11 chs
201 1.11 chs /* If one range contains the start of the other, it's a match. */
202 1.11 chs if (p1->pa >= p2->pa && p1->pa < p2->pa + p2->sz) {
203 1.11 chs return 0;
204 1.11 chs }
205 1.11 chs if (p2->pa >= p1->pa && p2->pa < p1->pa + p1->sz) {
206 1.11 chs return 0;
207 1.11 chs }
208 1.11 chs
209 1.11 chs /* Otherwise sort by pa. */
210 1.11 chs if (p1->pa < p2->pa)
211 1.11 chs return -1;
212 1.11 chs else if (p1->pa > p2->pa)
213 1.11 chs return 1;
214 1.11 chs else
215 1.11 chs return 0;
216 1.11 chs }
217 1.11 chs
218 1.11 chs
219 1.1 fvdl /*
220 1.1 fvdl * Translate a physical address to a file-offset in the crash dump.
221 1.1 fvdl */
222 1.1 fvdl off_t
223 1.8 jym _kvm_pa2off(kvm_t *kd, paddr_t pa)
224 1.1 fvdl {
225 1.1 fvdl cpu_kcore_hdr_t *cpu_kh;
226 1.1 fvdl phys_ram_seg_t *ramsegs;
227 1.1 fvdl off_t off;
228 1.1 fvdl int i;
229 1.1 fvdl
230 1.11 chs static struct p2o *map;
231 1.11 chs struct p2o key, *val;
232 1.11 chs
233 1.1 fvdl cpu_kh = kd->cpu_data;
234 1.1 fvdl ramsegs = (void *)((char *)(void *)cpu_kh + ALIGN(sizeof *cpu_kh));
235 1.1 fvdl
236 1.11 chs if (map == NULL) {
237 1.11 chs map = calloc(sizeof *map, cpu_kh->nmemsegs);
238 1.11 chs off = 0;
239 1.11 chs for (i = 0; i < cpu_kh->nmemsegs; i++) {
240 1.11 chs map[i].pa = ramsegs[i].start;
241 1.11 chs map[i].sz = ramsegs[i].size;
242 1.11 chs map[i].off = off;
243 1.11 chs off += ramsegs[i].size;
244 1.1 fvdl }
245 1.11 chs #if 0
246 1.11 chs /* The array appears to be sorted already */
247 1.11 chs qsort(map, cpu_kh->nmemsegs, sizeof(*map), cmp_p2o);
248 1.11 chs #endif
249 1.1 fvdl }
250 1.1 fvdl
251 1.11 chs key.pa = pa;
252 1.11 chs key.sz = 1;
253 1.11 chs key.off = -1;
254 1.11 chs val = bsearch(&key, map, cpu_kh->nmemsegs, sizeof (key), cmp_p2o);
255 1.11 chs if (val)
256 1.11 chs off = val->off + pa - val->pa;
257 1.11 chs else
258 1.11 chs off = 0;
259 1.11 chs
260 1.1 fvdl return (kd->dump_off + off);
261 1.1 fvdl }
262 1.1 fvdl
263 1.1 fvdl /*
264 1.1 fvdl * Machine-dependent initialization for ALL open kvm descriptors,
265 1.1 fvdl * not just those for a kernel crash dump. Some architectures
266 1.1 fvdl * have to deal with these NOT being constants! (i.e. m68k)
267 1.1 fvdl */
268 1.1 fvdl int
269 1.7 jym _kvm_mdopen(kvm_t *kd)
270 1.1 fvdl {
271 1.1 fvdl
272 1.1 fvdl kd->usrstack = USRSTACK;
273 1.1 fvdl kd->min_uva = VM_MIN_ADDRESS;
274 1.1 fvdl kd->max_uva = VM_MAXUSER_ADDRESS;
275 1.1 fvdl
276 1.1 fvdl return (0);
277 1.1 fvdl }
278