Home
last modified time | relevance | path

Searched refs:ref_count (Results 1 – 10 of 10) sorted by relevance

/oneTBB/examples/parallel_for_each/parallel_preorder/
H A Dparallel_preorder.cpp36 c->ref_count = ArityOfOp[c->op]; in operator ()()
42 if (0 == --(successor->ref_count)) { in operator ()()
H A DGraph.cpp24 ref_count = other.ref_count.load(); in Cell()
70 c.ref_count = ArityOfOp[c.op]; in get_root_set()
H A DREADME.md9 2. Each cell has an associated field `ref_count` that is an atomic integer. Initialize `ref_count` …
12 1. Atomically decrement the successor's ref_count
17 The example is using custom synchronization via ref_count atomic variable. Correctness checking too…
H A DGraph.hpp58 std::atomic<int> ref_count; member in Cell
/oneTBB/include/oneapi/tbb/
H A Dparallel_invoke.h69 std::atomic<unsigned> ref_count{0};
98 __TBB_ASSERT(ref_count > 0, nullptr); in release()
100 if( --ref_count == 0 ) { in release()
107 ref_count.fetch_add(3, std::memory_order_relaxed); in execute()
117 if( ref_count > 0 ) { // detect children spawn in cancel()
H A Dparallel_scan.h124 if (parent->ref_count.fetch_sub(1) == 1) { in release_parent()
187 std::atomic<unsigned int> ref_count{0};
200 m_parent->ref_count.fetch_add(1); in sum_node()
208 m_parent->ref_count.fetch_sub(1); in ~sum_node()
216 if (parent->ref_count.fetch_sub(1) == 1) { in release_parent()
253 ref_count = (left_child != nullptr) + (right_child != nullptr); in execute()
291 std::atomic<unsigned int> ref_count{2};
295 …__TBB_ASSERT( m_result.ref_count.load() == static_cast<unsigned int>((m_result.m_left!=nullptr)+(m… in execute()
333 if (parent->ref_count.fetch_sub(1) == 1) { in release_parent()
374 if (parent->ref_count.fetch_sub(1) == 1) { in release_parent()
H A Dpartitioner.h121 node(node* parent, int ref_count) : in node()
122 my_parent{parent}, m_ref_count{ref_count} { in node()
123 __TBB_ASSERT(ref_count > 0, "The ref count must be positive");
137 tree_node(node* parent, int ref_count, small_object_allocator& alloc) in tree_node()
138 : node{parent, ref_count} in tree_node()
H A Dparallel_reduce.h71 …reduction_tree_node(node* parent, int ref_count, Body& input_left_body, small_object_allocator& al… in reduction_tree_node()
72 tree_node{parent, ref_count, alloc}, in reduction_tree_node()
236 …deterministic_reduction_tree_node(node* parent, int ref_count, Body& input_left_body, small_object… in deterministic_reduction_tree_node()
237 tree_node{parent, ref_count, alloc}, in deterministic_reduction_tree_node()
/oneTBB/include/oneapi/tbb/detail/
H A D_pipeline_filters.h331 std::atomic<std::intptr_t> ref_count;
336 filter_node() : ref_count(0), left(nullptr), right(nullptr) {
356 void add_ref() { ref_count.fetch_add(1, std::memory_order_relaxed); }
360 __TBB_ASSERT(ref_count>0,"ref_count underflow");
361 if( ref_count.fetch_sub(1, std::memory_order_relaxed) == 1 ) {
H A D_task.h134 …wait_context(std::uint32_t ref_count) : m_ref_count{ref_count} { suppress_unused_warning(m_version… in wait_context() argument