kvm_mips.c revision 1.1 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1989, 1992, 1993
3 1.1 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software developed by the Computer Systems
6 1.1 cgd * Engineering group at Lawrence Berkeley Laboratory under DARPA contract
7 1.1 cgd * BG 91-66 and contributed to Berkeley. Modified for MIPS by Ralph Campbell.
8 1.1 cgd *
9 1.1 cgd * Redistribution and use in source and binary forms, with or without
10 1.1 cgd * modification, are permitted provided that the following conditions
11 1.1 cgd * are met:
12 1.1 cgd * 1. Redistributions of source code must retain the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer.
14 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 cgd * notice, this list of conditions and the following disclaimer in the
16 1.1 cgd * documentation and/or other materials provided with the distribution.
17 1.1 cgd * 3. All advertising materials mentioning features or use of this software
18 1.1 cgd * must display the following acknowledgement:
19 1.1 cgd * This product includes software developed by the University of
20 1.1 cgd * California, Berkeley and its contributors.
21 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
22 1.1 cgd * may be used to endorse or promote products derived from this software
23 1.1 cgd * without specific prior written permission.
24 1.1 cgd *
25 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 1.1 cgd * SUCH DAMAGE.
36 1.1 cgd */
37 1.1 cgd
38 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
39 1.1 cgd static char sccsid[] = "@(#)kvm_mips.c 8.1 (Berkeley) 6/4/93";
40 1.1 cgd #endif /* LIBC_SCCS and not lint */
41 1.1 cgd /*
42 1.1 cgd * MIPS machine dependent routines for kvm. Hopefully, the forthcoming
43 1.1 cgd * vm code will one day obsolete this module.
44 1.1 cgd */
45 1.1 cgd
46 1.1 cgd #include <sys/param.h>
47 1.1 cgd #include <sys/user.h>
48 1.1 cgd #include <sys/proc.h>
49 1.1 cgd #include <sys/stat.h>
50 1.1 cgd #include <unistd.h>
51 1.1 cgd #include <nlist.h>
52 1.1 cgd #include <kvm.h>
53 1.1 cgd
54 1.1 cgd #include <vm/vm.h>
55 1.1 cgd #include <vm/vm_param.h>
56 1.1 cgd
57 1.1 cgd #include <limits.h>
58 1.1 cgd #include <db.h>
59 1.1 cgd
60 1.1 cgd #include "kvm_private.h"
61 1.1 cgd
62 1.1 cgd #include <machine/machConst.h>
63 1.1 cgd #include <machine/pte.h>
64 1.1 cgd #include <machine/pmap.h>
65 1.1 cgd
66 1.1 cgd struct vmstate {
67 1.1 cgd pt_entry_t *Sysmap;
68 1.1 cgd u_int Sysmapsize;
69 1.1 cgd };
70 1.1 cgd
71 1.1 cgd #define KREAD(kd, addr, p)\
72 1.1 cgd (kvm_read(kd, addr, (char *)(p), sizeof(*(p))) != sizeof(*(p)))
73 1.1 cgd
74 1.1 cgd void
75 1.1 cgd _kvm_freevtop(kd)
76 1.1 cgd kvm_t *kd;
77 1.1 cgd {
78 1.1 cgd if (kd->vmst != 0)
79 1.1 cgd free(kd->vmst);
80 1.1 cgd }
81 1.1 cgd
82 1.1 cgd int
83 1.1 cgd _kvm_initvtop(kd)
84 1.1 cgd kvm_t *kd;
85 1.1 cgd {
86 1.1 cgd struct vmstate *vm;
87 1.1 cgd struct nlist nlist[3];
88 1.1 cgd
89 1.1 cgd vm = (struct vmstate *)_kvm_malloc(kd, sizeof(*vm));
90 1.1 cgd if (vm == 0)
91 1.1 cgd return (-1);
92 1.1 cgd kd->vmst = vm;
93 1.1 cgd
94 1.1 cgd nlist[0].n_name = "Sysmap";
95 1.1 cgd nlist[1].n_name = "Sysmapsize";
96 1.1 cgd nlist[2].n_name = 0;
97 1.1 cgd
98 1.1 cgd if (kvm_nlist(kd, nlist) != 0) {
99 1.1 cgd _kvm_err(kd, kd->program, "bad namelist");
100 1.1 cgd return (-1);
101 1.1 cgd }
102 1.1 cgd if (KREAD(kd, (u_long)nlist[0].n_value, &vm->Sysmap)) {
103 1.1 cgd _kvm_err(kd, kd->program, "cannot read Sysmap");
104 1.1 cgd return (-1);
105 1.1 cgd }
106 1.1 cgd if (KREAD(kd, (u_long)nlist[1].n_value, &vm->Sysmapsize)) {
107 1.1 cgd _kvm_err(kd, kd->program, "cannot read mmutype");
108 1.1 cgd return (-1);
109 1.1 cgd }
110 1.1 cgd return (0);
111 1.1 cgd }
112 1.1 cgd
113 1.1 cgd /*
114 1.1 cgd * Translate a kernel virtual address to a physical address.
115 1.1 cgd */
116 1.1 cgd int
117 1.1 cgd _kvm_kvatop(kd, va, pa)
118 1.1 cgd kvm_t *kd;
119 1.1 cgd u_long va;
120 1.1 cgd u_long *pa;
121 1.1 cgd {
122 1.1 cgd register struct vmstate *vm;
123 1.1 cgd u_long pte, addr, offset;
124 1.1 cgd
125 1.1 cgd if (ISALIVE(kd)) {
126 1.1 cgd _kvm_err(kd, 0, "vatop called in live kernel!");
127 1.1 cgd return((off_t)0);
128 1.1 cgd }
129 1.1 cgd vm = kd->vmst;
130 1.1 cgd offset = va & PGOFSET;
131 1.1 cgd /*
132 1.1 cgd * If we are initializing (kernel segment table pointer not yet set)
133 1.1 cgd * then return pa == va to avoid infinite recursion.
134 1.1 cgd */
135 1.1 cgd if (vm->Sysmap == 0) {
136 1.1 cgd *pa = va;
137 1.1 cgd return (NBPG - offset);
138 1.1 cgd }
139 1.1 cgd if (va < KERNBASE ||
140 1.1 cgd va >= VM_MIN_KERNEL_ADDRESS + vm->Sysmapsize * NBPG)
141 1.1 cgd goto invalid;
142 1.1 cgd if (va < VM_MIN_KERNEL_ADDRESS) {
143 1.1 cgd *pa = MACH_CACHED_TO_PHYS(va);
144 1.1 cgd return (NBPG - offset);
145 1.1 cgd }
146 1.1 cgd addr = (u_long)(vm->Sysmap + ((va - VM_MIN_KERNEL_ADDRESS) >> PGSHIFT));
147 1.1 cgd /*
148 1.1 cgd * Can't use KREAD to read kernel segment table entries.
149 1.1 cgd * Fortunately it is 1-to-1 mapped so we don't have to.
150 1.1 cgd */
151 1.1 cgd if (lseek(kd->pmfd, (off_t)addr, 0) < 0 ||
152 1.1 cgd read(kd->pmfd, (char *)&pte, sizeof(pte)) < 0)
153 1.1 cgd goto invalid;
154 1.1 cgd if (!(pte & PG_V))
155 1.1 cgd goto invalid;
156 1.1 cgd *pa = (pte & PG_FRAME) | offset;
157 1.1 cgd return (NBPG - offset);
158 1.1 cgd
159 1.1 cgd invalid:
160 1.1 cgd _kvm_err(kd, 0, "invalid address (%x)", va);
161 1.1 cgd return (0);
162 1.1 cgd }
163 1.1 cgd
164 1.1 cgd /*
165 1.1 cgd * Translate a user virtual address to a physical address.
166 1.1 cgd */
167 1.1 cgd int
168 1.1 cgd _kvm_uvatop(kd, p, va, pa)
169 1.1 cgd kvm_t *kd;
170 1.1 cgd const struct proc *p;
171 1.1 cgd u_long va;
172 1.1 cgd u_long *pa;
173 1.1 cgd {
174 1.1 cgd register struct vmspace *vms = p->p_vmspace;
175 1.1 cgd u_long kva, offset;
176 1.1 cgd
177 1.1 cgd if (va >= KERNBASE)
178 1.1 cgd goto invalid;
179 1.1 cgd
180 1.1 cgd /* read the address of the first level table */
181 1.1 cgd kva = (u_long)&vms->vm_pmap.pm_segtab;
182 1.1 cgd if (kvm_read(kd, kva, (char *)&kva, sizeof(kva)) != sizeof(kva))
183 1.1 cgd goto invalid;
184 1.1 cgd if (kva == 0)
185 1.1 cgd goto invalid;
186 1.1 cgd
187 1.1 cgd /* read the address of the second level table */
188 1.1 cgd kva += (va >> SEGSHIFT) * sizeof(caddr_t);
189 1.1 cgd if (kvm_read(kd, kva, (char *)&kva, sizeof(kva)) != sizeof(kva))
190 1.1 cgd goto invalid;
191 1.1 cgd if (kva == 0)
192 1.1 cgd goto invalid;
193 1.1 cgd
194 1.1 cgd /* read the pte from the second level table */
195 1.1 cgd kva += (va >> PGSHIFT) & (NPTEPG - 1);
196 1.1 cgd if (kvm_read(kd, kva, (char *)&kva, sizeof(kva)) != sizeof(kva))
197 1.1 cgd goto invalid;
198 1.1 cgd if (!(kva & PG_V))
199 1.1 cgd goto invalid;
200 1.1 cgd offset = va & PGOFSET;
201 1.1 cgd *pa = (kva & PG_FRAME) | offset;
202 1.1 cgd return (NBPG - offset);
203 1.1 cgd
204 1.1 cgd invalid:
205 1.1 cgd _kvm_err(kd, 0, "invalid address (%x)", va);
206 1.1 cgd return (0);
207 1.1 cgd }
208