procfs_map.c revision 1.36.12.2
1 /* $NetBSD: procfs_map.c,v 1.36.12.2 2010/04/21 00:28:20 matt Exp $ */ 2 3 /* 4 * Copyright (c) 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Jan-Simon Pendry. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. Neither the name of the University nor the names of its contributors 19 * may be used to endorse or promote products derived from this software 20 * without specific prior written permission. 21 * 22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 32 * SUCH DAMAGE. 33 * 34 * @(#)procfs_status.c 8.3 (Berkeley) 2/17/94 35 * 36 * $FreeBSD: procfs_map.c,v 1.18 1998/12/04 22:54:51 archie Exp $ 37 */ 38 39 /* 40 * Copyright (c) 1993 Jan-Simon Pendry 41 * 42 * This code is derived from software contributed to Berkeley by 43 * Jan-Simon Pendry. 44 * 45 * Redistribution and use in source and binary forms, with or without 46 * modification, are permitted provided that the following conditions 47 * are met: 48 * 1. Redistributions of source code must retain the above copyright 49 * notice, this list of conditions and the following disclaimer. 50 * 2. Redistributions in binary form must reproduce the above copyright 51 * notice, this list of conditions and the following disclaimer in the 52 * documentation and/or other materials provided with the distribution. 53 * 3. All advertising materials mentioning features or use of this software 54 * must display the following acknowledgement: 55 * This product includes software developed by the University of 56 * California, Berkeley and its contributors. 57 * 4. Neither the name of the University nor the names of its contributors 58 * may be used to endorse or promote products derived from this software 59 * without specific prior written permission. 60 * 61 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 62 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 63 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 64 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 65 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 66 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 67 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 68 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 69 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 70 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 71 * SUCH DAMAGE. 72 * 73 * @(#)procfs_status.c 8.3 (Berkeley) 2/17/94 74 * 75 * $FreeBSD: procfs_map.c,v 1.18 1998/12/04 22:54:51 archie Exp $ 76 */ 77 78 #include <sys/cdefs.h> 79 __KERNEL_RCSID(0, "$NetBSD: procfs_map.c,v 1.36.12.2 2010/04/21 00:28:20 matt Exp $"); 80 81 #include <sys/param.h> 82 #include <sys/systm.h> 83 #include <sys/proc.h> 84 #include <sys/vnode.h> 85 #include <sys/malloc.h> 86 #include <sys/namei.h> 87 #include <sys/filedesc.h> 88 #include <miscfs/procfs/procfs.h> 89 90 #include <sys/lock.h> 91 92 #include <uvm/uvm.h> 93 94 #define BUFFERSIZE (64 * 1024) 95 #define MAXBUFFERSIZE (256 * 1024) 96 #ifndef PRIxVADDR 97 #define PRIxVADDR "lx" 98 #endif 99 100 /* 101 * The map entries can *almost* be read with programs like cat. However, 102 * large maps need special programs to read. It is not easy to implement 103 * a program that can sense the required size of the buffer, and then 104 * subsequently do a read with the appropriate size. This operation cannot 105 * be atomic. The best that we can do is to allow the program to do a read 106 * with an arbitrarily large buffer, and return as much as we can. We can 107 * return an error code if the buffer is too small (EFBIG), then the program 108 * can try a bigger buffer. 109 */ 110 int 111 procfs_domap(struct lwp *curl, struct proc *p, struct pfsnode *pfs, 112 struct uio *uio, int linuxmode) 113 { 114 int error; 115 struct vmspace *vm; 116 struct vm_map *map; 117 struct vm_map_entry *entry; 118 char *buffer = NULL; 119 size_t bufsize = BUFFERSIZE; 120 char *path; 121 struct vnode *vp; 122 struct vattr va; 123 dev_t dev; 124 long fileid; 125 size_t pos; 126 127 if (uio->uio_rw != UIO_READ) 128 return EOPNOTSUPP; 129 130 if (uio->uio_offset != 0) { 131 /* 132 * we return 0 here, so that the second read returns EOF 133 * we don't support reading from an offset because the 134 * map could have changed between the two reads. 135 */ 136 return 0; 137 } 138 139 error = 0; 140 141 if (linuxmode != 0) 142 path = malloc(MAXPATHLEN * 4, M_TEMP, M_WAITOK); 143 else 144 path = NULL; 145 146 if ((error = proc_vmspace_getref(p, &vm)) != 0) 147 goto out; 148 149 map = &vm->vm_map; 150 vm_map_lock_read(map); 151 152 again: 153 buffer = malloc(bufsize, M_TEMP, M_WAITOK); 154 pos = 0; 155 for (entry = map->header.next; entry != &map->header; 156 entry = entry->next) { 157 158 if (UVM_ET_ISSUBMAP(entry)) 159 continue; 160 161 if (linuxmode != 0) { 162 *path = 0; 163 dev = (dev_t)0; 164 fileid = 0; 165 if (UVM_ET_ISOBJ(entry) && 166 UVM_OBJ_IS_VNODE(entry->object.uvm_obj)) { 167 vp = (struct vnode *)entry->object.uvm_obj; 168 error = VOP_GETATTR(vp, &va, curl->l_cred); 169 if (error == 0 && vp != pfs->pfs_vnode) { 170 fileid = va.va_fileid; 171 dev = va.va_fsid; 172 error = vnode_to_path(path, 173 MAXPATHLEN * 4, vp, curl, p); 174 } 175 } 176 pos += snprintf(buffer + pos, bufsize - pos, 177 "%0*"PRIxVADDR"-%0*"PRIxVADDR 178 " %c%c%c%c %0*"PRIxVADDR" %02x:%02x %ld %s\n", 179 (int)sizeof(void *) * 2, entry->start, 180 (int)sizeof(void *) * 2, entry->end, 181 (entry->protection & VM_PROT_READ) ? 'r' : '-', 182 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 183 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 184 (entry->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 185 (int)sizeof(void *) * 2, 186 (vsize_t)entry->offset, 187 major(dev), minor(dev), fileid, path); 188 } else { 189 pos += snprintf(buffer + pos, bufsize - pos, 190 "%#"PRIxVADDR" %#"PRIxVADDR 191 " %c%c%c %c%c%c %s %s %d %d %d\n", 192 entry->start, entry->end, 193 (entry->protection & VM_PROT_READ) ? 'r' : '-', 194 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 195 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 196 (entry->max_protection & VM_PROT_READ) ? 'r' : '-', 197 (entry->max_protection & VM_PROT_WRITE) ? 'w' : '-', 198 (entry->max_protection & VM_PROT_EXECUTE) ? 199 'x' : '-', 200 (entry->etype & UVM_ET_COPYONWRITE) ? 201 "COW" : "NCOW", 202 (entry->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 203 entry->inheritance, entry->wired_count, 204 entry->advice); 205 } 206 if (pos >= bufsize) { 207 bufsize <<= 1; 208 if (bufsize > MAXBUFFERSIZE) { 209 error = ENOMEM; 210 goto out; 211 } 212 free(buffer, M_TEMP); 213 goto again; 214 } 215 } 216 217 vm_map_unlock_read(map); 218 uvmspace_free(vm); 219 220 error = uiomove(buffer, pos, uio); 221 out: 222 if (path != NULL) 223 free(path, M_TEMP); 224 if (buffer != NULL) 225 free(buffer, M_TEMP); 226 227 return error; 228 } 229 230 int 231 procfs_validmap(struct lwp *l, struct mount *mp) 232 { 233 return ((l->l_flag & LW_SYSTEM) == 0); 234 } 235
Indexes created Tue Sep 30 11:09:46 GMT 2025