procfs_map.c revision 1.12
1 /* $NetBSD: procfs_map.c,v 1.12 2001/04/02 07:16:05 pk 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 <sys/malloc.h> 49 #include <sys/namei.h> 50 #include <miscfs/procfs/procfs.h> 51 52 #include <sys/lock.h> 53 54 #include <uvm/uvm.h> 55 56 #define MEBUFFERSIZE 256 57 58 extern int getcwd_common __P((struct vnode *, struct vnode *, 59 char **, char *, int, int, struct proc *)); 60 61 static int procfs_vnode_to_path(struct vnode *vp, char *path, int len, 62 struct proc *curp, struct proc *p); 63 64 /* 65 * The map entries can *almost* be read with programs like cat. However, 66 * large maps need special programs to read. It is not easy to implement 67 * a program that can sense the required size of the buffer, and then 68 * subsequently do a read with the appropriate size. This operation cannot 69 * be atomic. The best that we can do is to allow the program to do a read 70 * with an arbitrarily large buffer, and return as much as we can. We can 71 * return an error code if the buffer is too small (EFBIG), then the program 72 * can try a bigger buffer. 73 */ 74 int 75 procfs_domap(struct proc *curp, struct proc *p, struct pfsnode *pfs, 76 struct uio *uio, int linuxmode) 77 { 78 int len; 79 int error, buf_full; 80 vm_map_t map = &p->p_vmspace->vm_map; 81 vm_map_entry_t entry; 82 char mebuffer[MEBUFFERSIZE]; 83 char *path; 84 struct vnode *vp; 85 struct vattr va; 86 dev_t dev; 87 long fileid; 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 buf_full = 0; 97 if (map != &curproc->p_vmspace->vm_map) 98 vm_map_lock_read(map); 99 for (entry = map->header.next; 100 ((uio->uio_resid > 0) && (entry != &map->header)); 101 entry = entry->next) { 102 103 if (UVM_ET_ISSUBMAP(entry)) 104 continue; 105 106 if (linuxmode != 0) { 107 path = (char *)malloc(MAXPATHLEN * 4, M_TEMP, M_WAITOK); 108 if (path == NULL) { 109 error = ENOMEM; 110 break; 111 } 112 *path = 0; 113 114 dev = (dev_t)0; 115 fileid = 0; 116 if (UVM_ET_ISOBJ(entry) && 117 UVM_OBJ_IS_VNODE(entry->object.uvm_obj)) { 118 vp = (struct vnode *)entry->object.uvm_obj; 119 error = VOP_GETATTR(vp, &va, curp->p_ucred, 120 curp); 121 if (error == 0 && vp != pfs->pfs_vnode) { 122 fileid = va.va_fileid; 123 dev = va.va_fsid; 124 error = procfs_vnode_to_path(vp, path, 125 MAXPATHLEN * 4, curp, p); 126 } 127 } 128 snprintf(mebuffer, sizeof(mebuffer), 129 "%0*lx-%0*lx %c%c%c%c %0*lx %02x:%02x %ld %s\n", 130 (int)sizeof(void *) * 2,(unsigned long)entry->start, 131 (int)sizeof(void *) * 2,(unsigned long)entry->end, 132 (entry->protection & VM_PROT_READ) ? 'r' : '-', 133 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 134 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 135 (entry->etype & UVM_ET_COPYONWRITE) ? 'p' : 's', 136 (int)sizeof(void *) * 2, 137 (unsigned long)entry->offset, 138 major(dev), minor(dev), fileid, path); 139 free(path, M_TEMP); 140 } else { 141 snprintf(mebuffer, sizeof(mebuffer), 142 "0x%lx 0x%lx %c%c%c %c%c%c %s %s %d %d %d\n", 143 entry->start, entry->end, 144 (entry->protection & VM_PROT_READ) ? 'r' : '-', 145 (entry->protection & VM_PROT_WRITE) ? 'w' : '-', 146 (entry->protection & VM_PROT_EXECUTE) ? 'x' : '-', 147 (entry->max_protection & VM_PROT_READ) ? 'r' : '-', 148 (entry->max_protection & VM_PROT_WRITE) ? 'w' : '-', 149 (entry->max_protection & VM_PROT_EXECUTE) ? 150 'x' : '-', 151 (entry->etype & UVM_ET_COPYONWRITE) ? 152 "COW" : "NCOW", 153 (entry->etype & UVM_ET_NEEDSCOPY) ? "NC" : "NNC", 154 entry->inheritance, entry->wired_count, 155 entry->advice); 156 } 157 158 len = strlen(mebuffer); 159 if (len > uio->uio_resid) { 160 error = EFBIG; 161 break; 162 } 163 error = uiomove(mebuffer, len, uio); 164 if (error) 165 break; 166 } 167 if (map != &curproc->p_vmspace->vm_map) 168 vm_map_unlock_read(map); 169 return error; 170 } 171 172 int 173 procfs_validmap(struct proc *p, struct mount *mp) 174 { 175 return ((p->p_flag & P_SYSTEM) == 0); 176 } 177 178 /* 179 * Try to find a pathname for a vnode. Since there is no mapping 180 * vnode -> parent directory, this needs the NAMECACHE_ENTER_REVERSE 181 * option to work (to make cache_revlookup succeed). 182 */ 183 static int procfs_vnode_to_path(struct vnode *vp, char *path, int len, 184 struct proc *curp, struct proc *p) 185 { 186 int error, lenused, elen; 187 char *bp, *bend; 188 struct vnode *dvp; 189 190 bp = bend = &path[len]; 191 *(--bp) = '\0'; 192 193 error = vget(vp, LK_EXCLUSIVE | LK_RETRY); 194 if (error != 0) 195 return error; 196 error = cache_revlookup(vp, &dvp, &bp, path); 197 vput(vp); 198 if (error != 0) 199 return (error == -1 ? ENOENT : error); 200 201 error = vget(dvp, 0); 202 if (error != 0) 203 return error; 204 *(--bp) = '/'; 205 /* XXX GETCWD_CHECK_ACCESS == 0x0001 */ 206 error = getcwd_common(dvp, NULL, &bp, path, len / 2, 1, curp); 207 208 /* 209 * Strip off emulation path for emulated processes looking at 210 * the maps file of a process of the same emulation. (Won't 211 * work if /emul/xxx is a symlink..) 212 */ 213 if (curp->p_emul == p->p_emul && curp->p_emul->e_path != NULL) { 214 elen = strlen(curp->p_emul->e_path); 215 if (!strncmp(bp, curp->p_emul->e_path, elen)) 216 bp = &bp[elen]; 217 } 218 219 lenused = bend - bp; 220 221 memcpy(path, bp, lenused); 222 path[lenused] = 0; 223 224 return 0; 225 } 226
Indexes created Tue Sep 30 11:09:46 GMT 2025