Add sbinheap. API compatible with binheap.

This patch introduces the 'sbinheap' binary heap data structure.
Litmus's binheap data structure is inefficient when we can put
a reasonable upperbound on maximum heap size (ex. When max size
is equal to NR_CPUS). When we can put an upperbound on heap size,
then we may statically allocate (or at least kmalloc needed memory)
for the heap at compile/initialization-time. With this contiguous
buffer, we can do away with left/right/parent pointers through
standard binary-tree indexing. This also speeds up heap insert/delete
operations.

0 files changed, 0 insertions, 0 deletions