1 /* $NetBSD: procfs_vnops.c,v 1.129 2006/02/02 00:29:24 christos Exp $ */ 2 3 /* 4 * Copyright (c) 1993, 1995 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_vnops.c 8.18 (Berkeley) 5/21/95 35 */ 36 37 /* 38 * Copyright (c) 1993 Jan-Simon Pendry 39 * 40 * This code is derived from software contributed to Berkeley by 41 * Jan-Simon Pendry. 42 * 43 * Redistribution and use in source and binary forms, with or without 44 * modification, are permitted provided that the following conditions 45 * are met: 46 * 1. Redistributions of source code must retain the above copyright 47 * notice, this list of conditions and the following disclaimer. 48 * 2. Redistributions in binary form must reproduce the above copyright 49 * notice, this list of conditions and the following disclaimer in the 50 * documentation and/or other materials provided with the distribution. 51 * 3. All advertising materials mentioning features or use of this software 52 * must display the following acknowledgement: 53 * This product includes software developed by the University of 54 * California, Berkeley and its contributors. 55 * 4. Neither the name of the University nor the names of its contributors 56 * may be used to endorse or promote products derived from this software 57 * without specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 * SUCH DAMAGE. 70 * 71 * @(#)procfs_vnops.c 8.18 (Berkeley) 5/21/95 72 */ 73 74 /* 75 * procfs vnode interface 76 */ 77 78 #include <sys/cdefs.h> 79 __KERNEL_RCSID(0, "$NetBSD: procfs_vnops.c,v 1.129 2006/02/02 00:29:24 christos Exp $"); 80 81 #include <sys/param.h> 82 #include <sys/systm.h> 83 #include <sys/time.h> 84 #include <sys/kernel.h> 85 #include <sys/file.h> 86 #include <sys/filedesc.h> 87 #include <sys/proc.h> 88 #include <sys/vnode.h> 89 #include <sys/namei.h> 90 #include <sys/malloc.h> 91 #include <sys/mount.h> 92 #include <sys/dirent.h> 93 #include <sys/resourcevar.h> 94 #include <sys/stat.h> 95 #include <sys/ptrace.h> 96 #include <sys/sysctl.h> /* XXX for curtain */ 97 98 #include <uvm/uvm_extern.h> /* for PAGE_SIZE */ 99 100 #include <machine/reg.h> 101 102 #include <miscfs/genfs/genfs.h> 103 #include <miscfs/procfs/procfs.h> 104 105 /* 106 * Vnode Operations. 107 * 108 */ 109 110 static int procfs_validfile_linux(struct lwp *, struct mount *); 111 static int procfs_root_readdir_callback(struct proc *, void *); 112 static struct vnode *procfs_dir(pfstype, struct lwp *, struct proc *, 113 char **, char *, int); 114 115 /* 116 * This is a list of the valid names in the 117 * process-specific sub-directories. It is 118 * used in procfs_lookup and procfs_readdir 119 */ 120 static const struct proc_target { 121 u_char pt_type; 122 u_char pt_namlen; 123 const char *pt_name; 124 pfstype pt_pfstype; 125 int (*pt_valid)(struct lwp *, struct mount *); 126 } proc_targets[] = { 127 #define N(s) sizeof(s)-1, s 128 /* name type validp */ 129 { DT_DIR, N("."), PFSproc, NULL }, 130 { DT_DIR, N(".."), PFSroot, NULL }, 131 { DT_DIR, N("fd"), PFSfd, NULL }, 132 { DT_REG, N("file"), PFSfile, procfs_validfile }, 133 { DT_REG, N("mem"), PFSmem, NULL }, 134 { DT_REG, N("regs"), PFSregs, procfs_validregs }, 135 { DT_REG, N("fpregs"), PFSfpregs, procfs_validfpregs }, 136 { DT_REG, N("ctl"), PFSctl, NULL }, 137 { DT_REG, N("stat"), PFSstat, procfs_validfile_linux }, 138 { DT_REG, N("status"), PFSstatus, NULL }, 139 { DT_REG, N("note"), PFSnote, NULL }, 140 { DT_REG, N("notepg"), PFSnotepg, NULL }, 141 { DT_REG, N("map"), PFSmap, procfs_validmap }, 142 { DT_REG, N("maps"), PFSmaps, procfs_validmap }, 143 { DT_REG, N("cmdline"), PFScmdline, NULL }, 144 { DT_REG, N("exe"), PFSfile, procfs_validfile_linux }, 145 { DT_LNK, N("cwd"), PFScwd, NULL }, 146 { DT_LNK, N("root"), PFSchroot, NULL }, 147 #ifdef __HAVE_PROCFS_MACHDEP 148 PROCFS_MACHDEP_NODETYPE_DEFNS 149 #endif 150 #undef N 151 }; 152 static const int nproc_targets = sizeof(proc_targets) / sizeof(proc_targets[0]); 153 154 /* 155 * List of files in the root directory. Note: the validate function will 156 * be called with p == NULL for these ones. 157 */ 158 static const struct proc_target proc_root_targets[] = { 159 #define N(s) sizeof(s)-1, s 160 /* name type validp */ 161 { DT_REG, N("meminfo"), PFSmeminfo, procfs_validfile_linux }, 162 { DT_REG, N("cpuinfo"), PFScpuinfo, procfs_validfile_linux }, 163 { DT_REG, N("uptime"), PFSuptime, procfs_validfile_linux }, 164 { DT_REG, N("mounts"), PFSmounts, procfs_validfile_linux }, 165 #undef N 166 }; 167 static const int nproc_root_targets = 168 sizeof(proc_root_targets) / sizeof(proc_root_targets[0]); 169 170 int procfs_lookup(void *); 171 #define procfs_create genfs_eopnotsupp 172 #define procfs_mknod genfs_eopnotsupp 173 int procfs_open(void *); 174 int procfs_close(void *); 175 int procfs_access(void *); 176 int procfs_getattr(void *); 177 int procfs_setattr(void *); 178 #define procfs_read procfs_rw 179 #define procfs_write procfs_rw 180 #define procfs_fcntl genfs_fcntl 181 #define procfs_ioctl genfs_enoioctl 182 #define procfs_poll genfs_poll 183 #define procfs_revoke genfs_revoke 184 #define procfs_fsync genfs_nullop 185 #define procfs_seek genfs_nullop 186 #define procfs_remove genfs_eopnotsupp 187 int procfs_link(void *); 188 #define procfs_rename genfs_eopnotsupp 189 #define procfs_mkdir genfs_eopnotsupp 190 #define procfs_rmdir genfs_eopnotsupp 191 int procfs_symlink(void *); 192 int procfs_readdir(void *); 193 int procfs_readlink(void *); 194 #define procfs_abortop genfs_abortop 195 int procfs_inactive(void *); 196 int procfs_reclaim(void *); 197 #define procfs_lock genfs_lock 198 #define procfs_unlock genfs_unlock 199 #define procfs_bmap genfs_badop 200 #define procfs_strategy genfs_badop 201 int procfs_print(void *); 202 int procfs_pathconf(void *); 203 #define procfs_islocked genfs_islocked 204 #define procfs_advlock genfs_einval 205 #define procfs_bwrite genfs_eopnotsupp 206 #define procfs_putpages genfs_null_putpages 207 208 static int atoi(const char *, size_t); 209 210 /* 211 * procfs vnode operations. 212 */ 213 int (**procfs_vnodeop_p)(void *); 214 const struct vnodeopv_entry_desc procfs_vnodeop_entries[] = { 215 { &vop_default_desc, vn_default_error }, 216 { &vop_lookup_desc, procfs_lookup }, /* lookup */ 217 { &vop_create_desc, procfs_create }, /* create */ 218 { &vop_mknod_desc, procfs_mknod }, /* mknod */ 219 { &vop_open_desc, procfs_open }, /* open */ 220 { &vop_close_desc, procfs_close }, /* close */ 221 { &vop_access_desc, procfs_access }, /* access */ 222 { &vop_getattr_desc, procfs_getattr }, /* getattr */ 223 { &vop_setattr_desc, procfs_setattr }, /* setattr */ 224 { &vop_read_desc, procfs_read }, /* read */ 225 { &vop_write_desc, procfs_write }, /* write */ 226 { &vop_fcntl_desc, procfs_fcntl }, /* fcntl */ 227 { &vop_ioctl_desc, procfs_ioctl }, /* ioctl */ 228 { &vop_poll_desc, procfs_poll }, /* poll */ 229 { &vop_revoke_desc, procfs_revoke }, /* revoke */ 230 { &vop_fsync_desc, procfs_fsync }, /* fsync */ 231 { &vop_seek_desc, procfs_seek }, /* seek */ 232 { &vop_remove_desc, procfs_remove }, /* remove */ 233 { &vop_link_desc, procfs_link }, /* link */ 234 { &vop_rename_desc, procfs_rename }, /* rename */ 235 { &vop_mkdir_desc, procfs_mkdir }, /* mkdir */ 236 { &vop_rmdir_desc, procfs_rmdir }, /* rmdir */ 237 { &vop_symlink_desc, procfs_symlink }, /* symlink */ 238 { &vop_readdir_desc, procfs_readdir }, /* readdir */ 239 { &vop_readlink_desc, procfs_readlink }, /* readlink */ 240 { &vop_abortop_desc, procfs_abortop }, /* abortop */ 241 { &vop_inactive_desc, procfs_inactive }, /* inactive */ 242 { &vop_reclaim_desc, procfs_reclaim }, /* reclaim */ 243 { &vop_lock_desc, procfs_lock }, /* lock */ 244 { &vop_unlock_desc, procfs_unlock }, /* unlock */ 245 { &vop_bmap_desc, procfs_bmap }, /* bmap */ 246 { &vop_strategy_desc, procfs_strategy }, /* strategy */ 247 { &vop_print_desc, procfs_print }, /* print */ 248 { &vop_islocked_desc, procfs_islocked }, /* islocked */ 249 { &vop_pathconf_desc, procfs_pathconf }, /* pathconf */ 250 { &vop_advlock_desc, procfs_advlock }, /* advlock */ 251 { &vop_putpages_desc, procfs_putpages }, /* putpages */ 252 { NULL, NULL } 253 }; 254 const struct vnodeopv_desc procfs_vnodeop_opv_desc = 255 { &procfs_vnodeop_p, procfs_vnodeop_entries }; 256 /* 257 * set things up for doing i/o on 258 * the pfsnode (vp). (vp) is locked 259 * on entry, and should be left locked 260 * on exit. 261 * 262 * for procfs we don't need to do anything 263 * in particular for i/o. all that is done 264 * is to support exclusive open on process 265 * memory images. 266 */ 267 int 268 procfs_open(v) 269 void *v; 270 { 271 struct vop_open_args /* { 272 struct vnode *a_vp; 273 int a_mode; 274 struct ucred *a_cred; 275 struct lwp *a_l; 276 } */ *ap = v; 277 struct pfsnode *pfs = VTOPFS(ap->a_vp); 278 struct lwp *l1; 279 struct proc *p2; 280 int error; 281 282 l1 = ap->a_l; /* tracer */ 283 p2 = PFIND(pfs->pfs_pid); /* traced */ 284 285 if (p2 == NULL) 286 return (ENOENT); /* was ESRCH, jsp */ 287 288 switch (pfs->pfs_type) { 289 case PFSmem: 290 if (((pfs->pfs_flags & FWRITE) && (ap->a_mode & O_EXCL)) || 291 ((pfs->pfs_flags & O_EXCL) && (ap->a_mode & FWRITE))) 292 return (EBUSY); 293 294 if ((error = process_checkioperm(l1, p2)) != 0) 295 return (error); 296 297 if (ap->a_mode & FWRITE) 298 pfs->pfs_flags = ap->a_mode & (FWRITE|O_EXCL); 299 300 return (0); 301 302 default: 303 break; 304 } 305 306 return (0); 307 } 308 309 /* 310 * close the pfsnode (vp) after doing i/o. 311 * (vp) is not locked on entry or exit. 312 * 313 * nothing to do for procfs other than undo 314 * any exclusive open flag (see _open above). 315 */ 316 int 317 procfs_close(v) 318 void *v; 319 { 320 struct vop_close_args /* { 321 struct vnode *a_vp; 322 int a_fflag; 323 struct ucred *a_cred; 324 struct lwp *a_l; 325 } */ *ap = v; 326 struct pfsnode *pfs = VTOPFS(ap->a_vp); 327 328 switch (pfs->pfs_type) { 329 case PFSmem: 330 if ((ap->a_fflag & FWRITE) && (pfs->pfs_flags & O_EXCL)) 331 pfs->pfs_flags &= ~(FWRITE|O_EXCL); 332 break; 333 334 default: 335 break; 336 } 337 338 return (0); 339 } 340 341 /* 342 * _inactive is called when the pfsnode 343 * is vrele'd and the reference count goes 344 * to zero. (vp) will be on the vnode free 345 * list, so to get it back vget() must be 346 * used. 347 * 348 * for procfs, check if the process is still 349 * alive and if it isn't then just throw away 350 * the vnode by calling vgone(). this may 351 * be overkill and a waste of time since the 352 * chances are that the process will still be 353 * there and PFIND is not free. 354 * 355 * (vp) is locked on entry, but must be unlocked on exit. 356 */ 357 int 358 procfs_inactive(v) 359 void *v; 360 { 361 struct vop_inactive_args /* { 362 struct vnode *a_vp; 363 struct proc *a_p; 364 } */ *ap = v; 365 struct vnode *vp = ap->a_vp; 366 struct pfsnode *pfs = VTOPFS(vp); 367 368 VOP_UNLOCK(vp, 0); 369 if (PFIND(pfs->pfs_pid) == NULL && (vp->v_flag & VXLOCK) == 0) 370 vgone(vp); 371 372 return (0); 373 } 374 375 /* 376 * _reclaim is called when getnewvnode() 377 * wants to make use of an entry on the vnode 378 * free list. at this time the filesystem needs 379 * to free any private data and remove the node 380 * from any private lists. 381 */ 382 int 383 procfs_reclaim(v) 384 void *v; 385 { 386 struct vop_reclaim_args /* { 387 struct vnode *a_vp; 388 } */ *ap = v; 389 390 return (procfs_freevp(ap->a_vp)); 391 } 392 393 /* 394 * Return POSIX pathconf information applicable to special devices. 395 */ 396 int 397 procfs_pathconf(v) 398 void *v; 399 { 400 struct vop_pathconf_args /* { 401 struct vnode *a_vp; 402 int a_name; 403 register_t *a_retval; 404 } */ *ap = v; 405 406 switch (ap->a_name) { 407 case _PC_LINK_MAX: 408 *ap->a_retval = LINK_MAX; 409 return (0); 410 case _PC_MAX_CANON: 411 *ap->a_retval = MAX_CANON; 412 return (0); 413 case _PC_MAX_INPUT: 414 *ap->a_retval = MAX_INPUT; 415 return (0); 416 case _PC_PIPE_BUF: 417 *ap->a_retval = PIPE_BUF; 418 return (0); 419 case _PC_CHOWN_RESTRICTED: 420 *ap->a_retval = 1; 421 return (0); 422 case _PC_VDISABLE: 423 *ap->a_retval = _POSIX_VDISABLE; 424 return (0); 425 case _PC_SYNC_IO: 426 *ap->a_retval = 1; 427 return (0); 428 default: 429 return (EINVAL); 430 } 431 /* NOTREACHED */ 432 } 433 434 /* 435 * _print is used for debugging. 436 * just print a readable description 437 * of (vp). 438 */ 439 int 440 procfs_print(v) 441 void *v; 442 { 443 struct vop_print_args /* { 444 struct vnode *a_vp; 445 } */ *ap = v; 446 struct pfsnode *pfs = VTOPFS(ap->a_vp); 447 448 printf("tag VT_PROCFS, type %d, pid %d, mode %x, flags %lx\n", 449 pfs->pfs_type, pfs->pfs_pid, pfs->pfs_mode, pfs->pfs_flags); 450 return 0; 451 } 452 453 int 454 procfs_link(v) 455 void *v; 456 { 457 struct vop_link_args /* { 458 struct vnode *a_dvp; 459 struct vnode *a_vp; 460 struct componentname *a_cnp; 461 } */ *ap = v; 462 463 VOP_ABORTOP(ap->a_dvp, ap->a_cnp); 464 vput(ap->a_dvp); 465 return (EROFS); 466 } 467 468 int 469 procfs_symlink(v) 470 void *v; 471 { 472 struct vop_symlink_args /* { 473 struct vnode *a_dvp; 474 struct vnode **a_vpp; 475 struct componentname *a_cnp; 476 struct vattr *a_vap; 477 char *a_target; 478 } */ *ap = v; 479 480 VOP_ABORTOP(ap->a_dvp, ap->a_cnp); 481 vput(ap->a_dvp); 482 return (EROFS); 483 } 484 485 /* 486 * Works out the path to (and vnode of) the target process's current 487 * working directory or chroot. If the caller is in a chroot and 488 * can't "reach" the target's cwd or root (or some other error 489 * occurs), a "/" is returned for the path and a NULL pointer is 490 * returned for the vnode. 491 */ 492 static struct vnode * 493 procfs_dir(pfstype t, struct lwp *caller, struct proc *target, 494 char **bpp, char *path, int len) 495 { 496 struct vnode *vp, *rvp = caller->l_proc->p_cwdi->cwdi_rdir; 497 char *bp; 498 499 bp = bpp ? *bpp : NULL; 500 501 switch (t) { 502 case PFScwd: 503 vp = target->p_cwdi->cwdi_cdir; 504 break; 505 case PFSchroot: 506 vp = target->p_cwdi->cwdi_rdir; 507 break; 508 default: 509 return (NULL); 510 } 511 512 if (rvp == NULL) 513 rvp = rootvnode; 514 if (vp == NULL || getcwd_common(vp, rvp, bp ? &bp : NULL, path, 515 len / 2, 0, caller) != 0) { 516 vp = NULL; 517 if (bpp) { 518 bp = *bpp; 519 *--bp = '/'; 520 } 521 } 522 523 if (bpp) 524 *bpp = bp; 525 526 return (vp); 527 } 528 529 /* 530 * Invent attributes for pfsnode (vp) and store 531 * them in (vap). 532 * Directories lengths are returned as zero since 533 * any real length would require the genuine size 534 * to be computed, and nothing cares anyway. 535 * 536 * this is relatively minimal for procfs. 537 */ 538 int 539 procfs_getattr(v) 540 void *v; 541 { 542 struct vop_getattr_args /* { 543 struct vnode *a_vp; 544 struct vattr *a_vap; 545 struct ucred *a_cred; 546 struct lwp *a_l; 547 } */ *ap = v; 548 struct pfsnode *pfs = VTOPFS(ap->a_vp); 549 struct vattr *vap = ap->a_vap; 550 struct proc *procp; 551 int error; 552 553 /* first check the process still exists */ 554 switch (pfs->pfs_type) { 555 case PFSroot: 556 case PFScurproc: 557 case PFSself: 558 procp = 0; 559 break; 560 561 default: 562 procp = PFIND(pfs->pfs_pid); 563 if (procp == NULL) 564 return (ENOENT); 565 break; 566 } 567 568 if (procp != NULL) { 569 if (CURTAIN(curlwp->l_proc->p_ucred->cr_uid, 570 procp->p_ucred->cr_uid)) 571 return (ENOENT); 572 } 573 574 error = 0; 575 576 /* start by zeroing out the attributes */ 577 VATTR_NULL(vap); 578 579 /* next do all the common fields */ 580 vap->va_type = ap->a_vp->v_type; 581 vap->va_mode = pfs->pfs_mode; 582 vap->va_fileid = pfs->pfs_fileno; 583 vap->va_flags = 0; 584 vap->va_blocksize = PAGE_SIZE; 585 586 /* 587 * Make all times be current TOD. Avoid microtime(9), it's slow. 588 * We don't guard the read from time(9) with splclock(9) since we 589 * don't actually need to be THAT sure the access is atomic. 590 * 591 * It would be possible to get the process start 592 * time from the p_stats structure, but there's 593 * no "file creation" time stamp anyway, and the 594 * p_stats structure is not addressable if u. gets 595 * swapped out for that process. 596 */ 597 TIMEVAL_TO_TIMESPEC(&time, &vap->va_ctime); 598 vap->va_atime = vap->va_mtime = vap->va_ctime; 599 if (procp) 600 TIMEVAL_TO_TIMESPEC(&procp->p_stats->p_start, 601 &vap->va_birthtime); 602 else 603 TIMEVAL_TO_TIMESPEC(&boottime, &vap->va_birthtime); 604 605 switch (pfs->pfs_type) { 606 case PFSmem: 607 case PFSregs: 608 case PFSfpregs: 609 #if defined(__HAVE_PROCFS_MACHDEP) && defined(PROCFS_MACHDEP_PROTECT_CASES) 610 PROCFS_MACHDEP_PROTECT_CASES 611 #endif 612 /* 613 * If the process has exercised some setuid or setgid 614 * privilege, then rip away read/write permission so 615 * that only root can gain access. 616 */ 617 if (procp->p_flag & P_SUGID) 618 vap->va_mode &= ~(S_IRUSR|S_IWUSR); 619 /* FALLTHROUGH */ 620 case PFSctl: 621 case PFSstatus: 622 case PFSstat: 623 case PFSnote: 624 case PFSnotepg: 625 case PFSmap: 626 case PFSmaps: 627 case PFScmdline: 628 vap->va_nlink = 1; 629 vap->va_uid = procp->p_ucred->cr_uid; 630 vap->va_gid = procp->p_ucred->cr_gid; 631 break; 632 case PFSmeminfo: 633 case PFScpuinfo: 634 case PFSuptime: 635 case PFSmounts: 636 vap->va_nlink = 1; 637 vap->va_uid = vap->va_gid = 0; 638 break; 639 640 default: 641 break; 642 } 643 644 /* 645 * now do the object specific fields 646 * 647 * The size could be set from struct reg, but it's hardly 648 * worth the trouble, and it puts some (potentially) machine 649 * dependent data into this machine-independent code. If it 650 * becomes important then this function should break out into 651 * a per-file stat function in the corresponding .c file. 652 */ 653 654 switch (pfs->pfs_type) { 655 case PFSroot: 656 /* 657 * Set nlink to 1 to tell fts(3) we don't actually know. 658 */ 659 vap->va_nlink = 1; 660 vap->va_uid = 0; 661 vap->va_gid = 0; 662 vap->va_bytes = vap->va_size = DEV_BSIZE; 663 break; 664 665 case PFSself: 666 case PFScurproc: { 667 char bf[16]; /* should be enough */ 668 vap->va_nlink = 1; 669 vap->va_uid = 0; 670 vap->va_gid = 0; 671 vap->va_bytes = vap->va_size = 672 snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid); 673 break; 674 } 675 676 case PFSfd: 677 if (pfs->pfs_fd != -1) { 678 struct file *fp; 679 struct proc *pown; 680 681 if ((error = procfs_getfp(pfs, &pown, &fp)) != 0) 682 return error; 683 FILE_USE(fp); 684 vap->va_nlink = 1; 685 vap->va_uid = fp->f_cred->cr_uid; 686 vap->va_gid = fp->f_cred->cr_gid; 687 switch (fp->f_type) { 688 case DTYPE_VNODE: 689 vap->va_bytes = vap->va_size = 690 ((struct vnode *)fp->f_data)->v_size; 691 break; 692 default: 693 vap->va_bytes = vap->va_size = 0; 694 break; 695 } 696 FILE_UNUSE(fp, proc_representative_lwp(pown)); 697 break; 698 } 699 /*FALLTHROUGH*/ 700 case PFSproc: 701 vap->va_nlink = 2; 702 vap->va_uid = procp->p_ucred->cr_uid; 703 vap->va_gid = procp->p_ucred->cr_gid; 704 vap->va_bytes = vap->va_size = DEV_BSIZE; 705 break; 706 707 case PFSfile: 708 error = EOPNOTSUPP; 709 break; 710 711 case PFSmem: 712 vap->va_bytes = vap->va_size = 713 ctob(procp->p_vmspace->vm_tsize + 714 procp->p_vmspace->vm_dsize + 715 procp->p_vmspace->vm_ssize); 716 break; 717 718 #if defined(PT_GETREGS) || defined(PT_SETREGS) 719 case PFSregs: 720 vap->va_bytes = vap->va_size = sizeof(struct reg); 721 break; 722 #endif 723 724 #if defined(PT_GETFPREGS) || defined(PT_SETFPREGS) 725 case PFSfpregs: 726 vap->va_bytes = vap->va_size = sizeof(struct fpreg); 727 break; 728 #endif 729 730 case PFSctl: 731 case PFSstatus: 732 case PFSstat: 733 case PFSnote: 734 case PFSnotepg: 735 case PFScmdline: 736 case PFSmeminfo: 737 case PFScpuinfo: 738 case PFSuptime: 739 case PFSmounts: 740 vap->va_bytes = vap->va_size = 0; 741 break; 742 case PFSmap: 743 case PFSmaps: 744 /* 745 * Advise a larger blocksize for the map files, so that 746 * they may be read in one pass. 747 */ 748 vap->va_blocksize = 4 * PAGE_SIZE; 749 vap->va_bytes = vap->va_size = 0; 750 break; 751 752 case PFScwd: 753 case PFSchroot: { 754 char *path, *bp; 755 756 MALLOC(path, char *, MAXPATHLEN + 4, M_TEMP, 757 M_WAITOK|M_CANFAIL); 758 if (path == NULL) 759 return (ENOMEM); 760 vap->va_nlink = 1; 761 vap->va_uid = 0; 762 vap->va_gid = 0; 763 bp = path + MAXPATHLEN; 764 *--bp = '\0'; 765 (void)procfs_dir(pfs->pfs_type, curlwp, procp, &bp, path, 766 MAXPATHLEN); 767 vap->va_bytes = vap->va_size = strlen(bp); 768 free(path, M_TEMP); 769 break; 770 } 771 772 #ifdef __HAVE_PROCFS_MACHDEP 773 PROCFS_MACHDEP_NODETYPE_CASES 774 error = procfs_machdep_getattr(ap->a_vp, vap, procp); 775 break; 776 #endif 777 778 default: 779 panic("procfs_getattr"); 780 } 781 782 return (error); 783 } 784 785 /*ARGSUSED*/ 786 int 787 procfs_setattr(v) 788 void *v; 789 { 790 /* 791 * just fake out attribute setting 792 * it's not good to generate an error 793 * return, otherwise things like creat() 794 * will fail when they try to set the 795 * file length to 0. worse, this means 796 * that echo $note > /proc/$pid/note will fail. 797 */ 798 799 return (0); 800 } 801 802 /* 803 * implement access checking. 804 * 805 * actually, the check for super-user is slightly 806 * broken since it will allow read access to write-only 807 * objects. this doesn't cause any particular trouble 808 * but does mean that the i/o entry points need to check 809 * that the operation really does make sense. 810 */ 811 int 812 procfs_access(v) 813 void *v; 814 { 815 struct vop_access_args /* { 816 struct vnode *a_vp; 817 int a_mode; 818 struct ucred *a_cred; 819 struct lwp *a_l; 820 } */ *ap = v; 821 struct vattr va; 822 int error; 823 824 if ((error = VOP_GETATTR(ap->a_vp, &va, ap->a_cred, ap->a_l)) != 0) 825 return (error); 826 827 return (vaccess(va.va_type, va.va_mode, 828 va.va_uid, va.va_gid, ap->a_mode, ap->a_cred)); 829 } 830 831 /* 832 * lookup. this is incredibly complicated in the 833 * general case, however for most pseudo-filesystems 834 * very little needs to be done. 835 * 836 * Locking isn't hard here, just poorly documented. 837 * 838 * If we're looking up ".", just vref the parent & return it. 839 * 840 * If we're looking up "..", unlock the parent, and lock "..". If everything 841 * went ok, and we're on the last component and the caller requested the 842 * parent locked, try to re-lock the parent. We do this to prevent lock 843 * races. 844 * 845 * For anything else, get the needed node. Then unlock the parent if not 846 * the last component or not LOCKPARENT (i.e. if we wouldn't re-lock the 847 * parent in the .. case). 848 * 849 * We try to exit with the parent locked in error cases. 850 */ 851 int 852 procfs_lookup(v) 853 void *v; 854 { 855 struct vop_lookup_args /* { 856 struct vnode * a_dvp; 857 struct vnode ** a_vpp; 858 struct componentname * a_cnp; 859 } */ *ap = v; 860 struct componentname *cnp = ap->a_cnp; 861 struct vnode **vpp = ap->a_vpp; 862 struct vnode *dvp = ap->a_dvp; 863 const char *pname = cnp->cn_nameptr; 864 const struct proc_target *pt = NULL; 865 struct vnode *fvp; 866 pid_t pid; 867 struct pfsnode *pfs; 868 struct proc *p = NULL; 869 struct lwp *l = NULL; 870 int i, error, wantpunlock, iscurproc = 0, isself = 0; 871 872 *vpp = NULL; 873 cnp->cn_flags &= ~PDIRUNLOCK; 874 875 if (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME) 876 return (EROFS); 877 878 if (cnp->cn_namelen == 1 && *pname == '.') { 879 *vpp = dvp; 880 VREF(dvp); 881 return (0); 882 } 883 884 wantpunlock = (~cnp->cn_flags & (LOCKPARENT | ISLASTCN)); 885 pfs = VTOPFS(dvp); 886 switch (pfs->pfs_type) { 887 case PFSroot: 888 /* 889 * Shouldn't get here with .. in the root node. 890 */ 891 if (cnp->cn_flags & ISDOTDOT) 892 return (EIO); 893 894 iscurproc = CNEQ(cnp, "curproc", 7); 895 isself = CNEQ(cnp, "self", 4); 896 897 if (iscurproc || isself) { 898 error = procfs_allocvp(dvp->v_mount, vpp, 0, 899 iscurproc ? PFScurproc : PFSself, -1); 900 if ((error == 0) && (wantpunlock)) { 901 VOP_UNLOCK(dvp, 0); 902 cnp->cn_flags |= PDIRUNLOCK; 903 } 904 return (error); 905 } 906 907 for (i = 0; i < nproc_root_targets; i++) { 908 pt = &proc_root_targets[i]; 909 if (cnp->cn_namelen == pt->pt_namlen && 910 memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 && 911 (pt->pt_valid == NULL || 912 (*pt->pt_valid)(cnp->cn_lwp, dvp->v_mount))) 913 break; 914 } 915 916 if (i != nproc_root_targets) { 917 error = procfs_allocvp(dvp->v_mount, vpp, 0, 918 pt->pt_pfstype, -1); 919 if ((error == 0) && (wantpunlock)) { 920 VOP_UNLOCK(dvp, 0); 921 cnp->cn_flags |= PDIRUNLOCK; 922 } 923 return (error); 924 } 925 926 pid = (pid_t)atoi(pname, cnp->cn_namelen); 927 928 p = PFIND(pid); 929 if (p == NULL) 930 break; 931 932 error = procfs_allocvp(dvp->v_mount, vpp, pid, PFSproc, -1); 933 if ((error == 0) && (wantpunlock)) { 934 VOP_UNLOCK(dvp, 0); 935 cnp->cn_flags |= PDIRUNLOCK; 936 } 937 return (error); 938 939 case PFSproc: 940 /* 941 * do the .. dance. We unlock the directory, and then 942 * get the root dir. That will automatically return .. 943 * locked. Then if the caller wanted dvp locked, we 944 * re-lock. 945 */ 946 if (cnp->cn_flags & ISDOTDOT) { 947 VOP_UNLOCK(dvp, 0); 948 cnp->cn_flags |= PDIRUNLOCK; 949 error = procfs_root(dvp->v_mount, vpp); 950 if ((error == 0) && (wantpunlock == 0) && 951 ((error = vn_lock(dvp, LK_EXCLUSIVE)) == 0)) 952 cnp->cn_flags &= ~PDIRUNLOCK; 953 return (error); 954 } 955 956 p = PFIND(pfs->pfs_pid); 957 if (p == NULL) 958 break; 959 l = proc_representative_lwp(p); 960 961 for (pt = proc_targets, i = 0; i < nproc_targets; pt++, i++) { 962 if (cnp->cn_namelen == pt->pt_namlen && 963 memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 && 964 (pt->pt_valid == NULL || 965 (*pt->pt_valid)(cnp->cn_lwp, dvp->v_mount))) 966 goto found; 967 } 968 break; 969 970 found: 971 if (pt->pt_pfstype == PFSfile) { 972 fvp = p->p_textvp; 973 /* We already checked that it exists. */ 974 VREF(fvp); 975 vn_lock(fvp, LK_EXCLUSIVE | LK_RETRY); 976 if (wantpunlock) { 977 VOP_UNLOCK(dvp, 0); 978 cnp->cn_flags |= PDIRUNLOCK; 979 } 980 *vpp = fvp; 981 return (0); 982 } 983 984 error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, 985 pt->pt_pfstype, -1); 986 if ((error == 0) && (wantpunlock)) { 987 VOP_UNLOCK(dvp, 0); 988 cnp->cn_flags |= PDIRUNLOCK; 989 } 990 return (error); 991 992 case PFSfd: { 993 int fd; 994 struct file *fp; 995 /* 996 * do the .. dance. We unlock the directory, and then 997 * get the proc dir. That will automatically return .. 998 * locked. Then if the caller wanted dvp locked, we 999 * re-lock. 1000 */ 1001 if (cnp->cn_flags & ISDOTDOT) { 1002 VOP_UNLOCK(dvp, 0); 1003 cnp->cn_flags |= PDIRUNLOCK; 1004 error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, 1005 PFSproc, -1); 1006 if ((error == 0) && (wantpunlock == 0) && 1007 ((error = vn_lock(dvp, LK_EXCLUSIVE)) == 0)) 1008 cnp->cn_flags &= ~PDIRUNLOCK; 1009 return (error); 1010 } 1011 fd = atoi(pname, cnp->cn_namelen); 1012 p = PFIND(pfs->pfs_pid); 1013 if (p == NULL || (fp = fd_getfile(p->p_fd, fd)) == NULL) 1014 return ENOENT; 1015 FILE_USE(fp); 1016 1017 switch (fp->f_type) { 1018 case DTYPE_VNODE: 1019 fvp = (struct vnode *)fp->f_data; 1020 1021 /* Don't show directories */ 1022 if (fvp->v_type == VDIR) 1023 goto symlink; 1024 1025 VREF(fvp); 1026 FILE_UNUSE(fp, l); 1027 vn_lock(fvp, LK_EXCLUSIVE | LK_RETRY | 1028 (p == curproc ? LK_CANRECURSE : 0)); 1029 *vpp = fvp; 1030 error = 0; 1031 break; 1032 default: 1033 symlink: 1034 FILE_UNUSE(fp, l); 1035 error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid, 1036 PFSfd, fd); 1037 break; 1038 } 1039 if ((error == 0) && (wantpunlock)) { 1040 VOP_UNLOCK(dvp, 0); 1041 cnp->cn_flags |= PDIRUNLOCK; 1042 } 1043 return error; 1044 } 1045 default: 1046 return (ENOTDIR); 1047 } 1048 1049 return (cnp->cn_nameiop == LOOKUP ? ENOENT : EROFS); 1050 } 1051 1052 int 1053 procfs_validfile(l, mp) 1054 struct lwp *l; 1055 struct mount *mp; 1056 { 1057 return (l->l_proc->p_textvp != NULL); 1058 } 1059 1060 static int 1061 procfs_validfile_linux(l, mp) 1062 struct lwp *l; 1063 struct mount *mp; 1064 { 1065 int flags; 1066 1067 flags = VFSTOPROC(mp)->pmnt_flags; 1068 return ((flags & PROCFSMNT_LINUXCOMPAT) && 1069 (l == NULL || l->l_proc == NULL || procfs_validfile(l, mp))); 1070 } 1071 1072 struct procfs_root_readdir_ctx { 1073 struct uio *uiop; 1074 off_t *cookies; 1075 int ncookies; 1076 off_t off; 1077 off_t startoff; 1078 int error; 1079 }; 1080 1081 static int 1082 procfs_root_readdir_callback(struct proc *p, void *arg) 1083 { 1084 struct procfs_root_readdir_ctx *ctxp = arg; 1085 struct dirent d; 1086 struct uio *uiop; 1087 int error; 1088 1089 uiop = ctxp->uiop; 1090 if (uiop->uio_resid < UIO_MX) 1091 return -1; /* no space */ 1092 1093 if (ctxp->off < ctxp->startoff) { 1094 ctxp->off++; 1095 return 0; 1096 } 1097 1098 if (CURTAIN(curlwp->l_proc->p_ucred->cr_uid, p->p_ucred->cr_uid)) 1099 return (0); 1100 1101 memset(&d, 0, UIO_MX); 1102 d.d_reclen = UIO_MX; 1103 d.d_fileno = PROCFS_FILENO(p->p_pid, PFSproc, -1); 1104 d.d_namlen = snprintf(d.d_name, 1105 UIO_MX - offsetof(struct dirent, d_name), "%ld", (long)p->p_pid); 1106 d.d_type = DT_DIR; 1107 1108 proclist_unlock_read(); 1109 error = uiomove(&d, UIO_MX, uiop); 1110 proclist_lock_read(); 1111 if (error) { 1112 ctxp->error = error; 1113 return -1; 1114 } 1115 1116 ctxp->ncookies++; 1117 if (ctxp->cookies) 1118 *(ctxp->cookies)++ = ctxp->off + 1; 1119 ctxp->off++; 1120 1121 return 0; 1122 } 1123 1124 /* 1125 * readdir returns directory entries from pfsnode (vp). 1126 * 1127 * the strategy here with procfs is to generate a single 1128 * directory entry at a time (struct dirent) and then 1129 * copy that out to userland using uiomove. a more efficent 1130 * though more complex implementation, would try to minimize 1131 * the number of calls to uiomove(). for procfs, this is 1132 * hardly worth the added code complexity. 1133 * 1134 * this should just be done through read() 1135 */ 1136 int 1137 procfs_readdir(v) 1138 void *v; 1139 { 1140 struct vop_readdir_args /* { 1141 struct vnode *a_vp; 1142 struct uio *a_uio; 1143 struct ucred *a_cred; 1144 int *a_eofflag; 1145 off_t **a_cookies; 1146 int *a_ncookies; 1147 } */ *ap = v; 1148 struct uio *uio = ap->a_uio; 1149 struct dirent d; 1150 struct pfsnode *pfs; 1151 off_t i; 1152 int error; 1153 off_t *cookies = NULL; 1154 int ncookies; 1155 struct vnode *vp; 1156 const struct proc_target *pt; 1157 struct procfs_root_readdir_ctx ctx; 1158 1159 vp = ap->a_vp; 1160 pfs = VTOPFS(vp); 1161 1162 if (uio->uio_resid < UIO_MX) 1163 return (EINVAL); 1164 if (uio->uio_offset < 0) 1165 return (EINVAL); 1166 1167 error = 0; 1168 i = uio->uio_offset; 1169 memset(&d, 0, UIO_MX); 1170 d.d_reclen = UIO_MX; 1171 ncookies = uio->uio_resid / UIO_MX; 1172 1173 switch (pfs->pfs_type) { 1174 /* 1175 * this is for the process-specific sub-directories. 1176 * all that is needed to is copy out all the entries 1177 * from the procent[] table (top of this file). 1178 */ 1179 case PFSproc: { 1180 struct proc *p; 1181 1182 if (i >= nproc_targets) 1183 return 0; 1184 1185 p = PFIND(pfs->pfs_pid); 1186 if (p == NULL) 1187 break; 1188 1189 if (ap->a_ncookies) { 1190 ncookies = min(ncookies, (nproc_targets - i)); 1191 cookies = malloc(ncookies * sizeof (off_t), 1192 M_TEMP, M_WAITOK); 1193 *ap->a_cookies = cookies; 1194 } 1195 1196 for (pt = &proc_targets[i]; 1197 uio->uio_resid >= UIO_MX && i < nproc_targets; pt++, i++) { 1198 if (pt->pt_valid && 1199 (*pt->pt_valid)(proc_representative_lwp(p), vp->v_mount) == 0) 1200 continue; 1201 1202 d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, 1203 pt->pt_pfstype, -1); 1204 d.d_namlen = pt->pt_namlen; 1205 memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); 1206 d.d_type = pt->pt_type; 1207 1208 if ((error = uiomove(&d, UIO_MX, uio)) != 0) 1209 break; 1210 if (cookies) 1211 *cookies++ = i + 1; 1212 } 1213 1214 break; 1215 } 1216 case PFSfd: { 1217 struct proc *p; 1218 struct filedesc *fdp; 1219 struct file *fp; 1220 int lim, nc = 0; 1221 1222 p = PFIND(pfs->pfs_pid); 1223 if (p == NULL) 1224 return ESRCH; 1225 1226 if (CURTAIN(curlwp->l_proc->p_ucred->cr_uid, 1227 p->p_ucred->cr_uid)) 1228 return (ESRCH); 1229 1230 fdp = p->p_fd; 1231 1232 lim = min((int)p->p_rlimit[RLIMIT_NOFILE].rlim_cur, maxfiles); 1233 if (i >= lim) 1234 return 0; 1235 1236 if (ap->a_ncookies) { 1237 ncookies = min(ncookies, (fdp->fd_nfiles + 2 - i)); 1238 cookies = malloc(ncookies * sizeof (off_t), 1239 M_TEMP, M_WAITOK); 1240 *ap->a_cookies = cookies; 1241 } 1242 1243 for (; i < 2 && uio->uio_resid >= UIO_MX; i++) { 1244 pt = &proc_targets[i]; 1245 d.d_namlen = pt->pt_namlen; 1246 d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, 1247 pt->pt_pfstype, -1); 1248 (void)memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); 1249 d.d_type = pt->pt_type; 1250 if ((error = uiomove(&d, UIO_MX, uio)) != 0) 1251 break; 1252 if (cookies) 1253 *cookies++ = i + 1; 1254 nc++; 1255 } 1256 if (error) { 1257 ncookies = nc; 1258 break; 1259 } 1260 for (; uio->uio_resid >= UIO_MX && i < fdp->fd_nfiles; i++) { 1261 /* check the descriptor exists */ 1262 if ((fp = fd_getfile(fdp, i - 2)) == NULL) 1263 continue; 1264 simple_unlock(&fp->f_slock); 1265 1266 d.d_fileno = PROCFS_FILENO(pfs->pfs_pid, PFSfd, i - 2); 1267 d.d_namlen = snprintf(d.d_name, sizeof(d.d_name), 1268 "%lld", (long long)(i - 2)); 1269 d.d_type = VREG; 1270 if ((error = uiomove(&d, UIO_MX, uio)) != 0) 1271 break; 1272 if (cookies) 1273 *cookies++ = i + 1; 1274 nc++; 1275 } 1276 ncookies = nc; 1277 break; 1278 } 1279 1280 /* 1281 * this is for the root of the procfs filesystem 1282 * what is needed are special entries for "curproc" 1283 * and "self" followed by an entry for each process 1284 * on allproc. 1285 */ 1286 1287 case PFSroot: { 1288 int nc = 0; 1289 1290 if (ap->a_ncookies) { 1291 /* 1292 * XXX Potentially allocating too much space here, 1293 * but I'm lazy. This loop needs some work. 1294 */ 1295 cookies = malloc(ncookies * sizeof (off_t), 1296 M_TEMP, M_WAITOK); 1297 *ap->a_cookies = cookies; 1298 } 1299 error = 0; 1300 /* 0 ... 3 are static entries. */ 1301 for (; i <= 3 && uio->uio_resid >= UIO_MX; i++) { 1302 switch (i) { 1303 case 0: /* `.' */ 1304 case 1: /* `..' */ 1305 d.d_fileno = PROCFS_FILENO(0, PFSroot, -1); 1306 d.d_namlen = i + 1; 1307 memcpy(d.d_name, "..", d.d_namlen); 1308 d.d_name[i + 1] = '\0'; 1309 d.d_type = DT_DIR; 1310 break; 1311 1312 case 2: 1313 d.d_fileno = PROCFS_FILENO(0, PFScurproc, -1); 1314 d.d_namlen = sizeof("curproc") - 1; 1315 memcpy(d.d_name, "curproc", sizeof("curproc")); 1316 d.d_type = DT_LNK; 1317 break; 1318 1319 case 3: 1320 d.d_fileno = PROCFS_FILENO(0, PFSself, -1); 1321 d.d_namlen = sizeof("self") - 1; 1322 memcpy(d.d_name, "self", sizeof("self")); 1323 d.d_type = DT_LNK; 1324 break; 1325 } 1326 1327 if ((error = uiomove(&d, UIO_MX, uio)) != 0) 1328 break; 1329 nc++; 1330 if (cookies) 1331 *cookies++ = i + 1; 1332 } 1333 /* 4 ... are process entries. */ 1334 ctx.uiop = uio; 1335 ctx.error = 0; 1336 ctx.off = 4; 1337 ctx.startoff = i; 1338 ctx.cookies = cookies; 1339 ctx.ncookies = nc; 1340 proclist_foreach_call(&allproc, 1341 procfs_root_readdir_callback, &ctx); 1342 cookies = ctx.cookies; 1343 nc = ctx.ncookies; 1344 error = ctx.error; 1345 if (error) 1346 break; 1347 1348 /* misc entries. */ 1349 if (i < ctx.off) 1350 i = ctx.off; 1351 if (i >= ctx.off + nproc_root_targets) 1352 break; 1353 for (pt = &proc_root_targets[i - ctx.off]; 1354 uio->uio_resid >= UIO_MX && 1355 pt < &proc_root_targets[nproc_root_targets]; 1356 pt++, i++) { 1357 if (pt->pt_valid && 1358 (*pt->pt_valid)(NULL, vp->v_mount) == 0) 1359 continue; 1360 d.d_fileno = PROCFS_FILENO(0, pt->pt_pfstype, -1); 1361 d.d_namlen = pt->pt_namlen; 1362 memcpy(d.d_name, pt->pt_name, pt->pt_namlen + 1); 1363 d.d_type = pt->pt_type; 1364 1365 if ((error = uiomove(&d, UIO_MX, uio)) != 0) 1366 break; 1367 nc++; 1368 if (cookies) 1369 *cookies++ = i + 1; 1370 } 1371 1372 ncookies = nc; 1373 break; 1374 } 1375 1376 default: 1377 error = ENOTDIR; 1378 break; 1379 } 1380 1381 if (ap->a_ncookies) { 1382 if (error) { 1383 if (cookies) 1384 free(*ap->a_cookies, M_TEMP); 1385 *ap->a_ncookies = 0; 1386 *ap->a_cookies = NULL; 1387 } else 1388 *ap->a_ncookies = ncookies; 1389 } 1390 uio->uio_offset = i; 1391 return (error); 1392 } 1393 1394 /* 1395 * readlink reads the link of `curproc' and others 1396 */ 1397 int 1398 procfs_readlink(v) 1399 void *v; 1400 { 1401 struct vop_readlink_args *ap = v; 1402 char bf[16]; /* should be enough */ 1403 char *bp = bf; 1404 char *path = NULL; 1405 int len; 1406 int error = 0; 1407 struct pfsnode *pfs = VTOPFS(ap->a_vp); 1408 struct proc *pown; 1409 1410 if (pfs->pfs_fileno == PROCFS_FILENO(0, PFScurproc, -1)) 1411 len = snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid); 1412 else if (pfs->pfs_fileno == PROCFS_FILENO(0, PFSself, -1)) 1413 len = snprintf(bf, sizeof(bf), "%s", "curproc"); 1414 else if (pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFScwd, -1)) { 1415 pown = PFIND(pfs->pfs_pid); 1416 if (pown == NULL) 1417 return (ESRCH); 1418 MALLOC(path, char *, MAXPATHLEN + 4, M_TEMP, 1419 M_WAITOK|M_CANFAIL); 1420 if (path == NULL) 1421 return (ENOMEM); 1422 bp = path + MAXPATHLEN; 1423 *--bp = '\0'; 1424 (void)procfs_dir(PFScwd, curlwp, pown, &bp, path, 1425 MAXPATHLEN); 1426 len = strlen(bp); 1427 } 1428 else if (pfs->pfs_fileno == PROCFS_FILENO(pfs->pfs_pid, PFSchroot, -1)) { 1429 pown = PFIND(pfs->pfs_pid); 1430 if (pown == NULL) 1431 return (ESRCH); 1432 MALLOC(path, char *, MAXPATHLEN + 4, M_TEMP, 1433 M_WAITOK|M_CANFAIL); 1434 if (path == NULL) 1435 return (ENOMEM); 1436 bp = path + MAXPATHLEN; 1437 *--bp = '\0'; 1438 (void)procfs_dir(PFSchroot, curlwp, pown, &bp, path, 1439 MAXPATHLEN); 1440 len = strlen(bp); 1441 } 1442 else { 1443 struct file *fp; 1444 struct vnode *vxp, *vp; 1445 1446 if ((error = procfs_getfp(pfs, &pown, &fp)) != 0) 1447 return error; 1448 FILE_USE(fp); 1449 switch (fp->f_type) { 1450 case DTYPE_VNODE: 1451 vxp = (struct vnode *)fp->f_data; 1452 if (vxp->v_type != VDIR) { 1453 FILE_UNUSE(fp, proc_representative_lwp(pown)); 1454 return EINVAL; 1455 } 1456 if ((path = malloc(MAXPATHLEN, M_TEMP, M_WAITOK)) 1457 == NULL) { 1458 FILE_UNUSE(fp, proc_representative_lwp(pown)); 1459 return ENOMEM; 1460 } 1461 bp = path + MAXPATHLEN; 1462 *--bp = '\0'; 1463 vp = curproc->p_cwdi->cwdi_rdir; 1464 if (vp == NULL) 1465 vp = rootvnode; 1466 error = getcwd_common(vxp, vp, &bp, path, 1467 MAXPATHLEN / 2, 0, curlwp); 1468 FILE_UNUSE(fp, proc_representative_lwp(pown)); 1469 if (error) { 1470 free(path, M_TEMP); 1471 return error; 1472 } 1473 len = strlen(bp); 1474 break; 1475 1476 case DTYPE_MISC: 1477 len = snprintf(bf, sizeof(bf), "%s", "[misc]"); 1478 break; 1479 1480 case DTYPE_KQUEUE: 1481 len = snprintf(bf, sizeof(bf), "%s", "[kqueue]"); 1482 break; 1483 1484 default: 1485 return EINVAL; 1486 } 1487 } 1488 1489 error = uiomove(bp, len, ap->a_uio); 1490 if (path) 1491 free(path, M_TEMP); 1492 return error; 1493 } 1494 1495 /* 1496 * convert decimal ascii to int 1497 */ 1498 static int 1499 atoi(b, len) 1500 const char *b; 1501 size_t len; 1502 { 1503 int p = 0; 1504 1505 while (len--) { 1506 char c = *b++; 1507 if (c < '0' || c > '9') 1508 return -1; 1509 p = 10 * p + (c - '0'); 1510 } 1511 1512 return p; 1513 } 1514