tbb::interface5::internal::split_ordered_list< T, Allocator >::node Struct Reference

#include <_concurrent_unordered_impl.h>

Inheritance diagram for tbb::interface5::internal::split_ordered_list< T, Allocator >::node:

Collaboration diagram for tbb::interface5::internal::split_ordered_list< T, Allocator >::node:

Public Member Functions
void	init (sokey_t order_key)
sokey_t	get_order_key () const
nodeptr_t	atomic_set_next (nodeptr_t new_node, nodeptr_t current_node)
bool	is_dummy () const

Public Attributes
nodeptr_t	my_next
value_type	my_element
sokey_t	my_order_key

Private Member Functions
	node ()

Detailed Description

template<typename T, typename Allocator>
struct tbb::interface5::internal::split_ordered_list< T, Allocator >::node

Definition at line 210 of file _concurrent_unordered_impl.h.

Constructor & Destructor Documentation

node()

template<typename T, typename Allocator>

tbb::interface5::internal::split_ordered_list< T, Allocator >::node::node ( )

private

Member Function Documentation

atomic_set_next()

template<typename T, typename Allocator>

nodeptr_t tbb::interface5::internal::split_ordered_list< T, Allocator >::node::atomic_set_next ( nodeptr_t  new_node, nodeptr_t  current_node  )

inline

Definition at line 228 of file _concurrent_unordered_impl.h.

References tbb::internal::as_atomic().

        {
            // Try to change the next pointer on the current element to a new element, only if it still points to the cached next
            nodeptr_t exchange_node = tbb::internal::as_atomic(my_next).compare_and_swap(new_node, current_node);

            if (exchange_node == current_node) // TODO: why this branch?
            {
                // Operation succeeded, return the new node
                return new_node;
            }
            else
            {
                // Operation failed, return the "interfering" node
                return exchange_node;
            }
        }

Here is the call graph for this function:

get_order_key()

template<typename T, typename Allocator>

sokey_t tbb::interface5::internal::split_ordered_list< T, Allocator >::node::get_order_key ( ) const

inline

Definition at line 223 of file _concurrent_unordered_impl.h.

                                      { // TODO: remove
            return my_order_key;
        }

init()

template<typename T, typename Allocator>

void tbb::interface5::internal::split_ordered_list< T, Allocator >::node::init ( sokey_t  order_key )

inline

Definition at line 217 of file _concurrent_unordered_impl.h.

                                     {
            my_order_key = order_key;
            my_next = NULL;
        }

is_dummy()

template<typename T, typename Allocator>

bool tbb::interface5::internal::split_ordered_list< T, Allocator >::node::is_dummy ( ) const

inline

Definition at line 247 of file _concurrent_unordered_impl.h.

                              {
            return (my_order_key & 0x1) == 0;
        }

Member Data Documentation

my_element

template<typename T, typename Allocator>

value_type tbb::interface5::internal::split_ordered_list< T, Allocator >::node::my_element

Definition at line 253 of file _concurrent_unordered_impl.h.

my_next

template<typename T, typename Allocator>

nodeptr_t tbb::interface5::internal::split_ordered_list< T, Allocator >::node::my_next

Definition at line 252 of file _concurrent_unordered_impl.h.

my_order_key

template<typename T, typename Allocator>

sokey_t tbb::interface5::internal::split_ordered_list< T, Allocator >::node::my_order_key

Definition at line 254 of file _concurrent_unordered_impl.h.

---

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

• _concurrent_unordered_impl.h