386BSD 0.1 development
[unix-history] / usr / src / sys.386bsd / nfs / nfsrvcache.h
CommitLineData
b688fc87
WJ
1/*
2 * Copyright (c) 1989 The Regents of the University of California.
3 * 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 7.3 (Berkeley) 6/28/90
37 */
38
39/*
40 * Definitions for the server recent request cache
41 */
42
43#define NFSRVCACHESIZ 128
44#define NFSRCHSZ 32
45
46struct nfsrvcache {
47 struct nfsrvcache *rc_chain[2]; /* Hash chain links */
48 struct nfsrvcache *rc_next; /* Lru list */
49 struct nfsrvcache *rc_prev;
50 int rc_state; /* Current state of request */
51 int rc_flag; /* Flag bits */
52 struct mbuf rc_nam; /* Sockaddr of requestor */
53 u_long rc_xid; /* rpc id number */
54 int rc_proc; /* rpc proc number */
55 long rc_timestamp; /* Time stamp */
56 union {
57 struct mbuf *rc_repmb; /* Reply mbuf list OR */
58 int rc_repstat; /* Reply status */
59 } rc_un;
60};
61
62#define rc_forw rc_chain[0]
63#define rc_back rc_chain[1]
64#define rc_status rc_un.rc_repstat
65#define rc_reply rc_un.rc_repmb
66
67#define put_at_head(rp) \
68 (rp)->rc_prev->rc_next = (rp)->rc_next; \
69 (rp)->rc_next->rc_prev = (rp)->rc_prev; \
70 (rp)->rc_next = nfsrvcachehead.rc_next; \
71 (rp)->rc_next->rc_prev = (rp); \
72 nfsrvcachehead.rc_next = (rp); \
73 (rp)->rc_prev = &nfsrvcachehead
74
75/* Cache entry states */
76#define RC_UNUSED 0
77#define RC_INPROG 1
78#define RC_DONE 2
79
80/* Return values */
81#define RC_DROPIT 0
82#define RC_REPLY 1
83#define RC_DOIT 2
84
85/* Flag bits */
86#define RC_LOCKED 0x1
87#define RC_WANTED 0x2
88#define RC_REPSTATUS 0x4
89#define RC_REPMBUF 0x8
90
91/* Delay time after completion that request is dropped */
92#define RC_DELAY 2 /* seconds */
93