honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link Struct Reference

Combines node pointer and delete mark in one Cas-able integer. More...

#include <List.h>

Inheritance diagram for honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link:

Collaboration diagram for honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link:

Public Member Functions
	Link ()
	Link (Node *ptr, bool d=false)
Node *	ptr () const
bool	d () const
bool	cas (const Link &val, const Link &old)
bool	operator== (const Link &rhs)
bool	operator!= (const Link &rhs)
Public Member Functions inherited from honey::lockfree::HazardMemLink< Node >
Node *	ptr () const
	Get node pointer. More...

Static Public Attributes
static const intptr_t	d_mask = 1
static const intptr_t	ptr_mask = ~d_mask

Additional Inherited Members
Public Attributes inherited from honey::lockfree::HazardMemLink< Node >
Atomic< intptr_t >	data

Detailed Description

template<class T, class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>
struct honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link

Combines node pointer and delete mark in one Cas-able integer.

Constructor & Destructor Documentation

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::Link ( )

inline

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::Link ( Node *  ptr, bool  d = false  )

inline

Member Function Documentation

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

bool honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::cas ( const Link &  val, const Link &  old  )

inline

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

bool honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::d ( ) const

inline

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

bool honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::operator!= ( const Link &  rhs )

inline

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

bool honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::operator== ( const Link &  rhs )

inline

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

Node* honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::ptr ( ) const

inline

Member Data Documentation

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

const intptr_t honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::d_mask = 1

static

template<class T , class Alloc_ = SmallAllocator<T>, class Backoff = Backoff, uint8 iterMax = 2>

const intptr_t honey::lockfree::List< T, Alloc_, Backoff, iterMax >::Node::Link::ptr_mask = ~d_mask

static

---

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

• src/common/Honey/Thread/LockFree/List.h