lkml.org 
[lkml]   [2001]   [May]   [9]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
Subjectstandard 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/

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