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