Messages in this thread | | | Date | Wed, 09 May 2001 10:21:06 -0500 | From | Eli Carter <> | Subject | standard queue implementation? |
| |
All,
I did a quick look in include/linux for a standard implementation of an array-based circular queue, but I didn't see one.
I was thinking something that could be declared, allocated, and then used with an addq and a removeq. A deallocator would also be good.
Is there such a beast in the kernel? If not, it seems that having something like this would reduce the potential for bugs.
Thoughts?
Eli -----------------------. No wonder we didn't get this right first time Eli Carter | through. It's not really all that horribly eli.carter(at)inet.com `- complicated, but the _details_ kill you. Linus - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
| |