[NET] SUNRPC: Fix whitespace errors.

Signed-off-by: YOSHIFUJI Hideaki <yoshfuji@linux-ipv6.org>
Signed-off-by: David S. Miller <davem@davemloft.net>

1 files changed, 32 insertions, 32 deletions

diff --git a/net/sunrpc/cache.c b/net/sunrpc/cache.c
index 14274490f92e..c80df455802d 100644
--- a/net/sunrpc/cache.c
+++ b/net/sunrpc/cache.c
@@ -274,7 +274,7 @@ int cache_check(struct cache_detail *detail,
  *
  * A table is then only scanned if the current time is at least
  * the nextcheck time.
- * 
+ *
  */
 
 static LIST_HEAD(cache_list);
@@ -296,16 +296,16 @@ void cache_register(struct cache_detail *cd)
                 struct proc_dir_entry *p;
                 cd->proc_ent->owner = cd->owner;
                 cd->channel_ent = cd->content_ent = NULL;
-                
-                p = create_proc_entry("flush", S_IFREG|S_IRUSR|S_IWUSR,
-                                      cd->proc_ent);
+
+                p = create_proc_entry("flush", S_IFREG|S_IRUSR|S_IWUSR,
+                                      cd->proc_ent);
                 cd->flush_ent =  p;
-                if (p) {
-                        p->proc_fops = &cache_flush_operations;
-                        p->owner = cd->owner;
-                        p->data = cd;
-                }
- 
+                if (p) {
+                        p->proc_fops = &cache_flush_operations;
+                        p->owner = cd->owner;
+                        p->data = cd;
+                }
+
                 if (cd->cache_request || cd->cache_parse) {
                         p = create_proc_entry("channel", S_IFREG|S_IRUSR|S_IWUSR,
                                               cd->proc_ent);
@@ -316,16 +316,16 @@ void cache_register(struct cache_detail *cd)
                                 p->data = cd;
                         }
                 }
-                if (cd->cache_show) {
-                        p = create_proc_entry("content", S_IFREG|S_IRUSR|S_IWUSR,
-                                              cd->proc_ent);
+                if (cd->cache_show) {
+                        p = create_proc_entry("content", S_IFREG|S_IRUSR|S_IWUSR,
+                                              cd->proc_ent);
                         cd->content_ent = p;
-                        if (p) {
-                                p->proc_fops = &content_file_operations;
-                                p->owner = cd->owner;
-                                p->data = cd;
-                        }
-                }
+                        if (p) {
+                                p->proc_fops = &content_file_operations;
+                                p->owner = cd->owner;
+                                p->data = cd;
+                        }
+                }
         }
         rwlock_init(&cd->hash_lock);
         INIT_LIST_HEAD(&cd->queue);
@@ -417,15 +417,15 @@ static int cache_clean(void)
                 current_index++;
 
         /* find a cleanable entry in the bucket and clean it, or set to next bucket */
-        
+
         if (current_detail && current_index < current_detail->hash_size) {
                 struct cache_head *ch, **cp;
                 struct cache_detail *d;
-                
+
                 write_lock(&current_detail->hash_lock);
 
                 /* Ok, now to clean this strand */
-                        
+
                 cp = & current_detail->hash_table[current_index];
                 ch = *cp;
                 for (; ch; cp= & ch->next, ch= *cp) {
@@ -477,9 +477,9 @@ static void do_cache_clean(struct work_struct *work)
 }
 
 
-/* 
+/*
  * Clean all caches promptly.  This just calls cache_clean
- * repeatedly until we are sure that every cache has had a chance to 
+ * repeatedly until we are sure that every cache has had a chance to
  * be fully cleaned
  */
 void cache_flush(void)
@@ -508,7 +508,7 @@ void cache_purge(struct cache_detail *detail)
  * All deferred requests are stored in a hash table,
  * indexed by "struct cache_head *".
  * As it may be wasteful to store a whole request
- * structure, we allow the request to provide a 
+ * structure, we allow the request to provide a
  * deferred form, which must contain a
  * 'struct cache_deferred_req'
  * This cache_deferred_req contains a method to allow
@@ -584,7 +584,7 @@ static void cache_revisit_request(struct cache_head *item)
 
         INIT_LIST_HEAD(&pending);
         spin_lock(&cache_defer_lock);
-        
+
         lp = cache_defer_hash[hash].next;
         if (lp) {
                 while (lp != &cache_defer_hash[hash]) {
@@ -614,7 +614,7 @@ void cache_clean_deferred(void *owner)
 
         INIT_LIST_HEAD(&pending);
         spin_lock(&cache_defer_lock);
-        
+
         list_for_each_entry_safe(dreq, tmp, &cache_defer_list, recent) {
                 if (dreq->owner == owner) {
                         list_del(&dreq->hash);
@@ -639,7 +639,7 @@ void cache_clean_deferred(void *owner)
  * On write, an update request is processed
  * Poll works if anything to read, and always allows write
  *
- * Implemented by linked list of requests.  Each open file has 
+ * Implemented by linked list of requests.  Each open file has
  * a ->private that also exists in this list.  New request are added
  * to the end and may wakeup and preceding readers.
  * New readers are added to the head.  If, on read, an item is found with
@@ -1059,10 +1059,10 @@ static int cache_make_upcall(struct cache_detail *detail, struct cache_head *h)
  * Messages are, like requests, separated into fields by
  * spaces and dequotes as \xHEXSTRING or embedded \nnn octal
  *
- * Message is 
+ * Message is
  *   reply cachename expiry key ... content....
  *
- * key and content are both parsed by cache 
+ * key and content are both parsed by cache
  */
 
 #define isodigit(c) (isdigit(c) && c <= '7')
@@ -1132,7 +1132,7 @@ static void *c_start(struct seq_file *m, loff_t *pos)
         unsigned hash, entry;
         struct cache_head *ch;
         struct cache_detail *cd = ((struct handle*)m->private)->cd;
-        
+
 
         read_lock(&cd->hash_lock);
         if (!n--)
@@ -1147,7 +1147,7 @@ static void *c_start(struct seq_file *m, loff_t *pos)
         do {
                 hash++;
                 n += 1LL<<32;
-        } while(hash < cd->hash_size && 
+        } while(hash < cd->hash_size &&
                 cd->hash_table[hash]==NULL);
         if (hash >= cd->hash_size)
                 return NULL;