tree a05f267dcde07dd3a3d0954857c0bd79d711bfdb
parent 36700f64365b83e338bca7c7bf9da8857d24b1fb
author Dmitry Grinberg <dmitrygr@google.com> 1447981224 -0800
committer Ben Fennema <fennema@google.com> 1447986089 +0000

simpleQ: a simple queue storing equally-sized items with callback-based discard

It is *NOT* interrupt safe, but it does feature O(1) dequeue()
and O(1) enqueue if it is not full. Else dequeue is O(n), while
discard() func is called on each element marked as potentially
discardable to make space. O(1) enqueue is realized using a
freelist.

Change-Id: Idde4d0521d536269e71b1fc3da8423eace1f2dd5