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