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