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