procfs_map.c revision 1.19.2.2
1 /* $NetBSD: procfs_map.c,v 1.19.2.2 2004/08/03 10:54:07 skrll 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.19.2.2 2004/08/03 10:54:07 skrll 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 <miscfs/procfs/procfs.h> 88 89 #include <sys/lock.h> 90 91 #include <uvm/uvm.h> 92 93 #define MEBUFFERSIZE 256 94 95 extern int getcwd_common __P((struct vnode *, struct vnode *, 96 char **, char *, int, int, struct lwp *)); 97 98 static int procfs_vnode_to_path(struct vnode *vp, char *path, int len, 99 struct lwp *curl, struct proc *p); 100 101 /* 102 * The map entries can *almost* be read with programs like cat. However, 103 * large maps need special programs to read. It is not easy to implement 104 * a program that can sense the required size of the buffer, and then 105 * subsequently do a read with the appropriate size. This operation cannot 106 * be atomic. The best that we can do is to allow the program to do a read 107 * with an arbitrarily large buffer, and return as much as we can. We can 108 * return an error code if the buffer is too small (EFBIG), then the program 109 * can try a bigger buffer. 110 */ 111 int 112 procfs_domap(struct lwp *curl, struct proc *p, struct pfsnode *pfs, 113 struct uio *uio, int linuxmode) 114 { 115 size_t len; 116 int error; 117 struct vm_map *map = &p->p_vmspace->vm_map; 118 struct vm_map_entry *entry; 119 char mebuffer[MEBUFFERSIZE]; 120 char *path; 121 struct vnode *vp; 122 struct vattr va; 123 dev_t dev; 124 long fileid; 125 126 if (uio->uio_rw != UIO_READ) 127 return (EOPNOTSUPP); 128 129 if (uio->uio_offset != 0) 130 return (0); 131 132 error = 0; 133 if (map != &curl->l_proc->p_vmspace->vm_map) 134 vm_map_lock_read(map); 135 for (entry = map->header.next; 136 ((uio->uio_resid > 0) && (entry != &map->header)); 137 entry = entry->next) { 138 139 if (UVM_ET_ISSUBMAP(entry)) 140 continue; 141 142 if (linuxmode != 0) { 143 path = (char *)malloc(MAXPATHLEN * 4, M_TEMP, M_WAITOK); 144 if (path == NULL) { 145 error = ENOMEM; 146 break; 147 } 148 *path = 0; 149 150 dev = (dev_t)0; 151 fileid = 0; 152 if (UVM_ET_ISOBJ(entry) && 153 UVM_OBJ_IS_VNODE(entry->object.uvm_obj)) { 154 vp = (struct vnode *)entry->object.uvm_obj; 155 error = VOP_GETATTR(vp, &va, curl->l_proc->p_ucred, 156 curl); 157 if (error == 0 && vp != pfs->pfs_vnode) { 158 fileid = va.va_fileid; 159 dev = va.va_fsid; 160 error = procfs_vnode_to_path(vp, path, 161 MAXPATHLEN * 4, curl, p); 162 } 163 } 164 snprintf(mebuffer, sizeof(mebuffer), 165 "%0*lx-%0*lx %c%c%c%c %0*lx %02x:%02x %ld %s\n", 166 (int)sizeof(void *) * 2,(unsigned long)entry->start, 167 (int)sizeof(void *) * 2,(unsigned long)entry->end, 168 (entry->protection & VM_PROT_READ) ? 'r' : '-', 169 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 170 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 171 (entry->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 172 (int)sizeof(void *) * 2, 173 (unsigned long)entry->offset, 174 major(dev), minor(dev), fileid, path); 175 free(path, M_TEMP); 176 } else { 177 snprintf(mebuffer, sizeof(mebuffer), 178 "0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d\n", 179 entry->start, entry->end, 180 (entry->protection & VM_PROT_READ) ? 'r' : '-', 181 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 182 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 183 (entry->max_protection & VM_PROT_READ) ? 'r' : '-', 184 (entry->max_protection & VM_PROT_WRITE) ? 'w' : '-', 185 (entry->max_protection & VM_PROT_EXECUTE) ? 186 'x' : '-', 187 (entry->etype & UVM_ET_COPYONWRITE) ? 188 "COW" : "NCOW", 189 (entry->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 190 entry->inheritance, entry->wired_count, 191 entry->advice); 192 } 193 194 len = strlen(mebuffer); 195 if (len > uio->uio_resid) { 196 error = EFBIG; 197 break; 198 } 199 error = uiomove(mebuffer, len, uio); 200 if (error) 201 break; 202 } 203 if (map != &curl->l_proc->p_vmspace->vm_map) 204 vm_map_unlock_read(map); 205 return error; 206 } 207 208 int 209 procfs_validmap(struct lwp *l, struct mount *mp) 210 { 211 return ((l->l_proc->p_flag & P_SYSTEM) == 0); 212 } 213 214 /* 215 * Try to find a pathname for a vnode. Since there is no mapping 216 * vnode -> parent directory, this needs the NAMECACHE_ENTER_REVERSE 217 * option to work (to make cache_revlookup succeed). 218 */ 219 static int procfs_vnode_to_path(struct vnode *vp, char *path, int len, 220 struct lwp *curl, struct proc *p) 221 { 222 struct proc *curp = curl->l_proc; 223 int error, lenused, elen; 224 char *bp, *bend; 225 struct vnode *dvp; 226 227 bp = bend = &path[len]; 228 *(--bp) = '\0'; 229 230 error = vget(vp, LK_EXCLUSIVE | LK_RETRY, curl); 231 if (error != 0) 232 return error; 233 error = cache_revlookup(vp, &dvp, &bp, path); 234 vput(vp); 235 if (error != 0) 236 return (error == -1 ? ENOENT : error); 237 238 error = vget(dvp, 0, curl); 239 if (error != 0) 240 return error; 241 *(--bp) = '/'; 242 /* XXX GETCWD_CHECK_ACCESS == 0x0001 */ 243 error = getcwd_common(dvp, NULL, &bp, path, len / 2, 1, curl); 244 245 /* 246 * Strip off emulation path for emulated processes looking at 247 * the maps file of a process of the same emulation. (Won't 248 * work if /emul/xxx is a symlink..) 249 */ 250 if (curp->p_emul == p->p_emul && curp->p_emul->e_path != NULL) { 251 elen = strlen(curp->p_emul->e_path); 252 if (!strncmp(bp, curp->p_emul->e_path, elen)) 253 bp = &bp[elen]; 254 } 255 256 lenused = bend - bp; 257 258 memcpy(path, bp, lenused); 259 path[lenused] = 0; 260 261 return 0; 262 } 263
Indexes created Tue Sep 30 11:09:46 GMT 2025