Add implementation of wait-free unordered list.
authorKevin Klues <klueska@cs.berkeley.edu>
Fri, 22 Aug 2014 18:02:58 +0000 (11:02 -0700)
committerKevin Klues <klueska@cs.berkeley.edu>
Fri, 22 Aug 2014 18:02:58 +0000 (11:02 -0700)
commita75913fc65efa64ae9a24b17924ea23d45a6af62
tree87a01ef44dee3a8651419ea9173432667ee95b78
parent78b632f7c0bfe9c8bb10b8a68801de196048cc55
Add implementation of wait-free unordered list.

The list is ever-increasing in size, in that once space is created to
accomodate an item in the list, that space is never freed until the
entire list is destroyed. Items are inserted in the list such that
ordering on removal is not guaranteed.

This structure is useful in situations when you want to maintain a
small pool of objects that are shared amongst a larger set of
objects, but only get used for a short period of time (e.g. futext
element structs, sigdata structs, etc.).
user/parlib/include/waitfreelist.h [new file with mode: 0644]
user/parlib/waitfreelist.c [new file with mode: 0644]