1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1992, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to Berkeley by
|
|
|
|
* Rick Macklem at The University of Guelph.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
1997-02-10 02:22:35 +00:00
|
|
|
* @(#)nfs_nqlease.c 8.9 (Berkeley) 5/20/95
|
1999-08-28 01:08:13 +00:00
|
|
|
* $FreeBSD$
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
|
1997-02-10 02:22:35 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* References:
|
|
|
|
* Cary G. Gray and David R. Cheriton, "Leases: An Efficient Fault-Tolerant
|
|
|
|
* Mechanism for Distributed File Cache Consistency",
|
|
|
|
* In Proc. of the Twelfth ACM Symposium on Operating Systems
|
|
|
|
* Principals, pg. 202-210, Litchfield Park, AZ, Dec. 1989.
|
|
|
|
* Michael N. Nelson, Brent B. Welch and John K. Ousterhout, "Caching
|
|
|
|
* in the Sprite Network File System", ACM TOCS 6(1),
|
|
|
|
* pages 134-154, February 1988.
|
|
|
|
* V. Srinivasan and Jeffrey C. Mogul, "Spritely NFS: Implementation and
|
|
|
|
* Performance of Cache-Consistency Protocols", Digital
|
|
|
|
* Equipment Corporation WRL Research Report 89/5, May 1989.
|
|
|
|
*/
|
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/vnode.h>
|
1997-10-12 20:26:33 +00:00
|
|
|
#include <sys/malloc.h>
|
2001-04-23 09:05:15 +00:00
|
|
|
#include <net/radix.h>
|
|
|
|
#include <sys/socket.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <sys/mount.h>
|
|
|
|
#include <sys/kernel.h>
|
|
|
|
#include <sys/systm.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
|
1998-05-24 14:41:56 +00:00
|
|
|
#include <vm/vm_zone.h>
|
|
|
|
|
2000-10-04 01:29:17 +00:00
|
|
|
#include <machine/mutex.h>
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <nfs/rpcv2.h>
|
1995-06-27 11:07:30 +00:00
|
|
|
#include <nfs/nfsproto.h>
|
1994-05-24 10:09:53 +00:00
|
|
|
#include <nfs/nfs.h>
|
|
|
|
#include <nfs/nfsm_subs.h>
|
|
|
|
#include <nfs/xdr_subs.h>
|
|
|
|
#include <nfs/nqnfs.h>
|
|
|
|
#include <nfs/nfsnode.h>
|
|
|
|
#include <nfs/nfsmount.h>
|
|
|
|
|
1997-10-12 20:26:33 +00:00
|
|
|
static MALLOC_DEFINE(M_NQMHOST, "NQNFS Host", "Nqnfs host address table");
|
1997-10-11 18:31:40 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
time_t nqnfsstarttime = (time_t)0;
|
|
|
|
int nqsrv_clockskew = NQ_CLOCKSKEW;
|
|
|
|
int nqsrv_writeslack = NQ_WRITESLACK;
|
|
|
|
int nqsrv_maxlease = NQ_MAXLEASE;
|
1999-02-25 00:03:51 +00:00
|
|
|
#ifndef NFS_NOSERVER
|
1995-12-17 21:14:36 +00:00
|
|
|
static int nqsrv_maxnumlease = NQ_MAXNUMLEASE;
|
1999-02-25 00:03:51 +00:00
|
|
|
#endif
|
1995-11-21 15:51:39 +00:00
|
|
|
|
|
|
|
struct vop_lease_args;
|
|
|
|
|
1999-02-25 00:03:51 +00:00
|
|
|
#ifndef NFS_NOSERVER
|
1997-08-16 19:16:27 +00:00
|
|
|
static int nqsrv_cmpnam __P((struct nfssvc_sock *, struct sockaddr *,
|
1995-12-17 21:14:36 +00:00
|
|
|
struct nqhost *));
|
|
|
|
static int nqnfs_vacated __P((struct vnode *vp, struct ucred *cred));
|
|
|
|
static void nqsrv_addhost __P((struct nqhost *lph, struct nfssvc_sock *slp,
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam));
|
1998-05-31 20:09:01 +00:00
|
|
|
static void nqsrv_instimeq __P((struct nqlease *lp, u_int32_t duration));
|
1995-12-17 21:14:36 +00:00
|
|
|
static void nqsrv_locklease __P((struct nqlease *lp));
|
|
|
|
static void nqsrv_send_eviction __P((struct vnode *vp, struct nqlease *lp,
|
1995-11-21 15:51:39 +00:00
|
|
|
struct nfssvc_sock *slp,
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam,
|
|
|
|
struct ucred *cred));
|
1995-12-17 21:14:36 +00:00
|
|
|
static void nqsrv_unlocklease __P((struct nqlease *lp));
|
|
|
|
static void nqsrv_waitfor_expiry __P((struct nqlease *lp));
|
1999-02-25 00:03:51 +00:00
|
|
|
#endif
|
|
|
|
extern void nqnfs_lease_updatetime __P((int deltat));
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Signifies which rpcs can have piggybacked lease requests
|
|
|
|
*/
|
|
|
|
int nqnfs_piggy[NFS_NPROCS] = {
|
|
|
|
0,
|
|
|
|
0,
|
1995-06-27 11:07:30 +00:00
|
|
|
ND_WRITE,
|
|
|
|
ND_READ,
|
1994-05-24 10:09:53 +00:00
|
|
|
0,
|
1995-06-27 11:07:30 +00:00
|
|
|
ND_READ,
|
|
|
|
ND_READ,
|
|
|
|
ND_WRITE,
|
1994-05-24 10:09:53 +00:00
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
1995-06-27 11:07:30 +00:00
|
|
|
ND_READ,
|
|
|
|
ND_READ,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
1994-05-24 10:09:53 +00:00
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
0,
|
|
|
|
};
|
|
|
|
|
1995-06-27 11:07:30 +00:00
|
|
|
extern nfstype nfsv2_type[9];
|
|
|
|
extern nfstype nfsv3_type[9];
|
1994-05-24 10:09:53 +00:00
|
|
|
extern int nfsd_waiting;
|
1995-06-27 11:07:30 +00:00
|
|
|
extern struct nfsstats nfsstats;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
#define TRUE 1
|
|
|
|
#define FALSE 0
|
|
|
|
|
1996-01-13 23:27:58 +00:00
|
|
|
#ifndef NFS_NOSERVER
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
1995-06-27 11:07:30 +00:00
|
|
|
* Get or check for a lease for "vp", based on ND_CHECK flag.
|
1994-05-24 10:09:53 +00:00
|
|
|
* The rules are as follows:
|
|
|
|
* - if a current non-caching lease, reply non-caching
|
|
|
|
* - if a current lease for same host only, extend lease
|
|
|
|
* - if a read cachable lease and a read lease request
|
|
|
|
* add host to list any reply cachable
|
|
|
|
* - else { set non-cachable for read-write sharing }
|
|
|
|
* send eviction notice messages to all other hosts that have lease
|
|
|
|
* wait for lease termination { either by receiving vacated messages
|
|
|
|
* from all the other hosts or expiry
|
|
|
|
* via. timeout }
|
|
|
|
* modify lease to non-cachable
|
|
|
|
* - else if no current lease, issue new one
|
|
|
|
* - reply
|
|
|
|
* - return boolean TRUE iff nam should be m_freem()'d
|
|
|
|
* NB: Since nqnfs_serverd() is called from a timer, any potential tsleep()
|
|
|
|
* in here must be framed by nqsrv_locklease() and nqsrv_unlocklease().
|
|
|
|
* nqsrv_locklease() is coded such that at least one of LC_LOCKED and
|
|
|
|
* LC_WANTED is set whenever a process is tsleeping in it. The exception
|
|
|
|
* is when a new lease is being allocated, since it is not in the timer
|
|
|
|
* queue yet. (Ditto for the splsoftclock() and splx(s) calls)
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1995-06-27 11:07:30 +00:00
|
|
|
nqsrv_getlease(vp, duration, flags, slp, procp, nam, cachablep, frev, cred)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct vnode *vp;
|
1998-05-31 20:09:01 +00:00
|
|
|
u_int32_t *duration;
|
1994-05-24 10:09:53 +00:00
|
|
|
int flags;
|
1995-06-27 11:07:30 +00:00
|
|
|
struct nfssvc_sock *slp;
|
|
|
|
struct proc *procp;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam;
|
1994-05-24 10:09:53 +00:00
|
|
|
int *cachablep;
|
|
|
|
u_quad_t *frev;
|
|
|
|
struct ucred *cred;
|
|
|
|
{
|
1994-10-17 17:47:45 +00:00
|
|
|
register struct nqlease *lp;
|
1998-05-31 20:09:01 +00:00
|
|
|
register struct nqfhhashhead *lpp = NULL;
|
|
|
|
register struct nqhost *lph = NULL;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct nqlease *tlp;
|
|
|
|
struct nqm **lphp;
|
|
|
|
struct vattr vattr;
|
|
|
|
fhandle_t fh;
|
|
|
|
int i, ok, error, s;
|
|
|
|
|
|
|
|
if (vp->v_type != VREG && vp->v_type != VDIR && vp->v_type != VLNK)
|
|
|
|
return (0);
|
|
|
|
if (*duration > nqsrv_maxlease)
|
|
|
|
*duration = nqsrv_maxlease;
|
1995-06-27 11:07:30 +00:00
|
|
|
error = VOP_GETATTR(vp, &vattr, cred, procp);
|
1994-10-02 17:27:07 +00:00
|
|
|
if (error)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
*frev = vattr.va_filerev;
|
|
|
|
s = splsoftclock();
|
|
|
|
tlp = vp->v_lease;
|
1995-06-27 11:07:30 +00:00
|
|
|
if ((flags & ND_CHECK) == 0)
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsstats.srvnqnfs_getleases++;
|
1998-05-31 17:27:58 +00:00
|
|
|
if (tlp == 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Find the lease by searching the hash list.
|
|
|
|
*/
|
|
|
|
fh.fh_fsid = vp->v_mount->mnt_stat.f_fsid;
|
1994-10-02 17:27:07 +00:00
|
|
|
error = VFS_VPTOFH(vp, &fh.fh_fid);
|
|
|
|
if (error) {
|
1994-05-24 10:09:53 +00:00
|
|
|
splx(s);
|
|
|
|
return (error);
|
|
|
|
}
|
1994-10-17 17:47:45 +00:00
|
|
|
lpp = NQFHHASH(fh.fh_fid.fid_data);
|
|
|
|
for (lp = lpp->lh_first; lp != 0; lp = lp->lc_hash.le_next)
|
1994-05-24 10:09:53 +00:00
|
|
|
if (fh.fh_fsid.val[0] == lp->lc_fsid.val[0] &&
|
|
|
|
fh.fh_fsid.val[1] == lp->lc_fsid.val[1] &&
|
|
|
|
!bcmp(fh.fh_fid.fid_data, lp->lc_fiddata,
|
1998-05-31 20:09:01 +00:00
|
|
|
fh.fh_fid.fid_len - sizeof (int32_t))) {
|
1994-05-24 10:09:53 +00:00
|
|
|
/* Found it */
|
|
|
|
lp->lc_vp = vp;
|
|
|
|
vp->v_lease = lp;
|
|
|
|
tlp = lp;
|
|
|
|
break;
|
|
|
|
}
|
1994-10-17 17:47:45 +00:00
|
|
|
} else
|
|
|
|
lp = tlp;
|
1998-05-31 17:27:58 +00:00
|
|
|
if (lp != 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
if ((lp->lc_flag & LC_NONCACHABLE) ||
|
|
|
|
(lp->lc_morehosts == (struct nqm *)0 &&
|
1995-06-27 11:07:30 +00:00
|
|
|
nqsrv_cmpnam(slp, nam, &lp->lc_host)))
|
1994-05-24 10:09:53 +00:00
|
|
|
goto doreply;
|
1995-06-27 11:07:30 +00:00
|
|
|
if ((flags & ND_READ) && (lp->lc_flag & LC_WRITE) == 0) {
|
|
|
|
if (flags & ND_CHECK)
|
1994-05-24 10:09:53 +00:00
|
|
|
goto doreply;
|
1995-06-27 11:07:30 +00:00
|
|
|
if (nqsrv_cmpnam(slp, nam, &lp->lc_host))
|
1994-05-24 10:09:53 +00:00
|
|
|
goto doreply;
|
|
|
|
i = 0;
|
|
|
|
if (lp->lc_morehosts) {
|
|
|
|
lph = lp->lc_morehosts->lpm_hosts;
|
|
|
|
lphp = &lp->lc_morehosts->lpm_next;
|
|
|
|
ok = 1;
|
|
|
|
} else {
|
|
|
|
lphp = &lp->lc_morehosts;
|
|
|
|
ok = 0;
|
|
|
|
}
|
|
|
|
while (ok && (lph->lph_flag & LC_VALID)) {
|
1995-06-27 11:07:30 +00:00
|
|
|
if (nqsrv_cmpnam(slp, nam, lph))
|
1994-05-24 10:09:53 +00:00
|
|
|
goto doreply;
|
|
|
|
if (++i == LC_MOREHOSTSIZ) {
|
|
|
|
i = 0;
|
|
|
|
if (*lphp) {
|
|
|
|
lph = (*lphp)->lpm_hosts;
|
|
|
|
lphp = &((*lphp)->lpm_next);
|
|
|
|
} else
|
|
|
|
ok = 0;
|
|
|
|
} else
|
|
|
|
lph++;
|
|
|
|
}
|
|
|
|
nqsrv_locklease(lp);
|
|
|
|
if (!ok) {
|
|
|
|
*lphp = (struct nqm *)
|
|
|
|
malloc(sizeof (struct nqm),
|
2000-12-08 21:51:06 +00:00
|
|
|
M_NQMHOST, M_WAITOK | M_ZERO);
|
1994-05-24 10:09:53 +00:00
|
|
|
lph = (*lphp)->lpm_hosts;
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
nqsrv_addhost(lph, slp, nam);
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_unlocklease(lp);
|
|
|
|
} else {
|
|
|
|
lp->lc_flag |= LC_NONCACHABLE;
|
|
|
|
nqsrv_locklease(lp);
|
1995-06-27 11:07:30 +00:00
|
|
|
nqsrv_send_eviction(vp, lp, slp, nam, cred);
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_waitfor_expiry(lp);
|
|
|
|
nqsrv_unlocklease(lp);
|
|
|
|
}
|
|
|
|
doreply:
|
|
|
|
/*
|
|
|
|
* Update the lease and return
|
|
|
|
*/
|
1995-06-27 11:07:30 +00:00
|
|
|
if ((flags & ND_CHECK) == 0)
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_instimeq(lp, *duration);
|
|
|
|
if (lp->lc_flag & LC_NONCACHABLE)
|
|
|
|
*cachablep = 0;
|
|
|
|
else {
|
|
|
|
*cachablep = 1;
|
1995-06-27 11:07:30 +00:00
|
|
|
if (flags & ND_WRITE)
|
1994-05-24 10:09:53 +00:00
|
|
|
lp->lc_flag |= LC_WRITTEN;
|
|
|
|
}
|
|
|
|
splx(s);
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
splx(s);
|
1995-06-27 11:07:30 +00:00
|
|
|
if (flags & ND_CHECK)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (0);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Allocate new lease
|
|
|
|
* The value of nqsrv_maxnumlease should be set generously, so that
|
|
|
|
* the following "printf" happens infrequently.
|
|
|
|
*/
|
|
|
|
if (nfsstats.srvnqnfs_leases > nqsrv_maxnumlease) {
|
|
|
|
printf("Nqnfs server, too many leases\n");
|
|
|
|
do {
|
|
|
|
(void) tsleep((caddr_t)&lbolt, PSOCK,
|
|
|
|
"nqsrvnuml", 0);
|
|
|
|
} while (nfsstats.srvnqnfs_leases > nqsrv_maxnumlease);
|
|
|
|
}
|
2000-12-08 21:51:06 +00:00
|
|
|
MALLOC(lp, struct nqlease *, sizeof (struct nqlease), M_NQLEASE,
|
|
|
|
M_WAITOK | M_ZERO);
|
1995-06-27 11:07:30 +00:00
|
|
|
if (flags & ND_WRITE)
|
1994-05-24 10:09:53 +00:00
|
|
|
lp->lc_flag |= (LC_WRITE | LC_WRITTEN);
|
1995-06-27 11:07:30 +00:00
|
|
|
nqsrv_addhost(&lp->lc_host, slp, nam);
|
1994-05-24 10:09:53 +00:00
|
|
|
lp->lc_vp = vp;
|
|
|
|
lp->lc_fsid = fh.fh_fsid;
|
1994-10-17 17:47:45 +00:00
|
|
|
bcopy(fh.fh_fid.fid_data, lp->lc_fiddata,
|
1998-05-31 20:09:01 +00:00
|
|
|
fh.fh_fid.fid_len - sizeof (int32_t));
|
1994-10-17 17:47:45 +00:00
|
|
|
if(!lpp)
|
|
|
|
panic("nfs_nqlease.c: Phoney lpp");
|
|
|
|
LIST_INSERT_HEAD(lpp, lp, lc_hash);
|
1994-05-24 10:09:53 +00:00
|
|
|
vp->v_lease = lp;
|
|
|
|
s = splsoftclock();
|
|
|
|
nqsrv_instimeq(lp, *duration);
|
|
|
|
splx(s);
|
|
|
|
*cachablep = 1;
|
|
|
|
if (++nfsstats.srvnqnfs_leases > nfsstats.srvnqnfs_maxleases)
|
|
|
|
nfsstats.srvnqnfs_maxleases = nfsstats.srvnqnfs_leases;
|
|
|
|
return (0);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Local lease check for server syscalls.
|
|
|
|
* Just set up args and let nqsrv_getlease() do the rest.
|
1995-06-27 11:07:30 +00:00
|
|
|
* nqnfs_vop_lease_check() is the VOP_LEASE() form of the same routine.
|
|
|
|
* Ifdef'd code in nfsnode.h renames these routines to whatever a particular
|
|
|
|
* OS needs.
|
1994-05-24 10:09:53 +00:00
|
|
|
*/
|
|
|
|
void
|
1995-06-27 11:07:30 +00:00
|
|
|
nqnfs_lease_check(vp, p, cred, flag)
|
1994-05-24 10:09:53 +00:00
|
|
|
struct vnode *vp;
|
|
|
|
struct proc *p;
|
|
|
|
struct ucred *cred;
|
|
|
|
int flag;
|
|
|
|
{
|
1998-05-31 20:09:01 +00:00
|
|
|
u_int32_t duration = 0;
|
1994-10-02 17:27:07 +00:00
|
|
|
int cache;
|
1994-05-24 10:09:53 +00:00
|
|
|
u_quad_t frev;
|
|
|
|
|
1995-06-27 11:07:30 +00:00
|
|
|
(void) nqsrv_getlease(vp, &duration, ND_CHECK | flag, NQLOCALSLP,
|
1997-08-16 19:16:27 +00:00
|
|
|
p, (struct sockaddr *)0, &cache, &frev, cred);
|
1995-06-27 11:07:30 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
nqnfs_vop_lease_check(ap)
|
|
|
|
struct vop_lease_args /* {
|
|
|
|
struct vnode *a_vp;
|
|
|
|
struct proc *a_p;
|
|
|
|
struct ucred *a_cred;
|
|
|
|
int a_flag;
|
|
|
|
} */ *ap;
|
|
|
|
{
|
1998-05-31 20:09:01 +00:00
|
|
|
u_int32_t duration = 0;
|
1995-06-27 11:07:30 +00:00
|
|
|
int cache;
|
|
|
|
u_quad_t frev;
|
|
|
|
|
|
|
|
(void) nqsrv_getlease(ap->a_vp, &duration, ND_CHECK | ap->a_flag,
|
1997-08-16 19:16:27 +00:00
|
|
|
NQLOCALSLP, ap->a_p, (struct sockaddr *)0,
|
|
|
|
&cache, &frev, ap->a_cred);
|
1995-06-27 11:07:30 +00:00
|
|
|
return (0);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1997-02-19 14:30:41 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Add a host to an nqhost structure for a lease.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_addhost(lph, slp, nam)
|
|
|
|
register struct nqhost *lph;
|
|
|
|
struct nfssvc_sock *slp;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1999-11-11 17:24:02 +00:00
|
|
|
struct sockaddr_in *saddr;
|
|
|
|
struct socket *nsso;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1999-11-11 17:24:02 +00:00
|
|
|
if (slp == NQLOCALSLP) {
|
1994-05-24 10:09:53 +00:00
|
|
|
lph->lph_flag |= (LC_VALID | LC_LOCAL);
|
1999-11-11 17:24:02 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
nsso = slp->ns_so;
|
2000-01-26 20:51:29 +00:00
|
|
|
lph->lph_slp = slp;
|
1999-11-11 17:24:02 +00:00
|
|
|
if (nsso && nsso->so_proto->pr_protocol == IPPROTO_UDP) {
|
1997-08-16 19:16:27 +00:00
|
|
|
saddr = (struct sockaddr_in *)nam;
|
1994-05-24 10:09:53 +00:00
|
|
|
lph->lph_flag |= (LC_VALID | LC_UDP);
|
|
|
|
lph->lph_inetaddr = saddr->sin_addr.s_addr;
|
|
|
|
lph->lph_port = saddr->sin_port;
|
|
|
|
} else {
|
|
|
|
lph->lph_flag |= (LC_VALID | LC_SREF);
|
|
|
|
slp->ns_sref++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Update the lease expiry time and position it in the timer queue correctly.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_instimeq(lp, duration)
|
|
|
|
register struct nqlease *lp;
|
1998-05-31 20:09:01 +00:00
|
|
|
u_int32_t duration;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
|
|
|
register struct nqlease *tlp;
|
|
|
|
time_t newexpiry;
|
|
|
|
|
1998-03-30 09:56:58 +00:00
|
|
|
newexpiry = time_second + duration + nqsrv_clockskew;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (lp->lc_expiry == newexpiry)
|
|
|
|
return;
|
2000-11-14 08:00:39 +00:00
|
|
|
if (TAILQ_NEXT(lp, lc_timer) != 0) {
|
|
|
|
TAILQ_REMOVE(&nqtimerhead, lp, lc_timer);
|
1994-10-17 17:47:45 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
lp->lc_expiry = newexpiry;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Find where in the queue it should be.
|
|
|
|
*/
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_FOREACH_REVERSE(tlp, &nqtimerhead, nqtimerhead, lc_timer)
|
|
|
|
if (tlp->lc_expiry <= newexpiry)
|
|
|
|
break;
|
1994-10-17 17:47:45 +00:00
|
|
|
#ifdef HASNVRAM
|
2000-11-14 08:00:39 +00:00
|
|
|
if (tlp == TAILQ_LAST(&nqtimerhead))
|
1994-05-24 10:09:53 +00:00
|
|
|
NQSTORENOVRAM(newexpiry);
|
1994-10-17 17:47:45 +00:00
|
|
|
#endif /* HASNVRAM */
|
2000-11-14 08:00:39 +00:00
|
|
|
if (tlp == NULL) {
|
|
|
|
TAILQ_INSERT_HEAD(&nqtimerhead, lp, lc_timer);
|
1994-10-17 17:47:45 +00:00
|
|
|
} else {
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_INSERT_AFTER(&nqtimerhead, tlp, lp, lc_timer);
|
1994-08-13 14:21:58 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Compare the requesting host address with the lph entry in the lease.
|
|
|
|
* Return true iff it is the same.
|
|
|
|
* This is somewhat messy due to the union in the nqhost structure.
|
|
|
|
* The local host is indicated by the special value of NQLOCALSLP for slp.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_cmpnam(slp, nam, lph)
|
|
|
|
register struct nfssvc_sock *slp;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam;
|
1994-05-24 10:09:53 +00:00
|
|
|
register struct nqhost *lph;
|
|
|
|
{
|
|
|
|
register struct sockaddr_in *saddr;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *addr;
|
1994-05-24 10:09:53 +00:00
|
|
|
union nethostaddr lhaddr;
|
1999-11-11 17:24:02 +00:00
|
|
|
struct socket *nsso;
|
1994-05-24 10:09:53 +00:00
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (slp == NQLOCALSLP) {
|
|
|
|
if (lph->lph_flag & LC_LOCAL)
|
|
|
|
return (1);
|
|
|
|
else
|
|
|
|
return (0);
|
|
|
|
}
|
1999-11-11 17:24:02 +00:00
|
|
|
nsso = slp->ns_so;
|
|
|
|
if (nsso && nsso->so_proto->pr_protocol == IPPROTO_UDP) {
|
1994-05-24 10:09:53 +00:00
|
|
|
addr = nam;
|
1999-11-11 17:24:02 +00:00
|
|
|
} else {
|
1994-05-24 10:09:53 +00:00
|
|
|
addr = slp->ns_nam;
|
1999-11-11 17:24:02 +00:00
|
|
|
}
|
|
|
|
if (lph->lph_flag & LC_UDP) {
|
1994-05-24 10:09:53 +00:00
|
|
|
ret = netaddr_match(AF_INET, &lph->lph_haddr, addr);
|
1999-11-11 17:24:02 +00:00
|
|
|
} else {
|
1994-05-24 10:09:53 +00:00
|
|
|
if ((lph->lph_slp->ns_flag & SLP_VALID) == 0)
|
|
|
|
return (0);
|
1997-08-16 19:16:27 +00:00
|
|
|
saddr = (struct sockaddr_in *)lph->lph_slp->ns_nam;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (saddr->sin_family == AF_INET)
|
|
|
|
lhaddr.had_inetaddr = saddr->sin_addr.s_addr;
|
|
|
|
else
|
|
|
|
lhaddr.had_nam = lph->lph_slp->ns_nam;
|
|
|
|
ret = netaddr_match(saddr->sin_family, &lhaddr, addr);
|
|
|
|
}
|
|
|
|
return (ret);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Send out eviction notice messages to all other hosts for the lease.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_send_eviction(vp, lp, slp, nam, cred)
|
|
|
|
struct vnode *vp;
|
|
|
|
register struct nqlease *lp;
|
|
|
|
struct nfssvc_sock *slp;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct ucred *cred;
|
|
|
|
{
|
|
|
|
register struct nqhost *lph = &lp->lc_host;
|
|
|
|
register int siz;
|
|
|
|
struct nqm *lphnext = lp->lc_morehosts;
|
1999-12-19 01:55:37 +00:00
|
|
|
struct mbuf *m, *mreq, *mb, *mb2, *mheadend;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam2;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct sockaddr_in *saddr;
|
1997-06-03 17:22:47 +00:00
|
|
|
nfsfh_t nfh;
|
1994-05-24 10:09:53 +00:00
|
|
|
fhandle_t *fhp;
|
|
|
|
caddr_t bpos, cp;
|
1998-05-31 20:09:01 +00:00
|
|
|
u_int32_t xid, *tl;
|
1994-05-24 10:09:53 +00:00
|
|
|
int len = 1, ok = 1, i = 0;
|
|
|
|
|
|
|
|
while (ok && (lph->lph_flag & LC_VALID)) {
|
2000-01-26 20:51:29 +00:00
|
|
|
if (nqsrv_cmpnam(slp, nam, lph)) {
|
1994-05-24 10:09:53 +00:00
|
|
|
lph->lph_flag |= LC_VACATED;
|
2000-01-26 20:51:29 +00:00
|
|
|
} else if ((lph->lph_flag & (LC_LOCAL | LC_VACATED)) == 0) {
|
|
|
|
struct socket *so;
|
|
|
|
int sotype;
|
|
|
|
int *solockp = NULL;
|
|
|
|
|
|
|
|
so = lph->lph_slp->ns_so;
|
1994-05-24 10:09:53 +00:00
|
|
|
if (lph->lph_flag & LC_UDP) {
|
1997-08-16 19:16:27 +00:00
|
|
|
MALLOC(nam2, struct sockaddr *,
|
|
|
|
sizeof *nam2, M_SONAME, M_WAITOK);
|
|
|
|
saddr = (struct sockaddr_in *)nam2;
|
|
|
|
saddr->sin_len = sizeof *saddr;
|
1994-05-24 10:09:53 +00:00
|
|
|
saddr->sin_family = AF_INET;
|
|
|
|
saddr->sin_addr.s_addr = lph->lph_inetaddr;
|
|
|
|
saddr->sin_port = lph->lph_port;
|
|
|
|
} else if (lph->lph_slp->ns_flag & SLP_VALID) {
|
1997-08-16 19:16:27 +00:00
|
|
|
nam2 = (struct sockaddr *)0;
|
2000-01-26 20:51:29 +00:00
|
|
|
} else {
|
1994-05-24 10:09:53 +00:00
|
|
|
goto nextone;
|
2000-01-26 20:51:29 +00:00
|
|
|
}
|
1994-05-24 10:09:53 +00:00
|
|
|
sotype = so->so_type;
|
|
|
|
if (so->so_proto->pr_flags & PR_CONNREQUIRED)
|
|
|
|
solockp = &lph->lph_slp->ns_solock;
|
|
|
|
nfsm_reqhead((struct vnode *)0, NQNFSPROC_EVICTED,
|
1997-06-03 17:22:47 +00:00
|
|
|
NFSX_V3FH + NFSX_UNSIGNED);
|
|
|
|
fhp = &nfh.fh_generic;
|
|
|
|
bzero((caddr_t)fhp, sizeof(nfh));
|
1994-05-24 10:09:53 +00:00
|
|
|
fhp->fh_fsid = vp->v_mount->mnt_stat.f_fsid;
|
|
|
|
VFS_VPTOFH(vp, &fhp->fh_fid);
|
1997-06-03 17:22:47 +00:00
|
|
|
nfsm_srvfhtom(fhp, 1);
|
1994-05-24 10:09:53 +00:00
|
|
|
m = mreq;
|
|
|
|
siz = 0;
|
|
|
|
while (m) {
|
|
|
|
siz += m->m_len;
|
|
|
|
m = m->m_next;
|
|
|
|
}
|
|
|
|
if (siz <= 0 || siz > NFS_MAXPACKET) {
|
|
|
|
printf("mbuf siz=%d\n",siz);
|
|
|
|
panic("Bad nfs svc reply");
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
m = nfsm_rpchead(cred, (NFSMNT_NFSV3 | NFSMNT_NQNFS),
|
|
|
|
NQNFSPROC_EVICTED,
|
|
|
|
RPCAUTH_UNIX, 5 * NFSX_UNSIGNED, (char *)0,
|
1995-08-24 10:45:16 +00:00
|
|
|
0, (char *)NULL, mreq, siz, &mheadend, &xid);
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* For stream protocols, prepend a Sun RPC
|
|
|
|
* Record Mark.
|
|
|
|
*/
|
|
|
|
if (sotype == SOCK_STREAM) {
|
2000-12-21 21:44:31 +00:00
|
|
|
M_PREPEND(m, NFSX_UNSIGNED, M_TRYWAIT);
|
1998-05-31 20:09:01 +00:00
|
|
|
*mtod(m, u_int32_t *) = htonl(0x80000000 |
|
1994-05-24 10:09:53 +00:00
|
|
|
(m->m_pkthdr.len - NFSX_UNSIGNED));
|
|
|
|
}
|
The VFS/BIO subsystem contained a number of hacks in order to optimize
piecemeal, middle-of-file writes for NFS. These hacks have caused no
end of trouble, especially when combined with mmap(). I've removed
them. Instead, NFS will issue a read-before-write to fully
instantiate the struct buf containing the write. NFS does, however,
optimize piecemeal appends to files. For most common file operations,
you will not notice the difference. The sole remaining fragment in
the VFS/BIO system is b_dirtyoff/end, which NFS uses to avoid cache
coherency issues with read-merge-write style operations. NFS also
optimizes the write-covers-entire-buffer case by avoiding the
read-before-write. There is quite a bit of room for further
optimization in these areas.
The VM system marks pages fully-valid (AKA vm_page_t->valid =
VM_PAGE_BITS_ALL) in several places, most noteably in vm_fault. This
is not correct operation. The vm_pager_get_pages() code is now
responsible for marking VM pages all-valid. A number of VM helper
routines have been added to aid in zeroing-out the invalid portions of
a VM page prior to the page being marked all-valid. This operation is
necessary to properly support mmap(). The zeroing occurs most often
when dealing with file-EOF situations. Several bugs have been fixed
in the NFS subsystem, including bits handling file and directory EOF
situations and buf->b_flags consistancy issues relating to clearing
B_ERROR & B_INVAL, and handling B_DONE.
getblk() and allocbuf() have been rewritten. B_CACHE operation is now
formally defined in comments and more straightforward in
implementation. B_CACHE for VMIO buffers is based on the validity of
the backing store. B_CACHE for non-VMIO buffers is based simply on
whether the buffer is B_INVAL or not (B_CACHE set if B_INVAL clear,
and vise-versa). biodone() is now responsible for setting B_CACHE
when a successful read completes. B_CACHE is also set when a bdwrite()
is initiated and when a bwrite() is initiated. VFS VOP_BWRITE
routines (there are only two - nfs_bwrite() and bwrite()) are now
expected to set B_CACHE. This means that bowrite() and bawrite() also
set B_CACHE indirectly.
There are a number of places in the code which were previously using
buf->b_bufsize (which is DEV_BSIZE aligned) when they should have
been using buf->b_bcount. These have been fixed. getblk() now clears
B_DONE on return because the rest of the system is so bad about
dealing with B_DONE.
Major fixes to NFS/TCP have been made. A server-side bug could cause
requests to be lost by the server due to nfs_realign() overwriting
other rpc's in the same TCP mbuf chain. The server's kernel must be
recompiled to get the benefit of the fixes.
Submitted by: Matthew Dillon <dillon@apollo.backplane.com>
1999-05-02 23:57:16 +00:00
|
|
|
/*
|
|
|
|
* nfs_sndlock if PR_CONNREQUIRED XXX
|
|
|
|
*/
|
|
|
|
|
2000-02-13 03:32:07 +00:00
|
|
|
if ((lph->lph_flag & LC_UDP) == 0 &&
|
2000-01-26 20:51:29 +00:00
|
|
|
((lph->lph_slp->ns_flag & SLP_VALID) == 0 ||
|
|
|
|
nfs_slplock(lph->lph_slp, 0) == 0)) {
|
1994-05-24 10:09:53 +00:00
|
|
|
m_freem(m);
|
2000-01-26 20:51:29 +00:00
|
|
|
} else {
|
1994-05-24 10:09:53 +00:00
|
|
|
(void) nfs_send(so, nam2, m,
|
|
|
|
(struct nfsreq *)0);
|
|
|
|
if (solockp)
|
1999-02-25 00:03:51 +00:00
|
|
|
nfs_slpunlock(lph->lph_slp);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
if (lph->lph_flag & LC_UDP)
|
1997-08-16 19:16:27 +00:00
|
|
|
FREE(nam2, M_SONAME);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
nextone:
|
|
|
|
if (++i == len) {
|
|
|
|
if (lphnext) {
|
|
|
|
i = 0;
|
|
|
|
len = LC_MOREHOSTSIZ;
|
|
|
|
lph = lphnext->lpm_hosts;
|
|
|
|
lphnext = lphnext->lpm_next;
|
|
|
|
} else
|
|
|
|
ok = 0;
|
|
|
|
} else
|
|
|
|
lph++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait for the lease to expire.
|
|
|
|
* This will occur when all clients have sent "vacated" messages to
|
|
|
|
* this server OR when it expires do to timeout.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_waitfor_expiry(lp)
|
|
|
|
register struct nqlease *lp;
|
|
|
|
{
|
|
|
|
register struct nqhost *lph;
|
|
|
|
register int i;
|
|
|
|
struct nqm *lphnext;
|
|
|
|
int len, ok;
|
|
|
|
|
|
|
|
tryagain:
|
1998-03-30 09:56:58 +00:00
|
|
|
if (time_second > lp->lc_expiry)
|
1994-05-24 10:09:53 +00:00
|
|
|
return;
|
|
|
|
lph = &lp->lc_host;
|
|
|
|
lphnext = lp->lc_morehosts;
|
|
|
|
len = 1;
|
|
|
|
i = 0;
|
|
|
|
ok = 1;
|
|
|
|
while (ok && (lph->lph_flag & LC_VALID)) {
|
|
|
|
if ((lph->lph_flag & (LC_LOCAL | LC_VACATED)) == 0) {
|
|
|
|
lp->lc_flag |= LC_EXPIREDWANTED;
|
|
|
|
(void) tsleep((caddr_t)&lp->lc_flag, PSOCK,
|
|
|
|
"nqexp", 0);
|
|
|
|
goto tryagain;
|
|
|
|
}
|
|
|
|
if (++i == len) {
|
|
|
|
if (lphnext) {
|
|
|
|
i = 0;
|
|
|
|
len = LC_MOREHOSTSIZ;
|
|
|
|
lph = lphnext->lpm_hosts;
|
|
|
|
lphnext = lphnext->lpm_next;
|
|
|
|
} else
|
|
|
|
ok = 0;
|
|
|
|
} else
|
|
|
|
lph++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Nqnfs server timer that maintains the server lease queue.
|
|
|
|
* Scan the lease queue for expired entries:
|
|
|
|
* - when one is found, wakeup anyone waiting for it
|
|
|
|
* else dequeue and free
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
nqnfs_serverd()
|
|
|
|
{
|
1994-10-17 17:47:45 +00:00
|
|
|
register struct nqlease *lp;
|
1994-05-24 10:09:53 +00:00
|
|
|
register struct nqhost *lph;
|
|
|
|
struct nqlease *nextlp;
|
|
|
|
struct nqm *lphnext, *olphnext;
|
|
|
|
int i, len, ok;
|
|
|
|
|
2000-11-14 08:00:39 +00:00
|
|
|
for (lp = TAILQ_FIRST(&nqtimerhead); lp; lp = nextlp) {
|
1998-03-30 09:56:58 +00:00
|
|
|
if (lp->lc_expiry >= time_second)
|
1994-05-24 10:09:53 +00:00
|
|
|
break;
|
2000-11-14 08:00:39 +00:00
|
|
|
nextlp = TAILQ_NEXT(lp, lc_timer);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (lp->lc_flag & LC_EXPIREDWANTED) {
|
|
|
|
lp->lc_flag &= ~LC_EXPIREDWANTED;
|
|
|
|
wakeup((caddr_t)&lp->lc_flag);
|
|
|
|
} else if ((lp->lc_flag & (LC_LOCKED | LC_WANTED)) == 0) {
|
|
|
|
/*
|
|
|
|
* Make a best effort at keeping a write caching lease long
|
|
|
|
* enough by not deleting it until it has been explicitly
|
|
|
|
* vacated or there have been no writes in the previous
|
|
|
|
* write_slack seconds since expiry and the nfsds are not
|
|
|
|
* all busy. The assumption is that if the nfsds are not
|
|
|
|
* all busy now (no queue of nfs requests), then the client
|
|
|
|
* would have been able to do at least one write to the
|
|
|
|
* file during the last write_slack seconds if it was still
|
|
|
|
* trying to push writes to the server.
|
|
|
|
*/
|
|
|
|
if ((lp->lc_flag & (LC_WRITE | LC_VACATED)) == LC_WRITE &&
|
|
|
|
((lp->lc_flag & LC_WRITTEN) || nfsd_waiting == 0)) {
|
|
|
|
lp->lc_flag &= ~LC_WRITTEN;
|
|
|
|
nqsrv_instimeq(lp, nqsrv_writeslack);
|
|
|
|
} else {
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_REMOVE(&nqtimerhead, lp, lc_timer);
|
1994-10-17 17:47:45 +00:00
|
|
|
LIST_REMOVE(lp, lc_hash);
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* This soft reference may no longer be valid, but
|
|
|
|
* no harm done. The worst case is if the vnode was
|
|
|
|
* recycled and has another valid lease reference,
|
|
|
|
* which is dereferenced prematurely.
|
|
|
|
*/
|
|
|
|
lp->lc_vp->v_lease = (struct nqlease *)0;
|
|
|
|
lph = &lp->lc_host;
|
|
|
|
lphnext = lp->lc_morehosts;
|
|
|
|
olphnext = (struct nqm *)0;
|
|
|
|
len = 1;
|
|
|
|
i = 0;
|
|
|
|
ok = 1;
|
|
|
|
while (ok && (lph->lph_flag & LC_VALID)) {
|
|
|
|
if (lph->lph_flag & LC_SREF)
|
|
|
|
nfsrv_slpderef(lph->lph_slp);
|
|
|
|
if (++i == len) {
|
|
|
|
if (olphnext) {
|
|
|
|
free((caddr_t)olphnext, M_NQMHOST);
|
|
|
|
olphnext = (struct nqm *)0;
|
|
|
|
}
|
|
|
|
if (lphnext) {
|
|
|
|
olphnext = lphnext;
|
|
|
|
i = 0;
|
|
|
|
len = LC_MOREHOSTSIZ;
|
|
|
|
lph = lphnext->lpm_hosts;
|
|
|
|
lphnext = lphnext->lpm_next;
|
|
|
|
} else
|
|
|
|
ok = 0;
|
|
|
|
} else
|
|
|
|
lph++;
|
|
|
|
}
|
|
|
|
FREE((caddr_t)lp, M_NQLEASE);
|
|
|
|
if (olphnext)
|
|
|
|
free((caddr_t)olphnext, M_NQMHOST);
|
|
|
|
nfsstats.srvnqnfs_leases--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called from nfssvc_nfsd() for a getlease rpc request.
|
|
|
|
* Do the from/to xdr translation and call nqsrv_getlease() to
|
|
|
|
* do the real work.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1995-06-27 11:07:30 +00:00
|
|
|
nqnfsrv_getlease(nfsd, slp, procp, mrq)
|
|
|
|
struct nfsrv_descript *nfsd;
|
|
|
|
struct nfssvc_sock *slp;
|
|
|
|
struct proc *procp;
|
|
|
|
struct mbuf **mrq;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1995-06-27 11:07:30 +00:00
|
|
|
struct mbuf *mrep = nfsd->nd_mrep, *md = nfsd->nd_md;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam = nfsd->nd_nam;
|
1995-06-27 11:07:30 +00:00
|
|
|
caddr_t dpos = nfsd->nd_dpos;
|
|
|
|
struct ucred *cred = &nfsd->nd_cr;
|
|
|
|
register struct nfs_fattr *fp;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct vattr va;
|
|
|
|
register struct vattr *vap = &va;
|
|
|
|
struct vnode *vp;
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsfh_t nfh;
|
1994-05-24 10:09:53 +00:00
|
|
|
fhandle_t *fhp;
|
1998-05-31 20:09:01 +00:00
|
|
|
register u_int32_t *tl;
|
|
|
|
register int32_t t1;
|
1994-05-24 10:09:53 +00:00
|
|
|
u_quad_t frev;
|
|
|
|
caddr_t bpos;
|
|
|
|
int error = 0;
|
|
|
|
char *cp2;
|
|
|
|
struct mbuf *mb, *mb2, *mreq;
|
|
|
|
int flags, rdonly, cache;
|
|
|
|
|
|
|
|
fhp = &nfh.fh_generic;
|
|
|
|
nfsm_srvmtofh(fhp);
|
1998-05-31 20:09:01 +00:00
|
|
|
nfsm_dissect(tl, u_int32_t *, 2 * NFSX_UNSIGNED);
|
1994-05-24 10:09:53 +00:00
|
|
|
flags = fxdr_unsigned(int, *tl++);
|
|
|
|
nfsd->nd_duration = fxdr_unsigned(int, *tl);
|
1995-06-27 11:07:30 +00:00
|
|
|
error = nfsrv_fhtovp(fhp, 1, &vp, cred, slp, nam, &rdonly,
|
1997-07-16 09:06:30 +00:00
|
|
|
(nfsd->nd_flag & ND_KERBAUTH), TRUE);
|
1999-12-12 07:06:39 +00:00
|
|
|
if (error) {
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsm_reply(0);
|
1999-12-12 07:06:39 +00:00
|
|
|
goto nfsmout;
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
if (rdonly && flags == ND_WRITE) {
|
1994-05-24 10:09:53 +00:00
|
|
|
error = EROFS;
|
1996-08-21 21:56:23 +00:00
|
|
|
vput(vp);
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsm_reply(0);
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
(void) nqsrv_getlease(vp, &nfsd->nd_duration, flags, slp, procp,
|
1994-05-24 10:09:53 +00:00
|
|
|
nam, &cache, &frev, cred);
|
1995-06-27 11:07:30 +00:00
|
|
|
error = VOP_GETATTR(vp, vap, cred, procp);
|
1996-08-21 21:56:23 +00:00
|
|
|
vput(vp);
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsm_reply(NFSX_V3FATTR + 4 * NFSX_UNSIGNED);
|
1998-05-31 20:09:01 +00:00
|
|
|
nfsm_build(tl, u_int32_t *, 4 * NFSX_UNSIGNED);
|
1994-05-24 10:09:53 +00:00
|
|
|
*tl++ = txdr_unsigned(cache);
|
|
|
|
*tl++ = txdr_unsigned(nfsd->nd_duration);
|
1999-06-05 05:35:03 +00:00
|
|
|
txdr_hyper(frev, tl);
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsm_build(fp, struct nfs_fattr *, NFSX_V3FATTR);
|
|
|
|
nfsm_srvfillattr(vap, fp);
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsm_srvdone;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called from nfssvc_nfsd() when a "vacated" message is received from a
|
|
|
|
* client. Find the entry and expire it.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1995-06-27 11:07:30 +00:00
|
|
|
nqnfsrv_vacated(nfsd, slp, procp, mrq)
|
|
|
|
struct nfsrv_descript *nfsd;
|
|
|
|
struct nfssvc_sock *slp;
|
|
|
|
struct proc *procp;
|
|
|
|
struct mbuf **mrq;
|
1994-05-24 10:09:53 +00:00
|
|
|
{
|
1995-06-27 11:07:30 +00:00
|
|
|
struct mbuf *mrep = nfsd->nd_mrep, *md = nfsd->nd_md;
|
1997-08-16 19:16:27 +00:00
|
|
|
struct sockaddr *nam = nfsd->nd_nam;
|
1995-06-27 11:07:30 +00:00
|
|
|
caddr_t dpos = nfsd->nd_dpos;
|
1994-05-24 10:09:53 +00:00
|
|
|
register struct nqlease *lp;
|
|
|
|
register struct nqhost *lph;
|
|
|
|
struct nqlease *tlp = (struct nqlease *)0;
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsfh_t nfh;
|
1994-05-24 10:09:53 +00:00
|
|
|
fhandle_t *fhp;
|
1998-05-31 20:09:01 +00:00
|
|
|
register u_int32_t *tl;
|
|
|
|
register int32_t t1;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct nqm *lphnext;
|
1995-06-27 11:07:30 +00:00
|
|
|
struct mbuf *mreq, *mb;
|
|
|
|
int error = 0, i, len, ok, gotit = 0, cache = 0;
|
|
|
|
char *cp2, *bpos;
|
|
|
|
u_quad_t frev;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
fhp = &nfh.fh_generic;
|
|
|
|
nfsm_srvmtofh(fhp);
|
|
|
|
m_freem(mrep);
|
|
|
|
/*
|
|
|
|
* Find the lease by searching the hash list.
|
|
|
|
*/
|
1994-10-17 17:47:45 +00:00
|
|
|
for (lp = NQFHHASH(fhp->fh_fid.fid_data)->lh_first; lp != 0;
|
|
|
|
lp = lp->lc_hash.le_next)
|
1994-05-24 10:09:53 +00:00
|
|
|
if (fhp->fh_fsid.val[0] == lp->lc_fsid.val[0] &&
|
|
|
|
fhp->fh_fsid.val[1] == lp->lc_fsid.val[1] &&
|
|
|
|
!bcmp(fhp->fh_fid.fid_data, lp->lc_fiddata,
|
|
|
|
MAXFIDSZ)) {
|
|
|
|
/* Found it */
|
|
|
|
tlp = lp;
|
|
|
|
break;
|
|
|
|
}
|
1998-05-31 17:27:58 +00:00
|
|
|
if (tlp != 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
lp = tlp;
|
|
|
|
len = 1;
|
|
|
|
i = 0;
|
|
|
|
lph = &lp->lc_host;
|
|
|
|
lphnext = lp->lc_morehosts;
|
|
|
|
ok = 1;
|
|
|
|
while (ok && (lph->lph_flag & LC_VALID)) {
|
1995-06-27 11:07:30 +00:00
|
|
|
if (nqsrv_cmpnam(slp, nam, lph)) {
|
1994-05-24 10:09:53 +00:00
|
|
|
lph->lph_flag |= LC_VACATED;
|
|
|
|
gotit++;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (++i == len) {
|
|
|
|
if (lphnext) {
|
|
|
|
len = LC_MOREHOSTSIZ;
|
|
|
|
i = 0;
|
|
|
|
lph = lphnext->lpm_hosts;
|
|
|
|
lphnext = lphnext->lpm_next;
|
|
|
|
} else
|
|
|
|
ok = 0;
|
|
|
|
} else
|
|
|
|
lph++;
|
|
|
|
}
|
|
|
|
if ((lp->lc_flag & LC_EXPIREDWANTED) && gotit) {
|
|
|
|
lp->lc_flag &= ~LC_EXPIREDWANTED;
|
|
|
|
wakeup((caddr_t)&lp->lc_flag);
|
|
|
|
}
|
|
|
|
nfsmout:
|
|
|
|
return (EPERM);
|
|
|
|
}
|
|
|
|
return (EPERM);
|
|
|
|
}
|
|
|
|
|
1996-01-13 23:27:58 +00:00
|
|
|
#endif /* NFS_NOSERVER */
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Client get lease rpc function.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1994-05-24 10:09:53 +00:00
|
|
|
nqnfs_getlease(vp, rwflag, cred, p)
|
|
|
|
register struct vnode *vp;
|
|
|
|
int rwflag;
|
|
|
|
struct ucred *cred;
|
|
|
|
struct proc *p;
|
|
|
|
{
|
1998-05-31 20:09:01 +00:00
|
|
|
register u_int32_t *tl;
|
1994-05-24 10:09:53 +00:00
|
|
|
register caddr_t cp;
|
1998-05-31 20:09:01 +00:00
|
|
|
register int32_t t1, t2;
|
1994-05-24 10:09:53 +00:00
|
|
|
register struct nfsnode *np;
|
|
|
|
struct nfsmount *nmp = VFSTONFS(vp->v_mount);
|
|
|
|
caddr_t bpos, dpos, cp2;
|
|
|
|
time_t reqtime;
|
|
|
|
int error = 0;
|
|
|
|
struct mbuf *mreq, *mrep, *md, *mb, *mb2;
|
|
|
|
int cachable;
|
|
|
|
u_quad_t frev;
|
1995-05-30 08:16:23 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsstats.rpccnt[NQNFSPROC_GETLEASE]++;
|
1995-06-27 11:07:30 +00:00
|
|
|
mb = mreq = nfsm_reqh(vp, NQNFSPROC_GETLEASE, NFSX_V3FH+2*NFSX_UNSIGNED,
|
1994-05-24 10:09:53 +00:00
|
|
|
&bpos);
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsm_fhtom(vp, 1);
|
1998-05-31 20:09:01 +00:00
|
|
|
nfsm_build(tl, u_int32_t *, 2 * NFSX_UNSIGNED);
|
1994-05-24 10:09:53 +00:00
|
|
|
*tl++ = txdr_unsigned(rwflag);
|
|
|
|
*tl = txdr_unsigned(nmp->nm_leaseterm);
|
1998-03-30 09:56:58 +00:00
|
|
|
reqtime = time_second;
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsm_request(vp, NQNFSPROC_GETLEASE, p, cred);
|
|
|
|
np = VTONFS(vp);
|
1998-05-31 20:09:01 +00:00
|
|
|
nfsm_dissect(tl, u_int32_t *, 4 * NFSX_UNSIGNED);
|
1994-05-24 10:09:53 +00:00
|
|
|
cachable = fxdr_unsigned(int, *tl++);
|
|
|
|
reqtime += fxdr_unsigned(int, *tl++);
|
1998-03-30 09:56:58 +00:00
|
|
|
if (reqtime > time_second) {
|
1999-06-05 05:35:03 +00:00
|
|
|
frev = fxdr_hyper(tl);
|
1994-05-24 10:09:53 +00:00
|
|
|
nqnfs_clientlease(nmp, np, rwflag, cachable, reqtime, frev);
|
|
|
|
nfsm_loadattr(vp, (struct vattr *)0);
|
|
|
|
} else
|
|
|
|
error = NQNFS_EXPIRED;
|
|
|
|
nfsm_reqdone;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1999-02-25 00:03:51 +00:00
|
|
|
#ifndef NFS_NOSERVER
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Client vacated message function.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static int
|
1994-05-24 10:09:53 +00:00
|
|
|
nqnfs_vacated(vp, cred)
|
|
|
|
register struct vnode *vp;
|
|
|
|
struct ucred *cred;
|
|
|
|
{
|
|
|
|
register caddr_t cp;
|
|
|
|
register int i;
|
1998-05-31 20:09:01 +00:00
|
|
|
register u_int32_t *tl;
|
|
|
|
register int32_t t2;
|
1994-05-24 10:09:53 +00:00
|
|
|
caddr_t bpos;
|
1998-05-31 20:09:01 +00:00
|
|
|
u_int32_t xid;
|
1994-05-24 10:09:53 +00:00
|
|
|
int error = 0;
|
1999-12-19 01:55:37 +00:00
|
|
|
struct mbuf *m, *mreq, *mb, *mb2, *mheadend;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct nfsmount *nmp;
|
|
|
|
struct nfsreq myrep;
|
1995-05-30 08:16:23 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp = VFSTONFS(vp->v_mount);
|
|
|
|
nfsstats.rpccnt[NQNFSPROC_VACATED]++;
|
1997-06-03 17:22:47 +00:00
|
|
|
nfsm_reqhead(vp, NQNFSPROC_VACATED, NFSX_FH(1));
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsm_fhtom(vp, 1);
|
1994-05-24 10:09:53 +00:00
|
|
|
m = mreq;
|
|
|
|
i = 0;
|
|
|
|
while (m) {
|
|
|
|
i += m->m_len;
|
|
|
|
m = m->m_next;
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
m = nfsm_rpchead(cred, nmp->nm_flag, NQNFSPROC_VACATED,
|
|
|
|
RPCAUTH_UNIX, 5 * NFSX_UNSIGNED, (char *)0,
|
1995-08-24 10:45:16 +00:00
|
|
|
0, (char *)NULL, mreq, i, &mheadend, &xid);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (nmp->nm_sotype == SOCK_STREAM) {
|
2000-12-21 21:44:31 +00:00
|
|
|
M_PREPEND(m, NFSX_UNSIGNED, M_TRYWAIT);
|
1998-05-31 20:09:01 +00:00
|
|
|
*mtod(m, u_int32_t *) = htonl(0x80000000 | (m->m_pkthdr.len -
|
1994-05-24 10:09:53 +00:00
|
|
|
NFSX_UNSIGNED));
|
|
|
|
}
|
|
|
|
myrep.r_flags = 0;
|
|
|
|
myrep.r_nmp = nmp;
|
|
|
|
if (nmp->nm_soflags & PR_CONNREQUIRED)
|
1999-02-25 00:03:51 +00:00
|
|
|
(void) nfs_sndlock(&myrep);
|
1994-05-24 10:09:53 +00:00
|
|
|
(void) nfs_send(nmp->nm_so, nmp->nm_nam, m, &myrep);
|
|
|
|
if (nmp->nm_soflags & PR_CONNREQUIRED)
|
1999-02-25 00:03:51 +00:00
|
|
|
nfs_sndunlock(&myrep);
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsmout:
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Called for client side callbacks
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1994-05-24 10:09:53 +00:00
|
|
|
nqnfs_callback(nmp, mrep, md, dpos)
|
|
|
|
struct nfsmount *nmp;
|
|
|
|
struct mbuf *mrep, *md;
|
|
|
|
caddr_t dpos;
|
|
|
|
{
|
|
|
|
register struct vnode *vp;
|
1998-05-31 20:09:01 +00:00
|
|
|
register u_int32_t *tl;
|
|
|
|
register int32_t t1;
|
1995-06-27 11:07:30 +00:00
|
|
|
nfsfh_t nfh;
|
1994-05-24 10:09:53 +00:00
|
|
|
fhandle_t *fhp;
|
|
|
|
struct nfsnode *np;
|
1995-06-27 11:07:30 +00:00
|
|
|
struct nfsd tnfsd;
|
|
|
|
struct nfssvc_sock *slp;
|
|
|
|
struct nfsrv_descript ndesc;
|
|
|
|
register struct nfsrv_descript *nfsd = &ndesc;
|
|
|
|
struct mbuf **mrq = (struct mbuf **)0, *mb, *mreq;
|
|
|
|
int error = 0, cache = 0;
|
|
|
|
char *cp2, *bpos;
|
|
|
|
u_quad_t frev;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
1995-06-27 11:07:30 +00:00
|
|
|
#ifndef nolint
|
|
|
|
slp = NULL;
|
|
|
|
#endif
|
|
|
|
nfsd->nd_mrep = mrep;
|
|
|
|
nfsd->nd_md = md;
|
|
|
|
nfsd->nd_dpos = dpos;
|
|
|
|
error = nfs_getreq(nfsd, &tnfsd, FALSE);
|
1994-10-02 17:27:07 +00:00
|
|
|
if (error)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
1995-06-27 11:07:30 +00:00
|
|
|
md = nfsd->nd_md;
|
|
|
|
dpos = nfsd->nd_dpos;
|
|
|
|
if (nfsd->nd_procnum != NQNFSPROC_EVICTED) {
|
1994-05-24 10:09:53 +00:00
|
|
|
m_freem(mrep);
|
|
|
|
return (EPERM);
|
|
|
|
}
|
|
|
|
fhp = &nfh.fh_generic;
|
|
|
|
nfsm_srvmtofh(fhp);
|
|
|
|
m_freem(mrep);
|
1995-06-27 11:07:30 +00:00
|
|
|
error = nfs_nget(nmp->nm_mountp, (nfsfh_t *)fhp, NFSX_V3FH, &np);
|
1994-10-02 17:27:07 +00:00
|
|
|
if (error)
|
1994-05-24 10:09:53 +00:00
|
|
|
return (error);
|
|
|
|
vp = NFSTOV(np);
|
2000-11-14 08:00:39 +00:00
|
|
|
if (TAILQ_NEXT(np, n_timer) != 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
np->n_expiry = 0;
|
|
|
|
np->n_flag |= NQNFSEVICTED;
|
2000-11-14 08:00:39 +00:00
|
|
|
if (TAILQ_FIRST(&nmp->nm_timerhead) != np) {
|
|
|
|
TAILQ_REMOVE(&nmp->nm_timerhead, np, n_timer);
|
|
|
|
TAILQ_INSERT_HEAD(&nmp->nm_timerhead, np, n_timer);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
vput(vp);
|
1994-05-24 10:09:53 +00:00
|
|
|
nfsm_srvdone;
|
|
|
|
}
|
|
|
|
|
1996-01-13 23:27:58 +00:00
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Nqnfs client helper daemon. Runs once a second to expire leases.
|
|
|
|
* It also get authorization strings for "kerb" mounts.
|
|
|
|
* It must start at the beginning of the list again after any potential
|
|
|
|
* "sleep" since nfs_reclaim() called from vclean() can pull a node off
|
|
|
|
* the list asynchronously.
|
|
|
|
*/
|
1994-05-25 09:21:21 +00:00
|
|
|
int
|
1994-05-24 10:09:53 +00:00
|
|
|
nqnfs_clientd(nmp, cred, ncd, flag, argp, p)
|
|
|
|
register struct nfsmount *nmp;
|
|
|
|
struct ucred *cred;
|
|
|
|
struct nfsd_cargs *ncd;
|
|
|
|
int flag;
|
|
|
|
caddr_t argp;
|
|
|
|
struct proc *p;
|
|
|
|
{
|
|
|
|
register struct nfsnode *np;
|
|
|
|
struct vnode *vp;
|
|
|
|
struct nfsreq myrep;
|
1995-06-27 11:07:30 +00:00
|
|
|
struct nfsuid *nuidp, *nnuidp;
|
1994-05-25 09:21:21 +00:00
|
|
|
int error = 0, vpid;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* First initialize some variables
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If an authorization string is being passed in, get it.
|
|
|
|
*/
|
|
|
|
if ((flag & NFSSVC_GOTAUTH) &&
|
1998-05-19 07:11:27 +00:00
|
|
|
(nmp->nm_state & (NFSSTA_WAITAUTH | NFSSTA_DISMNT)) == 0) {
|
|
|
|
if (nmp->nm_state & NFSSTA_HASAUTH)
|
1995-06-27 11:07:30 +00:00
|
|
|
panic("cld kerb");
|
|
|
|
if ((flag & NFSSVC_AUTHINFAIL) == 0) {
|
|
|
|
if (ncd->ncd_authlen <= nmp->nm_authlen &&
|
|
|
|
ncd->ncd_verflen <= nmp->nm_verflen &&
|
|
|
|
!copyin(ncd->ncd_authstr,nmp->nm_authstr,ncd->ncd_authlen)&&
|
|
|
|
!copyin(ncd->ncd_verfstr,nmp->nm_verfstr,ncd->ncd_verflen)){
|
|
|
|
nmp->nm_authtype = ncd->ncd_authtype;
|
|
|
|
nmp->nm_authlen = ncd->ncd_authlen;
|
|
|
|
nmp->nm_verflen = ncd->ncd_verflen;
|
|
|
|
#ifdef NFSKERB
|
|
|
|
nmp->nm_key = ncd->ncd_key;
|
|
|
|
#endif
|
1994-05-24 10:09:53 +00:00
|
|
|
} else
|
1998-05-19 07:11:27 +00:00
|
|
|
nmp->nm_state |= NFSSTA_AUTHERR;
|
1995-06-27 11:07:30 +00:00
|
|
|
} else
|
1998-05-19 07:11:27 +00:00
|
|
|
nmp->nm_state |= NFSSTA_AUTHERR;
|
|
|
|
nmp->nm_state |= NFSSTA_HASAUTH;
|
1995-06-27 11:07:30 +00:00
|
|
|
wakeup((caddr_t)&nmp->nm_authlen);
|
1994-05-24 10:09:53 +00:00
|
|
|
} else
|
1998-05-19 07:11:27 +00:00
|
|
|
nmp->nm_state |= NFSSTA_WAITAUTH;
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Loop every second updating queue until there is a termination sig.
|
|
|
|
*/
|
1998-05-19 07:11:27 +00:00
|
|
|
while ((nmp->nm_state & NFSSTA_DISMNT) == 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
if (nmp->nm_flag & NFSMNT_NQNFS) {
|
|
|
|
/*
|
|
|
|
* If there are no outstanding requests (and therefore no
|
|
|
|
* processes in nfs_reply) and there is data in the receive
|
|
|
|
* queue, poke for callbacks.
|
|
|
|
*/
|
1994-10-17 17:47:45 +00:00
|
|
|
if (nfs_reqq.tqh_first == 0 && nmp->nm_so &&
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp->nm_so->so_rcv.sb_cc > 0) {
|
|
|
|
myrep.r_flags = R_GETONEREP;
|
|
|
|
myrep.r_nmp = nmp;
|
|
|
|
myrep.r_mrep = (struct mbuf *)0;
|
|
|
|
myrep.r_procp = (struct proc *)0;
|
|
|
|
(void) nfs_reply(&myrep);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Loop through the leases, updating as required.
|
|
|
|
*/
|
2000-11-14 08:00:39 +00:00
|
|
|
while ((np = TAILQ_FIRST(&nmp->nm_timerhead)) != NULL) {
|
|
|
|
if (nmp->nm_state & NFSSTA_DISMINPROG)
|
|
|
|
break;
|
1994-05-24 10:09:53 +00:00
|
|
|
vp = NFSTOV(np);
|
|
|
|
vpid = vp->v_id;
|
1998-03-30 09:56:58 +00:00
|
|
|
if (np->n_expiry < time_second) {
|
1997-02-10 02:22:35 +00:00
|
|
|
if (vget(vp, LK_EXCLUSIVE, p) == 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp->nm_inprog = vp;
|
|
|
|
if (vpid == vp->v_id) {
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_REMOVE(&nmp->nm_timerhead, np, n_timer);
|
|
|
|
TAILQ_NEXT(np, n_timer) = 0;
|
1997-06-03 17:22:47 +00:00
|
|
|
if (np->n_flag & (NMODIFIED | NQNFSEVICTED)) {
|
1994-05-24 10:09:53 +00:00
|
|
|
if (np->n_flag & NQNFSEVICTED) {
|
1997-06-03 17:22:47 +00:00
|
|
|
if (vp->v_type == VDIR)
|
|
|
|
nfs_invaldir(vp);
|
|
|
|
cache_purge(vp);
|
1994-05-24 10:09:53 +00:00
|
|
|
(void) nfs_vinvalbuf(vp,
|
|
|
|
V_SAVE, cred, p, 0);
|
|
|
|
np->n_flag &= ~NQNFSEVICTED;
|
|
|
|
(void) nqnfs_vacated(vp, cred);
|
1997-06-03 17:22:47 +00:00
|
|
|
} else if (vp->v_type == VREG) {
|
1994-05-24 10:09:53 +00:00
|
|
|
(void) VOP_FSYNC(vp, cred,
|
|
|
|
MNT_WAIT, p);
|
|
|
|
np->n_flag &= ~NMODIFIED;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
1999-06-16 18:35:58 +00:00
|
|
|
vput(vp);
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp->nm_inprog = NULLVP;
|
|
|
|
}
|
1998-03-30 09:56:58 +00:00
|
|
|
} else if ((np->n_expiry - NQ_RENEWAL) < time_second) {
|
1994-05-24 10:09:53 +00:00
|
|
|
if ((np->n_flag & (NQNFSWRITE | NQNFSNONCACHE))
|
1998-10-31 15:31:29 +00:00
|
|
|
== NQNFSWRITE &&
|
|
|
|
!TAILQ_EMPTY(&vp->v_dirtyblkhd) &&
|
1997-02-10 02:22:35 +00:00
|
|
|
vget(vp, LK_EXCLUSIVE, p) == 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp->nm_inprog = vp;
|
|
|
|
if (vpid == vp->v_id &&
|
1995-06-27 11:07:30 +00:00
|
|
|
nqnfs_getlease(vp, ND_WRITE, cred, p)==0)
|
1994-05-24 10:09:53 +00:00
|
|
|
np->n_brev = np->n_lrev;
|
1999-06-16 18:35:58 +00:00
|
|
|
vput(vp);
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp->nm_inprog = NULLVP;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Get an authorization string, if required.
|
|
|
|
*/
|
1998-05-19 07:11:27 +00:00
|
|
|
if ((nmp->nm_state & (NFSSTA_WAITAUTH | NFSSTA_DISMNT | NFSSTA_HASAUTH)) == 0) {
|
1994-05-24 10:09:53 +00:00
|
|
|
ncd->ncd_authuid = nmp->nm_authuid;
|
|
|
|
if (copyout((caddr_t)ncd, argp, sizeof (struct nfsd_cargs)))
|
1998-05-19 07:11:27 +00:00
|
|
|
nmp->nm_state |= NFSSTA_WAITAUTH;
|
1994-05-24 10:09:53 +00:00
|
|
|
else
|
|
|
|
return (ENEEDAUTH);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Wait a bit (no pun) and do it again.
|
|
|
|
*/
|
1998-05-19 07:11:27 +00:00
|
|
|
if ((nmp->nm_state & NFSSTA_DISMNT) == 0 &&
|
|
|
|
(nmp->nm_state & (NFSSTA_WAITAUTH | NFSSTA_HASAUTH))) {
|
1994-05-24 10:09:53 +00:00
|
|
|
error = tsleep((caddr_t)&nmp->nm_authstr, PSOCK | PCATCH,
|
|
|
|
"nqnfstimr", hz / 3);
|
|
|
|
if (error == EINTR || error == ERESTART)
|
|
|
|
(void) dounmount(nmp->nm_mountp, 0, p);
|
|
|
|
}
|
|
|
|
}
|
1995-06-27 11:07:30 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Finally, we can free up the mount structure.
|
|
|
|
*/
|
|
|
|
for (nuidp = nmp->nm_uidlruhead.tqh_first; nuidp != 0; nuidp = nnuidp) {
|
|
|
|
nnuidp = nuidp->nu_lru.tqe_next;
|
|
|
|
LIST_REMOVE(nuidp, nu_hash);
|
|
|
|
TAILQ_REMOVE(&nmp->nm_uidlruhead, nuidp, nu_lru);
|
|
|
|
free((caddr_t)nuidp, M_NFSUID);
|
|
|
|
}
|
1998-05-24 14:41:56 +00:00
|
|
|
zfree(nfsmount_zone, nmp);
|
1994-05-24 10:09:53 +00:00
|
|
|
if (error == EWOULDBLOCK)
|
|
|
|
error = 0;
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
1996-01-13 23:27:58 +00:00
|
|
|
#endif /* NFS_NOSERVER */
|
|
|
|
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Adjust all timer queue expiry times when the time of day clock is changed.
|
|
|
|
* Called from the settimeofday() syscall.
|
|
|
|
*/
|
|
|
|
void
|
1995-06-27 11:07:30 +00:00
|
|
|
nqnfs_lease_updatetime(deltat)
|
1994-05-24 10:09:53 +00:00
|
|
|
register int deltat;
|
|
|
|
{
|
1997-02-10 02:22:35 +00:00
|
|
|
struct proc *p = curproc; /* XXX */
|
|
|
|
struct nqlease *lp;
|
|
|
|
struct nfsnode *np;
|
|
|
|
struct mount *mp, *nxtmp;
|
1994-05-24 10:09:53 +00:00
|
|
|
struct nfsmount *nmp;
|
|
|
|
int s;
|
|
|
|
|
|
|
|
if (nqnfsstarttime != 0)
|
|
|
|
nqnfsstarttime += deltat;
|
|
|
|
s = splsoftclock();
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_FOREACH(lp, &nqtimerhead, lc_timer)
|
1994-05-24 10:09:53 +00:00
|
|
|
lp->lc_expiry += deltat;
|
|
|
|
splx(s);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Search the mount list for all nqnfs mounts and do their timer
|
|
|
|
* queues.
|
|
|
|
*/
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mountlist_mtx);
|
1999-11-20 10:00:46 +00:00
|
|
|
for (mp = TAILQ_FIRST(&mountlist); mp != NULL; mp = nxtmp) {
|
2000-10-04 01:29:17 +00:00
|
|
|
if (vfs_busy(mp, LK_NOWAIT, &mountlist_mtx, p)) {
|
1999-11-20 10:00:46 +00:00
|
|
|
nxtmp = TAILQ_NEXT(mp, mnt_list);
|
1997-02-10 02:22:35 +00:00
|
|
|
continue;
|
|
|
|
}
|
|
|
|
if (mp->mnt_stat.f_type == nfs_mount_type) {
|
1994-05-24 10:09:53 +00:00
|
|
|
nmp = VFSTONFS(mp);
|
|
|
|
if (nmp->nm_flag & NFSMNT_NQNFS) {
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_FOREACH(np, &nmp->nm_timerhead, n_timer) {
|
1994-05-24 10:09:53 +00:00
|
|
|
np->n_expiry += deltat;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_lock(&mountlist_mtx);
|
1999-11-20 10:00:46 +00:00
|
|
|
nxtmp = TAILQ_NEXT(mp, mnt_list);
|
1997-02-10 02:22:35 +00:00
|
|
|
vfs_unbusy(mp, p);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
Change and clean the mutex lock interface.
mtx_enter(lock, type) becomes:
mtx_lock(lock) for sleep locks (MTX_DEF-initialized locks)
mtx_lock_spin(lock) for spin locks (MTX_SPIN-initialized)
similarily, for releasing a lock, we now have:
mtx_unlock(lock) for MTX_DEF and mtx_unlock_spin(lock) for MTX_SPIN.
We change the caller interface for the two different types of locks
because the semantics are entirely different for each case, and this
makes it explicitly clear and, at the same time, it rids us of the
extra `type' argument.
The enter->lock and exit->unlock change has been made with the idea
that we're "locking data" and not "entering locked code" in mind.
Further, remove all additional "flags" previously passed to the
lock acquire/release routines with the exception of two:
MTX_QUIET and MTX_NOSWITCH
The functionality of these flags is preserved and they can be passed
to the lock/unlock routines by calling the corresponding wrappers:
mtx_{lock, unlock}_flags(lock, flag(s)) and
mtx_{lock, unlock}_spin_flags(lock, flag(s)) for MTX_DEF and MTX_SPIN
locks, respectively.
Re-inline some lock acq/rel code; in the sleep lock case, we only
inline the _obtain_lock()s in order to ensure that the inlined code
fits into a cache line. In the spin lock case, we inline recursion and
actually only perform a function call if we need to spin. This change
has been made with the idea that we generally tend to avoid spin locks
and that also the spin locks that we do have and are heavily used
(i.e. sched_lock) do recurse, and therefore in an effort to reduce
function call overhead for some architectures (such as alpha), we
inline recursion for this case.
Create a new malloc type for the witness code and retire from using
the M_DEV type. The new type is called M_WITNESS and is only declared
if WITNESS is enabled.
Begin cleaning up some machdep/mutex.h code - specifically updated the
"optimized" inlined code in alpha/mutex.h and wrote MTX_LOCK_SPIN
and MTX_UNLOCK_SPIN asm macros for the i386/mutex.h as we presently
need those.
Finally, caught up to the interface changes in all sys code.
Contributors: jake, jhb, jasone (in no particular order)
2001-02-09 06:11:45 +00:00
|
|
|
mtx_unlock(&mountlist_mtx);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
|
1999-02-25 00:03:51 +00:00
|
|
|
#ifndef NFS_NOSERVER
|
1994-05-24 10:09:53 +00:00
|
|
|
/*
|
|
|
|
* Lock a server lease.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_locklease(lp)
|
|
|
|
struct nqlease *lp;
|
|
|
|
{
|
|
|
|
|
|
|
|
while (lp->lc_flag & LC_LOCKED) {
|
|
|
|
lp->lc_flag |= LC_WANTED;
|
|
|
|
(void) tsleep((caddr_t)lp, PSOCK, "nqlc", 0);
|
|
|
|
}
|
|
|
|
lp->lc_flag |= LC_LOCKED;
|
|
|
|
lp->lc_flag &= ~LC_WANTED;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unlock a server lease.
|
|
|
|
*/
|
1995-12-17 21:14:36 +00:00
|
|
|
static void
|
1994-05-24 10:09:53 +00:00
|
|
|
nqsrv_unlocklease(lp)
|
|
|
|
struct nqlease *lp;
|
|
|
|
{
|
|
|
|
|
|
|
|
lp->lc_flag &= ~LC_LOCKED;
|
|
|
|
if (lp->lc_flag & LC_WANTED)
|
|
|
|
wakeup((caddr_t)lp);
|
|
|
|
}
|
1999-02-25 00:03:51 +00:00
|
|
|
#endif /* NFS_NOSERVER */
|
1994-05-24 10:09:53 +00:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Update a client lease.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
nqnfs_clientlease(nmp, np, rwflag, cachable, expiry, frev)
|
|
|
|
register struct nfsmount *nmp;
|
|
|
|
register struct nfsnode *np;
|
|
|
|
int rwflag, cachable;
|
|
|
|
time_t expiry;
|
|
|
|
u_quad_t frev;
|
|
|
|
{
|
|
|
|
register struct nfsnode *tp;
|
|
|
|
|
2000-11-14 08:00:39 +00:00
|
|
|
if (TAILQ_NEXT(np, n_timer) != 0) {
|
|
|
|
TAILQ_REMOVE(&nmp->nm_timerhead, np, n_timer);
|
1995-06-27 11:07:30 +00:00
|
|
|
if (rwflag == ND_WRITE)
|
1994-05-24 10:09:53 +00:00
|
|
|
np->n_flag |= NQNFSWRITE;
|
1995-06-27 11:07:30 +00:00
|
|
|
} else if (rwflag == ND_READ)
|
1994-05-24 10:09:53 +00:00
|
|
|
np->n_flag &= ~NQNFSWRITE;
|
|
|
|
else
|
|
|
|
np->n_flag |= NQNFSWRITE;
|
|
|
|
if (cachable)
|
|
|
|
np->n_flag &= ~NQNFSNONCACHE;
|
|
|
|
else
|
|
|
|
np->n_flag |= NQNFSNONCACHE;
|
|
|
|
np->n_expiry = expiry;
|
|
|
|
np->n_lrev = frev;
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_FOREACH_REVERSE(tp, &nmp->nm_timerhead, timhd, n_timer)
|
|
|
|
if (tp->n_expiry <= np->n_expiry)
|
|
|
|
break;
|
|
|
|
if (tp == NULL) {
|
|
|
|
TAILQ_INSERT_HEAD(&nmp->nm_timerhead, np, n_timer);
|
1994-05-24 10:09:53 +00:00
|
|
|
} else {
|
2000-11-14 08:00:39 +00:00
|
|
|
TAILQ_INSERT_AFTER(&nmp->nm_timerhead, tp, np, n_timer);
|
1994-05-24 10:09:53 +00:00
|
|
|
}
|
|
|
|
}
|