Introduction of basic nesting foundations.

1 files changed, 5 insertions, 5 deletions

diff --git a/litmus/edf_common.c b/litmus/edf_common.c
index 9b44dc2d8d1e..54cfada586be 100644
--- a/litmus/edf_common.c
+++ b/litmus/edf_common.c
@@ -42,10 +42,10 @@ int edf_higher_prio(struct task_struct* first,
         /* Check for inherited priorities. Change task
          * used for comparison in such a case.
          */
-        if (unlikely(first->rt_param.inh_task))
-                first_task = first->rt_param.inh_task;
-        if (unlikely(second->rt_param.inh_task))
-                second_task = second->rt_param.inh_task;
+        if (unlikely(first->rt_param.eff_prio))
+                first_task = first->rt_param.eff_prio;
+        if (unlikely(second->rt_param.eff_prio))
+                second_task = second->rt_param.eff_prio;
 
         /* Check for priority boosting. Tie-break by start of boosting.
          */
@@ -81,7 +81,7 @@ int edf_higher_prio(struct task_struct* first,
                  * priority wins.
                  */
                 (first_task->pid == second_task->pid &&
-                 !second->rt_param.inh_task)));
+                 !second->rt_param.eff_prio)));
 }
 
 int edf_ready_order(struct bheap_node* a, struct bheap_node* b)