blob: a72de074172d81a031305dae2f1551b22d9ced36 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * net/sunrpc/cache.c
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
13#include <linux/types.h>
14#include <linux/fs.h>
15#include <linux/file.h>
16#include <linux/slab.h>
17#include <linux/signal.h>
18#include <linux/sched.h>
19#include <linux/kmod.h>
20#include <linux/list.h>
21#include <linux/module.h>
22#include <linux/ctype.h>
23#include <asm/uaccess.h>
24#include <linux/poll.h>
25#include <linux/seq_file.h>
26#include <linux/proc_fs.h>
27#include <linux/net.h>
28#include <linux/workqueue.h>
Arjan van de Ven4a3e2f72006-03-20 22:33:17 -080029#include <linux/mutex.h>
Trond Myklebustda770052009-08-09 15:14:28 -040030#include <linux/pagemap.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070031#include <asm/ioctls.h>
32#include <linux/sunrpc/types.h>
33#include <linux/sunrpc/cache.h>
34#include <linux/sunrpc/stats.h>
Trond Myklebust8854e822009-08-09 15:14:30 -040035#include <linux/sunrpc/rpc_pipe_fs.h>
Pavel Emelyanov4f42d0d2010-09-27 14:01:58 +040036#include "netns.h"
Linus Torvalds1da177e2005-04-16 15:20:36 -070037
38#define RPCDBG_FACILITY RPCDBG_CACHE
39
J. Bruce Fieldsd76d1812011-01-02 21:28:34 -050040static bool cache_defer_req(struct cache_req *req, struct cache_head *item);
Linus Torvalds1da177e2005-04-16 15:20:36 -070041static void cache_revisit_request(struct cache_head *item);
42
Adrian Bunk74cae612006-03-27 01:15:10 -080043static void cache_init(struct cache_head *h)
Linus Torvalds1da177e2005-04-16 15:20:36 -070044{
NeilBrownc5b29f82010-08-12 16:55:22 +100045 time_t now = seconds_since_boot();
Linus Torvalds1da177e2005-04-16 15:20:36 -070046 h->next = NULL;
47 h->flags = 0;
NeilBrownbaab9352006-03-27 01:15:09 -080048 kref_init(&h->ref);
Linus Torvalds1da177e2005-04-16 15:20:36 -070049 h->expiry_time = now + CACHE_NEW_EXPIRY;
50 h->last_refresh = now;
51}
52
NeilBrown15a5f6b2006-03-27 01:15:02 -080053struct cache_head *sunrpc_cache_lookup(struct cache_detail *detail,
54 struct cache_head *key, int hash)
55{
56 struct cache_head **head, **hp;
NeilBrownd202cce2010-02-03 17:31:31 +110057 struct cache_head *new = NULL, *freeme = NULL;
NeilBrown15a5f6b2006-03-27 01:15:02 -080058
59 head = &detail->hash_table[hash];
60
61 read_lock(&detail->hash_lock);
62
63 for (hp=head; *hp != NULL ; hp = &(*hp)->next) {
64 struct cache_head *tmp = *hp;
65 if (detail->match(tmp, key)) {
NeilBrownd202cce2010-02-03 17:31:31 +110066 if (cache_is_expired(detail, tmp))
67 /* This entry is expired, we will discard it. */
68 break;
NeilBrown15a5f6b2006-03-27 01:15:02 -080069 cache_get(tmp);
70 read_unlock(&detail->hash_lock);
71 return tmp;
72 }
73 }
74 read_unlock(&detail->hash_lock);
75 /* Didn't find anything, insert an empty entry */
76
77 new = detail->alloc();
78 if (!new)
79 return NULL;
Neil Brown2f349312006-08-05 12:14:29 -070080 /* must fully initialise 'new', else
81 * we might get lose if we need to
82 * cache_put it soon.
83 */
NeilBrown15a5f6b2006-03-27 01:15:02 -080084 cache_init(new);
Neil Brown2f349312006-08-05 12:14:29 -070085 detail->init(new, key);
NeilBrown15a5f6b2006-03-27 01:15:02 -080086
87 write_lock(&detail->hash_lock);
88
89 /* check if entry appeared while we slept */
90 for (hp=head; *hp != NULL ; hp = &(*hp)->next) {
91 struct cache_head *tmp = *hp;
92 if (detail->match(tmp, key)) {
NeilBrownd202cce2010-02-03 17:31:31 +110093 if (cache_is_expired(detail, tmp)) {
94 *hp = tmp->next;
95 tmp->next = NULL;
96 detail->entries --;
97 freeme = tmp;
98 break;
99 }
NeilBrown15a5f6b2006-03-27 01:15:02 -0800100 cache_get(tmp);
101 write_unlock(&detail->hash_lock);
NeilBrownbaab9352006-03-27 01:15:09 -0800102 cache_put(new, detail);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800103 return tmp;
104 }
105 }
NeilBrown15a5f6b2006-03-27 01:15:02 -0800106 new->next = *head;
107 *head = new;
108 detail->entries++;
109 cache_get(new);
110 write_unlock(&detail->hash_lock);
111
NeilBrownd202cce2010-02-03 17:31:31 +1100112 if (freeme)
113 cache_put(freeme, detail);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800114 return new;
115}
Trond Myklebust24c37672008-12-23 16:30:12 -0500116EXPORT_SYMBOL_GPL(sunrpc_cache_lookup);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800117
NeilBrownebd0cb12006-03-27 01:15:08 -0800118
NeilBrownf866a812009-08-04 15:22:38 +1000119static void cache_dequeue(struct cache_detail *detail, struct cache_head *ch);
NeilBrownebd0cb12006-03-27 01:15:08 -0800120
NeilBrown908329f2009-09-09 16:32:54 +1000121static void cache_fresh_locked(struct cache_head *head, time_t expiry)
NeilBrownebd0cb12006-03-27 01:15:08 -0800122{
123 head->expiry_time = expiry;
NeilBrownc5b29f82010-08-12 16:55:22 +1000124 head->last_refresh = seconds_since_boot();
J. Bruce Fieldsfdef7aa2011-01-04 14:12:47 -0500125 smp_wmb(); /* paired with smp_rmb() in cache_is_valid() */
NeilBrown908329f2009-09-09 16:32:54 +1000126 set_bit(CACHE_VALID, &head->flags);
NeilBrownebd0cb12006-03-27 01:15:08 -0800127}
128
129static void cache_fresh_unlocked(struct cache_head *head,
NeilBrown908329f2009-09-09 16:32:54 +1000130 struct cache_detail *detail)
NeilBrownebd0cb12006-03-27 01:15:08 -0800131{
NeilBrownebd0cb12006-03-27 01:15:08 -0800132 if (test_and_clear_bit(CACHE_PENDING, &head->flags)) {
133 cache_revisit_request(head);
NeilBrownf866a812009-08-04 15:22:38 +1000134 cache_dequeue(detail, head);
NeilBrownebd0cb12006-03-27 01:15:08 -0800135 }
136}
137
NeilBrown15a5f6b2006-03-27 01:15:02 -0800138struct cache_head *sunrpc_cache_update(struct cache_detail *detail,
139 struct cache_head *new, struct cache_head *old, int hash)
140{
141 /* The 'old' entry is to be replaced by 'new'.
142 * If 'old' is not VALID, we update it directly,
143 * otherwise we need to replace it
144 */
145 struct cache_head **head;
146 struct cache_head *tmp;
147
148 if (!test_bit(CACHE_VALID, &old->flags)) {
149 write_lock(&detail->hash_lock);
150 if (!test_bit(CACHE_VALID, &old->flags)) {
151 if (test_bit(CACHE_NEGATIVE, &new->flags))
152 set_bit(CACHE_NEGATIVE, &old->flags);
153 else
154 detail->update(old, new);
NeilBrown908329f2009-09-09 16:32:54 +1000155 cache_fresh_locked(old, new->expiry_time);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800156 write_unlock(&detail->hash_lock);
NeilBrown908329f2009-09-09 16:32:54 +1000157 cache_fresh_unlocked(old, detail);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800158 return old;
159 }
160 write_unlock(&detail->hash_lock);
161 }
162 /* We need to insert a new entry */
163 tmp = detail->alloc();
164 if (!tmp) {
NeilBrownbaab9352006-03-27 01:15:09 -0800165 cache_put(old, detail);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800166 return NULL;
167 }
168 cache_init(tmp);
169 detail->init(tmp, old);
170 head = &detail->hash_table[hash];
171
172 write_lock(&detail->hash_lock);
173 if (test_bit(CACHE_NEGATIVE, &new->flags))
174 set_bit(CACHE_NEGATIVE, &tmp->flags);
175 else
176 detail->update(tmp, new);
177 tmp->next = *head;
178 *head = tmp;
NeilBrownf2d39582006-05-22 22:35:25 -0700179 detail->entries++;
NeilBrown15a5f6b2006-03-27 01:15:02 -0800180 cache_get(tmp);
NeilBrown908329f2009-09-09 16:32:54 +1000181 cache_fresh_locked(tmp, new->expiry_time);
NeilBrownebd0cb12006-03-27 01:15:08 -0800182 cache_fresh_locked(old, 0);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800183 write_unlock(&detail->hash_lock);
NeilBrown908329f2009-09-09 16:32:54 +1000184 cache_fresh_unlocked(tmp, detail);
185 cache_fresh_unlocked(old, detail);
NeilBrownbaab9352006-03-27 01:15:09 -0800186 cache_put(old, detail);
NeilBrown15a5f6b2006-03-27 01:15:02 -0800187 return tmp;
188}
Trond Myklebust24c37672008-12-23 16:30:12 -0500189EXPORT_SYMBOL_GPL(sunrpc_cache_update);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700190
Trond Myklebustbc74b4f2009-08-09 15:14:29 -0400191static int cache_make_upcall(struct cache_detail *cd, struct cache_head *h)
192{
Stanislav Kinsbursky2d438332013-02-04 14:02:50 +0300193 if (cd->cache_upcall)
194 return cd->cache_upcall(cd, h);
Stanislav Kinsbursky21cd1252013-02-04 14:02:55 +0300195 return sunrpc_cache_pipe_upcall(cd, h);
Trond Myklebustbc74b4f2009-08-09 15:14:29 -0400196}
NeilBrown989a19b2009-08-04 15:22:38 +1000197
chaoting fanb6040f92013-03-28 22:19:45 +0800198static inline int cache_is_valid(struct cache_head *h)
NeilBrown989a19b2009-08-04 15:22:38 +1000199{
NeilBrownd202cce2010-02-03 17:31:31 +1100200 if (!test_bit(CACHE_VALID, &h->flags))
NeilBrown989a19b2009-08-04 15:22:38 +1000201 return -EAGAIN;
202 else {
203 /* entry is valid */
204 if (test_bit(CACHE_NEGATIVE, &h->flags))
205 return -ENOENT;
J. Bruce Fieldsfdef7aa2011-01-04 14:12:47 -0500206 else {
207 /*
208 * In combination with write barrier in
209 * sunrpc_cache_update, ensures that anyone
210 * using the cache entry after this sees the
211 * updated contents:
212 */
213 smp_rmb();
NeilBrown989a19b2009-08-04 15:22:38 +1000214 return 0;
J. Bruce Fieldsfdef7aa2011-01-04 14:12:47 -0500215 }
NeilBrown989a19b2009-08-04 15:22:38 +1000216 }
217}
J. Bruce Fieldse9dc1222009-08-21 11:27:29 -0400218
J. Bruce Fields6bab93f2011-01-03 15:10:27 -0500219static int try_to_negate_entry(struct cache_detail *detail, struct cache_head *h)
220{
221 int rv;
222
223 write_lock(&detail->hash_lock);
chaoting fanb6040f92013-03-28 22:19:45 +0800224 rv = cache_is_valid(h);
NeilBrown2a1c7f52013-06-13 12:53:42 +1000225 if (rv == -EAGAIN) {
226 set_bit(CACHE_NEGATIVE, &h->flags);
227 cache_fresh_locked(h, seconds_since_boot()+CACHE_NEW_EXPIRY);
228 rv = -ENOENT;
J. Bruce Fields6bab93f2011-01-03 15:10:27 -0500229 }
J. Bruce Fields6bab93f2011-01-03 15:10:27 -0500230 write_unlock(&detail->hash_lock);
231 cache_fresh_unlocked(h, detail);
NeilBrown2a1c7f52013-06-13 12:53:42 +1000232 return rv;
J. Bruce Fields6bab93f2011-01-03 15:10:27 -0500233}
234
Linus Torvalds1da177e2005-04-16 15:20:36 -0700235/*
236 * This is the generic cache management routine for all
237 * the authentication caches.
238 * It checks the currency of a cache item and will (later)
239 * initiate an upcall to fill it if needed.
240 *
241 *
242 * Returns 0 if the cache_head can be used, or cache_puts it and returns
NeilBrown989a19b2009-08-04 15:22:38 +1000243 * -EAGAIN if upcall is pending and request has been queued
244 * -ETIMEDOUT if upcall failed or request could not be queue or
245 * upcall completed but item is still invalid (implying that
246 * the cache item has been replaced with a newer one).
Linus Torvalds1da177e2005-04-16 15:20:36 -0700247 * -ENOENT if cache entry was negative
248 */
249int cache_check(struct cache_detail *detail,
250 struct cache_head *h, struct cache_req *rqstp)
251{
252 int rv;
253 long refresh_age, age;
254
255 /* First decide return status as best we can */
chaoting fanb6040f92013-03-28 22:19:45 +0800256 rv = cache_is_valid(h);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700257
258 /* now see if we want to start an upcall */
259 refresh_age = (h->expiry_time - h->last_refresh);
NeilBrownc5b29f82010-08-12 16:55:22 +1000260 age = seconds_since_boot() - h->last_refresh;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700261
262 if (rqstp == NULL) {
263 if (rv == -EAGAIN)
264 rv = -ENOENT;
NeilBrown0bebc6332013-06-13 12:53:42 +1000265 } else if (rv == -EAGAIN ||
266 (h->expiry_time != 0 && age > refresh_age/2)) {
Chuck Lever46121cf2007-01-31 12:14:08 -0500267 dprintk("RPC: Want update, refage=%ld, age=%ld\n",
268 refresh_age, age);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700269 if (!test_and_set_bit(CACHE_PENDING, &h->flags)) {
270 switch (cache_make_upcall(detail, h)) {
271 case -EINVAL:
J. Bruce Fields6bab93f2011-01-03 15:10:27 -0500272 rv = try_to_negate_entry(detail, h);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700273 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700274 case -EAGAIN:
NeilBrown2a1c7f52013-06-13 12:53:42 +1000275 cache_fresh_unlocked(h, detail);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276 break;
277 }
278 }
279 }
280
NeilBrown989a19b2009-08-04 15:22:38 +1000281 if (rv == -EAGAIN) {
J. Bruce Fieldsd76d1812011-01-02 21:28:34 -0500282 if (!cache_defer_req(rqstp, h)) {
283 /*
284 * Request was not deferred; handle it as best
285 * we can ourselves:
286 */
chaoting fanb6040f92013-03-28 22:19:45 +0800287 rv = cache_is_valid(h);
NeilBrown989a19b2009-08-04 15:22:38 +1000288 if (rv == -EAGAIN)
289 rv = -ETIMEDOUT;
290 }
291 }
NeilBrown4013ede2006-03-27 01:15:07 -0800292 if (rv)
NeilBrownbaab9352006-03-27 01:15:09 -0800293 cache_put(h, detail);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700294 return rv;
295}
Trond Myklebust24c37672008-12-23 16:30:12 -0500296EXPORT_SYMBOL_GPL(cache_check);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700297
Linus Torvalds1da177e2005-04-16 15:20:36 -0700298/*
299 * caches need to be periodically cleaned.
300 * For this we maintain a list of cache_detail and
301 * a current pointer into that list and into the table
302 * for that entry.
303 *
NeilBrown013920e2013-06-13 12:53:42 +1000304 * Each time cache_clean is called it finds the next non-empty entry
Linus Torvalds1da177e2005-04-16 15:20:36 -0700305 * in the current table and walks the list in that entry
306 * looking for entries that can be removed.
307 *
308 * An entry gets removed if:
309 * - The expiry is before current time
310 * - The last_refresh time is before the flush_time for that cache
311 *
312 * later we might drop old entries with non-NEVER expiry if that table
313 * is getting 'full' for some definition of 'full'
314 *
315 * The question of "how often to scan a table" is an interesting one
316 * and is answered in part by the use of the "nextcheck" field in the
317 * cache_detail.
318 * When a scan of a table begins, the nextcheck field is set to a time
319 * that is well into the future.
320 * While scanning, if an expiry time is found that is earlier than the
321 * current nextcheck time, nextcheck is set to that expiry time.
322 * If the flush_time is ever set to a time earlier than the nextcheck
323 * time, the nextcheck time is then set to that flush_time.
324 *
325 * A table is then only scanned if the current time is at least
326 * the nextcheck time.
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800327 *
Linus Torvalds1da177e2005-04-16 15:20:36 -0700328 */
329
330static LIST_HEAD(cache_list);
331static DEFINE_SPINLOCK(cache_list_lock);
332static struct cache_detail *current_detail;
333static int current_index;
334
David Howells65f27f32006-11-22 14:55:48 +0000335static void do_cache_clean(struct work_struct *work);
Artem Bityutskiy8eab9452010-07-01 18:05:56 +0300336static struct delayed_work cache_cleaner;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700337
Stanislav Kinsbursky820f9442011-11-25 17:12:40 +0300338void sunrpc_init_cache_detail(struct cache_detail *cd)
J. Bruce Fieldsffe93862007-11-12 17:04:29 -0500339{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700340 rwlock_init(&cd->hash_lock);
341 INIT_LIST_HEAD(&cd->queue);
342 spin_lock(&cache_list_lock);
343 cd->nextcheck = 0;
344 cd->entries = 0;
345 atomic_set(&cd->readers, 0);
346 cd->last_close = 0;
347 cd->last_warn = -1;
348 list_add(&cd->others, &cache_list);
349 spin_unlock(&cache_list_lock);
350
351 /* start the cleaning process */
David Howells52bad642006-11-22 14:54:01 +0000352 schedule_delayed_work(&cache_cleaner, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700353}
Stanislav Kinsbursky820f9442011-11-25 17:12:40 +0300354EXPORT_SYMBOL_GPL(sunrpc_init_cache_detail);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700355
Stanislav Kinsbursky820f9442011-11-25 17:12:40 +0300356void sunrpc_destroy_cache_detail(struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700357{
358 cache_purge(cd);
359 spin_lock(&cache_list_lock);
360 write_lock(&cd->hash_lock);
361 if (cd->entries || atomic_read(&cd->inuse)) {
362 write_unlock(&cd->hash_lock);
363 spin_unlock(&cache_list_lock);
J. Bruce Fieldsdf95a9d2007-11-08 16:09:59 -0500364 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700365 }
366 if (current_detail == cd)
367 current_detail = NULL;
368 list_del_init(&cd->others);
369 write_unlock(&cd->hash_lock);
370 spin_unlock(&cache_list_lock);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700371 if (list_empty(&cache_list)) {
372 /* module must be being unloaded so its safe to kill the worker */
Trond Myklebust4011cd92007-08-07 15:33:01 -0400373 cancel_delayed_work_sync(&cache_cleaner);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700374 }
J. Bruce Fieldsdf95a9d2007-11-08 16:09:59 -0500375 return;
376out:
377 printk(KERN_ERR "nfsd: failed to unregister %s cache\n", cd->name);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700378}
Stanislav Kinsbursky820f9442011-11-25 17:12:40 +0300379EXPORT_SYMBOL_GPL(sunrpc_destroy_cache_detail);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700380
381/* clean cache tries to find something to clean
382 * and cleans it.
383 * It returns 1 if it cleaned something,
384 * 0 if it didn't find anything this time
385 * -1 if it fell off the end of the list.
386 */
387static int cache_clean(void)
388{
389 int rv = 0;
390 struct list_head *next;
391
392 spin_lock(&cache_list_lock);
393
394 /* find a suitable table if we don't already have one */
395 while (current_detail == NULL ||
396 current_index >= current_detail->hash_size) {
397 if (current_detail)
398 next = current_detail->others.next;
399 else
400 next = cache_list.next;
401 if (next == &cache_list) {
402 current_detail = NULL;
403 spin_unlock(&cache_list_lock);
404 return -1;
405 }
406 current_detail = list_entry(next, struct cache_detail, others);
NeilBrownc5b29f82010-08-12 16:55:22 +1000407 if (current_detail->nextcheck > seconds_since_boot())
Linus Torvalds1da177e2005-04-16 15:20:36 -0700408 current_index = current_detail->hash_size;
409 else {
410 current_index = 0;
NeilBrownc5b29f82010-08-12 16:55:22 +1000411 current_detail->nextcheck = seconds_since_boot()+30*60;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700412 }
413 }
414
415 /* find a non-empty bucket in the table */
416 while (current_detail &&
417 current_index < current_detail->hash_size &&
418 current_detail->hash_table[current_index] == NULL)
419 current_index++;
420
421 /* find a cleanable entry in the bucket and clean it, or set to next bucket */
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800422
Linus Torvalds1da177e2005-04-16 15:20:36 -0700423 if (current_detail && current_index < current_detail->hash_size) {
424 struct cache_head *ch, **cp;
425 struct cache_detail *d;
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800426
Linus Torvalds1da177e2005-04-16 15:20:36 -0700427 write_lock(&current_detail->hash_lock);
428
429 /* Ok, now to clean this strand */
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800430
Linus Torvalds1da177e2005-04-16 15:20:36 -0700431 cp = & current_detail->hash_table[current_index];
NeilBrown3af49742010-02-03 17:31:31 +1100432 for (ch = *cp ; ch ; cp = & ch->next, ch = *cp) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700433 if (current_detail->nextcheck > ch->expiry_time)
434 current_detail->nextcheck = ch->expiry_time+1;
NeilBrown2f50d8b2010-02-03 17:31:31 +1100435 if (!cache_is_expired(current_detail, ch))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700436 continue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700437
Linus Torvalds1da177e2005-04-16 15:20:36 -0700438 *cp = ch->next;
439 ch->next = NULL;
440 current_detail->entries--;
441 rv = 1;
NeilBrown3af49742010-02-03 17:31:31 +1100442 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700443 }
NeilBrown3af49742010-02-03 17:31:31 +1100444
Linus Torvalds1da177e2005-04-16 15:20:36 -0700445 write_unlock(&current_detail->hash_lock);
446 d = current_detail;
447 if (!ch)
448 current_index ++;
449 spin_unlock(&cache_list_lock);
NeilBrown5c4d2632009-08-04 15:22:38 +1000450 if (ch) {
NeilBrown013920e2013-06-13 12:53:42 +1000451 set_bit(CACHE_CLEANED, &ch->flags);
NeilBrown2a1c7f52013-06-13 12:53:42 +1000452 cache_fresh_unlocked(ch, d);
NeilBrownbaab9352006-03-27 01:15:09 -0800453 cache_put(ch, d);
NeilBrown5c4d2632009-08-04 15:22:38 +1000454 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700455 } else
456 spin_unlock(&cache_list_lock);
457
458 return rv;
459}
460
461/*
462 * We want to regularly clean the cache, so we need to schedule some work ...
463 */
David Howells65f27f32006-11-22 14:55:48 +0000464static void do_cache_clean(struct work_struct *work)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700465{
466 int delay = 5;
467 if (cache_clean() == -1)
Anton Blanchard6aad89c2009-06-10 12:52:21 -0700468 delay = round_jiffies_relative(30*HZ);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700469
470 if (list_empty(&cache_list))
471 delay = 0;
472
473 if (delay)
474 schedule_delayed_work(&cache_cleaner, delay);
475}
476
477
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800478/*
Linus Torvalds1da177e2005-04-16 15:20:36 -0700479 * Clean all caches promptly. This just calls cache_clean
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800480 * repeatedly until we are sure that every cache has had a chance to
Linus Torvalds1da177e2005-04-16 15:20:36 -0700481 * be fully cleaned
482 */
483void cache_flush(void)
484{
485 while (cache_clean() != -1)
486 cond_resched();
487 while (cache_clean() != -1)
488 cond_resched();
489}
Trond Myklebust24c37672008-12-23 16:30:12 -0500490EXPORT_SYMBOL_GPL(cache_flush);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700491
492void cache_purge(struct cache_detail *detail)
493{
494 detail->flush_time = LONG_MAX;
NeilBrownc5b29f82010-08-12 16:55:22 +1000495 detail->nextcheck = seconds_since_boot();
Linus Torvalds1da177e2005-04-16 15:20:36 -0700496 cache_flush();
497 detail->flush_time = 1;
498}
Trond Myklebust24c37672008-12-23 16:30:12 -0500499EXPORT_SYMBOL_GPL(cache_purge);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700500
501
502/*
503 * Deferral and Revisiting of Requests.
504 *
505 * If a cache lookup finds a pending entry, we
506 * need to defer the request and revisit it later.
507 * All deferred requests are stored in a hash table,
508 * indexed by "struct cache_head *".
509 * As it may be wasteful to store a whole request
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800510 * structure, we allow the request to provide a
Linus Torvalds1da177e2005-04-16 15:20:36 -0700511 * deferred form, which must contain a
512 * 'struct cache_deferred_req'
513 * This cache_deferred_req contains a method to allow
514 * it to be revisited when cache info is available
515 */
516
517#define DFR_HASHSIZE (PAGE_SIZE/sizeof(struct list_head))
518#define DFR_HASH(item) ((((long)item)>>4 ^ (((long)item)>>13)) % DFR_HASHSIZE)
519
520#define DFR_MAX 300 /* ??? */
521
522static DEFINE_SPINLOCK(cache_defer_lock);
523static LIST_HEAD(cache_defer_list);
NeilBrown11174492010-08-12 17:04:08 +1000524static struct hlist_head cache_defer_hash[DFR_HASHSIZE];
Linus Torvalds1da177e2005-04-16 15:20:36 -0700525static int cache_defer_cnt;
526
J. Bruce Fields6610f722010-08-26 13:19:52 -0400527static void __unhash_deferred_req(struct cache_deferred_req *dreq)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700528{
NeilBrown11174492010-08-12 17:04:08 +1000529 hlist_del_init(&dreq->hash);
NeilBrowne33534d2010-10-07 15:29:46 +1100530 if (!list_empty(&dreq->recent)) {
531 list_del_init(&dreq->recent);
532 cache_defer_cnt--;
533 }
J. Bruce Fields6610f722010-08-26 13:19:52 -0400534}
535
536static void __hash_deferred_req(struct cache_deferred_req *dreq, struct cache_head *item)
537{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700538 int hash = DFR_HASH(item);
539
NeilBrowne33534d2010-10-07 15:29:46 +1100540 INIT_LIST_HEAD(&dreq->recent);
NeilBrown11174492010-08-12 17:04:08 +1000541 hlist_add_head(&dreq->hash, &cache_defer_hash[hash]);
J. Bruce Fields6610f722010-08-26 13:19:52 -0400542}
543
NeilBrowne33534d2010-10-07 15:29:46 +1100544static void setup_deferral(struct cache_deferred_req *dreq,
545 struct cache_head *item,
546 int count_me)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700547{
Linus Torvalds1da177e2005-04-16 15:20:36 -0700548
549 dreq->item = item;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700550
551 spin_lock(&cache_defer_lock);
552
J. Bruce Fields6610f722010-08-26 13:19:52 -0400553 __hash_deferred_req(dreq, item);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700554
NeilBrowne33534d2010-10-07 15:29:46 +1100555 if (count_me) {
556 cache_defer_cnt++;
557 list_add(&dreq->recent, &cache_defer_list);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700558 }
NeilBrowne33534d2010-10-07 15:29:46 +1100559
Linus Torvalds1da177e2005-04-16 15:20:36 -0700560 spin_unlock(&cache_defer_lock);
561
Linus Torvalds1da177e2005-04-16 15:20:36 -0700562}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700563
J. Bruce Fields3211af12010-08-26 16:56:23 -0400564struct thread_deferred_req {
565 struct cache_deferred_req handle;
566 struct completion completion;
567};
568
569static void cache_restart_thread(struct cache_deferred_req *dreq, int too_many)
570{
571 struct thread_deferred_req *dr =
572 container_of(dreq, struct thread_deferred_req, handle);
573 complete(&dr->completion);
574}
575
NeilBrownd29068c42010-10-07 15:29:46 +1100576static void cache_wait_req(struct cache_req *req, struct cache_head *item)
J. Bruce Fields3211af12010-08-26 16:56:23 -0400577{
578 struct thread_deferred_req sleeper;
579 struct cache_deferred_req *dreq = &sleeper.handle;
J. Bruce Fields3211af12010-08-26 16:56:23 -0400580
581 sleeper.completion = COMPLETION_INITIALIZER_ONSTACK(sleeper.completion);
582 dreq->revisit = cache_restart_thread;
583
NeilBrowne33534d2010-10-07 15:29:46 +1100584 setup_deferral(dreq, item, 0);
J. Bruce Fields3211af12010-08-26 16:56:23 -0400585
NeilBrownd29068c42010-10-07 15:29:46 +1100586 if (!test_bit(CACHE_PENDING, &item->flags) ||
NeilBrown277f68d2010-09-22 12:55:06 +1000587 wait_for_completion_interruptible_timeout(
J. Bruce Fields3211af12010-08-26 16:56:23 -0400588 &sleeper.completion, req->thread_wait) <= 0) {
589 /* The completion wasn't completed, so we need
590 * to clean up
591 */
592 spin_lock(&cache_defer_lock);
NeilBrown11174492010-08-12 17:04:08 +1000593 if (!hlist_unhashed(&sleeper.handle.hash)) {
J. Bruce Fields3211af12010-08-26 16:56:23 -0400594 __unhash_deferred_req(&sleeper.handle);
595 spin_unlock(&cache_defer_lock);
596 } else {
597 /* cache_revisit_request already removed
598 * this from the hash table, but hasn't
599 * called ->revisit yet. It will very soon
600 * and we need to wait for it.
601 */
602 spin_unlock(&cache_defer_lock);
603 wait_for_completion(&sleeper.completion);
604 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700605 }
J. Bruce Fields3211af12010-08-26 16:56:23 -0400606}
607
NeilBrowne33534d2010-10-07 15:29:46 +1100608static void cache_limit_defers(void)
609{
610 /* Make sure we haven't exceed the limit of allowed deferred
611 * requests.
612 */
613 struct cache_deferred_req *discard = NULL;
614
615 if (cache_defer_cnt <= DFR_MAX)
616 return;
617
618 spin_lock(&cache_defer_lock);
619
620 /* Consider removing either the first or the last */
621 if (cache_defer_cnt > DFR_MAX) {
622 if (net_random() & 1)
623 discard = list_entry(cache_defer_list.next,
624 struct cache_deferred_req, recent);
625 else
626 discard = list_entry(cache_defer_list.prev,
627 struct cache_deferred_req, recent);
628 __unhash_deferred_req(discard);
629 }
630 spin_unlock(&cache_defer_lock);
631 if (discard)
632 discard->revisit(discard, 1);
633}
634
J. Bruce Fieldsd76d1812011-01-02 21:28:34 -0500635/* Return true if and only if a deferred request is queued. */
636static bool cache_defer_req(struct cache_req *req, struct cache_head *item)
J. Bruce Fields3211af12010-08-26 16:56:23 -0400637{
638 struct cache_deferred_req *dreq;
J. Bruce Fields3211af12010-08-26 16:56:23 -0400639
J. Bruce Fields3211af12010-08-26 16:56:23 -0400640 if (req->thread_wait) {
NeilBrownd29068c42010-10-07 15:29:46 +1100641 cache_wait_req(req, item);
642 if (!test_bit(CACHE_PENDING, &item->flags))
J. Bruce Fieldsd76d1812011-01-02 21:28:34 -0500643 return false;
J. Bruce Fields3211af12010-08-26 16:56:23 -0400644 }
645 dreq = req->defer(req);
646 if (dreq == NULL)
J. Bruce Fieldsd76d1812011-01-02 21:28:34 -0500647 return false;
NeilBrowne33534d2010-10-07 15:29:46 +1100648 setup_deferral(dreq, item, 1);
NeilBrownd29068c42010-10-07 15:29:46 +1100649 if (!test_bit(CACHE_PENDING, &item->flags))
650 /* Bit could have been cleared before we managed to
651 * set up the deferral, so need to revisit just in case
652 */
653 cache_revisit_request(item);
NeilBrowne33534d2010-10-07 15:29:46 +1100654
655 cache_limit_defers();
J. Bruce Fieldsd76d1812011-01-02 21:28:34 -0500656 return true;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700657}
658
659static void cache_revisit_request(struct cache_head *item)
660{
661 struct cache_deferred_req *dreq;
662 struct list_head pending;
Sasha Levinb67bfe02013-02-27 17:06:00 -0800663 struct hlist_node *tmp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700664 int hash = DFR_HASH(item);
665
666 INIT_LIST_HEAD(&pending);
667 spin_lock(&cache_defer_lock);
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800668
Sasha Levinb67bfe02013-02-27 17:06:00 -0800669 hlist_for_each_entry_safe(dreq, tmp, &cache_defer_hash[hash], hash)
NeilBrown11174492010-08-12 17:04:08 +1000670 if (dreq->item == item) {
671 __unhash_deferred_req(dreq);
672 list_add(&dreq->recent, &pending);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700673 }
NeilBrown11174492010-08-12 17:04:08 +1000674
Linus Torvalds1da177e2005-04-16 15:20:36 -0700675 spin_unlock(&cache_defer_lock);
676
677 while (!list_empty(&pending)) {
678 dreq = list_entry(pending.next, struct cache_deferred_req, recent);
679 list_del_init(&dreq->recent);
680 dreq->revisit(dreq, 0);
681 }
682}
683
684void cache_clean_deferred(void *owner)
685{
686 struct cache_deferred_req *dreq, *tmp;
687 struct list_head pending;
688
689
690 INIT_LIST_HEAD(&pending);
691 spin_lock(&cache_defer_lock);
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800692
Linus Torvalds1da177e2005-04-16 15:20:36 -0700693 list_for_each_entry_safe(dreq, tmp, &cache_defer_list, recent) {
694 if (dreq->owner == owner) {
J. Bruce Fields6610f722010-08-26 13:19:52 -0400695 __unhash_deferred_req(dreq);
NeilBrowne95dffa2010-09-22 12:55:06 +1000696 list_add(&dreq->recent, &pending);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700697 }
698 }
699 spin_unlock(&cache_defer_lock);
700
701 while (!list_empty(&pending)) {
702 dreq = list_entry(pending.next, struct cache_deferred_req, recent);
703 list_del_init(&dreq->recent);
704 dreq->revisit(dreq, 1);
705 }
706}
707
708/*
709 * communicate with user-space
710 *
J. Bruce Fieldsa490c682007-11-06 14:15:19 -0500711 * We have a magic /proc file - /proc/sunrpc/<cachename>/channel.
712 * On read, you get a full request, or block.
713 * On write, an update request is processed.
714 * Poll works if anything to read, and always allows write.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700715 *
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -0800716 * Implemented by linked list of requests. Each open file has
J. Bruce Fieldsa490c682007-11-06 14:15:19 -0500717 * a ->private that also exists in this list. New requests are added
Linus Torvalds1da177e2005-04-16 15:20:36 -0700718 * to the end and may wakeup and preceding readers.
719 * New readers are added to the head. If, on read, an item is found with
720 * CACHE_UPCALLING clear, we free it from the list.
721 *
722 */
723
724static DEFINE_SPINLOCK(queue_lock);
Arjan van de Ven4a3e2f72006-03-20 22:33:17 -0800725static DEFINE_MUTEX(queue_io_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700726
727struct cache_queue {
728 struct list_head list;
729 int reader; /* if 0, then request */
730};
731struct cache_request {
732 struct cache_queue q;
733 struct cache_head *item;
734 char * buf;
735 int len;
736 int readers;
737};
738struct cache_reader {
739 struct cache_queue q;
740 int offset; /* if non-0, we have a refcnt on next request */
741};
742
Stanislav Kinsburskyd94af6d2013-02-04 14:03:03 +0300743static int cache_request(struct cache_detail *detail,
744 struct cache_request *crq)
745{
746 char *bp = crq->buf;
747 int len = PAGE_SIZE;
748
749 detail->cache_request(detail, crq->item, &bp, &len);
750 if (len < 0)
751 return -EAGAIN;
752 return PAGE_SIZE - len;
753}
754
Trond Myklebust173912a2009-08-09 15:14:29 -0400755static ssize_t cache_read(struct file *filp, char __user *buf, size_t count,
756 loff_t *ppos, struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700757{
758 struct cache_reader *rp = filp->private_data;
759 struct cache_request *rq;
Al Viro496ad9a2013-01-23 17:07:38 -0500760 struct inode *inode = file_inode(filp);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700761 int err;
762
763 if (count == 0)
764 return 0;
765
Trond Myklebustda770052009-08-09 15:14:28 -0400766 mutex_lock(&inode->i_mutex); /* protect against multiple concurrent
Linus Torvalds1da177e2005-04-16 15:20:36 -0700767 * readers on this file */
768 again:
769 spin_lock(&queue_lock);
770 /* need to find next request */
771 while (rp->q.list.next != &cd->queue &&
772 list_entry(rp->q.list.next, struct cache_queue, list)
773 ->reader) {
774 struct list_head *next = rp->q.list.next;
775 list_move(&rp->q.list, next);
776 }
777 if (rp->q.list.next == &cd->queue) {
778 spin_unlock(&queue_lock);
Trond Myklebustda770052009-08-09 15:14:28 -0400779 mutex_unlock(&inode->i_mutex);
Weston Andros Adamson0db74d92012-10-23 10:43:36 -0400780 WARN_ON_ONCE(rp->offset);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700781 return 0;
782 }
783 rq = container_of(rp->q.list.next, struct cache_request, q.list);
Weston Andros Adamson0db74d92012-10-23 10:43:36 -0400784 WARN_ON_ONCE(rq->q.reader);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700785 if (rp->offset == 0)
786 rq->readers++;
787 spin_unlock(&queue_lock);
788
Stanislav Kinsburskyd94af6d2013-02-04 14:03:03 +0300789 if (rq->len == 0) {
790 err = cache_request(cd, rq);
791 if (err < 0)
792 goto out;
793 rq->len = err;
794 }
795
Linus Torvalds1da177e2005-04-16 15:20:36 -0700796 if (rp->offset == 0 && !test_bit(CACHE_PENDING, &rq->item->flags)) {
797 err = -EAGAIN;
798 spin_lock(&queue_lock);
799 list_move(&rp->q.list, &rq->q.list);
800 spin_unlock(&queue_lock);
801 } else {
802 if (rp->offset + count > rq->len)
803 count = rq->len - rp->offset;
804 err = -EFAULT;
805 if (copy_to_user(buf, rq->buf + rp->offset, count))
806 goto out;
807 rp->offset += count;
808 if (rp->offset >= rq->len) {
809 rp->offset = 0;
810 spin_lock(&queue_lock);
811 list_move(&rp->q.list, &rq->q.list);
812 spin_unlock(&queue_lock);
813 }
814 err = 0;
815 }
816 out:
817 if (rp->offset == 0) {
818 /* need to release rq */
819 spin_lock(&queue_lock);
820 rq->readers--;
821 if (rq->readers == 0 &&
822 !test_bit(CACHE_PENDING, &rq->item->flags)) {
823 list_del(&rq->q.list);
824 spin_unlock(&queue_lock);
NeilBrownbaab9352006-03-27 01:15:09 -0800825 cache_put(rq->item, cd);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700826 kfree(rq->buf);
827 kfree(rq);
828 } else
829 spin_unlock(&queue_lock);
830 }
831 if (err == -EAGAIN)
832 goto again;
Trond Myklebustda770052009-08-09 15:14:28 -0400833 mutex_unlock(&inode->i_mutex);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700834 return err ? err : count;
835}
836
Trond Myklebustda770052009-08-09 15:14:28 -0400837static ssize_t cache_do_downcall(char *kaddr, const char __user *buf,
838 size_t count, struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700839{
Trond Myklebustda770052009-08-09 15:14:28 -0400840 ssize_t ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700841
Dan Carpenter6d8d1742012-01-18 12:56:02 +0300842 if (count == 0)
843 return -EINVAL;
Trond Myklebustda770052009-08-09 15:14:28 -0400844 if (copy_from_user(kaddr, buf, count))
Linus Torvalds1da177e2005-04-16 15:20:36 -0700845 return -EFAULT;
Trond Myklebustda770052009-08-09 15:14:28 -0400846 kaddr[count] = '\0';
847 ret = cd->cache_parse(cd, kaddr, count);
848 if (!ret)
849 ret = count;
850 return ret;
851}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700852
Trond Myklebustda770052009-08-09 15:14:28 -0400853static ssize_t cache_slow_downcall(const char __user *buf,
854 size_t count, struct cache_detail *cd)
855{
856 static char write_buf[8192]; /* protected by queue_io_mutex */
857 ssize_t ret = -EINVAL;
858
859 if (count >= sizeof(write_buf))
860 goto out;
861 mutex_lock(&queue_io_mutex);
862 ret = cache_do_downcall(write_buf, buf, count, cd);
Arjan van de Ven4a3e2f72006-03-20 22:33:17 -0800863 mutex_unlock(&queue_io_mutex);
Trond Myklebustda770052009-08-09 15:14:28 -0400864out:
865 return ret;
866}
867
868static ssize_t cache_downcall(struct address_space *mapping,
869 const char __user *buf,
870 size_t count, struct cache_detail *cd)
871{
872 struct page *page;
873 char *kaddr;
874 ssize_t ret = -ENOMEM;
875
876 if (count >= PAGE_CACHE_SIZE)
877 goto out_slow;
878
879 page = find_or_create_page(mapping, 0, GFP_KERNEL);
880 if (!page)
881 goto out_slow;
882
883 kaddr = kmap(page);
884 ret = cache_do_downcall(kaddr, buf, count, cd);
885 kunmap(page);
886 unlock_page(page);
887 page_cache_release(page);
888 return ret;
889out_slow:
890 return cache_slow_downcall(buf, count, cd);
891}
Linus Torvalds1da177e2005-04-16 15:20:36 -0700892
Trond Myklebust173912a2009-08-09 15:14:29 -0400893static ssize_t cache_write(struct file *filp, const char __user *buf,
894 size_t count, loff_t *ppos,
895 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700896{
Trond Myklebustda770052009-08-09 15:14:28 -0400897 struct address_space *mapping = filp->f_mapping;
Al Viro496ad9a2013-01-23 17:07:38 -0500898 struct inode *inode = file_inode(filp);
Trond Myklebustda770052009-08-09 15:14:28 -0400899 ssize_t ret = -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700900
Trond Myklebustda770052009-08-09 15:14:28 -0400901 if (!cd->cache_parse)
902 goto out;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700903
Trond Myklebustda770052009-08-09 15:14:28 -0400904 mutex_lock(&inode->i_mutex);
905 ret = cache_downcall(mapping, buf, count, cd);
906 mutex_unlock(&inode->i_mutex);
907out:
908 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700909}
910
911static DECLARE_WAIT_QUEUE_HEAD(queue_wait);
912
Trond Myklebust173912a2009-08-09 15:14:29 -0400913static unsigned int cache_poll(struct file *filp, poll_table *wait,
914 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700915{
916 unsigned int mask;
917 struct cache_reader *rp = filp->private_data;
918 struct cache_queue *cq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700919
920 poll_wait(filp, &queue_wait, wait);
921
922 /* alway allow write */
923 mask = POLL_OUT | POLLWRNORM;
924
925 if (!rp)
926 return mask;
927
928 spin_lock(&queue_lock);
929
930 for (cq= &rp->q; &cq->list != &cd->queue;
931 cq = list_entry(cq->list.next, struct cache_queue, list))
932 if (!cq->reader) {
933 mask |= POLLIN | POLLRDNORM;
934 break;
935 }
936 spin_unlock(&queue_lock);
937 return mask;
938}
939
Trond Myklebust173912a2009-08-09 15:14:29 -0400940static int cache_ioctl(struct inode *ino, struct file *filp,
941 unsigned int cmd, unsigned long arg,
942 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700943{
944 int len = 0;
945 struct cache_reader *rp = filp->private_data;
946 struct cache_queue *cq;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700947
948 if (cmd != FIONREAD || !rp)
949 return -EINVAL;
950
951 spin_lock(&queue_lock);
952
953 /* only find the length remaining in current request,
954 * or the length of the next request
955 */
956 for (cq= &rp->q; &cq->list != &cd->queue;
957 cq = list_entry(cq->list.next, struct cache_queue, list))
958 if (!cq->reader) {
959 struct cache_request *cr =
960 container_of(cq, struct cache_request, q);
961 len = cr->len - rp->offset;
962 break;
963 }
964 spin_unlock(&queue_lock);
965
966 return put_user(len, (int __user *)arg);
967}
968
Trond Myklebust173912a2009-08-09 15:14:29 -0400969static int cache_open(struct inode *inode, struct file *filp,
970 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700971{
972 struct cache_reader *rp = NULL;
973
Trond Myklebustf7e86ab2009-08-19 18:13:00 -0400974 if (!cd || !try_module_get(cd->owner))
975 return -EACCES;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700976 nonseekable_open(inode, filp);
977 if (filp->f_mode & FMODE_READ) {
Linus Torvalds1da177e2005-04-16 15:20:36 -0700978 rp = kmalloc(sizeof(*rp), GFP_KERNEL);
Alexey Khoroshilova7823c72013-03-23 00:36:44 +0400979 if (!rp) {
980 module_put(cd->owner);
Linus Torvalds1da177e2005-04-16 15:20:36 -0700981 return -ENOMEM;
Alexey Khoroshilova7823c72013-03-23 00:36:44 +0400982 }
Linus Torvalds1da177e2005-04-16 15:20:36 -0700983 rp->offset = 0;
984 rp->q.reader = 1;
985 atomic_inc(&cd->readers);
986 spin_lock(&queue_lock);
987 list_add(&rp->q.list, &cd->queue);
988 spin_unlock(&queue_lock);
989 }
990 filp->private_data = rp;
991 return 0;
992}
993
Trond Myklebust173912a2009-08-09 15:14:29 -0400994static int cache_release(struct inode *inode, struct file *filp,
995 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -0700996{
997 struct cache_reader *rp = filp->private_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700998
999 if (rp) {
1000 spin_lock(&queue_lock);
1001 if (rp->offset) {
1002 struct cache_queue *cq;
1003 for (cq= &rp->q; &cq->list != &cd->queue;
1004 cq = list_entry(cq->list.next, struct cache_queue, list))
1005 if (!cq->reader) {
1006 container_of(cq, struct cache_request, q)
1007 ->readers--;
1008 break;
1009 }
1010 rp->offset = 0;
1011 }
1012 list_del(&rp->q.list);
1013 spin_unlock(&queue_lock);
1014
1015 filp->private_data = NULL;
1016 kfree(rp);
1017
NeilBrownc5b29f82010-08-12 16:55:22 +10001018 cd->last_close = seconds_since_boot();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001019 atomic_dec(&cd->readers);
1020 }
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001021 module_put(cd->owner);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001022 return 0;
1023}
1024
1025
1026
NeilBrownf866a812009-08-04 15:22:38 +10001027static void cache_dequeue(struct cache_detail *detail, struct cache_head *ch)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001028{
NeilBrownf9e1aed2013-06-13 12:53:42 +10001029 struct cache_queue *cq, *tmp;
1030 struct cache_request *cr;
1031 struct list_head dequeued;
1032
1033 INIT_LIST_HEAD(&dequeued);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001034 spin_lock(&queue_lock);
NeilBrownf9e1aed2013-06-13 12:53:42 +10001035 list_for_each_entry_safe(cq, tmp, &detail->queue, list)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001036 if (!cq->reader) {
NeilBrownf9e1aed2013-06-13 12:53:42 +10001037 cr = container_of(cq, struct cache_request, q);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001038 if (cr->item != ch)
1039 continue;
NeilBrownf9e1aed2013-06-13 12:53:42 +10001040 if (test_bit(CACHE_PENDING, &ch->flags))
1041 /* Lost a race and it is pending again */
1042 break;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001043 if (cr->readers != 0)
NeilBrown4013ede2006-03-27 01:15:07 -08001044 continue;
NeilBrownf9e1aed2013-06-13 12:53:42 +10001045 list_move(&cr->q.list, &dequeued);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001046 }
1047 spin_unlock(&queue_lock);
NeilBrownf9e1aed2013-06-13 12:53:42 +10001048 while (!list_empty(&dequeued)) {
1049 cr = list_entry(dequeued.next, struct cache_request, q.list);
1050 list_del(&cr->q.list);
1051 cache_put(cr->item, detail);
1052 kfree(cr->buf);
1053 kfree(cr);
1054 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001055}
1056
1057/*
1058 * Support routines for text-based upcalls.
1059 * Fields are separated by spaces.
1060 * Fields are either mangled to quote space tab newline slosh with slosh
1061 * or a hexified with a leading \x
1062 * Record is terminated with newline.
1063 *
1064 */
1065
1066void qword_add(char **bpp, int *lp, char *str)
1067{
1068 char *bp = *bpp;
1069 int len = *lp;
1070 char c;
1071
1072 if (len < 0) return;
1073
1074 while ((c=*str++) && len)
1075 switch(c) {
1076 case ' ':
1077 case '\t':
1078 case '\n':
1079 case '\\':
1080 if (len >= 4) {
1081 *bp++ = '\\';
1082 *bp++ = '0' + ((c & 0300)>>6);
1083 *bp++ = '0' + ((c & 0070)>>3);
1084 *bp++ = '0' + ((c & 0007)>>0);
1085 }
1086 len -= 4;
1087 break;
1088 default:
1089 *bp++ = c;
1090 len--;
1091 }
1092 if (c || len <1) len = -1;
1093 else {
1094 *bp++ = ' ';
1095 len--;
1096 }
1097 *bpp = bp;
1098 *lp = len;
1099}
Trond Myklebust24c37672008-12-23 16:30:12 -05001100EXPORT_SYMBOL_GPL(qword_add);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001101
1102void qword_addhex(char **bpp, int *lp, char *buf, int blen)
1103{
1104 char *bp = *bpp;
1105 int len = *lp;
1106
1107 if (len < 0) return;
1108
1109 if (len > 2) {
1110 *bp++ = '\\';
1111 *bp++ = 'x';
1112 len -= 2;
1113 while (blen && len >= 2) {
1114 unsigned char c = *buf++;
1115 *bp++ = '0' + ((c&0xf0)>>4) + (c>=0xa0)*('a'-'9'-1);
1116 *bp++ = '0' + (c&0x0f) + ((c&0x0f)>=0x0a)*('a'-'9'-1);
1117 len -= 2;
1118 blen--;
1119 }
1120 }
1121 if (blen || len<1) len = -1;
1122 else {
1123 *bp++ = ' ';
1124 len--;
1125 }
1126 *bpp = bp;
1127 *lp = len;
1128}
Trond Myklebust24c37672008-12-23 16:30:12 -05001129EXPORT_SYMBOL_GPL(qword_addhex);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001130
1131static void warn_no_listener(struct cache_detail *detail)
1132{
1133 if (detail->last_warn != detail->last_close) {
1134 detail->last_warn = detail->last_close;
1135 if (detail->warn_no_listener)
Trond Myklebust2da8ca22009-08-09 15:14:26 -04001136 detail->warn_no_listener(detail, detail->last_close != 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001137 }
1138}
1139
J. Bruce Fields06497522010-09-19 22:55:06 -04001140static bool cache_listeners_exist(struct cache_detail *detail)
1141{
1142 if (atomic_read(&detail->readers))
1143 return true;
1144 if (detail->last_close == 0)
1145 /* This cache was never opened */
1146 return false;
1147 if (detail->last_close < seconds_since_boot() - 30)
1148 /*
1149 * We allow for the possibility that someone might
1150 * restart a userspace daemon without restarting the
1151 * server; but after 30 seconds, we give up.
1152 */
1153 return false;
1154 return true;
1155}
1156
Linus Torvalds1da177e2005-04-16 15:20:36 -07001157/*
Trond Myklebustbc74b4f2009-08-09 15:14:29 -04001158 * register an upcall request to user-space and queue it up for read() by the
1159 * upcall daemon.
1160 *
Linus Torvalds1da177e2005-04-16 15:20:36 -07001161 * Each request is at most one page long.
1162 */
Stanislav Kinsbursky21cd1252013-02-04 14:02:55 +03001163int sunrpc_cache_pipe_upcall(struct cache_detail *detail, struct cache_head *h)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001164{
1165
1166 char *buf;
1167 struct cache_request *crq;
NeilBrownf9e1aed2013-06-13 12:53:42 +10001168 int ret = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001169
Stanislav Kinsbursky2d438332013-02-04 14:02:50 +03001170 if (!detail->cache_request)
1171 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001172
J. Bruce Fields06497522010-09-19 22:55:06 -04001173 if (!cache_listeners_exist(detail)) {
1174 warn_no_listener(detail);
1175 return -EINVAL;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001176 }
NeilBrown013920e2013-06-13 12:53:42 +10001177 if (test_bit(CACHE_CLEANED, &h->flags))
1178 /* Too late to make an upcall */
1179 return -EAGAIN;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001180
1181 buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
1182 if (!buf)
1183 return -EAGAIN;
1184
1185 crq = kmalloc(sizeof (*crq), GFP_KERNEL);
1186 if (!crq) {
1187 kfree(buf);
1188 return -EAGAIN;
1189 }
1190
Linus Torvalds1da177e2005-04-16 15:20:36 -07001191 crq->q.reader = 0;
1192 crq->item = cache_get(h);
1193 crq->buf = buf;
Stanislav Kinsburskyd94af6d2013-02-04 14:03:03 +03001194 crq->len = 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001195 crq->readers = 0;
1196 spin_lock(&queue_lock);
NeilBrownf9e1aed2013-06-13 12:53:42 +10001197 if (test_bit(CACHE_PENDING, &h->flags))
1198 list_add_tail(&crq->q.list, &detail->queue);
1199 else
1200 /* Lost a race, no longer PENDING, so don't enqueue */
1201 ret = -EAGAIN;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001202 spin_unlock(&queue_lock);
1203 wake_up(&queue_wait);
NeilBrownf9e1aed2013-06-13 12:53:42 +10001204 if (ret == -EAGAIN) {
1205 kfree(buf);
1206 kfree(crq);
1207 }
1208 return ret;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001209}
Trond Myklebustbc74b4f2009-08-09 15:14:29 -04001210EXPORT_SYMBOL_GPL(sunrpc_cache_pipe_upcall);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001211
1212/*
1213 * parse a message from user-space and pass it
1214 * to an appropriate cache
1215 * Messages are, like requests, separated into fields by
1216 * spaces and dequotes as \xHEXSTRING or embedded \nnn octal
1217 *
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -08001218 * Message is
Linus Torvalds1da177e2005-04-16 15:20:36 -07001219 * reply cachename expiry key ... content....
1220 *
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -08001221 * key and content are both parsed by cache
Linus Torvalds1da177e2005-04-16 15:20:36 -07001222 */
1223
Linus Torvalds1da177e2005-04-16 15:20:36 -07001224int qword_get(char **bpp, char *dest, int bufsize)
1225{
1226 /* return bytes copied, or -1 on error */
1227 char *bp = *bpp;
1228 int len = 0;
1229
1230 while (*bp == ' ') bp++;
1231
1232 if (bp[0] == '\\' && bp[1] == 'x') {
1233 /* HEX STRING */
1234 bp += 2;
Andy Shevchenkoe7f483e2010-09-21 09:40:25 +03001235 while (len < bufsize) {
1236 int h, l;
1237
1238 h = hex_to_bin(bp[0]);
1239 if (h < 0)
1240 break;
1241
1242 l = hex_to_bin(bp[1]);
1243 if (l < 0)
1244 break;
1245
1246 *dest++ = (h << 4) | l;
1247 bp += 2;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001248 len++;
1249 }
1250 } else {
1251 /* text with \nnn octal quoting */
1252 while (*bp != ' ' && *bp != '\n' && *bp && len < bufsize-1) {
1253 if (*bp == '\\' &&
1254 isodigit(bp[1]) && (bp[1] <= '3') &&
1255 isodigit(bp[2]) &&
1256 isodigit(bp[3])) {
1257 int byte = (*++bp -'0');
1258 bp++;
1259 byte = (byte << 3) | (*bp++ - '0');
1260 byte = (byte << 3) | (*bp++ - '0');
1261 *dest++ = byte;
1262 len++;
1263 } else {
1264 *dest++ = *bp++;
1265 len++;
1266 }
1267 }
1268 }
1269
1270 if (*bp != ' ' && *bp != '\n' && *bp != '\0')
1271 return -1;
1272 while (*bp == ' ') bp++;
1273 *bpp = bp;
1274 *dest = '\0';
1275 return len;
1276}
Trond Myklebust24c37672008-12-23 16:30:12 -05001277EXPORT_SYMBOL_GPL(qword_get);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001278
1279
1280/*
1281 * support /proc/sunrpc/cache/$CACHENAME/content
1282 * as a seqfile.
1283 * We call ->cache_show passing NULL for the item to
1284 * get a header, then pass each real item in the cache
1285 */
1286
1287struct handle {
1288 struct cache_detail *cd;
1289};
1290
1291static void *c_start(struct seq_file *m, loff_t *pos)
Eric Dumazet9a429c42008-01-01 21:58:02 -08001292 __acquires(cd->hash_lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001293{
1294 loff_t n = *pos;
Eric Dumazet95c96172012-04-15 05:58:06 +00001295 unsigned int hash, entry;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001296 struct cache_head *ch;
1297 struct cache_detail *cd = ((struct handle*)m->private)->cd;
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -08001298
Linus Torvalds1da177e2005-04-16 15:20:36 -07001299
1300 read_lock(&cd->hash_lock);
1301 if (!n--)
1302 return SEQ_START_TOKEN;
1303 hash = n >> 32;
1304 entry = n & ((1LL<<32) - 1);
1305
1306 for (ch=cd->hash_table[hash]; ch; ch=ch->next)
1307 if (!entry--)
1308 return ch;
1309 n &= ~((1LL<<32) - 1);
1310 do {
1311 hash++;
1312 n += 1LL<<32;
YOSHIFUJI Hideakicca51722007-02-09 15:38:13 -08001313 } while(hash < cd->hash_size &&
Linus Torvalds1da177e2005-04-16 15:20:36 -07001314 cd->hash_table[hash]==NULL);
1315 if (hash >= cd->hash_size)
1316 return NULL;
1317 *pos = n+1;
1318 return cd->hash_table[hash];
1319}
1320
1321static void *c_next(struct seq_file *m, void *p, loff_t *pos)
1322{
1323 struct cache_head *ch = p;
1324 int hash = (*pos >> 32);
1325 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1326
1327 if (p == SEQ_START_TOKEN)
1328 hash = 0;
1329 else if (ch->next == NULL) {
1330 hash++;
1331 *pos += 1LL<<32;
1332 } else {
1333 ++*pos;
1334 return ch->next;
1335 }
1336 *pos &= ~((1LL<<32) - 1);
1337 while (hash < cd->hash_size &&
1338 cd->hash_table[hash] == NULL) {
1339 hash++;
1340 *pos += 1LL<<32;
1341 }
1342 if (hash >= cd->hash_size)
1343 return NULL;
1344 ++*pos;
1345 return cd->hash_table[hash];
1346}
1347
1348static void c_stop(struct seq_file *m, void *p)
Eric Dumazet9a429c42008-01-01 21:58:02 -08001349 __releases(cd->hash_lock)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001350{
1351 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1352 read_unlock(&cd->hash_lock);
1353}
1354
1355static int c_show(struct seq_file *m, void *p)
1356{
1357 struct cache_head *cp = p;
1358 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1359
1360 if (p == SEQ_START_TOKEN)
1361 return cd->cache_show(m, cd, NULL);
1362
1363 ifdebug(CACHE)
NeilBrown4013ede2006-03-27 01:15:07 -08001364 seq_printf(m, "# expiry=%ld refcnt=%d flags=%lx\n",
NeilBrownc5b29f82010-08-12 16:55:22 +10001365 convert_to_wallclock(cp->expiry_time),
1366 atomic_read(&cp->ref.refcount), cp->flags);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001367 cache_get(cp);
1368 if (cache_check(cd, cp, NULL))
1369 /* cache_check does a cache_put on failure */
1370 seq_printf(m, "# ");
NeilBrown200724a2012-07-12 10:37:34 +10001371 else {
1372 if (cache_is_expired(cd, cp))
1373 seq_printf(m, "# ");
Linus Torvalds1da177e2005-04-16 15:20:36 -07001374 cache_put(cp, cd);
NeilBrown200724a2012-07-12 10:37:34 +10001375 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001376
1377 return cd->cache_show(m, cd, cp);
1378}
1379
Philippe De Muyter56b3d972007-07-10 23:07:31 -07001380static const struct seq_operations cache_content_op = {
Linus Torvalds1da177e2005-04-16 15:20:36 -07001381 .start = c_start,
1382 .next = c_next,
1383 .stop = c_stop,
1384 .show = c_show,
1385};
1386
Trond Myklebust173912a2009-08-09 15:14:29 -04001387static int content_open(struct inode *inode, struct file *file,
1388 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001389{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001390 struct handle *han;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001391
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001392 if (!cd || !try_module_get(cd->owner))
1393 return -EACCES;
Pavel Emelyanovec931032007-10-10 02:31:07 -07001394 han = __seq_open_private(file, &cache_content_op, sizeof(*han));
Li Zefana5990ea2010-03-11 14:08:10 -08001395 if (han == NULL) {
1396 module_put(cd->owner);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001397 return -ENOMEM;
Li Zefana5990ea2010-03-11 14:08:10 -08001398 }
Linus Torvalds1da177e2005-04-16 15:20:36 -07001399
1400 han->cd = cd;
Pavel Emelyanovec931032007-10-10 02:31:07 -07001401 return 0;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001402}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001403
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001404static int content_release(struct inode *inode, struct file *file,
1405 struct cache_detail *cd)
1406{
1407 int ret = seq_release_private(inode, file);
1408 module_put(cd->owner);
1409 return ret;
1410}
1411
1412static int open_flush(struct inode *inode, struct file *file,
1413 struct cache_detail *cd)
1414{
1415 if (!cd || !try_module_get(cd->owner))
1416 return -EACCES;
1417 return nonseekable_open(inode, file);
1418}
1419
1420static int release_flush(struct inode *inode, struct file *file,
1421 struct cache_detail *cd)
1422{
1423 module_put(cd->owner);
1424 return 0;
1425}
Linus Torvalds1da177e2005-04-16 15:20:36 -07001426
1427static ssize_t read_flush(struct file *file, char __user *buf,
Trond Myklebust173912a2009-08-09 15:14:29 -04001428 size_t count, loff_t *ppos,
1429 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001430{
Sasha Levin212ba902012-07-17 00:01:26 +02001431 char tbuf[22];
Linus Torvalds1da177e2005-04-16 15:20:36 -07001432 unsigned long p = *ppos;
Chuck Lever01b29692007-10-26 13:31:20 -04001433 size_t len;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001434
Sasha Levin212ba902012-07-17 00:01:26 +02001435 snprintf(tbuf, sizeof(tbuf), "%lu\n", convert_to_wallclock(cd->flush_time));
Linus Torvalds1da177e2005-04-16 15:20:36 -07001436 len = strlen(tbuf);
1437 if (p >= len)
1438 return 0;
1439 len -= p;
Chuck Lever01b29692007-10-26 13:31:20 -04001440 if (len > count)
1441 len = count;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001442 if (copy_to_user(buf, (void*)(tbuf+p), len))
Chuck Lever01b29692007-10-26 13:31:20 -04001443 return -EFAULT;
1444 *ppos += len;
Linus Torvalds1da177e2005-04-16 15:20:36 -07001445 return len;
1446}
1447
Trond Myklebust173912a2009-08-09 15:14:29 -04001448static ssize_t write_flush(struct file *file, const char __user *buf,
1449 size_t count, loff_t *ppos,
1450 struct cache_detail *cd)
Linus Torvalds1da177e2005-04-16 15:20:36 -07001451{
Linus Torvalds1da177e2005-04-16 15:20:36 -07001452 char tbuf[20];
NeilBrownc5b29f82010-08-12 16:55:22 +10001453 char *bp, *ep;
1454
Linus Torvalds1da177e2005-04-16 15:20:36 -07001455 if (*ppos || count > sizeof(tbuf)-1)
1456 return -EINVAL;
1457 if (copy_from_user(tbuf, buf, count))
1458 return -EFAULT;
1459 tbuf[count] = 0;
NeilBrownc5b29f82010-08-12 16:55:22 +10001460 simple_strtoul(tbuf, &ep, 0);
Linus Torvalds1da177e2005-04-16 15:20:36 -07001461 if (*ep && *ep != '\n')
1462 return -EINVAL;
1463
NeilBrownc5b29f82010-08-12 16:55:22 +10001464 bp = tbuf;
1465 cd->flush_time = get_expiry(&bp);
1466 cd->nextcheck = seconds_since_boot();
Linus Torvalds1da177e2005-04-16 15:20:36 -07001467 cache_flush();
1468
1469 *ppos += count;
1470 return count;
1471}
1472
Trond Myklebust173912a2009-08-09 15:14:29 -04001473static ssize_t cache_read_procfs(struct file *filp, char __user *buf,
1474 size_t count, loff_t *ppos)
1475{
Al Virod9dda782013-03-31 18:16:14 -04001476 struct cache_detail *cd = PDE_DATA(file_inode(filp));
Trond Myklebust173912a2009-08-09 15:14:29 -04001477
1478 return cache_read(filp, buf, count, ppos, cd);
1479}
1480
1481static ssize_t cache_write_procfs(struct file *filp, const char __user *buf,
1482 size_t count, loff_t *ppos)
1483{
Al Virod9dda782013-03-31 18:16:14 -04001484 struct cache_detail *cd = PDE_DATA(file_inode(filp));
Trond Myklebust173912a2009-08-09 15:14:29 -04001485
1486 return cache_write(filp, buf, count, ppos, cd);
1487}
1488
1489static unsigned int cache_poll_procfs(struct file *filp, poll_table *wait)
1490{
Al Virod9dda782013-03-31 18:16:14 -04001491 struct cache_detail *cd = PDE_DATA(file_inode(filp));
Trond Myklebust173912a2009-08-09 15:14:29 -04001492
1493 return cache_poll(filp, wait, cd);
1494}
1495
Frederic Weisbeckerd79b6f42010-03-30 07:27:50 +02001496static long cache_ioctl_procfs(struct file *filp,
1497 unsigned int cmd, unsigned long arg)
Trond Myklebust173912a2009-08-09 15:14:29 -04001498{
Al Viro496ad9a2013-01-23 17:07:38 -05001499 struct inode *inode = file_inode(filp);
Al Virod9dda782013-03-31 18:16:14 -04001500 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebust173912a2009-08-09 15:14:29 -04001501
Arnd Bergmanna6f8dbc2010-10-04 21:18:23 +02001502 return cache_ioctl(inode, filp, cmd, arg, cd);
Trond Myklebust173912a2009-08-09 15:14:29 -04001503}
1504
1505static int cache_open_procfs(struct inode *inode, struct file *filp)
1506{
Al Virod9dda782013-03-31 18:16:14 -04001507 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebust173912a2009-08-09 15:14:29 -04001508
1509 return cache_open(inode, filp, cd);
1510}
1511
1512static int cache_release_procfs(struct inode *inode, struct file *filp)
1513{
Al Virod9dda782013-03-31 18:16:14 -04001514 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebust173912a2009-08-09 15:14:29 -04001515
1516 return cache_release(inode, filp, cd);
1517}
1518
1519static const struct file_operations cache_file_operations_procfs = {
1520 .owner = THIS_MODULE,
1521 .llseek = no_llseek,
1522 .read = cache_read_procfs,
1523 .write = cache_write_procfs,
1524 .poll = cache_poll_procfs,
Frederic Weisbeckerd79b6f42010-03-30 07:27:50 +02001525 .unlocked_ioctl = cache_ioctl_procfs, /* for FIONREAD */
Trond Myklebust173912a2009-08-09 15:14:29 -04001526 .open = cache_open_procfs,
1527 .release = cache_release_procfs,
Linus Torvalds1da177e2005-04-16 15:20:36 -07001528};
Trond Myklebust173912a2009-08-09 15:14:29 -04001529
1530static int content_open_procfs(struct inode *inode, struct file *filp)
1531{
Al Virod9dda782013-03-31 18:16:14 -04001532 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebust173912a2009-08-09 15:14:29 -04001533
1534 return content_open(inode, filp, cd);
1535}
1536
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001537static int content_release_procfs(struct inode *inode, struct file *filp)
1538{
Al Virod9dda782013-03-31 18:16:14 -04001539 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001540
1541 return content_release(inode, filp, cd);
1542}
1543
Trond Myklebust173912a2009-08-09 15:14:29 -04001544static const struct file_operations content_file_operations_procfs = {
1545 .open = content_open_procfs,
1546 .read = seq_read,
1547 .llseek = seq_lseek,
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001548 .release = content_release_procfs,
Trond Myklebust173912a2009-08-09 15:14:29 -04001549};
1550
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001551static int open_flush_procfs(struct inode *inode, struct file *filp)
1552{
Al Virod9dda782013-03-31 18:16:14 -04001553 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001554
1555 return open_flush(inode, filp, cd);
1556}
1557
1558static int release_flush_procfs(struct inode *inode, struct file *filp)
1559{
Al Virod9dda782013-03-31 18:16:14 -04001560 struct cache_detail *cd = PDE_DATA(inode);
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001561
1562 return release_flush(inode, filp, cd);
1563}
1564
Trond Myklebust173912a2009-08-09 15:14:29 -04001565static ssize_t read_flush_procfs(struct file *filp, char __user *buf,
1566 size_t count, loff_t *ppos)
1567{
Al Virod9dda782013-03-31 18:16:14 -04001568 struct cache_detail *cd = PDE_DATA(file_inode(filp));
Trond Myklebust173912a2009-08-09 15:14:29 -04001569
1570 return read_flush(filp, buf, count, ppos, cd);
1571}
1572
1573static ssize_t write_flush_procfs(struct file *filp,
1574 const char __user *buf,
1575 size_t count, loff_t *ppos)
1576{
Al Virod9dda782013-03-31 18:16:14 -04001577 struct cache_detail *cd = PDE_DATA(file_inode(filp));
Trond Myklebust173912a2009-08-09 15:14:29 -04001578
1579 return write_flush(filp, buf, count, ppos, cd);
1580}
1581
1582static const struct file_operations cache_flush_operations_procfs = {
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001583 .open = open_flush_procfs,
Trond Myklebust173912a2009-08-09 15:14:29 -04001584 .read = read_flush_procfs,
1585 .write = write_flush_procfs,
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001586 .release = release_flush_procfs,
Arnd Bergmann6038f372010-08-15 18:52:59 +02001587 .llseek = no_llseek,
Trond Myklebust173912a2009-08-09 15:14:29 -04001588};
1589
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001590static void remove_cache_proc_entries(struct cache_detail *cd, struct net *net)
Trond Myklebust173912a2009-08-09 15:14:29 -04001591{
Pavel Emelyanov4f42d0d2010-09-27 14:01:58 +04001592 struct sunrpc_net *sn;
1593
Trond Myklebust173912a2009-08-09 15:14:29 -04001594 if (cd->u.procfs.proc_ent == NULL)
1595 return;
1596 if (cd->u.procfs.flush_ent)
1597 remove_proc_entry("flush", cd->u.procfs.proc_ent);
1598 if (cd->u.procfs.channel_ent)
1599 remove_proc_entry("channel", cd->u.procfs.proc_ent);
1600 if (cd->u.procfs.content_ent)
1601 remove_proc_entry("content", cd->u.procfs.proc_ent);
1602 cd->u.procfs.proc_ent = NULL;
Pavel Emelyanov4f42d0d2010-09-27 14:01:58 +04001603 sn = net_generic(net, sunrpc_net_id);
1604 remove_proc_entry(cd->name, sn->proc_net_rpc);
Trond Myklebust173912a2009-08-09 15:14:29 -04001605}
1606
1607#ifdef CONFIG_PROC_FS
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001608static int create_cache_proc_entries(struct cache_detail *cd, struct net *net)
Trond Myklebust173912a2009-08-09 15:14:29 -04001609{
1610 struct proc_dir_entry *p;
Pavel Emelyanov4f42d0d2010-09-27 14:01:58 +04001611 struct sunrpc_net *sn;
Trond Myklebust173912a2009-08-09 15:14:29 -04001612
Pavel Emelyanov4f42d0d2010-09-27 14:01:58 +04001613 sn = net_generic(net, sunrpc_net_id);
1614 cd->u.procfs.proc_ent = proc_mkdir(cd->name, sn->proc_net_rpc);
Trond Myklebust173912a2009-08-09 15:14:29 -04001615 if (cd->u.procfs.proc_ent == NULL)
1616 goto out_nomem;
1617 cd->u.procfs.channel_ent = NULL;
1618 cd->u.procfs.content_ent = NULL;
1619
1620 p = proc_create_data("flush", S_IFREG|S_IRUSR|S_IWUSR,
1621 cd->u.procfs.proc_ent,
1622 &cache_flush_operations_procfs, cd);
1623 cd->u.procfs.flush_ent = p;
1624 if (p == NULL)
1625 goto out_nomem;
1626
Stanislav Kinsbursky2d438332013-02-04 14:02:50 +03001627 if (cd->cache_request || cd->cache_parse) {
Trond Myklebust173912a2009-08-09 15:14:29 -04001628 p = proc_create_data("channel", S_IFREG|S_IRUSR|S_IWUSR,
1629 cd->u.procfs.proc_ent,
1630 &cache_file_operations_procfs, cd);
1631 cd->u.procfs.channel_ent = p;
1632 if (p == NULL)
1633 goto out_nomem;
1634 }
1635 if (cd->cache_show) {
Yanchuan Nianec168672013-01-04 19:45:35 +08001636 p = proc_create_data("content", S_IFREG|S_IRUSR,
Trond Myklebust173912a2009-08-09 15:14:29 -04001637 cd->u.procfs.proc_ent,
1638 &content_file_operations_procfs, cd);
1639 cd->u.procfs.content_ent = p;
1640 if (p == NULL)
1641 goto out_nomem;
1642 }
1643 return 0;
1644out_nomem:
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001645 remove_cache_proc_entries(cd, net);
Trond Myklebust173912a2009-08-09 15:14:29 -04001646 return -ENOMEM;
1647}
1648#else /* CONFIG_PROC_FS */
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001649static int create_cache_proc_entries(struct cache_detail *cd, struct net *net)
Trond Myklebust173912a2009-08-09 15:14:29 -04001650{
1651 return 0;
1652}
1653#endif
1654
Artem Bityutskiy8eab9452010-07-01 18:05:56 +03001655void __init cache_initialize(void)
1656{
Tejun Heo203b42f2012-08-21 13:18:23 -07001657 INIT_DEFERRABLE_WORK(&cache_cleaner, do_cache_clean);
Artem Bityutskiy8eab9452010-07-01 18:05:56 +03001658}
1659
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001660int cache_register_net(struct cache_detail *cd, struct net *net)
Trond Myklebust173912a2009-08-09 15:14:29 -04001661{
1662 int ret;
1663
1664 sunrpc_init_cache_detail(cd);
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001665 ret = create_cache_proc_entries(cd, net);
Trond Myklebust173912a2009-08-09 15:14:29 -04001666 if (ret)
1667 sunrpc_destroy_cache_detail(cd);
1668 return ret;
1669}
Stanislav Kinsburskyf5c8593b2011-12-07 12:57:56 +03001670EXPORT_SYMBOL_GPL(cache_register_net);
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001671
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001672void cache_unregister_net(struct cache_detail *cd, struct net *net)
1673{
1674 remove_cache_proc_entries(cd, net);
1675 sunrpc_destroy_cache_detail(cd);
1676}
Stanislav Kinsburskyf5c8593b2011-12-07 12:57:56 +03001677EXPORT_SYMBOL_GPL(cache_unregister_net);
Pavel Emelyanov593ce162010-09-27 14:00:15 +04001678
Stanislav Kinsbursky0a402d52012-01-19 21:42:21 +04001679struct cache_detail *cache_create_net(struct cache_detail *tmpl, struct net *net)
Trond Myklebust173912a2009-08-09 15:14:29 -04001680{
Stanislav Kinsbursky0a402d52012-01-19 21:42:21 +04001681 struct cache_detail *cd;
1682
1683 cd = kmemdup(tmpl, sizeof(struct cache_detail), GFP_KERNEL);
1684 if (cd == NULL)
1685 return ERR_PTR(-ENOMEM);
1686
1687 cd->hash_table = kzalloc(cd->hash_size * sizeof(struct cache_head *),
1688 GFP_KERNEL);
1689 if (cd->hash_table == NULL) {
1690 kfree(cd);
1691 return ERR_PTR(-ENOMEM);
1692 }
1693 cd->net = net;
1694 return cd;
Trond Myklebust173912a2009-08-09 15:14:29 -04001695}
Stanislav Kinsbursky0a402d52012-01-19 21:42:21 +04001696EXPORT_SYMBOL_GPL(cache_create_net);
1697
1698void cache_destroy_net(struct cache_detail *cd, struct net *net)
1699{
1700 kfree(cd->hash_table);
1701 kfree(cd);
1702}
1703EXPORT_SYMBOL_GPL(cache_destroy_net);
Trond Myklebust8854e822009-08-09 15:14:30 -04001704
1705static ssize_t cache_read_pipefs(struct file *filp, char __user *buf,
1706 size_t count, loff_t *ppos)
1707{
Al Viro496ad9a2013-01-23 17:07:38 -05001708 struct cache_detail *cd = RPC_I(file_inode(filp))->private;
Trond Myklebust8854e822009-08-09 15:14:30 -04001709
1710 return cache_read(filp, buf, count, ppos, cd);
1711}
1712
1713static ssize_t cache_write_pipefs(struct file *filp, const char __user *buf,
1714 size_t count, loff_t *ppos)
1715{
Al Viro496ad9a2013-01-23 17:07:38 -05001716 struct cache_detail *cd = RPC_I(file_inode(filp))->private;
Trond Myklebust8854e822009-08-09 15:14:30 -04001717
1718 return cache_write(filp, buf, count, ppos, cd);
1719}
1720
1721static unsigned int cache_poll_pipefs(struct file *filp, poll_table *wait)
1722{
Al Viro496ad9a2013-01-23 17:07:38 -05001723 struct cache_detail *cd = RPC_I(file_inode(filp))->private;
Trond Myklebust8854e822009-08-09 15:14:30 -04001724
1725 return cache_poll(filp, wait, cd);
1726}
1727
Frederic Weisbecker9918ff22010-05-19 15:08:17 +02001728static long cache_ioctl_pipefs(struct file *filp,
Trond Myklebust8854e822009-08-09 15:14:30 -04001729 unsigned int cmd, unsigned long arg)
1730{
Al Viro496ad9a2013-01-23 17:07:38 -05001731 struct inode *inode = file_inode(filp);
Trond Myklebust8854e822009-08-09 15:14:30 -04001732 struct cache_detail *cd = RPC_I(inode)->private;
1733
Arnd Bergmanna6f8dbc2010-10-04 21:18:23 +02001734 return cache_ioctl(inode, filp, cmd, arg, cd);
Trond Myklebust8854e822009-08-09 15:14:30 -04001735}
1736
1737static int cache_open_pipefs(struct inode *inode, struct file *filp)
1738{
1739 struct cache_detail *cd = RPC_I(inode)->private;
1740
1741 return cache_open(inode, filp, cd);
1742}
1743
1744static int cache_release_pipefs(struct inode *inode, struct file *filp)
1745{
1746 struct cache_detail *cd = RPC_I(inode)->private;
1747
1748 return cache_release(inode, filp, cd);
1749}
1750
1751const struct file_operations cache_file_operations_pipefs = {
1752 .owner = THIS_MODULE,
1753 .llseek = no_llseek,
1754 .read = cache_read_pipefs,
1755 .write = cache_write_pipefs,
1756 .poll = cache_poll_pipefs,
Frederic Weisbecker9918ff22010-05-19 15:08:17 +02001757 .unlocked_ioctl = cache_ioctl_pipefs, /* for FIONREAD */
Trond Myklebust8854e822009-08-09 15:14:30 -04001758 .open = cache_open_pipefs,
1759 .release = cache_release_pipefs,
1760};
1761
1762static int content_open_pipefs(struct inode *inode, struct file *filp)
1763{
1764 struct cache_detail *cd = RPC_I(inode)->private;
1765
1766 return content_open(inode, filp, cd);
1767}
1768
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001769static int content_release_pipefs(struct inode *inode, struct file *filp)
1770{
1771 struct cache_detail *cd = RPC_I(inode)->private;
1772
1773 return content_release(inode, filp, cd);
1774}
1775
Trond Myklebust8854e822009-08-09 15:14:30 -04001776const struct file_operations content_file_operations_pipefs = {
1777 .open = content_open_pipefs,
1778 .read = seq_read,
1779 .llseek = seq_lseek,
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001780 .release = content_release_pipefs,
Trond Myklebust8854e822009-08-09 15:14:30 -04001781};
1782
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001783static int open_flush_pipefs(struct inode *inode, struct file *filp)
1784{
1785 struct cache_detail *cd = RPC_I(inode)->private;
1786
1787 return open_flush(inode, filp, cd);
1788}
1789
1790static int release_flush_pipefs(struct inode *inode, struct file *filp)
1791{
1792 struct cache_detail *cd = RPC_I(inode)->private;
1793
1794 return release_flush(inode, filp, cd);
1795}
1796
Trond Myklebust8854e822009-08-09 15:14:30 -04001797static ssize_t read_flush_pipefs(struct file *filp, char __user *buf,
1798 size_t count, loff_t *ppos)
1799{
Al Viro496ad9a2013-01-23 17:07:38 -05001800 struct cache_detail *cd = RPC_I(file_inode(filp))->private;
Trond Myklebust8854e822009-08-09 15:14:30 -04001801
1802 return read_flush(filp, buf, count, ppos, cd);
1803}
1804
1805static ssize_t write_flush_pipefs(struct file *filp,
1806 const char __user *buf,
1807 size_t count, loff_t *ppos)
1808{
Al Viro496ad9a2013-01-23 17:07:38 -05001809 struct cache_detail *cd = RPC_I(file_inode(filp))->private;
Trond Myklebust8854e822009-08-09 15:14:30 -04001810
1811 return write_flush(filp, buf, count, ppos, cd);
1812}
1813
1814const struct file_operations cache_flush_operations_pipefs = {
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001815 .open = open_flush_pipefs,
Trond Myklebust8854e822009-08-09 15:14:30 -04001816 .read = read_flush_pipefs,
1817 .write = write_flush_pipefs,
Trond Myklebustf7e86ab2009-08-19 18:13:00 -04001818 .release = release_flush_pipefs,
Arnd Bergmann6038f372010-08-15 18:52:59 +02001819 .llseek = no_llseek,
Trond Myklebust8854e822009-08-09 15:14:30 -04001820};
1821
1822int sunrpc_cache_register_pipefs(struct dentry *parent,
Al Viro64f14262011-07-25 00:35:13 -04001823 const char *name, umode_t umode,
Trond Myklebust8854e822009-08-09 15:14:30 -04001824 struct cache_detail *cd)
1825{
Al Viroa95e6912013-07-14 16:43:54 +04001826 struct dentry *dir = rpc_create_cache_dir(parent, name, umode, cd);
1827 if (IS_ERR(dir))
1828 return PTR_ERR(dir);
1829 cd->u.pipefs.dir = dir;
1830 return 0;
Trond Myklebust8854e822009-08-09 15:14:30 -04001831}
1832EXPORT_SYMBOL_GPL(sunrpc_cache_register_pipefs);
1833
1834void sunrpc_cache_unregister_pipefs(struct cache_detail *cd)
1835{
1836 rpc_remove_cache_dir(cd->u.pipefs.dir);
1837 cd->u.pipefs.dir = NULL;
Trond Myklebust8854e822009-08-09 15:14:30 -04001838}
1839EXPORT_SYMBOL_GPL(sunrpc_cache_unregister_pipefs);
1840