Home | History | Annotate | Line # | Download | only in genfs
layer_vfsops.c revision 1.7
      1 /*	$NetBSD: layer_vfsops.c,v 1.7 2003/06/28 14:22:02 darrenr Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1999 National Aeronautics & Space Administration
      5  * All rights reserved.
      6  *
      7  * This software was written by William Studenmund of the
      8  * Numerical Aerospace Simulation Facility, NASA Ames Research Center.
      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 National Aeronautics & Space Administration
     19  *    nor the names of its contributors may be used to endorse or promote
     20  *    products derived from this software without specific prior written
     21  *    permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE NATIONAL AERONAUTICS & SPACE ADMINISTRATION
     24  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     25  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     26  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE ADMINISTRATION OR CONTRIB-
     27  * UTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
     28  * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     29  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     30  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     31  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     32  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     33  * POSSIBILITY OF SUCH DAMAGE.
     34  */
     35 /*
     36  * Copyright (c) 1992, 1993, 1995
     37  *	The Regents of the University of California.  All rights reserved.
     38  *
     39  * This code is derived from software donated to Berkeley by
     40  * Jan-Simon Pendry.
     41  *
     42  * Redistribution and use in source and binary forms, with or without
     43  * modification, are permitted provided that the following conditions
     44  * are met:
     45  * 1. Redistributions of source code must retain the above copyright
     46  *    notice, this list of conditions and the following disclaimer.
     47  * 2. Redistributions in binary form must reproduce the above copyright
     48  *    notice, this list of conditions and the following disclaimer in the
     49  *    documentation and/or other materials provided with the distribution.
     50  * 3. All advertising materials mentioning features or use of this software
     51  *    must display the following acknowledgement:
     52  *	This product includes software developed by the University of
     53  *	California, Berkeley and its contributors.
     54  * 4. Neither the name of the University nor the names of its contributors
     55  *    may be used to endorse or promote products derived from this software
     56  *    without specific prior written permission.
     57  *
     58  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     59  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     60  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     61  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     62  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     63  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     64  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     65  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     66  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     67  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     68  * SUCH DAMAGE.
     69  *
     70  *	from: Id: lofs_vfsops.c,v 1.9 1992/05/30 10:26:24 jsp Exp
     71  *	from: @(#)lofs_vfsops.c	1.2 (Berkeley) 6/18/92
     72  *	@(#)null_vfsops.c	8.7 (Berkeley) 5/14/95
     73  */
     74 
     75 /*
     76  * generic layer vfs ops.
     77  */
     78 
     79 #include <sys/cdefs.h>
     80 __KERNEL_RCSID(0, "$NetBSD: layer_vfsops.c,v 1.7 2003/06/28 14:22:02 darrenr Exp $");
     81 
     82 #include <sys/param.h>
     83 #include <sys/systm.h>
     84 #include <sys/time.h>
     85 #include <sys/proc.h>
     86 #include <sys/vnode.h>
     87 #include <sys/mount.h>
     88 #include <sys/namei.h>
     89 #include <sys/malloc.h>
     90 #include <miscfs/genfs/layer.h>
     91 #include <miscfs/genfs/layer_extern.h>
     92 
     93 /*
     94  * VFS start.  Nothing needed here - the start routine
     95  * on the underlying filesystem will have been called
     96  * when that filesystem was mounted.
     97  */
     98 int
     99 layerfs_start(mp, flags, l)
    100 	struct mount *mp;
    101 	int flags;
    102 	struct lwp *l;
    103 {
    104 
    105 	return (0);
    106 	/* return VFS_START(MOUNTTOLAYERMOUNT(mp)->layerm_vfs, flags, l); */
    107 }
    108 
    109 int
    110 layerfs_root(mp, vpp, l)
    111 	struct mount *mp;
    112 	struct vnode **vpp;
    113 	struct lwp *l;
    114 {
    115 	struct vnode *vp;
    116 
    117 #ifdef LAYERFS_DIAGNOSTIC
    118 	printf("layerfs_root(mp = %p, vp = %p->%p)\n", mp,
    119 	    MOUNTTOLAYERMOUNT(mp)->layerm_rootvp,
    120 	    LAYERVPTOLOWERVP(MOUNTTOLAYERMOUNT(mp)->layerm_rootvp));
    121 #endif
    122 
    123 	/*
    124 	 * Return locked reference to root.
    125 	 */
    126 	vp = MOUNTTOLAYERMOUNT(mp)->layerm_rootvp;
    127 	if (vp == NULL) {
    128 		*vpp = NULL;
    129 		return (EINVAL);
    130 	}
    131 	VREF(vp);
    132 	vn_lock(vp, LK_EXCLUSIVE | LK_RETRY);
    133 	*vpp = vp;
    134 	return 0;
    135 }
    136 
    137 int
    138 layerfs_quotactl(mp, cmd, uid, arg, l)
    139 	struct mount *mp;
    140 	int cmd;
    141 	uid_t uid;
    142 	caddr_t arg;
    143 	struct lwp *l;
    144 {
    145 
    146 	return VFS_QUOTACTL(MOUNTTOLAYERMOUNT(mp)->layerm_vfs,
    147 				cmd, uid, arg, l);
    148 }
    149 
    150 int
    151 layerfs_statfs(mp, sbp, l)
    152 	struct mount *mp;
    153 	struct statfs *sbp;
    154 	struct lwp *l;
    155 {
    156 	int error;
    157 	struct statfs mstat;
    158 
    159 #ifdef LAYERFS_DIAGNOSTIC
    160 	printf("layerfs_statfs(mp = %p, vp = %p->%p)\n", mp,
    161 	    MOUNTTOLAYERMOUNT(mp)->layerm_rootvp,
    162 	    LAYERVPTOLOWERVP(MOUNTTOLAYERMOUNT(mp)->layerm_rootvp));
    163 #endif
    164 
    165 	memset(&mstat, 0, sizeof(mstat));
    166 
    167 	error = VFS_STATFS(MOUNTTOLAYERMOUNT(mp)->layerm_vfs, &mstat, l);
    168 	if (error)
    169 		return (error);
    170 
    171 	/* now copy across the "interesting" information and fake the rest */
    172 	sbp->f_type = mstat.f_type;
    173 	sbp->f_flags = mstat.f_flags;
    174 	sbp->f_bsize = mstat.f_bsize;
    175 	sbp->f_iosize = mstat.f_iosize;
    176 	sbp->f_blocks = mstat.f_blocks;
    177 	sbp->f_bfree = mstat.f_bfree;
    178 	sbp->f_bavail = mstat.f_bavail;
    179 	sbp->f_files = mstat.f_files;
    180 	sbp->f_ffree = mstat.f_ffree;
    181 	copy_statfs_info(sbp, mp);
    182 	return (0);
    183 }
    184 
    185 int
    186 layerfs_sync(mp, waitfor, cred, l)
    187 	struct mount *mp;
    188 	int waitfor;
    189 	struct ucred *cred;
    190 	struct lwp *l;
    191 {
    192 
    193 	/*
    194 	 * XXX - Assumes no data cached at layer.
    195 	 */
    196 	return (0);
    197 }
    198 
    199 int
    200 layerfs_vget(mp, ino, vpp, l)
    201 	struct mount *mp;
    202 	ino_t ino;
    203 	struct vnode **vpp;
    204 	struct lwp *l;
    205 {
    206 	int error;
    207 	struct vnode *vp;
    208 
    209 	if ((error = VFS_VGET(MOUNTTOLAYERMOUNT(mp)->layerm_vfs,
    210 	    ino, &vp, l))) {
    211 		*vpp = NULL;
    212 		return (error);
    213 	}
    214 	if ((error = layer_node_create(mp, vp, vpp))) {
    215 		vput(vp);
    216 		*vpp = NULL;
    217 		return (error);
    218 	}
    219 
    220 	return (0);
    221 }
    222 
    223 int
    224 layerfs_fhtovp(mp, fidp, vpp, l)
    225 	struct mount *mp;
    226 	struct fid *fidp;
    227 	struct vnode **vpp;
    228 	struct lwp *l;
    229 {
    230 	int error;
    231 	struct vnode *vp;
    232 
    233 	if ((error = VFS_FHTOVP(MOUNTTOLAYERMOUNT(mp)->layerm_vfs,
    234 	    fidp, &vp, l)))
    235 		return (error);
    236 
    237 	if ((error = layer_node_create(mp, vp, vpp))) {
    238 		vput(vp);
    239 		*vpp = NULL;
    240 		return (error);
    241 	}
    242 
    243 	return (0);
    244 }
    245 
    246 int
    247 layerfs_checkexp(mp, nam, exflagsp, credanonp)
    248 	struct mount *mp;
    249 	struct mbuf *nam;
    250 	int *exflagsp;
    251 	struct ucred**credanonp;
    252 {
    253 	struct	netcred *np;
    254 	struct	layer_mount *lmp = MOUNTTOLAYERMOUNT(mp);
    255 
    256 	/*
    257 	 * get the export permission structure for this <mp, client> tuple.
    258 	 */
    259 	if ((np = vfs_export_lookup(mp, &lmp->layerm_export, nam)) == NULL)
    260 		return (EACCES);
    261 
    262 	*exflagsp = np->netc_exflags;
    263 	*credanonp = &np->netc_anon;
    264 	return (0);
    265 }
    266 
    267 int
    268 layerfs_vptofh(vp, fhp)
    269 	struct vnode *vp;
    270 	struct fid *fhp;
    271 {
    272 
    273 	return (VFS_VPTOFH(LAYERVPTOLOWERVP(vp), fhp));
    274 }
    275 
    276 int
    277 layerfs_sysctl(name, namelen, oldp, oldlenp, newp, newlen, l)
    278 	int *name;
    279 	u_int namelen;
    280 	void *oldp;
    281 	size_t *oldlenp;
    282 	void *newp;
    283 	size_t newlen;
    284 	struct lwp *l;
    285 {
    286 	return (EOPNOTSUPP);
    287 }
    288