/* * Copyright (c) 1993 The Regents of the University of California. * Copyright (c) 1993 Jan-Simon Pendry * All rights reserved. * * This code is derived from software contributed to Berkeley by * Jan-Simon Pendry. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * From: * Id: procfs_vfsops.c,v 4.1 1993/12/17 10:47:45 jsp Rel * * $Id: procfs_vfsops.c,v 1.9 1994/01/05 07:51:31 cgd Exp $ */ /* * procfs VFS interface */ #include #include #include #include #include #include #include #include #include #include #include /* for page_size */ /* * VFS Operations. * * mount system call */ /* ARGSUSED */ procfs_mount(mp, path, data, ndp, p) struct mount *mp; char *path; caddr_t data; struct nameidata *ndp; struct proc *p; { u_int size; int error; if (UIO_MX & (UIO_MX-1)) { log(LOG_ERR, "procfs: invalid directory entry size"); return (EINVAL); } if (mp->mnt_flag & MNT_UPDATE) return (EOPNOTSUPP); mp->mnt_flag |= MNT_LOCAL; mp->mnt_data = 0; getnewfsid(mp, MOUNT_PROCFS); (void) copyinstr(path, (caddr_t)mp->mnt_stat.f_mntonname, MNAMELEN, &size); bzero(mp->mnt_stat.f_mntonname + size, MNAMELEN - size); size = sizeof("proc") - 1; bcopy("proc", mp->mnt_stat.f_mntfromname, size); bzero(mp->mnt_stat.f_mntfromname + size, MNAMELEN - size); return (0); } /* * unmount system call */ procfs_unmount(mp, mntflags, p) struct mount *mp; int mntflags; struct proc *p; { int error; extern int doforce; int flags = 0; if (mntflags & MNT_FORCE) { /* procfs can never be rootfs so don't check for it */ if (!doforce) return (EINVAL); flags |= FORCECLOSE; } /* * Clear out buffer cache. I don't think we * ever get anything cached at this level at the * moment, but who knows... */ mntflushbuf(mp, 0); if (mntinvalbuf(mp, 1)) return (EBUSY); if (error = vflush(mp, 0, flags)) return (error); return (0); } procfs_root(mp, vpp) struct mount *mp; struct vnode **vpp; { struct pfsnode *pfs; struct vnode *vp; int error; error = procfs_allocvp(mp, &vp, (pid_t) 0, Proot); if (error) return (error); vp->v_type = VDIR; vp->v_flag = VROOT; pfs = VTOPFS(vp); *vpp = vp; return (0); } /* */ /* ARGSUSED */ procfs_start(mp, flags, p) struct mount *mp; int flags; struct proc *p; { return (0); } /* * Get file system statistics. */ procfs_statfs(mp, sbp, p) struct mount *mp; struct statfs *sbp; struct proc *p; { sbp->f_type = MOUNT_PROCFS; sbp->f_fsize = page_size >> 2; sbp->f_bsize = page_size; sbp->f_blocks = 1; /* avoid divide by zero in some df's */ sbp->f_bfree = 0; sbp->f_bavail = 0; sbp->f_files = maxproc; /* approx */ sbp->f_ffree = maxproc - nprocs; /* approx */ if (sbp != &mp->mnt_stat) { bcopy(&mp->mnt_stat.f_fsid, &sbp->f_fsid, sizeof(sbp->f_fsid)); bcopy(mp->mnt_stat.f_mntonname, sbp->f_mntonname, MNAMELEN); bcopy(mp->mnt_stat.f_mntfromname, sbp->f_mntfromname, MNAMELEN); } return (0); } procfs_quotactl(mp, cmds, uid, arg, p) struct mount *mp; int cmds; uid_t uid; caddr_t arg; struct proc *p; { return (EOPNOTSUPP); } procfs_sync(mp, waitfor) struct mount *mp; int waitfor; { return (0); } procfs_fhtovp(mp, fhp, vpp) struct mount *mp; struct fid *fhp; struct vnode **vpp; { return (EINVAL); } procfs_vptofh(vp, fhp) struct vnode *vp; struct fid *fhp; { return EINVAL; } procfs_init() { return (0); } struct vfsops procfs_vfsops = { procfs_mount, procfs_start, procfs_unmount, procfs_root, procfs_quotactl, procfs_statfs, procfs_sync, procfs_fhtovp, procfs_vptofh, procfs_init, };