Moving this discussion on list since more people might know of a way to do this with already existing linux primitives.
-tduffy
--- Begin Message ---The original idea was that the ring buffer would perform better than other data structures because it used atomic operations. I don't believe that this theory was ever validated though.Two ring buffers were used because there are two different classes of events stored: free events and pending events.If their is a native linux data structure that provides equivalent functionality, dapl should use it.james On Tue, 24 May 2005, Tom Duffy wrote:On Wed, 2005-05-25 at 00:09 +0300, Itamar Rabenstein wrote:I just relised that we can implemet it with 2 lists empty_list and events_list where the events_list will be pop from head and pust at tail no need for dapl_ring_buffer What do you think ?Since the llists in Linux are doubly linked and circular and they have the ability to act like a stack or a queue, I think they should suffice. -tduffy P.S. Any reason not to CC the list?
--- End Message ---
signature.asc
Description: This is a digitally signed message part
_______________________________________________ openib-general mailing list [email protected] http://openib.org/mailman/listinfo/openib-general To unsubscribe, please visit http://openib.org/mailman/listinfo/openib-general
