cds  2.2.0
cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits > Class Template Reference

Lazy ordered single-linked list (template specialization for RCU) More...

#include <cds/intrusive/lazy_list_rcu.h>

Inheritance diagram for cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >:
cds::container::LazyList< cds::urcu::gc< RCU >, T, Traits >

Public Types

typedef cds::urcu::gc< RCU > gc
 RCU schema.
 
typedef T value_type
 type of value stored in the list
 
typedef Traits traits
 Traits template parameter.
 
typedef traits::hook hook
 hook type
 
typedef hook::node_type node_type
 node type
 
typedef implementation_defined key_comparator
 key compare functor based on opt::compare and opt::less option setter.
 
typedef traits::disposer disposer
 disposer used
 
typedef get_node_traits< value_type, node_type, hook >::type node_traits
 node traits
 
typedef lazy_list::get_link_checker< node_type, traits::link_checker >::type link_checker
 link checker
 
typedef traits::back_off back_off
 back-off strategy (not used)
 
typedef traits::item_counter item_counter
 Item counting policy used.
 
typedef traits::memory_model memory_model
 C++ memory ordering (see lazy_list::traits::memory_model)
 
typedef traits::stat stat
 Internal statistics.
 
typedef traits::rcu_check_deadlock rcu_check_deadlock
 Deadlock checking policy.
 
typedef gc::scoped_lock rcu_lock
 RCU scoped lock.
 
using exempt_ptr = cds::urcu::exempt_ptr< gc, value_type, value_type, clear_and_dispose, void >
 pointer to extracted node
 
typedef value_typeraw_ptr
 Type of get() member function return value.
 

Public Member Functions

 LazyList ()
 Default constructor initializes empty list.
 
 ~LazyList ()
 Destroys the list object.
 
bool insert (value_type &val)
 Inserts new node. More...
 
template<typename Func >
bool insert (value_type &val, Func f)
 Inserts new node. More...
 
template<typename Func >
std::pair< bool, bool > update (value_type &val, Func func, bool bAllowInsert=true)
 Updates the item. More...
 
bool unlink (value_type &val)
 Unlinks the item val from the list. More...
 
template<typename Q >
bool erase (Q const &key)
 Deletes the item from the list. More...
 
template<typename Q , typename Less >
bool erase_with (Q const &key, Less pred)
 Deletes the item from the list using pred predicate for searching. More...
 
template<typename Q , typename Func >
bool erase (Q const &key, Func func)
 Deletes the item from the list. More...
 
template<typename Q , typename Less , typename Func >
bool erase_with (Q const &key, Less pred, Func func)
 Deletes the item from the list using pred predicate for searching. More...
 
template<typename Q >
exempt_ptr extract (Q const &key)
 Extracts an item from the list. More...
 
template<typename Q , typename Less >
exempt_ptr extract_with (Q const &key, Less pred)
 Extracts an item from the list using pred predicate for searching. More...
 
template<typename Q , typename Func >
bool find (Q &key, Func f) const
 Finds the key key. More...
 
template<typename Q , typename Less , typename Func >
bool find_with (Q &key, Less pred, Func f) const
 Finds the key key using pred predicate for searching. More...
 
template<typename Q >
bool contains (Q const &key) const
 Checks whether the list contains key. More...
 
template<typename Q , typename Less >
bool contains (Q const &key, Less pred) const
 Checks whether the map contains key using pred predicate for searching. More...
 
template<typename Q >
value_typeget (Q const &key) const
 Finds the key key and return the item found. More...
 
template<typename Q , typename Less >
value_typeget_with (Q const &key, Less pred) const
 Finds the key key and return the item found. More...
 
void clear ()
 Clears the list using default disposer. More...
 
bool empty () const
 Checks if the list is empty.
 
size_t size () const
 Returns list's item count. More...
 
stat const & statistics () const
 Returns const reference to internal statistics.
 

Static Public Attributes

static constexpr const bool c_bExtractLockExternal = true
 Group of extract_xxx functions require external locking.
 

