Deleted Added
sdiff udiff text old ( 60938 ) new ( 83651 )
full compact
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 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 *
36 * @(#)nfsrvcache.h 8.3 (Berkeley) 3/30/95
37 * $FreeBSD: head/sys/nfsserver/nfsrvcache.h 60938 2000-05-26 02:09:24Z jake $
37 * $FreeBSD: head/sys/nfsserver/nfsrvcache.h 83651 2001-09-18 23:32:09Z peter $
38 */
39
40#ifndef _NFSSERVER_NFSRVCACHE_H_
41#define _NFSSERVER_NFSRVCACHE_H_
42
41#ifndef _NFS_NFSRVCACHE_H_
42#define _NFS_NFSRVCACHE_H_
43
43#include <sys/queue.h>
44
45/*
46 * Definitions for the server recent request cache
47 */
48
49#define NFSRVCACHESIZ 64
50
51struct nfsrvcache {
52 TAILQ_ENTRY(nfsrvcache) rc_lru; /* LRU chain */
53 LIST_ENTRY(nfsrvcache) rc_hash; /* Hash chain */
54 u_int32_t rc_xid; /* rpc id number */
55 union {
56 struct mbuf *ru_repmb; /* Reply mbuf list OR */
57 int ru_repstat; /* Reply status */
58 } rc_un;
59 union nethostaddr rc_haddr; /* Host address */
60 u_int32_t rc_proc; /* rpc proc number */
61 u_char rc_state; /* Current state of request */
62 u_char rc_flag; /* Flag bits */
63};
64
65#define rc_reply rc_un.ru_repmb
66#define rc_status rc_un.ru_repstat
67#define rc_inetaddr rc_haddr.had_inetaddr
68#define rc_nam rc_haddr.had_nam
69
70/* Cache entry states */
71#define RC_UNUSED 0
72#define RC_INPROG 1
73#define RC_DONE 2
74
75/* Return values */
76#define RC_DROPIT 0
77#define RC_REPLY 1
78#define RC_DOIT 2
80#define RC_CHECKIT 3
79
80/* Flag bits */
81#define RC_LOCKED 0x01
82#define RC_WANTED 0x02
83#define RC_REPSTATUS 0x04
84#define RC_REPMBUF 0x08
87#define RC_NQNFS 0x10
85/* free 0x10 */
86#define RC_INETADDR 0x20
87#define RC_NAM 0x40
88
89#endif