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