1 /* $NetBSD: kvm_mips.c,v 1.3 1996/03/18 22:33:44 thorpej 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. Modified for MIPS by Ralph Campbell. 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. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the University of 22 * California, Berkeley and its contributors. 23 * 4. Neither the name of the University nor the names of its contributors 24 * may be used to endorse or promote products derived from this software 25 * without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 28 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 29 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 30 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 31 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 32 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 33 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 34 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 35 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 36 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 37 * SUCH DAMAGE. 38 */ 39 40 #if defined(LIBC_SCCS) && !defined(lint) 41 #if 0 42 static char sccsid[] = "@(#)kvm_mips.c 8.1 (Berkeley) 6/4/93"; 43 #else 44 static char *rcsid = "$NetBSD: kvm_mips.c,v 1.3 1996/03/18 22:33:44 thorpej Exp $"; 45 #endif 46 #endif /* LIBC_SCCS and not lint */ 47 48 /* 49 * MIPS machine dependent routines for kvm. Hopefully, the forthcoming 50 * vm code will one day obsolete this module. 51 */ 52 53 #include <sys/param.h> 54 #include <sys/user.h> 55 #include <sys/proc.h> 56 #include <sys/stat.h> 57 #include <unistd.h> 58 #include <nlist.h> 59 #include <kvm.h> 60 61 #include <vm/vm.h> 62 #include <vm/vm_param.h> 63 64 #include <limits.h> 65 #include <db.h> 66 67 #include "kvm_private.h" 68 69 #include <machine/machConst.h> 70 #include <machine/pte.h> 71 #include <machine/pmap.h> 72 73 struct vmstate { 74 pt_entry_t *Sysmap; 75 u_int Sysmapsize; 76 }; 77 78 #define KREAD(kd, addr, p)\ 79 (kvm_read(kd, addr, (char *)(p), sizeof(*(p))) != sizeof(*(p))) 80 81 void 82 _kvm_freevtop(kd) 83 kvm_t *kd; 84 { 85 if (kd->vmst != 0) 86 free(kd->vmst); 87 } 88 89 int 90 _kvm_initvtop(kd) 91 kvm_t *kd; 92 { 93 struct vmstate *vm; 94 struct nlist nlist[3]; 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 = "Sysmap"; 102 nlist[1].n_name = "Sysmapsize"; 103 nlist[2].n_name = 0; 104 105 if (kvm_nlist(kd, nlist) != 0) { 106 _kvm_err(kd, kd->program, "bad namelist"); 107 return (-1); 108 } 109 if (KREAD(kd, (u_long)nlist[0].n_value, &vm->Sysmap)) { 110 _kvm_err(kd, kd->program, "cannot read Sysmap"); 111 return (-1); 112 } 113 if (KREAD(kd, (u_long)nlist[1].n_value, &vm->Sysmapsize)) { 114 _kvm_err(kd, kd->program, "cannot read mmutype"); 115 return (-1); 116 } 117 return (0); 118 } 119 120 /* 121 * Translate a kernel virtual address to a physical address. 122 */ 123 int 124 _kvm_kvatop(kd, va, pa) 125 kvm_t *kd; 126 u_long va; 127 u_long *pa; 128 { 129 register struct vmstate *vm; 130 u_long pte, addr, offset; 131 132 if (ISALIVE(kd)) { 133 _kvm_err(kd, 0, "vatop called in live kernel!"); 134 return((off_t)0); 135 } 136 vm = kd->vmst; 137 offset = va & PGOFSET; 138 /* 139 * If we are initializing (kernel segment table pointer not yet set) 140 * then return pa == va to avoid infinite recursion. 141 */ 142 if (vm->Sysmap == 0) { 143 *pa = va; 144 return (NBPG - offset); 145 } 146 if (va < KERNBASE || 147 va >= VM_MIN_KERNEL_ADDRESS + vm->Sysmapsize * NBPG) 148 goto invalid; 149 if (va < VM_MIN_KERNEL_ADDRESS) { 150 *pa = MACH_CACHED_TO_PHYS(va); 151 return (NBPG - offset); 152 } 153 addr = (u_long)(vm->Sysmap + ((va - VM_MIN_KERNEL_ADDRESS) >> PGSHIFT)); 154 /* 155 * Can't use KREAD to read kernel segment table entries. 156 * Fortunately it is 1-to-1 mapped so we don't have to. 157 */ 158 if (lseek(kd->pmfd, (off_t)addr, 0) < 0 || 159 read(kd->pmfd, (char *)&pte, sizeof(pte)) < 0) 160 goto invalid; 161 if (!(pte & PG_V)) 162 goto invalid; 163 *pa = (pte & PG_FRAME) | offset; 164 return (NBPG - offset); 165 166 invalid: 167 _kvm_err(kd, 0, "invalid address (%x)", va); 168 return (0); 169 } 170