Home
last modified time | relevance | path

Searched refs:order (Results 1 – 25 of 35) sorted by relevance

12

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_node_set_impl.h32 namespace order {
107 node_set<order::following, FirstPredecessor, Predecessors...>
118 node_set<order::following, Predecessors...>
119 follows(node_set<order::undefined, Predecessors...>& predecessors_set) {
124 return node_set<order::following, Predecessors...>(predecessors_set);
128 node_set<order::preceding, FirstSuccessor, Successors...>
139 node_set<order::preceding, Successors...>
140 precedes(node_set<order::undefined, Successors...>& successors_set) {
145 return node_set<order::preceding, Successors...>(successors_set);
149 node_set<order::undefined, Node, Nodes...>
[all …]
H A D_waitable_atomic.h52 T load(std::memory_order order) const noexcept { in load() argument
53 return my_atomic.load(order); in load()
60 void wait(T old, std::uintptr_t context, std::memory_order order) { in wait() argument
61 auto wakeup_condition = [&] { return my_atomic.load(order) != old; }; in wait()
H A D_flow_graph_nodes_deduction.h110 struct decide_on_set<node_set<order::following, Node, Nodes...>> {
115 struct decide_on_set<node_set<order::preceding, Node, Nodes...>> {
164 join_node(const node_set<order::following, Predecessors...>&, Policy)
169 join_node(const node_set<order::preceding, Successor, Successors...>&, Policy)
173 join_node(const node_set<order::following, Predecessors...>)
178 join_node(const node_set<order::preceding, Successor, Successors...>)
190 indexer_node(const node_set<order::following, Predecessors...>&)
200 split_node(const node_set<order::following, Predecessor, Predecessors...>&)
204 split_node(const node_set<order::preceding, Successors...>&)
H A D_utils.h96 T spin_wait_while(const std::atomic<T>& location, C comp, std::memory_order order) { in spin_wait_while() argument
98 T snapshot = location.load(order); in spin_wait_while()
101 snapshot = location.load(order); in spin_wait_while()
109 T spin_wait_while_eq(const std::atomic<T>& location, const U value, std::memory_order order = std::…
110 return spin_wait_while(location, [&value](T t) { return t == value; }, order);
116 T spin_wait_until_eq(const std::atomic<T>& location, const U value, std::memory_order order = std::…
117 return spin_wait_while(location, [&value](T t) { return t != value; }, order);
/oneTBB/doc/main/tbb_userguide/
H A DNon-Linear_Pipelines.rst20 the filters into a linear order, like this:
25 parallelism is lost by forcing a linear order on the filters, but in
43 filters A, B, D and E above may need to be modified in order to properly
H A DLock_Pathologies.rst43 - Always acquire locks in the same order. For example, if you have
47 alphabetical order" in a situation where the locks have names. Or
48 if the locks are unnamed, acquire locks in order of the mutex’s
H A Dbroadcast_or_send.rst76 messages in the same order to all nodes or in the current priority order
87 order, by either f1 or f2.
91 values, and in priority order? You can easily create this behavior by
H A DUsing_Circular_Buffers.rst17 and items will be freed in the order that they were allocated. Hence by
22 not be retired in the same order they were allocated.
H A DWorking_on_the_Assembly_Line_pipeline.rst54 as they are written in the proper order to the output file. Though the
130 a serial in-order filter, each token must be processed serially in
131 order. In a parallel filter, multiple tokens can by processed in
155 serial in-order, or serial out-of-order.
188 write the chunks in the same order. All ``serial_in_order`` filters
189 process items in the same order. Thus if an item arrives at
190 ``MyOutputFunc`` out of the order established by ``MyInputFunc``, the
193 serial filter, ``serial_out_of_order``, that does not preserve order.
H A DWhen_Not_to_Use_Queues.rst14 first-in first-out order.
H A DGraph_Object.rst32 …Even when using smart pointers, be aware of the order of destruction for nodes and the graph to ma…
H A DMapping_Nodes2Tasks.rst36 messages in the order that they arrive. When all tasks are complete, the
H A Dconcurrent_vector_ug.rst34 necessarily return in the order that elements are appended to the
H A Duse_input_node.rst65 edges in reverse topological order; that is, make the edges at the
H A DConcurrent_Queue_Classes.rst56 those two values, they will be popped in the same order that they were
H A Dcommunicate_with_nodes.rst79 However, because there is cross-graph communication, the order of the
H A DTask-Based_Programming.rst19 - More efficient evaluation order
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DFenced_Data_Transfer.rst30 that preserves the order of a thread's operation from its viewpoint,
68 order to the receiver (thus breaking condition a) or the receiver's
69 reads to appear out of order (thus breaking condition b).
H A DLocal_Serializer.rst15 as tasks. The order of operations can be important. For example,
18 order of "select" and "delete" operations on the same buffer would be
32 serial order.
189 concurrency slightly. However, the presented order is recommended
H A DNon-Preemptive_Priorities.rst24 are based on the order in which tasks were spawned or enqueued, and
136 // Scan queues in priority order for an item.
H A DAgglomeration.rst23 Many algorithms permit parallelism at a very fine grain, on the order
76 If the loop is "small", on the order of less than 10,000 clock
H A DReference_Counting.rst108 Atomic increment/decrement can be more than an order of magnitude
/oneTBB/src/tbb/
H A Darena.h177 bool test(std::memory_order order = std::memory_order_acquire) {
178 return my_state.load(order) != UNSET;
/oneTBB/doc/main/intro/
H A Dlimitations.rst35 …lder, such as ``/usr/lib64``, the application may fail to link due to the order in which the linke…
/oneTBB/python/
H A DREADME.md14 …technique implemented in class Monkey, no source code change is needed in order to enable threadin…

12