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