3 #ifndef CDSLIB_INTRUSIVE_SPLIT_LIST_RCU_H
4 #define CDSLIB_INTRUSIVE_SPLIT_LIST_RCU_H
8 #include <cds/intrusive/details/split_list_base.h>
9 #include <cds/details/binary_functor_wrapper.h>
11 namespace cds { namespace intrusive {
13 /// Split-ordered list RCU specialization
14 /** @ingroup cds_intrusive_map
15 \anchor cds_intrusive_SplitListSet_rcu
17 Hash table implementation based on split-ordered list algorithm discovered by Ori Shalev and Nir Shavit, see
18 - [2003] Ori Shalev, Nir Shavit "Split-Ordered Lists - Lock-free Resizable Hash Tables"
19 - [2008] Nir Shavit "The Art of Multiprocessor Programming"
21 The split-ordered list is a lock-free implementation of an extensible unbounded hash table. It uses original
22 recursive split-ordering algorithm discovered by Ori Shalev and Nir Shavit that allows to split buckets
23 without moving an item on resizing, see \ref cds_SplitList_algo_desc "short algo description".
27 Template parameters are:
28 - \p RCU - one of \ref cds_urcu_gc "RCU type"
29 - \p OrderedList - ordered list implementation used as bucket for hash set, for example, MichaelList, LazyList.
30 The intrusive ordered list implementation specifies the type \p T stored in the hash-set,
31 the comparing functor for the type \p T and other features specific for the ordered list.
32 - \p Traits - set traits, default isd \p split_list::traits.
33 Instead of defining \p Traits struct you may use option-based syntax with \p split_list::make_traits metafunction.
35 @note About reqired features of hash functor see \ref cds_SplitList_hash_functor "SplitList general description".
38 Before including <tt><cds/intrusive/split_list_rcu.h></tt> you should include appropriate RCU header file,
39 see \ref cds_urcu_gc "RCU type" for list of existing RCU class and corresponding header files.
40 For example, for \ref cds_urcu_general_buffered_gc "general-purpose buffered RCU" and
41 MichaelList-based split-list you should include:
43 #include <cds/urcu/general_buffered.h>
44 #include <cds/intrusive/michael_list_rcu.h>
45 #include <cds/intrusive/split_list_rcu.h>
47 // Declare Michael's list for type Foo and default traits:
48 typedef cds::intrusive::MichaelList< cds::urcu::gc< cds::urcu::general_buffered<> >, Foo > rcu_michael_list;
50 // Declare split-list based on rcu_michael_list
51 typedef cds::intrusive::SplitListSet< cds::urcu::gc< cds::urcu::general_buffered<> >, rcu_michael_list > rcu_split_list;
58 # ifdef CDS_DOXYGEN_INVOKED
59 class Traits = split_list::traits
64 class SplitListSet< cds::urcu::gc< RCU >, OrderedList, Traits >
67 typedef cds::urcu::gc< RCU > gc; ///< RCU garbage collector
68 typedef Traits traits; ///< Traits template parameters
70 /// Hash functor for \ref value_type and all its derivatives that you use
71 typedef typename cds::opt::v::hash_selector< typename traits::hash >::type hash;
74 typedef cds::intrusive::split_list::implementation_tag implementation_tag;
79 typedef split_list::details::rebind_list_traits<OrderedList, traits> wrapped_ordered_list;
83 # ifdef CDS_DOXYGEN_INVOKED
84 typedef OrderedList ordered_list; ///< type of ordered list used as base for split-list
86 typedef typename wrapped_ordered_list::result ordered_list;
88 typedef typename ordered_list::value_type value_type; ///< type of value stored in the split-list
89 typedef typename ordered_list::key_comparator key_comparator; ///< key compare functor
90 typedef typename ordered_list::disposer disposer; ///< Node disposer functor
91 typedef typename ordered_list::rcu_lock rcu_lock; ///< RCU scoped lock
92 typedef typename ordered_list::exempt_ptr exempt_ptr; ///< pointer to extracted node
93 /// Group of \p extract_xxx functions require external locking if underlying ordered list requires that
94 static CDS_CONSTEXPR const bool c_bExtractLockExternal = ordered_list::c_bExtractLockExternal;
96 typedef typename traits::item_counter item_counter; ///< Item counter type
97 typedef typename traits::back_off back_off; ///< back-off strategy for spinning
98 typedef typename traits::memory_model memory_model; ///< Memory ordering. See cds::opt::memory_model option
99 typedef typename traits::stat stat; ///< Internal statistics
102 typedef typename ordered_list::node_type list_node_type; ///< Node type as declared in ordered list
103 typedef split_list::node<list_node_type> node_type; ///< split-list node type
104 typedef node_type dummy_node_type; ///< dummy node type
106 /// Split-list node traits
108 This traits is intended for converting between underlying ordered list node type \ref list_node_type
109 and split-list node type \ref node_type
111 typedef split_list::node_traits<typename ordered_list::node_traits> node_traits;
114 /// Bucket table implementation
115 typedef typename split_list::details::bucket_table_selector<
116 traits::dynamic_bucket_table
119 , opt::allocator< typename traits::allocator >
120 , opt::memory_model< memory_model >
121 >::type bucket_table;
127 /// Ordered list wrapper to access protected members of OrderedList
128 class ordered_list_wrapper: public ordered_list
130 typedef ordered_list base_class;
131 typedef typename base_class::auxiliary_head bucket_head_type;
134 bool insert_at( dummy_node_type * pHead, value_type& val )
136 assert( pHead != nullptr );
137 bucket_head_type h(pHead);
138 return base_class::insert_at( h, val );
141 template <typename Func>
142 bool insert_at( dummy_node_type * pHead, value_type& val, Func f )
144 assert( pHead != nullptr );
145 bucket_head_type h(pHead);
146 return base_class::insert_at( h, val, f );
149 template <typename Func>
150 std::pair<bool, bool> ensure_at( dummy_node_type * pHead, value_type& val, Func func )
152 assert( pHead != nullptr );
153 bucket_head_type h(pHead);
154 return base_class::ensure_at( h, val, func );
157 bool unlink_at( dummy_node_type * pHead, value_type& val )
159 assert( pHead != nullptr );
160 bucket_head_type h(pHead);
161 return base_class::unlink_at( h, val );
164 template <typename Q, typename Compare, typename Func>
165 bool erase_at( dummy_node_type * pHead, split_list::details::search_value_type<Q> const& val, Compare cmp, Func f )
167 assert( pHead != nullptr );
168 bucket_head_type h(pHead);
169 return base_class::erase_at( h, val, cmp, f );
172 template <typename Q, typename Compare>
173 bool erase_at( dummy_node_type * pHead, split_list::details::search_value_type<Q> const& val, Compare cmp )
175 assert( pHead != nullptr );
176 bucket_head_type h(pHead);
177 return base_class::erase_at( h, val, cmp );
180 template <typename Q, typename Compare>
181 value_type * extract_at( dummy_node_type * pHead, split_list::details::search_value_type<Q>& val, Compare cmp )
183 assert( pHead != nullptr );
184 bucket_head_type h(pHead);
185 return base_class::extract_at( h, val, cmp );
188 template <typename Q, typename Compare, typename Func>
189 bool find_at( dummy_node_type * pHead, split_list::details::search_value_type<Q>& val, Compare cmp, Func f ) const
191 assert( pHead != nullptr );
192 bucket_head_type h(pHead);
193 return base_class::find_at( h, val, cmp, f );
196 template <typename Q, typename Compare>
197 bool find_at( dummy_node_type * pHead, split_list::details::search_value_type<Q> const & val, Compare cmp ) const
199 assert( pHead != nullptr );
200 bucket_head_type h(pHead);
201 return base_class::find_at( h, val, cmp );
204 template <typename Q, typename Compare>
205 value_type * get_at( dummy_node_type * pHead, split_list::details::search_value_type<Q>& val, Compare cmp ) const
207 assert( pHead != nullptr );
208 bucket_head_type h(pHead);
209 return base_class::get_at( h, val, cmp );
212 bool insert_aux_node( dummy_node_type * pNode )
214 return base_class::insert_aux_node( pNode );
216 bool insert_aux_node( dummy_node_type * pHead, dummy_node_type * pNode )
218 bucket_head_type h(pHead);
219 return base_class::insert_aux_node( h, pNode );
223 template <typename Less>
224 struct less_wrapper: public cds::opt::details::make_comparator_from_less<Less>
226 typedef cds::opt::details::make_comparator_from_less<Less> base_wrapper;
228 template <typename Q1, typename Q2>
229 int operator()( split_list::details::search_value_type<Q1> const& v1, Q2 const& v2 ) const
231 return base_wrapper::operator()( v1.val, v2 );
234 template <typename Q1, typename Q2>
235 int operator()( Q1 const& v1, split_list::details::search_value_type<Q2> const& v2 ) const
237 return base_wrapper::operator()( v1, v2.val );
243 ordered_list_wrapper m_List; ///< Ordered list containing split-list items
244 bucket_table m_Buckets; ///< bucket table
245 atomics::atomic<size_t> m_nBucketCountLog2; ///< log2( current bucket count )
246 atomics::atomic<size_t> m_nMaxItemCount; ///< number of items container can hold, before we have to resize
247 item_counter m_ItemCounter; ///< Item counter
248 hash m_HashFunctor; ///< Hash functor
249 stat m_Stat; ///< Internal stattistics accumulator
253 typedef cds::details::Allocator< dummy_node_type, typename traits::allocator > dummy_node_allocator;
255 dummy_node_type * alloc_dummy_node( size_t nHash )
257 m_Stat.onHeadNodeAllocated();
258 return dummy_node_allocator().New( nHash );
260 void free_dummy_node( dummy_node_type * p )
262 dummy_node_allocator().Delete( p );
263 m_Stat.onHeadNodeFreed();
266 /// Calculates hash value of \p key
267 template <typename Q>
268 size_t hash_value( Q const& key ) const
270 return m_HashFunctor( key );
273 size_t bucket_no( size_t nHash ) const
275 return nHash & ( (1 << m_nBucketCountLog2.load(memory_model::memory_order_relaxed)) - 1 );
278 static size_t parent_bucket( size_t nBucket )
280 assert( nBucket > 0 );
281 return nBucket & ~( 1 << bitop::MSBnz( nBucket ) );
284 dummy_node_type * init_bucket( size_t nBucket )
286 assert( nBucket > 0 );
287 size_t nParent = parent_bucket( nBucket );
289 dummy_node_type * pParentBucket = m_Buckets.bucket( nParent );
290 if ( pParentBucket == nullptr ) {
291 pParentBucket = init_bucket( nParent );
292 m_Stat.onRecursiveInitBucket();
295 assert( pParentBucket != nullptr );
297 // Allocate a dummy node for new bucket
299 dummy_node_type * pBucket = alloc_dummy_node( split_list::dummy_hash( nBucket ) );
300 if ( m_List.insert_aux_node( pParentBucket, pBucket ) ) {
301 m_Buckets.bucket( nBucket, pBucket );
302 m_Stat.onNewBucket();
305 free_dummy_node( pBucket );
308 // Another thread set the bucket. Wait while it done
310 // In this point, we must wait while nBucket is empty.
311 // The compiler can decide that waiting loop can be "optimized" (stripped)
312 // To prevent this situation, we use waiting on volatile bucket_head_ptr pointer.
314 m_Stat.onBucketInitContenton();
317 dummy_node_type volatile * p = m_Buckets.bucket( nBucket );
319 return const_cast<dummy_node_type *>( p );
321 m_Stat.onBusyWaitBucketInit();
325 dummy_node_type * get_bucket( size_t nHash )
327 size_t nBucket = bucket_no( nHash );
329 dummy_node_type * pHead = m_Buckets.bucket( nBucket );
330 if ( pHead == nullptr )
331 pHead = init_bucket( nBucket );
333 assert( pHead->is_dummy() );
340 // GC and OrderedList::gc must be the same
341 static_assert( std::is_same<gc, typename ordered_list::gc>::value, "GC and OrderedList::gc must be the same");
343 // atomicity::empty_item_counter is not allowed as a item counter
344 static_assert( !std::is_same<item_counter, cds::atomicity::empty_item_counter>::value,
345 "cds::atomicity::empty_item_counter is not allowed as a item counter");
347 // Initialize bucket 0
348 dummy_node_type * pNode = alloc_dummy_node( 0 /*split_list::dummy_hash(0)*/ );
350 // insert_aux_node cannot return false for empty list
351 CDS_VERIFY( m_List.insert_aux_node( pNode ));
353 m_Buckets.bucket( 0, pNode );
356 static size_t max_item_count( size_t nBucketCount, size_t nLoadFactor )
358 return nBucketCount * nLoadFactor;
361 void inc_item_count()
363 size_t nMaxCount = m_nMaxItemCount.load(memory_model::memory_order_relaxed);
364 if ( ++m_ItemCounter <= nMaxCount )
367 size_t sz = m_nBucketCountLog2.load(memory_model::memory_order_relaxed);
368 const size_t nBucketCount = static_cast<size_t>(1) << sz;
369 if ( nBucketCount < m_Buckets.capacity() ) {
370 // we may grow the bucket table
371 const size_t nLoadFactor = m_Buckets.load_factor();
372 if ( nMaxCount < max_item_count( nBucketCount, nLoadFactor ))
373 return; // someone already have updated m_nBucketCountLog2, so stop here
375 const size_t nNewMaxCount = (nBucketCount < m_Buckets.capacity()) ? max_item_count( nBucketCount << 1, nLoadFactor )
376 : std::numeric_limits<size_t>::max();
377 m_nMaxItemCount.compare_exchange_strong( nMaxCount, nNewMaxCount, memory_model::memory_order_relaxed,
378 atomics::memory_order_relaxed );
379 m_nBucketCountLog2.compare_exchange_strong( sz, sz + 1, memory_model::memory_order_relaxed, atomics::memory_order_relaxed );
383 template <typename Q, typename Compare, typename Func>
384 bool find_( Q& val, Compare cmp, Func f )
386 size_t nHash = hash_value( val );
387 split_list::details::search_value_type<Q> sv( val, split_list::regular_hash( nHash ));
388 dummy_node_type * pHead = get_bucket( nHash );
389 assert( pHead != nullptr );
391 return m_Stat.onFind( m_List.find_at( pHead, sv, cmp,
392 [&f](value_type& item, split_list::details::search_value_type<Q>& val){ f(item, val.val ); }));
395 template <typename Q, typename Compare>
396 bool find_value( Q const& val, Compare cmp )
398 size_t nHash = hash_value( val );
399 split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
400 dummy_node_type * pHead = get_bucket( nHash );
401 assert( pHead != nullptr );
403 return m_Stat.onFind( m_List.find_at( pHead, sv, cmp ));
406 template <typename Q, typename Compare>
407 value_type * get_( Q const& val, Compare cmp )
409 size_t nHash = hash_value( val );
410 split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
411 dummy_node_type * pHead = get_bucket( nHash );
412 assert( pHead != nullptr );
414 value_type * p = m_List.get_at( pHead, sv, cmp );
415 m_Stat.onFind( p != nullptr );
419 template <typename Q, typename Compare>
420 value_type * extract_( Q const& val, Compare cmp )
422 size_t nHash = hash_value( val );
423 split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
424 dummy_node_type * pHead = get_bucket( nHash );
425 assert( pHead != nullptr );
427 value_type * pNode = m_List.extract_at( pHead, sv, cmp );
430 m_Stat.onExtractSuccess();
433 m_Stat.onExtractFailed();
437 template <typename Q, typename Less>
438 value_type * extract_with_( Q const& val, Less pred )
441 return extract_( val, typename wrapped_ordered_list::template make_compare_from_less<Less>());
444 template <typename Q, typename Compare>
445 bool erase_( const Q& val, Compare cmp )
447 size_t nHash = hash_value( val );
448 split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
449 dummy_node_type * pHead = get_bucket( nHash );
450 assert( pHead != nullptr );
452 if ( m_List.erase_at( pHead, sv, cmp ) ) {
454 m_Stat.onEraseSuccess();
457 m_Stat.onEraseFailed();
461 template <typename Q, typename Compare, typename Func>
462 bool erase_( Q const& val, Compare cmp, Func f )
464 size_t nHash = hash_value( val );
465 split_list::details::search_value_type<Q const> sv( val, split_list::regular_hash( nHash ));
466 dummy_node_type * pHead = get_bucket( nHash );
467 assert( pHead != nullptr );
469 if ( m_List.erase_at( pHead, sv, cmp, f )) {
471 m_Stat.onEraseSuccess();
474 m_Stat.onEraseFailed();
481 /// Initialize split-ordered list of default capacity
483 The default capacity is defined in bucket table constructor.
484 See split_list::expandable_bucket_table, split_list::static_ducket_table
485 which selects by split_list::dynamic_bucket_table option.
488 : m_nBucketCountLog2(1)
489 , m_nMaxItemCount( max_item_count(2, m_Buckets.load_factor()) )
494 /// Initialize split-ordered list
496 size_t nItemCount ///< estimate average of item count
497 , size_t nLoadFactor = 1 ///< load factor - average item count per bucket. Small integer up to 8, default is 1.
499 : m_Buckets( nItemCount, nLoadFactor )
500 , m_nBucketCountLog2(1)
501 , m_nMaxItemCount( max_item_count(2, m_Buckets.load_factor()) )
509 The function inserts \p val in the set if it does not contain
510 an item with key equal to \p val.
512 The function makes RCU lock internally.
514 Returns \p true if \p val is placed into the set, \p false otherwise.
516 bool insert( value_type& val )
518 size_t nHash = hash_value( val );
519 dummy_node_type * pHead = get_bucket( nHash );
520 assert( pHead != nullptr );
522 node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
524 if ( m_List.insert_at( pHead, val )) {
526 m_Stat.onInsertSuccess();
529 m_Stat.onInsertFailed();
535 This function is intended for derived non-intrusive containers.
537 The function allows to split creating of new item into two part:
538 - create item with key only
539 - insert new item into the set
540 - if inserting is success, calls \p f functor to initialize value-field of \p val.
542 The functor signature is:
544 void func( value_type& val );
546 where \p val is the item inserted.
548 The function makes RCU lock internally.
550 @warning For \ref cds_intrusive_MichaelList_rcu "MichaelList" as the bucket see \ref cds_intrusive_item_creating "insert item troubleshooting".
551 \ref cds_intrusive_LazyList_rcu "LazyList" provides exclusive access to inserted item and does not require any node-level
554 template <typename Func>
555 bool insert( value_type& val, Func f )
557 size_t nHash = hash_value( val );
558 dummy_node_type * pHead = get_bucket( nHash );
559 assert( pHead != nullptr );
561 node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
563 if ( m_List.insert_at( pHead, val, f )) {
565 m_Stat.onInsertSuccess();
568 m_Stat.onInsertFailed();
572 /// Ensures that the \p val exists in the set
574 The operation performs inserting or changing data with lock-free manner.
576 If the item \p val is not found in the set, then \p val is inserted into the set.
577 Otherwise, the functor \p func is called with item found.
578 The functor signature is:
580 void func( bool bNew, value_type& item, value_type& val );
583 - \p bNew - \p true if the item has been inserted, \p false otherwise
584 - \p item - item of the set
585 - \p val - argument \p val passed into the \p ensure function
586 If new item has been inserted (i.e. \p bNew is \p true) then \p item and \p val arguments
587 refers to the same thing.
589 The function makes RCU lock internally.
591 Returns std::pair<bool, bool> where \p first is \p true if operation is successfull,
592 \p second is \p true if new item has been added or \p false if the item with \p key
593 already is in the set.
595 @warning For \ref cds_intrusive_MichaelList_rcu "MichaelList" as the bucket see \ref cds_intrusive_item_creating "insert item troubleshooting".
596 \ref cds_intrusive_LazyList_rcu "LazyList" provides exclusive access to inserted item and does not require any node-level
599 template <typename Func>
600 std::pair<bool, bool> ensure( value_type& val, Func func )
602 size_t nHash = hash_value( val );
603 dummy_node_type * pHead = get_bucket( nHash );
604 assert( pHead != nullptr );
606 node_traits::to_node_ptr( val )->m_nHash = split_list::regular_hash( nHash );
608 std::pair<bool, bool> bRet = m_List.ensure_at( pHead, val, func );
609 if ( bRet.first && bRet.second ) {
611 m_Stat.onEnsureNew();
614 m_Stat.onEnsureExist();
618 /// Unlinks the item \p val from the set
620 The function searches the item \p val in the set and unlinks it from the set
621 if it is found and is equal to \p val.
623 Difference between \ref erase and \p unlink functions: \p erase finds <i>a key</i>
624 and deletes the item found. \p unlink finds an item by key and deletes it
625 only if \p val is an item of that set, i.e. the pointer to item found
626 is equal to <tt> &val </tt>.
628 RCU \p synchronize method can be called, therefore, RCU should not be locked.
630 The function returns \p true if success and \p false otherwise.
632 bool unlink( value_type& val )
634 size_t nHash = hash_value( val );
635 dummy_node_type * pHead = get_bucket( nHash );
636 assert( pHead != nullptr );
638 if ( m_List.unlink_at( pHead, val ) ) {
640 m_Stat.onEraseSuccess();
643 m_Stat.onEraseFailed();
647 /// Deletes the item from the set
648 /** \anchor cds_intrusive_SplitListSet_rcu_erase
649 The function searches an item with key equal to \p key in the set,
650 unlinks it from the set, and returns \p true.
651 If the item with key equal to \p key is not found the function return \p false.
653 Difference between \ref erase and \p unlink functions: \p erase finds <i>a key</i>
654 and deletes the item found. \p unlink finds an item by key and deletes it
655 only if \p key is an item of that set, i.e. the pointer to item found
656 is equal to <tt> &key </tt>.
658 RCU \p synchronize method can be called, therefore, RCU should not be locked.
660 Note the hash functor should accept a parameter of type \p Q that can be not the same as \p value_type.
662 template <typename Q>
663 bool erase( Q const& key )
665 return erase_( key, key_comparator() );
668 /// Deletes the item from the set using \p pred for searching
670 The function is an analog of \ref cds_intrusive_SplitListSet_rcu_erase "erase(Q const&)"
671 but \p cmp is used for key compare.
672 \p Less has the interface like \p std::less.
673 \p pred must imply the same element order as the comparator used for building the set.
675 template <typename Q, typename Less>
676 bool erase_with( Q const& key, Less pred )
679 return erase_( key, typename wrapped_ordered_list::template make_compare_from_less<Less>() );
682 /// Deletes the item from the set
683 /** \anchor cds_intrusive_SplitListSet_rcu_erase_func
684 The function searches an item with key equal to \p key in the set,
685 call \p f functor with item found, unlinks it from the set, and returns \p true.
686 The \ref disposer specified by \p OrderedList class template parameter is called
687 by garbage collector \p GC asynchronously.
689 The \p Func interface is
692 void operator()( value_type const& item );
696 If the item with key equal to \p key is not found the function return \p false.
698 RCU \p synchronize method can be called, therefore, RCU should not be locked.
700 Note the hash functor should accept a parameter of type \p Q that can be not the same as \p value_type.
702 template <typename Q, typename Func>
703 bool erase( Q const& key, Func f )
705 return erase_( key, key_comparator(), f );
708 /// Deletes the item from the set using \p pred for searching
710 The function is an analog of \ref cds_intrusive_SplitListSet_rcu_erase_func "erase(Q const&, Func)"
711 but \p cmp is used for key compare.
712 \p Less has the interface like \p std::less.
713 \p pred must imply the same element order as the comparator used for building the set.
715 template <typename Q, typename Less, typename Func>
716 bool erase_with( Q const& key, Less pred, Func f )
719 return erase_( key, typename wrapped_ordered_list::template make_compare_from_less<Less>(), f );
722 /// Extracts an item from the set
723 /** \anchor cds_intrusive_SplitListSet_rcu_extract
724 The function searches an item with key equal to \p key in the set,
725 unlinks it, and returns \ref cds::urcu::exempt_ptr "exempt_ptr" pointer to the item found.
726 If the item with the key equal to \p key is not found the function returns an empty \p exempt_ptr.
728 @note The function does NOT call RCU read-side lock or synchronization,
729 and does NOT dispose the item found. It just excludes the item from the set
730 and returns a pointer to item found.
731 You should lock RCU before calling of the function, and you should synchronize RCU
732 outside the RCU lock before reusing returned pointer.
735 typedef cds::urcu::gc< general_buffered<> > rcu;
736 typedef cds::intrusive::MichaelList< rcu, Foo > rcu_michael_list;
737 typedef cds::intrusive::SplitListSet< rcu, rcu_michael_list, foo_traits > rcu_splitlist_set;
739 rcu_splitlist_set theSet;
742 rcu_splitlist_set::exempt_ptr p;
744 // first, we should lock RCU
745 rcu_splitlist_set::rcu_lock lock;
747 // Now, you can apply extract function
748 // Note that you must not delete the item found inside the RCU lock
749 p = theList.extract( 10 );
751 // do something with p
756 // We may safely release p here
757 // release() passes the pointer to RCU reclamation cycle:
758 // it invokes RCU retire_ptr function with the disposer you provided for rcu_michael_list.
762 template <typename Q>
763 exempt_ptr extract( Q const& key )
765 return exempt_ptr(extract_( key, key_comparator() ));
768 /// Extracts an item from the set using \p pred for searching
770 The function is an analog of \p extract(Q const&) but \p pred is used for key compare.
771 \p Less functor has the interface like \p std::less.
772 \p pred must imply the same element order as the comparator used for building the set.
774 template <typename Q, typename Less>
775 exempt_ptr extract_with( Q const& key, Less pred )
777 return exempt_ptr( extract_with_( key, pred ));
780 /// Finds the key \p key
781 /** \anchor cds_intrusive_SplitListSet_rcu_find_func
782 The function searches the item with key equal to \p key and calls the functor \p f for item found.
783 The interface of \p Func functor is:
786 void operator()( value_type& item, Q& key );
789 where \p item is the item found, \p key is the <tt>find</tt> function argument.
791 The functor can change non-key fields of \p item. Note that the functor is only guarantee
792 that \p item cannot be disposed during functor is executing.
793 The functor does not serialize simultaneous access to the set \p item. If such access is
794 possible you must provide your own synchronization schema on item level to exclude unsafe item modifications.
796 The \p key argument is non-const since it can be used as \p f functor destination i.e., the functor
797 can modify both arguments.
799 Note the hash functor specified for class \p Traits template parameter
800 should accept a parameter of type \p Q that can be not the same as \p value_type.
802 The function applies RCU lock internally.
804 The function returns \p true if \p key is found, \p false otherwise.
806 template <typename Q, typename Func>
807 bool find( Q& key, Func f )
809 return find_( key, key_comparator(), f );
812 template <typename Q, typename Func>
813 bool find( Q const& key, Func f )
815 return find_( key, key_comparator(), f );
819 /// Finds the key \p key with \p pred predicate for comparing
821 The function is an analog of \ref cds_intrusive_SplitListSet_rcu_find_func "find(Q&, Func)"
822 but \p cmp is used for key compare.
823 \p Less has the interface like \p std::less.
824 \p cmp must imply the same element order as the comparator used for building the set.
826 template <typename Q, typename Less, typename Func>
827 bool find_with( Q& key, Less pred, Func f )
830 return find_( key, typename wrapped_ordered_list::template make_compare_from_less<Less>(), f );
833 template <typename Q, typename Less, typename Func>
834 bool find_with( Q const& key, Less pred, Func f )
837 return find_( key, typename wrapped_ordered_list::template make_compare_from_less<Less>(), f );
841 /// Finds the key \p key
842 /** \anchor cds_intrusive_SplitListSet_rcu_find_val
843 The function searches the item with key equal to \p key
844 and returns \p true if \p key found or \p false otherwise.
846 template <typename Q>
847 bool find( Q const& key )
849 return find_value( key, key_comparator() );
852 /// Finds the key \p key with \p pred predicate for comparing
854 The function is an analog of \ref cds_intrusive_SplitListSet_rcu_find_val "find(Q const&)"
855 but \p cmp is used for key compare.
856 \p Less has the interface like \p std::less.
857 \p pred must imply the same element order as the comparator used for building the set.
859 template <typename Q, typename Less>
860 bool find_with( Q const& key, Less pred )
863 return find_value( key, typename wrapped_ordered_list::template make_compare_from_less<Less>() );
866 /// Finds the key \p key and return the item found
867 /** \anchor cds_intrusive_SplitListSet_rcu_get
868 The function searches the item with key equal to \p key and returns the pointer to item found.
869 If \p key is not found it returns \p nullptr.
871 Note the compare functor should accept a parameter of type \p Q that can be not the same as \p value_type.
873 RCU should be locked before call of this function.
874 Returned item is valid only while RCU is locked:
876 cds::intrusive::SplitListSet< your_template_parameters > theSet;
880 hash_set::rcu_lock lock;
882 foo * pVal = theSet.get( 5 );
887 // Unlock RCU by rcu_lock destructor
888 // pVal can be retired by disposer at any time after RCU has been unlocked
892 template <typename Q>
893 value_type * get( Q const& key )
895 return get_( key, key_comparator() );
898 /// Finds the key \p key and return the item found
900 The function is an analog of \ref cds_intrusive_SplitListSet_rcu_get "get(Q const&)"
901 but \p pred is used for comparing the keys.
903 \p Less functor has the semantics like \p std::less but should take arguments of type \ref value_type and \p Q
905 \p pred must imply the same element order as the comparator used for building the set.
907 template <typename Q, typename Less>
908 value_type * get_with( Q const& key, Less pred )
911 return get_( key, typename wrapped_ordered_list::template make_compare_from_less<Less>());
915 /// Returns item count in the set
918 return m_ItemCounter;
921 /// Checks if the set is empty
923 Emptiness is checked by item counting: if item count is zero then the set is empty.
924 Thus, the correct item counting feature is an important part of split-list set implementation.
931 /// Clears the set (not atomic)
934 iterator it = begin();
935 while ( it != end() ) {
943 /// Returns internal statistics
944 stat const& statistics() const
951 template <bool IsConst>
953 :public split_list::details::iterator_type<node_traits, ordered_list, IsConst>
955 typedef split_list::details::iterator_type<node_traits, ordered_list, IsConst> iterator_base_class;
956 typedef typename iterator_base_class::list_iterator list_iterator;
959 : iterator_base_class()
962 iterator_type( iterator_type const& src )
963 : iterator_base_class( src )
966 // This ctor should be protected...
967 iterator_type( list_iterator itCur, list_iterator itEnd )
968 : iterator_base_class( itCur, itEnd )
975 The forward iterator for a split-list has some features:
976 - it has no post-increment operator
977 - it depends on iterator of underlying \p OrderedList
978 - The iterator cannot be moved across thread boundary since it may contain GC's guard that is thread-private GC data.
979 - Iterator ensures thread-safety even if you delete the item that iterator points to. However, in case of concurrent
980 deleting operations it is no guarantee that you iterate all item in the split-list.
982 Therefore, the use of iterators in concurrent environment is not good idea. Use the iterator on the concurrent container
983 for debug purpose only.
985 typedef iterator_type<false> iterator;
986 /// Const forward iterator
988 For iterator's features and requirements see \ref iterator
990 typedef iterator_type<true> const_iterator;
992 /// Returns a forward iterator addressing the first element in a split-list
994 For empty list \code begin() == end() \endcode
998 return iterator( m_List.begin(), m_List.end() );
1001 /// Returns an iterator that addresses the location succeeding the last element in a split-list
1003 Do not use the value returned by <tt>end</tt> function to access any item.
1005 The returned value can be used only to control reaching the end of the split-list.
1006 For empty list \code begin() == end() \endcode
1010 return iterator( m_List.end(), m_List.end() );
1013 /// Returns a forward const iterator addressing the first element in a split-list
1014 const_iterator begin() const
1018 /// Returns a forward const iterator addressing the first element in a split-list
1019 const_iterator cbegin() const
1021 return const_iterator( m_List.cbegin(), m_List.cend() );
1024 /// Returns an const iterator that addresses the location succeeding the last element in a split-list
1025 const_iterator end() const
1029 /// Returns an const iterator that addresses the location succeeding the last element in a split-list
1030 const_iterator cend() const
1032 return const_iterator( m_List.cend(), m_List.cend() );
1037 }} // namespace cds::intrusive
1039 #endif // #ifndef CDSLIB_INTRUSIVE_SPLIT_LIST_RCU_H