1 files changed, 8 insertions, 8 deletions

diff --git a/litmus/edf_common.c b/litmus/edf_common.c
index 5ea6b1bc7f24..4b65be7302be 100644
--- a/litmus/edf_common.c
+++ b/litmus/edf_common.c
@@ -60,7 +60,7 @@ int edf_higher_prio(struct task_struct* first, struct task_struct* second)
                 first_task = first->rt_param.inh_task;
         }
         if (unlikely(second->rt_param.inh_task)
-#ifdef CONFIG_LITMUS_NESTED_LOCKING             
+#ifdef CONFIG_LITMUS_NESTED_LOCKING
                 && (second_mode == EFFECTIVE)
 #endif
                 ) {
@@ -85,24 +85,24 @@ int edf_higher_prio(struct task_struct* first, struct task_struct* second)
 
 //      // rate-monotonic for testing
 //      return !is_realtime(second_task)  ||
-//      
+//
 //      /* is the deadline of the first task earlier?
 //       * Then it has higher priority.
 //       */
 //      shorter_period(first_task, second_task) ||
-//      
+//
 //      /* Do we have a deadline tie?
 //       * Then break by PID.
 //       */
 //      (get_period(first_task) == get_period(second_task) &&
 //       (first_task->pid < second_task->pid ||
-//        
+//
 //        /* If the PIDs are the same then the task with the EFFECTIVE
 //         * priority wins.
 //         */
 //        (first_task->pid == second_task->pid &&
-//         !second->rt_param.inh_task)));       
-        
+//         !second->rt_param.inh_task)));
+
         return !is_realtime(second_task)  ||
 
                 /* is the deadline of the first task earlier?
@@ -134,7 +134,7 @@ int edf_max_heap_order(struct binheap_node *a, struct binheap_node *b)
 {
         struct nested_info *l_a = (struct nested_info *)binheap_entry(a, struct nested_info, hp_binheap_node);
         struct nested_info *l_b = (struct nested_info *)binheap_entry(b, struct nested_info, hp_binheap_node);
-        
+
         return __edf_higher_prio(l_a->hp_waiter_eff_prio, EFFECTIVE, l_b->hp_waiter_eff_prio, EFFECTIVE);
 }
 
@@ -147,7 +147,7 @@ int edf_max_heap_base_priority_order(struct binheap_node *a, struct binheap_node
 {
         struct nested_info *l_a = (struct nested_info *)binheap_entry(a, struct nested_info, hp_binheap_node);
         struct nested_info *l_b = (struct nested_info *)binheap_entry(b, struct nested_info, hp_binheap_node);
-        
+
         return __edf_higher_prio(l_a->hp_waiter_eff_prio, BASE, l_b->hp_waiter_eff_prio, BASE);
 }