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