Home
last modified time | relevance | path

Searched refs:graph_task (Results 1 – 11 of 11) sorted by relevance

/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_impl.h35 class graph_task; variable
36 static graph_task* const SUCCESSFULLY_ENQUEUED = (graph_task*)-1;
119 graph_task* prioritize_task(graph& g, graph_task& arena_task);
149 friend graph_task* prioritize_task(graph& g, graph_task& gt);
153 bool operator()(const graph_task* left, const graph_task* right) { in operator()
194 graph_task* my_task;
207 graph_task* my_first;
208 graph_task** my_next_ptr;
355 friend graph_task* prioritize_task(graph& g, graph_task& arena_task);
367 this->~graph_task(); in destruct_and_deallocate()
[all …]
H A D_flow_graph_node_impl.h160 graph_task* bypass_t;
171 graph_task* perform_queued_requests() { in perform_queued_requests()
172 graph_task* new_task = nullptr; in perform_queued_requests()
311 graph_task* forward_task() { in forward_task()
313 graph_task* rval = nullptr; in forward_task()
326 inline graph_task* create_forward_task() { in create_forward_task()
339 graph_task* tp = create_forward_task(); in spawn_forward_task()
403 graph_task* postponed_task = nullptr; in apply_body_impl_bypass()
531 graph_task* ttask = nullptr;
668 graph_task* execute() override {
[all …]
H A D_flow_graph_body_impl.h249 class forward_task_bypass : public graph_task {
254 ) : graph_task(g, allocator, node_priority),
258 graph_task* next_task = my_node.forward_task();
276 class apply_body_task_bypass : public graph_task {
283 ) : graph_task(g, allocator, node_priority),
304 class input_node_task_bypass : public graph_task {
308 : graph_task(g, allocator), my_node(n) {}
311 graph_task* next_task = my_node.apply_body_bypass( );
339 graph_task* try_put_task( const DecrementType& value ) override {
340 graph_task* result = my_node->decrement_counter( value );
[all …]
H A D_flow_graph_cache_impl.h270 virtual graph_task* try_put_task( const T& t ) = 0;
329 virtual graph_task* try_put_task( const continue_msg& t ) = 0;
346 graph_task* try_put_task( const T &t ) override { in try_put_task()
347 graph_task * last_task = nullptr; in try_put_task()
351 graph_task *new_task = (*i)->try_put_task(t); in try_put_task()
375 graph_task * new_task = (*i)->try_put_task(t); in gather_successful_try_puts()
414 graph_task* try_put_task( const T &t ) override { in try_put_task()
418 graph_task* new_task = (*i)->try_put_task(t); in try_put_task()
H A D_flow_graph_indexer_impl.h34 graph_task* do_try_put(const T &v, void *p) { in do_try_put()
44 … graph_task* (*indexer_node_put_task)(const T&, void *) = do_try_put<IndexerNodeBaseType, T, N-1>; in set_indexer_node_pointer()
55 … graph_task* (*indexer_node_put_task)(const T&, void *) = do_try_put<IndexerNodeBaseType, T, 0>;
64 typedef graph_task* (* forward_function_ptr)(T const &, void* );
78 graph_task* try_put_task(const T &v) override {
127 graph_task* bypass_t;
189 graph_task* try_put_task(output_type const *v) { // not a virtual method in this class
H A D_flow_graph_join_impl.h43 virtual graph_task* decrement_port_count() = 0;
293 graph_task* try_put_task( const T & ) override {
384 graph_task* bypass_t;
413 graph_task* rtask = nullptr;
450 graph_task* try_put_task(const T &v) override {
598 graph_task* rtask = nullptr;
695 graph_task* decrement_port_count() override {
862 graph_task* bypass_t;
880 graph_task* rtask = nullptr;
1054 graph_task* bypass_t;
[all …]
/oneTBB/include/oneapi/tbb/
H A Dflow_graph.h167 static inline std::pair<graph_task*, graph_task*> order_tasks(graph_task* first, graph_task* second… in order_tasks()
174 static inline graph_task* combine_tasks(graph& g, graph_task* left, graph_task* right) { in combine_tasks()
247 graph_task *res = try_put_task(t); in try_put()
349 graph_task* res = execute(); in try_put_task()
372 virtual graph_task* execute() = 0;
724 graph_task* create_put_task() { in __TBB_requires()
741 graph_task* apply_body_bypass( ) { in __TBB_requires()
1175 graph_task* ltask;
1251 virtual graph_task *forward_task() { in forward_task()
1931 graph_task* forward_task() { in forward_task()
[all …]
/oneTBB/test/tbb/
H A Dtest_limiter_node.cpp42 using tbb::detail::d1::graph_task;
51 graph_task* try_put_task( const T &v ) override { in try_put_task()
53 return const_cast<graph_task*>(SUCCESSFULLY_ENQUEUED); in try_put_task()
69 graph_task* try_put_task( const T &/*v*/ ) override { in try_put_task()
71 return const_cast<graph_task*>(SUCCESSFULLY_ENQUEUED); in try_put_task()
H A Dtest_input_node.cpp33 using tbb::detail::d1::graph_task;
58 graph_task* try_put_task( const T &v ) override { in try_put_task()
61 return const_cast<graph_task*>(SUCCESSFULLY_ENQUEUED); in try_put_task()
H A Dtest_broadcast_node.cpp34 using task = TBB_INTERNAL_NAMESPACE::graph_task;
/oneTBB/test/common/
H A Dgraph_utils.h280 tbb::detail::d1::graph_task *try_put_task( const T & ) override {
282 return const_cast<tbb::detail::d1::graph_task*>(SUCCESSFULLY_ENQUEUED);
326 tbb::detail::d1::graph_task* try_put_task( const T &t ) override {
332 return const_cast<tbb::detail::d1::graph_task*>(SUCCESSFULLY_ENQUEUED);