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