Searched refs:decrement (Results 1 – 5 of 5) sorted by relevance
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Reference_Counting.rst | 47 except that the increment/decrement is done atomically, and the
48 decrement and test "count is zero?" must act as a single atomic
78 decrement, and then both read ``my_count`` as zero. Hence two callers
90 The decrement may need to have a *release* fence so that any pending
97 thus another thread might decrement the count to zero and delete the
108 Atomic increment/decrement can be more than an order of magnitude
109 more expensive than ordinary increment/decrement. The serial
110 optimization of eliminating redundant increment/decrement operations
|
| H A D | Wavefront.rst | 51 decrement the counters of its successors. If a successor's counter
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | use_limiter_node.rst | 25 a message can be sent to the decrement port on the ``limiter_node`` to
26 decrement the count, allowing additional messages to pass through. In
70 make_edge( f, l.decrement );
81 decrement port of the ``limiter_node``. So, after it completes executing,
|
| /oneTBB/examples/parallel_for_each/parallel_preorder/ |
| H A D | README.md | 12 1. Atomically decrement the successor's ref_count
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | flow_graph.h | 1895 threshold_regulator< limiter_node<T, DecrementType>, DecrementType > decrement; variable
2002 … static_cast<receiver<input_type> *>(this), static_cast<receiver<DecrementType> *>(&decrement), in initialize()
2011 my_predecessors(this), my_successors(this), decrement(this) in limiter_node()
2028 receiver<DecrementType>& decrementer() { return decrement; } in decrementer()
2132 decrement.reset_receiver(f); in reset_node()
|