Protected Attributes

node_type m_Head
 List head (dummy node)
 
node_type m_Tail
 List tail (dummy node)
 
item_counter m_ItemCounter
 Item counter.
 
stat m_Stat
 Internal statistics.
 

Forward iterators (thread-safe only under RCU lock)

typedef iterator_type< false > iterator
 Forward iterator. More...
 
typedef iterator_type< true > const_iterator
 Const forward iterator.
 
iterator begin ()
 Returns a forward iterator addressing the first element in a list. More...
 
iterator end ()
 Returns an iterator that addresses the location succeeding the last element in a list. More...
 
const_iterator begin () const
 Returns a forward const iterator addressing the first element in a list.
 
const_iterator cbegin () const
 Returns a forward const iterator addressing the first element in a list.
 
const_iterator end () const
 Returns an const iterator that addresses the location succeeding the last element in a list.
 
const_iterator cend () const
 Returns an const iterator that addresses the location succeeding the last element in a list.
 

Detailed Description

template<typename RCU, typename T, class Traits = lazy_list::traits>
class cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >

Lazy ordered single-linked list (template specialization for RCU)

Usually, ordered single-linked list is used as a building block for the hash table implementation. The complexity of searching is O(N).

Template arguments:

  • RCU - one of RCU type
  • T - type to be stored in the list
  • Traits - type traits. See lazy_list::traits for explanation. It is possible to declare option-based list with cds::intrusive::lazy_list::make_traits metafunction instead of Traits template argument.
Usage
Before including <cds/intrusive/lazy_list_rcu.h> you should include appropriate RCU header file, see RCU type for list of existing RCU class and corresponding header files. For example, for general-purpose buffered RCU you should include:
#include <cds/urcu/general_buffered.h>
#include <cds/intrusive/lazy_list_rcu.h>
// Now, you can declare lazy list for type Foo and default traits:

Member Typedef Documentation

§ iterator

template<typename RCU , typename T , class Traits = lazy_list::traits>
typedef iterator_type<false> cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::iterator

Forward iterator.

You may safely use iterators in multi-threaded environment only under RCU lock. Otherwise, a crash is possible if another thread deletes the item the iterator points to.

Member Function Documentation

§ begin()

template<typename RCU , typename T , class Traits = lazy_list::traits>
iterator cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::begin ( )
inline

Returns a forward iterator addressing the first element in a list.

For empty list

begin() == end()

§ clear()

template<typename RCU , typename T , class Traits = lazy_list::traits>
void cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::clear ( )
inline

Clears the list using default disposer.

The function clears the list using default (provided in class template) disposer functor.

RCU synchronize method can be called. Note that depending on RCU type used the disposer call can be deferred.

The function can throw cds::urcu::rcu_deadlock exception if deadlock is encountered and deadlock checking policy is opt::v::rcu_throw_deadlock.

