3 - Changed: CMake is used for build libcds. Ancient build.sh has been removed
4 - Changed: unit and stress tests are migrated to googletest framework
5 - Added: IterableList - an implementation of ordered list with
6 thread-safe iterator. MichaelSet/Map and SplitListSet/Map support
7 this type of ordered list and thread-safe iterable too.
8 - Added: wait strategies for flat combining technique. Based on
9 research by Marsel Galimullin and Nikolai Rapotkin.
10 - Fixed: SkipList erase() and find() bugs that cause to infinite loop
11 or to program crash in rare case.
12 - Fixed: serious bug in MichaelSet::emplace() function
13 New node was created twice from the arguments by move semantics.
14 However, move semantics may change internal state of the argument
15 that can lead to an incorrect element and even an incorrect key
16 that breaks the set logic.
17 - Fixed: bug in FeldmanHashSet::erase_at( iterator ): due an error
18 in precondition checking the function may incorrectly return false.
19 - Fixed: possible double-free case in flat combining algorithm.
20 Thanks to Amila Jayasekara who pointed me to this problem
21 - Changed: cds::opt::buffer option is divided to initialized
22 (cds::opt::v::initialized_dynamic_buffer, cds::opt::v::initialized_static_buffer)
23 and uninitialized (cds::opt::v::uninitialized_dynamic_buffer, cds::opt::v::uninitialized_static_buffer)
24 ones. The old cds::opt::v::dynamic_buffer and cds::opt::v::static_buffer classes
26 - Removed: TsigasCysleQueue (due undecidable ABA-problem)
27 - Fixed: use-after-free bug in VyukovMPMCCycleQueue internal buffer.
28 To prevent this bug the queue uses an uninitialized buffer now.
29 - Fixed: rare priority inversion bug in MSPriorityQueue
30 - Added: for minimizing runtime of stress test the detail level for some test is added.
31 Command line argument --detail-level=N specifies what test should be ran: each
32 test with level not greater than N will be ran. Instead of command line arg
33 the enviromnent variable CDSTEST_DETAIL_LEVEL=N may be used.
34 By default, the detail level is 0 that means only limited set of the test will be ran.
38 - Added: FeldmanHashSet/Map - an interesting hash map algorithm
39 based on multi-level array, requires perfect hashing or fixed-sized keys.
40 Supports thread-safe bidirectional iterators.
41 - Added: BronsonAVLTreeMap - Bronson's et al AVL tree implementation
42 - Added: CMake build script, thanks to Eugeny Kalishenko
43 - Changed: SplitList performance improving, thanks to Mike Krinkin
44 - Changed: semantic of member functions extract(), get() and its
45 variants for MichaelList RCU-based specialization: extract() does not
46 require RCU locking, get() now returns special wrapper object of type raw_ptr,
48 Thus, semantics of extract()/get() of all RCU-based set and maps based on
49 MichaelList (MichaelSet/Map, SplitListSet/Map) has been changed too.
50 - Changed: SplitListSet/Map functions get() and get_with() return special wrapper
51 object of type raw_ptr, see doc.
52 - Removed: SplitListSet/Map force_dispose() function.
53 - cds::lock namespace is renamed to cds::sync. All classes defined in cds::lock namespace
54 are moved to cds::sync with new names (for example, cds::lock::SpinLock is renamed to
55 cds::sync::spin_lock). cds::lock namespace and its contents is deprecated, it is kept
56 for backward compatibility.
57 - The library has been checked by ThreadSanitizer, a lot of bugs has been fixed
58 - Added support for clang 3.7 with libc++
62 - the library has been rewritten to support at least C++11. Compilers: GCC 4.8+, clang 3.3+,
63 MS Visual C++ 12 (2013) Update 4 an above.
64 - Removed: MichaelDeque, reason: the implementation is heavy-weighted, inefficient,
66 - Removed: cds::gc::HRC garbage collector, reason: the implementation is inefficient
68 - Changed: all container's declaration except StripedSet has been unified to the
69 following traits-based form:
70 class Container< GC, T, Traits >
71 - Added: new member function pop_with(Func) to cds::container::TreiberStack
72 - Added: new member functions enqueue_with(Func), dequeue_with(Func) to
73 cds::container::MSQueue
74 cds::container::MoirQueue
75 cds::container::BasketQueue
76 cds::container::OptimisticQueue
77 cds::container::RWQueue
78 cds::container::SegmentedQueue
79 cds::container::TsigasCycleQueue
80 cds::container::VyukovMPMCCycleQueue
81 - Added: new member functions push_with(Func) and pop_with(Func) to cds::container::MSPriorityQueue
82 - SegmentedQueue: add padding into segmented_queue::traits to eliminate false sharing.
83 - Changed: guarded_ptr and exempt_ptr have move semantics now. The container's extract() and get()
84 member functions return the objects of that type.
85 - Changed: improved cds::gc::HP and cds::gc::DHP internal implementation
86 - Changed: map member function insert_key() has been renamed to insert_with()
87 - Changed: cds/cxx11_atomic.h has been renamed to cds/algo/atomic.h
88 - Removed: cds/refcounter.h
92 - Add flat combining (FC) technique and FC-based containers: FCStack, FCQueue,
93 FCDeque, FCPriorityQueue
94 - Add elimination back-off feature to TreiberStack class
95 - Add SegmentedQueue - an unfair queue implementation
96 - New member functions for sets and maps:
97 Functions get() and get_with() search a key and return the pointer to item found
99 Function extract() searches a key, unlinks the item found from the container
100 and returns pointer to item in safe manner.
101 The functions get, get_with, extract, extract_with extract_min, extract_max
102 has been added to the following container:
103 SkipListSet, SkipListMap
104 EllenBinTree, EllenBinTreeSet, EllenBinTreeMap
105 The functions get, get_with, extract, extract_with has been added
106 to the following container:
107 MichaelList, LazyList
108 MichaelHashSet, MichaelHashMap
109 SplitListSet, SplitListMap
110 - Fix a serious bug in cds::gc::HRC
111 - Changed MSPriorityQueue to simplify interface and to fix possible pop() deadlock
112 - Fix a bug in BasketQueue
113 - Fix EllenBinTree crash under high contention
114 - Changed: the thread manager detach order to prevent crashing of signal-handled RCU
116 - Changed: cds::gc::HP calls Scan() when a thread is detached.
117 This prevents accumulating retired data.
118 - Changed: minimal boost version is 1.51
119 - Removed: file cds/lock/rwlock.h
123 1. Added: EllenBinTree - an implementation of unbalanced binary search
124 tree based on paper [2010] F.Ellen, P.Fatourou, E.Ruppert, F.van Breugel
125 "Non-blocking Binary Search Tree".
126 2. Added: MSPriorityQueue - an array-based lock-based priority queue heap,
127 see [1996] G.Hunt, M.Michael, S. Parthasarathy, M.Scott "An efficient
128 algorithm for concurrent priority queue heaps"
129 3. Added support for boost.atomic for boost 1.54 and above.
130 Now, libcds supports processor architecture like ARM, PowerPC and any other
131 that are supported by boost.atomic or by C++11 compiler. Any feedbacks are appreciated.
132 To use boost.atomic you should specify -DCDS_USE_BOOST_ATOMIC in compiler's command line.
133 4. Added: a new CDS_USE_LIBCDS_ATOMIC preprocessor flag has been added to direct
134 the compiler to use libcds atomic unconditionally.
135 5. build.sh has been modified to relax processor architecture and OS requirements.
136 This allows to use libcds with native compiler atomic support (or boost.atomic)
137 for a processor architecture that has not been tested by libcds's developers.
138 6. Added support for CLang 3.3
139 7. Added support for MS VC++ 2013
140 8. Added support for Mac OS X, see build/sample/build-osx-clang-libc++.sh,
141 build/sample/build-osx-gcc.sh for example.
142 9. Fixed: SkipListSet::erase_with does not take into account "less" predicate parameter.
143 10.Fixed: some bugs in SkipListSet leading to deadloop
144 11.Fixed: MichaelMap bug: computing hash value for type Q different from key type.
148 1. Added: user-space RCU garbage collector (5 different implementations),
149 see cds::urcu namespace
150 2. Added: RCU-related set/map container specializations
151 3. Added: Skip-list specialization for cds::gc::nogc (undeletable skip-list)
152 4. For set/map classes: find_with and erase_with member functions have been added.
153 These functions allow to use different predicates for searching.
154 5. Added: threading model based on Ñ++11 thread_local keyword (CDS_THREADING_CXX11).
155 At present, only gcc 4.8 supports such model.
156 6. Fixed: bug #11 "ABA bug in libcds 1.3.1 cds/intrusive/msqueue.h"
157 Thanks to Jelle van den Hooff.
158 7. Added support for GCC 4.8
162 - Bug fixed: building libcds with boost versions before 1.48
163 Thanks Lucas Larsch who points me to this problem.
167 1. Added: StripedSet, StripedMap - hash set and hash map
168 implementation based on fine-grained lock-striping technique
169 2. Added: CuckooSet, CuckooMap - implementation of cuckoo hashing algorithm
170 based on fine-grained lock-striping technique
171 3. Added: SkipListSet, SkipListMap - implementation of lock-free skip list
172 4. Added: template <typename... Args> emplace(Args&&... args) member function
173 for all containers in cds::container namespace. This function is available
174 only if the compiler supports new C++11 features - variadic
175 templates and move semantics.
176 5. Changed: lambda functions are used internally instead of wrapping functors.
177 If the compiler does not support C++11 lambdas the old-style wrapping functors are used.
178 6. Changed: test projects has been splitted for optimizing compile time.
179 7. Breaking change: class cds::lock::Auto has been renamed to cds::lock::scoped_lock,
180 class cds::lock::AutoUnlock has been removed
181 8. Added: support for MinGW (tested with TDM-GCC 64bit, gcc 4.7)
183 1.2.0 20.08.2012 (beta)
185 1. Added: MichaelDeque - deque lock-free algo discovered by Maged Michael
186 2. Added: BasketQueue - Michael's queue modification discovered by Nir Shavit et al.
187 3. Added: support of Clang 3.0, 3.1 compiler (tested on Linux with boost 1.49)
188 4. Fixed: solving problem of 8-byte atomic data alignment on 32-bit platforms
189 5. Fixed bug 3536393: OptimisticQueue core dump
191 1.1.0 17.04.2012 (beta)
193 1. Added: C++11 atomic operations support. The library has been rewritten
194 for using std::atomic class and operations proposed in C++11 Standard.
195 If the compiler does not support the standard <atomic> library,
196 own partial implementation declared in cds/cxx11_atomic.h is used.
197 cxx11_atomic.h contains implementation for lock-free part of C++11
198 <atomic> header needed for libcds.
199 2. Added: support for C++11 feature (if applicable):
200 - inline namespace (for GCC 4.4+)
201 - function =default and =delete specifiers (for GCC 4.4+)
202 3. Changed: the main reclamation cycle ("liberate" function) of cds::gc::PTB
203 memory reclamation schema has been optimized. Previous implementation
204 could lead to unbounded memory consumption under high contention.
205 4. Changed: the internal structure of cds::intrusive::OptimisticQueue is greatly simplified.
206 The interface of the class is slightly changed.
207 5. Fixed: some problem with cds::gc::HRC memory reclamation schema that
208 could be the cause of occasional program crash.
209 6. Fixed: an error in node reclamation algo in queue implementation (MSQueue, MoirQueue,
210 OptimisticQueue). As an result of the error, some items could be lost with memory leaks.
211 7. Changed: cds::concept namespace and its content has been removed
212 8. Added support for Microsoft Visual C++ 11 Beta
213 9. Added support for GCC 4.7
215 1.0.0 31.12.2011 (beta)
216 This version is completely rewritten to support intrusive version of lock-free containers
217 and more lightweight garbage collectors interface.
218 The class hierarchy and interfaces have been completely reimplemented from scratch.
220 1. Added: intrusive containers. Many lock-free containers in libcds have the intrusive
221 counterparts. The library is fully refactored to support intrusive containers.
222 Class hierarchy is changed: almost all non-intrusive container classes are based
223 on their intrusive versions.
224 Two new namespace is added:
225 cds::intrusive - for intrusive containers
226 cds::container - for non-intrusive containers
227 Namespaces by container type (cds::queue, cds::map and so on) have been removed.
228 2. Added: New option-based approach is used for class declaration instead
229 old traits-based one. This approach allows to declare template arguments
230 in position-independent manner that is very useful for complex template declarations.
231 Option-based declarations use C++0x variadic templates if compiler supports it (GCC),
232 otherwise (MS VC) an emulation is used.
233 3. Changed: garbage collectors interface is generalized. cds::gc::GC (where GC is
234 one of HP, HRC, PTB) classes has been added.
235 4. Removed: tagged pointer GC. This GC
236 - unsafe for complex data structure
237 - x86-specific since it requires double-width CAS primitive
238 - memory-consuming since it requires separate free-list for each type stored in the containers
239 5. Default threading model is changed (see doc for cds::threading namespace):
240 - for Windows and MSVC++, CDS_THREADING_WIN_TLS is the default now
241 - for *nix and GCC, CDS_THREADING_PTHREAD is the default now
242 6. Added GCC 4.6 support (constexpr)
243 7. Added Microsoft Visual Studio 2010 (vc10) solution
245 0.8.0 28.03.2011 (beta)
246 1. Added: cds::Initialize and cds::Terminate functions that initializes and frees library's
248 2. Added: cds::memory::michael::Heap - Michael's lock-free allocator
249 3. Added: Exponential back-off strategy for spinning
250 4. Added: cds::queue::vyukov_mpmc_bounded - bounded queue
251 developed by Dmitry Vyukov (http://www.1024cores.net)
252 5. Added: support for FreeBSD amd64, x86
254 0.7.2 27.02.2011 (beta)
255 1. [Bug 3157201] Added implementation of threading manager based on Windows TLS API, see
256 cds::threading::wintls::Manager. Added CDS_THREADING_WIN_TLS macro. See docs for
257 cds::threading namespace for details.
258 2. Fixed bug in cds::threading::pthread::Manager: ptb_gc has not been initialized properly.
260 template <typename T, typename FUNC>
261 bool erase( const key_type& key, T& dest, FUNC func ) ;
262 has been added to all map classes.
264 template <typename T, typename FUNC>
265 bool insert( const key_type& key, T& val, FUNC func ) ;
266 has been added to all map classes.
267 5. Added new argument "bNew" to functor "func" of map's "ensure" member function:
268 void func( VALUE& itemValue, const VALUE& val, bool bNew ) ;
269 bNew = true if new item has been added
270 bNew = false if key is found
271 6. Fixed bug in cds::map::SplitOrderedList: LSB of dummy node's hash should be zero
272 7. Changed: thread liveliness checking on *nix has been changed to pthread_kill(id, 0).
273 8. Fixed: in map template member functions the functor may be passed by value
274 or by reference; use boost::ref( yourFunctor ) to pass your functor by reference
275 9. Fixed: cds::gc::tagged GC and all classes based on this GC has been rewritten
276 to solve stability problems.
278 0.7.1 30.12.2010 (beta)
279 1. [Bug 3130852] cds::queue::TZCyclicQueue::empty() has been corrected
280 2. [Bug 3128161] It seems, GCC 4.4 has a bug in __thread on x86 and x86_64. New "threading model"
281 CDS_THREADING_AUTODETECT has been added. See docs of cds::threading namespace for details
282 3. Fixed errors in the "Pass-the-Buck" garbage collector (namespace cds::gc::ptb)
283 4. [Bug 3128148] The code is aligned with the C++ standard (minor violations has been removed)
284 5. [Bug 3141654] missing break statement for atomic store - fixed
285 6. Added in-place scan strategy to cds::gc::hzp::GarbageCollector that does not allocate any memory.
286 7. Fixed bugs in HRC and tagged GC
288 0.7.0 05.12.2010 (beta)
289 1. Preliminary support for "Pass The Buck" memory manager is added. See cds::gc::ptb namespace.
290 2. Many part of library is rewritten to generalize the usage of various GCs
291 3. The new class cds::details::aligned_allocator has been added for allocating aligned memory
292 blocks. It is useful for Tagged Pointer memory reclamation schema (cds::gc::tagged_gc).
293 4. [Break change] New argument has been added to the member functions "ensure" and "find"
294 for ordered list and map classes
295 5. New member function "emplace" has been added to ordered list and map classes. This member function
296 allows change the value (or a part of it) of list/map item.
297 6. The internal structure of class cds::map::MichaelHashMap is completely refactored to support
298 cds::gc::no_gc correctly
299 7. The classes RecursiveSpinT, RecursiveSpin32, RecursiveSpin64, and RecursiveSpin from cds::lock
300 namespace have been renamed to ReentrantSpinT, ReentrantSpin32, ReentrantSpin64, and ReentrantSpin
302 8. Compiler support: GCC version below 4.3.0 is not supported
303 9. Fixed memory leak in cds::map::SplitOrderedList
304 10. Added compiler barrier to spin-lock release primitive for x86 and amd64
305 11. Makefile script is changed to resolve the problem when an user calls 'make clean' directly.
306 Thanks to Tamas Lengyel to point me to this bug.
307 12. The file dictionary.txt is excluded from distributive. This file is used for testing purposes only.
308 You may create dictionary.txt in this way:
312 0.6.0 26.03.2010 (beta)
313 1. The library is rewritten using atomic primitives with explicit memory ordering (based on C++
314 memory model proposal). The implementation of atomic primitives for supported architectures
315 is developed from scratch.
318 0.5.0 31.12.2009 (beta)