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 #if 0 40 static char sccsid[] = "@(#)kvm_hp300.c 8.1 (Berkeley) 6/4/93"; 41 #else 42 static const char rcsid[] = 43 "$FreeBSD$"; 44 #endif 45 #endif /* LIBC_SCCS and not lint */ 46 47 /* 48 * i386 machine dependent routines for kvm. Hopefully, the forthcoming 49 * vm code will one day obsolete this module. 50 */ 51 52 #include <sys/param.h> 53 #include <sys/user.h> 54 #include <sys/proc.h> 55 #include <sys/stat.h> 56 #include <stdlib.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 66 #include "kvm_private.h" 67 68 #ifndef btop 69 #define btop(x) (i386_btop(x)) 70 #define ptob(x) (i386_ptob(x)) 71 #endif 72 73 struct vmstate { 74 pd_entry_t *PTD; 75 }; 76 77 void 78 _kvm_freevtop(kvm_t *kd) 79 { 80 if (kd->vmst != 0) { 81 if (kd->vmst->PTD) { 82 free(kd->vmst->PTD); 83 } 84 free(kd->vmst); 85 } 86 } 87 88 int 89 _kvm_initvtop(kvm_t *kd) 90 { 91 struct vmstate *vm; 92 struct nlist nlist[2]; 93 u_long pa; 94 pd_entry_t *PTD; 95 96 vm = (struct vmstate *)_kvm_malloc(kd, sizeof(*vm)); 97 if (vm == 0) { 98 _kvm_err(kd, kd->program, "cannot allocate vm"); 99 return (-1); 100 } 101 kd->vmst = vm; 102 vm->PTD = 0; 103 104 nlist[0].n_name = "_IdlePTD"; 105 nlist[1].n_name = 0; 106 107 if (kvm_nlist(kd, nlist) != 0) { 108 _kvm_err(kd, kd->program, "bad namelist"); 109 return (-1); 110 } 111 if (kvm_read(kd, (nlist[0].n_value - KERNBASE), &pa, sizeof(pa)) != sizeof(pa)) { 112 _kvm_err(kd, kd->program, "cannot read IdlePTD"); 113 return (-1); 114 } 115 PTD = _kvm_malloc(kd, PAGE_SIZE); 116 if (kvm_read(kd, pa, PTD, PAGE_SIZE) != PAGE_SIZE) { 117 _kvm_err(kd, kd->program, "cannot read PTD"); 118 return (-1); 119 } 120 vm->PTD = PTD; 121 return (0); 122 } 123 124 static int 125 _kvm_vatop(kvm_t *kd, u_long va, u_long *pa) 126 { 127 struct vmstate *vm; 128 u_long offset; 129 u_long pte_pa; 130 pd_entry_t pde; 131 pt_entry_t pte; 132 u_long pdeindex; 133 u_long pteindex; 134 int i; 135 136 if (ISALIVE(kd)) { 137 _kvm_err(kd, 0, "vatop called in live kernel!"); 138 return((off_t)0); 139 } 140 141 vm = kd->vmst; 142 offset = va & (PAGE_SIZE - 1); 143 144 /* 145 * If we are initializing (kernel page table descriptor pointer 146 * not yet set) then return pa == va to avoid infinite recursion. 147 */ 148 if (vm->PTD == 0) { 149 *pa = va; 150 return (PAGE_SIZE - offset); 151 } 152 153 pdeindex = va >> PDRSHIFT; 154 pde = vm->PTD[pdeindex]; 155 if (((u_long)pde & PG_V) == 0) 156 goto invalid; 157 158 if ((u_long)pde & PG_PS) { 159 /* 160 * No second-level page table; ptd describes one 4MB page. 161 * (We assume that the kernel wouldn't set PG_PS without enabling 162 * it cr0, and that the kernel doesn't support 36-bit physical 163 * addresses). 164 */ 165 #define PAGE4M_MASK (NBPDR - 1) 166 #define PG_FRAME4M (~PAGE4M_MASK) 167 *pa = ((u_long)pde & PG_FRAME4M) + (va & PAGE4M_MASK); 168 return (NBPDR - (va & PAGE4M_MASK)); 169 } 170 171 pteindex = (va >> PAGE_SHIFT) & (NPTEPG-1); 172 pte_pa = ((u_long)pde & PG_FRAME) + (pteindex * sizeof(pt_entry_t)); 173 174 /* XXX This has to be a physical address read, kvm_read is virtual */ 175 if (lseek(kd->pmfd, pte_pa, 0) == -1) { 176 _kvm_syserr(kd, kd->program, "_kvm_vatop: lseek"); 177 goto invalid; 178 } 179 if (read(kd->pmfd, &pte, sizeof pte) != sizeof pte) { 180 _kvm_syserr(kd, kd->program, "_kvm_vatop: read"); 181 goto invalid; 182 } 183 if (((u_long)pte & PG_V) == 0) 184 goto invalid; 185 186 *pa = ((u_long)pte & PG_FRAME) + offset; 187 return (PAGE_SIZE - offset); 188 189 invalid: 190 _kvm_err(kd, 0, "invalid address (%x)", va); 191 return (0); 192 } 193 194 int 195 _kvm_kvatop(kvm_t *kd, u_long va, u_long *pa) 196 { 197 return (_kvm_vatop(kd, va, pa)); 198 } 199