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