[lkml]   [2001]   [May]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: standard queue implementation?
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.

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

 \ /
  Last update: 2005-03-22 13:17    [W:0.160 / U:0.212 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site