|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved. ! 3: * ! 4: * @APPLE_LICENSE_HEADER_START@ ! 5: * ! 6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights ! 7: * Reserved. This file contains Original Code and/or Modifications of ! 8: * Original Code as defined in and that are subject to the Apple Public ! 9: * Source License Version 1.1 (the "License"). You may not use this file ! 10: * except in compliance with the License. Please obtain a copy of the ! 11: * License at http://www.apple.com/publicsource and read it before using ! 12: * this file. ! 13: * ! 14: * The Original Code and all software distributed under the License are ! 15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER ! 16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, ! 17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, ! 18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the ! 19: * License for the specific language governing rights and limitations ! 20: * under the License. ! 21: * ! 22: * @APPLE_LICENSE_HEADER_END@ ! 23: */ ! 24: ! 25: /* Copyright (c) 1995 NeXT Computer, Inc. All Rights Reserved */ ! 26: /* ! 27: * Copyright (c) 1989, 1993 ! 28: * The Regents of the University of California. All rights reserved. ! 29: * ! 30: * This code is derived from software contributed to Berkeley by ! 31: * Rick Macklem at The University of Guelph. ! 32: * ! 33: * Redistribution and use in source and binary forms, with or without ! 34: * modification, are permitted provided that the following conditions ! 35: * are met: ! 36: * 1. Redistributions of source code must retain the above copyright ! 37: * notice, this list of conditions and the following disclaimer. ! 38: * 2. Redistributions in binary form must reproduce the above copyright ! 39: * notice, this list of conditions and the following disclaimer in the ! 40: * documentation and/or other materials provided with the distribution. ! 41: * 3. All advertising materials mentioning features or use of this software ! 42: * must display the following acknowledgement: ! 43: * This product includes software developed by the University of ! 44: * California, Berkeley and its contributors. ! 45: * 4. Neither the name of the University nor the names of its contributors ! 46: * may be used to endorse or promote products derived from this software ! 47: * without specific prior written permission. ! 48: * ! 49: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND ! 50: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE ! 51: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ! 52: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE ! 53: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL ! 54: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS ! 55: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) ! 56: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT ! 57: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY ! 58: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF ! 59: * SUCH DAMAGE. ! 60: * ! 61: * @(#)nfsmount.h 8.3 (Berkeley) 3/30/95 ! 62: * FreeBSD-Id: nfsmount.h,v 1.13 1997/08/16 19:16:05 wollman Exp $ ! 63: */ ! 64: ! 65: ! 66: #ifndef _NFS_NFSMOUNT_H_ ! 67: #define _NFS_NFSMOUNT_H_ ! 68: ! 69: /* ! 70: * Mount structure. ! 71: * One allocated on every NFS mount. ! 72: * Holds NFS specific information for mount. ! 73: */ ! 74: struct nfsmount { ! 75: int nm_flag; /* Flags for soft/hard... */ ! 76: struct mount *nm_mountp; /* Vfs structure for this filesystem */ ! 77: int nm_numgrps; /* Max. size of groupslist */ ! 78: u_char nm_fh[NFSX_V3FHMAX]; /* File handle of root dir */ ! 79: int nm_fhsize; /* Size of root file handle */ ! 80: struct socket *nm_so; /* Rpc socket */ ! 81: int nm_sotype; /* Type of socket */ ! 82: int nm_soproto; /* and protocol */ ! 83: int nm_soflags; /* pr_flags for socket protocol */ ! 84: struct mbuf *nm_nam; /* Addr of server */ ! 85: int nm_timeo; /* Init timer for NFSMNT_DUMBTIMR */ ! 86: int nm_retry; /* Max retries */ ! 87: int nm_srtt[4]; /* Timers for rpcs */ ! 88: int nm_sdrtt[4]; ! 89: int nm_sent; /* Request send count */ ! 90: int nm_cwnd; /* Request send window */ ! 91: int nm_timeouts; /* Request timeouts */ ! 92: int nm_deadthresh; /* Threshold of timeouts-->dead server*/ ! 93: int nm_rsize; /* Max size of read rpc */ ! 94: int nm_wsize; /* Max size of write rpc */ ! 95: int nm_readdirsize; /* Size of a readdir rpc */ ! 96: int nm_readahead; /* Num. of blocks to readahead */ ! 97: int nm_leaseterm; /* Term (sec) for NQNFS lease */ ! 98: CIRCLEQ_HEAD(, nfsnode) nm_timerhead; /* Head of lease timer queue */ ! 99: struct vnode *nm_inprog; /* Vnode in prog by nqnfs_clientd() */ ! 100: uid_t nm_authuid; /* Uid for authenticator */ ! 101: int nm_authtype; /* Authenticator type */ ! 102: int nm_authlen; /* and length */ ! 103: char *nm_authstr; /* Authenticator string */ ! 104: char *nm_verfstr; /* and the verifier */ ! 105: int nm_verflen; ! 106: u_char nm_verf[NFSX_V3WRITEVERF]; /* V3 write verifier */ ! 107: NFSKERBKEY_T nm_key; /* and the session key */ ! 108: int nm_numuids; /* Number of nfsuid mappings */ ! 109: TAILQ_HEAD(, nfsuid) nm_uidlruhead; /* Lists of nfsuid mappings */ ! 110: LIST_HEAD(, nfsuid) nm_uidhashtbl[NFS_MUIDHASHSIZ]; ! 111: TAILQ_HEAD(, buf) nm_bufq; /* async io buffer queue */ ! 112: short nm_bufqlen; /* number of buffers in queue */ ! 113: short nm_bufqwant; /* process wants to add to the queue */ ! 114: int nm_bufqiods; /* number of iods processing queue */ ! 115: }; ! 116: ! 117: #if defined(KERNEL) || defined(_KERNEL) ! 118: /* ! 119: * Convert mount ptr to nfsmount ptr. ! 120: */ ! 121: #define VFSTONFS(mp) ((struct nfsmount *)((mp)->mnt_data)) ! 122: ! 123: #endif /* KERNEL */ ! 124: ! 125: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.