cleanup trailing whitespace

6 files changed, 16 insertions, 16 deletions

diff --git a/litmus/Kconfig b/litmus/Kconfig
index c2a7756b4f..f73a454c4f 100644
--- a/litmus/Kconfig
+++ b/litmus/Kconfig
@@ -19,7 +19,7 @@ config SRP
         bool "Stack Resource Policy (SRP)"
         default n
         help
-          Include support for Baker's Stack Resource Policy. 
+          Include support for Baker's Stack Resource Policy.
 
           Say Yes if you want FMLP local long  critical section synchronization support.
 
@@ -43,7 +43,7 @@ config FEATHER_TRACE
         help
           Feather-Trace basic tracing infrastructure. Includes device file
           driver and instrumentation point support.
-          
+
 
 config SCHED_TASK_TRACE
         bool "Trace real-time tasks"
diff --git a/litmus/cheap.c b/litmus/cheap.c
index 9fc68fd053..fde5304f8c 100644
--- a/litmus/cheap.c
+++ b/litmus/cheap.c
@@ -61,7 +61,7 @@ int cheap_insert(cheap_prio_t higher_prio,
         int stop = 0;
         unsigned int child, parent, locked;
         unsigned int wait_for_parent_state;
-        
+
         lockdep_off(); /* generates false positives */
 
         spin_lock(&ch->lock);
@@ -77,8 +77,8 @@ int cheap_insert(cheap_prio_t higher_prio,
                 spin_unlock(&ch->lock);
                 lockdep_on();
                 return -1;
-        }               
-        
+        }
+
         spin_unlock(&ch->heap[child].lock);
 
         /* bubble up */
@@ -115,7 +115,7 @@ int cheap_insert(cheap_prio_t higher_prio,
                 } else {
                         /* Some other process needs to act first.
                          * We need to back off a little in order
-                         * to give the others a chance to acquire the 
+                         * to give the others a chance to acquire the
                          * parent's lock.
                          */
                         wait_for_parent_state = ch->heap[parent].tag;
@@ -123,7 +123,7 @@ int cheap_insert(cheap_prio_t higher_prio,
 
                 spin_unlock(&ch->heap[locked].lock);
                 spin_unlock(&ch->heap[parent].lock);
-                
+
                 while (wait_for_parent_state != CHEAP_EMPTY &&
                        ((volatile unsigned int) ch->heap[parent].tag) ==
                        wait_for_parent_state)
@@ -184,7 +184,7 @@ void* cheap_take_if(cheap_take_predicate_t pred,
 
         /* unlock before locking root to maintain locking order */
         spin_unlock(&ch->heap[child].lock);
-        
+
         spin_lock(&ch->heap[CHEAP_ROOT].lock);
         if (ch->heap[CHEAP_ROOT].tag == CHEAP_EMPTY) {
                 /* heap became empty, we got the last one */
@@ -192,7 +192,7 @@ void* cheap_take_if(cheap_take_predicate_t pred,
                 lockdep_on();
                 return cval;
         } else {
-                /* grab value of root (=min), replace with 
+                /* grab value of root (=min), replace with
                  * what we got from the last leaf
                  */
                 val = ch->heap[CHEAP_ROOT].value;
diff --git a/litmus/fdso.c b/litmus/fdso.c
index bdc0466f9e..7a16f64071 100644
--- a/litmus/fdso.c
+++ b/litmus/fdso.c
@@ -134,7 +134,7 @@ static struct od_table_entry*  get_od_entry(struct task_struct* t)
 
         table = t->od_table;
         if (!table) {
-                table = kzalloc(sizeof(*table) * MAX_OBJECT_DESCRIPTORS, 
+                table = kzalloc(sizeof(*table) * MAX_OBJECT_DESCRIPTORS,
                                 GFP_KERNEL);
                 t->od_table = table;
         }
diff --git a/litmus/litmus.c b/litmus/litmus.c
index b286f8f013..3562322827 100644
--- a/litmus/litmus.c
+++ b/litmus/litmus.c
@@ -490,11 +490,11 @@ asmlinkage long sys_exit_np(void)
 
 /* sys_null_call() is only used for determining raw system call
  * overheads (kernel entry, kernel exit). It has no useful side effects.
- * If ts is non-NULL, then the current Feather-Trace time is recorded. 
+ * If ts is non-NULL, then the current Feather-Trace time is recorded.
  */
 asmlinkage long sys_null_call(cycles_t __user *ts)
 {
-        long ret = 0; 
+        long ret = 0;
         cycles_t now;
 
         if (ts) {
@@ -789,7 +789,7 @@ static int proc_write_release_master(struct file *file,
 
         if (count > 63)
                 return -EINVAL;
-        
+
         if (copy_from_user(msg, buffer, count))
                 return -EFAULT;
 
@@ -799,7 +799,7 @@ static int proc_write_release_master(struct file *file,
         if (count > 1 && msg[count - 1] == '\n')
                 msg[count - 1] = '\0';
 
-        if (strcmp(msg, "NO_CPU") == 0) {              
+        if (strcmp(msg, "NO_CPU") == 0) {
                 atomic_set(&release_master_cpu, NO_CPU);
                 return count;
         } else {
diff --git a/litmus/norqlock.c b/litmus/norqlock.c
index b812f34960..1a17d6c3ac 100644
--- a/litmus/norqlock.c
+++ b/litmus/norqlock.c
@@ -50,7 +50,7 @@ void tick_no_rqlock(void)
 
         local_irq_save(flags);
 
-        wl = &__get_cpu_var(norq_worklist); 
+        wl = &__get_cpu_var(norq_worklist);
 
         if (wl->hrtimer_hack) {
                 /* bail out! */
diff --git a/litmus/rt_domain.c b/litmus/rt_domain.c
index dabf196d92..2d0920ccad 100644
--- a/litmus/rt_domain.c
+++ b/litmus/rt_domain.c
@@ -163,7 +163,7 @@ static void reinit_release_heap(struct task_struct* t)
 
         /* initialize */
         heap_init(&rh->heap);
-        
+
         atomic_set(&rh->info.state, HRTIMER_START_ON_INACTIVE);
 }