4 * Generic code for various authentication-related caches
5 * used by sunrpc clients and servers.
7 * Copyright (C) 2002 Neil Brown <neilb@cse.unsw.edu.au>
9 * Released under terms in GPL version 2. See COPYING.
13 #include <linux/types.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>
29 #include <linux/mutex.h>
30 #include <asm/ioctls.h>
31 #include <linux/sunrpc/types.h>
32 #include <linux/sunrpc/cache.h>
33 #include <linux/sunrpc/stats.h>
35 #define RPCDBG_FACILITY RPCDBG_CACHE
37 static int cache_defer_req(struct cache_req *req, struct cache_head *item);
38 static void cache_revisit_request(struct cache_head *item);
40 static void cache_init(struct cache_head *h)
42 time_t now = get_seconds();
46 h->expiry_time = now + CACHE_NEW_EXPIRY;
47 h->last_refresh = now;
50 struct cache_head *sunrpc_cache_lookup(struct cache_detail *detail,
51 struct cache_head *key, int hash)
53 struct cache_head **head, **hp;
54 struct cache_head *new = NULL;
56 head = &detail->hash_table[hash];
58 read_lock(&detail->hash_lock);
60 for (hp=head; *hp != NULL ; hp = &(*hp)->next) {
61 struct cache_head *tmp = *hp;
62 if (detail->match(tmp, key)) {
64 read_unlock(&detail->hash_lock);
68 read_unlock(&detail->hash_lock);
69 /* Didn't find anything, insert an empty entry */
71 new = detail->alloc();
74 /* must fully initialise 'new', else
75 * we might get lose if we need to
79 detail->init(new, key);
81 write_lock(&detail->hash_lock);
83 /* check if entry appeared while we slept */
84 for (hp=head; *hp != NULL ; hp = &(*hp)->next) {
85 struct cache_head *tmp = *hp;
86 if (detail->match(tmp, key)) {
88 write_unlock(&detail->hash_lock);
89 cache_put(new, detail);
97 write_unlock(&detail->hash_lock);
101 EXPORT_SYMBOL(sunrpc_cache_lookup);
104 static void queue_loose(struct cache_detail *detail, struct cache_head *ch);
106 static int cache_fresh_locked(struct cache_head *head, time_t expiry)
108 head->expiry_time = expiry;
109 head->last_refresh = get_seconds();
110 return !test_and_set_bit(CACHE_VALID, &head->flags);
113 static void cache_fresh_unlocked(struct cache_head *head,
114 struct cache_detail *detail, int new)
117 cache_revisit_request(head);
118 if (test_and_clear_bit(CACHE_PENDING, &head->flags)) {
119 cache_revisit_request(head);
120 queue_loose(detail, head);
124 struct cache_head *sunrpc_cache_update(struct cache_detail *detail,
125 struct cache_head *new, struct cache_head *old, int hash)
127 /* The 'old' entry is to be replaced by 'new'.
128 * If 'old' is not VALID, we update it directly,
129 * otherwise we need to replace it
131 struct cache_head **head;
132 struct cache_head *tmp;
135 if (!test_bit(CACHE_VALID, &old->flags)) {
136 write_lock(&detail->hash_lock);
137 if (!test_bit(CACHE_VALID, &old->flags)) {
138 if (test_bit(CACHE_NEGATIVE, &new->flags))
139 set_bit(CACHE_NEGATIVE, &old->flags);
141 detail->update(old, new);
142 is_new = cache_fresh_locked(old, new->expiry_time);
143 write_unlock(&detail->hash_lock);
144 cache_fresh_unlocked(old, detail, is_new);
147 write_unlock(&detail->hash_lock);
149 /* We need to insert a new entry */
150 tmp = detail->alloc();
152 cache_put(old, detail);
156 detail->init(tmp, old);
157 head = &detail->hash_table[hash];
159 write_lock(&detail->hash_lock);
160 if (test_bit(CACHE_NEGATIVE, &new->flags))
161 set_bit(CACHE_NEGATIVE, &tmp->flags);
163 detail->update(tmp, new);
168 is_new = cache_fresh_locked(tmp, new->expiry_time);
169 cache_fresh_locked(old, 0);
170 write_unlock(&detail->hash_lock);
171 cache_fresh_unlocked(tmp, detail, is_new);
172 cache_fresh_unlocked(old, detail, 0);
173 cache_put(old, detail);
176 EXPORT_SYMBOL(sunrpc_cache_update);
178 static int cache_make_upcall(struct cache_detail *detail, struct cache_head *h);
180 * This is the generic cache management routine for all
181 * the authentication caches.
182 * It checks the currency of a cache item and will (later)
183 * initiate an upcall to fill it if needed.
186 * Returns 0 if the cache_head can be used, or cache_puts it and returns
187 * -EAGAIN if upcall is pending,
188 * -ETIMEDOUT if upcall failed and should be retried,
189 * -ENOENT if cache entry was negative
191 int cache_check(struct cache_detail *detail,
192 struct cache_head *h, struct cache_req *rqstp)
195 long refresh_age, age;
197 /* First decide return status as best we can */
198 if (!test_bit(CACHE_VALID, &h->flags) ||
199 h->expiry_time < get_seconds())
201 else if (detail->flush_time > h->last_refresh)
205 if (test_bit(CACHE_NEGATIVE, &h->flags))
210 /* now see if we want to start an upcall */
211 refresh_age = (h->expiry_time - h->last_refresh);
212 age = get_seconds() - h->last_refresh;
217 } else if (rv == -EAGAIN || age > refresh_age/2) {
218 dprintk("RPC: Want update, refage=%ld, age=%ld\n",
220 if (!test_and_set_bit(CACHE_PENDING, &h->flags)) {
221 switch (cache_make_upcall(detail, h)) {
223 clear_bit(CACHE_PENDING, &h->flags);
225 set_bit(CACHE_NEGATIVE, &h->flags);
226 cache_fresh_unlocked(h, detail,
227 cache_fresh_locked(h, get_seconds()+CACHE_NEW_EXPIRY));
233 clear_bit(CACHE_PENDING, &h->flags);
234 cache_revisit_request(h);
241 if (cache_defer_req(rqstp, h) != 0)
245 cache_put(h, detail);
250 * caches need to be periodically cleaned.
251 * For this we maintain a list of cache_detail and
252 * a current pointer into that list and into the table
255 * Each time clean_cache is called it finds the next non-empty entry
256 * in the current table and walks the list in that entry
257 * looking for entries that can be removed.
259 * An entry gets removed if:
260 * - The expiry is before current time
261 * - The last_refresh time is before the flush_time for that cache
263 * later we might drop old entries with non-NEVER expiry if that table
264 * is getting 'full' for some definition of 'full'
266 * The question of "how often to scan a table" is an interesting one
267 * and is answered in part by the use of the "nextcheck" field in the
269 * When a scan of a table begins, the nextcheck field is set to a time
270 * that is well into the future.
271 * While scanning, if an expiry time is found that is earlier than the
272 * current nextcheck time, nextcheck is set to that expiry time.
273 * If the flush_time is ever set to a time earlier than the nextcheck
274 * time, the nextcheck time is then set to that flush_time.
276 * A table is then only scanned if the current time is at least
277 * the nextcheck time.
281 static LIST_HEAD(cache_list);
282 static DEFINE_SPINLOCK(cache_list_lock);
283 static struct cache_detail *current_detail;
284 static int current_index;
286 static const struct file_operations cache_file_operations;
287 static const struct file_operations content_file_operations;
288 static const struct file_operations cache_flush_operations;
290 static void do_cache_clean(struct work_struct *work);
291 static DECLARE_DELAYED_WORK(cache_cleaner, do_cache_clean);
293 void cache_register(struct cache_detail *cd)
295 cd->proc_ent = proc_mkdir(cd->name, proc_net_rpc);
297 struct proc_dir_entry *p;
298 cd->proc_ent->owner = cd->owner;
299 cd->channel_ent = cd->content_ent = NULL;
301 p = create_proc_entry("flush", S_IFREG|S_IRUSR|S_IWUSR,
305 p->proc_fops = &cache_flush_operations;
306 p->owner = cd->owner;
310 if (cd->cache_request || cd->cache_parse) {
311 p = create_proc_entry("channel", S_IFREG|S_IRUSR|S_IWUSR,
315 p->proc_fops = &cache_file_operations;
316 p->owner = cd->owner;
320 if (cd->cache_show) {
321 p = create_proc_entry("content", S_IFREG|S_IRUSR|S_IWUSR,
325 p->proc_fops = &content_file_operations;
326 p->owner = cd->owner;
331 rwlock_init(&cd->hash_lock);
332 INIT_LIST_HEAD(&cd->queue);
333 spin_lock(&cache_list_lock);
336 atomic_set(&cd->readers, 0);
339 list_add(&cd->others, &cache_list);
340 spin_unlock(&cache_list_lock);
342 /* start the cleaning process */
343 schedule_delayed_work(&cache_cleaner, 0);
346 void cache_unregister(struct cache_detail *cd)
349 spin_lock(&cache_list_lock);
350 write_lock(&cd->hash_lock);
351 if (cd->entries || atomic_read(&cd->inuse)) {
352 write_unlock(&cd->hash_lock);
353 spin_unlock(&cache_list_lock);
356 if (current_detail == cd)
357 current_detail = NULL;
358 list_del_init(&cd->others);
359 write_unlock(&cd->hash_lock);
360 spin_unlock(&cache_list_lock);
363 remove_proc_entry("flush", cd->proc_ent);
365 remove_proc_entry("channel", cd->proc_ent);
367 remove_proc_entry("content", cd->proc_ent);
370 remove_proc_entry(cd->name, proc_net_rpc);
372 if (list_empty(&cache_list)) {
373 /* module must be being unloaded so its safe to kill the worker */
374 cancel_delayed_work_sync(&cache_cleaner);
378 printk(KERN_ERR "nfsd: failed to unregister %s cache\n", cd->name);
381 /* clean cache tries to find something to clean
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.
387 static int cache_clean(void)
390 struct list_head *next;
392 spin_lock(&cache_list_lock);
394 /* find a suitable table if we don't already have one */
395 while (current_detail == NULL ||
396 current_index >= current_detail->hash_size) {
398 next = current_detail->others.next;
400 next = cache_list.next;
401 if (next == &cache_list) {
402 current_detail = NULL;
403 spin_unlock(&cache_list_lock);
406 current_detail = list_entry(next, struct cache_detail, others);
407 if (current_detail->nextcheck > get_seconds())
408 current_index = current_detail->hash_size;
411 current_detail->nextcheck = get_seconds()+30*60;
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)
421 /* find a cleanable entry in the bucket and clean it, or set to next bucket */
423 if (current_detail && current_index < current_detail->hash_size) {
424 struct cache_head *ch, **cp;
425 struct cache_detail *d;
427 write_lock(¤t_detail->hash_lock);
429 /* Ok, now to clean this strand */
431 cp = & current_detail->hash_table[current_index];
433 for (; ch; cp= & ch->next, ch= *cp) {
434 if (current_detail->nextcheck > ch->expiry_time)
435 current_detail->nextcheck = ch->expiry_time+1;
436 if (ch->expiry_time >= get_seconds()
437 && ch->last_refresh >= current_detail->flush_time
440 if (test_and_clear_bit(CACHE_PENDING, &ch->flags))
441 queue_loose(current_detail, ch);
443 if (atomic_read(&ch->ref.refcount) == 1)
449 current_detail->entries--;
452 write_unlock(¤t_detail->hash_lock);
456 spin_unlock(&cache_list_lock);
460 spin_unlock(&cache_list_lock);
466 * We want to regularly clean the cache, so we need to schedule some work ...
468 static void do_cache_clean(struct work_struct *work)
471 if (cache_clean() == -1)
474 if (list_empty(&cache_list))
478 schedule_delayed_work(&cache_cleaner, delay);
483 * Clean all caches promptly. This just calls cache_clean
484 * repeatedly until we are sure that every cache has had a chance to
487 void cache_flush(void)
489 while (cache_clean() != -1)
491 while (cache_clean() != -1)
495 void cache_purge(struct cache_detail *detail)
497 detail->flush_time = LONG_MAX;
498 detail->nextcheck = get_seconds();
500 detail->flush_time = 1;
506 * Deferral and Revisiting of Requests.
508 * If a cache lookup finds a pending entry, we
509 * need to defer the request and revisit it later.
510 * All deferred requests are stored in a hash table,
511 * indexed by "struct cache_head *".
512 * As it may be wasteful to store a whole request
513 * structure, we allow the request to provide a
514 * deferred form, which must contain a
515 * 'struct cache_deferred_req'
516 * This cache_deferred_req contains a method to allow
517 * it to be revisited when cache info is available
520 #define DFR_HASHSIZE (PAGE_SIZE/sizeof(struct list_head))
521 #define DFR_HASH(item) ((((long)item)>>4 ^ (((long)item)>>13)) % DFR_HASHSIZE)
523 #define DFR_MAX 300 /* ??? */
525 static DEFINE_SPINLOCK(cache_defer_lock);
526 static LIST_HEAD(cache_defer_list);
527 static struct list_head cache_defer_hash[DFR_HASHSIZE];
528 static int cache_defer_cnt;
530 static int cache_defer_req(struct cache_req *req, struct cache_head *item)
532 struct cache_deferred_req *dreq;
533 int hash = DFR_HASH(item);
535 if (cache_defer_cnt >= DFR_MAX) {
536 /* too much in the cache, randomly drop this one,
537 * or continue and drop the oldest below
542 dreq = req->defer(req);
547 dreq->recv_time = get_seconds();
549 spin_lock(&cache_defer_lock);
551 list_add(&dreq->recent, &cache_defer_list);
553 if (cache_defer_hash[hash].next == NULL)
554 INIT_LIST_HEAD(&cache_defer_hash[hash]);
555 list_add(&dreq->hash, &cache_defer_hash[hash]);
557 /* it is in, now maybe clean up */
559 if (++cache_defer_cnt > DFR_MAX) {
560 dreq = list_entry(cache_defer_list.prev,
561 struct cache_deferred_req, recent);
562 list_del(&dreq->recent);
563 list_del(&dreq->hash);
566 spin_unlock(&cache_defer_lock);
569 /* there was one too many */
570 dreq->revisit(dreq, 1);
572 if (!test_bit(CACHE_PENDING, &item->flags)) {
573 /* must have just been validated... */
574 cache_revisit_request(item);
579 static void cache_revisit_request(struct cache_head *item)
581 struct cache_deferred_req *dreq;
582 struct list_head pending;
584 struct list_head *lp;
585 int hash = DFR_HASH(item);
587 INIT_LIST_HEAD(&pending);
588 spin_lock(&cache_defer_lock);
590 lp = cache_defer_hash[hash].next;
592 while (lp != &cache_defer_hash[hash]) {
593 dreq = list_entry(lp, struct cache_deferred_req, hash);
595 if (dreq->item == item) {
596 list_del(&dreq->hash);
597 list_move(&dreq->recent, &pending);
602 spin_unlock(&cache_defer_lock);
604 while (!list_empty(&pending)) {
605 dreq = list_entry(pending.next, struct cache_deferred_req, recent);
606 list_del_init(&dreq->recent);
607 dreq->revisit(dreq, 0);
611 void cache_clean_deferred(void *owner)
613 struct cache_deferred_req *dreq, *tmp;
614 struct list_head pending;
617 INIT_LIST_HEAD(&pending);
618 spin_lock(&cache_defer_lock);
620 list_for_each_entry_safe(dreq, tmp, &cache_defer_list, recent) {
621 if (dreq->owner == owner) {
622 list_del(&dreq->hash);
623 list_move(&dreq->recent, &pending);
627 spin_unlock(&cache_defer_lock);
629 while (!list_empty(&pending)) {
630 dreq = list_entry(pending.next, struct cache_deferred_req, recent);
631 list_del_init(&dreq->recent);
632 dreq->revisit(dreq, 1);
637 * communicate with user-space
639 * We have a magic /proc file - /proc/sunrpc/<cachename>/channel.
640 * On read, you get a full request, or block.
641 * On write, an update request is processed.
642 * Poll works if anything to read, and always allows write.
644 * Implemented by linked list of requests. Each open file has
645 * a ->private that also exists in this list. New requests are added
646 * to the end and may wakeup and preceding readers.
647 * New readers are added to the head. If, on read, an item is found with
648 * CACHE_UPCALLING clear, we free it from the list.
652 static DEFINE_SPINLOCK(queue_lock);
653 static DEFINE_MUTEX(queue_io_mutex);
656 struct list_head list;
657 int reader; /* if 0, then request */
659 struct cache_request {
660 struct cache_queue q;
661 struct cache_head *item;
666 struct cache_reader {
667 struct cache_queue q;
668 int offset; /* if non-0, we have a refcnt on next request */
672 cache_read(struct file *filp, char __user *buf, size_t count, loff_t *ppos)
674 struct cache_reader *rp = filp->private_data;
675 struct cache_request *rq;
676 struct cache_detail *cd = PDE(filp->f_path.dentry->d_inode)->data;
682 mutex_lock(&queue_io_mutex); /* protect against multiple concurrent
683 * readers on this file */
685 spin_lock(&queue_lock);
686 /* need to find next request */
687 while (rp->q.list.next != &cd->queue &&
688 list_entry(rp->q.list.next, struct cache_queue, list)
690 struct list_head *next = rp->q.list.next;
691 list_move(&rp->q.list, next);
693 if (rp->q.list.next == &cd->queue) {
694 spin_unlock(&queue_lock);
695 mutex_unlock(&queue_io_mutex);
699 rq = container_of(rp->q.list.next, struct cache_request, q.list);
700 BUG_ON(rq->q.reader);
703 spin_unlock(&queue_lock);
705 if (rp->offset == 0 && !test_bit(CACHE_PENDING, &rq->item->flags)) {
707 spin_lock(&queue_lock);
708 list_move(&rp->q.list, &rq->q.list);
709 spin_unlock(&queue_lock);
711 if (rp->offset + count > rq->len)
712 count = rq->len - rp->offset;
714 if (copy_to_user(buf, rq->buf + rp->offset, count))
717 if (rp->offset >= rq->len) {
719 spin_lock(&queue_lock);
720 list_move(&rp->q.list, &rq->q.list);
721 spin_unlock(&queue_lock);
726 if (rp->offset == 0) {
727 /* need to release rq */
728 spin_lock(&queue_lock);
730 if (rq->readers == 0 &&
731 !test_bit(CACHE_PENDING, &rq->item->flags)) {
732 list_del(&rq->q.list);
733 spin_unlock(&queue_lock);
734 cache_put(rq->item, cd);
738 spin_unlock(&queue_lock);
742 mutex_unlock(&queue_io_mutex);
743 return err ? err : count;
746 static char write_buf[8192]; /* protected by queue_io_mutex */
749 cache_write(struct file *filp, const char __user *buf, size_t count,
753 struct cache_detail *cd = PDE(filp->f_path.dentry->d_inode)->data;
757 if (count >= sizeof(write_buf))
760 mutex_lock(&queue_io_mutex);
762 if (copy_from_user(write_buf, buf, count)) {
763 mutex_unlock(&queue_io_mutex);
766 write_buf[count] = '\0';
768 err = cd->cache_parse(cd, write_buf, count);
772 mutex_unlock(&queue_io_mutex);
773 return err ? err : count;
776 static DECLARE_WAIT_QUEUE_HEAD(queue_wait);
779 cache_poll(struct file *filp, poll_table *wait)
782 struct cache_reader *rp = filp->private_data;
783 struct cache_queue *cq;
784 struct cache_detail *cd = PDE(filp->f_path.dentry->d_inode)->data;
786 poll_wait(filp, &queue_wait, wait);
788 /* alway allow write */
789 mask = POLL_OUT | POLLWRNORM;
794 spin_lock(&queue_lock);
796 for (cq= &rp->q; &cq->list != &cd->queue;
797 cq = list_entry(cq->list.next, struct cache_queue, list))
799 mask |= POLLIN | POLLRDNORM;
802 spin_unlock(&queue_lock);
807 cache_ioctl(struct inode *ino, struct file *filp,
808 unsigned int cmd, unsigned long arg)
811 struct cache_reader *rp = filp->private_data;
812 struct cache_queue *cq;
813 struct cache_detail *cd = PDE(ino)->data;
815 if (cmd != FIONREAD || !rp)
818 spin_lock(&queue_lock);
820 /* only find the length remaining in current request,
821 * or the length of the next request
823 for (cq= &rp->q; &cq->list != &cd->queue;
824 cq = list_entry(cq->list.next, struct cache_queue, list))
826 struct cache_request *cr =
827 container_of(cq, struct cache_request, q);
828 len = cr->len - rp->offset;
831 spin_unlock(&queue_lock);
833 return put_user(len, (int __user *)arg);
837 cache_open(struct inode *inode, struct file *filp)
839 struct cache_reader *rp = NULL;
841 nonseekable_open(inode, filp);
842 if (filp->f_mode & FMODE_READ) {
843 struct cache_detail *cd = PDE(inode)->data;
845 rp = kmalloc(sizeof(*rp), GFP_KERNEL);
850 atomic_inc(&cd->readers);
851 spin_lock(&queue_lock);
852 list_add(&rp->q.list, &cd->queue);
853 spin_unlock(&queue_lock);
855 filp->private_data = rp;
860 cache_release(struct inode *inode, struct file *filp)
862 struct cache_reader *rp = filp->private_data;
863 struct cache_detail *cd = PDE(inode)->data;
866 spin_lock(&queue_lock);
868 struct cache_queue *cq;
869 for (cq= &rp->q; &cq->list != &cd->queue;
870 cq = list_entry(cq->list.next, struct cache_queue, list))
872 container_of(cq, struct cache_request, q)
878 list_del(&rp->q.list);
879 spin_unlock(&queue_lock);
881 filp->private_data = NULL;
884 cd->last_close = get_seconds();
885 atomic_dec(&cd->readers);
892 static const struct file_operations cache_file_operations = {
893 .owner = THIS_MODULE,
896 .write = cache_write,
898 .ioctl = cache_ioctl, /* for FIONREAD */
900 .release = cache_release,
904 static void queue_loose(struct cache_detail *detail, struct cache_head *ch)
906 struct cache_queue *cq;
907 spin_lock(&queue_lock);
908 list_for_each_entry(cq, &detail->queue, list)
910 struct cache_request *cr = container_of(cq, struct cache_request, q);
913 if (cr->readers != 0)
915 list_del(&cr->q.list);
916 spin_unlock(&queue_lock);
917 cache_put(cr->item, detail);
922 spin_unlock(&queue_lock);
926 * Support routines for text-based upcalls.
927 * Fields are separated by spaces.
928 * Fields are either mangled to quote space tab newline slosh with slosh
929 * or a hexified with a leading \x
930 * Record is terminated with newline.
934 void qword_add(char **bpp, int *lp, char *str)
942 while ((c=*str++) && len)
950 *bp++ = '0' + ((c & 0300)>>6);
951 *bp++ = '0' + ((c & 0070)>>3);
952 *bp++ = '0' + ((c & 0007)>>0);
960 if (c || len <1) len = -1;
969 void qword_addhex(char **bpp, int *lp, char *buf, int blen)
980 while (blen && len >= 2) {
981 unsigned char c = *buf++;
982 *bp++ = '0' + ((c&0xf0)>>4) + (c>=0xa0)*('a'-'9'-1);
983 *bp++ = '0' + (c&0x0f) + ((c&0x0f)>=0x0a)*('a'-'9'-1);
988 if (blen || len<1) len = -1;
997 static void warn_no_listener(struct cache_detail *detail)
999 if (detail->last_warn != detail->last_close) {
1000 detail->last_warn = detail->last_close;
1001 if (detail->warn_no_listener)
1002 detail->warn_no_listener(detail);
1007 * register an upcall request to user-space.
1008 * Each request is at most one page long.
1010 static int cache_make_upcall(struct cache_detail *detail, struct cache_head *h)
1014 struct cache_request *crq;
1018 if (detail->cache_request == NULL)
1021 if (atomic_read(&detail->readers) == 0 &&
1022 detail->last_close < get_seconds() - 30) {
1023 warn_no_listener(detail);
1027 buf = kmalloc(PAGE_SIZE, GFP_KERNEL);
1031 crq = kmalloc(sizeof (*crq), GFP_KERNEL);
1037 bp = buf; len = PAGE_SIZE;
1039 detail->cache_request(detail, h, &bp, &len);
1047 crq->item = cache_get(h);
1049 crq->len = PAGE_SIZE - len;
1051 spin_lock(&queue_lock);
1052 list_add_tail(&crq->q.list, &detail->queue);
1053 spin_unlock(&queue_lock);
1054 wake_up(&queue_wait);
1059 * parse a message from user-space and pass it
1060 * to an appropriate cache
1061 * Messages are, like requests, separated into fields by
1062 * spaces and dequotes as \xHEXSTRING or embedded \nnn octal
1065 * reply cachename expiry key ... content....
1067 * key and content are both parsed by cache
1070 #define isodigit(c) (isdigit(c) && c <= '7')
1071 int qword_get(char **bpp, char *dest, int bufsize)
1073 /* return bytes copied, or -1 on error */
1077 while (*bp == ' ') bp++;
1079 if (bp[0] == '\\' && bp[1] == 'x') {
1082 while (isxdigit(bp[0]) && isxdigit(bp[1]) && len < bufsize) {
1083 int byte = isdigit(*bp) ? *bp-'0' : toupper(*bp)-'A'+10;
1086 byte |= isdigit(*bp) ? *bp-'0' : toupper(*bp)-'A'+10;
1092 /* text with \nnn octal quoting */
1093 while (*bp != ' ' && *bp != '\n' && *bp && len < bufsize-1) {
1095 isodigit(bp[1]) && (bp[1] <= '3') &&
1098 int byte = (*++bp -'0');
1100 byte = (byte << 3) | (*bp++ - '0');
1101 byte = (byte << 3) | (*bp++ - '0');
1111 if (*bp != ' ' && *bp != '\n' && *bp != '\0')
1113 while (*bp == ' ') bp++;
1121 * support /proc/sunrpc/cache/$CACHENAME/content
1123 * We call ->cache_show passing NULL for the item to
1124 * get a header, then pass each real item in the cache
1128 struct cache_detail *cd;
1131 static void *c_start(struct seq_file *m, loff_t *pos)
1132 __acquires(cd->hash_lock)
1135 unsigned hash, entry;
1136 struct cache_head *ch;
1137 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1140 read_lock(&cd->hash_lock);
1142 return SEQ_START_TOKEN;
1144 entry = n & ((1LL<<32) - 1);
1146 for (ch=cd->hash_table[hash]; ch; ch=ch->next)
1149 n &= ~((1LL<<32) - 1);
1153 } while(hash < cd->hash_size &&
1154 cd->hash_table[hash]==NULL);
1155 if (hash >= cd->hash_size)
1158 return cd->hash_table[hash];
1161 static void *c_next(struct seq_file *m, void *p, loff_t *pos)
1163 struct cache_head *ch = p;
1164 int hash = (*pos >> 32);
1165 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1167 if (p == SEQ_START_TOKEN)
1169 else if (ch->next == NULL) {
1176 *pos &= ~((1LL<<32) - 1);
1177 while (hash < cd->hash_size &&
1178 cd->hash_table[hash] == NULL) {
1182 if (hash >= cd->hash_size)
1185 return cd->hash_table[hash];
1188 static void c_stop(struct seq_file *m, void *p)
1189 __releases(cd->hash_lock)
1191 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1192 read_unlock(&cd->hash_lock);
1195 static int c_show(struct seq_file *m, void *p)
1197 struct cache_head *cp = p;
1198 struct cache_detail *cd = ((struct handle*)m->private)->cd;
1200 if (p == SEQ_START_TOKEN)
1201 return cd->cache_show(m, cd, NULL);
1204 seq_printf(m, "# expiry=%ld refcnt=%d flags=%lx\n",
1205 cp->expiry_time, atomic_read(&cp->ref.refcount), cp->flags);
1207 if (cache_check(cd, cp, NULL))
1208 /* cache_check does a cache_put on failure */
1209 seq_printf(m, "# ");
1213 return cd->cache_show(m, cd, cp);
1216 static const struct seq_operations cache_content_op = {
1223 static int content_open(struct inode *inode, struct file *file)
1226 struct cache_detail *cd = PDE(inode)->data;
1228 han = __seq_open_private(file, &cache_content_op, sizeof(*han));
1236 static const struct file_operations content_file_operations = {
1237 .open = content_open,
1239 .llseek = seq_lseek,
1240 .release = seq_release_private,
1243 static ssize_t read_flush(struct file *file, char __user *buf,
1244 size_t count, loff_t *ppos)
1246 struct cache_detail *cd = PDE(file->f_path.dentry->d_inode)->data;
1248 unsigned long p = *ppos;
1251 sprintf(tbuf, "%lu\n", cd->flush_time);
1258 if (copy_to_user(buf, (void*)(tbuf+p), len))
1264 static ssize_t write_flush(struct file * file, const char __user * buf,
1265 size_t count, loff_t *ppos)
1267 struct cache_detail *cd = PDE(file->f_path.dentry->d_inode)->data;
1271 if (*ppos || count > sizeof(tbuf)-1)
1273 if (copy_from_user(tbuf, buf, count))
1276 flushtime = simple_strtoul(tbuf, &ep, 0);
1277 if (*ep && *ep != '\n')
1280 cd->flush_time = flushtime;
1281 cd->nextcheck = get_seconds();
1288 static const struct file_operations cache_flush_operations = {
1289 .open = nonseekable_open,
1291 .write = write_flush,