From 4c0bcddb6feeef54cebca39385c1bda0392dee15 Mon Sep 17 00:00:00 2001
From: Glenn Elliott <gelliott@cs.unc.edu>
Date: Sat, 26 May 2012 16:56:23 -0400
Subject: An efficient binary heap implementation.

An efficient binary heap implementation coded in the
style of Linux's list.  This binary heap should be able
to replace any partially sorted priority queue based
upon Linux's list.
---
 litmus/Makefile | 1 +
 1 file changed, 1 insertion(+)

(limited to 'litmus/Makefile')

diff --git a/litmus/Makefile b/litmus/Makefile
index 7338180f196..4650d332fb1 100644
--- a/litmus/Makefile
+++ b/litmus/Makefile
@@ -15,6 +15,7 @@ obj-y     = sched_plugin.o litmus.o \
 	    locking.o \
 	    srp.o \
 	    bheap.o \
+	    binheap.o \
 	    ctrldev.o \
 	    sched_gsn_edf.o \
 	    sched_psn_edf.o
-- 
cgit v1.2.2