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