procfs_subr.c revision 1.56.2.2
1 /* $NetBSD: procfs_subr.c,v 1.56.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_subr.c 8.6 (Berkeley) 5/14/95 35 */ 36 37 /* 38 * Copyright (c) 1994 Christopher G. Demetriou. All rights reserved. 39 * Copyright (c) 1993 Jan-Simon Pendry 40 * 41 * This code is derived from software contributed to Berkeley by 42 * Jan-Simon Pendry. 43 * 44 * Redistribution and use in source and binary forms, with or without 45 * modification, are permitted provided that the following conditions 46 * are met: 47 * 1. Redistributions of source code must retain the above copyright 48 * notice, this list of conditions and the following disclaimer. 49 * 2. Redistributions in binary form must reproduce the above copyright 50 * notice, this list of conditions and the following disclaimer in the 51 * documentation and/or other materials provided with the distribution. 52 * 3. All advertising materials mentioning features or use of this software 53 * must display the following acknowledgement: 54 * This product includes software developed by the University of 55 * California, Berkeley and its contributors. 56 * 4. Neither the name of the University nor the names of its contributors 57 * may be used to endorse or promote products derived from this software 58 * without specific prior written permission. 59 * 60 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 61 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 62 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 63 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 64 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 65 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 66 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 67 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 68 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 69 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 70 * SUCH DAMAGE. 71 * 72 * @(#)procfs_subr.c 8.6 (Berkeley) 5/14/95 73 */ 74 75 #include <sys/cdefs.h> 76 __KERNEL_RCSID(0, "$NetBSD: procfs_subr.c,v 1.56.2.2 2004/08/03 10:54:07 skrll Exp $"); 77 78 #include <sys/param.h> 79 #include <sys/systm.h> 80 #include <sys/time.h> 81 #include <sys/kernel.h> 82 #include <sys/proc.h> 83 #include <sys/vnode.h> 84 #include <sys/malloc.h> 85 #include <sys/stat.h> 86 #include <sys/file.h> 87 #include <sys/filedesc.h> 88 89 #include <miscfs/procfs/procfs.h> 90 91 void procfs_hashins __P((struct pfsnode *)); 92 void procfs_hashrem __P((struct pfsnode *)); 93 struct vnode *procfs_hashget __P((pid_t, pfstype, int, struct mount *, struct lwp *)); 94 95 LIST_HEAD(pfs_hashhead, pfsnode) *pfs_hashtbl; 96 u_long pfs_ihash; /* size of hash table - 1 */ 97 #define PFSPIDHASH(pid) ((pid) & pfs_ihash) 98 99 struct lock pfs_hashlock; 100 struct simplelock pfs_hash_slock; 101 102 #define ISSET(t, f) ((t) & (f)) 103 104 /* 105 * allocate a pfsnode/vnode pair. the vnode is 106 * referenced, and locked. 107 * 108 * the pid, pfs_type, and mount point uniquely 109 * identify a pfsnode. the mount point is needed 110 * because someone might mount this filesystem 111 * twice. 112 * 113 * all pfsnodes are maintained on a singly-linked 114 * list. new nodes are only allocated when they cannot 115 * be found on this list. entries on the list are 116 * removed when the vfs reclaim entry is called. 117 * 118 * a single lock is kept for the entire list. this is 119 * needed because the getnewvnode() function can block 120 * waiting for a vnode to become free, in which case there 121 * may be more than one process trying to get the same 122 * vnode. this lock is only taken if we are going to 123 * call getnewvnode, since the kernel itself is single-threaded. 124 * 125 * if an entry is found on the list, then call vget() to 126 * take a reference. this is done because there may be 127 * zero references to it and so it needs to removed from 128 * the vnode free list. 129 */ 130 int 131 procfs_allocvp(mp, vpp, pid, pfs_type, fd) 132 struct mount *mp; 133 struct vnode **vpp; 134 pid_t pid; 135 pfstype pfs_type; 136 int fd; 137 { 138 struct pfsnode *pfs; 139 struct vnode *vp; 140 int error; 141 142 do { 143 if ((*vpp = procfs_hashget(pid, pfs_type, fd, mp, curlwp)) != NULL) 144 return (0); 145 } while (lockmgr(&pfs_hashlock, LK_EXCLUSIVE|LK_SLEEPFAIL, 0)); 146 147 if ((error = getnewvnode(VT_PROCFS, mp, procfs_vnodeop_p, &vp)) != 0) { 148 *vpp = NULL; 149 lockmgr(&pfs_hashlock, LK_RELEASE, NULL); 150 return (error); 151 } 152 153 MALLOC(pfs, void *, sizeof(struct pfsnode), M_TEMP, M_WAITOK); 154 vp->v_data = pfs; 155 156 pfs->pfs_pid = pid; 157 pfs->pfs_type = pfs_type; 158 pfs->pfs_vnode = vp; 159 pfs->pfs_flags = 0; 160 pfs->pfs_fileno = PROCFS_FILENO(pid, pfs_type, fd); 161 pfs->pfs_fd = fd; 162 163 switch (pfs_type) { 164 case PFSroot: /* /proc = dr-xr-xr-x */ 165 pfs->pfs_mode = S_IRUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH; 166 vp->v_type = VDIR; 167 vp->v_flag = VROOT; 168 break; 169 170 case PFScurproc: /* /proc/curproc = lr-xr-xr-x */ 171 case PFSself: /* /proc/self = lr-xr-xr-x */ 172 pfs->pfs_mode = S_IRUSR|S_IXUSR|S_IRGRP|S_IXGRP|S_IROTH|S_IXOTH; 173 vp->v_type = VLNK; 174 break; 175 176 case PFSproc: /* /proc/N = dr-xr-xr-x */ 177 case PFSfd: 178 if (fd == -1) { /* /proc/N/fd = dr-xr-xr-x */ 179 pfs->pfs_mode = S_IRUSR|S_IXUSR; 180 vp->v_type = VDIR; 181 } else { /* /proc/N/fd/M = [ps-]rw------- */ 182 struct file *fp; 183 struct vnode *vxp; 184 struct proc *pown; 185 186 /* XXX can procfs_getfp() ever fail here? */ 187 if ((error = procfs_getfp(pfs, &pown, &fp)) != 0) 188 goto bad; 189 FILE_USE(fp); 190 191 pfs->pfs_mode = S_IRUSR|S_IWUSR; 192 switch (fp->f_type) { 193 case DTYPE_VNODE: 194 vxp = (struct vnode *)fp->f_data; 195 196 /* 197 * We make symlinks for directories 198 * to avoid cycles. 199 */ 200 if (vxp->v_type == VDIR) 201 goto symlink; 202 vp->v_type = vxp->v_type; 203 break; 204 case DTYPE_PIPE: 205 vp->v_type = VFIFO; 206 break; 207 case DTYPE_SOCKET: 208 vp->v_type = VSOCK; 209 break; 210 case DTYPE_KQUEUE: 211 case DTYPE_MISC: 212 symlink: 213 pfs->pfs_mode = S_IRUSR|S_IXUSR|S_IRGRP| 214 S_IXGRP|S_IROTH|S_IXOTH; 215 vp->v_type = VLNK; 216 break; 217 default: 218 error = EOPNOTSUPP; 219 FILE_UNUSE(fp, proc_representative_lwp(pown)); 220 goto bad; 221 } 222 FILE_UNUSE(fp, proc_representative_lwp(pown)); 223 } 224 break; 225 226 case PFSfile: /* /proc/N/file = -rw------- */ 227 case PFSmem: /* /proc/N/mem = -rw------- */ 228 case PFSregs: /* /proc/N/regs = -rw------- */ 229 case PFSfpregs: /* /proc/N/fpregs = -rw------- */ 230 pfs->pfs_mode = S_IRUSR|S_IWUSR; 231 vp->v_type = VREG; 232 break; 233 234 case PFSctl: /* /proc/N/ctl = --w------ */ 235 case PFSnote: /* /proc/N/note = --w------ */ 236 case PFSnotepg: /* /proc/N/notepg = --w------ */ 237 pfs->pfs_mode = S_IWUSR; 238 vp->v_type = VREG; 239 break; 240 241 case PFSmap: /* /proc/N/map = -r--r--r-- */ 242 case PFSmaps: /* /proc/N/maps = -r--r--r-- */ 243 case PFSstatus: /* /proc/N/status = -r--r--r-- */ 244 case PFSstat: /* /proc/N/stat = -r--r--r-- */ 245 case PFScmdline: /* /proc/N/cmdline = -r--r--r-- */ 246 case PFSmeminfo: /* /proc/meminfo = -r--r--r-- */ 247 case PFScpuinfo: /* /proc/cpuinfo = -r--r--r-- */ 248 case PFSuptime: /* /proc/uptime = -r--r--r-- */ 249 pfs->pfs_mode = S_IRUSR|S_IRGRP|S_IROTH; 250 vp->v_type = VREG; 251 break; 252 253 #ifdef __HAVE_PROCFS_MACHDEP 254 PROCFS_MACHDEP_NODETYPE_CASES 255 procfs_machdep_allocvp(vp); 256 break; 257 #endif 258 259 default: 260 panic("procfs_allocvp"); 261 } 262 263 procfs_hashins(pfs); 264 uvm_vnp_setsize(vp, 0); 265 lockmgr(&pfs_hashlock, LK_RELEASE, NULL); 266 267 *vpp = vp; 268 return (0); 269 270 bad: 271 lockmgr(&pfs_hashlock, LK_RELEASE, NULL); 272 FREE(pfs, M_TEMP); 273 ungetnewvnode(vp); 274 return (error); 275 } 276 277 int 278 procfs_freevp(vp) 279 struct vnode *vp; 280 { 281 struct pfsnode *pfs = VTOPFS(vp); 282 283 procfs_hashrem(pfs); 284 285 FREE(vp->v_data, M_TEMP); 286 vp->v_data = 0; 287 return (0); 288 } 289 290 int 291 procfs_rw(v) 292 void *v; 293 { 294 struct vop_read_args *ap = v; 295 struct vnode *vp = ap->a_vp; 296 struct uio *uio = ap->a_uio; 297 struct lwp *curl; 298 struct lwp *l; 299 struct pfsnode *pfs = VTOPFS(vp); 300 struct proc *p; 301 302 if (uio->uio_offset < 0) 303 return EINVAL; 304 p = PFIND(pfs->pfs_pid); 305 if (p == 0) 306 return ESRCH; 307 /* 308 * Do not allow init to be modified while in secure mode; it 309 * could be duped into changing the security level. 310 */ 311 if (uio->uio_rw == UIO_WRITE && p == initproc && securelevel > -1) 312 return EPERM; 313 314 curl = uio->uio_lwp; 315 316 /* XXX NJWLWP 317 * The entire procfs interface needs work to be useful to 318 * a process with multiple LWPs. For the moment, we'll 319 * just kluge this and fail on others. 320 */ 321 l = proc_representative_lwp(p); 322 323 switch (pfs->pfs_type) { 324 case PFSnote: 325 case PFSnotepg: 326 return (procfs_donote(curl, p, pfs, uio)); 327 328 case PFSregs: 329 return (procfs_doregs(curl, l, pfs, uio)); 330 331 case PFSfpregs: 332 return (procfs_dofpregs(curl, l, pfs, uio)); 333 334 case PFSctl: 335 return (procfs_doctl(curl, l, pfs, uio)); 336 337 case PFSstatus: 338 return (procfs_dostatus(curl, l, pfs, uio)); 339 340 case PFSstat: 341 return (procfs_do_pid_stat(curl, l, pfs, uio)); 342 343 case PFSmap: 344 return (procfs_domap(curl, p, pfs, uio, 0)); 345 346 case PFSmaps: 347 return (procfs_domap(curl, p, pfs, uio, 1)); 348 349 case PFSmem: 350 return (procfs_domem(curl, l, pfs, uio)); 351 352 case PFScmdline: 353 return (procfs_docmdline(curl, p, pfs, uio)); 354 355 case PFSmeminfo: 356 return (procfs_domeminfo(curl, p, pfs, uio)); 357 358 case PFScpuinfo: 359 return (procfs_docpuinfo(curl, p, pfs, uio)); 360 361 case PFSfd: 362 return (procfs_dofd(curl, p, pfs, uio)); 363 364 case PFSuptime: 365 return (procfs_douptime(curl, p, pfs, uio)); 366 367 #ifdef __HAVE_PROCFS_MACHDEP 368 PROCFS_MACHDEP_NODETYPE_CASES 369 return (procfs_machdep_rw(curl, l, pfs, uio)); 370 #endif 371 372 default: 373 return (EOPNOTSUPP); 374 } 375 } 376 377 /* 378 * Get a string from userland into (buf). Strip a trailing 379 * nl character (to allow easy access from the shell). 380 * The buffer should be *buflenp + 1 chars long. vfs_getuserstr 381 * will automatically add a nul char at the end. 382 * 383 * Returns 0 on success or the following errors 384 * 385 * EINVAL: file offset is non-zero. 386 * EMSGSIZE: message is longer than kernel buffer 387 * EFAULT: user i/o buffer is not addressable 388 */ 389 int 390 vfs_getuserstr(uio, buf, buflenp) 391 struct uio *uio; 392 char *buf; 393 int *buflenp; 394 { 395 int xlen; 396 int error; 397 398 if (uio->uio_offset != 0) 399 return (EINVAL); 400 401 xlen = *buflenp; 402 403 /* must be able to read the whole string in one go */ 404 if (xlen < uio->uio_resid) 405 return (EMSGSIZE); 406 xlen = uio->uio_resid; 407 408 if ((error = uiomove(buf, xlen, uio)) != 0) 409 return (error); 410 411 /* allow multiple writes without seeks */ 412 uio->uio_offset = 0; 413 414 /* cleanup string and remove trailing newline */ 415 buf[xlen] = '\0'; 416 xlen = strlen(buf); 417 if (xlen > 0 && buf[xlen-1] == '\n') 418 buf[--xlen] = '\0'; 419 *buflenp = xlen; 420 421 return (0); 422 } 423 424 const vfs_namemap_t * 425 vfs_findname(nm, buf, buflen) 426 const vfs_namemap_t *nm; 427 const char *buf; 428 int buflen; 429 { 430 431 for (; nm->nm_name; nm++) 432 if (memcmp(buf, nm->nm_name, buflen+1) == 0) 433 return (nm); 434 435 return (0); 436 } 437 438 /* 439 * Initialize pfsnode hash table. 440 */ 441 void 442 procfs_hashinit() 443 { 444 lockinit(&pfs_hashlock, PINOD, "pfs_hashlock", 0, 0); 445 pfs_hashtbl = hashinit(desiredvnodes / 4, HASH_LIST, M_UFSMNT, 446 M_WAITOK, &pfs_ihash); 447 simple_lock_init(&pfs_hash_slock); 448 } 449 450 void 451 procfs_hashreinit() 452 { 453 struct pfsnode *pp; 454 struct pfs_hashhead *oldhash, *hash; 455 u_long i, oldmask, mask, val; 456 457 hash = hashinit(desiredvnodes / 4, HASH_LIST, M_UFSMNT, M_WAITOK, 458 &mask); 459 460 simple_lock(&pfs_hash_slock); 461 oldhash = pfs_hashtbl; 462 oldmask = pfs_ihash; 463 pfs_hashtbl = hash; 464 pfs_ihash = mask; 465 for (i = 0; i <= oldmask; i++) { 466 while ((pp = LIST_FIRST(&oldhash[i])) != NULL) { 467 LIST_REMOVE(pp, pfs_hash); 468 val = PFSPIDHASH(pp->pfs_pid); 469 LIST_INSERT_HEAD(&hash[val], pp, pfs_hash); 470 } 471 } 472 simple_unlock(&pfs_hash_slock); 473 hashdone(oldhash, M_UFSMNT); 474 } 475 476 /* 477 * Free pfsnode hash table. 478 */ 479 void 480 procfs_hashdone() 481 { 482 hashdone(pfs_hashtbl, M_UFSMNT); 483 } 484 485 struct vnode * 486 procfs_hashget(pid, type, fd, mp, l) 487 pid_t pid; 488 pfstype type; 489 int fd; 490 struct mount *mp; 491 struct lwp *l; 492 { 493 struct pfs_hashhead *ppp; 494 struct pfsnode *pp; 495 struct vnode *vp; 496 497 loop: 498 simple_lock(&pfs_hash_slock); 499 ppp = &pfs_hashtbl[PFSPIDHASH(pid)]; 500 LIST_FOREACH(pp, ppp, pfs_hash) { 501 vp = PFSTOV(pp); 502 if (pid == pp->pfs_pid && pp->pfs_type == type && 503 pp->pfs_fd == fd && vp->v_mount == mp) { 504 simple_lock(&vp->v_interlock); 505 simple_unlock(&pfs_hash_slock); 506 if (vget(vp, LK_EXCLUSIVE | LK_INTERLOCK, l)) 507 goto loop; 508 return (vp); 509 } 510 } 511 simple_unlock(&pfs_hash_slock); 512 return (NULL); 513 } 514 515 /* 516 * Insert the pfsnode into the hash table and lock it. 517 */ 518 void 519 procfs_hashins(pp) 520 struct pfsnode *pp; 521 { 522 struct pfs_hashhead *ppp; 523 524 /* lock the pfsnode, then put it on the appropriate hash list */ 525 lockmgr(&pp->pfs_vnode->v_lock, LK_EXCLUSIVE, (struct simplelock *)0); 526 527 simple_lock(&pfs_hash_slock); 528 ppp = &pfs_hashtbl[PFSPIDHASH(pp->pfs_pid)]; 529 LIST_INSERT_HEAD(ppp, pp, pfs_hash); 530 simple_unlock(&pfs_hash_slock); 531 } 532 533 /* 534 * Remove the pfsnode from the hash table. 535 */ 536 void 537 procfs_hashrem(pp) 538 struct pfsnode *pp; 539 { 540 simple_lock(&pfs_hash_slock); 541 LIST_REMOVE(pp, pfs_hash); 542 simple_unlock(&pfs_hash_slock); 543 } 544 545 void 546 procfs_revoke_vnodes(l, arg) 547 struct lwp *l; 548 void *arg; 549 { 550 struct pfsnode *pfs, *pnext; 551 struct vnode *vp; 552 struct mount *mp = (struct mount *)arg; 553 struct pfs_hashhead *ppp; 554 struct proc *p; 555 556 p = l->l_proc; 557 if (!(p->p_flag & P_SUGID)) 558 return; 559 560 ppp = &pfs_hashtbl[PFSPIDHASH(p->p_pid)]; 561 for (pfs = LIST_FIRST(ppp); pfs; pfs = pnext) { 562 vp = PFSTOV(pfs); 563 pnext = LIST_NEXT(pfs, pfs_hash); 564 if (vp->v_usecount > 0 && pfs->pfs_pid == p->p_pid && 565 vp->v_mount == mp) 566 VOP_REVOKE(vp, REVOKEALL); 567 } 568 } 569 570 int 571 procfs_getfp(pfs, pown, fp) 572 struct pfsnode *pfs; 573 struct proc **pown; 574 struct file **fp; 575 { 576 struct proc *p = PFIND(pfs->pfs_pid); 577 578 if (p == NULL) 579 return ESRCH; 580 581 if (pfs->pfs_fd == -1) 582 return EINVAL; 583 584 if ((*fp = fd_getfile(p->p_fd, pfs->pfs_fd)) == NULL) 585 return EBADF; 586 587 *pown = p; 588 return 0; 589 } 590
Indexes created Mon Sep 29 21:09:56 GMT 2025