1 files changed, 57 insertions, 0 deletions

diff --git a/litmus/edzl_common.c b/litmus/edzl_common.c
new file mode 100644
index 000000000000..9e26304a1ea2
--- /dev/null
+++ b/litmus/edzl_common.c
@@ -0,0 +1,57 @@
+/*
+ * kernel/edzl_common.c
+ *
+ * Common functions for EDZL based scheduler.
+ */
+
+#include <linux/percpu.h>
+#include <linux/sched.h>
+#include <linux/list.h>
+
+#include <litmus/litmus.h>
+#include <litmus/sched_plugin.h>
+#include <litmus/sched_trace.h>
+
+#include <litmus/edf_common.h>
+#include <litmus/edzl_common.h>
+
+
+int edzl_higher_prio(struct task_struct* first,
+                     struct task_struct* second)
+{
+        struct task_struct *first_task = first;
+        struct task_struct *second_task = second;
+    
+        /* There is no point in comparing a task to itself. */
+        if (first && first == second) {
+                TRACE_TASK(first,
+                   "WARNING: pointless edf priority comparison.\n");
+                return 0;
+        }
+    
+    
+        /* Check for inherited priorities. Change task
+         * used for comparison in such a case.
+         */
+        if (first && first->rt_param.inh_task)
+                first_task = first->rt_param.inh_task;
+        if (second && second->rt_param.inh_task)
+                second_task = second->rt_param.inh_task;
+    
+        /* null checks & rt checks */
+        if(!first_task)
+                return 0;
+        else if(!second_task || !is_realtime(second_task))
+                return 1;
+    
+        
+        if(likely(get_zerolaxity(first_task) == get_zerolaxity(second_task)))
+        {
+                /* edf order if both tasks have the same laxity state */
+                return(edf_higher_prio(first_task, second_task));
+        }
+        else
+        {
+                return(get_zerolaxity(first_task));
+        }
+}