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