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