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