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