| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Flow_Graph_Single_Vs_Broadcast.rst | 3 Flow Graph Basics: Single-push vs. Broadcast-push
12 - **single-push**: No matter how many successors to the node exist and
15 - **broadcast-push**: A message will be pushed to every successor which
16 is connected to the node by an edge in push mode, and which accepts
53 // single-push policy
68 // broadcast-push policy
89 after single-push test, g_cnt == 3, b1==3, b2==0, b3==0
90 after broadcast-push test, g_cnt == 9, b1==3, b2==3, b3==3
93 The single-push test uses a ``buffer_node``, which has a "single-push"
100 The broadcast-push test uses a ``broadcast_node``, which will push any
[all …]
|
| H A D | Concurrent_Queue_Classes.rst | 9 push and pop elements from the queue. The queue is unbounded and has no
10 blocking operations. The fundamental operations on it are ``push`` and
11 ``try_pop``. The ``push`` operation works just like ``push`` for a
74 - ``push(item)`` waits until it can succeed without exceeding the
85 The value of concurrent_queue::size() is defined as the number of push
98 causes ``push`` to block until there is room in the queue. Bounded
|
| H A D | Flow_Graph_Buffering_in_Nodes.rst | 10 the message by that node. As noted in the section on Single-push vs.
11 Broadcast-push, a message may be passed to one or to multiple
16 There are times when a node cannot successfully push a message to any
41 node will attempt to push a stored message to the new successor.
|
| H A D | Flow_Graph_Reservation.rst | 23 - When a node connected to a reserving ``join_node`` in push state
24 tries to push a message, the ``join_node`` always rejects the push
28 edge to push state, and tries to reserve the next node connected by
33 messages and try to push the resulting message to any nodes connected
45 Because the reserving ``join_node`` will only attempt to push when each
47 to create and push a message if all input ports succeed reserving
54 output edge from push to pull mode. ``broadcast_nodes`` do not buffer
231 the push succeeded, ``jn`` signals ``buf1`` and ``buf2`` that the
237 to ``jn`` is in push state.
|
| H A D | Flow_Graph_Message_Passing_Protocol.rst | 13 not reverse from push to pull, the predecessor node would have to
25 switch from pull to push mode.
35 **The dynamic push / pull protocol.**
|
| H A D | broadcast_or_send.rst | 7 An important characteristic of the predefined nodes is whether they push
9 following predefined nodes push messages to a single successor:
18 Other nodes push messages to all successors that will accept them.
21 The nodes that push to only a single successor are all buffer nodes.
84 nodes push each message to only one successor. And, you can use this
|
| /oneTBB/test/common/ |
| H A D | concurrent_priority_queue_common.h | 49 static void push(Q& q, T&& t) { in push() function
50 q.push(std::forward<T>(t)); in push()
57 q.push(std::move(t)); in push()
114 q2.push(*it); in type_tester()
121 q3.push(*it); in type_tester()
174 q14.push(*it); in type_tester()
179 q15.push(*it); in type_tester()
215 q1.push(value_type(new T(item))); in type_tester_unique_ptr()
216 q1_copy.push(value_type(new T(item))); in type_tester_unique_ptr()
237 case 0: q.push(e); break; in push_selector()
[all …]
|
| H A D | vector_types.h | 33 #pragma warning (push)
38 #pragma GCC diagnostic push
|
| /oneTBB/test/conformance/ |
| H A D | conformance_concurrent_queue.cpp | 148 queue.push(f); in TestClear()
158 queue.push( f); in TestClear()
168 queue.push(f); in TestClear()
243 queue.push(f); in TestIterator()
1728 q1.push(obj); in TestMoveQueue()
1734 q2.push(obj); in TestMoveQueue()
1789 q1.push(obj); in TestMoveQueueUnequal()
1853 src.push(v); in test_move_assignment_test_unequal()
1854 src.push(v); in test_move_assignment_test_unequal()
1868 src_bnd.push(v); in test_move_assignment_test_unequal()
[all …]
|
| H A D | conformance_collaborative_call_once.cpp | 19 #pragma warning( push )
|
| /oneTBB/test/tbb/ |
| H A D | test_concurrent_queue.cpp | 39 queue.push(T(k)); in operator ()()
55 queue.push(exemplar); in TestPrimitiveTypes()
80 q1.push(bar); in TestVectorTypes()
176 src_queue.push(i);
183 queue1.push(1); in __anon525151d10202()
|
| H A D | test_concurrent_priority_queue.cpp | 135 for (std::size_t i = 0; i < 42; ++i) src_q.push(elem); in test_exceptions()
204 c1.push(data1); in test_scoped_allocator()
205 c2.push(std::move(data2)); in test_scoped_allocator()
|
| H A D | test_resumable_tasks.cpp | 52 m_tagQueue.push(nullptr); in ~AsyncActivity()
64 m_tagQueue.push(ctx); in submit()
200 m_tagQueue.push(nullptr); in ~EpochAsyncActivity()
212 m_tagQueue.push(ctx); in submit()
|
| H A D | test_openmp.cpp | 50 #pragma warning( push )
101 #pragma clang diagnostic push
|
| H A D | test_concurrent_queue_whitebox.cpp | 53 q.push(elem); in operator ()()
|
| /oneTBB/src/tbb/ |
| H A D | task.cpp | 60 a.my_resume_task_stream.push(&sp->m_resume_task, random_lane_selector(sp->m_random)); in resume()
64 a.my_critical_task_stream.push(&sp->m_resume_task, random_lane_selector(sp->m_random)); in resume()
176 td->my_arena->my_co_cache.push(to_cleanup); in do_post_resume_action()
|
| H A D | task_dispatcher.cpp | 69 proxy->outbox->push(proxy); in spawn()
94 a->my_critical_task_stream.push( &t, subsequent_lane_selector(slot->critical_hint()) ); in submit()
106 a->my_critical_task_stream.push( &t, lane_selector ); in submit()
111 a->my_fifo_task_stream.push( &t, lane_selector ); in submit()
|
| H A D | assert_impl.h | 68 #pragma warning (push) in assertion_failure()
|
| /oneTBB/include/oneapi/tbb/ |
| H A D | concurrent_queue.h | 91 push(*begin); in concurrent_queue()
187 void push(const T& value) { in push() function
191 void push(T&& value) { in push() function
246 …my_queue_representation->choose(k).push(k, *my_queue_representation, my_allocator, std::forward<Ar… in internal_push()
369 push(*begin); in concurrent_bounded_queue()
466 void push( const T& value ) { in push() function
470 void push( T&& value ) { in push() function
579 …my_queue_representation->choose(ticket).push(ticket, *my_queue_representation, my_allocator, std::… in internal_push()
595 …my_queue_representation->choose(ticket).push(ticket, *my_queue_representation, my_allocator, std::… in internal_push_if_not_full()
|
| /oneTBB/examples/test_all/fibonacci/ |
| H A D | fibonacci.cpp | 126 Q.push(Matrix1110); in SerialQueueFib()
135 Q.push(A * B); in SerialQueueFib()
285 Queue.push(Matrix1110); in operator ()()
301 queue->push(m1); // and push back in operator ()()
309 Queue.push(Matrix1110); in ParallelPipeFib()
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | shortpath.cpp | 141 bool push = false; in shortpath_helper() local
149 push = true; in shortpath_helper()
152 if (push) { in shortpath_helper()
153 open_set.push(std::make_pair(v, new_f_v)); in shortpath_helper()
|
| /oneTBB/src/tbb/tools_api/ |
| H A D | ittnotify_types.h | 44 #pragma pack(push, 8)
|
| /oneTBB/test/tbbmalloc/ |
| H A D | test_malloc_new_handler.cpp | 31 #pragma warning (push)
|
| H A D | test_malloc_shutdown_hang.cpp | 93 #pragma warning (push)
|
| /oneTBB/cmake/android/ |
| H A D | environment.cmake | 30 …execute_process(COMMAND ${adb_executable} push --sync ${data_path} ${ANDROID_DEVICE_TESTING_DIRECT…
|