xref: /netbsd/lib/libkvm/kvm_m68k_cmn.c (revision 6550d01e)
1 /*	$NetBSD: kvm_m68k_cmn.c,v 1.16 2010/09/26 22:28:05 jym Exp $	*/
2 
3 /*-
4  * Copyright (c) 1989, 1992, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This code is derived from software developed by the Computer Systems
8  * Engineering group at Lawrence Berkeley Laboratory under DARPA contract
9  * BG 91-66 and contributed to Berkeley.
10  *
11  * Redistribution and use in source and binary forms, with or without
12  * modification, are permitted provided that the following conditions
13  * are met:
14  * 1. Redistributions of source code must retain the above copyright
15  *    notice, this list of conditions and the following disclaimer.
16  * 2. Redistributions in binary form must reproduce the above copyright
17  *    notice, this list of conditions and the following disclaimer in the
18  *    documentation and/or other materials provided with the distribution.
19  * 3. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 /*-
37  * Copyright (c) 1997 Jason R. Thorpe.  All rights reserved.
38  *
39  * This code is derived from software developed by the Computer Systems
40  * Engineering group at Lawrence Berkeley Laboratory under DARPA contract
41  * BG 91-66 and contributed to Berkeley.
42  *
43  * Redistribution and use in source and binary forms, with or without
44  * modification, are permitted provided that the following conditions
45  * are met:
46  * 1. Redistributions of source code must retain the above copyright
47  *    notice, this list of conditions and the following disclaimer.
48  * 2. Redistributions in binary form must reproduce the above copyright
49  *    notice, this list of conditions and the following disclaimer in the
50  *    documentation and/or other materials provided with the distribution.
51  * 3. All advertising materials mentioning features or use of this software
52  *    must display the following acknowledgement:
53  *	This product includes software developed by the University of
54  *	California, Berkeley and its contributors.
55  * 4. Neither the name of the University nor the names of its contributors
56  *    may be used to endorse or promote products derived from this software
57  *    without specific prior written permission.
58  *
59  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
60  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
61  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
62  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
63  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
64  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
65  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
66  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
67  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
68  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
69  * SUCH DAMAGE.
70  */
71 
72 #include <sys/cdefs.h>
73 #if defined(LIBC_SCCS) && !defined(lint)
74 #if 0
75 static char sccsid[] = "@(#)kvm_hp300.c	8.1 (Berkeley) 6/4/93";
76 #else
77 __RCSID("$NetBSD: kvm_m68k_cmn.c,v 1.16 2010/09/26 22:28:05 jym Exp $");
78 #endif
79 #endif /* LIBC_SCCS and not lint */
80 
81 /*
82  * Common m68k machine dependent routines for kvm.
83  *
84  * Note: This file has to build on ALL m68k machines,
85  * so do NOT include any <machine / *.h> files here.
86  */
87 
88 #include <sys/types.h>
89 #include <sys/kcore.h>
90 
91 #include <unistd.h>
92 #include <limits.h>
93 #include <nlist.h>
94 #include <kvm.h>
95 #include <db.h>
96 
97 #include <m68k/cpu.h>
98 #include <m68k/kcore.h>
99 
100 #include "kvm_private.h"
101 #include "kvm_m68k.h"
102 
103 int   _kvm_cmn_initvtop(kvm_t *);
104 void  _kvm_cmn_freevtop(kvm_t *);
105 int   _kvm_cmn_kvatop(kvm_t *, vaddr_t, paddr_t *);
106 off_t _kvm_cmn_pa2off(kvm_t *, paddr_t);
107 
108 struct kvm_ops _kvm_ops_cmn = {
109 	_kvm_cmn_initvtop,
110 	_kvm_cmn_freevtop,
111 	_kvm_cmn_kvatop,
112 	_kvm_cmn_pa2off };
113 
114 static int vatop_030(kvm_t *, uint32_t, vaddr_t, paddr_t *);
115 static int vatop_040(kvm_t *, uint32_t, vaddr_t, paddr_t *);
116 
117 #define	_kvm_btop(v, a)	(((unsigned)(a)) >> (v)->pgshift)
118 
119 void
120 _kvm_cmn_freevtop(kvm_t *kd)
121 {
122 	/* No private state information to keep. */
123 }
124 
125 int
126 _kvm_cmn_initvtop(kvm_t *kd)
127 {
128 	/* No private state information to keep. */
129 	return (0);
130 }
131 
132 int
133 _kvm_cmn_kvatop(kvm_t *kd, vaddr_t va, paddr_t *pa)
134 {
135 	cpu_kcore_hdr_t *h = kd->cpu_data;
136 	struct m68k_kcore_hdr *m = &h->un._m68k;
137 	int (*vtopf)(kvm_t *, uint32_t, vaddr_t, paddr_t *);
138 
139 	if (ISALIVE(kd)) {
140 		_kvm_err(kd, 0, "vatop called in live kernel!");
141 		return (0);
142 	}
143 
144 	/*
145 	 * 68040 and 68060 use same translation functions,
146 	 * as do 68030, 68851, HP MMU.
147 	 */
148 	if (m->mmutype == MMU_68040 || m->mmutype == MMU_68060)
149 		vtopf = vatop_040;
150 	else
151 		vtopf = vatop_030;
152 
153 	return ((*vtopf)(kd, m->sysseg_pa, va, pa));
154 }
155 
156 /*
157  * Translate a physical address to a file-offset in the crash dump.
158  */
159 off_t
160 _kvm_cmn_pa2off(kvm_t *kd, u_long pa)
161 {
162 	cpu_kcore_hdr_t *h = kd->cpu_data;
163 	struct m68k_kcore_hdr *m = &h->un._m68k;
164 	phys_ram_seg_t *rsp;
165 	off_t off;
166 	int i;
167 
168 	off = 0;
169 	rsp = m->ram_segs;
170 	for (i = 0; i < M68K_NPHYS_RAM_SEGS && rsp[i].size != 0; i++) {
171 		if (pa >= rsp[i].start &&
172 		    pa < (rsp[i].start + rsp[i].size)) {
173 			pa -= rsp[i].start;
174 			break;
175 		}
176 		off += rsp[i].size;
177 	}
178 	return (kd->dump_off + off + pa);
179 }
180 
181 /*****************************************************************
182  * Local stuff...
183  */
184 
185 static int
186 vatop_030(kvm_t *kd, uint32_t stpa, vaddr_t va, paddr_t *pa)
187 {
188 	cpu_kcore_hdr_t *h = kd->cpu_data;
189 	struct m68k_kcore_hdr *m = &h->un._m68k;
190 	struct vmstate *vm = kd->vmst;
191 	paddr_t addr;
192 	uint32_t ste, pte;
193 	u_int p, offset;
194 
195 	offset = va & vm->pgofset;
196 
197 	/*
198 	 * We may be called before address translation is initialized.
199 	 * This is typically used to find the dump magic number.  This
200 	 * means we do not yet have the kernel page tables available,
201 	 * so we must to a simple relocation.
202 	 */
203 	if (va < m->relocend) {
204 		*pa = (va - h->kernbase) + m->reloc;
205 		return (h->page_size - offset);
206 	}
207 
208 	addr = stpa + ((va >> m->sg_ishift) * sizeof(u_int32_t));
209 
210 	/*
211 	 * Can't use KREAD to read kernel segment table entries.
212 	 * Fortunately it is 1-to-1 mapped so we don't have to.
213 	 */
214 	if (stpa == m->sysseg_pa) {
215 		if (_kvm_pread(kd, kd->pmfd, &ste, sizeof(ste),
216 		    _kvm_cmn_pa2off(kd, addr)) != sizeof(ste))
217 			goto invalid;
218 	} else if (KREAD(kd, addr, &ste))
219 		goto invalid;
220 	if ((ste & m->sg_v) == 0) {
221 		_kvm_err(kd, 0, "invalid segment (%x)", ste);
222 		return(0);
223 	}
224 	p = _kvm_btop(vm, va & m->sg_pmask);
225 	addr = (ste & m->sg_frame) + (p * sizeof(u_int32_t));
226 
227 	/*
228 	 * Address from STE is a physical address so don't use kvm_read.
229 	 */
230 	if (_kvm_pread(kd, kd->pmfd, &pte, sizeof(pte),
231 	    _kvm_cmn_pa2off(kd, addr)) != sizeof(pte))
232 		goto invalid;
233 	addr = pte & m->pg_frame;
234 	if ((pte & m->pg_v) == 0) {
235 		_kvm_err(kd, 0, "page not valid");
236 		return (0);
237 	}
238 	*pa = addr + offset;
239 
240 	return (h->page_size - offset);
241 invalid:
242 	_kvm_err(kd, 0, "invalid address (%lx)", va);
243 	return (0);
244 }
245 
246 static int
247 vatop_040(kvm_t *kd, uint32_t stpa, vaddr_t va, paddr_t *pa)
248 {
249 	cpu_kcore_hdr_t *h = kd->cpu_data;
250 	struct m68k_kcore_hdr *m = &h->un._m68k;
251 	struct vmstate *vm = kd->vmst;
252 	paddr_t addr;
253 	uint32_t stpa2;
254 	uint32_t ste, pte;
255 	u_int offset;
256 
257 	offset = va & vm->pgofset;
258 
259 	/*
260 	 * We may be called before address translation is initialized.
261 	 * This is typically used to find the dump magic number.  This
262 	 * means we do not yet have the kernel page tables available,
263 	 * so we must to a simple relocation.
264 	 */
265 	if (va < m->relocend) {
266 		*pa = (va - h->kernbase) + m->reloc;
267 		return (h->page_size - offset);
268 	}
269 
270 	addr = stpa + ((va >> m->sg40_shift1) * sizeof(u_int32_t));
271 
272 	/*
273 	 * Can't use KREAD to read kernel segment table entries.
274 	 * Fortunately it is 1-to-1 mapped so we don't have to.
275 	 */
276 	if (stpa == m->sysseg_pa) {
277 		if (_kvm_pread(kd, kd->pmfd, &ste, sizeof(ste),
278 		    _kvm_cmn_pa2off(kd, addr)) != sizeof(ste))
279 			goto invalid;
280 	} else if (KREAD(kd, addr, &ste))
281 		goto invalid;
282 	if ((ste & m->sg_v) == 0) {
283 		_kvm_err(kd, 0, "invalid level 1 descriptor (%x)",
284 				 ste);
285 		return((off_t)0);
286 	}
287 	stpa2 = (ste & m->sg40_addr1);
288 	addr = stpa2 + (((va & m->sg40_mask2) >> m->sg40_shift2) *
289 	    sizeof(u_int32_t));
290 
291 	/*
292 	 * Address from level 1 STE is a physical address,
293 	 * so don't use kvm_read.
294 	 */
295 	if (_kvm_pread(kd, kd->pmfd, &ste, sizeof(ste),
296 	    _kvm_cmn_pa2off(kd, addr)) != sizeof(ste))
297 		goto invalid;
298 	if ((ste & m->sg_v) == 0) {
299 		_kvm_err(kd, 0, "invalid level 2 descriptor (%x)",
300 				 ste);
301 		return((off_t)0);
302 	}
303 	stpa2 = (ste & m->sg40_addr2);
304 	addr = stpa2 + (((va & m->sg40_mask3) >> m->sg40_shift3) *
305 	    sizeof(u_int32_t));
306 
307 	/*
308 	 * Address from STE is a physical address so don't use kvm_read.
309 	 */
310 	if (_kvm_pread(kd, kd->pmfd, &pte, sizeof(pte),
311 	    _kvm_cmn_pa2off(kd, addr)) != sizeof(pte))
312 		goto invalid;
313 	addr = pte & m->pg_frame;
314 	if ((pte & m->pg_v) == 0) {
315 		_kvm_err(kd, 0, "page not valid");
316 		return (0);
317 	}
318 	*pa = addr + offset;
319 
320 	return (h->page_size - offset);
321 
322 invalid:
323 	_kvm_err(kd, 0, "invalid address (%lx)", va);
324 	return (0);
325 }
326