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/fs/nfsclient/nfs_clnode.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  * SPDX-License-Identifier: BSD-3-Clause
    3  *
    4  * Copyright (c) 1989, 1993
    5  *      The Regents of the University of California.  All rights reserved.
    6  *
    7  * This code is derived from software contributed to Berkeley by
    8  * Rick Macklem at The University of Guelph.
    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  *      from nfs_node.c 8.6 (Berkeley) 5/22/95
   35  */
   36 
   37 #include <sys/cdefs.h>
   38 __FBSDID("$FreeBSD: stable/12/sys/fs/nfsclient/nfs_clnode.c 369793 2021-05-12 02:50:03Z git2svn $");
   39 
   40 #include <sys/param.h>
   41 #include <sys/systm.h>
   42 #include <sys/fcntl.h>
   43 #include <sys/lock.h>
   44 #include <sys/malloc.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 <fs/nfs/nfsport.h>
   56 #include <fs/nfsclient/nfsnode.h>
   57 #include <fs/nfsclient/nfsmount.h>
   58 #include <fs/nfsclient/nfs.h>
   59 #include <fs/nfsclient/nfs_kdtrace.h>
   60 
   61 #include <nfs/nfs_lock.h>
   62 
   63 extern struct vop_vector newnfs_vnodeops;
   64 extern struct buf_ops buf_ops_newnfs;
   65 MALLOC_DECLARE(M_NEWNFSREQ);
   66 
   67 uma_zone_t newnfsnode_zone;
   68 
   69 const char nfs_vnode_tag[] = "nfs";
   70 
   71 static void     nfs_freesillyrename(void *arg, __unused int pending);
   72 
   73 void
   74 ncl_nhinit(void)
   75 {
   76 
   77         newnfsnode_zone = uma_zcreate("NCLNODE", sizeof(struct nfsnode), NULL,
   78             NULL, NULL, NULL, UMA_ALIGN_PTR, 0);
   79 }
   80 
   81 void
   82 ncl_nhuninit(void)
   83 {
   84         uma_zdestroy(newnfsnode_zone);
   85 }
   86 
   87 /*
   88  * ONLY USED FOR THE ROOT DIRECTORY. nfscl_nget() does the rest. If this
   89  * function is going to be used to get Regular Files, code must be added
   90  * to fill in the "struct nfsv4node".
   91  * Look up a vnode/nfsnode by file handle.
   92  * Callers must check for mount points!!
   93  * In all cases, a pointer to a
   94  * nfsnode structure is returned.
   95  */
   96 int
   97 ncl_nget(struct mount *mntp, u_int8_t *fhp, int fhsize, struct nfsnode **npp,
   98     int lkflags)
   99 {
  100         struct thread *td = curthread;  /* XXX */
  101         struct nfsnode *np;
  102         struct vnode *vp;
  103         struct vnode *nvp;
  104         int error;
  105         u_int hash;
  106         struct nfsmount *nmp;
  107         struct nfsfh *nfhp;
  108 
  109         nmp = VFSTONFS(mntp);
  110         *npp = NULL;
  111 
  112         hash = fnv_32_buf(fhp, fhsize, FNV1_32_INIT);
  113 
  114         nfhp = malloc(sizeof (struct nfsfh) + fhsize,
  115             M_NFSFH, M_WAITOK);
  116         bcopy(fhp, &nfhp->nfh_fh[0], fhsize);
  117         nfhp->nfh_len = fhsize;
  118         error = vfs_hash_get(mntp, hash, lkflags,
  119             td, &nvp, newnfs_vncmpf, nfhp);
  120         free(nfhp, M_NFSFH);
  121         if (error)
  122                 return (error);
  123         if (nvp != NULL) {
  124                 *npp = VTONFS(nvp);
  125                 return (0);
  126         }
  127         np = uma_zalloc(newnfsnode_zone, M_WAITOK | M_ZERO);
  128 
  129         error = getnewvnode(nfs_vnode_tag, mntp, &newnfs_vnodeops, &nvp);
  130         if (error) {
  131                 uma_zfree(newnfsnode_zone, np);
  132                 return (error);
  133         }
  134         vp = nvp;
  135         KASSERT(vp->v_bufobj.bo_bsize != 0, ("ncl_nget: bo_bsize == 0"));
  136         vp->v_bufobj.bo_ops = &buf_ops_newnfs;
  137         vp->v_data = np;
  138         np->n_vnode = vp;
  139         /* 
  140          * Initialize the mutex even if the vnode is going to be a loser.
  141          * This simplifies the logic in reclaim, which can then unconditionally
  142          * destroy the mutex (in the case of the loser, or if hash_insert
  143          * happened to return an error no special casing is needed).
  144          */
  145         mtx_init(&np->n_mtx, "NEWNFSnode lock", NULL, MTX_DEF | MTX_DUPOK);
  146         lockinit(&np->n_excl, PVFS, "nfsupg", VLKTIMEOUT, LK_NOSHARE |
  147             LK_CANRECURSE);
  148 
  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         /* 
  156          * Are we getting the root? If so, make sure the vnode flags
  157          * are correct 
  158          */
  159         if ((fhsize == nmp->nm_fhsize) &&
  160             !bcmp(fhp, nmp->nm_fh, fhsize)) {
  161                 if (vp->v_type == VNON)
  162                         vp->v_type = VDIR;
  163                 vp->v_vflag |= VV_ROOT;
  164         }
  165 
  166         vp->v_vflag |= VV_VMSIZEVNLOCK;
  167         
  168         np->n_fhp = malloc(sizeof (struct nfsfh) + fhsize,
  169             M_NFSFH, M_WAITOK);
  170         bcopy(fhp, np->n_fhp->nfh_fh, fhsize);
  171         np->n_fhp->nfh_len = fhsize;
  172         error = insmntque(vp, mntp);
  173         if (error != 0) {
  174                 *npp = NULL;
  175                 free(np->n_fhp, M_NFSFH);
  176                 mtx_destroy(&np->n_mtx);
  177                 lockdestroy(&np->n_excl);
  178                 uma_zfree(newnfsnode_zone, np);
  179                 return (error);
  180         }
  181         error = vfs_hash_insert(vp, hash, lkflags, 
  182             td, &nvp, newnfs_vncmpf, np->n_fhp);
  183         if (error)
  184                 return (error);
  185         if (nvp != NULL) {
  186                 *npp = VTONFS(nvp);
  187                 /* vfs_hash_insert() vput()'s the losing vnode */
  188                 return (0);
  189         }
  190         *npp = np;
  191 
  192         return (0);
  193 }
  194 
  195 /*
  196  * Do the vrele(sp->s_dvp) as a separate task in order to avoid a
  197  * deadlock because of a LOR when vrele() locks the directory vnode.
  198  */
  199 static void
  200 nfs_freesillyrename(void *arg, __unused int pending)
  201 {
  202         struct sillyrename *sp;
  203 
  204         sp = arg;
  205         vrele(sp->s_dvp);
  206         free(sp, M_NEWNFSREQ);
  207 }
  208 
  209 static void
  210 ncl_releasesillyrename(struct vnode *vp, struct thread *td)
  211 {
  212         struct nfsnode *np;
  213         struct sillyrename *sp;
  214 
  215         ASSERT_VOP_ELOCKED(vp, "releasesillyrename");
  216         np = VTONFS(vp);
  217         NFSASSERTNODE(np);
  218         if (vp->v_type != VDIR) {
  219                 sp = np->n_sillyrename;
  220                 np->n_sillyrename = NULL;
  221         } else
  222                 sp = NULL;
  223         if (sp != NULL) {
  224                 NFSUNLOCKNODE(np);
  225                 (void) ncl_vinvalbuf(vp, 0, td, 1);
  226                 /*
  227                  * Remove the silly file that was rename'd earlier
  228                  */
  229                 ncl_removeit(sp, vp);
  230                 crfree(sp->s_cred);
  231                 TASK_INIT(&sp->s_task, 0, nfs_freesillyrename, sp);
  232                 taskqueue_enqueue(taskqueue_thread, &sp->s_task);
  233                 NFSLOCKNODE(np);
  234         }
  235 }
  236 
  237 int
  238 ncl_inactive(struct vop_inactive_args *ap)
  239 {
  240         struct vnode *vp = ap->a_vp;
  241         struct nfsnode *np;
  242         boolean_t retv;
  243 
  244         if (NFS_ISV4(vp) && vp->v_type == VREG) {
  245                 /*
  246                  * Since mmap()'d files do I/O after VOP_CLOSE(), the NFSv4
  247                  * Close operations are delayed until now. Any dirty
  248                  * buffers/pages must be flushed before the close, so that the
  249                  * stateid is available for the writes.
  250                  */
  251                 if (vp->v_object != NULL) {
  252                         VM_OBJECT_WLOCK(vp->v_object);
  253                         retv = vm_object_page_clean(vp->v_object, 0, 0,
  254                             OBJPC_SYNC);
  255                         VM_OBJECT_WUNLOCK(vp->v_object);
  256                 } else
  257                         retv = TRUE;
  258                 if (retv == TRUE) {
  259                         (void)ncl_flush(vp, MNT_WAIT, ap->a_td, 1, 0);
  260                         (void)nfsrpc_close(vp, 1, ap->a_td);
  261                 }
  262         }
  263 
  264         np = VTONFS(vp);
  265         NFSLOCKNODE(np);
  266         ncl_releasesillyrename(vp, ap->a_td);
  267 
  268         /*
  269          * NMODIFIED means that there might be dirty/stale buffers
  270          * associated with the NFS vnode.
  271          * NDSCOMMIT means that the file is on a pNFS server and commits
  272          * should be done to the DS.
  273          * None of the other flags are meaningful after the vnode is unused.
  274          */
  275         np->n_flag &= (NMODIFIED | NDSCOMMIT);
  276         NFSUNLOCKNODE(np);
  277         return (0);
  278 }
  279 
  280 /*
  281  * Reclaim an nfsnode so that it can be used for other purposes.
  282  */
  283 int
  284 ncl_reclaim(struct vop_reclaim_args *ap)
  285 {
  286         struct vnode *vp = ap->a_vp;
  287         struct nfsnode *np = VTONFS(vp);
  288         struct nfsdmap *dp, *dp2;
  289         struct mount *mp;
  290 
  291         mp = vp->v_mount;
  292 
  293         /*
  294          * If the NLM is running, give it a chance to abort pending
  295          * locks.
  296          */
  297         if (nfs_reclaim_p != NULL)
  298                 nfs_reclaim_p(ap);
  299 
  300         NFSLOCKNODE(np);
  301         ncl_releasesillyrename(vp, ap->a_td);
  302         NFSUNLOCKNODE(np);
  303 
  304         /*
  305          * Destroy the vm object and flush associated pages.
  306          */
  307         vnode_destroy_vobject(vp);
  308 
  309         if (NFS_ISV4(vp) && vp->v_type == VREG) {
  310                 /*
  311                  * We can now safely close any remaining NFSv4 Opens for
  312                  * this file. Most opens will have already been closed by
  313                  * ncl_inactive(), but there are cases where it is not
  314                  * called, so we need to do it again here.
  315                  */
  316                 (void) nfsrpc_close(vp, 1, ap->a_td);
  317                 /*
  318                  * It it unlikely a delegation will still exist, but
  319                  * if one does, it must be returned before calling
  320                  * vfs_hash_remove(), since it cannot be recalled once the
  321                  * nfs node is no longer available.
  322                  */
  323                 MNT_ILOCK(mp);
  324                 if ((mp->mnt_kern_flag & MNTK_UNMOUNTF) == 0) {
  325                         MNT_IUNLOCK(mp);
  326                         nfscl_delegreturnvp(vp, ap->a_td);
  327                 } else
  328                         MNT_IUNLOCK(mp);
  329         }
  330 
  331         vfs_hash_remove(vp);
  332 
  333         /*
  334          * Call nfscl_reclaimnode() to save attributes in the delegation,
  335          * as required.
  336          */
  337         if (vp->v_type == VREG)
  338                 nfscl_reclaimnode(vp);
  339 
  340         /*
  341          * Free up any directory cookie structures and
  342          * large file handle structures that might be associated with
  343          * this nfs node.
  344          */
  345         if (vp->v_type == VDIR) {
  346                 dp = LIST_FIRST(&np->n_cookies);
  347                 while (dp) {
  348                         dp2 = dp;
  349                         dp = LIST_NEXT(dp, ndm_list);
  350                         free(dp2, M_NFSDIROFF);
  351                 }
  352         }
  353         if (np->n_writecred != NULL)
  354                 crfree(np->n_writecred);
  355         free(np->n_fhp, M_NFSFH);
  356         if (np->n_v4 != NULL)
  357                 free(np->n_v4, M_NFSV4NODE);
  358         mtx_destroy(&np->n_mtx);
  359         lockdestroy(&np->n_excl);
  360         uma_zfree(newnfsnode_zone, vp->v_data);
  361         vp->v_data = NULL;
  362         return (0);
  363 }
  364 
  365 /*
  366  * Invalidate both the access and attribute caches for this vnode.
  367  */
  368 void
  369 ncl_invalcaches(struct vnode *vp)
  370 {
  371         struct nfsnode *np = VTONFS(vp);
  372         int i;
  373 
  374         NFSLOCKNODE(np);
  375         for (i = 0; i < NFS_ACCESSCACHESIZE; i++)
  376                 np->n_accesscache[i].stamp = 0;
  377         KDTRACE_NFS_ACCESSCACHE_FLUSH_DONE(vp);
  378         np->n_attrstamp = 0;
  379         KDTRACE_NFS_ATTRCACHE_FLUSH_DONE(vp);
  380         NFSUNLOCKNODE(np);
  381 }

Cache object: af1ab1d44032ad0fcc3a6f01f2192faf


[ 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.