1 /* 2 * Copyright (c) 1993 Jan-Simon Pendry 3 * Copyright (c) 1993 4 * The Regents of the University of California. All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * Jan-Simon Pendry. 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. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)procfs_status.c 8.3 (Berkeley) 2/17/94 34 * 35 * $FreeBSD: src/sys/miscfs/procfs/procfs_map.c,v 1.24.2.1 2001/08/04 13:12:24 rwatson Exp $ 36 */ 37 38 #include <sys/param.h> 39 #include <sys/systm.h> 40 #include <sys/uio.h> 41 #include <sys/proc.h> 42 #include <sys/vnode.h> 43 #include <sys/sbuf.h> 44 #include <sys/malloc.h> 45 #include <vfs/procfs/procfs.h> 46 47 #include <vm/vm.h> 48 #include <sys/lock.h> 49 #include <vm/pmap.h> 50 #include <vm/vm_map.h> 51 #include <vm/vm_page.h> 52 #include <vm/vm_object.h> 53 54 #include <machine/limits.h> 55 56 int 57 procfs_domap(struct proc *curp, struct lwp *lp, struct pfsnode *pfs, 58 struct uio *uio) 59 { 60 struct proc *p = lp->lwp_proc; 61 ssize_t buflen = uio->uio_offset + uio->uio_resid; 62 struct vnode *vp; 63 char *fullpath, *freepath; 64 int error; 65 vm_map_t map = &p->p_vmspace->vm_map; 66 vm_map_entry_t entry; 67 struct sbuf *sb = NULL; 68 unsigned int last_timestamp; 69 70 if (uio->uio_rw != UIO_READ) 71 return (EOPNOTSUPP); 72 73 error = 0; 74 75 if (uio->uio_offset < 0 || uio->uio_resid < 0 || buflen >= INT_MAX) 76 return EINVAL; 77 sb = sbuf_new (sb, NULL, buflen+1, 0); 78 if (sb == NULL) 79 return EIO; 80 81 /* 82 * Lock the map so we can access it. Release the process token 83 * to avoid unnecessary token stalls while we are processing the 84 * map. 85 */ 86 vm_map_lock_read(map); 87 lwkt_reltoken(&p->p_token); 88 89 RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) { 90 vm_map_backing_t ba; 91 vm_object_t obj; 92 int ref_count, flags; 93 vm_offset_t e_start, e_end; 94 vm_eflags_t e_eflags; 95 vm_prot_t e_prot; 96 int resident; 97 char *type; 98 99 switch(entry->maptype) { 100 case VM_MAPTYPE_NORMAL: 101 ba = &entry->ba; 102 break; 103 case VM_MAPTYPE_UKSMAP: 104 ba = NULL; 105 break; 106 default: 107 /* ignore entry */ 108 continue; 109 } 110 111 e_eflags = entry->eflags; 112 e_prot = entry->protection; 113 e_start = entry->ba.start; 114 e_end = entry->ba.end; 115 116 /* 117 * Don't count resident pages, its impossible on 64-bit. 118 * A single mapping could be gigabytes or terrabytes. 119 */ 120 resident = -1; 121 #if 0 122 pmap_t pmap = vmspace_pmap(p->p_vmspace); 123 vm_offset_t addr; 124 125 resident = 0; 126 addr = entry->ba.start; 127 while (addr < entry->ba.end) { 128 if (pmap_extract(pmap, addr, NULL)) 129 resident++; 130 addr += PAGE_SIZE; 131 } 132 #endif 133 if (ba) { 134 while (ba->backing_ba) 135 ba = ba->backing_ba; 136 obj = ba->object; 137 if (obj) 138 vm_object_hold(obj); 139 } else { 140 obj = NULL; 141 } 142 last_timestamp = map->timestamp; 143 vm_map_unlock(map); 144 145 freepath = NULL; 146 fullpath = "-"; 147 flags = 0; 148 ref_count = 0; 149 150 if (obj) { 151 switch(obj->type) { 152 default: 153 case OBJT_DEFAULT: 154 type = "default"; 155 vp = NULL; 156 break; 157 case OBJT_VNODE: 158 type = "vnode"; 159 vp = obj->handle; 160 vref(vp); 161 break; 162 case OBJT_SWAP: 163 type = "swap"; 164 vp = NULL; 165 break; 166 case OBJT_DEVICE: 167 type = "device"; 168 vp = NULL; 169 break; 170 case OBJT_MGTDEVICE: 171 type = "mgtdevice"; 172 vp = NULL; 173 break; 174 } 175 if (ba->object) { 176 flags = ba->object->flags; 177 ref_count = ba->object->ref_count; 178 } 179 vm_object_drop(obj); 180 if (vp) { 181 vn_fullpath(p, vp, &fullpath, &freepath, 1); 182 vrele(vp); 183 } 184 } else { 185 switch(entry->maptype) { 186 case VM_MAPTYPE_UNSPECIFIED: 187 type = "unspec"; 188 break; 189 case VM_MAPTYPE_NORMAL: 190 type = "none"; 191 break; 192 case VM_MAPTYPE_SUBMAP: 193 type = "submap"; 194 break; 195 case VM_MAPTYPE_UKSMAP: 196 type = "uksmap"; 197 break; 198 default: 199 type = "unknown"; 200 break; 201 } 202 } 203 204 /* 205 * format: 206 * start, end, res, priv res, cow, access, type, (fullpath). 207 */ 208 error = sbuf_printf(sb, 209 #if LONG_BIT == 64 210 "0x%016lx 0x%016lx %d %d %p %s%s%s %d %d " 211 #else 212 "0x%08lx 0x%08lx %d %d %p %s%s%s %d %d " 213 #endif 214 "0x%04x %s%s %s %s\n", 215 (u_long)e_start, (u_long)e_end, 216 resident, -1, (ba ? ba->object : NULL), 217 (e_prot & VM_PROT_READ) ? "r" : "-", 218 (e_prot & VM_PROT_WRITE) ? "w" : "-", 219 (e_prot & VM_PROT_EXECUTE) ? "x" : "-", 220 ref_count, 0, flags, 221 (e_eflags & MAP_ENTRY_COW) ? "COW" : "NCOW", 222 (e_eflags & MAP_ENTRY_NEEDS_COPY) ?" NC" : " NNC", 223 type, fullpath); 224 225 if (freepath != NULL) { 226 kfree(freepath, M_TEMP); 227 freepath = NULL; 228 } 229 230 vm_map_lock_read(map); 231 if (error == -1) { 232 error = 0; 233 break; 234 } 235 236 if (last_timestamp != map->timestamp) { 237 vm_map_entry_t reentry; 238 vm_map_lookup_entry(map, e_start, &reentry); 239 entry = reentry; 240 } 241 } 242 vm_map_unlock_read(map); 243 if (sbuf_finish(sb) == 0) 244 buflen = sbuf_len(sb); 245 error = uiomove_frombuf(sbuf_data(sb), buflen, uio); 246 sbuf_delete(sb); 247 248 lwkt_gettoken(&p->p_token); /* re-acquire */ 249 250 return error; 251 } 252 253 int 254 procfs_validmap(struct lwp *lp) 255 { 256 return ((lp->lwp_proc->p_flags & P_SYSTEM) == 0); 257 } 258