Re: standard queue implementation?
george anzinger (firstname.lastname@example.org)
Wed, 09 May 2001 11:04:07 -0700
Eli Carter wrote:
> 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.
Are you possibly looking for include/linux/list.h ?
Routines to build and manager doubly linked circular lists.
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to email@example.com
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/