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.3 1994/05/18 09:31:52 pk 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 <unistd.h> 53 #include <nlist.h> 54 #include <kvm.h> 55 56 #include <vm/vm.h> 57 #include <vm/vm_param.h> 58 59 #include <limits.h> 60 #include <db.h> 61 62 #include "kvm_private.h" 63 64 #include <machine/pte.h> 65 66 #ifndef btop 67 #define btop(x) (((unsigned)(x)) >> PGSHIFT) /* XXX */ 68 #define ptob(x) ((caddr_t)((x) << PGSHIFT)) /* XXX */ 69 #endif 70 71 struct vmstate { 72 struct pde **IdlePTD; 73 struct pde *PTD; 74 }; 75 76 #define KREAD(kd, addr, p)\ 77 (kvm_read(kd, addr, (char *)(p), sizeof(*(p))) != sizeof(*(p))) 78 79 void 80 _kvm_freevtop(kd) 81 kvm_t *kd; 82 { 83 if (kd->vmst->PTD != 0) 84 free(kd->vmst->PTD); 85 86 if (kd->vmst != 0) 87 free(kd->vmst); 88 } 89 90 int 91 _kvm_initvtop(kd) 92 kvm_t *kd; 93 { 94 struct vmstate *vm; 95 struct nlist nlist[2]; 96 97 vm = (struct vmstate *)_kvm_malloc(kd, sizeof(*vm)); 98 if (vm == 0) 99 return (-1); 100 kd->vmst = vm; 101 102 nlist[0].n_name = "_IdlePTD"; 103 nlist[1].n_name = 0; 104 105 if (kvm_nlist(kd, nlist) != 0) { 106 _kvm_err(kd, kd->program, "bad namelist"); 107 return (-1); 108 } 109 vm->IdlePTD = 0; 110 vm->PTD = 0; 111 if (KREAD(kd, (u_long)nlist[0].n_value, &vm->IdlePTD)) { 112 _kvm_err(kd, kd->program, "cannot read IdlePTD"); 113 return (-1); 114 } 115 vm->PTD = (struct pde *)_kvm_malloc(kd, NBPG); 116 if ((kvm_read(kd, (u_long)vm->IdlePTD, &vm->PTD, NBPG)) != NBPG) { 117 _kvm_err(kd, kd->program, "cannot read PTD"); 118 return (-1); 119 } 120 return (0); 121 } 122 123 /* 124 * Translate a kernel virtual address to a physical address. 125 */ 126 int 127 _kvm_kvatop(kd, va, pa) 128 kvm_t *kd; 129 u_long va; 130 u_long *pa; 131 { 132 struct vmstate *vm; 133 u_long offset; 134 135 if (ISALIVE(kd)) { 136 _kvm_err(kd, 0, "vatop called in live kernel!"); 137 return(0); 138 } 139 vm = kd->vmst; 140 offset = va & PGOFSET; 141 142 invalid: 143 _kvm_err(kd, 0, "invalid address (%x)", va); 144 return (0); 145 } 146 147 /* 148 * Translate a user virtual address to a physical address. 149 */ 150 int 151 _kvm_uvatop(kd, p, va, pa) 152 kvm_t *kd; 153 const struct proc *p; 154 u_long va; 155 u_long *pa; 156 { 157 struct vmspace vms; 158 struct pde pde, *pdeloc; 159 struct pte pte, *pteloc; 160 u_long kva, offset; 161 162 if (va >= KERNBASE) 163 goto invalid; 164 165 /* XXX - should be passed a `kinfo_proc *' here */ 166 if (kvm_read(kd, (u_long)p->p_vmspace, (char *)&vms, sizeof(vms)) != 167 sizeof(vms)) 168 goto invalid; 169 170 pdeloc = (struct pde *)vms.vm_pmap.pm_pdir + (va >> PDSHIFT); 171 if (kvm_read(kd, (u_long)pdeloc, (char *)&pde, sizeof(pde)) != 172 sizeof(pde)) 173 goto invalid; 174 if (pde.pd_v == 0) 175 goto invalid; 176 177 pteloc = (struct pte *)ptob(pde.pd_pfnum) + btop(va & PT_MASK); 178 if (lseek(kd->pmfd, (off_t)(u_long)pteloc, 0) != (off_t)(u_long)pteloc) 179 goto invalid; 180 if (read(kd->pmfd, (char *)&pte, sizeof(pte)) != sizeof(pte)) 181 goto invalid; 182 if (pte.pg_v == 0) 183 goto invalid; 184 185 offset = va & PGOFSET; 186 *pa = (u_long)ptob(pte.pg_pfnum) + offset; 187 return (NBPG - offset); 188 189 invalid: 190 _kvm_err(kd, 0, "invalid address (%x)", va); 191 return (0); 192 } 193