Home | History | Annotate | Line # | Download | only in procfs
procfs_vnops.c revision 1.135
      1 /*	$NetBSD: procfs_vnops.c,v 1.135 2006/10/12 01:32:27 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.135 2006/10/12 01:32:27 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 #include <sys/kauth.h>
     98 
     99 #include <uvm/uvm_extern.h>	/* for PAGE_SIZE */
    100 
    101 #include <machine/reg.h>
    102 
    103 #include <miscfs/genfs/genfs.h>
    104 #include <miscfs/procfs/procfs.h>
    105 
    106 /*
    107  * Vnode Operations.
    108  *
    109  */
    110 
    111 static int procfs_validfile_linux(struct lwp *, struct mount *);
    112 static int procfs_root_readdir_callback(struct proc *, void *);
    113 static struct vnode *procfs_dir(pfstype, struct lwp *, struct proc *,
    114 				char **, char *, int);
    115 
    116 /*
    117  * This is a list of the valid names in the
    118  * process-specific sub-directories.  It is
    119  * used in procfs_lookup and procfs_readdir
    120  */
    121 static const struct proc_target {
    122 	u_char	pt_type;
    123 	u_char	pt_namlen;
    124 	const char	*pt_name;
    125 	pfstype	pt_pfstype;
    126 	int	(*pt_valid)(struct lwp *, struct mount *);
    127 } proc_targets[] = {
    128 #define N(s) sizeof(s)-1, s
    129 	/*	  name		type		validp */
    130 	{ DT_DIR, N("."),	PFSproc,		NULL },
    131 	{ DT_DIR, N(".."),	PFSroot,		NULL },
    132 	{ DT_DIR, N("fd"),	PFSfd,		NULL },
    133 	{ DT_REG, N("file"),	PFSfile,		procfs_validfile },
    134 	{ DT_REG, N("mem"),	PFSmem,		NULL },
    135 	{ DT_REG, N("regs"),	PFSregs,		procfs_validregs },
    136 	{ DT_REG, N("fpregs"),	PFSfpregs,	procfs_validfpregs },
    137 	{ DT_REG, N("ctl"),	PFSctl,		NULL },
    138 	{ DT_REG, N("stat"),	PFSstat,		procfs_validfile_linux },
    139 	{ DT_REG, N("status"),	PFSstatus,	NULL },
    140 	{ DT_REG, N("note"),	PFSnote,		NULL },
    141 	{ DT_REG, N("notepg"),	PFSnotepg,	NULL },
    142 	{ DT_REG, N("map"),	PFSmap,		procfs_validmap },
    143 	{ DT_REG, N("maps"),	PFSmaps,		procfs_validmap },
    144 	{ DT_REG, N("cmdline"), PFScmdline,	NULL },
    145 	{ DT_REG, N("exe"),	PFSfile,		procfs_validfile_linux },
    146 	{ DT_LNK, N("cwd"),	PFScwd,		NULL },
    147 	{ DT_LNK, N("root"),	PFSchroot,	NULL },
    148 #ifdef __HAVE_PROCFS_MACHDEP
    149 	PROCFS_MACHDEP_NODETYPE_DEFNS
    150 #endif
    151 #undef N
    152 };
    153 static const int nproc_targets = sizeof(proc_targets) / sizeof(proc_targets[0]);
    154 
    155 /*
    156  * List of files in the root directory. Note: the validate function will
    157  * be called with p == NULL for these ones.
    158  */
    159 static const struct proc_target proc_root_targets[] = {
    160 #define N(s) sizeof(s)-1, s
    161 	/*	  name		    type	    validp */
    162 	{ DT_REG, N("meminfo"),     PFSmeminfo,        procfs_validfile_linux },
    163 	{ DT_REG, N("cpuinfo"),     PFScpuinfo,        procfs_validfile_linux },
    164 	{ DT_REG, N("uptime"),      PFSuptime,         procfs_validfile_linux },
    165 	{ DT_REG, N("mounts"),	    PFSmounts,	       procfs_validfile_linux },
    166 	{ DT_REG, N("devices"),     PFSdevices,        procfs_validfile_linux },
    167 #undef N
    168 };
    169 static const int nproc_root_targets =
    170     sizeof(proc_root_targets) / sizeof(proc_root_targets[0]);
    171 
    172 int	procfs_lookup(void *);
    173 #define	procfs_create	genfs_eopnotsupp
    174 #define	procfs_mknod	genfs_eopnotsupp
    175 int	procfs_open(void *);
    176 int	procfs_close(void *);
    177 int	procfs_access(void *);
    178 int	procfs_getattr(void *);
    179 int	procfs_setattr(void *);
    180 #define	procfs_read	procfs_rw
    181 #define	procfs_write	procfs_rw
    182 #define	procfs_fcntl	genfs_fcntl
    183 #define	procfs_ioctl	genfs_enoioctl
    184 #define	procfs_poll	genfs_poll
    185 #define procfs_revoke	genfs_revoke
    186 #define	procfs_fsync	genfs_nullop
    187 #define	procfs_seek	genfs_nullop
    188 #define	procfs_remove	genfs_eopnotsupp
    189 int	procfs_link(void *);
    190 #define	procfs_rename	genfs_eopnotsupp
    191 #define	procfs_mkdir	genfs_eopnotsupp
    192 #define	procfs_rmdir	genfs_eopnotsupp
    193 int	procfs_symlink(void *);
    194 int	procfs_readdir(void *);
    195 int	procfs_readlink(void *);
    196 #define	procfs_abortop	genfs_abortop
    197 int	procfs_inactive(void *);
    198 int	procfs_reclaim(void *);
    199 #define	procfs_lock	genfs_lock
    200 #define	procfs_unlock	genfs_unlock
    201 #define	procfs_bmap	genfs_badop
    202 #define	procfs_strategy	genfs_badop
    203 int	procfs_print(void *);
    204 int	procfs_pathconf(void *);
    205 #define	procfs_islocked	genfs_islocked
    206 #define	procfs_advlock	genfs_einval
    207 #define	procfs_bwrite	genfs_eopnotsupp
    208 #define procfs_putpages	genfs_null_putpages
    209 
    210 static int atoi(const char *, size_t);
    211 
    212 /*
    213  * procfs vnode operations.
    214  */
    215 int (**procfs_vnodeop_p)(void *);
    216 const struct vnodeopv_entry_desc procfs_vnodeop_entries[] = {
    217 	{ &vop_default_desc, vn_default_error },
    218 	{ &vop_lookup_desc, procfs_lookup },		/* lookup */
    219 	{ &vop_create_desc, procfs_create },		/* create */
    220 	{ &vop_mknod_desc, procfs_mknod },		/* mknod */
    221 	{ &vop_open_desc, procfs_open },		/* open */
    222 	{ &vop_close_desc, procfs_close },		/* close */
    223 	{ &vop_access_desc, procfs_access },		/* access */
    224 	{ &vop_getattr_desc, procfs_getattr },		/* getattr */
    225 	{ &vop_setattr_desc, procfs_setattr },		/* setattr */
    226 	{ &vop_read_desc, procfs_read },		/* read */
    227 	{ &vop_write_desc, procfs_write },		/* write */
    228 	{ &vop_fcntl_desc, procfs_fcntl },		/* fcntl */
    229 	{ &vop_ioctl_desc, procfs_ioctl },		/* ioctl */
    230 	{ &vop_poll_desc, procfs_poll },		/* poll */
    231 	{ &vop_revoke_desc, procfs_revoke },		/* revoke */
    232 	{ &vop_fsync_desc, procfs_fsync },		/* fsync */
    233 	{ &vop_seek_desc, procfs_seek },		/* seek */
    234 	{ &vop_remove_desc, procfs_remove },		/* remove */
    235 	{ &vop_link_desc, procfs_link },		/* link */
    236 	{ &vop_rename_desc, procfs_rename },		/* rename */
    237 	{ &vop_mkdir_desc, procfs_mkdir },		/* mkdir */
    238 	{ &vop_rmdir_desc, procfs_rmdir },		/* rmdir */
    239 	{ &vop_symlink_desc, procfs_symlink },		/* symlink */
    240 	{ &vop_readdir_desc, procfs_readdir },		/* readdir */
    241 	{ &vop_readlink_desc, procfs_readlink },	/* readlink */
    242 	{ &vop_abortop_desc, procfs_abortop },		/* abortop */
    243 	{ &vop_inactive_desc, procfs_inactive },	/* inactive */
    244 	{ &vop_reclaim_desc, procfs_reclaim },		/* reclaim */
    245 	{ &vop_lock_desc, procfs_lock },		/* lock */
    246 	{ &vop_unlock_desc, procfs_unlock },		/* unlock */
    247 	{ &vop_bmap_desc, procfs_bmap },		/* bmap */
    248 	{ &vop_strategy_desc, procfs_strategy },	/* strategy */
    249 	{ &vop_print_desc, procfs_print },		/* print */
    250 	{ &vop_islocked_desc, procfs_islocked },	/* islocked */
    251 	{ &vop_pathconf_desc, procfs_pathconf },	/* pathconf */
    252 	{ &vop_advlock_desc, procfs_advlock },		/* advlock */
    253 	{ &vop_putpages_desc, procfs_putpages },	/* putpages */
    254 	{ NULL, NULL }
    255 };
    256 const struct vnodeopv_desc procfs_vnodeop_opv_desc =
    257 	{ &procfs_vnodeop_p, procfs_vnodeop_entries };
    258 /*
    259  * set things up for doing i/o on
    260  * the pfsnode (vp).  (vp) is locked
    261  * on entry, and should be left locked
    262  * on exit.
    263  *
    264  * for procfs we don't need to do anything
    265  * in particular for i/o.  all that is done
    266  * is to support exclusive open on process
    267  * memory images.
    268  */
    269 int
    270 procfs_open(v)
    271 	void *v;
    272 {
    273 	struct vop_open_args /* {
    274 		struct vnode *a_vp;
    275 		int  a_mode;
    276 		kauth_cred_t a_cred;
    277 		struct lwp *a_l;
    278 	} */ *ap = v;
    279 	struct pfsnode *pfs = VTOPFS(ap->a_vp);
    280 	struct lwp *l1;
    281 	struct proc *p2;
    282 	int error;
    283 
    284 	l1 = ap->a_l;				/* tracer */
    285 	p2 = PFIND(pfs->pfs_pid);		/* traced */
    286 
    287 	if (p2 == NULL)
    288 		return (ENOENT);		/* was ESRCH, jsp */
    289 
    290 	switch (pfs->pfs_type) {
    291 	case PFSmem:
    292 		if (((pfs->pfs_flags & FWRITE) && (ap->a_mode & O_EXCL)) ||
    293 		    ((pfs->pfs_flags & O_EXCL) && (ap->a_mode & FWRITE)))
    294 			return (EBUSY);
    295 
    296 		if ((error = process_checkioperm(l1, p2)) != 0)
    297 			return (error);
    298 
    299 		if (ap->a_mode & FWRITE)
    300 			pfs->pfs_flags = ap->a_mode & (FWRITE|O_EXCL);
    301 
    302 		return (0);
    303 
    304 	default:
    305 		break;
    306 	}
    307 
    308 	return (0);
    309 }
    310 
    311 /*
    312  * close the pfsnode (vp) after doing i/o.
    313  * (vp) is not locked on entry or exit.
    314  *
    315  * nothing to do for procfs other than undo
    316  * any exclusive open flag (see _open above).
    317  */
    318 int
    319 procfs_close(v)
    320 	void *v;
    321 {
    322 	struct vop_close_args /* {
    323 		struct vnode *a_vp;
    324 		int  a_fflag;
    325 		kauth_cred_t a_cred;
    326 		struct lwp *a_l;
    327 	} */ *ap = v;
    328 	struct pfsnode *pfs = VTOPFS(ap->a_vp);
    329 
    330 	switch (pfs->pfs_type) {
    331 	case PFSmem:
    332 		if ((ap->a_fflag & FWRITE) && (pfs->pfs_flags & O_EXCL))
    333 			pfs->pfs_flags &= ~(FWRITE|O_EXCL);
    334 		break;
    335 
    336 	default:
    337 		break;
    338 	}
    339 
    340 	return (0);
    341 }
    342 
    343 /*
    344  * _inactive is called when the pfsnode
    345  * is vrele'd and the reference count goes
    346  * to zero.  (vp) will be on the vnode free
    347  * list, so to get it back vget() must be
    348  * used.
    349  *
    350  * for procfs, check if the process is still
    351  * alive and if it isn't then just throw away
    352  * the vnode by calling vgone().  this may
    353  * be overkill and a waste of time since the
    354  * chances are that the process will still be
    355  * there and PFIND is not free.
    356  *
    357  * (vp) is locked on entry, but must be unlocked on exit.
    358  */
    359 int
    360 procfs_inactive(v)
    361 	void *v;
    362 {
    363 	struct vop_inactive_args /* {
    364 		struct vnode *a_vp;
    365 		struct proc *a_p;
    366 	} */ *ap = v;
    367 	struct vnode *vp = ap->a_vp;
    368 	struct pfsnode *pfs = VTOPFS(vp);
    369 
    370 	VOP_UNLOCK(vp, 0);
    371 	if (PFIND(pfs->pfs_pid) == NULL && (vp->v_flag & VXLOCK) == 0)
    372 		vgone(vp);
    373 
    374 	return (0);
    375 }
    376 
    377 /*
    378  * _reclaim is called when getnewvnode()
    379  * wants to make use of an entry on the vnode
    380  * free list.  at this time the filesystem needs
    381  * to free any private data and remove the node
    382  * from any private lists.
    383  */
    384 int
    385 procfs_reclaim(v)
    386 	void *v;
    387 {
    388 	struct vop_reclaim_args /* {
    389 		struct vnode *a_vp;
    390 	} */ *ap = v;
    391 
    392 	return (procfs_freevp(ap->a_vp));
    393 }
    394 
    395 /*
    396  * Return POSIX pathconf information applicable to special devices.
    397  */
    398 int
    399 procfs_pathconf(v)
    400 	void *v;
    401 {
    402 	struct vop_pathconf_args /* {
    403 		struct vnode *a_vp;
    404 		int a_name;
    405 		register_t *a_retval;
    406 	} */ *ap = v;
    407 
    408 	switch (ap->a_name) {
    409 	case _PC_LINK_MAX:
    410 		*ap->a_retval = LINK_MAX;
    411 		return (0);
    412 	case _PC_MAX_CANON:
    413 		*ap->a_retval = MAX_CANON;
    414 		return (0);
    415 	case _PC_MAX_INPUT:
    416 		*ap->a_retval = MAX_INPUT;
    417 		return (0);
    418 	case _PC_PIPE_BUF:
    419 		*ap->a_retval = PIPE_BUF;
    420 		return (0);
    421 	case _PC_CHOWN_RESTRICTED:
    422 		*ap->a_retval = 1;
    423 		return (0);
    424 	case _PC_VDISABLE:
    425 		*ap->a_retval = _POSIX_VDISABLE;
    426 		return (0);
    427 	case _PC_SYNC_IO:
    428 		*ap->a_retval = 1;
    429 		return (0);
    430 	default:
    431 		return (EINVAL);
    432 	}
    433 	/* NOTREACHED */
    434 }
    435 
    436 /*
    437  * _print is used for debugging.
    438  * just print a readable description
    439  * of (vp).
    440  */
    441 int
    442 procfs_print(v)
    443 	void *v;
    444 {
    445 	struct vop_print_args /* {
    446 		struct vnode *a_vp;
    447 	} */ *ap = v;
    448 	struct pfsnode *pfs = VTOPFS(ap->a_vp);
    449 
    450 	printf("tag VT_PROCFS, type %d, pid %d, mode %x, flags %lx\n",
    451 	    pfs->pfs_type, pfs->pfs_pid, pfs->pfs_mode, pfs->pfs_flags);
    452 	return 0;
    453 }
    454 
    455 int
    456 procfs_link(v)
    457 	void *v;
    458 {
    459 	struct vop_link_args /* {
    460 		struct vnode *a_dvp;
    461 		struct vnode *a_vp;
    462 		struct componentname *a_cnp;
    463 	} */ *ap = v;
    464 
    465 	VOP_ABORTOP(ap->a_dvp, ap->a_cnp);
    466 	vput(ap->a_dvp);
    467 	return (EROFS);
    468 }
    469 
    470 int
    471 procfs_symlink(v)
    472 	void *v;
    473 {
    474 	struct vop_symlink_args /* {
    475 		struct vnode *a_dvp;
    476 		struct vnode **a_vpp;
    477 		struct componentname *a_cnp;
    478 		struct vattr *a_vap;
    479 		char *a_target;
    480 	} */ *ap = v;
    481 
    482 	VOP_ABORTOP(ap->a_dvp, ap->a_cnp);
    483 	vput(ap->a_dvp);
    484 	return (EROFS);
    485 }
    486 
    487 /*
    488  * Works out the path to (and vnode of) the target process's current
    489  * working directory or chroot.  If the caller is in a chroot and
    490  * can't "reach" the target's cwd or root (or some other error
    491  * occurs), a "/" is returned for the path and a NULL pointer is
    492  * returned for the vnode.
    493  */
    494 static struct vnode *
    495 procfs_dir(pfstype t, struct lwp *caller, struct proc *target,
    496 	   char **bpp, char *path, int len)
    497 {
    498 	struct vnode *vp, *rvp = caller->l_proc->p_cwdi->cwdi_rdir;
    499 	char *bp;
    500 
    501 	bp = bpp ? *bpp : NULL;
    502 
    503 	switch (t) {
    504 	case PFScwd:
    505 		vp = target->p_cwdi->cwdi_cdir;
    506 		break;
    507 	case PFSchroot:
    508 		vp = target->p_cwdi->cwdi_rdir;
    509 		break;
    510 	default:
    511 		return (NULL);
    512 	}
    513 
    514 	if (rvp == NULL)
    515 		rvp = rootvnode;
    516 	if (vp == NULL || getcwd_common(vp, rvp, bp ? &bp : NULL, path,
    517 	    len / 2, 0, caller) != 0) {
    518 		vp = NULL;
    519 		if (bpp) {
    520 			bp = *bpp;
    521 			*--bp = '/';
    522 		}
    523 	}
    524 
    525 	if (bpp)
    526 		*bpp = bp;
    527 
    528 	return (vp);
    529 }
    530 
    531 /*
    532  * Invent attributes for pfsnode (vp) and store
    533  * them in (vap).
    534  * Directories lengths are returned as zero since
    535  * any real length would require the genuine size
    536  * to be computed, and nothing cares anyway.
    537  *
    538  * this is relatively minimal for procfs.
    539  */
    540 int
    541 procfs_getattr(v)
    542 	void *v;
    543 {
    544 	struct vop_getattr_args /* {
    545 		struct vnode *a_vp;
    546 		struct vattr *a_vap;
    547 		kauth_cred_t a_cred;
    548 		struct lwp *a_l;
    549 	} */ *ap = v;
    550 	struct pfsnode *pfs = VTOPFS(ap->a_vp);
    551 	struct vattr *vap = ap->a_vap;
    552 	struct proc *procp;
    553 	int error;
    554 
    555 	/* first check the process still exists */
    556 	switch (pfs->pfs_type) {
    557 	case PFSroot:
    558 	case PFScurproc:
    559 	case PFSself:
    560 		procp = 0;
    561 		break;
    562 
    563 	default:
    564 		procp = PFIND(pfs->pfs_pid);
    565 		if (procp == NULL)
    566 			return (ENOENT);
    567 		break;
    568 	}
    569 
    570 	if (procp != NULL) {
    571 		if (kauth_authorize_process(kauth_cred_get(),
    572 		    KAUTH_PROCESS_CANSEE, procp, NULL, NULL, NULL) != 0)
    573 			return (ENOENT);
    574 	}
    575 
    576 	error = 0;
    577 
    578 	/* start by zeroing out the attributes */
    579 	VATTR_NULL(vap);
    580 
    581 	/* next do all the common fields */
    582 	vap->va_type = ap->a_vp->v_type;
    583 	vap->va_mode = pfs->pfs_mode;
    584 	vap->va_fileid = pfs->pfs_fileno;
    585 	vap->va_flags = 0;
    586 	vap->va_blocksize = PAGE_SIZE;
    587 
    588 	/*
    589 	 * Make all times be current TOD.
    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 	getnanotime(&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 		getnanotime(&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 = kauth_cred_geteuid(procp->p_cred);
    630 		vap->va_gid = kauth_cred_getegid(procp->p_cred);
    631 		break;
    632 	case PFSmeminfo:
    633 	case PFSdevices:
    634 	case PFScpuinfo:
    635 	case PFSuptime:
    636 	case PFSmounts:
    637 		vap->va_nlink = 1;
    638 		vap->va_uid = vap->va_gid = 0;
    639 		break;
    640 
    641 	default:
    642 		break;
    643 	}
    644 
    645 	/*
    646 	 * now do the object specific fields
    647 	 *
    648 	 * The size could be set from struct reg, but it's hardly
    649 	 * worth the trouble, and it puts some (potentially) machine
    650 	 * dependent data into this machine-independent code.  If it
    651 	 * becomes important then this function should break out into
    652 	 * a per-file stat function in the corresponding .c file.
    653 	 */
    654 
    655 	switch (pfs->pfs_type) {
    656 	case PFSroot:
    657 		/*
    658 		 * Set nlink to 1 to tell fts(3) we don't actually know.
    659 		 */
    660 		vap->va_nlink = 1;
    661 		vap->va_uid = 0;
    662 		vap->va_gid = 0;
    663 		vap->va_bytes = vap->va_size = DEV_BSIZE;
    664 		break;
    665 
    666 	case PFSself:
    667 	case PFScurproc: {
    668 		char bf[16];		/* should be enough */
    669 		vap->va_nlink = 1;
    670 		vap->va_uid = 0;
    671 		vap->va_gid = 0;
    672 		vap->va_bytes = vap->va_size =
    673 		    snprintf(bf, sizeof(bf), "%ld", (long)curproc->p_pid);
    674 		break;
    675 	}
    676 
    677 	case PFSfd:
    678 		if (pfs->pfs_fd != -1) {
    679 			struct file *fp;
    680 			struct proc *pown;
    681 
    682 			if ((error = procfs_getfp(pfs, &pown, &fp)) != 0)
    683 				return error;
    684 			FILE_USE(fp);
    685 			vap->va_nlink = 1;
    686 			vap->va_uid = kauth_cred_geteuid(fp->f_cred);
    687 			vap->va_gid = kauth_cred_getegid(fp->f_cred);
    688 			switch (fp->f_type) {
    689 			case DTYPE_VNODE:
    690 				vap->va_bytes = vap->va_size =
    691 				    ((struct vnode *)fp->f_data)->v_size;
    692 				break;
    693 			default:
    694 				vap->va_bytes = vap->va_size = 0;
    695 				break;
    696 			}
    697 			FILE_UNUSE(fp, proc_representative_lwp(pown));
    698 			break;
    699 		}
    700 		/*FALLTHROUGH*/
    701 	case PFSproc:
    702 		vap->va_nlink = 2;
    703 		vap->va_uid = kauth_cred_geteuid(procp->p_cred);
    704 		vap->va_gid = kauth_cred_getegid(procp->p_cred);
    705 		vap->va_bytes = vap->va_size = DEV_BSIZE;
    706 		break;
    707 
    708 	case PFSfile:
    709 		error = EOPNOTSUPP;
    710 		break;
    711 
    712 	case PFSmem:
    713 		vap->va_bytes = vap->va_size =
    714 			ctob(procp->p_vmspace->vm_tsize +
    715 				    procp->p_vmspace->vm_dsize +
    716 				    procp->p_vmspace->vm_ssize);
    717 		break;
    718 
    719 #if defined(PT_GETREGS) || defined(PT_SETREGS)
    720 	case PFSregs:
    721 		vap->va_bytes = vap->va_size = sizeof(struct reg);
    722 		break;
    723 #endif
    724 
    725 #if defined(PT_GETFPREGS) || defined(PT_SETFPREGS)
    726 	case PFSfpregs:
    727 		vap->va_bytes = vap->va_size = sizeof(struct fpreg);
    728 		break;
    729 #endif
    730 
    731 	case PFSctl:
    732 	case PFSstatus:
    733 	case PFSstat:
    734 	case PFSnote:
    735 	case PFSnotepg:
    736 	case PFScmdline:
    737 	case PFSmeminfo:
    738 	case PFSdevices:
    739 	case PFScpuinfo:
    740 	case PFSuptime:
    741 	case PFSmounts:
    742 		vap->va_bytes = vap->va_size = 0;
    743 		break;
    744 	case PFSmap:
    745 	case PFSmaps:
    746 		/*
    747 		 * Advise a larger blocksize for the map files, so that
    748 		 * they may be read in one pass.
    749 		 */
    750 		vap->va_blocksize = 4 * PAGE_SIZE;
    751 		vap->va_bytes = vap->va_size = 0;
    752 		break;
    753 
    754 	case PFScwd:
    755 	case PFSchroot: {
    756 		char *path, *bp;
    757 
    758 		MALLOC(path, char *, MAXPATHLEN + 4, M_TEMP,
    759 		    M_WAITOK|M_CANFAIL);
    760 		if (path == NULL)
    761 			return (ENOMEM);
    762 		vap->va_nlink = 1;
    763 		vap->va_uid = 0;
    764 		vap->va_gid = 0;
    765 		bp = path + MAXPATHLEN;
    766 		*--bp = '\0';
    767 		(void)procfs_dir(pfs->pfs_type, curlwp, procp, &bp, path,
    768 		     MAXPATHLEN);
    769 		vap->va_bytes = vap->va_size = strlen(bp);
    770 		free(path, M_TEMP);
    771 		break;
    772 	}
    773 
    774 #ifdef __HAVE_PROCFS_MACHDEP
    775 	PROCFS_MACHDEP_NODETYPE_CASES
    776 		error = procfs_machdep_getattr(ap->a_vp, vap, procp);
    777 		break;
    778 #endif
    779 
    780 	default:
    781 		panic("procfs_getattr");
    782 	}
    783 
    784 	return (error);
    785 }
    786 
    787 /*ARGSUSED*/
    788 int
    789 procfs_setattr(void *v __unused)
    790 {
    791 	/*
    792 	 * just fake out attribute setting
    793 	 * it's not good to generate an error
    794 	 * return, otherwise things like creat()
    795 	 * will fail when they try to set the
    796 	 * file length to 0.  worse, this means
    797 	 * that echo $note > /proc/$pid/note will fail.
    798 	 */
    799 
    800 	return (0);
    801 }
    802 
    803 /*
    804  * implement access checking.
    805  *
    806  * actually, the check for super-user is slightly
    807  * broken since it will allow read access to write-only
    808  * objects.  this doesn't cause any particular trouble
    809  * but does mean that the i/o entry points need to check
    810  * that the operation really does make sense.
    811  */
    812 int
    813 procfs_access(v)
    814 	void *v;
    815 {
    816 	struct vop_access_args /* {
    817 		struct vnode *a_vp;
    818 		int a_mode;
    819 		kauth_cred_t a_cred;
    820 		struct lwp *a_l;
    821 	} */ *ap = v;
    822 	struct vattr va;
    823 	int error;
    824 
    825 	if ((error = VOP_GETATTR(ap->a_vp, &va, ap->a_cred, ap->a_l)) != 0)
    826 		return (error);
    827 
    828 	return (vaccess(va.va_type, va.va_mode,
    829 	    va.va_uid, va.va_gid, ap->a_mode, ap->a_cred));
    830 }
    831 
    832 /*
    833  * lookup.  this is incredibly complicated in the
    834  * general case, however for most pseudo-filesystems
    835  * very little needs to be done.
    836  *
    837  * Locking isn't hard here, just poorly documented.
    838  *
    839  * If we're looking up ".", just vref the parent & return it.
    840  *
    841  * If we're looking up "..", unlock the parent, and lock "..". If everything
    842  * went ok, and we're on the last component and the caller requested the
    843  * parent locked, try to re-lock the parent. We do this to prevent lock
    844  * races.
    845  *
    846  * For anything else, get the needed node. Then unlock the parent if not
    847  * the last component or not LOCKPARENT (i.e. if we wouldn't re-lock the
    848  * parent in the .. case).
    849  *
    850  * We try to exit with the parent locked in error cases.
    851  */
    852 int
    853 procfs_lookup(v)
    854 	void *v;
    855 {
    856 	struct vop_lookup_args /* {
    857 		struct vnode * a_dvp;
    858 		struct vnode ** a_vpp;
    859 		struct componentname * a_cnp;
    860 	} */ *ap = v;
    861 	struct componentname *cnp = ap->a_cnp;
    862 	struct vnode **vpp = ap->a_vpp;
    863 	struct vnode *dvp = ap->a_dvp;
    864 	const char *pname = cnp->cn_nameptr;
    865 	const struct proc_target *pt = NULL;
    866 	struct vnode *fvp;
    867 	pid_t pid;
    868 	struct pfsnode *pfs;
    869 	struct proc *p = NULL;
    870 	struct lwp *l = NULL;
    871 	int i, error, wantpunlock, iscurproc = 0, isself = 0;
    872 
    873 	*vpp = NULL;
    874 	cnp->cn_flags &= ~PDIRUNLOCK;
    875 
    876 	if (cnp->cn_nameiop == DELETE || cnp->cn_nameiop == RENAME)
    877 		return (EROFS);
    878 
    879 	if (cnp->cn_namelen == 1 && *pname == '.') {
    880 		*vpp = dvp;
    881 		VREF(dvp);
    882 		return (0);
    883 	}
    884 
    885 	wantpunlock = (~cnp->cn_flags & (LOCKPARENT | ISLASTCN));
    886 	pfs = VTOPFS(dvp);
    887 	switch (pfs->pfs_type) {
    888 	case PFSroot:
    889 		/*
    890 		 * Shouldn't get here with .. in the root node.
    891 		 */
    892 		if (cnp->cn_flags & ISDOTDOT)
    893 			return (EIO);
    894 
    895 		iscurproc = CNEQ(cnp, "curproc", 7);
    896 		isself = CNEQ(cnp, "self", 4);
    897 
    898 		if (iscurproc || isself) {
    899 			error = procfs_allocvp(dvp->v_mount, vpp, 0,
    900 			    iscurproc ? PFScurproc : PFSself, -1);
    901 			if ((error == 0) && (wantpunlock)) {
    902 				VOP_UNLOCK(dvp, 0);
    903 				cnp->cn_flags |= PDIRUNLOCK;
    904 			}
    905 			return (error);
    906 		}
    907 
    908 		for (i = 0; i < nproc_root_targets; i++) {
    909 			pt = &proc_root_targets[i];
    910 			if (cnp->cn_namelen == pt->pt_namlen &&
    911 			    memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 &&
    912 			    (pt->pt_valid == NULL ||
    913 			     (*pt->pt_valid)(cnp->cn_lwp, dvp->v_mount)))
    914 				break;
    915 		}
    916 
    917 		if (i != nproc_root_targets) {
    918 			error = procfs_allocvp(dvp->v_mount, vpp, 0,
    919 			    pt->pt_pfstype, -1);
    920 			if ((error == 0) && (wantpunlock)) {
    921 				VOP_UNLOCK(dvp, 0);
    922 				cnp->cn_flags |= PDIRUNLOCK;
    923 			}
    924 			return (error);
    925 		}
    926 
    927 		pid = (pid_t)atoi(pname, cnp->cn_namelen);
    928 
    929 		p = PFIND(pid);
    930 		if (p == NULL)
    931 			break;
    932 
    933 		error = procfs_allocvp(dvp->v_mount, vpp, pid, PFSproc, -1);
    934 		if ((error == 0) && (wantpunlock)) {
    935 			VOP_UNLOCK(dvp, 0);
    936 			cnp->cn_flags |= PDIRUNLOCK;
    937 		}
    938 		return (error);
    939 
    940 	case PFSproc:
    941 		/*
    942 		 * do the .. dance. We unlock the directory, and then
    943 		 * get the root dir. That will automatically return ..
    944 		 * locked. Then if the caller wanted dvp locked, we
    945 		 * re-lock.
    946 		 */
    947 		if (cnp->cn_flags & ISDOTDOT) {
    948 			VOP_UNLOCK(dvp, 0);
    949 			cnp->cn_flags |= PDIRUNLOCK;
    950 			error = procfs_root(dvp->v_mount, vpp);
    951 			if ((error == 0) && (wantpunlock == 0) &&
    952 				    ((error = vn_lock(dvp, LK_EXCLUSIVE)) == 0))
    953 				cnp->cn_flags &= ~PDIRUNLOCK;
    954 			return (error);
    955 		}
    956 
    957 		p = PFIND(pfs->pfs_pid);
    958 		if (p == NULL)
    959 			break;
    960 		l = proc_representative_lwp(p);
    961 
    962 		for (pt = proc_targets, i = 0; i < nproc_targets; pt++, i++) {
    963 			if (cnp->cn_namelen == pt->pt_namlen &&
    964 			    memcmp(pt->pt_name, pname, cnp->cn_namelen) == 0 &&
    965 			    (pt->pt_valid == NULL ||
    966 			     (*pt->pt_valid)(cnp->cn_lwp, dvp->v_mount)))
    967 				goto found;
    968 		}
    969 		break;
    970 
    971 	found:
    972 		if (pt->pt_pfstype == PFSfile) {
    973 			fvp = p->p_textvp;
    974 			/* We already checked that it exists. */
    975 			VREF(fvp);
    976 			vn_lock(fvp, LK_EXCLUSIVE | LK_RETRY);
    977 			if (wantpunlock) {
    978 				VOP_UNLOCK(dvp, 0);
    979 				cnp->cn_flags |= PDIRUNLOCK;
    980 			}
    981 			*vpp = fvp;
    982 			return (0);
    983 		}
    984 
    985 		error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid,
    986 		    pt->pt_pfstype, -1);
    987 		if ((error == 0) && (wantpunlock)) {
    988 			VOP_UNLOCK(dvp, 0);
    989 			cnp->cn_flags |= PDIRUNLOCK;
    990 		}
    991 		return (error);
    992 
    993 	case PFSfd: {
    994 		int fd;
    995 		struct file *fp;
    996 		/*
    997 		 * do the .. dance. We unlock the directory, and then
    998 		 * get the proc dir. That will automatically return ..
    999 		 * locked. Then if the caller wanted dvp locked, we
   1000 		 * re-lock.
   1001 		 */
   1002 		if (cnp->cn_flags & ISDOTDOT) {
   1003 			VOP_UNLOCK(dvp, 0);
   1004 			cnp->cn_flags |= PDIRUNLOCK;
   1005 			error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid,
   1006 			    PFSproc, -1);
   1007 			if ((error == 0) && (wantpunlock == 0) &&
   1008 				    ((error = vn_lock(dvp, LK_EXCLUSIVE)) == 0))
   1009 				cnp->cn_flags &= ~PDIRUNLOCK;
   1010 			return (error);
   1011 		}
   1012 		fd = atoi(pname, cnp->cn_namelen);
   1013 		p = PFIND(pfs->pfs_pid);
   1014 		if (p == NULL || (fp = fd_getfile(p->p_fd, fd)) == NULL)
   1015 			return ENOENT;
   1016 		FILE_USE(fp);
   1017 
   1018 		switch (fp->f_type) {
   1019 		case DTYPE_VNODE:
   1020 			fvp = (struct vnode *)fp->f_data;
   1021 
   1022 			/* Don't show directories */
   1023 			if (fvp->v_type == VDIR)
   1024 				goto symlink;
   1025 
   1026 			VREF(fvp);
   1027 			FILE_UNUSE(fp, l);
   1028 			vn_lock(fvp, LK_EXCLUSIVE | LK_RETRY |
   1029 			    (p == curproc ? LK_CANRECURSE : 0));
   1030 			*vpp = fvp;
   1031 			error = 0;
   1032 			break;
   1033 		default:
   1034 		symlink:
   1035 			FILE_UNUSE(fp, l);
   1036 			error = procfs_allocvp(dvp->v_mount, vpp, pfs->pfs_pid,
   1037 			    PFSfd, fd);
   1038 			break;
   1039 		}
   1040 		if ((error == 0) && (wantpunlock)) {
   1041 			VOP_UNLOCK(dvp, 0);
   1042 			cnp->cn_flags |= PDIRUNLOCK;
   1043 		}
   1044 		return error;
   1045 	}
   1046 	default:
   1047 		return (ENOTDIR);
   1048 	}
   1049 
   1050 	return (cnp->cn_nameiop == LOOKUP ? ENOENT : EROFS);
   1051 }
   1052 
   1053 int
   1054 procfs_validfile(struct lwp *l, struct mount *mp __unused)
   1055 {
   1056 	return (l->l_proc->p_textvp != NULL);
   1057 }
   1058 
   1059 static int
   1060 procfs_validfile_linux(l, mp)
   1061 	struct lwp *l;
   1062 	struct mount *mp;
   1063 {
   1064 	int flags;
   1065 
   1066 	flags = VFSTOPROC(mp)->pmnt_flags;
   1067 	return ((flags & PROCFSMNT_LINUXCOMPAT) &&
   1068 	    (l == NULL || l->l_proc == NULL || procfs_validfile(l, mp)));
   1069 }
   1070 
   1071 struct procfs_root_readdir_ctx {
   1072 	struct uio *uiop;
   1073 	off_t *cookies;
   1074 	int ncookies;
   1075 	off_t off;
   1076 	off_t startoff;
   1077 	int error;
   1078 };
   1079 
   1080 static int
   1081 procfs_root_readdir_callback(struct proc *p, void *arg)
   1082 {
   1083 	struct procfs_root_readdir_ctx *ctxp = arg;
   1084 	struct dirent d;
   1085 	struct uio *uiop;
   1086 	int error;
   1087 
   1088 	uiop = ctxp->uiop;
   1089 	if (uiop->uio_resid < UIO_MX)
   1090 		return -1; /* no space */
   1091 
   1092 	if (ctxp->off < ctxp->startoff) {
   1093 		ctxp->off++;
   1094 		return 0;
   1095 	}
   1096 
   1097 	if (kauth_authorize_process(kauth_cred_get(),
   1098 	    KAUTH_PROCESS_CANSEE, p, NULL, NULL, NULL) != 0)
   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 		kauth_cred_t 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 (kauth_authorize_process(kauth_cred_get(),
   1227 		    KAUTH_PROCESS_CANSEE, p, NULL, NULL, NULL) != 0)
   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