The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/nfsclient/nfs_node.c

Version: -  FREEBSD  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-2  -  FREEBSD-11-1  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-4  -  FREEBSD-10-3  -  FREEBSD-10-2  -  FREEBSD-10-1  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-3  -  FREEBSD-9-2  -  FREEBSD-9-1  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-4  -  FREEBSD-8-3  -  FREEBSD-8-2  -  FREEBSD-8-1  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-4  -  FREEBSD-7-3  -  FREEBSD-7-2  -  FREEBSD-7-1  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-4  -  FREEBSD-6-3  -  FREEBSD-6-2  -  FREEBSD-6-1  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-5  -  FREEBSD-5-4  -  FREEBSD-5-3  -  FREEBSD-5-2  -  FREEBSD-5-1  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  linux-2.6  -  linux-2.4.22  -  MK83  -  MK84  -  PLAN9  -  DFBSD  -  NETBSD  -  NETBSD5  -  NETBSD4  -  NETBSD3  -  NETBSD20  -  OPENBSD  -  xnu-517  -  xnu-792  -  xnu-792.6.70  -  xnu-1228  -  xnu-1456.1.26  -  xnu-1699.24.8  -  xnu-2050.18.24  -  OPENSOLARIS  -  minix-3-1-1 
SearchContext: -  none  -  3  -  10 

    1 /*-
    2  * Copyright (c) 1989, 1993
    3  *      The Regents of the University of California.  All rights reserved.
    4  *
    5  * This code is derived from software contributed to Berkeley by
    6  * Rick Macklem at The University of Guelph.
    7  *
    8  * Redistribution and use in source and binary forms, with or without
    9  * modification, are permitted provided that the following conditions
   10  * are met:
   11  * 1. Redistributions of source code must retain the above copyright
   12  *    notice, this list of conditions and the following disclaimer.
   13  * 2. Redistributions in binary form must reproduce the above copyright
   14  *    notice, this list of conditions and the following disclaimer in the
   15  *    documentation and/or other materials provided with the distribution.
   16  * 4. Neither the name of the University nor the names of its contributors
   17  *    may be used to endorse or promote products derived from this software
   18  *    without specific prior written permission.
   19  *
   20  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
   21  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   22  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
   23  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
   24  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
   25  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
   26  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
   27  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
   28  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
   29  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
   30  * SUCH DAMAGE.
   31  *
   32  *      @(#)nfs_node.c  8.6 (Berkeley) 5/22/95
   33  */
   34 
   35 #include <sys/cdefs.h>
   36 __FBSDID("$FreeBSD: stable/10/sys/nfsclient/nfs_node.c 243311 2012-11-19 22:43:45Z attilio $");
   37 
   38 #include <sys/param.h>
   39 #include <sys/systm.h>
   40 #include <sys/fcntl.h>
   41 #include <sys/fnv_hash.h>
   42 #include <sys/lock.h>
   43 #include <sys/malloc.h>
   44 #include <sys/mbuf.h>
   45 #include <sys/mount.h>
   46 #include <sys/namei.h>
   47 #include <sys/proc.h>
   48 #include <sys/socket.h>
   49 #include <sys/sysctl.h>
   50 #include <sys/taskqueue.h>
   51 #include <sys/vnode.h>
   52 
   53 #include <vm/uma.h>
   54 
   55 #include <nfs/nfsproto.h>
   56 #include <nfs/nfs_lock.h>
   57 #include <nfsclient/nfs.h>
   58 #include <nfsclient/nfsnode.h>
   59 #include <nfsclient/nfsmount.h>
   60 
   61 static uma_zone_t nfsnode_zone;
   62 
   63 static void     nfs_freesillyrename(void *arg, __unused int pending);
   64 
   65 #define TRUE    1
   66 #define FALSE   0
   67 
   68 void
   69 nfs_nhinit(void)
   70 {
   71 
   72         nfsnode_zone = uma_zcreate("NFSNODE", sizeof(struct nfsnode), NULL,
   73             NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
   74 }
   75 
   76 void
   77 nfs_nhuninit(void)
   78 {
   79         uma_zdestroy(nfsnode_zone);
   80 }
   81 
   82 struct nfs_vncmp {
   83         int     fhsize;
   84         void    *fh;
   85 };
   86 
   87 static int
   88 nfs_vncmpf(struct vnode *vp, void *arg)
   89 {
   90         struct nfs_vncmp *a;
   91         struct nfsnode *np;
   92 
   93         a = arg;
   94         np = VTONFS(vp);
   95         return (bcmp(a->fh, np->n_fhp, a->fhsize));
   96 }
   97 
   98 /*
   99  * Look up a vnode/nfsnode by file handle.
  100  * Callers must check for mount points!!
  101  * In all cases, a pointer to a
  102  * nfsnode structure is returned.
  103  */
  104 int
  105 nfs_nget(struct mount *mntp, nfsfh_t *fhp, int fhsize, struct nfsnode **npp, int flags)
  106 {
  107         struct thread *td = curthread;  /* XXX */
  108         struct nfsnode *np;
  109         struct vnode *vp;
  110         struct vnode *nvp;
  111         int error;
  112         u_int hash;
  113         struct nfsmount *nmp;
  114         struct nfs_vncmp ncmp;
  115 
  116         nmp = VFSTONFS(mntp);
  117         *npp = NULL;
  118 
  119         hash = fnv_32_buf(fhp->fh_bytes, fhsize, FNV1_32_INIT);
  120         ncmp.fhsize = fhsize;
  121         ncmp.fh = fhp;
  122 
  123         error = vfs_hash_get(mntp, hash, flags,
  124             td, &nvp, nfs_vncmpf, &ncmp);
  125         if (error)
  126                 return (error);
  127         if (nvp != NULL) {
  128                 *npp = VTONFS(nvp);
  129                 return (0);
  130         }
  131         np = uma_zalloc(nfsnode_zone, M_WAITOK | M_ZERO);
  132 
  133         error = getnewvnode("nfs", mntp, &nfs_vnodeops, &nvp);
  134         if (error) {
  135                 uma_zfree(nfsnode_zone, np);
  136                 return (error);
  137         }
  138         vp = nvp;
  139         vp->v_bufobj.bo_ops = &buf_ops_nfs;
  140         vp->v_data = np;
  141         np->n_vnode = vp;
  142         /* 
  143          * Initialize the mutex even if the vnode is going to be a loser.
  144          * This simplifies the logic in reclaim, which can then unconditionally
  145          * destroy the mutex (in the case of the loser, or if hash_insert happened
  146          * to return an error no special casing is needed).
  147          */
  148         mtx_init(&np->n_mtx, "NFSnode lock", NULL, MTX_DEF);
  149         /*
  150          * NFS supports recursive and shared locking.
  151          */
  152         lockmgr(vp->v_vnlock, LK_EXCLUSIVE | LK_NOWITNESS, NULL);
  153         VN_LOCK_AREC(vp);
  154         VN_LOCK_ASHARE(vp);
  155         if (fhsize > NFS_SMALLFH) {
  156                 np->n_fhp = malloc(fhsize, M_NFSBIGFH, M_WAITOK);
  157         } else
  158                 np->n_fhp = &np->n_fh;
  159         bcopy((caddr_t)fhp, (caddr_t)np->n_fhp, fhsize);
  160         np->n_fhsize = fhsize;
  161         error = insmntque(vp, mntp);
  162         if (error != 0) {
  163                 *npp = NULL;
  164                 if (np->n_fhsize > NFS_SMALLFH) {
  165                         free((caddr_t)np->n_fhp, M_NFSBIGFH);
  166                 }
  167                 mtx_destroy(&np->n_mtx);
  168                 uma_zfree(nfsnode_zone, np);
  169                 return (error);
  170         }
  171         error = vfs_hash_insert(vp, hash, flags, 
  172             td, &nvp, nfs_vncmpf, &ncmp);
  173         if (error)
  174                 return (error);
  175         if (nvp != NULL) {
  176                 *npp = VTONFS(nvp);
  177                 /* vfs_hash_insert() vput()'s the losing vnode */
  178                 return (0);
  179         }
  180         *npp = np;
  181 
  182         return (0);
  183 }
  184 
  185 /*
  186  * Do the vrele(sp->s_dvp) as a separate task in order to avoid a
  187  * deadlock because of a LOR when vrele() locks the directory vnode.
  188  */
  189 static void
  190 nfs_freesillyrename(void *arg, __unused int pending)
  191 {
  192         struct sillyrename *sp;
  193 
  194         sp = arg;
  195         vrele(sp->s_dvp);
  196         free(sp, M_NFSREQ);
  197 }
  198 
  199 int
  200 nfs_inactive(struct vop_inactive_args *ap)
  201 {
  202         struct nfsnode *np;
  203         struct sillyrename *sp;
  204         struct thread *td = curthread;  /* XXX */
  205 
  206         np = VTONFS(ap->a_vp);
  207         mtx_lock(&np->n_mtx);
  208         if (ap->a_vp->v_type != VDIR) {
  209                 sp = np->n_sillyrename;
  210                 np->n_sillyrename = NULL;
  211         } else
  212                 sp = NULL;
  213         if (sp) {
  214                 mtx_unlock(&np->n_mtx);
  215                 (void)nfs_vinvalbuf(ap->a_vp, 0, td, 1);
  216                 /*
  217                  * Remove the silly file that was rename'd earlier
  218                  */
  219                 (sp->s_removeit)(sp);
  220                 crfree(sp->s_cred);
  221                 TASK_INIT(&sp->s_task, 0, nfs_freesillyrename, sp);
  222                 taskqueue_enqueue(taskqueue_thread, &sp->s_task);
  223                 mtx_lock(&np->n_mtx);
  224         }
  225         np->n_flag &= NMODIFIED;
  226         mtx_unlock(&np->n_mtx);
  227         return (0);
  228 }
  229 
  230 /*
  231  * Reclaim an nfsnode so that it can be used for other purposes.
  232  */
  233 int
  234 nfs_reclaim(struct vop_reclaim_args *ap)
  235 {
  236         struct vnode *vp = ap->a_vp;
  237         struct nfsnode *np = VTONFS(vp);
  238         struct nfsdmap *dp, *dp2;
  239 
  240         /*
  241          * If the NLM is running, give it a chance to abort pending
  242          * locks.
  243          */
  244         if (nfs_reclaim_p)
  245                 nfs_reclaim_p(ap);
  246 
  247         /*
  248          * Destroy the vm object and flush associated pages.
  249          */
  250         vnode_destroy_vobject(vp);
  251 
  252         vfs_hash_remove(vp);
  253 
  254         /*
  255          * Free up any directory cookie structures and
  256          * large file handle structures that might be associated with
  257          * this nfs node.
  258          */
  259         if (vp->v_type == VDIR) {
  260                 dp = LIST_FIRST(&np->n_cookies);
  261                 while (dp) {
  262                         dp2 = dp;
  263                         dp = LIST_NEXT(dp, ndm_list);
  264                         free((caddr_t)dp2, M_NFSDIROFF);
  265                 }
  266         }
  267         if (np->n_writecred != NULL)
  268                 crfree(np->n_writecred);
  269         if (np->n_fhsize > NFS_SMALLFH) {
  270                 free((caddr_t)np->n_fhp, M_NFSBIGFH);
  271         }
  272         mtx_destroy(&np->n_mtx);
  273         uma_zfree(nfsnode_zone, vp->v_data);
  274         vp->v_data = NULL;
  275         return (0);
  276 }

Cache object: 5e82e7abd57f9a363605476c1d4df972


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.