1 /* $NetBSD: procfs_map.c,v 1.7 2000/06/27 04:18:50 mrg 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 <sys/param.h> 45 #include <sys/systm.h> 46 #include <sys/proc.h> 47 #include <sys/vnode.h> 48 #include <miscfs/procfs/procfs.h> 49 50 #include <vm/vm.h> 51 #include <sys/lock.h> 52 53 #include <uvm/uvm.h> 54 55 #define MEBUFFERSIZE 256 56 57 /* 58 * The map entries can *almost* be read with programs like cat. However, 59 * large maps need special programs to read. It is not easy to implement 60 * a program that can sense the required size of the buffer, and then 61 * subsequently do a read with the appropriate size. This operation cannot 62 * be atomic. The best that we can do is to allow the program to do a read 63 * with an arbitrarily large buffer, and return as much as we can. We can 64 * return an error code if the buffer is too small (EFBIG), then the program 65 * can try a bigger buffer. 66 */ 67 int 68 procfs_domap(curp, p, pfs, uio) 69 struct proc *curp; 70 struct proc *p; 71 struct pfsnode *pfs; 72 struct uio *uio; 73 { 74 int len; 75 int error; 76 vm_map_t map = &p->p_vmspace->vm_map; 77 vm_map_entry_t entry; 78 char mebuffer[MEBUFFERSIZE]; 79 80 if (uio->uio_rw != UIO_READ) 81 return (EOPNOTSUPP); 82 83 if (uio->uio_offset != 0) 84 return (0); 85 86 error = 0; 87 if (map != &curproc->p_vmspace->vm_map) 88 vm_map_lock_read(map); 89 for (entry = map->header.next; 90 ((uio->uio_resid > 0) && (entry != &map->header)); 91 entry = entry->next) { 92 93 if (UVM_ET_ISSUBMAP(entry)) 94 continue; 95 96 /* 97 * format: 98 * start, end, resident, private resident, cow, access, type. 99 */ 100 snprintf(mebuffer, sizeof(mebuffer), 101 "0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d\n", 102 entry->start, entry->end, 103 104 (entry->protection & VM_PROT_READ) ? 'r' : '-', 105 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 106 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 107 (entry->max_protection & VM_PROT_READ) ? 'r' : '-', 108 (entry->max_protection & VM_PROT_WRITE) ? 'w' : '-', 109 (entry->max_protection & VM_PROT_EXECUTE) ? 'x' : '-', 110 111 (entry->etype & UVM_ET_COPYONWRITE) ? "COW" : "NCOW", 112 (entry->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 113 entry->inheritance, entry->wired_count , entry->advice 114 ); 115 116 117 len = strlen(mebuffer); 118 if (len > uio->uio_resid) { 119 error = EFBIG; 120 break; 121 } 122 error = uiomove(mebuffer, len, uio); 123 if (error) 124 break; 125 } 126 if (map != &curproc->p_vmspace->vm_map) 127 vm_map_unlock_read(map); 128 return error; 129 } 130 131 int 132 procfs_validmap(p) 133 struct proc *p; 134 { 135 return ((p->p_flag & P_SYSTEM) == 0); 136 } 137