Re: standard queue implementation?

From: george anzinger (george@mvista.com)
Date: Wed May 09 2001 - 13:04:07 EST


Eli Carter wrote:
>
> 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?
>
Are you possibly looking for include/linux/list.h ?

Routines to build and manager doubly linked circular lists.

George
-
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/



This archive was generated by hypermail 2b29 : Tue May 15 2001 - 21:00:20 EST