Home | History | Annotate | Line # | Download | only in genfs
layer_subr.c revision 1.36.2.1
      1  1.36.2.1    martin /*	$NetBSD: layer_subr.c,v 1.36.2.1 2015/01/17 12:10:53 martin Exp $	*/
      2       1.1  wrstuden 
      3       1.1  wrstuden /*
      4       1.1  wrstuden  * Copyright (c) 1999 National Aeronautics & Space Administration
      5       1.1  wrstuden  * All rights reserved.
      6       1.1  wrstuden  *
      7       1.1  wrstuden  * This software was written by William Studenmund of the
      8       1.8       wiz  * Numerical Aerospace Simulation Facility, NASA Ames Research Center.
      9       1.1  wrstuden  *
     10       1.1  wrstuden  * Redistribution and use in source and binary forms, with or without
     11       1.1  wrstuden  * modification, are permitted provided that the following conditions
     12       1.1  wrstuden  * are met:
     13       1.1  wrstuden  * 1. Redistributions of source code must retain the above copyright
     14       1.1  wrstuden  *    notice, this list of conditions and the following disclaimer.
     15       1.1  wrstuden  * 2. Redistributions in binary form must reproduce the above copyright
     16       1.1  wrstuden  *    notice, this list of conditions and the following disclaimer in the
     17       1.1  wrstuden  *    documentation and/or other materials provided with the distribution.
     18       1.5     soren  * 3. Neither the name of the National Aeronautics & Space Administration
     19       1.1  wrstuden  *    nor the names of its contributors may be used to endorse or promote
     20       1.1  wrstuden  *    products derived from this software without specific prior written
     21       1.1  wrstuden  *    permission.
     22       1.1  wrstuden  *
     23       1.1  wrstuden  * THIS SOFTWARE IS PROVIDED BY THE NATIONAL AERONAUTICS & SPACE ADMINISTRATION
     24       1.1  wrstuden  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     25       1.1  wrstuden  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     26       1.1  wrstuden  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE ADMINISTRATION OR CONTRIB-
     27       1.1  wrstuden  * UTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,
     28       1.1  wrstuden  * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     29       1.1  wrstuden  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     30       1.1  wrstuden  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     31       1.1  wrstuden  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     32       1.1  wrstuden  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     33       1.1  wrstuden  * POSSIBILITY OF SUCH DAMAGE.
     34       1.1  wrstuden  */
     35      1.30     rmind 
     36       1.1  wrstuden /*
     37       1.1  wrstuden  * Copyright (c) 1992, 1993
     38       1.1  wrstuden  *	The Regents of the University of California.  All rights reserved.
     39       1.1  wrstuden  *
     40       1.1  wrstuden  * This code is derived from software donated to Berkeley by
     41       1.1  wrstuden  * Jan-Simon Pendry.
     42       1.1  wrstuden  *
     43       1.1  wrstuden  * Redistribution and use in source and binary forms, with or without
     44       1.1  wrstuden  * modification, are permitted provided that the following conditions
     45       1.1  wrstuden  * are met:
     46       1.1  wrstuden  * 1. Redistributions of source code must retain the above copyright
     47       1.1  wrstuden  *    notice, this list of conditions and the following disclaimer.
     48       1.1  wrstuden  * 2. Redistributions in binary form must reproduce the above copyright
     49       1.1  wrstuden  *    notice, this list of conditions and the following disclaimer in the
     50       1.1  wrstuden  *    documentation and/or other materials provided with the distribution.
     51      1.15       agc  * 3. Neither the name of the University nor the names of its contributors
     52       1.1  wrstuden  *    may be used to endorse or promote products derived from this software
     53       1.1  wrstuden  *    without specific prior written permission.
     54       1.1  wrstuden  *
     55       1.1  wrstuden  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     56       1.1  wrstuden  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     57       1.1  wrstuden  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     58       1.1  wrstuden  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     59       1.1  wrstuden  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     60       1.1  wrstuden  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     61       1.1  wrstuden  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     62       1.1  wrstuden  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     63       1.1  wrstuden  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     64       1.1  wrstuden  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     65       1.1  wrstuden  * SUCH DAMAGE.
     66       1.1  wrstuden  *
     67       1.1  wrstuden  *	from: Id: lofs_subr.c,v 1.11 1992/05/30 10:05:43 jsp Exp
     68       1.1  wrstuden  *	@(#)null_subr.c	8.7 (Berkeley) 5/14/95
     69       1.1  wrstuden  */
     70       1.9     lukem 
     71       1.9     lukem #include <sys/cdefs.h>
     72  1.36.2.1    martin __KERNEL_RCSID(0, "$NetBSD: layer_subr.c,v 1.36.2.1 2015/01/17 12:10:53 martin Exp $");
     73       1.1  wrstuden 
     74       1.1  wrstuden #include <sys/param.h>
     75       1.1  wrstuden #include <sys/systm.h>
     76       1.1  wrstuden #include <sys/proc.h>
     77       1.1  wrstuden #include <sys/time.h>
     78       1.1  wrstuden #include <sys/vnode.h>
     79       1.1  wrstuden #include <sys/mount.h>
     80       1.1  wrstuden #include <sys/namei.h>
     81      1.23        ad #include <sys/kmem.h>
     82      1.23        ad 
     83       1.1  wrstuden #include <miscfs/genfs/layer.h>
     84       1.1  wrstuden #include <miscfs/genfs/layer_extern.h>
     85       1.1  wrstuden 
     86      1.16       erh #ifdef LAYERFS_DIAGNOSTIC
     87      1.16       erh int layerfs_debug = 1;
     88      1.16       erh #endif
     89      1.16       erh 
     90       1.1  wrstuden /*
     91       1.1  wrstuden  * layer cache:
     92       1.1  wrstuden  * Each cache entry holds a reference to the lower vnode
     93       1.1  wrstuden  * along with a pointer to the alias vnode.  When an
     94       1.1  wrstuden  * entry is added the lower vnode is VREF'd.  When the
     95       1.1  wrstuden  * alias is removed the lower vnode is vrele'd.
     96       1.1  wrstuden  */
     97       1.1  wrstuden 
     98       1.1  wrstuden void
     99      1.27    cegger layerfs_init(void)
    100       1.1  wrstuden {
    101      1.30     rmind 	/* Nothing. */
    102       1.6  jdolecek }
    103       1.1  wrstuden 
    104       1.6  jdolecek void
    105      1.27    cegger layerfs_done(void)
    106       1.6  jdolecek {
    107      1.30     rmind 	/* Nothing. */
    108       1.1  wrstuden }
    109       1.1  wrstuden 
    110       1.1  wrstuden /*
    111      1.30     rmind  * layer_node_create: try to find an existing layerfs vnode refering to it,
    112      1.30     rmind  * otherwise make a new vnode which contains a reference to the lower vnode.
    113       1.1  wrstuden  */
    114       1.1  wrstuden int
    115      1.30     rmind layer_node_create(struct mount *mp, struct vnode *lowervp, struct vnode **nvpp)
    116       1.1  wrstuden {
    117      1.36   hannken 	int error;
    118       1.1  wrstuden 	struct vnode *aliasvp;
    119       1.1  wrstuden 
    120      1.36   hannken 	error = vcache_get(mp, &lowervp, sizeof(lowervp), &aliasvp);
    121      1.36   hannken 	if (error)
    122      1.36   hannken 		return error;
    123       1.1  wrstuden 
    124       1.1  wrstuden 	/*
    125      1.30     rmind 	 * Now that we acquired a reference on the upper vnode, release one
    126      1.30     rmind 	 * on the lower node.  The existence of the layer_node retains one
    127       1.1  wrstuden 	 * reference to the lower node.
    128       1.1  wrstuden 	 */
    129       1.1  wrstuden 	vrele(lowervp);
    130      1.30     rmind 	KASSERT(lowervp->v_usecount > 0);
    131       1.1  wrstuden 
    132       1.1  wrstuden #ifdef LAYERFS_DIAGNOSTIC
    133      1.16       erh 	if (layerfs_debug)
    134      1.16       erh 		vprint("layer_node_create: alias", aliasvp);
    135       1.1  wrstuden #endif
    136      1.30     rmind 	*nvpp = aliasvp;
    137      1.30     rmind 	return 0;
    138       1.1  wrstuden }
    139       1.1  wrstuden 
    140      1.16       erh #ifdef LAYERFS_DIAGNOSTIC
    141       1.1  wrstuden struct vnode *
    142      1.26       dsl layer_checkvp(struct vnode *vp, const char *fil, int lno)
    143       1.1  wrstuden {
    144       1.1  wrstuden 	struct layer_node *a = VTOLAYER(vp);
    145       1.1  wrstuden #ifdef notyet
    146       1.1  wrstuden 	/*
    147       1.1  wrstuden 	 * Can't do this check because vop_reclaim runs
    148       1.1  wrstuden 	 * with a funny vop vector.
    149       1.1  wrstuden 	 *
    150       1.1  wrstuden 	 * WRS - no it doesnt...
    151       1.1  wrstuden 	 */
    152       1.1  wrstuden 	if (vp->v_op != layer_vnodeop_p) {
    153       1.1  wrstuden 		printf ("layer_checkvp: on non-layer-node\n");
    154       1.1  wrstuden #ifdef notyet
    155       1.1  wrstuden 		while (layer_checkvp_barrier) /*WAIT*/ ;
    156       1.1  wrstuden #endif
    157       1.1  wrstuden 		panic("layer_checkvp");
    158       1.1  wrstuden 	};
    159       1.1  wrstuden #endif
    160       1.1  wrstuden 	if (a->layer_lowervp == NULL) {
    161       1.1  wrstuden 		/* Should never happen */
    162       1.1  wrstuden 		int i; u_long *p;
    163       1.1  wrstuden 		printf("vp = %p, ZERO ptr\n", vp);
    164       1.1  wrstuden 		for (p = (u_long *) a, i = 0; i < 8; i++)
    165       1.1  wrstuden 			printf(" %lx", p[i]);
    166       1.1  wrstuden 		printf("\n");
    167       1.1  wrstuden 		/* wait for debugger */
    168       1.1  wrstuden 		panic("layer_checkvp");
    169       1.1  wrstuden 	}
    170       1.1  wrstuden 	if (a->layer_lowervp->v_usecount < 1) {
    171       1.1  wrstuden 		int i; u_long *p;
    172       1.1  wrstuden 		printf("vp = %p, unref'ed lowervp\n", vp);
    173       1.1  wrstuden 		for (p = (u_long *) a, i = 0; i < 8; i++)
    174       1.1  wrstuden 			printf(" %lx", p[i]);
    175       1.1  wrstuden 		printf("\n");
    176       1.1  wrstuden 		/* wait for debugger */
    177       1.1  wrstuden 		panic ("layer with unref'ed lowervp");
    178       1.1  wrstuden 	};
    179       1.1  wrstuden #ifdef notnow
    180       1.1  wrstuden 	printf("layer %p/%d -> %p/%d [%s, %d]\n",
    181       1.1  wrstuden 	        LAYERTOV(a), LAYERTOV(a)->v_usecount,
    182       1.1  wrstuden 		a->layer_lowervp, a->layer_lowervp->v_usecount,
    183       1.1  wrstuden 		fil, lno);
    184       1.1  wrstuden #endif
    185       1.1  wrstuden 	return a->layer_lowervp;
    186       1.1  wrstuden }
    187      1.16       erh #endif
    188