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