blob: dd96a38300040fd1da2566117233893f7eec1507 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Request reply cache. This was heavily inspired by the
3 * implementation in 4.3BSD/4.4BSD.
4 *
5 * Copyright (C) 1995, 1996 Olaf Kirch <okir@monad.swb.de>
6 */
7
8#ifndef NFSCACHE_H
9#define NFSCACHE_H
10
Boaz Harrosh72579ac2009-12-03 20:28:59 +020011#include <linux/sunrpc/svc.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070012
13/*
Greg Banksfca42172009-04-01 07:28:13 +110014 * Representation of a reply cache entry.
Jeff Layton7b9e8522013-01-28 14:41:07 -050015 *
16 * Note that we use a sockaddr_in6 to hold the address instead of the more
17 * typical sockaddr_storage. This is for space reasons, since sockaddr_storage
18 * is much larger than a sockaddr_in6.
Linus Torvalds1da177e2005-04-16 15:20:36 -070019 */
20struct svc_cacherep {
Linus Torvalds1da177e2005-04-16 15:20:36 -070021 struct list_head c_lru;
22
23 unsigned char c_state, /* unused, inprog, done */
24 c_type, /* status, buffer */
25 c_secure : 1; /* req came from port < 1024 */
Jeff Layton7b9e8522013-01-28 14:41:07 -050026 struct sockaddr_in6 c_addr;
Al Viroc7afef12006-10-19 23:29:02 -070027 __be32 c_xid;
Linus Torvalds1da177e2005-04-16 15:20:36 -070028 u32 c_prot;
29 u32 c_proc;
30 u32 c_vers;
Jeff Layton01a7dec2013-02-04 11:57:27 -050031 unsigned int c_len;
32 __wsum c_csum;
Linus Torvalds1da177e2005-04-16 15:20:36 -070033 unsigned long c_timestamp;
34 union {
35 struct kvec u_vec;
Al Viroc7afef12006-10-19 23:29:02 -070036 __be32 u_status;
Linus Torvalds1da177e2005-04-16 15:20:36 -070037 } c_u;
38};
39
40#define c_replvec c_u.u_vec
41#define c_replstat c_u.u_status
42
43/* cache entry states */
44enum {
45 RC_UNUSED,
46 RC_INPROG,
47 RC_DONE
48};
49
50/* return values */
51enum {
52 RC_DROPIT,
53 RC_REPLY,
Jeff Layton09662d52013-01-28 14:41:09 -050054 RC_DOIT
Linus Torvalds1da177e2005-04-16 15:20:36 -070055};
56
57/*
58 * Cache types.
59 * We may want to add more types one day, e.g. for diropres and
60 * attrstat replies. Using cache entries with fixed length instead
61 * of buffer pointers may be more efficient.
62 */
63enum {
64 RC_NOCACHE,
65 RC_REPLSTAT,
66 RC_REPLBUFF,
67};
68
69/*
70 * If requests are retransmitted within this interval, they're dropped.
71 */
72#define RC_DELAY (HZ/5)
73
Jeff Laytond1a07742013-01-28 14:41:13 -050074/* Cache entries expire after this time period */
75#define RC_EXPIRE (120 * HZ)
76
Jeff Layton01a7dec2013-02-04 11:57:27 -050077/* Checksum this amount of the request */
78#define RC_CSUMLEN (256U)
79
J. Bruce Fieldsd5c34282007-11-09 14:10:56 -050080int nfsd_reply_cache_init(void);
81void nfsd_reply_cache_shutdown(void);
J. Bruce Fields10910062011-01-24 12:11:02 -050082int nfsd_cache_lookup(struct svc_rqst *);
Al Viroc7afef12006-10-19 23:29:02 -070083void nfsd_cache_update(struct svc_rqst *, int, __be32 *);
Jeff Laytona2f999a2013-03-27 10:15:38 -040084int nfsd_reply_cache_stats_open(struct inode *, struct file *);
Benny Halevy04826f42009-04-06 12:00:49 +030085
Linus Torvalds1da177e2005-04-16 15:20:36 -070086#endif /* NFSCACHE_H */