§ contains() [1/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::contains ( Q const &  key) const
inline

Checks whether the list contains key.

The function searches the item with key equal to key and returns true if it is found, and false otherwise.

§ contains() [2/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Less >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::contains ( Q const &  key,
Less  pred 
) const
inline

Checks whether the map contains key using pred predicate for searching.

The function is an analog of contains( Q const& ) but pred is used for key comparing. Less functor has the interface like std::less. Less must imply the same element order as the comparator used for building the list.

§ end()

template<typename RCU , typename T , class Traits = lazy_list::traits>
iterator cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::end ( )
inline

Returns an iterator that addresses the location succeeding the last element in a list.

Do not use the value returned by end function to access any item.

The returned value can be used only to control reaching the end of the list. For empty list

begin() == end()

§ erase() [1/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::erase ( Q const &  key)
inline

Deletes the item from the list.

The function searches an item with key equal to key in the list, unlinks it from the list, and returns true. If the item with the key equal to key is not found the function return false.

RCU synchronize method can be called. The RCU should not be locked. Note that depending on RCU type used the disposer call can be deferred.

disposer specified in Traits is called for deleted item.

The function can throw cds::urcu::rcu_deadlock exception if deadlock is encountered and deadlock checking policy is opt::v::rcu_throw_deadlock.

§ erase() [2/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Func >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::erase ( Q const &  key,
Func  func 
)
inline

Deletes the item from the list.

The function searches an item with key equal to key in the list, call func functor with item found, unlinks it from the list, and returns true. The Func interface is

struct functor {
void operator()( value_type const& item );
};

If the item with the key equal to key is not found the function return false.

RCU synchronize method can be called. The RCU should not be locked. Note that depending on RCU type used the disposer call can be deferred.

disposer specified in Traits is called for deleted item.

The function can throw cds::urcu::rcu_deadlock exception if deadlock is encountered and deadlock checking policy is opt::v::rcu_throw_deadlock.

§ erase_with() [1/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Less >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::erase_with ( Q const &  key,
Less  pred 
)
inline

Deletes the item from the list using pred predicate for searching.

The function is an analog of erase(Q const&) but pred is used for key comparing. Less functor has the interface like std::less. pred must imply the same element order as the comparator used for building the list.

disposer specified in Traits is called for deleted item.

§ erase_with() [2/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Less , typename Func >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::erase_with ( Q const &  key,
Less  pred,
Func  func 
)
inline

Deletes the item from the list using pred predicate for searching.

The function is an analog of erase(Q const&, Func) but pred is used for key comparing. Less functor has the interface like std::less. pred must imply the same element order as the comparator used for building the list.

disposer specified in Traits is called for deleted item.

§ extract()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q >
exempt_ptr cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::extract ( Q const &  key)
inline

Extracts an item from the list.

The function searches an item with key equal to key in the list, unlinks it from the list, and returns exempt_ptr pointer to an item found. If the item is not found the function returns empty exempt_ptr.

Note
The function does NOT call RCU read-side lock or synchronization, and does NOT dispose the item found. It just unlinks the item from the list and returns a pointer to it. You should manually lock RCU before calling this function, and you should manually release the returned exempt pointer outside the RCU lock region before reusing returned pointer.
#include <cds/urcu/general_buffered.h>
#include <cds/intrusive/lazy_list_rcu.h>
typedef cds::urcu::gc< general_buffered<> > rcu;
rcu_lazy_list theList;
// ...
rcu_lazy_list::exempt_ptr p1;
{
// first, we should lock RCU
rcu::scoped_lock sl;
// Now, you can apply extract function
// Note that you must not delete the item found inside the RCU lock
p1 = theList.extract( 10 )
if ( p1 ) {
// do something with p1
...
}
}
// We may safely release p1 here
// release() passes the pointer to RCU reclamation cycle:
// it invokes RCU retire_ptr function with the disposer you provided for the list.
p1.release();

§ extract_with()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Less >
exempt_ptr cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::extract_with ( Q const &  key,
Less  pred 
)
inline

Extracts an item from the list using pred predicate for searching.

This function is the analog for extract(Q const&).

The pred is a predicate used for key comparing. Less has the interface like std::less. pred must imply the same element order as key_comparator.

§ find()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Func >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::find ( Q &  key,
Func  f 
) const
inline

Finds the key key.

The function searches the item with key equal to key and calls the functor f for item found. The interface of Func functor is:

struct functor {
void operator()( value_type& item, Q& key );
};

where item is the item found, key is the find function argument.

The functor may change non-key fields of item. While the functor f is calling the item found item is locked.

The function returns true if key is found, false otherwise.

§ find_with()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Less , typename Func >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::find_with ( Q &  key,
Less  pred,
Func  f 
) const
inline

Finds the key key using pred predicate for searching.

The function is an analog of find( Q&, Func ) but pred is used for key comparing. Less functor has the interface like std::less. pred must imply the same element order as the comparator used for building the list.

§ get()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q >
value_type* cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::get ( Q const &  key) const
inline

Finds the key key and return the item found.

The function searches the item with key equal to key and returns the pointer to item found. If key is not found it returns nullptr.

Note the compare functor should accept a parameter of type Q that can be not the same as value_type.

RCU should be locked before call of this function. Returned item is valid only while RCU is locked:

ord_list theList;
// ...
{
// Lock RCU
typename ord_list::rcu_lock lock;
foo * pVal = theList.get( 5 );
if ( pVal ) {
// Deal with pVal
//...
}
// Unlock RCU by rcu_lock destructor
// pVal can be retired by disposer at any time after RCU has been unlocked
}

§ get_with()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Q , typename Less >
value_type* cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::get_with ( Q const &  key,
Less  pred 
) const
inline

Finds the key key and return the item found.

The function is an analog of get(Q const&) but pred is used for comparing the keys.

Less functor has the semantics like std::less but should take arguments of type value_type and Q in any order. pred must imply the same element order as the comparator used for building the list.

§ insert() [1/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::insert ( value_type val)
inline

Inserts new node.

The function inserts val in the list if the list does not contain an item with key equal to val.

Returns true if val is linked into the list, false otherwise.

§ insert() [2/2]

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Func >
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::insert ( value_type val,
Func  f 
)
inline

Inserts new node.

This function is intended for derived non-intrusive containers.

The function allows to split new item creating into two part:

  • create item with key only
  • insert new item into the list
  • if inserting is success, calls f functor to initialize value-field of val.

The functor signature is:

void func( value_type& val );

where val is the item inserted. While the functor f is working the item val is locked. The user-defined functor is called only if the inserting is success.

§ size()

template<typename RCU , typename T , class Traits = lazy_list::traits>
size_t cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::size ( ) const
inline

Returns list's item count.

The value returned depends on opt::item_counter option. For atomicity::empty_item_counter, this function always returns 0.

Warning: even if you use real item counter and it returns 0, this fact is not mean that the list is empty. To check list emptiness use empty() method.

§ unlink()

template<typename RCU , typename T , class Traits = lazy_list::traits>
bool cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::unlink ( value_type val)
inline

Unlinks the item val from the list.

The function searches the item val in the list and unlink it from the list if it is found and it is equal to val.

Difference between erase() and unlink() functions: erase() finds a key and deletes the item found. unlink() finds an item by key and deletes it only if val is an item of that list, i.e. the pointer to item found is equal to &val .

The function returns true if success and false otherwise.

RCU synchronize method can be called. The RCU should not be locked. Note that depending on RCU type used the disposer call can be deferred.

disposer specified in Traits is called for unlinked item.

The function can throw cds::urcu::rcu_deadlock exception if deadlock is encountered and deadlock checking policy is opt::v::rcu_throw_deadlock.

§ update()

template<typename RCU , typename T , class Traits = lazy_list::traits>
template<typename Func >
std::pair<bool, bool> cds::intrusive::LazyList< cds::urcu::gc< RCU >, T, Traits >::update ( value_type val,
Func  func,
bool  bAllowInsert = true 
)
inline

Updates the item.

The operation performs inserting or changing data with lock-free manner.

If the item val not found in the list, then val is inserted into the list iff bAllowInsert is true. Otherwise, the functor func is called with item found. The functor signature is:

struct functor {
void operator()( bool bNew, value_type& item, value_type& val );
};

with arguments:

  • bNew - true if the item has been inserted, false otherwise
  • item - item of the list
  • val - argument val passed into the update() function If new item has been inserted (i.e. bNew is true) then item and val arguments refer to the same thing.

The functor may change non-key fields of the item. While the functor f is calling the item item is locked.

Returns std::pair<bool, bool> where first is true if operation is successful, second is true if new item has been added or false if the item with key already is in the list.

The function makes RCU lock internally.


The documentation for this class was generated from the following file:

cds 2.2.0 Developed by Maxim Khizhinsky aka khizmax 2007 - 2017
Autogenerated Wed Jan 4 2017 08:49:50 by Doxygen 1.8.12