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