cache.h 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309
  1. /*
  2. * include/linux/sunrpc/cache.h
  3. *
  4. * Generic code for various authentication-related caches
  5. * used by sunrpc clients and servers.
  6. *
  7. * Copyright (C) 2002 Neil Brown <neilb@cse.unsw.edu.au>
  8. *
  9. * Released under terms in GPL version 2. See COPYING.
  10. *
  11. */
  12. #ifndef _LINUX_SUNRPC_CACHE_H_
  13. #define _LINUX_SUNRPC_CACHE_H_
  14. #include <linux/kref.h>
  15. #include <linux/slab.h>
  16. #include <linux/atomic.h>
  17. #include <linux/proc_fs.h>
  18. /*
  19. * Each cache requires:
  20. * - A 'struct cache_detail' which contains information specific to the cache
  21. * for common code to use.
  22. * - An item structure that must contain a "struct cache_head"
  23. * - A lookup function defined using DefineCacheLookup
  24. * - A 'put' function that can release a cache item. It will only
  25. * be called after cache_put has succeed, so there are guarantee
  26. * to be no references.
  27. * - A function to calculate a hash of an item's key.
  28. *
  29. * as well as assorted code fragments (e.g. compare keys) and numbers
  30. * (e.g. hash size, goal_age, etc).
  31. *
  32. * Each cache must be registered so that it can be cleaned regularly.
  33. * When the cache is unregistered, it is flushed completely.
  34. *
  35. * Entries have a ref count and a 'hashed' flag which counts the existence
  36. * in the hash table.
  37. * We only expire entries when refcount is zero.
  38. * Existence in the cache is counted the refcount.
  39. */
  40. /* Every cache item has a common header that is used
  41. * for expiring and refreshing entries.
  42. *
  43. */
  44. struct cache_head {
  45. struct hlist_node cache_list;
  46. time_t expiry_time; /* After time time, don't use the data */
  47. time_t last_refresh; /* If CACHE_PENDING, this is when upcall was
  48. * sent, else this is when update was
  49. * received, though it is alway set to
  50. * be *after* ->flush_time.
  51. */
  52. struct kref ref;
  53. unsigned long flags;
  54. };
  55. #define CACHE_VALID 0 /* Entry contains valid data */
  56. #define CACHE_NEGATIVE 1 /* Negative entry - there is no match for the key */
  57. #define CACHE_PENDING 2 /* An upcall has been sent but no reply received yet*/
  58. #define CACHE_CLEANED 3 /* Entry has been cleaned from cache */
  59. #define CACHE_NEW_EXPIRY 120 /* keep new things pending confirmation for 120 seconds */
  60. struct cache_detail_procfs {
  61. struct proc_dir_entry *proc_ent;
  62. struct proc_dir_entry *flush_ent, *channel_ent, *content_ent;
  63. };
  64. struct cache_detail_pipefs {
  65. struct dentry *dir;
  66. };
  67. struct cache_detail {
  68. struct module * owner;
  69. int hash_size;
  70. struct hlist_head * hash_table;
  71. rwlock_t hash_lock;
  72. atomic_t inuse; /* active user-space update or lookup */
  73. char *name;
  74. void (*cache_put)(struct kref *);
  75. int (*cache_upcall)(struct cache_detail *,
  76. struct cache_head *);
  77. void (*cache_request)(struct cache_detail *cd,
  78. struct cache_head *ch,
  79. char **bpp, int *blen);
  80. int (*cache_parse)(struct cache_detail *,
  81. char *buf, int len);
  82. int (*cache_show)(struct seq_file *m,
  83. struct cache_detail *cd,
  84. struct cache_head *h);
  85. void (*warn_no_listener)(struct cache_detail *cd,
  86. int has_died);
  87. struct cache_head * (*alloc)(void);
  88. int (*match)(struct cache_head *orig, struct cache_head *new);
  89. void (*init)(struct cache_head *orig, struct cache_head *new);
  90. void (*update)(struct cache_head *orig, struct cache_head *new);
  91. /* fields below this comment are for internal use
  92. * and should not be touched by cache owners
  93. */
  94. time_t flush_time; /* flush all cache items with
  95. * last_refresh at or earlier
  96. * than this. last_refresh
  97. * is never set at or earlier
  98. * than this.
  99. */
  100. struct list_head others;
  101. time_t nextcheck;
  102. int entries;
  103. /* fields for communication over channel */
  104. struct list_head queue;
  105. atomic_t readers; /* how many time is /chennel open */
  106. time_t last_close; /* if no readers, when did last close */
  107. time_t last_warn; /* when we last warned about no readers */
  108. union {
  109. struct cache_detail_procfs procfs;
  110. struct cache_detail_pipefs pipefs;
  111. } u;
  112. struct net *net;
  113. };
  114. /* this must be embedded in any request structure that
  115. * identifies an object that will want a callback on
  116. * a cache fill
  117. */
  118. struct cache_req {
  119. struct cache_deferred_req *(*defer)(struct cache_req *req);
  120. int thread_wait; /* How long (jiffies) we can block the
  121. * current thread to wait for updates.
  122. */
  123. };
  124. /* this must be embedded in a deferred_request that is being
  125. * delayed awaiting cache-fill
  126. */
  127. struct cache_deferred_req {
  128. struct hlist_node hash; /* on hash chain */
  129. struct list_head recent; /* on fifo */
  130. struct cache_head *item; /* cache item we wait on */
  131. void *owner; /* we might need to discard all defered requests
  132. * owned by someone */
  133. void (*revisit)(struct cache_deferred_req *req,
  134. int too_many);
  135. };
  136. /*
  137. * timestamps kept in the cache are expressed in seconds
  138. * since boot. This is the best for measuring differences in
  139. * real time.
  140. */
  141. static inline time_t seconds_since_boot(void)
  142. {
  143. struct timespec boot;
  144. getboottime(&boot);
  145. return get_seconds() - boot.tv_sec;
  146. }
  147. static inline time_t convert_to_wallclock(time_t sinceboot)
  148. {
  149. struct timespec boot;
  150. getboottime(&boot);
  151. return boot.tv_sec + sinceboot;
  152. }
  153. extern const struct file_operations cache_file_operations_pipefs;
  154. extern const struct file_operations content_file_operations_pipefs;
  155. extern const struct file_operations cache_flush_operations_pipefs;
  156. extern struct cache_head *
  157. sunrpc_cache_lookup(struct cache_detail *detail,
  158. struct cache_head *key, int hash);
  159. extern struct cache_head *
  160. sunrpc_cache_update(struct cache_detail *detail,
  161. struct cache_head *new, struct cache_head *old, int hash);
  162. extern int
  163. sunrpc_cache_pipe_upcall(struct cache_detail *detail, struct cache_head *h);
  164. extern void cache_clean_deferred(void *owner);
  165. static inline struct cache_head *cache_get(struct cache_head *h)
  166. {
  167. kref_get(&h->ref);
  168. return h;
  169. }
  170. static inline void cache_put(struct cache_head *h, struct cache_detail *cd)
  171. {
  172. if (atomic_read(&h->ref.refcount) <= 2 &&
  173. h->expiry_time < cd->nextcheck)
  174. cd->nextcheck = h->expiry_time;
  175. kref_put(&h->ref, cd->cache_put);
  176. }
  177. static inline int cache_is_expired(struct cache_detail *detail, struct cache_head *h)
  178. {
  179. return (h->expiry_time < seconds_since_boot()) ||
  180. (detail->flush_time >= h->last_refresh);
  181. }
  182. extern int cache_check(struct cache_detail *detail,
  183. struct cache_head *h, struct cache_req *rqstp);
  184. extern void cache_flush(void);
  185. extern void cache_purge(struct cache_detail *detail);
  186. #define NEVER (0x7FFFFFFF)
  187. extern void __init cache_initialize(void);
  188. extern int cache_register_net(struct cache_detail *cd, struct net *net);
  189. extern void cache_unregister_net(struct cache_detail *cd, struct net *net);
  190. extern struct cache_detail *cache_create_net(struct cache_detail *tmpl, struct net *net);
  191. extern void cache_destroy_net(struct cache_detail *cd, struct net *net);
  192. extern void sunrpc_init_cache_detail(struct cache_detail *cd);
  193. extern void sunrpc_destroy_cache_detail(struct cache_detail *cd);
  194. extern int sunrpc_cache_register_pipefs(struct dentry *parent, const char *,
  195. umode_t, struct cache_detail *);
  196. extern void sunrpc_cache_unregister_pipefs(struct cache_detail *);
  197. /* Must store cache_detail in seq_file->private if using next three functions */
  198. extern void *cache_seq_start(struct seq_file *file, loff_t *pos);
  199. extern void *cache_seq_next(struct seq_file *file, void *p, loff_t *pos);
  200. extern void cache_seq_stop(struct seq_file *file, void *p);
  201. extern void qword_add(char **bpp, int *lp, char *str);
  202. extern void qword_addhex(char **bpp, int *lp, char *buf, int blen);
  203. extern int qword_get(char **bpp, char *dest, int bufsize);
  204. static inline int get_int(char **bpp, int *anint)
  205. {
  206. char buf[50];
  207. char *ep;
  208. int rv;
  209. int len = qword_get(bpp, buf, sizeof(buf));
  210. if (len < 0)
  211. return -EINVAL;
  212. if (len == 0)
  213. return -ENOENT;
  214. rv = simple_strtol(buf, &ep, 0);
  215. if (*ep)
  216. return -EINVAL;
  217. *anint = rv;
  218. return 0;
  219. }
  220. static inline int get_uint(char **bpp, unsigned int *anint)
  221. {
  222. char buf[50];
  223. int len = qword_get(bpp, buf, sizeof(buf));
  224. if (len < 0)
  225. return -EINVAL;
  226. if (len == 0)
  227. return -ENOENT;
  228. if (kstrtouint(buf, 0, anint))
  229. return -EINVAL;
  230. return 0;
  231. }
  232. static inline int get_time(char **bpp, time_t *time)
  233. {
  234. char buf[50];
  235. long long ll;
  236. int len = qword_get(bpp, buf, sizeof(buf));
  237. if (len < 0)
  238. return -EINVAL;
  239. if (len == 0)
  240. return -ENOENT;
  241. if (kstrtoll(buf, 0, &ll))
  242. return -EINVAL;
  243. *time = (time_t)ll;
  244. return 0;
  245. }
  246. static inline time_t get_expiry(char **bpp)
  247. {
  248. time_t rv;
  249. struct timespec boot;
  250. if (get_time(bpp, &rv))
  251. return 0;
  252. if (rv < 0)
  253. return 0;
  254. getboottime(&boot);
  255. return rv - boot.tv_sec;
  256. }
  257. #endif /* _LINUX_SUNRPC_CACHE_H_ */