procfs_map.c revision 1.2
1 /* $NetBSD: procfs_map.c,v 1.2 1999/01/28 21:18:00 drochner Exp $ */ 2 3 /* 4 * Copyright (c) 1993 Jan-Simon Pendry 5 * Copyright (c) 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * Jan-Simon Pendry. 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 * @(#)procfs_status.c 8.3 (Berkeley) 2/17/94 40 * 41 * $FreeBSD: procfs_map.c,v 1.18 1998/12/04 22:54:51 archie Exp $ 42 */ 43 44 #include "opt_uvm.h" 45 46 #include <sys/param.h> 47 #include <sys/systm.h> 48 #include <sys/proc.h> 49 #include <sys/vnode.h> 50 #include <miscfs/procfs/procfs.h> 51 52 #include <vm/vm.h> 53 #include <vm/vm_prot.h> 54 #include <sys/lock.h> 55 #include <vm/pmap.h> 56 #include <vm/vm_map.h> 57 #include <vm/vm_page.h> 58 #include <vm/vm_object.h> 59 60 #if defined(UVM) 61 #include <uvm/uvm.h> 62 #endif 63 64 #define MEBUFFERSIZE 256 65 66 /* 67 * The map entries can *almost* be read with programs like cat. However, 68 * large maps need special programs to read. It is not easy to implement 69 * a program that can sense the required size of the buffer, and then 70 * subsequently do a read with the appropriate size. This operation cannot 71 * be atomic. The best that we can do is to allow the program to do a read 72 * with an arbitrarily large buffer, and return as much as we can. We can 73 * return an error code if the buffer is too small (EFBIG), then the program 74 * can try a bigger buffer. 75 */ 76 int 77 procfs_domap(curp, p, pfs, uio) 78 struct proc *curp; 79 struct proc *p; 80 struct pfsnode *pfs; 81 struct uio *uio; 82 { 83 int len; 84 int error; 85 vm_map_t map = &p->p_vmspace->vm_map; 86 vm_map_entry_t entry; 87 char mebuffer[MEBUFFERSIZE]; 88 89 if (uio->uio_rw != UIO_READ) 90 return (EOPNOTSUPP); 91 92 if (uio->uio_offset != 0) 93 return (0); 94 95 error = 0; 96 if (map != &curproc->p_vmspace->vm_map) 97 vm_map_lock_read(map); 98 for (entry = map->header.next; 99 ((uio->uio_resid > 0) && (entry != &map->header)); 100 entry = entry->next) { 101 102 #if defined(UVM) 103 if (UVM_ET_ISSUBMAP(entry)) 104 continue; 105 #else 106 if (entry->is_a_map || entry->is_sub_map) 107 continue; 108 #endif 109 110 /* 111 * format: 112 * start, end, resident, private resident, cow, access, type. 113 */ 114 #if 0 115 snprintf(mebuffer, sizeof(mebuffer), 116 "0x%lx 0x%lx %s%s%s %s%s%s %s %s %d %d %d\n", 117 #else 118 sprintf(mebuffer, 119 #if defined(UVM) 120 "0x%lx 0x%lx %s%s%s %s%s%s %s %s %d %d %d\n", 121 #else 122 "0x%lx 0x%lx %s%s%s %s%s%s %s %s %d %d\n", 123 #endif 124 #endif 125 entry->start, entry->end, 126 127 (entry->protection & VM_PROT_READ) ? "r" : "-", 128 (entry->protection & VM_PROT_WRITE) ? "w" : "-", 129 (entry->protection & VM_PROT_EXECUTE) ? "x" : "-", 130 (entry->max_protection & VM_PROT_READ) ? "r" : "-", 131 (entry->max_protection & VM_PROT_WRITE) ? "w" : "-", 132 (entry->max_protection & VM_PROT_EXECUTE) ? "x" : "-", 133 134 #if defined(UVM) 135 (entry->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW", 136 (entry->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 137 #else 138 (entry->copy_on_write) ? "COW" : "NCOW", 139 (entry->needs_copy) ? "NC" : "NNC", 140 #endif 141 entry->inheritance, entry->wired_count 142 #if defined(UVM) 143 , entry->advice 144 #endif 145 ); 146 147 148 len = strlen(mebuffer); 149 if (len > uio->uio_resid) { 150 error = EFBIG; 151 break; 152 } 153 error = uiomove(mebuffer, len, uio); 154 if (error) 155 break; 156 } 157 if (map != &curproc->p_vmspace->vm_map) 158 vm_map_unlock_read(map); 159 return error; 160 } 161 162 int 163 procfs_validmap(p) 164 struct proc *p; 165 { 166 return ((p->p_flag & P_SYSTEM) == 0); 167 } 168
Indexes created Tue Sep 30 11:09:46 GMT 2025