internal::node_cache< T, M > Class Template Reference

A node_cache maintains a std::queue of elements of type T. Each operation is protected by a lock. More...

#include <_flow_graph_cache_impl.h>

Inheritance diagram for internal::node_cache< T, M >:

Collaboration diagram for internal::node_cache< T, M >:

Public Types
typedef size_t	size_type

Public Member Functions
bool	empty ()
void	add (T &n)
void	remove (T &n)
void	clear ()

Protected Types
typedef M	mutex_type

Protected Member Functions
bool	internal_empty ()
size_type	internal_size ()
void	internal_push (T &n)
T &	internal_pop ()

Protected Attributes
mutex_type	my_mutex
std::queue< T *>	my_q

Detailed Description

template<typename T, typename M = spin_mutex>
class internal::node_cache< T, M >

A node_cache maintains a std::queue of elements of type T. Each operation is protected by a lock.

Definition at line 34 of file _flow_graph_cache_impl.h.

Member Typedef Documentation

mutex_type

template<typename T, typename M = spin_mutex>

typedef M internal::node_cache< T, M >::mutex_type

protected

Definition at line 93 of file _flow_graph_cache_impl.h.

size_type

template<typename T, typename M = spin_mutex>

typedef size_t internal::node_cache< T, M >::size_type

Definition at line 37 of file _flow_graph_cache_impl.h.

Member Function Documentation

add()

template<typename T, typename M = spin_mutex>

void internal::node_cache< T, M >::add ( T &  n )

inline

Definition at line 44 of file _flow_graph_cache_impl.h.

Referenced by internal::predecessor_cache< input_type, null_mutex >::get_item(), internal::function_input_base< Input, Policy, A, multifunction_input< Input, OutputPortSet, Policy, A > >::handle_operations(), and internal::reservable_predecessor_cache< T, null_mutex >::try_reserve().

                     {
        typename mutex_type::scoped_lock lock( my_mutex );
        internal_push(n);
    }

Here is the caller graph for this function:

clear()

template<typename T, typename M = spin_mutex>

void internal::node_cache< T, M >::clear ( )

inline

Definition at line 58 of file _flow_graph_cache_impl.h.

Referenced by internal::reservable_predecessor_cache< T, null_mutex >::clear(), and internal::function_input_base< Input, Policy, A, multifunction_input< Input, OutputPortSet, Policy, A > >::reset_receiver().

                 {
        while( !my_q.empty()) (void)my_q.pop();
#if TBB_DEPRECATED_FLOW_NODE_EXTRACTION
        my_built_predecessors.clear();
#endif
    }

Here is the caller graph for this function:

empty()

template<typename T, typename M = spin_mutex>

bool internal::node_cache< T, M >::empty ( )

inline

Definition at line 39 of file _flow_graph_cache_impl.h.

Referenced by internal::function_input_base< Input, Policy, A, multifunction_input< Input, OutputPortSet, Policy, A > >::reset_receiver().

                 {
        typename mutex_type::scoped_lock lock( my_mutex );
        return internal_empty();
    }

Here is the caller graph for this function:

internal_empty()

template<typename T, typename M = spin_mutex>

bool internal::node_cache< T, M >::internal_empty ( )

inlineprotected

Definition at line 101 of file _flow_graph_cache_impl.h.

Referenced by internal::node_cache< sender< T >, M >::empty(), internal::predecessor_cache< input_type, null_mutex >::get_item(), internal::predecessor_cache< input_type, null_mutex >::reset(), and internal::reservable_predecessor_cache< T, null_mutex >::try_reserve().

                                   {
        return my_q.empty();
    }

Here is the caller graph for this function:

internal_pop()

template<typename T, typename M = spin_mutex>

T& internal::node_cache< T, M >::internal_pop ( )

inlineprotected

Definition at line 116 of file _flow_graph_cache_impl.h.

Referenced by internal::predecessor_cache< input_type, null_mutex >::get_item(), internal::node_cache< sender< T >, M >::remove(), internal::predecessor_cache< input_type, null_mutex >::reset(), and internal::reservable_predecessor_cache< T, null_mutex >::try_reserve().

                             {
        T *v = my_q.front();
        my_q.pop();
        return *v;
    }

Here is the caller graph for this function:

internal_push()

template<typename T, typename M = spin_mutex>

void internal::node_cache< T, M >::internal_push ( T &  n )

inlineprotected

Definition at line 111 of file _flow_graph_cache_impl.h.

Referenced by internal::node_cache< sender< T >, M >::add(), and internal::node_cache< sender< T >, M >::remove().

                                       {
        my_q.push(&n);
    }

Here is the caller graph for this function:

internal_size()

template<typename T, typename M = spin_mutex>

size_type internal::node_cache< T, M >::internal_size ( )

inlineprotected

Definition at line 106 of file _flow_graph_cache_impl.h.

Referenced by internal::node_cache< sender< T >, M >::remove().

                                       {
        return my_q.size();
    }

Here is the caller graph for this function:

remove()

template<typename T, typename M = spin_mutex>

void internal::node_cache< T, M >::remove ( T &  n )

inline

Definition at line 49 of file _flow_graph_cache_impl.h.

Referenced by internal::function_input_base< Input, Policy, A, multifunction_input< Input, OutputPortSet, Policy, A > >::handle_operations().

                        {
        typename mutex_type::scoped_lock lock( my_mutex );
        for ( size_t i = internal_size(); i != 0; --i ) {
            T &s = internal_pop();
            if ( &s == &n )  return;  // only remove one predecessor per request
            internal_push(s);
        }
    }

Here is the caller graph for this function:

Member Data Documentation

my_mutex

template<typename T, typename M = spin_mutex>

mutex_type internal::node_cache< T, M >::my_mutex

protected

Definition at line 94 of file _flow_graph_cache_impl.h.

Referenced by internal::node_cache< sender< T >, M >::add(), internal::node_cache< sender< T >, M >::clear(), internal::node_cache< sender< T >, M >::empty(), internal::predecessor_cache< input_type, null_mutex >::get_item(), internal::node_cache< sender< T >, M >::remove(), internal::round_robin_cache< T, M >::size(), internal::broadcast_cache< output_type >::try_put_task(), internal::round_robin_cache< T, M >::try_put_task(), and internal::reservable_predecessor_cache< T, null_mutex >::try_reserve().

my_q

template<typename T, typename M = spin_mutex>

std::queue< T * > internal::node_cache< T, M >::my_q

protected

Definition at line 95 of file _flow_graph_cache_impl.h.

Referenced by internal::node_cache< sender< T >, M >::clear().

---

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

• _flow_graph_cache_impl.h