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