GSN-EDF: Use binary heap instead of binomial heap.

Use binary heap to track CPU priorities.

1 files changed, 2 insertions, 2 deletions

diff --git a/include/litmus/binheap.h b/include/litmus/binheap.h
index b8dd8e03da60..9fe5dc13d032 100644
--- a/include/litmus/binheap.h
+++ b/include/litmus/binheap.h
@@ -36,7 +36,7 @@ struct binheap_node {
  * Signature of compator function.  Assumed 'less-than' (min-heap).
  * Pass in 'greater-than' for max-heap.
  *
- * TODO: Consider macor-based implementation that allows comparator to be
+ * TODO: Consider macro-based implementation that allows comparator to be
  * inlined (similar to Linux red/black tree) for greater efficiency.
  */
 typedef int (*binheap_order_t)(struct binheap_node *a,
@@ -364,7 +364,7 @@ static inline void __binheap_add(struct binheap_node *new_node,
 {
         /* NULL data pointers are used internally */
         if(!data) {
-                WARN();
+                WARN_ON(!data);
                 return;
         }